diff --git a/parse/train/1_gaHBaRYt/1_gaHBaRYt.md b/parse/train/1_gaHBaRYt/1_gaHBaRYt.md new file mode 100644 index 0000000000000000000000000000000000000000..b720ca8712a79ce90f92c0776f03cfb5da00e7ab --- /dev/null +++ b/parse/train/1_gaHBaRYt/1_gaHBaRYt.md @@ -0,0 +1,358 @@ +# Fast Federated Learning in the Presence of Arbitrary Device Unavailability + +Xinran Gu∗ IIIS Tsinghua University gxr21@mails.tsinghua.edu.cn + +Kaixuan Huang∗ ECE Princeton University kaixuanh@princeton.edu + +Jingzhao Zhang EECS Massachusetts Institute of Technology jzhzhang@mit.edu + +Longbo Huang† IIIS Tsinghua University longbohuang@tsinghua.edu.cn + +# Abstract + +Federated Learning (FL) coordinates with numerous heterogeneous devices to collaboratively train a shared model while preserving user privacy. Despite its multiple advantages, FL faces new challenges. One challenge arises when devices drop out of the training process beyond the control of the central server. In this case, the convergence of popular FL algorithms such as FedAvg is severely influenced by the straggling devices. To tackle this challenge, we study federated learning algorithms under arbitrary device unavailability and propose an algorithm named Memory-augmented Impatient Federated Averaging (MIFA). Our algorithm efficiently avoids excessive latency induced by inactive devices, and corrects the gradient bias using the memorized latest updates from the devices. We prove that MIFA achieves minimax optimal convergence rates on non-i.i.d. data for both strongly convex and non-convex smooth functions. We also provide an explicit characterization of the improvement over baseline algorithms through a case study, and validate the results by numerical experiments on real-world datasets. + +# 1 Introduction + +Federated learning is a machine learning setting in which a central server coordinates with a large number of devices to collectively train a shared model [28, 34, 20, 33, 25, 26]. Practical advantages of this training scheme are mainly twofold. First, each device keeps the private data locally and hence preserves its data privacy. Second, federated learning can make use of idle computing resources and lower computation costs. Although federated learning successfully scales up with data sizes and accelerates training via more affordable computing power [43, 38, 36], the collaborative setup leads to new challenges due to large variations among individual computing devices. Our work aims to formulate and investigate the impact of device variations on FL from an optimization perspective. + +In FL, a device can differ from its peers in multiple aspects [17, 25]. First, the data distribution and local task can be different among devices. To address the data variation, non-i.i.d. objective models were proposed and analyzed by [26, 18, 19, 42, 25]. We follow this line of work and formulate our optimization objective as a sum of stochastic functions on individual devices (See Eqn. (1)). + +A second variation among devices is caused by different computing and communication speeds. One natural way to formulate the variation in computation speeds is to allow asynchronous updates and model the updates as delayed responses. Lots of novel research has studied the problem with different delay models, e.g., [35, 4, 27, 11, 45, 1, 5, 13]. However, the delayed setup assumes that all devices make roughly the same number of (delayed) responses in the end. This behavior may deviate largely from the FL practice, where each device, e.g., personal cell phones, can have very different active duration when participating in the FL training, and hence make different numbers of responses. For this reason, our work aims to address this third discrepancy among devices caused by individual availability patterns. + +The third device heterogeneity caused by different availability patterns is less studied in optimization for federated learning problems. In this model, instead of making a delayed response, devices can abort the training halfway, e.g., due to battery level, incoming calls, etc, and fail to return their responses upon the central server’s requests [28, 7, 17]. To handle missing responses, researchers propose algorithms where the central server may collect responses from only a fraction of the devices and make updates [18, 28, 42, 25, 26, 17, 30, 14]. + +Previous works on collecting responses from a fraction of devices can be divided into two categories. When the response distribution is known, one could collect only the fastest responses and re-weight according to their response probability [17, 26, 30]. This model can be restrictive, as in practice, the exact distribution may not be available and may evolve. Another line of work assumes that the server can arbitrarily decide and sample a set of devices to collect responses accordingly in every communication round [18, 28, 42, 25, 14]. This model does not require knowing the response possibility. However, the response time can be very long if the selected subset contains unavailable devices. + +In this work, we address the above limitations by studying federated learning in the presence of arbitrary device unavailability. Within this practical setup, we propose an algorithm that automatically accommodates for the underlying unavailability and allows patterns of the device unavailability to be non-stationary and even adversarial. Furthermore, our algorithm can achieve optimal convergence rates in the presence of device inactivity and automatically reduce to best-known rates if all devices are active. Our contributions are summarized as follows. + +• We investigate the federated learning problem with a practical formulation of device participation, which does not require each device to be online according to an (either known or unknown) distribution. • We propose the Memory-augmented Impatient Federated Averaging (MIFA) algorithm that is agnostic to the availability pattern. It efficiently avoids excessive latency induced by inactive devices, successfully exploits the information about the descent direction in stale and noisy gradients, and corrects the gradient bias using the memorized latest updates. • We prove that MIFA achieves minimax optimal convergence rates $\begin{array} { r } { \mathcal { O } \left( \frac { \bar { \tau } _ { T } + 1 } { N K T } \right) } \end{array}$ for smooth, strongly convex functions, and $\mathcal { O } \left( \sqrt { \frac { \bar { \nu } + 1 } { N K T } } \right)$ for smooth, non-convex functions, and establish matching lower bounds. Here, $N , K$ and $T$ stand for the number of devices, local updates and communication rounds respectively. $\bar { \tau } _ { T }$ and $\bar { \nu }$ characterize how actively devices participate in training (see formal definitions in Sections 3, 5 and 6). MIFA also achieves optimal convergence rates in the ideal case when all devices are active. • We provide an explicit characterization of the improvement over baseline algorithms through a case study and empirically verify our results on real-world datasets. + +# 2 Related work + +Federated learning. Federated Averaging (FedAvg) was first proposed in [28]. [26, 19, 18, 42] provided convergence analysis for FedAvg on non-i.i.d. data and quantified how data heterogeneity degrades the convergence rate. Several variants of FedAvg were designed to deal with data heterogeneity. FedProx [25] adds a proximal term to local objective functions, while FSVRG [21] and SCAFFOLD [18] employ variance reduction techniques. + +One line of work focused on variations in computation capabilities among devices [39, 31, 40]. These models assume that responses are delayed but not missing. To address the missing response, some work assumes that the server can actively sample a subset of devices to respond [18, 28, 42, 25, 14] or that the pattern of device availability is known [26, 17, 10, 30]. These results do not generalize to adversarial inactive patterns. [32] discussed the impact of device inactivity on convergence but their proposed algorithm diverges if there exists an inactive device in each round of communication. However, our setup allows adversarial patterns under certain non-distributional assumptions (see Section 5) while our proposed algorithm still achieves convergence. + +Asynchronous distributed optimization. Our work is related to literature in the field of traditional asynchronous distributed optimization in that our proposed algorithm uses stale gradients. The problem setup for asynchronous distributed algorithms can be divided into two categories [13]. One is the shared-data (i.i.d.) setting, where all workers can access the whole dataset. In this setting, the local gradient is an unbiased estimator of the global gradient [35, 4, 27, 11, 45, 1]. In contrast, we assume each worker has non-i.i.d. data, and hence the local stochastic gradient can not be viewed as an unbiased estimator of the global gradient. + +The other less studied setting in distributed optimization is the distributed-data setting (non-i.i.d.), where data are partitioned among workers. Specifically, [5] proposed an asynchronous incremental aggregated gradient algorithm that uses buffered gradients to update the global model. Unlike our setup, this algorithm evaluates full local gradients, performs only one local step, and was analyzed under the bounded delay assumption. [13] models the delay as stochastic and assumes that the server has knowledge of the distribution, but our formulation is distribution-free. [6] allows workers to perform multiple local steps and communicate with the server at different times, but the authors assume that all workers are available and compute at the same rate. + +Comparison with an independent work. While preparing the manuscript, we were unaware of an independent work [41] that investigated the same setup and proposed a similar algorithm called FedLaAvg. Their main theorem established the convergence rate of $\mathcal { O } \left( \sqrt { \frac { \nu _ { \mathrm { m a x } } } { N ^ { 0 . 5 } T } } ( \mathbf { \bar { G } } ^ { 2 } + \sigma ^ { 2 } ) \right)$ for smooth and non-convex problems, where $G ^ { 2 }$ is the uniform upper bound for the squared norm of stochastic gradients and $\nu _ { m a x }$ is the maximum number of inactive rounds. In comparison, we prove the minimax optimal rate of $\mathcal { O } ( \sqrt { \frac { \bar { \nu } } { N K T } } \sigma ^ { 2 } )$ without the bounded gradient assumption, also improving $\nu _ { \mathrm { m a x } }$ to $\bar { \nu }$ . Furthermore, our result achieves a linear speedup in $N$ and $K$ . + +Apart from non-convex functions, we also derive the minimax optimal rates for strongly convex smooth functions under the mild assumption that allows for arbitrary and unbounded number of inactive rounds. Both of our results achieve linear speedups in terms of $N$ and $K$ , and automatically recover the best-known rates of FedAvg when all devices are active. We also show that our proposed algorithm achieves acceleration over unbiased baseline algorithms in the presence of stragglers. + +# 3 Problem Setup + +We consider optimizing the following problem in a Federated Learning setting: + +$$ +\begin{array} { r } { \underset { w \in \mathbb { R } ^ { d } } { \operatorname* { m i n } } f ( w ) : = \frac { 1 } { N } \sum _ { i = 1 } ^ { N } f _ { i } ( w ) : = \frac { 1 } { N } \sum _ { i = 1 } ^ { N } \mathbb { E } _ { \xi _ { i } } [ f _ { i } ( w , \xi _ { i } ) ] , } \end{array} +$$ + +where $w$ is the optimization variable, e.g., parameters of a machine learning model, $N$ is the number of participating devices, $f _ { i }$ is the local loss function on device $i$ , and $\xi _ { i }$ describes the randomness in local data distribution. + +In the ideal federated learning setup (see Figure 1 (a)), all devices return responses within similar time, and hence the central server collects all the local updates. In this case, the computation cost is usually measured by the number of local stochastic oracle evaluations, which is proportional to the number of rounds. In a delayed FL setup (see Figure 1 (b)), devices are always active upon the central server’s request but may return responses with a delay. Here, all devices return almost the same number of responses in the long term. + +As we discussed, the above setups do not depict a real-world scenario in which a device can have a longer inactive duration than active duration. In such cases, the communication interval is much longer than the local computation time required for each update, and each device generates an unequal number of responses [28, 17]. This motivates our setup in Figure 1 (c). + +![](images/dbec5db87e22ee0dc55043253dc815eff5fd652c994f67ee8a04489f10ef06e1.jpg) +Figure 1: An illustration of setup. (a) Ideal setup: all devices return their responses within similar time. (b) Delayed setup: all devices are available, but may return responses with a delay. (c) Our setup: devices can be unavailable arbitrarily, and the communication interval is long enough for active devices to return responses. + +In our proposed setup, we use $t$ to index the global communication rounds. We say a device participates or is active at round $t$ if it can complete the computation task and send back the update at the end of round $t$ . We define $\boldsymbol { \mathcal { A } } ( t )$ as the set of all active devices at round $t$ . Notice that we make no assumptions on the distribution of the participation patterns of devices and allow them to be arbitrary. + +Directly applying FedAvg to the proposed setup can be problematic due to the existence of inactive devices. To accommodate for inactive devices, we discuss three natural variants of FedAvg and their limitations. The detailed algorithms can be found in Appendix A. + +• Biased FedAvg. At each communication round, the global model is updated with a direct average of local updates from the active devices. This naive approach induces bias when data distribution and response patterns vary among devices. +• FedAvg with device sampling. The server selects a subset of $S$ devices randomly without replacement, and then waits until all devices in the subset $s$ respond. This is how original FedAvg [28] addresses device unavailability. Note that over $T$ communication rounds, the global model is updated less than $T$ times due to waiting. This approach is prone to stragglers and we refer the readers to Section 5.1 for a detailed discussion. +• FedAvg with importance sampling [26, 13, 17]. The local updates from the active devices are weighted by the reciprocal of the participation probabilities to avoid bias. This approach is only applicable when the response of each device is i.i.d. over rounds and it requires the knowledge of participation probabilities. + +# 4 Memory-augmented Impatient Federated Averaging (MIFA) + +In this section, we introduce our algorithm — Memory-augmented Impatient Federated Averaging (MIFA). MIFA maintains an update-array $\{ G ^ { i } \}$ in the memory that stores the latest updates for all devices. As the name suggests, MIFA has two components. First, the algorithm is impatient and avoids waiting for any specific device when facing heterogeneous devices with arbitrary availability. Second, the algorithm augments the received updates of the active devices with the stored updates of the inactive devices to perform averaging. + +Specifically, at the beginning of round $t$ , the server broadcasts the latest model parameter $w _ { t }$ to all active devices $\boldsymbol { \mathcal { A } } ( t )$ . After receiving $w _ { t }$ , each active device, say, the $i$ -th device, sets $w _ { t , 0 } ^ { i } = w _ { t }$ and performs $K$ steps of SGD with respect to the local objective function to get $w _ { t , K } ^ { i }$ : + +$$ +\boldsymbol w _ { t , k + 1 } ^ { i } = \boldsymbol w _ { t , k } ^ { i } - \eta _ { t } \tilde { \nabla } f _ { i } ( \boldsymbol w _ { t , k } ^ { i } ) , \boldsymbol k = 0 , \cdots , \boldsymbol K - 1 , +$$ + +where $\eta _ { t }$ is the learning rate and $\tilde { \nabla } f _ { i } ( w _ { t , k } ^ { i } )$ is the stochastic gradient evaluated on device $i$ . Next, the server stores the received update $\begin{array} { r } { \frac { 1 } { \eta _ { t } } \big ( w _ { t } - w _ { t , K } ^ { i } \big ) } \end{array}$ in $G ^ { i }$ . Denote by $\{ G _ { t } ^ { i } \}$ the update-array after round $t$ , then we have + +$$ +\begin{array} { r } { G _ { t } ^ { i } = \left\{ \begin{array} { l l } { G _ { t - 1 } ^ { i } , } & { \mathrm { ~ i f ~ } i \notin \mathcal { A } ( t ) , } \\ { \frac { 1 } { \eta _ { t } } ( w _ { t } - w _ { t , K } ^ { i } ) , } & { \mathrm { ~ i f ~ } i \in \mathcal { A } ( t ) . } \end{array} \right. } \end{array} +$$ + +At the end of round $t$ , the server updates the global model with the average of $\{ G _ { t } ^ { i } \}$ (line 9). In other words, our algorithm MIFA updates the model with the latest available accumulated gradients for all devices. + +Algorithm 1 Memory-augmented Impatient Federated Averaging (MIFA) + +
1: Input: initial wi,learning rate {nt }
2: Server executes:1: DeviceUpdate(i, Wt , nt):
3: initialize Gi ←O,i∈[N]2:w,←Wt
4: fort=1,.,T-1do3: for local step k = O,.,K -1 do
5: broadcast wt to all active devices i ∈ A(t) 4:compute stochastic gradient Vfi(wt,)
6: for each active device idoWk+1←W,k-ntvfi(w,) 5:
7: G ←DeviceUpdate(i,Wt, nt) 8: end for6: end for
Wt+1←wt-∑1 N 9: Gi7:Return (wt - wi,k) to the server
+ +MIFA efficiently progresses without waiting for inactive devices and re-uses their latest updates as the surrogate for missing responses. Being impatient accelerates convergence, whereas memory augmentation corrects the update bias. Our algorithm differs from asynchronous algorithms in traditional distributed optimization [35, 4, 27, 11, 45, 1, 13, 6] in that we utilize the noisy updates of inactive devices more than once to avoid biasing against stragglers. In the following part of the paper, we show that MIFA successfully exploits information about the descent direction contained in the stale and noisy gradients. + +Discussion on implementation. In practice, to implement MIFA, the server needs to maintain a huge array to store the latest update for each device, which scales with the model size and the total number of devices. To avoid exhausting the server’s memory, one strategy is to distribute the memory consumption among devices. Specifically, each device, say the $i$ -th, stores its previous update $G _ { t _ { i } ^ { \prime } } ^ { \ i }$ computed at round $t _ { i } ^ { \prime }$ in its local memory. When it becomes active and computes $G _ { t } ^ { i }$ , the device sends $G _ { t } ^ { i } - G _ { t _ { i } ^ { \prime } } ^ { i }$ to the server, which is the difference between the current update and the previous one. In this case, the server only needs to maintain the average $\bar { G }$ in the memory and updates it by $\begin{array} { r } { \bar { G } _ { t } = \bar { G } _ { t - 1 } + \frac { 1 } { N } \sum _ { i \in \mathcal { A } ( t ) } ( G _ { t } ^ { \bar { i } } - G _ { t _ { i } ^ { \prime } } ^ { i } ) } \end{array}$ at round $t$ . Then the server updates the global model by $w _ { t + 1 } = w _ { t } - \eta _ { t } \bar { G } _ { t }$ . + +# 5 Convergence Analysis for strongly convex objective functions + +In this section, we present the convergence results for MIFA on $\mu$ -strongly convex $L$ -smooth functions. Typical examples for the strongly convex case are $\ell _ { 2 }$ regularized logistic regression and linear regression problems. + +In order to capture how the unavailability of devices affects algorithm performance, we introduce the following notion to quantify the dynamics of devices in our setting. + +Definition 5.1 (Number of inactive rounds). We define the number of inactive rounds of device $i$ at round $t$ as $\tau ( t , i ) = t - \operatorname* { m a x } \{ t ^ { \prime } \mid t ^ { \prime } \leq t , i \in A ( t ^ { \prime } ) \}$ , which is the difference between current round $t$ and the latest round when device $i$ is active. + +It can be seen that $\tau ( t , i ) = 0$ if device $i$ is active at round $t$ and $\tau ( t , i ) = \tau ( t - 1 , i ) + 1$ otherwise. Also, $t - \tau ( t , i )$ is the latest round when the device $i$ is active. Next, we present the assumptions made for establishing our convergence theorem. + +Assumption 1. $f _ { 1 } , \cdots , f _ { N }$ are all $L$ -smooth, i.e., for all $w$ and $v _ { \scriptscriptstyle { i } }$ , $\begin{array} { r c l } { f _ { i } ( v ) } & { \leq } & { f _ { i } ( w ) \ + } \end{array}$ $\begin{array} { r } { \left. \nabla f _ { i } ( w ) , v - w \right. + \frac { L } { 2 } \left\| w - v \right\| ^ { 2 } } \end{array}$ . + +Assumption 2. $\tilde { \nabla } f _ { i } ( \boldsymbol { w } )$ is an unbiased estimator of $\nabla f _ { i }$ with variance bounded by $\sigma ^ { 2 }$ , i.e., $\mathbb { E } _ { \boldsymbol { \xi } } \left[ \tilde { \nabla } f _ { i } ( \boldsymbol { w } ) \right] = \nabla f _ { i } ( \boldsymbol { w } ) , \mathbb { E } _ { \boldsymbol { \xi } } \left[ \left\| \tilde { \nabla } f _ { i } ( \boldsymbol { w } ) - \nabla f _ { i } ( \boldsymbol { w } ) \right\| ^ { 2 } \right] \leq \sigma ^ { 2 } .$ . + +Assumption 3. $f _ { 1 } , \cdots , f _ { N }$ are all $\mu$ -strongly convex: for all $w$ and $v _ { \scriptscriptstyle { i } }$ , $f _ { i } ( v ) \geq f _ { i } ( w ) +$ $\begin{array} { r } { \left. \nabla f _ { i } ( w ) , v - w \right. + \frac { \mu } { 2 } \left\| w - v \right\| ^ { 2 } } \end{array}$ . + +Assumption 4. There exists a constant $t _ { 0 } > 0$ , such that for all $t \geq 1$ and $i \in [ N ]$ , the number of inactive rounds of device $i$ at communication round $t$ satisfies $\begin{array} { r } { \tau ( t , i ) \leq t _ { 0 } + \frac { 1 } { b } \dot { t } } \end{array}$ , where $b =$ $4 0 \left( L / \mu \right) ^ { 1 . 5 }$ . + +Assumptions 1, 2, and 3 are standard and common in the FL literature, e.g., [26, 18, 19, 42, 36]. In Assumption 2, we relax the bounded gradient assumption that is often required in prior work, e.g., [6, 26, 40, 1]. Lastly, Assumption 4 is a very mild assumption on device availability, since it allows the number of inactive rounds to grow as ${ \mathcal { O } } ( t )$ . In contrast, existing results on asynchronous updates mostly assume a bounded or fixed latency, e.g., [6, 1, 5, 40, 35, 4]. + +We are now ready to present our first convergence result. Define $\begin{array} { r l } { D = } & { { } \frac { 1 } { N } \sum _ { i = 1 } ^ { N } \left. \nabla f _ { i } ( w _ { * } ) \right. ^ { 2 } } \end{array}$ to measure data dissimilarity, where $w _ { * } = \arg \operatorname* { m i n } f ( w )$ is the global optimum. Also, define $\bar { \tau } _ { T }$ and $\tau _ { \operatorname* { m a x } , T }$ to be the average and maximum numbers of inactive rounds $\tau ( t , i )$ across all devices and rounds, respectively. That is, + +$$ +\bar { \tau } _ { T } = \frac { 1 } { N ( T - 1 ) } \sum _ { t = 1 } ^ { T - 1 } \sum _ { i = 1 } ^ { N } \tau ( t , i ) , \tau _ { \operatorname* { m a x } , T } = \operatorname* { m a x } _ { i \in [ N ] } \operatorname* { m a x } _ { 1 \leq t \leq T - 1 } \tau ( t , i ) . +$$ + +The following theorem summarizes the performance of MIFA in this case. + +Theorem 5.1. Assume that Assumptions $^ { l }$ to 3 hold. Further assume that the device availability sequence $\tau ( t , i )$ satisfies Assumption $^ { 4 }$ and $\tau ( 1 , i ) = 0$ for all $i \in [ N ]$ . By setting the learning rate $\begin{array} { r } { \eta _ { t } = \frac { 4 } { \mu K ( t + a ) } } \end{array}$ with $a = \operatorname* { m a x } \{ 1 0 0 , 4 0 t _ { 0 } \} ( L / \mu ) ^ { 1 . 5 }$ , after $T - 1$ communication rounds, MIFA satisfies: + +$$ +\mathbb { E } _ { \xi } \left[ f ( \overline { { w } } _ { T } ) \right] - f ( w _ { * } ) = \mathcal { O } \left( \frac { \bar { \tau } _ { T } + 1 } { \mu N K T } \sigma ^ { 2 } + \frac { \tau _ { \operatorname* { m a x } , T } ^ { 2 } A _ { 1 } + ( K - 1 ) ^ { 2 } A _ { 2 } + A _ { 3 } } { \mu ^ { 2 } T ^ { 2 } } \right) , +$$ + +where $\overline { { w } } _ { T }$ is a weighted average of $w _ { t }$ defined as: + +$$ +\overline { { w } } _ { T } = \frac { 1 } { W _ { T } } \sum _ { t = 1 } ^ { T } ( t + a - 1 ) ( t + a - 2 ) w _ { t } , W _ { T } = \sum _ { t = 1 } ^ { T } ( t + a - 1 ) ( t + a - 2 ) , +$$ + +Our results hold under Assumption 4, which allows for arbitrary device availability sequences with $\tau _ { \mathrm { m a x } , T } = \mathcal { O } ( T )$ . However, for MIFA to converge, we require $\tau _ { \operatorname* { m a x } , T } = o ( T )$ and $\dot { t _ { 0 } } = \bar { o } ( T )$ . When ( NK(τ2max,T +t20)τ¯+1 ), the first term dominates and the impact of the second O(1/T 2) term is negligible. In fact the first term in Theorem 5.1 is minimax optimal by our information-theoretic lower bound for the problem in the next proposition. + +Proposition 5.1. Let $c _ { 0 } > 0$ be a universal constant. For any potentially randomized algorithm, there exists a stochastic strongly convex problem satisfying Assumptions $^ { l }$ to 3, such that the output $w _ { T }$ after $T$ rounds of communication has expected sub-optimality lower bounded by + +$$ +\mathbb { E } [ f ( w _ { T } ) - f ( w ^ { * } ) ] \geq c _ { 0 } \frac { \bar { \tau } _ { T } \sigma ^ { 2 } } { \mu N K T } . +$$ + +The proof is based on the observation that the number of gradient evaluation can scale inversely with $\bar { \tau } _ { T }$ and that the oracle complexity is tight even for centralized stochastic optimization problems. The optimality of the first term in Theorem 5.1 is independent of the distributed or the FL setup. + +The second term in Theorem 5.1 converges at the rate $\mathcal { O } ( 1 / T ^ { 2 } )$ and consists of three parts, where the first part reflects the slowdown caused by device unavailability through $\tau _ { \operatorname* { m a x } , T }$ , the second part shows the effect of multiple $( K > 1 )$ ) local steps, and the third part tells how the initial error decreases. + +Remark 5.1. When $\tau ( t , i ) ~ = ~ 0$ for all $i$ and $t _ { : }$ , our setup reduces to FedAvg with full device pbound $\bar { \tau } _ { T } ~ = ~ 0$ d , $\tau _ { \mathrm { m a x } , T } ~ = ~ 0$ . Iate $\begin{array} { r } { \mathcal { O } \left( \frac { \sigma ^ { 2 } } { \mu K N T } + \frac { L ( \sigma ^ { 2 } / K + D + L ^ { 2 } \| w _ { 1 } - w _ { * } \| ^ { 2 } ) } { \mu ^ { 2 } T ^ { 2 } } \right) } \end{array}$ $\begin{array} { r } { \mathcal { O } \bigg ( \frac { \sigma ^ { 2 } \log T } { \mu K N T } + \frac { L ( \sigma ^ { 2 } / K + D ) ( \log T ) ^ { 2 } } { \mu ^ { 2 } T ^ { 2 } } + } \end{array}$ $\begin{array} { r } { \mu \left. w _ { 1 } - w _ { * } \right. ^ { 2 } \exp ( - \frac { \mu } { 4 8 L } T ) \Bigr ) } \end{array}$ in [18] (Thm. V. $B ^ { 2 } = 2 , \eta _ { g } = 1 ,$ ) up to logarithmic terms. Besides, in the general case, our $\mathcal { O } ( \tau _ { \mathrm { m a x } , T } ^ { 2 } A _ { 1 } / T ^ { 2 } )$ term matches the last term in $I 6 J \left( C o r . 5 \right)$ . + +Remark 5.2. Our analysis relies on the technical assumption that all devices respond in the first round. Intuitively, this is because we need at least one valid stochastic gradient evaluation for each device to get a complete picture of the global objective, or otherwise any update would be biased. In practice, this can be achieved by waiting for the updates from all devices on $w _ { 1 }$ at the very beginning. + +# 5.1 Case Study: i.i.d. Bernoulli participation + +Though our algorithm can be applied to non-stationary and non-independent response patterns, we show in this subsection that even in the simple i.i.d. Bernoulli participation scenario our algorithm can achieve considerable improvement compared to known algorithms. In particular, we consider a setup where each device becomes active independently with a fixed probability $p _ { i }$ . It serves as the first motivating example towards modeling the participation patterns of devices, and provides a clean view of how the heterogeneity of the device participation influences the Federated optimization algorithms. + +We will show that in this scenario, Assumption 4 holds with high probability, and the terms involving the inactive rounds $\tau ( t , i )$ in Theorem 5.1 can also be bounded. Furthermore, we theoretically demonstrate that algorithms such as FedAvg [28] and SCAFFOLD [18], which sample $S$ devices for each global update, are more prone to stragglers than our algorithm. + +Definition 5.2. Assume that for all $i \in [ N ]$ , the i-th device is assigned with a probability $p _ { i }$ . We say the participation of the devices follows i.i.d. Bernoulli participation model with participation probabilities $\{ p _ { i } \}$ , if (1). at the first round, all devices are active, and (2). at round $t > 1$ , device $i$ is active with probability $p _ { i }$ , which is independent of the history and other devices. + +Next theorem shows that under i.i.d. Bernoulli participation scenario, with high probability, $\tau ( t , i )$ only grows logarithmically in $t$ . Also Assumption 4 holds for a mild choice of $t _ { 0 }$ . + +Theorem 5.2. For i.i.d. Bernoulli participation model defined in Definition 5.2, given any $\delta > 0$ , with probability at least $1 - \delta$ , we have the following holds for all $t \geq 1$ and $i \in [ N ]$ simultaneously, + +$$ +\tau ( t , i ) \leq \mathcal { O } \Big ( \frac { 1 } { p _ { i } } ( \log ( N t / \delta ) + 1 ) \Big ) . +$$ + +Furthermore, $( l )$ . Assumption $^ { 4 }$ holds true $\begin{array} { r } { \mathrm { \ddot { \it f } } t _ { 0 } = \Omega \bigg ( \frac { 1 } { p _ { m i n } } \log \frac { b N } { p _ { m i n } \delta } \bigg ) } \end{array}$ , where $p _ { m i n } = \operatorname* { m i n } \{ p _ { i } \}$ , and $b = 4 0 ( L / \mu ) ^ { 1 . 5 }$ ;(2). $\tau _ { \operatorname* { m a x } , T }$ can be upper bounded as + +$$ +\tau _ { \operatorname* { m a x } , T } \leq \mathcal { O } \Big ( \frac { 1 } { p _ { m i n } } \cdot \big ( \log ( T N / \delta ) + 1 \big ) \Big ) . +$$ + +The next theorem provides a high probability upper bound for $\bar { \tau } _ { T }$ . + +Theorem 5.3. For i.i.d. Bernoulli participation model defined in Definition 5.2, given any $\delta > 0$ and $T > 1$ , with probability at least $1 - \delta$ , we have + +$$ +\bar { \tau } _ { T } \leq \Big ( \frac { 1 } { N } \sum _ { i = 1 } ^ { N } \frac { 1 } { p _ { i } } \Big ) \cdot \mathcal { O } \Big ( 1 + \log \frac { 1 } { \delta } \Big ) . +$$ + +By Theorem 5.2 and Theorem 5.3, we conclude that the dominant term of our convergence bound is $\begin{array} { r } { \stackrel { \triangledown } { \mathcal { O } } \left( \frac { 1 } { N } \sum _ { i = 1 } ^ { N } \frac { 1 } { p _ { i } } \cdot \frac { \sigma ^ { 2 } } { \mu N K T } \right) } \end{array}$ . Therefore, to achieve $\epsilon$ accuracy, the dominant term of the number of the required rounds is + +$$ +T _ { \epsilon } ^ { \left( \mathrm { M I F A } \right) } = \widetilde { \mathcal { O } } \Bigl ( \frac { 1 } { N } \sum _ { i = 1 } ^ { N } \frac { 1 } { p _ { i } } \cdot \frac { \sigma ^ { 2 } } { \mu N K \epsilon } \Bigr ) . +$$ + +For both FedAvg and SCAFFOLD that sample $S$ devices uniformly at random, [18] (Thm I. & III.) showed that the dominant term of the number of global updates needed to achieve $\epsilon$ accuracy is $\begin{array} { r } { R _ { \epsilon } = \widetilde { \mathcal { O } } \left( \frac { \sigma ^ { 2 } } { \mu S K \epsilon } \right) } \end{array}$ . Notice that in our setting, to accomplish each global update, the server needs to wait for a few rounds for the $S$ devices to respond. Let $T ( S )$ be the expected rounds for which the server needs to wait for the selected devices $\boldsymbol { S }$ to be active. Then the expected total rounds to achieve $\epsilon$ accuracy is $R _ { \epsilon } \cdot \mathbb { E } _ { S } \left[ T ( S ) \right]$ . For i.i.d. Bernoulli participation model, we have $\begin{array} { r } { T ( S ) \geq \frac { 1 } { \operatorname* { m i n } \{ p _ { i } | i \in S \} } } \end{array}$ , and we can further show that $\begin{array} { r } { \mathbb { E } _ { S } \left[ T ( S ) \right] \ge \frac { 1 } { p _ { m i n } } \frac { S } { N } } \end{array}$ ≥ 1p min SN ( see Appendix D.3 for details). Therefore, + +$$ +\mathbb { E } \left[ T _ { \epsilon } ^ { ( \mathsf { F e d A v g , S C A F F O L D } ) } \right] \geq \frac { S } { N } \frac { 1 } { p _ { m i n } } \widetilde { \mathcal { O } } \Big ( \frac { \sigma ^ { 2 } } { \mu S K \epsilon } \Big ) = \widetilde { \mathcal { O } } \Big ( \frac { 1 } { p _ { m i n } } \cdot \frac { \sigma ^ { 2 } } { \mu N K \epsilon } \Big ) . +$$ + +By comparing Eqn. 2 and Eqn. 3, we see that both FedAvg and SCAFFOLD are more vulnerable to stragglers, that is, the devices with very small participation probabilities; on the contrary, the convergence rate of MIFA only depends on the average of $1 / p _ { i }$ instead of $1 / p _ { m i n }$ . We also provide empirical experiments showing that MIFA converges faster than FedAvg in Section 7. + +# 6 Convergence result for non-convex objective functions + +In this section, we present the convergence guarantee of MIFA for the non-convex case. First we list the additional assumptions as below. + +Assumption 5 (Hessian Lipschitz). $f _ { 1 } , \cdots , f _ { N }$ are all $\rho$ -Hessian Lipschitz: for all $w$ and $v$ $\bigl \| \nabla ^ { 2 } f _ { i } \bigl ( \tilde { \boldsymbol { w } } \bigr ) - \nabla ^ { 2 } f _ { i } ( \boldsymbol { v } ) \bigr \| \leq \dot { \rho } \bigl \| \boldsymbol { w } - \boldsymbol { \tilde { v } } \bigr \|$ . + +Assumption 6 (Bounded noise). The noise of the local stochastic gradients is upper bounded by $a$ constant $\delta$ almost surely: $\begin{array} { r } { \left\| \tilde { \nabla } f _ { i } ( w ) - \nabla f _ { i } ( w ) \right\| \le \delta a . s . , \forall i \in [ N ] } \end{array}$ . + +Assand y). There exist . Furthermore, $\alpha > 0$ anfine $\beta _ { i } > 0$ at for all . $w$ $\in [ N ] \colon \left\| \nabla f _ { i } ( w ) \right\| ^ { 2 } \leq \alpha \left\| \nabla f ( w ) \right\| ^ { 2 } + \beta _ { i }$ $\begin{array} { r } { \beta = \frac { 1 } { N } \sum _ { i = 1 } ^ { N } \beta _ { i } } \end{array}$ + +Assumption 8. There exists a constant $\nu _ { i }$ such that $\tau ( t , i ) \ \leq \ \nu _ { i }$ , for all $i \in [ N ]$ and $t \geq 1$ Furthermore, define ν¯ = 1N PNi=1 νi and νmax = maxi∈[N] νi. + +The analysis of non-convex functions is much more technically involved, and our results rely on strong assumptions that provide a finer control of the gradient difference (Assumption 5), gradient noise (Assumption 6), gradient dissimilarity among devices (Assumption 7), and device unavailability (Assumption 8). We remark that Assumption 5 is also made in [9, 16], and Assumption 7 is also made in [18, 39]. We leave it as future work to study whether and how MIFA converges for non-convex functions with weaker assumptions. + +Theorem 6.1. Assume that Assumptions $I , ~ 2 , ~$ , and $^ { 5 }$ to 7 hold. Further assume that the device availability sequence $\tau ( t , i )$ satisfies Assumption 8 and $\tau ( 1 , i ) = 0$ for all $i \in [ N ]$ . By using $a$ learning rate η = q $\begin{array} { r } { \eta = \sqrt { \frac { N } { K T L \left( 1 + \bar { \nu } \right) } } } \end{array}$ NKT L(1+¯ν), for T ≥ max{32αLNK, 16LNK , 8KNν2max(L2+ρδ) }, after T − 1 communication rounds, MIFA satisfies: + +$$ +\operatorname* { m i n } _ { 1 \leq t \leq T } \mathbb { E } _ { \xi } \left[ \left\| \nabla f ( w _ { t } ) \right\| ^ { 2 } \right] = \mathcal { O } \left( \sqrt { \frac { ( 1 + \bar { \nu } ) L } { T K N } } ( f ( w _ { 1 } ) - f ^ { * } + \sigma ^ { 2 } ) + \frac { A _ { 4 } + A _ { 5 } } { T } \right) , +$$ + +where $f ^ { * }$ is the optimal value, and: + +$$ +\begin{array} { l } { { A _ { 4 } = N K L \left( \alpha \sigma ^ { 2 } \hat { \nu } + \frac { \sigma ^ { 2 } \nu _ { \mathrm { m a x } } } { \sqrt { K N } } + \sigma \nu _ { \mathrm { m a x } } \sqrt { \beta } \right) + \frac { { ( L ^ { 2 } + \rho \delta ) \sigma ^ { 2 } \nu _ { \mathrm { m a x } } } } { L } , } } \\ { { A _ { 5 } = \frac { { ( K - 1 ) N L ( \beta + \sigma ^ { 2 } / K ) } } { \hat { \nu } + 1 } . } } \end{array} +$$ + +Next, we show that the leading $\mathcal { O } ( 1 / \sqrt { T } )$ term is theoretically optimal for zero-respecting algorithms. + +Proposition 6.1. Let $c _ { 0 } > 0$ be a universal constant. For any randomized zero-respecting algorithm, there exists a stochastic non-convex problem satisfying Assumption1, 2, 5 and 7, such that the output $w _ { T }$ after $T$ rounds of communication has expected sub-optimality lower bounded by + +$$ +\mathbb { E } [ \| \nabla f ( w _ { T } ) \| ^ { 2 } ] \ge \mathbb { E } [ \| \nabla f ( w _ { T } ) \| ] ^ { 2 } \ge c _ { 0 } \sqrt { \frac { \bar { \nu } L \sigma ^ { 2 } ( f ( w _ { 0 } ) - f ^ { * } ) } { N K T } } . +$$ + +The above proposition show that when $\sigma \sqrt { ( f ( w _ { 0 } ) - f ^ { * } ) } \sim \sigma ^ { 2 } + ( f ( w _ { 0 } ) - f ^ { * } )$ , the result in Theorem 6.1 is tight. However, note that the counter example we used requires the quantity $\delta$ in Assumption 6 to scale with $T$ , hence requiring $\delta$ to be large enough. This does not change the optimality of the first term as the first term is independent of $\delta$ . Whether this requirement can be relaxed is left as an open problem. + +Remark 6.1. When all $\nu _ { i } = 0$ (i.e. all the devices are active), our convergence bound reduces to $\begin{array} { r } { \mathcal { O } \Big ( \sqrt { \frac { L } { T K N } } ( f ( w _ { 1 } ) - f ^ { * } + \sigma ^ { 2 } ) + \frac { ( K - 1 ) N L ( \beta + \sigma ^ { 2 } / K ) } { T } \Big ) } \end{array}$ . This matches the result in [42] (Thm. 1, $\begin{array} { r } { \eta = 1 , \eta _ { L } = \sqrt { \frac { N } { K T L } } ) } \end{array}$ . + +# 7 Numerical Experiments + +In this section, we conduct numerical experiments3. to verify our theoretical results and investigate how the heterogeneity of the device availability influences the Federated optimization algorithms. We compare the performance of the following four algorithms: FedAvg with importance sampling (FedAvg-IS), Biased FedAvg, FedAvg with device sampling, and our proposed MIFA. For the detailed discussions of the algorithms, we refer the readers to Sections 3 and 4. We remark that for a fair comparison, we deliberately include the first few rounds that MIFA needs to wait to receive responses from all devices for initializing the update-array $\{ G ^ { i } \}$ . + +Following [26, 25], we construct non-i.i.d. datasets from two commonly used computer vision datasets — MNIST [23] and CIFAR-10 [22] . Specifically, we divide the data into $N = 1 0 0$ devices with each device holding samples of only two classes, which creates a high level of data heterogeneity. For simplicity, we ensure that each device holds the same number of samples. We do not use any data augmentation. We use multinomial logistic regression as the convex model and LeNet-5 [24] with ReLU activations as the non-convex model. For all experiments, we use weight decay in the training process, which corresponds to adding $\ell _ { 2 }$ penalty. We use logistic models for MNIST dataset, while we use LeNet-5 for CIFAR-10. Our code is adapted from [26], which is under MIT License. + +We model the availability of the devices as independent Bernoulli random trials. The $i \cdot$ -th device is assigned with a probability $p _ { i }$ , where at each time step, the device becomes active with probability $p _ { i }$ . In our experiments, the $p _ { i }$ ’s are chosen such that devices holding data of smaller labels participate less frequently. Specifically, if the $i$ -th device holds the data of label $j$ and $k$ , we set $\bar { p } _ { i } = \bar { p _ { \operatorname* { m i n } } } \operatorname* { m i n } ( j , k ) / 9 + \bar { ( 1 - p _ { \operatorname* { m i n } } ) }$ , where $p _ { \mathrm { m i n } }$ controls the lower bound of the participation probabilities. The correlation between the participation patterns and local datasets increases the difficulty of the problem [17]. To investigate this phenomenon, we repeat the experiments for $p _ { \mathrm { m i n } } = 0 . 1$ and 0.2. We control the randomness of device participation when testing different algorithms. + +In all the experiments, we set the initial learning rate to be $\eta _ { 0 } = 0 . 1$ and decay the learning rate as $\begin{array} { r } { \eta _ { t } = \eta _ { 0 } \cdot \frac { 1 } { t } } \end{array}$ . We set the weight decay to be 0.001. The local batch size is 100 and each local update consists of 2 epochs. Therefore, the actual number of local steps $K$ depends on the size of the dataset. We run all the experiments with 4 GPUs of type GeForce RTX 2080 Ti. We repeat the experiments for 5 different random seeds, and all of the experiments exhibit similar training curves. We report the averaged training loss and test accuracy with error bars in Figure 2. + +We observe that FedAvg with device sampling (FedAvg ( $S = 5 0$ ) and FedAvg $S = 1 0 0$ ) in Figure 2) is severely influenced by the straggling devices and makes progress relatively slowly compared to the other algorithms. Although biased FedAvg converges fast at the beginning, this simple algorithm is biased, and the optimality gaps are prominent for the harder CIFAR-10 dataset and when $p _ { \mathrm { m i n } }$ is small. On the contrary, our proposed MIFA avoids waiting for stragglers, converges fast without bias, and is competitive with FedAvg with importance sampling, which requires knowledge of the participation probabilities. We refer the readers to Appendix G for additional experiments on CIFAR-10. + +# 8 Conclusions and Discussions + +In this paper, we study FL algorithms in the presence of arbitrary device unavailability and propose MIFA, which avoids waiting for straggling devices and re-uses the memorized latest updates as the surrogate when the device is unavailable. We theoretically analyze MIFA without any structural assumptions on the device availability and prove the convergence for strongly convex and non-convex smooth functions. Different from the literature that studies oracle complexity in terms of stochastic gradient evaluations, we argue that in federated learning system, the bottleneck lies in the nonstationary and possibly adversarial pattern of device participation. Therefore, it is important to study how the number of inactive rounds influences the convergence rate. In Theorem 5.1, the dependency upon $\tau _ { \operatorname* { m a x } , T }$ might be an artifact of our analysis, and a future direction is to study whether we can remove this dependency. Another important direction is to analyze algorithms for non-convex functions under weaker assumptions. + +![](images/c1142e9ecbf7a3052e86380ac3f4c818747910b17c29f238aaf9134bafeb112a.jpg) +Figure 2: Training losses and test accuracies. Fig. 2(a)–2(d): logistic models on non-iid MNIST. Fig. 2(e)–2(h): LeNet-5 on non-iid CIFAR-10. FedAvg $S = 5 0$ ) and FedAvg $S = 1 0 0$ ) refer to FedAvg with device sampling that samples $S$ devices for each global update. FedAvg-IS is short for FedAvg with importance sampling, which requires knowledge of the participation probabilities. + +# Acknowledgments and Disclosure of Funding + +The work of Xinran Gu and Longbo Huang is supported in part by the Technology and Innovation Major Project of the Ministry of Science and Technology of China under Grant 2020AAA0108400 and2020AAA0108403. Xinran Gu would like to thank Kaifeng Lyu for the discussion on the convergence analysis. The authors would like to thank Sai Praneeth Karimireddy for the discussion on the problem settings. + +# References + +[1] Alekh Agarwal and John C Duchi. Distributed delayed stochastic optimization. In 2012 IEEE 51st IEEE Conference on Decision and Control (CDC), pages 5451–5452. IEEE, 2012. +[2] Alekh Agarwal, Martin J Wainwright, Peter Bartlett, and Pradeep Ravikumar. Informationtheoretic lower bounds on the oracle complexity of convex optimization. Advances in Neural Information Processing Systems, 22:1–9, 2009. +[3] Yossi Arjevani, Yair Carmon, John C. Duchi, Dylan J. Foster, Nathan Srebro, and Blake Woodworth. Lower bounds for non-convex stochastic optimization, 2019. +[4] Yossi Arjevani, Ohad Shamir, and Nathan Srebro. A tight convergence analysis for stochastic gradient descent with delayed updates. In Algorithmic Learning Theory, pages 111–132. PMLR, 2020. +[5] Arda Aytekin, Hamid Reza Feyzmahdavian, and Mikael Johansson. Analysis and implementation of an asynchronous optimization algorithm for the parameter server. arXiv preprint arXiv:1610.05507, 2016. +[6] Debraj Basu, Deepesh Data, Can Karakus, and Suhas Diggavi. Qsparse-local-sgd: Distributed sgd with quantization, sparsification, and local computations. arXiv preprint arXiv:1906.02367, 2019. +[7] Keith Bonawitz, Hubert Eichner, Wolfgang Grieskamp, Dzmitry Huba, Alex Ingerman, Vladimir Ivanov, Chloé Kiddon, Jakub Konecný, Stefano Mazzocchi, Brendan McMahan, Timon ˇ + +Van Overveldt, David Petrou, Daniel Ramage, and Jason Roselander. Towards federated learning at scale: System design. In A. Talwalkar, V. Smith, and M. Zaharia, editors, Proceedings of Machine Learning and Systems, volume 1, pages 374–388, 2019. + +[8] Sébastien Bubeck, Nicolo Cesa-Bianchi, and Gábor Lugosi. Bandits with heavy tail. IEEE Transactions on Information Theory, 59(11):7711–7717, 2013. + +[9] Yair Carmon, John C Duchi, Oliver Hinder, and Aaron Sidford. Accelerated methods for nonconvex optimization. SIAM Journal on Optimization, 28(2):1751–1772, 2018. + +[10] Hubert Eichner, Tomer Koren, Brendan McMahan, Nathan Srebro, and Kunal Talwar. Semicyclic stochastic gradient descent. In International Conference on Machine Learning, pages 1764–1773. PMLR, 2019. + +[11] Hamid Reza Feyzmahdavian, Arda Aytekin, and Mikael Johansson. An asynchronous minibatch algorithm for regularized stochastic optimization. IEEE Transactions on Automatic Control, 61(12):3740–3754, 2016. + +[12] Saeed Ghadimi and Guanghui Lan. Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization i: A generic algorithmic framework. SIAM Journal on Optimization, 22(4):1469–1492, 2012. + +[13] Margalit Glasgow and Mary Wootters. Asynchronous distributed optimization with stochastic delays. arXiv preprint arXiv:2009.10717, 2020. + +[14] Eduard Gorbunov, Konstantin P. Burlachenko, Zhize Li, and Peter Richtarik. Marina: Faster non-convex distributed learning with compression. In Marina Meila and Tong Zhang, editors, Proceedings of the 38th International Conference on Machine Learning, volume 139 of Proceedings of Machine Learning Research, pages 3788–3798. PMLR, 18–24 Jul 2021. + +[15] Tzu-Ming Harry Hsu, Hang Qi, and Matthew Brown. Measuring the effects of non-identical data distribution for federated visual classification. arXiv preprint arXiv:1909.06335, 2019. + +[16] Chi Jin, Rong Ge, Praneeth Netrapalli, Sham M Kakade, and Michael I Jordan. How to escape saddle points efficiently. In International Conference on Machine Learning, pages 1724–1732. PMLR, 2017. + +[17] Peter Kairouz, H Brendan McMahan, Brendan Avent, Aurélien Bellet, Mehdi Bennis, Arjun Nitin Bhagoji, Keith Bonawitz, Zachary Charles, Graham Cormode, Rachel Cummings, et al. Advances and open problems in federated learning. arXiv preprint arXiv:1912.04977, 2019. + +[18] Sai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank Reddi, Sebastian Stich, and Ananda Theertha Suresh. Scaffold: Stochastic controlled averaging for federated learning. In International Conference on Machine Learning, pages 5132–5143. PMLR, 2020. + +[19] Ahmed Khaled, Konstantin Mishchenko, and Peter Richtárik. Tighter theory for local sgd on identical and heterogeneous data. In International Conference on Artificial Intelligence and Statistics, pages 4519–4529. PMLR, 2020. + +[20] Jakub Konecnˇ y, Brendan McMahan, and Daniel Ramage. Federated optimization: Distributed \` optimization beyond the datacenter. arXiv preprint arXiv:1511.03575, 2015. + +[21] Jakub Konecnˇ y, H Brendan McMahan, Daniel Ramage, and Peter Richtárik. Federated optimiza- \` tion: Distributed machine learning for on-device intelligence. arXiv preprint arXiv:1610.02527, 2016. + +[22] Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images. 2009. + +[23] Yann LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner. Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998. + +[24] Yann LeCun et al. Lenet-5, convolutional neural networks. URL: http://yann. lecun. com/exdb/lenet, 20(5):14, 2015. + +[25] Tian Li, Anit Kumar Sahu, Manzil Zaheer, Maziar Sanjabi, Ameet Talwalkar, and Virginia Smith. Federated optimization in heterogeneous networks. In I. Dhillon, D. Papailiopoulos, and V. Sze, editors, Proceedings of Machine Learning and Systems, volume 2, pages 429–450, 2020. +[26] Xiang Li, Kaixuan Huang, Wenhao Yang, Shusen Wang, and Zhihua Zhang. On the convergence of fedavg on non-iid data. In International Conference on Learning Representations, 2020. +[27] Xiangru Lian, Yijun Huang, Yuncheng Li, and Ji Liu. Asynchronous parallel stochastic gradient for nonconvex optimization. In C. Cortes, N. Lawrence, D. Lee, M. Sugiyama, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 28. Curran Associates, Inc., 2015. +[28] Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Aguera y Arcas. Communication-efficient learning of deep networks from decentralized data. In Artificial Intelligence and Statistics, pages 1273–1282. PMLR, 2017. +[29] Arkadij Semenovic Nemirovskij and David Borisovich Yudin. Problem complexity and method ˇ efficiency in optimization. 1983. +[30] Constantin Philippenko and Aymeric Dieuleveut. Bidirectional compression in heterogeneous settings for distributed or federated learning with partial participation: tight convergence guarantees. arXiv preprint arXiv:2006.14591, 2020. +[31] Amirhossein Reisizadeh, Isidoros Tziotis, Hamed Hassani, Aryan Mokhtari, and Ramtin Pedarsani. Straggler-resilient federated learning: Leveraging the interplay between statistical accuracy and system heterogeneity. arXiv preprint arXiv:2012.14453, 2020. +[32] Yichen Ruan, Xiaoxi Zhang, Shu-Che Liang, and Carlee Joe-Wong. Towards flexible device participation in federated learning. In International Conference on Artificial Intelligence and Statistics, pages 3403–3411. PMLR, 2021. +[33] Felix Sattler, Simon Wiedemann, Klaus-Robert Müller, and Wojciech Samek. Robust and communication-efficient federated learning from non-iid data. IEEE transactions on neural networks and learning systems, 31(9):3400–3413, 2019. +[34] Virginia Smith, Chao-Kai Chiang, Maziar Sanjabi, and Ameet Talwalkar. Federated multi-task learning. arXiv preprint arXiv:1705.10467, 2017. +[35] Sebastian U Stich and Sai Praneeth Karimireddy. The error-feedback framework: Better rates for sgd with delayed gradients and compressed updates. Journal of Machine Learning Research, 21:1–36, 2020. +[36] Sebastian Urban Stich. Local sgd converges fast and communicates little. In ICLR 2019- International Conference on Learning Representations, number CONF, 2019. +[37] Roman Vershynin. High-dimensional probability: An introduction with applications in data science, volume 47. Cambridge university press, 2018. +[38] Jianyu Wang and Gauri Joshi. Cooperative sgd: A unified framework for the design and analysis of communication-efficient sgd algorithms. In ICML Workshop on Coding Theory for Machine Learning, 2019. +[39] Jianyu Wang, Qinghua Liu, Hao Liang, Gauri Joshi, and H Vincent Poor. Tackling the objective inconsistency problem in heterogeneous federated optimization. Advances in Neural Information Processing Systems, 33, 2020. +[40] Cong Xie, Sanmi Koyejo, and Indranil Gupta. Asynchronous federated optimization. arXiv preprint arXiv:1903.03934, 2019. +[41] Yikai Yan, Chaoyue Niu, Yucheng Ding, Zhenzhe Zheng, Fan Wu, Guihai Chen, Shaojie Tang, and Zhihua Wu. Distributed non-convex optimization with sublinear speedup under intermittent client availability. arXiv preprint arXiv:2002.07399, 2020. +[42] Haibo Yang, Minghong Fang, and Jia Liu. Achieving linear speedup with partial worker participation in non-iid federated learning. arXiv preprint arXiv:2101.11203, 2021. +[43] Hao Yu, Rong Jin, and Sen Yang. On the linear speedup analysis of communication efficient momentum sgd for distributed non-convex optimization. In International Conference on Machine Learning, pages 7184–7193. PMLR, 2019. +[44] Jingzhao Zhang, Sai Praneeth Karimireddy, Andreas Veit, Seungyeon Kim, Sashank J Reddi, Sanjiv Kumar, and Suvrit Sra. Why are adaptive methods good for attention models?, 2020. +[45] Xin Zhang, Jia Liu, and Zhengyuan Zhu. Taming convergence for asynchronous stochastic gradient descent with unbounded delay in non-convex learning. In 2020 59th IEEE Conference on Decision and Control (CDC), pages 3580–3585. IEEE, 2020. + +# Checklist + +1. For all authors... + +(a) Do the main claims made in the abstract and introduction accurately reflect the paper’s contributions and scope? [Yes] +(b) Did you describe the limitations of your work? [Yes] See Section 8. +(c) Did you discuss any potential negative societal impacts of your work? [N/A] Our work is mainly theoretical and targets at providing theoretical analysis of the FL algorithms, which has almost no negative societal impacts. +(d) Have you read the ethics review guidelines and ensured that your paper conforms to them? [Yes] + +2. If you are including theoretical results... + +(a) Did you state the full set of assumptions of all theoretical results? [Yes] The assumptions are rigorously stated in Section 5 and Section 6. +(b) Did you include complete proofs of all theoretical results? [Yes] All the proofs are deferred to the appendix. + +3. If you ran experiments... + +(a) Did you include the code, data, and instructions needed to reproduce the main experimental results (either in the supplemental material or as a URL)? [Yes] Our code will be included in the supplemental material. The datasets we use are public. The instructions needed to reproduce the main experimental results are clearly stated in Section 7. +(b) Did you specify all the training details (e.g., data splits, hyperparameters, how they were chosen)? [Yes] See Section 7. +(c) Did you report error bars (e.g., with respect to the random seed after running experiments multiple times)? [Yes] See Section 7. +(d) Did you include the total amount of compute and the type of resources used (e.g., type of GPUs, internal cluster, or cloud provider)? [Yes] See Section 7. + +4. If you are using existing assets (e.g., code, data, models) or curating/releasing new assets... + +(a) If your work uses existing assets, did you cite the creators? [Yes] See Section 7. +(b) Did you mention the license of the assets? [Yes] See Section 7. +(c) Did you include any new assets either in the supplemental material or as a URL? [Yes] We include our code for reproducing the experiments in the supplemental material. +(d) Did you discuss whether and how consent was obtained from people whose data you’re using/curating? [N/A] We choose the commonly-used MNIST and CIFAR-10 datasets. +(e) Did you discuss whether the data you are using/curating contains personally identifiable information or offensive content? [N/A] We choose the commonly-used MNIST and CIFAR-10 datasets. + +5. If you used crowdsourcing or conducted research with human subjects... + +(a) Did you include the full text of instructions given to participants and screenshots, if applicable? [N/A] +(b) Did you describe any potential participant risks, with links to Institutional Review Board (IRB) approvals, if applicable? [N/A] +(c) Did you include the estimated hourly wage paid to participants and the total amount spent on participant compensation? [N/A] \ No newline at end of file diff --git a/parse/train/1_gaHBaRYt/1_gaHBaRYt_content_list.json b/parse/train/1_gaHBaRYt/1_gaHBaRYt_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..7961824bbd98037a484d1c55bc1322e9ea7ee6a7 --- /dev/null +++ b/parse/train/1_gaHBaRYt/1_gaHBaRYt_content_list.json @@ -0,0 +1,1665 @@ +[ + { + "type": "text", + "text": "Fast Federated Learning in the Presence of Arbitrary Device Unavailability ", + "text_level": 1, + "bbox": [ + 238, + 122, + 761, + 172 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Xinran Gu∗ IIIS Tsinghua University gxr21@mails.tsinghua.edu.cn ", + "bbox": [ + 245, + 226, + 480, + 282 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Kaixuan Huang∗ ECE Princeton University kaixuanh@princeton.edu ", + "bbox": [ + 558, + 227, + 751, + 281 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Jingzhao Zhang EECS Massachusetts Institute of Technology jzhzhang@mit.edu ", + "bbox": [ + 225, + 303, + 478, + 358 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Longbo Huang† IIIS Tsinghua University longbohuang@tsinghua.edu.cn ", + "bbox": [ + 537, + 303, + 771, + 358 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract ", + "text_level": 1, + "bbox": [ + 462, + 395, + 535, + 411 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Federated Learning (FL) coordinates with numerous heterogeneous devices to collaboratively train a shared model while preserving user privacy. Despite its multiple advantages, FL faces new challenges. One challenge arises when devices drop out of the training process beyond the control of the central server. In this case, the convergence of popular FL algorithms such as FedAvg is severely influenced by the straggling devices. To tackle this challenge, we study federated learning algorithms under arbitrary device unavailability and propose an algorithm named Memory-augmented Impatient Federated Averaging (MIFA). Our algorithm efficiently avoids excessive latency induced by inactive devices, and corrects the gradient bias using the memorized latest updates from the devices. We prove that MIFA achieves minimax optimal convergence rates on non-i.i.d. data for both strongly convex and non-convex smooth functions. We also provide an explicit characterization of the improvement over baseline algorithms through a case study, and validate the results by numerical experiments on real-world datasets. ", + "bbox": [ + 233, + 428, + 766, + 621 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction ", + "text_level": 1, + "bbox": [ + 174, + 650, + 310, + 667 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Federated learning is a machine learning setting in which a central server coordinates with a large number of devices to collectively train a shared model [28, 34, 20, 33, 25, 26]. Practical advantages of this training scheme are mainly twofold. First, each device keeps the private data locally and hence preserves its data privacy. Second, federated learning can make use of idle computing resources and lower computation costs. Although federated learning successfully scales up with data sizes and accelerates training via more affordable computing power [43, 38, 36], the collaborative setup leads to new challenges due to large variations among individual computing devices. Our work aims to formulate and investigate the impact of device variations on FL from an optimization perspective. ", + "bbox": [ + 174, + 684, + 823, + 795 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In FL, a device can differ from its peers in multiple aspects [17, 25]. First, the data distribution and local task can be different among devices. To address the data variation, non-i.i.d. objective models were proposed and analyzed by [26, 18, 19, 42, 25]. We follow this line of work and formulate our optimization objective as a sum of stochastic functions on individual devices (See Eqn. (1)). ", + "bbox": [ + 174, + 801, + 823, + 857 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "A second variation among devices is caused by different computing and communication speeds. One natural way to formulate the variation in computation speeds is to allow asynchronous updates and model the updates as delayed responses. Lots of novel research has studied the problem with different delay models, e.g., [35, 4, 27, 11, 45, 1, 5, 13]. However, the delayed setup assumes that all devices make roughly the same number of (delayed) responses in the end. This behavior may deviate largely from the FL practice, where each device, e.g., personal cell phones, can have very different active duration when participating in the FL training, and hence make different numbers of responses. For this reason, our work aims to address this third discrepancy among devices caused by individual availability patterns. ", + "bbox": [ + 174, + 90, + 825, + 215 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The third device heterogeneity caused by different availability patterns is less studied in optimization for federated learning problems. In this model, instead of making a delayed response, devices can abort the training halfway, e.g., due to battery level, incoming calls, etc, and fail to return their responses upon the central server’s requests [28, 7, 17]. To handle missing responses, researchers propose algorithms where the central server may collect responses from only a fraction of the devices and make updates [18, 28, 42, 25, 26, 17, 30, 14]. ", + "bbox": [ + 174, + 222, + 825, + 305 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Previous works on collecting responses from a fraction of devices can be divided into two categories. When the response distribution is known, one could collect only the fastest responses and re-weight according to their response probability [17, 26, 30]. This model can be restrictive, as in practice, the exact distribution may not be available and may evolve. Another line of work assumes that the server can arbitrarily decide and sample a set of devices to collect responses accordingly in every communication round [18, 28, 42, 25, 14]. This model does not require knowing the response possibility. However, the response time can be very long if the selected subset contains unavailable devices. ", + "bbox": [ + 173, + 311, + 825, + 422 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this work, we address the above limitations by studying federated learning in the presence of arbitrary device unavailability. Within this practical setup, we propose an algorithm that automatically accommodates for the underlying unavailability and allows patterns of the device unavailability to be non-stationary and even adversarial. Furthermore, our algorithm can achieve optimal convergence rates in the presence of device inactivity and automatically reduce to best-known rates if all devices are active. Our contributions are summarized as follows. ", + "bbox": [ + 176, + 428, + 825, + 512 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "• We investigate the federated learning problem with a practical formulation of device participation, which does not require each device to be online according to an (either known or unknown) distribution. • We propose the Memory-augmented Impatient Federated Averaging (MIFA) algorithm that is agnostic to the availability pattern. It efficiently avoids excessive latency induced by inactive devices, successfully exploits the information about the descent direction in stale and noisy gradients, and corrects the gradient bias using the memorized latest updates. • We prove that MIFA achieves minimax optimal convergence rates $\\begin{array} { r } { \\mathcal { O } \\left( \\frac { \\bar { \\tau } _ { T } + 1 } { N K T } \\right) } \\end{array}$ for smooth, strongly convex functions, and $\\mathcal { O } \\left( \\sqrt { \\frac { \\bar { \\nu } + 1 } { N K T } } \\right)$ for smooth, non-convex functions, and establish matching lower bounds. Here, $N , K$ and $T$ stand for the number of devices, local updates and communication rounds respectively. $\\bar { \\tau } _ { T }$ and $\\bar { \\nu }$ characterize how actively devices participate in training (see formal definitions in Sections 3, 5 and 6). MIFA also achieves optimal convergence rates in the ideal case when all devices are active. • We provide an explicit characterization of the improvement over baseline algorithms through a case study and empirically verify our results on real-world datasets. ", + "bbox": [ + 217, + 523, + 825, + 758 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 Related work ", + "text_level": 1, + "bbox": [ + 174, + 775, + 318, + 792 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Federated learning. Federated Averaging (FedAvg) was first proposed in [28]. [26, 19, 18, 42] provided convergence analysis for FedAvg on non-i.i.d. data and quantified how data heterogeneity degrades the convergence rate. Several variants of FedAvg were designed to deal with data heterogeneity. FedProx [25] adds a proximal term to local objective functions, while FSVRG [21] and SCAFFOLD [18] employ variance reduction techniques. ", + "bbox": [ + 174, + 808, + 825, + 877 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "One line of work focused on variations in computation capabilities among devices [39, 31, 40]. These models assume that responses are delayed but not missing. To address the missing response, some work assumes that the server can actively sample a subset of devices to respond [18, 28, 42, 25, 14] or that the pattern of device availability is known [26, 17, 10, 30]. These results do not generalize to adversarial inactive patterns. [32] discussed the impact of device inactivity on convergence but their proposed algorithm diverges if there exists an inactive device in each round of communication. However, our setup allows adversarial patterns under certain non-distributional assumptions (see Section 5) while our proposed algorithm still achieves convergence. ", + "bbox": [ + 174, + 883, + 821, + 911 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 90, + 825, + 174 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Asynchronous distributed optimization. Our work is related to literature in the field of traditional asynchronous distributed optimization in that our proposed algorithm uses stale gradients. The problem setup for asynchronous distributed algorithms can be divided into two categories [13]. One is the shared-data (i.i.d.) setting, where all workers can access the whole dataset. In this setting, the local gradient is an unbiased estimator of the global gradient [35, 4, 27, 11, 45, 1]. In contrast, we assume each worker has non-i.i.d. data, and hence the local stochastic gradient can not be viewed as an unbiased estimator of the global gradient. ", + "bbox": [ + 174, + 190, + 825, + 289 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The other less studied setting in distributed optimization is the distributed-data setting (non-i.i.d.), where data are partitioned among workers. Specifically, [5] proposed an asynchronous incremental aggregated gradient algorithm that uses buffered gradients to update the global model. Unlike our setup, this algorithm evaluates full local gradients, performs only one local step, and was analyzed under the bounded delay assumption. [13] models the delay as stochastic and assumes that the server has knowledge of the distribution, but our formulation is distribution-free. [6] allows workers to perform multiple local steps and communicate with the server at different times, but the authors assume that all workers are available and compute at the same rate. ", + "bbox": [ + 173, + 294, + 825, + 405 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Comparison with an independent work. While preparing the manuscript, we were unaware of an independent work [41] that investigated the same setup and proposed a similar algorithm called FedLaAvg. Their main theorem established the convergence rate of $\\mathcal { O } \\left( \\sqrt { \\frac { \\nu _ { \\mathrm { m a x } } } { N ^ { 0 . 5 } T } } ( \\mathbf { \\bar { G } } ^ { 2 } + \\sigma ^ { 2 } ) \\right)$ for smooth and non-convex problems, where $G ^ { 2 }$ is the uniform upper bound for the squared norm of stochastic gradients and $\\nu _ { m a x }$ is the maximum number of inactive rounds. In comparison, we prove the minimax optimal rate of $\\mathcal { O } ( \\sqrt { \\frac { \\bar { \\nu } } { N K T } } \\sigma ^ { 2 } )$ without the bounded gradient assumption, also improving $\\nu _ { \\mathrm { m a x } }$ to $\\bar { \\nu }$ . Furthermore, our result achieves a linear speedup in $N$ and $K$ . ", + "bbox": [ + 173, + 421, + 825, + 531 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Apart from non-convex functions, we also derive the minimax optimal rates for strongly convex smooth functions under the mild assumption that allows for arbitrary and unbounded number of inactive rounds. Both of our results achieve linear speedups in terms of $N$ and $K$ , and automatically recover the best-known rates of FedAvg when all devices are active. We also show that our proposed algorithm achieves acceleration over unbiased baseline algorithms in the presence of stragglers. ", + "bbox": [ + 174, + 536, + 825, + 607 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 Problem Setup ", + "text_level": 1, + "bbox": [ + 174, + 627, + 330, + 645 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We consider optimizing the following problem in a Federated Learning setting: ", + "bbox": [ + 174, + 660, + 691, + 675 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/22f078ec690bdea95bad0a3810ee899d3c05899a7210597c3a542826721eabc9.jpg", + "text": "$$\n\\begin{array} { r } { \\underset { w \\in \\mathbb { R } ^ { d } } { \\operatorname* { m i n } } f ( w ) : = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } f _ { i } ( w ) : = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\mathbb { E } _ { \\xi _ { i } } [ f _ { i } ( w , \\xi _ { i } ) ] , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 308, + 683, + 687, + 710 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where $w$ is the optimization variable, e.g., parameters of a machine learning model, $N$ is the number of participating devices, $f _ { i }$ is the local loss function on device $i$ , and $\\xi _ { i }$ describes the randomness in local data distribution. ", + "bbox": [ + 176, + 717, + 825, + 760 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In the ideal federated learning setup (see Figure 1 (a)), all devices return responses within similar time, and hence the central server collects all the local updates. In this case, the computation cost is usually measured by the number of local stochastic oracle evaluations, which is proportional to the number of rounds. In a delayed FL setup (see Figure 1 (b)), devices are always active upon the central server’s request but may return responses with a delay. Here, all devices return almost the same number of responses in the long term. ", + "bbox": [ + 173, + 765, + 825, + 849 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "As we discussed, the above setups do not depict a real-world scenario in which a device can have a longer inactive duration than active duration. In such cases, the communication interval is much longer than the local computation time required for each update, and each device generates an unequal number of responses [28, 17]. This motivates our setup in Figure 1 (c). ", + "bbox": [ + 174, + 856, + 823, + 911 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/dbec5db87e22ee0dc55043253dc815eff5fd652c994f67ee8a04489f10ef06e1.jpg", + "image_caption": [ + "Figure 1: An illustration of setup. (a) Ideal setup: all devices return their responses within similar time. (b) Delayed setup: all devices are available, but may return responses with a delay. (c) Our setup: devices can be unavailable arbitrarily, and the communication interval is long enough for active devices to return responses. " + ], + "image_footnote": [], + "bbox": [ + 176, + 82, + 823, + 233 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In our proposed setup, we use $t$ to index the global communication rounds. We say a device participates or is active at round $t$ if it can complete the computation task and send back the update at the end of round $t$ . We define $\\boldsymbol { \\mathcal { A } } ( t )$ as the set of all active devices at round $t$ . Notice that we make no assumptions on the distribution of the participation patterns of devices and allow them to be arbitrary. ", + "bbox": [ + 173, + 299, + 825, + 356 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Directly applying FedAvg to the proposed setup can be problematic due to the existence of inactive devices. To accommodate for inactive devices, we discuss three natural variants of FedAvg and their limitations. The detailed algorithms can be found in Appendix A. ", + "bbox": [ + 176, + 361, + 825, + 404 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "• Biased FedAvg. At each communication round, the global model is updated with a direct average of local updates from the active devices. This naive approach induces bias when data distribution and response patterns vary among devices. \n• FedAvg with device sampling. The server selects a subset of $S$ devices randomly without replacement, and then waits until all devices in the subset $s$ respond. This is how original FedAvg [28] addresses device unavailability. Note that over $T$ communication rounds, the global model is updated less than $T$ times due to waiting. This approach is prone to stragglers and we refer the readers to Section 5.1 for a detailed discussion. \n• FedAvg with importance sampling [26, 13, 17]. The local updates from the active devices are weighted by the reciprocal of the participation probabilities to avoid bias. This approach is only applicable when the response of each device is i.i.d. over rounds and it requires the knowledge of participation probabilities. ", + "bbox": [ + 217, + 417, + 825, + 599 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "4 Memory-augmented Impatient Federated Averaging (MIFA) ", + "text_level": 1, + "bbox": [ + 176, + 621, + 709, + 638 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this section, we introduce our algorithm — Memory-augmented Impatient Federated Averaging (MIFA). MIFA maintains an update-array $\\{ G ^ { i } \\}$ in the memory that stores the latest updates for all devices. As the name suggests, MIFA has two components. First, the algorithm is impatient and avoids waiting for any specific device when facing heterogeneous devices with arbitrary availability. Second, the algorithm augments the received updates of the active devices with the stored updates of the inactive devices to perform averaging. ", + "bbox": [ + 173, + 654, + 825, + 738 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Specifically, at the beginning of round $t$ , the server broadcasts the latest model parameter $w _ { t }$ to all active devices $\\boldsymbol { \\mathcal { A } } ( t )$ . After receiving $w _ { t }$ , each active device, say, the $i$ -th device, sets $w _ { t , 0 } ^ { i } = w _ { t }$ and performs $K$ steps of SGD with respect to the local objective function to get $w _ { t , K } ^ { i }$ : ", + "bbox": [ + 174, + 743, + 825, + 789 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/2c0127a5706cf7944f95df9680a24f67da0062cc0709e170f05907f9d6d3a845.jpg", + "text": "$$\n\\boldsymbol w _ { t , k + 1 } ^ { i } = \\boldsymbol w _ { t , k } ^ { i } - \\eta _ { t } \\tilde { \\nabla } f _ { i } ( \\boldsymbol w _ { t , k } ^ { i } ) , \\boldsymbol k = 0 , \\cdots , \\boldsymbol K - 1 ,\n$$", + "text_format": "latex", + "bbox": [ + 328, + 799, + 666, + 820 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $\\eta _ { t }$ is the learning rate and $\\tilde { \\nabla } f _ { i } ( w _ { t , k } ^ { i } )$ is the stochastic gradient evaluated on device $i$ . Next, the server stores the received update $\\begin{array} { r } { \\frac { 1 } { \\eta _ { t } } \\big ( w _ { t } - w _ { t , K } ^ { i } \\big ) } \\end{array}$ in $G ^ { i }$ . Denote by $\\{ G _ { t } ^ { i } \\}$ the update-array after round $t$ , then we have ", + "bbox": [ + 173, + 830, + 826, + 878 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/72c964c9acb692ffa258397e5523d41c405bf9354c410c37349066a92c8e4d6d.jpg", + "text": "$$\n\\begin{array} { r } { G _ { t } ^ { i } = \\left\\{ \\begin{array} { l l } { G _ { t - 1 } ^ { i } , } & { \\mathrm { ~ i f ~ } i \\notin \\mathcal { A } ( t ) , } \\\\ { \\frac { 1 } { \\eta _ { t } } ( w _ { t } - w _ { t , K } ^ { i } ) , } & { \\mathrm { ~ i f ~ } i \\in \\mathcal { A } ( t ) . } \\end{array} \\right. } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 362, + 880, + 627, + 916 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "At the end of round $t$ , the server updates the global model with the average of $\\{ G _ { t } ^ { i } \\}$ (line 9). In other words, our algorithm MIFA updates the model with the latest available accumulated gradients for all devices. ", + "bbox": [ + 174, + 90, + 823, + 132 + ], + "page_idx": 4 + }, + { + "type": "table", + "img_path": "images/5471198ff0b654b45b8a140b5c46c5f6e75ff5794c1529023b59736618813d80.jpg", + "table_caption": [ + "Algorithm 1 Memory-augmented Impatient Federated Averaging (MIFA) " + ], + "table_footnote": [], + "table_body": "
1: Input: initial wi,learning rate {nt }
2: Server executes:1: DeviceUpdate(i, Wt , nt):
3: initialize Gi ←O,i∈[N]2:w,←Wt
4: fort=1,.,T-1do3: for local step k = O,.,K -1 do
5: broadcast wt to all active devices i ∈ A(t) 4:compute stochastic gradient Vfi(wt,)
6: for each active device idoWk+1←W,k-ntvfi(w,) 5:
7: G ←DeviceUpdate(i,Wt, nt) 8: end for6: end for
Wt+1←wt-∑1 N 9: Gi7:Return (wt - wi,k) to the server
", + "bbox": [ + 178, + 164, + 810, + 304 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "MIFA efficiently progresses without waiting for inactive devices and re-uses their latest updates as the surrogate for missing responses. Being impatient accelerates convergence, whereas memory augmentation corrects the update bias. Our algorithm differs from asynchronous algorithms in traditional distributed optimization [35, 4, 27, 11, 45, 1, 13, 6] in that we utilize the noisy updates of inactive devices more than once to avoid biasing against stragglers. In the following part of the paper, we show that MIFA successfully exploits information about the descent direction contained in the stale and noisy gradients. ", + "bbox": [ + 173, + 320, + 825, + 417 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Discussion on implementation. In practice, to implement MIFA, the server needs to maintain a huge array to store the latest update for each device, which scales with the model size and the total number of devices. To avoid exhausting the server’s memory, one strategy is to distribute the memory consumption among devices. Specifically, each device, say the $i$ -th, stores its previous update $G _ { t _ { i } ^ { \\prime } } ^ { \\ i }$ computed at round $t _ { i } ^ { \\prime }$ in its local memory. When it becomes active and computes $G _ { t } ^ { i }$ , the device sends $G _ { t } ^ { i } - G _ { t _ { i } ^ { \\prime } } ^ { i }$ to the server, which is the difference between the current update and the previous one. In this case, the server only needs to maintain the average $\\bar { G }$ in the memory and updates it by $\\begin{array} { r } { \\bar { G } _ { t } = \\bar { G } _ { t - 1 } + \\frac { 1 } { N } \\sum _ { i \\in \\mathcal { A } ( t ) } ( G _ { t } ^ { \\bar { i } } - G _ { t _ { i } ^ { \\prime } } ^ { i } ) } \\end{array}$ at round $t$ . Then the server updates the global model by $w _ { t + 1 } = w _ { t } - \\eta _ { t } \\bar { G } _ { t }$ . ", + "bbox": [ + 173, + 422, + 825, + 563 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "5 Convergence Analysis for strongly convex objective functions ", + "text_level": 1, + "bbox": [ + 173, + 582, + 714, + 599 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this section, we present the convergence results for MIFA on $\\mu$ -strongly convex $L$ -smooth functions. Typical examples for the strongly convex case are $\\ell _ { 2 }$ regularized logistic regression and linear regression problems. ", + "bbox": [ + 173, + 613, + 826, + 655 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In order to capture how the unavailability of devices affects algorithm performance, we introduce the following notion to quantify the dynamics of devices in our setting. ", + "bbox": [ + 173, + 660, + 823, + 689 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Definition 5.1 (Number of inactive rounds). We define the number of inactive rounds of device $i$ at round $t$ as $\\tau ( t , i ) = t - \\operatorname* { m a x } \\{ t ^ { \\prime } \\mid t ^ { \\prime } \\leq t , i \\in A ( t ^ { \\prime } ) \\}$ , which is the difference between current round $t$ and the latest round when device $i$ is active. ", + "bbox": [ + 174, + 693, + 826, + 734 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "It can be seen that $\\tau ( t , i ) = 0$ if device $i$ is active at round $t$ and $\\tau ( t , i ) = \\tau ( t - 1 , i ) + 1$ otherwise. Also, $t - \\tau ( t , i )$ is the latest round when the device $i$ is active. Next, we present the assumptions made for establishing our convergence theorem. ", + "bbox": [ + 173, + 746, + 826, + 787 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Assumption 1. $f _ { 1 } , \\cdots , f _ { N }$ are all $L$ -smooth, i.e., for all $w$ and $v _ { \\scriptscriptstyle { i } }$ , $\\begin{array} { r c l } { f _ { i } ( v ) } & { \\leq } & { f _ { i } ( w ) \\ + } \\end{array}$ $\\begin{array} { r } { \\left. \\nabla f _ { i } ( w ) , v - w \\right. + \\frac { L } { 2 } \\left\\| w - v \\right\\| ^ { 2 } } \\end{array}$ . ", + "bbox": [ + 173, + 791, + 825, + 825 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Assumption 2. $\\tilde { \\nabla } f _ { i } ( \\boldsymbol { w } )$ is an unbiased estimator of $\\nabla f _ { i }$ with variance bounded by $\\sigma ^ { 2 }$ , i.e., $\\mathbb { E } _ { \\boldsymbol { \\xi } } \\left[ \\tilde { \\nabla } f _ { i } ( \\boldsymbol { w } ) \\right] = \\nabla f _ { i } ( \\boldsymbol { w } ) , \\mathbb { E } _ { \\boldsymbol { \\xi } } \\left[ \\left\\| \\tilde { \\nabla } f _ { i } ( \\boldsymbol { w } ) - \\nabla f _ { i } ( \\boldsymbol { w } ) \\right\\| ^ { 2 } \\right] \\leq \\sigma ^ { 2 } .$ . ", + "bbox": [ + 173, + 829, + 826, + 877 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Assumption 3. $f _ { 1 } , \\cdots , f _ { N }$ are all $\\mu$ -strongly convex: for all $w$ and $v _ { \\scriptscriptstyle { i } }$ , $f _ { i } ( v ) \\geq f _ { i } ( w ) +$ $\\begin{array} { r } { \\left. \\nabla f _ { i } ( w ) , v - w \\right. + \\frac { \\mu } { 2 } \\left\\| w - v \\right\\| ^ { 2 } } \\end{array}$ . ", + "bbox": [ + 173, + 880, + 826, + 914 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Assumption 4. There exists a constant $t _ { 0 } > 0$ , such that for all $t \\geq 1$ and $i \\in [ N ]$ , the number of inactive rounds of device $i$ at communication round $t$ satisfies $\\begin{array} { r } { \\tau ( t , i ) \\leq t _ { 0 } + \\frac { 1 } { b } \\dot { t } } \\end{array}$ , where $b =$ $4 0 \\left( L / \\mu \\right) ^ { 1 . 5 }$ . ", + "bbox": [ + 173, + 90, + 825, + 137 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Assumptions 1, 2, and 3 are standard and common in the FL literature, e.g., [26, 18, 19, 42, 36]. In Assumption 2, we relax the bounded gradient assumption that is often required in prior work, e.g., [6, 26, 40, 1]. Lastly, Assumption 4 is a very mild assumption on device availability, since it allows the number of inactive rounds to grow as ${ \\mathcal { O } } ( t )$ . In contrast, existing results on asynchronous updates mostly assume a bounded or fixed latency, e.g., [6, 1, 5, 40, 35, 4]. ", + "bbox": [ + 173, + 146, + 826, + 217 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We are now ready to present our first convergence result. Define $\\begin{array} { r l } { D = } & { { } \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\left. \\nabla f _ { i } ( w _ { * } ) \\right. ^ { 2 } } \\end{array}$ to measure data dissimilarity, where $w _ { * } = \\arg \\operatorname* { m i n } f ( w )$ is the global optimum. Also, define $\\bar { \\tau } _ { T }$ and $\\tau _ { \\operatorname* { m a x } , T }$ to be the average and maximum numbers of inactive rounds $\\tau ( t , i )$ across all devices and rounds, respectively. That is, ", + "bbox": [ + 173, + 222, + 826, + 281 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/733c5805d202f72a1df49e8a211f10a98cbaf3e0246f5f2ede823112da4e143c.jpg", + "text": "$$\n\\bar { \\tau } _ { T } = \\frac { 1 } { N ( T - 1 ) } \\sum _ { t = 1 } ^ { T - 1 } \\sum _ { i = 1 } ^ { N } \\tau ( t , i ) , \\tau _ { \\operatorname* { m a x } , T } = \\operatorname* { m a x } _ { i \\in [ N ] } \\operatorname* { m a x } _ { 1 \\leq t \\leq T - 1 } \\tau ( t , i ) .\n$$", + "text_format": "latex", + "bbox": [ + 281, + 282, + 717, + 327 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The following theorem summarizes the performance of MIFA in this case. ", + "bbox": [ + 174, + 335, + 655, + 351 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Theorem 5.1. Assume that Assumptions $^ { l }$ to 3 hold. Further assume that the device availability sequence $\\tau ( t , i )$ satisfies Assumption $^ { 4 }$ and $\\tau ( 1 , i ) = 0$ for all $i \\in [ N ]$ . By setting the learning rate $\\begin{array} { r } { \\eta _ { t } = \\frac { 4 } { \\mu K ( t + a ) } } \\end{array}$ with $a = \\operatorname* { m a x } \\{ 1 0 0 , 4 0 t _ { 0 } \\} ( L / \\mu ) ^ { 1 . 5 }$ , after $T - 1$ communication rounds, MIFA satisfies: ", + "bbox": [ + 173, + 352, + 825, + 410 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/a586eb10027a5e2bde1e4b791106324315628fa6d12e02e2e3e3c1ae021cee54.jpg", + "text": "$$\n\\mathbb { E } _ { \\xi } \\left[ f ( \\overline { { w } } _ { T } ) \\right] - f ( w _ { * } ) = \\mathcal { O } \\left( \\frac { \\bar { \\tau } _ { T } + 1 } { \\mu N K T } \\sigma ^ { 2 } + \\frac { \\tau _ { \\operatorname* { m a x } , T } ^ { 2 } A _ { 1 } + ( K - 1 ) ^ { 2 } A _ { 2 } + A _ { 3 } } { \\mu ^ { 2 } T ^ { 2 } } \\right) ,\n$$", + "text_format": "latex", + "bbox": [ + 240, + 412, + 754, + 455 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\overline { { w } } _ { T }$ is a weighted average of $w _ { t }$ defined as: ", + "bbox": [ + 173, + 463, + 501, + 478 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/467ef08efd364fd1d849ca3dc16aa8bd25b2ad4ef2f4136b25ee850e32438dab.jpg", + "text": "$$\n\\overline { { w } } _ { T } = \\frac { 1 } { W _ { T } } \\sum _ { t = 1 } ^ { T } ( t + a - 1 ) ( t + a - 2 ) w _ { t } , W _ { T } = \\sum _ { t = 1 } ^ { T } ( t + a - 1 ) ( t + a - 2 ) ,\n$$", + "text_format": "latex", + "bbox": [ + 243, + 481, + 751, + 523 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Our results hold under Assumption 4, which allows for arbitrary device availability sequences with $\\tau _ { \\mathrm { m a x } , T } = \\mathcal { O } ( T )$ . However, for MIFA to converge, we require $\\tau _ { \\operatorname* { m a x } , T } = o ( T )$ and $\\dot { t _ { 0 } } = \\bar { o } ( T )$ . When ( NK(τ2max,T +t20)τ¯+1 ), the first term dominates and the impact of the second O(1/T 2) term is negligible. In fact the first term in Theorem 5.1 is minimax optimal by our information-theoretic lower bound for the problem in the next proposition. ", + "bbox": [ + 173, + 559, + 825, + 638 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Proposition 5.1. Let $c _ { 0 } > 0$ be a universal constant. For any potentially randomized algorithm, there exists a stochastic strongly convex problem satisfying Assumptions $^ { l }$ to 3, such that the output $w _ { T }$ after $T$ rounds of communication has expected sub-optimality lower bounded by ", + "bbox": [ + 173, + 640, + 823, + 683 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/15944ea925ca625bc0c3fb0cf5ed413d2deb8aa7ced28f61f9ba449d3ce641aa.jpg", + "text": "$$\n\\mathbb { E } [ f ( w _ { T } ) - f ( w ^ { * } ) ] \\geq c _ { 0 } \\frac { \\bar { \\tau } _ { T } \\sigma ^ { 2 } } { \\mu N K T } .\n$$", + "text_format": "latex", + "bbox": [ + 385, + 685, + 611, + 719 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The proof is based on the observation that the number of gradient evaluation can scale inversely with $\\bar { \\tau } _ { T }$ and that the oracle complexity is tight even for centralized stochastic optimization problems. The optimality of the first term in Theorem 5.1 is independent of the distributed or the FL setup. ", + "bbox": [ + 174, + 727, + 823, + 770 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The second term in Theorem 5.1 converges at the rate $\\mathcal { O } ( 1 / T ^ { 2 } )$ and consists of three parts, where the first part reflects the slowdown caused by device unavailability through $\\tau _ { \\operatorname* { m a x } , T }$ , the second part shows the effect of multiple $( K > 1 )$ ) local steps, and the third part tells how the initial error decreases. ", + "bbox": [ + 173, + 775, + 826, + 818 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Remark 5.1. When $\\tau ( t , i ) ~ = ~ 0$ for all $i$ and $t _ { : }$ , our setup reduces to FedAvg with full device pbound $\\bar { \\tau } _ { T } ~ = ~ 0$ d , $\\tau _ { \\mathrm { m a x } , T } ~ = ~ 0$ . Iate $\\begin{array} { r } { \\mathcal { O } \\left( \\frac { \\sigma ^ { 2 } } { \\mu K N T } + \\frac { L ( \\sigma ^ { 2 } / K + D + L ^ { 2 } \\| w _ { 1 } - w _ { * } \\| ^ { 2 } ) } { \\mu ^ { 2 } T ^ { 2 } } \\right) } \\end{array}$ $\\begin{array} { r } { \\mathcal { O } \\bigg ( \\frac { \\sigma ^ { 2 } \\log T } { \\mu K N T } + \\frac { L ( \\sigma ^ { 2 } / K + D ) ( \\log T ) ^ { 2 } } { \\mu ^ { 2 } T ^ { 2 } } + } \\end{array}$ $\\begin{array} { r } { \\mu \\left. w _ { 1 } - w _ { * } \\right. ^ { 2 } \\exp ( - \\frac { \\mu } { 4 8 L } T ) \\Bigr ) } \\end{array}$ in [18] (Thm. V. $B ^ { 2 } = 2 , \\eta _ { g } = 1 ,$ ) up to logarithmic terms. Besides, in the general case, our $\\mathcal { O } ( \\tau _ { \\mathrm { m a x } , T } ^ { 2 } A _ { 1 } / T ^ { 2 } )$ term matches the last term in $I 6 J \\left( C o r . 5 \\right)$ . ", + "bbox": [ + 173, + 819, + 826, + 915 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Remark 5.2. Our analysis relies on the technical assumption that all devices respond in the first round. Intuitively, this is because we need at least one valid stochastic gradient evaluation for each device to get a complete picture of the global objective, or otherwise any update would be biased. In practice, this can be achieved by waiting for the updates from all devices on $w _ { 1 }$ at the very beginning. ", + "bbox": [ + 173, + 90, + 826, + 147 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5.1 Case Study: i.i.d. Bernoulli participation ", + "text_level": 1, + "bbox": [ + 173, + 164, + 498, + 180 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Though our algorithm can be applied to non-stationary and non-independent response patterns, we show in this subsection that even in the simple i.i.d. Bernoulli participation scenario our algorithm can achieve considerable improvement compared to known algorithms. In particular, we consider a setup where each device becomes active independently with a fixed probability $p _ { i }$ . It serves as the first motivating example towards modeling the participation patterns of devices, and provides a clean view of how the heterogeneity of the device participation influences the Federated optimization algorithms. ", + "bbox": [ + 173, + 189, + 825, + 287 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We will show that in this scenario, Assumption 4 holds with high probability, and the terms involving the inactive rounds $\\tau ( t , i )$ in Theorem 5.1 can also be bounded. Furthermore, we theoretically demonstrate that algorithms such as FedAvg [28] and SCAFFOLD [18], which sample $S$ devices for each global update, are more prone to stragglers than our algorithm. ", + "bbox": [ + 173, + 292, + 825, + 349 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Definition 5.2. Assume that for all $i \\in [ N ]$ , the i-th device is assigned with a probability $p _ { i }$ . We say the participation of the devices follows i.i.d. Bernoulli participation model with participation probabilities $\\{ p _ { i } \\}$ , if (1). at the first round, all devices are active, and (2). at round $t > 1$ , device $i$ is active with probability $p _ { i }$ , which is independent of the history and other devices. ", + "bbox": [ + 173, + 353, + 825, + 410 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Next theorem shows that under i.i.d. Bernoulli participation scenario, with high probability, $\\tau ( t , i )$ only grows logarithmically in $t$ . Also Assumption 4 holds for a mild choice of $t _ { 0 }$ . ", + "bbox": [ + 174, + 420, + 821, + 450 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Theorem 5.2. For i.i.d. Bernoulli participation model defined in Definition 5.2, given any $\\delta > 0$ , with probability at least $1 - \\delta$ , we have the following holds for all $t \\geq 1$ and $i \\in [ N ]$ simultaneously, ", + "bbox": [ + 171, + 454, + 825, + 483 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/39aa0a52372df38b6d9e71e222db332e84efa7cdb81235ae00a0fb9752de5e1b.jpg", + "text": "$$\n\\tau ( t , i ) \\leq \\mathcal { O } \\Big ( \\frac { 1 } { p _ { i } } ( \\log ( N t / \\delta ) + 1 ) \\Big ) .\n$$", + "text_format": "latex", + "bbox": [ + 382, + 489, + 614, + 522 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Furthermore, $( l )$ . Assumption $^ { 4 }$ holds true $\\begin{array} { r } { \\mathrm { \\ddot { \\it f } } t _ { 0 } = \\Omega \\bigg ( \\frac { 1 } { p _ { m i n } } \\log \\frac { b N } { p _ { m i n } \\delta } \\bigg ) } \\end{array}$ , where $p _ { m i n } = \\operatorname* { m i n } \\{ p _ { i } \\}$ , and $b = 4 0 ( L / \\mu ) ^ { 1 . 5 }$ ;(2). $\\tau _ { \\operatorname* { m a x } , T }$ can be upper bounded as ", + "bbox": [ + 173, + 530, + 825, + 570 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/922e99211cb7c2d1fd2b59ad614767b49e2270e68185e6f77ea7f51093a5ac80.jpg", + "text": "$$\n\\tau _ { \\operatorname* { m a x } , T } \\leq \\mathcal { O } \\Big ( \\frac { 1 } { p _ { m i n } } \\cdot \\big ( \\log ( T N / \\delta ) + 1 \\big ) \\Big ) .\n$$", + "text_format": "latex", + "bbox": [ + 359, + 577, + 637, + 609 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The next theorem provides a high probability upper bound for $\\bar { \\tau } _ { T }$ . ", + "bbox": [ + 173, + 622, + 606, + 638 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Theorem 5.3. For i.i.d. Bernoulli participation model defined in Definition 5.2, given any $\\delta > 0$ and $T > 1$ , with probability at least $1 - \\delta$ , we have ", + "bbox": [ + 173, + 642, + 825, + 671 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/79e3a5996cb3f7b4c46ca91911907e624b79420e705c6142b9338d5386fc6e5b.jpg", + "text": "$$\n\\bar { \\tau } _ { T } \\leq \\Big ( \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\frac { 1 } { p _ { i } } \\Big ) \\cdot \\mathcal { O } \\Big ( 1 + \\log \\frac { 1 } { \\delta } \\Big ) .\n$$", + "text_format": "latex", + "bbox": [ + 377, + 678, + 619, + 722 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "By Theorem 5.2 and Theorem 5.3, we conclude that the dominant term of our convergence bound is $\\begin{array} { r } { \\stackrel { \\triangledown } { \\mathcal { O } } \\left( \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\frac { 1 } { p _ { i } } \\cdot \\frac { \\sigma ^ { 2 } } { \\mu N K T } \\right) } \\end{array}$ . Therefore, to achieve $\\epsilon$ accuracy, the dominant term of the number of the required rounds is ", + "bbox": [ + 173, + 734, + 825, + 785 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/d6f389bee97e0f3555558010eb2588b9917d901810a517b05b4f4f415bf814cb.jpg", + "text": "$$\nT _ { \\epsilon } ^ { \\left( \\mathrm { M I F A } \\right) } = \\widetilde { \\mathcal { O } } \\Bigl ( \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\frac { 1 } { p _ { i } } \\cdot \\frac { \\sigma ^ { 2 } } { \\mu N K \\epsilon } \\Bigr ) .\n$$", + "text_format": "latex", + "bbox": [ + 379, + 785, + 617, + 828 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "For both FedAvg and SCAFFOLD that sample $S$ devices uniformly at random, [18] (Thm I. & III.) showed that the dominant term of the number of global updates needed to achieve $\\epsilon$ accuracy is $\\begin{array} { r } { R _ { \\epsilon } = \\widetilde { \\mathcal { O } } \\left( \\frac { \\sigma ^ { 2 } } { \\mu S K \\epsilon } \\right) } \\end{array}$ . Notice that in our setting, to accomplish each global update, the server needs to wait for a few rounds for the $S$ devices to respond. Let $T ( S )$ be the expected rounds for which the server needs to wait for the selected devices $\\boldsymbol { S }$ to be active. Then the expected total rounds to achieve $\\epsilon$ accuracy is $R _ { \\epsilon } \\cdot \\mathbb { E } _ { S } \\left[ T ( S ) \\right]$ . For i.i.d. Bernoulli participation model, we have $\\begin{array} { r } { T ( S ) \\geq \\frac { 1 } { \\operatorname* { m i n } \\{ p _ { i } | i \\in S \\} } } \\end{array}$ , and we can further show that $\\begin{array} { r } { \\mathbb { E } _ { S } \\left[ T ( S ) \\right] \\ge \\frac { 1 } { p _ { m i n } } \\frac { S } { N } } \\end{array}$ ≥ 1p min SN ( see Appendix D.3 for details). Therefore, ", + "bbox": [ + 173, + 830, + 825, + 912 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 89, + 828, + 128 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/4ba801327622edadc3d535bd6d82d30aa8d7d969b43ccdf1e9db7ea55271f48d.jpg", + "text": "$$\n\\mathbb { E } \\left[ T _ { \\epsilon } ^ { ( \\mathsf { F e d A v g , S C A F F O L D } ) } \\right] \\geq \\frac { S } { N } \\frac { 1 } { p _ { m i n } } \\widetilde { \\mathcal { O } } \\Big ( \\frac { \\sigma ^ { 2 } } { \\mu S K \\epsilon } \\Big ) = \\widetilde { \\mathcal { O } } \\Big ( \\frac { 1 } { p _ { m i n } } \\cdot \\frac { \\sigma ^ { 2 } } { \\mu N K \\epsilon } \\Big ) .\n$$", + "text_format": "latex", + "bbox": [ + 267, + 130, + 728, + 164 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "By comparing Eqn. 2 and Eqn. 3, we see that both FedAvg and SCAFFOLD are more vulnerable to stragglers, that is, the devices with very small participation probabilities; on the contrary, the convergence rate of MIFA only depends on the average of $1 / p _ { i }$ instead of $1 / p _ { m i n }$ . We also provide empirical experiments showing that MIFA converges faster than FedAvg in Section 7. ", + "bbox": [ + 173, + 165, + 825, + 222 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "6 Convergence result for non-convex objective functions ", + "text_level": 1, + "bbox": [ + 173, + 238, + 656, + 256 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In this section, we present the convergence guarantee of MIFA for the non-convex case. First we list the additional assumptions as below. ", + "bbox": [ + 173, + 268, + 823, + 297 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Assumption 5 (Hessian Lipschitz). $f _ { 1 } , \\cdots , f _ { N }$ are all $\\rho$ -Hessian Lipschitz: for all $w$ and $v$ $\\bigl \\| \\nabla ^ { 2 } f _ { i } \\bigl ( \\tilde { \\boldsymbol { w } } \\bigr ) - \\nabla ^ { 2 } f _ { i } ( \\boldsymbol { v } ) \\bigr \\| \\leq \\dot { \\rho } \\bigl \\| \\boldsymbol { w } - \\boldsymbol { \\tilde { v } } \\bigr \\|$ . ", + "bbox": [ + 176, + 299, + 825, + 329 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Assumption 6 (Bounded noise). The noise of the local stochastic gradients is upper bounded by $a$ constant $\\delta$ almost surely: $\\begin{array} { r } { \\left\\| \\tilde { \\nabla } f _ { i } ( w ) - \\nabla f _ { i } ( w ) \\right\\| \\le \\delta a . s . , \\forall i \\in [ N ] } \\end{array}$ . ", + "bbox": [ + 173, + 330, + 823, + 368 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Assand y). There exist . Furthermore, $\\alpha > 0$ anfine $\\beta _ { i } > 0$ at for all . $w$ $\\in [ N ] \\colon \\left\\| \\nabla f _ { i } ( w ) \\right\\| ^ { 2 } \\leq \\alpha \\left\\| \\nabla f ( w ) \\right\\| ^ { 2 } + \\beta _ { i }$ $\\begin{array} { r } { \\beta = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\beta _ { i } } \\end{array}$ ", + "bbox": [ + 173, + 369, + 823, + 402 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Assumption 8. There exists a constant $\\nu _ { i }$ such that $\\tau ( t , i ) \\ \\leq \\ \\nu _ { i }$ , for all $i \\in [ N ]$ and $t \\geq 1$ Furthermore, define ν¯ = 1N PNi=1 νi and νmax = maxi∈[N] νi. ", + "bbox": [ + 173, + 404, + 821, + 438 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The analysis of non-convex functions is much more technically involved, and our results rely on strong assumptions that provide a finer control of the gradient difference (Assumption 5), gradient noise (Assumption 6), gradient dissimilarity among devices (Assumption 7), and device unavailability (Assumption 8). We remark that Assumption 5 is also made in [9, 16], and Assumption 7 is also made in [18, 39]. We leave it as future work to study whether and how MIFA converges for non-convex functions with weaker assumptions. ", + "bbox": [ + 173, + 443, + 825, + 526 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Theorem 6.1. Assume that Assumptions $I , ~ 2 , ~$ , and $^ { 5 }$ to 7 hold. Further assume that the device availability sequence $\\tau ( t , i )$ satisfies Assumption 8 and $\\tau ( 1 , i ) = 0$ for all $i \\in [ N ]$ . By using $a$ learning rate η = q $\\begin{array} { r } { \\eta = \\sqrt { \\frac { N } { K T L \\left( 1 + \\bar { \\nu } \\right) } } } \\end{array}$ NKT L(1+¯ν), for T ≥ max{32αLNK, 16LNK , 8KNν2max(L2+ρδ) }, after T − 1 communication rounds, MIFA satisfies: ", + "bbox": [ + 173, + 529, + 826, + 594 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/2ffd78cf10bfd3d236632f49cd6b6cd64bc3d08d3e2f60866f445ed97510c80b.jpg", + "text": "$$\n\\operatorname* { m i n } _ { 1 \\leq t \\leq T } \\mathbb { E } _ { \\xi } \\left[ \\left\\| \\nabla f ( w _ { t } ) \\right\\| ^ { 2 } \\right] = \\mathcal { O } \\left( \\sqrt { \\frac { ( 1 + \\bar { \\nu } ) L } { T K N } } ( f ( w _ { 1 } ) - f ^ { * } + \\sigma ^ { 2 } ) + \\frac { A _ { 4 } + A _ { 5 } } { T } \\right) ,\n$$", + "text_format": "latex", + "bbox": [ + 236, + 597, + 759, + 638 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $f ^ { * }$ is the optimal value, and: ", + "bbox": [ + 174, + 640, + 406, + 655 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/068374b3ecfcb8e112e697b4b2961eec732c2ae914494131485a106df94ed394.jpg", + "text": "$$\n\\begin{array} { l } { { A _ { 4 } = N K L \\left( \\alpha \\sigma ^ { 2 } \\hat { \\nu } + \\frac { \\sigma ^ { 2 } \\nu _ { \\mathrm { m a x } } } { \\sqrt { K N } } + \\sigma \\nu _ { \\mathrm { m a x } } \\sqrt { \\beta } \\right) + \\frac { { ( L ^ { 2 } + \\rho \\delta ) \\sigma ^ { 2 } \\nu _ { \\mathrm { m a x } } } } { L } , } } \\\\ { { A _ { 5 } = \\frac { { ( K - 1 ) N L ( \\beta + \\sigma ^ { 2 } / K ) } } { \\hat { \\nu } + 1 } . } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 269, + 656, + 727, + 727 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Next, we show that the leading $\\mathcal { O } ( 1 / \\sqrt { T } )$ term is theoretically optimal for zero-respecting algorithms. ", + "bbox": [ + 171, + 733, + 825, + 751 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Proposition 6.1. Let $c _ { 0 } > 0$ be a universal constant. For any randomized zero-respecting algorithm, there exists a stochastic non-convex problem satisfying Assumption1, 2, 5 and 7, such that the output $w _ { T }$ after $T$ rounds of communication has expected sub-optimality lower bounded by ", + "bbox": [ + 173, + 752, + 825, + 795 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/ca9299cdc027e71b6e299a9e1e31a7cd5c2809df369d439bba1b7aba2e00a1ef.jpg", + "text": "$$\n\\mathbb { E } [ \\| \\nabla f ( w _ { T } ) \\| ^ { 2 } ] \\ge \\mathbb { E } [ \\| \\nabla f ( w _ { T } ) \\| ] ^ { 2 } \\ge c _ { 0 } \\sqrt { \\frac { \\bar { \\nu } L \\sigma ^ { 2 } ( f ( w _ { 0 } ) - f ^ { * } ) } { N K T } } .\n$$", + "text_format": "latex", + "bbox": [ + 289, + 796, + 707, + 830 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The above proposition show that when $\\sigma \\sqrt { ( f ( w _ { 0 } ) - f ^ { * } ) } \\sim \\sigma ^ { 2 } + ( f ( w _ { 0 } ) - f ^ { * } )$ , the result in Theorem 6.1 is tight. However, note that the counter example we used requires the quantity $\\delta$ in Assumption 6 to scale with $T$ , hence requiring $\\delta$ to be large enough. This does not change the optimality of the first term as the first term is independent of $\\delta$ . Whether this requirement can be relaxed is left as an open problem. ", + "bbox": [ + 173, + 840, + 825, + 912 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Remark 6.1. When all $\\nu _ { i } = 0$ (i.e. all the devices are active), our convergence bound reduces to $\\begin{array} { r } { \\mathcal { O } \\Big ( \\sqrt { \\frac { L } { T K N } } ( f ( w _ { 1 } ) - f ^ { * } + \\sigma ^ { 2 } ) + \\frac { ( K - 1 ) N L ( \\beta + \\sigma ^ { 2 } / K ) } { T } \\Big ) } \\end{array}$ . This matches the result in [42] (Thm. 1, $\\begin{array} { r } { \\eta = 1 , \\eta _ { L } = \\sqrt { \\frac { N } { K T L } } ) } \\end{array}$ . ", + "bbox": [ + 173, + 90, + 826, + 155 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "7 Numerical Experiments ", + "text_level": 1, + "bbox": [ + 174, + 171, + 405, + 189 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In this section, we conduct numerical experiments3. to verify our theoretical results and investigate how the heterogeneity of the device availability influences the Federated optimization algorithms. We compare the performance of the following four algorithms: FedAvg with importance sampling (FedAvg-IS), Biased FedAvg, FedAvg with device sampling, and our proposed MIFA. For the detailed discussions of the algorithms, we refer the readers to Sections 3 and 4. We remark that for a fair comparison, we deliberately include the first few rounds that MIFA needs to wait to receive responses from all devices for initializing the update-array $\\{ G ^ { i } \\}$ . ", + "bbox": [ + 173, + 202, + 825, + 300 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Following [26, 25], we construct non-i.i.d. datasets from two commonly used computer vision datasets — MNIST [23] and CIFAR-10 [22] . Specifically, we divide the data into $N = 1 0 0$ devices with each device holding samples of only two classes, which creates a high level of data heterogeneity. For simplicity, we ensure that each device holds the same number of samples. We do not use any data augmentation. We use multinomial logistic regression as the convex model and LeNet-5 [24] with ReLU activations as the non-convex model. For all experiments, we use weight decay in the training process, which corresponds to adding $\\ell _ { 2 }$ penalty. We use logistic models for MNIST dataset, while we use LeNet-5 for CIFAR-10. Our code is adapted from [26], which is under MIT License. ", + "bbox": [ + 174, + 305, + 825, + 416 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We model the availability of the devices as independent Bernoulli random trials. The $i \\cdot$ -th device is assigned with a probability $p _ { i }$ , where at each time step, the device becomes active with probability $p _ { i }$ . In our experiments, the $p _ { i }$ ’s are chosen such that devices holding data of smaller labels participate less frequently. Specifically, if the $i$ -th device holds the data of label $j$ and $k$ , we set $\\bar { p } _ { i } = \\bar { p _ { \\operatorname* { m i n } } } \\operatorname* { m i n } ( j , k ) / 9 + \\bar { ( 1 - p _ { \\operatorname* { m i n } } ) }$ , where $p _ { \\mathrm { m i n } }$ controls the lower bound of the participation probabilities. The correlation between the participation patterns and local datasets increases the difficulty of the problem [17]. To investigate this phenomenon, we repeat the experiments for $p _ { \\mathrm { m i n } } = 0 . 1$ and 0.2. We control the randomness of device participation when testing different algorithms. ", + "bbox": [ + 173, + 422, + 825, + 534 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In all the experiments, we set the initial learning rate to be $\\eta _ { 0 } = 0 . 1$ and decay the learning rate as $\\begin{array} { r } { \\eta _ { t } = \\eta _ { 0 } \\cdot \\frac { 1 } { t } } \\end{array}$ . We set the weight decay to be 0.001. The local batch size is 100 and each local update consists of 2 epochs. Therefore, the actual number of local steps $K$ depends on the size of the dataset. We run all the experiments with 4 GPUs of type GeForce RTX 2080 Ti. We repeat the experiments for 5 different random seeds, and all of the experiments exhibit similar training curves. We report the averaged training loss and test accuracy with error bars in Figure 2. ", + "bbox": [ + 173, + 540, + 825, + 623 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We observe that FedAvg with device sampling (FedAvg ( $S = 5 0$ ) and FedAvg $S = 1 0 0$ ) in Figure 2) is severely influenced by the straggling devices and makes progress relatively slowly compared to the other algorithms. Although biased FedAvg converges fast at the beginning, this simple algorithm is biased, and the optimality gaps are prominent for the harder CIFAR-10 dataset and when $p _ { \\mathrm { m i n } }$ is small. On the contrary, our proposed MIFA avoids waiting for stragglers, converges fast without bias, and is competitive with FedAvg with importance sampling, which requires knowledge of the participation probabilities. We refer the readers to Appendix G for additional experiments on CIFAR-10. ", + "bbox": [ + 173, + 628, + 825, + 727 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "8 Conclusions and Discussions ", + "text_level": 1, + "bbox": [ + 174, + 744, + 444, + 762 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In this paper, we study FL algorithms in the presence of arbitrary device unavailability and propose MIFA, which avoids waiting for straggling devices and re-uses the memorized latest updates as the surrogate when the device is unavailable. We theoretically analyze MIFA without any structural assumptions on the device availability and prove the convergence for strongly convex and non-convex smooth functions. Different from the literature that studies oracle complexity in terms of stochastic gradient evaluations, we argue that in federated learning system, the bottleneck lies in the nonstationary and possibly adversarial pattern of device participation. Therefore, it is important to study how the number of inactive rounds influences the convergence rate. In Theorem 5.1, the dependency upon $\\tau _ { \\operatorname* { m a x } , T }$ might be an artifact of our analysis, and a future direction is to study whether we can remove this dependency. Another important direction is to analyze algorithms for non-convex functions under weaker assumptions. ", + "bbox": [ + 173, + 776, + 825, + 887 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/c1142e9ecbf7a3052e86380ac3f4c818747910b17c29f238aaf9134bafeb112a.jpg", + "image_caption": [ + "Figure 2: Training losses and test accuracies. Fig. 2(a)–2(d): logistic models on non-iid MNIST. Fig. 2(e)–2(h): LeNet-5 on non-iid CIFAR-10. FedAvg $S = 5 0$ ) and FedAvg $S = 1 0 0$ ) refer to FedAvg with device sampling that samples $S$ devices for each global update. FedAvg-IS is short for FedAvg with importance sampling, which requires knowledge of the participation probabilities. " + ], + "image_footnote": [], + "bbox": [ + 178, + 80, + 818, + 316 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 398, + 825, + 440 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Acknowledgments and Disclosure of Funding ", + "text_level": 1, + "bbox": [ + 174, + 459, + 553, + 478 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "The work of Xinran Gu and Longbo Huang is supported in part by the Technology and Innovation Major Project of the Ministry of Science and Technology of China under Grant 2020AAA0108400 and2020AAA0108403. Xinran Gu would like to thank Kaifeng Lyu for the discussion on the convergence analysis. The authors would like to thank Sai Praneeth Karimireddy for the discussion on the problem settings. ", + "bbox": [ + 174, + 491, + 825, + 560 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "References ", + "text_level": 1, + "bbox": [ + 174, + 580, + 266, + 597 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "[1] Alekh Agarwal and John C Duchi. Distributed delayed stochastic optimization. In 2012 IEEE 51st IEEE Conference on Decision and Control (CDC), pages 5451–5452. IEEE, 2012. \n[2] Alekh Agarwal, Martin J Wainwright, Peter Bartlett, and Pradeep Ravikumar. Informationtheoretic lower bounds on the oracle complexity of convex optimization. Advances in Neural Information Processing Systems, 22:1–9, 2009. \n[3] Yossi Arjevani, Yair Carmon, John C. Duchi, Dylan J. Foster, Nathan Srebro, and Blake Woodworth. Lower bounds for non-convex stochastic optimization, 2019. \n[4] Yossi Arjevani, Ohad Shamir, and Nathan Srebro. A tight convergence analysis for stochastic gradient descent with delayed updates. In Algorithmic Learning Theory, pages 111–132. PMLR, 2020. \n[5] Arda Aytekin, Hamid Reza Feyzmahdavian, and Mikael Johansson. Analysis and implementation of an asynchronous optimization algorithm for the parameter server. arXiv preprint arXiv:1610.05507, 2016. \n[6] Debraj Basu, Deepesh Data, Can Karakus, and Suhas Diggavi. Qsparse-local-sgd: Distributed sgd with quantization, sparsification, and local computations. arXiv preprint arXiv:1906.02367, 2019. \n[7] Keith Bonawitz, Hubert Eichner, Wolfgang Grieskamp, Dzmitry Huba, Alex Ingerman, Vladimir Ivanov, Chloé Kiddon, Jakub Konecný, Stefano Mazzocchi, Brendan McMahan, Timon ˇ ", + "bbox": [ + 179, + 603, + 828, + 912 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Van Overveldt, David Petrou, Daniel Ramage, and Jason Roselander. Towards federated learning at scale: System design. In A. Talwalkar, V. Smith, and M. Zaharia, editors, Proceedings of Machine Learning and Systems, volume 1, pages 374–388, 2019. ", + "bbox": [ + 205, + 90, + 825, + 133 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[8] Sébastien Bubeck, Nicolo Cesa-Bianchi, and Gábor Lugosi. Bandits with heavy tail. IEEE Transactions on Information Theory, 59(11):7711–7717, 2013. ", + "bbox": [ + 179, + 141, + 823, + 171 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[9] Yair Carmon, John C Duchi, Oliver Hinder, and Aaron Sidford. Accelerated methods for nonconvex optimization. SIAM Journal on Optimization, 28(2):1751–1772, 2018. ", + "bbox": [ + 179, + 178, + 823, + 208 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[10] Hubert Eichner, Tomer Koren, Brendan McMahan, Nathan Srebro, and Kunal Talwar. Semicyclic stochastic gradient descent. In International Conference on Machine Learning, pages 1764–1773. PMLR, 2019. ", + "bbox": [ + 174, + 215, + 825, + 258 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[11] Hamid Reza Feyzmahdavian, Arda Aytekin, and Mikael Johansson. An asynchronous minibatch algorithm for regularized stochastic optimization. IEEE Transactions on Automatic Control, 61(12):3740–3754, 2016. ", + "bbox": [ + 173, + 266, + 825, + 309 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[12] Saeed Ghadimi and Guanghui Lan. Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization i: A generic algorithmic framework. SIAM Journal on Optimization, 22(4):1469–1492, 2012. ", + "bbox": [ + 173, + 316, + 823, + 359 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[13] Margalit Glasgow and Mary Wootters. Asynchronous distributed optimization with stochastic delays. arXiv preprint arXiv:2009.10717, 2020. ", + "bbox": [ + 171, + 367, + 825, + 396 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[14] Eduard Gorbunov, Konstantin P. Burlachenko, Zhize Li, and Peter Richtarik. Marina: Faster non-convex distributed learning with compression. In Marina Meila and Tong Zhang, editors, Proceedings of the 38th International Conference on Machine Learning, volume 139 of Proceedings of Machine Learning Research, pages 3788–3798. PMLR, 18–24 Jul 2021. ", + "bbox": [ + 173, + 404, + 826, + 460 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[15] Tzu-Ming Harry Hsu, Hang Qi, and Matthew Brown. Measuring the effects of non-identical data distribution for federated visual classification. arXiv preprint arXiv:1909.06335, 2019. ", + "bbox": [ + 171, + 468, + 823, + 497 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[16] Chi Jin, Rong Ge, Praneeth Netrapalli, Sham M Kakade, and Michael I Jordan. How to escape saddle points efficiently. In International Conference on Machine Learning, pages 1724–1732. PMLR, 2017. ", + "bbox": [ + 174, + 505, + 823, + 547 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[17] Peter Kairouz, H Brendan McMahan, Brendan Avent, Aurélien Bellet, Mehdi Bennis, Arjun Nitin Bhagoji, Keith Bonawitz, Zachary Charles, Graham Cormode, Rachel Cummings, et al. Advances and open problems in federated learning. arXiv preprint arXiv:1912.04977, 2019. ", + "bbox": [ + 173, + 555, + 826, + 612 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[18] Sai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank Reddi, Sebastian Stich, and Ananda Theertha Suresh. Scaffold: Stochastic controlled averaging for federated learning. In International Conference on Machine Learning, pages 5132–5143. PMLR, 2020. ", + "bbox": [ + 171, + 619, + 821, + 664 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[19] Ahmed Khaled, Konstantin Mishchenko, and Peter Richtárik. Tighter theory for local sgd on identical and heterogeneous data. In International Conference on Artificial Intelligence and Statistics, pages 4519–4529. PMLR, 2020. ", + "bbox": [ + 171, + 670, + 823, + 713 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[20] Jakub Konecnˇ y, Brendan McMahan, and Daniel Ramage. Federated optimization: Distributed \\` optimization beyond the datacenter. arXiv preprint arXiv:1511.03575, 2015. ", + "bbox": [ + 171, + 720, + 821, + 751 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[21] Jakub Konecnˇ y, H Brendan McMahan, Daniel Ramage, and Peter Richtárik. Federated optimiza- \\` tion: Distributed machine learning for on-device intelligence. arXiv preprint arXiv:1610.02527, 2016. ", + "bbox": [ + 173, + 758, + 823, + 801 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[22] Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images. 2009. ", + "bbox": [ + 173, + 809, + 823, + 838 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[23] Yann LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner. Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998. ", + "bbox": [ + 173, + 845, + 823, + 876 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[24] Yann LeCun et al. Lenet-5, convolutional neural networks. URL: http://yann. lecun. com/exdb/lenet, 20(5):14, 2015. ", + "bbox": [ + 171, + 882, + 825, + 911 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "[25] Tian Li, Anit Kumar Sahu, Manzil Zaheer, Maziar Sanjabi, Ameet Talwalkar, and Virginia Smith. Federated optimization in heterogeneous networks. In I. Dhillon, D. Papailiopoulos, and V. Sze, editors, Proceedings of Machine Learning and Systems, volume 2, pages 429–450, 2020. \n[26] Xiang Li, Kaixuan Huang, Wenhao Yang, Shusen Wang, and Zhihua Zhang. On the convergence of fedavg on non-iid data. In International Conference on Learning Representations, 2020. \n[27] Xiangru Lian, Yijun Huang, Yuncheng Li, and Ji Liu. Asynchronous parallel stochastic gradient for nonconvex optimization. In C. Cortes, N. Lawrence, D. Lee, M. Sugiyama, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 28. Curran Associates, Inc., 2015. \n[28] Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Aguera y Arcas. Communication-efficient learning of deep networks from decentralized data. In Artificial Intelligence and Statistics, pages 1273–1282. PMLR, 2017. \n[29] Arkadij Semenovic Nemirovskij and David Borisovich Yudin. Problem complexity and method ˇ efficiency in optimization. 1983. \n[30] Constantin Philippenko and Aymeric Dieuleveut. Bidirectional compression in heterogeneous settings for distributed or federated learning with partial participation: tight convergence guarantees. arXiv preprint arXiv:2006.14591, 2020. \n[31] Amirhossein Reisizadeh, Isidoros Tziotis, Hamed Hassani, Aryan Mokhtari, and Ramtin Pedarsani. Straggler-resilient federated learning: Leveraging the interplay between statistical accuracy and system heterogeneity. arXiv preprint arXiv:2012.14453, 2020. \n[32] Yichen Ruan, Xiaoxi Zhang, Shu-Che Liang, and Carlee Joe-Wong. Towards flexible device participation in federated learning. In International Conference on Artificial Intelligence and Statistics, pages 3403–3411. PMLR, 2021. \n[33] Felix Sattler, Simon Wiedemann, Klaus-Robert Müller, and Wojciech Samek. Robust and communication-efficient federated learning from non-iid data. IEEE transactions on neural networks and learning systems, 31(9):3400–3413, 2019. \n[34] Virginia Smith, Chao-Kai Chiang, Maziar Sanjabi, and Ameet Talwalkar. Federated multi-task learning. arXiv preprint arXiv:1705.10467, 2017. \n[35] Sebastian U Stich and Sai Praneeth Karimireddy. The error-feedback framework: Better rates for sgd with delayed gradients and compressed updates. Journal of Machine Learning Research, 21:1–36, 2020. \n[36] Sebastian Urban Stich. Local sgd converges fast and communicates little. In ICLR 2019- International Conference on Learning Representations, number CONF, 2019. \n[37] Roman Vershynin. High-dimensional probability: An introduction with applications in data science, volume 47. Cambridge university press, 2018. \n[38] Jianyu Wang and Gauri Joshi. Cooperative sgd: A unified framework for the design and analysis of communication-efficient sgd algorithms. In ICML Workshop on Coding Theory for Machine Learning, 2019. \n[39] Jianyu Wang, Qinghua Liu, Hao Liang, Gauri Joshi, and H Vincent Poor. Tackling the objective inconsistency problem in heterogeneous federated optimization. Advances in Neural Information Processing Systems, 33, 2020. \n[40] Cong Xie, Sanmi Koyejo, and Indranil Gupta. Asynchronous federated optimization. arXiv preprint arXiv:1903.03934, 2019. \n[41] Yikai Yan, Chaoyue Niu, Yucheng Ding, Zhenzhe Zheng, Fan Wu, Guihai Chen, Shaojie Tang, and Zhihua Wu. Distributed non-convex optimization with sublinear speedup under intermittent client availability. arXiv preprint arXiv:2002.07399, 2020. \n[42] Haibo Yang, Minghong Fang, and Jia Liu. Achieving linear speedup with partial worker participation in non-iid federated learning. arXiv preprint arXiv:2101.11203, 2021. \n[43] Hao Yu, Rong Jin, and Sen Yang. On the linear speedup analysis of communication efficient momentum sgd for distributed non-convex optimization. In International Conference on Machine Learning, pages 7184–7193. PMLR, 2019. \n[44] Jingzhao Zhang, Sai Praneeth Karimireddy, Andreas Veit, Seungyeon Kim, Sashank J Reddi, Sanjiv Kumar, and Suvrit Sra. Why are adaptive methods good for attention models?, 2020. \n[45] Xin Zhang, Jia Liu, and Zhengyuan Zhu. Taming convergence for asynchronous stochastic gradient descent with unbounded delay in non-convex learning. In 2020 59th IEEE Conference on Decision and Control (CDC), pages 3580–3585. IEEE, 2020. ", + "bbox": [ + 171, + 45, + 828, + 921 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 90, + 826, + 220 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Checklist ", + "text_level": 1, + "bbox": [ + 174, + 242, + 254, + 258 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "1. For all authors... ", + "bbox": [ + 214, + 268, + 339, + 281 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "(a) Do the main claims made in the abstract and introduction accurately reflect the paper’s contributions and scope? [Yes] \n(b) Did you describe the limitations of your work? [Yes] See Section 8. \n(c) Did you discuss any potential negative societal impacts of your work? [N/A] Our work is mainly theoretical and targets at providing theoretical analysis of the FL algorithms, which has almost no negative societal impacts. \n(d) Have you read the ethics review guidelines and ensured that your paper conforms to them? [Yes] ", + "bbox": [ + 238, + 285, + 825, + 402 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "2. If you are including theoretical results... ", + "bbox": [ + 214, + 405, + 493, + 420 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "(a) Did you state the full set of assumptions of all theoretical results? [Yes] The assumptions are rigorously stated in Section 5 and Section 6. \n(b) Did you include complete proofs of all theoretical results? [Yes] All the proofs are deferred to the appendix. ", + "bbox": [ + 238, + 422, + 825, + 481 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "3. If you ran experiments... ", + "bbox": [ + 214, + 484, + 393, + 498 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "(a) Did you include the code, data, and instructions needed to reproduce the main experimental results (either in the supplemental material or as a URL)? [Yes] Our code will be included in the supplemental material. The datasets we use are public. The instructions needed to reproduce the main experimental results are clearly stated in Section 7. \n(b) Did you specify all the training details (e.g., data splits, hyperparameters, how they were chosen)? [Yes] See Section 7. \n(c) Did you report error bars (e.g., with respect to the random seed after running experiments multiple times)? [Yes] See Section 7. \n(d) Did you include the total amount of compute and the type of resources used (e.g., type of GPUs, internal cluster, or cloud provider)? [Yes] See Section 7. ", + "bbox": [ + 238, + 503, + 825, + 645 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4. If you are using existing assets (e.g., code, data, models) or curating/releasing new assets... ", + "bbox": [ + 215, + 650, + 823, + 664 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "(a) If your work uses existing assets, did you cite the creators? [Yes] See Section 7. \n(b) Did you mention the license of the assets? [Yes] See Section 7. \n(c) Did you include any new assets either in the supplemental material or as a URL? [Yes] We include our code for reproducing the experiments in the supplemental material. \n(d) Did you discuss whether and how consent was obtained from people whose data you’re using/curating? [N/A] We choose the commonly-used MNIST and CIFAR-10 datasets. \n(e) Did you discuss whether the data you are using/curating contains personally identifiable information or offensive content? [N/A] We choose the commonly-used MNIST and CIFAR-10 datasets. ", + "bbox": [ + 238, + 667, + 825, + 797 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5. If you used crowdsourcing or conducted research with human subjects... ", + "bbox": [ + 214, + 803, + 705, + 816 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "(a) Did you include the full text of instructions given to participants and screenshots, if applicable? [N/A] \n(b) Did you describe any potential participant risks, with links to Institutional Review Board (IRB) approvals, if applicable? [N/A] \n(c) Did you include the estimated hourly wage paid to participants and the total amount spent on participant compensation? [N/A] ", + "bbox": [ + 238, + 820, + 825, + 909 + ], + "page_idx": 12 + } +] \ No newline at end of file diff --git a/parse/train/1_gaHBaRYt/1_gaHBaRYt_middle.json b/parse/train/1_gaHBaRYt/1_gaHBaRYt_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..e5d369057836eabb3ecc5ba9f9a2853b202b0b85 --- /dev/null +++ b/parse/train/1_gaHBaRYt/1_gaHBaRYt_middle.json @@ -0,0 +1,40975 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 146, + 97, + 466, + 137 + ], + "lines": [ + { + "bbox": [ + 145, + 97, + 467, + 118 + ], + "spans": [ + { + "bbox": [ + 145, + 97, + 467, + 118 + ], + "score": 1.0, + "content": "Fast Federated Learning in the Presence of", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 187, + 117, + 423, + 138 + ], + "spans": [ + { + "bbox": [ + 187, + 117, + 423, + 138 + ], + "score": 1.0, + "content": "Arbitrary Device Unavailability", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 150, + 179, + 294, + 224 + ], + "lines": [ + { + "bbox": [ + 198, + 178, + 251, + 191 + ], + "spans": [ + { + "bbox": [ + 198, + 178, + 251, + 191 + ], + "score": 1.0, + "content": "Xinran Gu∗", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 213, + 190, + 232, + 201 + ], + "spans": [ + { + "bbox": [ + 213, + 190, + 232, + 201 + ], + "score": 1.0, + "content": "IIIS", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 180, + 200, + 264, + 214 + ], + "spans": [ + { + "bbox": [ + 180, + 200, + 264, + 214 + ], + "score": 1.0, + "content": "Tsinghua University", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 150, + 213, + 294, + 225 + ], + "spans": [ + { + "bbox": [ + 150, + 213, + 294, + 225 + ], + "score": 1.0, + "content": "gxr21@mails.tsinghua.edu.cn", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.0 + }, + { + "type": "text", + "bbox": [ + 342, + 180, + 460, + 223 + ], + "lines": [ + { + "bbox": [ + 366, + 178, + 440, + 192 + ], + "spans": [ + { + "bbox": [ + 366, + 178, + 440, + 192 + ], + "score": 1.0, + "content": "Kaixuan Huang∗", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 390, + 190, + 413, + 201 + ], + "spans": [ + { + "bbox": [ + 390, + 190, + 413, + 201 + ], + "score": 1.0, + "content": "ECE", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 358, + 200, + 444, + 213 + ], + "spans": [ + { + "bbox": [ + 358, + 200, + 444, + 213 + ], + "score": 1.0, + "content": "Princeton University", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 342, + 212, + 460, + 225 + ], + "spans": [ + { + "bbox": [ + 342, + 212, + 460, + 225 + ], + "score": 1.0, + "content": "kaixuanh@princeton.edu", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6.0 + }, + { + "type": "text", + "bbox": [ + 138, + 240, + 293, + 284 + ], + "lines": [ + { + "bbox": [ + 179, + 238, + 253, + 254 + ], + "spans": [ + { + "bbox": [ + 179, + 238, + 253, + 254 + ], + "score": 1.0, + "content": "Jingzhao Zhang", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 201, + 251, + 230, + 262 + ], + "spans": [ + { + "bbox": [ + 201, + 251, + 230, + 262 + ], + "score": 1.0, + "content": "EECS", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 137, + 260, + 294, + 275 + ], + "spans": [ + { + "bbox": [ + 137, + 260, + 294, + 275 + ], + "score": 1.0, + "content": "Massachusetts Institute of Technology", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 172, + 274, + 259, + 285 + ], + "spans": [ + { + "bbox": [ + 172, + 274, + 259, + 285 + ], + "score": 1.0, + "content": "jzhzhang@mit.edu", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 329, + 240, + 472, + 284 + ], + "lines": [ + { + "bbox": [ + 367, + 239, + 437, + 254 + ], + "spans": [ + { + "bbox": [ + 367, + 239, + 437, + 254 + ], + "score": 1.0, + "content": "Longbo Huang†", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 391, + 251, + 411, + 262 + ], + "spans": [ + { + "bbox": [ + 391, + 251, + 411, + 262 + ], + "score": 1.0, + "content": "IIIS", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 358, + 261, + 443, + 275 + ], + "spans": [ + { + "bbox": [ + 358, + 261, + 443, + 275 + ], + "score": 1.0, + "content": "Tsinghua University", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 329, + 273, + 473, + 286 + ], + "spans": [ + { + "bbox": [ + 329, + 273, + 473, + 286 + ], + "score": 1.0, + "content": "longbohuang@tsinghua.edu.cn", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14.5 + }, + { + "type": "title", + "bbox": [ + 283, + 313, + 328, + 326 + ], + "lines": [ + { + "bbox": [ + 281, + 312, + 330, + 327 + ], + "spans": [ + { + "bbox": [ + 281, + 312, + 330, + 327 + ], + "score": 1.0, + "content": "Abstract", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 143, + 339, + 469, + 492 + ], + "lines": [ + { + "bbox": [ + 141, + 339, + 469, + 352 + ], + "spans": [ + { + "bbox": [ + 141, + 339, + 469, + 352 + ], + "score": 1.0, + "content": "Federated Learning (FL) coordinates with numerous heterogeneous devices to", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 350, + 469, + 363 + ], + "spans": [ + { + "bbox": [ + 141, + 350, + 469, + 363 + ], + "score": 1.0, + "content": "collaboratively train a shared model while preserving user privacy. Despite its", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 361, + 469, + 373 + ], + "spans": [ + { + "bbox": [ + 141, + 361, + 469, + 373 + ], + "score": 1.0, + "content": "multiple advantages, FL faces new challenges. One challenge arises when devices", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 141, + 372, + 470, + 384 + ], + "spans": [ + { + "bbox": [ + 141, + 372, + 470, + 384 + ], + "score": 1.0, + "content": "drop out of the training process beyond the control of the central server. In", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 382, + 470, + 396 + ], + "spans": [ + { + "bbox": [ + 141, + 382, + 470, + 396 + ], + "score": 1.0, + "content": "this case, the convergence of popular FL algorithms such as FedAvg is severely", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 394, + 470, + 406 + ], + "spans": [ + { + "bbox": [ + 141, + 394, + 470, + 406 + ], + "score": 1.0, + "content": "influenced by the straggling devices. To tackle this challenge, we study federated", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 141, + 405, + 469, + 417 + ], + "spans": [ + { + "bbox": [ + 141, + 405, + 469, + 417 + ], + "score": 1.0, + "content": "learning algorithms under arbitrary device unavailability and propose an algorithm", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 415, + 469, + 428 + ], + "spans": [ + { + "bbox": [ + 141, + 415, + 469, + 428 + ], + "score": 1.0, + "content": "named Memory-augmented Impatient Federated Averaging (MIFA). Our algorithm", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 142, + 427, + 469, + 438 + ], + "spans": [ + { + "bbox": [ + 142, + 427, + 469, + 438 + ], + "score": 1.0, + "content": "efficiently avoids excessive latency induced by inactive devices, and corrects the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 141, + 438, + 470, + 449 + ], + "spans": [ + { + "bbox": [ + 141, + 438, + 470, + 449 + ], + "score": 1.0, + "content": "gradient bias using the memorized latest updates from the devices. We prove that", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 141, + 448, + 469, + 460 + ], + "spans": [ + { + "bbox": [ + 141, + 448, + 469, + 460 + ], + "score": 1.0, + "content": "MIFA achieves minimax optimal convergence rates on non-i.i.d. data for both", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 460, + 470, + 471 + ], + "spans": [ + { + "bbox": [ + 141, + 460, + 470, + 471 + ], + "score": 1.0, + "content": "strongly convex and non-convex smooth functions. We also provide an explicit", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 141, + 469, + 471, + 483 + ], + "spans": [ + { + "bbox": [ + 141, + 469, + 471, + 483 + ], + "score": 1.0, + "content": "characterization of the improvement over baseline algorithms through a case study,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 142, + 482, + 435, + 493 + ], + "spans": [ + { + "bbox": [ + 142, + 482, + 435, + 493 + ], + "score": 1.0, + "content": "and validate the results by numerical experiments on real-world datasets.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 25.5 + }, + { + "type": "title", + "bbox": [ + 107, + 515, + 190, + 529 + ], + "lines": [ + { + "bbox": [ + 105, + 514, + 192, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 192, + 532 + ], + "score": 1.0, + "content": "1 Introduction", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 542, + 504, + 630 + ], + "lines": [ + { + "bbox": [ + 105, + 541, + 506, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 506, + 555 + ], + "score": 1.0, + "content": "Federated learning is a machine learning setting in which a central server coordinates with a large", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 552, + 506, + 566 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 506, + 566 + ], + "score": 1.0, + "content": "number of devices to collectively train a shared model [28, 34, 20, 33, 25, 26]. Practical advantages", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 564, + 506, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 506, + 576 + ], + "score": 1.0, + "content": "of this training scheme are mainly twofold. First, each device keeps the private data locally and hence", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 575, + 506, + 587 + ], + "spans": [ + { + "bbox": [ + 105, + 575, + 506, + 587 + ], + "score": 1.0, + "content": "preserves its data privacy. Second, federated learning can make use of idle computing resources and", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 586, + 506, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 506, + 599 + ], + "score": 1.0, + "content": "lower computation costs. Although federated learning successfully scales up with data sizes and", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 596, + 506, + 609 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 506, + 609 + ], + "score": 1.0, + "content": "accelerates training via more affordable computing power [43, 38, 36], the collaborative setup leads", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 608, + 506, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 608, + 506, + 620 + ], + "score": 1.0, + "content": "to new challenges due to large variations among individual computing devices. Our work aims to", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 618, + 498, + 631 + ], + "spans": [ + { + "bbox": [ + 105, + 618, + 498, + 631 + ], + "score": 1.0, + "content": "formulate and investigate the impact of device variations on FL from an optimization perspective.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 107, + 635, + 504, + 679 + ], + "lines": [ + { + "bbox": [ + 105, + 634, + 506, + 647 + ], + "spans": [ + { + "bbox": [ + 105, + 634, + 506, + 647 + ], + "score": 1.0, + "content": "In FL, a device can differ from its peers in multiple aspects [17, 25]. First, the data distribution and", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 646, + 505, + 658 + ], + "spans": [ + { + "bbox": [ + 106, + 646, + 505, + 658 + ], + "score": 1.0, + "content": "local task can be different among devices. To address the data variation, non-i.i.d. objective models", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 657, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 505, + 669 + ], + "score": 1.0, + "content": "were proposed and analyzed by [26, 18, 19, 42, 25]. We follow this line of work and formulate our", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 668, + 474, + 680 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 474, + 680 + ], + "score": 1.0, + "content": "optimization objective as a sum of stochastic functions on individual devices (See Eqn. (1)).", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43.5 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 119, + 690, + 204, + 711 + ], + "lines": [ + { + "bbox": [ + 118, + 688, + 195, + 701 + ], + "spans": [ + { + "bbox": [ + 118, + 688, + 195, + 701 + ], + "score": 1.0, + "content": "∗Equal contribution.", + "type": "text" + } + ] + }, + { + "bbox": [ + 118, + 698, + 205, + 714 + ], + "spans": [ + { + "bbox": [ + 118, + 698, + 205, + 714 + ], + "score": 1.0, + "content": "†Corresponding author.", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 106, + 731, + 385, + 742 + ], + "lines": [ + { + "bbox": [ + 105, + 730, + 386, + 743 + ], + "spans": [ + { + "bbox": [ + 105, + 730, + 386, + 743 + ], + "score": 1.0, + "content": "35th Conference on Neural Information Processing Systems (NeurIPS 2021).", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 146, + 97, + 466, + 137 + ], + "lines": [ + { + "bbox": [ + 145, + 97, + 467, + 118 + ], + "spans": [ + { + "bbox": [ + 145, + 97, + 467, + 118 + ], + "score": 1.0, + "content": "Fast Federated Learning in the Presence of", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 187, + 117, + 423, + 138 + ], + "spans": [ + { + "bbox": [ + 187, + 117, + 423, + 138 + ], + "score": 1.0, + "content": "Arbitrary Device Unavailability", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 150, + 179, + 294, + 224 + ], + "lines": [ + { + "bbox": [ + 198, + 178, + 251, + 191 + ], + "spans": [ + { + "bbox": [ + 198, + 178, + 251, + 191 + ], + "score": 1.0, + "content": "Xinran Gu∗", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 213, + 190, + 232, + 201 + ], + "spans": [ + { + "bbox": [ + 213, + 190, + 232, + 201 + ], + "score": 1.0, + "content": "IIIS", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 180, + 200, + 264, + 214 + ], + "spans": [ + { + "bbox": [ + 180, + 200, + 264, + 214 + ], + "score": 1.0, + "content": "Tsinghua University", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 150, + 213, + 294, + 225 + ], + "spans": [ + { + "bbox": [ + 150, + 213, + 294, + 225 + ], + "score": 1.0, + "content": "gxr21@mails.tsinghua.edu.cn", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.0, + "bbox_fs": [ + 150, + 178, + 294, + 225 + ] + }, + { + "type": "text", + "bbox": [ + 342, + 180, + 460, + 223 + ], + "lines": [ + { + "bbox": [ + 366, + 178, + 440, + 192 + ], + "spans": [ + { + "bbox": [ + 366, + 178, + 440, + 192 + ], + "score": 1.0, + "content": "Kaixuan Huang∗", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 390, + 190, + 413, + 201 + ], + "spans": [ + { + "bbox": [ + 390, + 190, + 413, + 201 + ], + "score": 1.0, + "content": "ECE", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 358, + 200, + 444, + 213 + ], + "spans": [ + { + "bbox": [ + 358, + 200, + 444, + 213 + ], + "score": 1.0, + "content": "Princeton University", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 342, + 212, + 460, + 225 + ], + "spans": [ + { + "bbox": [ + 342, + 212, + 460, + 225 + ], + "score": 1.0, + "content": "kaixuanh@princeton.edu", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6.0, + "bbox_fs": [ + 342, + 178, + 460, + 225 + ] + }, + { + "type": "text", + "bbox": [ + 138, + 240, + 293, + 284 + ], + "lines": [ + { + "bbox": [ + 179, + 238, + 253, + 254 + ], + "spans": [ + { + "bbox": [ + 179, + 238, + 253, + 254 + ], + "score": 1.0, + "content": "Jingzhao Zhang", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 201, + 251, + 230, + 262 + ], + "spans": [ + { + "bbox": [ + 201, + 251, + 230, + 262 + ], + "score": 1.0, + "content": "EECS", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 137, + 260, + 294, + 275 + ], + "spans": [ + { + "bbox": [ + 137, + 260, + 294, + 275 + ], + "score": 1.0, + "content": "Massachusetts Institute of Technology", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 172, + 274, + 259, + 285 + ], + "spans": [ + { + "bbox": [ + 172, + 274, + 259, + 285 + ], + "score": 1.0, + "content": "jzhzhang@mit.edu", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 12.5, + "bbox_fs": [ + 137, + 238, + 294, + 285 + ] + }, + { + "type": "text", + "bbox": [ + 329, + 240, + 472, + 284 + ], + "lines": [ + { + "bbox": [ + 367, + 239, + 437, + 254 + ], + "spans": [ + { + "bbox": [ + 367, + 239, + 437, + 254 + ], + "score": 1.0, + "content": "Longbo Huang†", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 391, + 251, + 411, + 262 + ], + "spans": [ + { + "bbox": [ + 391, + 251, + 411, + 262 + ], + "score": 1.0, + "content": "IIIS", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 358, + 261, + 443, + 275 + ], + "spans": [ + { + "bbox": [ + 358, + 261, + 443, + 275 + ], + "score": 1.0, + "content": "Tsinghua University", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 329, + 273, + 473, + 286 + ], + "spans": [ + { + "bbox": [ + 329, + 273, + 473, + 286 + ], + "score": 1.0, + "content": "longbohuang@tsinghua.edu.cn", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14.5, + "bbox_fs": [ + 329, + 239, + 473, + 286 + ] + }, + { + "type": "title", + "bbox": [ + 283, + 313, + 328, + 326 + ], + "lines": [ + { + "bbox": [ + 281, + 312, + 330, + 327 + ], + "spans": [ + { + "bbox": [ + 281, + 312, + 330, + 327 + ], + "score": 1.0, + "content": "Abstract", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 143, + 339, + 469, + 492 + ], + "lines": [ + { + "bbox": [ + 141, + 339, + 469, + 352 + ], + "spans": [ + { + "bbox": [ + 141, + 339, + 469, + 352 + ], + "score": 1.0, + "content": "Federated Learning (FL) coordinates with numerous heterogeneous devices to", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 350, + 469, + 363 + ], + "spans": [ + { + "bbox": [ + 141, + 350, + 469, + 363 + ], + "score": 1.0, + "content": "collaboratively train a shared model while preserving user privacy. Despite its", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 361, + 469, + 373 + ], + "spans": [ + { + "bbox": [ + 141, + 361, + 469, + 373 + ], + "score": 1.0, + "content": "multiple advantages, FL faces new challenges. One challenge arises when devices", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 141, + 372, + 470, + 384 + ], + "spans": [ + { + "bbox": [ + 141, + 372, + 470, + 384 + ], + "score": 1.0, + "content": "drop out of the training process beyond the control of the central server. In", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 382, + 470, + 396 + ], + "spans": [ + { + "bbox": [ + 141, + 382, + 470, + 396 + ], + "score": 1.0, + "content": "this case, the convergence of popular FL algorithms such as FedAvg is severely", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 394, + 470, + 406 + ], + "spans": [ + { + "bbox": [ + 141, + 394, + 470, + 406 + ], + "score": 1.0, + "content": "influenced by the straggling devices. To tackle this challenge, we study federated", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 141, + 405, + 469, + 417 + ], + "spans": [ + { + "bbox": [ + 141, + 405, + 469, + 417 + ], + "score": 1.0, + "content": "learning algorithms under arbitrary device unavailability and propose an algorithm", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 415, + 469, + 428 + ], + "spans": [ + { + "bbox": [ + 141, + 415, + 469, + 428 + ], + "score": 1.0, + "content": "named Memory-augmented Impatient Federated Averaging (MIFA). Our algorithm", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 142, + 427, + 469, + 438 + ], + "spans": [ + { + "bbox": [ + 142, + 427, + 469, + 438 + ], + "score": 1.0, + "content": "efficiently avoids excessive latency induced by inactive devices, and corrects the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 141, + 438, + 470, + 449 + ], + "spans": [ + { + "bbox": [ + 141, + 438, + 470, + 449 + ], + "score": 1.0, + "content": "gradient bias using the memorized latest updates from the devices. We prove that", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 141, + 448, + 469, + 460 + ], + "spans": [ + { + "bbox": [ + 141, + 448, + 469, + 460 + ], + "score": 1.0, + "content": "MIFA achieves minimax optimal convergence rates on non-i.i.d. data for both", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 460, + 470, + 471 + ], + "spans": [ + { + "bbox": [ + 141, + 460, + 470, + 471 + ], + "score": 1.0, + "content": "strongly convex and non-convex smooth functions. We also provide an explicit", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 141, + 469, + 471, + 483 + ], + "spans": [ + { + "bbox": [ + 141, + 469, + 471, + 483 + ], + "score": 1.0, + "content": "characterization of the improvement over baseline algorithms through a case study,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 142, + 482, + 435, + 493 + ], + "spans": [ + { + "bbox": [ + 142, + 482, + 435, + 493 + ], + "score": 1.0, + "content": "and validate the results by numerical experiments on real-world datasets.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 25.5, + "bbox_fs": [ + 141, + 339, + 471, + 493 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 515, + 190, + 529 + ], + "lines": [ + { + "bbox": [ + 105, + 514, + 192, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 192, + 532 + ], + "score": 1.0, + "content": "1 Introduction", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 542, + 504, + 630 + ], + "lines": [ + { + "bbox": [ + 105, + 541, + 506, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 506, + 555 + ], + "score": 1.0, + "content": "Federated learning is a machine learning setting in which a central server coordinates with a large", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 552, + 506, + 566 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 506, + 566 + ], + "score": 1.0, + "content": "number of devices to collectively train a shared model [28, 34, 20, 33, 25, 26]. Practical advantages", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 564, + 506, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 506, + 576 + ], + "score": 1.0, + "content": "of this training scheme are mainly twofold. First, each device keeps the private data locally and hence", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 575, + 506, + 587 + ], + "spans": [ + { + "bbox": [ + 105, + 575, + 506, + 587 + ], + "score": 1.0, + "content": "preserves its data privacy. Second, federated learning can make use of idle computing resources and", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 586, + 506, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 506, + 599 + ], + "score": 1.0, + "content": "lower computation costs. Although federated learning successfully scales up with data sizes and", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 596, + 506, + 609 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 506, + 609 + ], + "score": 1.0, + "content": "accelerates training via more affordable computing power [43, 38, 36], the collaborative setup leads", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 608, + 506, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 608, + 506, + 620 + ], + "score": 1.0, + "content": "to new challenges due to large variations among individual computing devices. Our work aims to", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 618, + 498, + 631 + ], + "spans": [ + { + "bbox": [ + 105, + 618, + 498, + 631 + ], + "score": 1.0, + "content": "formulate and investigate the impact of device variations on FL from an optimization perspective.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 541, + 506, + 631 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 635, + 504, + 679 + ], + "lines": [ + { + "bbox": [ + 105, + 634, + 506, + 647 + ], + "spans": [ + { + "bbox": [ + 105, + 634, + 506, + 647 + ], + "score": 1.0, + "content": "In FL, a device can differ from its peers in multiple aspects [17, 25]. First, the data distribution and", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 646, + 505, + 658 + ], + "spans": [ + { + "bbox": [ + 106, + 646, + 505, + 658 + ], + "score": 1.0, + "content": "local task can be different among devices. To address the data variation, non-i.i.d. objective models", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 657, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 505, + 669 + ], + "score": 1.0, + "content": "were proposed and analyzed by [26, 18, 19, 42, 25]. We follow this line of work and formulate our", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 668, + 474, + 680 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 474, + 680 + ], + "score": 1.0, + "content": "optimization objective as a sum of stochastic functions on individual devices (See Eqn. (1)).", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43.5, + "bbox_fs": [ + 105, + 634, + 506, + 680 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 72, + 505, + 171 + ], + "lines": [ + { + "bbox": [ + 105, + 72, + 506, + 87 + ], + "spans": [ + { + "bbox": [ + 105, + 72, + 506, + 87 + ], + "score": 1.0, + "content": "A second variation among devices is caused by different computing and communication speeds. One", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 83, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 83, + 505, + 96 + ], + "score": 1.0, + "content": "natural way to formulate the variation in computation speeds is to allow asynchronous updates and", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 94, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 506, + 107 + ], + "score": 1.0, + "content": "model the updates as delayed responses. Lots of novel research has studied the problem with different", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "score": 1.0, + "content": "delay models, e.g., [35, 4, 27, 11, 45, 1, 5, 13]. However, the delayed setup assumes that all devices", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 116, + 505, + 130 + ], + "spans": [ + { + "bbox": [ + 105, + 116, + 505, + 130 + ], + "score": 1.0, + "content": "make roughly the same number of (delayed) responses in the end. This behavior may deviate largely", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 127, + 506, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 506, + 141 + ], + "score": 1.0, + "content": "from the FL practice, where each device, e.g., personal cell phones, can have very different active", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 137, + 505, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 505, + 151 + ], + "score": 1.0, + "content": "duration when participating in the FL training, and hence make different numbers of responses. For", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 149, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 505, + 162 + ], + "score": 1.0, + "content": "this reason, our work aims to address this third discrepancy among devices caused by individual", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 160, + 189, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 189, + 172 + ], + "score": 1.0, + "content": "availability patterns.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 107, + 176, + 505, + 242 + ], + "lines": [ + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "score": 1.0, + "content": "The third device heterogeneity caused by different availability patterns is less studied in optimization", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "score": 1.0, + "content": "for federated learning problems. In this model, instead of making a delayed response, devices can", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 198, + 506, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 198, + 506, + 211 + ], + "score": 1.0, + "content": "abort the training halfway, e.g., due to battery level, incoming calls, etc, and fail to return their", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "responses upon the central server’s requests [28, 7, 17]. To handle missing responses, researchers", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 219, + 506, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 506, + 233 + ], + "score": 1.0, + "content": "propose algorithms where the central server may collect responses from only a fraction of the devices", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 231, + 307, + 243 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 307, + 243 + ], + "score": 1.0, + "content": "and make updates [18, 28, 42, 25, 26, 17, 30, 14].", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 106, + 247, + 505, + 335 + ], + "lines": [ + { + "bbox": [ + 106, + 248, + 506, + 259 + ], + "spans": [ + { + "bbox": [ + 106, + 248, + 506, + 259 + ], + "score": 1.0, + "content": "Previous works on collecting responses from a fraction of devices can be divided into two categories.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 258, + 505, + 271 + ], + "spans": [ + { + "bbox": [ + 106, + 258, + 505, + 271 + ], + "score": 1.0, + "content": "When the response distribution is known, one could collect only the fastest responses and re-weight", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 269, + 506, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 269, + 506, + 282 + ], + "score": 1.0, + "content": "according to their response probability [17, 26, 30]. This model can be restrictive, as in practice,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 280, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 106, + 280, + 505, + 293 + ], + "score": 1.0, + "content": "the exact distribution may not be available and may evolve. Another line of work assumes that", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 291, + 506, + 304 + ], + "spans": [ + { + "bbox": [ + 106, + 291, + 506, + 304 + ], + "score": 1.0, + "content": "the server can arbitrarily decide and sample a set of devices to collect responses accordingly in", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 300, + 506, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 506, + 315 + ], + "score": 1.0, + "content": "every communication round [18, 28, 42, 25, 14]. This model does not require knowing the response", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 313, + 506, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 506, + 325 + ], + "score": 1.0, + "content": "possibility. However, the response time can be very long if the selected subset contains unavailable", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 323, + 141, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 323, + 141, + 336 + ], + "score": 1.0, + "content": "devices.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 18.5 + }, + { + "type": "text", + "bbox": [ + 108, + 339, + 505, + 406 + ], + "lines": [ + { + "bbox": [ + 106, + 340, + 505, + 352 + ], + "spans": [ + { + "bbox": [ + 106, + 340, + 505, + 352 + ], + "score": 1.0, + "content": "In this work, we address the above limitations by studying federated learning in the presence of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 350, + 505, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 350, + 505, + 364 + ], + "score": 1.0, + "content": "arbitrary device unavailability. Within this practical setup, we propose an algorithm that automatically", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 362, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 505, + 375 + ], + "score": 1.0, + "content": "accommodates for the underlying unavailability and allows patterns of the device unavailability to be", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 372, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 505, + 385 + ], + "score": 1.0, + "content": "non-stationary and even adversarial. Furthermore, our algorithm can achieve optimal convergence", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 383, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 383, + 505, + 397 + ], + "score": 1.0, + "content": "rates in the presence of device inactivity and automatically reduce to best-known rates if all devices", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 395, + 334, + 406 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 334, + 406 + ], + "score": 1.0, + "content": "are active. Our contributions are summarized as follows.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 133, + 415, + 505, + 601 + ], + "lines": [ + { + "bbox": [ + 133, + 415, + 506, + 428 + ], + "spans": [ + { + "bbox": [ + 133, + 415, + 506, + 428 + ], + "score": 1.0, + "content": "• We investigate the federated learning problem with a practical formulation of device partici-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 426, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 141, + 426, + 505, + 438 + ], + "score": 1.0, + "content": "pation, which does not require each device to be online according to an (either known or", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 142, + 438, + 235, + 448 + ], + "spans": [ + { + "bbox": [ + 142, + 438, + 235, + 448 + ], + "score": 1.0, + "content": "unknown) distribution.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 135, + 452, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 135, + 452, + 505, + 464 + ], + "score": 1.0, + "content": "• We propose the Memory-augmented Impatient Federated Averaging (MIFA) algorithm that is", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 141, + 462, + 506, + 475 + ], + "spans": [ + { + "bbox": [ + 141, + 462, + 506, + 475 + ], + "score": 1.0, + "content": "agnostic to the availability pattern. It efficiently avoids excessive latency induced by inactive", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 141, + 473, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 141, + 473, + 505, + 487 + ], + "score": 1.0, + "content": "devices, successfully exploits the information about the descent direction in stale and noisy", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 141, + 484, + 448, + 497 + ], + "spans": [ + { + "bbox": [ + 141, + 484, + 448, + 497 + ], + "score": 1.0, + "content": "gradients, and corrects the gradient bias using the memorized latest updates.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 133, + 495, + 509, + 516 + ], + "spans": [ + { + "bbox": [ + 133, + 495, + 412, + 516 + ], + "score": 1.0, + "content": "• We prove that MIFA achieves minimax optimal convergence rates", + "type": "text" + }, + { + "bbox": [ + 412, + 498, + 454, + 513 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\mathcal { O } \\left( \\frac { \\bar { \\tau } _ { T } + 1 } { N K T } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 495, + 509, + 516 + ], + "score": 1.0, + "content": "for smooth,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 138, + 506, + 506, + 536 + ], + "spans": [ + { + "bbox": [ + 138, + 506, + 272, + 536 + ], + "score": 1.0, + "content": "strongly convex functions, and", + "type": "text" + }, + { + "bbox": [ + 273, + 511, + 327, + 532 + ], + "score": 0.94, + "content": "\\mathcal { O } \\left( \\sqrt { \\frac { \\bar { \\nu } + 1 } { N K T } } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 515, + 506, + 527 + ], + "score": 1.0, + "content": "for smooth, non-convex functions, and es-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 142, + 531, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 142, + 531, + 298, + 542 + ], + "score": 1.0, + "content": "tablish matching lower bounds. Here,", + "type": "text" + }, + { + "bbox": [ + 298, + 531, + 321, + 542 + ], + "score": 0.83, + "content": "N , K", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 531, + 339, + 542 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 340, + 531, + 348, + 540 + ], + "score": 0.81, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 531, + 505, + 542 + ], + "score": 1.0, + "content": "stand for the number of devices, local", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 141, + 541, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 141, + 541, + 334, + 554 + ], + "score": 1.0, + "content": "updates and communication rounds respectively.", + "type": "text" + }, + { + "bbox": [ + 335, + 542, + 347, + 552 + ], + "score": 0.86, + "content": "\\bar { \\tau } _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 541, + 364, + 554 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 364, + 542, + 371, + 551 + ], + "score": 0.76, + "content": "\\bar { \\nu }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 541, + 506, + 554 + ], + "score": 1.0, + "content": "characterize how actively devices", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 141, + 552, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 141, + 552, + 505, + 565 + ], + "score": 1.0, + "content": "participate in training (see formal definitions in Sections 3, 5 and 6). MIFA also achieves", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 140, + 563, + 427, + 576 + ], + "spans": [ + { + "bbox": [ + 140, + 563, + 427, + 576 + ], + "score": 1.0, + "content": "optimal convergence rates in the ideal case when all devices are active.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 133, + 577, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 133, + 577, + 505, + 591 + ], + "score": 1.0, + "content": "• We provide an explicit characterization of the improvement over baseline algorithms through", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 140, + 589, + 421, + 601 + ], + "spans": [ + { + "bbox": [ + 140, + 589, + 421, + 601 + ], + "score": 1.0, + "content": "a case study and empirically verify our results on real-world datasets.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 36 + }, + { + "type": "title", + "bbox": [ + 107, + 614, + 195, + 628 + ], + "lines": [ + { + "bbox": [ + 104, + 613, + 196, + 630 + ], + "spans": [ + { + "bbox": [ + 104, + 613, + 196, + 630 + ], + "score": 1.0, + "content": "2 Related work", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 44 + }, + { + "type": "text", + "bbox": [ + 107, + 640, + 505, + 695 + ], + "lines": [ + { + "bbox": [ + 105, + 639, + 505, + 652 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 505, + 652 + ], + "score": 1.0, + "content": "Federated learning. Federated Averaging (FedAvg) was first proposed in [28]. [26, 19, 18, 42]", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 650, + 505, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 505, + 664 + ], + "score": 1.0, + "content": "provided convergence analysis for FedAvg on non-i.i.d. data and quantified how data heterogeneity", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 661, + 506, + 674 + ], + "spans": [ + { + "bbox": [ + 105, + 661, + 506, + 674 + ], + "score": 1.0, + "content": "degrades the convergence rate. Several variants of FedAvg were designed to deal with data hetero-", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 672, + 506, + 686 + ], + "spans": [ + { + "bbox": [ + 105, + 672, + 506, + 686 + ], + "score": 1.0, + "content": "geneity. FedProx [25] adds a proximal term to local objective functions, while FSVRG [21] and", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 682, + 325, + 696 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 325, + 696 + ], + "score": 1.0, + "content": "SCAFFOLD [18] employ variance reduction techniques.", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 47 + }, + { + "type": "text", + "bbox": [ + 107, + 700, + 503, + 722 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "One line of work focused on variations in computation capabilities among devices [39, 31, 40]. These", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 709, + 505, + 725 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 725 + ], + "score": 1.0, + "content": "models assume that responses are delayed but not missing. To address the missing response, some", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 50.5 + } + ], + "page_idx": 1, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 741, + 309, + 750 + ], + "lines": [ + { + "bbox": [ + 301, + 740, + 310, + 753 + ], + "spans": [ + { + "bbox": [ + 301, + 740, + 310, + 753 + ], + "score": 1.0, + "content": "2", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 72, + 505, + 171 + ], + "lines": [ + { + "bbox": [ + 105, + 72, + 506, + 87 + ], + "spans": [ + { + "bbox": [ + 105, + 72, + 506, + 87 + ], + "score": 1.0, + "content": "A second variation among devices is caused by different computing and communication speeds. One", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 83, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 83, + 505, + 96 + ], + "score": 1.0, + "content": "natural way to formulate the variation in computation speeds is to allow asynchronous updates and", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 94, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 506, + 107 + ], + "score": 1.0, + "content": "model the updates as delayed responses. Lots of novel research has studied the problem with different", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "score": 1.0, + "content": "delay models, e.g., [35, 4, 27, 11, 45, 1, 5, 13]. However, the delayed setup assumes that all devices", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 116, + 505, + 130 + ], + "spans": [ + { + "bbox": [ + 105, + 116, + 505, + 130 + ], + "score": 1.0, + "content": "make roughly the same number of (delayed) responses in the end. This behavior may deviate largely", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 127, + 506, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 506, + 141 + ], + "score": 1.0, + "content": "from the FL practice, where each device, e.g., personal cell phones, can have very different active", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 137, + 505, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 505, + 151 + ], + "score": 1.0, + "content": "duration when participating in the FL training, and hence make different numbers of responses. For", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 149, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 505, + 162 + ], + "score": 1.0, + "content": "this reason, our work aims to address this third discrepancy among devices caused by individual", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 160, + 189, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 189, + 172 + ], + "score": 1.0, + "content": "availability patterns.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 72, + 506, + 172 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 176, + 505, + 242 + ], + "lines": [ + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "score": 1.0, + "content": "The third device heterogeneity caused by different availability patterns is less studied in optimization", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "score": 1.0, + "content": "for federated learning problems. In this model, instead of making a delayed response, devices can", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 198, + 506, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 198, + 506, + 211 + ], + "score": 1.0, + "content": "abort the training halfway, e.g., due to battery level, incoming calls, etc, and fail to return their", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "responses upon the central server’s requests [28, 7, 17]. To handle missing responses, researchers", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 219, + 506, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 506, + 233 + ], + "score": 1.0, + "content": "propose algorithms where the central server may collect responses from only a fraction of the devices", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 231, + 307, + 243 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 307, + 243 + ], + "score": 1.0, + "content": "and make updates [18, 28, 42, 25, 26, 17, 30, 14].", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 176, + 506, + 243 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 247, + 505, + 335 + ], + "lines": [ + { + "bbox": [ + 106, + 248, + 506, + 259 + ], + "spans": [ + { + "bbox": [ + 106, + 248, + 506, + 259 + ], + "score": 1.0, + "content": "Previous works on collecting responses from a fraction of devices can be divided into two categories.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 258, + 505, + 271 + ], + "spans": [ + { + "bbox": [ + 106, + 258, + 505, + 271 + ], + "score": 1.0, + "content": "When the response distribution is known, one could collect only the fastest responses and re-weight", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 269, + 506, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 269, + 506, + 282 + ], + "score": 1.0, + "content": "according to their response probability [17, 26, 30]. This model can be restrictive, as in practice,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 280, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 106, + 280, + 505, + 293 + ], + "score": 1.0, + "content": "the exact distribution may not be available and may evolve. Another line of work assumes that", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 291, + 506, + 304 + ], + "spans": [ + { + "bbox": [ + 106, + 291, + 506, + 304 + ], + "score": 1.0, + "content": "the server can arbitrarily decide and sample a set of devices to collect responses accordingly in", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 300, + 506, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 506, + 315 + ], + "score": 1.0, + "content": "every communication round [18, 28, 42, 25, 14]. This model does not require knowing the response", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 313, + 506, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 506, + 325 + ], + "score": 1.0, + "content": "possibility. However, the response time can be very long if the selected subset contains unavailable", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 323, + 141, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 323, + 141, + 336 + ], + "score": 1.0, + "content": "devices.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 248, + 506, + 336 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 339, + 505, + 406 + ], + "lines": [ + { + "bbox": [ + 106, + 340, + 505, + 352 + ], + "spans": [ + { + "bbox": [ + 106, + 340, + 505, + 352 + ], + "score": 1.0, + "content": "In this work, we address the above limitations by studying federated learning in the presence of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 350, + 505, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 350, + 505, + 364 + ], + "score": 1.0, + "content": "arbitrary device unavailability. Within this practical setup, we propose an algorithm that automatically", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 362, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 505, + 375 + ], + "score": 1.0, + "content": "accommodates for the underlying unavailability and allows patterns of the device unavailability to be", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 372, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 505, + 385 + ], + "score": 1.0, + "content": "non-stationary and even adversarial. Furthermore, our algorithm can achieve optimal convergence", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 383, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 383, + 505, + 397 + ], + "score": 1.0, + "content": "rates in the presence of device inactivity and automatically reduce to best-known rates if all devices", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 395, + 334, + 406 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 334, + 406 + ], + "score": 1.0, + "content": "are active. Our contributions are summarized as follows.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 340, + 505, + 406 + ] + }, + { + "type": "text", + "bbox": [ + 133, + 415, + 505, + 601 + ], + "lines": [ + { + "bbox": [ + 133, + 415, + 506, + 428 + ], + "spans": [ + { + "bbox": [ + 133, + 415, + 506, + 428 + ], + "score": 1.0, + "content": "• We investigate the federated learning problem with a practical formulation of device partici-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 426, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 141, + 426, + 505, + 438 + ], + "score": 1.0, + "content": "pation, which does not require each device to be online according to an (either known or", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 142, + 438, + 235, + 448 + ], + "spans": [ + { + "bbox": [ + 142, + 438, + 235, + 448 + ], + "score": 1.0, + "content": "unknown) distribution.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 135, + 452, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 135, + 452, + 505, + 464 + ], + "score": 1.0, + "content": "• We propose the Memory-augmented Impatient Federated Averaging (MIFA) algorithm that is", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 141, + 462, + 506, + 475 + ], + "spans": [ + { + "bbox": [ + 141, + 462, + 506, + 475 + ], + "score": 1.0, + "content": "agnostic to the availability pattern. It efficiently avoids excessive latency induced by inactive", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 141, + 473, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 141, + 473, + 505, + 487 + ], + "score": 1.0, + "content": "devices, successfully exploits the information about the descent direction in stale and noisy", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 141, + 484, + 448, + 497 + ], + "spans": [ + { + "bbox": [ + 141, + 484, + 448, + 497 + ], + "score": 1.0, + "content": "gradients, and corrects the gradient bias using the memorized latest updates.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 133, + 495, + 509, + 516 + ], + "spans": [ + { + "bbox": [ + 133, + 495, + 412, + 516 + ], + "score": 1.0, + "content": "• We prove that MIFA achieves minimax optimal convergence rates", + "type": "text" + }, + { + "bbox": [ + 412, + 498, + 454, + 513 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\mathcal { O } \\left( \\frac { \\bar { \\tau } _ { T } + 1 } { N K T } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 495, + 509, + 516 + ], + "score": 1.0, + "content": "for smooth,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 138, + 506, + 506, + 536 + ], + "spans": [ + { + "bbox": [ + 138, + 506, + 272, + 536 + ], + "score": 1.0, + "content": "strongly convex functions, and", + "type": "text" + }, + { + "bbox": [ + 273, + 511, + 327, + 532 + ], + "score": 0.94, + "content": "\\mathcal { O } \\left( \\sqrt { \\frac { \\bar { \\nu } + 1 } { N K T } } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 515, + 506, + 527 + ], + "score": 1.0, + "content": "for smooth, non-convex functions, and es-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 142, + 531, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 142, + 531, + 298, + 542 + ], + "score": 1.0, + "content": "tablish matching lower bounds. Here,", + "type": "text" + }, + { + "bbox": [ + 298, + 531, + 321, + 542 + ], + "score": 0.83, + "content": "N , K", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 531, + 339, + 542 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 340, + 531, + 348, + 540 + ], + "score": 0.81, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 531, + 505, + 542 + ], + "score": 1.0, + "content": "stand for the number of devices, local", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 141, + 541, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 141, + 541, + 334, + 554 + ], + "score": 1.0, + "content": "updates and communication rounds respectively.", + "type": "text" + }, + { + "bbox": [ + 335, + 542, + 347, + 552 + ], + "score": 0.86, + "content": "\\bar { \\tau } _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 541, + 364, + 554 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 364, + 542, + 371, + 551 + ], + "score": 0.76, + "content": "\\bar { \\nu }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 541, + 506, + 554 + ], + "score": 1.0, + "content": "characterize how actively devices", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 141, + 552, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 141, + 552, + 505, + 565 + ], + "score": 1.0, + "content": "participate in training (see formal definitions in Sections 3, 5 and 6). MIFA also achieves", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 140, + 563, + 427, + 576 + ], + "spans": [ + { + "bbox": [ + 140, + 563, + 427, + 576 + ], + "score": 1.0, + "content": "optimal convergence rates in the ideal case when all devices are active.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 133, + 577, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 133, + 577, + 505, + 591 + ], + "score": 1.0, + "content": "• We provide an explicit characterization of the improvement over baseline algorithms through", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 140, + 589, + 421, + 601 + ], + "spans": [ + { + "bbox": [ + 140, + 589, + 421, + 601 + ], + "score": 1.0, + "content": "a case study and empirically verify our results on real-world datasets.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 36, + "bbox_fs": [ + 133, + 415, + 509, + 601 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 614, + 195, + 628 + ], + "lines": [ + { + "bbox": [ + 104, + 613, + 196, + 630 + ], + "spans": [ + { + "bbox": [ + 104, + 613, + 196, + 630 + ], + "score": 1.0, + "content": "2 Related work", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 44 + }, + { + "type": "text", + "bbox": [ + 107, + 640, + 505, + 695 + ], + "lines": [ + { + "bbox": [ + 105, + 639, + 505, + 652 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 505, + 652 + ], + "score": 1.0, + "content": "Federated learning. Federated Averaging (FedAvg) was first proposed in [28]. [26, 19, 18, 42]", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 650, + 505, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 505, + 664 + ], + "score": 1.0, + "content": "provided convergence analysis for FedAvg on non-i.i.d. data and quantified how data heterogeneity", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 661, + 506, + 674 + ], + "spans": [ + { + "bbox": [ + 105, + 661, + 506, + 674 + ], + "score": 1.0, + "content": "degrades the convergence rate. Several variants of FedAvg were designed to deal with data hetero-", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 672, + 506, + 686 + ], + "spans": [ + { + "bbox": [ + 105, + 672, + 506, + 686 + ], + "score": 1.0, + "content": "geneity. FedProx [25] adds a proximal term to local objective functions, while FSVRG [21] and", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 682, + 325, + 696 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 325, + 696 + ], + "score": 1.0, + "content": "SCAFFOLD [18] employ variance reduction techniques.", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 47, + "bbox_fs": [ + 105, + 639, + 506, + 696 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 700, + 503, + 722 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "One line of work focused on variations in computation capabilities among devices [39, 31, 40]. These", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 709, + 505, + 725 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 725 + ], + "score": 1.0, + "content": "models assume that responses are delayed but not missing. To address the missing response, some", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 72, + 506, + 85 + ], + "spans": [ + { + "bbox": [ + 105, + 72, + 506, + 85 + ], + "score": 1.0, + "content": "work assumes that the server can actively sample a subset of devices to respond [18, 28, 42, 25, 14]", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 83, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 96 + ], + "score": 1.0, + "content": "or that the pattern of device availability is known [26, 17, 10, 30]. These results do not generalize", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 93, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 506, + 107 + ], + "score": 1.0, + "content": "to adversarial inactive patterns. [32] discussed the impact of device inactivity on convergence but", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 106, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 106, + 506, + 118 + ], + "score": 1.0, + "content": "their proposed algorithm diverges if there exists an inactive device in each round of communication.", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 115, + 506, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 129 + ], + "score": 1.0, + "content": "However, our setup allows adversarial patterns under certain non-distributional assumptions (see", + "type": "text", + "cross_page": true + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 127, + 379, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 379, + 140 + ], + "score": 1.0, + "content": "Section 5) while our proposed algorithm still achieves convergence.", + "type": "text", + "cross_page": true + } + ], + "index": 5 + } + ], + "index": 50.5, + "bbox_fs": [ + 105, + 699, + 505, + 725 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 72, + 505, + 138 + ], + "lines": [ + { + "bbox": [ + 105, + 72, + 506, + 85 + ], + "spans": [ + { + "bbox": [ + 105, + 72, + 506, + 85 + ], + "score": 1.0, + "content": "work assumes that the server can actively sample a subset of devices to respond [18, 28, 42, 25, 14]", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 83, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 96 + ], + "score": 1.0, + "content": "or that the pattern of device availability is known [26, 17, 10, 30]. These results do not generalize", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 93, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 506, + 107 + ], + "score": 1.0, + "content": "to adversarial inactive patterns. [32] discussed the impact of device inactivity on convergence but", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 106, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 106, + 506, + 118 + ], + "score": 1.0, + "content": "their proposed algorithm diverges if there exists an inactive device in each round of communication.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 115, + 506, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 129 + ], + "score": 1.0, + "content": "However, our setup allows adversarial patterns under certain non-distributional assumptions (see", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 127, + 379, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 379, + 140 + ], + "score": 1.0, + "content": "Section 5) while our proposed algorithm still achieves convergence.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 151, + 505, + 229 + ], + "lines": [ + { + "bbox": [ + 106, + 151, + 505, + 164 + ], + "spans": [ + { + "bbox": [ + 106, + 151, + 505, + 164 + ], + "score": 1.0, + "content": "Asynchronous distributed optimization. Our work is related to literature in the field of traditional", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 163, + 505, + 175 + ], + "spans": [ + { + "bbox": [ + 106, + 163, + 505, + 175 + ], + "score": 1.0, + "content": "asynchronous distributed optimization in that our proposed algorithm uses stale gradients. The", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 173, + 505, + 186 + ], + "spans": [ + { + "bbox": [ + 106, + 173, + 505, + 186 + ], + "score": 1.0, + "content": "problem setup for asynchronous distributed algorithms can be divided into two categories [13]. One", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 185, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 106, + 185, + 505, + 196 + ], + "score": 1.0, + "content": "is the shared-data (i.i.d.) setting, where all workers can access the whole dataset. In this setting, the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 195, + 506, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 506, + 208 + ], + "score": 1.0, + "content": "local gradient is an unbiased estimator of the global gradient [35, 4, 27, 11, 45, 1]. In contrast, we", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 207, + 505, + 219 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 505, + 219 + ], + "score": 1.0, + "content": "assume each worker has non-i.i.d. data, and hence the local stochastic gradient can not be viewed as", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 217, + 286, + 230 + ], + "spans": [ + { + "bbox": [ + 106, + 217, + 286, + 230 + ], + "score": 1.0, + "content": "an unbiased estimator of the global gradient.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 106, + 233, + 505, + 321 + ], + "lines": [ + { + "bbox": [ + 106, + 234, + 506, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 506, + 246 + ], + "score": 1.0, + "content": "The other less studied setting in distributed optimization is the distributed-data setting (non-i.i.d.),", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 245, + 506, + 257 + ], + "spans": [ + { + "bbox": [ + 106, + 245, + 506, + 257 + ], + "score": 1.0, + "content": "where data are partitioned among workers. Specifically, [5] proposed an asynchronous incremental", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 255, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 506, + 268 + ], + "score": 1.0, + "content": "aggregated gradient algorithm that uses buffered gradients to update the global model. Unlike our", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 267, + 505, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 505, + 278 + ], + "score": 1.0, + "content": "setup, this algorithm evaluates full local gradients, performs only one local step, and was analyzed", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 278, + 506, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 278, + 506, + 290 + ], + "score": 1.0, + "content": "under the bounded delay assumption. [13] models the delay as stochastic and assumes that the server", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 288, + 506, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 506, + 300 + ], + "score": 1.0, + "content": "has knowledge of the distribution, but our formulation is distribution-free. [6] allows workers to", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 299, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 505, + 311 + ], + "score": 1.0, + "content": "perform multiple local steps and communicate with the server at different times, but the authors", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 309, + 376, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 376, + 322 + ], + "score": 1.0, + "content": "assume that all workers are available and compute at the same rate.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 106, + 334, + 505, + 421 + ], + "lines": [ + { + "bbox": [ + 106, + 333, + 506, + 347 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 506, + 347 + ], + "score": 1.0, + "content": "Comparison with an independent work. While preparing the manuscript, we were unaware of", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 344, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 505, + 357 + ], + "score": 1.0, + "content": "an independent work [41] that investigated the same setup and proposed a similar algorithm called", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 353, + 507, + 373 + ], + "spans": [ + { + "bbox": [ + 104, + 353, + 391, + 373 + ], + "score": 1.0, + "content": "FedLaAvg. Their main theorem established the convergence rate of", + "type": "text" + }, + { + "bbox": [ + 392, + 356, + 488, + 370 + ], + "score": 0.9, + "content": "\\mathcal { O } \\left( \\sqrt { \\frac { \\nu _ { \\mathrm { m a x } } } { N ^ { 0 . 5 } T } } ( \\mathbf { \\bar { G } } ^ { 2 } + \\sigma ^ { 2 } ) \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 353, + 507, + 373 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 368, + 506, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 277, + 381 + ], + "score": 1.0, + "content": "smooth and non-convex problems, where", + "type": "text" + }, + { + "bbox": [ + 277, + 368, + 290, + 379 + ], + "score": 0.87, + "content": "G ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 368, + 506, + 381 + ], + "score": 1.0, + "content": "is the uniform upper bound for the squared norm of", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 379, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 204, + 393 + ], + "score": 1.0, + "content": "stochastic gradients and", + "type": "text" + }, + { + "bbox": [ + 204, + 381, + 226, + 391 + ], + "score": 0.88, + "content": "\\nu _ { m a x }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 379, + 506, + 393 + ], + "score": 1.0, + "content": "is the maximum number of inactive rounds. In comparison, we prove", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 392, + 507, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 218, + 411 + ], + "score": 1.0, + "content": "the minimax optimal rate of", + "type": "text" + }, + { + "bbox": [ + 218, + 392, + 277, + 411 + ], + "score": 0.93, + "content": "\\mathcal { O } ( \\sqrt { \\frac { \\bar { \\nu } } { N K T } } \\sigma ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 392, + 507, + 411 + ], + "score": 1.0, + "content": "without the bounded gradient assumption, also improving", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 107, + 409, + 402, + 421 + ], + "spans": [ + { + "bbox": [ + 107, + 411, + 128, + 421 + ], + "score": 0.86, + "content": "\\nu _ { \\mathrm { m a x } }", + "type": "inline_equation" + }, + { + "bbox": [ + 128, + 409, + 139, + 421 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 140, + 411, + 146, + 419 + ], + "score": 0.63, + "content": "\\bar { \\nu }", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 409, + 360, + 421 + ], + "score": 1.0, + "content": ". Furthermore, our result achieves a linear speedup in", + "type": "text" + }, + { + "bbox": [ + 360, + 410, + 370, + 419 + ], + "score": 0.81, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 409, + 388, + 421 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 388, + 410, + 398, + 419 + ], + "score": 0.81, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 409, + 402, + 421 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 425, + 505, + 481 + ], + "lines": [ + { + "bbox": [ + 106, + 425, + 506, + 438 + ], + "spans": [ + { + "bbox": [ + 106, + 425, + 506, + 438 + ], + "score": 1.0, + "content": "Apart from non-convex functions, we also derive the minimax optimal rates for strongly convex", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 436, + 506, + 449 + ], + "spans": [ + { + "bbox": [ + 105, + 436, + 506, + 449 + ], + "score": 1.0, + "content": "smooth functions under the mild assumption that allows for arbitrary and unbounded number of", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 447, + 505, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 390, + 460 + ], + "score": 1.0, + "content": "inactive rounds. Both of our results achieve linear speedups in terms of", + "type": "text" + }, + { + "bbox": [ + 390, + 448, + 400, + 457 + ], + "score": 0.84, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 447, + 418, + 460 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 419, + 448, + 429, + 457 + ], + "score": 0.83, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 447, + 505, + 460 + ], + "score": 1.0, + "content": ", and automatically", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 458, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 458, + 505, + 471 + ], + "score": 1.0, + "content": "recover the best-known rates of FedAvg when all devices are active. We also show that our proposed", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 469, + 489, + 482 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 489, + 482 + ], + "score": 1.0, + "content": "algorithm achieves acceleration over unbiased baseline algorithms in the presence of stragglers.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30 + }, + { + "type": "title", + "bbox": [ + 107, + 497, + 202, + 511 + ], + "lines": [ + { + "bbox": [ + 104, + 495, + 203, + 514 + ], + "spans": [ + { + "bbox": [ + 104, + 495, + 203, + 514 + ], + "score": 1.0, + "content": "3 Problem Setup", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 523, + 423, + 535 + ], + "lines": [ + { + "bbox": [ + 105, + 521, + 424, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 521, + 424, + 537 + ], + "score": 1.0, + "content": "We consider optimizing the following problem in a Federated Learning setting:", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 541, + 421, + 563 + ], + "lines": [ + { + "bbox": [ + 189, + 541, + 421, + 563 + ], + "spans": [ + { + "bbox": [ + 189, + 541, + 421, + 563 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\underset { w \\in \\mathbb { R } ^ { d } } { \\operatorname* { m i n } } f ( w ) : = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } f _ { i } ( w ) : = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\mathbb { E } _ { \\xi _ { i } } [ f _ { i } ( w , \\xi _ { i } ) ] , } \\end{array}", + "type": "interline_equation", + "image_path": "22f078ec690bdea95bad0a3810ee899d3c05899a7210597c3a542826721eabc9.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 189, + 541, + 421, + 563 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 568, + 505, + 602 + ], + "lines": [ + { + "bbox": [ + 105, + 568, + 506, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 132, + 582 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 571, + 141, + 579 + ], + "score": 0.74, + "content": "w", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 568, + 437, + 582 + ], + "score": 1.0, + "content": "is the optimization variable, e.g., parameters of a machine learning model,", + "type": "text" + }, + { + "bbox": [ + 438, + 569, + 448, + 579 + ], + "score": 0.82, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 568, + 506, + 582 + ], + "score": 1.0, + "content": "is the number", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 579, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 204, + 592 + ], + "score": 1.0, + "content": "of participating devices,", + "type": "text" + }, + { + "bbox": [ + 205, + 580, + 214, + 591 + ], + "score": 0.87, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 579, + 355, + 592 + ], + "score": 1.0, + "content": "is the local loss function on device", + "type": "text" + }, + { + "bbox": [ + 355, + 581, + 360, + 590 + ], + "score": 0.77, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 579, + 380, + 592 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 380, + 580, + 389, + 591 + ], + "score": 0.87, + "content": "\\xi _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 579, + 505, + 592 + ], + "score": 1.0, + "content": "describes the randomness in", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 590, + 198, + 602 + ], + "spans": [ + { + "bbox": [ + 105, + 590, + 198, + 602 + ], + "score": 1.0, + "content": "local data distribution.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 106, + 606, + 505, + 673 + ], + "lines": [ + { + "bbox": [ + 105, + 606, + 506, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 606, + 506, + 620 + ], + "score": 1.0, + "content": "In the ideal federated learning setup (see Figure 1 (a)), all devices return responses within similar", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 617, + 506, + 631 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 506, + 631 + ], + "score": 1.0, + "content": "time, and hence the central server collects all the local updates. In this case, the computation cost", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 628, + 506, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 506, + 642 + ], + "score": 1.0, + "content": "is usually measured by the number of local stochastic oracle evaluations, which is proportional to", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 639, + 505, + 652 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 505, + 652 + ], + "score": 1.0, + "content": "the number of rounds. In a delayed FL setup (see Figure 1 (b)), devices are always active upon the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 650, + 506, + 663 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 506, + 663 + ], + "score": 1.0, + "content": "central server’s request but may return responses with a delay. Here, all devices return almost the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 663, + 282, + 674 + ], + "spans": [ + { + "bbox": [ + 106, + 663, + 282, + 674 + ], + "score": 1.0, + "content": "same number of responses in the long term.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 41.5 + }, + { + "type": "text", + "bbox": [ + 107, + 678, + 504, + 722 + ], + "lines": [ + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "score": 1.0, + "content": "As we discussed, the above setups do not depict a real-world scenario in which a device can have", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 690, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 690, + 505, + 700 + ], + "score": 1.0, + "content": "a longer inactive duration than active duration. In such cases, the communication interval is much", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 700, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 700, + 505, + 712 + ], + "score": 1.0, + "content": "longer than the local computation time required for each update, and each device generates an unequal", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 712, + 390, + 723 + ], + "spans": [ + { + "bbox": [ + 106, + 712, + 390, + 723 + ], + "score": 1.0, + "content": "number of responses [28, 17]. This motivates our setup in Figure 1 (c).", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 46.5 + } + ], + "page_idx": 2, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 741, + 309, + 750 + ], + "lines": [ + { + "bbox": [ + 301, + 740, + 310, + 752 + ], + "spans": [ + { + "bbox": [ + 301, + 740, + 310, + 752 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 72, + 505, + 138 + ], + "lines": [], + "index": 2.5, + "bbox_fs": [ + 105, + 72, + 506, + 140 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 151, + 505, + 229 + ], + "lines": [ + { + "bbox": [ + 106, + 151, + 505, + 164 + ], + "spans": [ + { + "bbox": [ + 106, + 151, + 505, + 164 + ], + "score": 1.0, + "content": "Asynchronous distributed optimization. Our work is related to literature in the field of traditional", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 163, + 505, + 175 + ], + "spans": [ + { + "bbox": [ + 106, + 163, + 505, + 175 + ], + "score": 1.0, + "content": "asynchronous distributed optimization in that our proposed algorithm uses stale gradients. The", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 173, + 505, + 186 + ], + "spans": [ + { + "bbox": [ + 106, + 173, + 505, + 186 + ], + "score": 1.0, + "content": "problem setup for asynchronous distributed algorithms can be divided into two categories [13]. One", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 185, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 106, + 185, + 505, + 196 + ], + "score": 1.0, + "content": "is the shared-data (i.i.d.) setting, where all workers can access the whole dataset. In this setting, the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 195, + 506, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 506, + 208 + ], + "score": 1.0, + "content": "local gradient is an unbiased estimator of the global gradient [35, 4, 27, 11, 45, 1]. In contrast, we", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 207, + 505, + 219 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 505, + 219 + ], + "score": 1.0, + "content": "assume each worker has non-i.i.d. data, and hence the local stochastic gradient can not be viewed as", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 217, + 286, + 230 + ], + "spans": [ + { + "bbox": [ + 106, + 217, + 286, + 230 + ], + "score": 1.0, + "content": "an unbiased estimator of the global gradient.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 151, + 506, + 230 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 233, + 505, + 321 + ], + "lines": [ + { + "bbox": [ + 106, + 234, + 506, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 506, + 246 + ], + "score": 1.0, + "content": "The other less studied setting in distributed optimization is the distributed-data setting (non-i.i.d.),", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 245, + 506, + 257 + ], + "spans": [ + { + "bbox": [ + 106, + 245, + 506, + 257 + ], + "score": 1.0, + "content": "where data are partitioned among workers. Specifically, [5] proposed an asynchronous incremental", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 255, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 506, + 268 + ], + "score": 1.0, + "content": "aggregated gradient algorithm that uses buffered gradients to update the global model. Unlike our", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 267, + 505, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 505, + 278 + ], + "score": 1.0, + "content": "setup, this algorithm evaluates full local gradients, performs only one local step, and was analyzed", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 278, + 506, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 278, + 506, + 290 + ], + "score": 1.0, + "content": "under the bounded delay assumption. [13] models the delay as stochastic and assumes that the server", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 288, + 506, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 506, + 300 + ], + "score": 1.0, + "content": "has knowledge of the distribution, but our formulation is distribution-free. [6] allows workers to", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 299, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 505, + 311 + ], + "score": 1.0, + "content": "perform multiple local steps and communicate with the server at different times, but the authors", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 309, + 376, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 376, + 322 + ], + "score": 1.0, + "content": "assume that all workers are available and compute at the same rate.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 16.5, + "bbox_fs": [ + 105, + 234, + 506, + 322 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 334, + 505, + 421 + ], + "lines": [ + { + "bbox": [ + 106, + 333, + 506, + 347 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 506, + 347 + ], + "score": 1.0, + "content": "Comparison with an independent work. While preparing the manuscript, we were unaware of", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 344, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 505, + 357 + ], + "score": 1.0, + "content": "an independent work [41] that investigated the same setup and proposed a similar algorithm called", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 353, + 507, + 373 + ], + "spans": [ + { + "bbox": [ + 104, + 353, + 391, + 373 + ], + "score": 1.0, + "content": "FedLaAvg. Their main theorem established the convergence rate of", + "type": "text" + }, + { + "bbox": [ + 392, + 356, + 488, + 370 + ], + "score": 0.9, + "content": "\\mathcal { O } \\left( \\sqrt { \\frac { \\nu _ { \\mathrm { m a x } } } { N ^ { 0 . 5 } T } } ( \\mathbf { \\bar { G } } ^ { 2 } + \\sigma ^ { 2 } ) \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 353, + 507, + 373 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 368, + 506, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 277, + 381 + ], + "score": 1.0, + "content": "smooth and non-convex problems, where", + "type": "text" + }, + { + "bbox": [ + 277, + 368, + 290, + 379 + ], + "score": 0.87, + "content": "G ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 368, + 506, + 381 + ], + "score": 1.0, + "content": "is the uniform upper bound for the squared norm of", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 379, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 204, + 393 + ], + "score": 1.0, + "content": "stochastic gradients and", + "type": "text" + }, + { + "bbox": [ + 204, + 381, + 226, + 391 + ], + "score": 0.88, + "content": "\\nu _ { m a x }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 379, + 506, + 393 + ], + "score": 1.0, + "content": "is the maximum number of inactive rounds. In comparison, we prove", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 392, + 507, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 218, + 411 + ], + "score": 1.0, + "content": "the minimax optimal rate of", + "type": "text" + }, + { + "bbox": [ + 218, + 392, + 277, + 411 + ], + "score": 0.93, + "content": "\\mathcal { O } ( \\sqrt { \\frac { \\bar { \\nu } } { N K T } } \\sigma ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 392, + 507, + 411 + ], + "score": 1.0, + "content": "without the bounded gradient assumption, also improving", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 107, + 409, + 402, + 421 + ], + "spans": [ + { + "bbox": [ + 107, + 411, + 128, + 421 + ], + "score": 0.86, + "content": "\\nu _ { \\mathrm { m a x } }", + "type": "inline_equation" + }, + { + "bbox": [ + 128, + 409, + 139, + 421 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 140, + 411, + 146, + 419 + ], + "score": 0.63, + "content": "\\bar { \\nu }", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 409, + 360, + 421 + ], + "score": 1.0, + "content": ". Furthermore, our result achieves a linear speedup in", + "type": "text" + }, + { + "bbox": [ + 360, + 410, + 370, + 419 + ], + "score": 0.81, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 409, + 388, + 421 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 388, + 410, + 398, + 419 + ], + "score": 0.81, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 409, + 402, + 421 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 24, + "bbox_fs": [ + 104, + 333, + 507, + 421 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 425, + 505, + 481 + ], + "lines": [ + { + "bbox": [ + 106, + 425, + 506, + 438 + ], + "spans": [ + { + "bbox": [ + 106, + 425, + 506, + 438 + ], + "score": 1.0, + "content": "Apart from non-convex functions, we also derive the minimax optimal rates for strongly convex", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 436, + 506, + 449 + ], + "spans": [ + { + "bbox": [ + 105, + 436, + 506, + 449 + ], + "score": 1.0, + "content": "smooth functions under the mild assumption that allows for arbitrary and unbounded number of", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 447, + 505, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 390, + 460 + ], + "score": 1.0, + "content": "inactive rounds. Both of our results achieve linear speedups in terms of", + "type": "text" + }, + { + "bbox": [ + 390, + 448, + 400, + 457 + ], + "score": 0.84, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 447, + 418, + 460 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 419, + 448, + 429, + 457 + ], + "score": 0.83, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 447, + 505, + 460 + ], + "score": 1.0, + "content": ", and automatically", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 458, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 458, + 505, + 471 + ], + "score": 1.0, + "content": "recover the best-known rates of FedAvg when all devices are active. We also show that our proposed", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 469, + 489, + 482 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 489, + 482 + ], + "score": 1.0, + "content": "algorithm achieves acceleration over unbiased baseline algorithms in the presence of stragglers.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 425, + 506, + 482 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 497, + 202, + 511 + ], + "lines": [ + { + "bbox": [ + 104, + 495, + 203, + 514 + ], + "spans": [ + { + "bbox": [ + 104, + 495, + 203, + 514 + ], + "score": 1.0, + "content": "3 Problem Setup", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 523, + 423, + 535 + ], + "lines": [ + { + "bbox": [ + 105, + 521, + 424, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 521, + 424, + 537 + ], + "score": 1.0, + "content": "We consider optimizing the following problem in a Federated Learning setting:", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 521, + 424, + 537 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 541, + 421, + 563 + ], + "lines": [ + { + "bbox": [ + 189, + 541, + 421, + 563 + ], + "spans": [ + { + "bbox": [ + 189, + 541, + 421, + 563 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\underset { w \\in \\mathbb { R } ^ { d } } { \\operatorname* { m i n } } f ( w ) : = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } f _ { i } ( w ) : = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\mathbb { E } _ { \\xi _ { i } } [ f _ { i } ( w , \\xi _ { i } ) ] , } \\end{array}", + "type": "interline_equation", + "image_path": "22f078ec690bdea95bad0a3810ee899d3c05899a7210597c3a542826721eabc9.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 189, + 541, + 421, + 563 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 568, + 505, + 602 + ], + "lines": [ + { + "bbox": [ + 105, + 568, + 506, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 132, + 582 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 571, + 141, + 579 + ], + "score": 0.74, + "content": "w", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 568, + 437, + 582 + ], + "score": 1.0, + "content": "is the optimization variable, e.g., parameters of a machine learning model,", + "type": "text" + }, + { + "bbox": [ + 438, + 569, + 448, + 579 + ], + "score": 0.82, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 568, + 506, + 582 + ], + "score": 1.0, + "content": "is the number", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 579, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 204, + 592 + ], + "score": 1.0, + "content": "of participating devices,", + "type": "text" + }, + { + "bbox": [ + 205, + 580, + 214, + 591 + ], + "score": 0.87, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 579, + 355, + 592 + ], + "score": 1.0, + "content": "is the local loss function on device", + "type": "text" + }, + { + "bbox": [ + 355, + 581, + 360, + 590 + ], + "score": 0.77, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 579, + 380, + 592 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 380, + 580, + 389, + 591 + ], + "score": 0.87, + "content": "\\xi _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 579, + 505, + 592 + ], + "score": 1.0, + "content": "describes the randomness in", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 590, + 198, + 602 + ], + "spans": [ + { + "bbox": [ + 105, + 590, + 198, + 602 + ], + "score": 1.0, + "content": "local data distribution.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 568, + 506, + 602 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 606, + 505, + 673 + ], + "lines": [ + { + "bbox": [ + 105, + 606, + 506, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 606, + 506, + 620 + ], + "score": 1.0, + "content": "In the ideal federated learning setup (see Figure 1 (a)), all devices return responses within similar", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 617, + 506, + 631 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 506, + 631 + ], + "score": 1.0, + "content": "time, and hence the central server collects all the local updates. In this case, the computation cost", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 628, + 506, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 506, + 642 + ], + "score": 1.0, + "content": "is usually measured by the number of local stochastic oracle evaluations, which is proportional to", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 639, + 505, + 652 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 505, + 652 + ], + "score": 1.0, + "content": "the number of rounds. In a delayed FL setup (see Figure 1 (b)), devices are always active upon the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 650, + 506, + 663 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 506, + 663 + ], + "score": 1.0, + "content": "central server’s request but may return responses with a delay. Here, all devices return almost the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 663, + 282, + 674 + ], + "spans": [ + { + "bbox": [ + 106, + 663, + 282, + 674 + ], + "score": 1.0, + "content": "same number of responses in the long term.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 41.5, + "bbox_fs": [ + 105, + 606, + 506, + 674 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 678, + 504, + 722 + ], + "lines": [ + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "score": 1.0, + "content": "As we discussed, the above setups do not depict a real-world scenario in which a device can have", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 690, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 690, + 505, + 700 + ], + "score": 1.0, + "content": "a longer inactive duration than active duration. In such cases, the communication interval is much", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 700, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 700, + 505, + 712 + ], + "score": 1.0, + "content": "longer than the local computation time required for each update, and each device generates an unequal", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 712, + 390, + 723 + ], + "spans": [ + { + "bbox": [ + 106, + 712, + 390, + 723 + ], + "score": 1.0, + "content": "number of responses [28, 17]. This motivates our setup in Figure 1 (c).", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 46.5, + "bbox_fs": [ + 105, + 677, + 506, + 723 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 65, + 504, + 185 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 65, + 504, + 185 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 65, + 504, + 185 + ], + "spans": [ + { + "bbox": [ + 108, + 65, + 504, + 185 + ], + "score": 0.969, + "type": "image", + "image_path": "dbec5db87e22ee0dc55043253dc815eff5fd652c994f67ee8a04489f10ef06e1.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 65, + 504, + 105.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 105.0, + 504, + 145.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 145.0, + 504, + 185.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 187, + 506, + 231 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 187, + 506, + 199 + ], + "spans": [ + { + "bbox": [ + 106, + 187, + 506, + 199 + ], + "score": 1.0, + "content": "Figure 1: An illustration of setup. (a) Ideal setup: all devices return their responses within similar", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 198, + 506, + 210 + ], + "spans": [ + { + "bbox": [ + 106, + 198, + 506, + 210 + ], + "score": 1.0, + "content": "time. (b) Delayed setup: all devices are available, but may return responses with a delay. (c) Our", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 210, + 505, + 221 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 505, + 221 + ], + "score": 1.0, + "content": "setup: devices can be unavailable arbitrarily, and the communication interval is long enough for", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 221, + 245, + 232 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 245, + 232 + ], + "score": 1.0, + "content": "active devices to return responses.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "text", + "bbox": [ + 106, + 237, + 505, + 282 + ], + "lines": [ + { + "bbox": [ + 106, + 237, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 238, + 249 + ], + "score": 1.0, + "content": "In our proposed setup, we use", + "type": "text" + }, + { + "bbox": [ + 238, + 239, + 243, + 247 + ], + "score": 0.67, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 237, + 505, + 249 + ], + "score": 1.0, + "content": "to index the global communication rounds. We say a device", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 249, + 506, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 235, + 260 + ], + "score": 1.0, + "content": "participates or is active at round", + "type": "text" + }, + { + "bbox": [ + 235, + 249, + 240, + 258 + ], + "score": 0.73, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 249, + 506, + 260 + ], + "score": 1.0, + "content": "if it can complete the computation task and send back the update at", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 259, + 506, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 259, + 173, + 271 + ], + "score": 1.0, + "content": "the end of round", + "type": "text" + }, + { + "bbox": [ + 173, + 260, + 179, + 269 + ], + "score": 0.59, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 259, + 225, + 271 + ], + "score": 1.0, + "content": ". We define", + "type": "text" + }, + { + "bbox": [ + 225, + 259, + 245, + 271 + ], + "score": 0.92, + "content": "\\boldsymbol { \\mathcal { A } } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 259, + 400, + 271 + ], + "score": 1.0, + "content": "as the set of all active devices at round", + "type": "text" + }, + { + "bbox": [ + 400, + 260, + 405, + 269 + ], + "score": 0.4, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 259, + 506, + 271 + ], + "score": 1.0, + "content": ". Notice that we make no", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 270, + 507, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 507, + 284 + ], + "score": 1.0, + "content": "assumptions on the distribution of the participation patterns of devices and allow them to be arbitrary.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 108, + 286, + 505, + 320 + ], + "lines": [ + { + "bbox": [ + 105, + 285, + 506, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 506, + 299 + ], + "score": 1.0, + "content": "Directly applying FedAvg to the proposed setup can be problematic due to the existence of inactive", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 297, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 297, + 506, + 309 + ], + "score": 1.0, + "content": "devices. To accommodate for inactive devices, we discuss three natural variants of FedAvg and their", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 308, + 370, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 370, + 321 + ], + "score": 1.0, + "content": "limitations. The detailed algorithms can be found in Appendix A.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 133, + 331, + 505, + 475 + ], + "lines": [ + { + "bbox": [ + 132, + 330, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 132, + 330, + 506, + 344 + ], + "score": 1.0, + "content": "• Biased FedAvg. At each communication round, the global model is updated with a direct", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 343, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 141, + 343, + 505, + 354 + ], + "score": 1.0, + "content": "average of local updates from the active devices. This naive approach induces bias when", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 353, + 382, + 366 + ], + "spans": [ + { + "bbox": [ + 141, + 353, + 382, + 366 + ], + "score": 1.0, + "content": "data distribution and response patterns vary among devices.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 369, + 506, + 383 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 388, + 383 + ], + "score": 1.0, + "content": "• FedAvg with device sampling. The server selects a subset of", + "type": "text" + }, + { + "bbox": [ + 389, + 370, + 397, + 380 + ], + "score": 0.82, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 369, + 506, + 383 + ], + "score": 1.0, + "content": "devices randomly without", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 381, + 505, + 393 + ], + "spans": [ + { + "bbox": [ + 141, + 381, + 375, + 393 + ], + "score": 1.0, + "content": "replacement, and then waits until all devices in the subset", + "type": "text" + }, + { + "bbox": [ + 375, + 381, + 384, + 391 + ], + "score": 0.79, + "content": "s", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 381, + 505, + 393 + ], + "score": 1.0, + "content": "respond. This is how original", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 392, + 506, + 404 + ], + "spans": [ + { + "bbox": [ + 141, + 392, + 396, + 404 + ], + "score": 1.0, + "content": "FedAvg [28] addresses device unavailability. Note that over", + "type": "text" + }, + { + "bbox": [ + 396, + 392, + 405, + 402 + ], + "score": 0.78, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 392, + 506, + 404 + ], + "score": 1.0, + "content": "communication rounds,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 402, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 141, + 402, + 297, + 415 + ], + "score": 1.0, + "content": "the global model is updated less than", + "type": "text" + }, + { + "bbox": [ + 297, + 403, + 306, + 413 + ], + "score": 0.75, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 402, + 505, + 415 + ], + "score": 1.0, + "content": "times due to waiting. This approach is prone to", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 414, + 441, + 426 + ], + "spans": [ + { + "bbox": [ + 141, + 414, + 441, + 426 + ], + "score": 1.0, + "content": "stragglers and we refer the readers to Section 5.1 for a detailed discussion.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 133, + 430, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 133, + 430, + 506, + 443 + ], + "score": 1.0, + "content": "• FedAvg with importance sampling [26, 13, 17]. The local updates from the active devices", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 442, + 505, + 454 + ], + "spans": [ + { + "bbox": [ + 141, + 442, + 505, + 454 + ], + "score": 1.0, + "content": "are weighted by the reciprocal of the participation probabilities to avoid bias. This approach", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 452, + 506, + 465 + ], + "spans": [ + { + "bbox": [ + 141, + 452, + 506, + 465 + ], + "score": 1.0, + "content": "is only applicable when the response of each device is i.i.d. over rounds and it requires the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 142, + 463, + 307, + 475 + ], + "spans": [ + { + "bbox": [ + 142, + 463, + 307, + 475 + ], + "score": 1.0, + "content": "knowledge of participation probabilities.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 19.5 + }, + { + "type": "title", + "bbox": [ + 108, + 492, + 434, + 506 + ], + "lines": [ + { + "bbox": [ + 104, + 491, + 437, + 510 + ], + "spans": [ + { + "bbox": [ + 104, + 491, + 437, + 510 + ], + "score": 1.0, + "content": "4 Memory-augmented Impatient Federated Averaging (MIFA)", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 518, + 505, + 585 + ], + "lines": [ + { + "bbox": [ + 104, + 516, + 506, + 532 + ], + "spans": [ + { + "bbox": [ + 104, + 516, + 506, + 532 + ], + "score": 1.0, + "content": "In this section, we introduce our algorithm — Memory-augmented Impatient Federated Averaging", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 528, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 272, + 542 + ], + "score": 1.0, + "content": "(MIFA). MIFA maintains an update-array", + "type": "text" + }, + { + "bbox": [ + 273, + 529, + 295, + 541 + ], + "score": 0.92, + "content": "\\{ G ^ { i } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 528, + 506, + 542 + ], + "score": 1.0, + "content": "in the memory that stores the latest updates for all", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "score": 1.0, + "content": "devices. As the name suggests, MIFA has two components. First, the algorithm is impatient and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 550, + 506, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 506, + 564 + ], + "score": 1.0, + "content": "avoids waiting for any specific device when facing heterogeneous devices with arbitrary availability.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 561, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 506, + 574 + ], + "score": 1.0, + "content": "Second, the algorithm augments the received updates of the active devices with the stored updates of", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 572, + 275, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 275, + 586 + ], + "score": 1.0, + "content": "the inactive devices to perform averaging.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 107, + 589, + 505, + 625 + ], + "lines": [ + { + "bbox": [ + 106, + 588, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 263, + 601 + ], + "score": 1.0, + "content": "Specifically, at the beginning of round", + "type": "text" + }, + { + "bbox": [ + 263, + 590, + 268, + 599 + ], + "score": 0.76, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 588, + 469, + 601 + ], + "score": 1.0, + "content": ", the server broadcasts the latest model parameter", + "type": "text" + }, + { + "bbox": [ + 469, + 591, + 481, + 600 + ], + "score": 0.84, + "content": "w _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 588, + 505, + 601 + ], + "score": 1.0, + "content": "to all", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 600, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 165, + 614 + ], + "score": 1.0, + "content": "active devices", + "type": "text" + }, + { + "bbox": [ + 165, + 600, + 185, + 612 + ], + "score": 0.91, + "content": "\\boldsymbol { \\mathcal { A } } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 600, + 253, + 614 + ], + "score": 1.0, + "content": ". After receiving", + "type": "text" + }, + { + "bbox": [ + 253, + 602, + 264, + 612 + ], + "score": 0.86, + "content": "w _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 600, + 379, + 614 + ], + "score": 1.0, + "content": ", each active device, say, the", + "type": "text" + }, + { + "bbox": [ + 379, + 601, + 384, + 610 + ], + "score": 0.74, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 600, + 444, + 614 + ], + "score": 1.0, + "content": "-th device, sets", + "type": "text" + }, + { + "bbox": [ + 445, + 600, + 487, + 614 + ], + "score": 0.93, + "content": "w _ { t , 0 } ^ { i } = w _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 600, + 505, + 614 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 611, + 435, + 629 + ], + "spans": [ + { + "bbox": [ + 104, + 611, + 145, + 629 + ], + "score": 1.0, + "content": "performs", + "type": "text" + }, + { + "bbox": [ + 145, + 613, + 155, + 623 + ], + "score": 0.83, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 611, + 409, + 629 + ], + "score": 1.0, + "content": "steps of SGD with respect to the local objective function to get", + "type": "text" + }, + { + "bbox": [ + 409, + 612, + 430, + 627 + ], + "score": 0.93, + "content": "w _ { t , K } ^ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 611, + 435, + 629 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + }, + { + "type": "interline_equation", + "bbox": [ + 201, + 633, + 408, + 650 + ], + "lines": [ + { + "bbox": [ + 201, + 633, + 408, + 650 + ], + "spans": [ + { + "bbox": [ + 201, + 633, + 408, + 650 + ], + "score": 0.91, + "content": "\\boldsymbol w _ { t , k + 1 } ^ { i } = \\boldsymbol w _ { t , k } ^ { i } - \\eta _ { t } \\tilde { \\nabla } f _ { i } ( \\boldsymbol w _ { t , k } ^ { i } ) , \\boldsymbol k = 0 , \\cdots , \\boldsymbol K - 1 ,", + "type": "interline_equation", + "image_path": "2c0127a5706cf7944f95df9680a24f67da0062cc0709e170f05907f9d6d3a845.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 201, + 633, + 408, + 650 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 658, + 506, + 696 + ], + "lines": [ + { + "bbox": [ + 105, + 657, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 658, + 132, + 672 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 132, + 661, + 142, + 671 + ], + "score": 0.85, + "content": "\\eta _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 658, + 235, + 672 + ], + "score": 1.0, + "content": "is the learning rate and", + "type": "text" + }, + { + "bbox": [ + 236, + 657, + 278, + 673 + ], + "score": 0.93, + "content": "\\tilde { \\nabla } f _ { i } ( w _ { t , k } ^ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 658, + 457, + 672 + ], + "score": 1.0, + "content": "is the stochastic gradient evaluated on device", + "type": "text" + }, + { + "bbox": [ + 458, + 660, + 462, + 669 + ], + "score": 0.56, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 658, + 506, + 672 + ], + "score": 1.0, + "content": ". Next, the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 102, + 669, + 508, + 691 + ], + "spans": [ + { + "bbox": [ + 102, + 669, + 237, + 691 + ], + "score": 1.0, + "content": "server stores the received update", + "type": "text" + }, + { + "bbox": [ + 237, + 673, + 298, + 687 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\frac { 1 } { \\eta _ { t } } \\big ( w _ { t } - w _ { t , K } ^ { i } \\big ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 669, + 309, + 691 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 310, + 672, + 321, + 683 + ], + "score": 0.87, + "content": "G ^ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 669, + 369, + 691 + ], + "score": 1.0, + "content": ". Denote by", + "type": "text" + }, + { + "bbox": [ + 370, + 672, + 392, + 685 + ], + "score": 0.93, + "content": "\\{ G _ { t } ^ { i } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 669, + 508, + 691 + ], + "score": 1.0, + "content": "the update-array after round", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 107, + 686, + 170, + 698 + ], + "spans": [ + { + "bbox": [ + 107, + 687, + 111, + 695 + ], + "score": 0.71, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 111, + 686, + 170, + 698 + ], + "score": 1.0, + "content": ", then we have", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38 + }, + { + "type": "interline_equation", + "bbox": [ + 222, + 697, + 384, + 726 + ], + "lines": [ + { + "bbox": [ + 222, + 697, + 384, + 726 + ], + "spans": [ + { + "bbox": [ + 222, + 697, + 384, + 726 + ], + "score": 0.94, + "content": "\\begin{array} { r } { G _ { t } ^ { i } = \\left\\{ \\begin{array} { l l } { G _ { t - 1 } ^ { i } , } & { \\mathrm { ~ i f ~ } i \\notin \\mathcal { A } ( t ) , } \\\\ { \\frac { 1 } { \\eta _ { t } } ( w _ { t } - w _ { t , K } ^ { i } ) , } & { \\mathrm { ~ i f ~ } i \\in \\mathcal { A } ( t ) . } \\end{array} \\right. } \\end{array}", + "type": "interline_equation", + "image_path": "72c964c9acb692ffa258397e5523d41c405bf9354c410c37349066a92c8e4d6d.jpg" + } + ] + } + ], + "index": 40.5, + "virtual_lines": [ + { + "bbox": [ + 222, + 697, + 384, + 711.5 + ], + "spans": [], + "index": 40 + }, + { + "bbox": [ + 222, + 711.5, + 384, + 726.0 + ], + "spans": [], + "index": 41 + } + ] + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 741, + 309, + 750 + ], + "lines": [ + { + "bbox": [ + 301, + 740, + 310, + 752 + ], + "spans": [ + { + "bbox": [ + 301, + 740, + 310, + 752 + ], + "score": 1.0, + "content": "4", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 65, + 504, + 185 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 65, + 504, + 185 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 65, + 504, + 185 + ], + "spans": [ + { + "bbox": [ + 108, + 65, + 504, + 185 + ], + "score": 0.969, + "type": "image", + "image_path": "dbec5db87e22ee0dc55043253dc815eff5fd652c994f67ee8a04489f10ef06e1.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 65, + 504, + 105.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 105.0, + 504, + 145.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 145.0, + 504, + 185.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 187, + 506, + 231 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 187, + 506, + 199 + ], + "spans": [ + { + "bbox": [ + 106, + 187, + 506, + 199 + ], + "score": 1.0, + "content": "Figure 1: An illustration of setup. (a) Ideal setup: all devices return their responses within similar", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 198, + 506, + 210 + ], + "spans": [ + { + "bbox": [ + 106, + 198, + 506, + 210 + ], + "score": 1.0, + "content": "time. (b) Delayed setup: all devices are available, but may return responses with a delay. (c) Our", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 210, + 505, + 221 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 505, + 221 + ], + "score": 1.0, + "content": "setup: devices can be unavailable arbitrarily, and the communication interval is long enough for", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 221, + 245, + 232 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 245, + 232 + ], + "score": 1.0, + "content": "active devices to return responses.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "text", + "bbox": [ + 106, + 237, + 505, + 282 + ], + "lines": [ + { + "bbox": [ + 106, + 237, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 238, + 249 + ], + "score": 1.0, + "content": "In our proposed setup, we use", + "type": "text" + }, + { + "bbox": [ + 238, + 239, + 243, + 247 + ], + "score": 0.67, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 237, + 505, + 249 + ], + "score": 1.0, + "content": "to index the global communication rounds. We say a device", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 249, + 506, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 235, + 260 + ], + "score": 1.0, + "content": "participates or is active at round", + "type": "text" + }, + { + "bbox": [ + 235, + 249, + 240, + 258 + ], + "score": 0.73, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 249, + 506, + 260 + ], + "score": 1.0, + "content": "if it can complete the computation task and send back the update at", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 259, + 506, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 259, + 173, + 271 + ], + "score": 1.0, + "content": "the end of round", + "type": "text" + }, + { + "bbox": [ + 173, + 260, + 179, + 269 + ], + "score": 0.59, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 259, + 225, + 271 + ], + "score": 1.0, + "content": ". We define", + "type": "text" + }, + { + "bbox": [ + 225, + 259, + 245, + 271 + ], + "score": 0.92, + "content": "\\boldsymbol { \\mathcal { A } } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 259, + 400, + 271 + ], + "score": 1.0, + "content": "as the set of all active devices at round", + "type": "text" + }, + { + "bbox": [ + 400, + 260, + 405, + 269 + ], + "score": 0.4, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 259, + 506, + 271 + ], + "score": 1.0, + "content": ". Notice that we make no", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 270, + 507, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 507, + 284 + ], + "score": 1.0, + "content": "assumptions on the distribution of the participation patterns of devices and allow them to be arbitrary.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 237, + 507, + 284 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 286, + 505, + 320 + ], + "lines": [ + { + "bbox": [ + 105, + 285, + 506, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 506, + 299 + ], + "score": 1.0, + "content": "Directly applying FedAvg to the proposed setup can be problematic due to the existence of inactive", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 297, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 297, + 506, + 309 + ], + "score": 1.0, + "content": "devices. To accommodate for inactive devices, we discuss three natural variants of FedAvg and their", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 308, + 370, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 370, + 321 + ], + "score": 1.0, + "content": "limitations. The detailed algorithms can be found in Appendix A.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 285, + 506, + 321 + ] + }, + { + "type": "list", + "bbox": [ + 133, + 331, + 505, + 475 + ], + "lines": [ + { + "bbox": [ + 132, + 330, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 132, + 330, + 506, + 344 + ], + "score": 1.0, + "content": "• Biased FedAvg. At each communication round, the global model is updated with a direct", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 343, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 141, + 343, + 505, + 354 + ], + "score": 1.0, + "content": "average of local updates from the active devices. This naive approach induces bias when", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 353, + 382, + 366 + ], + "spans": [ + { + "bbox": [ + 141, + 353, + 382, + 366 + ], + "score": 1.0, + "content": "data distribution and response patterns vary among devices.", + "type": "text" + } + ], + "index": 16, + "is_list_end_line": true + }, + { + "bbox": [ + 132, + 369, + 506, + 383 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 388, + 383 + ], + "score": 1.0, + "content": "• FedAvg with device sampling. The server selects a subset of", + "type": "text" + }, + { + "bbox": [ + 389, + 370, + 397, + 380 + ], + "score": 0.82, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 369, + 506, + 383 + ], + "score": 1.0, + "content": "devices randomly without", + "type": "text" + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 381, + 505, + 393 + ], + "spans": [ + { + "bbox": [ + 141, + 381, + 375, + 393 + ], + "score": 1.0, + "content": "replacement, and then waits until all devices in the subset", + "type": "text" + }, + { + "bbox": [ + 375, + 381, + 384, + 391 + ], + "score": 0.79, + "content": "s", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 381, + 505, + 393 + ], + "score": 1.0, + "content": "respond. This is how original", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 392, + 506, + 404 + ], + "spans": [ + { + "bbox": [ + 141, + 392, + 396, + 404 + ], + "score": 1.0, + "content": "FedAvg [28] addresses device unavailability. Note that over", + "type": "text" + }, + { + "bbox": [ + 396, + 392, + 405, + 402 + ], + "score": 0.78, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 392, + 506, + 404 + ], + "score": 1.0, + "content": "communication rounds,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 402, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 141, + 402, + 297, + 415 + ], + "score": 1.0, + "content": "the global model is updated less than", + "type": "text" + }, + { + "bbox": [ + 297, + 403, + 306, + 413 + ], + "score": 0.75, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 402, + 505, + 415 + ], + "score": 1.0, + "content": "times due to waiting. This approach is prone to", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 414, + 441, + 426 + ], + "spans": [ + { + "bbox": [ + 141, + 414, + 441, + 426 + ], + "score": 1.0, + "content": "stragglers and we refer the readers to Section 5.1 for a detailed discussion.", + "type": "text" + } + ], + "index": 21, + "is_list_end_line": true + }, + { + "bbox": [ + 133, + 430, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 133, + 430, + 506, + 443 + ], + "score": 1.0, + "content": "• FedAvg with importance sampling [26, 13, 17]. The local updates from the active devices", + "type": "text" + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 442, + 505, + 454 + ], + "spans": [ + { + "bbox": [ + 141, + 442, + 505, + 454 + ], + "score": 1.0, + "content": "are weighted by the reciprocal of the participation probabilities to avoid bias. This approach", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 452, + 506, + 465 + ], + "spans": [ + { + "bbox": [ + 141, + 452, + 506, + 465 + ], + "score": 1.0, + "content": "is only applicable when the response of each device is i.i.d. over rounds and it requires the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 142, + 463, + 307, + 475 + ], + "spans": [ + { + "bbox": [ + 142, + 463, + 307, + 475 + ], + "score": 1.0, + "content": "knowledge of participation probabilities.", + "type": "text" + } + ], + "index": 25, + "is_list_end_line": true + } + ], + "index": 19.5, + "bbox_fs": [ + 132, + 330, + 506, + 475 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 492, + 434, + 506 + ], + "lines": [ + { + "bbox": [ + 104, + 491, + 437, + 510 + ], + "spans": [ + { + "bbox": [ + 104, + 491, + 437, + 510 + ], + "score": 1.0, + "content": "4 Memory-augmented Impatient Federated Averaging (MIFA)", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 518, + 505, + 585 + ], + "lines": [ + { + "bbox": [ + 104, + 516, + 506, + 532 + ], + "spans": [ + { + "bbox": [ + 104, + 516, + 506, + 532 + ], + "score": 1.0, + "content": "In this section, we introduce our algorithm — Memory-augmented Impatient Federated Averaging", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 528, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 272, + 542 + ], + "score": 1.0, + "content": "(MIFA). MIFA maintains an update-array", + "type": "text" + }, + { + "bbox": [ + 273, + 529, + 295, + 541 + ], + "score": 0.92, + "content": "\\{ G ^ { i } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 528, + 506, + 542 + ], + "score": 1.0, + "content": "in the memory that stores the latest updates for all", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "score": 1.0, + "content": "devices. As the name suggests, MIFA has two components. First, the algorithm is impatient and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 550, + 506, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 506, + 564 + ], + "score": 1.0, + "content": "avoids waiting for any specific device when facing heterogeneous devices with arbitrary availability.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 561, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 506, + 574 + ], + "score": 1.0, + "content": "Second, the algorithm augments the received updates of the active devices with the stored updates of", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 572, + 275, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 275, + 586 + ], + "score": 1.0, + "content": "the inactive devices to perform averaging.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 29.5, + "bbox_fs": [ + 104, + 516, + 506, + 586 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 589, + 505, + 625 + ], + "lines": [ + { + "bbox": [ + 106, + 588, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 263, + 601 + ], + "score": 1.0, + "content": "Specifically, at the beginning of round", + "type": "text" + }, + { + "bbox": [ + 263, + 590, + 268, + 599 + ], + "score": 0.76, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 588, + 469, + 601 + ], + "score": 1.0, + "content": ", the server broadcasts the latest model parameter", + "type": "text" + }, + { + "bbox": [ + 469, + 591, + 481, + 600 + ], + "score": 0.84, + "content": "w _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 588, + 505, + 601 + ], + "score": 1.0, + "content": "to all", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 600, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 165, + 614 + ], + "score": 1.0, + "content": "active devices", + "type": "text" + }, + { + "bbox": [ + 165, + 600, + 185, + 612 + ], + "score": 0.91, + "content": "\\boldsymbol { \\mathcal { A } } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 600, + 253, + 614 + ], + "score": 1.0, + "content": ". After receiving", + "type": "text" + }, + { + "bbox": [ + 253, + 602, + 264, + 612 + ], + "score": 0.86, + "content": "w _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 600, + 379, + 614 + ], + "score": 1.0, + "content": ", each active device, say, the", + "type": "text" + }, + { + "bbox": [ + 379, + 601, + 384, + 610 + ], + "score": 0.74, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 600, + 444, + 614 + ], + "score": 1.0, + "content": "-th device, sets", + "type": "text" + }, + { + "bbox": [ + 445, + 600, + 487, + 614 + ], + "score": 0.93, + "content": "w _ { t , 0 } ^ { i } = w _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 600, + 505, + 614 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 611, + 435, + 629 + ], + "spans": [ + { + "bbox": [ + 104, + 611, + 145, + 629 + ], + "score": 1.0, + "content": "performs", + "type": "text" + }, + { + "bbox": [ + 145, + 613, + 155, + 623 + ], + "score": 0.83, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 611, + 409, + 629 + ], + "score": 1.0, + "content": "steps of SGD with respect to the local objective function to get", + "type": "text" + }, + { + "bbox": [ + 409, + 612, + 430, + 627 + ], + "score": 0.93, + "content": "w _ { t , K } ^ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 611, + 435, + 629 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34, + "bbox_fs": [ + 104, + 588, + 505, + 629 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 201, + 633, + 408, + 650 + ], + "lines": [ + { + "bbox": [ + 201, + 633, + 408, + 650 + ], + "spans": [ + { + "bbox": [ + 201, + 633, + 408, + 650 + ], + "score": 0.91, + "content": "\\boldsymbol w _ { t , k + 1 } ^ { i } = \\boldsymbol w _ { t , k } ^ { i } - \\eta _ { t } \\tilde { \\nabla } f _ { i } ( \\boldsymbol w _ { t , k } ^ { i } ) , \\boldsymbol k = 0 , \\cdots , \\boldsymbol K - 1 ,", + "type": "interline_equation", + "image_path": "2c0127a5706cf7944f95df9680a24f67da0062cc0709e170f05907f9d6d3a845.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 201, + 633, + 408, + 650 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 658, + 506, + 696 + ], + "lines": [ + { + "bbox": [ + 105, + 657, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 658, + 132, + 672 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 132, + 661, + 142, + 671 + ], + "score": 0.85, + "content": "\\eta _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 658, + 235, + 672 + ], + "score": 1.0, + "content": "is the learning rate and", + "type": "text" + }, + { + "bbox": [ + 236, + 657, + 278, + 673 + ], + "score": 0.93, + "content": "\\tilde { \\nabla } f _ { i } ( w _ { t , k } ^ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 658, + 457, + 672 + ], + "score": 1.0, + "content": "is the stochastic gradient evaluated on device", + "type": "text" + }, + { + "bbox": [ + 458, + 660, + 462, + 669 + ], + "score": 0.56, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 658, + 506, + 672 + ], + "score": 1.0, + "content": ". Next, the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 102, + 669, + 508, + 691 + ], + "spans": [ + { + "bbox": [ + 102, + 669, + 237, + 691 + ], + "score": 1.0, + "content": "server stores the received update", + "type": "text" + }, + { + "bbox": [ + 237, + 673, + 298, + 687 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\frac { 1 } { \\eta _ { t } } \\big ( w _ { t } - w _ { t , K } ^ { i } \\big ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 669, + 309, + 691 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 310, + 672, + 321, + 683 + ], + "score": 0.87, + "content": "G ^ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 669, + 369, + 691 + ], + "score": 1.0, + "content": ". Denote by", + "type": "text" + }, + { + "bbox": [ + 370, + 672, + 392, + 685 + ], + "score": 0.93, + "content": "\\{ G _ { t } ^ { i } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 669, + 508, + 691 + ], + "score": 1.0, + "content": "the update-array after round", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 107, + 686, + 170, + 698 + ], + "spans": [ + { + "bbox": [ + 107, + 687, + 111, + 695 + ], + "score": 0.71, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 111, + 686, + 170, + 698 + ], + "score": 1.0, + "content": ", then we have", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38, + "bbox_fs": [ + 102, + 657, + 508, + 698 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 222, + 697, + 384, + 726 + ], + "lines": [ + { + "bbox": [ + 222, + 697, + 384, + 726 + ], + "spans": [ + { + "bbox": [ + 222, + 697, + 384, + 726 + ], + "score": 0.94, + "content": "\\begin{array} { r } { G _ { t } ^ { i } = \\left\\{ \\begin{array} { l l } { G _ { t - 1 } ^ { i } , } & { \\mathrm { ~ i f ~ } i \\notin \\mathcal { A } ( t ) , } \\\\ { \\frac { 1 } { \\eta _ { t } } ( w _ { t } - w _ { t , K } ^ { i } ) , } & { \\mathrm { ~ i f ~ } i \\in \\mathcal { A } ( t ) . } \\end{array} \\right. } \\end{array}", + "type": "interline_equation", + "image_path": "72c964c9acb692ffa258397e5523d41c405bf9354c410c37349066a92c8e4d6d.jpg" + } + ] + } + ], + "index": 40.5, + "virtual_lines": [ + { + "bbox": [ + 222, + 697, + 384, + 711.5 + ], + "spans": [], + "index": 40 + }, + { + "bbox": [ + 222, + 711.5, + 384, + 726.0 + ], + "spans": [], + "index": 41 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 72, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 72, + 506, + 85 + ], + "spans": [ + { + "bbox": [ + 105, + 72, + 185, + 85 + ], + "score": 1.0, + "content": "At the end of round", + "type": "text" + }, + { + "bbox": [ + 186, + 74, + 190, + 83 + ], + "score": 0.7, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 72, + 414, + 85 + ], + "score": 1.0, + "content": ", the server updates the global model with the average of", + "type": "text" + }, + { + "bbox": [ + 414, + 72, + 436, + 85 + ], + "score": 0.92, + "content": "\\{ G _ { t } ^ { i } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 72, + 506, + 85 + ], + "score": 1.0, + "content": "(line 9). In other", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 84, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 84, + 505, + 96 + ], + "score": 1.0, + "content": "words, our algorithm MIFA updates the model with the latest available accumulated gradients for all", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 92, + 142, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 142, + 107 + ], + "score": 1.0, + "content": "devices.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "table", + "bbox": [ + 109, + 130, + 496, + 241 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 116, + 399, + 128 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 114, + 401, + 132 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 401, + 132 + ], + "score": 1.0, + "content": "Algorithm 1 Memory-augmented Impatient Federated Averaging (MIFA)", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "table_body", + "bbox": [ + 109, + 130, + 496, + 241 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 130, + 496, + 241 + ], + "spans": [ + { + "bbox": [ + 109, + 130, + 496, + 241 + ], + "score": 0.496, + "html": "
1: Input: initial wi,learning rate {nt }
2: Server executes:1: DeviceUpdate(i, Wt , nt):
3: initialize Gi ←O,i∈[N]2:w,←Wt
4: fort=1,.,T-1do3: for local step k = O,.,K -1 do
5: broadcast wt to all active devices i ∈ A(t) 4:compute stochastic gradient Vfi(wt,)
6: for each active device idoWk+1←W,k-ntvfi(w,) 5:
7: G ←DeviceUpdate(i,Wt, nt) 8: end for6: end for
Wt+1←wt-∑1 N 9: Gi7:Return (wt - wi,k) to the server
", + "type": "table", + "image_path": "5471198ff0b654b45b8a140b5c46c5f6e75ff5794c1529023b59736618813d80.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 109, + 130, + 496, + 167.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 109, + 167.0, + 496, + 204.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 109, + 204.0, + 496, + 241.0 + ], + "spans": [], + "index": 6 + } + ] + } + ], + "index": 4.0 + }, + { + "type": "text", + "bbox": [ + 106, + 254, + 505, + 331 + ], + "lines": [ + { + "bbox": [ + 105, + 254, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 505, + 267 + ], + "score": 1.0, + "content": "MIFA efficiently progresses without waiting for inactive devices and re-uses their latest updates as", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 265, + 505, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 265, + 505, + 278 + ], + "score": 1.0, + "content": "the surrogate for missing responses. Being impatient accelerates convergence, whereas memory", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 276, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 505, + 289 + ], + "score": 1.0, + "content": "augmentation corrects the update bias. Our algorithm differs from asynchronous algorithms in", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 286, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 505, + 299 + ], + "score": 1.0, + "content": "traditional distributed optimization [35, 4, 27, 11, 45, 1, 13, 6] in that we utilize the noisy updates", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 297, + 505, + 310 + ], + "spans": [ + { + "bbox": [ + 106, + 297, + 505, + 310 + ], + "score": 1.0, + "content": "of inactive devices more than once to avoid biasing against stragglers. In the following part of the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 309, + 506, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 506, + 321 + ], + "score": 1.0, + "content": "paper, we show that MIFA successfully exploits information about the descent direction contained in", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 320, + 225, + 332 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 225, + 332 + ], + "score": 1.0, + "content": "the stale and noisy gradients.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 106, + 335, + 505, + 446 + ], + "lines": [ + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "score": 1.0, + "content": "Discussion on implementation. In practice, to implement MIFA, the server needs to maintain a", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 347, + 505, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 505, + 358 + ], + "score": 1.0, + "content": "huge array to store the latest update for each device, which scales with the model size and the total", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 357, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 505, + 371 + ], + "score": 1.0, + "content": "number of devices. To avoid exhausting the server’s memory, one strategy is to distribute the memory", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 365, + 503, + 386 + ], + "spans": [ + { + "bbox": [ + 104, + 365, + 363, + 386 + ], + "score": 1.0, + "content": "consumption among devices. Specifically, each device, say the", + "type": "text" + }, + { + "bbox": [ + 363, + 370, + 368, + 379 + ], + "score": 0.71, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 365, + 488, + 386 + ], + "score": 1.0, + "content": "-th, stores its previous update", + "type": "text" + }, + { + "bbox": [ + 488, + 370, + 503, + 384 + ], + "score": 0.9, + "content": "G _ { t _ { i } ^ { \\prime } } ^ { \\ i }", + "type": "inline_equation" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 382, + 506, + 396 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 186, + 396 + ], + "score": 1.0, + "content": "computed at round", + "type": "text" + }, + { + "bbox": [ + 186, + 383, + 195, + 396 + ], + "score": 0.86, + "content": "t _ { i } ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 382, + 444, + 396 + ], + "score": 1.0, + "content": "in its local memory. When it becomes active and computes", + "type": "text" + }, + { + "bbox": [ + 444, + 383, + 456, + 395 + ], + "score": 0.91, + "content": "G _ { t } ^ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 382, + 506, + 396 + ], + "score": 1.0, + "content": ", the device", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 392, + 506, + 409 + ], + "spans": [ + { + "bbox": [ + 104, + 392, + 132, + 409 + ], + "score": 1.0, + "content": "sends", + "type": "text" + }, + { + "bbox": [ + 132, + 394, + 171, + 409 + ], + "score": 0.93, + "content": "G _ { t } ^ { i } - G _ { t _ { i } ^ { \\prime } } ^ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 392, + 506, + 409 + ], + "score": 1.0, + "content": "to the server, which is the difference between the current update and the previous", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 407, + 506, + 420 + ], + "spans": [ + { + "bbox": [ + 106, + 409, + 370, + 420 + ], + "score": 1.0, + "content": "one. In this case, the server only needs to maintain the average", + "type": "text" + }, + { + "bbox": [ + 371, + 407, + 380, + 419 + ], + "score": 0.83, + "content": "\\bar { G }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 409, + 506, + 420 + ], + "score": 1.0, + "content": "in the memory and updates it", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 102, + 414, + 509, + 439 + ], + "spans": [ + { + "bbox": [ + 102, + 414, + 119, + 439 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 119, + 419, + 272, + 434 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\bar { G } _ { t } = \\bar { G } _ { t - 1 } + \\frac { 1 } { N } \\sum _ { i \\in \\mathcal { A } ( t ) } ( G _ { t } ^ { \\bar { i } } - G _ { t _ { i } ^ { \\prime } } ^ { i } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 414, + 311, + 439 + ], + "score": 1.0, + "content": "at round", + "type": "text" + }, + { + "bbox": [ + 311, + 421, + 316, + 430 + ], + "score": 0.72, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 414, + 509, + 439 + ], + "score": 1.0, + "content": ". Then the server updates the global model by", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 107, + 434, + 188, + 447 + ], + "spans": [ + { + "bbox": [ + 107, + 434, + 184, + 446 + ], + "score": 0.89, + "content": "w _ { t + 1 } = w _ { t } - \\eta _ { t } \\bar { G } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 434, + 188, + 447 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 18 + }, + { + "type": "title", + "bbox": [ + 106, + 461, + 437, + 475 + ], + "lines": [ + { + "bbox": [ + 103, + 459, + 439, + 478 + ], + "spans": [ + { + "bbox": [ + 103, + 459, + 439, + 478 + ], + "score": 1.0, + "content": "5 Convergence Analysis for strongly convex objective functions", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 106, + 486, + 506, + 519 + ], + "lines": [ + { + "bbox": [ + 104, + 485, + 506, + 500 + ], + "spans": [ + { + "bbox": [ + 104, + 485, + 351, + 500 + ], + "score": 1.0, + "content": "In this section, we present the convergence results for MIFA on", + "type": "text" + }, + { + "bbox": [ + 352, + 488, + 358, + 497 + ], + "score": 0.82, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 485, + 424, + 500 + ], + "score": 1.0, + "content": "-strongly convex", + "type": "text" + }, + { + "bbox": [ + 425, + 486, + 433, + 496 + ], + "score": 0.74, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 485, + 506, + 500 + ], + "score": 1.0, + "content": "-smooth functions.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 496, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 320, + 510 + ], + "score": 1.0, + "content": "Typical examples for the strongly convex case are", + "type": "text" + }, + { + "bbox": [ + 320, + 497, + 330, + 507 + ], + "score": 0.88, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 496, + 506, + 510 + ], + "score": 1.0, + "content": "regularized logistic regression and linear", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 507, + 192, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 192, + 520 + ], + "score": 1.0, + "content": "regression problems.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 523, + 504, + 546 + ], + "lines": [ + { + "bbox": [ + 105, + 522, + 505, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 505, + 537 + ], + "score": 1.0, + "content": "In order to capture how the unavailability of devices affects algorithm performance, we introduce the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 534, + 377, + 548 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 377, + 548 + ], + "score": 1.0, + "content": "following notion to quantify the dynamics of devices in our setting.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 107, + 549, + 506, + 582 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 506, + 562 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 489, + 562 + ], + "score": 1.0, + "content": "Definition 5.1 (Number of inactive rounds). We define the number of inactive rounds of device", + "type": "text" + }, + { + "bbox": [ + 489, + 550, + 494, + 559 + ], + "score": 0.33, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 494, + 549, + 506, + 562 + ], + "score": 1.0, + "content": "at", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 559, + 504, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 132, + 573 + ], + "score": 1.0, + "content": "round", + "type": "text" + }, + { + "bbox": [ + 132, + 561, + 137, + 570 + ], + "score": 0.53, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 559, + 150, + 573 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 150, + 560, + 313, + 572 + ], + "score": 0.92, + "content": "\\tau ( t , i ) = t - \\operatorname* { m a x } \\{ t ^ { \\prime } \\mid t ^ { \\prime } \\leq t , i \\in A ( t ^ { \\prime } ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 559, + 499, + 573 + ], + "score": 1.0, + "content": ", which is the difference between current round", + "type": "text" + }, + { + "bbox": [ + 499, + 561, + 504, + 570 + ], + "score": 0.72, + "content": "t", + "type": "inline_equation" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 572, + 283, + 582 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 240, + 582 + ], + "score": 1.0, + "content": "and the latest round when device", + "type": "text" + }, + { + "bbox": [ + 240, + 573, + 245, + 581 + ], + "score": 0.29, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 572, + 283, + 582 + ], + "score": 1.0, + "content": "is active.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 106, + 591, + 506, + 624 + ], + "lines": [ + { + "bbox": [ + 106, + 591, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 591, + 181, + 603 + ], + "score": 1.0, + "content": "It can be seen that", + "type": "text" + }, + { + "bbox": [ + 182, + 591, + 226, + 603 + ], + "score": 0.93, + "content": "\\tau ( t , i ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 591, + 263, + 603 + ], + "score": 1.0, + "content": "if device", + "type": "text" + }, + { + "bbox": [ + 263, + 592, + 268, + 601 + ], + "score": 0.77, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 591, + 340, + 603 + ], + "score": 1.0, + "content": "is active at round", + "type": "text" + }, + { + "bbox": [ + 340, + 592, + 345, + 601 + ], + "score": 0.74, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 591, + 363, + 603 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 363, + 591, + 462, + 603 + ], + "score": 0.92, + "content": "\\tau ( t , i ) = \\tau ( t - 1 , i ) + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 591, + 506, + 603 + ], + "score": 1.0, + "content": "otherwise.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 602, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 602, + 131, + 614 + ], + "score": 1.0, + "content": "Also,", + "type": "text" + }, + { + "bbox": [ + 131, + 602, + 173, + 614 + ], + "score": 0.93, + "content": "t - \\tau ( t , i )", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 602, + 319, + 614 + ], + "score": 1.0, + "content": "is the latest round when the device", + "type": "text" + }, + { + "bbox": [ + 319, + 603, + 324, + 612 + ], + "score": 0.76, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 602, + 505, + 614 + ], + "score": 1.0, + "content": "is active. Next, we present the assumptions", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 613, + 300, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 300, + 626 + ], + "score": 1.0, + "content": "made for establishing our convergence theorem.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 106, + 627, + 505, + 654 + ], + "lines": [ + { + "bbox": [ + 105, + 625, + 506, + 641 + ], + "spans": [ + { + "bbox": [ + 105, + 625, + 177, + 641 + ], + "score": 1.0, + "content": "Assumption 1.", + "type": "text" + }, + { + "bbox": [ + 178, + 628, + 225, + 639 + ], + "score": 0.91, + "content": "f _ { 1 } , \\cdots , f _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 625, + 265, + 641 + ], + "score": 1.0, + "content": "are all", + "type": "text" + }, + { + "bbox": [ + 266, + 628, + 273, + 638 + ], + "score": 0.74, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 274, + 625, + 371, + 641 + ], + "score": 1.0, + "content": "-smooth, i.e., for all", + "type": "text" + }, + { + "bbox": [ + 371, + 630, + 380, + 638 + ], + "score": 0.73, + "content": "w", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 625, + 406, + 641 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 406, + 630, + 412, + 638 + ], + "score": 0.41, + "content": "v _ { \\scriptscriptstyle { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 625, + 420, + 641 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 420, + 627, + 506, + 640 + ], + "score": 0.67, + "content": "\\begin{array} { r c l } { f _ { i } ( v ) } & { \\leq } & { f _ { i } ( w ) \\ + } \\end{array}", + "type": "inline_equation" + } + ], + "index": 35 + }, + { + "bbox": [ + 107, + 637, + 242, + 655 + ], + "spans": [ + { + "bbox": [ + 107, + 640, + 237, + 654 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\left. \\nabla f _ { i } ( w ) , v - w \\right. + \\frac { L } { 2 } \\left\\| w - v \\right\\| ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 637, + 242, + 655 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5 + }, + { + "type": "text", + "bbox": [ + 106, + 657, + 506, + 695 + ], + "lines": [ + { + "bbox": [ + 105, + 654, + 507, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 174, + 673 + ], + "score": 1.0, + "content": "Assumption 2.", + "type": "text" + }, + { + "bbox": [ + 175, + 656, + 208, + 670 + ], + "score": 0.92, + "content": "\\tilde { \\nabla } f _ { i } ( \\boldsymbol { w } )", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 654, + 334, + 673 + ], + "score": 1.0, + "content": "is an unbiased estimator of", + "type": "text" + }, + { + "bbox": [ + 334, + 658, + 352, + 669 + ], + "score": 0.88, + "content": "\\nabla f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 654, + 471, + 673 + ], + "score": 1.0, + "content": "with variance bounded by", + "type": "text" + }, + { + "bbox": [ + 471, + 658, + 483, + 668 + ], + "score": 0.85, + "content": "\\sigma ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 654, + 507, + 673 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 667, + 356, + 697 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 350, + 696 + ], + "score": 0.85, + "content": "\\mathbb { E } _ { \\boldsymbol { \\xi } } \\left[ \\tilde { \\nabla } f _ { i } ( \\boldsymbol { w } ) \\right] = \\nabla f _ { i } ( \\boldsymbol { w } ) , \\mathbb { E } _ { \\boldsymbol { \\xi } } \\left[ \\left\\| \\tilde { \\nabla } f _ { i } ( \\boldsymbol { w } ) - \\nabla f _ { i } ( \\boldsymbol { w } ) \\right\\| ^ { 2 } \\right] \\leq \\sigma ^ { 2 } .", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 667, + 356, + 697 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 106, + 697, + 506, + 724 + ], + "lines": [ + { + "bbox": [ + 105, + 695, + 507, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 695, + 176, + 711 + ], + "score": 1.0, + "content": "Assumption 3.", + "type": "text" + }, + { + "bbox": [ + 176, + 698, + 223, + 709 + ], + "score": 0.88, + "content": "f _ { 1 } , \\cdots , f _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 695, + 260, + 711 + ], + "score": 1.0, + "content": "are all", + "type": "text" + }, + { + "bbox": [ + 261, + 699, + 268, + 709 + ], + "score": 0.77, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 695, + 379, + 711 + ], + "score": 1.0, + "content": "-strongly convex: for all", + "type": "text" + }, + { + "bbox": [ + 380, + 700, + 388, + 708 + ], + "score": 0.62, + "content": "w", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 695, + 412, + 711 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 412, + 699, + 419, + 708 + ], + "score": 0.48, + "content": "v _ { \\scriptscriptstyle { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 695, + 425, + 711 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 425, + 697, + 507, + 711 + ], + "score": 0.81, + "content": "f _ { i } ( v ) \\geq f _ { i } ( w ) +", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 107, + 709, + 241, + 725 + ], + "spans": [ + { + "bbox": [ + 107, + 710, + 236, + 724 + ], + "score": 0.89, + "content": "\\begin{array} { r } { \\left. \\nabla f _ { i } ( w ) , v - w \\right. + \\frac { \\mu } { 2 } \\left\\| w - v \\right\\| ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 709, + 241, + 725 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 741, + 309, + 750 + ], + "lines": [ + { + "bbox": [ + 302, + 741, + 309, + 752 + ], + "spans": [ + { + "bbox": [ + 302, + 741, + 309, + 752 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 72, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 72, + 506, + 85 + ], + "spans": [ + { + "bbox": [ + 105, + 72, + 185, + 85 + ], + "score": 1.0, + "content": "At the end of round", + "type": "text" + }, + { + "bbox": [ + 186, + 74, + 190, + 83 + ], + "score": 0.7, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 72, + 414, + 85 + ], + "score": 1.0, + "content": ", the server updates the global model with the average of", + "type": "text" + }, + { + "bbox": [ + 414, + 72, + 436, + 85 + ], + "score": 0.92, + "content": "\\{ G _ { t } ^ { i } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 72, + 506, + 85 + ], + "score": 1.0, + "content": "(line 9). In other", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 84, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 84, + 505, + 96 + ], + "score": 1.0, + "content": "words, our algorithm MIFA updates the model with the latest available accumulated gradients for all", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 92, + 142, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 142, + 107 + ], + "score": 1.0, + "content": "devices.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 72, + 506, + 107 + ] + }, + { + "type": "table", + "bbox": [ + 109, + 130, + 496, + 241 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 116, + 399, + 128 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 114, + 401, + 132 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 401, + 132 + ], + "score": 1.0, + "content": "Algorithm 1 Memory-augmented Impatient Federated Averaging (MIFA)", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "table_body", + "bbox": [ + 109, + 130, + 496, + 241 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 130, + 496, + 241 + ], + "spans": [ + { + "bbox": [ + 109, + 130, + 496, + 241 + ], + "score": 0.496, + "html": "
1: Input: initial wi,learning rate {nt }
2: Server executes:1: DeviceUpdate(i, Wt , nt):
3: initialize Gi ←O,i∈[N]2:w,←Wt
4: fort=1,.,T-1do3: for local step k = O,.,K -1 do
5: broadcast wt to all active devices i ∈ A(t) 4:compute stochastic gradient Vfi(wt,)
6: for each active device idoWk+1←W,k-ntvfi(w,) 5:
7: G ←DeviceUpdate(i,Wt, nt) 8: end for6: end for
Wt+1←wt-∑1 N 9: Gi7:Return (wt - wi,k) to the server
", + "type": "table", + "image_path": "5471198ff0b654b45b8a140b5c46c5f6e75ff5794c1529023b59736618813d80.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 109, + 130, + 496, + 167.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 109, + 167.0, + 496, + 204.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 109, + 204.0, + 496, + 241.0 + ], + "spans": [], + "index": 6 + } + ] + } + ], + "index": 4.0 + }, + { + "type": "text", + "bbox": [ + 106, + 254, + 505, + 331 + ], + "lines": [ + { + "bbox": [ + 105, + 254, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 505, + 267 + ], + "score": 1.0, + "content": "MIFA efficiently progresses without waiting for inactive devices and re-uses their latest updates as", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 265, + 505, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 265, + 505, + 278 + ], + "score": 1.0, + "content": "the surrogate for missing responses. Being impatient accelerates convergence, whereas memory", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 276, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 505, + 289 + ], + "score": 1.0, + "content": "augmentation corrects the update bias. Our algorithm differs from asynchronous algorithms in", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 286, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 505, + 299 + ], + "score": 1.0, + "content": "traditional distributed optimization [35, 4, 27, 11, 45, 1, 13, 6] in that we utilize the noisy updates", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 297, + 505, + 310 + ], + "spans": [ + { + "bbox": [ + 106, + 297, + 505, + 310 + ], + "score": 1.0, + "content": "of inactive devices more than once to avoid biasing against stragglers. In the following part of the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 309, + 506, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 506, + 321 + ], + "score": 1.0, + "content": "paper, we show that MIFA successfully exploits information about the descent direction contained in", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 320, + 225, + 332 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 225, + 332 + ], + "score": 1.0, + "content": "the stale and noisy gradients.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 254, + 506, + 332 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 335, + 505, + 446 + ], + "lines": [ + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "score": 1.0, + "content": "Discussion on implementation. In practice, to implement MIFA, the server needs to maintain a", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 347, + 505, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 505, + 358 + ], + "score": 1.0, + "content": "huge array to store the latest update for each device, which scales with the model size and the total", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 357, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 505, + 371 + ], + "score": 1.0, + "content": "number of devices. To avoid exhausting the server’s memory, one strategy is to distribute the memory", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 365, + 503, + 386 + ], + "spans": [ + { + "bbox": [ + 104, + 365, + 363, + 386 + ], + "score": 1.0, + "content": "consumption among devices. Specifically, each device, say the", + "type": "text" + }, + { + "bbox": [ + 363, + 370, + 368, + 379 + ], + "score": 0.71, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 365, + 488, + 386 + ], + "score": 1.0, + "content": "-th, stores its previous update", + "type": "text" + }, + { + "bbox": [ + 488, + 370, + 503, + 384 + ], + "score": 0.9, + "content": "G _ { t _ { i } ^ { \\prime } } ^ { \\ i }", + "type": "inline_equation" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 382, + 506, + 396 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 186, + 396 + ], + "score": 1.0, + "content": "computed at round", + "type": "text" + }, + { + "bbox": [ + 186, + 383, + 195, + 396 + ], + "score": 0.86, + "content": "t _ { i } ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 382, + 444, + 396 + ], + "score": 1.0, + "content": "in its local memory. When it becomes active and computes", + "type": "text" + }, + { + "bbox": [ + 444, + 383, + 456, + 395 + ], + "score": 0.91, + "content": "G _ { t } ^ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 382, + 506, + 396 + ], + "score": 1.0, + "content": ", the device", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 392, + 506, + 409 + ], + "spans": [ + { + "bbox": [ + 104, + 392, + 132, + 409 + ], + "score": 1.0, + "content": "sends", + "type": "text" + }, + { + "bbox": [ + 132, + 394, + 171, + 409 + ], + "score": 0.93, + "content": "G _ { t } ^ { i } - G _ { t _ { i } ^ { \\prime } } ^ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 392, + 506, + 409 + ], + "score": 1.0, + "content": "to the server, which is the difference between the current update and the previous", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 407, + 506, + 420 + ], + "spans": [ + { + "bbox": [ + 106, + 409, + 370, + 420 + ], + "score": 1.0, + "content": "one. In this case, the server only needs to maintain the average", + "type": "text" + }, + { + "bbox": [ + 371, + 407, + 380, + 419 + ], + "score": 0.83, + "content": "\\bar { G }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 409, + 506, + 420 + ], + "score": 1.0, + "content": "in the memory and updates it", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 102, + 414, + 509, + 439 + ], + "spans": [ + { + "bbox": [ + 102, + 414, + 119, + 439 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 119, + 419, + 272, + 434 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\bar { G } _ { t } = \\bar { G } _ { t - 1 } + \\frac { 1 } { N } \\sum _ { i \\in \\mathcal { A } ( t ) } ( G _ { t } ^ { \\bar { i } } - G _ { t _ { i } ^ { \\prime } } ^ { i } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 414, + 311, + 439 + ], + "score": 1.0, + "content": "at round", + "type": "text" + }, + { + "bbox": [ + 311, + 421, + 316, + 430 + ], + "score": 0.72, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 414, + 509, + 439 + ], + "score": 1.0, + "content": ". Then the server updates the global model by", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 107, + 434, + 188, + 447 + ], + "spans": [ + { + "bbox": [ + 107, + 434, + 184, + 446 + ], + "score": 0.89, + "content": "w _ { t + 1 } = w _ { t } - \\eta _ { t } \\bar { G } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 434, + 188, + 447 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 18, + "bbox_fs": [ + 102, + 335, + 509, + 447 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 461, + 437, + 475 + ], + "lines": [ + { + "bbox": [ + 103, + 459, + 439, + 478 + ], + "spans": [ + { + "bbox": [ + 103, + 459, + 439, + 478 + ], + "score": 1.0, + "content": "5 Convergence Analysis for strongly convex objective functions", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 106, + 486, + 506, + 519 + ], + "lines": [ + { + "bbox": [ + 104, + 485, + 506, + 500 + ], + "spans": [ + { + "bbox": [ + 104, + 485, + 351, + 500 + ], + "score": 1.0, + "content": "In this section, we present the convergence results for MIFA on", + "type": "text" + }, + { + "bbox": [ + 352, + 488, + 358, + 497 + ], + "score": 0.82, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 485, + 424, + 500 + ], + "score": 1.0, + "content": "-strongly convex", + "type": "text" + }, + { + "bbox": [ + 425, + 486, + 433, + 496 + ], + "score": 0.74, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 485, + 506, + 500 + ], + "score": 1.0, + "content": "-smooth functions.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 496, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 320, + 510 + ], + "score": 1.0, + "content": "Typical examples for the strongly convex case are", + "type": "text" + }, + { + "bbox": [ + 320, + 497, + 330, + 507 + ], + "score": 0.88, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 496, + 506, + 510 + ], + "score": 1.0, + "content": "regularized logistic regression and linear", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 507, + 192, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 192, + 520 + ], + "score": 1.0, + "content": "regression problems.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 104, + 485, + 506, + 520 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 523, + 504, + 546 + ], + "lines": [ + { + "bbox": [ + 105, + 522, + 505, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 505, + 537 + ], + "score": 1.0, + "content": "In order to capture how the unavailability of devices affects algorithm performance, we introduce the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 534, + 377, + 548 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 377, + 548 + ], + "score": 1.0, + "content": "following notion to quantify the dynamics of devices in our setting.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 522, + 505, + 548 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 549, + 506, + 582 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 506, + 562 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 489, + 562 + ], + "score": 1.0, + "content": "Definition 5.1 (Number of inactive rounds). We define the number of inactive rounds of device", + "type": "text" + }, + { + "bbox": [ + 489, + 550, + 494, + 559 + ], + "score": 0.33, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 494, + 549, + 506, + 562 + ], + "score": 1.0, + "content": "at", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 559, + 504, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 132, + 573 + ], + "score": 1.0, + "content": "round", + "type": "text" + }, + { + "bbox": [ + 132, + 561, + 137, + 570 + ], + "score": 0.53, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 559, + 150, + 573 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 150, + 560, + 313, + 572 + ], + "score": 0.92, + "content": "\\tau ( t , i ) = t - \\operatorname* { m a x } \\{ t ^ { \\prime } \\mid t ^ { \\prime } \\leq t , i \\in A ( t ^ { \\prime } ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 559, + 499, + 573 + ], + "score": 1.0, + "content": ", which is the difference between current round", + "type": "text" + }, + { + "bbox": [ + 499, + 561, + 504, + 570 + ], + "score": 0.72, + "content": "t", + "type": "inline_equation" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 572, + 283, + 582 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 240, + 582 + ], + "score": 1.0, + "content": "and the latest round when device", + "type": "text" + }, + { + "bbox": [ + 240, + 573, + 245, + 581 + ], + "score": 0.29, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 572, + 283, + 582 + ], + "score": 1.0, + "content": "is active.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 549, + 506, + 582 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 591, + 506, + 624 + ], + "lines": [ + { + "bbox": [ + 106, + 591, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 591, + 181, + 603 + ], + "score": 1.0, + "content": "It can be seen that", + "type": "text" + }, + { + "bbox": [ + 182, + 591, + 226, + 603 + ], + "score": 0.93, + "content": "\\tau ( t , i ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 591, + 263, + 603 + ], + "score": 1.0, + "content": "if device", + "type": "text" + }, + { + "bbox": [ + 263, + 592, + 268, + 601 + ], + "score": 0.77, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 591, + 340, + 603 + ], + "score": 1.0, + "content": "is active at round", + "type": "text" + }, + { + "bbox": [ + 340, + 592, + 345, + 601 + ], + "score": 0.74, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 591, + 363, + 603 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 363, + 591, + 462, + 603 + ], + "score": 0.92, + "content": "\\tau ( t , i ) = \\tau ( t - 1 , i ) + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 591, + 506, + 603 + ], + "score": 1.0, + "content": "otherwise.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 602, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 602, + 131, + 614 + ], + "score": 1.0, + "content": "Also,", + "type": "text" + }, + { + "bbox": [ + 131, + 602, + 173, + 614 + ], + "score": 0.93, + "content": "t - \\tau ( t , i )", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 602, + 319, + 614 + ], + "score": 1.0, + "content": "is the latest round when the device", + "type": "text" + }, + { + "bbox": [ + 319, + 603, + 324, + 612 + ], + "score": 0.76, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 602, + 505, + 614 + ], + "score": 1.0, + "content": "is active. Next, we present the assumptions", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 613, + 300, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 300, + 626 + ], + "score": 1.0, + "content": "made for establishing our convergence theorem.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33, + "bbox_fs": [ + 105, + 591, + 506, + 626 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 627, + 505, + 654 + ], + "lines": [ + { + "bbox": [ + 105, + 625, + 506, + 641 + ], + "spans": [ + { + "bbox": [ + 105, + 625, + 177, + 641 + ], + "score": 1.0, + "content": "Assumption 1.", + "type": "text" + }, + { + "bbox": [ + 178, + 628, + 225, + 639 + ], + "score": 0.91, + "content": "f _ { 1 } , \\cdots , f _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 625, + 265, + 641 + ], + "score": 1.0, + "content": "are all", + "type": "text" + }, + { + "bbox": [ + 266, + 628, + 273, + 638 + ], + "score": 0.74, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 274, + 625, + 371, + 641 + ], + "score": 1.0, + "content": "-smooth, i.e., for all", + "type": "text" + }, + { + "bbox": [ + 371, + 630, + 380, + 638 + ], + "score": 0.73, + "content": "w", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 625, + 406, + 641 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 406, + 630, + 412, + 638 + ], + "score": 0.41, + "content": "v _ { \\scriptscriptstyle { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 625, + 420, + 641 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 420, + 627, + 506, + 640 + ], + "score": 0.67, + "content": "\\begin{array} { r c l } { f _ { i } ( v ) } & { \\leq } & { f _ { i } ( w ) \\ + } \\end{array}", + "type": "inline_equation" + } + ], + "index": 35 + }, + { + "bbox": [ + 107, + 637, + 242, + 655 + ], + "spans": [ + { + "bbox": [ + 107, + 640, + 237, + 654 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\left. \\nabla f _ { i } ( w ) , v - w \\right. + \\frac { L } { 2 } \\left\\| w - v \\right\\| ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 637, + 242, + 655 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 625, + 506, + 655 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 657, + 506, + 695 + ], + "lines": [ + { + "bbox": [ + 105, + 654, + 507, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 174, + 673 + ], + "score": 1.0, + "content": "Assumption 2.", + "type": "text" + }, + { + "bbox": [ + 175, + 656, + 208, + 670 + ], + "score": 0.92, + "content": "\\tilde { \\nabla } f _ { i } ( \\boldsymbol { w } )", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 654, + 334, + 673 + ], + "score": 1.0, + "content": "is an unbiased estimator of", + "type": "text" + }, + { + "bbox": [ + 334, + 658, + 352, + 669 + ], + "score": 0.88, + "content": "\\nabla f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 654, + 471, + 673 + ], + "score": 1.0, + "content": "with variance bounded by", + "type": "text" + }, + { + "bbox": [ + 471, + 658, + 483, + 668 + ], + "score": 0.85, + "content": "\\sigma ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 654, + 507, + 673 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 667, + 356, + 697 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 350, + 696 + ], + "score": 0.85, + "content": "\\mathbb { E } _ { \\boldsymbol { \\xi } } \\left[ \\tilde { \\nabla } f _ { i } ( \\boldsymbol { w } ) \\right] = \\nabla f _ { i } ( \\boldsymbol { w } ) , \\mathbb { E } _ { \\boldsymbol { \\xi } } \\left[ \\left\\| \\tilde { \\nabla } f _ { i } ( \\boldsymbol { w } ) - \\nabla f _ { i } ( \\boldsymbol { w } ) \\right\\| ^ { 2 } \\right] \\leq \\sigma ^ { 2 } .", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 667, + 356, + 697 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 654, + 507, + 697 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 697, + 506, + 724 + ], + "lines": [ + { + "bbox": [ + 105, + 695, + 507, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 695, + 176, + 711 + ], + "score": 1.0, + "content": "Assumption 3.", + "type": "text" + }, + { + "bbox": [ + 176, + 698, + 223, + 709 + ], + "score": 0.88, + "content": "f _ { 1 } , \\cdots , f _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 695, + 260, + 711 + ], + "score": 1.0, + "content": "are all", + "type": "text" + }, + { + "bbox": [ + 261, + 699, + 268, + 709 + ], + "score": 0.77, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 695, + 379, + 711 + ], + "score": 1.0, + "content": "-strongly convex: for all", + "type": "text" + }, + { + "bbox": [ + 380, + 700, + 388, + 708 + ], + "score": 0.62, + "content": "w", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 695, + 412, + 711 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 412, + 699, + 419, + 708 + ], + "score": 0.48, + "content": "v _ { \\scriptscriptstyle { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 695, + 425, + 711 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 425, + 697, + 507, + 711 + ], + "score": 0.81, + "content": "f _ { i } ( v ) \\geq f _ { i } ( w ) +", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 107, + 709, + 241, + 725 + ], + "spans": [ + { + "bbox": [ + 107, + 710, + 236, + 724 + ], + "score": 0.89, + "content": "\\begin{array} { r } { \\left. \\nabla f _ { i } ( w ) , v - w \\right. + \\frac { \\mu } { 2 } \\left\\| w - v \\right\\| ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 709, + 241, + 725 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 695, + 507, + 725 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 72, + 505, + 109 + ], + "lines": [ + { + "bbox": [ + 106, + 72, + 506, + 85 + ], + "spans": [ + { + "bbox": [ + 106, + 72, + 270, + 85 + ], + "score": 1.0, + "content": "Assumption 4. There exists a constant", + "type": "text" + }, + { + "bbox": [ + 270, + 73, + 299, + 84 + ], + "score": 0.9, + "content": "t _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 72, + 372, + 85 + ], + "score": 1.0, + "content": ", such that for all", + "type": "text" + }, + { + "bbox": [ + 373, + 73, + 398, + 83 + ], + "score": 0.88, + "content": "t \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 72, + 418, + 85 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 418, + 73, + 451, + 84 + ], + "score": 0.89, + "content": "i \\in [ N ]", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 72, + 506, + 85 + ], + "score": 1.0, + "content": ", the number", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 83, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 83, + 225, + 96 + ], + "score": 1.0, + "content": "of inactive rounds of device", + "type": "text" + }, + { + "bbox": [ + 225, + 84, + 230, + 93 + ], + "score": 0.26, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 83, + 336, + 96 + ], + "score": 1.0, + "content": "at communication round", + "type": "text" + }, + { + "bbox": [ + 336, + 85, + 342, + 93 + ], + "score": 0.59, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 83, + 379, + 96 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + }, + { + "bbox": [ + 379, + 84, + 453, + 96 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\tau ( t , i ) \\leq t _ { 0 } + \\frac { 1 } { b } \\dot { t } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 83, + 486, + 96 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 486, + 84, + 505, + 95 + ], + "score": 0.83, + "content": "b =", + "type": "inline_equation" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 94, + 159, + 111 + ], + "spans": [ + { + "bbox": [ + 106, + 95, + 155, + 110 + ], + "score": 0.89, + "content": "4 0 \\left( L / \\mu \\right) ^ { 1 . 5 }", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 94, + 159, + 111 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 116, + 506, + 172 + ], + "lines": [ + { + "bbox": [ + 106, + 116, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 106, + 116, + 505, + 128 + ], + "score": 1.0, + "content": "Assumptions 1, 2, and 3 are standard and common in the FL literature, e.g., [26, 18, 19, 42, 36]. In", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 125, + 507, + 142 + ], + "spans": [ + { + "bbox": [ + 104, + 125, + 507, + 142 + ], + "score": 1.0, + "content": "Assumption 2, we relax the bounded gradient assumption that is often required in prior work, e.g.,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 138, + 506, + 151 + ], + "spans": [ + { + "bbox": [ + 106, + 138, + 506, + 151 + ], + "score": 1.0, + "content": "[6, 26, 40, 1]. Lastly, Assumption 4 is a very mild assumption on device availability, since it allows", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 148, + 506, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 270, + 162 + ], + "score": 1.0, + "content": "the number of inactive rounds to grow as", + "type": "text" + }, + { + "bbox": [ + 270, + 149, + 290, + 161 + ], + "score": 0.92, + "content": "{ \\mathcal { O } } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 148, + 506, + 162 + ], + "score": 1.0, + "content": ". In contrast, existing results on asynchronous updates", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 160, + 374, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 374, + 173 + ], + "score": 1.0, + "content": "mostly assume a bounded or fixed latency, e.g., [6, 1, 5, 40, 35, 4].", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 106, + 176, + 506, + 223 + ], + "lines": [ + { + "bbox": [ + 100, + 174, + 510, + 196 + ], + "spans": [ + { + "bbox": [ + 100, + 174, + 380, + 196 + ], + "score": 1.0, + "content": "We are now ready to present our first convergence result. Define", + "type": "text" + }, + { + "bbox": [ + 380, + 176, + 493, + 191 + ], + "score": 0.93, + "content": "\\begin{array} { r l } { D = } & { { } \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\left. \\nabla f _ { i } ( w _ { * } ) \\right. ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 174, + 510, + 196 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 189, + 506, + 202 + ], + "spans": [ + { + "bbox": [ + 105, + 189, + 245, + 202 + ], + "score": 1.0, + "content": "measure data dissimilarity, where", + "type": "text" + }, + { + "bbox": [ + 245, + 190, + 327, + 201 + ], + "score": 0.9, + "content": "w _ { * } = \\arg \\operatorname* { m i n } f ( w )", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 189, + 474, + 202 + ], + "score": 1.0, + "content": "is the global optimum. Also, define", + "type": "text" + }, + { + "bbox": [ + 474, + 191, + 487, + 200 + ], + "score": 0.85, + "content": "\\bar { \\tau } _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 189, + 506, + 202 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 200, + 506, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 202, + 135, + 213 + ], + "score": 0.89, + "content": "\\tau _ { \\operatorname* { m a x } , T }", + "type": "inline_equation" + }, + { + "bbox": [ + 136, + 200, + 385, + 213 + ], + "score": 1.0, + "content": "to be the average and maximum numbers of inactive rounds", + "type": "text" + }, + { + "bbox": [ + 386, + 201, + 412, + 213 + ], + "score": 0.93, + "content": "\\tau ( t , i )", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 200, + 506, + 213 + ], + "score": 1.0, + "content": "across all devices and", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 211, + 223, + 223 + ], + "spans": [ + { + "bbox": [ + 106, + 211, + 223, + 223 + ], + "score": 1.0, + "content": "rounds, respectively. That is,", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5 + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 224, + 439, + 259 + ], + "lines": [ + { + "bbox": [ + 172, + 224, + 439, + 259 + ], + "spans": [ + { + "bbox": [ + 172, + 224, + 439, + 259 + ], + "score": 0.94, + "content": "\\bar { \\tau } _ { T } = \\frac { 1 } { N ( T - 1 ) } \\sum _ { t = 1 } ^ { T - 1 } \\sum _ { i = 1 } ^ { N } \\tau ( t , i ) , \\tau _ { \\operatorname* { m a x } , T } = \\operatorname* { m a x } _ { i \\in [ N ] } \\operatorname* { m a x } _ { 1 \\leq t \\leq T - 1 } \\tau ( t , i ) .", + "type": "interline_equation", + "image_path": "733c5805d202f72a1df49e8a211f10a98cbaf3e0246f5f2ede823112da4e143c.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 172, + 224, + 439, + 235.66666666666666 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 172, + 235.66666666666666, + 439, + 247.33333333333331 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 172, + 247.33333333333331, + 439, + 259.0 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 266, + 401, + 278 + ], + "lines": [ + { + "bbox": [ + 105, + 265, + 402, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 265, + 402, + 279 + ], + "score": 1.0, + "content": "The following theorem summarizes the performance of MIFA in this case.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 279, + 505, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 278, + 506, + 292 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 275, + 292 + ], + "score": 1.0, + "content": "Theorem 5.1. Assume that Assumptions", + "type": "text" + }, + { + "bbox": [ + 275, + 280, + 281, + 289 + ], + "score": 0.41, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 278, + 506, + 292 + ], + "score": 1.0, + "content": "to 3 hold. Further assume that the device availability", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 289, + 506, + 304 + ], + "spans": [ + { + "bbox": [ + 104, + 289, + 147, + 304 + ], + "score": 1.0, + "content": "sequence", + "type": "text" + }, + { + "bbox": [ + 147, + 291, + 173, + 302 + ], + "score": 0.85, + "content": "\\tau ( t , i )", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 289, + 261, + 304 + ], + "score": 1.0, + "content": "satisfies Assumption", + "type": "text" + }, + { + "bbox": [ + 261, + 291, + 268, + 300 + ], + "score": 0.54, + "content": "^ { 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 289, + 288, + 304 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 288, + 290, + 336, + 302 + ], + "score": 0.91, + "content": "\\tau ( 1 , i ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 289, + 367, + 304 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 367, + 290, + 401, + 303 + ], + "score": 0.91, + "content": "i \\in [ N ]", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 289, + 506, + 304 + ], + "score": 1.0, + "content": ". By setting the learning", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 300, + 506, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 126, + 318 + ], + "score": 1.0, + "content": "rate", + "type": "text" + }, + { + "bbox": [ + 126, + 302, + 183, + 316 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\eta _ { t } = \\frac { 4 } { \\mu K ( t + a ) } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 300, + 205, + 318 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 206, + 302, + 329, + 314 + ], + "score": 0.9, + "content": "a = \\operatorname* { m a x } \\{ 1 0 0 , 4 0 t _ { 0 } \\} ( L / \\mu ) ^ { 1 . 5 }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 300, + 355, + 318 + ], + "score": 1.0, + "content": ", after", + "type": "text" + }, + { + "bbox": [ + 355, + 302, + 381, + 312 + ], + "score": 0.88, + "content": "T - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 300, + 506, + 318 + ], + "score": 1.0, + "content": "communication rounds, MIFA", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 313, + 145, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 145, + 327 + ], + "score": 1.0, + "content": "satisfies:", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5 + }, + { + "type": "interline_equation", + "bbox": [ + 147, + 327, + 462, + 361 + ], + "lines": [ + { + "bbox": [ + 147, + 327, + 462, + 361 + ], + "spans": [ + { + "bbox": [ + 147, + 327, + 462, + 361 + ], + "score": 0.93, + "content": "\\mathbb { E } _ { \\xi } \\left[ f ( \\overline { { w } } _ { T } ) \\right] - f ( w _ { * } ) = \\mathcal { O } \\left( \\frac { \\bar { \\tau } _ { T } + 1 } { \\mu N K T } \\sigma ^ { 2 } + \\frac { \\tau _ { \\operatorname* { m a x } , T } ^ { 2 } A _ { 1 } + ( K - 1 ) ^ { 2 } A _ { 2 } + A _ { 3 } } { \\mu ^ { 2 } T ^ { 2 } } \\right) ,", + "type": "interline_equation", + "image_path": "a586eb10027a5e2bde1e4b791106324315628fa6d12e02e2e3e3c1ae021cee54.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 147, + 327, + 462, + 338.3333333333333 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 147, + 338.3333333333333, + 462, + 349.66666666666663 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 147, + 349.66666666666663, + 462, + 360.99999999999994 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 367, + 307, + 379 + ], + "lines": [ + { + "bbox": [ + 106, + 367, + 307, + 380 + ], + "spans": [ + { + "bbox": [ + 106, + 367, + 133, + 380 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 369, + 147, + 379 + ], + "score": 0.86, + "content": "\\overline { { w } } _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 148, + 367, + 248, + 380 + ], + "score": 1.0, + "content": "is a weighted average of", + "type": "text" + }, + { + "bbox": [ + 249, + 369, + 261, + 379 + ], + "score": 0.84, + "content": "w _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 367, + 307, + 380 + ], + "score": 1.0, + "content": "defined as:", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "interline_equation", + "bbox": [ + 149, + 381, + 460, + 415 + ], + "lines": [ + { + "bbox": [ + 149, + 381, + 460, + 415 + ], + "spans": [ + { + "bbox": [ + 149, + 381, + 460, + 415 + ], + "score": 0.93, + "content": "\\overline { { w } } _ { T } = \\frac { 1 } { W _ { T } } \\sum _ { t = 1 } ^ { T } ( t + a - 1 ) ( t + a - 2 ) w _ { t } , W _ { T } = \\sum _ { t = 1 } ^ { T } ( t + a - 1 ) ( t + a - 2 ) ,", + "type": "interline_equation", + "image_path": "467ef08efd364fd1d849ca3dc16aa8bd25b2ad4ef2f4136b25ee850e32438dab.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 149, + 381, + 460, + 392.3333333333333 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 149, + 392.3333333333333, + 460, + 403.66666666666663 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 149, + 403.66666666666663, + 460, + 414.99999999999994 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 421, + 431, + 438 + ], + "lines": [], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 177, + 421, + 431, + 438 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 443, + 505, + 506 + ], + "lines": [ + { + "bbox": [ + 107, + 443, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 107, + 443, + 505, + 456 + ], + "score": 1.0, + "content": "Our results hold under Assumption 4, which allows for arbitrary device availability sequences with", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 107, + 454, + 506, + 469 + ], + "spans": [ + { + "bbox": [ + 107, + 455, + 172, + 467 + ], + "score": 0.91, + "content": "\\tau _ { \\mathrm { m a x } , T } = \\mathcal { O } ( T )", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 454, + 351, + 469 + ], + "score": 1.0, + "content": ". However, for MIFA to converge, we require", + "type": "text" + }, + { + "bbox": [ + 352, + 455, + 413, + 467 + ], + "score": 0.94, + "content": "\\tau _ { \\operatorname* { m a x } , T } = o ( T )", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 454, + 432, + 469 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 432, + 455, + 474, + 467 + ], + "score": 0.93, + "content": "\\dot { t _ { 0 } } = \\bar { o } ( T )", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 454, + 506, + 469 + ], + "score": 1.0, + "content": ". When", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 136, + 462, + 509, + 488 + ], + "spans": [ + { + "bbox": [ + 136, + 462, + 509, + 488 + ], + "score": 1.0, + "content": "( NK(τ2max,T +t20)τ¯+1 ), the first term dominates and the impact of the second O(1/T 2) term is", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 483, + 505, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 495 + ], + "score": 1.0, + "content": "negligible. In fact the first term in Theorem 5.1 is minimax optimal by our information-theoretic", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 493, + 317, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 493, + 317, + 506 + ], + "score": 1.0, + "content": "lower bound for the problem in the next proposition.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 106, + 507, + 504, + 541 + ], + "lines": [ + { + "bbox": [ + 105, + 506, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 195, + 520 + ], + "score": 1.0, + "content": "Proposition 5.1. Let", + "type": "text" + }, + { + "bbox": [ + 195, + 507, + 225, + 519 + ], + "score": 0.89, + "content": "c _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 506, + 506, + 520 + ], + "score": 1.0, + "content": "be a universal constant. For any potentially randomized algorithm,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 519, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 396, + 531 + ], + "score": 1.0, + "content": "there exists a stochastic strongly convex problem satisfying Assumptions", + "type": "text" + }, + { + "bbox": [ + 397, + 519, + 402, + 528 + ], + "score": 0.42, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 519, + 505, + 531 + ], + "score": 1.0, + "content": "to 3, such that the output", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 107, + 529, + 443, + 542 + ], + "spans": [ + { + "bbox": [ + 107, + 531, + 121, + 540 + ], + "score": 0.74, + "content": "w _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 121, + 529, + 144, + 542 + ], + "score": 1.0, + "content": "after", + "type": "text" + }, + { + "bbox": [ + 144, + 530, + 151, + 539 + ], + "score": 0.54, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 529, + 443, + 542 + ], + "score": 1.0, + "content": "rounds of communication has expected sub-optimality lower bounded by", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 543, + 374, + 570 + ], + "lines": [ + { + "bbox": [ + 236, + 543, + 374, + 570 + ], + "spans": [ + { + "bbox": [ + 236, + 543, + 374, + 570 + ], + "score": 0.93, + "content": "\\mathbb { E } [ f ( w _ { T } ) - f ( w ^ { * } ) ] \\geq c _ { 0 } \\frac { \\bar { \\tau } _ { T } \\sigma ^ { 2 } } { \\mu N K T } .", + "type": "interline_equation", + "image_path": "15944ea925ca625bc0c3fb0cf5ed413d2deb8aa7ced28f61f9ba449d3ce641aa.jpg" + } + ] + } + ], + "index": 36.5, + "virtual_lines": [ + { + "bbox": [ + 236, + 543, + 374, + 556.5 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 236, + 556.5, + 374, + 570.0 + ], + "spans": [], + "index": 37 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 576, + 504, + 610 + ], + "lines": [ + { + "bbox": [ + 106, + 576, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 576, + 505, + 588 + ], + "score": 1.0, + "content": "The proof is based on the observation that the number of gradient evaluation can scale inversely with", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 587, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 118, + 598 + ], + "score": 0.86, + "content": "\\bar { \\tau } _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 119, + 587, + 505, + 600 + ], + "score": 1.0, + "content": "and that the oracle complexity is tight even for centralized stochastic optimization problems. The", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 598, + 474, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 474, + 612 + ], + "score": 1.0, + "content": "optimality of the first term in Theorem 5.1 is independent of the distributed or the FL setup.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 106, + 614, + 506, + 648 + ], + "lines": [ + { + "bbox": [ + 105, + 614, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 318, + 627 + ], + "score": 1.0, + "content": "The second term in Theorem 5.1 converges at the rate", + "type": "text" + }, + { + "bbox": [ + 318, + 614, + 357, + 627 + ], + "score": 0.92, + "content": "\\mathcal { O } ( 1 / T ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 614, + 505, + 627 + ], + "score": 1.0, + "content": "and consists of three parts, where the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 624, + 506, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 384, + 639 + ], + "score": 1.0, + "content": "first part reflects the slowdown caused by device unavailability through", + "type": "text" + }, + { + "bbox": [ + 385, + 627, + 414, + 638 + ], + "score": 0.9, + "content": "\\tau _ { \\operatorname* { m a x } , T }", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 624, + 506, + 639 + ], + "score": 1.0, + "content": ", the second part shows", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 636, + 491, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 194, + 649 + ], + "score": 1.0, + "content": "the effect of multiple", + "type": "text" + }, + { + "bbox": [ + 195, + 637, + 226, + 648 + ], + "score": 0.85, + "content": "( K > 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 636, + 491, + 649 + ], + "score": 1.0, + "content": ") local steps, and the third part tells how the initial error decreases.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42 + }, + { + "type": "text", + "bbox": [ + 106, + 649, + 506, + 725 + ], + "lines": [ + { + "bbox": [ + 106, + 649, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 195, + 661 + ], + "score": 1.0, + "content": "Remark 5.1. When", + "type": "text" + }, + { + "bbox": [ + 195, + 649, + 248, + 662 + ], + "score": 0.91, + "content": "\\tau ( t , i ) ~ = ~ 0", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 649, + 282, + 661 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 282, + 650, + 289, + 660 + ], + "score": 0.34, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 649, + 310, + 661 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 310, + 651, + 316, + 660 + ], + "score": 0.58, + "content": "t _ { : }", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 649, + 506, + 661 + ], + "score": 1.0, + "content": ", our setup reduces to FedAvg with full de-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 659, + 369, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 133, + 691 + ], + "score": 1.0, + "content": "vice pbound", + "type": "text" + }, + { + "bbox": [ + 245, + 662, + 281, + 672 + ], + "score": 0.89, + "content": "\\bar { \\tau } _ { T } ~ = ~ 0", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 659, + 303, + 691 + ], + "score": 1.0, + "content": "d ,", + "type": "text" + }, + { + "bbox": [ + 304, + 662, + 356, + 673 + ], + "score": 0.9, + "content": "\\tau _ { \\mathrm { m a x } , T } ~ = ~ 0", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 659, + 369, + 691 + ], + "score": 1.0, + "content": ". Iate", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 133, + 672, + 507, + 692 + ], + "spans": [ + { + "bbox": [ + 133, + 672, + 294, + 692 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\mathcal { O } \\left( \\frac { \\sigma ^ { 2 } } { \\mu K N T } + \\frac { L ( \\sigma ^ { 2 } / K + D + L ^ { 2 } \\| w _ { 1 } - w _ { * } \\| ^ { 2 } ) } { \\mu ^ { 2 } T ^ { 2 } } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 672, + 507, + 692 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\mathcal { O } \\bigg ( \\frac { \\sigma ^ { 2 } \\log T } { \\mu K N T } + \\frac { L ( \\sigma ^ { 2 } / K + D ) ( \\log T ) ^ { 2 } } { \\mu ^ { 2 } T ^ { 2 } } + } \\end{array}", + "type": "inline_equation" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 690, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 106, + 693, + 226, + 709 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mu \\left. w _ { 1 } - w _ { * } \\right. ^ { 2 } \\exp ( - \\frac { \\mu } { 4 8 L } T ) \\Bigr ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 690, + 293, + 713 + ], + "score": 1.0, + "content": "in [18] (Thm. V.", + "type": "text" + }, + { + "bbox": [ + 294, + 694, + 357, + 708 + ], + "score": 0.77, + "content": "B ^ { 2 } = 2 , \\eta _ { g } = 1 ,", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 690, + 506, + 713 + ], + "score": 1.0, + "content": ") up to logarithmic terms. Besides, in", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 708, + 439, + 726 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 193, + 726 + ], + "score": 1.0, + "content": "the general case, our", + "type": "text" + }, + { + "bbox": [ + 193, + 710, + 266, + 724 + ], + "score": 0.92, + "content": "\\mathcal { O } ( \\tau _ { \\mathrm { m a x } , T } ^ { 2 } A _ { 1 } / T ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 708, + 385, + 726 + ], + "score": 1.0, + "content": "term matches the last term in", + "type": "text" + }, + { + "bbox": [ + 386, + 711, + 433, + 722 + ], + "score": 0.55, + "content": "I 6 J \\left( C o r . 5 \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 708, + 439, + 726 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 46 + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 741, + 309, + 750 + ], + "lines": [ + { + "bbox": [ + 302, + 741, + 309, + 752 + ], + "spans": [ + { + "bbox": [ + 302, + 741, + 309, + 752 + ], + "score": 1.0, + "content": "6", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 72, + 505, + 109 + ], + "lines": [ + { + "bbox": [ + 106, + 72, + 506, + 85 + ], + "spans": [ + { + "bbox": [ + 106, + 72, + 270, + 85 + ], + "score": 1.0, + "content": "Assumption 4. There exists a constant", + "type": "text" + }, + { + "bbox": [ + 270, + 73, + 299, + 84 + ], + "score": 0.9, + "content": "t _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 72, + 372, + 85 + ], + "score": 1.0, + "content": ", such that for all", + "type": "text" + }, + { + "bbox": [ + 373, + 73, + 398, + 83 + ], + "score": 0.88, + "content": "t \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 72, + 418, + 85 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 418, + 73, + 451, + 84 + ], + "score": 0.89, + "content": "i \\in [ N ]", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 72, + 506, + 85 + ], + "score": 1.0, + "content": ", the number", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 83, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 83, + 225, + 96 + ], + "score": 1.0, + "content": "of inactive rounds of device", + "type": "text" + }, + { + "bbox": [ + 225, + 84, + 230, + 93 + ], + "score": 0.26, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 83, + 336, + 96 + ], + "score": 1.0, + "content": "at communication round", + "type": "text" + }, + { + "bbox": [ + 336, + 85, + 342, + 93 + ], + "score": 0.59, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 83, + 379, + 96 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + }, + { + "bbox": [ + 379, + 84, + 453, + 96 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\tau ( t , i ) \\leq t _ { 0 } + \\frac { 1 } { b } \\dot { t } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 83, + 486, + 96 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 486, + 84, + 505, + 95 + ], + "score": 0.83, + "content": "b =", + "type": "inline_equation" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 94, + 159, + 111 + ], + "spans": [ + { + "bbox": [ + 106, + 95, + 155, + 110 + ], + "score": 0.89, + "content": "4 0 \\left( L / \\mu \\right) ^ { 1 . 5 }", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 94, + 159, + 111 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 72, + 506, + 111 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 116, + 506, + 172 + ], + "lines": [ + { + "bbox": [ + 106, + 116, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 106, + 116, + 505, + 128 + ], + "score": 1.0, + "content": "Assumptions 1, 2, and 3 are standard and common in the FL literature, e.g., [26, 18, 19, 42, 36]. In", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 125, + 507, + 142 + ], + "spans": [ + { + "bbox": [ + 104, + 125, + 507, + 142 + ], + "score": 1.0, + "content": "Assumption 2, we relax the bounded gradient assumption that is often required in prior work, e.g.,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 138, + 506, + 151 + ], + "spans": [ + { + "bbox": [ + 106, + 138, + 506, + 151 + ], + "score": 1.0, + "content": "[6, 26, 40, 1]. Lastly, Assumption 4 is a very mild assumption on device availability, since it allows", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 148, + 506, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 270, + 162 + ], + "score": 1.0, + "content": "the number of inactive rounds to grow as", + "type": "text" + }, + { + "bbox": [ + 270, + 149, + 290, + 161 + ], + "score": 0.92, + "content": "{ \\mathcal { O } } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 148, + 506, + 162 + ], + "score": 1.0, + "content": ". In contrast, existing results on asynchronous updates", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 160, + 374, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 374, + 173 + ], + "score": 1.0, + "content": "mostly assume a bounded or fixed latency, e.g., [6, 1, 5, 40, 35, 4].", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5, + "bbox_fs": [ + 104, + 116, + 507, + 173 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 176, + 506, + 223 + ], + "lines": [ + { + "bbox": [ + 100, + 174, + 510, + 196 + ], + "spans": [ + { + "bbox": [ + 100, + 174, + 380, + 196 + ], + "score": 1.0, + "content": "We are now ready to present our first convergence result. Define", + "type": "text" + }, + { + "bbox": [ + 380, + 176, + 493, + 191 + ], + "score": 0.93, + "content": "\\begin{array} { r l } { D = } & { { } \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\left. \\nabla f _ { i } ( w _ { * } ) \\right. ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 174, + 510, + 196 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 189, + 506, + 202 + ], + "spans": [ + { + "bbox": [ + 105, + 189, + 245, + 202 + ], + "score": 1.0, + "content": "measure data dissimilarity, where", + "type": "text" + }, + { + "bbox": [ + 245, + 190, + 327, + 201 + ], + "score": 0.9, + "content": "w _ { * } = \\arg \\operatorname* { m i n } f ( w )", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 189, + 474, + 202 + ], + "score": 1.0, + "content": "is the global optimum. Also, define", + "type": "text" + }, + { + "bbox": [ + 474, + 191, + 487, + 200 + ], + "score": 0.85, + "content": "\\bar { \\tau } _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 189, + 506, + 202 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 200, + 506, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 202, + 135, + 213 + ], + "score": 0.89, + "content": "\\tau _ { \\operatorname* { m a x } , T }", + "type": "inline_equation" + }, + { + "bbox": [ + 136, + 200, + 385, + 213 + ], + "score": 1.0, + "content": "to be the average and maximum numbers of inactive rounds", + "type": "text" + }, + { + "bbox": [ + 386, + 201, + 412, + 213 + ], + "score": 0.93, + "content": "\\tau ( t , i )", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 200, + 506, + 213 + ], + "score": 1.0, + "content": "across all devices and", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 211, + 223, + 223 + ], + "spans": [ + { + "bbox": [ + 106, + 211, + 223, + 223 + ], + "score": 1.0, + "content": "rounds, respectively. That is,", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5, + "bbox_fs": [ + 100, + 174, + 510, + 223 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 224, + 439, + 259 + ], + "lines": [ + { + "bbox": [ + 172, + 224, + 439, + 259 + ], + "spans": [ + { + "bbox": [ + 172, + 224, + 439, + 259 + ], + "score": 0.94, + "content": "\\bar { \\tau } _ { T } = \\frac { 1 } { N ( T - 1 ) } \\sum _ { t = 1 } ^ { T - 1 } \\sum _ { i = 1 } ^ { N } \\tau ( t , i ) , \\tau _ { \\operatorname* { m a x } , T } = \\operatorname* { m a x } _ { i \\in [ N ] } \\operatorname* { m a x } _ { 1 \\leq t \\leq T - 1 } \\tau ( t , i ) .", + "type": "interline_equation", + "image_path": "733c5805d202f72a1df49e8a211f10a98cbaf3e0246f5f2ede823112da4e143c.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 172, + 224, + 439, + 235.66666666666666 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 172, + 235.66666666666666, + 439, + 247.33333333333331 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 172, + 247.33333333333331, + 439, + 259.0 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 266, + 401, + 278 + ], + "lines": [ + { + "bbox": [ + 105, + 265, + 402, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 265, + 402, + 279 + ], + "score": 1.0, + "content": "The following theorem summarizes the performance of MIFA in this case.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 265, + 402, + 279 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 279, + 505, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 278, + 506, + 292 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 275, + 292 + ], + "score": 1.0, + "content": "Theorem 5.1. Assume that Assumptions", + "type": "text" + }, + { + "bbox": [ + 275, + 280, + 281, + 289 + ], + "score": 0.41, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 278, + 506, + 292 + ], + "score": 1.0, + "content": "to 3 hold. Further assume that the device availability", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 289, + 506, + 304 + ], + "spans": [ + { + "bbox": [ + 104, + 289, + 147, + 304 + ], + "score": 1.0, + "content": "sequence", + "type": "text" + }, + { + "bbox": [ + 147, + 291, + 173, + 302 + ], + "score": 0.85, + "content": "\\tau ( t , i )", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 289, + 261, + 304 + ], + "score": 1.0, + "content": "satisfies Assumption", + "type": "text" + }, + { + "bbox": [ + 261, + 291, + 268, + 300 + ], + "score": 0.54, + "content": "^ { 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 289, + 288, + 304 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 288, + 290, + 336, + 302 + ], + "score": 0.91, + "content": "\\tau ( 1 , i ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 289, + 367, + 304 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 367, + 290, + 401, + 303 + ], + "score": 0.91, + "content": "i \\in [ N ]", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 289, + 506, + 304 + ], + "score": 1.0, + "content": ". By setting the learning", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 300, + 506, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 126, + 318 + ], + "score": 1.0, + "content": "rate", + "type": "text" + }, + { + "bbox": [ + 126, + 302, + 183, + 316 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\eta _ { t } = \\frac { 4 } { \\mu K ( t + a ) } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 300, + 205, + 318 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 206, + 302, + 329, + 314 + ], + "score": 0.9, + "content": "a = \\operatorname* { m a x } \\{ 1 0 0 , 4 0 t _ { 0 } \\} ( L / \\mu ) ^ { 1 . 5 }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 300, + 355, + 318 + ], + "score": 1.0, + "content": ", after", + "type": "text" + }, + { + "bbox": [ + 355, + 302, + 381, + 312 + ], + "score": 0.88, + "content": "T - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 300, + 506, + 318 + ], + "score": 1.0, + "content": "communication rounds, MIFA", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 313, + 145, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 145, + 327 + ], + "score": 1.0, + "content": "satisfies:", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5, + "bbox_fs": [ + 104, + 278, + 506, + 327 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 147, + 327, + 462, + 361 + ], + "lines": [ + { + "bbox": [ + 147, + 327, + 462, + 361 + ], + "spans": [ + { + "bbox": [ + 147, + 327, + 462, + 361 + ], + "score": 0.93, + "content": "\\mathbb { E } _ { \\xi } \\left[ f ( \\overline { { w } } _ { T } ) \\right] - f ( w _ { * } ) = \\mathcal { O } \\left( \\frac { \\bar { \\tau } _ { T } + 1 } { \\mu N K T } \\sigma ^ { 2 } + \\frac { \\tau _ { \\operatorname* { m a x } , T } ^ { 2 } A _ { 1 } + ( K - 1 ) ^ { 2 } A _ { 2 } + A _ { 3 } } { \\mu ^ { 2 } T ^ { 2 } } \\right) ,", + "type": "interline_equation", + "image_path": "a586eb10027a5e2bde1e4b791106324315628fa6d12e02e2e3e3c1ae021cee54.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 147, + 327, + 462, + 338.3333333333333 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 147, + 338.3333333333333, + 462, + 349.66666666666663 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 147, + 349.66666666666663, + 462, + 360.99999999999994 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 367, + 307, + 379 + ], + "lines": [ + { + "bbox": [ + 106, + 367, + 307, + 380 + ], + "spans": [ + { + "bbox": [ + 106, + 367, + 133, + 380 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 369, + 147, + 379 + ], + "score": 0.86, + "content": "\\overline { { w } } _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 148, + 367, + 248, + 380 + ], + "score": 1.0, + "content": "is a weighted average of", + "type": "text" + }, + { + "bbox": [ + 249, + 369, + 261, + 379 + ], + "score": 0.84, + "content": "w _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 367, + 307, + 380 + ], + "score": 1.0, + "content": "defined as:", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23, + "bbox_fs": [ + 106, + 367, + 307, + 380 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 149, + 381, + 460, + 415 + ], + "lines": [ + { + "bbox": [ + 149, + 381, + 460, + 415 + ], + "spans": [ + { + "bbox": [ + 149, + 381, + 460, + 415 + ], + "score": 0.93, + "content": "\\overline { { w } } _ { T } = \\frac { 1 } { W _ { T } } \\sum _ { t = 1 } ^ { T } ( t + a - 1 ) ( t + a - 2 ) w _ { t } , W _ { T } = \\sum _ { t = 1 } ^ { T } ( t + a - 1 ) ( t + a - 2 ) ,", + "type": "interline_equation", + "image_path": "467ef08efd364fd1d849ca3dc16aa8bd25b2ad4ef2f4136b25ee850e32438dab.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 149, + 381, + 460, + 392.3333333333333 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 149, + 392.3333333333333, + 460, + 403.66666666666663 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 149, + 403.66666666666663, + 460, + 414.99999999999994 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 421, + 431, + 438 + ], + "lines": [], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 177, + 421, + 431, + 438 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 443, + 505, + 506 + ], + "lines": [ + { + "bbox": [ + 107, + 443, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 107, + 443, + 505, + 456 + ], + "score": 1.0, + "content": "Our results hold under Assumption 4, which allows for arbitrary device availability sequences with", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 107, + 454, + 506, + 469 + ], + "spans": [ + { + "bbox": [ + 107, + 455, + 172, + 467 + ], + "score": 0.91, + "content": "\\tau _ { \\mathrm { m a x } , T } = \\mathcal { O } ( T )", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 454, + 351, + 469 + ], + "score": 1.0, + "content": ". However, for MIFA to converge, we require", + "type": "text" + }, + { + "bbox": [ + 352, + 455, + 413, + 467 + ], + "score": 0.94, + "content": "\\tau _ { \\operatorname* { m a x } , T } = o ( T )", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 454, + 432, + 469 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 432, + 455, + 474, + 467 + ], + "score": 0.93, + "content": "\\dot { t _ { 0 } } = \\bar { o } ( T )", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 454, + 506, + 469 + ], + "score": 1.0, + "content": ". When", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 136, + 462, + 509, + 488 + ], + "spans": [ + { + "bbox": [ + 136, + 462, + 509, + 488 + ], + "score": 1.0, + "content": "( NK(τ2max,T +t20)τ¯+1 ), the first term dominates and the impact of the second O(1/T 2) term is", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 483, + 505, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 495 + ], + "score": 1.0, + "content": "negligible. In fact the first term in Theorem 5.1 is minimax optimal by our information-theoretic", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 493, + 317, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 493, + 317, + 506 + ], + "score": 1.0, + "content": "lower bound for the problem in the next proposition.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 443, + 509, + 506 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 507, + 504, + 541 + ], + "lines": [ + { + "bbox": [ + 105, + 506, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 195, + 520 + ], + "score": 1.0, + "content": "Proposition 5.1. Let", + "type": "text" + }, + { + "bbox": [ + 195, + 507, + 225, + 519 + ], + "score": 0.89, + "content": "c _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 506, + 506, + 520 + ], + "score": 1.0, + "content": "be a universal constant. For any potentially randomized algorithm,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 519, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 396, + 531 + ], + "score": 1.0, + "content": "there exists a stochastic strongly convex problem satisfying Assumptions", + "type": "text" + }, + { + "bbox": [ + 397, + 519, + 402, + 528 + ], + "score": 0.42, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 519, + 505, + 531 + ], + "score": 1.0, + "content": "to 3, such that the output", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 107, + 529, + 443, + 542 + ], + "spans": [ + { + "bbox": [ + 107, + 531, + 121, + 540 + ], + "score": 0.74, + "content": "w _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 121, + 529, + 144, + 542 + ], + "score": 1.0, + "content": "after", + "type": "text" + }, + { + "bbox": [ + 144, + 530, + 151, + 539 + ], + "score": 0.54, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 529, + 443, + 542 + ], + "score": 1.0, + "content": "rounds of communication has expected sub-optimality lower bounded by", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 506, + 506, + 542 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 543, + 374, + 570 + ], + "lines": [ + { + "bbox": [ + 236, + 543, + 374, + 570 + ], + "spans": [ + { + "bbox": [ + 236, + 543, + 374, + 570 + ], + "score": 0.93, + "content": "\\mathbb { E } [ f ( w _ { T } ) - f ( w ^ { * } ) ] \\geq c _ { 0 } \\frac { \\bar { \\tau } _ { T } \\sigma ^ { 2 } } { \\mu N K T } .", + "type": "interline_equation", + "image_path": "15944ea925ca625bc0c3fb0cf5ed413d2deb8aa7ced28f61f9ba449d3ce641aa.jpg" + } + ] + } + ], + "index": 36.5, + "virtual_lines": [ + { + "bbox": [ + 236, + 543, + 374, + 556.5 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 236, + 556.5, + 374, + 570.0 + ], + "spans": [], + "index": 37 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 576, + 504, + 610 + ], + "lines": [ + { + "bbox": [ + 106, + 576, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 576, + 505, + 588 + ], + "score": 1.0, + "content": "The proof is based on the observation that the number of gradient evaluation can scale inversely with", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 587, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 118, + 598 + ], + "score": 0.86, + "content": "\\bar { \\tau } _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 119, + 587, + 505, + 600 + ], + "score": 1.0, + "content": "and that the oracle complexity is tight even for centralized stochastic optimization problems. The", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 598, + 474, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 474, + 612 + ], + "score": 1.0, + "content": "optimality of the first term in Theorem 5.1 is independent of the distributed or the FL setup.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39, + "bbox_fs": [ + 105, + 576, + 505, + 612 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 614, + 506, + 648 + ], + "lines": [ + { + "bbox": [ + 105, + 614, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 318, + 627 + ], + "score": 1.0, + "content": "The second term in Theorem 5.1 converges at the rate", + "type": "text" + }, + { + "bbox": [ + 318, + 614, + 357, + 627 + ], + "score": 0.92, + "content": "\\mathcal { O } ( 1 / T ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 614, + 505, + 627 + ], + "score": 1.0, + "content": "and consists of three parts, where the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 624, + 506, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 384, + 639 + ], + "score": 1.0, + "content": "first part reflects the slowdown caused by device unavailability through", + "type": "text" + }, + { + "bbox": [ + 385, + 627, + 414, + 638 + ], + "score": 0.9, + "content": "\\tau _ { \\operatorname* { m a x } , T }", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 624, + 506, + 639 + ], + "score": 1.0, + "content": ", the second part shows", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 636, + 491, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 194, + 649 + ], + "score": 1.0, + "content": "the effect of multiple", + "type": "text" + }, + { + "bbox": [ + 195, + 637, + 226, + 648 + ], + "score": 0.85, + "content": "( K > 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 636, + 491, + 649 + ], + "score": 1.0, + "content": ") local steps, and the third part tells how the initial error decreases.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42, + "bbox_fs": [ + 105, + 614, + 506, + 649 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 649, + 506, + 725 + ], + "lines": [ + { + "bbox": [ + 106, + 649, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 195, + 661 + ], + "score": 1.0, + "content": "Remark 5.1. When", + "type": "text" + }, + { + "bbox": [ + 195, + 649, + 248, + 662 + ], + "score": 0.91, + "content": "\\tau ( t , i ) ~ = ~ 0", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 649, + 282, + 661 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 282, + 650, + 289, + 660 + ], + "score": 0.34, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 649, + 310, + 661 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 310, + 651, + 316, + 660 + ], + "score": 0.58, + "content": "t _ { : }", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 649, + 506, + 661 + ], + "score": 1.0, + "content": ", our setup reduces to FedAvg with full de-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 659, + 369, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 133, + 691 + ], + "score": 1.0, + "content": "vice pbound", + "type": "text" + }, + { + "bbox": [ + 245, + 662, + 281, + 672 + ], + "score": 0.89, + "content": "\\bar { \\tau } _ { T } ~ = ~ 0", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 659, + 303, + 691 + ], + "score": 1.0, + "content": "d ,", + "type": "text" + }, + { + "bbox": [ + 304, + 662, + 356, + 673 + ], + "score": 0.9, + "content": "\\tau _ { \\mathrm { m a x } , T } ~ = ~ 0", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 659, + 369, + 691 + ], + "score": 1.0, + "content": ". Iate", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 133, + 672, + 507, + 692 + ], + "spans": [ + { + "bbox": [ + 133, + 672, + 294, + 692 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\mathcal { O } \\left( \\frac { \\sigma ^ { 2 } } { \\mu K N T } + \\frac { L ( \\sigma ^ { 2 } / K + D + L ^ { 2 } \\| w _ { 1 } - w _ { * } \\| ^ { 2 } ) } { \\mu ^ { 2 } T ^ { 2 } } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 672, + 507, + 692 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\mathcal { O } \\bigg ( \\frac { \\sigma ^ { 2 } \\log T } { \\mu K N T } + \\frac { L ( \\sigma ^ { 2 } / K + D ) ( \\log T ) ^ { 2 } } { \\mu ^ { 2 } T ^ { 2 } } + } \\end{array}", + "type": "inline_equation" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 690, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 106, + 693, + 226, + 709 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mu \\left. w _ { 1 } - w _ { * } \\right. ^ { 2 } \\exp ( - \\frac { \\mu } { 4 8 L } T ) \\Bigr ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 690, + 293, + 713 + ], + "score": 1.0, + "content": "in [18] (Thm. V.", + "type": "text" + }, + { + "bbox": [ + 294, + 694, + 357, + 708 + ], + "score": 0.77, + "content": "B ^ { 2 } = 2 , \\eta _ { g } = 1 ,", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 690, + 506, + 713 + ], + "score": 1.0, + "content": ") up to logarithmic terms. Besides, in", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 708, + 439, + 726 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 193, + 726 + ], + "score": 1.0, + "content": "the general case, our", + "type": "text" + }, + { + "bbox": [ + 193, + 710, + 266, + 724 + ], + "score": 0.92, + "content": "\\mathcal { O } ( \\tau _ { \\mathrm { m a x } , T } ^ { 2 } A _ { 1 } / T ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 708, + 385, + 726 + ], + "score": 1.0, + "content": "term matches the last term in", + "type": "text" + }, + { + "bbox": [ + 386, + 711, + 433, + 722 + ], + "score": 0.55, + "content": "I 6 J \\left( C o r . 5 \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 708, + 439, + 726 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 46, + "bbox_fs": [ + 105, + 649, + 507, + 726 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 72, + 506, + 117 + ], + "lines": [ + { + "bbox": [ + 105, + 72, + 506, + 85 + ], + "spans": [ + { + "bbox": [ + 105, + 72, + 506, + 85 + ], + "score": 1.0, + "content": "Remark 5.2. Our analysis relies on the technical assumption that all devices respond in the first", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 84, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 84, + 505, + 95 + ], + "score": 1.0, + "content": "round. Intuitively, this is because we need at least one valid stochastic gradient evaluation for each", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 94, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 104, + 94, + 506, + 107 + ], + "score": 1.0, + "content": "device to get a complete picture of the global objective, or otherwise any update would be biased. In", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 104, + 105, + 506, + 119 + ], + "spans": [ + { + "bbox": [ + 104, + 105, + 405, + 119 + ], + "score": 1.0, + "content": "practice, this can be achieved by waiting for the updates from all devices on", + "type": "text" + }, + { + "bbox": [ + 406, + 108, + 418, + 117 + ], + "score": 0.84, + "content": "w _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 105, + 506, + 119 + ], + "score": 1.0, + "content": "at the very beginning.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "title", + "bbox": [ + 106, + 130, + 305, + 143 + ], + "lines": [ + { + "bbox": [ + 105, + 128, + 305, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 305, + 145 + ], + "score": 1.0, + "content": "5.1 Case Study: i.i.d. Bernoulli participation", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 150, + 505, + 228 + ], + "lines": [ + { + "bbox": [ + 105, + 150, + 506, + 165 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 506, + 165 + ], + "score": 1.0, + "content": "Though our algorithm can be applied to non-stationary and non-independent response patterns, we", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 161, + 505, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 161, + 505, + 174 + ], + "score": 1.0, + "content": "show in this subsection that even in the simple i.i.d. Bernoulli participation scenario our algorithm", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 173, + 505, + 185 + ], + "spans": [ + { + "bbox": [ + 106, + 173, + 505, + 185 + ], + "score": 1.0, + "content": "can achieve considerable improvement compared to known algorithms. In particular, we consider", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 104, + 183, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 104, + 183, + 441, + 196 + ], + "score": 1.0, + "content": "a setup where each device becomes active independently with a fixed probability", + "type": "text" + }, + { + "bbox": [ + 441, + 185, + 451, + 195 + ], + "score": 0.84, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 183, + 505, + 196 + ], + "score": 1.0, + "content": ". It serves as", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 194, + 506, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 506, + 208 + ], + "score": 1.0, + "content": "the first motivating example towards modeling the participation patterns of devices, and provides a", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 204, + 506, + 219 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 506, + 219 + ], + "score": 1.0, + "content": "clean view of how the heterogeneity of the device participation influences the Federated optimization", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 216, + 155, + 230 + ], + "spans": [ + { + "bbox": [ + 105, + 216, + 155, + 230 + ], + "score": 1.0, + "content": "algorithms.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 106, + 232, + 505, + 277 + ], + "lines": [ + { + "bbox": [ + 105, + 231, + 505, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 505, + 245 + ], + "score": 1.0, + "content": "We will show that in this scenario, Assumption 4 holds with high probability, and the terms involving", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 244, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 189, + 255 + ], + "score": 1.0, + "content": "the inactive rounds", + "type": "text" + }, + { + "bbox": [ + 189, + 244, + 215, + 255 + ], + "score": 0.93, + "content": "\\tau ( t , i )", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 244, + 505, + 255 + ], + "score": 1.0, + "content": "in Theorem 5.1 can also be bounded. Furthermore, we theoretically", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 254, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 449, + 268 + ], + "score": 1.0, + "content": "demonstrate that algorithms such as FedAvg [28] and SCAFFOLD [18], which sample", + "type": "text" + }, + { + "bbox": [ + 449, + 255, + 457, + 264 + ], + "score": 0.79, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 254, + 506, + 268 + ], + "score": 1.0, + "content": "devices for", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 266, + 380, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 380, + 278 + ], + "score": 1.0, + "content": "each global update, are more prone to stragglers than our algorithm.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 280, + 505, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 280, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 252, + 294 + ], + "score": 1.0, + "content": "Definition 5.2. Assume that for all", + "type": "text" + }, + { + "bbox": [ + 253, + 280, + 285, + 293 + ], + "score": 0.91, + "content": "i \\in [ N ]", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 280, + 475, + 294 + ], + "score": 1.0, + "content": ", the i-th device is assigned with a probability", + "type": "text" + }, + { + "bbox": [ + 475, + 282, + 484, + 292 + ], + "score": 0.83, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 280, + 505, + 294 + ], + "score": 1.0, + "content": ". We", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 291, + 505, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 505, + 304 + ], + "score": 1.0, + "content": "say the participation of the devices follows i.i.d. Bernoulli participation model with participation", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 303, + 506, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 159, + 316 + ], + "score": 1.0, + "content": "probabilities", + "type": "text" + }, + { + "bbox": [ + 159, + 303, + 178, + 315 + ], + "score": 0.89, + "content": "\\{ p _ { i } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 303, + 435, + 316 + ], + "score": 1.0, + "content": ", if (1). at the first round, all devices are active, and (2). at round", + "type": "text" + }, + { + "bbox": [ + 436, + 303, + 458, + 313 + ], + "score": 0.88, + "content": "t > 1", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 303, + 490, + 316 + ], + "score": 1.0, + "content": ", device", + "type": "text" + }, + { + "bbox": [ + 490, + 303, + 495, + 312 + ], + "score": 0.56, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 303, + 506, + 316 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 314, + 428, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 314, + 198, + 326 + ], + "score": 1.0, + "content": "active with probability", + "type": "text" + }, + { + "bbox": [ + 199, + 315, + 208, + 325 + ], + "score": 0.85, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 314, + 428, + 326 + ], + "score": 1.0, + "content": ", which is independent of the history and other devices.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 107, + 333, + 503, + 357 + ], + "lines": [ + { + "bbox": [ + 105, + 333, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 333, + 479, + 348 + ], + "score": 1.0, + "content": "Next theorem shows that under i.i.d. Bernoulli participation scenario, with high probability,", + "type": "text" + }, + { + "bbox": [ + 479, + 334, + 505, + 346 + ], + "score": 0.92, + "content": "\\tau ( t , i )", + "type": "inline_equation" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 344, + 434, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 226, + 357 + ], + "score": 1.0, + "content": "only grows logarithmically in", + "type": "text" + }, + { + "bbox": [ + 227, + 346, + 232, + 355 + ], + "score": 0.61, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 344, + 420, + 357 + ], + "score": 1.0, + "content": ". Also Assumption 4 holds for a mild choice of", + "type": "text" + }, + { + "bbox": [ + 421, + 346, + 430, + 356 + ], + "score": 0.86, + "content": "t _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 344, + 434, + 357 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 105, + 360, + 505, + 383 + ], + "lines": [ + { + "bbox": [ + 106, + 360, + 506, + 373 + ], + "spans": [ + { + "bbox": [ + 106, + 360, + 478, + 373 + ], + "score": 1.0, + "content": "Theorem 5.2. For i.i.d. Bernoulli participation model defined in Definition 5.2, given any", + "type": "text" + }, + { + "bbox": [ + 478, + 360, + 502, + 371 + ], + "score": 0.89, + "content": "\\delta > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 360, + 506, + 373 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 370, + 507, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 203, + 385 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 203, + 371, + 226, + 382 + ], + "score": 0.86, + "content": "1 - \\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 370, + 369, + 385 + ], + "score": 1.0, + "content": ", we have the following holds for all", + "type": "text" + }, + { + "bbox": [ + 369, + 372, + 392, + 382 + ], + "score": 0.9, + "content": "t \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 370, + 410, + 385 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 411, + 371, + 442, + 383 + ], + "score": 0.92, + "content": "i \\in [ N ]", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 370, + 507, + 385 + ], + "score": 1.0, + "content": "simultaneously,", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "interline_equation", + "bbox": [ + 234, + 388, + 376, + 414 + ], + "lines": [ + { + "bbox": [ + 234, + 388, + 376, + 414 + ], + "spans": [ + { + "bbox": [ + 234, + 388, + 376, + 414 + ], + "score": 0.93, + "content": "\\tau ( t , i ) \\leq \\mathcal { O } \\Big ( \\frac { 1 } { p _ { i } } ( \\log ( N t / \\delta ) + 1 ) \\Big ) .", + "type": "interline_equation", + "image_path": "39aa0a52372df38b6d9e71e222db332e84efa7cdb81235ae00a0fb9752de5e1b.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 234, + 388, + 376, + 414 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 420, + 505, + 452 + ], + "lines": [ + { + "bbox": [ + 104, + 420, + 506, + 440 + ], + "spans": [ + { + "bbox": [ + 104, + 422, + 160, + 437 + ], + "score": 1.0, + "content": "Furthermore,", + "type": "text" + }, + { + "bbox": [ + 161, + 425, + 172, + 435 + ], + "score": 0.39, + "content": "( l )", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 422, + 225, + 437 + ], + "score": 1.0, + "content": ". Assumption", + "type": "text" + }, + { + "bbox": [ + 225, + 425, + 232, + 434 + ], + "score": 0.29, + "content": "^ { 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 422, + 277, + 437 + ], + "score": 1.0, + "content": "holds true", + "type": "text" + }, + { + "bbox": [ + 277, + 420, + 384, + 440 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\mathrm { \\ddot { \\it f } } t _ { 0 } = \\Omega \\bigg ( \\frac { 1 } { p _ { m i n } } \\log \\frac { b N } { p _ { m i n } \\delta } \\bigg ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 422, + 414, + 438 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 415, + 424, + 484, + 436 + ], + "score": 0.91, + "content": "p _ { m i n } = \\operatorname* { m i n } \\{ p _ { i } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 422, + 506, + 438 + ], + "score": 1.0, + "content": ", and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 107, + 437, + 325, + 453 + ], + "spans": [ + { + "bbox": [ + 107, + 438, + 171, + 452 + ], + "score": 0.87, + "content": "b = 4 0 ( L / \\mu ) ^ { 1 . 5 }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 437, + 190, + 453 + ], + "score": 1.0, + "content": ";(2).", + "type": "text" + }, + { + "bbox": [ + 191, + 441, + 220, + 452 + ], + "score": 0.88, + "content": "\\tau _ { \\operatorname* { m a x } , T }", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 437, + 325, + 453 + ], + "score": 1.0, + "content": "can be upper bounded as", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "interline_equation", + "bbox": [ + 220, + 457, + 390, + 483 + ], + "lines": [ + { + "bbox": [ + 220, + 457, + 390, + 483 + ], + "spans": [ + { + "bbox": [ + 220, + 457, + 390, + 483 + ], + "score": 0.93, + "content": "\\tau _ { \\operatorname* { m a x } , T } \\leq \\mathcal { O } \\Big ( \\frac { 1 } { p _ { m i n } } \\cdot \\big ( \\log ( T N / \\delta ) + 1 \\big ) \\Big ) .", + "type": "interline_equation", + "image_path": "922e99211cb7c2d1fd2b59ad614767b49e2270e68185e6f77ea7f51093a5ac80.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 220, + 457, + 390, + 483 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 493, + 371, + 506 + ], + "lines": [ + { + "bbox": [ + 105, + 492, + 372, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 355, + 508 + ], + "score": 1.0, + "content": "The next theorem provides a high probability upper bound for", + "type": "text" + }, + { + "bbox": [ + 356, + 495, + 367, + 505 + ], + "score": 0.88, + "content": "\\bar { \\tau } _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 492, + 372, + 508 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 106, + 509, + 505, + 532 + ], + "lines": [ + { + "bbox": [ + 106, + 509, + 506, + 522 + ], + "spans": [ + { + "bbox": [ + 106, + 509, + 462, + 522 + ], + "score": 1.0, + "content": "Theorem 5.3. For i.i.d. Bernoulli participation model defined in Definition 5.2, given any", + "type": "text" + }, + { + "bbox": [ + 462, + 509, + 487, + 520 + ], + "score": 0.89, + "content": "\\delta > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 509, + 506, + 522 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 520, + 297, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 520, + 133, + 531 + ], + "score": 0.88, + "content": "T > 1", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 520, + 234, + 533 + ], + "score": 1.0, + "content": ", with probability at least", + "type": "text" + }, + { + "bbox": [ + 235, + 520, + 257, + 531 + ], + "score": 0.88, + "content": "1 - \\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 520, + 297, + 533 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 537, + 379, + 572 + ], + "lines": [ + { + "bbox": [ + 231, + 537, + 379, + 572 + ], + "spans": [ + { + "bbox": [ + 231, + 537, + 379, + 572 + ], + "score": 0.94, + "content": "\\bar { \\tau } _ { T } \\leq \\Big ( \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\frac { 1 } { p _ { i } } \\Big ) \\cdot \\mathcal { O } \\Big ( 1 + \\log \\frac { 1 } { \\delta } \\Big ) .", + "type": "interline_equation", + "image_path": "79e3a5996cb3f7b4c46ca91911907e624b79420e705c6142b9338d5386fc6e5b.jpg" + } + ] + } + ], + "index": 31.5, + "virtual_lines": [ + { + "bbox": [ + 231, + 537, + 379, + 554.5 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 231, + 554.5, + 379, + 572.0 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 582, + 505, + 622 + ], + "lines": [ + { + "bbox": [ + 105, + 581, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 505, + 595 + ], + "score": 1.0, + "content": "By Theorem 5.2 and Theorem 5.3, we conclude that the dominant term of our convergence bound is", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 593, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 107, + 593, + 208, + 613 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\stackrel { \\triangledown } { \\mathcal { O } } \\left( \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\frac { 1 } { p _ { i } } \\cdot \\frac { \\sigma ^ { 2 } } { \\mu N K T } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 595, + 299, + 610 + ], + "score": 1.0, + "content": ". Therefore, to achieve", + "type": "text" + }, + { + "bbox": [ + 300, + 600, + 306, + 607 + ], + "score": 0.74, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 595, + 506, + 610 + ], + "score": 1.0, + "content": "accuracy, the dominant term of the number of the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 611, + 182, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 182, + 623 + ], + "score": 1.0, + "content": "required rounds is", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + }, + { + "type": "interline_equation", + "bbox": [ + 232, + 622, + 378, + 656 + ], + "lines": [ + { + "bbox": [ + 232, + 622, + 378, + 656 + ], + "spans": [ + { + "bbox": [ + 232, + 622, + 378, + 656 + ], + "score": 0.95, + "content": "T _ { \\epsilon } ^ { \\left( \\mathrm { M I F A } \\right) } = \\widetilde { \\mathcal { O } } \\Bigl ( \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\frac { 1 } { p _ { i } } \\cdot \\frac { \\sigma ^ { 2 } } { \\mu N K \\epsilon } \\Bigr ) .", + "type": "interline_equation", + "image_path": "d6f389bee97e0f3555558010eb2588b9917d901810a517b05b4f4f415bf814cb.jpg" + } + ] + } + ], + "index": 36.5, + "virtual_lines": [ + { + "bbox": [ + 232, + 622, + 378, + 639.0 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 232, + 639.0, + 378, + 656.0 + ], + "spans": [], + "index": 37 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 658, + 505, + 723 + ], + "lines": [ + { + "bbox": [ + 106, + 659, + 506, + 671 + ], + "spans": [ + { + "bbox": [ + 106, + 659, + 290, + 671 + ], + "score": 1.0, + "content": "For both FedAvg and SCAFFOLD that sample", + "type": "text" + }, + { + "bbox": [ + 290, + 660, + 298, + 669 + ], + "score": 0.82, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 659, + 506, + 671 + ], + "score": 1.0, + "content": "devices uniformly at random, [18] (Thm I. & III.)", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 669, + 506, + 683 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 449, + 683 + ], + "score": 1.0, + "content": "showed that the dominant term of the number of global updates needed to achieve", + "type": "text" + }, + { + "bbox": [ + 449, + 673, + 456, + 680 + ], + "score": 0.58, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 669, + 506, + 683 + ], + "score": 1.0, + "content": "accuracy is", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 107, + 681, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 107, + 681, + 176, + 701 + ], + "score": 0.93, + "content": "\\begin{array} { r } { R _ { \\epsilon } = \\widetilde { \\mathcal { O } } \\left( \\frac { \\sigma ^ { 2 } } { \\mu S K \\epsilon } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 684, + 506, + 698 + ], + "score": 1.0, + "content": ". Notice that in our setting, to accomplish each global update, the server needs to", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 700, + 504, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 700, + 223, + 712 + ], + "score": 1.0, + "content": "wait for a few rounds for the", + "type": "text" + }, + { + "bbox": [ + 224, + 701, + 232, + 710 + ], + "score": 0.79, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 700, + 330, + 712 + ], + "score": 1.0, + "content": "devices to respond. Let", + "type": "text" + }, + { + "bbox": [ + 330, + 702, + 352, + 712 + ], + "score": 0.93, + "content": "T ( S )", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 700, + 504, + 712 + ], + "score": 1.0, + "content": "be the expected rounds for which the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 711, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 711, + 280, + 722 + ], + "score": 1.0, + "content": "server needs to wait for the selected devices", + "type": "text" + }, + { + "bbox": [ + 281, + 713, + 288, + 720 + ], + "score": 0.86, + "content": "\\boldsymbol { S }", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 711, + 504, + 722 + ], + "score": 1.0, + "content": "to be active. Then the expected total rounds to achieve", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 40 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 741, + 309, + 750 + ], + "lines": [ + { + "bbox": [ + 302, + 741, + 309, + 752 + ], + "spans": [ + { + "bbox": [ + 302, + 741, + 309, + 752 + ], + "score": 1.0, + "content": "7", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 72, + 506, + 117 + ], + "lines": [ + { + "bbox": [ + 105, + 72, + 506, + 85 + ], + "spans": [ + { + "bbox": [ + 105, + 72, + 506, + 85 + ], + "score": 1.0, + "content": "Remark 5.2. Our analysis relies on the technical assumption that all devices respond in the first", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 84, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 84, + 505, + 95 + ], + "score": 1.0, + "content": "round. Intuitively, this is because we need at least one valid stochastic gradient evaluation for each", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 94, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 104, + 94, + 506, + 107 + ], + "score": 1.0, + "content": "device to get a complete picture of the global objective, or otherwise any update would be biased. In", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 104, + 105, + 506, + 119 + ], + "spans": [ + { + "bbox": [ + 104, + 105, + 405, + 119 + ], + "score": 1.0, + "content": "practice, this can be achieved by waiting for the updates from all devices on", + "type": "text" + }, + { + "bbox": [ + 406, + 108, + 418, + 117 + ], + "score": 0.84, + "content": "w _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 105, + 506, + 119 + ], + "score": 1.0, + "content": "at the very beginning.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5, + "bbox_fs": [ + 104, + 72, + 506, + 119 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 130, + 305, + 143 + ], + "lines": [ + { + "bbox": [ + 105, + 128, + 305, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 305, + 145 + ], + "score": 1.0, + "content": "5.1 Case Study: i.i.d. Bernoulli participation", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 150, + 505, + 228 + ], + "lines": [ + { + "bbox": [ + 105, + 150, + 506, + 165 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 506, + 165 + ], + "score": 1.0, + "content": "Though our algorithm can be applied to non-stationary and non-independent response patterns, we", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 161, + 505, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 161, + 505, + 174 + ], + "score": 1.0, + "content": "show in this subsection that even in the simple i.i.d. Bernoulli participation scenario our algorithm", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 173, + 505, + 185 + ], + "spans": [ + { + "bbox": [ + 106, + 173, + 505, + 185 + ], + "score": 1.0, + "content": "can achieve considerable improvement compared to known algorithms. In particular, we consider", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 104, + 183, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 104, + 183, + 441, + 196 + ], + "score": 1.0, + "content": "a setup where each device becomes active independently with a fixed probability", + "type": "text" + }, + { + "bbox": [ + 441, + 185, + 451, + 195 + ], + "score": 0.84, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 183, + 505, + 196 + ], + "score": 1.0, + "content": ". It serves as", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 194, + 506, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 506, + 208 + ], + "score": 1.0, + "content": "the first motivating example towards modeling the participation patterns of devices, and provides a", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 204, + 506, + 219 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 506, + 219 + ], + "score": 1.0, + "content": "clean view of how the heterogeneity of the device participation influences the Federated optimization", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 216, + 155, + 230 + ], + "spans": [ + { + "bbox": [ + 105, + 216, + 155, + 230 + ], + "score": 1.0, + "content": "algorithms.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 8, + "bbox_fs": [ + 104, + 150, + 506, + 230 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 232, + 505, + 277 + ], + "lines": [ + { + "bbox": [ + 105, + 231, + 505, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 505, + 245 + ], + "score": 1.0, + "content": "We will show that in this scenario, Assumption 4 holds with high probability, and the terms involving", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 244, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 189, + 255 + ], + "score": 1.0, + "content": "the inactive rounds", + "type": "text" + }, + { + "bbox": [ + 189, + 244, + 215, + 255 + ], + "score": 0.93, + "content": "\\tau ( t , i )", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 244, + 505, + 255 + ], + "score": 1.0, + "content": "in Theorem 5.1 can also be bounded. Furthermore, we theoretically", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 254, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 449, + 268 + ], + "score": 1.0, + "content": "demonstrate that algorithms such as FedAvg [28] and SCAFFOLD [18], which sample", + "type": "text" + }, + { + "bbox": [ + 449, + 255, + 457, + 264 + ], + "score": 0.79, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 254, + 506, + 268 + ], + "score": 1.0, + "content": "devices for", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 266, + 380, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 380, + 278 + ], + "score": 1.0, + "content": "each global update, are more prone to stragglers than our algorithm.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 231, + 506, + 278 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 280, + 505, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 280, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 252, + 294 + ], + "score": 1.0, + "content": "Definition 5.2. Assume that for all", + "type": "text" + }, + { + "bbox": [ + 253, + 280, + 285, + 293 + ], + "score": 0.91, + "content": "i \\in [ N ]", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 280, + 475, + 294 + ], + "score": 1.0, + "content": ", the i-th device is assigned with a probability", + "type": "text" + }, + { + "bbox": [ + 475, + 282, + 484, + 292 + ], + "score": 0.83, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 280, + 505, + 294 + ], + "score": 1.0, + "content": ". We", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 291, + 505, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 505, + 304 + ], + "score": 1.0, + "content": "say the participation of the devices follows i.i.d. Bernoulli participation model with participation", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 303, + 506, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 159, + 316 + ], + "score": 1.0, + "content": "probabilities", + "type": "text" + }, + { + "bbox": [ + 159, + 303, + 178, + 315 + ], + "score": 0.89, + "content": "\\{ p _ { i } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 303, + 435, + 316 + ], + "score": 1.0, + "content": ", if (1). at the first round, all devices are active, and (2). at round", + "type": "text" + }, + { + "bbox": [ + 436, + 303, + 458, + 313 + ], + "score": 0.88, + "content": "t > 1", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 303, + 490, + 316 + ], + "score": 1.0, + "content": ", device", + "type": "text" + }, + { + "bbox": [ + 490, + 303, + 495, + 312 + ], + "score": 0.56, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 303, + 506, + 316 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 314, + 428, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 314, + 198, + 326 + ], + "score": 1.0, + "content": "active with probability", + "type": "text" + }, + { + "bbox": [ + 199, + 315, + 208, + 325 + ], + "score": 0.85, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 314, + 428, + 326 + ], + "score": 1.0, + "content": ", which is independent of the history and other devices.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 280, + 506, + 326 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 333, + 503, + 357 + ], + "lines": [ + { + "bbox": [ + 105, + 333, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 333, + 479, + 348 + ], + "score": 1.0, + "content": "Next theorem shows that under i.i.d. Bernoulli participation scenario, with high probability,", + "type": "text" + }, + { + "bbox": [ + 479, + 334, + 505, + 346 + ], + "score": 0.92, + "content": "\\tau ( t , i )", + "type": "inline_equation" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 344, + 434, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 226, + 357 + ], + "score": 1.0, + "content": "only grows logarithmically in", + "type": "text" + }, + { + "bbox": [ + 227, + 346, + 232, + 355 + ], + "score": 0.61, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 344, + 420, + 357 + ], + "score": 1.0, + "content": ". Also Assumption 4 holds for a mild choice of", + "type": "text" + }, + { + "bbox": [ + 421, + 346, + 430, + 356 + ], + "score": 0.86, + "content": "t _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 344, + 434, + 357 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 333, + 505, + 357 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 360, + 505, + 383 + ], + "lines": [ + { + "bbox": [ + 106, + 360, + 506, + 373 + ], + "spans": [ + { + "bbox": [ + 106, + 360, + 478, + 373 + ], + "score": 1.0, + "content": "Theorem 5.2. For i.i.d. Bernoulli participation model defined in Definition 5.2, given any", + "type": "text" + }, + { + "bbox": [ + 478, + 360, + 502, + 371 + ], + "score": 0.89, + "content": "\\delta > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 360, + 506, + 373 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 370, + 507, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 203, + 385 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 203, + 371, + 226, + 382 + ], + "score": 0.86, + "content": "1 - \\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 370, + 369, + 385 + ], + "score": 1.0, + "content": ", we have the following holds for all", + "type": "text" + }, + { + "bbox": [ + 369, + 372, + 392, + 382 + ], + "score": 0.9, + "content": "t \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 370, + 410, + 385 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 411, + 371, + 442, + 383 + ], + "score": 0.92, + "content": "i \\in [ N ]", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 370, + 507, + 385 + ], + "score": 1.0, + "content": "simultaneously,", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 360, + 507, + 385 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 234, + 388, + 376, + 414 + ], + "lines": [ + { + "bbox": [ + 234, + 388, + 376, + 414 + ], + "spans": [ + { + "bbox": [ + 234, + 388, + 376, + 414 + ], + "score": 0.93, + "content": "\\tau ( t , i ) \\leq \\mathcal { O } \\Big ( \\frac { 1 } { p _ { i } } ( \\log ( N t / \\delta ) + 1 ) \\Big ) .", + "type": "interline_equation", + "image_path": "39aa0a52372df38b6d9e71e222db332e84efa7cdb81235ae00a0fb9752de5e1b.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 234, + 388, + 376, + 414 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 420, + 505, + 452 + ], + "lines": [ + { + "bbox": [ + 104, + 420, + 506, + 440 + ], + "spans": [ + { + "bbox": [ + 104, + 422, + 160, + 437 + ], + "score": 1.0, + "content": "Furthermore,", + "type": "text" + }, + { + "bbox": [ + 161, + 425, + 172, + 435 + ], + "score": 0.39, + "content": "( l )", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 422, + 225, + 437 + ], + "score": 1.0, + "content": ". Assumption", + "type": "text" + }, + { + "bbox": [ + 225, + 425, + 232, + 434 + ], + "score": 0.29, + "content": "^ { 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 422, + 277, + 437 + ], + "score": 1.0, + "content": "holds true", + "type": "text" + }, + { + "bbox": [ + 277, + 420, + 384, + 440 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\mathrm { \\ddot { \\it f } } t _ { 0 } = \\Omega \\bigg ( \\frac { 1 } { p _ { m i n } } \\log \\frac { b N } { p _ { m i n } \\delta } \\bigg ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 422, + 414, + 438 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 415, + 424, + 484, + 436 + ], + "score": 0.91, + "content": "p _ { m i n } = \\operatorname* { m i n } \\{ p _ { i } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 422, + 506, + 438 + ], + "score": 1.0, + "content": ", and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 107, + 437, + 325, + 453 + ], + "spans": [ + { + "bbox": [ + 107, + 438, + 171, + 452 + ], + "score": 0.87, + "content": "b = 4 0 ( L / \\mu ) ^ { 1 . 5 }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 437, + 190, + 453 + ], + "score": 1.0, + "content": ";(2).", + "type": "text" + }, + { + "bbox": [ + 191, + 441, + 220, + 452 + ], + "score": 0.88, + "content": "\\tau _ { \\operatorname* { m a x } , T }", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 437, + 325, + 453 + ], + "score": 1.0, + "content": "can be upper bounded as", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 104, + 420, + 506, + 453 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 220, + 457, + 390, + 483 + ], + "lines": [ + { + "bbox": [ + 220, + 457, + 390, + 483 + ], + "spans": [ + { + "bbox": [ + 220, + 457, + 390, + 483 + ], + "score": 0.93, + "content": "\\tau _ { \\operatorname* { m a x } , T } \\leq \\mathcal { O } \\Big ( \\frac { 1 } { p _ { m i n } } \\cdot \\big ( \\log ( T N / \\delta ) + 1 \\big ) \\Big ) .", + "type": "interline_equation", + "image_path": "922e99211cb7c2d1fd2b59ad614767b49e2270e68185e6f77ea7f51093a5ac80.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 220, + 457, + 390, + 483 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 493, + 371, + 506 + ], + "lines": [ + { + "bbox": [ + 105, + 492, + 372, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 355, + 508 + ], + "score": 1.0, + "content": "The next theorem provides a high probability upper bound for", + "type": "text" + }, + { + "bbox": [ + 356, + 495, + 367, + 505 + ], + "score": 0.88, + "content": "\\bar { \\tau } _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 492, + 372, + 508 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 492, + 372, + 508 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 509, + 505, + 532 + ], + "lines": [ + { + "bbox": [ + 106, + 509, + 506, + 522 + ], + "spans": [ + { + "bbox": [ + 106, + 509, + 462, + 522 + ], + "score": 1.0, + "content": "Theorem 5.3. For i.i.d. Bernoulli participation model defined in Definition 5.2, given any", + "type": "text" + }, + { + "bbox": [ + 462, + 509, + 487, + 520 + ], + "score": 0.89, + "content": "\\delta > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 509, + 506, + 522 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 520, + 297, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 520, + 133, + 531 + ], + "score": 0.88, + "content": "T > 1", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 520, + 234, + 533 + ], + "score": 1.0, + "content": ", with probability at least", + "type": "text" + }, + { + "bbox": [ + 235, + 520, + 257, + 531 + ], + "score": 0.88, + "content": "1 - \\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 520, + 297, + 533 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 106, + 509, + 506, + 533 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 537, + 379, + 572 + ], + "lines": [ + { + "bbox": [ + 231, + 537, + 379, + 572 + ], + "spans": [ + { + "bbox": [ + 231, + 537, + 379, + 572 + ], + "score": 0.94, + "content": "\\bar { \\tau } _ { T } \\leq \\Big ( \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\frac { 1 } { p _ { i } } \\Big ) \\cdot \\mathcal { O } \\Big ( 1 + \\log \\frac { 1 } { \\delta } \\Big ) .", + "type": "interline_equation", + "image_path": "79e3a5996cb3f7b4c46ca91911907e624b79420e705c6142b9338d5386fc6e5b.jpg" + } + ] + } + ], + "index": 31.5, + "virtual_lines": [ + { + "bbox": [ + 231, + 537, + 379, + 554.5 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 231, + 554.5, + 379, + 572.0 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 582, + 505, + 622 + ], + "lines": [ + { + "bbox": [ + 105, + 581, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 505, + 595 + ], + "score": 1.0, + "content": "By Theorem 5.2 and Theorem 5.3, we conclude that the dominant term of our convergence bound is", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 593, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 107, + 593, + 208, + 613 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\stackrel { \\triangledown } { \\mathcal { O } } \\left( \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\frac { 1 } { p _ { i } } \\cdot \\frac { \\sigma ^ { 2 } } { \\mu N K T } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 595, + 299, + 610 + ], + "score": 1.0, + "content": ". Therefore, to achieve", + "type": "text" + }, + { + "bbox": [ + 300, + 600, + 306, + 607 + ], + "score": 0.74, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 595, + 506, + 610 + ], + "score": 1.0, + "content": "accuracy, the dominant term of the number of the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 611, + 182, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 182, + 623 + ], + "score": 1.0, + "content": "required rounds is", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 581, + 506, + 623 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 232, + 622, + 378, + 656 + ], + "lines": [ + { + "bbox": [ + 232, + 622, + 378, + 656 + ], + "spans": [ + { + "bbox": [ + 232, + 622, + 378, + 656 + ], + "score": 0.95, + "content": "T _ { \\epsilon } ^ { \\left( \\mathrm { M I F A } \\right) } = \\widetilde { \\mathcal { O } } \\Bigl ( \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\frac { 1 } { p _ { i } } \\cdot \\frac { \\sigma ^ { 2 } } { \\mu N K \\epsilon } \\Bigr ) .", + "type": "interline_equation", + "image_path": "d6f389bee97e0f3555558010eb2588b9917d901810a517b05b4f4f415bf814cb.jpg" + } + ] + } + ], + "index": 36.5, + "virtual_lines": [ + { + "bbox": [ + 232, + 622, + 378, + 639.0 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 232, + 639.0, + 378, + 656.0 + ], + "spans": [], + "index": 37 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 658, + 505, + 723 + ], + "lines": [ + { + "bbox": [ + 106, + 659, + 506, + 671 + ], + "spans": [ + { + "bbox": [ + 106, + 659, + 290, + 671 + ], + "score": 1.0, + "content": "For both FedAvg and SCAFFOLD that sample", + "type": "text" + }, + { + "bbox": [ + 290, + 660, + 298, + 669 + ], + "score": 0.82, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 659, + 506, + 671 + ], + "score": 1.0, + "content": "devices uniformly at random, [18] (Thm I. & III.)", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 669, + 506, + 683 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 449, + 683 + ], + "score": 1.0, + "content": "showed that the dominant term of the number of global updates needed to achieve", + "type": "text" + }, + { + "bbox": [ + 449, + 673, + 456, + 680 + ], + "score": 0.58, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 669, + 506, + 683 + ], + "score": 1.0, + "content": "accuracy is", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 107, + 681, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 107, + 681, + 176, + 701 + ], + "score": 0.93, + "content": "\\begin{array} { r } { R _ { \\epsilon } = \\widetilde { \\mathcal { O } } \\left( \\frac { \\sigma ^ { 2 } } { \\mu S K \\epsilon } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 684, + 506, + 698 + ], + "score": 1.0, + "content": ". Notice that in our setting, to accomplish each global update, the server needs to", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 700, + 504, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 700, + 223, + 712 + ], + "score": 1.0, + "content": "wait for a few rounds for the", + "type": "text" + }, + { + "bbox": [ + 224, + 701, + 232, + 710 + ], + "score": 0.79, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 700, + 330, + 712 + ], + "score": 1.0, + "content": "devices to respond. Let", + "type": "text" + }, + { + "bbox": [ + 330, + 702, + 352, + 712 + ], + "score": 0.93, + "content": "T ( S )", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 700, + 504, + 712 + ], + "score": 1.0, + "content": "be the expected rounds for which the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 711, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 711, + 280, + 722 + ], + "score": 1.0, + "content": "server needs to wait for the selected devices", + "type": "text" + }, + { + "bbox": [ + 281, + 713, + 288, + 720 + ], + "score": 0.86, + "content": "\\boldsymbol { S }", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 711, + 504, + 722 + ], + "score": 1.0, + "content": "to be active. Then the expected total rounds to achieve", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 107, + 68, + 508, + 90 + ], + "spans": [ + { + "bbox": [ + 107, + 75, + 112, + 83 + ], + "score": 0.65, + "content": "\\epsilon", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 112, + 68, + 160, + 90 + ], + "score": 1.0, + "content": "accuracy is", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 160, + 73, + 221, + 85 + ], + "score": 0.93, + "content": "R _ { \\epsilon } \\cdot \\mathbb { E } _ { S } \\left[ T ( S ) \\right]", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 221, + 68, + 419, + 90 + ], + "score": 1.0, + "content": ". For i.i.d. Bernoulli participation model, we have", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 420, + 72, + 502, + 87 + ], + "score": 0.94, + "content": "\\begin{array} { r } { T ( S ) \\geq \\frac { 1 } { \\operatorname* { m i n } \\{ p _ { i } | i \\in S \\} } } \\end{array}", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 502, + 68, + 508, + 90 + ], + "score": 1.0, + "content": ",", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 84, + 483, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 87, + 224, + 101 + ], + "score": 1.0, + "content": "and we can further show that", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 225, + 86, + 310, + 102 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathbb { E } _ { S } \\left[ T ( S ) \\right] \\ge \\frac { 1 } { p _ { m i n } } \\frac { S } { N } } \\end{array}", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 272, + 84, + 317, + 106 + ], + "score": 1.0, + "content": "≥ 1p min SN (", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 310, + 87, + 483, + 100 + ], + "score": 1.0, + "content": "see Appendix D.3 for details). Therefore,", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 659, + 506, + 722 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 71, + 507, + 102 + ], + "lines": [ + { + "bbox": [ + 107, + 68, + 508, + 90 + ], + "spans": [ + { + "bbox": [ + 107, + 75, + 112, + 83 + ], + "score": 0.65, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 112, + 68, + 160, + 90 + ], + "score": 1.0, + "content": "accuracy is", + "type": "text" + }, + { + "bbox": [ + 160, + 73, + 221, + 85 + ], + "score": 0.93, + "content": "R _ { \\epsilon } \\cdot \\mathbb { E } _ { S } \\left[ T ( S ) \\right]", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 68, + 419, + 90 + ], + "score": 1.0, + "content": ". For i.i.d. Bernoulli participation model, we have", + "type": "text" + }, + { + "bbox": [ + 420, + 72, + 502, + 87 + ], + "score": 0.94, + "content": "\\begin{array} { r } { T ( S ) \\geq \\frac { 1 } { \\operatorname* { m i n } \\{ p _ { i } | i \\in S \\} } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 68, + 508, + 90 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 84, + 483, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 87, + 224, + 101 + ], + "score": 1.0, + "content": "and we can further show that", + "type": "text" + }, + { + "bbox": [ + 225, + 86, + 310, + 102 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathbb { E } _ { S } \\left[ T ( S ) \\right] \\ge \\frac { 1 } { p _ { m i n } } \\frac { S } { N } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 84, + 317, + 106 + ], + "score": 1.0, + "content": "≥ 1p min SN (", + "type": "text" + }, + { + "bbox": [ + 310, + 87, + 483, + 100 + ], + "score": 1.0, + "content": "see Appendix D.3 for details). Therefore,", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "interline_equation", + "bbox": [ + 164, + 103, + 446, + 130 + ], + "lines": [ + { + "bbox": [ + 164, + 103, + 446, + 130 + ], + "spans": [ + { + "bbox": [ + 164, + 103, + 446, + 130 + ], + "score": 0.93, + "content": "\\mathbb { E } \\left[ T _ { \\epsilon } ^ { ( \\mathsf { F e d A v g , S C A F F O L D } ) } \\right] \\geq \\frac { S } { N } \\frac { 1 } { p _ { m i n } } \\widetilde { \\mathcal { O } } \\Big ( \\frac { \\sigma ^ { 2 } } { \\mu S K \\epsilon } \\Big ) = \\widetilde { \\mathcal { O } } \\Big ( \\frac { 1 } { p _ { m i n } } \\cdot \\frac { \\sigma ^ { 2 } } { \\mu N K \\epsilon } \\Big ) .", + "type": "interline_equation", + "image_path": "4ba801327622edadc3d535bd6d82d30aa8d7d969b43ccdf1e9db7ea55271f48d.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 164, + 103, + 446, + 130 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 131, + 505, + 176 + ], + "lines": [ + { + "bbox": [ + 106, + 131, + 505, + 143 + ], + "spans": [ + { + "bbox": [ + 106, + 131, + 505, + 143 + ], + "score": 1.0, + "content": "By comparing Eqn. 2 and Eqn. 3, we see that both FedAvg and SCAFFOLD are more vulnerable", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 142, + 505, + 154 + ], + "spans": [ + { + "bbox": [ + 106, + 142, + 505, + 154 + ], + "score": 1.0, + "content": "to stragglers, that is, the devices with very small participation probabilities; on the contrary, the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 153, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 339, + 165 + ], + "score": 1.0, + "content": "convergence rate of MIFA only depends on the average of", + "type": "text" + }, + { + "bbox": [ + 339, + 153, + 358, + 164 + ], + "score": 0.92, + "content": "1 / p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 153, + 402, + 165 + ], + "score": 1.0, + "content": "instead of", + "type": "text" + }, + { + "bbox": [ + 402, + 153, + 433, + 164 + ], + "score": 0.92, + "content": "1 / p _ { m i n }", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 153, + 505, + 165 + ], + "score": 1.0, + "content": ". We also provide", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 164, + 448, + 176 + ], + "spans": [ + { + "bbox": [ + 105, + 164, + 448, + 176 + ], + "score": 1.0, + "content": "empirical experiments showing that MIFA converges faster than FedAvg in Section 7.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + }, + { + "type": "title", + "bbox": [ + 106, + 189, + 402, + 203 + ], + "lines": [ + { + "bbox": [ + 105, + 188, + 403, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 188, + 403, + 207 + ], + "score": 1.0, + "content": "6 Convergence result for non-convex objective functions", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 213, + 504, + 236 + ], + "lines": [ + { + "bbox": [ + 106, + 213, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 106, + 213, + 505, + 226 + ], + "score": 1.0, + "content": "In this section, we present the convergence guarantee of MIFA for the non-convex case. First we list", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 224, + 254, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 224, + 254, + 237 + ], + "score": 1.0, + "content": "the additional assumptions as below.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 108, + 237, + 505, + 261 + ], + "lines": [ + { + "bbox": [ + 106, + 237, + 502, + 251 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 259, + 251 + ], + "score": 1.0, + "content": "Assumption 5 (Hessian Lipschitz).", + "type": "text" + }, + { + "bbox": [ + 260, + 238, + 307, + 250 + ], + "score": 0.91, + "content": "f _ { 1 } , \\cdots , f _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 237, + 342, + 251 + ], + "score": 1.0, + "content": "are all", + "type": "text" + }, + { + "bbox": [ + 342, + 240, + 349, + 250 + ], + "score": 0.8, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 237, + 465, + 251 + ], + "score": 1.0, + "content": "-Hessian Lipschitz: for all", + "type": "text" + }, + { + "bbox": [ + 465, + 240, + 474, + 248 + ], + "score": 0.61, + "content": "w", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 237, + 496, + 251 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 497, + 240, + 502, + 248 + ], + "score": 0.55, + "content": "v", + "type": "inline_equation" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 247, + 259, + 262 + ], + "spans": [ + { + "bbox": [ + 107, + 248, + 255, + 262 + ], + "score": 0.91, + "content": "\\bigl \\| \\nabla ^ { 2 } f _ { i } \\bigl ( \\tilde { \\boldsymbol { w } } \\bigr ) - \\nabla ^ { 2 } f _ { i } ( \\boldsymbol { v } ) \\bigr \\| \\leq \\dot { \\rho } \\bigl \\| \\boldsymbol { w } - \\boldsymbol { \\tilde { v } } \\bigr \\|", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 247, + 259, + 262 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 106, + 262, + 504, + 292 + ], + "lines": [ + { + "bbox": [ + 106, + 261, + 504, + 276 + ], + "spans": [ + { + "bbox": [ + 106, + 261, + 497, + 276 + ], + "score": 1.0, + "content": "Assumption 6 (Bounded noise). The noise of the local stochastic gradients is upper bounded by", + "type": "text" + }, + { + "bbox": [ + 498, + 264, + 504, + 272 + ], + "score": 0.36, + "content": "a", + "type": "inline_equation" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 273, + 380, + 293 + ], + "spans": [ + { + "bbox": [ + 104, + 273, + 142, + 293 + ], + "score": 1.0, + "content": "constant", + "type": "text" + }, + { + "bbox": [ + 143, + 277, + 149, + 286 + ], + "score": 0.37, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 273, + 209, + 293 + ], + "score": 1.0, + "content": "almost surely:", + "type": "text" + }, + { + "bbox": [ + 210, + 273, + 373, + 293 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\left\\| \\tilde { \\nabla } f _ { i } ( w ) - \\nabla f _ { i } ( w ) \\right\\| \\le \\delta a . s . , \\forall i \\in [ N ] } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 273, + 380, + 293 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 106, + 293, + 504, + 319 + ], + "lines": [ + { + "bbox": [ + 102, + 293, + 504, + 325 + ], + "spans": [ + { + "bbox": [ + 102, + 293, + 124, + 325 + ], + "score": 1.0, + "content": "Assand", + "type": "text" + }, + { + "bbox": [ + 294, + 293, + 353, + 325 + ], + "score": 1.0, + "content": "y). There exist . Furthermore,", + "type": "text" + }, + { + "bbox": [ + 354, + 294, + 380, + 304 + ], + "score": 0.89, + "content": "\\alpha > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 293, + 394, + 325 + ], + "score": 1.0, + "content": "anfine", + "type": "text" + }, + { + "bbox": [ + 399, + 294, + 427, + 305 + ], + "score": 0.91, + "content": "\\beta _ { i } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 461, + 293, + 495, + 325 + ], + "score": 1.0, + "content": "at for all .", + "type": "text" + }, + { + "bbox": [ + 495, + 295, + 504, + 303 + ], + "score": 0.57, + "content": "w", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 128, + 304, + 460, + 319 + ], + "spans": [ + { + "bbox": [ + 128, + 304, + 294, + 319 + ], + "score": 0.93, + "content": "\\in [ N ] \\colon \\left\\| \\nabla f _ { i } ( w ) \\right\\| ^ { 2 } \\leq \\alpha \\left\\| \\nabla f ( w ) \\right\\| ^ { 2 } + \\beta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 304, + 460, + 319 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\beta = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\beta _ { i } } \\end{array}", + "type": "inline_equation" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 106, + 320, + 503, + 347 + ], + "lines": [ + { + "bbox": [ + 105, + 318, + 502, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 274, + 333 + ], + "score": 1.0, + "content": "Assumption 8. There exists a constant", + "type": "text" + }, + { + "bbox": [ + 275, + 322, + 284, + 331 + ], + "score": 0.83, + "content": "\\nu _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 318, + 329, + 333 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 329, + 319, + 381, + 332 + ], + "score": 0.91, + "content": "\\tau ( t , i ) \\ \\leq \\ \\nu _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 318, + 416, + 333 + ], + "score": 1.0, + "content": ", for all", + "type": "text" + }, + { + "bbox": [ + 417, + 320, + 453, + 332 + ], + "score": 0.9, + "content": "i \\in [ N ]", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 318, + 474, + 333 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 475, + 320, + 502, + 331 + ], + "score": 0.88, + "content": "t \\geq 1", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 330, + 360, + 349 + ], + "spans": [ + { + "bbox": [ + 104, + 330, + 360, + 349 + ], + "score": 1.0, + "content": "Furthermore, define ν¯ = 1N PNi=1 νi and νmax = maxi∈[N] νi.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 106, + 351, + 505, + 417 + ], + "lines": [ + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "score": 1.0, + "content": "The analysis of non-convex functions is much more technically involved, and our results rely on", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 362, + 506, + 376 + ], + "spans": [ + { + "bbox": [ + 104, + 362, + 506, + 376 + ], + "score": 1.0, + "content": "strong assumptions that provide a finer control of the gradient difference (Assumption 5), gradient", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 374, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 505, + 386 + ], + "score": 1.0, + "content": "noise (Assumption 6), gradient dissimilarity among devices (Assumption 7), and device unavailability", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "score": 1.0, + "content": "(Assumption 8). We remark that Assumption 5 is also made in [9, 16], and Assumption 7 is also made", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 394, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 506, + 408 + ], + "score": 1.0, + "content": "in [18, 39]. We leave it as future work to study whether and how MIFA converges for non-convex", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 405, + 252, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 252, + 419 + ], + "score": 1.0, + "content": "functions with weaker assumptions.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 106, + 419, + 506, + 471 + ], + "lines": [ + { + "bbox": [ + 106, + 419, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 277, + 432 + ], + "score": 1.0, + "content": "Theorem 6.1. Assume that Assumptions", + "type": "text" + }, + { + "bbox": [ + 277, + 420, + 295, + 430 + ], + "score": 0.28, + "content": "I , ~ 2 , ~", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 419, + 318, + 432 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 318, + 420, + 325, + 429 + ], + "score": 0.39, + "content": "^ { 5 }", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 419, + 505, + 432 + ], + "score": 1.0, + "content": "to 7 hold. Further assume that the device", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 429, + 504, + 444 + ], + "spans": [ + { + "bbox": [ + 104, + 429, + 196, + 444 + ], + "score": 1.0, + "content": "availability sequence", + "type": "text" + }, + { + "bbox": [ + 197, + 431, + 222, + 442 + ], + "score": 0.9, + "content": "\\tau ( t , i )", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 429, + 338, + 444 + ], + "score": 1.0, + "content": "satisfies Assumption 8 and", + "type": "text" + }, + { + "bbox": [ + 338, + 430, + 386, + 443 + ], + "score": 0.92, + "content": "\\tau ( 1 , i ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 429, + 417, + 444 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 417, + 430, + 451, + 442 + ], + "score": 0.9, + "content": "i \\in [ N ]", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 429, + 497, + 444 + ], + "score": 1.0, + "content": ". By using", + "type": "text" + }, + { + "bbox": [ + 497, + 433, + 504, + 441 + ], + "score": 0.48, + "content": "a", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 440, + 506, + 462 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 192, + 459 + ], + "score": 1.0, + "content": "learning rate η = q", + "type": "text" + }, + { + "bbox": [ + 163, + 443, + 234, + 462 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\eta = \\sqrt { \\frac { N } { K T L \\left( 1 + \\bar { \\nu } \\right) } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 188, + 442, + 386, + 461 + ], + "score": 1.0, + "content": "NKT L(1+¯ν), for T ≥ max{32αLNK, 16LNK", + "type": "text" + }, + { + "bbox": [ + 377, + 440, + 506, + 458 + ], + "score": 1.0, + "content": ", 8KNν2max(L2+ρδ) }, after T − 1", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 460, + 263, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 460, + 263, + 471 + ], + "score": 1.0, + "content": "communication rounds, MIFA satisfies:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 25.5 + }, + { + "type": "interline_equation", + "bbox": [ + 145, + 473, + 465, + 506 + ], + "lines": [ + { + "bbox": [ + 145, + 473, + 465, + 506 + ], + "spans": [ + { + "bbox": [ + 145, + 473, + 465, + 506 + ], + "score": 0.91, + "content": "\\operatorname* { m i n } _ { 1 \\leq t \\leq T } \\mathbb { E } _ { \\xi } \\left[ \\left\\| \\nabla f ( w _ { t } ) \\right\\| ^ { 2 } \\right] = \\mathcal { O } \\left( \\sqrt { \\frac { ( 1 + \\bar { \\nu } ) L } { T K N } } ( f ( w _ { 1 } ) - f ^ { * } + \\sigma ^ { 2 } ) + \\frac { A _ { 4 } + A _ { 5 } } { T } \\right) ,", + "type": "interline_equation", + "image_path": "2ffd78cf10bfd3d236632f49cd6b6cd64bc3d08d3e2f60866f445ed97510c80b.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 145, + 473, + 465, + 484.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 145, + 484.0, + 465, + 495.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 145, + 495.0, + 465, + 506.0 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 507, + 249, + 519 + ], + "lines": [ + { + "bbox": [ + 106, + 506, + 249, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 133, + 519 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 507, + 144, + 519 + ], + "score": 0.87, + "content": "f ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 506, + 249, + 519 + ], + "score": 1.0, + "content": "is the optimal value, and:", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "interline_equation", + "bbox": [ + 165, + 520, + 445, + 576 + ], + "lines": [ + { + "bbox": [ + 165, + 520, + 445, + 576 + ], + "spans": [ + { + "bbox": [ + 165, + 520, + 445, + 576 + ], + "score": 0.92, + "content": "\\begin{array} { l } { { A _ { 4 } = N K L \\left( \\alpha \\sigma ^ { 2 } \\hat { \\nu } + \\frac { \\sigma ^ { 2 } \\nu _ { \\mathrm { m a x } } } { \\sqrt { K N } } + \\sigma \\nu _ { \\mathrm { m a x } } \\sqrt { \\beta } \\right) + \\frac { { ( L ^ { 2 } + \\rho \\delta ) \\sigma ^ { 2 } \\nu _ { \\mathrm { m a x } } } } { L } , } } \\\\ { { A _ { 5 } = \\frac { { ( K - 1 ) N L ( \\beta + \\sigma ^ { 2 } / K ) } } { \\hat { \\nu } + 1 } . } } \\end{array}", + "type": "interline_equation", + "image_path": "068374b3ecfcb8e112e697b4b2961eec732c2ae914494131485a106df94ed394.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 165, + 520, + 445, + 538.6666666666666 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 165, + 538.6666666666666, + 445, + 557.3333333333333 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 165, + 557.3333333333333, + 445, + 575.9999999999999 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 581, + 505, + 595 + ], + "lines": [ + { + "bbox": [ + 105, + 580, + 507, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 580, + 228, + 597 + ], + "score": 1.0, + "content": "Next, we show that the leading", + "type": "text" + }, + { + "bbox": [ + 229, + 581, + 271, + 595 + ], + "score": 0.94, + "content": "\\mathcal { O } ( 1 / \\sqrt { T } )", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 580, + 507, + 597 + ], + "score": 1.0, + "content": "term is theoretically optimal for zero-respecting algorithms.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 106, + 596, + 505, + 630 + ], + "lines": [ + { + "bbox": [ + 105, + 595, + 506, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 192, + 608 + ], + "score": 1.0, + "content": "Proposition 6.1. Let", + "type": "text" + }, + { + "bbox": [ + 193, + 596, + 221, + 607 + ], + "score": 0.9, + "content": "c _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 595, + 506, + 608 + ], + "score": 1.0, + "content": "be a universal constant. For any randomized zero-respecting algorithm,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 607, + 505, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 505, + 620 + ], + "score": 1.0, + "content": "there exists a stochastic non-convex problem satisfying Assumption1, 2, 5 and 7, such that the output", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 107, + 618, + 443, + 631 + ], + "spans": [ + { + "bbox": [ + 107, + 619, + 121, + 629 + ], + "score": 0.78, + "content": "w _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 121, + 618, + 144, + 631 + ], + "score": 1.0, + "content": "after", + "type": "text" + }, + { + "bbox": [ + 144, + 619, + 151, + 628 + ], + "score": 0.66, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 618, + 443, + 631 + ], + "score": 1.0, + "content": "rounds of communication has expected sub-optimality lower bounded by", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37 + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 631, + 433, + 658 + ], + "lines": [ + { + "bbox": [ + 177, + 631, + 433, + 658 + ], + "spans": [ + { + "bbox": [ + 177, + 631, + 433, + 658 + ], + "score": 0.9, + "content": "\\mathbb { E } [ \\| \\nabla f ( w _ { T } ) \\| ^ { 2 } ] \\ge \\mathbb { E } [ \\| \\nabla f ( w _ { T } ) \\| ] ^ { 2 } \\ge c _ { 0 } \\sqrt { \\frac { \\bar { \\nu } L \\sigma ^ { 2 } ( f ( w _ { 0 } ) - f ^ { * } ) } { N K T } } .", + "type": "interline_equation", + "image_path": "ca9299cdc027e71b6e299a9e1e31a7cd5c2809df369d439bba1b7aba2e00a1ef.jpg" + } + ] + } + ], + "index": 39, + "virtual_lines": [ + { + "bbox": [ + 177, + 631, + 433, + 658 + ], + "spans": [], + "index": 39 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 666, + 505, + 723 + ], + "lines": [ + { + "bbox": [ + 105, + 666, + 506, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 273, + 681 + ], + "score": 1.0, + "content": "The above proposition show that when", + "type": "text" + }, + { + "bbox": [ + 273, + 666, + 446, + 680 + ], + "score": 0.92, + "content": "\\sigma \\sqrt { ( f ( w _ { 0 } ) - f ^ { * } ) } \\sim \\sigma ^ { 2 } + ( f ( w _ { 0 } ) - f ^ { * } )", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 666, + 506, + 681 + ], + "score": 1.0, + "content": ", the result in", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 677, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 487, + 690 + ], + "score": 1.0, + "content": "Theorem 6.1 is tight. However, note that the counter example we used requires the quantity", + "type": "text" + }, + { + "bbox": [ + 487, + 678, + 493, + 688 + ], + "score": 0.77, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 677, + 505, + 690 + ], + "score": 1.0, + "content": "in", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 689, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 106, + 689, + 223, + 701 + ], + "score": 1.0, + "content": "Assumption 6 to scale with", + "type": "text" + }, + { + "bbox": [ + 223, + 690, + 232, + 699 + ], + "score": 0.81, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 689, + 304, + 701 + ], + "score": 1.0, + "content": ", hence requiring", + "type": "text" + }, + { + "bbox": [ + 304, + 689, + 311, + 699 + ], + "score": 0.81, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 689, + 505, + 701 + ], + "score": 1.0, + "content": "to be large enough. This does not change the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 699, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 357, + 713 + ], + "score": 1.0, + "content": "optimality of the first term as the first term is independent of", + "type": "text" + }, + { + "bbox": [ + 358, + 700, + 363, + 710 + ], + "score": 0.79, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 699, + 506, + 713 + ], + "score": 1.0, + "content": ". Whether this requirement can be", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 710, + 245, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 245, + 723 + ], + "score": 1.0, + "content": "relaxed is left as an open problem.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 741, + 309, + 750 + ], + "lines": [ + { + "bbox": [ + 302, + 740, + 309, + 752 + ], + "spans": [ + { + "bbox": [ + 302, + 740, + 309, + 752 + ], + "score": 1.0, + "content": "8", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 71, + 507, + 102 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 68, + 508, + 106 + ], + "lines_deleted": true + }, + { + "type": "interline_equation", + "bbox": [ + 164, + 103, + 446, + 130 + ], + "lines": [ + { + "bbox": [ + 164, + 103, + 446, + 130 + ], + "spans": [ + { + "bbox": [ + 164, + 103, + 446, + 130 + ], + "score": 0.93, + "content": "\\mathbb { E } \\left[ T _ { \\epsilon } ^ { ( \\mathsf { F e d A v g , S C A F F O L D } ) } \\right] \\geq \\frac { S } { N } \\frac { 1 } { p _ { m i n } } \\widetilde { \\mathcal { O } } \\Big ( \\frac { \\sigma ^ { 2 } } { \\mu S K \\epsilon } \\Big ) = \\widetilde { \\mathcal { O } } \\Big ( \\frac { 1 } { p _ { m i n } } \\cdot \\frac { \\sigma ^ { 2 } } { \\mu N K \\epsilon } \\Big ) .", + "type": "interline_equation", + "image_path": "4ba801327622edadc3d535bd6d82d30aa8d7d969b43ccdf1e9db7ea55271f48d.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 164, + 103, + 446, + 130 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 131, + 505, + 176 + ], + "lines": [ + { + "bbox": [ + 106, + 131, + 505, + 143 + ], + "spans": [ + { + "bbox": [ + 106, + 131, + 505, + 143 + ], + "score": 1.0, + "content": "By comparing Eqn. 2 and Eqn. 3, we see that both FedAvg and SCAFFOLD are more vulnerable", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 142, + 505, + 154 + ], + "spans": [ + { + "bbox": [ + 106, + 142, + 505, + 154 + ], + "score": 1.0, + "content": "to stragglers, that is, the devices with very small participation probabilities; on the contrary, the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 153, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 339, + 165 + ], + "score": 1.0, + "content": "convergence rate of MIFA only depends on the average of", + "type": "text" + }, + { + "bbox": [ + 339, + 153, + 358, + 164 + ], + "score": 0.92, + "content": "1 / p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 153, + 402, + 165 + ], + "score": 1.0, + "content": "instead of", + "type": "text" + }, + { + "bbox": [ + 402, + 153, + 433, + 164 + ], + "score": 0.92, + "content": "1 / p _ { m i n }", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 153, + 505, + 165 + ], + "score": 1.0, + "content": ". We also provide", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 164, + 448, + 176 + ], + "spans": [ + { + "bbox": [ + 105, + 164, + 448, + 176 + ], + "score": 1.0, + "content": "empirical experiments showing that MIFA converges faster than FedAvg in Section 7.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 131, + 505, + 176 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 189, + 402, + 203 + ], + "lines": [ + { + "bbox": [ + 105, + 188, + 403, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 188, + 403, + 207 + ], + "score": 1.0, + "content": "6 Convergence result for non-convex objective functions", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 213, + 504, + 236 + ], + "lines": [ + { + "bbox": [ + 106, + 213, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 106, + 213, + 505, + 226 + ], + "score": 1.0, + "content": "In this section, we present the convergence guarantee of MIFA for the non-convex case. First we list", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 224, + 254, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 224, + 254, + 237 + ], + "score": 1.0, + "content": "the additional assumptions as below.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 106, + 213, + 505, + 237 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 237, + 505, + 261 + ], + "lines": [ + { + "bbox": [ + 106, + 237, + 502, + 251 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 259, + 251 + ], + "score": 1.0, + "content": "Assumption 5 (Hessian Lipschitz).", + "type": "text" + }, + { + "bbox": [ + 260, + 238, + 307, + 250 + ], + "score": 0.91, + "content": "f _ { 1 } , \\cdots , f _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 237, + 342, + 251 + ], + "score": 1.0, + "content": "are all", + "type": "text" + }, + { + "bbox": [ + 342, + 240, + 349, + 250 + ], + "score": 0.8, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 237, + 465, + 251 + ], + "score": 1.0, + "content": "-Hessian Lipschitz: for all", + "type": "text" + }, + { + "bbox": [ + 465, + 240, + 474, + 248 + ], + "score": 0.61, + "content": "w", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 237, + 496, + 251 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 497, + 240, + 502, + 248 + ], + "score": 0.55, + "content": "v", + "type": "inline_equation" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 247, + 259, + 262 + ], + "spans": [ + { + "bbox": [ + 107, + 248, + 255, + 262 + ], + "score": 0.91, + "content": "\\bigl \\| \\nabla ^ { 2 } f _ { i } \\bigl ( \\tilde { \\boldsymbol { w } } \\bigr ) - \\nabla ^ { 2 } f _ { i } ( \\boldsymbol { v } ) \\bigr \\| \\leq \\dot { \\rho } \\bigl \\| \\boldsymbol { w } - \\boldsymbol { \\tilde { v } } \\bigr \\|", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 247, + 259, + 262 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 106, + 237, + 502, + 262 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 262, + 504, + 292 + ], + "lines": [ + { + "bbox": [ + 106, + 261, + 504, + 276 + ], + "spans": [ + { + "bbox": [ + 106, + 261, + 497, + 276 + ], + "score": 1.0, + "content": "Assumption 6 (Bounded noise). The noise of the local stochastic gradients is upper bounded by", + "type": "text" + }, + { + "bbox": [ + 498, + 264, + 504, + 272 + ], + "score": 0.36, + "content": "a", + "type": "inline_equation" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 273, + 380, + 293 + ], + "spans": [ + { + "bbox": [ + 104, + 273, + 142, + 293 + ], + "score": 1.0, + "content": "constant", + "type": "text" + }, + { + "bbox": [ + 143, + 277, + 149, + 286 + ], + "score": 0.37, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 273, + 209, + 293 + ], + "score": 1.0, + "content": "almost surely:", + "type": "text" + }, + { + "bbox": [ + 210, + 273, + 373, + 293 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\left\\| \\tilde { \\nabla } f _ { i } ( w ) - \\nabla f _ { i } ( w ) \\right\\| \\le \\delta a . s . , \\forall i \\in [ N ] } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 273, + 380, + 293 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 104, + 261, + 504, + 293 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 293, + 504, + 319 + ], + "lines": [ + { + "bbox": [ + 102, + 293, + 504, + 325 + ], + "spans": [ + { + "bbox": [ + 102, + 293, + 124, + 325 + ], + "score": 1.0, + "content": "Assand", + "type": "text" + }, + { + "bbox": [ + 294, + 293, + 353, + 325 + ], + "score": 1.0, + "content": "y). There exist . Furthermore,", + "type": "text" + }, + { + "bbox": [ + 354, + 294, + 380, + 304 + ], + "score": 0.89, + "content": "\\alpha > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 293, + 394, + 325 + ], + "score": 1.0, + "content": "anfine", + "type": "text" + }, + { + "bbox": [ + 399, + 294, + 427, + 305 + ], + "score": 0.91, + "content": "\\beta _ { i } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 461, + 293, + 495, + 325 + ], + "score": 1.0, + "content": "at for all .", + "type": "text" + }, + { + "bbox": [ + 495, + 295, + 504, + 303 + ], + "score": 0.57, + "content": "w", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 128, + 304, + 460, + 319 + ], + "spans": [ + { + "bbox": [ + 128, + 304, + 294, + 319 + ], + "score": 0.93, + "content": "\\in [ N ] \\colon \\left\\| \\nabla f _ { i } ( w ) \\right\\| ^ { 2 } \\leq \\alpha \\left\\| \\nabla f ( w ) \\right\\| ^ { 2 } + \\beta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 304, + 460, + 319 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\beta = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\beta _ { i } } \\end{array}", + "type": "inline_equation" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 102, + 293, + 504, + 325 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 320, + 503, + 347 + ], + "lines": [ + { + "bbox": [ + 105, + 318, + 502, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 274, + 333 + ], + "score": 1.0, + "content": "Assumption 8. There exists a constant", + "type": "text" + }, + { + "bbox": [ + 275, + 322, + 284, + 331 + ], + "score": 0.83, + "content": "\\nu _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 318, + 329, + 333 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 329, + 319, + 381, + 332 + ], + "score": 0.91, + "content": "\\tau ( t , i ) \\ \\leq \\ \\nu _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 318, + 416, + 333 + ], + "score": 1.0, + "content": ", for all", + "type": "text" + }, + { + "bbox": [ + 417, + 320, + 453, + 332 + ], + "score": 0.9, + "content": "i \\in [ N ]", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 318, + 474, + 333 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 475, + 320, + 502, + 331 + ], + "score": 0.88, + "content": "t \\geq 1", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 330, + 360, + 349 + ], + "spans": [ + { + "bbox": [ + 104, + 330, + 360, + 349 + ], + "score": 1.0, + "content": "Furthermore, define ν¯ = 1N PNi=1 νi and νmax = maxi∈[N] νi.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5, + "bbox_fs": [ + 104, + 318, + 502, + 349 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 351, + 505, + 417 + ], + "lines": [ + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "score": 1.0, + "content": "The analysis of non-convex functions is much more technically involved, and our results rely on", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 362, + 506, + 376 + ], + "spans": [ + { + "bbox": [ + 104, + 362, + 506, + 376 + ], + "score": 1.0, + "content": "strong assumptions that provide a finer control of the gradient difference (Assumption 5), gradient", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 374, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 505, + 386 + ], + "score": 1.0, + "content": "noise (Assumption 6), gradient dissimilarity among devices (Assumption 7), and device unavailability", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "score": 1.0, + "content": "(Assumption 8). We remark that Assumption 5 is also made in [9, 16], and Assumption 7 is also made", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 394, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 506, + 408 + ], + "score": 1.0, + "content": "in [18, 39]. We leave it as future work to study whether and how MIFA converges for non-convex", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 405, + 252, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 252, + 419 + ], + "score": 1.0, + "content": "functions with weaker assumptions.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20.5, + "bbox_fs": [ + 104, + 351, + 506, + 419 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 419, + 506, + 471 + ], + "lines": [ + { + "bbox": [ + 106, + 419, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 277, + 432 + ], + "score": 1.0, + "content": "Theorem 6.1. Assume that Assumptions", + "type": "text" + }, + { + "bbox": [ + 277, + 420, + 295, + 430 + ], + "score": 0.28, + "content": "I , ~ 2 , ~", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 419, + 318, + 432 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 318, + 420, + 325, + 429 + ], + "score": 0.39, + "content": "^ { 5 }", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 419, + 505, + 432 + ], + "score": 1.0, + "content": "to 7 hold. Further assume that the device", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 429, + 504, + 444 + ], + "spans": [ + { + "bbox": [ + 104, + 429, + 196, + 444 + ], + "score": 1.0, + "content": "availability sequence", + "type": "text" + }, + { + "bbox": [ + 197, + 431, + 222, + 442 + ], + "score": 0.9, + "content": "\\tau ( t , i )", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 429, + 338, + 444 + ], + "score": 1.0, + "content": "satisfies Assumption 8 and", + "type": "text" + }, + { + "bbox": [ + 338, + 430, + 386, + 443 + ], + "score": 0.92, + "content": "\\tau ( 1 , i ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 429, + 417, + 444 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 417, + 430, + 451, + 442 + ], + "score": 0.9, + "content": "i \\in [ N ]", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 429, + 497, + 444 + ], + "score": 1.0, + "content": ". By using", + "type": "text" + }, + { + "bbox": [ + 497, + 433, + 504, + 441 + ], + "score": 0.48, + "content": "a", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 440, + 506, + 462 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 192, + 459 + ], + "score": 1.0, + "content": "learning rate η = q", + "type": "text" + }, + { + "bbox": [ + 163, + 443, + 234, + 462 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\eta = \\sqrt { \\frac { N } { K T L \\left( 1 + \\bar { \\nu } \\right) } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 188, + 442, + 386, + 461 + ], + "score": 1.0, + "content": "NKT L(1+¯ν), for T ≥ max{32αLNK, 16LNK", + "type": "text" + }, + { + "bbox": [ + 377, + 440, + 506, + 458 + ], + "score": 1.0, + "content": ", 8KNν2max(L2+ρδ) }, after T − 1", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 460, + 263, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 460, + 263, + 471 + ], + "score": 1.0, + "content": "communication rounds, MIFA satisfies:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 25.5, + "bbox_fs": [ + 104, + 419, + 506, + 471 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 145, + 473, + 465, + 506 + ], + "lines": [ + { + "bbox": [ + 145, + 473, + 465, + 506 + ], + "spans": [ + { + "bbox": [ + 145, + 473, + 465, + 506 + ], + "score": 0.91, + "content": "\\operatorname* { m i n } _ { 1 \\leq t \\leq T } \\mathbb { E } _ { \\xi } \\left[ \\left\\| \\nabla f ( w _ { t } ) \\right\\| ^ { 2 } \\right] = \\mathcal { O } \\left( \\sqrt { \\frac { ( 1 + \\bar { \\nu } ) L } { T K N } } ( f ( w _ { 1 } ) - f ^ { * } + \\sigma ^ { 2 } ) + \\frac { A _ { 4 } + A _ { 5 } } { T } \\right) ,", + "type": "interline_equation", + "image_path": "2ffd78cf10bfd3d236632f49cd6b6cd64bc3d08d3e2f60866f445ed97510c80b.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 145, + 473, + 465, + 484.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 145, + 484.0, + 465, + 495.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 145, + 495.0, + 465, + 506.0 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 507, + 249, + 519 + ], + "lines": [ + { + "bbox": [ + 106, + 506, + 249, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 133, + 519 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 507, + 144, + 519 + ], + "score": 0.87, + "content": "f ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 506, + 249, + 519 + ], + "score": 1.0, + "content": "is the optimal value, and:", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31, + "bbox_fs": [ + 106, + 506, + 249, + 519 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 165, + 520, + 445, + 576 + ], + "lines": [ + { + "bbox": [ + 165, + 520, + 445, + 576 + ], + "spans": [ + { + "bbox": [ + 165, + 520, + 445, + 576 + ], + "score": 0.92, + "content": "\\begin{array} { l } { { A _ { 4 } = N K L \\left( \\alpha \\sigma ^ { 2 } \\hat { \\nu } + \\frac { \\sigma ^ { 2 } \\nu _ { \\mathrm { m a x } } } { \\sqrt { K N } } + \\sigma \\nu _ { \\mathrm { m a x } } \\sqrt { \\beta } \\right) + \\frac { { ( L ^ { 2 } + \\rho \\delta ) \\sigma ^ { 2 } \\nu _ { \\mathrm { m a x } } } } { L } , } } \\\\ { { A _ { 5 } = \\frac { { ( K - 1 ) N L ( \\beta + \\sigma ^ { 2 } / K ) } } { \\hat { \\nu } + 1 } . } } \\end{array}", + "type": "interline_equation", + "image_path": "068374b3ecfcb8e112e697b4b2961eec732c2ae914494131485a106df94ed394.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 165, + 520, + 445, + 538.6666666666666 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 165, + 538.6666666666666, + 445, + 557.3333333333333 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 165, + 557.3333333333333, + 445, + 575.9999999999999 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 581, + 505, + 595 + ], + "lines": [ + { + "bbox": [ + 105, + 580, + 507, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 580, + 228, + 597 + ], + "score": 1.0, + "content": "Next, we show that the leading", + "type": "text" + }, + { + "bbox": [ + 229, + 581, + 271, + 595 + ], + "score": 0.94, + "content": "\\mathcal { O } ( 1 / \\sqrt { T } )", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 580, + 507, + 597 + ], + "score": 1.0, + "content": "term is theoretically optimal for zero-respecting algorithms.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 580, + 507, + 597 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 596, + 505, + 630 + ], + "lines": [ + { + "bbox": [ + 105, + 595, + 506, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 192, + 608 + ], + "score": 1.0, + "content": "Proposition 6.1. Let", + "type": "text" + }, + { + "bbox": [ + 193, + 596, + 221, + 607 + ], + "score": 0.9, + "content": "c _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 595, + 506, + 608 + ], + "score": 1.0, + "content": "be a universal constant. For any randomized zero-respecting algorithm,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 607, + 505, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 505, + 620 + ], + "score": 1.0, + "content": "there exists a stochastic non-convex problem satisfying Assumption1, 2, 5 and 7, such that the output", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 107, + 618, + 443, + 631 + ], + "spans": [ + { + "bbox": [ + 107, + 619, + 121, + 629 + ], + "score": 0.78, + "content": "w _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 121, + 618, + 144, + 631 + ], + "score": 1.0, + "content": "after", + "type": "text" + }, + { + "bbox": [ + 144, + 619, + 151, + 628 + ], + "score": 0.66, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 618, + 443, + 631 + ], + "score": 1.0, + "content": "rounds of communication has expected sub-optimality lower bounded by", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 595, + 506, + 631 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 631, + 433, + 658 + ], + "lines": [ + { + "bbox": [ + 177, + 631, + 433, + 658 + ], + "spans": [ + { + "bbox": [ + 177, + 631, + 433, + 658 + ], + "score": 0.9, + "content": "\\mathbb { E } [ \\| \\nabla f ( w _ { T } ) \\| ^ { 2 } ] \\ge \\mathbb { E } [ \\| \\nabla f ( w _ { T } ) \\| ] ^ { 2 } \\ge c _ { 0 } \\sqrt { \\frac { \\bar { \\nu } L \\sigma ^ { 2 } ( f ( w _ { 0 } ) - f ^ { * } ) } { N K T } } .", + "type": "interline_equation", + "image_path": "ca9299cdc027e71b6e299a9e1e31a7cd5c2809df369d439bba1b7aba2e00a1ef.jpg" + } + ] + } + ], + "index": 39, + "virtual_lines": [ + { + "bbox": [ + 177, + 631, + 433, + 658 + ], + "spans": [], + "index": 39 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 666, + 505, + 723 + ], + "lines": [ + { + "bbox": [ + 105, + 666, + 506, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 273, + 681 + ], + "score": 1.0, + "content": "The above proposition show that when", + "type": "text" + }, + { + "bbox": [ + 273, + 666, + 446, + 680 + ], + "score": 0.92, + "content": "\\sigma \\sqrt { ( f ( w _ { 0 } ) - f ^ { * } ) } \\sim \\sigma ^ { 2 } + ( f ( w _ { 0 } ) - f ^ { * } )", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 666, + 506, + 681 + ], + "score": 1.0, + "content": ", the result in", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 677, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 487, + 690 + ], + "score": 1.0, + "content": "Theorem 6.1 is tight. However, note that the counter example we used requires the quantity", + "type": "text" + }, + { + "bbox": [ + 487, + 678, + 493, + 688 + ], + "score": 0.77, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 677, + 505, + 690 + ], + "score": 1.0, + "content": "in", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 689, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 106, + 689, + 223, + 701 + ], + "score": 1.0, + "content": "Assumption 6 to scale with", + "type": "text" + }, + { + "bbox": [ + 223, + 690, + 232, + 699 + ], + "score": 0.81, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 689, + 304, + 701 + ], + "score": 1.0, + "content": ", hence requiring", + "type": "text" + }, + { + "bbox": [ + 304, + 689, + 311, + 699 + ], + "score": 0.81, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 689, + 505, + 701 + ], + "score": 1.0, + "content": "to be large enough. This does not change the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 699, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 357, + 713 + ], + "score": 1.0, + "content": "optimality of the first term as the first term is independent of", + "type": "text" + }, + { + "bbox": [ + 358, + 700, + 363, + 710 + ], + "score": 0.79, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 699, + 506, + 713 + ], + "score": 1.0, + "content": ". Whether this requirement can be", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 710, + 245, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 245, + 723 + ], + "score": 1.0, + "content": "relaxed is left as an open problem.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42, + "bbox_fs": [ + 105, + 666, + 506, + 723 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 72, + 506, + 123 + ], + "lines": [ + { + "bbox": [ + 105, + 70, + 506, + 87 + ], + "spans": [ + { + "bbox": [ + 105, + 70, + 205, + 87 + ], + "score": 1.0, + "content": "Remark 6.1. When all", + "type": "text" + }, + { + "bbox": [ + 205, + 73, + 236, + 84 + ], + "score": 0.9, + "content": "\\nu _ { i } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 70, + 506, + 87 + ], + "score": 1.0, + "content": "(i.e. all the devices are active), our convergence bound reduces", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 101, + 80, + 510, + 105 + ], + "spans": [ + { + "bbox": [ + 101, + 80, + 117, + 105 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 118, + 84, + 336, + 104 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathcal { O } \\Big ( \\sqrt { \\frac { L } { T K N } } ( f ( w _ { 1 } ) - f ^ { * } + \\sigma ^ { 2 } ) + \\frac { ( K - 1 ) N L ( \\beta + \\sigma ^ { 2 } / K ) } { T } \\Big ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 80, + 510, + 105 + ], + "score": 1.0, + "content": ". This matches the result in [42] (Thm. 1,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 101, + 201, + 127 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 194, + 124 + ], + "score": 0.86, + "content": "\\begin{array} { r } { \\eta = 1 , \\eta _ { L } = \\sqrt { \\frac { N } { K T L } } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 101, + 201, + 127 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "title", + "bbox": [ + 107, + 136, + 248, + 150 + ], + "lines": [ + { + "bbox": [ + 104, + 133, + 250, + 153 + ], + "spans": [ + { + "bbox": [ + 104, + 133, + 250, + 153 + ], + "score": 1.0, + "content": "7 Numerical Experiments", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 106, + 160, + 505, + 238 + ], + "lines": [ + { + "bbox": [ + 105, + 160, + 505, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 505, + 173 + ], + "score": 1.0, + "content": "In this section, we conduct numerical experiments3. to verify our theoretical results and investigate", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 172, + 506, + 184 + ], + "spans": [ + { + "bbox": [ + 105, + 172, + 506, + 184 + ], + "score": 1.0, + "content": "how the heterogeneity of the device availability influences the Federated optimization algorithms.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 181, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 104, + 181, + 505, + 196 + ], + "score": 1.0, + "content": "We compare the performance of the following four algorithms: FedAvg with importance sampling", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 193, + 505, + 206 + ], + "spans": [ + { + "bbox": [ + 105, + 193, + 505, + 206 + ], + "score": 1.0, + "content": "(FedAvg-IS), Biased FedAvg, FedAvg with device sampling, and our proposed MIFA. For the detailed", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 204, + 506, + 216 + ], + "spans": [ + { + "bbox": [ + 106, + 204, + 506, + 216 + ], + "score": 1.0, + "content": "discussions of the algorithms, we refer the readers to Sections 3 and 4. We remark that for a fair", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 215, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 106, + 215, + 505, + 227 + ], + "score": 1.0, + "content": "comparison, we deliberately include the first few rounds that MIFA needs to wait to receive responses", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 225, + 326, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 300, + 239 + ], + "score": 1.0, + "content": "from all devices for initializing the update-array", + "type": "text" + }, + { + "bbox": [ + 301, + 226, + 322, + 239 + ], + "score": 0.92, + "content": "\\{ G ^ { i } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 225, + 326, + 239 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 107, + 242, + 505, + 330 + ], + "lines": [ + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "score": 1.0, + "content": "Following [26, 25], we construct non-i.i.d. datasets from two commonly used computer vision", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 252, + 506, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 433, + 266 + ], + "score": 1.0, + "content": "datasets — MNIST [23] and CIFAR-10 [22] . Specifically, we divide the data into", + "type": "text" + }, + { + "bbox": [ + 433, + 253, + 473, + 263 + ], + "score": 0.9, + "content": "N = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 252, + 506, + 266 + ], + "score": 1.0, + "content": "devices", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 263, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 263, + 506, + 277 + ], + "score": 1.0, + "content": "with each device holding samples of only two classes, which creates a high level of data heterogeneity.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 275, + 505, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 288 + ], + "score": 1.0, + "content": "For simplicity, we ensure that each device holds the same number of samples. We do not use any data", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 286, + 505, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 505, + 298 + ], + "score": 1.0, + "content": "augmentation. We use multinomial logistic regression as the convex model and LeNet-5 [24] with", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 295, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 104, + 295, + 505, + 311 + ], + "score": 1.0, + "content": "ReLU activations as the non-convex model. For all experiments, we use weight decay in the training", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 308, + 505, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 259, + 320 + ], + "score": 1.0, + "content": "process, which corresponds to adding", + "type": "text" + }, + { + "bbox": [ + 259, + 308, + 269, + 319 + ], + "score": 0.86, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 308, + 505, + 320 + ], + "score": 1.0, + "content": "penalty. We use logistic models for MNIST dataset, while", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 319, + 477, + 331 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 477, + 331 + ], + "score": 1.0, + "content": "we use LeNet-5 for CIFAR-10. Our code is adapted from [26], which is under MIT License.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 106, + 335, + 505, + 423 + ], + "lines": [ + { + "bbox": [ + 106, + 335, + 505, + 347 + ], + "spans": [ + { + "bbox": [ + 106, + 335, + 458, + 347 + ], + "score": 1.0, + "content": "We model the availability of the devices as independent Bernoulli random trials. The", + "type": "text" + }, + { + "bbox": [ + 459, + 336, + 464, + 345 + ], + "score": 0.76, + "content": "i \\cdot", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 335, + 505, + 347 + ], + "score": 1.0, + "content": "-th device", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 345, + 506, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 230, + 359 + ], + "score": 1.0, + "content": "is assigned with a probability", + "type": "text" + }, + { + "bbox": [ + 230, + 348, + 240, + 357 + ], + "score": 0.84, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 345, + 506, + 359 + ], + "score": 1.0, + "content": ", where at each time step, the device becomes active with proba-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 357, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 106, + 357, + 130, + 369 + ], + "score": 1.0, + "content": "bility", + "type": "text" + }, + { + "bbox": [ + 131, + 358, + 140, + 368 + ], + "score": 0.84, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 357, + 243, + 369 + ], + "score": 1.0, + "content": ". In our experiments, the", + "type": "text" + }, + { + "bbox": [ + 244, + 358, + 253, + 368 + ], + "score": 0.86, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 357, + 505, + 369 + ], + "score": 1.0, + "content": "’s are chosen such that devices holding data of smaller labels", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 368, + 506, + 381 + ], + "spans": [ + { + "bbox": [ + 104, + 368, + 297, + 381 + ], + "score": 1.0, + "content": "participate less frequently. Specifically, if the", + "type": "text" + }, + { + "bbox": [ + 297, + 369, + 302, + 378 + ], + "score": 0.77, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 368, + 439, + 381 + ], + "score": 1.0, + "content": "-th device holds the data of label", + "type": "text" + }, + { + "bbox": [ + 439, + 369, + 446, + 380 + ], + "score": 0.83, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 368, + 465, + 381 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 465, + 369, + 471, + 378 + ], + "score": 0.8, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 472, + 368, + 506, + 381 + ], + "score": 1.0, + "content": ", we set", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 379, + 506, + 391 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 253, + 391 + ], + "score": 0.93, + "content": "\\bar { p } _ { i } = \\bar { p _ { \\operatorname* { m i n } } } \\operatorname* { m i n } ( j , k ) / 9 + \\bar { ( 1 - p _ { \\operatorname* { m i n } } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 379, + 284, + 391 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 284, + 380, + 304, + 390 + ], + "score": 0.89, + "content": "p _ { \\mathrm { m i n } }", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 379, + 506, + 391 + ], + "score": 1.0, + "content": "controls the lower bound of the participation prob-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 389, + 506, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 506, + 402 + ], + "score": 1.0, + "content": "abilities. The correlation between the participation patterns and local datasets increases the difficulty", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 401, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 441, + 414 + ], + "score": 1.0, + "content": "of the problem [17]. To investigate this phenomenon, we repeat the experiments for", + "type": "text" + }, + { + "bbox": [ + 441, + 401, + 487, + 412 + ], + "score": 0.91, + "content": "p _ { \\mathrm { m i n } } = 0 . 1", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 401, + 506, + 414 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 411, + 464, + 424 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 464, + 424 + ], + "score": 1.0, + "content": "0.2. We control the randomness of device participation when testing different algorithms.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 106, + 428, + 505, + 494 + ], + "lines": [ + { + "bbox": [ + 105, + 427, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 427, + 344, + 441 + ], + "score": 1.0, + "content": "In all the experiments, we set the initial learning rate to be", + "type": "text" + }, + { + "bbox": [ + 344, + 428, + 381, + 439 + ], + "score": 0.91, + "content": "\\eta _ { 0 } = 0 . 1", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 427, + 505, + 441 + ], + "score": 1.0, + "content": "and decay the learning rate as", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 437, + 507, + 454 + ], + "spans": [ + { + "bbox": [ + 106, + 438, + 152, + 452 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\eta _ { t } = \\eta _ { 0 } \\cdot \\frac { 1 } { t } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 437, + 507, + 454 + ], + "score": 1.0, + "content": ". We set the weight decay to be 0.001. The local batch size is 100 and each local update", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 449, + 506, + 462 + ], + "spans": [ + { + "bbox": [ + 106, + 449, + 360, + 462 + ], + "score": 1.0, + "content": "consists of 2 epochs. Therefore, the actual number of local steps", + "type": "text" + }, + { + "bbox": [ + 360, + 450, + 370, + 460 + ], + "score": 0.79, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 449, + 506, + 462 + ], + "score": 1.0, + "content": "depends on the size of the dataset.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 459, + 506, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 506, + 473 + ], + "score": 1.0, + "content": "We run all the experiments with 4 GPUs of type GeForce RTX 2080 Ti. We repeat the experiments", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 471, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 505, + 484 + ], + "score": 1.0, + "content": "for 5 different random seeds, and all of the experiments exhibit similar training curves. We report the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 482, + 377, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 377, + 495 + ], + "score": 1.0, + "content": "averaged training loss and test accuracy with error bars in Figure 2.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 106, + 498, + 505, + 576 + ], + "lines": [ + { + "bbox": [ + 105, + 497, + 506, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 329, + 512 + ], + "score": 1.0, + "content": "We observe that FedAvg with device sampling (FedAvg (", + "type": "text" + }, + { + "bbox": [ + 329, + 499, + 360, + 509 + ], + "score": 0.86, + "content": "S = 5 0", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 497, + 416, + 512 + ], + "score": 1.0, + "content": ") and FedAvg", + "type": "text" + }, + { + "bbox": [ + 417, + 499, + 454, + 510 + ], + "score": 0.85, + "content": "S = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 497, + 506, + 512 + ], + "score": 1.0, + "content": ") in Figure 2)", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 104, + 509, + 506, + 523 + ], + "spans": [ + { + "bbox": [ + 104, + 509, + 506, + 523 + ], + "score": 1.0, + "content": "is severely influenced by the straggling devices and makes progress relatively slowly compared to the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 521, + 506, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 521, + 506, + 533 + ], + "score": 1.0, + "content": "other algorithms. Although biased FedAvg converges fast at the beginning, this simple algorithm is", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 531, + 507, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 451, + 545 + ], + "score": 1.0, + "content": "biased, and the optimality gaps are prominent for the harder CIFAR-10 dataset and when", + "type": "text" + }, + { + "bbox": [ + 451, + 533, + 471, + 543 + ], + "score": 0.88, + "content": "p _ { \\mathrm { m i n } }", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 531, + 507, + 545 + ], + "score": 1.0, + "content": "is small.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 542, + 506, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 506, + 556 + ], + "score": 1.0, + "content": "On the contrary, our proposed MIFA avoids waiting for stragglers, converges fast without bias, and is", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 553, + 506, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 553, + 506, + 567 + ], + "score": 1.0, + "content": "competitive with FedAvg with importance sampling, which requires knowledge of the participation", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 564, + 473, + 577 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 473, + 577 + ], + "score": 1.0, + "content": "probabilities. We refer the readers to Appendix G for additional experiments on CIFAR-10.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 36 + }, + { + "type": "title", + "bbox": [ + 107, + 590, + 272, + 604 + ], + "lines": [ + { + "bbox": [ + 104, + 589, + 273, + 606 + ], + "spans": [ + { + "bbox": [ + 104, + 589, + 273, + 606 + ], + "score": 1.0, + "content": "8 Conclusions and Discussions", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 106, + 615, + 505, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 615, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 505, + 628 + ], + "score": 1.0, + "content": "In this paper, we study FL algorithms in the presence of arbitrary device unavailability and propose", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "MIFA, which avoids waiting for straggling devices and re-uses the memorized latest updates as the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "surrogate when the device is unavailable. We theoretically analyze MIFA without any structural", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 649, + 506, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 506, + 661 + ], + "score": 1.0, + "content": "assumptions on the device availability and prove the convergence for strongly convex and non-convex", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 660, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 505, + 671 + ], + "score": 1.0, + "content": "smooth functions. Different from the literature that studies oracle complexity in terms of stochastic", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 670, + 507, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 507, + 682 + ], + "score": 1.0, + "content": "gradient evaluations, we argue that in federated learning system, the bottleneck lies in the non-", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 682, + 505, + 694 + ], + "spans": [ + { + "bbox": [ + 106, + 682, + 505, + 694 + ], + "score": 1.0, + "content": "stationary and possibly adversarial pattern of device participation. Therefore, it is important to study", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 691, + 505, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 505, + 705 + ], + "score": 1.0, + "content": "how the number of inactive rounds influences the convergence rate. In Theorem 5.1, the dependency", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 44.5 + } + ], + "page_idx": 8, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 118, + 712, + 389, + 722 + ], + "lines": [ + { + "bbox": [ + 118, + 709, + 390, + 724 + ], + "spans": [ + { + "bbox": [ + 118, + 709, + 390, + 724 + ], + "score": 1.0, + "content": "3Our code is available at https://github.com/hmgxr128/MIFA_code/", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 742, + 309, + 750 + ], + "lines": [ + { + "bbox": [ + 302, + 741, + 309, + 752 + ], + "spans": [ + { + "bbox": [ + 302, + 741, + 309, + 752 + ], + "score": 1.0, + "content": "9", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 72, + 506, + 123 + ], + "lines": [ + { + "bbox": [ + 105, + 70, + 506, + 87 + ], + "spans": [ + { + "bbox": [ + 105, + 70, + 205, + 87 + ], + "score": 1.0, + "content": "Remark 6.1. When all", + "type": "text" + }, + { + "bbox": [ + 205, + 73, + 236, + 84 + ], + "score": 0.9, + "content": "\\nu _ { i } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 70, + 506, + 87 + ], + "score": 1.0, + "content": "(i.e. all the devices are active), our convergence bound reduces", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 101, + 80, + 510, + 105 + ], + "spans": [ + { + "bbox": [ + 101, + 80, + 117, + 105 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 118, + 84, + 336, + 104 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathcal { O } \\Big ( \\sqrt { \\frac { L } { T K N } } ( f ( w _ { 1 } ) - f ^ { * } + \\sigma ^ { 2 } ) + \\frac { ( K - 1 ) N L ( \\beta + \\sigma ^ { 2 } / K ) } { T } \\Big ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 80, + 510, + 105 + ], + "score": 1.0, + "content": ". This matches the result in [42] (Thm. 1,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 101, + 201, + 127 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 194, + 124 + ], + "score": 0.86, + "content": "\\begin{array} { r } { \\eta = 1 , \\eta _ { L } = \\sqrt { \\frac { N } { K T L } } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 101, + 201, + 127 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 101, + 70, + 510, + 127 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 136, + 248, + 150 + ], + "lines": [ + { + "bbox": [ + 104, + 133, + 250, + 153 + ], + "spans": [ + { + "bbox": [ + 104, + 133, + 250, + 153 + ], + "score": 1.0, + "content": "7 Numerical Experiments", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 106, + 160, + 505, + 238 + ], + "lines": [ + { + "bbox": [ + 105, + 160, + 505, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 505, + 173 + ], + "score": 1.0, + "content": "In this section, we conduct numerical experiments3. to verify our theoretical results and investigate", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 172, + 506, + 184 + ], + "spans": [ + { + "bbox": [ + 105, + 172, + 506, + 184 + ], + "score": 1.0, + "content": "how the heterogeneity of the device availability influences the Federated optimization algorithms.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 181, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 104, + 181, + 505, + 196 + ], + "score": 1.0, + "content": "We compare the performance of the following four algorithms: FedAvg with importance sampling", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 193, + 505, + 206 + ], + "spans": [ + { + "bbox": [ + 105, + 193, + 505, + 206 + ], + "score": 1.0, + "content": "(FedAvg-IS), Biased FedAvg, FedAvg with device sampling, and our proposed MIFA. For the detailed", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 204, + 506, + 216 + ], + "spans": [ + { + "bbox": [ + 106, + 204, + 506, + 216 + ], + "score": 1.0, + "content": "discussions of the algorithms, we refer the readers to Sections 3 and 4. We remark that for a fair", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 215, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 106, + 215, + 505, + 227 + ], + "score": 1.0, + "content": "comparison, we deliberately include the first few rounds that MIFA needs to wait to receive responses", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 225, + 326, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 300, + 239 + ], + "score": 1.0, + "content": "from all devices for initializing the update-array", + "type": "text" + }, + { + "bbox": [ + 301, + 226, + 322, + 239 + ], + "score": 0.92, + "content": "\\{ G ^ { i } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 225, + 326, + 239 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7, + "bbox_fs": [ + 104, + 160, + 506, + 239 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 242, + 505, + 330 + ], + "lines": [ + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "score": 1.0, + "content": "Following [26, 25], we construct non-i.i.d. datasets from two commonly used computer vision", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 252, + 506, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 433, + 266 + ], + "score": 1.0, + "content": "datasets — MNIST [23] and CIFAR-10 [22] . Specifically, we divide the data into", + "type": "text" + }, + { + "bbox": [ + 433, + 253, + 473, + 263 + ], + "score": 0.9, + "content": "N = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 252, + 506, + 266 + ], + "score": 1.0, + "content": "devices", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 263, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 263, + 506, + 277 + ], + "score": 1.0, + "content": "with each device holding samples of only two classes, which creates a high level of data heterogeneity.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 275, + 505, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 288 + ], + "score": 1.0, + "content": "For simplicity, we ensure that each device holds the same number of samples. We do not use any data", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 286, + 505, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 505, + 298 + ], + "score": 1.0, + "content": "augmentation. We use multinomial logistic regression as the convex model and LeNet-5 [24] with", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 295, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 104, + 295, + 505, + 311 + ], + "score": 1.0, + "content": "ReLU activations as the non-convex model. For all experiments, we use weight decay in the training", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 308, + 505, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 259, + 320 + ], + "score": 1.0, + "content": "process, which corresponds to adding", + "type": "text" + }, + { + "bbox": [ + 259, + 308, + 269, + 319 + ], + "score": 0.86, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 308, + 505, + 320 + ], + "score": 1.0, + "content": "penalty. We use logistic models for MNIST dataset, while", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 319, + 477, + 331 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 477, + 331 + ], + "score": 1.0, + "content": "we use LeNet-5 for CIFAR-10. Our code is adapted from [26], which is under MIT License.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 14.5, + "bbox_fs": [ + 104, + 242, + 506, + 331 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 335, + 505, + 423 + ], + "lines": [ + { + "bbox": [ + 106, + 335, + 505, + 347 + ], + "spans": [ + { + "bbox": [ + 106, + 335, + 458, + 347 + ], + "score": 1.0, + "content": "We model the availability of the devices as independent Bernoulli random trials. The", + "type": "text" + }, + { + "bbox": [ + 459, + 336, + 464, + 345 + ], + "score": 0.76, + "content": "i \\cdot", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 335, + 505, + 347 + ], + "score": 1.0, + "content": "-th device", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 345, + 506, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 230, + 359 + ], + "score": 1.0, + "content": "is assigned with a probability", + "type": "text" + }, + { + "bbox": [ + 230, + 348, + 240, + 357 + ], + "score": 0.84, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 345, + 506, + 359 + ], + "score": 1.0, + "content": ", where at each time step, the device becomes active with proba-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 357, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 106, + 357, + 130, + 369 + ], + "score": 1.0, + "content": "bility", + "type": "text" + }, + { + "bbox": [ + 131, + 358, + 140, + 368 + ], + "score": 0.84, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 357, + 243, + 369 + ], + "score": 1.0, + "content": ". In our experiments, the", + "type": "text" + }, + { + "bbox": [ + 244, + 358, + 253, + 368 + ], + "score": 0.86, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 357, + 505, + 369 + ], + "score": 1.0, + "content": "’s are chosen such that devices holding data of smaller labels", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 368, + 506, + 381 + ], + "spans": [ + { + "bbox": [ + 104, + 368, + 297, + 381 + ], + "score": 1.0, + "content": "participate less frequently. Specifically, if the", + "type": "text" + }, + { + "bbox": [ + 297, + 369, + 302, + 378 + ], + "score": 0.77, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 368, + 439, + 381 + ], + "score": 1.0, + "content": "-th device holds the data of label", + "type": "text" + }, + { + "bbox": [ + 439, + 369, + 446, + 380 + ], + "score": 0.83, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 368, + 465, + 381 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 465, + 369, + 471, + 378 + ], + "score": 0.8, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 472, + 368, + 506, + 381 + ], + "score": 1.0, + "content": ", we set", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 379, + 506, + 391 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 253, + 391 + ], + "score": 0.93, + "content": "\\bar { p } _ { i } = \\bar { p _ { \\operatorname* { m i n } } } \\operatorname* { m i n } ( j , k ) / 9 + \\bar { ( 1 - p _ { \\operatorname* { m i n } } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 379, + 284, + 391 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 284, + 380, + 304, + 390 + ], + "score": 0.89, + "content": "p _ { \\mathrm { m i n } }", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 379, + 506, + 391 + ], + "score": 1.0, + "content": "controls the lower bound of the participation prob-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 389, + 506, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 506, + 402 + ], + "score": 1.0, + "content": "abilities. The correlation between the participation patterns and local datasets increases the difficulty", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 401, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 441, + 414 + ], + "score": 1.0, + "content": "of the problem [17]. To investigate this phenomenon, we repeat the experiments for", + "type": "text" + }, + { + "bbox": [ + 441, + 401, + 487, + 412 + ], + "score": 0.91, + "content": "p _ { \\mathrm { m i n } } = 0 . 1", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 401, + 506, + 414 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 411, + 464, + 424 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 464, + 424 + ], + "score": 1.0, + "content": "0.2. We control the randomness of device participation when testing different algorithms.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 22.5, + "bbox_fs": [ + 104, + 335, + 506, + 424 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 428, + 505, + 494 + ], + "lines": [ + { + "bbox": [ + 105, + 427, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 427, + 344, + 441 + ], + "score": 1.0, + "content": "In all the experiments, we set the initial learning rate to be", + "type": "text" + }, + { + "bbox": [ + 344, + 428, + 381, + 439 + ], + "score": 0.91, + "content": "\\eta _ { 0 } = 0 . 1", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 427, + 505, + 441 + ], + "score": 1.0, + "content": "and decay the learning rate as", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 437, + 507, + 454 + ], + "spans": [ + { + "bbox": [ + 106, + 438, + 152, + 452 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\eta _ { t } = \\eta _ { 0 } \\cdot \\frac { 1 } { t } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 437, + 507, + 454 + ], + "score": 1.0, + "content": ". We set the weight decay to be 0.001. The local batch size is 100 and each local update", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 449, + 506, + 462 + ], + "spans": [ + { + "bbox": [ + 106, + 449, + 360, + 462 + ], + "score": 1.0, + "content": "consists of 2 epochs. Therefore, the actual number of local steps", + "type": "text" + }, + { + "bbox": [ + 360, + 450, + 370, + 460 + ], + "score": 0.79, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 449, + 506, + 462 + ], + "score": 1.0, + "content": "depends on the size of the dataset.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 459, + 506, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 506, + 473 + ], + "score": 1.0, + "content": "We run all the experiments with 4 GPUs of type GeForce RTX 2080 Ti. We repeat the experiments", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 471, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 505, + 484 + ], + "score": 1.0, + "content": "for 5 different random seeds, and all of the experiments exhibit similar training curves. We report the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 482, + 377, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 377, + 495 + ], + "score": 1.0, + "content": "averaged training loss and test accuracy with error bars in Figure 2.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 29.5, + "bbox_fs": [ + 105, + 427, + 507, + 495 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 498, + 505, + 576 + ], + "lines": [ + { + "bbox": [ + 105, + 497, + 506, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 329, + 512 + ], + "score": 1.0, + "content": "We observe that FedAvg with device sampling (FedAvg (", + "type": "text" + }, + { + "bbox": [ + 329, + 499, + 360, + 509 + ], + "score": 0.86, + "content": "S = 5 0", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 497, + 416, + 512 + ], + "score": 1.0, + "content": ") and FedAvg", + "type": "text" + }, + { + "bbox": [ + 417, + 499, + 454, + 510 + ], + "score": 0.85, + "content": "S = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 497, + 506, + 512 + ], + "score": 1.0, + "content": ") in Figure 2)", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 104, + 509, + 506, + 523 + ], + "spans": [ + { + "bbox": [ + 104, + 509, + 506, + 523 + ], + "score": 1.0, + "content": "is severely influenced by the straggling devices and makes progress relatively slowly compared to the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 521, + 506, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 521, + 506, + 533 + ], + "score": 1.0, + "content": "other algorithms. Although biased FedAvg converges fast at the beginning, this simple algorithm is", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 531, + 507, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 451, + 545 + ], + "score": 1.0, + "content": "biased, and the optimality gaps are prominent for the harder CIFAR-10 dataset and when", + "type": "text" + }, + { + "bbox": [ + 451, + 533, + 471, + 543 + ], + "score": 0.88, + "content": "p _ { \\mathrm { m i n } }", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 531, + 507, + 545 + ], + "score": 1.0, + "content": "is small.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 542, + 506, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 506, + 556 + ], + "score": 1.0, + "content": "On the contrary, our proposed MIFA avoids waiting for stragglers, converges fast without bias, and is", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 553, + 506, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 553, + 506, + 567 + ], + "score": 1.0, + "content": "competitive with FedAvg with importance sampling, which requires knowledge of the participation", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 564, + 473, + 577 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 473, + 577 + ], + "score": 1.0, + "content": "probabilities. We refer the readers to Appendix G for additional experiments on CIFAR-10.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 36, + "bbox_fs": [ + 104, + 497, + 507, + 577 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 590, + 272, + 604 + ], + "lines": [ + { + "bbox": [ + 104, + 589, + 273, + 606 + ], + "spans": [ + { + "bbox": [ + 104, + 589, + 273, + 606 + ], + "score": 1.0, + "content": "8 Conclusions and Discussions", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 106, + 615, + 505, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 615, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 505, + 628 + ], + "score": 1.0, + "content": "In this paper, we study FL algorithms in the presence of arbitrary device unavailability and propose", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "MIFA, which avoids waiting for straggling devices and re-uses the memorized latest updates as the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "surrogate when the device is unavailable. We theoretically analyze MIFA without any structural", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 649, + 506, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 506, + 661 + ], + "score": 1.0, + "content": "assumptions on the device availability and prove the convergence for strongly convex and non-convex", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 660, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 505, + 671 + ], + "score": 1.0, + "content": "smooth functions. Different from the literature that studies oracle complexity in terms of stochastic", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 670, + 507, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 507, + 682 + ], + "score": 1.0, + "content": "gradient evaluations, we argue that in federated learning system, the bottleneck lies in the non-", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 682, + 505, + 694 + ], + "spans": [ + { + "bbox": [ + 106, + 682, + 505, + 694 + ], + "score": 1.0, + "content": "stationary and possibly adversarial pattern of device participation. Therefore, it is important to study", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 691, + 505, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 505, + 705 + ], + "score": 1.0, + "content": "how the number of inactive rounds influences the convergence rate. In Theorem 5.1, the dependency", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 315, + 506, + 330 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 130, + 330 + ], + "score": 1.0, + "content": "upon", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 130, + 318, + 159, + 329 + ], + "score": 0.89, + "content": "\\tau _ { \\operatorname* { m a x } , T }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 160, + 315, + 506, + 330 + ], + "score": 1.0, + "content": "might be an artifact of our analysis, and a future direction is to study whether we", + "type": "text", + "cross_page": true + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 328, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 106, + 328, + 505, + 340 + ], + "score": 1.0, + "content": "can remove this dependency. Another important direction is to analyze algorithms for non-convex", + "type": "text", + "cross_page": true + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 338, + 257, + 350 + ], + "spans": [ + { + "bbox": [ + 106, + 338, + 257, + 350 + ], + "score": 1.0, + "content": "functions under weaker assumptions.", + "type": "text", + "cross_page": true + } + ], + "index": 9 + } + ], + "index": 44.5, + "bbox_fs": [ + 105, + 615, + 507, + 705 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 64, + 501, + 251 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 64, + 501, + 251 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 64, + 501, + 251 + ], + "spans": [ + { + "bbox": [ + 109, + 64, + 501, + 251 + ], + "score": 0.976, + "type": "image", + "image_path": "c1142e9ecbf7a3052e86380ac3f4c818747910b17c29f238aaf9134bafeb112a.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 64, + 501, + 126.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 126.33333333333334, + 501, + 188.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 188.66666666666669, + 501, + 251.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 258, + 506, + 302 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 258, + 506, + 270 + ], + "spans": [ + { + "bbox": [ + 106, + 258, + 506, + 270 + ], + "score": 1.0, + "content": "Figure 2: Training losses and test accuracies. Fig. 2(a)–2(d): logistic models on non-iid MNIST.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 269, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 269, + 338, + 281 + ], + "score": 1.0, + "content": "Fig. 2(e)–2(h): LeNet-5 on non-iid CIFAR-10. FedAvg", + "type": "text" + }, + { + "bbox": [ + 339, + 269, + 371, + 279 + ], + "score": 0.87, + "content": "S = 5 0", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 269, + 430, + 281 + ], + "score": 1.0, + "content": ") and FedAvg", + "type": "text" + }, + { + "bbox": [ + 431, + 269, + 469, + 279 + ], + "score": 0.86, + "content": "S = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 269, + 505, + 281 + ], + "score": 1.0, + "content": ") refer to", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 279, + 506, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 279, + 293 + ], + "score": 1.0, + "content": "FedAvg with device sampling that samples", + "type": "text" + }, + { + "bbox": [ + 279, + 280, + 287, + 290 + ], + "score": 0.75, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 279, + 506, + 293 + ], + "score": 1.0, + "content": "devices for each global update. FedAvg-IS is short for", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 290, + 489, + 303 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 489, + 303 + ], + "score": 1.0, + "content": "FedAvg with importance sampling, which requires knowledge of the participation probabilities.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "text", + "bbox": [ + 107, + 316, + 505, + 349 + ], + "lines": [ + { + "bbox": [ + 105, + 315, + 506, + 330 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 130, + 330 + ], + "score": 1.0, + "content": "upon", + "type": "text" + }, + { + "bbox": [ + 130, + 318, + 159, + 329 + ], + "score": 0.89, + "content": "\\tau _ { \\operatorname* { m a x } , T }", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 315, + 506, + 330 + ], + "score": 1.0, + "content": "might be an artifact of our analysis, and a future direction is to study whether we", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 328, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 106, + 328, + 505, + 340 + ], + "score": 1.0, + "content": "can remove this dependency. Another important direction is to analyze algorithms for non-convex", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 338, + 257, + 350 + ], + "spans": [ + { + "bbox": [ + 106, + 338, + 257, + 350 + ], + "score": 1.0, + "content": "functions under weaker assumptions.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + }, + { + "type": "title", + "bbox": [ + 107, + 364, + 339, + 379 + ], + "lines": [ + { + "bbox": [ + 105, + 363, + 341, + 382 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 341, + 382 + ], + "score": 1.0, + "content": "Acknowledgments and Disclosure of Funding", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 389, + 505, + 444 + ], + "lines": [ + { + "bbox": [ + 105, + 388, + 505, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 505, + 402 + ], + "score": 1.0, + "content": "The work of Xinran Gu and Longbo Huang is supported in part by the Technology and Innovation", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 401, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 106, + 401, + 505, + 412 + ], + "score": 1.0, + "content": "Major Project of the Ministry of Science and Technology of China under Grant 2020AAA0108400", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 411, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 505, + 424 + ], + "score": 1.0, + "content": "and2020AAA0108403. Xinran Gu would like to thank Kaifeng Lyu for the discussion on the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "score": 1.0, + "content": "convergence analysis. The authors would like to thank Sai Praneeth Karimireddy for the discussion", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 433, + 205, + 447 + ], + "spans": [ + { + "bbox": [ + 106, + 433, + 205, + 447 + ], + "score": 1.0, + "content": "on the problem settings.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13 + }, + { + "type": "title", + "bbox": [ + 107, + 460, + 163, + 473 + ], + "lines": [ + { + "bbox": [ + 106, + 459, + 165, + 474 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 165, + 474 + ], + "score": 1.0, + "content": "References", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 110, + 478, + 507, + 723 + ], + "lines": [ + { + "bbox": [ + 111, + 479, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 111, + 479, + 505, + 491 + ], + "score": 1.0, + "content": "[1] Alekh Agarwal and John C Duchi. Distributed delayed stochastic optimization. In 2012 IEEE", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 127, + 489, + 478, + 503 + ], + "spans": [ + { + "bbox": [ + 127, + 489, + 478, + 503 + ], + "score": 1.0, + "content": "51st IEEE Conference on Decision and Control (CDC), pages 5451–5452. IEEE, 2012.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 111, + 509, + 506, + 521 + ], + "spans": [ + { + "bbox": [ + 111, + 509, + 506, + 521 + ], + "score": 1.0, + "content": "[2] Alekh Agarwal, Martin J Wainwright, Peter Bartlett, and Pradeep Ravikumar. Information-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 127, + 519, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 127, + 519, + 505, + 532 + ], + "score": 1.0, + "content": "theoretic lower bounds on the oracle complexity of convex optimization. Advances in Neural", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 128, + 531, + 318, + 543 + ], + "spans": [ + { + "bbox": [ + 128, + 531, + 318, + 543 + ], + "score": 1.0, + "content": "Information Processing Systems, 22:1–9, 2009.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 110, + 549, + 505, + 562 + ], + "spans": [ + { + "bbox": [ + 110, + 549, + 505, + 562 + ], + "score": 1.0, + "content": "[3] Yossi Arjevani, Yair Carmon, John C. Duchi, Dylan J. Foster, Nathan Srebro, and Blake", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 128, + 560, + 425, + 573 + ], + "spans": [ + { + "bbox": [ + 128, + 560, + 425, + 573 + ], + "score": 1.0, + "content": "Woodworth. Lower bounds for non-convex stochastic optimization, 2019.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 111, + 579, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 111, + 579, + 505, + 591 + ], + "score": 1.0, + "content": "[4] Yossi Arjevani, Ohad Shamir, and Nathan Srebro. A tight convergence analysis for stochastic", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 126, + 589, + 507, + 603 + ], + "spans": [ + { + "bbox": [ + 126, + 589, + 507, + 603 + ], + "score": 1.0, + "content": "gradient descent with delayed updates. In Algorithmic Learning Theory, pages 111–132. PMLR,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 127, + 600, + 153, + 612 + ], + "spans": [ + { + "bbox": [ + 127, + 600, + 153, + 612 + ], + "score": 1.0, + "content": "2020.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 110, + 619, + 506, + 632 + ], + "spans": [ + { + "bbox": [ + 110, + 619, + 506, + 632 + ], + "score": 1.0, + "content": "[5] Arda Aytekin, Hamid Reza Feyzmahdavian, and Mikael Johansson. Analysis and implemen-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 127, + 631, + 505, + 643 + ], + "spans": [ + { + "bbox": [ + 127, + 631, + 505, + 643 + ], + "score": 1.0, + "content": "tation of an asynchronous optimization algorithm for the parameter server. arXiv preprint", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 127, + 641, + 230, + 652 + ], + "spans": [ + { + "bbox": [ + 127, + 641, + 230, + 652 + ], + "score": 1.0, + "content": "arXiv:1610.05507, 2016.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 110, + 659, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 110, + 659, + 506, + 673 + ], + "score": 1.0, + "content": "[6] Debraj Basu, Deepesh Data, Can Karakus, and Suhas Diggavi. Qsparse-local-sgd: Distributed", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 127, + 671, + 506, + 684 + ], + "spans": [ + { + "bbox": [ + 127, + 671, + 506, + 684 + ], + "score": 1.0, + "content": "sgd with quantization, sparsification, and local computations. arXiv preprint arXiv:1906.02367,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 127, + 681, + 153, + 693 + ], + "spans": [ + { + "bbox": [ + 127, + 681, + 153, + 693 + ], + "score": 1.0, + "content": "2019.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 111, + 700, + 505, + 713 + ], + "spans": [ + { + "bbox": [ + 111, + 700, + 505, + 713 + ], + "score": 1.0, + "content": "[7] Keith Bonawitz, Hubert Eichner, Wolfgang Grieskamp, Dzmitry Huba, Alex Ingerman, Vladimir", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 127, + 711, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 127, + 711, + 505, + 723 + ], + "score": 1.0, + "content": "Ivanov, Chloé Kiddon, Jakub Konecný, Stefano Mazzocchi, Brendan McMahan, Timon ˇ", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 25.5 + } + ], + "page_idx": 9, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 741, + 311, + 750 + ], + "lines": [ + { + "bbox": [ + 299, + 740, + 313, + 754 + ], + "spans": [ + { + "bbox": [ + 299, + 740, + 313, + 754 + ], + "score": 1.0, + "content": "10", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 64, + 501, + 251 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 64, + 501, + 251 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 64, + 501, + 251 + ], + "spans": [ + { + "bbox": [ + 109, + 64, + 501, + 251 + ], + "score": 0.976, + "type": "image", + "image_path": "c1142e9ecbf7a3052e86380ac3f4c818747910b17c29f238aaf9134bafeb112a.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 64, + 501, + 126.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 126.33333333333334, + 501, + 188.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 188.66666666666669, + 501, + 251.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 258, + 506, + 302 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 258, + 506, + 270 + ], + "spans": [ + { + "bbox": [ + 106, + 258, + 506, + 270 + ], + "score": 1.0, + "content": "Figure 2: Training losses and test accuracies. Fig. 2(a)–2(d): logistic models on non-iid MNIST.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 269, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 269, + 338, + 281 + ], + "score": 1.0, + "content": "Fig. 2(e)–2(h): LeNet-5 on non-iid CIFAR-10. FedAvg", + "type": "text" + }, + { + "bbox": [ + 339, + 269, + 371, + 279 + ], + "score": 0.87, + "content": "S = 5 0", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 269, + 430, + 281 + ], + "score": 1.0, + "content": ") and FedAvg", + "type": "text" + }, + { + "bbox": [ + 431, + 269, + 469, + 279 + ], + "score": 0.86, + "content": "S = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 269, + 505, + 281 + ], + "score": 1.0, + "content": ") refer to", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 279, + 506, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 279, + 293 + ], + "score": 1.0, + "content": "FedAvg with device sampling that samples", + "type": "text" + }, + { + "bbox": [ + 279, + 280, + 287, + 290 + ], + "score": 0.75, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 279, + 506, + 293 + ], + "score": 1.0, + "content": "devices for each global update. FedAvg-IS is short for", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 290, + 489, + 303 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 489, + 303 + ], + "score": 1.0, + "content": "FedAvg with importance sampling, which requires knowledge of the participation probabilities.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "text", + "bbox": [ + 107, + 316, + 505, + 349 + ], + "lines": [], + "index": 8, + "bbox_fs": [ + 105, + 315, + 506, + 350 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 107, + 364, + 339, + 379 + ], + "lines": [ + { + "bbox": [ + 105, + 363, + 341, + 382 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 341, + 382 + ], + "score": 1.0, + "content": "Acknowledgments and Disclosure of Funding", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 389, + 505, + 444 + ], + "lines": [ + { + "bbox": [ + 105, + 388, + 505, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 505, + 402 + ], + "score": 1.0, + "content": "The work of Xinran Gu and Longbo Huang is supported in part by the Technology and Innovation", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 401, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 106, + 401, + 505, + 412 + ], + "score": 1.0, + "content": "Major Project of the Ministry of Science and Technology of China under Grant 2020AAA0108400", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 411, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 505, + 424 + ], + "score": 1.0, + "content": "and2020AAA0108403. Xinran Gu would like to thank Kaifeng Lyu for the discussion on the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "score": 1.0, + "content": "convergence analysis. The authors would like to thank Sai Praneeth Karimireddy for the discussion", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 433, + 205, + 447 + ], + "spans": [ + { + "bbox": [ + 106, + 433, + 205, + 447 + ], + "score": 1.0, + "content": "on the problem settings.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 388, + 505, + 447 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 460, + 163, + 473 + ], + "lines": [ + { + "bbox": [ + 106, + 459, + 165, + 474 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 165, + 474 + ], + "score": 1.0, + "content": "References", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "list", + "bbox": [ + 110, + 478, + 507, + 723 + ], + "lines": [ + { + "bbox": [ + 111, + 479, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 111, + 479, + 505, + 491 + ], + "score": 1.0, + "content": "[1] Alekh Agarwal and John C Duchi. Distributed delayed stochastic optimization. In 2012 IEEE", + "type": "text" + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 489, + 478, + 503 + ], + "spans": [ + { + "bbox": [ + 127, + 489, + 478, + 503 + ], + "score": 1.0, + "content": "51st IEEE Conference on Decision and Control (CDC), pages 5451–5452. IEEE, 2012.", + "type": "text" + } + ], + "index": 18, + "is_list_end_line": true + }, + { + "bbox": [ + 111, + 509, + 506, + 521 + ], + "spans": [ + { + "bbox": [ + 111, + 509, + 506, + 521 + ], + "score": 1.0, + "content": "[2] Alekh Agarwal, Martin J Wainwright, Peter Bartlett, and Pradeep Ravikumar. Information-", + "type": "text" + } + ], + "index": 19, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 519, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 127, + 519, + 505, + 532 + ], + "score": 1.0, + "content": "theoretic lower bounds on the oracle complexity of convex optimization. Advances in Neural", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 128, + 531, + 318, + 543 + ], + "spans": [ + { + "bbox": [ + 128, + 531, + 318, + 543 + ], + "score": 1.0, + "content": "Information Processing Systems, 22:1–9, 2009.", + "type": "text" + } + ], + "index": 21, + "is_list_end_line": true + }, + { + "bbox": [ + 110, + 549, + 505, + 562 + ], + "spans": [ + { + "bbox": [ + 110, + 549, + 505, + 562 + ], + "score": 1.0, + "content": "[3] Yossi Arjevani, Yair Carmon, John C. Duchi, Dylan J. Foster, Nathan Srebro, and Blake", + "type": "text" + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 128, + 560, + 425, + 573 + ], + "spans": [ + { + "bbox": [ + 128, + 560, + 425, + 573 + ], + "score": 1.0, + "content": "Woodworth. Lower bounds for non-convex stochastic optimization, 2019.", + "type": "text" + } + ], + "index": 23, + "is_list_end_line": true + }, + { + "bbox": [ + 111, + 579, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 111, + 579, + 505, + 591 + ], + "score": 1.0, + "content": "[4] Yossi Arjevani, Ohad Shamir, and Nathan Srebro. A tight convergence analysis for stochastic", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 589, + 507, + 603 + ], + "spans": [ + { + "bbox": [ + 126, + 589, + 507, + 603 + ], + "score": 1.0, + "content": "gradient descent with delayed updates. In Algorithmic Learning Theory, pages 111–132. PMLR,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 127, + 600, + 153, + 612 + ], + "spans": [ + { + "bbox": [ + 127, + 600, + 153, + 612 + ], + "score": 1.0, + "content": "2020.", + "type": "text" + } + ], + "index": 26, + "is_list_end_line": true + }, + { + "bbox": [ + 110, + 619, + 506, + 632 + ], + "spans": [ + { + "bbox": [ + 110, + 619, + 506, + 632 + ], + "score": 1.0, + "content": "[5] Arda Aytekin, Hamid Reza Feyzmahdavian, and Mikael Johansson. Analysis and implemen-", + "type": "text" + } + ], + "index": 27, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 631, + 505, + 643 + ], + "spans": [ + { + "bbox": [ + 127, + 631, + 505, + 643 + ], + "score": 1.0, + "content": "tation of an asynchronous optimization algorithm for the parameter server. arXiv preprint", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 127, + 641, + 230, + 652 + ], + "spans": [ + { + "bbox": [ + 127, + 641, + 230, + 652 + ], + "score": 1.0, + "content": "arXiv:1610.05507, 2016.", + "type": "text" + } + ], + "index": 29, + "is_list_end_line": true + }, + { + "bbox": [ + 110, + 659, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 110, + 659, + 506, + 673 + ], + "score": 1.0, + "content": "[6] Debraj Basu, Deepesh Data, Can Karakus, and Suhas Diggavi. Qsparse-local-sgd: Distributed", + "type": "text" + } + ], + "index": 30, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 671, + 506, + 684 + ], + "spans": [ + { + "bbox": [ + 127, + 671, + 506, + 684 + ], + "score": 1.0, + "content": "sgd with quantization, sparsification, and local computations. arXiv preprint arXiv:1906.02367,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 127, + 681, + 153, + 693 + ], + "spans": [ + { + "bbox": [ + 127, + 681, + 153, + 693 + ], + "score": 1.0, + "content": "2019.", + "type": "text" + } + ], + "index": 32, + "is_list_end_line": true + }, + { + "bbox": [ + 111, + 700, + 505, + 713 + ], + "spans": [ + { + "bbox": [ + 111, + 700, + 505, + 713 + ], + "score": 1.0, + "content": "[7] Keith Bonawitz, Hubert Eichner, Wolfgang Grieskamp, Dzmitry Huba, Alex Ingerman, Vladimir", + "type": "text" + } + ], + "index": 33, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 711, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 127, + 711, + 505, + 723 + ], + "score": 1.0, + "content": "Ivanov, Chloé Kiddon, Jakub Konecný, Stefano Mazzocchi, Brendan McMahan, Timon ˇ", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 25.5, + "bbox_fs": [ + 110, + 479, + 507, + 723 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 126, + 72, + 505, + 106 + ], + "lines": [ + { + "bbox": [ + 128, + 73, + 505, + 85 + ], + "spans": [ + { + "bbox": [ + 128, + 73, + 505, + 85 + ], + "score": 1.0, + "content": "Van Overveldt, David Petrou, Daniel Ramage, and Jason Roselander. Towards federated", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 127, + 83, + 507, + 96 + ], + "spans": [ + { + "bbox": [ + 127, + 83, + 507, + 96 + ], + "score": 1.0, + "content": "learning at scale: System design. In A. Talwalkar, V. Smith, and M. Zaharia, editors, Proceed-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 127, + 95, + 420, + 106 + ], + "spans": [ + { + "bbox": [ + 127, + 95, + 420, + 106 + ], + "score": 1.0, + "content": "ings of Machine Learning and Systems, volume 1, pages 374–388, 2019.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 110, + 112, + 504, + 136 + ], + "lines": [ + { + "bbox": [ + 111, + 111, + 505, + 126 + ], + "spans": [ + { + "bbox": [ + 111, + 111, + 505, + 126 + ], + "score": 1.0, + "content": "[8] Sébastien Bubeck, Nicolo Cesa-Bianchi, and Gábor Lugosi. Bandits with heavy tail. IEEE", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 127, + 123, + 381, + 135 + ], + "spans": [ + { + "bbox": [ + 127, + 123, + 381, + 135 + ], + "score": 1.0, + "content": "Transactions on Information Theory, 59(11):7711–7717, 2013.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 110, + 141, + 504, + 165 + ], + "lines": [ + { + "bbox": [ + 111, + 142, + 505, + 154 + ], + "spans": [ + { + "bbox": [ + 111, + 142, + 505, + 154 + ], + "score": 1.0, + "content": "[9] Yair Carmon, John C Duchi, Oliver Hinder, and Aaron Sidford. Accelerated methods for", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 126, + 153, + 457, + 165 + ], + "spans": [ + { + "bbox": [ + 126, + 153, + 457, + 165 + ], + "score": 1.0, + "content": "nonconvex optimization. SIAM Journal on Optimization, 28(2):1751–1772, 2018.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 107, + 171, + 505, + 205 + ], + "lines": [ + { + "bbox": [ + 105, + 170, + 506, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 506, + 183 + ], + "score": 1.0, + "content": "[10] Hubert Eichner, Tomer Koren, Brendan McMahan, Nathan Srebro, and Kunal Talwar. Semi-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 127, + 182, + 506, + 195 + ], + "spans": [ + { + "bbox": [ + 127, + 182, + 506, + 195 + ], + "score": 1.0, + "content": "cyclic stochastic gradient descent. In International Conference on Machine Learning, pages", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 128, + 193, + 234, + 204 + ], + "spans": [ + { + "bbox": [ + 128, + 193, + 234, + 204 + ], + "score": 1.0, + "content": "1764–1773. PMLR, 2019.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 106, + 211, + 505, + 245 + ], + "lines": [ + { + "bbox": [ + 105, + 211, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 211, + 506, + 223 + ], + "score": 1.0, + "content": "[11] Hamid Reza Feyzmahdavian, Arda Aytekin, and Mikael Johansson. An asynchronous mini-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 127, + 222, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 127, + 222, + 505, + 234 + ], + "score": 1.0, + "content": "batch algorithm for regularized stochastic optimization. IEEE Transactions on Automatic", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 128, + 234, + 266, + 244 + ], + "spans": [ + { + "bbox": [ + 128, + 234, + 266, + 244 + ], + "score": 1.0, + "content": "Control, 61(12):3740–3754, 2016.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 251, + 504, + 285 + ], + "lines": [ + { + "bbox": [ + 106, + 251, + 505, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 251, + 505, + 264 + ], + "score": 1.0, + "content": "[12] Saeed Ghadimi and Guanghui Lan. Optimal stochastic approximation algorithms for strongly", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 127, + 263, + 505, + 275 + ], + "spans": [ + { + "bbox": [ + 127, + 263, + 505, + 275 + ], + "score": 1.0, + "content": "convex stochastic composite optimization i: A generic algorithmic framework. SIAM Journal", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 128, + 273, + 297, + 285 + ], + "spans": [ + { + "bbox": [ + 128, + 273, + 297, + 285 + ], + "score": 1.0, + "content": "on Optimization, 22(4):1469–1492, 2012.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 105, + 291, + 505, + 314 + ], + "lines": [ + { + "bbox": [ + 105, + 290, + 505, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 505, + 304 + ], + "score": 1.0, + "content": "[13] Margalit Glasgow and Mary Wootters. Asynchronous distributed optimization with stochastic", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 127, + 302, + 322, + 315 + ], + "spans": [ + { + "bbox": [ + 127, + 302, + 322, + 315 + ], + "score": 1.0, + "content": "delays. arXiv preprint arXiv:2009.10717, 2020.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 106, + 320, + 506, + 365 + ], + "lines": [ + { + "bbox": [ + 105, + 320, + 506, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 320, + 506, + 333 + ], + "score": 1.0, + "content": "[14] Eduard Gorbunov, Konstantin P. Burlachenko, Zhize Li, and Peter Richtarik. Marina: Faster", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 126, + 331, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 126, + 331, + 506, + 344 + ], + "score": 1.0, + "content": "non-convex distributed learning with compression. In Marina Meila and Tong Zhang, edi-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 127, + 342, + 506, + 355 + ], + "spans": [ + { + "bbox": [ + 127, + 342, + 506, + 355 + ], + "score": 1.0, + "content": "tors, Proceedings of the 38th International Conference on Machine Learning, volume 139 of", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 126, + 353, + 482, + 366 + ], + "spans": [ + { + "bbox": [ + 126, + 353, + 482, + 366 + ], + "score": 1.0, + "content": "Proceedings of Machine Learning Research, pages 3788–3798. PMLR, 18–24 Jul 2021.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 105, + 371, + 504, + 394 + ], + "lines": [ + { + "bbox": [ + 106, + 371, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 106, + 371, + 505, + 384 + ], + "score": 1.0, + "content": "[15] Tzu-Ming Harry Hsu, Hang Qi, and Matthew Brown. Measuring the effects of non-identical", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 127, + 381, + 495, + 394 + ], + "spans": [ + { + "bbox": [ + 127, + 381, + 495, + 394 + ], + "score": 1.0, + "content": "data distribution for federated visual classification. arXiv preprint arXiv:1909.06335, 2019.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 107, + 400, + 504, + 434 + ], + "lines": [ + { + "bbox": [ + 105, + 399, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 506, + 414 + ], + "score": 1.0, + "content": "[16] Chi Jin, Rong Ge, Praneeth Netrapalli, Sham M Kakade, and Michael I Jordan. How to escape", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 126, + 411, + 506, + 424 + ], + "spans": [ + { + "bbox": [ + 126, + 411, + 506, + 424 + ], + "score": 1.0, + "content": "saddle points efficiently. In International Conference on Machine Learning, pages 1724–1732.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 126, + 421, + 186, + 435 + ], + "spans": [ + { + "bbox": [ + 126, + 421, + 186, + 435 + ], + "score": 1.0, + "content": "PMLR, 2017.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 440, + 506, + 485 + ], + "lines": [ + { + "bbox": [ + 105, + 441, + 507, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 507, + 453 + ], + "score": 1.0, + "content": "[17] Peter Kairouz, H Brendan McMahan, Brendan Avent, Aurélien Bellet, Mehdi Bennis, Ar-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 125, + 451, + 507, + 465 + ], + "spans": [ + { + "bbox": [ + 125, + 451, + 507, + 465 + ], + "score": 1.0, + "content": "jun Nitin Bhagoji, Keith Bonawitz, Zachary Charles, Graham Cormode, Rachel Cummings,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 126, + 462, + 507, + 475 + ], + "spans": [ + { + "bbox": [ + 126, + 462, + 507, + 475 + ], + "score": 1.0, + "content": "et al. Advances and open problems in federated learning. arXiv preprint arXiv:1912.04977,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 126, + 473, + 153, + 485 + ], + "spans": [ + { + "bbox": [ + 126, + 473, + 153, + 485 + ], + "score": 1.0, + "content": "2019.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 105, + 491, + 503, + 526 + ], + "lines": [ + { + "bbox": [ + 105, + 491, + 506, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 506, + 504 + ], + "score": 1.0, + "content": "[18] Sai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank Reddi, Sebastian Stich, and", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 127, + 503, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 127, + 503, + 505, + 515 + ], + "score": 1.0, + "content": "Ananda Theertha Suresh. Scaffold: Stochastic controlled averaging for federated learning. In", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 128, + 514, + 453, + 526 + ], + "spans": [ + { + "bbox": [ + 128, + 514, + 453, + 526 + ], + "score": 1.0, + "content": "International Conference on Machine Learning, pages 5132–5143. PMLR, 2020.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 105, + 531, + 504, + 565 + ], + "lines": [ + { + "bbox": [ + 105, + 531, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 505, + 545 + ], + "score": 1.0, + "content": "[19] Ahmed Khaled, Konstantin Mishchenko, and Peter Richtárik. Tighter theory for local sgd on", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 127, + 543, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 127, + 543, + 505, + 555 + ], + "score": 1.0, + "content": "identical and heterogeneous data. In International Conference on Artificial Intelligence and", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 128, + 554, + 300, + 566 + ], + "spans": [ + { + "bbox": [ + 128, + 554, + 300, + 566 + ], + "score": 1.0, + "content": "Statistics, pages 4519–4529. PMLR, 2020.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 105, + 571, + 503, + 595 + ], + "lines": [ + { + "bbox": [ + 106, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "[20] Jakub Konecnˇ y, Brendan McMahan, and Daniel Ramage. Federated optimization: Distributed `", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 127, + 583, + 436, + 595 + ], + "spans": [ + { + "bbox": [ + 127, + 583, + 436, + 595 + ], + "score": 1.0, + "content": "optimization beyond the datacenter. arXiv preprint arXiv:1511.03575, 2015.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 106, + 601, + 504, + 635 + ], + "lines": [ + { + "bbox": [ + 105, + 600, + 506, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 506, + 615 + ], + "score": 1.0, + "content": "[21] Jakub Konecnˇ y, H Brendan McMahan, Daniel Ramage, and Peter Richtárik. Federated optimiza- `", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 127, + 612, + 507, + 624 + ], + "spans": [ + { + "bbox": [ + 127, + 612, + 507, + 624 + ], + "score": 1.0, + "content": "tion: Distributed machine learning for on-device intelligence. arXiv preprint arXiv:1610.02527,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 127, + 622, + 153, + 635 + ], + "spans": [ + { + "bbox": [ + 127, + 622, + 153, + 635 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 106, + 641, + 504, + 664 + ], + "lines": [ + { + "bbox": [ + 105, + 639, + 506, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 506, + 655 + ], + "score": 1.0, + "content": "[22] Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 126, + 650, + 154, + 664 + ], + "spans": [ + { + "bbox": [ + 126, + 650, + 154, + 664 + ], + "score": 1.0, + "content": "2009.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5 + }, + { + "type": "text", + "bbox": [ + 106, + 670, + 504, + 694 + ], + "lines": [ + { + "bbox": [ + 106, + 669, + 505, + 685 + ], + "spans": [ + { + "bbox": [ + 106, + 669, + 505, + 685 + ], + "score": 1.0, + "content": "[23] Yann LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner. Gradient-based learning", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 127, + 681, + 471, + 694 + ], + "spans": [ + { + "bbox": [ + 127, + 681, + 471, + 694 + ], + "score": 1.0, + "content": "applied to document recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44.5 + }, + { + "type": "text", + "bbox": [ + 105, + 699, + 505, + 722 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 713 + ], + "score": 1.0, + "content": "[24] Yann LeCun et al. Lenet-5, convolutional neural networks. URL: http://yann. lecun.", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 127, + 711, + 258, + 722 + ], + "spans": [ + { + "bbox": [ + 127, + 711, + 258, + 722 + ], + "score": 1.0, + "content": "com/exdb/lenet, 20(5):14, 2015.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46.5 + } + ], + "page_idx": 10, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 741, + 310, + 750 + ], + "lines": [ + { + "bbox": [ + 299, + 740, + 312, + 755 + ], + "spans": [ + { + "bbox": [ + 299, + 740, + 312, + 755 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 126, + 72, + 505, + 106 + ], + "lines": [ + { + "bbox": [ + 128, + 73, + 505, + 85 + ], + "spans": [ + { + "bbox": [ + 128, + 73, + 505, + 85 + ], + "score": 1.0, + "content": "Van Overveldt, David Petrou, Daniel Ramage, and Jason Roselander. Towards federated", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 127, + 83, + 507, + 96 + ], + "spans": [ + { + "bbox": [ + 127, + 83, + 507, + 96 + ], + "score": 1.0, + "content": "learning at scale: System design. In A. Talwalkar, V. Smith, and M. Zaharia, editors, Proceed-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 127, + 95, + 420, + 106 + ], + "spans": [ + { + "bbox": [ + 127, + 95, + 420, + 106 + ], + "score": 1.0, + "content": "ings of Machine Learning and Systems, volume 1, pages 374–388, 2019.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 127, + 73, + 507, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 110, + 112, + 504, + 136 + ], + "lines": [ + { + "bbox": [ + 111, + 111, + 505, + 126 + ], + "spans": [ + { + "bbox": [ + 111, + 111, + 505, + 126 + ], + "score": 1.0, + "content": "[8] Sébastien Bubeck, Nicolo Cesa-Bianchi, and Gábor Lugosi. Bandits with heavy tail. IEEE", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 127, + 123, + 381, + 135 + ], + "spans": [ + { + "bbox": [ + 127, + 123, + 381, + 135 + ], + "score": 1.0, + "content": "Transactions on Information Theory, 59(11):7711–7717, 2013.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 111, + 111, + 505, + 135 + ] + }, + { + "type": "text", + "bbox": [ + 110, + 141, + 504, + 165 + ], + "lines": [ + { + "bbox": [ + 111, + 142, + 505, + 154 + ], + "spans": [ + { + "bbox": [ + 111, + 142, + 505, + 154 + ], + "score": 1.0, + "content": "[9] Yair Carmon, John C Duchi, Oliver Hinder, and Aaron Sidford. Accelerated methods for", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 126, + 153, + 457, + 165 + ], + "spans": [ + { + "bbox": [ + 126, + 153, + 457, + 165 + ], + "score": 1.0, + "content": "nonconvex optimization. SIAM Journal on Optimization, 28(2):1751–1772, 2018.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 111, + 142, + 505, + 165 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 171, + 505, + 205 + ], + "lines": [ + { + "bbox": [ + 105, + 170, + 506, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 506, + 183 + ], + "score": 1.0, + "content": "[10] Hubert Eichner, Tomer Koren, Brendan McMahan, Nathan Srebro, and Kunal Talwar. Semi-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 127, + 182, + 506, + 195 + ], + "spans": [ + { + "bbox": [ + 127, + 182, + 506, + 195 + ], + "score": 1.0, + "content": "cyclic stochastic gradient descent. In International Conference on Machine Learning, pages", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 128, + 193, + 234, + 204 + ], + "spans": [ + { + "bbox": [ + 128, + 193, + 234, + 204 + ], + "score": 1.0, + "content": "1764–1773. PMLR, 2019.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 170, + 506, + 204 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 211, + 505, + 245 + ], + "lines": [ + { + "bbox": [ + 105, + 211, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 211, + 506, + 223 + ], + "score": 1.0, + "content": "[11] Hamid Reza Feyzmahdavian, Arda Aytekin, and Mikael Johansson. An asynchronous mini-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 127, + 222, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 127, + 222, + 505, + 234 + ], + "score": 1.0, + "content": "batch algorithm for regularized stochastic optimization. IEEE Transactions on Automatic", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 128, + 234, + 266, + 244 + ], + "spans": [ + { + "bbox": [ + 128, + 234, + 266, + 244 + ], + "score": 1.0, + "content": "Control, 61(12):3740–3754, 2016.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 211, + 506, + 244 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 251, + 504, + 285 + ], + "lines": [ + { + "bbox": [ + 106, + 251, + 505, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 251, + 505, + 264 + ], + "score": 1.0, + "content": "[12] Saeed Ghadimi and Guanghui Lan. Optimal stochastic approximation algorithms for strongly", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 127, + 263, + 505, + 275 + ], + "spans": [ + { + "bbox": [ + 127, + 263, + 505, + 275 + ], + "score": 1.0, + "content": "convex stochastic composite optimization i: A generic algorithmic framework. SIAM Journal", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 128, + 273, + 297, + 285 + ], + "spans": [ + { + "bbox": [ + 128, + 273, + 297, + 285 + ], + "score": 1.0, + "content": "on Optimization, 22(4):1469–1492, 2012.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14, + "bbox_fs": [ + 106, + 251, + 505, + 285 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 291, + 505, + 314 + ], + "lines": [ + { + "bbox": [ + 105, + 290, + 505, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 505, + 304 + ], + "score": 1.0, + "content": "[13] Margalit Glasgow and Mary Wootters. Asynchronous distributed optimization with stochastic", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 127, + 302, + 322, + 315 + ], + "spans": [ + { + "bbox": [ + 127, + 302, + 322, + 315 + ], + "score": 1.0, + "content": "delays. arXiv preprint arXiv:2009.10717, 2020.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5, + "bbox_fs": [ + 105, + 290, + 505, + 315 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 320, + 506, + 365 + ], + "lines": [ + { + "bbox": [ + 105, + 320, + 506, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 320, + 506, + 333 + ], + "score": 1.0, + "content": "[14] Eduard Gorbunov, Konstantin P. Burlachenko, Zhize Li, and Peter Richtarik. Marina: Faster", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 126, + 331, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 126, + 331, + 506, + 344 + ], + "score": 1.0, + "content": "non-convex distributed learning with compression. In Marina Meila and Tong Zhang, edi-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 127, + 342, + 506, + 355 + ], + "spans": [ + { + "bbox": [ + 127, + 342, + 506, + 355 + ], + "score": 1.0, + "content": "tors, Proceedings of the 38th International Conference on Machine Learning, volume 139 of", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 126, + 353, + 482, + 366 + ], + "spans": [ + { + "bbox": [ + 126, + 353, + 482, + 366 + ], + "score": 1.0, + "content": "Proceedings of Machine Learning Research, pages 3788–3798. PMLR, 18–24 Jul 2021.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 320, + 506, + 366 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 371, + 504, + 394 + ], + "lines": [ + { + "bbox": [ + 106, + 371, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 106, + 371, + 505, + 384 + ], + "score": 1.0, + "content": "[15] Tzu-Ming Harry Hsu, Hang Qi, and Matthew Brown. Measuring the effects of non-identical", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 127, + 381, + 495, + 394 + ], + "spans": [ + { + "bbox": [ + 127, + 381, + 495, + 394 + ], + "score": 1.0, + "content": "data distribution for federated visual classification. arXiv preprint arXiv:1909.06335, 2019.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5, + "bbox_fs": [ + 106, + 371, + 505, + 394 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 400, + 504, + 434 + ], + "lines": [ + { + "bbox": [ + 105, + 399, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 506, + 414 + ], + "score": 1.0, + "content": "[16] Chi Jin, Rong Ge, Praneeth Netrapalli, Sham M Kakade, and Michael I Jordan. How to escape", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 126, + 411, + 506, + 424 + ], + "spans": [ + { + "bbox": [ + 126, + 411, + 506, + 424 + ], + "score": 1.0, + "content": "saddle points efficiently. In International Conference on Machine Learning, pages 1724–1732.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 126, + 421, + 186, + 435 + ], + "spans": [ + { + "bbox": [ + 126, + 421, + 186, + 435 + ], + "score": 1.0, + "content": "PMLR, 2017.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 399, + 506, + 435 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 440, + 506, + 485 + ], + "lines": [ + { + "bbox": [ + 105, + 441, + 507, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 507, + 453 + ], + "score": 1.0, + "content": "[17] Peter Kairouz, H Brendan McMahan, Brendan Avent, Aurélien Bellet, Mehdi Bennis, Ar-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 125, + 451, + 507, + 465 + ], + "spans": [ + { + "bbox": [ + 125, + 451, + 507, + 465 + ], + "score": 1.0, + "content": "jun Nitin Bhagoji, Keith Bonawitz, Zachary Charles, Graham Cormode, Rachel Cummings,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 126, + 462, + 507, + 475 + ], + "spans": [ + { + "bbox": [ + 126, + 462, + 507, + 475 + ], + "score": 1.0, + "content": "et al. Advances and open problems in federated learning. arXiv preprint arXiv:1912.04977,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 126, + 473, + 153, + 485 + ], + "spans": [ + { + "bbox": [ + 126, + 473, + 153, + 485 + ], + "score": 1.0, + "content": "2019.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 441, + 507, + 485 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 491, + 503, + 526 + ], + "lines": [ + { + "bbox": [ + 105, + 491, + 506, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 506, + 504 + ], + "score": 1.0, + "content": "[18] Sai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank Reddi, Sebastian Stich, and", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 127, + 503, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 127, + 503, + 505, + 515 + ], + "score": 1.0, + "content": "Ananda Theertha Suresh. Scaffold: Stochastic controlled averaging for federated learning. In", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 128, + 514, + 453, + 526 + ], + "spans": [ + { + "bbox": [ + 128, + 514, + 453, + 526 + ], + "score": 1.0, + "content": "International Conference on Machine Learning, pages 5132–5143. PMLR, 2020.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 491, + 506, + 526 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 531, + 504, + 565 + ], + "lines": [ + { + "bbox": [ + 105, + 531, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 505, + 545 + ], + "score": 1.0, + "content": "[19] Ahmed Khaled, Konstantin Mishchenko, and Peter Richtárik. Tighter theory for local sgd on", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 127, + 543, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 127, + 543, + 505, + 555 + ], + "score": 1.0, + "content": "identical and heterogeneous data. In International Conference on Artificial Intelligence and", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 128, + 554, + 300, + 566 + ], + "spans": [ + { + "bbox": [ + 128, + 554, + 300, + 566 + ], + "score": 1.0, + "content": "Statistics, pages 4519–4529. PMLR, 2020.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 531, + 505, + 566 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 571, + 503, + 595 + ], + "lines": [ + { + "bbox": [ + 106, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "[20] Jakub Konecnˇ y, Brendan McMahan, and Daniel Ramage. Federated optimization: Distributed `", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 127, + 583, + 436, + 595 + ], + "spans": [ + { + "bbox": [ + 127, + 583, + 436, + 595 + ], + "score": 1.0, + "content": "optimization beyond the datacenter. arXiv preprint arXiv:1511.03575, 2015.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5, + "bbox_fs": [ + 106, + 572, + 505, + 595 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 601, + 504, + 635 + ], + "lines": [ + { + "bbox": [ + 105, + 600, + 506, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 506, + 615 + ], + "score": 1.0, + "content": "[21] Jakub Konecnˇ y, H Brendan McMahan, Daniel Ramage, and Peter Richtárik. Federated optimiza- `", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 127, + 612, + 507, + 624 + ], + "spans": [ + { + "bbox": [ + 127, + 612, + 507, + 624 + ], + "score": 1.0, + "content": "tion: Distributed machine learning for on-device intelligence. arXiv preprint arXiv:1610.02527,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 127, + 622, + 153, + 635 + ], + "spans": [ + { + "bbox": [ + 127, + 622, + 153, + 635 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 600, + 507, + 635 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 641, + 504, + 664 + ], + "lines": [ + { + "bbox": [ + 105, + 639, + 506, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 506, + 655 + ], + "score": 1.0, + "content": "[22] Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 126, + 650, + 154, + 664 + ], + "spans": [ + { + "bbox": [ + 126, + 650, + 154, + 664 + ], + "score": 1.0, + "content": "2009.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5, + "bbox_fs": [ + 105, + 639, + 506, + 664 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 670, + 504, + 694 + ], + "lines": [ + { + "bbox": [ + 106, + 669, + 505, + 685 + ], + "spans": [ + { + "bbox": [ + 106, + 669, + 505, + 685 + ], + "score": 1.0, + "content": "[23] Yann LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner. Gradient-based learning", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 127, + 681, + 471, + 694 + ], + "spans": [ + { + "bbox": [ + 127, + 681, + 471, + 694 + ], + "score": 1.0, + "content": "applied to document recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44.5, + "bbox_fs": [ + 106, + 669, + 505, + 694 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 699, + 505, + 722 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 713 + ], + "score": 1.0, + "content": "[24] Yann LeCun et al. Lenet-5, convolutional neural networks. URL: http://yann. lecun.", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 127, + 711, + 258, + 722 + ], + "spans": [ + { + "bbox": [ + 127, + 711, + 258, + 722 + ], + "score": 1.0, + "content": "com/exdb/lenet, 20(5):14, 2015.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46.5, + "bbox_fs": [ + 105, + 698, + 506, + 722 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 36, + 507, + 730 + ], + "lines": [ + { + "bbox": [ + 105, + 72, + 506, + 87 + ], + "spans": [ + { + "bbox": [ + 105, + 72, + 506, + 87 + ], + "score": 1.0, + "content": "[25] Tian Li, Anit Kumar Sahu, Manzil Zaheer, Maziar Sanjabi, Ameet Talwalkar, and Virginia", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 127, + 83, + 506, + 97 + ], + "spans": [ + { + "bbox": [ + 127, + 83, + 506, + 97 + ], + "score": 1.0, + "content": "Smith. Federated optimization in heterogeneous networks. In I. Dhillon, D. Papailiopoulos, and", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 127, + 94, + 507, + 109 + ], + "spans": [ + { + "bbox": [ + 127, + 94, + 507, + 109 + ], + "score": 1.0, + "content": "V. Sze, editors, Proceedings of Machine Learning and Systems, volume 2, pages 429–450, 2020.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 113, + 505, + 126 + ], + "spans": [ + { + "bbox": [ + 107, + 113, + 505, + 126 + ], + "score": 1.0, + "content": "[26] Xiang Li, Kaixuan Huang, Wenhao Yang, Shusen Wang, and Zhihua Zhang. On the convergence", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 127, + 123, + 494, + 138 + ], + "spans": [ + { + "bbox": [ + 127, + 123, + 494, + 138 + ], + "score": 1.0, + "content": "of fedavg on non-iid data. In International Conference on Learning Representations, 2020.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 142, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 506, + 156 + ], + "score": 1.0, + "content": "[27] Xiangru Lian, Yijun Huang, Yuncheng Li, and Ji Liu. Asynchronous parallel stochastic gradient", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 127, + 152, + 507, + 167 + ], + "spans": [ + { + "bbox": [ + 127, + 152, + 507, + 167 + ], + "score": 1.0, + "content": "for nonconvex optimization. In C. Cortes, N. Lawrence, D. Lee, M. Sugiyama, and R. Garnett,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 126, + 163, + 507, + 178 + ], + "spans": [ + { + "bbox": [ + 126, + 163, + 507, + 178 + ], + "score": 1.0, + "content": "editors, Advances in Neural Information Processing Systems, volume 28. Curran Associates,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 126, + 173, + 175, + 188 + ], + "spans": [ + { + "bbox": [ + 126, + 173, + 175, + 188 + ], + "score": 1.0, + "content": "Inc., 2015.", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 192, + 507, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 507, + 207 + ], + "score": 1.0, + "content": "[28] Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Aguera y Arcas.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 127, + 203, + 506, + 218 + ], + "spans": [ + { + "bbox": [ + 127, + 203, + 506, + 218 + ], + "score": 1.0, + "content": "Communication-efficient learning of deep networks from decentralized data. In Artificial", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 127, + 214, + 369, + 229 + ], + "spans": [ + { + "bbox": [ + 127, + 214, + 369, + 229 + ], + "score": 1.0, + "content": "Intelligence and Statistics, pages 1273–1282. PMLR, 2017.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 233, + 505, + 245 + ], + "spans": [ + { + "bbox": [ + 106, + 233, + 505, + 245 + ], + "score": 1.0, + "content": "[29] Arkadij Semenovic Nemirovskij and David Borisovich Yudin. Problem complexity and method ˇ", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 126, + 244, + 262, + 257 + ], + "spans": [ + { + "bbox": [ + 126, + 244, + 262, + 257 + ], + "score": 1.0, + "content": "efficiency in optimization. 1983.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 261, + 506, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 506, + 276 + ], + "score": 1.0, + "content": "[30] Constantin Philippenko and Aymeric Dieuleveut. Bidirectional compression in heterogeneous", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 125, + 272, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 125, + 272, + 506, + 288 + ], + "score": 1.0, + "content": "settings for distributed or federated learning with partial participation: tight convergence", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 126, + 283, + 339, + 298 + ], + "spans": [ + { + "bbox": [ + 126, + 283, + 339, + 298 + ], + "score": 1.0, + "content": "guarantees. arXiv preprint arXiv:2006.14591, 2020.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 302, + 506, + 317 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 506, + 317 + ], + "score": 1.0, + "content": "[31] Amirhossein Reisizadeh, Isidoros Tziotis, Hamed Hassani, Aryan Mokhtari, and Ramtin", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 127, + 313, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 127, + 313, + 505, + 327 + ], + "score": 1.0, + "content": "Pedarsani. Straggler-resilient federated learning: Leveraging the interplay between statistical", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 126, + 324, + 435, + 337 + ], + "spans": [ + { + "bbox": [ + 126, + 324, + 435, + 337 + ], + "score": 1.0, + "content": "accuracy and system heterogeneity. arXiv preprint arXiv:2012.14453, 2020.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 342, + 506, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 506, + 356 + ], + "score": 1.0, + "content": "[32] Yichen Ruan, Xiaoxi Zhang, Shu-Che Liang, and Carlee Joe-Wong. Towards flexible device", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 127, + 353, + 505, + 367 + ], + "spans": [ + { + "bbox": [ + 127, + 353, + 505, + 367 + ], + "score": 1.0, + "content": "participation in federated learning. In International Conference on Artificial Intelligence and", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 126, + 365, + 302, + 379 + ], + "spans": [ + { + "bbox": [ + 126, + 365, + 302, + 379 + ], + "score": 1.0, + "content": "Statistics, pages 3403–3411. PMLR, 2021.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 107, + 383, + 505, + 395 + ], + "spans": [ + { + "bbox": [ + 107, + 383, + 505, + 395 + ], + "score": 1.0, + "content": "[33] Felix Sattler, Simon Wiedemann, Klaus-Robert Müller, and Wojciech Samek. Robust and", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 127, + 394, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 127, + 394, + 505, + 406 + ], + "score": 1.0, + "content": "communication-efficient federated learning from non-iid data. IEEE transactions on neural", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 127, + 405, + 355, + 417 + ], + "spans": [ + { + "bbox": [ + 127, + 405, + 355, + 417 + ], + "score": 1.0, + "content": "networks and learning systems, 31(9):3400–3413, 2019.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 422, + 506, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 422, + 506, + 437 + ], + "score": 1.0, + "content": "[34] Virginia Smith, Chao-Kai Chiang, Maziar Sanjabi, and Ameet Talwalkar. Federated multi-task", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 127, + 433, + 330, + 447 + ], + "spans": [ + { + "bbox": [ + 127, + 433, + 330, + 447 + ], + "score": 1.0, + "content": "learning. arXiv preprint arXiv:1705.10467, 2017.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 451, + 506, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 451, + 506, + 466 + ], + "score": 1.0, + "content": "[35] Sebastian U Stich and Sai Praneeth Karimireddy. The error-feedback framework: Better rates", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 127, + 464, + 506, + 475 + ], + "spans": [ + { + "bbox": [ + 127, + 464, + 506, + 475 + ], + "score": 1.0, + "content": "for sgd with delayed gradients and compressed updates. Journal of Machine Learning Research,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 127, + 474, + 191, + 486 + ], + "spans": [ + { + "bbox": [ + 127, + 474, + 191, + 486 + ], + "score": 1.0, + "content": "21:1–36, 2020.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 491, + 507, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 507, + 505 + ], + "score": 1.0, + "content": "[36] Sebastian Urban Stich. Local sgd converges fast and communicates little. In ICLR 2019-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 127, + 504, + 439, + 516 + ], + "spans": [ + { + "bbox": [ + 127, + 504, + 439, + 516 + ], + "score": 1.0, + "content": "International Conference on Learning Representations, number CONF, 2019.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 520, + 506, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 520, + 506, + 535 + ], + "score": 1.0, + "content": "[37] Roman Vershynin. High-dimensional probability: An introduction with applications in data", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 127, + 531, + 349, + 546 + ], + "spans": [ + { + "bbox": [ + 127, + 531, + 349, + 546 + ], + "score": 1.0, + "content": "science, volume 47. Cambridge university press, 2018.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 107, + 551, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 107, + 551, + 505, + 563 + ], + "score": 1.0, + "content": "[38] Jianyu Wang and Gauri Joshi. Cooperative sgd: A unified framework for the design and analysis", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 126, + 560, + 506, + 575 + ], + "spans": [ + { + "bbox": [ + 126, + 560, + 506, + 575 + ], + "score": 1.0, + "content": "of communication-efficient sgd algorithms. In ICML Workshop on Coding Theory for Machine", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 125, + 572, + 195, + 585 + ], + "spans": [ + { + "bbox": [ + 125, + 572, + 195, + 585 + ], + "score": 1.0, + "content": "Learning, 2019.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 590, + 505, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 590, + 505, + 603 + ], + "score": 1.0, + "content": "[39] Jianyu Wang, Qinghua Liu, Hao Liang, Gauri Joshi, and H Vincent Poor. Tackling the objective", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 126, + 601, + 506, + 615 + ], + "spans": [ + { + "bbox": [ + 126, + 601, + 506, + 615 + ], + "score": 1.0, + "content": "inconsistency problem in heterogeneous federated optimization. Advances in Neural Information", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 126, + 612, + 251, + 626 + ], + "spans": [ + { + "bbox": [ + 126, + 612, + 251, + 626 + ], + "score": 1.0, + "content": "Processing Systems, 33, 2020.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 630, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 506, + 645 + ], + "score": 1.0, + "content": "[40] Cong Xie, Sanmi Koyejo, and Indranil Gupta. Asynchronous federated optimization. arXiv", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 125, + 641, + 267, + 655 + ], + "spans": [ + { + "bbox": [ + 125, + 641, + 267, + 655 + ], + "score": 1.0, + "content": "preprint arXiv:1903.03934, 2019.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 657, + 507, + 675 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 507, + 675 + ], + "score": 1.0, + "content": "[41] Yikai Yan, Chaoyue Niu, Yucheng Ding, Zhenzhe Zheng, Fan Wu, Guihai Chen, Shaojie Tang,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 126, + 669, + 507, + 685 + ], + "spans": [ + { + "bbox": [ + 126, + 669, + 507, + 685 + ], + "score": 1.0, + "content": "and Zhihua Wu. Distributed non-convex optimization with sublinear speedup under intermittent", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 127, + 681, + 365, + 695 + ], + "spans": [ + { + "bbox": [ + 127, + 681, + 365, + 695 + ], + "score": 1.0, + "content": "client availability. arXiv preprint arXiv:2002.07399, 2020.", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 699, + 506, + 714 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 714 + ], + "score": 1.0, + "content": "[42] Haibo Yang, Minghong Fang, and Jia Liu. Achieving linear speedup with partial worker", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 126, + 711, + 464, + 724 + ], + "spans": [ + { + "bbox": [ + 126, + 711, + 464, + 724 + ], + "score": 1.0, + "content": "participation in non-iid federated learning. arXiv preprint arXiv:2101.11203, 2021.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 23.5 + } + ], + "page_idx": 11, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 741, + 311, + 750 + ], + "lines": [ + { + "bbox": [ + 299, + 740, + 313, + 754 + ], + "spans": [ + { + "bbox": [ + 299, + 740, + 313, + 754 + ], + "score": 1.0, + "content": "12", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "list", + "bbox": [ + 105, + 36, + 507, + 730 + ], + "lines": [ + { + "bbox": [ + 105, + 72, + 506, + 87 + ], + "spans": [ + { + "bbox": [ + 105, + 72, + 506, + 87 + ], + "score": 1.0, + "content": "[25] Tian Li, Anit Kumar Sahu, Manzil Zaheer, Maziar Sanjabi, Ameet Talwalkar, and Virginia", + "type": "text" + } + ], + "index": 0, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 83, + 506, + 97 + ], + "spans": [ + { + "bbox": [ + 127, + 83, + 506, + 97 + ], + "score": 1.0, + "content": "Smith. Federated optimization in heterogeneous networks. In I. Dhillon, D. Papailiopoulos, and", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 127, + 94, + 507, + 109 + ], + "spans": [ + { + "bbox": [ + 127, + 94, + 507, + 109 + ], + "score": 1.0, + "content": "V. Sze, editors, Proceedings of Machine Learning and Systems, volume 2, pages 429–450, 2020.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 113, + 505, + 126 + ], + "spans": [ + { + "bbox": [ + 107, + 113, + 505, + 126 + ], + "score": 1.0, + "content": "[26] Xiang Li, Kaixuan Huang, Wenhao Yang, Shusen Wang, and Zhihua Zhang. On the convergence", + "type": "text" + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 123, + 494, + 138 + ], + "spans": [ + { + "bbox": [ + 127, + 123, + 494, + 138 + ], + "score": 1.0, + "content": "of fedavg on non-iid data. In International Conference on Learning Representations, 2020.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 142, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 506, + 156 + ], + "score": 1.0, + "content": "[27] Xiangru Lian, Yijun Huang, Yuncheng Li, and Ji Liu. Asynchronous parallel stochastic gradient", + "type": "text" + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 152, + 507, + 167 + ], + "spans": [ + { + "bbox": [ + 127, + 152, + 507, + 167 + ], + "score": 1.0, + "content": "for nonconvex optimization. In C. Cortes, N. Lawrence, D. Lee, M. Sugiyama, and R. Garnett,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 126, + 163, + 507, + 178 + ], + "spans": [ + { + "bbox": [ + 126, + 163, + 507, + 178 + ], + "score": 1.0, + "content": "editors, Advances in Neural Information Processing Systems, volume 28. Curran Associates,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 126, + 173, + 175, + 188 + ], + "spans": [ + { + "bbox": [ + 126, + 173, + 175, + 188 + ], + "score": 1.0, + "content": "Inc., 2015.", + "type": "text" + } + ], + "index": 8, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 192, + 507, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 507, + 207 + ], + "score": 1.0, + "content": "[28] Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Aguera y Arcas.", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 203, + 506, + 218 + ], + "spans": [ + { + "bbox": [ + 127, + 203, + 506, + 218 + ], + "score": 1.0, + "content": "Communication-efficient learning of deep networks from decentralized data. In Artificial", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 127, + 214, + 369, + 229 + ], + "spans": [ + { + "bbox": [ + 127, + 214, + 369, + 229 + ], + "score": 1.0, + "content": "Intelligence and Statistics, pages 1273–1282. PMLR, 2017.", + "type": "text" + } + ], + "index": 11, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 233, + 505, + 245 + ], + "spans": [ + { + "bbox": [ + 106, + 233, + 505, + 245 + ], + "score": 1.0, + "content": "[29] Arkadij Semenovic Nemirovskij and David Borisovich Yudin. Problem complexity and method ˇ", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 244, + 262, + 257 + ], + "spans": [ + { + "bbox": [ + 126, + 244, + 262, + 257 + ], + "score": 1.0, + "content": "efficiency in optimization. 1983.", + "type": "text" + } + ], + "index": 13, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 261, + 506, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 506, + 276 + ], + "score": 1.0, + "content": "[30] Constantin Philippenko and Aymeric Dieuleveut. Bidirectional compression in heterogeneous", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 125, + 272, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 125, + 272, + 506, + 288 + ], + "score": 1.0, + "content": "settings for distributed or federated learning with partial participation: tight convergence", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 126, + 283, + 339, + 298 + ], + "spans": [ + { + "bbox": [ + 126, + 283, + 339, + 298 + ], + "score": 1.0, + "content": "guarantees. arXiv preprint arXiv:2006.14591, 2020.", + "type": "text" + } + ], + "index": 16, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 302, + 506, + 317 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 506, + 317 + ], + "score": 1.0, + "content": "[31] Amirhossein Reisizadeh, Isidoros Tziotis, Hamed Hassani, Aryan Mokhtari, and Ramtin", + "type": "text" + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 313, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 127, + 313, + 505, + 327 + ], + "score": 1.0, + "content": "Pedarsani. Straggler-resilient federated learning: Leveraging the interplay between statistical", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 126, + 324, + 435, + 337 + ], + "spans": [ + { + "bbox": [ + 126, + 324, + 435, + 337 + ], + "score": 1.0, + "content": "accuracy and system heterogeneity. arXiv preprint arXiv:2012.14453, 2020.", + "type": "text" + } + ], + "index": 19, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 342, + 506, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 506, + 356 + ], + "score": 1.0, + "content": "[32] Yichen Ruan, Xiaoxi Zhang, Shu-Che Liang, and Carlee Joe-Wong. Towards flexible device", + "type": "text" + } + ], + "index": 20, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 353, + 505, + 367 + ], + "spans": [ + { + "bbox": [ + 127, + 353, + 505, + 367 + ], + "score": 1.0, + "content": "participation in federated learning. In International Conference on Artificial Intelligence and", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 126, + 365, + 302, + 379 + ], + "spans": [ + { + "bbox": [ + 126, + 365, + 302, + 379 + ], + "score": 1.0, + "content": "Statistics, pages 3403–3411. PMLR, 2021.", + "type": "text" + } + ], + "index": 22, + "is_list_end_line": true + }, + { + "bbox": [ + 107, + 383, + 505, + 395 + ], + "spans": [ + { + "bbox": [ + 107, + 383, + 505, + 395 + ], + "score": 1.0, + "content": "[33] Felix Sattler, Simon Wiedemann, Klaus-Robert Müller, and Wojciech Samek. Robust and", + "type": "text" + } + ], + "index": 23, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 394, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 127, + 394, + 505, + 406 + ], + "score": 1.0, + "content": "communication-efficient federated learning from non-iid data. IEEE transactions on neural", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 127, + 405, + 355, + 417 + ], + "spans": [ + { + "bbox": [ + 127, + 405, + 355, + 417 + ], + "score": 1.0, + "content": "networks and learning systems, 31(9):3400–3413, 2019.", + "type": "text" + } + ], + "index": 25, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 422, + 506, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 422, + 506, + 437 + ], + "score": 1.0, + "content": "[34] Virginia Smith, Chao-Kai Chiang, Maziar Sanjabi, and Ameet Talwalkar. Federated multi-task", + "type": "text" + } + ], + "index": 26, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 433, + 330, + 447 + ], + "spans": [ + { + "bbox": [ + 127, + 433, + 330, + 447 + ], + "score": 1.0, + "content": "learning. arXiv preprint arXiv:1705.10467, 2017.", + "type": "text" + } + ], + "index": 27, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 451, + 506, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 451, + 506, + 466 + ], + "score": 1.0, + "content": "[35] Sebastian U Stich and Sai Praneeth Karimireddy. The error-feedback framework: Better rates", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 464, + 506, + 475 + ], + "spans": [ + { + "bbox": [ + 127, + 464, + 506, + 475 + ], + "score": 1.0, + "content": "for sgd with delayed gradients and compressed updates. Journal of Machine Learning Research,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 127, + 474, + 191, + 486 + ], + "spans": [ + { + "bbox": [ + 127, + 474, + 191, + 486 + ], + "score": 1.0, + "content": "21:1–36, 2020.", + "type": "text" + } + ], + "index": 30, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 491, + 507, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 507, + 505 + ], + "score": 1.0, + "content": "[36] Sebastian Urban Stich. Local sgd converges fast and communicates little. In ICLR 2019-", + "type": "text" + } + ], + "index": 31, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 504, + 439, + 516 + ], + "spans": [ + { + "bbox": [ + 127, + 504, + 439, + 516 + ], + "score": 1.0, + "content": "International Conference on Learning Representations, number CONF, 2019.", + "type": "text" + } + ], + "index": 32, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 520, + 506, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 520, + 506, + 535 + ], + "score": 1.0, + "content": "[37] Roman Vershynin. High-dimensional probability: An introduction with applications in data", + "type": "text" + } + ], + "index": 33, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 531, + 349, + 546 + ], + "spans": [ + { + "bbox": [ + 127, + 531, + 349, + 546 + ], + "score": 1.0, + "content": "science, volume 47. Cambridge university press, 2018.", + "type": "text" + } + ], + "index": 34, + "is_list_end_line": true + }, + { + "bbox": [ + 107, + 551, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 107, + 551, + 505, + 563 + ], + "score": 1.0, + "content": "[38] Jianyu Wang and Gauri Joshi. Cooperative sgd: A unified framework for the design and analysis", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 560, + 506, + 575 + ], + "spans": [ + { + "bbox": [ + 126, + 560, + 506, + 575 + ], + "score": 1.0, + "content": "of communication-efficient sgd algorithms. In ICML Workshop on Coding Theory for Machine", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 125, + 572, + 195, + 585 + ], + "spans": [ + { + "bbox": [ + 125, + 572, + 195, + 585 + ], + "score": 1.0, + "content": "Learning, 2019.", + "type": "text" + } + ], + "index": 37, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 590, + 505, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 590, + 505, + 603 + ], + "score": 1.0, + "content": "[39] Jianyu Wang, Qinghua Liu, Hao Liang, Gauri Joshi, and H Vincent Poor. Tackling the objective", + "type": "text" + } + ], + "index": 38, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 601, + 506, + 615 + ], + "spans": [ + { + "bbox": [ + 126, + 601, + 506, + 615 + ], + "score": 1.0, + "content": "inconsistency problem in heterogeneous federated optimization. Advances in Neural Information", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 126, + 612, + 251, + 626 + ], + "spans": [ + { + "bbox": [ + 126, + 612, + 251, + 626 + ], + "score": 1.0, + "content": "Processing Systems, 33, 2020.", + "type": "text" + } + ], + "index": 40, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 630, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 506, + 645 + ], + "score": 1.0, + "content": "[40] Cong Xie, Sanmi Koyejo, and Indranil Gupta. Asynchronous federated optimization. arXiv", + "type": "text" + } + ], + "index": 41, + "is_list_start_line": true + }, + { + "bbox": [ + 125, + 641, + 267, + 655 + ], + "spans": [ + { + "bbox": [ + 125, + 641, + 267, + 655 + ], + "score": 1.0, + "content": "preprint arXiv:1903.03934, 2019.", + "type": "text" + } + ], + "index": 42, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 657, + 507, + 675 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 507, + 675 + ], + "score": 1.0, + "content": "[41] Yikai Yan, Chaoyue Niu, Yucheng Ding, Zhenzhe Zheng, Fan Wu, Guihai Chen, Shaojie Tang,", + "type": "text" + } + ], + "index": 43, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 669, + 507, + 685 + ], + "spans": [ + { + "bbox": [ + 126, + 669, + 507, + 685 + ], + "score": 1.0, + "content": "and Zhihua Wu. Distributed non-convex optimization with sublinear speedup under intermittent", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 127, + 681, + 365, + 695 + ], + "spans": [ + { + "bbox": [ + 127, + 681, + 365, + 695 + ], + "score": 1.0, + "content": "client availability. arXiv preprint arXiv:2002.07399, 2020.", + "type": "text" + } + ], + "index": 45, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 699, + 506, + 714 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 714 + ], + "score": 1.0, + "content": "[42] Haibo Yang, Minghong Fang, and Jia Liu. Achieving linear speedup with partial worker", + "type": "text" + } + ], + "index": 46, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 711, + 464, + 724 + ], + "spans": [ + { + "bbox": [ + 126, + 711, + 464, + 724 + ], + "score": 1.0, + "content": "participation in non-iid federated learning. arXiv preprint arXiv:2101.11203, 2021.", + "type": "text" + } + ], + "index": 47, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 73, + 506, + 86 + ], + "spans": [ + { + "bbox": [ + 106, + 73, + 506, + 86 + ], + "score": 1.0, + "content": "[43] Hao Yu, Rong Jin, and Sen Yang. On the linear speedup analysis of communication efficient", + "type": "text", + "cross_page": true + } + ], + "index": 0, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 84, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 127, + 84, + 505, + 96 + ], + "score": 1.0, + "content": "momentum sgd for distributed non-convex optimization. In International Conference on", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 126, + 94, + 338, + 107 + ], + "spans": [ + { + "bbox": [ + 126, + 94, + 338, + 107 + ], + "score": 1.0, + "content": "Machine Learning, pages 7184–7193. PMLR, 2019.", + "type": "text", + "cross_page": true + } + ], + "index": 2, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 113, + 506, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 113, + 506, + 125 + ], + "score": 1.0, + "content": "[44] Jingzhao Zhang, Sai Praneeth Karimireddy, Andreas Veit, Seungyeon Kim, Sashank J Reddi,", + "type": "text", + "cross_page": true + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 123, + 496, + 135 + ], + "spans": [ + { + "bbox": [ + 127, + 123, + 496, + 135 + ], + "score": 1.0, + "content": "Sanjiv Kumar, and Suvrit Sra. Why are adaptive methods good for attention models?, 2020.", + "type": "text", + "cross_page": true + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 140, + 505, + 154 + ], + "spans": [ + { + "bbox": [ + 105, + 140, + 505, + 154 + ], + "score": 1.0, + "content": "[45] Xin Zhang, Jia Liu, and Zhengyuan Zhu. Taming convergence for asynchronous stochastic", + "type": "text", + "cross_page": true + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 152, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 127, + 152, + 505, + 165 + ], + "score": 1.0, + "content": "gradient descent with unbounded delay in non-convex learning. In 2020 59th IEEE Conference", + "type": "text", + "cross_page": true + } + ], + "index": 6 + }, + { + "bbox": [ + 127, + 163, + 387, + 174 + ], + "spans": [ + { + "bbox": [ + 127, + 163, + 387, + 174 + ], + "score": 1.0, + "content": "on Decision and Control (CDC), pages 3580–3585. IEEE, 2020.", + "type": "text", + "cross_page": true + } + ], + "index": 7, + "is_list_end_line": true + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 72, + 507, + 724 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 72, + 506, + 175 + ], + "lines": [ + { + "bbox": [ + 106, + 73, + 506, + 86 + ], + "spans": [ + { + "bbox": [ + 106, + 73, + 506, + 86 + ], + "score": 1.0, + "content": "[43] Hao Yu, Rong Jin, and Sen Yang. On the linear speedup analysis of communication efficient", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 127, + 84, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 127, + 84, + 505, + 96 + ], + "score": 1.0, + "content": "momentum sgd for distributed non-convex optimization. In International Conference on", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 126, + 94, + 338, + 107 + ], + "spans": [ + { + "bbox": [ + 126, + 94, + 338, + 107 + ], + "score": 1.0, + "content": "Machine Learning, pages 7184–7193. PMLR, 2019.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 113, + 506, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 113, + 506, + 125 + ], + "score": 1.0, + "content": "[44] Jingzhao Zhang, Sai Praneeth Karimireddy, Andreas Veit, Seungyeon Kim, Sashank J Reddi,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 127, + 123, + 496, + 135 + ], + "spans": [ + { + "bbox": [ + 127, + 123, + 496, + 135 + ], + "score": 1.0, + "content": "Sanjiv Kumar, and Suvrit Sra. Why are adaptive methods good for attention models?, 2020.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 140, + 505, + 154 + ], + "spans": [ + { + "bbox": [ + 105, + 140, + 505, + 154 + ], + "score": 1.0, + "content": "[45] Xin Zhang, Jia Liu, and Zhengyuan Zhu. Taming convergence for asynchronous stochastic", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 127, + 152, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 127, + 152, + 505, + 165 + ], + "score": 1.0, + "content": "gradient descent with unbounded delay in non-convex learning. In 2020 59th IEEE Conference", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 127, + 163, + 387, + 174 + ], + "spans": [ + { + "bbox": [ + 127, + 163, + 387, + 174 + ], + "score": 1.0, + "content": "on Decision and Control (CDC), pages 3580–3585. IEEE, 2020.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 3.5 + }, + { + "type": "title", + "bbox": [ + 107, + 192, + 156, + 205 + ], + "lines": [ + { + "bbox": [ + 106, + 191, + 158, + 206 + ], + "spans": [ + { + "bbox": [ + 106, + 191, + 158, + 206 + ], + "score": 1.0, + "content": "Checklist", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 131, + 213, + 208, + 223 + ], + "lines": [ + { + "bbox": [ + 129, + 211, + 210, + 225 + ], + "spans": [ + { + "bbox": [ + 129, + 211, + 210, + 225 + ], + "score": 1.0, + "content": "1. For all authors...", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 146, + 226, + 505, + 319 + ], + "lines": [ + { + "bbox": [ + 145, + 226, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 145, + 226, + 505, + 239 + ], + "score": 1.0, + "content": "(a) Do the main claims made in the abstract and introduction accurately reflect the paper’s", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 162, + 237, + 288, + 250 + ], + "spans": [ + { + "bbox": [ + 162, + 237, + 288, + 250 + ], + "score": 1.0, + "content": "contributions and scope? [Yes]", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 144, + 249, + 436, + 263 + ], + "spans": [ + { + "bbox": [ + 144, + 249, + 436, + 263 + ], + "score": 1.0, + "content": "(b) Did you describe the limitations of your work? [Yes] See Section 8.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 145, + 262, + 506, + 275 + ], + "spans": [ + { + "bbox": [ + 145, + 262, + 506, + 275 + ], + "score": 1.0, + "content": "(c) Did you discuss any potential negative societal impacts of your work? [N/A] Our work", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 162, + 274, + 506, + 285 + ], + "spans": [ + { + "bbox": [ + 162, + 274, + 506, + 285 + ], + "score": 1.0, + "content": "is mainly theoretical and targets at providing theoretical analysis of the FL algorithms,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 162, + 284, + 351, + 296 + ], + "spans": [ + { + "bbox": [ + 162, + 284, + 351, + 296 + ], + "score": 1.0, + "content": "which has almost no negative societal impacts.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 144, + 295, + 505, + 309 + ], + "spans": [ + { + "bbox": [ + 144, + 295, + 505, + 309 + ], + "score": 1.0, + "content": "(d) Have you read the ethics review guidelines and ensured that your paper conforms to", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 161, + 306, + 214, + 320 + ], + "spans": [ + { + "bbox": [ + 161, + 306, + 214, + 320 + ], + "score": 1.0, + "content": "them? [Yes]", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 131, + 321, + 302, + 333 + ], + "lines": [ + { + "bbox": [ + 129, + 320, + 304, + 335 + ], + "spans": [ + { + "bbox": [ + 129, + 320, + 304, + 335 + ], + "score": 1.0, + "content": "2. If you are including theoretical results...", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 146, + 335, + 505, + 381 + ], + "lines": [ + { + "bbox": [ + 145, + 334, + 506, + 349 + ], + "spans": [ + { + "bbox": [ + 145, + 334, + 506, + 349 + ], + "score": 1.0, + "content": "(a) Did you state the full set of assumptions of all theoretical results? [Yes] The assump-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 162, + 346, + 377, + 358 + ], + "spans": [ + { + "bbox": [ + 162, + 346, + 377, + 358 + ], + "score": 1.0, + "content": "tions are rigorously stated in Section 5 and Section 6.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 145, + 359, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 145, + 359, + 505, + 371 + ], + "score": 1.0, + "content": "(b) Did you include complete proofs of all theoretical results? [Yes] All the proofs are", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 162, + 369, + 264, + 383 + ], + "spans": [ + { + "bbox": [ + 162, + 369, + 264, + 383 + ], + "score": 1.0, + "content": "deferred to the appendix.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 131, + 384, + 241, + 395 + ], + "lines": [ + { + "bbox": [ + 128, + 382, + 243, + 398 + ], + "spans": [ + { + "bbox": [ + 128, + 382, + 243, + 398 + ], + "score": 1.0, + "content": "3. If you ran experiments...", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 146, + 399, + 505, + 511 + ], + "lines": [ + { + "bbox": [ + 145, + 398, + 506, + 410 + ], + "spans": [ + { + "bbox": [ + 145, + 398, + 506, + 410 + ], + "score": 1.0, + "content": "(a) Did you include the code, data, and instructions needed to reproduce the main experi-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 161, + 408, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 161, + 408, + 505, + 421 + ], + "score": 1.0, + "content": "mental results (either in the supplemental material or as a URL)? [Yes] Our code will be", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 162, + 420, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 162, + 420, + 505, + 432 + ], + "score": 1.0, + "content": "included in the supplemental material. The datasets we use are public. The instructions", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 162, + 431, + 488, + 443 + ], + "spans": [ + { + "bbox": [ + 162, + 431, + 488, + 443 + ], + "score": 1.0, + "content": "needed to reproduce the main experimental results are clearly stated in Section 7.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 146, + 442, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 146, + 444, + 160, + 455 + ], + "score": 1.0, + "content": "(b)", + "type": "text" + }, + { + "bbox": [ + 160, + 442, + 505, + 457 + ], + "score": 1.0, + "content": "Did you specify all the training details (e.g., data splits, hyperparameters, how they", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 162, + 454, + 306, + 466 + ], + "spans": [ + { + "bbox": [ + 162, + 454, + 306, + 466 + ], + "score": 1.0, + "content": "were chosen)? [Yes] See Section 7.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 146, + 466, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 146, + 468, + 160, + 478 + ], + "score": 1.0, + "content": "(c)", + "type": "text" + }, + { + "bbox": [ + 161, + 466, + 506, + 479 + ], + "score": 1.0, + "content": "Did you report error bars (e.g., with respect to the random seed after running experi-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 161, + 477, + 340, + 489 + ], + "spans": [ + { + "bbox": [ + 161, + 477, + 340, + 489 + ], + "score": 1.0, + "content": "ments multiple times)? [Yes] See Section 7.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 146, + 488, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 146, + 488, + 505, + 502 + ], + "score": 1.0, + "content": "(d) Did you include the total amount of compute and the type of resources used (e.g., type", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 162, + 501, + 429, + 513 + ], + "spans": [ + { + "bbox": [ + 162, + 501, + 429, + 513 + ], + "score": 1.0, + "content": "of GPUs, internal cluster, or cloud provider)? [Yes] See Section 7.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 132, + 515, + 504, + 526 + ], + "lines": [ + { + "bbox": [ + 129, + 513, + 507, + 528 + ], + "spans": [ + { + "bbox": [ + 129, + 513, + 507, + 528 + ], + "score": 1.0, + "content": "4. If you are using existing assets (e.g., code, data, models) or curating/releasing new assets...", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 146, + 529, + 505, + 632 + ], + "lines": [ + { + "bbox": [ + 145, + 529, + 483, + 542 + ], + "spans": [ + { + "bbox": [ + 145, + 529, + 483, + 542 + ], + "score": 1.0, + "content": "(a) If your work uses existing assets, did you cite the creators? [Yes] See Section 7.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 145, + 541, + 416, + 554 + ], + "spans": [ + { + "bbox": [ + 145, + 541, + 416, + 554 + ], + "score": 1.0, + "content": "(b) Did you mention the license of the assets? [Yes] See Section 7.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 145, + 553, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 145, + 553, + 505, + 567 + ], + "score": 1.0, + "content": "(c) Did you include any new assets either in the supplemental material or as a URL? [Yes]", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 161, + 564, + 495, + 577 + ], + "spans": [ + { + "bbox": [ + 161, + 564, + 495, + 577 + ], + "score": 1.0, + "content": "We include our code for reproducing the experiments in the supplemental material.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 146, + 577, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 146, + 577, + 505, + 588 + ], + "score": 1.0, + "content": "(d) Did you discuss whether and how consent was obtained from people whose data you’re", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 162, + 588, + 507, + 600 + ], + "spans": [ + { + "bbox": [ + 162, + 588, + 507, + 600 + ], + "score": 1.0, + "content": "using/curating? [N/A] We choose the commonly-used MNIST and CIFAR-10 datasets.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 146, + 599, + 506, + 612 + ], + "spans": [ + { + "bbox": [ + 146, + 599, + 506, + 612 + ], + "score": 1.0, + "content": "(e) Did you discuss whether the data you are using/curating contains personally identifiable", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 162, + 610, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 162, + 610, + 505, + 622 + ], + "score": 1.0, + "content": "information or offensive content? [N/A] We choose the commonly-used MNIST and", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 162, + 622, + 243, + 633 + ], + "spans": [ + { + "bbox": [ + 162, + 622, + 243, + 633 + ], + "score": 1.0, + "content": "CIFAR-10 datasets.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 131, + 636, + 432, + 647 + ], + "lines": [ + { + "bbox": [ + 128, + 633, + 433, + 650 + ], + "spans": [ + { + "bbox": [ + 128, + 633, + 433, + 650 + ], + "score": 1.0, + "content": "5. If you used crowdsourcing or conducted research with human subjects...", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 44 + }, + { + "type": "text", + "bbox": [ + 146, + 650, + 505, + 720 + ], + "lines": [ + { + "bbox": [ + 145, + 650, + 506, + 663 + ], + "spans": [ + { + "bbox": [ + 145, + 650, + 506, + 663 + ], + "score": 1.0, + "content": "(a) Did you include the full text of instructions given to participants and screenshots, if", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 161, + 660, + 237, + 674 + ], + "spans": [ + { + "bbox": [ + 161, + 660, + 237, + 674 + ], + "score": 1.0, + "content": "applicable? [N/A]", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 145, + 673, + 505, + 686 + ], + "spans": [ + { + "bbox": [ + 145, + 673, + 505, + 686 + ], + "score": 1.0, + "content": "(b) Did you describe any potential participant risks, with links to Institutional Review", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 161, + 683, + 342, + 697 + ], + "spans": [ + { + "bbox": [ + 161, + 683, + 342, + 697 + ], + "score": 1.0, + "content": "Board (IRB) approvals, if applicable? [N/A]", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 146, + 696, + 505, + 709 + ], + "spans": [ + { + "bbox": [ + 146, + 697, + 160, + 708 + ], + "score": 1.0, + "content": "(c)", + "type": "text" + }, + { + "bbox": [ + 161, + 696, + 505, + 709 + ], + "score": 1.0, + "content": "Did you include the estimated hourly wage paid to participants and the total amount", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 161, + 708, + 333, + 720 + ], + "spans": [ + { + "bbox": [ + 161, + 708, + 333, + 720 + ], + "score": 1.0, + "content": "spent on participant compensation? [N/A]", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 47.5 + } + ], + "page_idx": 12, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 741, + 311, + 750 + ], + "lines": [ + { + "bbox": [ + 299, + 740, + 312, + 754 + ], + "spans": [ + { + "bbox": [ + 299, + 740, + 312, + 754 + ], + "score": 1.0, + "content": "13", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "list", + "bbox": [ + 106, + 72, + 506, + 175 + ], + "lines": [], + "index": 3.5, + "bbox_fs": [ + 105, + 73, + 506, + 174 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 107, + 192, + 156, + 205 + ], + "lines": [ + { + "bbox": [ + 106, + 191, + 158, + 206 + ], + "spans": [ + { + "bbox": [ + 106, + 191, + 158, + 206 + ], + "score": 1.0, + "content": "Checklist", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 131, + 213, + 208, + 223 + ], + "lines": [ + { + "bbox": [ + 129, + 211, + 210, + 225 + ], + "spans": [ + { + "bbox": [ + 129, + 211, + 210, + 225 + ], + "score": 1.0, + "content": "1. For all authors...", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 129, + 211, + 210, + 225 + ] + }, + { + "type": "list", + "bbox": [ + 146, + 226, + 505, + 319 + ], + "lines": [ + { + "bbox": [ + 145, + 226, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 145, + 226, + 505, + 239 + ], + "score": 1.0, + "content": "(a) Do the main claims made in the abstract and introduction accurately reflect the paper’s", + "type": "text" + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 237, + 288, + 250 + ], + "spans": [ + { + "bbox": [ + 162, + 237, + 288, + 250 + ], + "score": 1.0, + "content": "contributions and scope? [Yes]", + "type": "text" + } + ], + "index": 11, + "is_list_end_line": true + }, + { + "bbox": [ + 144, + 249, + 436, + 263 + ], + "spans": [ + { + "bbox": [ + 144, + 249, + 436, + 263 + ], + "score": 1.0, + "content": "(b) Did you describe the limitations of your work? [Yes] See Section 8.", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 145, + 262, + 506, + 275 + ], + "spans": [ + { + "bbox": [ + 145, + 262, + 506, + 275 + ], + "score": 1.0, + "content": "(c) Did you discuss any potential negative societal impacts of your work? [N/A] Our work", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 274, + 506, + 285 + ], + "spans": [ + { + "bbox": [ + 162, + 274, + 506, + 285 + ], + "score": 1.0, + "content": "is mainly theoretical and targets at providing theoretical analysis of the FL algorithms,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 162, + 284, + 351, + 296 + ], + "spans": [ + { + "bbox": [ + 162, + 284, + 351, + 296 + ], + "score": 1.0, + "content": "which has almost no negative societal impacts.", + "type": "text" + } + ], + "index": 15, + "is_list_end_line": true + }, + { + "bbox": [ + 144, + 295, + 505, + 309 + ], + "spans": [ + { + "bbox": [ + 144, + 295, + 505, + 309 + ], + "score": 1.0, + "content": "(d) Have you read the ethics review guidelines and ensured that your paper conforms to", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 161, + 306, + 214, + 320 + ], + "spans": [ + { + "bbox": [ + 161, + 306, + 214, + 320 + ], + "score": 1.0, + "content": "them? [Yes]", + "type": "text" + } + ], + "index": 17, + "is_list_end_line": true + } + ], + "index": 13.5, + "bbox_fs": [ + 144, + 226, + 506, + 320 + ] + }, + { + "type": "text", + "bbox": [ + 131, + 321, + 302, + 333 + ], + "lines": [ + { + "bbox": [ + 129, + 320, + 304, + 335 + ], + "spans": [ + { + "bbox": [ + 129, + 320, + 304, + 335 + ], + "score": 1.0, + "content": "2. If you are including theoretical results...", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18, + "bbox_fs": [ + 129, + 320, + 304, + 335 + ] + }, + { + "type": "list", + "bbox": [ + 146, + 335, + 505, + 381 + ], + "lines": [ + { + "bbox": [ + 145, + 334, + 506, + 349 + ], + "spans": [ + { + "bbox": [ + 145, + 334, + 506, + 349 + ], + "score": 1.0, + "content": "(a) Did you state the full set of assumptions of all theoretical results? [Yes] The assump-", + "type": "text" + } + ], + "index": 19, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 346, + 377, + 358 + ], + "spans": [ + { + "bbox": [ + 162, + 346, + 377, + 358 + ], + "score": 1.0, + "content": "tions are rigorously stated in Section 5 and Section 6.", + "type": "text" + } + ], + "index": 20, + "is_list_end_line": true + }, + { + "bbox": [ + 145, + 359, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 145, + 359, + 505, + 371 + ], + "score": 1.0, + "content": "(b) Did you include complete proofs of all theoretical results? [Yes] All the proofs are", + "type": "text" + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 369, + 264, + 383 + ], + "spans": [ + { + "bbox": [ + 162, + 369, + 264, + 383 + ], + "score": 1.0, + "content": "deferred to the appendix.", + "type": "text" + } + ], + "index": 22, + "is_list_end_line": true + } + ], + "index": 20.5, + "bbox_fs": [ + 145, + 334, + 506, + 383 + ] + }, + { + "type": "text", + "bbox": [ + 131, + 384, + 241, + 395 + ], + "lines": [ + { + "bbox": [ + 128, + 382, + 243, + 398 + ], + "spans": [ + { + "bbox": [ + 128, + 382, + 243, + 398 + ], + "score": 1.0, + "content": "3. If you ran experiments...", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23, + "bbox_fs": [ + 128, + 382, + 243, + 398 + ] + }, + { + "type": "list", + "bbox": [ + 146, + 399, + 505, + 511 + ], + "lines": [ + { + "bbox": [ + 145, + 398, + 506, + 410 + ], + "spans": [ + { + "bbox": [ + 145, + 398, + 506, + 410 + ], + "score": 1.0, + "content": "(a) Did you include the code, data, and instructions needed to reproduce the main experi-", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 161, + 408, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 161, + 408, + 505, + 421 + ], + "score": 1.0, + "content": "mental results (either in the supplemental material or as a URL)? [Yes] Our code will be", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 162, + 420, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 162, + 420, + 505, + 432 + ], + "score": 1.0, + "content": "included in the supplemental material. The datasets we use are public. The instructions", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 162, + 431, + 488, + 443 + ], + "spans": [ + { + "bbox": [ + 162, + 431, + 488, + 443 + ], + "score": 1.0, + "content": "needed to reproduce the main experimental results are clearly stated in Section 7.", + "type": "text" + } + ], + "index": 27, + "is_list_end_line": true + }, + { + "bbox": [ + 146, + 442, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 146, + 444, + 160, + 455 + ], + "score": 1.0, + "content": "(b)", + "type": "text" + }, + { + "bbox": [ + 160, + 442, + 505, + 457 + ], + "score": 1.0, + "content": "Did you specify all the training details (e.g., data splits, hyperparameters, how they", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 454, + 306, + 466 + ], + "spans": [ + { + "bbox": [ + 162, + 454, + 306, + 466 + ], + "score": 1.0, + "content": "were chosen)? [Yes] See Section 7.", + "type": "text" + } + ], + "index": 29, + "is_list_end_line": true + }, + { + "bbox": [ + 146, + 466, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 146, + 468, + 160, + 478 + ], + "score": 1.0, + "content": "(c)", + "type": "text" + }, + { + "bbox": [ + 161, + 466, + 506, + 479 + ], + "score": 1.0, + "content": "Did you report error bars (e.g., with respect to the random seed after running experi-", + "type": "text" + } + ], + "index": 30, + "is_list_start_line": true + }, + { + "bbox": [ + 161, + 477, + 340, + 489 + ], + "spans": [ + { + "bbox": [ + 161, + 477, + 340, + 489 + ], + "score": 1.0, + "content": "ments multiple times)? [Yes] See Section 7.", + "type": "text" + } + ], + "index": 31, + "is_list_end_line": true + }, + { + "bbox": [ + 146, + 488, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 146, + 488, + 505, + 502 + ], + "score": 1.0, + "content": "(d) Did you include the total amount of compute and the type of resources used (e.g., type", + "type": "text" + } + ], + "index": 32, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 501, + 429, + 513 + ], + "spans": [ + { + "bbox": [ + 162, + 501, + 429, + 513 + ], + "score": 1.0, + "content": "of GPUs, internal cluster, or cloud provider)? [Yes] See Section 7.", + "type": "text" + } + ], + "index": 33, + "is_list_end_line": true + } + ], + "index": 28.5, + "bbox_fs": [ + 145, + 398, + 506, + 513 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 515, + 504, + 526 + ], + "lines": [ + { + "bbox": [ + 129, + 513, + 507, + 528 + ], + "spans": [ + { + "bbox": [ + 129, + 513, + 507, + 528 + ], + "score": 1.0, + "content": "4. If you are using existing assets (e.g., code, data, models) or curating/releasing new assets...", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34, + "bbox_fs": [ + 129, + 513, + 507, + 528 + ] + }, + { + "type": "list", + "bbox": [ + 146, + 529, + 505, + 632 + ], + "lines": [ + { + "bbox": [ + 145, + 529, + 483, + 542 + ], + "spans": [ + { + "bbox": [ + 145, + 529, + 483, + 542 + ], + "score": 1.0, + "content": "(a) If your work uses existing assets, did you cite the creators? [Yes] See Section 7.", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 145, + 541, + 416, + 554 + ], + "spans": [ + { + "bbox": [ + 145, + 541, + 416, + 554 + ], + "score": 1.0, + "content": "(b) Did you mention the license of the assets? [Yes] See Section 7.", + "type": "text" + } + ], + "index": 36, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 145, + 553, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 145, + 553, + 505, + 567 + ], + "score": 1.0, + "content": "(c) Did you include any new assets either in the supplemental material or as a URL? [Yes]", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 161, + 564, + 495, + 577 + ], + "spans": [ + { + "bbox": [ + 161, + 564, + 495, + 577 + ], + "score": 1.0, + "content": "We include our code for reproducing the experiments in the supplemental material.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 146, + 577, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 146, + 577, + 505, + 588 + ], + "score": 1.0, + "content": "(d) Did you discuss whether and how consent was obtained from people whose data you’re", + "type": "text" + } + ], + "index": 39, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 588, + 507, + 600 + ], + "spans": [ + { + "bbox": [ + 162, + 588, + 507, + 600 + ], + "score": 1.0, + "content": "using/curating? [N/A] We choose the commonly-used MNIST and CIFAR-10 datasets.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 146, + 599, + 506, + 612 + ], + "spans": [ + { + "bbox": [ + 146, + 599, + 506, + 612 + ], + "score": 1.0, + "content": "(e) Did you discuss whether the data you are using/curating contains personally identifiable", + "type": "text" + } + ], + "index": 41, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 610, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 162, + 610, + 505, + 622 + ], + "score": 1.0, + "content": "information or offensive content? [N/A] We choose the commonly-used MNIST and", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 162, + 622, + 243, + 633 + ], + "spans": [ + { + "bbox": [ + 162, + 622, + 243, + 633 + ], + "score": 1.0, + "content": "CIFAR-10 datasets.", + "type": "text" + } + ], + "index": 43, + "is_list_end_line": true + } + ], + "index": 39, + "bbox_fs": [ + 145, + 529, + 507, + 633 + ] + }, + { + "type": "text", + "bbox": [ + 131, + 636, + 432, + 647 + ], + "lines": [ + { + "bbox": [ + 128, + 633, + 433, + 650 + ], + "spans": [ + { + "bbox": [ + 128, + 633, + 433, + 650 + ], + "score": 1.0, + "content": "5. If you used crowdsourcing or conducted research with human subjects...", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 44, + "bbox_fs": [ + 128, + 633, + 433, + 650 + ] + }, + { + "type": "list", + "bbox": [ + 146, + 650, + 505, + 720 + ], + "lines": [ + { + "bbox": [ + 145, + 650, + 506, + 663 + ], + "spans": [ + { + "bbox": [ + 145, + 650, + 506, + 663 + ], + "score": 1.0, + "content": "(a) Did you include the full text of instructions given to participants and screenshots, if", + "type": "text" + } + ], + "index": 45, + "is_list_start_line": true + }, + { + "bbox": [ + 161, + 660, + 237, + 674 + ], + "spans": [ + { + "bbox": [ + 161, + 660, + 237, + 674 + ], + "score": 1.0, + "content": "applicable? [N/A]", + "type": "text" + } + ], + "index": 46, + "is_list_end_line": true + }, + { + "bbox": [ + 145, + 673, + 505, + 686 + ], + "spans": [ + { + "bbox": [ + 145, + 673, + 505, + 686 + ], + "score": 1.0, + "content": "(b) Did you describe any potential participant risks, with links to Institutional Review", + "type": "text" + } + ], + "index": 47, + "is_list_start_line": true + }, + { + "bbox": [ + 161, + 683, + 342, + 697 + ], + "spans": [ + { + "bbox": [ + 161, + 683, + 342, + 697 + ], + "score": 1.0, + "content": "Board (IRB) approvals, if applicable? [N/A]", + "type": "text" + } + ], + "index": 48, + "is_list_end_line": true + }, + { + "bbox": [ + 146, + 696, + 505, + 709 + ], + "spans": [ + { + "bbox": [ + 146, + 697, + 160, + 708 + ], + "score": 1.0, + "content": "(c)", + "type": "text" + }, + { + "bbox": [ + 161, + 696, + 505, + 709 + ], + "score": 1.0, + "content": "Did you include the estimated hourly wage paid to participants and the total amount", + "type": "text" + } + ], + "index": 49, + "is_list_start_line": true + }, + { + "bbox": [ + 161, + 708, + 333, + 720 + ], + "spans": [ + { + "bbox": [ + 161, + 708, + 333, + 720 + ], + "score": 1.0, + "content": "spent on participant compensation? [N/A]", + "type": "text" + } + ], + "index": 50, + "is_list_end_line": true + } + ], + "index": 47.5, + "bbox_fs": [ + 145, + 650, + 506, + 720 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/1_gaHBaRYt/1_gaHBaRYt_model.json b/parse/train/1_gaHBaRYt/1_gaHBaRYt_model.json new file mode 100644 index 0000000000000000000000000000000000000000..2b859af3d83cba863bf323c441623087ae1d57cf --- /dev/null +++ b/parse/train/1_gaHBaRYt/1_gaHBaRYt_model.json @@ -0,0 +1,21843 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 944, + 1303, + 944, + 1303, + 1368, + 398, + 1368 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 299, + 1764, + 1402, + 1764, + 1402, + 1887, + 299, + 1887 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 299, + 1507, + 1402, + 1507, + 1402, + 1751, + 299, + 1751 + ], + "score": 0.961 + }, + { + "category_id": 0, + "poly": [ + 407, + 271, + 1296, + 271, + 1296, + 382, + 407, + 382 + ], + "score": 0.959 + }, + { + "category_id": 1, + "poly": [ + 952, + 500, + 1278, + 500, + 1278, + 621, + 952, + 621 + ], + "score": 0.941 + }, + { + "category_id": 1, + "poly": [ + 386, + 668, + 815, + 668, + 815, + 791, + 386, + 791 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 916, + 668, + 1313, + 668, + 1313, + 791, + 916, + 791 + ], + "score": 0.93 + }, + { + "category_id": 2, + "poly": [ + 332, + 1917, + 569, + 1917, + 569, + 1977, + 332, + 1977 + ], + "score": 0.919 + }, + { + "category_id": 0, + "poly": [ + 299, + 1433, + 530, + 1433, + 530, + 1472, + 299, + 1472 + ], + "score": 0.907 + }, + { + "category_id": 0, + "poly": [ + 788, + 870, + 912, + 870, + 912, + 906, + 788, + 906 + ], + "score": 0.889 + }, + { + "category_id": 2, + "poly": [ + 297, + 2033, + 1071, + 2033, + 1071, + 2062, + 297, + 2062 + ], + "score": 0.884 + }, + { + "category_id": 1, + "poly": [ + 419, + 499, + 819, + 499, + 819, + 623, + 419, + 623 + ], + "score": 0.751 + }, + { + "category_id": 0, + "poly": [ + 554, + 500, + 693, + 500, + 693, + 529, + 554, + 529 + ], + "score": 0.279 + }, + { + "category_id": 0, + "poly": [ + 1024, + 669, + 1212, + 669, + 1212, + 700, + 1024, + 700 + ], + "score": 0.121 + }, + { + "category_id": 15, + "poly": [ + 405.0, + 270.0, + 1298.0, + 270.0, + 1298.0, + 329.0, + 405.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 521.0, + 325.0, + 1176.0, + 325.0, + 1176.0, + 385.0, + 521.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1912.0, + 542.0, + 1912.0, + 542.0, + 1949.0, + 328.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1941.0, + 572.0, + 1941.0, + 572.0, + 1984.0, + 329.0, + 1984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1430.0, + 536.0, + 1430.0, + 536.0, + 1478.0, + 292.0, + 1478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 782.0, + 867.0, + 919.0, + 867.0, + 919.0, + 911.0, + 782.0, + 911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2028.0, + 1073.0, + 2028.0, + 1073.0, + 2066.0, + 294.0, + 2066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 551.0, + 496.0, + 698.0, + 496.0, + 698.0, + 533.0, + 551.0, + 533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1020.0, + 664.0, + 1216.0, + 664.0, + 1216.0, + 707.0, + 1020.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 942.0, + 1305.0, + 942.0, + 1305.0, + 979.0, + 393.0, + 979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 973.0, + 1305.0, + 973.0, + 1305.0, + 1010.0, + 393.0, + 1010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1005.0, + 1305.0, + 1005.0, + 1305.0, + 1038.0, + 394.0, + 1038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1034.0, + 1306.0, + 1034.0, + 1306.0, + 1069.0, + 394.0, + 1069.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1063.0, + 1306.0, + 1063.0, + 1306.0, + 1100.0, + 393.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1096.0, + 1306.0, + 1096.0, + 1306.0, + 1130.0, + 393.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1125.0, + 1305.0, + 1125.0, + 1305.0, + 1160.0, + 392.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1155.0, + 1305.0, + 1155.0, + 1305.0, + 1190.0, + 392.0, + 1190.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1187.0, + 1305.0, + 1187.0, + 1305.0, + 1218.0, + 395.0, + 1218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1217.0, + 1306.0, + 1217.0, + 1306.0, + 1249.0, + 392.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1245.0, + 1304.0, + 1245.0, + 1304.0, + 1280.0, + 393.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1278.0, + 1306.0, + 1278.0, + 1306.0, + 1310.0, + 394.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1305.0, + 1309.0, + 1305.0, + 1309.0, + 1343.0, + 394.0, + 1343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 1339.0, + 1209.0, + 1339.0, + 1209.0, + 1371.0, + 396.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1763.0, + 1406.0, + 1763.0, + 1406.0, + 1798.0, + 292.0, + 1798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1795.0, + 1404.0, + 1795.0, + 1404.0, + 1828.0, + 295.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1827.0, + 1404.0, + 1827.0, + 1404.0, + 1859.0, + 294.0, + 1859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1857.0, + 1319.0, + 1857.0, + 1319.0, + 1889.0, + 294.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1505.0, + 1406.0, + 1505.0, + 1406.0, + 1544.0, + 292.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1536.0, + 1406.0, + 1536.0, + 1406.0, + 1573.0, + 294.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1567.0, + 1406.0, + 1567.0, + 1406.0, + 1602.0, + 294.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1598.0, + 1407.0, + 1598.0, + 1407.0, + 1633.0, + 292.0, + 1633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1628.0, + 1407.0, + 1628.0, + 1407.0, + 1665.0, + 293.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1658.0, + 1407.0, + 1658.0, + 1407.0, + 1693.0, + 293.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1690.0, + 1406.0, + 1690.0, + 1406.0, + 1723.0, + 295.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1719.0, + 1384.0, + 1719.0, + 1384.0, + 1754.0, + 294.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 495.0, + 1224.0, + 495.0, + 1224.0, + 534.0, + 1017.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1084.0, + 530.0, + 1149.0, + 530.0, + 1149.0, + 560.0, + 1084.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 557.0, + 1234.0, + 557.0, + 1234.0, + 594.0, + 997.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 951.0, + 591.0, + 1279.0, + 591.0, + 1279.0, + 625.0, + 951.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 663.0, + 704.0, + 663.0, + 704.0, + 708.0, + 499.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 561.0, + 698.0, + 640.0, + 698.0, + 640.0, + 730.0, + 561.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 723.0, + 817.0, + 723.0, + 817.0, + 766.0, + 382.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 480.0, + 762.0, + 722.0, + 762.0, + 722.0, + 793.0, + 480.0, + 793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1021.0, + 668.0, + 1215.0, + 668.0, + 1215.0, + 703.0, + 1021.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1087.0, + 699.0, + 1142.0, + 699.0, + 1142.0, + 730.0, + 1087.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 996.0, + 726.0, + 1231.0, + 726.0, + 1231.0, + 765.0, + 996.0, + 765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 759.0, + 1314.0, + 759.0, + 1314.0, + 796.0, + 915.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 552.0, + 498.0, + 700.0, + 498.0, + 700.0, + 530.0, + 552.0, + 530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 592.0, + 529.0, + 647.0, + 529.0, + 647.0, + 561.0, + 592.0, + 561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 501.0, + 557.0, + 736.0, + 557.0, + 736.0, + 595.0, + 501.0, + 595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 419.0, + 592.0, + 819.0, + 592.0, + 819.0, + 625.0, + 419.0, + 625.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 202, + 1404, + 202, + 1404, + 477, + 298, + 477 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 490, + 1404, + 490, + 1404, + 674, + 298, + 674 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1778, + 1404, + 1778, + 1404, + 1932, + 298, + 1932 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 297, + 688, + 1405, + 688, + 1405, + 931, + 297, + 931 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 300, + 944, + 1404, + 944, + 1404, + 1129, + 300, + 1129 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 370, + 1154, + 1405, + 1154, + 1405, + 1670, + 370, + 1670 + ], + "score": 0.963 + }, + { + "category_id": 1, + "poly": [ + 298, + 1945, + 1398, + 1945, + 1398, + 2007, + 298, + 2007 + ], + "score": 0.933 + }, + { + "category_id": 0, + "poly": [ + 298, + 1708, + 542, + 1708, + 542, + 1746, + 298, + 1746 + ], + "score": 0.919 + }, + { + "category_id": 2, + "poly": [ + 841, + 2061, + 858, + 2061, + 858, + 2084, + 841, + 2084 + ], + "score": 0.726 + }, + { + "category_id": 2, + "poly": [ + 841, + 2061, + 859, + 2061, + 859, + 2085, + 841, + 2085 + ], + "score": 0.104 + }, + { + "category_id": 13, + "poly": [ + 759, + 1422, + 910, + 1422, + 910, + 1478, + 759, + 1478 + ], + "score": 0.94, + "latex": "\\mathcal { O } \\left( \\sqrt { \\frac { \\bar { \\nu } + 1 } { N K T } } \\right)" + }, + { + "category_id": 13, + "poly": [ + 1147, + 1384, + 1263, + 1384, + 1263, + 1425, + 1147, + 1425 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\mathcal { O } \\left( \\frac { \\bar { \\tau } _ { T } + 1 } { N K T } \\right) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 931, + 1507, + 964, + 1507, + 964, + 1535, + 931, + 1535 + ], + "score": 0.86, + "latex": "\\bar { \\tau } _ { T }" + }, + { + "category_id": 13, + "poly": [ + 829, + 1477, + 893, + 1477, + 893, + 1506, + 829, + 1506 + ], + "score": 0.83, + "latex": "N , K" + }, + { + "category_id": 13, + "poly": [ + 945, + 1475, + 969, + 1475, + 969, + 1502, + 945, + 1502 + ], + "score": 0.81, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1013, + 1508, + 1032, + 1508, + 1032, + 1532, + 1013, + 1532 + ], + "score": 0.76, + "latex": "\\bar { \\nu }" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1705.0, + 545.0, + 1705.0, + 545.0, + 1751.0, + 291.0, + 1751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2058.0, + 862.0, + 2058.0, + 862.0, + 2093.0, + 839.0, + 2093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2058.0, + 862.0, + 2058.0, + 862.0, + 2093.0, + 838.0, + 2093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 201.0, + 1406.0, + 201.0, + 1406.0, + 242.0, + 292.0, + 242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 233.0, + 1405.0, + 233.0, + 1405.0, + 268.0, + 292.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 263.0, + 1406.0, + 263.0, + 1406.0, + 299.0, + 293.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 291.0, + 1405.0, + 291.0, + 1405.0, + 330.0, + 293.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 323.0, + 1404.0, + 323.0, + 1404.0, + 362.0, + 292.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 353.0, + 1406.0, + 353.0, + 1406.0, + 393.0, + 293.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 382.0, + 1405.0, + 382.0, + 1405.0, + 420.0, + 293.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 415.0, + 1405.0, + 415.0, + 1405.0, + 451.0, + 294.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 446.0, + 526.0, + 446.0, + 526.0, + 480.0, + 294.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 491.0, + 1405.0, + 491.0, + 1405.0, + 526.0, + 294.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 520.0, + 1405.0, + 520.0, + 1405.0, + 558.0, + 293.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 552.0, + 1406.0, + 552.0, + 1406.0, + 587.0, + 294.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 583.0, + 1404.0, + 583.0, + 1404.0, + 617.0, + 292.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 611.0, + 1406.0, + 611.0, + 1406.0, + 649.0, + 292.0, + 649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 642.0, + 853.0, + 642.0, + 853.0, + 676.0, + 293.0, + 676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1776.0, + 1404.0, + 1776.0, + 1404.0, + 1813.0, + 294.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1806.0, + 1405.0, + 1806.0, + 1405.0, + 1847.0, + 293.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1838.0, + 1407.0, + 1838.0, + 1407.0, + 1874.0, + 293.0, + 1874.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1867.0, + 1407.0, + 1867.0, + 1407.0, + 1907.0, + 292.0, + 1907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1897.0, + 904.0, + 1897.0, + 904.0, + 1936.0, + 293.0, + 1936.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 689.0, + 1407.0, + 689.0, + 1407.0, + 722.0, + 296.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 717.0, + 1405.0, + 717.0, + 1405.0, + 753.0, + 295.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 748.0, + 1408.0, + 748.0, + 1408.0, + 785.0, + 294.0, + 785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 780.0, + 1405.0, + 780.0, + 1405.0, + 814.0, + 296.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 810.0, + 1406.0, + 810.0, + 1406.0, + 847.0, + 295.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 835.0, + 1406.0, + 835.0, + 1406.0, + 876.0, + 292.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 870.0, + 1406.0, + 870.0, + 1406.0, + 905.0, + 292.0, + 905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 898.0, + 392.0, + 898.0, + 392.0, + 936.0, + 294.0, + 936.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 946.0, + 1405.0, + 946.0, + 1405.0, + 978.0, + 296.0, + 978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 974.0, + 1404.0, + 974.0, + 1404.0, + 1012.0, + 294.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1006.0, + 1405.0, + 1006.0, + 1405.0, + 1042.0, + 294.0, + 1042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1035.0, + 1405.0, + 1035.0, + 1405.0, + 1072.0, + 293.0, + 1072.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1066.0, + 1405.0, + 1066.0, + 1405.0, + 1103.0, + 293.0, + 1103.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1099.0, + 928.0, + 1099.0, + 928.0, + 1129.0, + 294.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 1153.0, + 1407.0, + 1153.0, + 1407.0, + 1189.0, + 370.0, + 1189.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1186.0, + 1405.0, + 1186.0, + 1405.0, + 1219.0, + 394.0, + 1219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 1217.0, + 653.0, + 1217.0, + 653.0, + 1247.0, + 397.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 376.0, + 1256.0, + 1403.0, + 1256.0, + 1403.0, + 1289.0, + 376.0, + 1289.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1286.0, + 1406.0, + 1286.0, + 1406.0, + 1322.0, + 393.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1316.0, + 1403.0, + 1316.0, + 1403.0, + 1354.0, + 393.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1347.0, + 1246.0, + 1347.0, + 1246.0, + 1383.0, + 393.0, + 1383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1376.0, + 1146.0, + 1376.0, + 1146.0, + 1436.0, + 372.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1264.0, + 1376.0, + 1414.0, + 1376.0, + 1414.0, + 1436.0, + 1264.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 1408.0, + 758.0, + 1408.0, + 758.0, + 1489.0, + 384.0, + 1489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 1432.0, + 1407.0, + 1432.0, + 1407.0, + 1466.0, + 915.0, + 1466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 1475.0, + 828.0, + 1475.0, + 828.0, + 1508.0, + 396.0, + 1508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1475.0, + 944.0, + 1475.0, + 944.0, + 1508.0, + 894.0, + 1508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 970.0, + 1475.0, + 1404.0, + 1475.0, + 1404.0, + 1508.0, + 970.0, + 1508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1503.0, + 930.0, + 1503.0, + 930.0, + 1540.0, + 393.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 965.0, + 1503.0, + 1012.0, + 1503.0, + 1012.0, + 1540.0, + 965.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 1503.0, + 1406.0, + 1503.0, + 1406.0, + 1540.0, + 1033.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1536.0, + 1405.0, + 1536.0, + 1405.0, + 1570.0, + 393.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 1566.0, + 1187.0, + 1566.0, + 1187.0, + 1601.0, + 391.0, + 1601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 1603.0, + 1403.0, + 1603.0, + 1403.0, + 1643.0, + 371.0, + 1643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 1637.0, + 1171.0, + 1637.0, + 1171.0, + 1672.0, + 391.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1944.0, + 1403.0, + 1944.0, + 1403.0, + 1980.0, + 297.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1972.0, + 1404.0, + 1972.0, + 1404.0, + 2014.0, + 292.0, + 2014.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 649, + 1405, + 649, + 1405, + 894, + 297, + 894 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1686, + 1404, + 1686, + 1404, + 1872, + 297, + 1872 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 202, + 1405, + 202, + 1405, + 386, + 298, + 386 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 929, + 1405, + 929, + 1405, + 1172, + 297, + 1172 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 299, + 1884, + 1402, + 1884, + 1402, + 2008, + 299, + 2008 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1183, + 1403, + 1183, + 1403, + 1337, + 299, + 1337 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 300, + 1580, + 1405, + 1580, + 1405, + 1674, + 300, + 1674 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 298, + 1453, + 1177, + 1453, + 1177, + 1487, + 298, + 1487 + ], + "score": 0.93 + }, + { + "category_id": 0, + "poly": [ + 299, + 1382, + 562, + 1382, + 562, + 1420, + 299, + 1420 + ], + "score": 0.922 + }, + { + "category_id": 8, + "poly": [ + 526, + 1504, + 1173, + 1504, + 1173, + 1559, + 526, + 1559 + ], + "score": 0.92 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1513, + 1399, + 1513, + 1399, + 1543, + 1366, + 1543 + ], + "score": 0.895 + }, + { + "category_id": 1, + "poly": [ + 298, + 421, + 1405, + 421, + 1405, + 637, + 298, + 637 + ], + "score": 0.792 + }, + { + "category_id": 2, + "poly": [ + 841, + 2061, + 858, + 2061, + 858, + 2085, + 841, + 2085 + ], + "score": 0.638 + }, + { + "category_id": 2, + "poly": [ + 841, + 2061, + 859, + 2061, + 859, + 2085, + 841, + 2085 + ], + "score": 0.438 + }, + { + "category_id": 13, + "poly": [ + 607, + 1089, + 770, + 1089, + 770, + 1142, + 607, + 1142 + ], + "score": 0.93, + "latex": "\\mathcal { O } ( \\sqrt { \\frac { \\bar { \\nu } } { N K T } } \\sigma ^ { 2 } )" + }, + { + "category_id": 14, + "poly": [ + 525, + 1503, + 1172, + 1503, + 1172, + 1564, + 525, + 1564 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\underset { w \\in \\mathbb { R } ^ { d } } { \\operatorname* { m i n } } f ( w ) : = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } f _ { i } ( w ) : = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\mathbb { E } _ { \\xi _ { i } } [ f _ { i } ( w , \\xi _ { i } ) ] , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1089, + 989, + 1357, + 989, + 1357, + 1028, + 1089, + 1028 + ], + "score": 0.9, + "latex": "\\mathcal { O } \\left( \\sqrt { \\frac { \\nu _ { \\mathrm { m a x } } } { N ^ { 0 . 5 } T } } ( \\mathbf { \\bar { G } } ^ { 2 } + \\sigma ^ { 2 } ) \\right)" + }, + { + "category_id": 13, + "poly": [ + 568, + 1060, + 629, + 1060, + 629, + 1087, + 568, + 1087 + ], + "score": 0.88, + "latex": "\\nu _ { m a x }" + }, + { + "category_id": 13, + "poly": [ + 772, + 1024, + 808, + 1024, + 808, + 1055, + 772, + 1055 + ], + "score": 0.87, + "latex": "G ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 570, + 1613, + 596, + 1613, + 596, + 1643, + 570, + 1643 + ], + "score": 0.87, + "latex": "f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1058, + 1613, + 1083, + 1613, + 1083, + 1643, + 1058, + 1643 + ], + "score": 0.87, + "latex": "\\xi _ { i }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1144, + 356, + 1144, + 356, + 1170, + 298, + 1170 + ], + "score": 0.86, + "latex": "\\nu _ { \\mathrm { m a x } }" + }, + { + "category_id": 13, + "poly": [ + 1085, + 1246, + 1113, + 1246, + 1113, + 1272, + 1085, + 1272 + ], + "score": 0.84, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 1164, + 1246, + 1192, + 1246, + 1192, + 1272, + 1164, + 1272 + ], + "score": 0.83, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 1217, + 1583, + 1245, + 1583, + 1245, + 1609, + 1217, + 1609 + ], + "score": 0.82, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 1080, + 1139, + 1108, + 1139, + 1108, + 1166, + 1080, + 1166 + ], + "score": 0.81, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 1001, + 1139, + 1029, + 1139, + 1029, + 1166, + 1001, + 1166 + ], + "score": 0.81, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 988, + 1614, + 1001, + 1614, + 1001, + 1639, + 988, + 1639 + ], + "score": 0.77, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 370, + 1588, + 394, + 1588, + 394, + 1609, + 370, + 1609 + ], + "score": 0.74, + "latex": "w" + }, + { + "category_id": 13, + "poly": [ + 389, + 1142, + 407, + 1142, + 407, + 1166, + 389, + 1166 + ], + "score": 0.63, + "latex": "\\bar { \\nu }" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1376.0, + 566.0, + 1376.0, + 566.0, + 1429.0, + 290.0, + 1429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2058.0, + 860.0, + 2058.0, + 860.0, + 2089.0, + 839.0, + 2089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2058.0, + 862.0, + 2058.0, + 862.0, + 2091.0, + 838.0, + 2091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 651.0, + 1407.0, + 651.0, + 1407.0, + 684.0, + 295.0, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 682.0, + 1406.0, + 682.0, + 1406.0, + 715.0, + 295.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 710.0, + 1407.0, + 710.0, + 1407.0, + 745.0, + 292.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 743.0, + 1405.0, + 743.0, + 1405.0, + 774.0, + 294.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 773.0, + 1407.0, + 773.0, + 1407.0, + 806.0, + 295.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 801.0, + 1406.0, + 801.0, + 1406.0, + 835.0, + 294.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 833.0, + 1405.0, + 833.0, + 1405.0, + 864.0, + 294.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 861.0, + 1046.0, + 861.0, + 1046.0, + 897.0, + 294.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1685.0, + 1406.0, + 1685.0, + 1406.0, + 1723.0, + 292.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1715.0, + 1406.0, + 1715.0, + 1406.0, + 1753.0, + 294.0, + 1753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1747.0, + 1406.0, + 1747.0, + 1406.0, + 1784.0, + 292.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1776.0, + 1404.0, + 1776.0, + 1404.0, + 1813.0, + 294.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1808.0, + 1406.0, + 1808.0, + 1406.0, + 1843.0, + 294.0, + 1843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1842.0, + 785.0, + 1842.0, + 785.0, + 1873.0, + 296.0, + 1873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 201.0, + 1406.0, + 201.0, + 1406.0, + 238.0, + 293.0, + 238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 233.0, + 1405.0, + 233.0, + 1405.0, + 269.0, + 295.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 261.0, + 1406.0, + 261.0, + 1406.0, + 299.0, + 293.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 297.0, + 1407.0, + 297.0, + 1407.0, + 328.0, + 296.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 322.0, + 1406.0, + 322.0, + 1406.0, + 360.0, + 293.0, + 360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 354.0, + 1054.0, + 354.0, + 1054.0, + 390.0, + 293.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 927.0, + 1407.0, + 927.0, + 1407.0, + 966.0, + 295.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 958.0, + 1405.0, + 958.0, + 1405.0, + 994.0, + 294.0, + 994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 982.0, + 1088.0, + 982.0, + 1088.0, + 1037.0, + 289.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1358.0, + 982.0, + 1411.0, + 982.0, + 1411.0, + 1037.0, + 1358.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1024.0, + 771.0, + 1024.0, + 771.0, + 1061.0, + 294.0, + 1061.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 1024.0, + 1406.0, + 1024.0, + 1406.0, + 1061.0, + 809.0, + 1061.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1055.0, + 567.0, + 1055.0, + 567.0, + 1093.0, + 294.0, + 1093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1055.0, + 1406.0, + 1055.0, + 1406.0, + 1093.0, + 630.0, + 1093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1091.0, + 606.0, + 1091.0, + 606.0, + 1143.0, + 292.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 1091.0, + 1409.0, + 1091.0, + 1409.0, + 1143.0, + 771.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1138.0, + 297.0, + 1138.0, + 297.0, + 1172.0, + 292.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 1138.0, + 388.0, + 1138.0, + 388.0, + 1172.0, + 357.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 1138.0, + 1000.0, + 1138.0, + 1000.0, + 1172.0, + 408.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1030.0, + 1138.0, + 1079.0, + 1138.0, + 1079.0, + 1172.0, + 1030.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1109.0, + 1138.0, + 1119.0, + 1138.0, + 1119.0, + 1172.0, + 1109.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1882.0, + 1406.0, + 1882.0, + 1406.0, + 1919.0, + 293.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1917.0, + 1403.0, + 1917.0, + 1403.0, + 1946.0, + 295.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1947.0, + 1404.0, + 1947.0, + 1404.0, + 1980.0, + 295.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1978.0, + 1086.0, + 1978.0, + 1086.0, + 2010.0, + 295.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1182.0, + 1407.0, + 1182.0, + 1407.0, + 1219.0, + 295.0, + 1219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1212.0, + 1407.0, + 1212.0, + 1407.0, + 1248.0, + 293.0, + 1248.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1243.0, + 1084.0, + 1243.0, + 1084.0, + 1280.0, + 294.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 1243.0, + 1163.0, + 1243.0, + 1163.0, + 1280.0, + 1114.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1193.0, + 1243.0, + 1405.0, + 1243.0, + 1405.0, + 1280.0, + 1193.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1273.0, + 1405.0, + 1273.0, + 1405.0, + 1310.0, + 294.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1304.0, + 1360.0, + 1304.0, + 1360.0, + 1341.0, + 295.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1580.0, + 369.0, + 1580.0, + 369.0, + 1617.0, + 294.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1580.0, + 1216.0, + 1580.0, + 1216.0, + 1617.0, + 395.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 1580.0, + 1406.0, + 1580.0, + 1406.0, + 1617.0, + 1246.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1611.0, + 569.0, + 1611.0, + 569.0, + 1645.0, + 295.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 1611.0, + 987.0, + 1611.0, + 987.0, + 1645.0, + 597.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1002.0, + 1611.0, + 1057.0, + 1611.0, + 1057.0, + 1645.0, + 1002.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1084.0, + 1611.0, + 1404.0, + 1611.0, + 1404.0, + 1645.0, + 1084.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1640.0, + 551.0, + 1640.0, + 551.0, + 1674.0, + 294.0, + 1674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1449.0, + 1180.0, + 1449.0, + 1180.0, + 1494.0, + 294.0, + 1494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 422.0, + 1403.0, + 422.0, + 1403.0, + 456.0, + 296.0, + 456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 454.0, + 1405.0, + 454.0, + 1405.0, + 488.0, + 295.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 483.0, + 1403.0, + 483.0, + 1403.0, + 518.0, + 295.0, + 518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 515.0, + 1403.0, + 515.0, + 1403.0, + 546.0, + 295.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 543.0, + 1406.0, + 543.0, + 1406.0, + 578.0, + 292.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 575.0, + 1405.0, + 575.0, + 1405.0, + 609.0, + 295.0, + 609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 604.0, + 796.0, + 604.0, + 796.0, + 639.0, + 295.0, + 639.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1439, + 1405, + 1439, + 1405, + 1626, + 297, + 1626 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 1829, + 1406, + 1829, + 1406, + 1936, + 297, + 1936 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 1637, + 1405, + 1637, + 1405, + 1738, + 298, + 1738 + ], + "score": 0.974 + }, + { + "category_id": 3, + "poly": [ + 301, + 183, + 1400, + 183, + 1400, + 514, + 301, + 514 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 297, + 660, + 1405, + 660, + 1405, + 784, + 297, + 784 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 300, + 797, + 1405, + 797, + 1405, + 889, + 300, + 889 + ], + "score": 0.961 + }, + { + "category_id": 1, + "poly": [ + 371, + 921, + 1405, + 921, + 1405, + 1320, + 371, + 1320 + ], + "score": 0.958 + }, + { + "category_id": 8, + "poly": [ + 614, + 1941, + 1067, + 1941, + 1067, + 2018, + 614, + 2018 + ], + "score": 0.955 + }, + { + "category_id": 4, + "poly": [ + 297, + 521, + 1406, + 521, + 1406, + 644, + 297, + 644 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 561, + 1762, + 1137, + 1762, + 1137, + 1808, + 561, + 1808 + ], + "score": 0.946 + }, + { + "category_id": 0, + "poly": [ + 300, + 1367, + 1208, + 1367, + 1208, + 1407, + 300, + 1407 + ], + "score": 0.925 + }, + { + "category_id": 2, + "poly": [ + 840, + 2061, + 859, + 2061, + 859, + 2085, + 840, + 2085 + ], + "score": 0.788 + }, + { + "category_id": 14, + "poly": [ + 617, + 1938, + 1067, + 1938, + 1067, + 2017, + 617, + 2017 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { G _ { t } ^ { i } = \\left\\{ \\begin{array} { l l } { G _ { t - 1 } ^ { i } , } & { \\mathrm { ~ i f ~ } i \\notin \\mathcal { A } ( t ) , } \\\\ { \\frac { 1 } { \\eta _ { t } } ( w _ { t } - w _ { t , K } ^ { i } ) , } & { \\mathrm { ~ i f ~ } i \\in \\mathcal { A } ( t ) . } \\end{array} \\right. } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1028, + 1868, + 1089, + 1868, + 1089, + 1904, + 1028, + 1904 + ], + "score": 0.93, + "latex": "\\{ G _ { t } ^ { i } \\}" + }, + { + "category_id": 13, + "poly": [ + 1237, + 1667, + 1353, + 1667, + 1353, + 1706, + 1237, + 1706 + ], + "score": 0.93, + "latex": "w _ { t , 0 } ^ { i } = w _ { t }" + }, + { + "category_id": 13, + "poly": [ + 656, + 1827, + 773, + 1827, + 773, + 1870, + 656, + 1870 + ], + "score": 0.93, + "latex": "\\tilde { \\nabla } f _ { i } ( w _ { t , k } ^ { i } )" + }, + { + "category_id": 13, + "poly": [ + 1138, + 1702, + 1196, + 1702, + 1196, + 1743, + 1138, + 1743 + ], + "score": 0.93, + "latex": "w _ { t , K } ^ { i }" + }, + { + "category_id": 13, + "poly": [ + 759, + 1470, + 820, + 1470, + 820, + 1505, + 759, + 1505 + ], + "score": 0.92, + "latex": "\\{ G ^ { i } \\}" + }, + { + "category_id": 13, + "poly": [ + 660, + 1870, + 828, + 1870, + 828, + 1910, + 660, + 1910 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\frac { 1 } { \\eta _ { t } } \\big ( w _ { t } - w _ { t , K } ^ { i } \\big ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 626, + 722, + 682, + 722, + 682, + 754, + 626, + 754 + ], + "score": 0.92, + "latex": "\\boldsymbol { \\mathcal { A } } ( t )" + }, + { + "category_id": 13, + "poly": [ + 460, + 1668, + 515, + 1668, + 515, + 1702, + 460, + 1702 + ], + "score": 0.91, + "latex": "\\boldsymbol { \\mathcal { A } } ( t )" + }, + { + "category_id": 14, + "poly": [ + 561, + 1761, + 1136, + 1761, + 1136, + 1807, + 561, + 1807 + ], + "score": 0.91, + "latex": "\\boldsymbol w _ { t , k + 1 } ^ { i } = \\boldsymbol w _ { t , k } ^ { i } - \\eta _ { t } \\tilde { \\nabla } f _ { i } ( \\boldsymbol w _ { t , k } ^ { i } ) , \\boldsymbol k = 0 , \\cdots , \\boldsymbol K - 1 ," + }, + { + "category_id": 13, + "poly": [ + 862, + 1869, + 894, + 1869, + 894, + 1898, + 862, + 1898 + ], + "score": 0.87, + "latex": "G ^ { i }" + }, + { + "category_id": 13, + "poly": [ + 705, + 1674, + 736, + 1674, + 736, + 1700, + 705, + 1700 + ], + "score": 0.86, + "latex": "w _ { t }" + }, + { + "category_id": 13, + "poly": [ + 369, + 1837, + 396, + 1837, + 396, + 1865, + 369, + 1865 + ], + "score": 0.85, + "latex": "\\eta _ { t }" + }, + { + "category_id": 13, + "poly": [ + 1304, + 1644, + 1337, + 1644, + 1337, + 1668, + 1304, + 1668 + ], + "score": 0.84, + "latex": "w _ { t }" + }, + { + "category_id": 13, + "poly": [ + 405, + 1705, + 433, + 1705, + 433, + 1732, + 405, + 1732 + ], + "score": 0.83, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 1081, + 1030, + 1103, + 1030, + 1103, + 1056, + 1081, + 1056 + ], + "score": 0.82, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 1044, + 1061, + 1067, + 1061, + 1067, + 1087, + 1044, + 1087 + ], + "score": 0.79, + "latex": "s" + }, + { + "category_id": 13, + "poly": [ + 1101, + 1091, + 1127, + 1091, + 1127, + 1117, + 1101, + 1117 + ], + "score": 0.78, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 733, + 1641, + 747, + 1641, + 747, + 1665, + 733, + 1665 + ], + "score": 0.76, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 827, + 1121, + 852, + 1121, + 852, + 1148, + 827, + 1148 + ], + "score": 0.75, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1054, + 1671, + 1067, + 1671, + 1067, + 1696, + 1054, + 1696 + ], + "score": 0.74, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 655, + 694, + 669, + 694, + 669, + 719, + 655, + 719 + ], + "score": 0.73, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 298, + 1910, + 310, + 1910, + 310, + 1933, + 298, + 1933 + ], + "score": 0.71, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 663, + 664, + 677, + 664, + 677, + 688, + 663, + 688 + ], + "score": 0.67, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 483, + 724, + 498, + 724, + 498, + 749, + 483, + 749 + ], + "score": 0.59, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 1273, + 1836, + 1286, + 1836, + 1286, + 1860, + 1273, + 1860 + ], + "score": 0.56, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1113, + 724, + 1127, + 724, + 1127, + 749, + 1113, + 749 + ], + "score": 0.4, + "latex": "t" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 187.0, + 646.0, + 187.0, + 646.0, + 208.0, + 390.0, + 208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 188.0, + 826.0, + 188.0, + 826.0, + 209.0, + 756.0, + 209.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 187.0, + 1012.0, + 187.0, + 1012.0, + 206.0, + 827.0, + 206.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1123.0, + 187.0, + 1381.0, + 187.0, + 1381.0, + 210.0, + 1123.0, + 210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 204.0, + 402.0, + 204.0, + 402.0, + 235.0, + 314.0, + 235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 546.0, + 204.0, + 594.0, + 204.0, + 594.0, + 229.0, + 546.0, + 229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 204.0, + 771.0, + 204.0, + 771.0, + 235.0, + 683.0, + 235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 912.0, + 203.0, + 963.0, + 203.0, + 963.0, + 229.0, + 912.0, + 229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 204.0, + 1138.0, + 204.0, + 1138.0, + 235.0, + 1049.0, + 235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 446.0, + 230.0, + 458.0, + 230.0, + 458.0, + 238.0, + 446.0, + 238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 533.0, + 230.0, + 545.0, + 230.0, + 545.0, + 238.0, + 533.0, + 238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 616.0, + 229.0, + 632.0, + 229.0, + 632.0, + 242.0, + 616.0, + 242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 233.0, + 841.0, + 233.0, + 841.0, + 249.0, + 831.0, + 249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 231.0, + 998.0, + 231.0, + 998.0, + 241.0, + 985.0, + 241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1191.0, + 226.0, + 1213.0, + 226.0, + 1213.0, + 280.0, + 1191.0, + 280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 232.0, + 1310.0, + 232.0, + 1310.0, + 273.0, + 1276.0, + 273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 270.0, + 370.0, + 270.0, + 370.0, + 291.0, + 307.0, + 291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 676.0, + 270.0, + 737.0, + 270.0, + 737.0, + 291.0, + 676.0, + 291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 270.0, + 1104.0, + 270.0, + 1104.0, + 291.0, + 1042.0, + 291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1289.0, + 263.0, + 1310.0, + 263.0, + 1310.0, + 281.0, + 1289.0, + 281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1193.0, + 279.0, + 1218.0, + 279.0, + 1218.0, + 334.0, + 1193.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1291.0, + 281.0, + 1308.0, + 281.0, + 1308.0, + 295.0, + 1291.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1283.0, + 287.0, + 1293.0, + 287.0, + 1293.0, + 296.0, + 1283.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 302.0, + 348.0, + 302.0, + 348.0, + 315.0, + 332.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 303.0, + 713.0, + 303.0, + 713.0, + 314.0, + 701.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 302.0, + 1083.0, + 302.0, + 1083.0, + 315.0, + 1067.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1293.0, + 303.0, + 1315.0, + 303.0, + 1315.0, + 322.0, + 1293.0, + 322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1299.0, + 320.0, + 1315.0, + 320.0, + 1315.0, + 330.0, + 1299.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 325.0, + 372.0, + 325.0, + 372.0, + 346.0, + 310.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 325.0, + 738.0, + 325.0, + 738.0, + 346.0, + 678.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1044.0, + 325.0, + 1105.0, + 325.0, + 1105.0, + 346.0, + 1044.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1326.0, + 328.0, + 1338.0, + 328.0, + 1338.0, + 340.0, + 1326.0, + 340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 357.0, + 348.0, + 357.0, + 348.0, + 372.0, + 331.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 357.0, + 716.0, + 357.0, + 716.0, + 372.0, + 699.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 357.0, + 1083.0, + 357.0, + 1083.0, + 372.0, + 1067.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 380.0, + 370.0, + 380.0, + 370.0, + 401.0, + 305.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 671.0, + 380.0, + 738.0, + 380.0, + 738.0, + 401.0, + 671.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 380.0, + 1104.0, + 380.0, + 1104.0, + 401.0, + 1039.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1234.0, + 379.0, + 1255.0, + 379.0, + 1255.0, + 397.0, + 1234.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 403.0, + 561.0, + 403.0, + 561.0, + 442.0, + 404.0, + 442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 751.0, + 403.0, + 944.0, + 403.0, + 944.0, + 443.0, + 751.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1143.0, + 403.0, + 1291.0, + 403.0, + 1291.0, + 443.0, + 1143.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 460.0, + 513.0, + 460.0, + 513.0, + 480.0, + 366.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 621.0, + 454.0, + 767.0, + 454.0, + 767.0, + 492.0, + 621.0, + 492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 455.0, + 855.0, + 455.0, + 855.0, + 476.0, + 832.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 451.0, + 970.0, + 451.0, + 970.0, + 475.0, + 858.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1166.0, + 455.0, + 1400.0, + 455.0, + 1400.0, + 488.0, + 1166.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 347.0, + 487.0, + 500.0, + 487.0, + 500.0, + 513.0, + 347.0, + 513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 620.0, + 487.0, + 750.0, + 487.0, + 750.0, + 515.0, + 620.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 484.0, + 1098.0, + 484.0, + 1098.0, + 516.0, + 875.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 203.5, + 505.0, + 203.5, + 505.0, + 228.0, + 459.0, + 228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.75, + 203.5, + 871.75, + 203.5, + 871.75, + 229.0, + 827.75, + 229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1195.0, + 203.5, + 1241.0, + 203.5, + 1241.0, + 229.0, + 1195.0, + 229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1281.0, + 204.5, + 1327.0, + 204.5, + 1327.0, + 226.5, + 1281.0, + 226.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1289.0, + 290.0, + 1314.0, + 290.0, + 1314.0, + 307.5, + 1289.0, + 307.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 522.0, + 1406.0, + 522.0, + 1406.0, + 555.0, + 295.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 552.0, + 1406.0, + 552.0, + 1406.0, + 585.0, + 295.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 584.0, + 1403.0, + 584.0, + 1403.0, + 616.0, + 295.0, + 616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 614.0, + 681.0, + 614.0, + 681.0, + 646.0, + 295.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1365.0, + 1214.0, + 1365.0, + 1214.0, + 1417.0, + 291.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2058.0, + 863.0, + 2058.0, + 863.0, + 2091.0, + 838.0, + 2091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1435.0, + 1406.0, + 1435.0, + 1406.0, + 1479.0, + 291.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1468.0, + 758.0, + 1468.0, + 758.0, + 1508.0, + 292.0, + 1508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 1468.0, + 1406.0, + 1468.0, + 1406.0, + 1508.0, + 821.0, + 1508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1499.0, + 1407.0, + 1499.0, + 1407.0, + 1536.0, + 294.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1530.0, + 1407.0, + 1530.0, + 1407.0, + 1567.0, + 294.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1561.0, + 1406.0, + 1561.0, + 1406.0, + 1597.0, + 295.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1589.0, + 766.0, + 1589.0, + 766.0, + 1630.0, + 294.0, + 1630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1828.0, + 368.0, + 1828.0, + 368.0, + 1868.0, + 294.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 1828.0, + 655.0, + 1828.0, + 655.0, + 1868.0, + 397.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 774.0, + 1828.0, + 1272.0, + 1828.0, + 1272.0, + 1868.0, + 774.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1287.0, + 1828.0, + 1406.0, + 1828.0, + 1406.0, + 1868.0, + 1287.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 286.0, + 1859.0, + 659.0, + 1859.0, + 659.0, + 1920.0, + 286.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 1859.0, + 861.0, + 1859.0, + 861.0, + 1920.0, + 829.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 895.0, + 1859.0, + 1027.0, + 1859.0, + 1027.0, + 1920.0, + 895.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1090.0, + 1859.0, + 1412.0, + 1859.0, + 1412.0, + 1920.0, + 1090.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1906.0, + 297.0, + 1906.0, + 297.0, + 1939.0, + 294.0, + 1939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 1906.0, + 474.0, + 1906.0, + 474.0, + 1939.0, + 311.0, + 1939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1635.0, + 732.0, + 1635.0, + 732.0, + 1672.0, + 295.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 748.0, + 1635.0, + 1303.0, + 1635.0, + 1303.0, + 1672.0, + 748.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1338.0, + 1635.0, + 1405.0, + 1635.0, + 1405.0, + 1672.0, + 1338.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1667.0, + 459.0, + 1667.0, + 459.0, + 1706.0, + 293.0, + 1706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 1667.0, + 704.0, + 1667.0, + 704.0, + 1706.0, + 516.0, + 1706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 737.0, + 1667.0, + 1053.0, + 1667.0, + 1053.0, + 1706.0, + 737.0, + 1706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1068.0, + 1667.0, + 1236.0, + 1667.0, + 1236.0, + 1706.0, + 1068.0, + 1706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 1667.0, + 1405.0, + 1667.0, + 1405.0, + 1706.0, + 1354.0, + 1706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1698.0, + 404.0, + 1698.0, + 404.0, + 1748.0, + 291.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 434.0, + 1698.0, + 1137.0, + 1698.0, + 1137.0, + 1748.0, + 434.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1197.0, + 1698.0, + 1211.0, + 1698.0, + 1211.0, + 1748.0, + 1197.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 661.0, + 662.0, + 661.0, + 662.0, + 694.0, + 295.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 661.0, + 1405.0, + 661.0, + 1405.0, + 694.0, + 678.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 693.0, + 654.0, + 693.0, + 654.0, + 724.0, + 292.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 670.0, + 693.0, + 1407.0, + 693.0, + 1407.0, + 724.0, + 670.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 721.0, + 482.0, + 721.0, + 482.0, + 755.0, + 294.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 721.0, + 625.0, + 721.0, + 625.0, + 755.0, + 499.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 721.0, + 1112.0, + 721.0, + 1112.0, + 755.0, + 683.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1128.0, + 721.0, + 1406.0, + 721.0, + 1406.0, + 755.0, + 1128.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 750.0, + 1410.0, + 750.0, + 1410.0, + 789.0, + 292.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 794.0, + 1406.0, + 794.0, + 1406.0, + 833.0, + 294.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 826.0, + 1406.0, + 826.0, + 1406.0, + 861.0, + 294.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 856.0, + 1030.0, + 856.0, + 1030.0, + 892.0, + 294.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 919.0, + 1407.0, + 919.0, + 1407.0, + 957.0, + 369.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 953.0, + 1404.0, + 953.0, + 1404.0, + 986.0, + 394.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 981.0, + 1063.0, + 981.0, + 1063.0, + 1017.0, + 394.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1026.0, + 1080.0, + 1026.0, + 1080.0, + 1065.0, + 369.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1104.0, + 1026.0, + 1407.0, + 1026.0, + 1407.0, + 1065.0, + 1104.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1061.0, + 1043.0, + 1061.0, + 1043.0, + 1094.0, + 394.0, + 1094.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1068.0, + 1061.0, + 1404.0, + 1061.0, + 1404.0, + 1094.0, + 1068.0, + 1094.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1091.0, + 1100.0, + 1091.0, + 1100.0, + 1124.0, + 394.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1128.0, + 1091.0, + 1407.0, + 1091.0, + 1407.0, + 1124.0, + 1128.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1119.0, + 826.0, + 1119.0, + 826.0, + 1155.0, + 394.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 853.0, + 1119.0, + 1405.0, + 1119.0, + 1405.0, + 1155.0, + 853.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1151.0, + 1227.0, + 1151.0, + 1227.0, + 1185.0, + 393.0, + 1185.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 1196.0, + 1407.0, + 1196.0, + 1407.0, + 1233.0, + 371.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1228.0, + 1404.0, + 1228.0, + 1404.0, + 1262.0, + 394.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1257.0, + 1407.0, + 1257.0, + 1407.0, + 1294.0, + 393.0, + 1294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1288.0, + 854.0, + 1288.0, + 854.0, + 1322.0, + 395.0, + 1322.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 933, + 1405, + 933, + 1405, + 1241, + 296, + 1241 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 296, + 706, + 1405, + 706, + 1405, + 921, + 296, + 921 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 1350, + 1406, + 1350, + 1406, + 1442, + 297, + 1442 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 297, + 1642, + 1406, + 1642, + 1406, + 1736, + 297, + 1736 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 298, + 202, + 1402, + 202, + 1402, + 294, + 298, + 294 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 297, + 1455, + 1400, + 1455, + 1400, + 1518, + 297, + 1518 + ], + "score": 0.94 + }, + { + "category_id": 0, + "poly": [ + 297, + 1281, + 1216, + 1281, + 1216, + 1321, + 297, + 1321 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 297, + 1744, + 1405, + 1744, + 1405, + 1817, + 297, + 1817 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 295, + 1938, + 1407, + 1938, + 1407, + 2013, + 295, + 2013 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 296, + 1827, + 1408, + 1827, + 1408, + 1932, + 296, + 1932 + ], + "score": 0.905 + }, + { + "category_id": 2, + "poly": [ + 840, + 2061, + 859, + 2061, + 859, + 2085, + 840, + 2085 + ], + "score": 0.722 + }, + { + "category_id": 1, + "poly": [ + 298, + 1527, + 1406, + 1527, + 1406, + 1619, + 298, + 1619 + ], + "score": 0.691 + }, + { + "category_id": 5, + "poly": [ + 305, + 362, + 1379, + 362, + 1379, + 670, + 305, + 670 + ], + "score": 0.496, + "html": "
1: Input: initial wi,learning rate {nt }
2: Server executes:1: DeviceUpdate(i, Wt , nt):
3: initialize Gi ←O,i∈[N]2:w,←Wt
4: fort=1,.,T-1do3: for local step k = O,.,K -1 do
5: broadcast wt to all active devices i ∈ A(t) 4:compute stochastic gradient Vfi(wt,)
6: for each active device idoWk+1←W,k-ntvfi(w,) 5:
7: G ←DeviceUpdate(i,Wt, nt) 8: end for6: end for
Wt+1←wt-∑1 N 9: Gi7:Return (wt - wi,k) to the server
" + }, + { + "category_id": 6, + "poly": [ + 298, + 324, + 1111, + 324, + 1111, + 358, + 298, + 358 + ], + "score": 0.467 + }, + { + "category_id": 13, + "poly": [ + 368, + 1095, + 475, + 1095, + 475, + 1138, + 368, + 1138 + ], + "score": 0.93, + "latex": "G _ { t } ^ { i } - G _ { t _ { i } ^ { \\prime } } ^ { i }" + }, + { + "category_id": 13, + "poly": [ + 1246, + 485, + 1363, + 485, + 1363, + 528, + 1246, + 528 + ], + "score": 0.93, + "latex": "\\tilde { \\nabla } f _ { i } ( w _ { t , k } ^ { i } )" + }, + { + "category_id": 13, + "poly": [ + 506, + 1643, + 628, + 1643, + 628, + 1676, + 506, + 1676 + ], + "score": 0.93, + "latex": "\\tau ( t , i ) = 0" + }, + { + "category_id": 13, + "poly": [ + 365, + 1674, + 481, + 1674, + 481, + 1707, + 365, + 1707 + ], + "score": 0.93, + "latex": "t - \\tau ( t , i )" + }, + { + "category_id": 13, + "poly": [ + 1011, + 1643, + 1284, + 1643, + 1284, + 1677, + 1011, + 1677 + ], + "score": 0.92, + "latex": "\\tau ( t , i ) = \\tau ( t - 1 , i ) + 1" + }, + { + "category_id": 13, + "poly": [ + 1152, + 202, + 1213, + 202, + 1213, + 237, + 1152, + 237 + ], + "score": 0.92, + "latex": "\\{ G _ { t } ^ { i } \\}" + }, + { + "category_id": 13, + "poly": [ + 985, + 591, + 1154, + 591, + 1154, + 632, + 985, + 632 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\frac { 1 } { \\eta _ { t } } \\big ( w _ { t } - w _ { t , K } ^ { i } \\big ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 418, + 1557, + 870, + 1557, + 870, + 1591, + 418, + 1591 + ], + "score": 0.92, + "latex": "\\tau ( t , i ) = t - \\operatorname* { m a x } \\{ t ^ { \\prime } \\mid t ^ { \\prime } \\leq t , i \\in A ( t ^ { \\prime } ) \\}" + }, + { + "category_id": 13, + "poly": [ + 487, + 1824, + 580, + 1824, + 580, + 1863, + 487, + 1863 + ], + "score": 0.92, + "latex": "\\tilde { \\nabla } f _ { i } ( \\boldsymbol { w } )" + }, + { + "category_id": 13, + "poly": [ + 333, + 1164, + 758, + 1164, + 758, + 1208, + 333, + 1208 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\bar { G } _ { t } = \\bar { G } _ { t - 1 } + \\frac { 1 } { N } \\sum _ { i \\in \\mathcal { A } ( t ) } ( G _ { t } ^ { \\bar { i } } - G _ { t _ { i } ^ { \\prime } } ^ { i } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 495, + 1746, + 626, + 1746, + 626, + 1777, + 495, + 1777 + ], + "score": 0.91, + "latex": "f _ { 1 } , \\cdots , f _ { N }" + }, + { + "category_id": 13, + "poly": [ + 1235, + 1065, + 1268, + 1065, + 1268, + 1099, + 1235, + 1099 + ], + "score": 0.91, + "latex": "G _ { t } ^ { i }" + }, + { + "category_id": 13, + "poly": [ + 1358, + 1029, + 1399, + 1029, + 1399, + 1067, + 1358, + 1067 + ], + "score": 0.9, + "latex": "G _ { t _ { i } ^ { \\prime } } ^ { \\ i }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1778, + 660, + 1778, + 660, + 1818, + 298, + 1818 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\left. \\nabla f _ { i } ( w ) , v - w \\right. + \\frac { L } { 2 } \\left\\| w - v \\right\\| ^ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 1206, + 513, + 1206, + 513, + 1241, + 298, + 1241 + ], + "score": 0.89, + "latex": "w _ { t + 1 } = w _ { t } - \\eta _ { t } \\bar { G } _ { t }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1973, + 657, + 1973, + 657, + 2012, + 298, + 2012 + ], + "score": 0.89, + "latex": "\\begin{array} { r } { \\left. \\nabla f _ { i } ( w ) , v - w \\right. + \\frac { \\mu } { 2 } \\left\\| w - v \\right\\| ^ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 449, + 425, + 636, + 425, + 636, + 458, + 449, + 458 + ], + "score": 0.88, + "latex": "G ^ { i } \\gets 0 , i \\in [ N ]" + }, + { + "category_id": 13, + "poly": [ + 744, + 486, + 843, + 486, + 843, + 520, + 744, + 520 + ], + "score": 0.88, + "latex": "i \\in \\mathcal { A } ( t )" + }, + { + "category_id": 13, + "poly": [ + 890, + 1382, + 919, + 1382, + 919, + 1411, + 890, + 1411 + ], + "score": 0.88, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 930, + 1830, + 979, + 1830, + 979, + 1861, + 930, + 1861 + ], + "score": 0.88, + "latex": "\\nabla f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 490, + 1939, + 620, + 1939, + 620, + 1972, + 490, + 1972 + ], + "score": 0.88, + "latex": "f _ { 1 } , \\cdots , f _ { N }" + }, + { + "category_id": 13, + "poly": [ + 1056, + 457, + 1265, + 457, + 1265, + 487, + 1056, + 487 + ], + "score": 0.87, + "latex": "k = 0 , \\cdots , K - 1" + }, + { + "category_id": 13, + "poly": [ + 519, + 1066, + 542, + 1066, + 542, + 1100, + 519, + 1100 + ], + "score": 0.86, + "latex": "t _ { i } ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 484, + 491, + 517, + 491, + 517, + 517, + 484, + 517 + ], + "score": 0.86, + "latex": "w _ { t }" + }, + { + "category_id": 13, + "poly": [ + 1311, + 1828, + 1342, + 1828, + 1342, + 1858, + 1311, + 1858 + ], + "score": 0.85, + "latex": "\\sigma ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 294, + 1861, + 973, + 1861, + 973, + 1934, + 294, + 1934 + ], + "score": 0.85, + "latex": "\\mathbb { E } _ { \\boldsymbol { \\xi } } \\left[ \\tilde { \\nabla } f _ { i } ( \\boldsymbol { w } ) \\right] = \\nabla f _ { i } ( \\boldsymbol { w } ) , \\mathbb { E } _ { \\boldsymbol { \\xi } } \\left[ \\left\\| \\tilde { \\nabla } f _ { i } ( \\boldsymbol { w } ) - \\nabla f _ { i } ( \\boldsymbol { w } ) \\right\\| ^ { 2 } \\right] \\leq \\sigma ^ { 2 } ." + }, + { + "category_id": 13, + "poly": [ + 387, + 457, + 584, + 457, + 584, + 487, + 387, + 487 + ], + "score": 0.84, + "latex": "t = 1 , \\cdots , T - 1" + }, + { + "category_id": 13, + "poly": [ + 634, + 548, + 740, + 548, + 740, + 579, + 634, + 579 + ], + "score": 0.83, + "latex": "( i , w _ { t } , \\eta _ { t } )" + }, + { + "category_id": 13, + "poly": [ + 691, + 364, + 745, + 364, + 745, + 398, + 691, + 398 + ], + "score": 0.83, + "latex": "\\{ \\eta _ { t } \\}" + }, + { + "category_id": 13, + "poly": [ + 1031, + 1133, + 1057, + 1133, + 1057, + 1165, + 1031, + 1165 + ], + "score": 0.83, + "latex": "\\bar { G }" + }, + { + "category_id": 13, + "poly": [ + 400, + 545, + 472, + 545, + 472, + 575, + 400, + 575 + ], + "score": 0.83, + "latex": "G ^ { i } \\gets" + }, + { + "category_id": 13, + "poly": [ + 978, + 1357, + 997, + 1357, + 997, + 1382, + 978, + 1382 + ], + "score": 0.82, + "latex": "\\mu" + }, + { + "category_id": 13, + "poly": [ + 498, + 370, + 533, + 370, + 533, + 396, + 498, + 396 + ], + "score": 0.82, + "latex": "w _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1182, + 1937, + 1410, + 1937, + 1410, + 1975, + 1182, + 1975 + ], + "score": 0.81, + "latex": "f _ { i } ( v ) \\geq f _ { i } ( w ) +" + }, + { + "category_id": 13, + "poly": [ + 1068, + 396, + 1174, + 396, + 1174, + 427, + 1068, + 427 + ], + "score": 0.79, + "latex": "( i , w _ { t } , \\eta _ { t } )" + }, + { + "category_id": 13, + "poly": [ + 725, + 1944, + 745, + 1944, + 745, + 1972, + 725, + 1972 + ], + "score": 0.77, + "latex": "\\mu" + }, + { + "category_id": 13, + "poly": [ + 733, + 1646, + 747, + 1646, + 747, + 1671, + 733, + 1671 + ], + "score": 0.77, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 888, + 1677, + 901, + 1677, + 901, + 1702, + 888, + 1702 + ], + "score": 0.76, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1181, + 1352, + 1203, + 1352, + 1203, + 1378, + 1181, + 1378 + ], + "score": 0.74, + "latex": "L" + }, + { + "category_id": 13, + "poly": [ + 946, + 1647, + 961, + 1647, + 961, + 1671, + 946, + 1671 + ], + "score": 0.74, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 739, + 1747, + 761, + 1747, + 761, + 1773, + 739, + 1773 + ], + "score": 0.74, + "latex": "L" + }, + { + "category_id": 13, + "poly": [ + 1032, + 1750, + 1058, + 1750, + 1058, + 1773, + 1032, + 1773 + ], + "score": 0.73, + "latex": "w" + }, + { + "category_id": 13, + "poly": [ + 902, + 424, + 1024, + 424, + 1024, + 461, + 902, + 461 + ], + "score": 0.72, + "latex": "w _ { t , 0 } ^ { i } \\bar { w } _ { t }" + }, + { + "category_id": 13, + "poly": [ + 1388, + 1560, + 1402, + 1560, + 1402, + 1585, + 1388, + 1585 + ], + "score": 0.72, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 865, + 1170, + 878, + 1170, + 878, + 1195, + 865, + 1195 + ], + "score": 0.72, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 1010, + 1028, + 1023, + 1028, + 1023, + 1053, + 1010, + 1053 + ], + "score": 0.71, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 517, + 207, + 530, + 207, + 530, + 232, + 517, + 232 + ], + "score": 0.7, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 1169, + 1742, + 1406, + 1742, + 1406, + 1780, + 1169, + 1780 + ], + "score": 0.67, + "latex": "\\begin{array} { r c l } { f _ { i } ( v ) } & { \\leq } & { f _ { i } ( w ) \\ + } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 928, + 524, + 1274, + 524, + 1274, + 568, + 928, + 568 + ], + "score": 0.64, + "latex": "w _ { t , k + 1 } ^ { i } w _ { t , k } ^ { i } - \\eta _ { t } \\tilde { \\nabla } f _ { i } ( w _ { t , k } ^ { i } )" + }, + { + "category_id": 13, + "poly": [ + 1056, + 1945, + 1080, + 1945, + 1080, + 1967, + 1056, + 1967 + ], + "score": 0.62, + "latex": "w" + }, + { + "category_id": 14, + "poly": [ + 370, + 599, + 676, + 599, + 676, + 645, + 370, + 645 + ], + "score": 0.59, + "latex": "\\begin{array} { r l } & { w _ { t + 1 } \\gets w _ { t } - \\frac { \\eta _ { t } } { N } \\sum _ { i = 1 } ^ { N } G ^ { i } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 621, + 519, + 635, + 519, + 635, + 544, + 621, + 544 + ], + "score": 0.58, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 368, + 1560, + 382, + 1560, + 382, + 1585, + 368, + 1585 + ], + "score": 0.53, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 1146, + 1944, + 1164, + 1944, + 1164, + 1968, + 1146, + 1968 + ], + "score": 0.48, + "latex": "v _ { \\scriptscriptstyle { i } }" + }, + { + "category_id": 14, + "poly": [ + 928, + 524, + 1274, + 524, + 1274, + 568, + 928, + 568 + ], + "score": 0.42, + "latex": "w _ { t , k + 1 } ^ { i } w _ { t , k } ^ { i } - \\eta _ { t } \\tilde { \\nabla } f _ { i } ( w _ { t , k } ^ { i } )" + }, + { + "category_id": 13, + "poly": [ + 1129, + 1750, + 1147, + 1750, + 1147, + 1774, + 1129, + 1774 + ], + "score": 0.41, + "latex": "v _ { \\scriptscriptstyle { i } }" + }, + { + "category_id": 13, + "poly": [ + 1360, + 1530, + 1373, + 1530, + 1373, + 1555, + 1360, + 1555 + ], + "score": 0.33, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 668, + 1593, + 681, + 1593, + 681, + 1614, + 668, + 1614 + ], + "score": 0.29, + "latex": "i" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 1276.0, + 1220.0, + 1276.0, + 1220.0, + 1329.0, + 287.0, + 1329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2059.0, + 861.0, + 2059.0, + 861.0, + 2091.0, + 839.0, + 2091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 319.0, + 1116.0, + 319.0, + 1116.0, + 367.0, + 293.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 931.0, + 1407.0, + 931.0, + 1407.0, + 968.0, + 294.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 965.0, + 1405.0, + 965.0, + 1405.0, + 995.0, + 294.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 993.0, + 1405.0, + 993.0, + 1405.0, + 1031.0, + 294.0, + 1031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1014.0, + 1009.0, + 1014.0, + 1009.0, + 1073.0, + 289.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1024.0, + 1014.0, + 1357.0, + 1014.0, + 1357.0, + 1073.0, + 1024.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1400.0, + 1014.0, + 1409.0, + 1014.0, + 1409.0, + 1073.0, + 1400.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1063.0, + 518.0, + 1063.0, + 518.0, + 1102.0, + 294.0, + 1102.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 543.0, + 1063.0, + 1234.0, + 1063.0, + 1234.0, + 1102.0, + 543.0, + 1102.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1269.0, + 1063.0, + 1406.0, + 1063.0, + 1406.0, + 1102.0, + 1269.0, + 1102.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1090.0, + 367.0, + 1090.0, + 367.0, + 1137.0, + 290.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 476.0, + 1090.0, + 1408.0, + 1090.0, + 1408.0, + 1137.0, + 476.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1137.0, + 1030.0, + 1137.0, + 1030.0, + 1169.0, + 296.0, + 1169.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 1137.0, + 1406.0, + 1137.0, + 1406.0, + 1169.0, + 1058.0, + 1169.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 1151.0, + 332.0, + 1151.0, + 332.0, + 1222.0, + 285.0, + 1222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 759.0, + 1151.0, + 864.0, + 1151.0, + 864.0, + 1222.0, + 759.0, + 1222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 1151.0, + 1414.0, + 1151.0, + 1414.0, + 1222.0, + 879.0, + 1222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1206.0, + 297.0, + 1206.0, + 297.0, + 1242.0, + 292.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 514.0, + 1206.0, + 524.0, + 1206.0, + 524.0, + 1242.0, + 514.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 708.0, + 1405.0, + 708.0, + 1405.0, + 742.0, + 294.0, + 742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 737.0, + 1403.0, + 737.0, + 1403.0, + 774.0, + 294.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 767.0, + 1405.0, + 767.0, + 1405.0, + 804.0, + 293.0, + 804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 797.0, + 1405.0, + 797.0, + 1405.0, + 833.0, + 293.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 827.0, + 1403.0, + 827.0, + 1403.0, + 863.0, + 295.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 859.0, + 1406.0, + 859.0, + 1406.0, + 892.0, + 293.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 889.0, + 625.0, + 889.0, + 625.0, + 923.0, + 295.0, + 923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1348.0, + 977.0, + 1348.0, + 977.0, + 1389.0, + 291.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 998.0, + 1348.0, + 1180.0, + 1348.0, + 1180.0, + 1389.0, + 998.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1204.0, + 1348.0, + 1408.0, + 1348.0, + 1408.0, + 1389.0, + 1204.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1378.0, + 889.0, + 1378.0, + 889.0, + 1418.0, + 292.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 920.0, + 1378.0, + 1406.0, + 1378.0, + 1406.0, + 1418.0, + 920.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1411.0, + 535.0, + 1411.0, + 535.0, + 1446.0, + 292.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1643.0, + 505.0, + 1643.0, + 505.0, + 1677.0, + 295.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 629.0, + 1643.0, + 732.0, + 1643.0, + 732.0, + 1677.0, + 629.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 748.0, + 1643.0, + 945.0, + 1643.0, + 945.0, + 1677.0, + 748.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 962.0, + 1643.0, + 1010.0, + 1643.0, + 1010.0, + 1677.0, + 962.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1285.0, + 1643.0, + 1406.0, + 1643.0, + 1406.0, + 1677.0, + 1285.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1673.0, + 364.0, + 1673.0, + 364.0, + 1708.0, + 294.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 482.0, + 1673.0, + 887.0, + 1673.0, + 887.0, + 1708.0, + 482.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 902.0, + 1673.0, + 1404.0, + 1673.0, + 1404.0, + 1708.0, + 902.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1704.0, + 835.0, + 1704.0, + 835.0, + 1740.0, + 294.0, + 1740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 201.0, + 516.0, + 201.0, + 516.0, + 238.0, + 293.0, + 238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 531.0, + 201.0, + 1151.0, + 201.0, + 1151.0, + 238.0, + 531.0, + 238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.0, + 201.0, + 1406.0, + 201.0, + 1406.0, + 238.0, + 1214.0, + 238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 234.0, + 1404.0, + 234.0, + 1404.0, + 267.0, + 294.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 258.0, + 397.0, + 258.0, + 397.0, + 299.0, + 292.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1452.0, + 1405.0, + 1452.0, + 1405.0, + 1493.0, + 292.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1484.0, + 1048.0, + 1484.0, + 1048.0, + 1523.0, + 293.0, + 1523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1737.0, + 494.0, + 1737.0, + 494.0, + 1783.0, + 294.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 1737.0, + 738.0, + 1737.0, + 738.0, + 1783.0, + 627.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 762.0, + 1737.0, + 1031.0, + 1737.0, + 1031.0, + 1783.0, + 762.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 1737.0, + 1128.0, + 1737.0, + 1128.0, + 1783.0, + 1059.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1148.0, + 1737.0, + 1168.0, + 1737.0, + 1168.0, + 1783.0, + 1148.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1407.0, + 1737.0, + 1410.0, + 1737.0, + 1410.0, + 1783.0, + 1407.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 1772.0, + 674.0, + 1772.0, + 674.0, + 1820.0, + 661.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1933.0, + 489.0, + 1933.0, + 489.0, + 1977.0, + 293.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 621.0, + 1933.0, + 724.0, + 1933.0, + 724.0, + 1977.0, + 621.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1933.0, + 1055.0, + 1933.0, + 1055.0, + 1977.0, + 746.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1081.0, + 1933.0, + 1145.0, + 1933.0, + 1145.0, + 1977.0, + 1081.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1165.0, + 1933.0, + 1181.0, + 1933.0, + 1181.0, + 1977.0, + 1165.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1970.0, + 297.0, + 1970.0, + 297.0, + 2014.0, + 294.0, + 2014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1970.0, + 671.0, + 1970.0, + 671.0, + 2014.0, + 658.0, + 2014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1818.0, + 486.0, + 1818.0, + 486.0, + 1871.0, + 293.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 581.0, + 1818.0, + 929.0, + 1818.0, + 929.0, + 1871.0, + 581.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 1818.0, + 1310.0, + 1818.0, + 1310.0, + 1871.0, + 980.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 1818.0, + 1410.0, + 1818.0, + 1410.0, + 1871.0, + 1343.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1853.0, + 293.0, + 1853.0, + 293.0, + 1937.0, + 283.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 974.0, + 1853.0, + 990.0, + 1853.0, + 990.0, + 1937.0, + 974.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1525.0, + 1359.0, + 1525.0, + 1359.0, + 1562.0, + 293.0, + 1562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1374.0, + 1525.0, + 1407.0, + 1525.0, + 1407.0, + 1562.0, + 1374.0, + 1562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1555.0, + 367.0, + 1555.0, + 367.0, + 1593.0, + 293.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 1555.0, + 417.0, + 1555.0, + 417.0, + 1593.0, + 383.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 1555.0, + 1387.0, + 1555.0, + 1387.0, + 1593.0, + 871.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 1555.0, + 1406.0, + 1555.0, + 1406.0, + 1593.0, + 1403.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1589.0, + 667.0, + 1589.0, + 667.0, + 1619.0, + 296.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 1589.0, + 788.0, + 1589.0, + 788.0, + 1619.0, + 682.0, + 1619.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1232, + 1405, + 1232, + 1405, + 1406, + 296, + 1406 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 295, + 1805, + 1406, + 1805, + 1406, + 2014, + 295, + 2014 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 297, + 491, + 1406, + 491, + 1406, + 621, + 297, + 621 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 297, + 777, + 1405, + 777, + 1405, + 905, + 297, + 905 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 296, + 323, + 1406, + 323, + 1406, + 480, + 296, + 480 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 295, + 1706, + 1406, + 1706, + 1406, + 1802, + 295, + 1802 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 299, + 1601, + 1401, + 1601, + 1401, + 1696, + 299, + 1696 + ], + "score": 0.963 + }, + { + "category_id": 1, + "poly": [ + 297, + 202, + 1404, + 202, + 1404, + 305, + 297, + 305 + ], + "score": 0.962 + }, + { + "category_id": 8, + "poly": [ + 657, + 1513, + 1038, + 1513, + 1038, + 1583, + 657, + 1583 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 297, + 1410, + 1401, + 1410, + 1401, + 1504, + 297, + 1504 + ], + "score": 0.954 + }, + { + "category_id": 8, + "poly": [ + 479, + 628, + 1220, + 628, + 1220, + 720, + 479, + 720 + ], + "score": 0.949 + }, + { + "category_id": 8, + "poly": [ + 410, + 913, + 1283, + 913, + 1283, + 1001, + 410, + 1001 + ], + "score": 0.942 + }, + { + "category_id": 1, + "poly": [ + 297, + 1021, + 854, + 1021, + 854, + 1055, + 297, + 1055 + ], + "score": 0.932 + }, + { + "category_id": 8, + "poly": [ + 415, + 1064, + 1282, + 1064, + 1282, + 1154, + 415, + 1154 + ], + "score": 0.932 + }, + { + "category_id": 1, + "poly": [ + 299, + 739, + 1115, + 739, + 1115, + 773, + 299, + 773 + ], + "score": 0.919 + }, + { + "category_id": 2, + "poly": [ + 839, + 2061, + 859, + 2061, + 859, + 2086, + 839, + 2086 + ], + "score": 0.693 + }, + { + "category_id": 8, + "poly": [ + 295, + 1176, + 1199, + 1176, + 1199, + 1218, + 295, + 1218 + ], + "score": 0.54 + }, + { + "category_id": 1, + "poly": [ + 295, + 1176, + 1199, + 1176, + 1199, + 1218, + 295, + 1218 + ], + "score": 0.418 + }, + { + "category_id": 2, + "poly": [ + 839, + 2061, + 859, + 2061, + 859, + 2086, + 839, + 2086 + ], + "score": 0.194 + }, + { + "category_id": 13, + "poly": [ + 978, + 1265, + 1149, + 1265, + 1149, + 1298, + 978, + 1298 + ], + "score": 0.94, + "latex": "\\tau _ { \\operatorname* { m a x } , T } = o ( T )" + }, + { + "category_id": 14, + "poly": [ + 479, + 624, + 1220, + 624, + 1220, + 722, + 479, + 722 + ], + "score": 0.94, + "latex": "\\bar { \\tau } _ { T } = \\frac { 1 } { N ( T - 1 ) } \\sum _ { t = 1 } ^ { T - 1 } \\sum _ { i = 1 } ^ { N } \\tau ( t , i ) , \\tau _ { \\operatorname* { m a x } , T } = \\operatorname* { m a x } _ { i \\in [ N ] } \\operatorname* { m a x } _ { 1 \\leq t \\leq T - 1 } \\tau ( t , i ) ." + }, + { + "category_id": 13, + "poly": [ + 1028, + 1868, + 1409, + 1868, + 1409, + 1924, + 1028, + 1924 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\mathcal { O } \\bigg ( \\frac { \\sigma ^ { 2 } \\log T } { \\mu K N T } + \\frac { L ( \\sigma ^ { 2 } / K + D ) ( \\log T ) ^ { 2 } } { \\mu ^ { 2 } T ^ { 2 } } + } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1057, + 491, + 1370, + 491, + 1370, + 533, + 1057, + 533 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } { D = } & { { } \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\left. \\nabla f _ { i } ( w _ { * } ) \\right. ^ { 2 } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 411, + 910, + 1286, + 910, + 1286, + 1003, + 411, + 1003 + ], + "score": 0.93, + "latex": "\\mathbb { E } _ { \\xi } \\left[ f ( \\overline { { w } } _ { T } ) \\right] - f ( w _ { * } ) = \\mathcal { O } \\left( \\frac { \\bar { \\tau } _ { T } + 1 } { \\mu N K T } \\sigma ^ { 2 } + \\frac { \\tau _ { \\operatorname* { m a x } , T } ^ { 2 } A _ { 1 } + ( K - 1 ) ^ { 2 } A _ { 2 } + A _ { 3 } } { \\mu ^ { 2 } T ^ { 2 } } \\right) ," + }, + { + "category_id": 14, + "poly": [ + 416, + 1059, + 1280, + 1059, + 1280, + 1155, + 416, + 1155 + ], + "score": 0.93, + "latex": "\\overline { { w } } _ { T } = \\frac { 1 } { W _ { T } } \\sum _ { t = 1 } ^ { T } ( t + a - 1 ) ( t + a - 2 ) w _ { t } , W _ { T } = \\sum _ { t = 1 } ^ { T } ( t + a - 1 ) ( t + a - 2 ) ," + }, + { + "category_id": 13, + "poly": [ + 1201, + 1264, + 1317, + 1264, + 1317, + 1298, + 1201, + 1298 + ], + "score": 0.93, + "latex": "\\dot { t _ { 0 } } = \\bar { o } ( T )" + }, + { + "category_id": 14, + "poly": [ + 658, + 1509, + 1040, + 1509, + 1040, + 1584, + 658, + 1584 + ], + "score": 0.93, + "latex": "\\mathbb { E } [ f ( w _ { T } ) - f ( w ^ { * } ) ] \\geq c _ { 0 } \\frac { \\bar { \\tau } _ { T } \\sigma ^ { 2 } } { \\mu N K T } ." + }, + { + "category_id": 13, + "poly": [ + 1073, + 559, + 1145, + 559, + 1145, + 592, + 1073, + 592 + ], + "score": 0.93, + "latex": "\\tau ( t , i )" + }, + { + "category_id": 13, + "poly": [ + 372, + 1869, + 819, + 1869, + 819, + 1923, + 372, + 1923 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\mathcal { O } \\left( \\frac { \\sigma ^ { 2 } } { \\mu K N T } + \\frac { L ( \\sigma ^ { 2 } / K + D + L ^ { 2 } \\| w _ { 1 } - w _ { * } \\| ^ { 2 } ) } { \\mu ^ { 2 } T ^ { 2 } } \\right) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1206, + 1307, + 1312, + 1307, + 1312, + 1343, + 1206, + 1343 + ], + "score": 0.92, + "latex": "\\mathcal { O } ( 1 / T ^ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 886, + 1707, + 992, + 1707, + 992, + 1742, + 886, + 1742 + ], + "score": 0.92, + "latex": "\\mathcal { O } ( 1 / T ^ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 538, + 1974, + 740, + 1974, + 740, + 2013, + 538, + 2013 + ], + "score": 0.92, + "latex": "\\mathcal { O } ( \\tau _ { \\mathrm { m a x } , T } ^ { 2 } A _ { 1 } / T ^ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 752, + 415, + 808, + 415, + 808, + 449, + 752, + 449 + ], + "score": 0.92, + "latex": "{ \\mathcal { O } } ( t )" + }, + { + "category_id": 13, + "poly": [ + 297, + 1298, + 570, + 1298, + 570, + 1347, + 297, + 1347 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { T = \\Omega ( \\frac { N K ( \\tau _ { \\mathrm { m a x } , T } ^ { 2 } + t _ { 0 } ^ { 2 } ) } { \\bar { \\tau } + 1 } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1021, + 808, + 1115, + 808, + 1115, + 842, + 1021, + 842 + ], + "score": 0.91, + "latex": "i \\in [ N ]" + }, + { + "category_id": 13, + "poly": [ + 298, + 1265, + 478, + 1265, + 478, + 1298, + 298, + 1298 + ], + "score": 0.91, + "latex": "\\tau _ { \\mathrm { m a x } , T } = \\mathcal { O } ( T )" + }, + { + "category_id": 13, + "poly": [ + 801, + 808, + 936, + 808, + 936, + 840, + 801, + 840 + ], + "score": 0.91, + "latex": "\\tau ( 1 , i ) = 0" + }, + { + "category_id": 13, + "poly": [ + 544, + 1805, + 690, + 1805, + 690, + 1840, + 544, + 1840 + ], + "score": 0.91, + "latex": "\\tau ( t , i ) ~ = ~ 0" + }, + { + "category_id": 13, + "poly": [ + 683, + 528, + 909, + 528, + 909, + 561, + 683, + 561 + ], + "score": 0.9, + "latex": "w _ { * } = \\arg \\operatorname* { m i n } f ( w )" + }, + { + "category_id": 13, + "poly": [ + 1055, + 234, + 1259, + 234, + 1259, + 269, + 1055, + 269 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\tau ( t , i ) \\leq t _ { 0 } + \\frac { 1 } { b } \\dot { t } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 351, + 839, + 511, + 839, + 511, + 879, + 351, + 879 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\eta _ { t } = \\frac { 4 } { \\mu K ( t + a ) } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 297, + 1925, + 628, + 1925, + 628, + 1972, + 297, + 1972 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\mu \\left. w _ { 1 } - w _ { * } \\right. ^ { 2 } \\exp ( - \\frac { \\mu } { 4 8 L } T ) \\Bigr ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 751, + 205, + 833, + 205, + 833, + 235, + 751, + 235 + ], + "score": 0.9, + "latex": "t _ { 0 } > 0" + }, + { + "category_id": 13, + "poly": [ + 573, + 839, + 915, + 839, + 915, + 873, + 573, + 873 + ], + "score": 0.9, + "latex": "a = \\operatorname* { m a x } \\{ 1 0 0 , 4 0 t _ { 0 } \\} ( L / \\mu ) ^ { 1 . 5 }" + }, + { + "category_id": 13, + "poly": [ + 845, + 1839, + 991, + 1839, + 991, + 1871, + 845, + 1871 + ], + "score": 0.9, + "latex": "\\tau _ { \\mathrm { m a x } , T } ~ = ~ 0" + }, + { + "category_id": 13, + "poly": [ + 1070, + 1743, + 1150, + 1743, + 1150, + 1773, + 1070, + 1773 + ], + "score": 0.9, + "latex": "\\tau _ { \\operatorname* { m a x } , T }" + }, + { + "category_id": 13, + "poly": [ + 682, + 1839, + 783, + 1839, + 783, + 1868, + 682, + 1868 + ], + "score": 0.89, + "latex": "\\bar { \\tau } _ { T } ~ = ~ 0" + }, + { + "category_id": 13, + "poly": [ + 297, + 265, + 431, + 265, + 431, + 307, + 297, + 307 + ], + "score": 0.89, + "latex": "4 0 \\left( L / \\mu \\right) ^ { 1 . 5 }" + }, + { + "category_id": 13, + "poly": [ + 1163, + 203, + 1255, + 203, + 1255, + 234, + 1163, + 234 + ], + "score": 0.89, + "latex": "i \\in [ N ]" + }, + { + "category_id": 13, + "poly": [ + 543, + 1411, + 627, + 1411, + 627, + 1442, + 543, + 1442 + ], + "score": 0.89, + "latex": "c _ { 0 } > 0" + }, + { + "category_id": 13, + "poly": [ + 297, + 563, + 377, + 563, + 377, + 592, + 297, + 592 + ], + "score": 0.89, + "latex": "\\tau _ { \\operatorname* { m a x } , T }" + }, + { + "category_id": 13, + "poly": [ + 1037, + 204, + 1108, + 204, + 1108, + 233, + 1037, + 233 + ], + "score": 0.88, + "latex": "t \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 988, + 840, + 1061, + 840, + 1061, + 868, + 988, + 868 + ], + "score": 0.88, + "latex": "T - 1" + }, + { + "category_id": 13, + "poly": [ + 297, + 1635, + 330, + 1635, + 330, + 1663, + 297, + 1663 + ], + "score": 0.86, + "latex": "\\bar { \\tau } _ { T }" + }, + { + "category_id": 13, + "poly": [ + 371, + 1026, + 411, + 1026, + 411, + 1053, + 371, + 1053 + ], + "score": 0.86, + "latex": "\\overline { { w } } _ { T }" + }, + { + "category_id": 13, + "poly": [ + 542, + 1770, + 628, + 1770, + 628, + 1801, + 542, + 1801 + ], + "score": 0.85, + "latex": "( K > 1 )" + }, + { + "category_id": 13, + "poly": [ + 1319, + 532, + 1353, + 532, + 1353, + 558, + 1319, + 558 + ], + "score": 0.85, + "latex": "\\bar { \\tau } _ { T }" + }, + { + "category_id": 13, + "poly": [ + 410, + 809, + 481, + 809, + 481, + 840, + 410, + 840 + ], + "score": 0.85, + "latex": "\\tau ( t , i )" + }, + { + "category_id": 13, + "poly": [ + 692, + 1026, + 725, + 1026, + 725, + 1053, + 692, + 1053 + ], + "score": 0.84, + "latex": "w _ { t }" + }, + { + "category_id": 13, + "poly": [ + 1352, + 234, + 1404, + 234, + 1404, + 265, + 1352, + 265 + ], + "score": 0.83, + "latex": "b =" + }, + { + "category_id": 13, + "poly": [ + 347, + 1180, + 594, + 1180, + 594, + 1215, + 347, + 1215 + ], + "score": 0.79, + "latex": "A _ { 1 } = L ( D + L \\sigma ^ { 2 } / \\mu )" + }, + { + "category_id": 13, + "poly": [ + 817, + 1930, + 994, + 1930, + 994, + 1967, + 817, + 1967 + ], + "score": 0.77, + "latex": "B ^ { 2 } = 2 , \\eta _ { g } = 1 ," + }, + { + "category_id": 13, + "poly": [ + 298, + 1476, + 337, + 1476, + 337, + 1502, + 298, + 1502 + ], + "score": 0.74, + "latex": "w _ { T }" + }, + { + "category_id": 14, + "poly": [ + 494, + 1171, + 1198, + 1171, + 1198, + 1217, + 494, + 1217 + ], + "score": 0.73, + "latex": "\\begin{array} { r } { \\cdot \\ L \\sigma ^ { 2 } / \\mu ) , \\ A _ { 2 } = L ( D / K ^ { 2 } + \\sigma ^ { 2 } / K ^ { 3 } ) , \\ A _ { 3 } = t _ { 0 } ^ { 2 } L ^ { 3 } \\left\\| w _ { 1 } - w _ { * } \\right\\| ^ { 2 } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 365, + 1173, + 1198, + 1173, + 1198, + 1217, + 365, + 1217 + ], + "score": 0.73, + "latex": "\\mathrm { \\iota _ { 1 } } = L ( D + L \\sigma ^ { 2 } / \\mu ) , A _ { 2 } = L ( D / K ^ { 2 } + \\sigma ^ { 2 } / K ^ { 3 } ) , A _ { 3 } = t _ { 0 } ^ { 2 } L ^ { 3 } \\left\\| w _ { 1 } - w _ { * } \\right\\| ^ { 2 } ." + }, + { + "category_id": 13, + "poly": [ + 936, + 237, + 950, + 237, + 950, + 261, + 936, + 261 + ], + "score": 0.59, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 863, + 1809, + 879, + 1809, + 879, + 1835, + 863, + 1835 + ], + "score": 0.58, + "latex": "t _ { : }" + }, + { + "category_id": 13, + "poly": [ + 1073, + 1976, + 1204, + 1976, + 1204, + 2008, + 1073, + 2008 + ], + "score": 0.55, + "latex": "I 6 J \\left( C o r . 5 \\right)" + }, + { + "category_id": 13, + "poly": [ + 726, + 810, + 746, + 810, + 746, + 836, + 726, + 836 + ], + "score": 0.54, + "latex": "^ { 4 }" + }, + { + "category_id": 13, + "poly": [ + 401, + 1473, + 422, + 1473, + 422, + 1499, + 401, + 1499 + ], + "score": 0.54, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1103, + 1444, + 1119, + 1444, + 1119, + 1469, + 1103, + 1469 + ], + "score": 0.42, + "latex": "^ { l }" + }, + { + "category_id": 13, + "poly": [ + 765, + 780, + 781, + 780, + 781, + 805, + 765, + 805 + ], + "score": 0.41, + "latex": "^ { l }" + }, + { + "category_id": 13, + "poly": [ + 786, + 1808, + 803, + 1808, + 803, + 1834, + 786, + 1834 + ], + "score": 0.34, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 627, + 236, + 639, + 236, + 639, + 261, + 627, + 261 + ], + "score": 0.26, + "latex": "i" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2060.0, + 861.0, + 2060.0, + 861.0, + 2090.0, + 840.0, + 2090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2060.0, + 861.0, + 2060.0, + 861.0, + 2090.0, + 840.0, + 2090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1233.0, + 1403.0, + 1233.0, + 1403.0, + 1268.0, + 298.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1262.0, + 297.0, + 1262.0, + 297.0, + 1303.0, + 293.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 479.0, + 1262.0, + 977.0, + 1262.0, + 977.0, + 1303.0, + 479.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 1262.0, + 1200.0, + 1262.0, + 1200.0, + 1303.0, + 1150.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1318.0, + 1262.0, + 1407.0, + 1262.0, + 1407.0, + 1303.0, + 1318.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1302.0, + 296.0, + 1302.0, + 296.0, + 1343.0, + 293.0, + 1343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1342.0, + 1403.0, + 1342.0, + 1403.0, + 1376.0, + 294.0, + 1376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1372.0, + 883.0, + 1372.0, + 883.0, + 1408.0, + 294.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 378.25, + 1285.5, + 1416.25, + 1285.5, + 1416.25, + 1357.5, + 378.25, + 1357.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1804.0, + 543.0, + 1804.0, + 543.0, + 1838.0, + 297.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.0, + 1804.0, + 785.0, + 1804.0, + 785.0, + 1838.0, + 691.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 1804.0, + 862.0, + 1804.0, + 862.0, + 1838.0, + 804.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 1804.0, + 1407.0, + 1804.0, + 1407.0, + 1838.0, + 880.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1832.0, + 371.0, + 1832.0, + 371.0, + 1922.0, + 292.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 1832.0, + 844.0, + 1832.0, + 844.0, + 1922.0, + 820.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 1832.0, + 1027.0, + 1832.0, + 1027.0, + 1922.0, + 992.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1410.0, + 1832.0, + 1417.0, + 1832.0, + 1417.0, + 1922.0, + 1410.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1917.0, + 296.0, + 1917.0, + 296.0, + 1983.0, + 288.0, + 1983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 629.0, + 1917.0, + 816.0, + 1917.0, + 816.0, + 1983.0, + 629.0, + 1983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 995.0, + 1917.0, + 1408.0, + 1917.0, + 1408.0, + 1983.0, + 995.0, + 1983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1969.0, + 537.0, + 1969.0, + 537.0, + 2018.0, + 292.0, + 2018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 741.0, + 1969.0, + 1072.0, + 1969.0, + 1072.0, + 2018.0, + 741.0, + 2018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1205.0, + 1969.0, + 1220.0, + 1969.0, + 1220.0, + 2018.0, + 1205.0, + 2018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 407.75, + 1889.0, + 498.75, + 1889.0, + 498.75, + 1921.5, + 407.75, + 1921.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 279.0, + 484.0, + 1056.0, + 484.0, + 1056.0, + 547.0, + 279.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1371.0, + 484.0, + 1418.0, + 484.0, + 1418.0, + 547.0, + 1371.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 526.0, + 682.0, + 526.0, + 682.0, + 562.0, + 292.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 910.0, + 526.0, + 1318.0, + 526.0, + 1318.0, + 562.0, + 910.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 526.0, + 1406.0, + 526.0, + 1406.0, + 562.0, + 1354.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 378.0, + 558.0, + 1072.0, + 558.0, + 1072.0, + 593.0, + 378.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1146.0, + 558.0, + 1406.0, + 558.0, + 1406.0, + 593.0, + 1146.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 588.0, + 622.0, + 588.0, + 622.0, + 622.0, + 295.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 773.0, + 764.0, + 773.0, + 764.0, + 813.0, + 294.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 782.0, + 773.0, + 1406.0, + 773.0, + 1406.0, + 813.0, + 782.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 805.0, + 409.0, + 805.0, + 409.0, + 847.0, + 291.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 482.0, + 805.0, + 725.0, + 805.0, + 725.0, + 847.0, + 482.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 805.0, + 800.0, + 805.0, + 800.0, + 847.0, + 747.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 937.0, + 805.0, + 1020.0, + 805.0, + 1020.0, + 847.0, + 937.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 805.0, + 1406.0, + 805.0, + 1406.0, + 847.0, + 1116.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 836.0, + 350.0, + 836.0, + 350.0, + 885.0, + 292.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 836.0, + 572.0, + 836.0, + 572.0, + 885.0, + 512.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 916.0, + 836.0, + 987.0, + 836.0, + 987.0, + 885.0, + 916.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 836.0, + 1407.0, + 836.0, + 1407.0, + 885.0, + 1062.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 871.0, + 404.0, + 871.0, + 404.0, + 911.0, + 292.0, + 911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 324.0, + 1403.0, + 324.0, + 1403.0, + 357.0, + 295.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 348.0, + 1409.0, + 348.0, + 1409.0, + 396.0, + 291.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 384.0, + 1406.0, + 384.0, + 1406.0, + 422.0, + 295.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 412.0, + 751.0, + 412.0, + 751.0, + 451.0, + 294.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 412.0, + 1406.0, + 412.0, + 1406.0, + 451.0, + 809.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 446.0, + 1040.0, + 446.0, + 1040.0, + 483.0, + 294.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1706.0, + 885.0, + 1706.0, + 885.0, + 1744.0, + 294.0, + 1744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 993.0, + 1706.0, + 1403.0, + 1706.0, + 1403.0, + 1744.0, + 993.0, + 1744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1736.0, + 1069.0, + 1736.0, + 1069.0, + 1776.0, + 293.0, + 1776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 1736.0, + 1406.0, + 1736.0, + 1406.0, + 1776.0, + 1151.0, + 1776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1767.0, + 541.0, + 1767.0, + 541.0, + 1803.0, + 294.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 629.0, + 1767.0, + 1364.0, + 1767.0, + 1364.0, + 1803.0, + 629.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1602.0, + 1403.0, + 1602.0, + 1403.0, + 1636.0, + 295.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 1633.0, + 1405.0, + 1633.0, + 1405.0, + 1667.0, + 331.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1663.0, + 1318.0, + 1663.0, + 1318.0, + 1701.0, + 294.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 201.0, + 750.0, + 201.0, + 750.0, + 237.0, + 295.0, + 237.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 834.0, + 201.0, + 1036.0, + 201.0, + 1036.0, + 237.0, + 834.0, + 237.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1109.0, + 201.0, + 1162.0, + 201.0, + 1162.0, + 237.0, + 1109.0, + 237.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1256.0, + 201.0, + 1406.0, + 201.0, + 1406.0, + 237.0, + 1256.0, + 237.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 231.0, + 626.0, + 231.0, + 626.0, + 269.0, + 292.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 231.0, + 935.0, + 231.0, + 935.0, + 269.0, + 640.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 951.0, + 231.0, + 1054.0, + 231.0, + 1054.0, + 269.0, + 951.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1260.0, + 231.0, + 1351.0, + 231.0, + 1351.0, + 269.0, + 1260.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 286.0, + 263.0, + 296.0, + 263.0, + 296.0, + 310.0, + 286.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 432.0, + 263.0, + 443.0, + 263.0, + 443.0, + 310.0, + 432.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1407.0, + 542.0, + 1407.0, + 542.0, + 1446.0, + 293.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 1407.0, + 1407.0, + 1407.0, + 1407.0, + 1446.0, + 628.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1442.0, + 1102.0, + 1442.0, + 1102.0, + 1476.0, + 296.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 1442.0, + 1405.0, + 1442.0, + 1405.0, + 1476.0, + 1120.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 338.0, + 1472.0, + 400.0, + 1472.0, + 400.0, + 1508.0, + 338.0, + 1508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1472.0, + 1233.0, + 1472.0, + 1233.0, + 1508.0, + 423.0, + 1508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1021.0, + 370.0, + 1021.0, + 370.0, + 1058.0, + 297.0, + 1058.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 412.0, + 1021.0, + 691.0, + 1021.0, + 691.0, + 1058.0, + 412.0, + 1058.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 726.0, + 1021.0, + 855.0, + 1021.0, + 855.0, + 1058.0, + 726.0, + 1058.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 737.0, + 1117.0, + 737.0, + 1117.0, + 777.0, + 294.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1170.0, + 346.0, + 1170.0, + 346.0, + 1224.0, + 291.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1199.0, + 1170.0, + 1202.0, + 1170.0, + 1202.0, + 1224.0, + 1199.0, + 1224.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 419, + 1405, + 419, + 1405, + 634, + 297, + 634 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1830, + 1404, + 1830, + 1404, + 2009, + 297, + 2009 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 1617, + 1405, + 1617, + 1405, + 1729, + 297, + 1729 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 297, + 646, + 1405, + 646, + 1405, + 771, + 297, + 771 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 297, + 778, + 1404, + 778, + 1404, + 905, + 297, + 905 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 297, + 201, + 1406, + 201, + 1406, + 327, + 297, + 327 + ], + "score": 0.968 + }, + { + "category_id": 8, + "poly": [ + 644, + 1498, + 1053, + 1498, + 1053, + 1589, + 644, + 1589 + ], + "score": 0.958 + }, + { + "category_id": 8, + "poly": [ + 647, + 1735, + 1049, + 1735, + 1049, + 1823, + 647, + 1823 + ], + "score": 0.957 + }, + { + "category_id": 8, + "poly": [ + 653, + 1082, + 1044, + 1082, + 1044, + 1151, + 653, + 1151 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 295, + 1169, + 1403, + 1169, + 1403, + 1257, + 295, + 1257 + ], + "score": 0.953 + }, + { + "category_id": 8, + "poly": [ + 613, + 1274, + 1085, + 1274, + 1085, + 1346, + 613, + 1346 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 298, + 927, + 1399, + 927, + 1399, + 992, + 298, + 992 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 297, + 1414, + 1405, + 1414, + 1405, + 1478, + 297, + 1478 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 294, + 1000, + 1404, + 1000, + 1404, + 1066, + 294, + 1066 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 296, + 1371, + 1031, + 1371, + 1031, + 1407, + 296, + 1407 + ], + "score": 0.925 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1762, + 1400, + 1762, + 1400, + 1792, + 1365, + 1792 + ], + "score": 0.882 + }, + { + "category_id": 0, + "poly": [ + 297, + 362, + 848, + 362, + 848, + 398, + 297, + 398 + ], + "score": 0.761 + }, + { + "category_id": 2, + "poly": [ + 841, + 2060, + 858, + 2060, + 858, + 2084, + 841, + 2084 + ], + "score": 0.736 + }, + { + "category_id": 0, + "poly": [ + 297, + 362, + 847, + 362, + 847, + 397, + 297, + 397 + ], + "score": 0.228 + }, + { + "category_id": 2, + "poly": [ + 841, + 2060, + 859, + 2060, + 859, + 2084, + 841, + 2084 + ], + "score": 0.094 + }, + { + "category_id": 14, + "poly": [ + 647, + 1729, + 1052, + 1729, + 1052, + 1824, + 647, + 1824 + ], + "score": 0.95, + "latex": "T _ { \\epsilon } ^ { \\left( \\mathrm { M I F A } \\right) } = \\widetilde { \\mathcal { O } } \\Bigl ( \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\frac { 1 } { p _ { i } } \\cdot \\frac { \\sigma ^ { 2 } } { \\mu N K \\epsilon } \\Bigr ) ." + }, + { + "category_id": 14, + "poly": [ + 644, + 1494, + 1055, + 1494, + 1055, + 1591, + 644, + 1591 + ], + "score": 0.94, + "latex": "\\bar { \\tau } _ { T } \\leq \\Big ( \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\frac { 1 } { p _ { i } } \\Big ) \\cdot \\mathcal { O } \\Big ( 1 + \\log \\frac { 1 } { \\delta } \\Big ) ." + }, + { + "category_id": 14, + "poly": [ + 613, + 1272, + 1086, + 1272, + 1086, + 1344, + 613, + 1344 + ], + "score": 0.93, + "latex": "\\tau _ { \\operatorname* { m a x } , T } \\leq \\mathcal { O } \\Big ( \\frac { 1 } { p _ { m i n } } \\cdot \\big ( \\log ( T N / \\delta ) + 1 \\big ) \\Big ) ." + }, + { + "category_id": 13, + "poly": [ + 298, + 1892, + 490, + 1892, + 490, + 1948, + 298, + 1948 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { R _ { \\epsilon } = \\widetilde { \\mathcal { O } } \\left( \\frac { \\sigma ^ { 2 } } { \\mu S K \\epsilon } \\right) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 527, + 678, + 598, + 678, + 598, + 711, + 527, + 711 + ], + "score": 0.93, + "latex": "\\tau ( t , i )" + }, + { + "category_id": 13, + "poly": [ + 298, + 1649, + 580, + 1649, + 580, + 1705, + 298, + 1705 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\stackrel { \\triangledown } { \\mathcal { O } } \\left( \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\frac { 1 } { p _ { i } } \\cdot \\frac { \\sigma ^ { 2 } } { \\mu N K T } \\right) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 652, + 1080, + 1046, + 1080, + 1046, + 1151, + 652, + 1151 + ], + "score": 0.93, + "latex": "\\tau ( t , i ) \\leq \\mathcal { O } \\Big ( \\frac { 1 } { p _ { i } } ( \\log ( N t / \\delta ) + 1 ) \\Big ) ." + }, + { + "category_id": 13, + "poly": [ + 771, + 1168, + 1069, + 1168, + 1069, + 1224, + 771, + 1224 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\mathrm { \\ddot { \\it f } } t _ { 0 } = \\Omega \\bigg ( \\frac { 1 } { p _ { m i n } } \\log \\frac { b N } { p _ { m i n } \\delta } \\bigg ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 918, + 1950, + 979, + 1950, + 979, + 1979, + 918, + 1979 + ], + "score": 0.93, + "latex": "T ( S )" + }, + { + "category_id": 13, + "poly": [ + 1142, + 1033, + 1229, + 1033, + 1229, + 1065, + 1142, + 1065 + ], + "score": 0.92, + "latex": "i \\in [ N ]" + }, + { + "category_id": 13, + "poly": [ + 1332, + 929, + 1403, + 929, + 1403, + 963, + 1332, + 963 + ], + "score": 0.92, + "latex": "\\tau ( t , i )" + }, + { + "category_id": 13, + "poly": [ + 703, + 780, + 793, + 780, + 793, + 814, + 703, + 814 + ], + "score": 0.91, + "latex": "i \\in [ N ]" + }, + { + "category_id": 13, + "poly": [ + 1153, + 1179, + 1345, + 1179, + 1345, + 1213, + 1153, + 1213 + ], + "score": 0.91, + "latex": "p _ { m i n } = \\operatorname* { m i n } \\{ p _ { i } \\}" + }, + { + "category_id": 13, + "poly": [ + 1027, + 1034, + 1091, + 1034, + 1091, + 1063, + 1027, + 1063 + ], + "score": 0.9, + "latex": "t \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 444, + 842, + 496, + 842, + 496, + 875, + 444, + 875 + ], + "score": 0.89, + "latex": "\\{ p _ { i } \\}" + }, + { + "category_id": 13, + "poly": [ + 1286, + 1416, + 1354, + 1416, + 1354, + 1445, + 1286, + 1445 + ], + "score": 0.89, + "latex": "\\delta > 0" + }, + { + "category_id": 13, + "poly": [ + 1329, + 1002, + 1397, + 1002, + 1397, + 1031, + 1329, + 1031 + ], + "score": 0.89, + "latex": "\\delta > 0" + }, + { + "category_id": 13, + "poly": [ + 1212, + 844, + 1274, + 844, + 1274, + 870, + 1212, + 870 + ], + "score": 0.88, + "latex": "t > 1" + }, + { + "category_id": 13, + "poly": [ + 531, + 1227, + 612, + 1227, + 612, + 1257, + 531, + 1257 + ], + "score": 0.88, + "latex": "\\tau _ { \\operatorname* { m a x } , T }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1447, + 371, + 1447, + 371, + 1476, + 297, + 1476 + ], + "score": 0.88, + "latex": "T > 1" + }, + { + "category_id": 13, + "poly": [ + 989, + 1377, + 1021, + 1377, + 1021, + 1404, + 989, + 1404 + ], + "score": 0.88, + "latex": "\\bar { \\tau } _ { T }" + }, + { + "category_id": 13, + "poly": [ + 653, + 1447, + 716, + 1447, + 716, + 1476, + 653, + 1476 + ], + "score": 0.88, + "latex": "1 - \\delta" + }, + { + "category_id": 13, + "poly": [ + 298, + 1219, + 477, + 1219, + 477, + 1256, + 298, + 1256 + ], + "score": 0.87, + "latex": "b = 4 0 ( L / \\mu ) ^ { 1 . 5 }" + }, + { + "category_id": 13, + "poly": [ + 781, + 1982, + 801, + 1982, + 801, + 2002, + 781, + 2002 + ], + "score": 0.86, + "latex": "\\boldsymbol { S }" + }, + { + "category_id": 13, + "poly": [ + 566, + 1033, + 629, + 1033, + 629, + 1062, + 566, + 1062 + ], + "score": 0.86, + "latex": "1 - \\delta" + }, + { + "category_id": 13, + "poly": [ + 1170, + 962, + 1195, + 962, + 1195, + 991, + 1170, + 991 + ], + "score": 0.86, + "latex": "t _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 553, + 877, + 579, + 877, + 579, + 903, + 553, + 903 + ], + "score": 0.85, + "latex": "p _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1128, + 300, + 1163, + 300, + 1163, + 325, + 1128, + 325 + ], + "score": 0.84, + "latex": "w _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1227, + 516, + 1254, + 516, + 1254, + 543, + 1227, + 543 + ], + "score": 0.84, + "latex": "p _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1321, + 785, + 1347, + 785, + 1347, + 813, + 1321, + 813 + ], + "score": 0.83, + "latex": "p _ { i }" + }, + { + "category_id": 13, + "poly": [ + 808, + 1834, + 829, + 1834, + 829, + 1860, + 808, + 1860 + ], + "score": 0.82, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 623, + 1948, + 645, + 1948, + 645, + 1973, + 623, + 1973 + ], + "score": 0.79, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 1249, + 710, + 1271, + 710, + 1271, + 736, + 1249, + 736 + ], + "score": 0.79, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 834, + 1668, + 850, + 1668, + 850, + 1688, + 834, + 1688 + ], + "score": 0.74, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 631, + 963, + 645, + 963, + 645, + 987, + 631, + 987 + ], + "score": 0.61, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 1249, + 1870, + 1267, + 1870, + 1267, + 1891, + 1249, + 1891 + ], + "score": 0.58, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1363, + 844, + 1375, + 844, + 1375, + 869, + 1363, + 869 + ], + "score": 0.56, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 448, + 1181, + 480, + 1181, + 480, + 1211, + 448, + 1211 + ], + "score": 0.39, + "latex": "( l )" + }, + { + "category_id": 13, + "poly": [ + 627, + 1182, + 647, + 1182, + 647, + 1207, + 627, + 1207 + ], + "score": 0.29, + "latex": "^ { 4 }" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 358.0, + 848.0, + 358.0, + 848.0, + 404.0, + 293.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2059.0, + 860.0, + 2059.0, + 860.0, + 2090.0, + 839.0, + 2090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 357.0, + 849.0, + 357.0, + 849.0, + 407.0, + 291.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2059.0, + 860.0, + 2059.0, + 860.0, + 2091.0, + 839.0, + 2091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 417.0, + 1406.0, + 417.0, + 1406.0, + 459.0, + 292.0, + 459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 449.0, + 1403.0, + 449.0, + 1403.0, + 486.0, + 294.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 481.0, + 1403.0, + 481.0, + 1403.0, + 515.0, + 295.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 510.0, + 1226.0, + 510.0, + 1226.0, + 547.0, + 291.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1255.0, + 510.0, + 1405.0, + 510.0, + 1405.0, + 547.0, + 1255.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 540.0, + 1406.0, + 540.0, + 1406.0, + 578.0, + 294.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 568.0, + 1406.0, + 568.0, + 1406.0, + 609.0, + 292.0, + 609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 600.0, + 433.0, + 600.0, + 433.0, + 640.0, + 294.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1831.0, + 807.0, + 1831.0, + 807.0, + 1866.0, + 295.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 1831.0, + 1406.0, + 1831.0, + 1406.0, + 1866.0, + 830.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1861.0, + 1248.0, + 1861.0, + 1248.0, + 1898.0, + 294.0, + 1898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 1861.0, + 1406.0, + 1861.0, + 1406.0, + 1898.0, + 1268.0, + 1898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1898.0, + 297.0, + 1898.0, + 297.0, + 1939.0, + 290.0, + 1939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 491.0, + 1900.0, + 1406.0, + 1900.0, + 1406.0, + 1939.0, + 491.0, + 1939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1947.0, + 622.0, + 1947.0, + 622.0, + 1978.0, + 296.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 1947.0, + 917.0, + 1947.0, + 917.0, + 1978.0, + 646.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 1947.0, + 1402.0, + 1947.0, + 1402.0, + 1978.0, + 980.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1976.0, + 780.0, + 1976.0, + 780.0, + 2007.0, + 295.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 802.0, + 1976.0, + 1401.0, + 1976.0, + 1401.0, + 2007.0, + 802.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1616.0, + 1405.0, + 1616.0, + 1405.0, + 1653.0, + 294.0, + 1653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 586.0, + 1653.0, + 833.0, + 1653.0, + 833.0, + 1697.0, + 586.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 851.0, + 1653.0, + 1406.0, + 1653.0, + 1406.0, + 1697.0, + 851.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1699.0, + 506.0, + 1699.0, + 506.0, + 1733.0, + 294.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 644.0, + 1403.0, + 644.0, + 1403.0, + 683.0, + 294.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 678.0, + 526.0, + 678.0, + 526.0, + 711.0, + 295.0, + 711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 678.0, + 1403.0, + 678.0, + 1403.0, + 711.0, + 599.0, + 711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 708.0, + 1248.0, + 708.0, + 1248.0, + 745.0, + 294.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1272.0, + 708.0, + 1406.0, + 708.0, + 1406.0, + 745.0, + 1272.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 739.0, + 1056.0, + 739.0, + 1056.0, + 774.0, + 294.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 778.0, + 702.0, + 778.0, + 702.0, + 817.0, + 292.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 794.0, + 778.0, + 1320.0, + 778.0, + 1320.0, + 817.0, + 794.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1348.0, + 778.0, + 1405.0, + 778.0, + 1405.0, + 817.0, + 1348.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 810.0, + 1404.0, + 810.0, + 1404.0, + 846.0, + 294.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 842.0, + 443.0, + 842.0, + 443.0, + 878.0, + 292.0, + 878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 842.0, + 1211.0, + 842.0, + 1211.0, + 878.0, + 497.0, + 878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 842.0, + 1362.0, + 842.0, + 1362.0, + 878.0, + 1275.0, + 878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1376.0, + 842.0, + 1406.0, + 842.0, + 1406.0, + 878.0, + 1376.0, + 878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 873.0, + 552.0, + 873.0, + 552.0, + 907.0, + 295.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 580.0, + 873.0, + 1191.0, + 873.0, + 1191.0, + 907.0, + 580.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 202.0, + 1406.0, + 202.0, + 1406.0, + 237.0, + 294.0, + 237.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 235.0, + 1403.0, + 235.0, + 1403.0, + 264.0, + 296.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 263.0, + 1407.0, + 263.0, + 1407.0, + 298.0, + 291.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 293.0, + 1127.0, + 293.0, + 1127.0, + 332.0, + 291.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1164.0, + 293.0, + 1407.0, + 293.0, + 1407.0, + 332.0, + 1164.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1173.0, + 447.0, + 1173.0, + 447.0, + 1216.0, + 290.0, + 1216.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 481.0, + 1173.0, + 626.0, + 1173.0, + 626.0, + 1216.0, + 481.0, + 1216.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 1173.0, + 770.0, + 1173.0, + 770.0, + 1216.0, + 648.0, + 1216.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 1174.0, + 1152.0, + 1174.0, + 1152.0, + 1218.0, + 1070.0, + 1218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1346.0, + 1174.0, + 1408.0, + 1174.0, + 1408.0, + 1218.0, + 1346.0, + 1218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1216.0, + 297.0, + 1216.0, + 297.0, + 1260.0, + 292.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 478.0, + 1216.0, + 530.0, + 1216.0, + 530.0, + 1260.0, + 478.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 613.0, + 1216.0, + 904.0, + 1216.0, + 904.0, + 1260.0, + 613.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 934.0, + 1175.0, + 990.0, + 1175.0, + 990.0, + 1220.0, + 934.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 927.0, + 1331.0, + 927.0, + 1331.0, + 967.0, + 294.0, + 967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 958.0, + 630.0, + 958.0, + 630.0, + 994.0, + 294.0, + 994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 958.0, + 1169.0, + 958.0, + 1169.0, + 994.0, + 646.0, + 994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1196.0, + 958.0, + 1206.0, + 958.0, + 1206.0, + 994.0, + 1196.0, + 994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1414.0, + 1285.0, + 1414.0, + 1285.0, + 1450.0, + 296.0, + 1450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1355.0, + 1414.0, + 1406.0, + 1414.0, + 1406.0, + 1450.0, + 1355.0, + 1450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1445.0, + 652.0, + 1445.0, + 652.0, + 1482.0, + 372.0, + 1482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1445.0, + 825.0, + 1445.0, + 825.0, + 1482.0, + 717.0, + 1482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1001.0, + 1328.0, + 1001.0, + 1328.0, + 1037.0, + 296.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1398.0, + 1001.0, + 1407.0, + 1001.0, + 1407.0, + 1037.0, + 1398.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1030.0, + 565.0, + 1030.0, + 565.0, + 1071.0, + 294.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1030.0, + 1026.0, + 1030.0, + 1026.0, + 1071.0, + 630.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 1030.0, + 1141.0, + 1030.0, + 1141.0, + 1071.0, + 1092.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1230.0, + 1030.0, + 1409.0, + 1030.0, + 1409.0, + 1071.0, + 1230.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1368.0, + 988.0, + 1368.0, + 988.0, + 1412.0, + 293.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1022.0, + 1368.0, + 1034.0, + 1368.0, + 1034.0, + 1412.0, + 1022.0, + 1412.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1850, + 1405, + 1850, + 1405, + 2009, + 297, + 2009 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 296, + 977, + 1405, + 977, + 1405, + 1161, + 296, + 1161 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 297, + 365, + 1405, + 365, + 1405, + 489, + 297, + 489 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 297, + 1165, + 1406, + 1165, + 1406, + 1311, + 297, + 1311 + ], + "score": 0.971 + }, + { + "category_id": 8, + "poly": [ + 459, + 1445, + 1241, + 1445, + 1241, + 1596, + 459, + 1596 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 297, + 593, + 1402, + 593, + 1402, + 656, + 297, + 656 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 454, + 290, + 1237, + 290, + 1237, + 363, + 454, + 363 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 297, + 199, + 1410, + 199, + 1410, + 285, + 297, + 285 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 402, + 1316, + 1293, + 1316, + 1293, + 1404, + 402, + 1404 + ], + "score": 0.937 + }, + { + "category_id": 8, + "poly": [ + 492, + 1757, + 1203, + 1757, + 1203, + 1831, + 492, + 1831 + ], + "score": 0.932 + }, + { + "category_id": 0, + "poly": [ + 296, + 526, + 1117, + 526, + 1117, + 566, + 296, + 566 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 298, + 1409, + 694, + 1409, + 694, + 1442, + 298, + 1442 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 296, + 816, + 1401, + 816, + 1401, + 887, + 296, + 887 + ], + "score": 0.924 + }, + { + "category_id": 1, + "poly": [ + 297, + 890, + 1399, + 890, + 1399, + 964, + 297, + 964 + ], + "score": 0.918 + }, + { + "category_id": 1, + "poly": [ + 300, + 661, + 1403, + 661, + 1403, + 727, + 300, + 727 + ], + "score": 0.893 + }, + { + "category_id": 1, + "poly": [ + 297, + 729, + 1401, + 729, + 1401, + 813, + 297, + 813 + ], + "score": 0.886 + }, + { + "category_id": 2, + "poly": [ + 840, + 2061, + 859, + 2061, + 859, + 2085, + 840, + 2085 + ], + "score": 0.815 + }, + { + "category_id": 9, + "poly": [ + 1366, + 311, + 1400, + 311, + 1400, + 341, + 1366, + 341 + ], + "score": 0.796 + }, + { + "category_id": 1, + "poly": [ + 297, + 1657, + 1403, + 1657, + 1403, + 1750, + 297, + 1750 + ], + "score": 0.783 + }, + { + "category_id": 1, + "poly": [ + 294, + 1616, + 1405, + 1616, + 1405, + 1653, + 294, + 1653 + ], + "score": 0.673 + }, + { + "category_id": 13, + "poly": [ + 1167, + 200, + 1396, + 200, + 1396, + 244, + 1167, + 244 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { T ( S ) \\geq \\frac { 1 } { \\operatorname* { m i n } \\{ p _ { i } | i \\in S \\} } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 637, + 1615, + 753, + 1615, + 753, + 1654, + 637, + 1654 + ], + "score": 0.94, + "latex": "\\mathcal { O } ( 1 / \\sqrt { T } )" + }, + { + "category_id": 13, + "poly": [ + 358, + 847, + 818, + 847, + 818, + 887, + 358, + 887 + ], + "score": 0.93, + "latex": "\\in [ N ] \\colon \\left\\| \\nabla f _ { i } ( w ) \\right\\| ^ { 2 } \\leq \\alpha \\left\\| \\nabla f ( w ) \\right\\| ^ { 2 } + \\beta _ { i }" + }, + { + "category_id": 14, + "poly": [ + 457, + 288, + 1241, + 288, + 1241, + 363, + 457, + 363 + ], + "score": 0.93, + "latex": "\\mathbb { E } \\left[ T _ { \\epsilon } ^ { ( \\mathsf { F e d A v g , S C A F F O L D } ) } \\right] \\geq \\frac { S } { N } \\frac { 1 } { p _ { m i n } } \\widetilde { \\mathcal { O } } \\Big ( \\frac { \\sigma ^ { 2 } } { \\mu S K \\epsilon } \\Big ) = \\widetilde { \\mathcal { O } } \\Big ( \\frac { 1 } { p _ { m i n } } \\cdot \\frac { \\sigma ^ { 2 } } { \\mu N K \\epsilon } \\Big ) ." + }, + { + "category_id": 13, + "poly": [ + 446, + 203, + 614, + 203, + 614, + 238, + 446, + 238 + ], + "score": 0.93, + "latex": "R _ { \\epsilon } \\cdot \\mathbb { E } _ { S } \\left[ T ( S ) \\right]" + }, + { + "category_id": 13, + "poly": [ + 1097, + 847, + 1280, + 847, + 1280, + 888, + 1097, + 888 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\beta = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\beta _ { i } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 525, + 920, + 704, + 920, + 704, + 963, + 525, + 963 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\bar { \\nu } = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\nu _ { i } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 459, + 1445, + 1237, + 1445, + 1237, + 1601, + 459, + 1601 + ], + "score": 0.92, + "latex": "\\begin{array} { l } { { A _ { 4 } = N K L \\left( \\alpha \\sigma ^ { 2 } \\hat { \\nu } + \\frac { \\sigma ^ { 2 } \\nu _ { \\mathrm { m a x } } } { \\sqrt { K N } } + \\sigma \\nu _ { \\mathrm { m a x } } \\sqrt { \\beta } \\right) + \\frac { { ( L ^ { 2 } + \\rho \\delta ) \\sigma ^ { 2 } \\nu _ { \\mathrm { m a x } } } } { L } , } } \\\\ { { A _ { 5 } = \\frac { { ( K - 1 ) N L ( \\beta + \\sigma ^ { 2 } / K ) } } { \\hat { \\nu } + 1 } . } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 943, + 426, + 996, + 426, + 996, + 458, + 943, + 458 + ], + "score": 0.92, + "latex": "1 / p _ { i }" + }, + { + "category_id": 13, + "poly": [ + 761, + 1850, + 1241, + 1850, + 1241, + 1889, + 761, + 1889 + ], + "score": 0.92, + "latex": "\\sigma \\sqrt { ( f ( w _ { 0 } ) - f ^ { * } ) } \\sim \\sigma ^ { 2 } + ( f ( w _ { 0 } ) - f ^ { * } )" + }, + { + "category_id": 13, + "poly": [ + 940, + 1197, + 1074, + 1197, + 1074, + 1231, + 940, + 1231 + ], + "score": 0.92, + "latex": "\\tau ( 1 , i ) = 0" + }, + { + "category_id": 13, + "poly": [ + 453, + 1231, + 650, + 1231, + 650, + 1284, + 453, + 1284 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\eta = \\sqrt { \\frac { N } { K T L \\left( 1 + \\bar { \\nu } \\right) } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1118, + 425, + 1203, + 425, + 1203, + 458, + 1118, + 458 + ], + "score": 0.92, + "latex": "1 / p _ { m i n }" + }, + { + "category_id": 14, + "poly": [ + 403, + 1315, + 1293, + 1315, + 1293, + 1407, + 403, + 1407 + ], + "score": 0.91, + "latex": "\\operatorname* { m i n } _ { 1 \\leq t \\leq T } \\mathbb { E } _ { \\xi } \\left[ \\left\\| \\nabla f ( w _ { t } ) \\right\\| ^ { 2 } \\right] = \\mathcal { O } \\left( \\sqrt { \\frac { ( 1 + \\bar { \\nu } ) L } { T K N } } ( f ( w _ { 1 } ) - f ^ { * } + \\sigma ^ { 2 } ) + \\frac { A _ { 4 } + A _ { 5 } } { T } \\right) ," + }, + { + "category_id": 13, + "poly": [ + 298, + 690, + 711, + 690, + 711, + 729, + 298, + 729 + ], + "score": 0.91, + "latex": "\\bigl \\| \\nabla ^ { 2 } f _ { i } \\bigl ( \\tilde { \\boldsymbol { w } } \\bigr ) - \\nabla ^ { 2 } f _ { i } ( \\boldsymbol { v } ) \\bigr \\| \\leq \\dot { \\rho } \\bigl \\| \\boldsymbol { w } - \\boldsymbol { \\tilde { v } } \\bigr \\|" + }, + { + "category_id": 13, + "poly": [ + 625, + 240, + 862, + 240, + 862, + 285, + 625, + 285 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\mathbb { E } _ { S } \\left[ T ( S ) \\right] \\ge \\frac { 1 } { p _ { m i n } } \\frac { S } { N } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 723, + 663, + 853, + 663, + 853, + 695, + 723, + 695 + ], + "score": 0.91, + "latex": "f _ { 1 } , \\cdots , f _ { N }" + }, + { + "category_id": 13, + "poly": [ + 916, + 888, + 1059, + 888, + 1059, + 923, + 916, + 923 + ], + "score": 0.91, + "latex": "\\tau ( t , i ) \\ \\leq \\ \\nu _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1109, + 817, + 1188, + 817, + 1188, + 848, + 1109, + 848 + ], + "score": 0.91, + "latex": "\\beta _ { i } > 0" + }, + { + "category_id": 13, + "poly": [ + 1159, + 890, + 1260, + 890, + 1260, + 923, + 1159, + 923 + ], + "score": 0.9, + "latex": "i \\in [ N ]" + }, + { + "category_id": 13, + "poly": [ + 537, + 1657, + 616, + 1657, + 616, + 1688, + 537, + 1688 + ], + "score": 0.9, + "latex": "c _ { 0 } > 0" + }, + { + "category_id": 13, + "poly": [ + 548, + 1199, + 618, + 1199, + 618, + 1230, + 548, + 1230 + ], + "score": 0.9, + "latex": "\\tau ( t , i )" + }, + { + "category_id": 13, + "poly": [ + 584, + 759, + 1037, + 759, + 1037, + 816, + 584, + 816 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\left\\| \\tilde { \\nabla } f _ { i } ( w ) - \\nabla f _ { i } ( w ) \\right\\| \\le \\delta a . s . , \\forall i \\in [ N ] } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 493, + 1753, + 1204, + 1753, + 1204, + 1830, + 493, + 1830 + ], + "score": 0.9, + "latex": "\\mathbb { E } [ \\| \\nabla f ( w _ { T } ) \\| ^ { 2 } ] \\ge \\mathbb { E } [ \\| \\nabla f ( w _ { T } ) \\| ] ^ { 2 } \\ge c _ { 0 } \\sqrt { \\frac { \\bar { \\nu } L \\sigma ^ { 2 } ( f ( w _ { 0 } ) - f ^ { * } ) } { N K T } } ." + }, + { + "category_id": 13, + "poly": [ + 1160, + 1197, + 1254, + 1197, + 1254, + 1229, + 1160, + 1229 + ], + "score": 0.9, + "latex": "i \\in [ N ]" + }, + { + "category_id": 13, + "poly": [ + 1060, + 1229, + 1261, + 1229, + 1261, + 1276, + 1060, + 1276 + ], + "score": 0.89, + "latex": "\\frac { 8 K N \\nu _ { \\mathrm { m a x } } ^ { 2 } ( L ^ { 2 } + \\rho \\delta ) } { L } \\biggr \\}" + }, + { + "category_id": 13, + "poly": [ + 984, + 818, + 1056, + 818, + 1056, + 846, + 984, + 846 + ], + "score": 0.89, + "latex": "\\alpha > 0" + }, + { + "category_id": 13, + "poly": [ + 756, + 929, + 988, + 929, + 988, + 963, + 756, + 963 + ], + "score": 0.89, + "latex": "\\nu _ { \\mathrm { m a x } } = \\mathrm { m a x } _ { i \\in [ N ] } \\nu _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1320, + 890, + 1397, + 890, + 1397, + 921, + 1320, + 921 + ], + "score": 0.88, + "latex": "t \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 372, + 1411, + 402, + 1411, + 402, + 1442, + 372, + 1442 + ], + "score": 0.87, + "latex": "f ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 764, + 895, + 791, + 895, + 791, + 920, + 764, + 920 + ], + "score": 0.83, + "latex": "\\nu _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1332, + 1237, + 1404, + 1237, + 1404, + 1268, + 1332, + 1268 + ], + "score": 0.82, + "latex": "T - 1" + }, + { + "category_id": 13, + "poly": [ + 847, + 1916, + 864, + 1916, + 864, + 1942, + 847, + 1942 + ], + "score": 0.81, + "latex": "\\delta" + }, + { + "category_id": 13, + "poly": [ + 622, + 1917, + 645, + 1917, + 645, + 1942, + 622, + 1942 + ], + "score": 0.81, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 952, + 667, + 970, + 667, + 970, + 695, + 952, + 695 + ], + "score": 0.8, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 995, + 1947, + 1010, + 1947, + 1010, + 1973, + 995, + 1973 + ], + "score": 0.79, + "latex": "\\delta" + }, + { + "category_id": 13, + "poly": [ + 298, + 1722, + 337, + 1722, + 337, + 1748, + 298, + 1748 + ], + "score": 0.78, + "latex": "w _ { T }" + }, + { + "category_id": 13, + "poly": [ + 346, + 850, + 432, + 850, + 432, + 886, + 346, + 886 + ], + "score": 0.77, + "latex": "i \\in [ N ]" + }, + { + "category_id": 13, + "poly": [ + 1354, + 1886, + 1371, + 1886, + 1371, + 1912, + 1354, + 1912 + ], + "score": 0.77, + "latex": "\\delta" + }, + { + "category_id": 13, + "poly": [ + 701, + 1235, + 1048, + 1235, + 1048, + 1273, + 701, + 1273 + ], + "score": 0.77, + "latex": "T \\geq \\operatorname* { m a x } \\{ 3 2 \\alpha L N K , 1 6 L N K" + }, + { + "category_id": 13, + "poly": [ + 932, + 767, + 1042, + 767, + 1042, + 803, + 932, + 803 + ], + "score": 0.7, + "latex": "\\forall i \\in [ N ]" + }, + { + "category_id": 13, + "poly": [ + 401, + 1720, + 422, + 1720, + 422, + 1745, + 401, + 1745 + ], + "score": 0.66, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 298, + 211, + 312, + 211, + 312, + 231, + 298, + 231 + ], + "score": 0.65, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1294, + 668, + 1319, + 668, + 1319, + 690, + 1294, + 690 + ], + "score": 0.61, + "latex": "w" + }, + { + "category_id": 13, + "poly": [ + 1377, + 821, + 1401, + 821, + 1401, + 844, + 1377, + 844 + ], + "score": 0.57, + "latex": "w" + }, + { + "category_id": 13, + "poly": [ + 1381, + 668, + 1397, + 668, + 1397, + 690, + 1381, + 690 + ], + "score": 0.55, + "latex": "v" + }, + { + "category_id": 13, + "poly": [ + 1383, + 1204, + 1401, + 1204, + 1401, + 1225, + 1383, + 1225 + ], + "score": 0.48, + "latex": "a" + }, + { + "category_id": 13, + "poly": [ + 886, + 1168, + 905, + 1168, + 905, + 1194, + 886, + 1194 + ], + "score": 0.39, + "latex": "^ { 5 }" + }, + { + "category_id": 13, + "poly": [ + 398, + 770, + 415, + 770, + 415, + 797, + 398, + 797 + ], + "score": 0.37, + "latex": "\\delta" + }, + { + "category_id": 13, + "poly": [ + 1384, + 735, + 1402, + 735, + 1402, + 757, + 1384, + 757 + ], + "score": 0.36, + "latex": "a" + }, + { + "category_id": 13, + "poly": [ + 772, + 1167, + 821, + 1167, + 821, + 1196, + 772, + 1196 + ], + "score": 0.28, + "latex": "I , ~ 2 , ~" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 524.0, + 1120.0, + 524.0, + 1120.0, + 576.0, + 292.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2058.0, + 861.0, + 2058.0, + 861.0, + 2089.0, + 839.0, + 2089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1850.0, + 760.0, + 1850.0, + 760.0, + 1892.0, + 292.0, + 1892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1242.0, + 1850.0, + 1407.0, + 1850.0, + 1407.0, + 1892.0, + 1242.0, + 1892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1882.0, + 1353.0, + 1882.0, + 1353.0, + 1919.0, + 294.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1372.0, + 1882.0, + 1403.0, + 1882.0, + 1403.0, + 1919.0, + 1372.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1915.0, + 621.0, + 1915.0, + 621.0, + 1948.0, + 295.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 1915.0, + 846.0, + 1915.0, + 846.0, + 1948.0, + 646.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1915.0, + 1405.0, + 1915.0, + 1405.0, + 1948.0, + 865.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1943.0, + 994.0, + 1943.0, + 994.0, + 1982.0, + 292.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1011.0, + 1943.0, + 1406.0, + 1943.0, + 1406.0, + 1982.0, + 1011.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1974.0, + 682.0, + 1974.0, + 682.0, + 2010.0, + 294.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 976.0, + 1405.0, + 976.0, + 1405.0, + 1013.0, + 293.0, + 1013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1007.0, + 1406.0, + 1007.0, + 1406.0, + 1045.0, + 291.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1039.0, + 1405.0, + 1039.0, + 1405.0, + 1074.0, + 294.0, + 1074.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1069.0, + 1405.0, + 1069.0, + 1405.0, + 1105.0, + 294.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1097.0, + 1406.0, + 1097.0, + 1406.0, + 1135.0, + 293.0, + 1135.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1127.0, + 702.0, + 1127.0, + 702.0, + 1165.0, + 293.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 365.0, + 1403.0, + 365.0, + 1403.0, + 398.0, + 296.0, + 398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 395.0, + 1403.0, + 395.0, + 1403.0, + 428.0, + 295.0, + 428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 426.0, + 942.0, + 426.0, + 942.0, + 460.0, + 292.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 426.0, + 1117.0, + 426.0, + 1117.0, + 460.0, + 997.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1204.0, + 426.0, + 1405.0, + 426.0, + 1405.0, + 460.0, + 1204.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 456.0, + 1246.0, + 456.0, + 1246.0, + 490.0, + 294.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1164.0, + 771.0, + 1164.0, + 771.0, + 1200.0, + 296.0, + 1200.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 822.0, + 1164.0, + 885.0, + 1164.0, + 885.0, + 1200.0, + 822.0, + 1200.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 1164.0, + 1404.0, + 1164.0, + 1404.0, + 1200.0, + 906.0, + 1200.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1194.0, + 547.0, + 1194.0, + 547.0, + 1235.0, + 291.0, + 1235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 619.0, + 1194.0, + 939.0, + 1194.0, + 939.0, + 1235.0, + 619.0, + 1235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1075.0, + 1194.0, + 1159.0, + 1194.0, + 1159.0, + 1235.0, + 1075.0, + 1235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1255.0, + 1194.0, + 1382.0, + 1194.0, + 1382.0, + 1235.0, + 1255.0, + 1235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1194.0, + 1407.0, + 1194.0, + 1407.0, + 1235.0, + 1402.0, + 1235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1279.0, + 731.0, + 1279.0, + 731.0, + 1311.0, + 295.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 1223.5, + 1408.0, + 1223.5, + 1408.0, + 1273.5, + 1049.0, + 1273.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.25, + 1236.0, + 534.25, + 1236.0, + 534.25, + 1277.0, + 293.25, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 522.25, + 1230.0, + 1072.25, + 1230.0, + 1072.25, + 1282.0, + 522.25, + 1282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 594.0, + 1404.0, + 594.0, + 1404.0, + 630.0, + 295.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 624.0, + 706.0, + 624.0, + 706.0, + 659.0, + 295.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 191.0, + 297.0, + 191.0, + 297.0, + 251.0, + 288.0, + 251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 191.0, + 445.0, + 191.0, + 445.0, + 251.0, + 313.0, + 251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 191.0, + 1166.0, + 191.0, + 1166.0, + 251.0, + 615.0, + 251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1397.0, + 191.0, + 1413.0, + 191.0, + 1413.0, + 251.0, + 1397.0, + 251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 242.0, + 624.0, + 242.0, + 624.0, + 283.0, + 294.0, + 283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 243.0, + 1342.0, + 243.0, + 1342.0, + 280.0, + 863.0, + 280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 758.0, + 234.5, + 882.0, + 234.5, + 882.0, + 296.0, + 758.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1408.0, + 371.0, + 1408.0, + 371.0, + 1444.0, + 296.0, + 1444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 403.0, + 1408.0, + 694.0, + 1408.0, + 694.0, + 1444.0, + 403.0, + 1444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 814.0, + 345.0, + 814.0, + 345.0, + 904.0, + 284.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 814.0, + 983.0, + 814.0, + 983.0, + 904.0, + 819.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1057.0, + 814.0, + 1096.0, + 814.0, + 1096.0, + 904.0, + 1057.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1281.0, + 814.0, + 1376.0, + 814.0, + 1376.0, + 904.0, + 1281.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 814.0, + 1405.0, + 814.0, + 1405.0, + 904.0, + 1402.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 885.0, + 763.0, + 885.0, + 763.0, + 926.0, + 293.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 792.0, + 885.0, + 915.0, + 885.0, + 915.0, + 926.0, + 792.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1060.0, + 885.0, + 1158.0, + 885.0, + 1158.0, + 926.0, + 1060.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 885.0, + 1319.0, + 885.0, + 1319.0, + 926.0, + 1261.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1398.0, + 885.0, + 1405.0, + 885.0, + 1405.0, + 926.0, + 1398.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 919.0, + 1000.0, + 919.0, + 1000.0, + 970.5, + 289.0, + 970.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 659.0, + 722.0, + 659.0, + 722.0, + 699.0, + 295.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 854.0, + 659.0, + 951.0, + 659.0, + 951.0, + 699.0, + 854.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 659.0, + 1293.0, + 659.0, + 1293.0, + 699.0, + 971.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1320.0, + 659.0, + 1380.0, + 659.0, + 1380.0, + 699.0, + 1320.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1398.0, + 659.0, + 1409.0, + 659.0, + 1409.0, + 699.0, + 1398.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 712.0, + 688.0, + 721.0, + 688.0, + 721.0, + 729.0, + 712.0, + 729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 725.0, + 1383.0, + 725.0, + 1383.0, + 769.0, + 296.0, + 769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 725.0, + 1406.0, + 725.0, + 1406.0, + 769.0, + 1403.0, + 769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 759.0, + 397.0, + 759.0, + 397.0, + 814.0, + 291.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 416.0, + 759.0, + 583.0, + 759.0, + 583.0, + 814.0, + 416.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 759.0, + 1057.0, + 759.0, + 1057.0, + 814.0, + 1043.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1655.0, + 536.0, + 1655.0, + 536.0, + 1691.0, + 294.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 617.0, + 1655.0, + 1407.0, + 1655.0, + 1407.0, + 1691.0, + 617.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1687.0, + 1405.0, + 1687.0, + 1405.0, + 1723.0, + 294.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 338.0, + 1719.0, + 400.0, + 1719.0, + 400.0, + 1753.0, + 338.0, + 1753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1719.0, + 1232.0, + 1719.0, + 1232.0, + 1753.0, + 423.0, + 1753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1612.0, + 636.0, + 1612.0, + 636.0, + 1659.0, + 293.0, + 1659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 1612.0, + 1410.0, + 1612.0, + 1410.0, + 1659.0, + 754.0, + 1659.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 674, + 1404, + 674, + 1404, + 918, + 298, + 918 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 1385, + 1405, + 1385, + 1405, + 1600, + 297, + 1600 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 445, + 1404, + 445, + 1404, + 663, + 297, + 663 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 1189, + 1404, + 1189, + 1404, + 1373, + 297, + 1373 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 931, + 1405, + 931, + 1405, + 1177, + 297, + 1177 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 1710, + 1405, + 1710, + 1405, + 1955, + 297, + 1955 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 202, + 1407, + 202, + 1407, + 343, + 297, + 343 + ], + "score": 0.971 + }, + { + "category_id": 0, + "poly": [ + 299, + 378, + 690, + 378, + 690, + 417, + 299, + 417 + ], + "score": 0.922 + }, + { + "category_id": 0, + "poly": [ + 299, + 1641, + 756, + 1641, + 756, + 1680, + 299, + 1680 + ], + "score": 0.915 + }, + { + "category_id": 2, + "poly": [ + 329, + 1978, + 1083, + 1978, + 1083, + 2008, + 329, + 2008 + ], + "score": 0.91 + }, + { + "category_id": 2, + "poly": [ + 840, + 2062, + 859, + 2062, + 859, + 2084, + 840, + 2084 + ], + "score": 0.808 + }, + { + "category_id": 13, + "poly": [ + 296, + 1053, + 705, + 1053, + 705, + 1087, + 296, + 1087 + ], + "score": 0.93, + "latex": "\\bar { p } _ { i } = \\bar { p _ { \\operatorname* { m i n } } } \\operatorname* { m i n } ( j , k ) / 9 + \\bar { ( 1 - p _ { \\operatorname* { m i n } } ) }" + }, + { + "category_id": 13, + "poly": [ + 837, + 628, + 897, + 628, + 897, + 664, + 837, + 664 + ], + "score": 0.92, + "latex": "\\{ G ^ { i } \\}" + }, + { + "category_id": 13, + "poly": [ + 297, + 1218, + 424, + 1218, + 424, + 1256, + 297, + 1256 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\eta _ { t } = \\eta _ { 0 } \\cdot \\frac { 1 } { t } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 958, + 1191, + 1060, + 1191, + 1060, + 1221, + 958, + 1221 + ], + "score": 0.91, + "latex": "\\eta _ { 0 } = 0 . 1" + }, + { + "category_id": 13, + "poly": [ + 1226, + 1115, + 1354, + 1115, + 1354, + 1147, + 1226, + 1147 + ], + "score": 0.91, + "latex": "p _ { \\mathrm { m i n } } = 0 . 1" + }, + { + "category_id": 13, + "poly": [ + 572, + 205, + 657, + 205, + 657, + 234, + 572, + 234 + ], + "score": 0.9, + "latex": "\\nu _ { i } = 0" + }, + { + "category_id": 13, + "poly": [ + 328, + 235, + 934, + 235, + 934, + 289, + 328, + 289 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\mathcal { O } \\Big ( \\sqrt { \\frac { L } { T K N } } ( f ( w _ { 1 } ) - f ^ { * } + \\sigma ^ { 2 } ) + \\frac { ( K - 1 ) N L ( \\beta + \\sigma ^ { 2 } / K ) } { T } \\Big ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1205, + 705, + 1314, + 705, + 1314, + 733, + 1205, + 733 + ], + "score": 0.9, + "latex": "N = 1 0 0" + }, + { + "category_id": 13, + "poly": [ + 790, + 1058, + 847, + 1058, + 847, + 1086, + 790, + 1086 + ], + "score": 0.89, + "latex": "p _ { \\mathrm { m i n } }" + }, + { + "category_id": 13, + "poly": [ + 1255, + 1481, + 1310, + 1481, + 1310, + 1509, + 1255, + 1509 + ], + "score": 0.88, + "latex": "p _ { \\mathrm { m i n } }" + }, + { + "category_id": 13, + "poly": [ + 297, + 290, + 540, + 290, + 540, + 346, + 297, + 346 + ], + "score": 0.86, + "latex": "\\begin{array} { r } { \\eta = 1 , \\eta _ { L } = \\sqrt { \\frac { N } { K T L } } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 678, + 996, + 705, + 996, + 705, + 1024, + 678, + 1024 + ], + "score": 0.86, + "latex": "p _ { i }" + }, + { + "category_id": 13, + "poly": [ + 915, + 1387, + 1002, + 1387, + 1002, + 1416, + 915, + 1416 + ], + "score": 0.86, + "latex": "S = 5 0" + }, + { + "category_id": 13, + "poly": [ + 721, + 857, + 749, + 857, + 749, + 888, + 721, + 888 + ], + "score": 0.86, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1159, + 1387, + 1262, + 1387, + 1262, + 1417, + 1159, + 1417 + ], + "score": 0.85, + "latex": "S = 1 0 0" + }, + { + "category_id": 13, + "poly": [ + 364, + 997, + 391, + 997, + 391, + 1024, + 364, + 1024 + ], + "score": 0.84, + "latex": "p _ { i }" + }, + { + "category_id": 13, + "poly": [ + 640, + 967, + 667, + 967, + 667, + 994, + 640, + 994 + ], + "score": 0.84, + "latex": "p _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1221, + 1025, + 1239, + 1025, + 1239, + 1056, + 1221, + 1056 + ], + "score": 0.83, + "latex": "j" + }, + { + "category_id": 13, + "poly": [ + 1293, + 1025, + 1311, + 1025, + 1311, + 1052, + 1293, + 1052 + ], + "score": 0.8, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 1001, + 1252, + 1030, + 1252, + 1030, + 1278, + 1001, + 1278 + ], + "score": 0.79, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 827, + 1026, + 840, + 1026, + 840, + 1051, + 827, + 1051 + ], + "score": 0.77, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1275, + 935, + 1289, + 935, + 1289, + 960, + 1275, + 960 + ], + "score": 0.76, + "latex": "i \\cdot" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 372.0, + 695.0, + 372.0, + 695.0, + 427.0, + 290.0, + 427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1638.0, + 759.0, + 1638.0, + 759.0, + 1686.0, + 290.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1971.0, + 1085.0, + 1971.0, + 1085.0, + 2013.0, + 329.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2060.0, + 861.0, + 2060.0, + 861.0, + 2090.0, + 839.0, + 2090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 673.0, + 1404.0, + 673.0, + 1404.0, + 709.0, + 293.0, + 709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 702.0, + 1204.0, + 702.0, + 1204.0, + 740.0, + 293.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1315.0, + 702.0, + 1406.0, + 702.0, + 1406.0, + 740.0, + 1315.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 733.0, + 1406.0, + 733.0, + 1406.0, + 772.0, + 293.0, + 772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 765.0, + 1405.0, + 765.0, + 1405.0, + 800.0, + 293.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 796.0, + 1404.0, + 796.0, + 1404.0, + 829.0, + 294.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 822.0, + 1405.0, + 822.0, + 1405.0, + 864.0, + 291.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 858.0, + 720.0, + 858.0, + 720.0, + 889.0, + 293.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 858.0, + 1405.0, + 858.0, + 1405.0, + 889.0, + 750.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 887.0, + 1326.0, + 887.0, + 1326.0, + 920.0, + 294.0, + 920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1383.0, + 914.0, + 1383.0, + 914.0, + 1424.0, + 292.0, + 1424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1003.0, + 1383.0, + 1158.0, + 1383.0, + 1158.0, + 1424.0, + 1003.0, + 1424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1263.0, + 1383.0, + 1406.0, + 1383.0, + 1406.0, + 1424.0, + 1263.0, + 1424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1415.0, + 1406.0, + 1415.0, + 1406.0, + 1454.0, + 291.0, + 1454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1448.0, + 1406.0, + 1448.0, + 1406.0, + 1483.0, + 295.0, + 1483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1477.0, + 1254.0, + 1477.0, + 1254.0, + 1515.0, + 294.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1311.0, + 1477.0, + 1410.0, + 1477.0, + 1410.0, + 1515.0, + 1311.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1507.0, + 1407.0, + 1507.0, + 1407.0, + 1545.0, + 294.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1538.0, + 1406.0, + 1538.0, + 1406.0, + 1576.0, + 294.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1568.0, + 1315.0, + 1568.0, + 1315.0, + 1604.0, + 294.0, + 1604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 445.0, + 1405.0, + 445.0, + 1405.0, + 483.0, + 292.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 478.0, + 1407.0, + 478.0, + 1407.0, + 513.0, + 294.0, + 513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 504.0, + 1405.0, + 504.0, + 1405.0, + 545.0, + 291.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 538.0, + 1405.0, + 538.0, + 1405.0, + 573.0, + 294.0, + 573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 568.0, + 1406.0, + 568.0, + 1406.0, + 602.0, + 295.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 599.0, + 1405.0, + 599.0, + 1405.0, + 633.0, + 295.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 627.0, + 836.0, + 627.0, + 836.0, + 666.0, + 294.0, + 666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 898.0, + 627.0, + 908.0, + 627.0, + 908.0, + 666.0, + 898.0, + 666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1187.0, + 957.0, + 1187.0, + 957.0, + 1225.0, + 292.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1061.0, + 1187.0, + 1405.0, + 1187.0, + 1405.0, + 1225.0, + 1061.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1214.0, + 296.0, + 1214.0, + 296.0, + 1262.0, + 291.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 1214.0, + 1409.0, + 1214.0, + 1409.0, + 1262.0, + 425.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1248.0, + 1000.0, + 1248.0, + 1000.0, + 1284.0, + 295.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1031.0, + 1248.0, + 1407.0, + 1248.0, + 1407.0, + 1284.0, + 1031.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1277.0, + 1406.0, + 1277.0, + 1406.0, + 1315.0, + 294.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1309.0, + 1404.0, + 1309.0, + 1404.0, + 1347.0, + 294.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1341.0, + 1049.0, + 1341.0, + 1049.0, + 1376.0, + 293.0, + 1376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 933.0, + 1274.0, + 933.0, + 1274.0, + 966.0, + 295.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1290.0, + 933.0, + 1405.0, + 933.0, + 1405.0, + 966.0, + 1290.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 961.0, + 639.0, + 961.0, + 639.0, + 999.0, + 292.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 668.0, + 961.0, + 1408.0, + 961.0, + 1408.0, + 999.0, + 668.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 993.0, + 363.0, + 993.0, + 363.0, + 1026.0, + 295.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 993.0, + 677.0, + 993.0, + 677.0, + 1026.0, + 392.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 706.0, + 993.0, + 1405.0, + 993.0, + 1405.0, + 1026.0, + 706.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1023.0, + 826.0, + 1023.0, + 826.0, + 1059.0, + 291.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 841.0, + 1023.0, + 1220.0, + 1023.0, + 1220.0, + 1059.0, + 841.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1240.0, + 1023.0, + 1292.0, + 1023.0, + 1292.0, + 1059.0, + 1240.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1312.0, + 1023.0, + 1408.0, + 1023.0, + 1408.0, + 1059.0, + 1312.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1054.0, + 295.0, + 1054.0, + 295.0, + 1088.0, + 291.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 706.0, + 1054.0, + 789.0, + 1054.0, + 789.0, + 1088.0, + 706.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 848.0, + 1054.0, + 1408.0, + 1054.0, + 1408.0, + 1088.0, + 848.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1082.0, + 1406.0, + 1082.0, + 1406.0, + 1119.0, + 292.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1114.0, + 1225.0, + 1114.0, + 1225.0, + 1151.0, + 294.0, + 1151.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1355.0, + 1114.0, + 1407.0, + 1114.0, + 1407.0, + 1151.0, + 1355.0, + 1151.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1144.0, + 1291.0, + 1144.0, + 1291.0, + 1179.0, + 292.0, + 1179.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1710.0, + 1405.0, + 1710.0, + 1405.0, + 1746.0, + 294.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1743.0, + 1405.0, + 1743.0, + 1405.0, + 1776.0, + 295.0, + 1776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1773.0, + 1405.0, + 1773.0, + 1405.0, + 1806.0, + 295.0, + 1806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1804.0, + 1406.0, + 1804.0, + 1406.0, + 1837.0, + 295.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1835.0, + 1403.0, + 1835.0, + 1403.0, + 1865.0, + 296.0, + 1865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1862.0, + 1410.0, + 1862.0, + 1410.0, + 1897.0, + 292.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1895.0, + 1405.0, + 1895.0, + 1405.0, + 1928.0, + 295.0, + 1928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1920.0, + 1403.0, + 1920.0, + 1403.0, + 1961.0, + 294.0, + 1961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 196.0, + 571.0, + 196.0, + 571.0, + 242.0, + 292.0, + 242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 196.0, + 1408.0, + 196.0, + 1408.0, + 242.0, + 658.0, + 242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 224.0, + 327.0, + 224.0, + 327.0, + 294.0, + 283.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 935.0, + 224.0, + 1419.0, + 224.0, + 1419.0, + 294.0, + 935.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 281.0, + 296.0, + 281.0, + 296.0, + 355.0, + 284.0, + 355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 281.0, + 560.0, + 281.0, + 560.0, + 355.0, + 541.0, + 355.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 303, + 179, + 1394, + 179, + 1394, + 699, + 303, + 699 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1082, + 1405, + 1082, + 1405, + 1236, + 298, + 1236 + ], + "score": 0.974 + }, + { + "category_id": 4, + "poly": [ + 296, + 717, + 1406, + 717, + 1406, + 841, + 296, + 841 + ], + "score": 0.963 + }, + { + "category_id": 1, + "poly": [ + 298, + 879, + 1405, + 879, + 1405, + 971, + 298, + 971 + ], + "score": 0.961 + }, + { + "category_id": 1, + "poly": [ + 308, + 1328, + 1409, + 1328, + 1409, + 2009, + 308, + 2009 + ], + "score": 0.949 + }, + { + "category_id": 0, + "poly": [ + 299, + 1013, + 944, + 1013, + 944, + 1053, + 299, + 1053 + ], + "score": 0.925 + }, + { + "category_id": 0, + "poly": [ + 298, + 1278, + 455, + 1278, + 455, + 1314, + 298, + 1314 + ], + "score": 0.904 + }, + { + "category_id": 2, + "poly": [ + 836, + 2061, + 865, + 2061, + 865, + 2085, + 836, + 2085 + ], + "score": 0.84 + }, + { + "category_id": 13, + "poly": [ + 363, + 885, + 444, + 885, + 444, + 914, + 363, + 914 + ], + "score": 0.89, + "latex": "\\tau _ { \\operatorname* { m a x } , T }" + }, + { + "category_id": 13, + "poly": [ + 942, + 749, + 1032, + 749, + 1032, + 777, + 942, + 777 + ], + "score": 0.87, + "latex": "S = 5 0" + }, + { + "category_id": 13, + "poly": [ + 1198, + 748, + 1303, + 748, + 1303, + 777, + 1198, + 777 + ], + "score": 0.86, + "latex": "S = 1 0 0" + }, + { + "category_id": 13, + "poly": [ + 776, + 780, + 799, + 780, + 799, + 806, + 776, + 806 + ], + "score": 0.75, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 391, + 399, + 511, + 399, + 511, + 427, + 391, + 427 + ], + "score": 0.37, + "latex": "p _ { \\mathrm { m i n } } = 0 . 1" + }, + { + "category_id": 13, + "poly": [ + 391, + 668, + 512, + 668, + 512, + 698, + 391, + 698 + ], + "score": 0.3, + "latex": "p _ { \\mathrm { m i n } } = 0 . 1" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 185.0, + 605.0, + 185.0, + 605.0, + 196.0, + 593.0, + 196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 185.0, + 1149.0, + 185.0, + 1149.0, + 194.0, + 1134.0, + 194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 210.0, + 339.0, + 210.0, + 339.0, + 225.0, + 320.0, + 225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 203.0, + 607.0, + 203.0, + 607.0, + 220.0, + 590.0, + 220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 210.0, + 881.0, + 210.0, + 881.0, + 226.0, + 863.0, + 226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1130.0, + 202.0, + 1151.0, + 202.0, + 1151.0, + 246.0, + 1130.0, + 246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 228.0, + 339.0, + 228.0, + 339.0, + 244.0, + 321.0, + 244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.0, + 221.0, + 608.0, + 221.0, + 608.0, + 243.0, + 589.0, + 243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 226.0, + 882.0, + 226.0, + 882.0, + 245.0, + 862.0, + 245.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 304.0, + 237.0, + 337.0, + 237.0, + 337.0, + 315.0, + 304.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 236.0, + 607.0, + 236.0, + 607.0, + 312.0, + 574.0, + 312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 849.0, + 238.0, + 881.0, + 238.0, + 881.0, + 314.0, + 849.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 236.0, + 1149.0, + 236.0, + 1149.0, + 314.0, + 1116.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.0, + 265.0, + 608.0, + 265.0, + 608.0, + 288.0, + 589.0, + 288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 259.0, + 842.0, + 259.0, + 842.0, + 280.0, + 738.0, + 280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 269.0, + 1147.0, + 269.0, + 1147.0, + 285.0, + 1133.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1281.0, + 259.0, + 1384.0, + 259.0, + 1384.0, + 280.0, + 1281.0, + 280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 276.0, + 339.0, + 276.0, + 339.0, + 291.0, + 321.0, + 291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 277.0, + 835.0, + 277.0, + 835.0, + 300.0, + 739.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 276.0, + 881.0, + 276.0, + 881.0, + 292.0, + 865.0, + 292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1283.0, + 277.0, + 1377.0, + 277.0, + 1377.0, + 300.0, + 1283.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 289.0, + 608.0, + 289.0, + 608.0, + 308.0, + 588.0, + 308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 741.0, + 297.0, + 810.0, + 297.0, + 810.0, + 318.0, + 741.0, + 318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 290.0, + 1147.0, + 290.0, + 1147.0, + 307.0, + 1133.0, + 307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1283.0, + 296.0, + 1353.0, + 296.0, + 1353.0, + 320.0, + 1283.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 311.0, + 339.0, + 311.0, + 339.0, + 324.0, + 321.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 314.0, + 607.0, + 314.0, + 607.0, + 329.0, + 590.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 314.0, + 785.0, + 314.0, + 785.0, + 338.0, + 738.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 309.0, + 881.0, + 309.0, + 881.0, + 325.0, + 863.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 309.0, + 1147.0, + 309.0, + 1147.0, + 329.0, + 1134.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1283.0, + 315.0, + 1326.0, + 315.0, + 1326.0, + 337.0, + 1283.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 336.0, + 608.0, + 336.0, + 608.0, + 351.0, + 590.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 331.0, + 833.0, + 331.0, + 833.0, + 359.0, + 739.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 335.0, + 1149.0, + 335.0, + 1149.0, + 351.0, + 1133.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1281.0, + 331.0, + 1375.0, + 331.0, + 1375.0, + 359.0, + 1281.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 358.0, + 339.0, + 358.0, + 339.0, + 372.0, + 320.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 360.0, + 604.0, + 360.0, + 604.0, + 370.0, + 593.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 358.0, + 882.0, + 358.0, + 882.0, + 372.0, + 863.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1135.0, + 360.0, + 1146.0, + 360.0, + 1146.0, + 370.0, + 1135.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 345.0, + 368.0, + 355.0, + 368.0, + 355.0, + 377.0, + 345.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 365.0, + 385.0, + 365.0, + 385.0, + 380.0, + 368.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 368.0, + 409.0, + 368.0, + 409.0, + 378.0, + 397.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 366.0, + 439.0, + 366.0, + 439.0, + 380.0, + 423.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 445.0, + 364.0, + 496.0, + 364.0, + 496.0, + 381.0, + 445.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 501.0, + 366.0, + 522.0, + 366.0, + 522.0, + 380.0, + 501.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 526.0, + 364.0, + 552.0, + 364.0, + 552.0, + 381.0, + 526.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 364.0, + 578.0, + 364.0, + 578.0, + 381.0, + 553.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 370.0, + 620.0, + 370.0, + 620.0, + 376.0, + 614.0, + 376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 368.0, + 650.0, + 368.0, + 650.0, + 378.0, + 638.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 665.0, + 366.0, + 681.0, + 366.0, + 681.0, + 380.0, + 665.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 693.0, + 368.0, + 706.0, + 368.0, + 706.0, + 378.0, + 693.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 365.0, + 738.0, + 365.0, + 738.0, + 380.0, + 717.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 364.0, + 768.0, + 364.0, + 768.0, + 381.0, + 743.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 366.0, + 791.0, + 366.0, + 791.0, + 380.0, + 770.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 800.0, + 365.0, + 821.0, + 365.0, + 821.0, + 380.0, + 800.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 826.0, + 365.0, + 847.0, + 365.0, + 847.0, + 380.0, + 826.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 887.0, + 368.0, + 897.0, + 368.0, + 897.0, + 378.0, + 887.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 365.0, + 927.0, + 365.0, + 927.0, + 380.0, + 909.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 938.0, + 366.0, + 955.0, + 366.0, + 955.0, + 380.0, + 938.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 968.0, + 368.0, + 980.0, + 368.0, + 980.0, + 378.0, + 968.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 366.0, + 1011.0, + 366.0, + 1011.0, + 380.0, + 990.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1016.0, + 366.0, + 1038.0, + 366.0, + 1038.0, + 380.0, + 1016.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 366.0, + 1063.0, + 366.0, + 1063.0, + 380.0, + 1043.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 365.0, + 1093.0, + 365.0, + 1093.0, + 380.0, + 1072.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 365.0, + 1119.0, + 365.0, + 1119.0, + 380.0, + 1098.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1181.0, + 368.0, + 1192.0, + 368.0, + 1192.0, + 378.0, + 1181.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 365.0, + 1223.0, + 365.0, + 1223.0, + 380.0, + 1206.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1236.0, + 368.0, + 1248.0, + 368.0, + 1248.0, + 378.0, + 1236.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1259.0, + 364.0, + 1284.0, + 364.0, + 1284.0, + 381.0, + 1259.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1286.0, + 365.0, + 1308.0, + 365.0, + 1308.0, + 380.0, + 1286.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1311.0, + 364.0, + 1336.0, + 364.0, + 1336.0, + 381.0, + 1311.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1340.0, + 364.0, + 1365.0, + 364.0, + 1365.0, + 381.0, + 1340.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1366.0, + 364.0, + 1391.0, + 364.0, + 1391.0, + 381.0, + 1366.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 376.0, + 520.0, + 376.0, + 520.0, + 392.0, + 396.0, + 392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 375.0, + 791.0, + 375.0, + 791.0, + 394.0, + 664.0, + 394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 937.0, + 375.0, + 1064.0, + 375.0, + 1064.0, + 394.0, + 937.0, + 394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 375.0, + 1334.0, + 375.0, + 1334.0, + 394.0, + 1206.0, + 394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 397.0, + 390.0, + 397.0, + 390.0, + 427.0, + 352.0, + 427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 619.0, + 394.0, + 784.0, + 394.0, + 784.0, + 429.0, + 619.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 397.0, + 1059.0, + 397.0, + 1059.0, + 428.0, + 893.0, + 428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1173.0, + 394.0, + 1341.0, + 394.0, + 1341.0, + 429.0, + 1173.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1021.0, + 463.0, + 1112.0, + 463.0, + 1112.0, + 484.0, + 1021.0, + 484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 564.0, + 466.0, + 618.0, + 466.0, + 618.0, + 629.0, + 564.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 466.0, + 607.0, + 466.0, + 607.0, + 481.0, + 590.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 467.0, + 1149.0, + 467.0, + 1149.0, + 483.0, + 1134.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 477.0, + 339.0, + 477.0, + 339.0, + 491.0, + 321.0, + 491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 475.0, + 880.0, + 475.0, + 880.0, + 490.0, + 863.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1021.0, + 479.0, + 1109.0, + 479.0, + 1109.0, + 502.0, + 1021.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 474.0, + 1154.0, + 474.0, + 1154.0, + 575.0, + 1129.0, + 575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 500.0, + 349.0, + 500.0, + 349.0, + 594.0, + 296.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 497.0, + 891.0, + 497.0, + 891.0, + 595.0, + 840.0, + 595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1021.0, + 496.0, + 1087.0, + 496.0, + 1087.0, + 535.0, + 1021.0, + 535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 509.0, + 1140.0, + 509.0, + 1140.0, + 582.0, + 1115.0, + 582.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1023.0, + 528.0, + 1107.0, + 528.0, + 1107.0, + 554.0, + 1023.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 564.0, + 337.0, + 564.0, + 337.0, + 609.0, + 321.0, + 609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 563.0, + 880.0, + 563.0, + 880.0, + 609.0, + 862.0, + 609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 564.0, + 1152.0, + 564.0, + 1152.0, + 621.0, + 1131.0, + 621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 621.0, + 607.0, + 621.0, + 607.0, + 632.0, + 597.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1139.0, + 621.0, + 1149.0, + 621.0, + 1149.0, + 633.0, + 1139.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 629.0, + 337.0, + 629.0, + 337.0, + 642.0, + 321.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 345.0, + 638.0, + 355.0, + 638.0, + 355.0, + 648.0, + 345.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 378.0, + 635.0, + 394.0, + 635.0, + 394.0, + 650.0, + 378.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 412.0, + 636.0, + 432.0, + 636.0, + 432.0, + 650.0, + 412.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 636.0, + 469.0, + 636.0, + 469.0, + 650.0, + 448.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 484.0, + 636.0, + 504.0, + 636.0, + 504.0, + 650.0, + 484.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 520.0, + 636.0, + 541.0, + 636.0, + 541.0, + 650.0, + 520.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 634.0, + 578.0, + 634.0, + 578.0, + 651.0, + 553.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 635.0, + 662.0, + 635.0, + 662.0, + 650.0, + 646.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 635.0, + 702.0, + 635.0, + 702.0, + 650.0, + 681.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 634.0, + 741.0, + 634.0, + 741.0, + 651.0, + 716.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 753.0, + 635.0, + 774.0, + 635.0, + 774.0, + 650.0, + 753.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 635.0, + 811.0, + 635.0, + 811.0, + 650.0, + 790.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 635.0, + 849.0, + 635.0, + 849.0, + 650.0, + 827.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 628.0, + 882.0, + 628.0, + 882.0, + 642.0, + 862.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 636.0, + 897.0, + 636.0, + 897.0, + 648.0, + 886.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 635.0, + 937.0, + 635.0, + 937.0, + 650.0, + 919.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 635.0, + 975.0, + 635.0, + 975.0, + 650.0, + 954.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 635.0, + 1011.0, + 635.0, + 1011.0, + 650.0, + 990.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1026.0, + 636.0, + 1046.0, + 636.0, + 1046.0, + 650.0, + 1026.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 635.0, + 1082.0, + 635.0, + 1082.0, + 650.0, + 1063.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1097.0, + 634.0, + 1121.0, + 634.0, + 1121.0, + 651.0, + 1097.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 639.0, + 1165.0, + 639.0, + 1165.0, + 648.0, + 1156.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1188.0, + 635.0, + 1206.0, + 635.0, + 1206.0, + 650.0, + 1188.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 635.0, + 1244.0, + 635.0, + 1244.0, + 650.0, + 1223.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1260.0, + 635.0, + 1281.0, + 635.0, + 1281.0, + 650.0, + 1260.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1296.0, + 635.0, + 1317.0, + 635.0, + 1317.0, + 650.0, + 1296.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1332.0, + 635.0, + 1353.0, + 635.0, + 1353.0, + 650.0, + 1332.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1370.0, + 635.0, + 1389.0, + 635.0, + 1389.0, + 650.0, + 1370.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 645.0, + 521.0, + 645.0, + 521.0, + 664.0, + 396.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 645.0, + 793.0, + 645.0, + 793.0, + 664.0, + 664.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 937.0, + 645.0, + 1063.0, + 645.0, + 1063.0, + 664.0, + 937.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 645.0, + 1334.0, + 645.0, + 1334.0, + 664.0, + 1206.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 667.0, + 390.0, + 667.0, + 390.0, + 698.0, + 349.0, + 698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 621.0, + 664.0, + 781.0, + 664.0, + 781.0, + 699.0, + 621.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 667.0, + 1059.0, + 667.0, + 1059.0, + 698.0, + 893.0, + 698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1173.0, + 664.0, + 1341.0, + 664.0, + 1341.0, + 699.0, + 1173.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 718.0, + 1408.0, + 718.0, + 1408.0, + 751.0, + 295.0, + 751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 749.0, + 941.0, + 749.0, + 941.0, + 781.0, + 295.0, + 781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 749.0, + 1197.0, + 749.0, + 1197.0, + 781.0, + 1033.0, + 781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1304.0, + 749.0, + 1404.0, + 749.0, + 1404.0, + 781.0, + 1304.0, + 781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 777.0, + 775.0, + 777.0, + 775.0, + 814.0, + 293.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 800.0, + 777.0, + 1406.0, + 777.0, + 1406.0, + 814.0, + 800.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 808.0, + 1361.0, + 808.0, + 1361.0, + 844.0, + 293.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1009.0, + 949.0, + 1009.0, + 949.0, + 1063.0, + 293.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1276.0, + 460.0, + 1276.0, + 460.0, + 1319.0, + 295.0, + 1319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2057.0, + 871.0, + 2057.0, + 871.0, + 2096.0, + 832.0, + 2096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1080.0, + 1405.0, + 1080.0, + 1405.0, + 1118.0, + 293.0, + 1118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1114.0, + 1403.0, + 1114.0, + 1403.0, + 1147.0, + 296.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1142.0, + 1405.0, + 1142.0, + 1405.0, + 1179.0, + 295.0, + 1179.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1172.0, + 1405.0, + 1172.0, + 1405.0, + 1209.0, + 293.0, + 1209.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1205.0, + 570.0, + 1205.0, + 570.0, + 1242.0, + 295.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 877.0, + 362.0, + 877.0, + 362.0, + 917.0, + 292.0, + 917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 445.0, + 877.0, + 1406.0, + 877.0, + 1406.0, + 917.0, + 445.0, + 917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 912.0, + 1405.0, + 912.0, + 1405.0, + 945.0, + 295.0, + 945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 939.0, + 714.0, + 939.0, + 714.0, + 974.0, + 295.0, + 974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1332.0, + 1404.0, + 1332.0, + 1404.0, + 1366.0, + 309.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1361.0, + 1330.0, + 1361.0, + 1330.0, + 1399.0, + 353.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1415.0, + 1406.0, + 1415.0, + 1406.0, + 1449.0, + 309.0, + 1449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1443.0, + 1405.0, + 1443.0, + 1405.0, + 1479.0, + 353.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 1476.0, + 886.0, + 1476.0, + 886.0, + 1510.0, + 356.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1525.0, + 1405.0, + 1525.0, + 1405.0, + 1562.0, + 308.0, + 1562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 1557.0, + 1183.0, + 1557.0, + 1183.0, + 1592.0, + 356.0, + 1592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1610.0, + 1403.0, + 1610.0, + 1403.0, + 1644.0, + 309.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 1638.0, + 1409.0, + 1638.0, + 1409.0, + 1675.0, + 352.0, + 1675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1668.0, + 427.0, + 1668.0, + 427.0, + 1701.0, + 353.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1720.0, + 1408.0, + 1720.0, + 1408.0, + 1756.0, + 307.0, + 1756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1753.0, + 1405.0, + 1753.0, + 1405.0, + 1787.0, + 354.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1783.0, + 641.0, + 1783.0, + 641.0, + 1812.0, + 354.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1832.0, + 1406.0, + 1832.0, + 1406.0, + 1870.0, + 308.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1864.0, + 1408.0, + 1864.0, + 1408.0, + 1902.0, + 353.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1894.0, + 427.0, + 1894.0, + 427.0, + 1927.0, + 354.0, + 1927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1947.0, + 1405.0, + 1947.0, + 1405.0, + 1981.0, + 309.0, + 1981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1976.0, + 1405.0, + 1976.0, + 1405.0, + 2010.0, + 354.0, + 2010.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 835, + 2061, + 863, + 2061, + 863, + 2086, + 835, + 2086 + ], + "score": 0.742 + }, + { + "category_id": 1, + "poly": [ + 298, + 1112, + 1401, + 1112, + 1401, + 1207, + 298, + 1207 + ], + "score": 0.583 + }, + { + "category_id": 1, + "poly": [ + 297, + 1224, + 1408, + 1224, + 1408, + 1348, + 297, + 1348 + ], + "score": 0.573 + }, + { + "category_id": 1, + "poly": [ + 352, + 202, + 1404, + 202, + 1404, + 297, + 352, + 297 + ], + "score": 0.549 + }, + { + "category_id": 1, + "poly": [ + 293, + 1588, + 1398, + 1588, + 1398, + 1654, + 293, + 1654 + ], + "score": 0.515 + }, + { + "category_id": 1, + "poly": [ + 293, + 1365, + 1399, + 1365, + 1399, + 1462, + 293, + 1462 + ], + "score": 0.509 + }, + { + "category_id": 1, + "poly": [ + 292, + 1031, + 1401, + 1031, + 1401, + 1096, + 292, + 1096 + ], + "score": 0.496 + }, + { + "category_id": 1, + "poly": [ + 294, + 1477, + 1400, + 1477, + 1400, + 1572, + 294, + 1572 + ], + "score": 0.495 + }, + { + "category_id": 1, + "poly": [ + 293, + 809, + 1403, + 809, + 1403, + 874, + 293, + 874 + ], + "score": 0.493 + }, + { + "category_id": 1, + "poly": [ + 295, + 1670, + 1402, + 1670, + 1402, + 1764, + 295, + 1764 + ], + "score": 0.488 + }, + { + "category_id": 1, + "poly": [ + 297, + 698, + 1400, + 698, + 1400, + 793, + 297, + 793 + ], + "score": 0.488 + }, + { + "category_id": 1, + "poly": [ + 308, + 312, + 1402, + 312, + 1402, + 378, + 308, + 378 + ], + "score": 0.478 + }, + { + "category_id": 1, + "poly": [ + 298, + 475, + 1405, + 475, + 1405, + 570, + 298, + 570 + ], + "score": 0.454 + }, + { + "category_id": 1, + "poly": [ + 297, + 1782, + 1402, + 1782, + 1402, + 1847, + 297, + 1847 + ], + "score": 0.454 + }, + { + "category_id": 1, + "poly": [ + 308, + 393, + 1400, + 393, + 1400, + 459, + 308, + 459 + ], + "score": 0.453 + }, + { + "category_id": 1, + "poly": [ + 296, + 587, + 1403, + 587, + 1403, + 681, + 296, + 681 + ], + "score": 0.45 + }, + { + "category_id": 1, + "poly": [ + 295, + 891, + 1407, + 891, + 1407, + 1016, + 295, + 1016 + ], + "score": 0.444 + }, + { + "category_id": 1, + "poly": [ + 294, + 1944, + 1404, + 1944, + 1404, + 2008, + 294, + 2008 + ], + "score": 0.443 + }, + { + "category_id": 1, + "poly": [ + 297, + 1863, + 1400, + 1863, + 1400, + 1928, + 297, + 1928 + ], + "score": 0.411 + }, + { + "category_id": 2, + "poly": [ + 835, + 2061, + 863, + 2061, + 863, + 2086, + 835, + 2086 + ], + "score": 0.288 + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2058.0, + 868.0, + 2058.0, + 868.0, + 2098.0, + 832.0, + 2098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2058.0, + 868.0, + 2058.0, + 868.0, + 2098.0, + 832.0, + 2098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1111.0, + 1407.0, + 1111.0, + 1407.0, + 1152.0, + 293.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 1144.0, + 1407.0, + 1144.0, + 1407.0, + 1180.0, + 352.0, + 1180.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 1171.0, + 518.0, + 1171.0, + 518.0, + 1210.0, + 352.0, + 1210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1225.0, + 1409.0, + 1225.0, + 1409.0, + 1260.0, + 292.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 1254.0, + 1410.0, + 1254.0, + 1410.0, + 1294.0, + 349.0, + 1294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 1286.0, + 1409.0, + 1286.0, + 1409.0, + 1322.0, + 352.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 1315.0, + 427.0, + 1315.0, + 427.0, + 1348.0, + 352.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 203.0, + 1405.0, + 203.0, + 1405.0, + 237.0, + 356.0, + 237.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 232.0, + 1410.0, + 232.0, + 1410.0, + 268.0, + 354.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 265.0, + 1167.0, + 265.0, + 1167.0, + 297.0, + 355.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1589.0, + 1404.0, + 1589.0, + 1404.0, + 1625.0, + 297.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1621.0, + 1212.0, + 1621.0, + 1212.0, + 1655.0, + 355.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1366.0, + 1406.0, + 1366.0, + 1406.0, + 1401.0, + 293.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1399.0, + 1405.0, + 1399.0, + 1405.0, + 1433.0, + 355.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 1428.0, + 1261.0, + 1428.0, + 1261.0, + 1463.0, + 356.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1033.0, + 1404.0, + 1033.0, + 1404.0, + 1069.0, + 296.0, + 1069.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1061.0, + 1377.0, + 1061.0, + 1377.0, + 1097.0, + 354.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1477.0, + 1405.0, + 1477.0, + 1405.0, + 1515.0, + 294.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1510.0, + 1405.0, + 1510.0, + 1405.0, + 1544.0, + 355.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 1539.0, + 834.0, + 1539.0, + 834.0, + 1573.0, + 356.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 808.0, + 1405.0, + 808.0, + 1405.0, + 847.0, + 293.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 840.0, + 895.0, + 840.0, + 895.0, + 876.0, + 355.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1667.0, + 1407.0, + 1667.0, + 1407.0, + 1709.0, + 294.0, + 1709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1701.0, + 1409.0, + 1701.0, + 1409.0, + 1735.0, + 353.0, + 1735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1730.0, + 427.0, + 1730.0, + 427.0, + 1764.0, + 353.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 698.0, + 1405.0, + 698.0, + 1405.0, + 736.0, + 295.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 731.0, + 1405.0, + 731.0, + 1405.0, + 765.0, + 355.0, + 765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 760.0, + 826.0, + 760.0, + 826.0, + 794.0, + 356.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 311.0, + 1405.0, + 311.0, + 1405.0, + 350.0, + 309.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 344.0, + 1059.0, + 344.0, + 1059.0, + 377.0, + 355.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 474.0, + 1408.0, + 474.0, + 1408.0, + 510.0, + 293.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 507.0, + 1406.0, + 507.0, + 1406.0, + 544.0, + 354.0, + 544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 538.0, + 652.0, + 538.0, + 652.0, + 569.0, + 356.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1777.0, + 1407.0, + 1777.0, + 1407.0, + 1821.0, + 293.0, + 1821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 1808.0, + 429.0, + 1808.0, + 429.0, + 1847.0, + 350.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 395.0, + 1405.0, + 395.0, + 1405.0, + 429.0, + 309.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 426.0, + 1271.0, + 426.0, + 1271.0, + 461.0, + 352.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 587.0, + 1408.0, + 587.0, + 1408.0, + 622.0, + 294.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 618.0, + 1405.0, + 618.0, + 1405.0, + 652.0, + 354.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 650.0, + 741.0, + 650.0, + 741.0, + 680.0, + 358.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 890.0, + 1406.0, + 890.0, + 1406.0, + 925.0, + 294.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 922.0, + 1408.0, + 922.0, + 1408.0, + 958.0, + 352.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 952.0, + 1408.0, + 952.0, + 1408.0, + 987.0, + 354.0, + 987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 982.0, + 1341.0, + 982.0, + 1341.0, + 1017.0, + 352.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1940.0, + 1407.0, + 1940.0, + 1407.0, + 1982.0, + 294.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1975.0, + 718.0, + 1975.0, + 718.0, + 2008.0, + 354.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1859.0, + 1405.0, + 1859.0, + 1405.0, + 1903.0, + 295.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1894.0, + 1310.0, + 1894.0, + 1310.0, + 1929.0, + 353.0, + 1929.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 836, + 2061, + 865, + 2061, + 865, + 2086, + 836, + 2086 + ], + "score": 0.83 + }, + { + "category_id": 1, + "poly": [ + 293, + 100, + 1410, + 100, + 1410, + 2029, + 293, + 2029 + ], + "score": 0.65 + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2058.0, + 870.0, + 2058.0, + 870.0, + 2097.0, + 832.0, + 2097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 202.0, + 1407.0, + 202.0, + 1407.0, + 242.0, + 294.0, + 242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 232.0, + 1407.0, + 232.0, + 1407.0, + 272.0, + 353.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 263.0, + 1409.0, + 263.0, + 1409.0, + 304.0, + 353.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 316.0, + 1405.0, + 316.0, + 1405.0, + 350.0, + 298.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 344.0, + 1373.0, + 344.0, + 1373.0, + 384.0, + 353.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 395.0, + 1407.0, + 395.0, + 1407.0, + 435.0, + 294.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 424.0, + 1409.0, + 424.0, + 1409.0, + 464.0, + 353.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 454.0, + 1409.0, + 454.0, + 1409.0, + 496.0, + 351.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 483.0, + 488.0, + 483.0, + 488.0, + 523.0, + 351.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 536.0, + 1409.0, + 536.0, + 1409.0, + 576.0, + 294.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 566.0, + 1407.0, + 566.0, + 1407.0, + 606.0, + 353.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 597.0, + 1025.0, + 597.0, + 1025.0, + 638.0, + 353.0, + 638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 648.0, + 1403.0, + 648.0, + 1403.0, + 682.0, + 296.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 678.0, + 729.0, + 678.0, + 729.0, + 716.0, + 351.0, + 716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 726.0, + 1407.0, + 726.0, + 1407.0, + 769.0, + 292.0, + 769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 758.0, + 1407.0, + 758.0, + 1407.0, + 800.0, + 349.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 788.0, + 944.0, + 788.0, + 944.0, + 830.0, + 351.0, + 830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 840.0, + 1407.0, + 840.0, + 1407.0, + 881.0, + 294.0, + 881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 870.0, + 1405.0, + 870.0, + 1405.0, + 910.0, + 353.0, + 910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 902.0, + 1211.0, + 902.0, + 1211.0, + 938.0, + 351.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 950.0, + 1407.0, + 950.0, + 1407.0, + 991.0, + 294.0, + 991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 982.0, + 1405.0, + 982.0, + 1405.0, + 1022.0, + 353.0, + 1022.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1014.0, + 839.0, + 1014.0, + 839.0, + 1054.0, + 351.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1064.0, + 1405.0, + 1064.0, + 1405.0, + 1098.0, + 298.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1096.0, + 1403.0, + 1096.0, + 1403.0, + 1130.0, + 353.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1126.0, + 987.0, + 1126.0, + 987.0, + 1160.0, + 353.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1174.0, + 1407.0, + 1174.0, + 1407.0, + 1215.0, + 294.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1204.0, + 919.0, + 1204.0, + 919.0, + 1244.0, + 353.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1255.0, + 1407.0, + 1255.0, + 1407.0, + 1295.0, + 294.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1289.0, + 1407.0, + 1289.0, + 1407.0, + 1322.0, + 355.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1318.0, + 532.0, + 1318.0, + 532.0, + 1352.0, + 355.0, + 1352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1365.0, + 1409.0, + 1365.0, + 1409.0, + 1403.0, + 292.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1401.0, + 1221.0, + 1401.0, + 1221.0, + 1434.0, + 353.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1447.0, + 1407.0, + 1447.0, + 1407.0, + 1487.0, + 294.0, + 1487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1477.0, + 972.0, + 1477.0, + 972.0, + 1517.0, + 353.0, + 1517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1532.0, + 1405.0, + 1532.0, + 1405.0, + 1565.0, + 298.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1557.0, + 1407.0, + 1557.0, + 1407.0, + 1599.0, + 351.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 1591.0, + 542.0, + 1591.0, + 542.0, + 1626.0, + 348.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1641.0, + 1403.0, + 1641.0, + 1403.0, + 1675.0, + 296.0, + 1675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1671.0, + 1407.0, + 1671.0, + 1407.0, + 1711.0, + 351.0, + 1711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1701.0, + 699.0, + 1701.0, + 699.0, + 1741.0, + 351.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1751.0, + 1407.0, + 1751.0, + 1407.0, + 1792.0, + 294.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 1783.0, + 743.0, + 1783.0, + 743.0, + 1821.0, + 348.0, + 1821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1825.0, + 1411.0, + 1825.0, + 1411.0, + 1876.0, + 292.0, + 1876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1861.0, + 1409.0, + 1861.0, + 1409.0, + 1904.0, + 351.0, + 1904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1893.0, + 1016.0, + 1893.0, + 1016.0, + 1933.0, + 353.0, + 1933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1944.0, + 1407.0, + 1944.0, + 1407.0, + 1984.0, + 294.0, + 1984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1975.0, + 1289.0, + 1975.0, + 1289.0, + 2013.0, + 351.0, + 2013.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 407, + 1471, + 1405, + 1471, + 1405, + 1758, + 407, + 1758 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 407, + 1109, + 1404, + 1109, + 1404, + 1422, + 407, + 1422 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 408, + 1808, + 1404, + 1808, + 1404, + 2000, + 408, + 2000 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 406, + 630, + 1404, + 630, + 1404, + 887, + 406, + 887 + ], + "score": 0.959 + }, + { + "category_id": 1, + "poly": [ + 407, + 933, + 1404, + 933, + 1404, + 1060, + 407, + 1060 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 364, + 1068, + 671, + 1068, + 671, + 1099, + 364, + 1099 + ], + "score": 0.913 + }, + { + "category_id": 1, + "poly": [ + 366, + 894, + 840, + 894, + 840, + 926, + 366, + 926 + ], + "score": 0.912 + }, + { + "category_id": 0, + "poly": [ + 298, + 535, + 435, + 535, + 435, + 571, + 298, + 571 + ], + "score": 0.903 + }, + { + "category_id": 1, + "poly": [ + 365, + 592, + 580, + 592, + 580, + 622, + 365, + 622 + ], + "score": 0.896 + }, + { + "category_id": 2, + "poly": [ + 836, + 2061, + 864, + 2061, + 864, + 2085, + 836, + 2085 + ], + "score": 0.84 + }, + { + "category_id": 1, + "poly": [ + 369, + 1431, + 1402, + 1431, + 1402, + 1463, + 369, + 1463 + ], + "score": 0.835 + }, + { + "category_id": 1, + "poly": [ + 366, + 1767, + 1200, + 1767, + 1200, + 1799, + 366, + 1799 + ], + "score": 0.814 + }, + { + "category_id": 1, + "poly": [ + 295, + 202, + 1407, + 202, + 1407, + 487, + 295, + 487 + ], + "score": 0.549 + }, + { + "category_id": 15, + "poly": [ + 296.0, + 533.0, + 440.0, + 533.0, + 440.0, + 574.0, + 296.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2058.0, + 869.0, + 2058.0, + 869.0, + 2096.0, + 832.0, + 2096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1471.0, + 1343.0, + 1471.0, + 1343.0, + 1506.0, + 404.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 403.0, + 1505.0, + 1158.0, + 1505.0, + 1158.0, + 1539.0, + 403.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1538.0, + 1405.0, + 1538.0, + 1405.0, + 1575.0, + 404.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1567.0, + 1376.0, + 1567.0, + 1376.0, + 1605.0, + 449.0, + 1605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 407.0, + 1605.0, + 1404.0, + 1605.0, + 1404.0, + 1635.0, + 407.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1634.0, + 1409.0, + 1634.0, + 1409.0, + 1668.0, + 450.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 407.0, + 1666.0, + 1406.0, + 1666.0, + 1406.0, + 1702.0, + 407.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1697.0, + 1405.0, + 1697.0, + 1405.0, + 1730.0, + 450.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 1728.0, + 675.0, + 1728.0, + 675.0, + 1759.0, + 451.0, + 1759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 405.0, + 1107.0, + 1408.0, + 1107.0, + 1408.0, + 1141.0, + 405.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1136.0, + 1405.0, + 1136.0, + 1405.0, + 1172.0, + 448.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 1168.0, + 1403.0, + 1168.0, + 1403.0, + 1201.0, + 451.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1199.0, + 1356.0, + 1199.0, + 1356.0, + 1231.0, + 450.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 1235.0, + 445.0, + 1235.0, + 445.0, + 1265.0, + 406.0, + 1265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 447.0, + 1230.0, + 1404.0, + 1230.0, + 1404.0, + 1270.0, + 447.0, + 1270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1263.0, + 850.0, + 1263.0, + 850.0, + 1296.0, + 450.0, + 1296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 407.0, + 1300.0, + 445.0, + 1300.0, + 445.0, + 1330.0, + 407.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1296.0, + 1407.0, + 1296.0, + 1407.0, + 1332.0, + 448.0, + 1332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1325.0, + 947.0, + 1325.0, + 947.0, + 1361.0, + 448.0, + 1361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 1358.0, + 1404.0, + 1358.0, + 1404.0, + 1397.0, + 406.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 1392.0, + 1192.0, + 1392.0, + 1192.0, + 1425.0, + 451.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1806.0, + 1408.0, + 1806.0, + 1408.0, + 1842.0, + 404.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1836.0, + 660.0, + 1836.0, + 660.0, + 1873.0, + 449.0, + 1873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 405.0, + 1871.0, + 1404.0, + 1871.0, + 1404.0, + 1906.0, + 405.0, + 1906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1899.0, + 952.0, + 1899.0, + 952.0, + 1937.0, + 448.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 1938.0, + 447.0, + 1938.0, + 447.0, + 1968.0, + 408.0, + 1968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1935.0, + 1404.0, + 1935.0, + 1404.0, + 1970.0, + 448.0, + 1970.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1968.0, + 925.0, + 1968.0, + 925.0, + 2002.0, + 449.0, + 2002.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 629.0, + 1405.0, + 629.0, + 1405.0, + 666.0, + 404.0, + 666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 661.0, + 802.0, + 661.0, + 802.0, + 696.0, + 450.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 694.0, + 1212.0, + 694.0, + 1212.0, + 732.0, + 402.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 728.0, + 1407.0, + 728.0, + 1407.0, + 766.0, + 404.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 762.0, + 1406.0, + 762.0, + 1406.0, + 793.0, + 450.0, + 793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 789.0, + 975.0, + 789.0, + 975.0, + 824.0, + 450.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 821.0, + 1404.0, + 821.0, + 1404.0, + 860.0, + 402.0, + 860.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 850.0, + 597.0, + 850.0, + 597.0, + 890.0, + 448.0, + 890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 929.0, + 1406.0, + 929.0, + 1406.0, + 972.0, + 404.0, + 972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 963.0, + 1049.0, + 963.0, + 1049.0, + 997.0, + 451.0, + 997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 405.0, + 998.0, + 1403.0, + 998.0, + 1403.0, + 1032.0, + 405.0, + 1032.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1027.0, + 734.0, + 1027.0, + 734.0, + 1064.0, + 450.0, + 1064.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 1062.0, + 675.0, + 1062.0, + 675.0, + 1106.0, + 357.0, + 1106.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 360.0, + 891.0, + 845.0, + 891.0, + 845.0, + 931.0, + 360.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 587.0, + 586.0, + 587.0, + 586.0, + 626.0, + 361.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 1426.0, + 1410.0, + 1426.0, + 1410.0, + 1469.0, + 361.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 1761.0, + 1205.0, + 1761.0, + 1205.0, + 1807.0, + 357.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 203.0, + 1406.0, + 203.0, + 1406.0, + 240.0, + 296.0, + 240.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 235.0, + 1404.0, + 235.0, + 1404.0, + 269.0, + 354.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 263.0, + 941.0, + 263.0, + 941.0, + 299.0, + 352.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 314.0, + 1406.0, + 314.0, + 1406.0, + 348.0, + 297.0, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 343.0, + 1379.0, + 343.0, + 1379.0, + 377.0, + 355.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 391.0, + 1405.0, + 391.0, + 1405.0, + 429.0, + 294.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 423.0, + 1405.0, + 423.0, + 1405.0, + 460.0, + 355.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 453.0, + 1076.0, + 453.0, + 1076.0, + 486.0, + 355.0, + 486.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/7R7fAoUygoa/7R7fAoUygoa.md b/parse/train/7R7fAoUygoa/7R7fAoUygoa.md new file mode 100644 index 0000000000000000000000000000000000000000..f6da37ba570b36447843db821b4581b531f761b0 --- /dev/null +++ b/parse/train/7R7fAoUygoa/7R7fAoUygoa.md @@ -0,0 +1,698 @@ +# OPTIMAL REGULARIZATION CAN MITIGATE DOUBLE DESCENT + +Preetum Nakkiran +Harvard University +preetum@cs.harvard.edu +Prayaag Venkat +Harvard University +pvenkat@g.harvard.edu + +# Sham Kakade + +Microsoft Research & University of Washington sham@cs.washington.edu + +Tengyu Ma +Stanford University +tengyuma@stanford.edu + +# ABSTRACT + +Recent empirical and theoretical studies have shown that many learning algorithms – from linear regression to neural networks – can have test performance that is non-monotonic in quantities such the sample size and model size. This striking phenomenon, often referred to as “double descent”, has raised questions of if we need to re-think our current understanding of generalization. In this work, we study whether the double-descent phenomenon can be avoided by using optimal regularization. Theoretically, we prove that for certain linear regression models with isotropic data distribution, optimally-tuned $\ell _ { 2 }$ regularization achieves monotonic test performance as we grow either the sample size or the model size. We also demonstrate empirically that optimally-tuned $\ell _ { 2 }$ regularization can mitigate double descent for more general models, including neural networks. Our results suggest that it may also be informative to study the test risk scalings of various algorithms in the context of appropriately tuned regularization. + +# 1 INTRODUCTION + +Recent works have demonstrated a ubiquitous “double descent” phenomenon present in a range of machine learning models, including decision trees, random features, linear regression, and deep neural networks (Opper, 1995; 2001; Advani & Saxe, 2017; Spigler et al., 2018; Belkin et al., 2018; Geiger et al., 2019b; Nakkiran et al., 2020; Belkin et al., 2019; Hastie et al., 2019; Bartlett et al., 2019; Muthukumar et al., 2019; Bibas et al., 2019; Mitra, 2019; Mei & Montanari, 2019; Liang & Rakhlin, 2018; Liang et al., 2019; Xu & Hsu, 2019; Derezinski et al., 2019; Lampinen & Ganguli, ´ 2018; Deng et al., 2019; Nakkiran, 2019). The phenomenon is that models exhibit a peak of high test risk when they are just barely able to fit the train set, that is, to interpolate. For example, as we increase the size of models, test risk first decreases, then increases to a peak around when effective model size is close to the training data size, and then decreases again in the overparameterized regime. Also surprising is that Nakkiran et al. (2020) observe a double descent as we increase sample size, i.e. for a fixed model, training the model with more data can hurt test performance. + +These striking observations highlight a potential gap in our understanding of generalization and an opportunity for improved methods. Ideally, we seek to use learning algorithms which robustly improve performance as the data or model size grow and do not exhibit such unexpected nonmonotonic behaviors. In other words, we aim to improve the test performance in situations which would otherwise exhibit high test risk due to double descent. Here, a natural strategy would be to use a regularizer and tune its strength on a validation set. This motivates the central question of this work: + +When does optimally tuned regularization mitigate or remove the double-descent phenomenon? + +Another motivation is the fact that double descent is largely observed for unregularized or under regularized models in practice. As an example, Figure 1 shows a simple linear ridge regression setting in which the unregularized estimator exhibits double descent, but an optimally-tuned regularizer has monotonic test performance. + +![](images/b5edb5b47ed8f04264d90917cb098c4913b1a417a4d6db231609364ffb35c0c9.jpg) +Figure 1: Test Risk vs. Num. Samples for Isotropic Ridge Regression in $d \_ =$ 500 dimensions. Unregularized regression is non-monotonic in samples, but optimallyregularized regression $( \lambda = \lambda _ { o p t } )$ is monotonic. In this setting, the optimal regularizer $\lambda _ { o p t }$ does not depend on number of samples $n$ (Lemma 2), but this is not always true – see Figure 2. + +Our Contributions: We study this question from both a theoretical and empirical perspective. Theoretically, we start with the setting of high-dimensional linear regression. Linear regression is a sensible starting point to study these questions, since it already exhibits many of the qualitative features of double descent in more complex models (e.g. Belkin et al. (2019); Hastie et al. (2019) and further related works in Section 1.1). Our work shows that optimally-tuned ridge regression can achieve both sample-wise monotonicity and model-size-wise monotonicity under certain assumptions. Concretely, we show + +1. Sample-wise monotonicity: In the setting of well-specified linear regression with isotropic features/covariates (Figure 1), we prove that optimally-tuned ridge regression yields monotonic test performance with increasing samples. That is, more data never hurts for optimally-tuned ridge regression. (See Theorem 1). + +2. Model-wise monotonicity: We consider a setting where the input/covariate lives in a highdimensional ambient space with isotropic covariance. Given a fixed model size $d$ (which might be much smaller than ambient dimension), we consider the family of models which first project the input to a random $d$ -dimensional subspace, and then compute a linear function in this projected “feature space.” (This is nearly identical to models of double-descent considered in Hastie et al. (2019, Section 5.1)). We prove that in this setting, as we grow the model-size, optimally-tuned ridge regression over the projected features has monotone test performance. That is, with optimal regularization, bigger models are always better or the same. (See Theorem 3). + +3. Monotonicity in the real-world: We also demonstrate several richer empirical settings where optimal $\ell _ { 2 }$ regularization induces monotonicity, including random feature classifiers and convolutional neural networks. This suggests that the mitigating effect of optimal regularization may hold more generally in broad machine learning contexts. (See Section 5). + +A few remarks are in order: + +Problem-specific vs Minimax and Bayesian. It is worth noting that our results hold for all linear ground-truths, rather than holding for only the worst-case ground-truth or a random ground-truth. Indeed, the minimax optimal estimator or the Bayes optimal estimator are both trivially sample-wise and model-wise monotonic with respect to the minimax risk or the Bayes risk. However, they do not guarantee monotonicity of the risk itself for a given fixed problem. In particular, there exist minimax optimal estimators which are not sample-monotonic in the sense we desire. + +Universal vs Asymptotic. We also remark that our analysis is not only non-asymptotic but also works for all possible input dimensions, model sizes, and sample sizes. To our knowledge, the results herein are the first non-asymptotic sample-wise and model-wise monotonicity results for linear regression. (See discussion of related works Hastie et al. (2019); Mei & Montanari (2019) for related results in the asymptotic setting). Our work reveals aspects of the problem that were not present in prior asymptotic works. For example, we empirically show that optimal regularization can eliminate even “triple descent” in ridge regression (Figure 2). Moreover, we show that for nonGaussian covariates, optimally-tuned ridge regression is not always sample-monotonic: we give a counterexample in Section 4. + +Towards a more general characterization. Our theoretical results crucially rely on the covariance of the data being isotropic. A natural next question is if and when the same results can hold more generally. A full answer to this question is beyond the scope of this paper, though we give the following results: + +1. Optimally-tuned ridge regression is not always sample-monotonic: we show a counterexample for a certain non-Gaussian data distribution and heteroscedastic noise. We are not aware of prior work pointing out this fact. (See Section 4 for the counterexample and intuitions.) +2. For non-isotropic Gaussian covariates, we can achieve sample-wise monotonicity with a regularizer that depends on the population covariance matrix of data. This suggests unlabeled data might also help mitigate double descent in some settings, because the population covariance can be estimated from unlabeled data. (See Appendix B). +3. For non-isotropic Gaussian covariates, we conjecture that optimally-tuned ridge regression is sample-monotonic even with a standard $\ell _ { 2 }$ regularizer (as in Figure 2). We derive a sufficient condition for this conjecture. Due to that current random matrix theory may be insufficient to verify this conjecture, we verify it numerically on a wide variety of cases. (See Appendix B for details). + +The last two results above highlight the importance of the form of the regularizer, which leads to the open question: “How do we design good regularizers which mitigate or remove double descent?” We hope that our results can motivate future work on mitigating the double descent phenomenon, and allow us to train high performance models which do not exhibit nonmonotonic behaviors. + +# 1.1 RELATED WORKS + +The study of nonmonotonicity in learning algorithms existed prior to double descent and has a long history going back to (at least) Trunk (1979) and LeCun et al. (1991); Le Cun et al. (1991), where the former was largely empirical observations and the latter studied the sample non-nonmonotonicity of unregularized linear regression in terms of the eigenspectrum of the covariance matrix; the difference to our works is that we study this in the context of optimal regularization. In fact, Duin (1995; 2000); Opper (2001); Loog & Duin (2012). Loog et al. (2019) introduces the same notion of risk monotonicity which we consider, and studies several examples of monotonic and non-monotonic procedures. + +Double descent of test risk as a function of model size was considered recently in more generality by Belkin et al. (2018). Similar behavior was observed empirically in earlier work in somewhat more restricted settings Trunk (1979); Opper (1995; 2001); Skurichina & Duin (2002); Le Cun et al. (1991); LeCun et al. (1991) and more recently in Advani & Saxe (2017); Geiger et al. (2019a); Spigler et al. (2018); Neal et al. (2018). Recently Nakkiran et al. (2020) demonstrated a generalized double descent phenomenon on modern deep networks, and highlighted “sample non-monotonicity” as an aspect of double descent. + +A recent stream of theoretical works consider model-wise double descent in simplified settings— often via linear models for regression or classification. This also connects to works on highdimentional regression in the statistics literature. A partial list of works in these areas include Belkin et al. (2019); Hastie et al. (2019); Bartlett et al. (2019); Muthukumar et al. (2019); Bibas et al. (2019); Mitra (2019); Mei & Montanari (2019); Liang & Rakhlin (2018); Liang et al. (2019); Xu & Hsu (2019); Derezinski et al. (2019); Lampinen & Ganguli (2018); Deng et al. (2019); Nakki- ´ ran (2019); Mahdaviyeh & Naulet (2019); Dobriban et al. (2018); Dobriban & Sheng (2019); Kobak et al. (2018). Of these, most closely related to our work are Hastie et al. (2019); Dobriban et al. (2018); Mei & Montanari (2019). Specifically, Hastie et al. (2019) considers the risk of unregularized and regularized linear regression in an asymptotic regime, where dimension $d$ and number of samples $n$ scale to infinity together, at a constant ratio $d / n$ . In contrast, we show non-asymptotic results, and are able to consider increasing the number of samples for a fixed model, without scaling both together. Mei & Montanari (2019) derive similar results for unregularized and regularized random features, also in an asymptotic limit. The non-asymptotic versions of the settings considered in Hastie et al. (2019) are almost identical to ours— for example, our projection model in Section 3 is nearly identical to the model in Hastie et al. (2019, Section 5.1). Finally, subsequent to our work, d’Ascoli et al. (2020) identified triple descent in an asymptotic setting. + +# 2 SAMPLE MONOTONICITY IN RIDGE RIDGRESSION + +In this section, we prove that optimally-regularized ridge regression has test risk that is monotonic in samples, for isotropic gaussian covariates and linear response. This confirms the behavior empirically observed in Figure 1. We also show that this monotonicity is not “fragile”, and using larger than larger regularization is still sample-monotonic (consistent with Figure 1). + +Formally, we consider the following linear regression problem in $d$ dimensions. The input/covariate $x \in \mathbb { R } ^ { d }$ is generated from $\mathcal { N } ( 0 , I _ { d } )$ , and the output/response is generated by $y = \langle x , \beta ^ { * } \rangle + \varepsilon$ with $\varepsilon \sim \mathcal { N } ( 0 , \bar { \sigma } ^ { 2 } )$ for some unknown parameter $\beta ^ { * } \in \mathbb { R } ^ { d }$ . We denote the joint distribution of $( x , y )$ by $\mathcal { D }$ . We are given $n$ training examples $\{ ( x _ { i } , y _ { i } ) \} _ { i = 1 } ^ { n }$ i.i.d sampled from $\mathcal { D }$ . We aim to learn a linear model $f _ { \beta } ( x ) = \langle x , \beta \rangle$ with small population risk $\bar { R } ( \beta ) : = \mathbb { E } _ { ( x , y ) \sim \mathcal { D } } [ ( \langle x , \beta \rangle - y ) ^ { 2 } ]$ . For simplicity, let $\ b { X } \in \mathbb { R } ^ { n \times d }$ be the data matrix that contains $x _ { i } ^ { \top }$ ’s as rows and let $\vec { y } \in \mathbb R ^ { n }$ be column vector that contains the responses $y _ { i }$ ’s as entries. For any estimator $\hat { \beta } _ { n } ( X , \vec { y } )$ as a function of $n$ samples, define the expected risk of the estimator as: + +$$ +{ \overline { { R } } } ( { \hat { \beta } } _ { n } ) : = \operatorname * { \mathbb { E } } _ { X , y \sim { \mathcal { D } } ^ { n } } [ R ( { \hat { \beta } } _ { n } ( X , { \vec { y } } ) ) ] +$$ + +We consider the regularized least-squares estimator, also known as the ridge regression estimator. For a given $\lambda > 0$ , define + +$$ +\hat { \beta } _ { n , \lambda } : = \underset { \beta } { \operatorname { a r g m i n } } | | X \beta - \vec { y } | | _ { 2 } ^ { 2 } + \lambda | | \beta | | _ { 2 } ^ { 2 } = ( X ^ { T } X + \lambda I _ { d } ) ^ { - 1 } X ^ { T } \vec { y } +$$ + +Here $I _ { d }$ denotes the $d$ dimensional identity matrix. Let $\lambda _ { n } ^ { \mathrm { o p t } }$ be the optimal ridge parameter (that achieves the minimum expected risk) given $n$ samples: $\begin{array} { r } { \lambda _ { n } ^ { \mathrm { o p t } } : = \operatorname * { a r g m i n } _ { \lambda : \lambda \geq 0 } \overline { { R } } ( \hat { \beta } _ { n , \lambda } ) ) } \end{array}$ . Let $\hat { \beta } _ { n } ^ { \mathrm { { o p t } } }$ be the estimator that corresponds to the $\lambda _ { n } ^ { \mathrm { o p t } }$ . That is, $\begin{array} { r } { \hat { \beta } _ { n } ^ { \mathrm { o p t } } : = \operatorname * { a r g m i n } _ { \beta } | | X \beta - \vec { y } | | _ { 2 } ^ { 2 } + \lambda _ { n } ^ { \mathrm { o p t } } | | \beta | | _ { 2 } ^ { 2 } } \end{array}$ . Our main theorem in this section shows that the expected risk of $\hat { \beta } _ { n } ^ { \mathrm { { o p t } } }$ monotonically decreases as $n$ increases. + +Theorem 1. In the setting above, the expected test risk of optimally-regularized well-specified isotropic linear regression is monotonic in samples. That is, for all $\beta ^ { * } \in \mathbb { R } ^ { d }$ and all $d \in \mathbb { N } , n \in$ $\mathbb { N } , \sigma > 0$ , + +$$ +\overline { { R } } ( \hat { \beta } _ { n + 1 } ^ { \mathrm { o p t } } ) \leq \overline { { R } } ( \hat { \beta } _ { n } ^ { \mathrm { o p t } } ) +$$ + +The above theorem shows a strong form of monotonicity, since it holds for every fixed groundtruth $\beta ^ { * }$ , and does not require averaging over any prior on ground-truths. Moreover, it holds nonasymptotically, for every fixed $n , d \in \mathbb { N }$ . Obtaining such non-asymptotic results is nontrivial, since we cannot rely on concentration properties of the involved random variables. + +In particular, evaluating $\overline { { R } } ( \hat { \beta } _ { n } ^ { \mathrm { { o p t } } } )$ as a function of the problem parameters $( n , \sigma , \beta ^ { * }$ , and $d$ ) is technically challenging. In fact, we suspect that a simple closed form expression does not exist. The key idea towards proving the theorem is to derive a “partial evaluation” — the following lemmas shows that we can write $\overline { { R } } ( \hat { \beta } _ { n } ^ { \mathrm { { o p t } } } )$ in the form of $\mathbb { E } [ g ( \gamma , \sigma , n , d , \beta ^ { * } ) ]$ where $\gamma \in \mathbb { R } ^ { d }$ contains the singular values of $X$ . We will then couple the randomness of data matrices obtained by adding a single sample, and use singular value interlacing to compare their singular values. + +Lemma 1. In the setting of Theorem $^ { l }$ , let $\gamma = ( \gamma _ { 1 } , \ldots , \gamma _ { d } )$ be the singular values of the data matrix $\ b { X } \in \mathbb { R } ^ { n \times d }$ . (If $n < d$ , we pad the $\gamma _ { i } = 0$ for $i > n .$ .) Let $\Gamma _ { n }$ be the distribution of $\gamma .$ . Then, the expected test risk is + +$$ +\overline { { R } } ( \hat { \beta } _ { n , \lambda } ) = \operatorname * { \mathbb { E } } _ { ( \gamma _ { 1 } , \dots \gamma _ { d } ) \sim \Gamma _ { n } } \left[ \sum _ { i = 1 } ^ { d } \frac { | | \beta ^ { * } | | _ { 2 } ^ { 2 } \lambda ^ { 2 } / d + \sigma ^ { 2 } \gamma _ { i } ^ { 2 } } { ( \gamma _ { i } ^ { 2 } + \lambda ) ^ { 2 } } \right] + \sigma ^ { 2 } +$$ + +From Lemma 1, the below lemma follows directly by taking derivatives to find the optimal $\lambda$ . + +Lemma 2. In the setting of Theorem 1, the optimal ridge parameter is constant for all $n$ : $\lambda _ { n } ^ { \mathrm { o p t } } =$ $\frac { d \sigma ^ { 2 } } { | | \beta ^ { * } | | _ { 2 } ^ { 2 } }$ . Moreover, the optimal expected test risk can be written as + +$$ +\overline { { R } } ( \hat { \beta } _ { n } ^ { \mathrm { o p t } } ) = \operatorname * { l } _ { ( \gamma _ { 1 } , \ldots \gamma _ { d } ) \sim \Gamma _ { n } } \left[ \sum _ { i = 1 } ^ { d } \frac { \sigma ^ { 2 } } { \gamma _ { i } ^ { 2 } + d \sigma ^ { 2 } / | | \beta ^ { * } | | _ { 2 } ^ { 2 } } \right] + \sigma ^ { 2 } +$$ + +Proofs of Lemma 1 and 2 are deferred to the Appendix, Section A.1. Now we are ready to prove Theorem 1. + +Proof of Theorem $^ { l }$ . Let $\widetilde { X } \ \in \ \mathbb { R } ^ { ( n + 1 ) \times d }$ and $\boldsymbol { X } \in \mathbb { R } ^ { n \times d }$ be any two matrices which differ by only the last row of $\widetilde { X }$ . By the Cauchy interlacing theorem Theorem 4.3.4 of Horn et al. (1990) (c.f.,Lemma 3.4 of Marcus et al. (2014)), the singular values of $X$ and $\widetilde { X }$ are interlaced: $\forall i$ : $\gamma _ { i - 1 } ( X ) \geq \gamma _ { i } ( { \widetilde { X } } ) \geq \gamma _ { i } ( X )$ where $\gamma _ { i } ( \cdot )$ is the $i$ -th singular value. + +If we couple $\widetilde { X }$ and $X$ , it will induce a coupling $\Pi$ between the distributions $\Gamma _ { n + 1 }$ and $\Gamma _ { n }$ , of the singular values of the data matrix for $n + 1$ and $n$ samples. This coupling satisfies that $\widetilde { \gamma } _ { i } \geq \gamma _ { i }$ with probability 1 for $( \{ \widetilde { \gamma } _ { i } \} , \{ \gamma _ { i } \} ) \sim \Pi$ e. Now, expand the test risk using Lemma 2, and observe that each eterm in the sum of Equation (4) below is monotone decreasing with $\gamma _ { i }$ . Thus: + +$$ +\begin{array} { r l } & { \overline { { R } } ( \hat { \beta } _ { n } ^ { \mathrm { o p t } } ) = \underset { ( \gamma _ { 1 } , \ldots , \gamma _ { d } ) \sim \Gamma _ { n } } { \mathbb { E } } \left[ \displaystyle \sum _ { i = 1 } ^ { d } \frac { \sigma ^ { 2 } } { \gamma _ { i } ^ { 2 } + d \sigma ^ { 2 } / | | \beta ^ { * } | | _ { 2 } ^ { 2 } } \right] + \sigma ^ { 2 } } \\ & { \qquad \quad \overset { \mathbb { E } } { \ge } \underset { ( \widetilde { \gamma } _ { 1 } , \ldots , \widetilde { \gamma } _ { d } ) \sim \Gamma _ { n + 1 } } { \mathbb { E } } \left[ \displaystyle \sum _ { i = 1 } ^ { d } \frac { \sigma ^ { 2 } } { \widetilde { \gamma } _ { i } ^ { 2 } + d \sigma ^ { 2 } / | | \beta ^ { * } | | _ { 2 } ^ { 2 } } \right] + \sigma ^ { 2 } } \\ & { \qquad = \overline { { R } } ( \hat { \beta } _ { n + 1 } ^ { \mathrm { o p t } } ) } \end{array} +$$ + +By similar techniques, we can also prove that overregularization —that is, using ridge parameters $\lambda$ larger than the optimal value— is still monotonic. This proves the behavior empirically observed in Figure 1. + +Theorem 2. In the same setting as Theorem $I$ , over-regularized regression is also monotonic in samples. That is, for all $d \in \mathbb { N } , n \in \mathbb { N } , \sigma > 0 , \beta ^ { * } \in \mathbb { R } ^ { d }$ , the following holds + +$$ +\forall \lambda \geq \lambda ^ { * } : \quad \overline { { { R } } } ( \widehat { \beta } _ { n + 1 , \lambda } ) \leq \overline { { { R } } } ( \widehat { \beta } _ { n , \lambda } ) +$$ + +where $\begin{array} { r } { \lambda ^ { * } = \frac { d \sigma ^ { 2 } } { | | \beta ^ { * } | | _ { 2 } ^ { 2 } } } \end{array}$ + +Proof. In Section A.1. + +# 3 MODEL-WISE MONOTONICITY IN RIDGE REGRESSION + +In this section, we show that for a certain family of linear models, optimal regularization prevents model-wise double descent. That is, for a fixed number of samples, larger models are not worse than smaller models. + +We consider the following learning problem. Informally, covariates live in a $p$ -dimensional ambient space, and we consider models which first linearly project down to a random $d$ -dimensional subspace, then perform ridge regression in that subspace for some $d \leq p$ . Formally, the covariate $x \in \mathbb { R } ^ { p }$ is generated from $\bar { \mathcal { N } } ( 0 , I _ { p } )$ , and the response is generated by $y = \langle x , \theta \rangle + \varepsilon$ with $\varepsilon \sim \mathcal { N } ( 0 , \sigma ^ { 2 } )$ and for some unknown parameter $\theta \in \mathbb { R } ^ { p }$ . Next, $n$ examples $\{ ( x _ { i } , y _ { i } ) \} _ { i = 1 } ^ { n }$ are sampled i.i.d from this distribution. For a given model size $d \leq p$ , we first sample a random orthonormal matrix $P \in \mathbb { R } ^ { d \times p }$ which specifies our model. We then consider models which operate on $( \widetilde { x } _ { i } , y _ { i } ) \in \mathbb { R } ^ { d } \times \mathbb { R }$ , where $\widetilde { x _ { i } } = P x _ { i }$ . We denote the joint distribution of $( \widetilde { x } , y )$ by $\mathcal { D }$ . Here, we eemphasize that $p$ eis some large ambient dimension and $d \leq p$ eis the size of the model we learn. + +For a fixed $P$ , we want to learn a linear model $f _ { \hat { \beta } } ( \tilde { x } ) = \langle \tilde { x } , \hat { \beta } \rangle$ for estimating $y$ , with small mean squared error on distribution: $R _ { P } ( \hat { \beta } ) : = \mathbb { E } _ { ( \tilde { x } , y ) \sim \mathcal { D } } [ ( \langle \tilde { x } , \hat { \beta } \rangle - y ) ^ { 2 } ]$ . For $n$ samples $( x _ { i } , y _ { i } )$ , let $X \in$ $\mathbb { R } ^ { n \times p }$ be the data matrix, $\widetilde { X } \ = X P ^ { T } \ \in \ \mathbb { R } ^ { n \times d }$ be the projected data matrix and $\vec { y } \in \mathbb R ^ { n }$ be the responses. For any estimator $\hat { \beta } ( \widetilde { X } , \vec { y } )$ as a function of the observed samples, define the expected risk of the estimator as: + +$$ +\overline { { R } } ( \hat { \beta } ) : = \operatorname * { \mathbb { E } } _ { P } \operatorname * { \mathbb { E } } _ { \tilde { X } , \vec { y } \sim \mathcal { D } ^ { n } } [ R _ { P } ( \hat { \beta } ( \tilde { X } , \vec { y } ) ] +$$ + +We consider the regularized least-squares estimator. For a given $\lambda > 0$ , define + +$$ +\hat { \beta } _ { d , \lambda } : = \underset { \beta } { \mathrm { a r g m i n } } | | \widetilde { X } \beta - \vec { y } | | _ { 2 } ^ { 2 } + \lambda | | \beta | | _ { 2 } ^ { 2 } = ( \widetilde { X } ^ { T } \widetilde { X } + \lambda I _ { d } ) ^ { - 1 } \widetilde { X } ^ { T } \vec { y } +$$ + +Let $\lambda _ { d } ^ { \mathrm { o p t } }$ be the optimal ridge parameter (that achieves the minimum expected risk) for a model of size $d$ d, with $n$ samples: $\lambda _ { d } ^ { \mathrm { o p t } } : = \mathrm { a r g m i n } _ { \lambda \ge 0 } \overline { { R } } ( \hat { \beta } _ { d , \lambda } ) )$ . Let $\hat { \beta } _ { d } ^ { \mathrm { { o p t } } }$ be the estimator that corresponds to the $\lambda _ { d } ^ { \mathrm { o p t } }$ , that is $\begin{array} { r } { \hat { \beta } _ { d } ^ { \mathrm { o p t } } : = \operatorname * { a r g m i n } _ { \beta } | | \widetilde { X } \beta - \vec { y } | | _ { 2 } ^ { 2 } + \lambda _ { d } ^ { \mathrm { o p t } } | | \beta | | _ { 2 } ^ { 2 } } \end{array}$ . Now, our main theorem in this setting shows that with optimal $\ell _ { 2 }$ regularization, test performance is monotonic in model size. + +Theorem 3. In the setting above, the expected test risk of the optimally-regularized model is monotonic in the model size $d .$ . That is, for all $p \in \mathbb { N } , \theta \in \mathbb { R } ^ { p } , d \leq p , n \in \mathbb { N } , \sigma > 0$ , we have + +$$ +\overline { { R } } ( \hat { \beta } _ { d + 1 } ^ { \mathrm { o p t } } ) \leq \overline { { R } } ( \hat { \beta } _ { d } ^ { \mathrm { o p t } } ) +$$ + +The proof of Theorem 3 is in Appendix A.2, and follows closely the proof of Theorem 1. + +# 4 COUNTEREXAMPLES TO MONOTONICITY + +In this section, we show that optimally-regularized ridge regression is not always monotonic in samples. We give a numeric counterexample in $d = 2$ dimensions, with non-gaussian covariates and heteroscedastic noise. This does not contradict our main theorem in Section 2, since this distribution is not jointly Gaussian with isotropic marginals. + +Counterexample. Here we give an example of a distribution $( x , y )$ for which the expected error of optimally-regularized ridge regression with $n = 2$ samples is worse than with $n = 1$ samples. This counterexample is most intuitive to understand when the ridge parameter $\lambda$ is allowed to depend on the specific sample instance $( X , { \vec { y } } )$ as well as $n ^ { 1 }$ . We sketch the intuition for this below. Consider the following distribution on $( x , y )$ in $d = 2$ dimensions. This distribution has one “clean” coordinate and one “noisy” coordinate. The distribution is: $( x , y ) = ( { \vec { e } } _ { 1 } , 1 )$ with probability $1 / 2$ , and $( x , y ) =$ $( \vec { e } _ { 2 } , \pm 1 0 )$ w.p. 1/2. Where $\pm 1 0$ is uniformly random independent noise. This distribution is “wellspecified” in that the optimal predictor is linear in $x$ $: \mathbb { E } [ y | x ] = \langle \beta ^ { * } , x \rangle$ for $\beta ^ { * } = [ 1 , 0 ]$ . However, the noise is heteroscedastic. + +For $n = 1$ samples, the estimator can decide whether to use small $\lambda$ or large $\lambda$ depending on if the sampled coordinate is the “clean” or “noisy” one. Specifically, for the sample $( x , y )$ : If $x = \vec { e } _ { 1 }$ , then the optimal ridge parameter is $\lambda = 0$ . If $x = \vec { e } _ { 2 }$ , then the optimal parameter is $\lambda = \infty$ . + +For $n = 2$ samples, with probability $1 / 2$ the two samples will hit both coordinates. In this case, the estimator must chose a single value of $\lambda$ uniformly for both coordinates. This yields to a suboptimal tradeoff, since the “noisy” coordinate demands large regularization, but this hurts estimation on the “clean” coordinate. + +It turns out that a slight modification to the above also serves as a counterexample to monotonicity when the regularization parameter $\lambda$ is chosen only depending on $n$ (and not on the instance $X , y )$ . The distribution is: $( x , y ) = ( \vec { e } _ { 1 } , 1 )$ w.p. 0.98 and $( x , y ) = ( \vec { e } _ { 2 } , \pm 2 0 )$ w.p. 0.02. This distribution has the following property. + +Theorem 4. There exists a distribution $\mathcal { D }$ over $( x , y )$ for $x \in \mathbb { R } ^ { 2 } , y \in \mathbb { R }$ with the following properties. Let $\hat { \beta } _ { n } ^ { \mathrm { { o p t } } }$ be the optimally-regularized ridge regression solution for $n$ samples $( X , { \vec { y } } )$ from $\mathcal { D }$ . Then: + +1. D is “well-specified” in that $\mathbb { E } p [ y | x ]$ is a linear function of $x$ , + +2. The expected test risk increases as a function of $n _ { \ast }$ , between $n = 1$ and $n = 2$ . Specifically + +$$ +\overline { { R } } ( \hat { \beta } _ { n = 1 } ^ { \mathrm { o p t } } ) < \overline { { R } } ( \hat { \beta } _ { n = 2 } ^ { \mathrm { o p t } } ) +$$ + +Proof. For $n = 1$ samples, it can be confirmed analytically that the expected risk $\overline { { { R } } } ( \hat { \beta } _ { n = 1 } ^ { \mathrm { o p t } } ) ~ <$ 8.157. This is achieved with $\lambda = 4 0 0 / 2 4 0 1 \approx 0 . 1 6 6 5 9 7 .$ For $n = 2$ samples, it can be confirmed numerically (via Mathematica) that the expected risk $\overline { { R } } ( \hat { \beta } _ { n = 2 } ^ { \mathrm { o p t } } ) ~ > ~ 8 . 1 7 9$ . This is achieved with $\lambda = 0 . 6 4 2 5 2 5$ . □ + +# 5 EXPERIMENTS + +We now experimentally demonstrate that optimal $\ell _ { 2 }$ regularization can mitigate double descent, in more general settings than Theorems 1 and 3. + +# 5.1 SAMPLE MONOTONICITY + +Here we show various settings where optimal $\ell _ { 2 }$ regularization empirically induces samplemonotonic performance. + +Nonisotropic Regression. We first consider the setting of Theorem 1, but with non-isotropic covariantes $x$ . That is, we perform ridge regression on samples $( x , y )$ , where the covariate $\boldsymbol { x } \in \mathbb { R } ^ { d }$ is generated from $\mathcal { N } ( 0 , \Sigma )$ for $\Sigma \neq I _ { d }$ . As before, the response is generated by $y = \langle x , \beta ^ { * } \rangle + \varepsilon$ with $\varepsilon \sim \mathcal { N } ( 0 , \sigma ^ { 2 } )$ for some unknown parameter $\beta ^ { * } \in \mathbb { R } ^ { d }$ . We consider the same ridge regression estimator, $\begin{array} { r } { \hat { \beta } _ { n , \lambda } : = \operatorname * { a r g m i n } _ { \boldsymbol { \beta } } \| X { \boldsymbol { \beta } } - \vec { y } \| _ { 2 } ^ { 2 } + \lambda \| { \boldsymbol { \beta } } \| _ { 2 } ^ { 2 } } \end{array}$ . + +![](images/6bbe45f3d0113a0cbb86e816d67e9834573c85c456540349b12e6e02c25001ba.jpg) +Figure 2: Test Risk vs. Num. Samples for Non-Isotropic Ridge Regression in $d = 3 0$ dimensions. Unregularized regression is non-monotonic in samples, but optimally-regularized regression is monotonic. Note the optimal regularization $\lambda$ depends on the number of samples $n$ . +Figure 2 shows one instance of this, for a particular choice of $\Sigma$ and $\beta ^ { * }$ . The covariance $\Sigma$ is diagonal, with $\Sigma _ { i , i } = 1 0$ for $i \leq 1 5$ and $\Sigma _ { i , i } = 1$ for $i > 1 5$ . That is, the covariance has one “large” eigenspace and one “small” eigenspace. The ground-truth $\beta ^ { * } = 0 . 1 \vec { e _ { 1 } } + e _ { 3 0 } ^ { }$ , which lies almost entirely within the “small” eigenspace of $\Sigma$ . The noise parameter is $\sigma = 0 . 5$ . + +We see that unregularized regression $\lambda = 0$ ) actually undergoes “triple descent”2 in this setting, with the first peak around $n = 1 5$ samples due to the 15-dimensional large eigenspace, and the second peak at $n = d$ . In this setting, optimally-regularized ridge regression is empirically monotonic in samples (Figure 2). Unlike the isotropic setting of Section 2, the optimal ridge parameter $\lambda _ { n }$ is no longer a constant, but varies with number of samples $n$ . + +Random ReLU Features. We consider random ReLU features, in the random features framework of Rahimi & Recht (2008). For a given number of features $D$ , and number of samples $n$ , the random feature classifier is obtained by performing regularized linear regression on the embedding√ $\tilde { x } : = \mathrm { R e L U } ( W x )$ , where $W \in \mathbb { R } ^ { D \times d }$ is a matrix with each entry sampled i.i.d $\mathcal { N } ( 0 , 1 / \sqrt { d } )$ and ReLU applies pointwise. This is equivalent to a 2-layer fully-connected neural network with a frozen (randomly-initialized) first layer, trained with $\ell _ { 2 }$ loss and weight decay. In Appendix A.4, we apply random features to Fashion-MNIST Xiao et al. (2017). From Appendix Figure 4a, we see that underregularized models are non-monotonic, but optimal $\ell _ { 2 }$ regularization is monotonic in samples. Moreover, the optimal ridge parameter $\lambda$ appears to be constant for all $n$ , similar to our results from the isotropic setting in Theorem 1. + +# 5.2 MODEL-SIZE MONOTONICITY + +Here we empirically show that optimal $\ell _ { 2 }$ regularization can mitigate model-wise double descent. + +Random ReLU Features. We consider the same experimental setup as in Section 5.1, but now fix the number of samples $n$ , and vary the number of random features $D$ . This corresponds to varying the width of the corresponding 2-layer neural network. Figure 4b in Appendix A.4 shows the test error of the random features classifier, for $n = 5 0 0$ train samples and varying number of random features. We see that underregularized models undergo model-wise double descent, but optimal $\ell _ { 2 }$ regularization prevents double descent. + +Convolutional Neural Networks. We follow the experimental setup of Nakkiran et al. (2020) for modelwise double descent, and add varying amounts of $\ell _ { 2 }$ regularization (weight decay). We chose the following setting from Nakkiran et al. (2020), because it exhibits double descent even with no added label noise. We consider the same family of 5-layer convolutional neural networks (CNNs) from Nakkiran et al. (2020), consisting of 4 convolutional layers of widths $[ k , 2 k , 4 k , 8 k ]$ for varying $k \in$ $\mathbb { N }$ . We train and test on CIFAR100 (Krizhevsky et al., 2009), an image classification problem with 100 classes. Inputs are normalized to + +![](images/b59ffa519889838486fdb1bea9435eca85527fcc4c5ff780a6f8610321941a4b.jpg) +Figure 3: Test Error vs. Model Size for 5-layer CNNs on CIFAR-100, with $\ell _ { 2 }$ regularization (weight decay). Note that the optimal regularization $\lambda$ varies with $n$ . + +$[ - 1 , 1 ] ^ { d }$ , and we use standard data-augmentation of random horizontal flip and random crop with 4- pixel padding. All models are trained using Stochastic Gradient Descent (SGD) on the cross-entropy loss, with step size $0 . 1 / \sqrt { \lfloor { T / 5 1 2 } \rfloor + 1 }$ at step $T$ . We train for 1e6 gradient steps, and use weight decay $\lambda$ for varying $\lambda$ . Due to optimization instabilities for large $\lambda$ , we use the model with the minimum train loss among the last 5K gradient steps. Figure 3 shows the test error of these models on CIFAR-100. Although unregularized and under-reguarized models exhibit double descent, the test error of optimally-regularized models is largely monotonic. Note that the optimal regularization $\lambda$ varies with the model size — no single regularization value is optimal for all models. + +# 6 DISCUSSION AND CONCLUSION + +In this work, we study the double descent phenomenon in the context of optimal regularization. We show that, while unregularized or under-regularized models often have non-monotonic behavior, appropriate regularization can eliminate this effect. + +Theoretically, we prove that for certain linear regression models with isotropic covariates, optimallytuned $\ell _ { 2 }$ regularization achieves monotonic test performance as we grow either the sample size or the model size. These are the first non-asymptotic monotonicity results we are aware of in linear regression. We also demonstrate empirically that optimally-tuned $\ell _ { 2 }$ regularization can mitigate double descent for more general models, including neural networks. We hope that our results can motivate future work on mitigating the double descent phenomenon, and allow us to train high performance models which do not exhibit unexpected nonmonotonic behaviors. + +Open Questions. Our work suggests a number of natural open questions. First, it is open to prove (or disprove) that optimal ridge regression is sample-monotonic for non-isotropic Gaussian covariates. We conjecture that it is, and outline a potential route to proving this (via Conjectures 1 and 2 in the Appendix). Second, more broadly, it is open to prove sample-wise or model-wise monotonicity for more general (non-linear) models with appropriate regularizers. Finally, it is open to understand why large neural networks in practice are often sample-monotonic in realistic regimes of sample sizes, even without careful choice of regularization. + +# REFERENCES + +Madhu S Advani and Andrew M Saxe. High-dimensional dynamics of generalization error in neural networks. arXiv preprint arXiv:1710.03667, 2017. +Peter L Bartlett, Philip M Long, Gabor Lugosi, and Alexander Tsigler. Benign overfitting in linear ´ regression. arXiv preprint arXiv:1906.11300, 2019. +Mikhail Belkin, Daniel Hsu, Siyuan Ma, and Soumik Mandal. Reconciling modern machine learning and the bias-variance trade-off. arXiv preprint arXiv:1812.11118, 2018. +Mikhail Belkin, Daniel Hsu, and Ji Xu. Two models of double descent for weak features. arXiv preprint arXiv:1903.07571, 2019. +Koby Bibas, Yaniv Fogel, and Meir Feder. A new look at an old problem: A universal learning approach to linear regression. arXiv preprint arXiv:1905.04708, 2019. +Stephane d’Ascoli, Levent Sagun, and Giulio Biroli. Triple descent and the two kinds of overfitting: ´ Where & why do they appear? arXiv preprint arXiv:2006.03509, 2020. +Zeyu Deng, Abla Kammoun, and Christos Thrampoulidis. A model of double descent for highdimensional binary linear classification. arXiv preprint arXiv:1911.05822, 2019. +Michał Derezinski, Feynman Liang, and Michael W. Mahoney. Exact expressions for double descent ´ and implicit regularization via surrogate random design, 2019. +Edgar Dobriban and Yue Sheng. Wonder: Weighted one-shot distributed ridge regression in high dimensions. arXiv preprint arXiv:1903.09321, 2019. +Edgar Dobriban, Stefan Wager, et al. High-dimensional asymptotics of prediction: Ridge regression and classification. The Annals of Statistics, 46(1):247–279, 2018. +Robert PW Duin. Small sample size generalization. In Proceedings of the Scandinavian Conference on Image Analysis, volume 2, pp. 957–964. PROCEEDINGS PUBLISHED BY VARIOUS PUBLISHERS, 1995. +Robert PW Duin. Classifiers in almost empty spaces. In Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, volume 2, pp. 1–7. IEEE, 2000. +Mario Geiger, Arthur Jacot, Stefano Spigler, Franck Gabriel, Levent Sagun, Stephane d’Ascoli, ´ Giulio Biroli, Clement Hongler, and Matthieu Wyart. Scaling description of generalization with ´ number of parameters in deep learning. arXiv preprint arXiv:1901.01608, 2019a. +Mario Geiger, Stefano Spigler, Stephane d’Ascoli, Levent Sagun, Marco Baity-Jesi, Giulio Biroli, ´ and Matthieu Wyart. Jamming transition as a paradigm to understand the loss landscape of deep neural networks. Physical Review E, 100(1):012115, 2019b. +Trevor Hastie, Andrea Montanari, Saharon Rosset, and Ryan J. Tibshirani. Surprises in high + +dimensional ridgeless least squares interpolation, 2019. + +Roger A Horn, Roger A Horn, and Charles R Johnson. Matrix Analysis. Cambridge University Press, 1990. + +Dmitry Kobak, Jonathan Lomond, and Benoit Sanchez. Optimal ridge penalty for real-world highdimensional data can be zero or negative due to the implicit ridge regularization. arXiv preprint arXiv:1805.10939, 2018. + +Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images. 2009. + +Andrew K Lampinen and Surya Ganguli. An analytic theory of generalization dynamics and transfer learning in deep linear networks. arXiv preprint arXiv:1809.10374, 2018. + +Yann Le Cun, Ido Kanter, and Sara A Solla. Eigenvalues of covariance matrices: Application to neural-network learning. Physical Review Letters, 66(18):2396, 1991. + +Yann LeCun, Ido Kanter, and Sara A Solla. Second order properties of error surfaces: Learning time and generalization. In Advances in neural information processing systems, pp. 918–924, 1991. + +Tengyuan Liang and Alexander Rakhlin. Just interpolate: Kernel” ridgeless” regression can generalize. arXiv preprint arXiv:1808.00387, 2018. + +Tengyuan Liang, Alexander Rakhlin, and Xiyu Zhai. On the risk of minimum-norm interpolants and restricted lower isometry of kernels. arXiv preprint arXiv:1908.10292, 2019. + +Tengyuan Liang, Alexander Rakhlin, and Xiyu Zhai. On the multiple descent of minimum-norm interpolants and restricted lower isometry of kernels. 2020. + +Marco Loog and Robert PW Duin. The dipping phenomenon. In Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR), pp. 310–317. Springer, 2012. + +Marco Loog, Tom Viering, and Alexander Mey. Minimizers of the empirical risk and risk monotonicity. In Advances in Neural Information Processing Systems, pp. 7476–7485, 2019. + +Yasaman Mahdaviyeh and Zacharie Naulet. Asymptotic risk of least squares minimum norm estimator under the spike covariance model. arXiv preprint arXiv:1912.13421, 2019. + +Adam W Marcus, Daniel A Spielman, and Nikhil Srivastava. Ramanujan graphs and the solution of the kadison-singer problem. arXiv preprint arXiv:1408.4421, 2014. + +Song Mei and Andrea Montanari. The generalization error of random features regression: Precise asymptotics and double descent curve. arXiv preprint arXiv:1908.05355, 2019. + +Partha P. Mitra. Understanding overfitting peaks in generalization error: Analytical risk curves for l2 and l1 penalized interpolation. ArXiv, abs/1906.03667, 2019. + +Vidya Muthukumar, Kailas Vodrahalli, and Anant Sahai. Harmless interpolation of noisy data in regression. arXiv preprint arXiv:1903.09139, 2019. + +Preetum Nakkiran. More data can hurt for linear regression: Sample-wise double descent. arXiv preprint arXiv:1912.07242, 2019. + +Preetum Nakkiran, Gal Kaplun, Yamini Bansal, Tristan Yang, Boaz Barak, and Ilya Sutskever. Deep double descent: Where bigger models and more data hurt. In International Conference on Learning Representations, 2020. URL https://openreview.net/forum?id $\underline { { \underline { { \mathbf { \Pi } } } } }$ B1g5sA4twr. + +Brady Neal, Sarthak Mittal, Aristide Baratin, Vinayak Tantia, Matthew Scicluna, Simon LacosteJulien, and Ioannis Mitliagkas. A modern take on the bias-variance tradeoff in neural networks. arXiv preprint arXiv:1810.08591, 2018. + +Manfred Opper. Statistical mechanics of learning: Generalization. The Handbook of Brain Theory and Neural Networks, 922-925., 1995. + +Manfred Opper. Learning to generalize. Frontiers of Life, 3(part 2), pp.763-775., 2001. + +Ali Rahimi and Benjamin Recht. Random features for large-scale kernel machines. In Advances in neural information processing systems, pp. 1177–1184, 2008. + +Marina Skurichina and Robert PW Duin. Bagging, boosting and the random subspace method for linear classifiers. Pattern Analysis & Applications, 5(2):121–135, 2002. + +Stefano Spigler, Mario Geiger, Stephane d’Ascoli, Levent Sagun, Giulio Biroli, and Matthieu Wyart.´ A jamming transition from under-to over-parametrization affects loss landscape and generalization. arXiv preprint arXiv:1810.09665, 2018. + +Gerard V Trunk. A problem of dimensionality: A simple example. IEEE Transactions on pattern analysis and machine intelligence, (3):306–307, 1979. + +Han Xiao, Kashif Rasul, and Roland Vollgraf. Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms. arXiv preprint arXiv:1708.07747, 2017. + +Ji Xu and Daniel J Hsu. On the number of variables to use in principal component regression. In Advances in Neural Information Processing Systems, pp. 5095–5104, 2019. + +# A APPENDIX + +In Section A.1 and A.2 we provide the proofs for sample-monotonicity and model-size monotonicity. In Section A.4 we include additional and omitted plots. In Section B we investigate whether monotonicity provably holds in more general models, and present a monotonicity conjecture for non-isotropic covariates. + +# A.1 SAMPLE MONOTONICITY PROOFS + +First we prove Lemma 1. + +Proof of Lemma $^ { l }$ . For isotropic $x$ , the test risk is related to the parameter error as: + +$$ +\begin{array} { r l } & { R ( \hat { \beta } ) : = \underset { ( x , y ) \sim \mathcal { D } } { \mathbb { E } } [ ( \langle x , \hat { \beta } \rangle - y ) ^ { 2 } ] } \\ & { \quad \quad = \underset { x \sim \mathcal { N } ( 0 , I _ { d } ) , \eta \sim \mathcal { N } ( 0 , \sigma ^ { 2 } ) } { \mathbb { E } } [ ( \langle x , \hat { \beta } - \beta ^ { * } \rangle + \eta ) ^ { 2 } ] } \\ & { \quad \quad = | | \hat { \beta } - \beta ^ { * } | | _ { 2 } ^ { 2 } + \sigma ^ { 2 } } \end{array} +$$ + +Plugging in the form of $\hat { \beta } _ { n , \lambda }$ and expanding: + +$$ +\begin{array} { r l } & { \bar { R } ( \hat { \beta } _ { n , \lambda } ) : = \underset { X , y \sim \mathcal { D } ^ { n } } { \mathbb { E } } [ R ( \hat { \beta } _ { n , \lambda } ) ] } \\ & { = \mathbb { E } [ \| \hat { \beta } _ { n , \lambda } - \beta ^ { * } \| _ { 2 } ^ { 2 } ] + \sigma ^ { 2 } } \\ & { = \underset { X , y } { \mathbb { E } } [ \| ( X ^ { T } X + \lambda I ) ^ { - 1 } X ^ { T } y - \beta \| _ { 2 } ^ { 2 } ] + \sigma ^ { 2 } } \\ & { = \underset { X , \eta \sim \mathcal { N } ( 0 , \sigma ^ { 2 } I _ { n } ) } { \mathbb { E } } [ \| ( X ^ { T } X + \lambda I ) ^ { - 1 } X ^ { T } ( X \beta ^ { * } + \eta ) - \beta ^ { * } \| _ { 2 } ^ { 2 } ] + \sigma ^ { 2 } } \\ & { = \underset { X } { \mathbb { E } } [ \| ( X ^ { T } X + \lambda I ) ^ { - 1 } X ^ { T } X \beta ^ { * } - \beta ^ { * } \| _ { 2 } ^ { 2 } ] + \underset { X , \eta } { \mathbb { E } } [ \| ( X ^ { T } X + \lambda I ) ^ { - 1 } X ^ { T } \eta \| _ { 2 } ^ { 2 } ] + \sigma ^ { 2 } } \\ & { = \underset { X } { \mathbb { E } } [ \| ( X ^ { T } X + \lambda I ) ^ { - 1 } X ^ { T } X \beta ^ { * } - \beta ^ { * } \| _ { 2 } ^ { 2 } ] + \sigma ^ { 2 } \underset { X } { \mathbb { E } } [ \| ( X ^ { T } X + \lambda I ) ^ { - 1 } X ^ { T } \| _ { F } ^ { 2 } ] + \sigma ^ { 2 } } \end{array} +$$ + +Now let $X \ = \ U \Sigma V ^ { T }$ be the full singular value decomposition of $X$ , with $U \ \in \ \mathbb { R } ^ { n \times n } , \Sigma \ \in$ $\mathbb { R } ^ { n \times d } , V \in \mathbb { R } ^ { d \times d }$ . Let $( \gamma _ { 1 } , \ldots \gamma _ { d } )$ denote the singular values, defining $\gamma _ { i } = 0$ for $i > \operatorname* { m i n } ( n , d )$ . Then, continuing: + +$$ +\begin{array} { r l } & { \overline { { R } } ( \hat { \beta } _ { n , \lambda } ) = \underset { V , \Sigma } { \mathbb { E } } [ | | \mathrm { d i a g } ( \{ \frac { - \lambda } { \gamma _ { i } ^ { 2 } + \lambda } \} ) V ^ { T } \beta ^ { * } | | _ { 2 } ^ { 2 } ] + \sigma ^ { 2 } \underset { \Sigma } { \mathbb { E } } [ \sum _ { i } \frac { \gamma _ { i } ^ { 2 } } { ( \gamma _ { i } ^ { 2 } + \lambda ) ^ { 2 } } ] + \sigma ^ { 2 } } \\ & { \quad \quad = \underset { z \sim \mathrm { U n i f } ( 1 ) \frac { \mathbb { E } } { \delta } } { \underbrace { \mathrm { U } \mathrm { E } } } [ | | \mathrm { d i a g } ( \{ \frac { - \lambda } { \gamma _ { i } ^ { 2 } + \lambda } \} ) z | | _ { 2 } ^ { 2 } ] + \sigma ^ { 2 } \underset { \Sigma } { \mathbb { E } } [ \sum _ { i } \frac { \gamma _ { i } ^ { 2 } } { ( \gamma _ { i } ^ { 2 } + \lambda ) ^ { 2 } } ] + \sigma ^ { 2 } } \\ & { \quad \quad = \frac { | | \beta ^ { * } | | _ { 2 } ^ { 2 } } { d } \underset { \Sigma } { \mathbb { E } } [ \sum _ { i } \frac { \lambda ^ { 2 } } { ( \gamma _ { i } ^ { 2 } + \lambda ) ^ { 2 } } ] + \sigma ^ { 2 } \underset { \Sigma } { \mathbb { E } } [ \sum _ { i } \frac { \gamma _ { i } ^ { 2 } } { ( \gamma _ { i } ^ { 2 } + \lambda ) ^ { 2 } } ] + \sigma ^ { 2 } } \\ & { \quad \quad = \underset { \Sigma } { \mathbb { E } } [ \sum _ { i } \frac { | | \beta ^ { * } | | _ { 2 } ^ { 2 } \lambda ^ { 2 } / d + \sigma ^ { 2 } \gamma _ { i } ^ { 2 } } { ( \gamma _ { i } ^ { 2 } + \lambda ) ^ { 2 } } ] + \sigma ^ { 2 } } \end{array} +$$ + +In Line (10) follows because by symmetry, the distribution of $V$ is a uniformly random orthonormal matrix, and $\Sigma$ is independent of $V$ . Thus, $z : = V ^ { T } \beta ^ { * }$ is distributed as a uniformly random point on the unit sphere of radius $| | \beta ^ { * } | | _ { 2 }$ . + +Next we prove Lemma 2. + +Proof of Lemma 2. First, we determine the optimal ridge parameter. Using Lemma 1, we have + +$$ +\begin{array} { r l } & { \frac { \partial } { \partial \lambda } \overline { { R } } ( \hat { \beta } _ { n , \lambda } ) = \frac { \partial } { \partial \lambda } _ { ( \gamma _ { 1 } , \dots \gamma _ { d } ) \sim \Gamma } \left[ \displaystyle \sum _ { i } \frac { | | \beta | | _ { 2 } ^ { 2 } \lambda ^ { 2 } / d + \sigma ^ { 2 } \gamma _ { i } ^ { 2 } } { ( \gamma _ { i } ^ { 2 } + \lambda ) ^ { 2 } } \right] } \\ & { = 2 ( | | \beta ^ { * } | | _ { 2 } ^ { 2 } \lambda / d - \sigma ^ { 2 } ) _ { ( \underbrace { ( \gamma _ { 1 } , \dots \gamma _ { d } ) \sim \Gamma } _ { > 0 } } \left[ \displaystyle \sum _ { i } \frac { \gamma _ { i } ^ { 2 } } { ( \gamma _ { i } ^ { 2 } + \lambda ) ^ { 3 } } \right] } \end{array} +$$ + +Thus, $\begin{array} { r } { \frac { \partial } { \partial \lambda } \overline { { R } } ( \widehat { \beta } _ { n , \lambda } ) = 0 \implies \lambda = \frac { d \sigma ^ { 2 } } { | | \beta ^ { * } | | _ { 2 } ^ { 2 } } } \end{array}$ and we conclude that $\begin{array} { r } { \lambda _ { n } ^ { \mathrm { o p t } } = \frac { d \sigma ^ { 2 } } { | | \beta ^ { * } | | _ { 2 } ^ { 2 } } } \end{array}$ + +For this optimal parameter, the test risk follows from Lemma 1 as + +$$ +\begin{array} { l } { \displaystyle \overline { { R } } ( \hat { \beta } _ { n } ^ { \mathrm { o p t } } ) = \overline { { R } } ( \hat { \beta } _ { n , \lambda _ { n } ^ { \mathrm { o p t } } } ) } \\ { \displaystyle = \frac { \mathbb { E } } { ( \gamma _ { 1 } , \dots \gamma _ { d } ) \sim \Gamma _ { n } } \left[ \sum _ { i = 1 } ^ { d } \frac { \sigma ^ { 2 } } { \gamma _ { i } ^ { 2 } + d \sigma ^ { 2 } / | | \beta ^ { * } | | _ { 2 } ^ { 2 } } \right] + \sigma ^ { 2 } } \end{array} +$$ + +Proof of Theorem 2. We follow a similar proof strategy as in Theorem 1: we invoke singular value interlacing $( \widetilde { \gamma } _ { i } \geq \gamma _ { i } )$ for the data matrix when adding a single sample. We then apply Lemma 1 to eargue that the test risk varies monotonically with the singular values. + +We have + +$$ +{ \overline { { R } } } ( \hat { \beta } _ { n , \lambda } ) = \operatorname * { \mathbb { E } } _ { ( \gamma _ { 1 } , \dots \gamma _ { d } ) \sim \Gamma } [ \sum _ { i } \underbrace { | | \beta ^ { * } | | _ { 2 } ^ { 2 } \lambda ^ { 2 } / d + \sigma ^ { 2 } \gamma _ { i } ^ { 2 } } _ { ( \gamma _ { i } ^ { 2 } + \lambda ) ^ { 2 } } ] +$$ + +and we compute how each term in the sum varies with $\gamma _ { i }$ : + +$$ +\begin{array} { l } { \displaystyle { \frac { \partial } { \partial \gamma _ { i } } \sum _ { i } S ( \gamma _ { i } ) = \frac { \partial } { \partial \gamma _ { i } } S ( \gamma _ { i } ) } } \\ { \displaystyle { \quad = ( \frac { - 2 \gamma _ { i } } { d } ) \frac { 2 | | \beta ^ { * } | | _ { 2 } ^ { 2 } \lambda ^ { 2 } + d \sigma ^ { 2 } ( \gamma _ { i } ^ { 2 } - \lambda ) } { ( \gamma _ { i } ^ { 2 } + \lambda ) ^ { 3 } } } } \end{array} +$$ + +Thus we have + +$$ +\lambda \geq \frac { d \sigma ^ { 2 } } { 2 \vert \vert \beta ^ { * } \vert \vert ^ { 2 } } \implies \frac { \partial } { \partial \gamma _ { i } } S ( \gamma _ { i } ) \leq 0 +$$ + +By the coupling argument in Theorem 1, this implies that the test risk is monotonic: + +$$ +\begin{array} { r l } & { \overline { { R } } ( \hat { \beta } _ { n + 1 , \lambda } ) - \overline { { R } } ( \hat { \beta } _ { n , \lambda } ) } \\ & { \quad = \underset { ( \widetilde { \gamma } _ { 1 } , \dots , \widetilde { \gamma } _ { d } ) \sim \Gamma _ { n + 1 } } { \mathbb { E } } \left[ \displaystyle \sum _ { i = 1 } ^ { d } S ( \widetilde { \gamma } _ { i } ) \right] - \underset { ( \gamma _ { 1 } , \dots , \gamma _ { d } ) \sim \Gamma _ { n } } { \mathbb { E } } \left[ \displaystyle \sum _ { i = 1 } ^ { d } S ( \gamma _ { i } ) \right] } \\ & { \quad = \underset { ( \{ \widetilde { \gamma } _ { i } \} , \{ \gamma _ { i } \} ) \sim \Pi } { \mathbb { E } } \left[ \displaystyle \sum _ { i = 1 } ^ { d } S ( \widetilde { \gamma } _ { i } ) - S ( \gamma _ { i } ) \right] } \\ & { \quad \le 0 } \end{array} +$$ + +where $\Pi$ is the coupling. Line (17) follows from Equation (15), and the fact that the coupling obeys $\widetilde { \gamma } _ { i } \geq \gamma _ { i }$ . □ + +# A.2 PROJECTION MODEL PROOFS + +Lemma 3. For all $\theta \in \mathbb { R } ^ { p }$ , $d , n \in \mathbb { N } ,$ , and $\lambda > 0 ;$ , let $\ b { X } \in \mathbb { R } ^ { n \times p }$ be a matrix with i.i.d. $\mathcal { N } ( 0 , 1 )$ entries. Let $P \in \mathbb { R } ^ { d \times p }$ be a random orthonormal matrix. Define $\widetilde { X } : = X P ^ { T }$ . Let $\left( \gamma _ { 1 } , \dots , \gamma _ { m } \right)$ be the singular values of the data matrix $\tilde { X } \in \mathbb { R } ^ { n \times d }$ , for $m : = \operatorname* { m a x } ( n , d )$ (with $\gamma _ { i } ~ = ~ 0$ for $i > \operatorname* { m i n } ( n , d ) )$ . Let $\Gamma _ { d }$ be the distribution of singular values $\left( \gamma _ { 1 } , \ldots , \gamma _ { m } \right)$ . + +Then, the optimal ridge parameter is constant for all $d$ : $\begin{array} { r } { \lambda _ { d } ^ { \mathrm { o p t } } = \frac { p ^ { 2 } \widetilde \sigma ^ { 2 } } { d | | \theta | | _ { 2 } ^ { 2 } } } \end{array}$ . where we define $\widetilde { \sigma } ^ { 2 } : = \ :$ $\begin{array} { r } { \sigma ^ { 2 } + \frac { p - d } { p } | | \boldsymbol { \theta } | | _ { 2 } ^ { 2 } } \end{array}$ . Moreover, the optimal expected test risk can be written as + +$$ +\overline { { R } } ( \hat { \beta } _ { d } ^ { \mathrm { o p t } } ) = \widetilde { \sigma } ^ { 2 } + \underset { ( \gamma _ { 1 } , \ldots , \gamma _ { m } ) \sim \Gamma _ { d } } { \mathbb { E } } \left[ \sum _ { i = 1 } ^ { p } \frac { \widetilde { \sigma } ^ { 2 } } { \gamma _ { i } ^ { 2 } + \frac { \widetilde { \sigma } ^ { 2 } p ^ { 2 } } { d | | \theta | | _ { 2 } ^ { 2 } } } \right] +$$ + +Proof. This proof follows exactly analogously as the proof of Lemma 2 from Lemma 1, in Section A.1. □ + +Lemma 4. For all $\theta \in \mathbb { R } ^ { p }$ , $d , n \in \mathbb { N } ,$ , and $\lambda > 0$ , let $\ b { X } \in \mathbb { R } ^ { n \times p }$ be a matrix with i.i.d. $\mathcal { N } ( 0 , 1 )$ +entries. Let $P \in \mathbb { R } ^ { d \times p }$ be a random orthonormal matrix. Define $\widetilde X : = X P ^ { T }$ and $\beta ^ { * } : = P \theta$ . + +Let $\left( \gamma _ { 1 } , \dots , \gamma _ { m } \right)$ be the singular values of the data matrix $\tilde { X } \in \mathbb { R } ^ { n \times d }$ , for $m : = \operatorname* { m a x } ( n , d )$ (with $\gamma _ { i } = 0$ for $i > \operatorname* { m i n } ( n , d ) )$ . Let $\Gamma _ { d }$ be the distribution of singular values $\left( \gamma _ { 1 } , \dots , \gamma _ { m } \right)$ . + +Then, the expected test risk is + +$$ +\begin{array} { r l } & { \overline { { R } } ( \hat { \beta } _ { d , \lambda } ) : = \underset { P } { \mathbb { E } } \underset { \widetilde { X } , \widetilde { y } \sim \mathcal { D } ^ { n } } { \mathbb { E } } [ R _ { P } ( \hat { \beta } _ { d , \lambda } ( \widetilde { X } , \overrightarrow { y } ) ] } \\ & { = \sigma ^ { 2 } + ( 1 - \frac { d } { p } ) | | \theta | | _ { 2 } ^ { 2 } } \\ & { + \underset { ( \gamma _ { 1 } , \dotsc , \gamma _ { m } ) \sim \Gamma _ { d } } { \mathbb { E } } \left[ \underset { i = 1 } { \overset { p } { \sum } } \frac { ( \sigma ^ { 2 } + \frac { p - d } { p } | | \theta | | _ { 2 } ^ { 2 } ) \gamma _ { i } ^ { 2 } + \frac { d } { p ^ { 2 } } | | \theta | | _ { 2 } ^ { 2 } \lambda ^ { 2 } } { ( \gamma _ { i } ^ { 2 } + \lambda ) ^ { 2 } } \right] } \end{array} +$$ + +Proof of Lemma 4. We first define the parameter that minimizes the population risk. It follows directly that: + +$$ +\beta _ { P } ^ { * } : = \underset { \beta \in \mathbb { R } ^ { d } } { \mathrm { a r g m i n } } R _ { P } ( \beta ) = P \theta +$$ + +First, we can expand the risk as + +$$ +\begin{array} { r l } & { R ( \hat { \beta } ) = \underset { ( \bar { x } , y ) \sim \mathcal { D } } { \mathbb { E } } [ ( \langle P x , \hat { \beta } \rangle - y ) ^ { 2 } ] } \\ & { \quad = \underset { ( \bar { x } , y ) \sim \mathcal { D } , \eta \sim \mathcal { N } ( 0 , \sigma ^ { 2 } ) } { \mathbb { E } } [ ( \langle x , P ^ { T } \hat { \beta } - \theta \rangle + \eta ) ^ { 2 } ] } \\ & { \quad = \sigma ^ { 2 } + \vert \vert \theta - P ^ { T } \hat { \beta } \vert \vert _ { 2 } ^ { 2 } } \\ & { \quad = \sigma ^ { 2 } + \vert \vert \theta - P ^ { T } \beta ^ { * } \vert \vert _ { 2 } ^ { 2 } + \vert \vert P ^ { T } \beta ^ { * } - P ^ { T } \hat { \beta } \vert \vert _ { 2 } ^ { 2 } } \\ & { \quad + 2 \langle ( \theta - P ^ { T } \beta ^ { * } ) , P ^ { T } \beta ^ { * } - P ^ { T } \hat { \beta } \rangle } \\ & { \quad = \sigma ^ { 2 } + \vert \vert \theta - P ^ { T } \beta ^ { * } \vert \vert _ { 2 } ^ { 2 } + \vert \vert P ^ { T } \beta ^ { * } - P ^ { T } \hat { \beta } \vert \vert _ { 2 } ^ { 2 } } \\ & { \quad = \sigma ^ { 2 } + \vert \vert \vert \theta - P ^ { T } P \theta \vert \vert _ { 2 } ^ { 2 } + \vert \vert \beta ^ { * } - \hat { \beta } \vert \vert _ { 2 } ^ { 2 } } \end{array} +$$ + +The cross terms in Line (22) vanish because the first-order optimality condition for $\beta ^ { * }$ implies that $\beta ^ { * }$ satisfies $P ( \theta ^ { * } - P ^ { T } \beta ^ { * } ) = 0$ . We now simplify each of the two remaining terms. + +First, we have that: + +$$ +\underset { P } { \mathbb { E } } | | \theta - P ^ { T } P \theta | | _ { 2 } ^ { 2 } = ( 1 - \frac { d } { p } ) | | \theta | | _ { 2 } ^ { 2 } +$$ + +since $P ^ { T } P$ is an orthogonal projection onto a random $d$ -dimensional subspace. + +Now, recall we have ${ \vec { y } } = X \theta + \eta$ where $\eta \sim \mathcal { N } ( 0 , \sigma ^ { 2 } I _ { n } )$ . Expand this as: + +$$ +\begin{array} { l } { { \vec { y } = X \theta + \eta } } \\ { { \ = X P ^ { T } P \theta + X ( 1 - P ^ { T } P ) \theta + \eta } } \\ { { \ = \widetilde { X } \beta ^ { * } + \varepsilon + \eta } } \end{array} +$$ + +where $\varepsilon : = X ( 1 - P ^ { T } P ) \theta$ . Note that conditioned on $P$ , the three terms $\widetilde { X } , \varepsilon$ and $\eta$ are conditionally independent, since $P ^ { T } P$ and $( I - P ^ { T } P )$ project $X$ onto orthogonal subspaces. And further, $\varepsilon \sim$ $\mathcal { N } ( \dot { 0 _ { \cdot } } | | ( 1 - P ^ { T } P ) \theta | | ^ { 2 } I _ { n } )$ . + +$$ +\begin{array} { r l } & { \frac { \mathbb { E } } { P } \underset { \tilde { X } , y } { \mathbb { E } } | | \hat { \boldsymbol { \beta } } - \boldsymbol { \beta } ^ { * } | | _ { 2 } ^ { 2 } } \\ & { = \underset { P } { \mathbb { E } } \underset { \tilde { X } , y } { \mathbb { E } } | | ( \widetilde { X } ^ { T } \widetilde { X } + \lambda I ) ^ { - 1 } \widetilde { X } ^ { T } \boldsymbol { y } - \boldsymbol { \beta } ^ { * } | | _ { 2 } ^ { 2 } } \\ & { = \underset { P } { \mathbb { E } } \underset { \tilde { X } , y , \varepsilon , \eta } { \mathbb { E } } | | ( \widetilde { X } ^ { T } \widetilde { X } + \lambda I ) ^ { - 1 } \widetilde { X } ^ { T } ( \widetilde { X } \boldsymbol { \beta } ^ { * } + \varepsilon + \eta ) - \boldsymbol { \beta } ^ { * } | | _ { 2 } ^ { 2 } } \\ & { = \underset { P } { \overset { \mathbb { E } } { \mathbb { X } } } \underset { y , \varepsilon , \eta } { \mathbb { E } } | | ( \widetilde { X } ^ { T } \widetilde { X } + \lambda I ) ^ { - 1 } \widetilde { X } ^ { T } \widetilde { X } \boldsymbol { \beta } ^ { * } - \boldsymbol { \beta } ^ { * } | | _ { 2 } ^ { 2 } } \\ & { = \underset { P } { \overset { \mathbb { E } } { \mathbb { X } } } \underset { y , \varepsilon , \eta } { \mathbb { E } } | | ( \widetilde { X } ^ { T } \widetilde { X } + \lambda I ) ^ { - 1 } \widetilde { X } ^ { T } \widetilde { X } \boldsymbol { \beta } ^ { * } - \boldsymbol { \beta } ^ { * } | | _ { 2 } ^ { 2 } } \\ & { + \| ( \widetilde { X } ^ { T } \widetilde { X } + \lambda I ) ^ { - 1 } \widetilde { X } ^ { T } \varepsilon | | _ { 2 } ^ { 2 } + | | ( \widetilde { X } ^ { T } \widetilde { X } + \lambda I ) ^ { - 1 } \widetilde { X } ^ { T } \eta | | _ { 2 } ^ { 2 } ] } \end{array} +$$ + +Now, since $\widetilde { X }$ is conditionally independent of $\varepsilon$ conditioned on $P$ , + +$$ +\begin{array} { r l } & { \frac { \mathbb { E } } { F } \underset { \tilde { X } , y , \varepsilon | P } { \mathbb { E } } \ \lVert ( \tilde { X } ^ { T } \tilde { X } + \lambda I ) ^ { - 1 } \tilde { X } ^ { T } \varepsilon \rVert _ { 2 } ^ { 2 } } \\ & { = \mathbb { E } \ \underset { \tilde { Y } } { \mathbb { E } } \ [ \lVert ( \tilde { X } ^ { T } \tilde { X } + \lambda I ) ^ { - 1 } \tilde { X } ^ { T } \rVert _ { F } ^ { 2 } \ \underset { \varepsilon | P } { \mathbb { E } } [ \lVert \varepsilon \rVert _ { 2 } ^ { 2 } ] } \\ & { = \frac { \mathbb { E } } { \frac { \mathbb { E } } { \tilde { X } } } \lVert ( \tilde { X } ^ { T } \tilde { X } + \lambda I ) ^ { - 1 } \tilde { X } ^ { T } \rVert _ { F } ^ { 2 } \ \underset { \varepsilon , \varepsilon } { \mathbb { E } } [ \lVert \varepsilon \rVert _ { 2 } ^ { 2 } ] } \\ & { = \underset { \tilde { X } } { \mathbb { E } } [ \lVert ( \tilde { X } ^ { T } \tilde { X } + \lambda I ) ^ { - 1 } \tilde { X } ^ { T } \rVert _ { F } ^ { 2 } ] \cdot \underset { { P } , X } { \mathbb { E } } [ \lVert X ( 1 - P ^ { T } P ) \theta \rVert _ { 2 } ^ { 2 } ] } \\ & { = \underset { \tilde { X } } { \mathbb { E } } [ \lVert ( \tilde { X } ^ { T } \tilde { X } + \lambda I ) ^ { - 1 } \tilde { X } ^ { T } \rVert _ { F } ^ { 2 } ] ( \frac { p - d } { p } | \theta \rVert _ { 2 } ^ { 2 } ) } \end{array} +$$ + +where Line (37) holds because the marginal distribution of $\widetilde { X }$ does not depend on $P$ . + +Similarly, + +$$ +\begin{array} { r l } & { \frac { \mathbb { E } } { P } \underset { \widetilde { X } , y , \eta | P } { \mathbb { E } } | | ( \widetilde { X } ^ { T } \widetilde { X } + \lambda I ) ^ { - 1 } \widetilde { X } ^ { T } \eta | | _ { 2 } ^ { 2 } } \\ & { = \sigma ^ { 2 } \underset { \widetilde { X } } { \mathbb { E } } [ | | ( \widetilde { X } ^ { T } \widetilde { X } + \lambda I ) ^ { - 1 } \widetilde { X } ^ { T } | | _ { F } ^ { 2 } ] } \end{array} +$$ + +Now let $\tilde { \cal X } \ = \ { \cal U } \Sigma { \cal V } ^ { T }$ be the full singular value decomposition of $\widetilde { X }$ , with $U \ \in \ \mathbb { R } ^ { n \times n } , \Sigma \ \in$ $\mathbb { R } ^ { n \times d } , V \in \mathbb { R } ^ { d \times d }$ . Let $( \gamma _ { 1 } , \dots \gamma _ { m } )$ denote the singular values, where $m = \operatorname* { m a x } ( n , d )$ and defining $\gamma _ { i } = 0$ for $i > \operatorname* { m i n } ( n , d )$ . + +Observe that by symmetry, $\widetilde { X } = X P ^ { T }$ and $P$ are independent, because the joint distribution $( \widetilde { X } , P )$ is equivalent to the distribution $( \widetilde { X } Q , P Q )$ for a random orthonormal $Q \in \mathbb { R } ^ { p \times p }$ . Thus $\widetilde { X }$ and + +$\beta ^ { * } = P \theta$ are also independent, and we have: + +$$ +\begin{array} { r l } & { \mathbb { E } \mathbb { E } \| \{ \hat { X } ^ { \prime } \} \hat { X } + \lambda \mathcal { I } \} ^ { - 1 } \hat { X } ^ { \prime } \hat { X } ^ { \prime } - \delta ^ { * } \} \| _ { 2 } ^ { 2 } } \\ & { = \frac { 1 } { b } \mathbb { E } \hat { X } ^ { \prime } \| \mathrm { H i s s } ( \hat { \mathcal { Z } } _ { \frac { e } { 2 } } ^ { - 1 } \lambda ) b ^ { \mathcal { N } / 2 } \| _ { 2 } ^ { 2 } } \\ & { = \mathbb { E } \mathbb { E } \mathbb { E } \mathbb { E } \mathbb { E } \bigg [ \| \mathrm { H i s s } ( \hat { \mathcal { Z } } _ { \frac { e } { 2 } } ^ { - 1 } \lambda ) \| ^ { \mathcal { N } / 2 } b ^ { \mathcal { N } / 2 } \| _ { 2 } ^ { 2 } } \\ & { - \mathbb { E } \mathbb { E } \mathbb { E } \mathbb { E } \bigg [ \| \mathrm { H i s s } ( \hat { \mathcal { Z } } _ { \frac { e } { 2 } } ^ { - 1 } \lambda ) \| ^ { \mathcal { N } / 2 } \bigg ] \| _ { 2 } ^ { 2 } } \\ & { = \mathbb { E } _ { \hat { X } ^ { \prime } \sim \mathrm { N } \times \mathrm { W } ( \hat { \mathcal { Z } } ) } \mathbb { E } \| \mathrm { H i s s } ( \hat { \mathcal { Z } } _ { \frac { e } { 2 } } ^ { - 1 } \lambda ) \| ^ { \mathcal { N } / 2 } } \\ & { = \mathbb { E } \mathbb { E } \| \hat { X } ^ { \prime } \| ^ { 2 } \mathbb { E } \| \mathrm { H } ^ { 2 } \mathbb { E } \bigg [ \mathrm { H } _ { \frac { e } { 2 } } ^ { - 1 } \lambda \Big ] ^ { \| \mathcal { N } / 2 } } \\ & { = \frac { 1 } { b } \mathbb { E } \hat { X } ^ { \prime } \| ^ { 2 } \mathbb { E } \bigg [ \mathcal { P } _ { \frac { e } { 2 } } ^ { - 1 } \frac { \lambda ^ { 2 } } { b } \Big ] ^ { 2 } } \\ & = \frac { 1 } { b } \mathbb { E } \frac { \hat { X } ^ { \prime } } { \| \mathcal { P } \| \mathcal { P } \| ^ { 2 } \| _ { 2 } ^ { 2 } } \mathbb { E } \bigg [ \int _ { 0 } ^ { \mathcal { N } / 2 } \frac { \lambda ^ { 2 } } \| \mathcal { P } \| _ { 2 } ^ { 2 } \end{array} +$$ + +Finally, continuing from Line (33), we can use Lines (38), (40), and (47) to write: + +$$ +\begin{array} { r l } & { \frac { \mathbb { E } } { \rho } \frac { \| \tilde { \rho } - \tilde { \rho } ^ { - 1 } \| ^ { 2 } } { \mathcal { F } _ { x , y } } } \\ & { = ( \sigma ^ { 2 } + \frac { \rho - \tilde { \rho } - d } { p } \| \theta \| _ { 2 } ^ { 2 } \frac { \mathbb { E } \| ( \tilde { X } ^ { \mathcal { T } } \tilde { X } + \lambda I ) ^ { - 1 } \tilde { X } ^ { \mathcal { T } } \| _ { \mathcal { F } _ { x } ^ { 1 } } ^ { 2 } } { \mathcal { F } _ { x } ^ { 1 } } } \\ & { + \frac { d } { \gamma } \| \theta \| _ { 2 } ^ { 2 } \frac { \mathbb { E } } { \varepsilon } \| \sum _ { i } ^ { 2 } \frac { \lambda ^ { 2 } } { ( \sqrt { d } ^ { 2 } + \lambda I ) ^ { 2 } } | } \\ & { = ( \sigma ^ { 2 } + \frac { p - d } { p } \| \theta \| _ { 2 } ^ { 2 } ) \frac { \mathbb { E } } { \Sigma } \frac { \gamma ^ { 2 } } { \varepsilon } \langle \frac { \eta _ { i } ^ { 2 } } { ( \sqrt { d } ^ { 2 } + \lambda I ) ^ { 2 } } | } \\ & { + \frac { d } { \gamma ^ { 2 } } \| \theta \| _ { 2 } ^ { 2 } \frac { \mathbb { E } } { \Sigma } \frac { \lambda ^ { 2 } } { \langle \frac { \eta _ { i } ^ { 2 } + \lambda I \rangle ^ { 2 } } { \varepsilon } } | } \\ & = \frac { \mathbb { E } } { \nu } \langle \frac { ( \sigma ^ { 2 } + \frac { p - d - \tilde { \rho } - \tilde { \rho } - \tilde { \rho } - \tilde { \rho } } { i } ) | \theta \rangle _ { 2 } ^ { 2 } \sqrt { \frac { \lambda ^ { 2 } } { \varepsilon } + \frac { d } { \gamma ^ { 2 } } | \theta | _ { 2 } ^ { 2 } \lambda ^ { 2 } } } \end{array} +$$ + +Now, we can continue from Line (24), and apply lines (25), to conclude: + +$$ +\begin{array} { r l } & { \mathbb { E } \big [ R ( \hat { \beta } ) \big ] = \sigma ^ { 2 } + \mathbb { E } [ | | \theta - P ^ { T } P \theta | | _ { 2 } ^ { 2 } ] + \mathbb { E } [ | | \beta ^ { * } - \hat { \beta } | | _ { 2 } ^ { 2 } ] } \\ & { \qquad = \sigma ^ { 2 } + ( 1 - \frac { d } { p } ) | | \theta | | _ { 2 } ^ { 2 } } \\ & { \qquad + \mathbb { E } \left[ \displaystyle \sum _ { i = 1 } ^ { p } \frac { \big ( \sigma ^ { 2 } + \frac { p - d } { p } | | \theta | | _ { 2 } ^ { 2 } \big ) \gamma _ { i } ^ { 2 } + \frac { d } { p ^ { 2 } } | | \theta | | _ { 2 } ^ { 2 } \lambda ^ { 2 } } { \big ( \gamma _ { i } ^ { 2 } + \lambda \big ) ^ { 2 } } \right] } \end{array} +$$ + +Proof of Theorem 3. This follows analogously to the proof of Theorem 1, Let $\widetilde { X } _ { d }$ and $\widetilde { X } _ { d + 1 }$ be the observed data matrices for $d$ and $d + 1$ e emodel size. As in Theorem 1, there exists a coupling $\Pi$ between the distributions $\Gamma _ { d }$ and $\Gamma _ { d + 1 }$ of the singular values of $\widetilde { X } _ { d }$ and $\widetilde { X } _ { d + 1 }$ such that these singular values are interlaced. + +Thus by Lemma 3, + +$$ +\begin{array} { l } { \overline { { R } } ( \hat { \beta } _ { d } ^ { \mathrm { o p t } } ) = \widetilde { \sigma } ^ { 2 } + \underset { ( \gamma _ { 1 } , \ldots , \gamma _ { m } ) \sim \Gamma _ { d + 1 } } { \mathbb { E } } \left[ \overset { p } { \underset { i = 1 } { \sum } } \frac { \widetilde { \sigma } ^ { 2 } } { \gamma _ { i } ^ { 2 } + \frac { \widetilde { \sigma } ^ { 2 } p ^ { 2 } } { d | \boldsymbol { \theta } | | _ { 2 } ^ { 2 } } } \right] } \\ { \geq \widetilde { \sigma } ^ { 2 } + \underset { ( \widetilde { \gamma } _ { 1 } , \ldots , \widetilde { \gamma } _ { m } ) \sim \Gamma _ { d + 1 } } { \mathbb { E } } \left[ \overset { p } { \underset { i = 1 } { \sum } } \frac { \widetilde { \sigma } ^ { 2 } } { \widetilde { \gamma } _ { i } ^ { 2 } + \frac { \widetilde { \sigma } ^ { 2 } p ^ { 2 } } { d | \boldsymbol { \theta } | | _ { 2 } ^ { 2 } } } \right] } \\ { = \overline { { R } } ( \hat { \beta } _ { d + 1 } ^ { \mathrm { o p t } } ) } \end{array} +$$ + +# A.3 NONISOTROPIC REDUCTION + +Here we observe that results on isotropic regression in Section 2 also imply that ridge regression can be made sample-monotonic even for non-isotropic covariates, if an appropriate regularzier is applied. Specifically, the regularizer depends on the covariance on the inputs. This follows from a general equivalence between the non-isotropic and isotropic problems. + +Lemma 5. For all $n \in \mathbb { N } , d \in \mathbb { N } , \lambda \in \mathbb { R } , \sigma \in \mathbb { R } ,$ covariance $\Sigma \in \mathbb { R } ^ { d \times d }$ , PSD matrix $M \in \mathbb { R } ^ { d \times d }$ and ground-truth $\beta ^ { * } \in \mathbb { R } ^ { d }$ , the following holds. + +Consider the following two problems: + +1. Regularized regression on isotropic covariates, and an $M$ -regularizer. That is, suppose $n$ samples $( x , y )$ are drawn with covariates $x \sim \mathcal { N } ( 0 , I _ { d } )$ and response $y = \langle \beta ^ { * } , x \rangle +$ $\mathcal { N } ( 0 , \bar { \sigma } ^ { 2 } )$ . Let $\ b { \hat { X } } \in \mathbb { R } ^ { n \times d }$ be the matrix of covariates, and $\vec { y }$ the vector of responses. Consider + +$$ +{ \hat { \beta } } _ { \lambda } : = \operatorname * { a r g m i n } _ { \beta } | | X \beta - { \vec { y } } | | _ { 2 } ^ { 2 } + \lambda | | \beta | | _ { M } ^ { 2 } +$$ + +Let $\overline { { R } } = \mathbb { E } _ { X , y } [ | | \hat { \beta } - \beta ^ { * } | | _ { 2 } ^ { 2 } ] + \sigma ^ { 2 }$ be the expected test risk of the above estimator. + +2. Regularized regression with covariance $\Sigma$ , and an $( \Sigma ^ { 1 / 2 } M \Sigma ^ { 1 / 2 } )$ -regularizer. That is, suppose $n$ samples $( \widetilde { x } , y )$ are drawn with covariates $\widetilde { x } \sim \mathcal { N } ( 0 , \Sigma )$ and response $y =$ $\langle z ^ { \ast } , \widetilde { x } \rangle + \mathcal { N } ( 0 , \widetilde { \sigma } ^ { 2 } )$ e, for + +$$ +z ^ { * } = \Sigma ^ { - 1 / 2 } \beta ^ { * } +$$ + +Let $\widetilde { X } \in \mathbb { R } ^ { n \times d }$ be the matrix of covariates, and $\vec { y }$ the vector of responses. Consider + +$$ +\hat { z } _ { \lambda } : = \operatorname * { a r g m i n } _ { z } | | \widetilde { X } z - \vec { y } | | _ { 2 } ^ { 2 } + \lambda | | z | | _ { \Sigma ^ { 1 / 2 } M \Sigma ^ { 1 / 2 } } ^ { 2 } +$$ + +Let $\widetilde { R } = \mathbb { E } _ { \widetilde { X } , y } [ | | \hat { z } - z ^ { * } | | _ { \Sigma } ^ { 2 } ] + \sigma ^ { 2 }$ be the expected test risk of the above estimator. + +Then, the expected test risks of the above two problems are identical: + +$$ +\overline { { R } } = \widetilde { R } +$$ + +Proof of Lemma 5. The distribution of $\widetilde { X }$ in the Problem 2 is equivalent to $X \Sigma ^ { 1 / 2 }$ , where $X$ is as in Problem 1. Thus, the two settings are equivalent by the change-of-variable $\beta = \Sigma ^ { 1 / 2 } z$ . Specifically, + +$$ +\begin{array} { r l } & { \hat { z } _ { \lambda } : = \underset { z } { \mathrm { a r g m i n } } \left| \lvert \tilde { X } z - \bar { y } \rvert \right| _ { 2 } ^ { 2 } + \lambda \lvert | z \rvert | _ { \Sigma ^ { 1 / 2 } M \Sigma ^ { 1 / 2 } } ^ { 2 } } \\ & { = \underset { z } { \mathrm { a r g m i n } } \left| \lvert X \Sigma ^ { 1 / 2 } z - \bar { y } \rvert \right| _ { 2 } ^ { 2 } + \lambda z ^ { T } \Sigma ^ { 1 / 2 } M \Sigma ^ { 1 / 2 } z } \\ & { = \underset { z } { \mathrm { a r g m i n } } \left| \lvert X \Sigma ^ { 1 / 2 } z - \bar { y } \rvert \right| _ { 2 } ^ { 2 } + \lambda z ^ { T } \Sigma ^ { 1 / 2 } M \Sigma ^ { 1 / 2 } z } \\ & { = \Sigma ^ { - 1 / 2 } \underset { \beta = \Sigma ^ { 1 / 2 } z } { \mathrm { a r g m i n } } \left| \lvert X \beta - \bar { y } \rvert \right| _ { 2 } ^ { 2 } + \lambda \beta ^ { T } M \beta } \end{array} +$$ + +Further, the response $\langle z ^ { * } , { \widetilde { x } } \rangle = \langle \beta , x \rangle$ , and the test risk transforms identically: + +$$ +\begin{array} { r } { \widetilde { R } = \underset { \widetilde { X } , y } { \mathbb { E } } \left[ \vert \vert \hat { z } - z ^ { * } \vert \vert _ { \Sigma } ^ { 2 } \right] + \sigma ^ { 2 } } \\ { = \underset { X , y } { \mathbb { E } } \left[ \vert \vert \hat { \beta } - \beta ^ { * } \vert \vert _ { 2 } ^ { 2 } \right] + \sigma ^ { 2 } } \\ { = \overline { { R } } } \end{array} +$$ + +This implies that if the covariance $\Sigma$ is known, then ridge regression with a $\Sigma ^ { - 1 }$ regularizer is sample-monotonic. + +Theorem 5. For all $n \in \mathbb { N } , d \in \mathbb { N } , \sigma \in \mathbb { R } ,$ , covariance $\Sigma \in \mathbb { R } ^ { d \times d }$ , and ground-truths $\beta ^ { * } \in \mathbb { R } ^ { d }$ , th e following holds. + +Suppose $n$ samples $( x , y )$ are drawn with covariates $x \sim \mathcal { N } ( 0 , \Sigma )$ and response $y = \langle \beta ^ { * } , x \rangle +$ ${ \mathcal { N } } ( 0 , \sigma ^ { 2 } )$ . Let $\ b { X } \in \mathbb { R } ^ { n \times d }$ be the matrix of covariates, and $\vec { y }$ the vector of responses. For $\lambda > 0$ , consider the ridge regression estimator with $\Sigma ^ { - 1 }$ -regularizer: + +$$ +\hat { \beta } _ { n , \lambda } : = \operatorname * { a r g m i n } _ { \boldsymbol { \beta } } \| X \boldsymbol { \beta } - \vec { y } \| _ { 2 } ^ { 2 } + \lambda \| \boldsymbol { \beta } \| _ { \Sigma ^ { - 1 } } ^ { 2 } +$$ + +Let $\overline { { R } } ( \hat { \beta } _ { n , \lambda } ) : = \mathbb { E } _ { \hat { \beta } } \| \hat { \beta } - \beta ^ { * } \| _ { \Sigma } + \sigma ^ { 2 }$ be the expected test risk of the above estimator. Let $\lambda _ { n } ^ { \mathrm { o p t } }$ be the optimal ridge parameter (that achieves the minimum expected risk) given $n$ samples: + +$$ +\lambda _ { n } ^ { \mathrm { o p t } } : = \operatorname * { a r g m i n } _ { \lambda } \overline { { R } } ( \hat { \beta } _ { n , \lambda } ) ) +$$ + +And let $\hat { \beta } _ { n } ^ { \mathrm { { o p t } } }$ be the estimator that corresponds to the $\lambda _ { n } ^ { \mathrm { o p t } }$ . Then, the expected test risk of optimallyregularized linear regression is monotonic in samples: + +$$ +\overline { { R } } ( \hat { \beta } _ { n + 1 } ^ { \mathrm { o p t } } ) \leq \overline { { R } } ( \hat { \beta } _ { n } ^ { \mathrm { o p t } } ) +$$ + +Proof. This follows directly by applying the reduction in Lemma 5 for $M = I _ { d }$ to reduce to the isotropic case, and then applying the monotonicity of isotropic regression from Theorem 1. □ + +# A.4 ADDITIONAL PLOTS + +We apply random features to Fashion-MNIST Xiao et al. (2017), an image classification problem with 10 classes. Input images $x \in \mathbb { R } ^ { d }$ are normalized and flattened to $[ - \bar { 1 } , 1 ] ^ { d }$ for $d = 7 8 4$ . Class labels are encoded as one-hot vectors $y \in \{ \vec { e _ { 1 } } , \dots e _ { 1 0 } ^ { } \} \subset \mathbb { R } ^ { 1 0 }$ . + +# B TOWARDS MONOTONICITY WITH GENERAL COVARIATES + +Here we investigate whether monotonicity provably holds in more general models, inspired by the experimental results. As a first step, we consider Gaussian (but not isotropic) covariances and homeostatic noise. That is, we consider ridge regression in the setting of Section 2, but with $x \sim \mathcal { N } ( 0 , \Sigma )$ , and $y \sim \langle x , \beta ^ { * } \rangle + N ( 0 , \sigma ^ { 2 } )$ . In this section, we observe that ridge regression can be made sample-monotonic with a modified regularizer. We also conjecture that ridge regression is sample-monotonic without modifying the regularizer, and we outline a potential proof strategy along with numerical evidence. + +# B.1 ADAPTIVE REGULARIZATION + +The results on isotropic regression in Section 2 imply that ridge regression can be made samplemonotonic even for non-isotropic covariates, if an appropriate regularizer is applied. Specifically, the appropriate regularizer depends on the covariance of the inputs. For $\boldsymbol { x } \sim \mathcal { N } ( 0 , \Sigma )$ , the following estimator is sample-monotonic for optimally-tuned $\lambda$ : $\begin{array} { r } { \hat { \beta } _ { n , \lambda } : = \operatorname * { a r g m i n } _ { \boldsymbol { \beta } } \| X \boldsymbol { \beta } - \vec { y } \| _ { 2 } ^ { 2 } + \lambda \| \boldsymbol { \beta } \| _ { \Sigma ^ { - 1 } } ^ { 2 } } \end{array}$ . This follows directly from Theorem 1 by applying a change-of-variable; full details of this equivalence are in Section A.3. Note that if the population covariance $\Sigma$ is not known, it can potentially be estimated from unlabeled data. + +![](images/6d706f197addd390fb2defce66fd1cd5af413a8242fbc58ab89186d03af9186f.jpg) +Test Error for Regularized Random Features + +(a) Test Classification Error vs. Number of Training Samples. + +![](images/ce3f799d5bd5415e26ca617c4e47e654875a8b6c2557b5bf3b3c7007b6a14a4f.jpg) +Test Errorfor Regularized Random Features +(b) Test Classification Error vs. Model Size (Number of Random Features). + +Figure 4: Double-descent for Random ReLU Features. Test classification error as a function of model size and sample size for Random ReLU Features on Fashion-MNIST. Left: with $D = 5 0 0$ features. Right: with $n = 5 0 0$ samples. See Figures 7, 8 for the corresponding test Mean Squared Error. See Appendix D of Nakkiran et al. (2020) for the performance of these unregularized models plotted across Num. Samples $\times$ Model Size simultaneously. + +![](images/05df2a46592e323dc1205edaa5fa11d2355d7bba6df96212a7b9f700cd4a121b.jpg) +Figure 5: Train Error vs. Model Size for 5-layer CNNs on CIFAR-100, with $\ell _ { 2 }$ regularization (weight decay). + +# B.2 TOWARDS PROVING MONOTONICITY + +We conjecture that optimally-regularized ridge regression is sample-monotonic for non-isotropic covariates, even without modifying the regularizer (as suggested by the experiment in Figure 2). We derive a sufficient condition for monotonicity, which we have numerically verified in a variety of instances. Specifically, we conjecture the following. + +Conjecture 1. For all $d \in \mathbb { N }$ , and all PSD covariances $\Sigma \in \mathbb { R } ^ { d \times d }$ , consider the distribution on $( x , y )$ where $x \sim \mathcal { N } ( 0 , \Sigma )$ , and $y \sim \langle x , \beta ^ { * } \rangle + \mathcal { N } ( 0 , \sigma ^ { 2 } )$ . Then, we conjecture that the expected test risk of the ridge regression estimator: $\begin{array} { r } { \hat { \beta } _ { n , \lambda } : = \operatorname * { a r g m i n } _ { \boldsymbol { \beta } } \| X { \boldsymbol { \beta } } - \vec { y } \| _ { 2 } ^ { 2 } + \lambda \| { \boldsymbol { \beta } } \| _ { 2 } ^ { 2 } } \end{array}$ for optimally-tuned $\lambda \geq 0$ , is monotone non-increasing in number of samples $n$ . That is, for all $n \in \mathbb { N }$ , + +$$ +\operatorname * { i n f } _ { \lambda \geq 0 } \overline { { { R } } } ( \hat { \beta } _ { n + 1 , \lambda } ) \leq \operatorname * { i n f } _ { \lambda \geq 0 } \overline { { { R } } } ( \hat { \beta } _ { n , \lambda } ) +$$ + +where we define $\begin{array} { r } { \hat { \beta } _ { n , 0 } : = \operatorname* { l i m } _ { \lambda \to 0 + } \hat { \beta } _ { n , \lambda } = X ^ { \dagger } y } \end{array}$ . + +![](images/d4048491df9a41611fd80fea0aeac569328ee316a77886c71b4c9d4ba9170d40.jpg) +Figure 6: Train MSE vs. Num. Samples for Non-Isotropic Ridge Regression in $d = 3 0$ dimensions, in the setting of Figure 2. Plotting train MSE: $\begin{array} { r } { \frac { 1 } { n } | | X \hat { \boldsymbol { \beta } } - \vec { y } | | _ { 2 } ^ { 2 } } \end{array}$ . + +![](images/aa84a8ffbd2beefb1d745ab29a4ccc613c56c1dfa1eef8d51380a0483dcffecb.jpg) +Figure 7: Test Mean Squared Error vs. Num Train Samples for Random ReLU Features on FashionMNIST, with $D = 5 0 0$ features. + +In Appendix B.3 we present a technical conjecture in random matrix theory (Conjecture 2) which suffices to prove Conjecture 1. Proving this Conjecture 2 presents a number of technical challenges, but we have numerically verified it in a variety of cases. It can also be shown that Conjecture 2 is true when $Q = I$ , corresponding to isotropic covariates. We prove the reduction between Conjecture 2 and 1 in Appendix B.3. + +# B.3 MONOTONICITY CONJECTURE PROOFS + +In order to establish Conjecture 1, it is sufficient to prove the following technical conjecture. + +![](images/8eda0db61a5bd63cb07df9565b6981c5a80a7fd865e013f9ce281e419515418e.jpg) +Figure 8: Test Mean Squared Error vs. Num Features for Random ReLU Features on FashionMNIST, with $n = 5 0 0$ samples. + +Conjecture 2. For all $n \in \mathbb { N } , d \geq n , \lambda > 0$ , symmetric positive definite matrix $Q \in \mathbb { R } ^ { d \times d }$ , the following holds. + +Define + +$$ +G _ { \lambda } ^ { n } : = \lambda ^ { 2 } \underset { X } { \mathbb { E } } [ ( X ^ { T } X + \lambda Q ) ^ { - 2 } ] +$$ + +where $\ b { X } \in \mathbb { R } ^ { n \times d }$ is sampled with each entry i.i.d. $\mathcal { N } ( 0 , 1 )$ . Similarly, define + +$$ +H _ { \lambda } ^ { n } : = \mathbb { E } [ | | X ^ { T } X + \lambda Q ) ^ { - 1 } X ^ { T } | | _ { F } ^ { 2 } ] +$$ + +The expected test risk for $n$ samples can be expressed as: + +$$ +\overline { { { R } } } ( \hat { \beta } _ { n , \lambda } ) = ( \beta ^ { * } ) ^ { T } G _ { \lambda } ^ { n } \beta ^ { * } + \sigma ^ { 2 } H _ { \lambda } ^ { n } + \sigma ^ { 2 } +$$ + +Then, we conjecture that the following two conditions hold. + +1. + +$$ +G _ { \lambda } ^ { n } \succeq G _ { \lambda } ^ { n + 1 } +$$ + +2. + +$$ +( G _ { \lambda } ^ { n } - G _ { \lambda } ^ { n + 1 } ) - ( H _ { \lambda } ^ { n } - H _ { \lambda } ^ { n + 1 } ) \frac { d G _ { \lambda } ^ { n } / d \lambda } { d H _ { \lambda } ^ { n } / d \lambda } \succeq 0 +$$ + +Lemma 6. Conjecture 2 implies Conjecture $^ { l }$ + +Proof. By the reduction in Section A.3, showing monotonicity for non-isotropic regression with an isotropic regularizer is equivalent to showing monotonicity for isotropic regression with a nonisotropic regularizer. Thus, we consider the latter. Specifically, Conjecture 1 is equivalent to showing monotonicity for the estimator + +$$ +\begin{array} { r l } { { \hat { \beta } _ { n , \lambda } : = \operatorname * { a r g m i n } _ { \beta } \| X \beta - \vec { y } \| _ { 2 } ^ { 2 } + \lambda \| \beta \| _ { \Sigma ^ { - 1 } } ^ { 2 } } } \\ & { = ( X ^ { T } X + \lambda \Sigma ^ { - 1 } ) ^ { - 1 } X ^ { T } y } \end{array} +$$ + +where $x \sim \mathcal { N } ( 0 , I )$ is isotropic, and $y \sim \langle x , \beta ^ { * } \rangle + \mathcal { N } ( 0 , \sigma ^ { 2 } )$ . + +Now, letting $\boldsymbol { Q } : = \boldsymbol { \Sigma } ^ { - 1 }$ , the expected test risk of this estimator for $n$ samples is: + +$$ +\begin{array} { r l } & { \mathbb { E } [ \left. \hat { \beta } _ { n , \lambda } \right. = \underset { X , y } { \mathbb { E } } [ \left. \hat { \beta } _ { n , \lambda } - \beta ^ { * } \right. _ { 2 } ^ { 2 } ] + \sigma ^ { 2 } } \\ & { \quad = \underset { X , y } { \mathbb { E } } [ \left. ( X ^ { T } X + \lambda Q ) ^ { - 1 } X ^ { T } y - \beta ^ { * } \right. _ { 2 } ^ { 2 } ] + \sigma ^ { 2 } } \\ & { \quad = \underset { X , \eta = N ; 0 } { \mathbb { E } } [ \left. ( X ^ { T } X + \lambda Q ) ^ { - 1 } X ^ { T } ( X \beta ^ { * } + \eta ) - \beta ^ { * } \right. _ { 2 } ^ { 2 } ] + \sigma ^ { 2 } } \\ & { \quad = \underset { X , \eta = N ; 0 } { \mathbb { E } } [ ( 0 , \lambda ^ { 2 } Y ^ { T } \eta _ { n } ^ { 2 } ) ] \left. ( X ^ { T } X + \lambda Q ) ^ { - 1 } X ^ { T } ( X \beta ^ { * } + \eta ) - \beta ^ { * } \right. _ { 2 } ^ { 2 } ] + \sigma ^ { 2 } } \\ & { \quad = \underset { X } { \mathbb { E } } [ \left. ( X ^ { T } X + \lambda Q ) ^ { - 1 } X ^ { T } X \beta ^ { * } - \beta ^ { * } ) \right. _ { 2 } ^ { 2 } ] + \sigma ^ { 2 } \underset { X } { \mathbb { E } } [ \left. ( X ^ { T } X + \lambda Q ) ^ { - 1 } X ^ { T } \right. _ { F } ^ { 2 } ] + \sigma ^ { 2 } } \\ & { \quad = \underset { X } { \mathbb { E } } [ \left. ( X ^ { T } X + \lambda Q ) ^ { - 1 } ( X ^ { T } X + \lambda Q - \lambda Q ) \beta ^ { * } - \beta ^ { * } ) \right. _ { 2 } ^ { 2 } ] + \sigma ^ { 2 } \underset { X } { \mathbb { E } } [ \left. ( X ^ { T } X + \lambda Q ) ^ { - 1 } X ^ { T } \right. _ { F } ^ { 2 } ] } \\ & \quad = \lambda ^ { 2 } \underset { X } { \mathbb { E } } [ \left. ( X ^ { T } X + \lambda Q ) ^ { - 1 } \right. _ { 2 } ^ { 2 } ] + \sigma ^ { 2 } \underset { X } { \mathbb { E } } [ \left. ( X ^ { T } X + \lambda Q ) ^ { - 1 } X ^ { T } \right. _ { F } ^ { 2 } ] + \sigma \end{array} +$$ + +Consider the infimum + +$$ +\operatorname* { i n f } _ { \lambda \geq 0 } { \overline { { R } } } ( { \hat { \beta } } _ { n , \lambda } ) +$$ + +We consider several cases below. + +Case (1). Suppose the infimum in Equation 71 is achieved in the limit $\lambda \to + \infty$ . In this case, monotonicity trivially holds, since + +$$ +\operatorname* { l i m } _ { \lambda \to \infty } \overline { { { R } } } ( \hat { \beta } _ { n , \lambda } ) = \overline { { { R } } } ( \vec { 0 } ) = \operatorname* { l i m } _ { \lambda \to \infty } \overline { { { R } } } ( \hat { \beta } _ { n + 1 , \lambda } ) +$$ + +Case (2). Suppose the infimum in Equation 71 is achieved by some $\lambda = \lambda _ { n } ^ { \mathrm { o p t } }$ in the interior of the set $( 0 , \infty )$ . + +Because $\overline { { R } } ( \hat { \beta } _ { n , \lambda } )$ is continuous and differentiable in $\lambda$ for all $\lambda \in ( 0 , \infty )$ , we have that $\lambda _ { n } ^ { \mathrm { o p t } }$ must satisfy the following first-order optimality condition: + +$$ +\begin{array} { r } { \frac { d \overline { { R } } ( \hat { \beta } _ { n , \lambda } ) } { d \lambda } \Big | _ { \lambda = \lambda _ { n } ^ { \mathrm { o p t } } } = 0 } \\ { \implies ( \beta ^ { * } ) ^ { T } \frac { d G _ { \lambda } ^ { n } } { d \lambda } \beta ^ { * } + \sigma ^ { 2 } \frac { d H _ { \lambda } ^ { n } } { d \lambda } \Big | _ { \lambda = \lambda _ { n } ^ { \mathrm { o p t } } } = 0 } \end{array} +$$ + +We will later use this condition to show monotonicity. + +Case (3). Suppose the infimum in Equation 71 is achieved at $\lambda _ { n } ^ { \mathrm { o p t } } = 0$ . Recall, we define $\hat { \beta } _ { n , 0 } : =$ $\mathrm { l i m } _ { \lambda \to 0 + } \hat { \beta } _ { n , \lambda }$ . This means that, + +$$ +\frac { d \overline { { R } } ( \hat { \beta } _ { n , \lambda } ) } { d \lambda } \Big | _ { \lambda = 0 } = ( \beta ^ { * } ) ^ { T } \frac { d G _ { \lambda } ^ { n } } { d \lambda } \beta ^ { * } + \sigma ^ { 2 } \frac { d H _ { \lambda } ^ { n } } { d \lambda } \Big | _ { \lambda = 0 } \geq 0 +$$ + +Note that since $\begin{array} { r } { \frac { d H _ { \lambda } ^ { n } } { d \lambda } \leq 0 } \end{array}$ , both Equations (73) and (74) in Case (2) and Case (3) respectively imply that + +$$ +\sigma ^ { 2 } \leq - \frac { ( \beta ^ { * } ) ^ { T } ( \frac { d G _ { \lambda } ^ { n } } { d \lambda } ) \beta ^ { * } } { d H _ { \lambda } ^ { n } / d \lambda } \Big \vert _ { \lambda = \lambda _ { n } ^ { \mathrm { o p t } } } +$$ + +Now, assuming Conjecture 2, we will show that the choice of $\lambda _ { n } ^ { \mathrm { o p t } }$ in Cases (2) and (3) has nonincreasing test risk for $( n + 1 )$ samples. That is, + +$$ +\overline { { R } } ( \widehat { \beta } _ { n , \lambda _ { n } ^ { \mathrm { o p t } } } ) \geq \overline { { R } } ( \widehat { \beta } _ { n + 1 , \lambda _ { n } ^ { \mathrm { o p t } } } ) +$$ + +This implies the desired monotonicity, since R(βˆn+1,λoptn ) ≥ R(βˆn+1,λoptn+1 ). + +We first consider the case when $H _ { \lambda } ^ { n } - H _ { \lambda } ^ { n + 1 } | _ { \lambda = \lambda _ { n } ^ { \mathrm { o p t } } } \geq 0$ . In this case, because $G _ { \lambda } ^ { n } - G _ { \lambda } ^ { n + 1 } \succeq 0$ by assumption, we have + +$$ +\begin{array} { r l r } { { \overline { { R } } ( \widehat { \beta } _ { n , \lambda _ { n } ^ { \mathrm { o p t } } } ) - \overline { { R } } ( \widehat { \beta } _ { n + 1 , \lambda _ { n } ^ { \mathrm { o p t } } } ) = ( \beta ^ { * } ) ^ { T } ( G _ { \lambda } ^ { n } - G _ { \lambda } ^ { n + 1 } ) \beta ^ { * } + \sigma ^ { 2 } ( H _ { \lambda } ^ { n } - H _ { \lambda } ^ { n + 1 } ) \Big | _ { \lambda = \lambda _ { n } ^ { \mathrm { o p t } } } } } \\ & { } & { \geq 0 \quad \quad } \end{array} +$$ + +Otherwise, assume. $H _ { \lambda } ^ { n } - H _ { \lambda } ^ { n + 1 } | _ { \lambda = \lambda _ { n } ^ { \mathrm { o p t } } } \leq 0$ . Then we have: + +$$ +\begin{array} { r l } { \overline { { R } } ( \hat { \beta } _ { n , \lambda _ { n } ^ { \smash { \mathrm { o u t } } } } ) - \overline { { R } } ( \hat { \beta } _ { n + 1 , \lambda _ { n } ^ { \smash { \mathrm { o u t } } } } ) = ( \beta ^ { * } ) ^ { T } ( G _ { \lambda } ^ { m } - G _ { \lambda } ^ { m + 1 } ) \beta ^ { * } + \sigma ^ { 2 } ( H _ { \lambda } ^ { n } - H _ { \lambda } ^ { n + 1 } ) \Big | _ { \lambda = \lambda _ { n } ^ { \smash { \mathrm { o u t } } } } } & { \qquad \mathrm { ( } } \\ & { \qquad \geq ( \beta ^ { * } ) ^ { T } ( G _ { \lambda } ^ { m } - G _ { \lambda } ^ { m + 1 } ) \beta ^ { * } - ( \beta ^ { * } ) ^ { T } ( \frac { d G _ { \lambda } ^ { n } } { d \lambda } ) \beta ^ { * } \frac { ( H _ { \lambda } ^ { n } - H _ { \lambda } ^ { n + 1 } ) } { d H _ { \lambda } ^ { \lambda } / d \lambda } \Big | _ { \lambda = \lambda _ { n } ^ { \smash { \mathrm { o u t } } } } } \\ & { \qquad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad } \\ & { = ( \beta ^ { * } ) ^ { T } \underbrace { \Bigg ( ( G _ { \lambda } ^ { m } - G _ { \lambda } ^ { n + 1 } ) - ( H _ { \lambda } ^ { n } - H _ { \lambda } ^ { n + 1 } ) \frac { d G _ { \lambda } ^ { m } / d \lambda } { d H _ { \lambda } ^ { n } / d \lambda } \Big ) \Big | _ { \lambda = \lambda _ { n } ^ { \mathrm { o u t } } } \beta ^ { * } } _ { \geq 0 \mathrm { b y c o n j e c u r e 2 } } } \\ & { \qquad \quad \quad \quad \quad \quad \quad \quad \quad \geq 0 } \end{array} +$$ + +as desired. \ No newline at end of file diff --git a/parse/train/7R7fAoUygoa/7R7fAoUygoa_content_list.json b/parse/train/7R7fAoUygoa/7R7fAoUygoa_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..0deaeb37c666af79c1b5e1ae5b69dedfe0dbf22a --- /dev/null +++ b/parse/train/7R7fAoUygoa/7R7fAoUygoa_content_list.json @@ -0,0 +1,3247 @@ +[ + { + "type": "text", + "text": "OPTIMAL REGULARIZATION CAN MITIGATE DOUBLE DESCENT ", + "text_level": 1, + "bbox": [ + 176, + 99, + 823, + 145 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Preetum Nakkiran \nHarvard University \npreetum@cs.harvard.edu \nPrayaag Venkat \nHarvard University \npvenkat@g.harvard.edu ", + "bbox": [ + 183, + 170, + 401, + 212 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "", + "bbox": [ + 606, + 171, + 813, + 212 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Sham Kakade ", + "text_level": 1, + "bbox": [ + 184, + 234, + 284, + 247 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Microsoft Research & University of Washington sham@cs.washington.edu ", + "bbox": [ + 184, + 248, + 501, + 275 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Tengyu Ma \nStanford University \ntengyuma@stanford.edu ", + "bbox": [ + 563, + 234, + 771, + 275 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 313, + 544, + 327 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Recent empirical and theoretical studies have shown that many learning algorithms – from linear regression to neural networks – can have test performance that is non-monotonic in quantities such the sample size and model size. This striking phenomenon, often referred to as “double descent”, has raised questions of if we need to re-think our current understanding of generalization. In this work, we study whether the double-descent phenomenon can be avoided by using optimal regularization. Theoretically, we prove that for certain linear regression models with isotropic data distribution, optimally-tuned $\\ell _ { 2 }$ regularization achieves monotonic test performance as we grow either the sample size or the model size. We also demonstrate empirically that optimally-tuned $\\ell _ { 2 }$ regularization can mitigate double descent for more general models, including neural networks. Our results suggest that it may also be informative to study the test risk scalings of various algorithms in the context of appropriately tuned regularization. ", + "bbox": [ + 233, + 344, + 764, + 523 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 551, + 336, + 568 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Recent works have demonstrated a ubiquitous “double descent” phenomenon present in a range of machine learning models, including decision trees, random features, linear regression, and deep neural networks (Opper, 1995; 2001; Advani & Saxe, 2017; Spigler et al., 2018; Belkin et al., 2018; Geiger et al., 2019b; Nakkiran et al., 2020; Belkin et al., 2019; Hastie et al., 2019; Bartlett et al., 2019; Muthukumar et al., 2019; Bibas et al., 2019; Mitra, 2019; Mei & Montanari, 2019; Liang & Rakhlin, 2018; Liang et al., 2019; Xu & Hsu, 2019; Derezinski et al., 2019; Lampinen & Ganguli, ´ 2018; Deng et al., 2019; Nakkiran, 2019). The phenomenon is that models exhibit a peak of high test risk when they are just barely able to fit the train set, that is, to interpolate. For example, as we increase the size of models, test risk first decreases, then increases to a peak around when effective model size is close to the training data size, and then decreases again in the overparameterized regime. Also surprising is that Nakkiran et al. (2020) observe a double descent as we increase sample size, i.e. for a fixed model, training the model with more data can hurt test performance. ", + "bbox": [ + 174, + 583, + 825, + 750 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "These striking observations highlight a potential gap in our understanding of generalization and an opportunity for improved methods. Ideally, we seek to use learning algorithms which robustly improve performance as the data or model size grow and do not exhibit such unexpected nonmonotonic behaviors. In other words, we aim to improve the test performance in situations which would otherwise exhibit high test risk due to double descent. Here, a natural strategy would be to use a regularizer and tune its strength on a validation set. This motivates the central question of this work: ", + "bbox": [ + 174, + 757, + 823, + 853 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "When does optimally tuned regularization mitigate or remove the double-descent phenomenon? ", + "bbox": [ + 186, + 867, + 810, + 882 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Another motivation is the fact that double descent is largely observed for unregularized or under regularized models in practice. As an example, Figure 1 shows a simple linear ridge regression setting in which the unregularized estimator exhibits double descent, but an optimally-tuned regularizer has monotonic test performance. ", + "bbox": [ + 178, + 895, + 818, + 924 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/b5edb5b47ed8f04264d90917cb098c4913b1a417a4d6db231609364ffb35c0c9.jpg", + "image_caption": [ + "Figure 1: Test Risk vs. Num. Samples for Isotropic Ridge Regression in $d \\_ =$ 500 dimensions. Unregularized regression is non-monotonic in samples, but optimallyregularized regression $( \\lambda = \\lambda _ { o p t } )$ is monotonic. In this setting, the optimal regularizer $\\lambda _ { o p t }$ does not depend on number of samples $n$ (Lemma 2), but this is not always true – see Figure 2. " + ], + "image_footnote": [], + "bbox": [ + 204, + 106, + 483, + 321 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 352, + 823, + 381 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Our Contributions: We study this question from both a theoretical and empirical perspective. Theoretically, we start with the setting of high-dimensional linear regression. Linear regression is a sensible starting point to study these questions, since it already exhibits many of the qualitative features of double descent in more complex models (e.g. Belkin et al. (2019); Hastie et al. (2019) and further related works in Section 1.1). Our work shows that optimally-tuned ridge regression can achieve both sample-wise monotonicity and model-size-wise monotonicity under certain assumptions. Concretely, we show ", + "bbox": [ + 173, + 395, + 825, + 492 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "1. Sample-wise monotonicity: In the setting of well-specified linear regression with isotropic features/covariates (Figure 1), we prove that optimally-tuned ridge regression yields monotonic test performance with increasing samples. That is, more data never hurts for optimally-tuned ridge regression. (See Theorem 1). ", + "bbox": [ + 173, + 500, + 825, + 555 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2. Model-wise monotonicity: We consider a setting where the input/covariate lives in a highdimensional ambient space with isotropic covariance. Given a fixed model size $d$ (which might be much smaller than ambient dimension), we consider the family of models which first project the input to a random $d$ -dimensional subspace, and then compute a linear function in this projected “feature space.” (This is nearly identical to models of double-descent considered in Hastie et al. (2019, Section 5.1)). We prove that in this setting, as we grow the model-size, optimally-tuned ridge regression over the projected features has monotone test performance. That is, with optimal regularization, bigger models are always better or the same. (See Theorem 3). ", + "bbox": [ + 173, + 563, + 825, + 674 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "3. Monotonicity in the real-world: We also demonstrate several richer empirical settings where optimal $\\ell _ { 2 }$ regularization induces monotonicity, including random feature classifiers and convolutional neural networks. This suggests that the mitigating effect of optimal regularization may hold more generally in broad machine learning contexts. (See Section 5). ", + "bbox": [ + 174, + 680, + 825, + 736 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "A few remarks are in order: ", + "bbox": [ + 176, + 743, + 354, + 757 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Problem-specific vs Minimax and Bayesian. It is worth noting that our results hold for all linear ground-truths, rather than holding for only the worst-case ground-truth or a random ground-truth. Indeed, the minimax optimal estimator or the Bayes optimal estimator are both trivially sample-wise and model-wise monotonic with respect to the minimax risk or the Bayes risk. However, they do not guarantee monotonicity of the risk itself for a given fixed problem. In particular, there exist minimax optimal estimators which are not sample-monotonic in the sense we desire. ", + "bbox": [ + 174, + 763, + 825, + 847 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Universal vs Asymptotic. We also remark that our analysis is not only non-asymptotic but also works for all possible input dimensions, model sizes, and sample sizes. To our knowledge, the results herein are the first non-asymptotic sample-wise and model-wise monotonicity results for linear regression. (See discussion of related works Hastie et al. (2019); Mei & Montanari (2019) for related results in the asymptotic setting). Our work reveals aspects of the problem that were not present in prior asymptotic works. For example, we empirically show that optimal regularization can eliminate even “triple descent” in ridge regression (Figure 2). Moreover, we show that for nonGaussian covariates, optimally-tuned ridge regression is not always sample-monotonic: we give a counterexample in Section 4. ", + "bbox": [ + 174, + 854, + 823, + 924 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 823, + 159 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Towards a more general characterization. Our theoretical results crucially rely on the covariance of the data being isotropic. A natural next question is if and when the same results can hold more generally. A full answer to this question is beyond the scope of this paper, though we give the following results: ", + "bbox": [ + 176, + 166, + 825, + 222 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "1. Optimally-tuned ridge regression is not always sample-monotonic: we show a counterexample for a certain non-Gaussian data distribution and heteroscedastic noise. We are not aware of prior work pointing out this fact. (See Section 4 for the counterexample and intuitions.) \n2. For non-isotropic Gaussian covariates, we can achieve sample-wise monotonicity with a regularizer that depends on the population covariance matrix of data. This suggests unlabeled data might also help mitigate double descent in some settings, because the population covariance can be estimated from unlabeled data. (See Appendix B). \n3. For non-isotropic Gaussian covariates, we conjecture that optimally-tuned ridge regression is sample-monotonic even with a standard $\\ell _ { 2 }$ regularizer (as in Figure 2). We derive a sufficient condition for this conjecture. Due to that current random matrix theory may be insufficient to verify this conjecture, we verify it numerically on a wide variety of cases. (See Appendix B for details). ", + "bbox": [ + 210, + 234, + 825, + 424 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The last two results above highlight the importance of the form of the regularizer, which leads to the open question: “How do we design good regularizers which mitigate or remove double descent?” We hope that our results can motivate future work on mitigating the double descent phenomenon, and allow us to train high performance models which do not exhibit nonmonotonic behaviors. ", + "bbox": [ + 176, + 436, + 825, + 492 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "1.1 RELATED WORKS ", + "text_level": 1, + "bbox": [ + 176, + 510, + 338, + 523 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The study of nonmonotonicity in learning algorithms existed prior to double descent and has a long history going back to (at least) Trunk (1979) and LeCun et al. (1991); Le Cun et al. (1991), where the former was largely empirical observations and the latter studied the sample non-nonmonotonicity of unregularized linear regression in terms of the eigenspectrum of the covariance matrix; the difference to our works is that we study this in the context of optimal regularization. In fact, Duin (1995; 2000); Opper (2001); Loog & Duin (2012). Loog et al. (2019) introduces the same notion of risk monotonicity which we consider, and studies several examples of monotonic and non-monotonic procedures. ", + "bbox": [ + 174, + 535, + 825, + 646 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Double descent of test risk as a function of model size was considered recently in more generality by Belkin et al. (2018). Similar behavior was observed empirically in earlier work in somewhat more restricted settings Trunk (1979); Opper (1995; 2001); Skurichina & Duin (2002); Le Cun et al. (1991); LeCun et al. (1991) and more recently in Advani & Saxe (2017); Geiger et al. (2019a); Spigler et al. (2018); Neal et al. (2018). Recently Nakkiran et al. (2020) demonstrated a generalized double descent phenomenon on modern deep networks, and highlighted “sample non-monotonicity” as an aspect of double descent. ", + "bbox": [ + 174, + 652, + 825, + 750 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "A recent stream of theoretical works consider model-wise double descent in simplified settings— often via linear models for regression or classification. This also connects to works on highdimentional regression in the statistics literature. A partial list of works in these areas include Belkin et al. (2019); Hastie et al. (2019); Bartlett et al. (2019); Muthukumar et al. (2019); Bibas et al. (2019); Mitra (2019); Mei & Montanari (2019); Liang & Rakhlin (2018); Liang et al. (2019); Xu & Hsu (2019); Derezinski et al. (2019); Lampinen & Ganguli (2018); Deng et al. (2019); Nakki- ´ ran (2019); Mahdaviyeh & Naulet (2019); Dobriban et al. (2018); Dobriban & Sheng (2019); Kobak et al. (2018). Of these, most closely related to our work are Hastie et al. (2019); Dobriban et al. (2018); Mei & Montanari (2019). Specifically, Hastie et al. (2019) considers the risk of unregularized and regularized linear regression in an asymptotic regime, where dimension $d$ and number of samples $n$ scale to infinity together, at a constant ratio $d / n$ . In contrast, we show non-asymptotic results, and are able to consider increasing the number of samples for a fixed model, without scaling both together. Mei & Montanari (2019) derive similar results for unregularized and regularized random features, also in an asymptotic limit. The non-asymptotic versions of the settings considered in Hastie et al. (2019) are almost identical to ours— for example, our projection model in Section 3 is nearly identical to the model in Hastie et al. (2019, Section 5.1). Finally, subsequent to our work, d’Ascoli et al. (2020) identified triple descent in an asymptotic setting. ", + "bbox": [ + 173, + 757, + 825, + 924 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 103, + 825, + 174 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2 SAMPLE MONOTONICITY IN RIDGE RIDGRESSION ", + "text_level": 1, + "bbox": [ + 174, + 194, + 620, + 210 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this section, we prove that optimally-regularized ridge regression has test risk that is monotonic in samples, for isotropic gaussian covariates and linear response. This confirms the behavior empirically observed in Figure 1. We also show that this monotonicity is not “fragile”, and using larger than larger regularization is still sample-monotonic (consistent with Figure 1). ", + "bbox": [ + 174, + 226, + 825, + 284 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Formally, we consider the following linear regression problem in $d$ dimensions. The input/covariate $x \\in \\mathbb { R } ^ { d }$ is generated from $\\mathcal { N } ( 0 , I _ { d } )$ , and the output/response is generated by $y = \\langle x , \\beta ^ { * } \\rangle + \\varepsilon$ with $\\varepsilon \\sim \\mathcal { N } ( 0 , \\bar { \\sigma } ^ { 2 } )$ for some unknown parameter $\\beta ^ { * } \\in \\mathbb { R } ^ { d }$ . We denote the joint distribution of $( x , y )$ by $\\mathcal { D }$ . We are given $n$ training examples $\\{ ( x _ { i } , y _ { i } ) \\} _ { i = 1 } ^ { n }$ i.i.d sampled from $\\mathcal { D }$ . We aim to learn a linear model $f _ { \\beta } ( x ) = \\langle x , \\beta \\rangle$ with small population risk $\\bar { R } ( \\beta ) : = \\mathbb { E } _ { ( x , y ) \\sim \\mathcal { D } } [ ( \\langle x , \\beta \\rangle - y ) ^ { 2 } ]$ . For simplicity, let $\\ b { X } \\in \\mathbb { R } ^ { n \\times d }$ be the data matrix that contains $x _ { i } ^ { \\top }$ ’s as rows and let $\\vec { y } \\in \\mathbb R ^ { n }$ be column vector that contains the responses $y _ { i }$ ’s as entries. For any estimator $\\hat { \\beta } _ { n } ( X , \\vec { y } )$ as a function of $n$ samples, define the expected risk of the estimator as: ", + "bbox": [ + 173, + 289, + 825, + 407 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/ca8f1f38d0fbad23b37af04d06db0fdee27ea648b14d9cc7188acd0d5ba2d5d0.jpg", + "text": "$$\n{ \\overline { { R } } } ( { \\hat { \\beta } } _ { n } ) : = \\operatorname * { \\mathbb { E } } _ { X , y \\sim { \\mathcal { D } } ^ { n } } [ R ( { \\hat { \\beta } } _ { n } ( X , { \\vec { y } } ) ) ]\n$$", + "text_format": "latex", + "bbox": [ + 390, + 414, + 607, + 441 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We consider the regularized least-squares estimator, also known as the ridge regression estimator. For a given $\\lambda > 0$ , define ", + "bbox": [ + 174, + 449, + 826, + 477 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/d1e09e8985a269d77fd3cb37a62099e25386d5abe73ff5141e77c5f63a87f69b.jpg", + "text": "$$\n\\hat { \\beta } _ { n , \\lambda } : = \\underset { \\beta } { \\operatorname { a r g m i n } } | | X \\beta - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda | | \\beta | | _ { 2 } ^ { 2 } = ( X ^ { T } X + \\lambda I _ { d } ) ^ { - 1 } X ^ { T } \\vec { y }\n$$", + "text_format": "latex", + "bbox": [ + 285, + 484, + 714, + 513 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Here $I _ { d }$ denotes the $d$ dimensional identity matrix. Let $\\lambda _ { n } ^ { \\mathrm { o p t } }$ be the optimal ridge parameter (that achieves the minimum expected risk) given $n$ samples: $\\begin{array} { r } { \\lambda _ { n } ^ { \\mathrm { o p t } } : = \\operatorname * { a r g m i n } _ { \\lambda : \\lambda \\geq 0 } \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) ) } \\end{array}$ . Let $\\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } }$ be the estimator that corresponds to the $\\lambda _ { n } ^ { \\mathrm { o p t } }$ . That is, $\\begin{array} { r } { \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } : = \\operatorname * { a r g m i n } _ { \\beta } | | X \\beta - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda _ { n } ^ { \\mathrm { o p t } } | | \\beta | | _ { 2 } ^ { 2 } } \\end{array}$ . Our main theorem in this section shows that the expected risk of $\\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } }$ monotonically decreases as $n$ increases. ", + "bbox": [ + 173, + 521, + 826, + 604 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Theorem 1. In the setting above, the expected test risk of optimally-regularized well-specified isotropic linear regression is monotonic in samples. That is, for all $\\beta ^ { * } \\in \\mathbb { R } ^ { d }$ and all $d \\in \\mathbb { N } , n \\in$ $\\mathbb { N } , \\sigma > 0$ , ", + "bbox": [ + 174, + 608, + 825, + 650 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/02c89e1530f055b86ccd8d1b6fb13f02720f9d0d99c45df164c8d8dfcd675713.jpg", + "text": "$$\n\\overline { { R } } ( \\hat { \\beta } _ { n + 1 } ^ { \\mathrm { o p t } } ) \\leq \\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } )\n$$", + "text_format": "latex", + "bbox": [ + 431, + 648, + 566, + 670 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The above theorem shows a strong form of monotonicity, since it holds for every fixed groundtruth $\\beta ^ { * }$ , and does not require averaging over any prior on ground-truths. Moreover, it holds nonasymptotically, for every fixed $n , d \\in \\mathbb { N }$ . Obtaining such non-asymptotic results is nontrivial, since we cannot rely on concentration properties of the involved random variables. ", + "bbox": [ + 174, + 679, + 825, + 736 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In particular, evaluating $\\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } } )$ as a function of the problem parameters $( n , \\sigma , \\beta ^ { * }$ , and $d$ ) is technically challenging. In fact, we suspect that a simple closed form expression does not exist. The key idea towards proving the theorem is to derive a “partial evaluation” — the following lemmas shows that we can write $\\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } } )$ in the form of $\\mathbb { E } [ g ( \\gamma , \\sigma , n , d , \\beta ^ { * } ) ]$ where $\\gamma \\in \\mathbb { R } ^ { d }$ contains the singular values of $X$ . We will then couple the randomness of data matrices obtained by adding a single sample, and use singular value interlacing to compare their singular values. ", + "bbox": [ + 173, + 743, + 825, + 832 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Lemma 1. In the setting of Theorem $^ { l }$ , let $\\gamma = ( \\gamma _ { 1 } , \\ldots , \\gamma _ { d } )$ be the singular values of the data matrix $\\ b { X } \\in \\mathbb { R } ^ { n \\times d }$ . (If $n < d$ , we pad the $\\gamma _ { i } = 0$ for $i > n .$ .) Let $\\Gamma _ { n }$ be the distribution of $\\gamma .$ . Then, the expected test risk is ", + "bbox": [ + 176, + 835, + 823, + 878 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/b40dba43a33ce50127dbb819e04e578cfe43a13d87ee3e1ab4cc4770fe468e0d.jpg", + "text": "$$\n\\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\operatorname * { \\mathbb { E } } _ { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma _ { n } } \\left[ \\sum _ { i = 1 } ^ { d } \\frac { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } / d + \\sigma ^ { 2 } \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } \\right] + \\sigma ^ { 2 }\n$$", + "text_format": "latex", + "bbox": [ + 308, + 885, + 689, + 929 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "From Lemma 1, the below lemma follows directly by taking derivatives to find the optimal $\\lambda$ . ", + "bbox": [ + 169, + 103, + 785, + 119 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Lemma 2. In the setting of Theorem 1, the optimal ridge parameter is constant for all $n$ : $\\lambda _ { n } ^ { \\mathrm { o p t } } =$ $\\frac { d \\sigma ^ { 2 } } { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } }$ . Moreover, the optimal expected test risk can be written as ", + "bbox": [ + 171, + 122, + 826, + 160 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/e5430d69b46fe619155e1f8482e9e60dbcbbee1ff0353cd69134b248c0fec2e1.jpg", + "text": "$$\n\\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } ) = \\operatorname * { l } _ { ( \\gamma _ { 1 } , \\ldots \\gamma _ { d } ) \\sim \\Gamma _ { n } } \\left[ \\sum _ { i = 1 } ^ { d } \\frac { \\sigma ^ { 2 } } { \\gamma _ { i } ^ { 2 } + d \\sigma ^ { 2 } / | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } \\right] + \\sigma ^ { 2 }\n$$", + "text_format": "latex", + "bbox": [ + 320, + 165, + 678, + 209 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Proofs of Lemma 1 and 2 are deferred to the Appendix, Section A.1. Now we are ready to prove Theorem 1. ", + "bbox": [ + 176, + 219, + 825, + 248 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Proof of Theorem $^ { l }$ . Let $\\widetilde { X } \\ \\in \\ \\mathbb { R } ^ { ( n + 1 ) \\times d }$ and $\\boldsymbol { X } \\in \\mathbb { R } ^ { n \\times d }$ be any two matrices which differ by only the last row of $\\widetilde { X }$ . By the Cauchy interlacing theorem Theorem 4.3.4 of Horn et al. (1990) (c.f.,Lemma 3.4 of Marcus et al. (2014)), the singular values of $X$ and $\\widetilde { X }$ are interlaced: $\\forall i$ : $\\gamma _ { i - 1 } ( X ) \\geq \\gamma _ { i } ( { \\widetilde { X } } ) \\geq \\gamma _ { i } ( X )$ where $\\gamma _ { i } ( \\cdot )$ is the $i$ -th singular value. ", + "bbox": [ + 173, + 261, + 825, + 329 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "If we couple $\\widetilde { X }$ and $X$ , it will induce a coupling $\\Pi$ between the distributions $\\Gamma _ { n + 1 }$ and $\\Gamma _ { n }$ , of the singular values of the data matrix for $n + 1$ and $n$ samples. This coupling satisfies that $\\widetilde { \\gamma } _ { i } \\geq \\gamma _ { i }$ with probability 1 for $( \\{ \\widetilde { \\gamma } _ { i } \\} , \\{ \\gamma _ { i } \\} ) \\sim \\Pi$ e. Now, expand the test risk using Lemma 2, and observe that each eterm in the sum of Equation (4) below is monotone decreasing with $\\gamma _ { i }$ . Thus: ", + "bbox": [ + 174, + 335, + 825, + 393 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/394fb265e7acb3aca9e90fbd87720cebac655f2a76eaa31a335aed3b7bf29338.jpg", + "text": "$$\n\\begin{array} { r l } & { \\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } ) = \\underset { ( \\gamma _ { 1 } , \\ldots , \\gamma _ { d } ) \\sim \\Gamma _ { n } } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } \\frac { \\sigma ^ { 2 } } { \\gamma _ { i } ^ { 2 } + d \\sigma ^ { 2 } / | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } \\right] + \\sigma ^ { 2 } } \\\\ & { \\qquad \\quad \\overset { \\mathbb { E } } { \\ge } \\underset { ( \\widetilde { \\gamma } _ { 1 } , \\ldots , \\widetilde { \\gamma } _ { d } ) \\sim \\Gamma _ { n + 1 } } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } \\frac { \\sigma ^ { 2 } } { \\widetilde { \\gamma } _ { i } ^ { 2 } + d \\sigma ^ { 2 } / | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } \\right] + \\sigma ^ { 2 } } \\\\ & { \\qquad = \\overline { { R } } ( \\hat { \\beta } _ { n + 1 } ^ { \\mathrm { o p t } } ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 312, + 397, + 684, + 508 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "By similar techniques, we can also prove that overregularization —that is, using ridge parameters $\\lambda$ larger than the optimal value— is still monotonic. This proves the behavior empirically observed in Figure 1. ", + "bbox": [ + 174, + 541, + 825, + 583 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Theorem 2. In the same setting as Theorem $I$ , over-regularized regression is also monotonic in samples. That is, for all $d \\in \\mathbb { N } , n \\in \\mathbb { N } , \\sigma > 0 , \\beta ^ { * } \\in \\mathbb { R } ^ { d }$ , the following holds ", + "bbox": [ + 173, + 587, + 825, + 616 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/a578df214e9bb7e84f8394d7f15346d3c032904414a25d33ee34685761e5d638.jpg", + "text": "$$\n\\forall \\lambda \\geq \\lambda ^ { * } : \\quad \\overline { { { R } } } ( \\widehat { \\beta } _ { n + 1 , \\lambda } ) \\leq \\overline { { { R } } } ( \\widehat { \\beta } _ { n , \\lambda } )\n$$", + "text_format": "latex", + "bbox": [ + 379, + 621, + 620, + 641 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\begin{array} { r } { \\lambda ^ { * } = \\frac { d \\sigma ^ { 2 } } { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } } \\end{array}$ ", + "bbox": [ + 174, + 646, + 302, + 670 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Proof. In Section A.1. ", + "bbox": [ + 174, + 683, + 321, + 698 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 MODEL-WISE MONOTONICITY IN RIDGE REGRESSION ", + "text_level": 1, + "bbox": [ + 174, + 717, + 658, + 734 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this section, we show that for a certain family of linear models, optimal regularization prevents model-wise double descent. That is, for a fixed number of samples, larger models are not worse than smaller models. ", + "bbox": [ + 174, + 748, + 825, + 791 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We consider the following learning problem. Informally, covariates live in a $p$ -dimensional ambient space, and we consider models which first linearly project down to a random $d$ -dimensional subspace, then perform ridge regression in that subspace for some $d \\leq p$ . Formally, the covariate $x \\in \\mathbb { R } ^ { p }$ is generated from $\\bar { \\mathcal { N } } ( 0 , I _ { p } )$ , and the response is generated by $y = \\langle x , \\theta \\rangle + \\varepsilon$ with $\\varepsilon \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } )$ and for some unknown parameter $\\theta \\in \\mathbb { R } ^ { p }$ . Next, $n$ examples $\\{ ( x _ { i } , y _ { i } ) \\} _ { i = 1 } ^ { n }$ are sampled i.i.d from this distribution. For a given model size $d \\leq p$ , we first sample a random orthonormal matrix $P \\in \\mathbb { R } ^ { d \\times p }$ which specifies our model. We then consider models which operate on $( \\widetilde { x } _ { i } , y _ { i } ) \\in \\mathbb { R } ^ { d } \\times \\mathbb { R }$ , where $\\widetilde { x _ { i } } = P x _ { i }$ . We denote the joint distribution of $( \\widetilde { x } , y )$ by $\\mathcal { D }$ . Here, we eemphasize that $p$ eis some large ambient dimension and $d \\leq p$ eis the size of the model we learn. ", + "bbox": [ + 173, + 796, + 825, + 924 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "For a fixed $P$ , we want to learn a linear model $f _ { \\hat { \\beta } } ( \\tilde { x } ) = \\langle \\tilde { x } , \\hat { \\beta } \\rangle$ for estimating $y$ , with small mean squared error on distribution: $R _ { P } ( \\hat { \\beta } ) : = \\mathbb { E } _ { ( \\tilde { x } , y ) \\sim \\mathcal { D } } [ ( \\langle \\tilde { x } , \\hat { \\beta } \\rangle - y ) ^ { 2 } ]$ . For $n$ samples $( x _ { i } , y _ { i } )$ , let $X \\in$ $\\mathbb { R } ^ { n \\times p }$ be the data matrix, $\\widetilde { X } \\ = X P ^ { T } \\ \\in \\ \\mathbb { R } ^ { n \\times d }$ be the projected data matrix and $\\vec { y } \\in \\mathbb R ^ { n }$ be the responses. For any estimator $\\hat { \\beta } ( \\widetilde { X } , \\vec { y } )$ as a function of the observed samples, define the expected risk of the estimator as: ", + "bbox": [ + 173, + 102, + 825, + 185 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/471b0b050ee0b25d6039c368a191eda06e0d7ece3a4fd4107b6fcd61419bdb12.jpg", + "text": "$$\n\\overline { { R } } ( \\hat { \\beta } ) : = \\operatorname * { \\mathbb { E } } _ { P } \\operatorname * { \\mathbb { E } } _ { \\tilde { X } , \\vec { y } \\sim \\mathcal { D } ^ { n } } [ R _ { P } ( \\hat { \\beta } ( \\tilde { X } , \\vec { y } ) ]\n$$", + "text_format": "latex", + "bbox": [ + 387, + 188, + 611, + 219 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We consider the regularized least-squares estimator. For a given $\\lambda > 0$ , define ", + "bbox": [ + 173, + 224, + 686, + 239 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/d84149205d19f5e433d4ef05d807c1baeb63bf431d05a7edb609aeb394e83063.jpg", + "text": "$$\n\\hat { \\beta } _ { d , \\lambda } : = \\underset { \\beta } { \\mathrm { a r g m i n } } | | \\widetilde { X } \\beta - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda | | \\beta | | _ { 2 } ^ { 2 } = ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I _ { d } ) ^ { - 1 } \\widetilde { X } ^ { T } \\vec { y }\n$$", + "text_format": "latex", + "bbox": [ + 285, + 243, + 714, + 273 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Let $\\lambda _ { d } ^ { \\mathrm { o p t } }$ be the optimal ridge parameter (that achieves the minimum expected risk) for a model of size $d$ d, with $n$ samples: $\\lambda _ { d } ^ { \\mathrm { o p t } } : = \\mathrm { a r g m i n } _ { \\lambda \\ge 0 } \\overline { { R } } ( \\hat { \\beta } _ { d , \\lambda } ) )$ . Let $\\hat { \\beta } _ { d } ^ { \\mathrm { { o p t } } }$ be the estimator that corresponds to the $\\lambda _ { d } ^ { \\mathrm { o p t } }$ , that is $\\begin{array} { r } { \\hat { \\beta } _ { d } ^ { \\mathrm { o p t } } : = \\operatorname * { a r g m i n } _ { \\beta } | | \\widetilde { X } \\beta - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda _ { d } ^ { \\mathrm { o p t } } | | \\beta | | _ { 2 } ^ { 2 } } \\end{array}$ . Now, our main theorem in this setting shows that with optimal $\\ell _ { 2 }$ regularization, test performance is monotonic in model size. ", + "bbox": [ + 174, + 280, + 825, + 345 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Theorem 3. In the setting above, the expected test risk of the optimally-regularized model is monotonic in the model size $d .$ . That is, for all $p \\in \\mathbb { N } , \\theta \\in \\mathbb { R } ^ { p } , d \\leq p , n \\in \\mathbb { N } , \\sigma > 0$ , we have ", + "bbox": [ + 173, + 349, + 825, + 377 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/220172f9a1811307d4805215b213850851fc08625c6f7fcb7e7c4f9092ce607d.jpg", + "text": "$$\n\\overline { { R } } ( \\hat { \\beta } _ { d + 1 } ^ { \\mathrm { o p t } } ) \\leq \\overline { { R } } ( \\hat { \\beta } _ { d } ^ { \\mathrm { o p t } } )\n$$", + "text_format": "latex", + "bbox": [ + 431, + 382, + 565, + 404 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The proof of Theorem 3 is in Appendix A.2, and follows closely the proof of Theorem 1. ", + "bbox": [ + 173, + 414, + 754, + 430 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 COUNTEREXAMPLES TO MONOTONICITY ", + "text_level": 1, + "bbox": [ + 174, + 448, + 547, + 465 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this section, we show that optimally-regularized ridge regression is not always monotonic in samples. We give a numeric counterexample in $d = 2$ dimensions, with non-gaussian covariates and heteroscedastic noise. This does not contradict our main theorem in Section 2, since this distribution is not jointly Gaussian with isotropic marginals. ", + "bbox": [ + 174, + 479, + 825, + 536 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Counterexample. Here we give an example of a distribution $( x , y )$ for which the expected error of optimally-regularized ridge regression with $n = 2$ samples is worse than with $n = 1$ samples. This counterexample is most intuitive to understand when the ridge parameter $\\lambda$ is allowed to depend on the specific sample instance $( X , { \\vec { y } } )$ as well as $n ^ { 1 }$ . We sketch the intuition for this below. Consider the following distribution on $( x , y )$ in $d = 2$ dimensions. This distribution has one “clean” coordinate and one “noisy” coordinate. The distribution is: $( x , y ) = ( { \\vec { e } } _ { 1 } , 1 )$ with probability $1 / 2$ , and $( x , y ) =$ $( \\vec { e } _ { 2 } , \\pm 1 0 )$ w.p. 1/2. Where $\\pm 1 0$ is uniformly random independent noise. This distribution is “wellspecified” in that the optimal predictor is linear in $x$ $: \\mathbb { E } [ y | x ] = \\langle \\beta ^ { * } , x \\rangle$ for $\\beta ^ { * } = [ 1 , 0 ]$ . However, the noise is heteroscedastic. ", + "bbox": [ + 173, + 541, + 825, + 667 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "For $n = 1$ samples, the estimator can decide whether to use small $\\lambda$ or large $\\lambda$ depending on if the sampled coordinate is the “clean” or “noisy” one. Specifically, for the sample $( x , y )$ : If $x = \\vec { e } _ { 1 }$ , then the optimal ridge parameter is $\\lambda = 0$ . If $x = \\vec { e } _ { 2 }$ , then the optimal parameter is $\\lambda = \\infty$ . ", + "bbox": [ + 173, + 674, + 825, + 717 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "For $n = 2$ samples, with probability $1 / 2$ the two samples will hit both coordinates. In this case, the estimator must chose a single value of $\\lambda$ uniformly for both coordinates. This yields to a suboptimal tradeoff, since the “noisy” coordinate demands large regularization, but this hurts estimation on the “clean” coordinate. ", + "bbox": [ + 174, + 723, + 825, + 779 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "It turns out that a slight modification to the above also serves as a counterexample to monotonicity when the regularization parameter $\\lambda$ is chosen only depending on $n$ (and not on the instance $X , y )$ . The distribution is: $( x , y ) = ( \\vec { e } _ { 1 } , 1 )$ w.p. 0.98 and $( x , y ) = ( \\vec { e } _ { 2 } , \\pm 2 0 )$ w.p. 0.02. This distribution has the following property. ", + "bbox": [ + 174, + 785, + 825, + 843 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Theorem 4. There exists a distribution $\\mathcal { D }$ over $( x , y )$ for $x \\in \\mathbb { R } ^ { 2 } , y \\in \\mathbb { R }$ with the following properties. Let $\\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } }$ be the optimally-regularized ridge regression solution for $n$ samples $( X , { \\vec { y } } )$ from $\\mathcal { D }$ . Then: ", + "bbox": [ + 174, + 844, + 825, + 890 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "1. D is “well-specified” in that $\\mathbb { E } p [ y | x ]$ is a linear function of $x$ , ", + "bbox": [ + 210, + 102, + 640, + 119 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "2. The expected test risk increases as a function of $n _ { \\ast }$ , between $n = 1$ and $n = 2$ . Specifically ", + "bbox": [ + 207, + 131, + 821, + 147 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/5c348faa011f7bcdbd72bd75ff6cd0e528571f73042b72f9974ff9f74bbe14c5.jpg", + "text": "$$\n\\overline { { R } } ( \\hat { \\beta } _ { n = 1 } ^ { \\mathrm { o p t } } ) < \\overline { { R } } ( \\hat { \\beta } _ { n = 2 } ^ { \\mathrm { o p t } } )\n$$", + "text_format": "latex", + "bbox": [ + 455, + 155, + 601, + 175 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Proof. For $n = 1$ samples, it can be confirmed analytically that the expected risk $\\overline { { { R } } } ( \\hat { \\beta } _ { n = 1 } ^ { \\mathrm { o p t } } ) ~ <$ 8.157. This is achieved with $\\lambda = 4 0 0 / 2 4 0 1 \\approx 0 . 1 6 6 5 9 7 .$ For $n = 2$ samples, it can be confirmed numerically (via Mathematica) that the expected risk $\\overline { { R } } ( \\hat { \\beta } _ { n = 2 } ^ { \\mathrm { o p t } } ) ~ > ~ 8 . 1 7 9$ . This is achieved with $\\lambda = 0 . 6 4 2 5 2 5$ . □ ", + "bbox": [ + 173, + 202, + 825, + 261 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 176, + 286, + 328, + 303 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We now experimentally demonstrate that optimal $\\ell _ { 2 }$ regularization can mitigate double descent, in more general settings than Theorems 1 and 3. ", + "bbox": [ + 176, + 321, + 825, + 351 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5.1 SAMPLE MONOTONICITY ", + "text_level": 1, + "bbox": [ + 174, + 373, + 390, + 387 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Here we show various settings where optimal $\\ell _ { 2 }$ regularization empirically induces samplemonotonic performance. ", + "bbox": [ + 173, + 402, + 821, + 431 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Nonisotropic Regression. We first consider the setting of Theorem 1, but with non-isotropic covariantes $x$ . That is, we perform ridge regression on samples $( x , y )$ , where the covariate $\\boldsymbol { x } \\in \\mathbb { R } ^ { d }$ is generated from $\\mathcal { N } ( 0 , \\Sigma )$ for $\\Sigma \\neq I _ { d }$ . As before, the response is generated by $y = \\langle x , \\beta ^ { * } \\rangle + \\varepsilon$ with $\\varepsilon \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } )$ for some unknown parameter $\\beta ^ { * } \\in \\mathbb { R } ^ { d }$ . We consider the same ridge regression estimator, $\\begin{array} { r } { \\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\boldsymbol { \\beta } } \\| X { \\boldsymbol { \\beta } } - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| { \\boldsymbol { \\beta } } \\| _ { 2 } ^ { 2 } } \\end{array}$ . ", + "bbox": [ + 173, + 452, + 825, + 526 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/6bbe45f3d0113a0cbb86e816d67e9834573c85c456540349b12e6e02c25001ba.jpg", + "image_caption": [ + "Figure 2: Test Risk vs. Num. Samples for Non-Isotropic Ridge Regression in $d = 3 0$ dimensions. Unregularized regression is non-monotonic in samples, but optimally-regularized regression is monotonic. Note the optimal regularization $\\lambda$ depends on the number of samples $n$ . ", + "Figure 2 shows one instance of this, for a particular choice of $\\Sigma$ and $\\beta ^ { * }$ . The covariance $\\Sigma$ is diagonal, with $\\Sigma _ { i , i } = 1 0$ for $i \\leq 1 5$ and $\\Sigma _ { i , i } = 1$ for $i > 1 5$ . That is, the covariance has one “large” eigenspace and one “small” eigenspace. The ground-truth $\\beta ^ { * } = 0 . 1 \\vec { e _ { 1 } } + e _ { 3 0 } ^ { }$ , which lies almost entirely within the “small” eigenspace of $\\Sigma$ . The noise parameter is $\\sigma = 0 . 5$ . " + ], + "image_footnote": [], + "bbox": [ + 235, + 546, + 485, + 739 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We see that unregularized regression $\\lambda = 0$ ) actually undergoes “triple descent”2 in this setting, with the first peak around $n = 1 5$ samples due to the 15-dimensional large eigenspace, and the second peak at $n = d$ . In this setting, optimally-regularized ridge regression is empirically monotonic in samples (Figure 2). Unlike the isotropic setting of Section 2, the optimal ridge parameter $\\lambda _ { n }$ is no longer a constant, but varies with number of samples $n$ . ", + "bbox": [ + 174, + 824, + 825, + 895 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Random ReLU Features. We consider random ReLU features, in the random features framework of Rahimi & Recht (2008). For a given number of features $D$ , and number of samples $n$ , the random feature classifier is obtained by performing regularized linear regression on the embedding√ $\\tilde { x } : = \\mathrm { R e L U } ( W x )$ , where $W \\in \\mathbb { R } ^ { D \\times d }$ is a matrix with each entry sampled i.i.d $\\mathcal { N } ( 0 , 1 / \\sqrt { d } )$ and ReLU applies pointwise. This is equivalent to a 2-layer fully-connected neural network with a frozen (randomly-initialized) first layer, trained with $\\ell _ { 2 }$ loss and weight decay. In Appendix A.4, we apply random features to Fashion-MNIST Xiao et al. (2017). From Appendix Figure 4a, we see that underregularized models are non-monotonic, but optimal $\\ell _ { 2 }$ regularization is monotonic in samples. Moreover, the optimal ridge parameter $\\lambda$ appears to be constant for all $n$ , similar to our results from the isotropic setting in Theorem 1. ", + "bbox": [ + 173, + 103, + 825, + 244 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "5.2 MODEL-SIZE MONOTONICITY ", + "text_level": 1, + "bbox": [ + 176, + 262, + 421, + 276 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Here we empirically show that optimal $\\ell _ { 2 }$ regularization can mitigate model-wise double descent. ", + "bbox": [ + 171, + 287, + 808, + 303 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Random ReLU Features. We consider the same experimental setup as in Section 5.1, but now fix the number of samples $n$ , and vary the number of random features $D$ . This corresponds to varying the width of the corresponding 2-layer neural network. Figure 4b in Appendix A.4 shows the test error of the random features classifier, for $n = 5 0 0$ train samples and varying number of random features. We see that underregularized models undergo model-wise double descent, but optimal $\\ell _ { 2 }$ regularization prevents double descent. ", + "bbox": [ + 174, + 318, + 825, + 401 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Convolutional Neural Networks. We follow the experimental setup of Nakkiran et al. (2020) for modelwise double descent, and add varying amounts of $\\ell _ { 2 }$ regularization (weight decay). We chose the following setting from Nakkiran et al. (2020), because it exhibits double descent even with no added label noise. We consider the same family of 5-layer convolutional neural networks (CNNs) from Nakkiran et al. (2020), consisting of 4 convolutional layers of widths $[ k , 2 k , 4 k , 8 k ]$ for varying $k \\in$ $\\mathbb { N }$ . We train and test on CIFAR100 (Krizhevsky et al., 2009), an image classification problem with 100 classes. Inputs are normalized to ", + "bbox": [ + 174, + 417, + 419, + 666 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/b59ffa519889838486fdb1bea9435eca85527fcc4c5ff780a6f8610321941a4b.jpg", + "image_caption": [ + "Figure 3: Test Error vs. Model Size for 5-layer CNNs on CIFAR-100, with $\\ell _ { 2 }$ regularization (weight decay). Note that the optimal regularization $\\lambda$ varies with $n$ . " + ], + "image_footnote": [], + "bbox": [ + 455, + 439, + 799, + 592 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "$[ - 1 , 1 ] ^ { d }$ , and we use standard data-augmentation of random horizontal flip and random crop with 4- pixel padding. All models are trained using Stochastic Gradient Descent (SGD) on the cross-entropy loss, with step size $0 . 1 / \\sqrt { \\lfloor { T / 5 1 2 } \\rfloor + 1 }$ at step $T$ . We train for 1e6 gradient steps, and use weight decay $\\lambda$ for varying $\\lambda$ . Due to optimization instabilities for large $\\lambda$ , we use the model with the minimum train loss among the last 5K gradient steps. Figure 3 shows the test error of these models on CIFAR-100. Although unregularized and under-reguarized models exhibit double descent, the test error of optimally-regularized models is largely monotonic. Note that the optimal regularization $\\lambda$ varies with the model size — no single regularization value is optimal for all models. ", + "bbox": [ + 174, + 666, + 825, + 780 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "6 DISCUSSION AND CONCLUSION ", + "text_level": 1, + "bbox": [ + 176, + 801, + 468, + 816 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In this work, we study the double descent phenomenon in the context of optimal regularization. We show that, while unregularized or under-regularized models often have non-monotonic behavior, appropriate regularization can eliminate this effect. ", + "bbox": [ + 174, + 832, + 825, + 875 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Theoretically, we prove that for certain linear regression models with isotropic covariates, optimallytuned $\\ell _ { 2 }$ regularization achieves monotonic test performance as we grow either the sample size or the model size. These are the first non-asymptotic monotonicity results we are aware of in linear regression. We also demonstrate empirically that optimally-tuned $\\ell _ { 2 }$ regularization can mitigate double descent for more general models, including neural networks. We hope that our results can motivate future work on mitigating the double descent phenomenon, and allow us to train high performance models which do not exhibit unexpected nonmonotonic behaviors. ", + "bbox": [ + 176, + 882, + 823, + 924 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 823, + 159 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Open Questions. Our work suggests a number of natural open questions. First, it is open to prove (or disprove) that optimal ridge regression is sample-monotonic for non-isotropic Gaussian covariates. We conjecture that it is, and outline a potential route to proving this (via Conjectures 1 and 2 in the Appendix). Second, more broadly, it is open to prove sample-wise or model-wise monotonicity for more general (non-linear) models with appropriate regularizers. Finally, it is open to understand why large neural networks in practice are often sample-monotonic in realistic regimes of sample sizes, even without careful choice of regularization. ", + "bbox": [ + 174, + 175, + 825, + 273 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 174, + 295, + 285, + 309 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Madhu S Advani and Andrew M Saxe. High-dimensional dynamics of generalization error in neural networks. arXiv preprint arXiv:1710.03667, 2017. \nPeter L Bartlett, Philip M Long, Gabor Lugosi, and Alexander Tsigler. Benign overfitting in linear ´ regression. arXiv preprint arXiv:1906.11300, 2019. \nMikhail Belkin, Daniel Hsu, Siyuan Ma, and Soumik Mandal. Reconciling modern machine learning and the bias-variance trade-off. arXiv preprint arXiv:1812.11118, 2018. \nMikhail Belkin, Daniel Hsu, and Ji Xu. Two models of double descent for weak features. arXiv preprint arXiv:1903.07571, 2019. \nKoby Bibas, Yaniv Fogel, and Meir Feder. A new look at an old problem: A universal learning approach to linear regression. arXiv preprint arXiv:1905.04708, 2019. \nStephane d’Ascoli, Levent Sagun, and Giulio Biroli. Triple descent and the two kinds of overfitting: ´ Where & why do they appear? arXiv preprint arXiv:2006.03509, 2020. \nZeyu Deng, Abla Kammoun, and Christos Thrampoulidis. A model of double descent for highdimensional binary linear classification. arXiv preprint arXiv:1911.05822, 2019. \nMichał Derezinski, Feynman Liang, and Michael W. Mahoney. Exact expressions for double descent ´ and implicit regularization via surrogate random design, 2019. \nEdgar Dobriban and Yue Sheng. Wonder: Weighted one-shot distributed ridge regression in high dimensions. arXiv preprint arXiv:1903.09321, 2019. \nEdgar Dobriban, Stefan Wager, et al. High-dimensional asymptotics of prediction: Ridge regression and classification. The Annals of Statistics, 46(1):247–279, 2018. \nRobert PW Duin. Small sample size generalization. In Proceedings of the Scandinavian Conference on Image Analysis, volume 2, pp. 957–964. PROCEEDINGS PUBLISHED BY VARIOUS PUBLISHERS, 1995. \nRobert PW Duin. Classifiers in almost empty spaces. In Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, volume 2, pp. 1–7. IEEE, 2000. \nMario Geiger, Arthur Jacot, Stefano Spigler, Franck Gabriel, Levent Sagun, Stephane d’Ascoli, ´ Giulio Biroli, Clement Hongler, and Matthieu Wyart. Scaling description of generalization with ´ number of parameters in deep learning. arXiv preprint arXiv:1901.01608, 2019a. \nMario Geiger, Stefano Spigler, Stephane d’Ascoli, Levent Sagun, Marco Baity-Jesi, Giulio Biroli, ´ and Matthieu Wyart. Jamming transition as a paradigm to understand the loss landscape of deep neural networks. Physical Review E, 100(1):012115, 2019b. \nTrevor Hastie, Andrea Montanari, Saharon Rosset, and Ryan J. Tibshirani. Surprises in high", + "bbox": [ + 171, + 313, + 826, + 914 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "dimensional ridgeless least squares interpolation, 2019. ", + "bbox": [ + 174, + 895, + 820, + 924 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Roger A Horn, Roger A Horn, and Charles R Johnson. Matrix Analysis. Cambridge University Press, 1990. ", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Dmitry Kobak, Jonathan Lomond, and Benoit Sanchez. Optimal ridge penalty for real-world highdimensional data can be zero or negative due to the implicit ridge regularization. arXiv preprint arXiv:1805.10939, 2018. ", + "bbox": [ + 173, + 141, + 821, + 183 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images. 2009. ", + "bbox": [ + 171, + 191, + 821, + 222 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Andrew K Lampinen and Surya Ganguli. An analytic theory of generalization dynamics and transfer learning in deep linear networks. arXiv preprint arXiv:1809.10374, 2018. ", + "bbox": [ + 173, + 229, + 823, + 258 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Yann Le Cun, Ido Kanter, and Sara A Solla. Eigenvalues of covariance matrices: Application to neural-network learning. Physical Review Letters, 66(18):2396, 1991. ", + "bbox": [ + 173, + 267, + 823, + 296 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Yann LeCun, Ido Kanter, and Sara A Solla. Second order properties of error surfaces: Learning time and generalization. In Advances in neural information processing systems, pp. 918–924, 1991. ", + "bbox": [ + 174, + 304, + 821, + 334 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Tengyuan Liang and Alexander Rakhlin. Just interpolate: Kernel” ridgeless” regression can generalize. arXiv preprint arXiv:1808.00387, 2018. ", + "bbox": [ + 173, + 342, + 823, + 371 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Tengyuan Liang, Alexander Rakhlin, and Xiyu Zhai. On the risk of minimum-norm interpolants and restricted lower isometry of kernels. arXiv preprint arXiv:1908.10292, 2019. ", + "bbox": [ + 173, + 378, + 823, + 409 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Tengyuan Liang, Alexander Rakhlin, and Xiyu Zhai. On the multiple descent of minimum-norm interpolants and restricted lower isometry of kernels. 2020. ", + "bbox": [ + 171, + 416, + 823, + 446 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Marco Loog and Robert PW Duin. The dipping phenomenon. In Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR), pp. 310–317. Springer, 2012. ", + "bbox": [ + 176, + 454, + 821, + 498 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Marco Loog, Tom Viering, and Alexander Mey. Minimizers of the empirical risk and risk monotonicity. In Advances in Neural Information Processing Systems, pp. 7476–7485, 2019. ", + "bbox": [ + 174, + 506, + 820, + 536 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Yasaman Mahdaviyeh and Zacharie Naulet. Asymptotic risk of least squares minimum norm estimator under the spike covariance model. arXiv preprint arXiv:1912.13421, 2019. ", + "bbox": [ + 173, + 542, + 821, + 573 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Adam W Marcus, Daniel A Spielman, and Nikhil Srivastava. Ramanujan graphs and the solution of the kadison-singer problem. arXiv preprint arXiv:1408.4421, 2014. ", + "bbox": [ + 171, + 580, + 823, + 611 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Song Mei and Andrea Montanari. The generalization error of random features regression: Precise asymptotics and double descent curve. arXiv preprint arXiv:1908.05355, 2019. ", + "bbox": [ + 171, + 618, + 823, + 647 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Partha P. Mitra. Understanding overfitting peaks in generalization error: Analytical risk curves for l2 and l1 penalized interpolation. ArXiv, abs/1906.03667, 2019. ", + "bbox": [ + 169, + 656, + 823, + 685 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Vidya Muthukumar, Kailas Vodrahalli, and Anant Sahai. Harmless interpolation of noisy data in regression. arXiv preprint arXiv:1903.09139, 2019. ", + "bbox": [ + 173, + 693, + 823, + 723 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Preetum Nakkiran. More data can hurt for linear regression: Sample-wise double descent. arXiv preprint arXiv:1912.07242, 2019. ", + "bbox": [ + 171, + 731, + 823, + 761 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Preetum Nakkiran, Gal Kaplun, Yamini Bansal, Tristan Yang, Boaz Barak, and Ilya Sutskever. Deep double descent: Where bigger models and more data hurt. In International Conference on Learning Representations, 2020. URL https://openreview.net/forum?id $\\underline { { \\underline { { \\mathbf { \\Pi } } } } }$ B1g5sA4twr. ", + "bbox": [ + 173, + 768, + 823, + 813 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Brady Neal, Sarthak Mittal, Aristide Baratin, Vinayak Tantia, Matthew Scicluna, Simon LacosteJulien, and Ioannis Mitliagkas. A modern take on the bias-variance tradeoff in neural networks. arXiv preprint arXiv:1810.08591, 2018. ", + "bbox": [ + 171, + 820, + 823, + 863 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Manfred Opper. Statistical mechanics of learning: Generalization. The Handbook of Brain Theory and Neural Networks, 922-925., 1995. ", + "bbox": [ + 171, + 871, + 825, + 900 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Manfred Opper. Learning to generalize. Frontiers of Life, 3(part 2), pp.763-775., 2001. ", + "bbox": [ + 173, + 909, + 745, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ali Rahimi and Benjamin Recht. Random features for large-scale kernel machines. In Advances in neural information processing systems, pp. 1177–1184, 2008. ", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Marina Skurichina and Robert PW Duin. Bagging, boosting and the random subspace method for linear classifiers. Pattern Analysis & Applications, 5(2):121–135, 2002. ", + "bbox": [ + 173, + 140, + 823, + 170 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Stefano Spigler, Mario Geiger, Stephane d’Ascoli, Levent Sagun, Giulio Biroli, and Matthieu Wyart.´ A jamming transition from under-to over-parametrization affects loss landscape and generalization. arXiv preprint arXiv:1810.09665, 2018. ", + "bbox": [ + 178, + 178, + 823, + 222 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Gerard V Trunk. A problem of dimensionality: A simple example. IEEE Transactions on pattern analysis and machine intelligence, (3):306–307, 1979. ", + "bbox": [ + 171, + 229, + 823, + 258 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Han Xiao, Kashif Rasul, and Roland Vollgraf. Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms. arXiv preprint arXiv:1708.07747, 2017. ", + "bbox": [ + 171, + 268, + 823, + 297 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Ji Xu and Daniel J Hsu. On the number of variables to use in principal component regression. In Advances in Neural Information Processing Systems, pp. 5095–5104, 2019. ", + "bbox": [ + 171, + 306, + 823, + 335 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "A APPENDIX ", + "text_level": 1, + "bbox": [ + 176, + 102, + 297, + 117 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "In Section A.1 and A.2 we provide the proofs for sample-monotonicity and model-size monotonicity. In Section A.4 we include additional and omitted plots. In Section B we investigate whether monotonicity provably holds in more general models, and present a monotonicity conjecture for non-isotropic covariates. ", + "bbox": [ + 174, + 137, + 825, + 194 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "A.1 SAMPLE MONOTONICITY PROOFS ", + "text_level": 1, + "bbox": [ + 176, + 215, + 452, + 229 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "First we prove Lemma 1. ", + "bbox": [ + 174, + 244, + 338, + 260 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Proof of Lemma $^ { l }$ . For isotropic $x$ , the test risk is related to the parameter error as: ", + "bbox": [ + 173, + 284, + 715, + 300 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/c97d13ce47a347c33a9d571dff6f8d2d6723326494388228cf1b8a50d62e7ccc.jpg", + "text": "$$\n\\begin{array} { r l } & { R ( \\hat { \\beta } ) : = \\underset { ( x , y ) \\sim \\mathcal { D } } { \\mathbb { E } } [ ( \\langle x , \\hat { \\beta } \\rangle - y ) ^ { 2 } ] } \\\\ & { \\quad \\quad = \\underset { x \\sim \\mathcal { N } ( 0 , I _ { d } ) , \\eta \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } ) } { \\mathbb { E } } [ ( \\langle x , \\hat { \\beta } - \\beta ^ { * } \\rangle + \\eta ) ^ { 2 } ] } \\\\ & { \\quad \\quad = | | \\hat { \\beta } - \\beta ^ { * } | | _ { 2 } ^ { 2 } + \\sigma ^ { 2 } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 334, + 308, + 663, + 392 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Plugging in the form of $\\hat { \\beta } _ { n , \\lambda }$ and expanding: ", + "bbox": [ + 176, + 400, + 467, + 416 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/c911b8b3710c18864e6f659d837cf52911f7d4f019ed2f3dd867f5c0d66b6396.jpg", + "text": "$$\n\\begin{array} { r l } & { \\bar { R } ( \\hat { \\beta } _ { n , \\lambda } ) : = \\underset { X , y \\sim \\mathcal { D } ^ { n } } { \\mathbb { E } } [ R ( \\hat { \\beta } _ { n , \\lambda } ) ] } \\\\ & { = \\mathbb { E } [ \\| \\hat { \\beta } _ { n , \\lambda } - \\beta ^ { * } \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { = \\underset { X , y } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } y - \\beta \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { = \\underset { X , \\eta \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } I _ { n } ) } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } ( X \\beta ^ { * } + \\eta ) - \\beta ^ { * } \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { = \\underset { X } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } X \\beta ^ { * } - \\beta ^ { * } \\| _ { 2 } ^ { 2 } ] + \\underset { X , \\eta } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } \\eta \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { = \\underset { X } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } X \\beta ^ { * } - \\beta ^ { * } \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } \\| _ { F } ^ { 2 } ] + \\sigma ^ { 2 } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 230, + 424, + 764, + 590 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Now let $X \\ = \\ U \\Sigma V ^ { T }$ be the full singular value decomposition of $X$ , with $U \\ \\in \\ \\mathbb { R } ^ { n \\times n } , \\Sigma \\ \\in$ $\\mathbb { R } ^ { n \\times d } , V \\in \\mathbb { R } ^ { d \\times d }$ . Let $( \\gamma _ { 1 } , \\ldots \\gamma _ { d } )$ denote the singular values, defining $\\gamma _ { i } = 0$ for $i > \\operatorname* { m i n } ( n , d )$ . Then, continuing: ", + "bbox": [ + 174, + 598, + 825, + 642 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/040b59fb6e2e081b3c86b7cc23e606f3f2af2702a88eacaab6aa38b59506e573.jpg", + "text": "$$\n\\begin{array} { r l } & { \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\underset { V , \\Sigma } { \\mathbb { E } } [ | | \\mathrm { d i a g } ( \\{ \\frac { - \\lambda } { \\gamma _ { i } ^ { 2 } + \\lambda } \\} ) V ^ { T } \\beta ^ { * } | | _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } } \\\\ & { \\quad \\quad = \\underset { z \\sim \\mathrm { U n i f } ( 1 ) \\frac { \\mathbb { E } } { \\delta } } { \\underbrace { \\mathrm { U } \\mathrm { E } } } [ | | \\mathrm { d i a g } ( \\{ \\frac { - \\lambda } { \\gamma _ { i } ^ { 2 } + \\lambda } \\} ) z | | _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } } \\\\ & { \\quad \\quad = \\frac { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } { d } \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { \\lambda ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } } \\\\ & { \\quad \\quad = \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } / d + \\sigma ^ { 2 } \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 205, + 650, + 764, + 810 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "In Line (10) follows because by symmetry, the distribution of $V$ is a uniformly random orthonormal matrix, and $\\Sigma$ is independent of $V$ . Thus, $z : = V ^ { T } \\beta ^ { * }$ is distributed as a uniformly random point on the unit sphere of radius $| | \\beta ^ { * } | | _ { 2 }$ . ", + "bbox": [ + 174, + 818, + 823, + 861 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Next we prove Lemma 2. ", + "bbox": [ + 174, + 909, + 341, + 924 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Proof of Lemma 2. First, we determine the optimal ridge parameter. Using Lemma 1, we have ", + "bbox": [ + 169, + 102, + 792, + 119 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/a623c8e79a24fdd865da11d4fdff60646c3d940ef3f190067fd57aa38bac12da.jpg", + "text": "$$\n\\begin{array} { r l } & { \\frac { \\partial } { \\partial \\lambda } \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\frac { \\partial } { \\partial \\lambda } _ { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma } \\left[ \\displaystyle \\sum _ { i } \\frac { | | \\beta | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } / d + \\sigma ^ { 2 } \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } \\right] } \\\\ & { = 2 ( | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda / d - \\sigma ^ { 2 } ) _ { ( \\underbrace { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma } _ { > 0 } } \\left[ \\displaystyle \\sum _ { i } \\frac { \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 3 } } \\right] } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 310, + 127, + 686, + 233 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Thus, $\\begin{array} { r } { \\frac { \\partial } { \\partial \\lambda } \\overline { { R } } ( \\widehat { \\beta } _ { n , \\lambda } ) = 0 \\implies \\lambda = \\frac { d \\sigma ^ { 2 } } { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } } \\end{array}$ and we conclude that $\\begin{array} { r } { \\lambda _ { n } ^ { \\mathrm { o p t } } = \\frac { d \\sigma ^ { 2 } } { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } } \\end{array}$ ", + "bbox": [ + 174, + 241, + 673, + 265 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "For this optimal parameter, the test risk follows from Lemma 1 as ", + "bbox": [ + 173, + 272, + 606, + 287 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/48d72fd4dc42f61ccda5d47fc0360cd5f8963fbe8f3f90da572f6323560f904d.jpg", + "text": "$$\n\\begin{array} { l } { \\displaystyle \\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } ) = \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) } \\\\ { \\displaystyle = \\frac { \\mathbb { E } } { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma _ { n } } \\left[ \\sum _ { i = 1 } ^ { d } \\frac { \\sigma ^ { 2 } } { \\gamma _ { i } ^ { 2 } + d \\sigma ^ { 2 } / | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } \\right] + \\sigma ^ { 2 } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 343, + 295, + 653, + 364 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Proof of Theorem 2. We follow a similar proof strategy as in Theorem 1: we invoke singular value interlacing $( \\widetilde { \\gamma } _ { i } \\geq \\gamma _ { i } )$ for the data matrix when adding a single sample. We then apply Lemma 1 to eargue that the test risk varies monotonically with the singular values. ", + "bbox": [ + 173, + 412, + 825, + 455 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We have ", + "bbox": [ + 174, + 465, + 233, + 479 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/de3244b98b022f93b1ca9519f7631fa81e4e9af584f4d8319f85bbc231b1557d.jpg", + "text": "$$\n{ \\overline { { R } } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\operatorname * { \\mathbb { E } } _ { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma } [ \\sum _ { i } \\underbrace { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } / d + \\sigma ^ { 2 } \\gamma _ { i } ^ { 2 } } _ { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ]\n$$", + "text_format": "latex", + "bbox": [ + 338, + 478, + 660, + 535 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "and we compute how each term in the sum varies with $\\gamma _ { i }$ : ", + "bbox": [ + 173, + 541, + 553, + 556 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/083dc399d19565db2a21c827567743ee4f98ee2e1b3dd3f08e16f076c93b48f9.jpg", + "text": "$$\n\\begin{array} { l } { \\displaystyle { \\frac { \\partial } { \\partial \\gamma _ { i } } \\sum _ { i } S ( \\gamma _ { i } ) = \\frac { \\partial } { \\partial \\gamma _ { i } } S ( \\gamma _ { i } ) } } \\\\ { \\displaystyle { \\quad = ( \\frac { - 2 \\gamma _ { i } } { d } ) \\frac { 2 | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } + d \\sigma ^ { 2 } ( \\gamma _ { i } ^ { 2 } - \\lambda ) } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 3 } } } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 325, + 564, + 671, + 640 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Thus we have ", + "bbox": [ + 173, + 648, + 267, + 662 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/56481a4012179ea03ab8bd2ae7aed121ef63b3b0de4415a7172237c75670635e.jpg", + "text": "$$\n\\lambda \\geq \\frac { d \\sigma ^ { 2 } } { 2 \\vert \\vert \\beta ^ { * } \\vert \\vert ^ { 2 } } \\implies \\frac { \\partial } { \\partial \\gamma _ { i } } S ( \\gamma _ { i } ) \\leq 0\n$$", + "text_format": "latex", + "bbox": [ + 383, + 669, + 614, + 705 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "By the coupling argument in Theorem 1, this implies that the test risk is monotonic: ", + "bbox": [ + 174, + 713, + 722, + 728 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/e72e37a8203a6e75f3017eb409e9edb1d55d482ed226ed8392499a42f1c091c7.jpg", + "text": "$$\n\\begin{array} { r l } & { \\overline { { R } } ( \\hat { \\beta } _ { n + 1 , \\lambda } ) - \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) } \\\\ & { \\quad = \\underset { ( \\widetilde { \\gamma } _ { 1 } , \\dots , \\widetilde { \\gamma } _ { d } ) \\sim \\Gamma _ { n + 1 } } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } S ( \\widetilde { \\gamma } _ { i } ) \\right] - \\underset { ( \\gamma _ { 1 } , \\dots , \\gamma _ { d } ) \\sim \\Gamma _ { n } } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } S ( \\gamma _ { i } ) \\right] } \\\\ & { \\quad = \\underset { ( \\{ \\widetilde { \\gamma } _ { i } \\} , \\{ \\gamma _ { i } \\} ) \\sim \\Pi } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } S ( \\widetilde { \\gamma } _ { i } ) - S ( \\gamma _ { i } ) \\right] } \\\\ & { \\quad \\le 0 } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 303, + 757, + 692, + 887 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "where $\\Pi$ is the coupling. Line (17) follows from Equation (15), and the fact that the coupling obeys $\\widetilde { \\gamma } _ { i } \\geq \\gamma _ { i }$ . □ ", + "bbox": [ + 173, + 895, + 826, + 925 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "A.2 PROJECTION MODEL PROOFS ", + "text_level": 1, + "bbox": [ + 176, + 103, + 423, + 118 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Lemma 3. For all $\\theta \\in \\mathbb { R } ^ { p }$ , $d , n \\in \\mathbb { N } ,$ , and $\\lambda > 0 ;$ , let $\\ b { X } \\in \\mathbb { R } ^ { n \\times p }$ be a matrix with i.i.d. $\\mathcal { N } ( 0 , 1 )$ entries. Let $P \\in \\mathbb { R } ^ { d \\times p }$ be a random orthonormal matrix. Define $\\widetilde { X } : = X P ^ { T }$ . Let $\\left( \\gamma _ { 1 } , \\dots , \\gamma _ { m } \\right)$ be the singular values of the data matrix $\\tilde { X } \\in \\mathbb { R } ^ { n \\times d }$ , for $m : = \\operatorname* { m a x } ( n , d )$ (with $\\gamma _ { i } ~ = ~ 0$ for $i > \\operatorname* { m i n } ( n , d ) )$ . Let $\\Gamma _ { d }$ be the distribution of singular values $\\left( \\gamma _ { 1 } , \\ldots , \\gamma _ { m } \\right)$ . ", + "bbox": [ + 173, + 128, + 825, + 193 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Then, the optimal ridge parameter is constant for all $d$ : $\\begin{array} { r } { \\lambda _ { d } ^ { \\mathrm { o p t } } = \\frac { p ^ { 2 } \\widetilde \\sigma ^ { 2 } } { d | | \\theta | | _ { 2 } ^ { 2 } } } \\end{array}$ . where we define $\\widetilde { \\sigma } ^ { 2 } : = \\ :$ $\\begin{array} { r } { \\sigma ^ { 2 } + \\frac { p - d } { p } | | \\boldsymbol { \\theta } | | _ { 2 } ^ { 2 } } \\end{array}$ . Moreover, the optimal expected test risk can be written as ", + "bbox": [ + 173, + 196, + 826, + 239 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/468fe85c9587c5a5c7cbe90d3a3b9b112d10447b03fa0a4f7669fc3630f11d15.jpg", + "text": "$$\n\\overline { { R } } ( \\hat { \\beta } _ { d } ^ { \\mathrm { o p t } } ) = \\widetilde { \\sigma } ^ { 2 } + \\underset { ( \\gamma _ { 1 } , \\ldots , \\gamma _ { m } ) \\sim \\Gamma _ { d } } { \\mathbb { E } } \\left[ \\sum _ { i = 1 } ^ { p } \\frac { \\widetilde { \\sigma } ^ { 2 } } { \\gamma _ { i } ^ { 2 } + \\frac { \\widetilde { \\sigma } ^ { 2 } p ^ { 2 } } { d | | \\theta | | _ { 2 } ^ { 2 } } } \\right]\n$$", + "text_format": "latex", + "bbox": [ + 333, + 246, + 663, + 297 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Proof. This proof follows exactly analogously as the proof of Lemma 2 from Lemma 1, in Section A.1. □ ", + "bbox": [ + 173, + 310, + 821, + 339 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Lemma 4. For all $\\theta \\in \\mathbb { R } ^ { p }$ , $d , n \\in \\mathbb { N } ,$ , and $\\lambda > 0$ , let $\\ b { X } \\in \\mathbb { R } ^ { n \\times p }$ be a matrix with i.i.d. $\\mathcal { N } ( 0 , 1 )$ \nentries. Let $P \\in \\mathbb { R } ^ { d \\times p }$ be a random orthonormal matrix. Define $\\widetilde X : = X P ^ { T }$ and $\\beta ^ { * } : = P \\theta$ . ", + "bbox": [ + 171, + 347, + 823, + 380 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Let $\\left( \\gamma _ { 1 } , \\dots , \\gamma _ { m } \\right)$ be the singular values of the data matrix $\\tilde { X } \\in \\mathbb { R } ^ { n \\times d }$ , for $m : = \\operatorname* { m a x } ( n , d )$ (with $\\gamma _ { i } = 0$ for $i > \\operatorname* { m i n } ( n , d ) )$ . Let $\\Gamma _ { d }$ be the distribution of singular values $\\left( \\gamma _ { 1 } , \\dots , \\gamma _ { m } \\right)$ . ", + "bbox": [ + 173, + 386, + 825, + 417 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Then, the expected test risk is ", + "bbox": [ + 174, + 422, + 369, + 438 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/741d2372fad09c0cbce14bcf5839b8447076a4cbcd48b57657173a4429b1c348.jpg", + "text": "$$\n\\begin{array} { r l } & { \\overline { { R } } ( \\hat { \\beta } _ { d , \\lambda } ) : = \\underset { P } { \\mathbb { E } } \\underset { \\widetilde { X } , \\widetilde { y } \\sim \\mathcal { D } ^ { n } } { \\mathbb { E } } [ R _ { P } ( \\hat { \\beta } _ { d , \\lambda } ( \\widetilde { X } , \\overrightarrow { y } ) ] } \\\\ & { = \\sigma ^ { 2 } + ( 1 - \\frac { d } { p } ) | | \\theta | | _ { 2 } ^ { 2 } } \\\\ & { + \\underset { ( \\gamma _ { 1 } , \\dotsc , \\gamma _ { m } ) \\sim \\Gamma _ { d } } { \\mathbb { E } } \\left[ \\underset { i = 1 } { \\overset { p } { \\sum } } \\frac { ( \\sigma ^ { 2 } + \\frac { p - d } { p } | | \\theta | | _ { 2 } ^ { 2 } ) \\gamma _ { i } ^ { 2 } + \\frac { d } { p ^ { 2 } } | | \\theta | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } \\right] } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 313, + 444, + 684, + 554 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Proof of Lemma 4. We first define the parameter that minimizes the population risk. It follows directly that: ", + "bbox": [ + 176, + 566, + 823, + 594 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/35bea86cddbd631fb6b4870684bfe035967b6d8211cf49b4cb25e93f8ad7fe5c.jpg", + "text": "$$\n\\beta _ { P } ^ { * } : = \\underset { \\beta \\in \\mathbb { R } ^ { d } } { \\mathrm { a r g m i n } } R _ { P } ( \\beta ) = P \\theta\n$$", + "text_format": "latex", + "bbox": [ + 401, + 593, + 596, + 621 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "First, we can expand the risk as ", + "bbox": [ + 173, + 632, + 382, + 647 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/03d187ef1b8071dac932f45747b3294d7774fd0b3adde9b08928e633c8afcb6b.jpg", + "text": "$$\n\\begin{array} { r l } & { R ( \\hat { \\beta } ) = \\underset { ( \\bar { x } , y ) \\sim \\mathcal { D } } { \\mathbb { E } } [ ( \\langle P x , \\hat { \\beta } \\rangle - y ) ^ { 2 } ] } \\\\ & { \\quad = \\underset { ( \\bar { x } , y ) \\sim \\mathcal { D } , \\eta \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } ) } { \\mathbb { E } } [ ( \\langle x , P ^ { T } \\hat { \\beta } - \\theta \\rangle + \\eta ) ^ { 2 } ] } \\\\ & { \\quad = \\sigma ^ { 2 } + \\vert \\vert \\theta - P ^ { T } \\hat { \\beta } \\vert \\vert _ { 2 } ^ { 2 } } \\\\ & { \\quad = \\sigma ^ { 2 } + \\vert \\vert \\theta - P ^ { T } \\beta ^ { * } \\vert \\vert _ { 2 } ^ { 2 } + \\vert \\vert P ^ { T } \\beta ^ { * } - P ^ { T } \\hat { \\beta } \\vert \\vert _ { 2 } ^ { 2 } } \\\\ & { \\quad + 2 \\langle ( \\theta - P ^ { T } \\beta ^ { * } ) , P ^ { T } \\beta ^ { * } - P ^ { T } \\hat { \\beta } \\rangle } \\\\ & { \\quad = \\sigma ^ { 2 } + \\vert \\vert \\theta - P ^ { T } \\beta ^ { * } \\vert \\vert _ { 2 } ^ { 2 } + \\vert \\vert P ^ { T } \\beta ^ { * } - P ^ { T } \\hat { \\beta } \\vert \\vert _ { 2 } ^ { 2 } } \\\\ & { \\quad = \\sigma ^ { 2 } + \\vert \\vert \\vert \\theta - P ^ { T } P \\theta \\vert \\vert _ { 2 } ^ { 2 } + \\vert \\vert \\beta ^ { * } - \\hat { \\beta } \\vert \\vert _ { 2 } ^ { 2 } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 333, + 652, + 665, + 823 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The cross terms in Line (22) vanish because the first-order optimality condition for $\\beta ^ { * }$ implies that $\\beta ^ { * }$ satisfies $P ( \\theta ^ { * } - P ^ { T } \\beta ^ { * } ) = 0$ . We now simplify each of the two remaining terms. ", + "bbox": [ + 173, + 833, + 825, + 863 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "First, we have that: ", + "bbox": [ + 173, + 869, + 300, + 883 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/4669a600f5dddc038e7c628ec71b91a5531e739c9c42893ae9b17ddadb44a8bd.jpg", + "text": "$$\n\\underset { P } { \\mathbb { E } } | | \\theta - P ^ { T } P \\theta | | _ { 2 } ^ { 2 } = ( 1 - \\frac { d } { p } ) | | \\theta | | _ { 2 } ^ { 2 }\n$$", + "text_format": "latex", + "bbox": [ + 385, + 888, + 611, + 922 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "since $P ^ { T } P$ is an orthogonal projection onto a random $d$ -dimensional subspace. ", + "bbox": [ + 173, + 102, + 692, + 119 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Now, recall we have ${ \\vec { y } } = X \\theta + \\eta$ where $\\eta \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } I _ { n } )$ . Expand this as: ", + "bbox": [ + 174, + 126, + 660, + 143 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/c1a9b8472650c02f7455387333ca5dfa7f0349357d7a1ca1091251cf1e45a972.jpg", + "text": "$$\n\\begin{array} { l } { { \\vec { y } = X \\theta + \\eta } } \\\\ { { \\ = X P ^ { T } P \\theta + X ( 1 - P ^ { T } P ) \\theta + \\eta } } \\\\ { { \\ = \\widetilde { X } \\beta ^ { * } + \\varepsilon + \\eta } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 377, + 174, + 620, + 236 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "where $\\varepsilon : = X ( 1 - P ^ { T } P ) \\theta$ . Note that conditioned on $P$ , the three terms $\\widetilde { X } , \\varepsilon$ and $\\eta$ are conditionally independent, since $P ^ { T } P$ and $( I - P ^ { T } P )$ project $X$ onto orthogonal subspaces. And further, $\\varepsilon \\sim$ $\\mathcal { N } ( \\dot { 0 _ { \\cdot } } | | ( 1 - P ^ { T } P ) \\theta | | ^ { 2 } I _ { n } )$ . ", + "bbox": [ + 173, + 244, + 825, + 291 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/60e0378b64b76b4eab2103bf6418c25dfbf2648197e5f3b7ca1f73f584e033df.jpg", + "text": "$$\n\\begin{array} { r l } & { \\frac { \\mathbb { E } } { P } \\underset { \\tilde { X } , y } { \\mathbb { E } } | | \\hat { \\boldsymbol { \\beta } } - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { = \\underset { P } { \\mathbb { E } } \\underset { \\tilde { X } , y } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\boldsymbol { y } - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { = \\underset { P } { \\mathbb { E } } \\underset { \\tilde { X } , y , \\varepsilon , \\eta } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } ( \\widetilde { X } \\boldsymbol { \\beta } ^ { * } + \\varepsilon + \\eta ) - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { = \\underset { P } { \\overset { \\mathbb { E } } { \\mathbb { X } } } \\underset { y , \\varepsilon , \\eta } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\widetilde { X } \\boldsymbol { \\beta } ^ { * } - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { = \\underset { P } { \\overset { \\mathbb { E } } { \\mathbb { X } } } \\underset { y , \\varepsilon , \\eta } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\widetilde { X } \\boldsymbol { \\beta } ^ { * } - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { + \\| ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\varepsilon | | _ { 2 } ^ { 2 } + | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\eta | | _ { 2 } ^ { 2 } ] } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 308, + 319, + 691, + 472 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Now, since $\\widetilde { X }$ is conditionally independent of $\\varepsilon$ conditioned on $P$ , ", + "bbox": [ + 173, + 507, + 607, + 525 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/15570c750f46fbfdd10667eca45b3e9a24a57fe46a295a8570217d0ece4d3a0e.jpg", + "text": "$$\n\\begin{array} { r l } & { \\frac { \\mathbb { E } } { F } \\underset { \\tilde { X } , y , \\varepsilon | P } { \\mathbb { E } } \\ \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\varepsilon \\rVert _ { 2 } ^ { 2 } } \\\\ & { = \\mathbb { E } \\ \\underset { \\tilde { Y } } { \\mathbb { E } } \\ [ \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\rVert _ { F } ^ { 2 } \\ \\underset { \\varepsilon | P } { \\mathbb { E } } [ \\lVert \\varepsilon \\rVert _ { 2 } ^ { 2 } ] } \\\\ & { = \\frac { \\mathbb { E } } { \\frac { \\mathbb { E } } { \\tilde { X } } } \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\rVert _ { F } ^ { 2 } \\ \\underset { \\varepsilon , \\varepsilon } { \\mathbb { E } } [ \\lVert \\varepsilon \\rVert _ { 2 } ^ { 2 } ] } \\\\ & { = \\underset { \\tilde { X } } { \\mathbb { E } } [ \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\rVert _ { F } ^ { 2 } ] \\cdot \\underset { { P } , X } { \\mathbb { E } } [ \\lVert X ( 1 - P ^ { T } P ) \\theta \\rVert _ { 2 } ^ { 2 } ] } \\\\ & { = \\underset { \\tilde { X } } { \\mathbb { E } } [ \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\rVert _ { F } ^ { 2 } ] ( \\frac { p - d } { p } | \\theta \\rVert _ { 2 } ^ { 2 } ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 250, + 531, + 627, + 694 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "where Line (37) holds because the marginal distribution of $\\widetilde { X }$ does not depend on $P$ . ", + "bbox": [ + 173, + 703, + 728, + 722 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Similarly, ", + "bbox": [ + 173, + 729, + 240, + 744 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/27105b3c05a2ab3257c0e5570b44af98c9a9c874e94dd0667e9c9edeff10bd14.jpg", + "text": "$$\n\\begin{array} { r l } & { \\frac { \\mathbb { E } } { P } \\underset { \\widetilde { X } , y , \\eta | P } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\eta | | _ { 2 } ^ { 2 } } \\\\ & { = \\sigma ^ { 2 } \\underset { \\widetilde { X } } { \\mathbb { E } } [ | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } | | _ { F } ^ { 2 } ] } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 380, + 752, + 619, + 815 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Now let $\\tilde { \\cal X } \\ = \\ { \\cal U } \\Sigma { \\cal V } ^ { T }$ be the full singular value decomposition of $\\widetilde { X }$ , with $U \\ \\in \\ \\mathbb { R } ^ { n \\times n } , \\Sigma \\ \\in$ $\\mathbb { R } ^ { n \\times d } , V \\in \\mathbb { R } ^ { d \\times d }$ . Let $( \\gamma _ { 1 } , \\dots \\gamma _ { m } )$ denote the singular values, where $m = \\operatorname* { m a x } ( n , d )$ and defining $\\gamma _ { i } = 0$ for $i > \\operatorname* { m i n } ( n , d )$ . ", + "bbox": [ + 173, + 835, + 825, + 881 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Observe that by symmetry, $\\widetilde { X } = X P ^ { T }$ and $P$ are independent, because the joint distribution $( \\widetilde { X } , P )$ is equivalent to the distribution $( \\widetilde { X } Q , P Q )$ for a random orthonormal $Q \\in \\mathbb { R } ^ { p \\times p }$ . Thus $\\widetilde { X }$ and ", + "bbox": [ + 173, + 890, + 825, + 925 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "$\\beta ^ { * } = P \\theta$ are also independent, and we have: ", + "bbox": [ + 174, + 103, + 468, + 118 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/2c5cf2c29a1457b5e11f9237a8780aec3ba4175cc252997049b6d706d1666b43.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathbb { E } \\mathbb { E } \\| \\{ \\hat { X } ^ { \\prime } \\} \\hat { X } + \\lambda \\mathcal { I } \\} ^ { - 1 } \\hat { X } ^ { \\prime } \\hat { X } ^ { \\prime } - \\delta ^ { * } \\} \\| _ { 2 } ^ { 2 } } \\\\ & { = \\frac { 1 } { b } \\mathbb { E } \\hat { X } ^ { \\prime } \\| \\mathrm { H i s s } ( \\hat { \\mathcal { Z } } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda ) b ^ { \\mathcal { N } / 2 } \\| _ { 2 } ^ { 2 } } \\\\ & { = \\mathbb { E } \\mathbb { E } \\mathbb { E } \\mathbb { E } \\mathbb { E } \\bigg [ \\| \\mathrm { H i s s } ( \\hat { \\mathcal { Z } } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda ) \\| ^ { \\mathcal { N } / 2 } b ^ { \\mathcal { N } / 2 } \\| _ { 2 } ^ { 2 } } \\\\ & { - \\mathbb { E } \\mathbb { E } \\mathbb { E } \\mathbb { E } \\bigg [ \\| \\mathrm { H i s s } ( \\hat { \\mathcal { Z } } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda ) \\| ^ { \\mathcal { N } / 2 } \\bigg ] \\| _ { 2 } ^ { 2 } } \\\\ & { = \\mathbb { E } _ { \\hat { X } ^ { \\prime } \\sim \\mathrm { N } \\times \\mathrm { W } ( \\hat { \\mathcal { Z } } ) } \\mathbb { E } \\| \\mathrm { H i s s } ( \\hat { \\mathcal { Z } } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda ) \\| ^ { \\mathcal { N } / 2 } } \\\\ & { = \\mathbb { E } \\mathbb { E } \\| \\hat { X } ^ { \\prime } \\| ^ { 2 } \\mathbb { E } \\| \\mathrm { H } ^ { 2 } \\mathbb { E } \\bigg [ \\mathrm { H } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda \\Big ] ^ { \\| \\mathcal { N } / 2 } } \\\\ & { = \\frac { 1 } { b } \\mathbb { E } \\hat { X } ^ { \\prime } \\| ^ { 2 } \\mathbb { E } \\bigg [ \\mathcal { P } _ { \\frac { e } { 2 } } ^ { - 1 } \\frac { \\lambda ^ { 2 } } { b } \\Big ] ^ { 2 } } \\\\ & = \\frac { 1 } { b } \\mathbb { E } \\frac { \\hat { X } ^ { \\prime } } { \\| \\mathcal { P } \\| \\mathcal { P } \\| ^ { 2 } \\| _ { 2 } ^ { 2 } } \\mathbb { E } \\bigg [ \\int _ { 0 } ^ { \\mathcal { N } / 2 } \\frac { \\lambda ^ { 2 } } \\| \\mathcal { P } \\| _ { 2 } ^ { 2 } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 338, + 125, + 663, + 383 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Finally, continuing from Line (33), we can use Lines (38), (40), and (47) to write: ", + "bbox": [ + 173, + 400, + 712, + 416 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/afc96577bb1030ba4580be2296ccfb837633a4009485fbd8ae0a3eea348ab376.jpg", + "text": "$$\n\\begin{array} { r l } & { \\frac { \\mathbb { E } } { \\rho } \\frac { \\| \\tilde { \\rho } - \\tilde { \\rho } ^ { - 1 } \\| ^ { 2 } } { \\mathcal { F } _ { x , y } } } \\\\ & { = ( \\sigma ^ { 2 } + \\frac { \\rho - \\tilde { \\rho } - d } { p } \\| \\theta \\| _ { 2 } ^ { 2 } \\frac { \\mathbb { E } \\| ( \\tilde { X } ^ { \\mathcal { T } } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { \\mathcal { T } } \\| _ { \\mathcal { F } _ { x } ^ { 1 } } ^ { 2 } } { \\mathcal { F } _ { x } ^ { 1 } } } \\\\ & { + \\frac { d } { \\gamma } \\| \\theta \\| _ { 2 } ^ { 2 } \\frac { \\mathbb { E } } { \\varepsilon } \\| \\sum _ { i } ^ { 2 } \\frac { \\lambda ^ { 2 } } { ( \\sqrt { d } ^ { 2 } + \\lambda I ) ^ { 2 } } | } \\\\ & { = ( \\sigma ^ { 2 } + \\frac { p - d } { p } \\| \\theta \\| _ { 2 } ^ { 2 } ) \\frac { \\mathbb { E } } { \\Sigma } \\frac { \\gamma ^ { 2 } } { \\varepsilon } \\langle \\frac { \\eta _ { i } ^ { 2 } } { ( \\sqrt { d } ^ { 2 } + \\lambda I ) ^ { 2 } } | } \\\\ & { + \\frac { d } { \\gamma ^ { 2 } } \\| \\theta \\| _ { 2 } ^ { 2 } \\frac { \\mathbb { E } } { \\Sigma } \\frac { \\lambda ^ { 2 } } { \\langle \\frac { \\eta _ { i } ^ { 2 } + \\lambda I \\rangle ^ { 2 } } { \\varepsilon } } | } \\\\ & = \\frac { \\mathbb { E } } { \\nu } \\langle \\frac { ( \\sigma ^ { 2 } + \\frac { p - d - \\tilde { \\rho } - \\tilde { \\rho } - \\tilde { \\rho } - \\tilde { \\rho } } { i } ) | \\theta \\rangle _ { 2 } ^ { 2 } \\sqrt { \\frac { \\lambda ^ { 2 } } { \\varepsilon } + \\frac { d } { \\gamma ^ { 2 } } | \\theta | _ { 2 } ^ { 2 } \\lambda ^ { 2 } } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 330, + 424, + 666, + 656 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Now, we can continue from Line (24), and apply lines (25), to conclude: ", + "bbox": [ + 173, + 672, + 647, + 688 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/de85f54a0f8d77f7a08c992950801522d81c9da4a94877208449fe5367012368.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathbb { E } \\big [ R ( \\hat { \\beta } ) \\big ] = \\sigma ^ { 2 } + \\mathbb { E } [ | | \\theta - P ^ { T } P \\theta | | _ { 2 } ^ { 2 } ] + \\mathbb { E } [ | | \\beta ^ { * } - \\hat { \\beta } | | _ { 2 } ^ { 2 } ] } \\\\ & { \\qquad = \\sigma ^ { 2 } + ( 1 - \\frac { d } { p } ) | | \\theta | | _ { 2 } ^ { 2 } } \\\\ & { \\qquad + \\mathbb { E } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { p } \\frac { \\big ( \\sigma ^ { 2 } + \\frac { p - d } { p } | | \\theta | | _ { 2 } ^ { 2 } \\big ) \\gamma _ { i } ^ { 2 } + \\frac { d } { p ^ { 2 } } | | \\theta | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } } { \\big ( \\gamma _ { i } ^ { 2 } + \\lambda \\big ) ^ { 2 } } \\right] } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 323, + 717, + 674, + 818 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Proof of Theorem 3. This follows analogously to the proof of Theorem 1, Let $\\widetilde { X } _ { d }$ and $\\widetilde { X } _ { d + 1 }$ be the observed data matrices for $d$ and $d + 1$ e emodel size. As in Theorem 1, there exists a coupling $\\Pi$ between the distributions $\\Gamma _ { d }$ and $\\Gamma _ { d + 1 }$ of the singular values of $\\widetilde { X } _ { d }$ and $\\widetilde { X } _ { d + 1 }$ such that these singular values are interlaced. ", + "bbox": [ + 174, + 863, + 825, + 924 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Thus by Lemma 3, ", + "bbox": [ + 174, + 103, + 299, + 118 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/1ea674240f9e02dc5bd479332892e9eca74d4cd7c9535d5e38da57b023ff0bac.jpg", + "text": "$$\n\\begin{array} { l } { \\overline { { R } } ( \\hat { \\beta } _ { d } ^ { \\mathrm { o p t } } ) = \\widetilde { \\sigma } ^ { 2 } + \\underset { ( \\gamma _ { 1 } , \\ldots , \\gamma _ { m } ) \\sim \\Gamma _ { d + 1 } } { \\mathbb { E } } \\left[ \\overset { p } { \\underset { i = 1 } { \\sum } } \\frac { \\widetilde { \\sigma } ^ { 2 } } { \\gamma _ { i } ^ { 2 } + \\frac { \\widetilde { \\sigma } ^ { 2 } p ^ { 2 } } { d | \\boldsymbol { \\theta } | | _ { 2 } ^ { 2 } } } \\right] } \\\\ { \\geq \\widetilde { \\sigma } ^ { 2 } + \\underset { ( \\widetilde { \\gamma } _ { 1 } , \\ldots , \\widetilde { \\gamma } _ { m } ) \\sim \\Gamma _ { d + 1 } } { \\mathbb { E } } \\left[ \\overset { p } { \\underset { i = 1 } { \\sum } } \\frac { \\widetilde { \\sigma } ^ { 2 } } { \\widetilde { \\gamma } _ { i } ^ { 2 } + \\frac { \\widetilde { \\sigma } ^ { 2 } p ^ { 2 } } { d | \\boldsymbol { \\theta } | | _ { 2 } ^ { 2 } } } \\right] } \\\\ { = \\overline { { R } } ( \\hat { \\beta } _ { d + 1 } ^ { \\mathrm { o p t } } ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 325, + 125, + 668, + 248 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "A.3 NONISOTROPIC REDUCTION ", + "text_level": 1, + "bbox": [ + 176, + 284, + 415, + 299 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Here we observe that results on isotropic regression in Section 2 also imply that ridge regression can be made sample-monotonic even for non-isotropic covariates, if an appropriate regularzier is applied. Specifically, the regularizer depends on the covariance on the inputs. This follows from a general equivalence between the non-isotropic and isotropic problems. ", + "bbox": [ + 173, + 309, + 825, + 367 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Lemma 5. For all $n \\in \\mathbb { N } , d \\in \\mathbb { N } , \\lambda \\in \\mathbb { R } , \\sigma \\in \\mathbb { R } ,$ covariance $\\Sigma \\in \\mathbb { R } ^ { d \\times d }$ , PSD matrix $M \\in \\mathbb { R } ^ { d \\times d }$ and ground-truth $\\beta ^ { * } \\in \\mathbb { R } ^ { d }$ , the following holds. ", + "bbox": [ + 173, + 369, + 821, + 400 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Consider the following two problems: ", + "bbox": [ + 176, + 406, + 421, + 421 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "1. Regularized regression on isotropic covariates, and an $M$ -regularizer. That is, suppose $n$ samples $( x , y )$ are drawn with covariates $x \\sim \\mathcal { N } ( 0 , I _ { d } )$ and response $y = \\langle \\beta ^ { * } , x \\rangle +$ $\\mathcal { N } ( 0 , \\bar { \\sigma } ^ { 2 } )$ . Let $\\ b { \\hat { X } } \\in \\mathbb { R } ^ { n \\times d }$ be the matrix of covariates, and $\\vec { y }$ the vector of responses. Consider ", + "bbox": [ + 212, + 433, + 825, + 489 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/02363f18ece46693d693587db157e2dcdb085e1e18082f637c3f89a762f72274.jpg", + "text": "$$\n{ \\hat { \\beta } } _ { \\lambda } : = \\operatorname * { a r g m i n } _ { \\beta } | | X \\beta - { \\vec { y } } | | _ { 2 } ^ { 2 } + \\lambda | | \\beta | | _ { M } ^ { 2 }\n$$", + "text_format": "latex", + "bbox": [ + 401, + 493, + 653, + 523 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Let $\\overline { { R } } = \\mathbb { E } _ { X , y } [ | | \\hat { \\beta } - \\beta ^ { * } | | _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 }$ be the expected test risk of the above estimator. ", + "bbox": [ + 232, + 531, + 756, + 550 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "2. Regularized regression with covariance $\\Sigma$ , and an $( \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } )$ -regularizer. That is, suppose $n$ samples $( \\widetilde { x } , y )$ are drawn with covariates $\\widetilde { x } \\sim \\mathcal { N } ( 0 , \\Sigma )$ and response $y =$ $\\langle z ^ { \\ast } , \\widetilde { x } \\rangle + \\mathcal { N } ( 0 , \\widetilde { \\sigma } ^ { 2 } )$ e, for ", + "bbox": [ + 214, + 558, + 823, + 602 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/df06493abeb238642e8c8f74a3139cd40fd2e81f06e4936a7d7cad291c1fde94.jpg", + "text": "$$\nz ^ { * } = \\Sigma ^ { - 1 / 2 } \\beta ^ { * }\n$$", + "text_format": "latex", + "bbox": [ + 477, + 601, + 578, + 619 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Let $\\widetilde { X } \\in \\mathbb { R } ^ { n \\times d }$ be the matrix of covariates, and $\\vec { y }$ the vector of responses. Consider ", + "bbox": [ + 232, + 625, + 779, + 641 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/cda5be67a395c20ef4b5af3f81051ab51976eb309c81bc6b7d01c1f24c2eb8c2.jpg", + "text": "$$\n\\hat { z } _ { \\lambda } : = \\operatorname * { a r g m i n } _ { z } | | \\widetilde { X } z - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda | | z | | _ { \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } } ^ { 2 }\n$$", + "text_format": "latex", + "bbox": [ + 377, + 646, + 678, + 674 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Let $\\widetilde { R } = \\mathbb { E } _ { \\widetilde { X } , y } [ | | \\hat { z } - z ^ { * } | | _ { \\Sigma } ^ { 2 } ] + \\sigma ^ { 2 }$ be the expected test risk of the above estimator. ", + "bbox": [ + 230, + 683, + 756, + 702 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Then, the expected test risks of the above two problems are identical: ", + "bbox": [ + 174, + 713, + 625, + 728 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/db5f0c07ae954bc35d619d405280e49178abec00d0dba3e56fe2951dd749e615.jpg", + "text": "$$\n\\overline { { R } } = \\widetilde { R }\n$$", + "text_format": "latex", + "bbox": [ + 472, + 734, + 526, + 752 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Proof of Lemma 5. The distribution of $\\widetilde { X }$ in the Problem 2 is equivalent to $X \\Sigma ^ { 1 / 2 }$ , where $X$ is as in Problem 1. Thus, the two settings are equivalent by the change-of-variable $\\beta = \\Sigma ^ { 1 / 2 } z$ . Specifically, ", + "bbox": [ + 173, + 768, + 825, + 800 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/f0beeb018cf7057c374d082f97552de1cc35ea24d3586872370a3e8651b97efd.jpg", + "text": "$$\n\\begin{array} { r l } & { \\hat { z } _ { \\lambda } : = \\underset { z } { \\mathrm { a r g m i n } } \\left| \\lvert \\tilde { X } z - \\bar { y } \\rvert \\right| _ { 2 } ^ { 2 } + \\lambda \\lvert | z \\rvert | _ { \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } } ^ { 2 } } \\\\ & { = \\underset { z } { \\mathrm { a r g m i n } } \\left| \\lvert X \\Sigma ^ { 1 / 2 } z - \\bar { y } \\rvert \\right| _ { 2 } ^ { 2 } + \\lambda z ^ { T } \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } z } \\\\ & { = \\underset { z } { \\mathrm { a r g m i n } } \\left| \\lvert X \\Sigma ^ { 1 / 2 } z - \\bar { y } \\rvert \\right| _ { 2 } ^ { 2 } + \\lambda z ^ { T } \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } z } \\\\ & { = \\Sigma ^ { - 1 / 2 } \\underset { \\beta = \\Sigma ^ { 1 / 2 } z } { \\mathrm { a r g m i n } } \\left| \\lvert X \\beta - \\bar { y } \\rvert \\right| _ { 2 } ^ { 2 } + \\lambda \\beta ^ { T } M \\beta } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 336, + 805, + 663, + 922 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Further, the response $\\langle z ^ { * } , { \\widetilde { x } } \\rangle = \\langle \\beta , x \\rangle$ , and the test risk transforms identically: ", + "bbox": [ + 171, + 102, + 686, + 119 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/ba8c337424aa66b3e400992cc04938b8a52ee3d159056665cd8655fcb3352401.jpg", + "text": "$$\n\\begin{array} { r } { \\widetilde { R } = \\underset { \\widetilde { X } , y } { \\mathbb { E } } \\left[ \\vert \\vert \\hat { z } - z ^ { * } \\vert \\vert _ { \\Sigma } ^ { 2 } \\right] + \\sigma ^ { 2 } } \\\\ { = \\underset { X , y } { \\mathbb { E } } \\left[ \\vert \\vert \\hat { \\beta } - \\beta ^ { * } \\vert \\vert _ { 2 } ^ { 2 } \\right] + \\sigma ^ { 2 } } \\\\ { = \\overline { { R } } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 408, + 122, + 589, + 203 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "This implies that if the covariance $\\Sigma$ is known, then ridge regression with a $\\Sigma ^ { - 1 }$ regularizer is sample-monotonic. ", + "bbox": [ + 174, + 234, + 823, + 263 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Theorem 5. For all $n \\in \\mathbb { N } , d \\in \\mathbb { N } , \\sigma \\in \\mathbb { R } ,$ , covariance $\\Sigma \\in \\mathbb { R } ^ { d \\times d }$ , and ground-truths $\\beta ^ { * } \\in \\mathbb { R } ^ { d }$ , th e following holds. ", + "bbox": [ + 174, + 265, + 823, + 295 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Suppose $n$ samples $( x , y )$ are drawn with covariates $x \\sim \\mathcal { N } ( 0 , \\Sigma )$ and response $y = \\langle \\beta ^ { * } , x \\rangle +$ ${ \\mathcal { N } } ( 0 , \\sigma ^ { 2 } )$ . Let $\\ b { X } \\in \\mathbb { R } ^ { n \\times d }$ be the matrix of covariates, and $\\vec { y }$ the vector of responses. For $\\lambda > 0$ , consider the ridge regression estimator with $\\Sigma ^ { - 1 }$ -regularizer: ", + "bbox": [ + 173, + 301, + 825, + 343 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/44c9a87571ee9323acf796aef81530d801ad3a2c6383f1a76da675ec70121a13.jpg", + "text": "$$\n\\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\boldsymbol { \\beta } } \\| X \\boldsymbol { \\beta } - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| \\boldsymbol { \\beta } \\| _ { \\Sigma ^ { - 1 } } ^ { 2 }\n$$", + "text_format": "latex", + "bbox": [ + 361, + 348, + 635, + 376 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Let $\\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) : = \\mathbb { E } _ { \\hat { \\beta } } \\| \\hat { \\beta } - \\beta ^ { * } \\| _ { \\Sigma } + \\sigma ^ { 2 }$ be the expected test risk of the above estimator. Let $\\lambda _ { n } ^ { \\mathrm { o p t } }$ be the optimal ridge parameter (that achieves the minimum expected risk) given $n$ samples: ", + "bbox": [ + 169, + 388, + 823, + 421 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/6a255aa91999f671497ccad33844b9a826f3e210b626c3c0aa2f0b93fc75385e.jpg", + "text": "$$\n\\lambda _ { n } ^ { \\mathrm { o p t } } : = \\operatorname * { a r g m i n } _ { \\lambda } \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) )\n$$", + "text_format": "latex", + "bbox": [ + 415, + 424, + 583, + 452 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "And let $\\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } }$ be the estimator that corresponds to the $\\lambda _ { n } ^ { \\mathrm { o p t } }$ . Then, the expected test risk of optimallyregularized linear regression is monotonic in samples: ", + "bbox": [ + 173, + 457, + 823, + 487 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/e4739674d976e6c2ef07dabe2d407a650cf2cf0edb0ee50ad6200a5333c108d0.jpg", + "text": "$$\n\\overline { { R } } ( \\hat { \\beta } _ { n + 1 } ^ { \\mathrm { o p t } } ) \\leq \\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } )\n$$", + "text_format": "latex", + "bbox": [ + 431, + 491, + 566, + 512 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Proof. This follows directly by applying the reduction in Lemma 5 for $M = I _ { d }$ to reduce to the isotropic case, and then applying the monotonicity of isotropic regression from Theorem 1. □ ", + "bbox": [ + 174, + 523, + 825, + 553 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "A.4 ADDITIONAL PLOTS ", + "text_level": 1, + "bbox": [ + 176, + 568, + 357, + 582 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "We apply random features to Fashion-MNIST Xiao et al. (2017), an image classification problem with 10 classes. Input images $x \\in \\mathbb { R } ^ { d }$ are normalized and flattened to $[ - \\bar { 1 } , 1 ] ^ { d }$ for $d = 7 8 4$ . Class labels are encoded as one-hot vectors $y \\in \\{ \\vec { e _ { 1 } } , \\dots e _ { 1 0 } ^ { } \\} \\subset \\mathbb { R } ^ { 1 0 }$ . ", + "bbox": [ + 174, + 593, + 825, + 636 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "B TOWARDS MONOTONICITY WITH GENERAL COVARIATES ", + "text_level": 1, + "bbox": [ + 176, + 654, + 681, + 671 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Here we investigate whether monotonicity provably holds in more general models, inspired by the experimental results. As a first step, we consider Gaussian (but not isotropic) covariances and homeostatic noise. That is, we consider ridge regression in the setting of Section 2, but with $x \\sim \\mathcal { N } ( 0 , \\Sigma )$ , and $y \\sim \\langle x , \\beta ^ { * } \\rangle + N ( 0 , \\sigma ^ { 2 } )$ . In this section, we observe that ridge regression can be made sample-monotonic with a modified regularizer. We also conjecture that ridge regression is sample-monotonic without modifying the regularizer, and we outline a potential proof strategy along with numerical evidence. ", + "bbox": [ + 173, + 684, + 825, + 782 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "B.1 ADAPTIVE REGULARIZATION ", + "text_level": 1, + "bbox": [ + 176, + 797, + 421, + 813 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "The results on isotropic regression in Section 2 imply that ridge regression can be made samplemonotonic even for non-isotropic covariates, if an appropriate regularizer is applied. Specifically, the appropriate regularizer depends on the covariance of the inputs. For $\\boldsymbol { x } \\sim \\mathcal { N } ( 0 , \\Sigma )$ , the following estimator is sample-monotonic for optimally-tuned $\\lambda$ : $\\begin{array} { r } { \\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\boldsymbol { \\beta } } \\| X \\boldsymbol { \\beta } - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| \\boldsymbol { \\beta } \\| _ { \\Sigma ^ { - 1 } } ^ { 2 } } \\end{array}$ . This follows directly from Theorem 1 by applying a change-of-variable; full details of this equivalence are in Section A.3. Note that if the population covariance $\\Sigma$ is not known, it can potentially be estimated from unlabeled data. ", + "bbox": [ + 173, + 823, + 825, + 924 + ], + "page_idx": 17 + }, + { + "type": "image", + "img_path": "images/6d706f197addd390fb2defce66fd1cd5af413a8242fbc58ab89186d03af9186f.jpg", + "image_caption": [ + "Test Error for Regularized Random Features " + ], + "image_footnote": [], + "bbox": [ + 179, + 109, + 460, + 321 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "(a) Test Classification Error vs. Number of Training Samples. ", + "bbox": [ + 173, + 333, + 467, + 359 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/ce3f799d5bd5415e26ca617c4e47e654875a8b6c2557b5bf3b3c7007b6a14a4f.jpg", + "image_caption": [ + "Test Errorfor Regularized Random Features ", + "(b) Test Classification Error vs. Model Size (Number of Random Features). " + ], + "image_footnote": [], + "bbox": [ + 535, + 111, + 816, + 321 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Figure 4: Double-descent for Random ReLU Features. Test classification error as a function of model size and sample size for Random ReLU Features on Fashion-MNIST. Left: with $D = 5 0 0$ features. Right: with $n = 5 0 0$ samples. See Figures 7, 8 for the corresponding test Mean Squared Error. See Appendix D of Nakkiran et al. (2020) for the performance of these unregularized models plotted across Num. Samples $\\times$ Model Size simultaneously. ", + "bbox": [ + 173, + 371, + 826, + 440 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/05df2a46592e323dc1205edaa5fa11d2355d7bba6df96212a7b9f700cd4a121b.jpg", + "image_caption": [ + "Figure 5: Train Error vs. Model Size for 5-layer CNNs on CIFAR-100, with $\\ell _ { 2 }$ regularization (weight decay). " + ], + "image_footnote": [], + "bbox": [ + 279, + 462, + 717, + 654 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "B.2 TOWARDS PROVING MONOTONICITY ", + "text_level": 1, + "bbox": [ + 176, + 724, + 472, + 739 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "We conjecture that optimally-regularized ridge regression is sample-monotonic for non-isotropic covariates, even without modifying the regularizer (as suggested by the experiment in Figure 2). We derive a sufficient condition for monotonicity, which we have numerically verified in a variety of instances. Specifically, we conjecture the following. ", + "bbox": [ + 173, + 751, + 825, + 808 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Conjecture 1. For all $d \\in \\mathbb { N }$ , and all PSD covariances $\\Sigma \\in \\mathbb { R } ^ { d \\times d }$ , consider the distribution on $( x , y )$ where $x \\sim \\mathcal { N } ( 0 , \\Sigma )$ , and $y \\sim \\langle x , \\beta ^ { * } \\rangle + \\mathcal { N } ( 0 , \\sigma ^ { 2 } )$ . Then, we conjecture that the expected test risk of the ridge regression estimator: $\\begin{array} { r } { \\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\boldsymbol { \\beta } } \\| X { \\boldsymbol { \\beta } } - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| { \\boldsymbol { \\beta } } \\| _ { 2 } ^ { 2 } } \\end{array}$ for optimally-tuned $\\lambda \\geq 0$ , is monotone non-increasing in number of samples $n$ . That is, for all $n \\in \\mathbb { N }$ , ", + "bbox": [ + 173, + 810, + 825, + 869 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/c9c57ee5be88035eb586dc57d2d1e0b886158489d7bd35b146d1aa191662b2a5.jpg", + "text": "$$\n\\operatorname * { i n f } _ { \\lambda \\geq 0 } \\overline { { { R } } } ( \\hat { \\beta } _ { n + 1 , \\lambda } ) \\leq \\operatorname * { i n f } _ { \\lambda \\geq 0 } \\overline { { { R } } } ( \\hat { \\beta } _ { n , \\lambda } )\n$$", + "text_format": "latex", + "bbox": [ + 390, + 875, + 607, + 901 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "where we define $\\begin{array} { r } { \\hat { \\beta } _ { n , 0 } : = \\operatorname* { l i m } _ { \\lambda \\to 0 + } \\hat { \\beta } _ { n , \\lambda } = X ^ { \\dagger } y } \\end{array}$ . ", + "bbox": [ + 173, + 906, + 488, + 926 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/d4048491df9a41611fd80fea0aeac569328ee316a77886c71b4c9d4ba9170d40.jpg", + "image_caption": [ + "Figure 6: Train MSE vs. Num. Samples for Non-Isotropic Ridge Regression in $d = 3 0$ dimensions, in the setting of Figure 2. Plotting train MSE: $\\begin{array} { r } { \\frac { 1 } { n } | | X \\hat { \\boldsymbol { \\beta } } - \\vec { y } | | _ { 2 } ^ { 2 } } \\end{array}$ . " + ], + "image_footnote": [], + "bbox": [ + 326, + 107, + 671, + 371 + ], + "page_idx": 19 + }, + { + "type": "image", + "img_path": "images/aa84a8ffbd2beefb1d745ab29a4ccc613c56c1dfa1eef8d51380a0483dcffecb.jpg", + "image_caption": [ + "Figure 7: Test Mean Squared Error vs. Num Train Samples for Random ReLU Features on FashionMNIST, with $D = 5 0 0$ features. " + ], + "image_footnote": [], + "bbox": [ + 326, + 443, + 671, + 707 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "In Appendix B.3 we present a technical conjecture in random matrix theory (Conjecture 2) which suffices to prove Conjecture 1. Proving this Conjecture 2 presents a number of technical challenges, but we have numerically verified it in a variety of cases. It can also be shown that Conjecture 2 is true when $Q = I$ , corresponding to isotropic covariates. We prove the reduction between Conjecture 2 and 1 in Appendix B.3. ", + "bbox": [ + 174, + 784, + 825, + 854 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "B.3 MONOTONICITY CONJECTURE PROOFS ", + "text_level": 1, + "bbox": [ + 176, + 877, + 486, + 892 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "In order to establish Conjecture 1, it is sufficient to prove the following technical conjecture. ", + "bbox": [ + 168, + 909, + 776, + 924 + ], + "page_idx": 19 + }, + { + "type": "image", + "img_path": "images/8eda0db61a5bd63cb07df9565b6981c5a80a7fd865e013f9ce281e419515418e.jpg", + "image_caption": [ + "Figure 8: Test Mean Squared Error vs. Num Features for Random ReLU Features on FashionMNIST, with $n = 5 0 0$ samples. " + ], + "image_footnote": [], + "bbox": [ + 326, + 106, + 671, + 372 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "Conjecture 2. For all $n \\in \\mathbb { N } , d \\geq n , \\lambda > 0$ , symmetric positive definite matrix $Q \\in \\mathbb { R } ^ { d \\times d }$ , the following holds. ", + "bbox": [ + 174, + 443, + 823, + 473 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "Define ", + "bbox": [ + 173, + 479, + 220, + 494 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/ad76a8c087b005ddee977955e15dff2088f817370c0193f16b774104a3fb7cc1.jpg", + "text": "$$\nG _ { \\lambda } ^ { n } : = \\lambda ^ { 2 } \\underset { X } { \\mathbb { E } } [ ( X ^ { T } X + \\lambda Q ) ^ { - 2 } ]\n$$", + "text_format": "latex", + "bbox": [ + 397, + 491, + 601, + 516 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "where $\\ b { X } \\in \\mathbb { R } ^ { n \\times d }$ is sampled with each entry i.i.d. $\\mathcal { N } ( 0 , 1 )$ . Similarly, define ", + "bbox": [ + 173, + 520, + 676, + 536 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/231a0f4ef6fbdc38727280f01461eda169b50c285dd0fde6c57d63e46a831858.jpg", + "text": "$$\nH _ { \\lambda } ^ { n } : = \\mathbb { E } [ | | X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } | | _ { F } ^ { 2 } ]\n$$", + "text_format": "latex", + "bbox": [ + 382, + 542, + 616, + 568 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "The expected test risk for $n$ samples can be expressed as: ", + "bbox": [ + 173, + 575, + 549, + 590 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/c89974b87c986d9d15a75f2dd3fb1e0db209a7da6355aa40f2d30e736ed328c1.jpg", + "text": "$$\n\\overline { { { R } } } ( \\hat { \\beta } _ { n , \\lambda } ) = ( \\beta ^ { * } ) ^ { T } G _ { \\lambda } ^ { n } \\beta ^ { * } + \\sigma ^ { 2 } H _ { \\lambda } ^ { n } + \\sigma ^ { 2 }\n$$", + "text_format": "latex", + "bbox": [ + 370, + 597, + 629, + 616 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "Then, we conjecture that the following two conditions hold. ", + "bbox": [ + 173, + 630, + 562, + 645 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "1. ", + "bbox": [ + 212, + 657, + 225, + 671 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/336184f3133bbe3606ffc5cf5d47e56e1ddb0b17a540f79cdd78752af7fc88b0.jpg", + "text": "$$\nG _ { \\lambda } ^ { n } \\succeq G _ { \\lambda } ^ { n + 1 }\n$$", + "text_format": "latex", + "bbox": [ + 486, + 669, + 570, + 688 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "2. ", + "bbox": [ + 212, + 699, + 225, + 712 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/5c3c2fe8f8069e1ad2ae74cc0f35a3b3a716f86e6780793a14502d60454d7f41.jpg", + "text": "$$\n( G _ { \\lambda } ^ { n } - G _ { \\lambda } ^ { n + 1 } ) - ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) \\frac { d G _ { \\lambda } ^ { n } / d \\lambda } { d H _ { \\lambda } ^ { n } / d \\lambda } \\succeq 0\n$$", + "text_format": "latex", + "bbox": [ + 375, + 717, + 681, + 751 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "Lemma 6. Conjecture 2 implies Conjecture $^ { l }$ ", + "bbox": [ + 173, + 757, + 480, + 773 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "Proof. By the reduction in Section A.3, showing monotonicity for non-isotropic regression with an isotropic regularizer is equivalent to showing monotonicity for isotropic regression with a nonisotropic regularizer. Thus, we consider the latter. Specifically, Conjecture 1 is equivalent to showing monotonicity for the estimator ", + "bbox": [ + 173, + 787, + 825, + 844 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/6c41e816d4f887f9bde12f642fb19207753ffa9bfb323e88287605e629300b7c.jpg", + "text": "$$\n\\begin{array} { r l } { { \\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\beta } \\| X \\beta - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| \\beta \\| _ { \\Sigma ^ { - 1 } } ^ { 2 } } } \\\\ & { = ( X ^ { T } X + \\lambda \\Sigma ^ { - 1 } ) ^ { - 1 } X ^ { T } y } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 361, + 851, + 633, + 902 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "where $x \\sim \\mathcal { N } ( 0 , I )$ is isotropic, and $y \\sim \\langle x , \\beta ^ { * } \\rangle + \\mathcal { N } ( 0 , \\sigma ^ { 2 } )$ . ", + "bbox": [ + 173, + 907, + 578, + 925 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "Now, letting $\\boldsymbol { Q } : = \\boldsymbol { \\Sigma } ^ { - 1 }$ , the expected test risk of this estimator for $n$ samples is: ", + "bbox": [ + 173, + 102, + 696, + 119 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/b0c0704953e261076194e5ff818a464b49094b93133c27b3b95b7aa2feff2dd1.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathbb { E } [ \\left. \\hat { \\beta } _ { n , \\lambda } \\right. = \\underset { X , y } { \\mathbb { E } } [ \\left. \\hat { \\beta } _ { n , \\lambda } - \\beta ^ { * } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X , y } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } y - \\beta ^ { * } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X , \\eta = N ; 0 } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } ( X \\beta ^ { * } + \\eta ) - \\beta ^ { * } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X , \\eta = N ; 0 } { \\mathbb { E } } [ ( 0 , \\lambda ^ { 2 } Y ^ { T } \\eta _ { n } ^ { 2 } ) ] \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } ( X \\beta ^ { * } + \\eta ) - \\beta ^ { * } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } X \\beta ^ { * } - \\beta ^ { * } ) \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } \\right. _ { F } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } ( X ^ { T } X + \\lambda Q - \\lambda Q ) \\beta ^ { * } - \\beta ^ { * } ) \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } \\right. _ { F } ^ { 2 } ] } \\\\ & \\quad = \\lambda ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } \\right. _ { F } ^ { 2 } ] + \\sigma \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 123, + 839, + 315 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Consider the infimum ", + "bbox": [ + 173, + 328, + 320, + 343 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/13c55acf6258506f84d51c2ef9587f1fae07d58b644a432c0ea44cbe3d20e3df.jpg", + "text": "$$\n\\operatorname* { i n f } _ { \\lambda \\geq 0 } { \\overline { { R } } } ( { \\hat { \\beta } } _ { n , \\lambda } )\n$$", + "text_format": "latex", + "bbox": [ + 454, + 348, + 542, + 375 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "We consider several cases below. ", + "bbox": [ + 174, + 382, + 392, + 397 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Case (1). Suppose the infimum in Equation 71 is achieved in the limit $\\lambda \\to + \\infty$ . In this case, monotonicity trivially holds, since ", + "bbox": [ + 173, + 404, + 823, + 433 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/6ae7607f4c9c2ddad443112fd1792e84f875d21cc7082bbeefac25b604d59f7f.jpg", + "text": "$$\n\\operatorname* { l i m } _ { \\lambda \\to \\infty } \\overline { { { R } } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\overline { { { R } } } ( \\vec { 0 } ) = \\operatorname* { l i m } _ { \\lambda \\to \\infty } \\overline { { { R } } } ( \\hat { \\beta } _ { n + 1 , \\lambda } )\n$$", + "text_format": "latex", + "bbox": [ + 357, + 439, + 640, + 465 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Case (2). Suppose the infimum in Equation 71 is achieved by some $\\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } }$ in the interior of the set $( 0 , \\infty )$ . ", + "bbox": [ + 173, + 483, + 823, + 513 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Because $\\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } )$ is continuous and differentiable in $\\lambda$ for all $\\lambda \\in ( 0 , \\infty )$ , we have that $\\lambda _ { n } ^ { \\mathrm { o p t } }$ must satisfy the following first-order optimality condition: ", + "bbox": [ + 174, + 521, + 825, + 551 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/bd5812ddb8e5b3a3003763dbc4df1c1083a51b8491f6169af12151e16bdf1fe2.jpg", + "text": "$$\n\\begin{array} { r } { \\frac { d \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) } { d \\lambda } \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } = 0 } \\\\ { \\implies ( \\beta ^ { * } ) ^ { T } \\frac { d G _ { \\lambda } ^ { n } } { d \\lambda } \\beta ^ { * } + \\sigma ^ { 2 } \\frac { d H _ { \\lambda } ^ { n } } { d \\lambda } \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } = 0 } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 362, + 558, + 640, + 628 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "We will later use this condition to show monotonicity. ", + "bbox": [ + 173, + 632, + 529, + 647 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Case (3). Suppose the infimum in Equation 71 is achieved at $\\lambda _ { n } ^ { \\mathrm { o p t } } = 0$ . Recall, we define $\\hat { \\beta } _ { n , 0 } : =$ $\\mathrm { l i m } _ { \\lambda \\to 0 + } \\hat { \\beta } _ { n , \\lambda }$ . This means that, ", + "bbox": [ + 174, + 655, + 823, + 689 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/c95a4e0017eb4b8708bb725a904978d94b5de54f2554ec63647774db25cd0a72.jpg", + "text": "$$\n\\frac { d \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) } { d \\lambda } \\Big | _ { \\lambda = 0 } = ( \\beta ^ { * } ) ^ { T } \\frac { d G _ { \\lambda } ^ { n } } { d \\lambda } \\beta ^ { * } + \\sigma ^ { 2 } \\frac { d H _ { \\lambda } ^ { n } } { d \\lambda } \\Big | _ { \\lambda = 0 } \\geq 0\n$$", + "text_format": "latex", + "bbox": [ + 325, + 696, + 674, + 732 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Note that since $\\begin{array} { r } { \\frac { d H _ { \\lambda } ^ { n } } { d \\lambda } \\leq 0 } \\end{array}$ , both Equations (73) and (74) in Case (2) and Case (3) respectively imply that ", + "bbox": [ + 173, + 746, + 825, + 779 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/6e211998885ace57711bcff68cdbeb605671fe5b714974d9087bbcd54d6a9332.jpg", + "text": "$$\n\\sigma ^ { 2 } \\leq - \\frac { ( \\beta ^ { * } ) ^ { T } ( \\frac { d G _ { \\lambda } ^ { n } } { d \\lambda } ) \\beta ^ { * } } { d H _ { \\lambda } ^ { n } / d \\lambda } \\Big \\vert _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } }\n$$", + "text_format": "latex", + "bbox": [ + 397, + 782, + 599, + 821 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Now, assuming Conjecture 2, we will show that the choice of $\\lambda _ { n } ^ { \\mathrm { o p t } }$ in Cases (2) and (3) has nonincreasing test risk for $( n + 1 )$ samples. That is, ", + "bbox": [ + 173, + 838, + 825, + 869 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/1ef487276cca9054802b0d0ae7cb3f1d48e7c75f3f3742cad65981740d6a61b4.jpg", + "text": "$$\n\\overline { { R } } ( \\widehat { \\beta } _ { n , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) \\geq \\overline { { R } } ( \\widehat { \\beta } _ { n + 1 , \\lambda _ { n } ^ { \\mathrm { o p t } } } )\n$$", + "text_format": "latex", + "bbox": [ + 411, + 876, + 586, + 897 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "This implies the desired monotonicity, since R(βˆn+1,λoptn ) ≥ R(βˆn+1,λoptn+1 ). ", + "bbox": [ + 174, + 905, + 669, + 926 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "We first consider the case when $H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } \\geq 0$ . In this case, because $G _ { \\lambda } ^ { n } - G _ { \\lambda } ^ { n + 1 } \\succeq 0$ by assumption, we have ", + "bbox": [ + 173, + 102, + 825, + 133 + ], + "page_idx": 22 + }, + { + "type": "equation", + "img_path": "images/07aa3c990d95a8ac383860c5d76349205b0b166f3e65d75762e8e6f9ec27e44e.jpg", + "text": "$$\n\\begin{array} { r l r } { { \\overline { { R } } ( \\widehat { \\beta } _ { n , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) - \\overline { { R } } ( \\widehat { \\beta } _ { n + 1 , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) = ( \\beta ^ { * } ) ^ { T } ( G _ { \\lambda } ^ { n } - G _ { \\lambda } ^ { n + 1 } ) \\beta ^ { * } + \\sigma ^ { 2 } ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } } } \\\\ & { } & { \\geq 0 \\quad \\quad } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 236, + 138, + 759, + 188 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "Otherwise, assume. $H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } \\leq 0$ . Then we have: ", + "bbox": [ + 173, + 193, + 570, + 212 + ], + "page_idx": 22 + }, + { + "type": "equation", + "img_path": "images/b15faae1a9fffa8999e8e06d3794f4e39afa6731de30d9facd85224487832d0a.jpg", + "text": "$$\n\\begin{array} { r l } { \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda _ { n } ^ { \\smash { \\mathrm { o u t } } } } ) - \\overline { { R } } ( \\hat { \\beta } _ { n + 1 , \\lambda _ { n } ^ { \\smash { \\mathrm { o u t } } } } ) = ( \\beta ^ { * } ) ^ { T } ( G _ { \\lambda } ^ { m } - G _ { \\lambda } ^ { m + 1 } ) \\beta ^ { * } + \\sigma ^ { 2 } ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\smash { \\mathrm { o u t } } } } } & { \\qquad \\mathrm { ( } } \\\\ & { \\qquad \\geq ( \\beta ^ { * } ) ^ { T } ( G _ { \\lambda } ^ { m } - G _ { \\lambda } ^ { m + 1 } ) \\beta ^ { * } - ( \\beta ^ { * } ) ^ { T } ( \\frac { d G _ { \\lambda } ^ { n } } { d \\lambda } ) \\beta ^ { * } \\frac { ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) } { d H _ { \\lambda } ^ { \\lambda } / d \\lambda } \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\smash { \\mathrm { o u t } } } } } \\\\ & { \\qquad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad } \\\\ & { = ( \\beta ^ { * } ) ^ { T } \\underbrace { \\Bigg ( ( G _ { \\lambda } ^ { m } - G _ { \\lambda } ^ { n + 1 } ) - ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) \\frac { d G _ { \\lambda } ^ { m } / d \\lambda } { d H _ { \\lambda } ^ { n } / d \\lambda } \\Big ) \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o u t } } } \\beta ^ { * } } _ { \\geq 0 \\mathrm { b y c o n j e c u r e 2 } } } \\\\ & { \\qquad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\geq 0 } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 186, + 219, + 799, + 378 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "as desired. ", + "bbox": [ + 173, + 382, + 245, + 396 + ], + "page_idx": 22 + } +] \ No newline at end of file diff --git a/parse/train/7R7fAoUygoa/7R7fAoUygoa_middle.json b/parse/train/7R7fAoUygoa/7R7fAoUygoa_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..863c1ec06805f6812a2b21c193f8fefd607557e0 --- /dev/null +++ b/parse/train/7R7fAoUygoa/7R7fAoUygoa_middle.json @@ -0,0 +1,65877 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 79, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 106, + 78, + 505, + 98 + ], + "spans": [ + { + "bbox": [ + 106, + 78, + 505, + 98 + ], + "score": 1.0, + "content": "OPTIMAL REGULARIZATION CAN MITIGATE DOUBLE", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 98, + 181, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 98, + 181, + 117 + ], + "score": 1.0, + "content": "DESCENT", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 112, + 135, + 246, + 168 + ], + "lines": [ + { + "bbox": [ + 113, + 136, + 194, + 146 + ], + "spans": [ + { + "bbox": [ + 113, + 136, + 194, + 146 + ], + "score": 1.0, + "content": "Preetum Nakkiran", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 111, + 145, + 191, + 159 + ], + "spans": [ + { + "bbox": [ + 111, + 145, + 191, + 159 + ], + "score": 1.0, + "content": "Harvard University", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 111, + 158, + 246, + 168 + ], + "spans": [ + { + "bbox": [ + 111, + 158, + 246, + 168 + ], + "score": 1.0, + "content": "preetum@cs.harvard.edu", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 371, + 136, + 498, + 168 + ], + "lines": [ + { + "bbox": [ + 370, + 135, + 442, + 147 + ], + "spans": [ + { + "bbox": [ + 370, + 135, + 442, + 147 + ], + "score": 1.0, + "content": "Prayaag Venkat", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 370, + 144, + 450, + 159 + ], + "spans": [ + { + "bbox": [ + 370, + 144, + 450, + 159 + ], + "score": 1.0, + "content": "Harvard University", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 369, + 158, + 499, + 168 + ], + "spans": [ + { + "bbox": [ + 369, + 158, + 499, + 168 + ], + "score": 1.0, + "content": "pvenkat@g.harvard.edu", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + }, + { + "type": "title", + "bbox": [ + 113, + 186, + 174, + 196 + ], + "lines": [ + { + "bbox": [ + 111, + 185, + 175, + 197 + ], + "spans": [ + { + "bbox": [ + 111, + 185, + 175, + 197 + ], + "score": 1.0, + "content": "Sham Kakade", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 113, + 197, + 307, + 218 + ], + "lines": [ + { + "bbox": [ + 112, + 195, + 308, + 209 + ], + "spans": [ + { + "bbox": [ + 112, + 195, + 308, + 209 + ], + "score": 1.0, + "content": "Microsoft Research & University of Washington", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 113, + 208, + 246, + 219 + ], + "spans": [ + { + "bbox": [ + 113, + 208, + 246, + 219 + ], + "score": 1.0, + "content": "sham@cs.washington.edu", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.0 + }, + { + "type": "text", + "bbox": [ + 345, + 186, + 472, + 218 + ], + "lines": [ + { + "bbox": [ + 343, + 184, + 396, + 199 + ], + "spans": [ + { + "bbox": [ + 343, + 184, + 396, + 199 + ], + "score": 1.0, + "content": "Tengyu Ma", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 344, + 195, + 425, + 209 + ], + "spans": [ + { + "bbox": [ + 344, + 195, + 425, + 209 + ], + "score": 1.0, + "content": "Stanford University", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 344, + 208, + 472, + 219 + ], + "spans": [ + { + "bbox": [ + 344, + 208, + 472, + 219 + ], + "score": 1.0, + "content": "tengyuma@stanford.edu", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11 + }, + { + "type": "title", + "bbox": [ + 278, + 248, + 333, + 259 + ], + "lines": [ + { + "bbox": [ + 276, + 246, + 336, + 262 + ], + "spans": [ + { + "bbox": [ + 276, + 246, + 336, + 262 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 143, + 273, + 468, + 415 + ], + "lines": [ + { + "bbox": [ + 141, + 272, + 468, + 286 + ], + "spans": [ + { + "bbox": [ + 141, + 272, + 468, + 286 + ], + "score": 1.0, + "content": "Recent empirical and theoretical studies have shown that many learning algo-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 284, + 469, + 295 + ], + "spans": [ + { + "bbox": [ + 142, + 284, + 469, + 295 + ], + "score": 1.0, + "content": "rithms – from linear regression to neural networks – can have test performance that", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 295, + 469, + 306 + ], + "spans": [ + { + "bbox": [ + 141, + 295, + 469, + 306 + ], + "score": 1.0, + "content": "is non-monotonic in quantities such the sample size and model size. This strik-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 306, + 470, + 317 + ], + "spans": [ + { + "bbox": [ + 141, + 306, + 470, + 317 + ], + "score": 1.0, + "content": "ing phenomenon, often referred to as “double descent”, has raised questions of if", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 317, + 470, + 328 + ], + "spans": [ + { + "bbox": [ + 141, + 317, + 470, + 328 + ], + "score": 1.0, + "content": "we need to re-think our current understanding of generalization. In this work, we", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 142, + 329, + 469, + 339 + ], + "spans": [ + { + "bbox": [ + 142, + 329, + 469, + 339 + ], + "score": 1.0, + "content": "study whether the double-descent phenomenon can be avoided by using optimal", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 339, + 470, + 351 + ], + "spans": [ + { + "bbox": [ + 141, + 339, + 470, + 351 + ], + "score": 1.0, + "content": "regularization. Theoretically, we prove that for certain linear regression models", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 142, + 350, + 469, + 362 + ], + "spans": [ + { + "bbox": [ + 142, + 350, + 335, + 362 + ], + "score": 1.0, + "content": "with isotropic data distribution, optimally-tuned", + "type": "text" + }, + { + "bbox": [ + 335, + 350, + 345, + 361 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 350, + 469, + 362 + ], + "score": 1.0, + "content": "regularization achieves mono-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 361, + 470, + 373 + ], + "spans": [ + { + "bbox": [ + 141, + 361, + 470, + 373 + ], + "score": 1.0, + "content": "tonic test performance as we grow either the sample size or the model size. We", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 372, + 469, + 384 + ], + "spans": [ + { + "bbox": [ + 141, + 372, + 347, + 384 + ], + "score": 1.0, + "content": "also demonstrate empirically that optimally-tuned", + "type": "text" + }, + { + "bbox": [ + 347, + 372, + 357, + 383 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 372, + 469, + 384 + ], + "score": 1.0, + "content": "regularization can mitigate", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 141, + 383, + 470, + 395 + ], + "spans": [ + { + "bbox": [ + 141, + 383, + 470, + 395 + ], + "score": 1.0, + "content": "double descent for more general models, including neural networks. Our results", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 394, + 470, + 406 + ], + "spans": [ + { + "bbox": [ + 141, + 394, + 470, + 406 + ], + "score": 1.0, + "content": "suggest that it may also be informative to study the test risk scalings of various", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 141, + 405, + 395, + 417 + ], + "spans": [ + { + "bbox": [ + 141, + 405, + 395, + 417 + ], + "score": 1.0, + "content": "algorithms in the context of appropriately tuned regularization.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 21 + }, + { + "type": "title", + "bbox": [ + 108, + 437, + 206, + 450 + ], + "lines": [ + { + "bbox": [ + 105, + 436, + 208, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 436, + 208, + 452 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 462, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 105, + 460, + 506, + 476 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 506, + 476 + ], + "score": 1.0, + "content": "Recent works have demonstrated a ubiquitous “double descent” phenomenon present in a range", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 471, + 506, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 506, + 487 + ], + "score": 1.0, + "content": "of machine learning models, including decision trees, random features, linear regression, and deep", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 484, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 505, + 496 + ], + "score": 1.0, + "content": "neural networks (Opper, 1995; 2001; Advani & Saxe, 2017; Spigler et al., 2018; Belkin et al., 2018;", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 495, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 505, + 507 + ], + "score": 1.0, + "content": "Geiger et al., 2019b; Nakkiran et al., 2020; Belkin et al., 2019; Hastie et al., 2019; Bartlett et al.,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 505, + 505, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 505, + 518 + ], + "score": 1.0, + "content": "2019; Muthukumar et al., 2019; Bibas et al., 2019; Mitra, 2019; Mei & Montanari, 2019; Liang &", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 517, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 505, + 529 + ], + "score": 1.0, + "content": "Rakhlin, 2018; Liang et al., 2019; Xu & Hsu, 2019; Derezinski et al., 2019; Lampinen & Ganguli, ´", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 528, + 505, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 505, + 540 + ], + "score": 1.0, + "content": "2018; Deng et al., 2019; Nakkiran, 2019). The phenomenon is that models exhibit a peak of high", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 539, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 551 + ], + "score": 1.0, + "content": "test risk when they are just barely able to fit the train set, that is, to interpolate. For example, as we", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 550, + 505, + 562 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 562 + ], + "score": 1.0, + "content": "increase the size of models, test risk first decreases, then increases to a peak around when effective", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 561, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 573 + ], + "score": 1.0, + "content": "model size is close to the training data size, and then decreases again in the overparameterized", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 572, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 583 + ], + "score": 1.0, + "content": "regime. Also surprising is that Nakkiran et al. (2020) observe a double descent as we increase", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 583, + 489, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 489, + 595 + ], + "score": 1.0, + "content": "sample size, i.e. for a fixed model, training the model with more data can hurt test performance.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 107, + 600, + 504, + 676 + ], + "lines": [ + { + "bbox": [ + 106, + 599, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 599, + 506, + 613 + ], + "score": 1.0, + "content": "These striking observations highlight a potential gap in our understanding of generalization and", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 610, + 504, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 610, + 504, + 623 + ], + "score": 1.0, + "content": "an opportunity for improved methods. Ideally, we seek to use learning algorithms which robustly", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 622, + 506, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 506, + 634 + ], + "score": 1.0, + "content": "improve performance as the data or model size grow and do not exhibit such unexpected non-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 632, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 632, + 506, + 645 + ], + "score": 1.0, + "content": "monotonic behaviors. In other words, we aim to improve the test performance in situations which", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 644, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 655 + ], + "score": 1.0, + "content": "would otherwise exhibit high test risk due to double descent. Here, a natural strategy would be to", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 655, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 506, + 667 + ], + "score": 1.0, + "content": "use a regularizer and tune its strength on a validation set. This motivates the central question of this", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 665, + 133, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 133, + 677 + ], + "score": 1.0, + "content": "work:", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44 + }, + { + "type": "text", + "bbox": [ + 114, + 687, + 496, + 699 + ], + "lines": [ + { + "bbox": [ + 115, + 687, + 497, + 701 + ], + "spans": [ + { + "bbox": [ + 115, + 687, + 497, + 701 + ], + "score": 1.0, + "content": "When does optimally tuned regularization mitigate or remove the double-descent phenomenon?", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 48 + }, + { + "type": "text", + "bbox": [ + 109, + 709, + 501, + 732 + ], + "lines": [ + { + "bbox": [ + 107, + 709, + 502, + 722 + ], + "spans": [ + { + "bbox": [ + 107, + 709, + 502, + 722 + ], + "score": 1.0, + "content": "Another motivation is the fact that double descent is largely observed for unregularized or under", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 720, + 503, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 503, + 734 + ], + "score": 1.0, + "content": "regularized models in practice. As an example, Figure 1 shows a simple linear ridge regression", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 49.5 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 292, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 303, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 308, + 761 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 308, + 761 + ], + "score": 1.0, + "content": "1", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 79, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 106, + 78, + 505, + 98 + ], + "spans": [ + { + "bbox": [ + 106, + 78, + 505, + 98 + ], + "score": 1.0, + "content": "OPTIMAL REGULARIZATION CAN MITIGATE DOUBLE", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 98, + 181, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 98, + 181, + 117 + ], + "score": 1.0, + "content": "DESCENT", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "list", + "bbox": [ + 112, + 135, + 246, + 168 + ], + "lines": [ + { + "bbox": [ + 113, + 136, + 194, + 146 + ], + "spans": [ + { + "bbox": [ + 113, + 136, + 194, + 146 + ], + "score": 1.0, + "content": "Preetum Nakkiran", + "type": "text" + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 111, + 145, + 191, + 159 + ], + "spans": [ + { + "bbox": [ + 111, + 145, + 191, + 159 + ], + "score": 1.0, + "content": "Harvard University", + "type": "text" + } + ], + "index": 4, + "is_list_start_line": true + }, + { + "bbox": [ + 111, + 158, + 246, + 168 + ], + "spans": [ + { + "bbox": [ + 111, + 158, + 246, + 168 + ], + "score": 1.0, + "content": "preetum@cs.harvard.edu", + "type": "text" + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 370, + 135, + 442, + 147 + ], + "spans": [ + { + "bbox": [ + 370, + 135, + 442, + 147 + ], + "score": 1.0, + "content": "Prayaag Venkat", + "type": "text" + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 370, + 144, + 450, + 159 + ], + "spans": [ + { + "bbox": [ + 370, + 144, + 450, + 159 + ], + "score": 1.0, + "content": "Harvard University", + "type": "text" + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 369, + 158, + 499, + 168 + ], + "spans": [ + { + "bbox": [ + 369, + 158, + 499, + 168 + ], + "score": 1.0, + "content": "pvenkat@g.harvard.edu", + "type": "text" + } + ], + "index": 7, + "is_list_start_line": true + } + ], + "index": 4, + "bbox_fs": [ + 111, + 136, + 246, + 168 + ] + }, + { + "type": "list", + "bbox": [ + 371, + 136, + 498, + 168 + ], + "lines": [], + "index": 5, + "bbox_fs": [ + 369, + 135, + 499, + 168 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 113, + 186, + 174, + 196 + ], + "lines": [ + { + "bbox": [ + 111, + 185, + 175, + 197 + ], + "spans": [ + { + "bbox": [ + 111, + 185, + 175, + 197 + ], + "score": 1.0, + "content": "Sham Kakade", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 113, + 197, + 307, + 218 + ], + "lines": [ + { + "bbox": [ + 112, + 195, + 308, + 209 + ], + "spans": [ + { + "bbox": [ + 112, + 195, + 308, + 209 + ], + "score": 1.0, + "content": "Microsoft Research & University of Washington", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 113, + 208, + 246, + 219 + ], + "spans": [ + { + "bbox": [ + 113, + 208, + 246, + 219 + ], + "score": 1.0, + "content": "sham@cs.washington.edu", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.0, + "bbox_fs": [ + 112, + 195, + 308, + 219 + ] + }, + { + "type": "list", + "bbox": [ + 345, + 186, + 472, + 218 + ], + "lines": [ + { + "bbox": [ + 343, + 184, + 396, + 199 + ], + "spans": [ + { + "bbox": [ + 343, + 184, + 396, + 199 + ], + "score": 1.0, + "content": "Tengyu Ma", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 344, + 195, + 425, + 209 + ], + "spans": [ + { + "bbox": [ + 344, + 195, + 425, + 209 + ], + "score": 1.0, + "content": "Stanford University", + "type": "text" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 344, + 208, + 472, + 219 + ], + "spans": [ + { + "bbox": [ + 344, + 208, + 472, + 219 + ], + "score": 1.0, + "content": "tengyuma@stanford.edu", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true + } + ], + "index": 11, + "bbox_fs": [ + 343, + 184, + 472, + 219 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 248, + 333, + 259 + ], + "lines": [ + { + "bbox": [ + 276, + 246, + 336, + 262 + ], + "spans": [ + { + "bbox": [ + 276, + 246, + 336, + 262 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 143, + 273, + 468, + 415 + ], + "lines": [ + { + "bbox": [ + 141, + 272, + 468, + 286 + ], + "spans": [ + { + "bbox": [ + 141, + 272, + 468, + 286 + ], + "score": 1.0, + "content": "Recent empirical and theoretical studies have shown that many learning algo-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 284, + 469, + 295 + ], + "spans": [ + { + "bbox": [ + 142, + 284, + 469, + 295 + ], + "score": 1.0, + "content": "rithms – from linear regression to neural networks – can have test performance that", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 295, + 469, + 306 + ], + "spans": [ + { + "bbox": [ + 141, + 295, + 469, + 306 + ], + "score": 1.0, + "content": "is non-monotonic in quantities such the sample size and model size. This strik-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 306, + 470, + 317 + ], + "spans": [ + { + "bbox": [ + 141, + 306, + 470, + 317 + ], + "score": 1.0, + "content": "ing phenomenon, often referred to as “double descent”, has raised questions of if", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 317, + 470, + 328 + ], + "spans": [ + { + "bbox": [ + 141, + 317, + 470, + 328 + ], + "score": 1.0, + "content": "we need to re-think our current understanding of generalization. In this work, we", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 142, + 329, + 469, + 339 + ], + "spans": [ + { + "bbox": [ + 142, + 329, + 469, + 339 + ], + "score": 1.0, + "content": "study whether the double-descent phenomenon can be avoided by using optimal", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 339, + 470, + 351 + ], + "spans": [ + { + "bbox": [ + 141, + 339, + 470, + 351 + ], + "score": 1.0, + "content": "regularization. Theoretically, we prove that for certain linear regression models", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 142, + 350, + 469, + 362 + ], + "spans": [ + { + "bbox": [ + 142, + 350, + 335, + 362 + ], + "score": 1.0, + "content": "with isotropic data distribution, optimally-tuned", + "type": "text" + }, + { + "bbox": [ + 335, + 350, + 345, + 361 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 350, + 469, + 362 + ], + "score": 1.0, + "content": "regularization achieves mono-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 361, + 470, + 373 + ], + "spans": [ + { + "bbox": [ + 141, + 361, + 470, + 373 + ], + "score": 1.0, + "content": "tonic test performance as we grow either the sample size or the model size. We", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 372, + 469, + 384 + ], + "spans": [ + { + "bbox": [ + 141, + 372, + 347, + 384 + ], + "score": 1.0, + "content": "also demonstrate empirically that optimally-tuned", + "type": "text" + }, + { + "bbox": [ + 347, + 372, + 357, + 383 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 372, + 469, + 384 + ], + "score": 1.0, + "content": "regularization can mitigate", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 141, + 383, + 470, + 395 + ], + "spans": [ + { + "bbox": [ + 141, + 383, + 470, + 395 + ], + "score": 1.0, + "content": "double descent for more general models, including neural networks. Our results", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 394, + 470, + 406 + ], + "spans": [ + { + "bbox": [ + 141, + 394, + 470, + 406 + ], + "score": 1.0, + "content": "suggest that it may also be informative to study the test risk scalings of various", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 141, + 405, + 395, + 417 + ], + "spans": [ + { + "bbox": [ + 141, + 405, + 395, + 417 + ], + "score": 1.0, + "content": "algorithms in the context of appropriately tuned regularization.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 21, + "bbox_fs": [ + 141, + 272, + 470, + 417 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 437, + 206, + 450 + ], + "lines": [ + { + "bbox": [ + 105, + 436, + 208, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 436, + 208, + 452 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 462, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 105, + 460, + 506, + 476 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 506, + 476 + ], + "score": 1.0, + "content": "Recent works have demonstrated a ubiquitous “double descent” phenomenon present in a range", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 471, + 506, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 506, + 487 + ], + "score": 1.0, + "content": "of machine learning models, including decision trees, random features, linear regression, and deep", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 484, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 505, + 496 + ], + "score": 1.0, + "content": "neural networks (Opper, 1995; 2001; Advani & Saxe, 2017; Spigler et al., 2018; Belkin et al., 2018;", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 495, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 505, + 507 + ], + "score": 1.0, + "content": "Geiger et al., 2019b; Nakkiran et al., 2020; Belkin et al., 2019; Hastie et al., 2019; Bartlett et al.,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 505, + 505, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 505, + 518 + ], + "score": 1.0, + "content": "2019; Muthukumar et al., 2019; Bibas et al., 2019; Mitra, 2019; Mei & Montanari, 2019; Liang &", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 517, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 505, + 529 + ], + "score": 1.0, + "content": "Rakhlin, 2018; Liang et al., 2019; Xu & Hsu, 2019; Derezinski et al., 2019; Lampinen & Ganguli, ´", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 528, + 505, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 505, + 540 + ], + "score": 1.0, + "content": "2018; Deng et al., 2019; Nakkiran, 2019). The phenomenon is that models exhibit a peak of high", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 539, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 551 + ], + "score": 1.0, + "content": "test risk when they are just barely able to fit the train set, that is, to interpolate. For example, as we", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 550, + 505, + 562 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 562 + ], + "score": 1.0, + "content": "increase the size of models, test risk first decreases, then increases to a peak around when effective", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 561, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 573 + ], + "score": 1.0, + "content": "model size is close to the training data size, and then decreases again in the overparameterized", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 572, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 583 + ], + "score": 1.0, + "content": "regime. Also surprising is that Nakkiran et al. (2020) observe a double descent as we increase", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 583, + 489, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 489, + 595 + ], + "score": 1.0, + "content": "sample size, i.e. for a fixed model, training the model with more data can hurt test performance.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 34.5, + "bbox_fs": [ + 105, + 460, + 506, + 595 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 600, + 504, + 676 + ], + "lines": [ + { + "bbox": [ + 106, + 599, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 599, + 506, + 613 + ], + "score": 1.0, + "content": "These striking observations highlight a potential gap in our understanding of generalization and", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 610, + 504, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 610, + 504, + 623 + ], + "score": 1.0, + "content": "an opportunity for improved methods. Ideally, we seek to use learning algorithms which robustly", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 622, + 506, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 506, + 634 + ], + "score": 1.0, + "content": "improve performance as the data or model size grow and do not exhibit such unexpected non-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 632, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 632, + 506, + 645 + ], + "score": 1.0, + "content": "monotonic behaviors. In other words, we aim to improve the test performance in situations which", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 644, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 655 + ], + "score": 1.0, + "content": "would otherwise exhibit high test risk due to double descent. Here, a natural strategy would be to", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 655, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 506, + 667 + ], + "score": 1.0, + "content": "use a regularizer and tune its strength on a validation set. This motivates the central question of this", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 665, + 133, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 133, + 677 + ], + "score": 1.0, + "content": "work:", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44, + "bbox_fs": [ + 105, + 599, + 506, + 677 + ] + }, + { + "type": "text", + "bbox": [ + 114, + 687, + 496, + 699 + ], + "lines": [ + { + "bbox": [ + 115, + 687, + 497, + 701 + ], + "spans": [ + { + "bbox": [ + 115, + 687, + 497, + 701 + ], + "score": 1.0, + "content": "When does optimally tuned regularization mitigate or remove the double-descent phenomenon?", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 48, + "bbox_fs": [ + 115, + 687, + 497, + 701 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 709, + 501, + 732 + ], + "lines": [ + { + "bbox": [ + 107, + 709, + 502, + 722 + ], + "spans": [ + { + "bbox": [ + 107, + 709, + 502, + 722 + ], + "score": 1.0, + "content": "Another motivation is the fact that double descent is largely observed for unregularized or under", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 720, + 503, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 503, + 734 + ], + "score": 1.0, + "content": "regularized models in practice. As an example, Figure 1 shows a simple linear ridge regression", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 278, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 505, + 293 + ], + "score": 1.0, + "content": "setting in which the unregularized estimator exhibits double descent, but an optimally-tuned regu-", + "type": "text", + "cross_page": true + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 290, + 266, + 303 + ], + "spans": [ + { + "bbox": [ + 106, + 290, + 266, + 303 + ], + "score": 1.0, + "content": "larizer has monotonic test performance.", + "type": "text", + "cross_page": true + } + ], + "index": 23 + } + ], + "index": 49.5, + "bbox_fs": [ + 106, + 709, + 503, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 125, + 84, + 296, + 255 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 125, + 84, + 296, + 255 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 125, + 84, + 296, + 255 + ], + "spans": [ + { + "bbox": [ + 125, + 84, + 296, + 255 + ], + "score": 0.97, + "type": "image", + "image_path": "b5edb5b47ed8f04264d90917cb098c4913b1a417a4d6db231609364ffb35c0c9.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 125, + 84, + 296, + 97.15384615384616 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 125, + 97.15384615384616, + 296, + 110.30769230769232 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 125, + 110.30769230769232, + 296, + 123.46153846153848 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 125, + 123.46153846153848, + 296, + 136.61538461538464 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 125, + 136.61538461538464, + 296, + 149.7692307692308 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 125, + 149.7692307692308, + 296, + 162.92307692307696 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 125, + 162.92307692307696, + 296, + 176.07692307692312 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 125, + 176.07692307692312, + 296, + 189.23076923076928 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 125, + 189.23076923076928, + 296, + 202.38461538461544 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 125, + 202.38461538461544, + 296, + 215.5384615384616 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 125, + 215.5384615384616, + 296, + 228.69230769230776 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 125, + 228.69230769230776, + 296, + 241.84615384615392 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 125, + 241.84615384615392, + 296, + 255.00000000000009 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 309, + 159, + 493, + 259 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 309, + 159, + 493, + 172 + ], + "spans": [ + { + "bbox": [ + 309, + 159, + 493, + 172 + ], + "score": 1.0, + "content": "Figure 1: Test Risk vs. Num. Samples", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 309, + 171, + 492, + 183 + ], + "spans": [ + { + "bbox": [ + 309, + 171, + 468, + 183 + ], + "score": 1.0, + "content": "for Isotropic Ridge Regression in", + "type": "text" + }, + { + "bbox": [ + 469, + 171, + 492, + 182 + ], + "score": 0.86, + "content": "d \\_ =", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 308, + 181, + 493, + 195 + ], + "spans": [ + { + "bbox": [ + 308, + 181, + 493, + 195 + ], + "score": 1.0, + "content": "500 dimensions. Unregularized regression", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 309, + 193, + 493, + 205 + ], + "spans": [ + { + "bbox": [ + 309, + 193, + 493, + 205 + ], + "score": 1.0, + "content": "is non-monotonic in samples, but optimally-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 309, + 204, + 493, + 216 + ], + "spans": [ + { + "bbox": [ + 309, + 204, + 404, + 216 + ], + "score": 1.0, + "content": "regularized regression", + "type": "text" + }, + { + "bbox": [ + 405, + 204, + 450, + 216 + ], + "score": 0.88, + "content": "( \\lambda = \\lambda _ { o p t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 204, + 493, + 216 + ], + "score": 1.0, + "content": "is mono-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 309, + 214, + 493, + 227 + ], + "spans": [ + { + "bbox": [ + 309, + 214, + 493, + 227 + ], + "score": 1.0, + "content": "tonic. In this setting, the optimal regularizer", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 310, + 225, + 494, + 239 + ], + "spans": [ + { + "bbox": [ + 310, + 226, + 329, + 238 + ], + "score": 0.89, + "content": "\\lambda _ { o p t }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 225, + 494, + 239 + ], + "score": 1.0, + "content": "does not depend on number of samples", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 310, + 236, + 493, + 249 + ], + "spans": [ + { + "bbox": [ + 310, + 239, + 317, + 246 + ], + "score": 0.64, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 236, + 493, + 249 + ], + "score": 1.0, + "content": "(Lemma 2), but this is not always true – see", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 308, + 246, + 349, + 261 + ], + "spans": [ + { + "bbox": [ + 308, + 246, + 349, + 261 + ], + "score": 1.0, + "content": "Figure 2.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 106, + 279, + 504, + 302 + ], + "lines": [ + { + "bbox": [ + 105, + 278, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 505, + 293 + ], + "score": 1.0, + "content": "setting in which the unregularized estimator exhibits double descent, but an optimally-tuned regu-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 290, + 266, + 303 + ], + "spans": [ + { + "bbox": [ + 106, + 290, + 266, + 303 + ], + "score": 1.0, + "content": "larizer has monotonic test performance.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 106, + 313, + 505, + 390 + ], + "lines": [ + { + "bbox": [ + 106, + 313, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 505, + 326 + ], + "score": 1.0, + "content": "Our Contributions: We study this question from both a theoretical and empirical perspective.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 324, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 505, + 338 + ], + "score": 1.0, + "content": "Theoretically, we start with the setting of high-dimensional linear regression. Linear regression is", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 336, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 505, + 348 + ], + "score": 1.0, + "content": "a sensible starting point to study these questions, since it already exhibits many of the qualitative", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 346, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 505, + 360 + ], + "score": 1.0, + "content": "features of double descent in more complex models (e.g. Belkin et al. (2019); Hastie et al. (2019)", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 357, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 505, + 371 + ], + "score": 1.0, + "content": "and further related works in Section 1.1). Our work shows that optimally-tuned ridge regression can", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 368, + 504, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 504, + 381 + ], + "score": 1.0, + "content": "achieve both sample-wise monotonicity and model-size-wise monotonicity under certain assump-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 380, + 217, + 391 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 217, + 391 + ], + "score": 1.0, + "content": "tions. Concretely, we show", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 106, + 396, + 505, + 440 + ], + "lines": [ + { + "bbox": [ + 105, + 396, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 505, + 409 + ], + "score": 1.0, + "content": "1. Sample-wise monotonicity: In the setting of well-specified linear regression with isotropic", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 407, + 505, + 420 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 505, + 420 + ], + "score": 1.0, + "content": "features/covariates (Figure 1), we prove that optimally-tuned ridge regression yields monotonic test", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 418, + 505, + 431 + ], + "spans": [ + { + "bbox": [ + 105, + 418, + 505, + 431 + ], + "score": 1.0, + "content": "performance with increasing samples. That is, more data never hurts for optimally-tuned ridge", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 429, + 225, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 225, + 441 + ], + "score": 1.0, + "content": "regression. (See Theorem 1).", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 106, + 446, + 505, + 534 + ], + "lines": [ + { + "bbox": [ + 104, + 444, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 104, + 444, + 505, + 459 + ], + "score": 1.0, + "content": "2. Model-wise monotonicity: We consider a setting where the input/covariate lives in a high-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 457, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 428, + 469 + ], + "score": 1.0, + "content": "dimensional ambient space with isotropic covariance. Given a fixed model size", + "type": "text" + }, + { + "bbox": [ + 429, + 457, + 435, + 467 + ], + "score": 0.63, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 457, + 505, + 469 + ], + "score": 1.0, + "content": "(which might be", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 469, + 504, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 504, + 479 + ], + "score": 1.0, + "content": "much smaller than ambient dimension), we consider the family of models which first project the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 479, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 184, + 491 + ], + "score": 1.0, + "content": "input to a random", + "type": "text" + }, + { + "bbox": [ + 184, + 479, + 191, + 488 + ], + "score": 0.78, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 479, + 505, + 491 + ], + "score": 1.0, + "content": "-dimensional subspace, and then compute a linear function in this projected", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "score": 1.0, + "content": "“feature space.” (This is nearly identical to models of double-descent considered in Hastie et al.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 500, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 506, + 513 + ], + "score": 1.0, + "content": "(2019, Section 5.1)). We prove that in this setting, as we grow the model-size, optimally-tuned", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 511, + 505, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 525 + ], + "score": 1.0, + "content": "ridge regression over the projected features has monotone test performance. That is, with optimal", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 523, + 419, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 419, + 534 + ], + "score": 1.0, + "content": "regularization, bigger models are always better or the same. (See Theorem 3).", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 107, + 539, + 505, + 583 + ], + "lines": [ + { + "bbox": [ + 105, + 538, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 505, + 551 + ], + "score": 1.0, + "content": "3. Monotonicity in the real-world: We also demonstrate several richer empirical settings where", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 550, + 504, + 562 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 140, + 562 + ], + "score": 1.0, + "content": "optimal", + "type": "text" + }, + { + "bbox": [ + 140, + 550, + 150, + 561 + ], + "score": 0.85, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 550, + 504, + 562 + ], + "score": 1.0, + "content": "regularization induces monotonicity, including random feature classifiers and convolu-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 561, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 573 + ], + "score": 1.0, + "content": "tional neural networks. This suggests that the mitigating effect of optimal regularization may hold", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 573, + 380, + 584 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 380, + 584 + ], + "score": 1.0, + "content": "more generally in broad machine learning contexts. (See Section 5).", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 44.5 + }, + { + "type": "text", + "bbox": [ + 108, + 589, + 217, + 600 + ], + "lines": [ + { + "bbox": [ + 106, + 587, + 219, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 219, + 601 + ], + "score": 1.0, + "content": "A few remarks are in order:", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 47 + }, + { + "type": "text", + "bbox": [ + 107, + 605, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 105, + 604, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 618 + ], + "score": 1.0, + "content": "Problem-specific vs Minimax and Bayesian. It is worth noting that our results hold for all linear", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 616, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 505, + 629 + ], + "score": 1.0, + "content": "ground-truths, rather than holding for only the worst-case ground-truth or a random ground-truth.", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 627, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 640 + ], + "score": 1.0, + "content": "Indeed, the minimax optimal estimator or the Bayes optimal estimator are both trivially sample-wise", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 639, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 639, + 505, + 650 + ], + "score": 1.0, + "content": "and model-wise monotonic with respect to the minimax risk or the Bayes risk. However, they do not", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 649, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 506, + 662 + ], + "score": 1.0, + "content": "guarantee monotonicity of the risk itself for a given fixed problem. In particular, there exist minimax", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 106, + 661, + 408, + 671 + ], + "spans": [ + { + "bbox": [ + 106, + 661, + 408, + 671 + ], + "score": 1.0, + "content": "optimal estimators which are not sample-monotonic in the sense we desire.", + "type": "text" + } + ], + "index": 53 + } + ], + "index": 50.5 + }, + { + "type": "text", + "bbox": [ + 107, + 677, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "Universal vs Asymptotic. We also remark that our analysis is not only non-asymptotic but also", + "type": "text" + } + ], + "index": 54 + }, + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "works for all possible input dimensions, model sizes, and sample sizes. To our knowledge, the", + "type": "text" + } + ], + "index": 55 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "results herein are the first non-asymptotic sample-wise and model-wise monotonicity results for", + "type": "text" + } + ], + "index": 56 + }, + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "linear regression. (See discussion of related works Hastie et al. (2019); Mei & Montanari (2019)", + "type": "text" + } + ], + "index": 57 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "for related results in the asymptotic setting). Our work reveals aspects of the problem that were not", + "type": "text" + } + ], + "index": 58 + } + ], + "index": 56 + } + ], + "page_idx": 1, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 292, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "score": 1.0, + "content": "2", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 125, + 84, + 296, + 255 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 125, + 84, + 296, + 255 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 125, + 84, + 296, + 255 + ], + "spans": [ + { + "bbox": [ + 125, + 84, + 296, + 255 + ], + "score": 0.97, + "type": "image", + "image_path": "b5edb5b47ed8f04264d90917cb098c4913b1a417a4d6db231609364ffb35c0c9.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 125, + 84, + 296, + 97.15384615384616 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 125, + 97.15384615384616, + 296, + 110.30769230769232 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 125, + 110.30769230769232, + 296, + 123.46153846153848 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 125, + 123.46153846153848, + 296, + 136.61538461538464 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 125, + 136.61538461538464, + 296, + 149.7692307692308 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 125, + 149.7692307692308, + 296, + 162.92307692307696 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 125, + 162.92307692307696, + 296, + 176.07692307692312 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 125, + 176.07692307692312, + 296, + 189.23076923076928 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 125, + 189.23076923076928, + 296, + 202.38461538461544 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 125, + 202.38461538461544, + 296, + 215.5384615384616 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 125, + 215.5384615384616, + 296, + 228.69230769230776 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 125, + 228.69230769230776, + 296, + 241.84615384615392 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 125, + 241.84615384615392, + 296, + 255.00000000000009 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 309, + 159, + 493, + 259 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 309, + 159, + 493, + 172 + ], + "spans": [ + { + "bbox": [ + 309, + 159, + 493, + 172 + ], + "score": 1.0, + "content": "Figure 1: Test Risk vs. Num. Samples", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 309, + 171, + 492, + 183 + ], + "spans": [ + { + "bbox": [ + 309, + 171, + 468, + 183 + ], + "score": 1.0, + "content": "for Isotropic Ridge Regression in", + "type": "text" + }, + { + "bbox": [ + 469, + 171, + 492, + 182 + ], + "score": 0.86, + "content": "d \\_ =", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 308, + 181, + 493, + 195 + ], + "spans": [ + { + "bbox": [ + 308, + 181, + 493, + 195 + ], + "score": 1.0, + "content": "500 dimensions. Unregularized regression", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 309, + 193, + 493, + 205 + ], + "spans": [ + { + "bbox": [ + 309, + 193, + 493, + 205 + ], + "score": 1.0, + "content": "is non-monotonic in samples, but optimally-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 309, + 204, + 493, + 216 + ], + "spans": [ + { + "bbox": [ + 309, + 204, + 404, + 216 + ], + "score": 1.0, + "content": "regularized regression", + "type": "text" + }, + { + "bbox": [ + 405, + 204, + 450, + 216 + ], + "score": 0.88, + "content": "( \\lambda = \\lambda _ { o p t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 204, + 493, + 216 + ], + "score": 1.0, + "content": "is mono-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 309, + 214, + 493, + 227 + ], + "spans": [ + { + "bbox": [ + 309, + 214, + 493, + 227 + ], + "score": 1.0, + "content": "tonic. In this setting, the optimal regularizer", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 310, + 225, + 494, + 239 + ], + "spans": [ + { + "bbox": [ + 310, + 226, + 329, + 238 + ], + "score": 0.89, + "content": "\\lambda _ { o p t }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 225, + 494, + 239 + ], + "score": 1.0, + "content": "does not depend on number of samples", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 310, + 236, + 493, + 249 + ], + "spans": [ + { + "bbox": [ + 310, + 239, + 317, + 246 + ], + "score": 0.64, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 236, + 493, + 249 + ], + "score": 1.0, + "content": "(Lemma 2), but this is not always true – see", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 308, + 246, + 349, + 261 + ], + "spans": [ + { + "bbox": [ + 308, + 246, + 349, + 261 + ], + "score": 1.0, + "content": "Figure 2.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 106, + 279, + 504, + 302 + ], + "lines": [], + "index": 22.5, + "bbox_fs": [ + 105, + 278, + 505, + 303 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 313, + 505, + 390 + ], + "lines": [ + { + "bbox": [ + 106, + 313, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 505, + 326 + ], + "score": 1.0, + "content": "Our Contributions: We study this question from both a theoretical and empirical perspective.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 324, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 505, + 338 + ], + "score": 1.0, + "content": "Theoretically, we start with the setting of high-dimensional linear regression. Linear regression is", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 336, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 505, + 348 + ], + "score": 1.0, + "content": "a sensible starting point to study these questions, since it already exhibits many of the qualitative", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 346, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 505, + 360 + ], + "score": 1.0, + "content": "features of double descent in more complex models (e.g. Belkin et al. (2019); Hastie et al. (2019)", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 357, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 505, + 371 + ], + "score": 1.0, + "content": "and further related works in Section 1.1). Our work shows that optimally-tuned ridge regression can", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 368, + 504, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 504, + 381 + ], + "score": 1.0, + "content": "achieve both sample-wise monotonicity and model-size-wise monotonicity under certain assump-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 380, + 217, + 391 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 217, + 391 + ], + "score": 1.0, + "content": "tions. Concretely, we show", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 313, + 505, + 391 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 396, + 505, + 440 + ], + "lines": [ + { + "bbox": [ + 105, + 396, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 505, + 409 + ], + "score": 1.0, + "content": "1. Sample-wise monotonicity: In the setting of well-specified linear regression with isotropic", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 407, + 505, + 420 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 505, + 420 + ], + "score": 1.0, + "content": "features/covariates (Figure 1), we prove that optimally-tuned ridge regression yields monotonic test", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 418, + 505, + 431 + ], + "spans": [ + { + "bbox": [ + 105, + 418, + 505, + 431 + ], + "score": 1.0, + "content": "performance with increasing samples. That is, more data never hurts for optimally-tuned ridge", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 429, + 225, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 225, + 441 + ], + "score": 1.0, + "content": "regression. (See Theorem 1).", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 396, + 505, + 441 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 446, + 505, + 534 + ], + "lines": [ + { + "bbox": [ + 104, + 444, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 104, + 444, + 505, + 459 + ], + "score": 1.0, + "content": "2. Model-wise monotonicity: We consider a setting where the input/covariate lives in a high-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 457, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 428, + 469 + ], + "score": 1.0, + "content": "dimensional ambient space with isotropic covariance. Given a fixed model size", + "type": "text" + }, + { + "bbox": [ + 429, + 457, + 435, + 467 + ], + "score": 0.63, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 457, + 505, + 469 + ], + "score": 1.0, + "content": "(which might be", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 469, + 504, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 504, + 479 + ], + "score": 1.0, + "content": "much smaller than ambient dimension), we consider the family of models which first project the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 479, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 184, + 491 + ], + "score": 1.0, + "content": "input to a random", + "type": "text" + }, + { + "bbox": [ + 184, + 479, + 191, + 488 + ], + "score": 0.78, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 479, + 505, + 491 + ], + "score": 1.0, + "content": "-dimensional subspace, and then compute a linear function in this projected", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "score": 1.0, + "content": "“feature space.” (This is nearly identical to models of double-descent considered in Hastie et al.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 500, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 506, + 513 + ], + "score": 1.0, + "content": "(2019, Section 5.1)). We prove that in this setting, as we grow the model-size, optimally-tuned", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 511, + 505, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 525 + ], + "score": 1.0, + "content": "ridge regression over the projected features has monotone test performance. That is, with optimal", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 523, + 419, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 419, + 534 + ], + "score": 1.0, + "content": "regularization, bigger models are always better or the same. (See Theorem 3).", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 38.5, + "bbox_fs": [ + 104, + 444, + 506, + 534 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 539, + 505, + 583 + ], + "lines": [ + { + "bbox": [ + 105, + 538, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 505, + 551 + ], + "score": 1.0, + "content": "3. Monotonicity in the real-world: We also demonstrate several richer empirical settings where", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 550, + 504, + 562 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 140, + 562 + ], + "score": 1.0, + "content": "optimal", + "type": "text" + }, + { + "bbox": [ + 140, + 550, + 150, + 561 + ], + "score": 0.85, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 550, + 504, + 562 + ], + "score": 1.0, + "content": "regularization induces monotonicity, including random feature classifiers and convolu-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 561, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 573 + ], + "score": 1.0, + "content": "tional neural networks. This suggests that the mitigating effect of optimal regularization may hold", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 573, + 380, + 584 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 380, + 584 + ], + "score": 1.0, + "content": "more generally in broad machine learning contexts. (See Section 5).", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 44.5, + "bbox_fs": [ + 105, + 538, + 505, + 584 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 589, + 217, + 600 + ], + "lines": [ + { + "bbox": [ + 106, + 587, + 219, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 219, + 601 + ], + "score": 1.0, + "content": "A few remarks are in order:", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 47, + "bbox_fs": [ + 106, + 587, + 219, + 601 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 605, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 105, + 604, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 618 + ], + "score": 1.0, + "content": "Problem-specific vs Minimax and Bayesian. It is worth noting that our results hold for all linear", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 616, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 505, + 629 + ], + "score": 1.0, + "content": "ground-truths, rather than holding for only the worst-case ground-truth or a random ground-truth.", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 627, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 640 + ], + "score": 1.0, + "content": "Indeed, the minimax optimal estimator or the Bayes optimal estimator are both trivially sample-wise", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 639, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 639, + 505, + 650 + ], + "score": 1.0, + "content": "and model-wise monotonic with respect to the minimax risk or the Bayes risk. However, they do not", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 649, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 506, + 662 + ], + "score": 1.0, + "content": "guarantee monotonicity of the risk itself for a given fixed problem. In particular, there exist minimax", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 106, + 661, + 408, + 671 + ], + "spans": [ + { + "bbox": [ + 106, + 661, + 408, + 671 + ], + "score": 1.0, + "content": "optimal estimators which are not sample-monotonic in the sense we desire.", + "type": "text" + } + ], + "index": 53 + } + ], + "index": 50.5, + "bbox_fs": [ + 105, + 604, + 506, + 671 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 677, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "Universal vs Asymptotic. We also remark that our analysis is not only non-asymptotic but also", + "type": "text" + } + ], + "index": 54 + }, + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "works for all possible input dimensions, model sizes, and sample sizes. To our knowledge, the", + "type": "text" + } + ], + "index": 55 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "results herein are the first non-asymptotic sample-wise and model-wise monotonicity results for", + "type": "text" + } + ], + "index": 56 + }, + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "linear regression. (See discussion of related works Hastie et al. (2019); Mei & Montanari (2019)", + "type": "text" + } + ], + "index": 57 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "for related results in the asymptotic setting). Our work reveals aspects of the problem that were not", + "type": "text" + } + ], + "index": 58 + }, + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "present in prior asymptotic works. For example, we empirically show that optimal regularization", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "can eliminate even “triple descent” in ridge regression (Figure 2). Moreover, we show that for non-", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 506, + 117 + ], + "score": 1.0, + "content": "Gaussian covariates, optimally-tuned ridge regression is not always sample-monotonic: we give a", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 116, + 225, + 127 + ], + "spans": [ + { + "bbox": [ + 106, + 116, + 225, + 127 + ], + "score": 1.0, + "content": "counterexample in Section 4.", + "type": "text", + "cross_page": true + } + ], + "index": 3 + } + ], + "index": 56, + "bbox_fs": [ + 105, + 676, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 126 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "present in prior asymptotic works. For example, we empirically show that optimal regularization", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "can eliminate even “triple descent” in ridge regression (Figure 2). Moreover, we show that for non-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 506, + 117 + ], + "score": 1.0, + "content": "Gaussian covariates, optimally-tuned ridge regression is not always sample-monotonic: we give a", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 116, + 225, + 127 + ], + "spans": [ + { + "bbox": [ + 106, + 116, + 225, + 127 + ], + "score": 1.0, + "content": "counterexample in Section 4.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "text", + "bbox": [ + 108, + 132, + 505, + 176 + ], + "lines": [ + { + "bbox": [ + 106, + 132, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 106, + 132, + 505, + 144 + ], + "score": 1.0, + "content": "Towards a more general characterization. Our theoretical results crucially rely on the covariance", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 143, + 505, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 143, + 505, + 155 + ], + "score": 1.0, + "content": "of the data being isotropic. A natural next question is if and when the same results can hold more", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 104, + 154, + 505, + 167 + ], + "score": 1.0, + "content": "generally. A full answer to this question is beyond the scope of this paper, though we give the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 165, + 179, + 177 + ], + "spans": [ + { + "bbox": [ + 106, + 165, + 179, + 177 + ], + "score": 1.0, + "content": "following results:", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 129, + 186, + 505, + 336 + ], + "lines": [ + { + "bbox": [ + 130, + 186, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 130, + 186, + 505, + 199 + ], + "score": 1.0, + "content": "1. Optimally-tuned ridge regression is not always sample-monotonic: we show a counterex-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 198, + 505, + 209 + ], + "spans": [ + { + "bbox": [ + 141, + 198, + 505, + 209 + ], + "score": 1.0, + "content": "ample for a certain non-Gaussian data distribution and heteroscedastic noise. We are not", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 209, + 505, + 220 + ], + "spans": [ + { + "bbox": [ + 141, + 209, + 505, + 220 + ], + "score": 1.0, + "content": "aware of prior work pointing out this fact. (See Section 4 for the counterexample and", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 142, + 219, + 188, + 230 + ], + "spans": [ + { + "bbox": [ + 142, + 219, + 188, + 230 + ], + "score": 1.0, + "content": "intuitions.)", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 129, + 234, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 129, + 234, + 505, + 246 + ], + "score": 1.0, + "content": "2. For non-isotropic Gaussian covariates, we can achieve sample-wise monotonicity with a", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 245, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 141, + 245, + 505, + 257 + ], + "score": 1.0, + "content": "regularizer that depends on the population covariance matrix of data. This suggests unla-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 255, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 141, + 255, + 505, + 268 + ], + "score": 1.0, + "content": "beled data might also help mitigate double descent in some settings, because the population", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 267, + 418, + 279 + ], + "spans": [ + { + "bbox": [ + 141, + 267, + 418, + 279 + ], + "score": 1.0, + "content": "covariance can be estimated from unlabeled data. (See Appendix B).", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 129, + 281, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 129, + 281, + 505, + 294 + ], + "score": 1.0, + "content": "3. For non-isotropic Gaussian covariates, we conjecture that optimally-tuned ridge regression", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 140, + 292, + 506, + 305 + ], + "spans": [ + { + "bbox": [ + 140, + 292, + 319, + 305 + ], + "score": 1.0, + "content": "is sample-monotonic even with a standard", + "type": "text" + }, + { + "bbox": [ + 320, + 293, + 330, + 303 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 292, + 506, + 305 + ], + "score": 1.0, + "content": "regularizer (as in Figure 2). We derive a", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 304, + 505, + 316 + ], + "spans": [ + { + "bbox": [ + 141, + 304, + 505, + 316 + ], + "score": 1.0, + "content": "sufficient condition for this conjecture. Due to that current random matrix theory may be", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 142, + 315, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 142, + 315, + 505, + 327 + ], + "score": 1.0, + "content": "insufficient to verify this conjecture, we verify it numerically on a wide variety of cases.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 142, + 326, + 262, + 338 + ], + "spans": [ + { + "bbox": [ + 142, + 326, + 262, + 338 + ], + "score": 1.0, + "content": "(See Appendix B for details).", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 108, + 346, + 505, + 390 + ], + "lines": [ + { + "bbox": [ + 105, + 345, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 505, + 359 + ], + "score": 1.0, + "content": "The last two results above highlight the importance of the form of the regularizer, which leads to the", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 357, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 505, + 369 + ], + "score": 1.0, + "content": "open question: “How do we design good regularizers which mitigate or remove double descent?”", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 368, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 106, + 368, + 505, + 381 + ], + "score": 1.0, + "content": "We hope that our results can motivate future work on mitigating the double descent phenomenon,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 380, + 482, + 390 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 482, + 390 + ], + "score": 1.0, + "content": "and allow us to train high performance models which do not exhibit nonmonotonic behaviors.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22.5 + }, + { + "type": "title", + "bbox": [ + 108, + 404, + 207, + 415 + ], + "lines": [ + { + "bbox": [ + 106, + 403, + 209, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 403, + 209, + 417 + ], + "score": 1.0, + "content": "1.1 RELATED WORKS", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 424, + 505, + 512 + ], + "lines": [ + { + "bbox": [ + 105, + 423, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 505, + 437 + ], + "score": 1.0, + "content": "The study of nonmonotonicity in learning algorithms existed prior to double descent and has a long", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 435, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 505, + 447 + ], + "score": 1.0, + "content": "history going back to (at least) Trunk (1979) and LeCun et al. (1991); Le Cun et al. (1991), where the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 446, + 506, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 506, + 459 + ], + "score": 1.0, + "content": "former was largely empirical observations and the latter studied the sample non-nonmonotonicity of", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 457, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 505, + 469 + ], + "score": 1.0, + "content": "unregularized linear regression in terms of the eigenspectrum of the covariance matrix; the difference", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "score": 1.0, + "content": "to our works is that we study this in the context of optimal regularization. In fact, Duin (1995;", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 479, + 506, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 506, + 491 + ], + "score": 1.0, + "content": "2000); Opper (2001); Loog & Duin (2012). Loog et al. (2019) introduces the same notion of risk", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 491, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 106, + 491, + 505, + 502 + ], + "score": 1.0, + "content": "monotonicity which we consider, and studies several examples of monotonic and non-monotonic", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 501, + 156, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 156, + 514 + ], + "score": 1.0, + "content": "procedures.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 107, + 517, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 105, + 517, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 505, + 530 + ], + "score": 1.0, + "content": "Double descent of test risk as a function of model size was considered recently in more generality", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 529, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 506, + 540 + ], + "score": 1.0, + "content": "by Belkin et al. (2018). Similar behavior was observed empirically in earlier work in somewhat", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 540, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 505, + 552 + ], + "score": 1.0, + "content": "more restricted settings Trunk (1979); Opper (1995; 2001); Skurichina & Duin (2002); Le Cun et al.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 551, + 504, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 504, + 563 + ], + "score": 1.0, + "content": "(1991); LeCun et al. (1991) and more recently in Advani & Saxe (2017); Geiger et al. (2019a);", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "Spigler et al. (2018); Neal et al. (2018). Recently Nakkiran et al. (2020) demonstrated a generalized", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 572, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 586 + ], + "score": 1.0, + "content": "double descent phenomenon on modern deep networks, and highlighted “sample non-monotonicity”", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 583, + 232, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 232, + 596 + ], + "score": 1.0, + "content": "as an aspect of double descent.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 106, + 600, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 599, + 502, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 502, + 613 + ], + "score": 1.0, + "content": "A recent stream of theoretical works consider model-wise double descent in simplified settings—", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 611, + 504, + 623 + ], + "spans": [ + { + "bbox": [ + 106, + 611, + 504, + 623 + ], + "score": 1.0, + "content": "often via linear models for regression or classification. This also connects to works on high-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "score": 1.0, + "content": "dimentional regression in the statistics literature. A partial list of works in these areas include", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "score": 1.0, + "content": "Belkin et al. (2019); Hastie et al. (2019); Bartlett et al. (2019); Muthukumar et al. (2019); Bibas", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 104, + 642, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 104, + 642, + 505, + 657 + ], + "score": 1.0, + "content": "et al. (2019); Mitra (2019); Mei & Montanari (2019); Liang & Rakhlin (2018); Liang et al. (2019);", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 654, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 505, + 668 + ], + "score": 1.0, + "content": "Xu & Hsu (2019); Derezinski et al. (2019); Lampinen & Ganguli (2018); Deng et al. (2019); Nakki- ´", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "ran (2019); Mahdaviyeh & Naulet (2019); Dobriban et al. (2018); Dobriban & Sheng (2019); Kobak", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "et al. (2018). Of these, most closely related to our work are Hastie et al. (2019); Dobriban et al.", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "(2018); Mei & Montanari (2019). Specifically, Hastie et al. (2019) considers the risk of unregular-", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 435, + 711 + ], + "score": 1.0, + "content": "ized and regularized linear regression in an asymptotic regime, where dimension", + "type": "text" + }, + { + "bbox": [ + 435, + 699, + 442, + 709 + ], + "score": 0.75, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "and number of", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 141, + 722 + ], + "score": 1.0, + "content": "samples", + "type": "text" + }, + { + "bbox": [ + 142, + 712, + 149, + 720 + ], + "score": 0.66, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 710, + 330, + 722 + ], + "score": 1.0, + "content": "scale to infinity together, at a constant ratio", + "type": "text" + }, + { + "bbox": [ + 330, + 710, + 347, + 722 + ], + "score": 0.9, + "content": "d / n", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 710, + 505, + 722 + ], + "score": 1.0, + "content": ". In contrast, we show non-asymptotic", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 719, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 505, + 734 + ], + "score": 1.0, + "content": "results, and are able to consider increasing the number of samples for a fixed model, without scaling", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 46.5 + } + ], + "page_idx": 2, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 292, + 37 + ], + "lines": [ + { + "bbox": [ + 105, + 25, + 293, + 39 + ], + "spans": [ + { + "bbox": [ + 105, + 25, + 293, + 39 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 126 + ], + "lines": [], + "index": 1.5, + "bbox_fs": [ + 105, + 82, + 506, + 127 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 108, + 132, + 505, + 176 + ], + "lines": [ + { + "bbox": [ + 106, + 132, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 106, + 132, + 505, + 144 + ], + "score": 1.0, + "content": "Towards a more general characterization. Our theoretical results crucially rely on the covariance", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 143, + 505, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 143, + 505, + 155 + ], + "score": 1.0, + "content": "of the data being isotropic. A natural next question is if and when the same results can hold more", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 104, + 154, + 505, + 167 + ], + "score": 1.0, + "content": "generally. A full answer to this question is beyond the scope of this paper, though we give the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 165, + 179, + 177 + ], + "spans": [ + { + "bbox": [ + 106, + 165, + 179, + 177 + ], + "score": 1.0, + "content": "following results:", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5, + "bbox_fs": [ + 104, + 132, + 505, + 177 + ] + }, + { + "type": "list", + "bbox": [ + 129, + 186, + 505, + 336 + ], + "lines": [ + { + "bbox": [ + 130, + 186, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 130, + 186, + 505, + 199 + ], + "score": 1.0, + "content": "1. Optimally-tuned ridge regression is not always sample-monotonic: we show a counterex-", + "type": "text" + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 198, + 505, + 209 + ], + "spans": [ + { + "bbox": [ + 141, + 198, + 505, + 209 + ], + "score": 1.0, + "content": "ample for a certain non-Gaussian data distribution and heteroscedastic noise. We are not", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 209, + 505, + 220 + ], + "spans": [ + { + "bbox": [ + 141, + 209, + 505, + 220 + ], + "score": 1.0, + "content": "aware of prior work pointing out this fact. (See Section 4 for the counterexample and", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 142, + 219, + 188, + 230 + ], + "spans": [ + { + "bbox": [ + 142, + 219, + 188, + 230 + ], + "score": 1.0, + "content": "intuitions.)", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 129, + 234, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 129, + 234, + 505, + 246 + ], + "score": 1.0, + "content": "2. For non-isotropic Gaussian covariates, we can achieve sample-wise monotonicity with a", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 245, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 141, + 245, + 505, + 257 + ], + "score": 1.0, + "content": "regularizer that depends on the population covariance matrix of data. This suggests unla-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 255, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 141, + 255, + 505, + 268 + ], + "score": 1.0, + "content": "beled data might also help mitigate double descent in some settings, because the population", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 267, + 418, + 279 + ], + "spans": [ + { + "bbox": [ + 141, + 267, + 418, + 279 + ], + "score": 1.0, + "content": "covariance can be estimated from unlabeled data. (See Appendix B).", + "type": "text" + } + ], + "index": 15, + "is_list_end_line": true + }, + { + "bbox": [ + 129, + 281, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 129, + 281, + 505, + 294 + ], + "score": 1.0, + "content": "3. For non-isotropic Gaussian covariates, we conjecture that optimally-tuned ridge regression", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 140, + 292, + 506, + 305 + ], + "spans": [ + { + "bbox": [ + 140, + 292, + 319, + 305 + ], + "score": 1.0, + "content": "is sample-monotonic even with a standard", + "type": "text" + }, + { + "bbox": [ + 320, + 293, + 330, + 303 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 292, + 506, + 305 + ], + "score": 1.0, + "content": "regularizer (as in Figure 2). We derive a", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 304, + 505, + 316 + ], + "spans": [ + { + "bbox": [ + 141, + 304, + 505, + 316 + ], + "score": 1.0, + "content": "sufficient condition for this conjecture. Due to that current random matrix theory may be", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 142, + 315, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 142, + 315, + 505, + 327 + ], + "score": 1.0, + "content": "insufficient to verify this conjecture, we verify it numerically on a wide variety of cases.", + "type": "text" + } + ], + "index": 19, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 326, + 262, + 338 + ], + "spans": [ + { + "bbox": [ + 142, + 326, + 262, + 338 + ], + "score": 1.0, + "content": "(See Appendix B for details).", + "type": "text" + } + ], + "index": 20, + "is_list_end_line": true + } + ], + "index": 14, + "bbox_fs": [ + 129, + 186, + 506, + 338 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 346, + 505, + 390 + ], + "lines": [ + { + "bbox": [ + 105, + 345, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 505, + 359 + ], + "score": 1.0, + "content": "The last two results above highlight the importance of the form of the regularizer, which leads to the", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 357, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 505, + 369 + ], + "score": 1.0, + "content": "open question: “How do we design good regularizers which mitigate or remove double descent?”", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 368, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 106, + 368, + 505, + 381 + ], + "score": 1.0, + "content": "We hope that our results can motivate future work on mitigating the double descent phenomenon,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 380, + 482, + 390 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 482, + 390 + ], + "score": 1.0, + "content": "and allow us to train high performance models which do not exhibit nonmonotonic behaviors.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 345, + 505, + 390 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 404, + 207, + 415 + ], + "lines": [ + { + "bbox": [ + 106, + 403, + 209, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 403, + 209, + 417 + ], + "score": 1.0, + "content": "1.1 RELATED WORKS", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 424, + 505, + 512 + ], + "lines": [ + { + "bbox": [ + 105, + 423, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 505, + 437 + ], + "score": 1.0, + "content": "The study of nonmonotonicity in learning algorithms existed prior to double descent and has a long", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 435, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 505, + 447 + ], + "score": 1.0, + "content": "history going back to (at least) Trunk (1979) and LeCun et al. (1991); Le Cun et al. (1991), where the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 446, + 506, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 506, + 459 + ], + "score": 1.0, + "content": "former was largely empirical observations and the latter studied the sample non-nonmonotonicity of", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 457, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 505, + 469 + ], + "score": 1.0, + "content": "unregularized linear regression in terms of the eigenspectrum of the covariance matrix; the difference", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "score": 1.0, + "content": "to our works is that we study this in the context of optimal regularization. In fact, Duin (1995;", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 479, + 506, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 506, + 491 + ], + "score": 1.0, + "content": "2000); Opper (2001); Loog & Duin (2012). Loog et al. (2019) introduces the same notion of risk", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 491, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 106, + 491, + 505, + 502 + ], + "score": 1.0, + "content": "monotonicity which we consider, and studies several examples of monotonic and non-monotonic", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 501, + 156, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 156, + 514 + ], + "score": 1.0, + "content": "procedures.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 29.5, + "bbox_fs": [ + 105, + 423, + 506, + 514 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 517, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 105, + 517, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 505, + 530 + ], + "score": 1.0, + "content": "Double descent of test risk as a function of model size was considered recently in more generality", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 529, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 506, + 540 + ], + "score": 1.0, + "content": "by Belkin et al. (2018). Similar behavior was observed empirically in earlier work in somewhat", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 540, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 505, + 552 + ], + "score": 1.0, + "content": "more restricted settings Trunk (1979); Opper (1995; 2001); Skurichina & Duin (2002); Le Cun et al.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 551, + 504, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 504, + 563 + ], + "score": 1.0, + "content": "(1991); LeCun et al. (1991) and more recently in Advani & Saxe (2017); Geiger et al. (2019a);", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "Spigler et al. (2018); Neal et al. (2018). Recently Nakkiran et al. (2020) demonstrated a generalized", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 572, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 586 + ], + "score": 1.0, + "content": "double descent phenomenon on modern deep networks, and highlighted “sample non-monotonicity”", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 583, + 232, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 232, + 596 + ], + "score": 1.0, + "content": "as an aspect of double descent.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 517, + 506, + 596 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 600, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 599, + 502, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 502, + 613 + ], + "score": 1.0, + "content": "A recent stream of theoretical works consider model-wise double descent in simplified settings—", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 611, + 504, + 623 + ], + "spans": [ + { + "bbox": [ + 106, + 611, + 504, + 623 + ], + "score": 1.0, + "content": "often via linear models for regression or classification. This also connects to works on high-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "score": 1.0, + "content": "dimentional regression in the statistics literature. A partial list of works in these areas include", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "score": 1.0, + "content": "Belkin et al. (2019); Hastie et al. (2019); Bartlett et al. (2019); Muthukumar et al. (2019); Bibas", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 104, + 642, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 104, + 642, + 505, + 657 + ], + "score": 1.0, + "content": "et al. (2019); Mitra (2019); Mei & Montanari (2019); Liang & Rakhlin (2018); Liang et al. (2019);", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 654, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 505, + 668 + ], + "score": 1.0, + "content": "Xu & Hsu (2019); Derezinski et al. (2019); Lampinen & Ganguli (2018); Deng et al. (2019); Nakki- ´", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "ran (2019); Mahdaviyeh & Naulet (2019); Dobriban et al. (2018); Dobriban & Sheng (2019); Kobak", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "et al. (2018). Of these, most closely related to our work are Hastie et al. (2019); Dobriban et al.", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "(2018); Mei & Montanari (2019). Specifically, Hastie et al. (2019) considers the risk of unregular-", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 435, + 711 + ], + "score": 1.0, + "content": "ized and regularized linear regression in an asymptotic regime, where dimension", + "type": "text" + }, + { + "bbox": [ + 435, + 699, + 442, + 709 + ], + "score": 0.75, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "and number of", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 141, + 722 + ], + "score": 1.0, + "content": "samples", + "type": "text" + }, + { + "bbox": [ + 142, + 712, + 149, + 720 + ], + "score": 0.66, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 710, + 330, + 722 + ], + "score": 1.0, + "content": "scale to infinity together, at a constant ratio", + "type": "text" + }, + { + "bbox": [ + 330, + 710, + 347, + 722 + ], + "score": 0.9, + "content": "d / n", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 710, + 505, + 722 + ], + "score": 1.0, + "content": ". In contrast, we show non-asymptotic", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 719, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 505, + 734 + ], + "score": 1.0, + "content": "results, and are able to consider increasing the number of samples for a fixed model, without scaling", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 106, + 82, + 504, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 504, + 95 + ], + "score": 1.0, + "content": "both together. Mei & Montanari (2019) derive similar results for unregularized and regularized ran-", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "dom features, also in an asymptotic limit. The non-asymptotic versions of the settings considered in", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 505, + 117 + ], + "score": 1.0, + "content": "Hastie et al. (2019) are almost identical to ours— for example, our projection model in Section 3 is", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 114, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 506, + 128 + ], + "score": 1.0, + "content": "nearly identical to the model in Hastie et al. (2019, Section 5.1). Finally, subsequent to our work,", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 125, + 390, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 125, + 390, + 140 + ], + "score": 1.0, + "content": "d’Ascoli et al. (2020) identified triple descent in an asymptotic setting.", + "type": "text", + "cross_page": true + } + ], + "index": 4 + } + ], + "index": 46.5, + "bbox_fs": [ + 104, + 599, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 138 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 504, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 504, + 95 + ], + "score": 1.0, + "content": "both together. Mei & Montanari (2019) derive similar results for unregularized and regularized ran-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "dom features, also in an asymptotic limit. The non-asymptotic versions of the settings considered in", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 505, + 117 + ], + "score": 1.0, + "content": "Hastie et al. (2019) are almost identical to ours— for example, our projection model in Section 3 is", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 114, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 506, + 128 + ], + "score": 1.0, + "content": "nearly identical to the model in Hastie et al. (2019, Section 5.1). Finally, subsequent to our work,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 125, + 390, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 125, + 390, + 140 + ], + "score": 1.0, + "content": "d’Ascoli et al. (2020) identified triple descent in an asymptotic setting.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "title", + "bbox": [ + 107, + 154, + 380, + 167 + ], + "lines": [ + { + "bbox": [ + 105, + 153, + 382, + 169 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 382, + 169 + ], + "score": 1.0, + "content": "2 SAMPLE MONOTONICITY IN RIDGE RIDGRESSION", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 179, + 505, + 225 + ], + "lines": [ + { + "bbox": [ + 105, + 180, + 506, + 193 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 506, + 193 + ], + "score": 1.0, + "content": "In this section, we prove that optimally-regularized ridge regression has test risk that is monotonic", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 191, + 505, + 203 + ], + "spans": [ + { + "bbox": [ + 105, + 191, + 505, + 203 + ], + "score": 1.0, + "content": "in samples, for isotropic gaussian covariates and linear response. This confirms the behavior empir-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 202, + 505, + 214 + ], + "spans": [ + { + "bbox": [ + 105, + 202, + 505, + 214 + ], + "score": 1.0, + "content": "ically observed in Figure 1. We also show that this monotonicity is not “fragile”, and using larger", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 213, + 420, + 225 + ], + "spans": [ + { + "bbox": [ + 106, + 213, + 420, + 225 + ], + "score": 1.0, + "content": "than larger regularization is still sample-monotonic (consistent with Figure 1).", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 106, + 229, + 505, + 323 + ], + "lines": [ + { + "bbox": [ + 106, + 230, + 505, + 242 + ], + "spans": [ + { + "bbox": [ + 106, + 230, + 366, + 242 + ], + "score": 1.0, + "content": "Formally, we consider the following linear regression problem in", + "type": "text" + }, + { + "bbox": [ + 367, + 231, + 374, + 240 + ], + "score": 0.77, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 230, + 505, + 242 + ], + "score": 1.0, + "content": "dimensions. The input/covariate", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 240, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 107, + 241, + 138, + 251 + ], + "score": 0.9, + "content": "x \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 139, + 240, + 213, + 254 + ], + "score": 1.0, + "content": "is generated from", + "type": "text" + }, + { + "bbox": [ + 214, + 241, + 250, + 253 + ], + "score": 0.92, + "content": "\\mathcal { N } ( 0 , I _ { d } )", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 240, + 416, + 254 + ], + "score": 1.0, + "content": ", and the output/response is generated by", + "type": "text" + }, + { + "bbox": [ + 417, + 241, + 483, + 253 + ], + "score": 0.93, + "content": "y = \\langle x , \\beta ^ { * } \\rangle + \\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 240, + 505, + 254 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 249, + 506, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 252, + 163, + 264 + ], + "score": 0.92, + "content": "\\varepsilon \\sim \\mathcal { N } ( 0 , \\bar { \\sigma } ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 249, + 285, + 266 + ], + "score": 1.0, + "content": "for some unknown parameter", + "type": "text" + }, + { + "bbox": [ + 286, + 252, + 321, + 263 + ], + "score": 0.9, + "content": "\\beta ^ { * } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 249, + 467, + 266 + ], + "score": 1.0, + "content": ". We denote the joint distribution of", + "type": "text" + }, + { + "bbox": [ + 468, + 253, + 491, + 264 + ], + "score": 0.9, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 249, + 506, + 266 + ], + "score": 1.0, + "content": "by", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 107, + 262, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 107, + 264, + 115, + 273 + ], + "score": 0.74, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 262, + 176, + 277 + ], + "score": 1.0, + "content": ". We are given", + "type": "text" + }, + { + "bbox": [ + 176, + 266, + 183, + 273 + ], + "score": 0.76, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 262, + 259, + 277 + ], + "score": 1.0, + "content": "training examples", + "type": "text" + }, + { + "bbox": [ + 260, + 263, + 313, + 275 + ], + "score": 0.91, + "content": "\\{ ( x _ { i } , y _ { i } ) \\} _ { i = 1 } ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 262, + 391, + 277 + ], + "score": 1.0, + "content": "i.i.d sampled from", + "type": "text" + }, + { + "bbox": [ + 392, + 264, + 400, + 273 + ], + "score": 0.8, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 262, + 506, + 277 + ], + "score": 1.0, + "content": ". We aim to learn a linear", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 273, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 104, + 273, + 134, + 288 + ], + "score": 1.0, + "content": "model", + "type": "text" + }, + { + "bbox": [ + 134, + 274, + 196, + 286 + ], + "score": 0.93, + "content": "f _ { \\beta } ( x ) = \\langle x , \\beta \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 273, + 305, + 288 + ], + "score": 1.0, + "content": "with small population risk", + "type": "text" + }, + { + "bbox": [ + 306, + 274, + 440, + 287 + ], + "score": 0.9, + "content": "\\bar { R } ( \\beta ) : = \\mathbb { E } _ { ( x , y ) \\sim \\mathcal { D } } [ ( \\langle x , \\beta \\rangle - y ) ^ { 2 } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 273, + 506, + 288 + ], + "score": 1.0, + "content": ". For simplicity,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 284, + 506, + 301 + ], + "spans": [ + { + "bbox": [ + 104, + 284, + 119, + 301 + ], + "score": 1.0, + "content": "let", + "type": "text" + }, + { + "bbox": [ + 119, + 287, + 166, + 297 + ], + "score": 0.91, + "content": "\\ b { X } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 284, + 296, + 301 + ], + "score": 1.0, + "content": "be the data matrix that contains", + "type": "text" + }, + { + "bbox": [ + 297, + 287, + 310, + 299 + ], + "score": 0.9, + "content": "x _ { i } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 284, + 381, + 301 + ], + "score": 1.0, + "content": "’s as rows and let", + "type": "text" + }, + { + "bbox": [ + 381, + 288, + 413, + 299 + ], + "score": 0.9, + "content": "\\vec { y } \\in \\mathbb R ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 284, + 506, + 301 + ], + "score": 1.0, + "content": "be column vector that", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 298, + 505, + 313 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 198, + 313 + ], + "score": 1.0, + "content": "contains the responses", + "type": "text" + }, + { + "bbox": [ + 198, + 302, + 207, + 312 + ], + "score": 0.81, + "content": "y _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 300, + 330, + 313 + ], + "score": 1.0, + "content": "’s as entries. For any estimator", + "type": "text" + }, + { + "bbox": [ + 330, + 298, + 368, + 312 + ], + "score": 0.94, + "content": "\\hat { \\beta } _ { n } ( X , \\vec { y } )", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 300, + 433, + 313 + ], + "score": 1.0, + "content": "as a function of", + "type": "text" + }, + { + "bbox": [ + 433, + 303, + 440, + 310 + ], + "score": 0.74, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 300, + 505, + 313 + ], + "score": 1.0, + "content": "samples, define", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 311, + 255, + 323 + ], + "spans": [ + { + "bbox": [ + 106, + 311, + 255, + 323 + ], + "score": 1.0, + "content": "the expected risk of the estimator as:", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 13.5 + }, + { + "type": "interline_equation", + "bbox": [ + 239, + 328, + 372, + 350 + ], + "lines": [ + { + "bbox": [ + 239, + 328, + 372, + 350 + ], + "spans": [ + { + "bbox": [ + 239, + 328, + 372, + 350 + ], + "score": 0.94, + "content": "{ \\overline { { R } } } ( { \\hat { \\beta } } _ { n } ) : = \\operatorname * { \\mathbb { E } } _ { X , y \\sim { \\mathcal { D } } ^ { n } } [ R ( { \\hat { \\beta } } _ { n } ( X , { \\vec { y } } ) ) ]", + "type": "interline_equation", + "image_path": "ca8f1f38d0fbad23b37af04d06db0fdee27ea648b14d9cc7188acd0d5ba2d5d0.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 239, + 328, + 372, + 350 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 356, + 506, + 378 + ], + "lines": [ + { + "bbox": [ + 106, + 354, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 106, + 354, + 505, + 369 + ], + "score": 1.0, + "content": "We consider the regularized least-squares estimator, also known as the ridge regression estimator.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 366, + 210, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 366, + 154, + 379 + ], + "score": 1.0, + "content": "For a given", + "type": "text" + }, + { + "bbox": [ + 154, + 367, + 179, + 377 + ], + "score": 0.9, + "content": "\\lambda > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 366, + 210, + 379 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "interline_equation", + "bbox": [ + 175, + 384, + 437, + 407 + ], + "lines": [ + { + "bbox": [ + 175, + 384, + 437, + 407 + ], + "spans": [ + { + "bbox": [ + 175, + 384, + 437, + 407 + ], + "score": 0.93, + "content": "\\hat { \\beta } _ { n , \\lambda } : = \\underset { \\beta } { \\operatorname { a r g m i n } } | | X \\beta - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda | | \\beta | | _ { 2 } ^ { 2 } = ( X ^ { T } X + \\lambda I _ { d } ) ^ { - 1 } X ^ { T } \\vec { y }", + "type": "interline_equation", + "image_path": "d1e09e8985a269d77fd3cb37a62099e25386d5abe73ff5141e77c5f63a87f69b.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 175, + 384, + 437, + 407 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 413, + 506, + 479 + ], + "lines": [ + { + "bbox": [ + 104, + 411, + 507, + 428 + ], + "spans": [ + { + "bbox": [ + 104, + 411, + 129, + 428 + ], + "score": 1.0, + "content": "Here", + "type": "text" + }, + { + "bbox": [ + 129, + 415, + 140, + 426 + ], + "score": 0.87, + "content": "I _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 411, + 191, + 428 + ], + "score": 1.0, + "content": "denotes the", + "type": "text" + }, + { + "bbox": [ + 191, + 415, + 198, + 425 + ], + "score": 0.78, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 411, + 336, + 428 + ], + "score": 1.0, + "content": "dimensional identity matrix. Let", + "type": "text" + }, + { + "bbox": [ + 336, + 414, + 353, + 425 + ], + "score": 0.9, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 411, + 507, + 428 + ], + "score": 1.0, + "content": "be the optimal ridge parameter (that", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 102, + 423, + 504, + 443 + ], + "spans": [ + { + "bbox": [ + 102, + 423, + 286, + 443 + ], + "score": 1.0, + "content": "achieves the minimum expected risk) given", + "type": "text" + }, + { + "bbox": [ + 287, + 430, + 294, + 438 + ], + "score": 0.73, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 423, + 335, + 443 + ], + "score": 1.0, + "content": "samples:", + "type": "text" + }, + { + "bbox": [ + 336, + 426, + 462, + 441 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\lambda _ { n } ^ { \\mathrm { o p t } } : = \\operatorname * { a r g m i n } _ { \\lambda : \\lambda \\geq 0 } \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 423, + 487, + 443 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 487, + 426, + 504, + 439 + ], + "score": 0.9, + "content": "\\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } }", + "type": "inline_equation" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 437, + 506, + 456 + ], + "spans": [ + { + "bbox": [ + 104, + 437, + 271, + 456 + ], + "score": 1.0, + "content": "be the estimator that corresponds to the", + "type": "text" + }, + { + "bbox": [ + 271, + 441, + 288, + 453 + ], + "score": 0.9, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 437, + 328, + 456 + ], + "score": 1.0, + "content": ". That is,", + "type": "text" + }, + { + "bbox": [ + 329, + 441, + 501, + 455 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } : = \\operatorname * { a r g m i n } _ { \\beta } | | X \\beta - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda _ { n } ^ { \\mathrm { o p t } } | | \\beta | | _ { 2 } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 437, + 506, + 456 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 452, + 504, + 471 + ], + "spans": [ + { + "bbox": [ + 104, + 452, + 366, + 471 + ], + "score": 1.0, + "content": "Our main theorem in this section shows that the expected risk of", + "type": "text" + }, + { + "bbox": [ + 367, + 455, + 383, + 468 + ], + "score": 0.91, + "content": "\\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 452, + 496, + 471 + ], + "score": 1.0, + "content": "monotonically decreases as", + "type": "text" + }, + { + "bbox": [ + 497, + 459, + 504, + 466 + ], + "score": 0.74, + "content": "n", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 467, + 148, + 478 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 148, + 478 + ], + "score": 1.0, + "content": "increases.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 482, + 505, + 515 + ], + "lines": [ + { + "bbox": [ + 105, + 481, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 481, + 506, + 495 + ], + "score": 1.0, + "content": "Theorem 1. In the setting above, the expected test risk of optimally-regularized well-specified", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 492, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 383, + 505 + ], + "score": 1.0, + "content": "isotropic linear regression is monotonic in samples. That is, for all", + "type": "text" + }, + { + "bbox": [ + 383, + 493, + 421, + 505 + ], + "score": 0.92, + "content": "\\beta ^ { * } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 492, + 455, + 505 + ], + "score": 1.0, + "content": "and all", + "type": "text" + }, + { + "bbox": [ + 455, + 493, + 505, + 505 + ], + "score": 0.9, + "content": "d \\in \\mathbb { N } , n \\in", + "type": "inline_equation" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 503, + 147, + 516 + ], + "spans": [ + { + "bbox": [ + 106, + 504, + 144, + 515 + ], + "score": 0.91, + "content": "\\mathbb { N } , \\sigma > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 503, + 147, + 516 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28 + }, + { + "type": "interline_equation", + "bbox": [ + 264, + 514, + 347, + 531 + ], + "lines": [ + { + "bbox": [ + 264, + 514, + 347, + 531 + ], + "spans": [ + { + "bbox": [ + 264, + 514, + 347, + 531 + ], + "score": 0.91, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n + 1 } ^ { \\mathrm { o p t } } ) \\leq \\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } )", + "type": "interline_equation", + "image_path": "02c89e1530f055b86ccd8d1b6fb13f02720f9d0d99c45df164c8d8dfcd675713.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 264, + 514, + 347, + 531 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 538, + 505, + 583 + ], + "lines": [ + { + "bbox": [ + 105, + 537, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 537, + 505, + 551 + ], + "score": 1.0, + "content": "The above theorem shows a strong form of monotonicity, since it holds for every fixed ground-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 128, + 563 + ], + "score": 1.0, + "content": "truth", + "type": "text" + }, + { + "bbox": [ + 128, + 550, + 140, + 561 + ], + "score": 0.88, + "content": "\\beta ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 550, + 505, + 563 + ], + "score": 1.0, + "content": ", and does not require averaging over any prior on ground-truths. Moreover, it holds non-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 561, + 506, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 231, + 573 + ], + "score": 1.0, + "content": "asymptotically, for every fixed", + "type": "text" + }, + { + "bbox": [ + 231, + 561, + 268, + 572 + ], + "score": 0.91, + "content": "n , d \\in \\mathbb { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 561, + 506, + 573 + ], + "score": 1.0, + "content": ". Obtaining such non-asymptotic results is nontrivial, since", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 572, + 415, + 584 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 415, + 584 + ], + "score": 1.0, + "content": "we cannot rely on concentration properties of the involved random variables.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 106, + 589, + 505, + 659 + ], + "lines": [ + { + "bbox": [ + 105, + 588, + 506, + 604 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 204, + 604 + ], + "score": 1.0, + "content": "In particular, evaluating", + "type": "text" + }, + { + "bbox": [ + 204, + 589, + 236, + 603 + ], + "score": 0.93, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 588, + 398, + 604 + ], + "score": 1.0, + "content": "as a function of the problem parameters", + "type": "text" + }, + { + "bbox": [ + 399, + 591, + 433, + 602 + ], + "score": 0.92, + "content": "( n , \\sigma , \\beta ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 588, + 455, + 604 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 455, + 591, + 461, + 601 + ], + "score": 0.65, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 588, + 506, + 604 + ], + "score": 1.0, + "content": ") is techni-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 601, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 106, + 601, + 505, + 614 + ], + "score": 1.0, + "content": "cally challenging. In fact, we suspect that a simple closed form expression does not exist. The key", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 612, + 505, + 625 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 505, + 625 + ], + "score": 1.0, + "content": "idea towards proving the theorem is to derive a “partial evaluation” — the following lemmas shows", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 623, + 506, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 176, + 639 + ], + "score": 1.0, + "content": "that we can write", + "type": "text" + }, + { + "bbox": [ + 177, + 624, + 208, + 637 + ], + "score": 0.93, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 623, + 266, + 639 + ], + "score": 1.0, + "content": "in the form of", + "type": "text" + }, + { + "bbox": [ + 267, + 625, + 343, + 637 + ], + "score": 0.93, + "content": "\\mathbb { E } [ g ( \\gamma , \\sigma , n , d , \\beta ^ { * } ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 623, + 370, + 639 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 371, + 624, + 402, + 637 + ], + "score": 0.92, + "content": "\\gamma \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 623, + 506, + 639 + ], + "score": 1.0, + "content": "contains the singular val-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 635, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 133, + 649 + ], + "score": 1.0, + "content": "ues of", + "type": "text" + }, + { + "bbox": [ + 133, + 637, + 143, + 646 + ], + "score": 0.8, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 635, + 505, + 649 + ], + "score": 1.0, + "content": ". We will then couple the randomness of data matrices obtained by adding a single sample,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 646, + 375, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 375, + 660 + ], + "score": 1.0, + "content": "and use singular value interlacing to compare their singular values.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 108, + 662, + 504, + 696 + ], + "lines": [ + { + "bbox": [ + 105, + 661, + 506, + 675 + ], + "spans": [ + { + "bbox": [ + 105, + 661, + 263, + 675 + ], + "score": 1.0, + "content": "Lemma 1. In the setting of Theorem", + "type": "text" + }, + { + "bbox": [ + 263, + 663, + 269, + 672 + ], + "score": 0.58, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 661, + 288, + 675 + ], + "score": 1.0, + "content": ", let", + "type": "text" + }, + { + "bbox": [ + 288, + 662, + 361, + 674 + ], + "score": 0.9, + "content": "\\gamma = ( \\gamma _ { 1 } , \\ldots , \\gamma _ { d } )", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 661, + 506, + 675 + ], + "score": 1.0, + "content": "be the singular values of the data", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 104, + 671, + 506, + 687 + ], + "spans": [ + { + "bbox": [ + 104, + 671, + 135, + 687 + ], + "score": 1.0, + "content": "matrix", + "type": "text" + }, + { + "bbox": [ + 135, + 673, + 181, + 684 + ], + "score": 0.9, + "content": "\\ b { X } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 671, + 198, + 687 + ], + "score": 1.0, + "content": ". (If", + "type": "text" + }, + { + "bbox": [ + 199, + 674, + 225, + 685 + ], + "score": 0.53, + "content": "n < d", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 671, + 275, + 687 + ], + "score": 1.0, + "content": ", we pad the", + "type": "text" + }, + { + "bbox": [ + 275, + 674, + 304, + 685 + ], + "score": 0.88, + "content": "\\gamma _ { i } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 671, + 319, + 687 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 320, + 675, + 345, + 684 + ], + "score": 0.82, + "content": "i > n .", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 671, + 367, + 687 + ], + "score": 1.0, + "content": ".) Let", + "type": "text" + }, + { + "bbox": [ + 367, + 674, + 380, + 684 + ], + "score": 0.87, + "content": "\\Gamma _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 671, + 468, + 687 + ], + "score": 1.0, + "content": "be the distribution of", + "type": "text" + }, + { + "bbox": [ + 469, + 675, + 475, + 685 + ], + "score": 0.73, + "content": "\\gamma .", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 671, + 506, + 687 + ], + "score": 1.0, + "content": ". Then,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 684, + 202, + 696 + ], + "spans": [ + { + "bbox": [ + 106, + 684, + 202, + 696 + ], + "score": 1.0, + "content": "the expected test risk is", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42 + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 701, + 422, + 736 + ], + "lines": [ + { + "bbox": [ + 189, + 701, + 422, + 736 + ], + "spans": [ + { + "bbox": [ + 189, + 701, + 422, + 736 + ], + "score": 0.95, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\operatorname * { \\mathbb { E } } _ { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma _ { n } } \\left[ \\sum _ { i = 1 } ^ { d } \\frac { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } / d + \\sigma ^ { 2 } \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } \\right] + \\sigma ^ { 2 }", + "type": "interline_equation", + "image_path": "b40dba43a33ce50127dbb819e04e578cfe43a13d87ee3e1ab4cc4770fe468e0d.jpg" + } + ] + } + ], + "index": 44.5, + "virtual_lines": [ + { + "bbox": [ + 189, + 701, + 422, + 718.5 + ], + "spans": [], + "index": 44 + }, + { + "bbox": [ + 189, + 718.5, + 422, + 736.0 + ], + "spans": [], + "index": 45 + } + ] + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 292, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 12, + "width": 8 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 138 + ], + "lines": [], + "index": 2, + "bbox_fs": [ + 105, + 82, + 506, + 140 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 107, + 154, + 380, + 167 + ], + "lines": [ + { + "bbox": [ + 105, + 153, + 382, + 169 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 382, + 169 + ], + "score": 1.0, + "content": "2 SAMPLE MONOTONICITY IN RIDGE RIDGRESSION", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 179, + 505, + 225 + ], + "lines": [ + { + "bbox": [ + 105, + 180, + 506, + 193 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 506, + 193 + ], + "score": 1.0, + "content": "In this section, we prove that optimally-regularized ridge regression has test risk that is monotonic", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 191, + 505, + 203 + ], + "spans": [ + { + "bbox": [ + 105, + 191, + 505, + 203 + ], + "score": 1.0, + "content": "in samples, for isotropic gaussian covariates and linear response. This confirms the behavior empir-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 202, + 505, + 214 + ], + "spans": [ + { + "bbox": [ + 105, + 202, + 505, + 214 + ], + "score": 1.0, + "content": "ically observed in Figure 1. We also show that this monotonicity is not “fragile”, and using larger", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 213, + 420, + 225 + ], + "spans": [ + { + "bbox": [ + 106, + 213, + 420, + 225 + ], + "score": 1.0, + "content": "than larger regularization is still sample-monotonic (consistent with Figure 1).", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 180, + 506, + 225 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 229, + 505, + 323 + ], + "lines": [ + { + "bbox": [ + 106, + 230, + 505, + 242 + ], + "spans": [ + { + "bbox": [ + 106, + 230, + 366, + 242 + ], + "score": 1.0, + "content": "Formally, we consider the following linear regression problem in", + "type": "text" + }, + { + "bbox": [ + 367, + 231, + 374, + 240 + ], + "score": 0.77, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 230, + 505, + 242 + ], + "score": 1.0, + "content": "dimensions. The input/covariate", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 240, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 107, + 241, + 138, + 251 + ], + "score": 0.9, + "content": "x \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 139, + 240, + 213, + 254 + ], + "score": 1.0, + "content": "is generated from", + "type": "text" + }, + { + "bbox": [ + 214, + 241, + 250, + 253 + ], + "score": 0.92, + "content": "\\mathcal { N } ( 0 , I _ { d } )", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 240, + 416, + 254 + ], + "score": 1.0, + "content": ", and the output/response is generated by", + "type": "text" + }, + { + "bbox": [ + 417, + 241, + 483, + 253 + ], + "score": 0.93, + "content": "y = \\langle x , \\beta ^ { * } \\rangle + \\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 240, + 505, + 254 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 249, + 506, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 252, + 163, + 264 + ], + "score": 0.92, + "content": "\\varepsilon \\sim \\mathcal { N } ( 0 , \\bar { \\sigma } ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 249, + 285, + 266 + ], + "score": 1.0, + "content": "for some unknown parameter", + "type": "text" + }, + { + "bbox": [ + 286, + 252, + 321, + 263 + ], + "score": 0.9, + "content": "\\beta ^ { * } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 249, + 467, + 266 + ], + "score": 1.0, + "content": ". We denote the joint distribution of", + "type": "text" + }, + { + "bbox": [ + 468, + 253, + 491, + 264 + ], + "score": 0.9, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 249, + 506, + 266 + ], + "score": 1.0, + "content": "by", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 107, + 262, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 107, + 264, + 115, + 273 + ], + "score": 0.74, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 262, + 176, + 277 + ], + "score": 1.0, + "content": ". We are given", + "type": "text" + }, + { + "bbox": [ + 176, + 266, + 183, + 273 + ], + "score": 0.76, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 262, + 259, + 277 + ], + "score": 1.0, + "content": "training examples", + "type": "text" + }, + { + "bbox": [ + 260, + 263, + 313, + 275 + ], + "score": 0.91, + "content": "\\{ ( x _ { i } , y _ { i } ) \\} _ { i = 1 } ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 262, + 391, + 277 + ], + "score": 1.0, + "content": "i.i.d sampled from", + "type": "text" + }, + { + "bbox": [ + 392, + 264, + 400, + 273 + ], + "score": 0.8, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 262, + 506, + 277 + ], + "score": 1.0, + "content": ". We aim to learn a linear", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 273, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 104, + 273, + 134, + 288 + ], + "score": 1.0, + "content": "model", + "type": "text" + }, + { + "bbox": [ + 134, + 274, + 196, + 286 + ], + "score": 0.93, + "content": "f _ { \\beta } ( x ) = \\langle x , \\beta \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 273, + 305, + 288 + ], + "score": 1.0, + "content": "with small population risk", + "type": "text" + }, + { + "bbox": [ + 306, + 274, + 440, + 287 + ], + "score": 0.9, + "content": "\\bar { R } ( \\beta ) : = \\mathbb { E } _ { ( x , y ) \\sim \\mathcal { D } } [ ( \\langle x , \\beta \\rangle - y ) ^ { 2 } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 273, + 506, + 288 + ], + "score": 1.0, + "content": ". For simplicity,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 284, + 506, + 301 + ], + "spans": [ + { + "bbox": [ + 104, + 284, + 119, + 301 + ], + "score": 1.0, + "content": "let", + "type": "text" + }, + { + "bbox": [ + 119, + 287, + 166, + 297 + ], + "score": 0.91, + "content": "\\ b { X } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 284, + 296, + 301 + ], + "score": 1.0, + "content": "be the data matrix that contains", + "type": "text" + }, + { + "bbox": [ + 297, + 287, + 310, + 299 + ], + "score": 0.9, + "content": "x _ { i } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 284, + 381, + 301 + ], + "score": 1.0, + "content": "’s as rows and let", + "type": "text" + }, + { + "bbox": [ + 381, + 288, + 413, + 299 + ], + "score": 0.9, + "content": "\\vec { y } \\in \\mathbb R ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 284, + 506, + 301 + ], + "score": 1.0, + "content": "be column vector that", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 298, + 505, + 313 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 198, + 313 + ], + "score": 1.0, + "content": "contains the responses", + "type": "text" + }, + { + "bbox": [ + 198, + 302, + 207, + 312 + ], + "score": 0.81, + "content": "y _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 300, + 330, + 313 + ], + "score": 1.0, + "content": "’s as entries. For any estimator", + "type": "text" + }, + { + "bbox": [ + 330, + 298, + 368, + 312 + ], + "score": 0.94, + "content": "\\hat { \\beta } _ { n } ( X , \\vec { y } )", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 300, + 433, + 313 + ], + "score": 1.0, + "content": "as a function of", + "type": "text" + }, + { + "bbox": [ + 433, + 303, + 440, + 310 + ], + "score": 0.74, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 300, + 505, + 313 + ], + "score": 1.0, + "content": "samples, define", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 311, + 255, + 323 + ], + "spans": [ + { + "bbox": [ + 106, + 311, + 255, + 323 + ], + "score": 1.0, + "content": "the expected risk of the estimator as:", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 13.5, + "bbox_fs": [ + 104, + 230, + 506, + 323 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 239, + 328, + 372, + 350 + ], + "lines": [ + { + "bbox": [ + 239, + 328, + 372, + 350 + ], + "spans": [ + { + "bbox": [ + 239, + 328, + 372, + 350 + ], + "score": 0.94, + "content": "{ \\overline { { R } } } ( { \\hat { \\beta } } _ { n } ) : = \\operatorname * { \\mathbb { E } } _ { X , y \\sim { \\mathcal { D } } ^ { n } } [ R ( { \\hat { \\beta } } _ { n } ( X , { \\vec { y } } ) ) ]", + "type": "interline_equation", + "image_path": "ca8f1f38d0fbad23b37af04d06db0fdee27ea648b14d9cc7188acd0d5ba2d5d0.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 239, + 328, + 372, + 350 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 356, + 506, + 378 + ], + "lines": [ + { + "bbox": [ + 106, + 354, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 106, + 354, + 505, + 369 + ], + "score": 1.0, + "content": "We consider the regularized least-squares estimator, also known as the ridge regression estimator.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 366, + 210, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 366, + 154, + 379 + ], + "score": 1.0, + "content": "For a given", + "type": "text" + }, + { + "bbox": [ + 154, + 367, + 179, + 377 + ], + "score": 0.9, + "content": "\\lambda > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 366, + 210, + 379 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 106, + 354, + 505, + 379 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 175, + 384, + 437, + 407 + ], + "lines": [ + { + "bbox": [ + 175, + 384, + 437, + 407 + ], + "spans": [ + { + "bbox": [ + 175, + 384, + 437, + 407 + ], + "score": 0.93, + "content": "\\hat { \\beta } _ { n , \\lambda } : = \\underset { \\beta } { \\operatorname { a r g m i n } } | | X \\beta - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda | | \\beta | | _ { 2 } ^ { 2 } = ( X ^ { T } X + \\lambda I _ { d } ) ^ { - 1 } X ^ { T } \\vec { y }", + "type": "interline_equation", + "image_path": "d1e09e8985a269d77fd3cb37a62099e25386d5abe73ff5141e77c5f63a87f69b.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 175, + 384, + 437, + 407 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 413, + 506, + 479 + ], + "lines": [ + { + "bbox": [ + 104, + 411, + 507, + 428 + ], + "spans": [ + { + "bbox": [ + 104, + 411, + 129, + 428 + ], + "score": 1.0, + "content": "Here", + "type": "text" + }, + { + "bbox": [ + 129, + 415, + 140, + 426 + ], + "score": 0.87, + "content": "I _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 411, + 191, + 428 + ], + "score": 1.0, + "content": "denotes the", + "type": "text" + }, + { + "bbox": [ + 191, + 415, + 198, + 425 + ], + "score": 0.78, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 411, + 336, + 428 + ], + "score": 1.0, + "content": "dimensional identity matrix. Let", + "type": "text" + }, + { + "bbox": [ + 336, + 414, + 353, + 425 + ], + "score": 0.9, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 411, + 507, + 428 + ], + "score": 1.0, + "content": "be the optimal ridge parameter (that", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 102, + 423, + 504, + 443 + ], + "spans": [ + { + "bbox": [ + 102, + 423, + 286, + 443 + ], + "score": 1.0, + "content": "achieves the minimum expected risk) given", + "type": "text" + }, + { + "bbox": [ + 287, + 430, + 294, + 438 + ], + "score": 0.73, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 423, + 335, + 443 + ], + "score": 1.0, + "content": "samples:", + "type": "text" + }, + { + "bbox": [ + 336, + 426, + 462, + 441 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\lambda _ { n } ^ { \\mathrm { o p t } } : = \\operatorname * { a r g m i n } _ { \\lambda : \\lambda \\geq 0 } \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 423, + 487, + 443 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 487, + 426, + 504, + 439 + ], + "score": 0.9, + "content": "\\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } }", + "type": "inline_equation" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 437, + 506, + 456 + ], + "spans": [ + { + "bbox": [ + 104, + 437, + 271, + 456 + ], + "score": 1.0, + "content": "be the estimator that corresponds to the", + "type": "text" + }, + { + "bbox": [ + 271, + 441, + 288, + 453 + ], + "score": 0.9, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 437, + 328, + 456 + ], + "score": 1.0, + "content": ". That is,", + "type": "text" + }, + { + "bbox": [ + 329, + 441, + 501, + 455 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } : = \\operatorname * { a r g m i n } _ { \\beta } | | X \\beta - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda _ { n } ^ { \\mathrm { o p t } } | | \\beta | | _ { 2 } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 437, + 506, + 456 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 452, + 504, + 471 + ], + "spans": [ + { + "bbox": [ + 104, + 452, + 366, + 471 + ], + "score": 1.0, + "content": "Our main theorem in this section shows that the expected risk of", + "type": "text" + }, + { + "bbox": [ + 367, + 455, + 383, + 468 + ], + "score": 0.91, + "content": "\\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 452, + 496, + 471 + ], + "score": 1.0, + "content": "monotonically decreases as", + "type": "text" + }, + { + "bbox": [ + 497, + 459, + 504, + 466 + ], + "score": 0.74, + "content": "n", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 467, + 148, + 478 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 148, + 478 + ], + "score": 1.0, + "content": "increases.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24, + "bbox_fs": [ + 102, + 411, + 507, + 478 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 482, + 505, + 515 + ], + "lines": [ + { + "bbox": [ + 105, + 481, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 481, + 506, + 495 + ], + "score": 1.0, + "content": "Theorem 1. In the setting above, the expected test risk of optimally-regularized well-specified", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 492, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 383, + 505 + ], + "score": 1.0, + "content": "isotropic linear regression is monotonic in samples. That is, for all", + "type": "text" + }, + { + "bbox": [ + 383, + 493, + 421, + 505 + ], + "score": 0.92, + "content": "\\beta ^ { * } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 492, + 455, + 505 + ], + "score": 1.0, + "content": "and all", + "type": "text" + }, + { + "bbox": [ + 455, + 493, + 505, + 505 + ], + "score": 0.9, + "content": "d \\in \\mathbb { N } , n \\in", + "type": "inline_equation" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 503, + 147, + 516 + ], + "spans": [ + { + "bbox": [ + 106, + 504, + 144, + 515 + ], + "score": 0.91, + "content": "\\mathbb { N } , \\sigma > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 503, + 147, + 516 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 481, + 506, + 516 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 264, + 514, + 347, + 531 + ], + "lines": [ + { + "bbox": [ + 264, + 514, + 347, + 531 + ], + "spans": [ + { + "bbox": [ + 264, + 514, + 347, + 531 + ], + "score": 0.91, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n + 1 } ^ { \\mathrm { o p t } } ) \\leq \\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } )", + "type": "interline_equation", + "image_path": "02c89e1530f055b86ccd8d1b6fb13f02720f9d0d99c45df164c8d8dfcd675713.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 264, + 514, + 347, + 531 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 538, + 505, + 583 + ], + "lines": [ + { + "bbox": [ + 105, + 537, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 537, + 505, + 551 + ], + "score": 1.0, + "content": "The above theorem shows a strong form of monotonicity, since it holds for every fixed ground-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 128, + 563 + ], + "score": 1.0, + "content": "truth", + "type": "text" + }, + { + "bbox": [ + 128, + 550, + 140, + 561 + ], + "score": 0.88, + "content": "\\beta ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 550, + 505, + 563 + ], + "score": 1.0, + "content": ", and does not require averaging over any prior on ground-truths. Moreover, it holds non-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 561, + 506, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 231, + 573 + ], + "score": 1.0, + "content": "asymptotically, for every fixed", + "type": "text" + }, + { + "bbox": [ + 231, + 561, + 268, + 572 + ], + "score": 0.91, + "content": "n , d \\in \\mathbb { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 561, + 506, + 573 + ], + "score": 1.0, + "content": ". Obtaining such non-asymptotic results is nontrivial, since", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 572, + 415, + 584 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 415, + 584 + ], + "score": 1.0, + "content": "we cannot rely on concentration properties of the involved random variables.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 537, + 506, + 584 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 589, + 505, + 659 + ], + "lines": [ + { + "bbox": [ + 105, + 588, + 506, + 604 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 204, + 604 + ], + "score": 1.0, + "content": "In particular, evaluating", + "type": "text" + }, + { + "bbox": [ + 204, + 589, + 236, + 603 + ], + "score": 0.93, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 588, + 398, + 604 + ], + "score": 1.0, + "content": "as a function of the problem parameters", + "type": "text" + }, + { + "bbox": [ + 399, + 591, + 433, + 602 + ], + "score": 0.92, + "content": "( n , \\sigma , \\beta ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 588, + 455, + 604 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 455, + 591, + 461, + 601 + ], + "score": 0.65, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 588, + 506, + 604 + ], + "score": 1.0, + "content": ") is techni-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 601, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 106, + 601, + 505, + 614 + ], + "score": 1.0, + "content": "cally challenging. In fact, we suspect that a simple closed form expression does not exist. The key", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 612, + 505, + 625 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 505, + 625 + ], + "score": 1.0, + "content": "idea towards proving the theorem is to derive a “partial evaluation” — the following lemmas shows", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 623, + 506, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 176, + 639 + ], + "score": 1.0, + "content": "that we can write", + "type": "text" + }, + { + "bbox": [ + 177, + 624, + 208, + 637 + ], + "score": 0.93, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 623, + 266, + 639 + ], + "score": 1.0, + "content": "in the form of", + "type": "text" + }, + { + "bbox": [ + 267, + 625, + 343, + 637 + ], + "score": 0.93, + "content": "\\mathbb { E } [ g ( \\gamma , \\sigma , n , d , \\beta ^ { * } ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 623, + 370, + 639 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 371, + 624, + 402, + 637 + ], + "score": 0.92, + "content": "\\gamma \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 623, + 506, + 639 + ], + "score": 1.0, + "content": "contains the singular val-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 635, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 133, + 649 + ], + "score": 1.0, + "content": "ues of", + "type": "text" + }, + { + "bbox": [ + 133, + 637, + 143, + 646 + ], + "score": 0.8, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 635, + 505, + 649 + ], + "score": 1.0, + "content": ". We will then couple the randomness of data matrices obtained by adding a single sample,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 646, + 375, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 375, + 660 + ], + "score": 1.0, + "content": "and use singular value interlacing to compare their singular values.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 588, + 506, + 660 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 662, + 504, + 696 + ], + "lines": [ + { + "bbox": [ + 105, + 661, + 506, + 675 + ], + "spans": [ + { + "bbox": [ + 105, + 661, + 263, + 675 + ], + "score": 1.0, + "content": "Lemma 1. In the setting of Theorem", + "type": "text" + }, + { + "bbox": [ + 263, + 663, + 269, + 672 + ], + "score": 0.58, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 661, + 288, + 675 + ], + "score": 1.0, + "content": ", let", + "type": "text" + }, + { + "bbox": [ + 288, + 662, + 361, + 674 + ], + "score": 0.9, + "content": "\\gamma = ( \\gamma _ { 1 } , \\ldots , \\gamma _ { d } )", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 661, + 506, + 675 + ], + "score": 1.0, + "content": "be the singular values of the data", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 104, + 671, + 506, + 687 + ], + "spans": [ + { + "bbox": [ + 104, + 671, + 135, + 687 + ], + "score": 1.0, + "content": "matrix", + "type": "text" + }, + { + "bbox": [ + 135, + 673, + 181, + 684 + ], + "score": 0.9, + "content": "\\ b { X } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 671, + 198, + 687 + ], + "score": 1.0, + "content": ". (If", + "type": "text" + }, + { + "bbox": [ + 199, + 674, + 225, + 685 + ], + "score": 0.53, + "content": "n < d", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 671, + 275, + 687 + ], + "score": 1.0, + "content": ", we pad the", + "type": "text" + }, + { + "bbox": [ + 275, + 674, + 304, + 685 + ], + "score": 0.88, + "content": "\\gamma _ { i } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 671, + 319, + 687 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 320, + 675, + 345, + 684 + ], + "score": 0.82, + "content": "i > n .", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 671, + 367, + 687 + ], + "score": 1.0, + "content": ".) Let", + "type": "text" + }, + { + "bbox": [ + 367, + 674, + 380, + 684 + ], + "score": 0.87, + "content": "\\Gamma _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 671, + 468, + 687 + ], + "score": 1.0, + "content": "be the distribution of", + "type": "text" + }, + { + "bbox": [ + 469, + 675, + 475, + 685 + ], + "score": 0.73, + "content": "\\gamma .", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 671, + 506, + 687 + ], + "score": 1.0, + "content": ". Then,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 684, + 202, + 696 + ], + "spans": [ + { + "bbox": [ + 106, + 684, + 202, + 696 + ], + "score": 1.0, + "content": "the expected test risk is", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42, + "bbox_fs": [ + 104, + 661, + 506, + 696 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 701, + 422, + 736 + ], + "lines": [ + { + "bbox": [ + 189, + 701, + 422, + 736 + ], + "spans": [ + { + "bbox": [ + 189, + 701, + 422, + 736 + ], + "score": 0.95, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\operatorname * { \\mathbb { E } } _ { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma _ { n } } \\left[ \\sum _ { i = 1 } ^ { d } \\frac { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } / d + \\sigma ^ { 2 } \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } \\right] + \\sigma ^ { 2 }", + "type": "interline_equation", + "image_path": "b40dba43a33ce50127dbb819e04e578cfe43a13d87ee3e1ab4cc4770fe468e0d.jpg" + } + ] + } + ], + "index": 44.5, + "virtual_lines": [ + { + "bbox": [ + 189, + 701, + 422, + 718.5 + ], + "spans": [], + "index": 44 + }, + { + "bbox": [ + 189, + 718.5, + 422, + 736.0 + ], + "spans": [], + "index": 45 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 104, + 82, + 481, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 481, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 470, + 95 + ], + "score": 1.0, + "content": "From Lemma 1, the below lemma follows directly by taking derivatives to find the optimal", + "type": "text" + }, + { + "bbox": [ + 470, + 83, + 477, + 92 + ], + "score": 0.77, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 81, + 481, + 95 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 105, + 97, + 506, + 127 + ], + "lines": [ + { + "bbox": [ + 103, + 96, + 505, + 113 + ], + "spans": [ + { + "bbox": [ + 103, + 96, + 462, + 113 + ], + "score": 1.0, + "content": "Lemma 2. In the setting of Theorem 1, the optimal ridge parameter is constant for all", + "type": "text" + }, + { + "bbox": [ + 462, + 100, + 469, + 108 + ], + "score": 0.63, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 96, + 475, + 113 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 476, + 97, + 505, + 110 + ], + "score": 0.85, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } } =", + "type": "inline_equation" + } + ], + "index": 1 + }, + { + "bbox": [ + 107, + 108, + 369, + 130 + ], + "spans": [ + { + "bbox": [ + 107, + 109, + 132, + 127 + ], + "score": 0.92, + "content": "\\frac { d \\sigma ^ { 2 } } { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 108, + 369, + 130 + ], + "score": 1.0, + "content": ". Moreover, the optimal expected test risk can be written as", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5 + }, + { + "type": "interline_equation", + "bbox": [ + 196, + 131, + 415, + 166 + ], + "lines": [ + { + "bbox": [ + 196, + 131, + 415, + 166 + ], + "spans": [ + { + "bbox": [ + 196, + 131, + 415, + 166 + ], + "score": 0.94, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } ) = \\operatorname * { l } _ { ( \\gamma _ { 1 } , \\ldots \\gamma _ { d } ) \\sim \\Gamma _ { n } } \\left[ \\sum _ { i = 1 } ^ { d } \\frac { \\sigma ^ { 2 } } { \\gamma _ { i } ^ { 2 } + d \\sigma ^ { 2 } / | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } \\right] + \\sigma ^ { 2 }", + "type": "interline_equation", + "image_path": "e5430d69b46fe619155e1f8482e9e60dbcbbee1ff0353cd69134b248c0fec2e1.jpg" + } + ] + } + ], + "index": 3.5, + "virtual_lines": [ + { + "bbox": [ + 196, + 131, + 415, + 148.5 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 196, + 148.5, + 415, + 166.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 174, + 505, + 197 + ], + "lines": [ + { + "bbox": [ + 105, + 173, + 505, + 188 + ], + "spans": [ + { + "bbox": [ + 105, + 173, + 505, + 188 + ], + "score": 1.0, + "content": "Proofs of Lemma 1 and 2 are deferred to the Appendix, Section A.1. Now we are ready to prove", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 185, + 156, + 197 + ], + "spans": [ + { + "bbox": [ + 106, + 185, + 156, + 197 + ], + "score": 1.0, + "content": "Theorem 1.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 106, + 207, + 505, + 261 + ], + "lines": [ + { + "bbox": [ + 104, + 205, + 506, + 224 + ], + "spans": [ + { + "bbox": [ + 104, + 205, + 179, + 224 + ], + "score": 1.0, + "content": "Proof of Theorem", + "type": "text" + }, + { + "bbox": [ + 179, + 210, + 185, + 219 + ], + "score": 0.33, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 205, + 208, + 224 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 209, + 207, + 276, + 220 + ], + "score": 0.92, + "content": "\\widetilde { X } \\ \\in \\ \\mathbb { R } ^ { ( n + 1 ) \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 205, + 297, + 224 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 297, + 209, + 348, + 220 + ], + "score": 0.91, + "content": "\\boldsymbol { X } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 205, + 506, + 224 + ], + "score": 1.0, + "content": "be any two matrices which differ by", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 220, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 190, + 234 + ], + "score": 1.0, + "content": "only the last row of", + "type": "text" + }, + { + "bbox": [ + 190, + 220, + 200, + 232 + ], + "score": 0.86, + "content": "\\widetilde { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 221, + 505, + 234 + ], + "score": 1.0, + "content": ". By the Cauchy interlacing theorem Theorem 4.3.4 of Horn et al. (1990)", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 233, + 506, + 247 + ], + "spans": [ + { + "bbox": [ + 105, + 234, + 376, + 247 + ], + "score": 1.0, + "content": "(c.f.,Lemma 3.4 of Marcus et al. (2014)), the singular values of", + "type": "text" + }, + { + "bbox": [ + 376, + 235, + 387, + 245 + ], + "score": 0.83, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 234, + 407, + 247 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 407, + 233, + 417, + 245 + ], + "score": 0.88, + "content": "\\widetilde { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 234, + 485, + 247 + ], + "score": 1.0, + "content": "are interlaced:", + "type": "text" + }, + { + "bbox": [ + 486, + 235, + 497, + 245 + ], + "score": 0.54, + "content": "\\forall i", + "type": "inline_equation" + }, + { + "bbox": [ + 497, + 234, + 506, + 247 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 246, + 372, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 246, + 220, + 261 + ], + "score": 0.92, + "content": "\\gamma _ { i - 1 } ( X ) \\geq \\gamma _ { i } ( { \\widetilde { X } } ) \\geq \\gamma _ { i } ( X )", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 247, + 248, + 261 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 248, + 248, + 268, + 260 + ], + "score": 0.91, + "content": "\\gamma _ { i } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 247, + 293, + 261 + ], + "score": 1.0, + "content": "is the", + "type": "text" + }, + { + "bbox": [ + 294, + 249, + 298, + 258 + ], + "score": 0.74, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 247, + 372, + 261 + ], + "score": 1.0, + "content": "-th singular value.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 107, + 266, + 505, + 312 + ], + "lines": [ + { + "bbox": [ + 105, + 265, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 160, + 280 + ], + "score": 1.0, + "content": "If we couple", + "type": "text" + }, + { + "bbox": [ + 160, + 265, + 171, + 277 + ], + "score": 0.86, + "content": "\\widetilde { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 266, + 189, + 280 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 190, + 267, + 200, + 277 + ], + "score": 0.82, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 266, + 305, + 280 + ], + "score": 1.0, + "content": ", it will induce a coupling", + "type": "text" + }, + { + "bbox": [ + 306, + 267, + 315, + 277 + ], + "score": 0.62, + "content": "\\Pi", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 266, + 420, + 280 + ], + "score": 1.0, + "content": "between the distributions", + "type": "text" + }, + { + "bbox": [ + 420, + 268, + 443, + 279 + ], + "score": 0.91, + "content": "\\Gamma _ { n + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 266, + 461, + 280 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 462, + 268, + 474, + 278 + ], + "score": 0.86, + "content": "\\Gamma _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 266, + 505, + 280 + ], + "score": 1.0, + "content": ", of the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 277, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 255, + 290 + ], + "score": 1.0, + "content": "singular values of the data matrix for", + "type": "text" + }, + { + "bbox": [ + 255, + 279, + 279, + 289 + ], + "score": 0.9, + "content": "n + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 277, + 297, + 290 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 298, + 280, + 305, + 288 + ], + "score": 0.78, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 277, + 452, + 290 + ], + "score": 1.0, + "content": "samples. This coupling satisfies that", + "type": "text" + }, + { + "bbox": [ + 452, + 279, + 483, + 289 + ], + "score": 0.92, + "content": "\\widetilde { \\gamma } _ { i } \\geq \\gamma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 277, + 505, + 290 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 288, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 174, + 302 + ], + "score": 1.0, + "content": "probability 1 for", + "type": "text" + }, + { + "bbox": [ + 174, + 289, + 245, + 301 + ], + "score": 0.91, + "content": "( \\{ \\widetilde { \\gamma } _ { i } \\} , \\{ \\gamma _ { i } \\} ) \\sim \\Pi", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 288, + 505, + 302 + ], + "score": 1.0, + "content": "e. Now, expand the test risk using Lemma 2, and observe that each", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 300, + 417, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 378, + 312 + ], + "score": 1.0, + "content": "eterm in the sum of Equation (4) below is monotone decreasing with", + "type": "text" + }, + { + "bbox": [ + 378, + 301, + 387, + 312 + ], + "score": 0.85, + "content": "\\gamma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 388, + 300, + 417, + 312 + ], + "score": 1.0, + "content": ". Thus:", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5 + }, + { + "type": "interline_equation", + "bbox": [ + 191, + 315, + 419, + 403 + ], + "lines": [ + { + "bbox": [ + 191, + 315, + 419, + 403 + ], + "spans": [ + { + "bbox": [ + 191, + 315, + 419, + 403 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } ) = \\underset { ( \\gamma _ { 1 } , \\ldots , \\gamma _ { d } ) \\sim \\Gamma _ { n } } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } \\frac { \\sigma ^ { 2 } } { \\gamma _ { i } ^ { 2 } + d \\sigma ^ { 2 } / | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } \\right] + \\sigma ^ { 2 } } \\\\ & { \\qquad \\quad \\overset { \\mathbb { E } } { \\ge } \\underset { ( \\widetilde { \\gamma } _ { 1 } , \\ldots , \\widetilde { \\gamma } _ { d } ) \\sim \\Gamma _ { n + 1 } } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } \\frac { \\sigma ^ { 2 } } { \\widetilde { \\gamma } _ { i } ^ { 2 } + d \\sigma ^ { 2 } / | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } \\right] + \\sigma ^ { 2 } } \\\\ & { \\qquad = \\overline { { R } } ( \\hat { \\beta } _ { n + 1 } ^ { \\mathrm { o p t } } ) } \\end{array}", + "type": "interline_equation", + "image_path": "394fb265e7acb3aca9e90fbd87720cebac655f2a76eaa31a335aed3b7bf29338.jpg" + } + ] + } + ], + "index": 17.5, + "virtual_lines": [ + { + "bbox": [ + 191, + 315, + 419, + 329.6666666666667 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 191, + 329.6666666666667, + 419, + 344.33333333333337 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 191, + 344.33333333333337, + 419, + 359.00000000000006 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 191, + 359.00000000000006, + 419, + 373.66666666666674 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 191, + 373.66666666666674, + 419, + 388.3333333333334 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 191, + 388.3333333333334, + 419, + 403.0000000000001 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 429, + 505, + 462 + ], + "lines": [ + { + "bbox": [ + 105, + 428, + 504, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 496, + 442 + ], + "score": 1.0, + "content": "By similar techniques, we can also prove that overregularization —that is, using ridge parameters", + "type": "text" + }, + { + "bbox": [ + 497, + 430, + 504, + 439 + ], + "score": 0.75, + "content": "\\lambda", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 440, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 505, + 452 + ], + "score": 1.0, + "content": "larger than the optimal value— is still monotonic. This proves the behavior empirically observed in", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 450, + 146, + 465 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 146, + 465 + ], + "score": 1.0, + "content": "Figure 1.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 106, + 465, + 505, + 488 + ], + "lines": [ + { + "bbox": [ + 106, + 465, + 505, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 465, + 294, + 478 + ], + "score": 1.0, + "content": "Theorem 2. In the same setting as Theorem", + "type": "text" + }, + { + "bbox": [ + 294, + 466, + 300, + 475 + ], + "score": 0.5, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 465, + 505, + 478 + ], + "score": 1.0, + "content": ", over-regularized regression is also monotonic in", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 476, + 410, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 476, + 204, + 489 + ], + "score": 1.0, + "content": "samples. That is, for all", + "type": "text" + }, + { + "bbox": [ + 204, + 477, + 327, + 488 + ], + "score": 0.9, + "content": "d \\in \\mathbb { N } , n \\in \\mathbb { N } , \\sigma > 0 , \\beta ^ { * } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 476, + 410, + 489 + ], + "score": 1.0, + "content": ", the following holds", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "interline_equation", + "bbox": [ + 232, + 492, + 380, + 508 + ], + "lines": [ + { + "bbox": [ + 232, + 492, + 380, + 508 + ], + "spans": [ + { + "bbox": [ + 232, + 492, + 380, + 508 + ], + "score": 0.9, + "content": "\\forall \\lambda \\geq \\lambda ^ { * } : \\quad \\overline { { { R } } } ( \\widehat { \\beta } _ { n + 1 , \\lambda } ) \\leq \\overline { { { R } } } ( \\widehat { \\beta } _ { n , \\lambda } )", + "type": "interline_equation", + "image_path": "a578df214e9bb7e84f8394d7f15346d3c032904414a25d33ee34685761e5d638.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 232, + 492, + 380, + 508 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 512, + 185, + 531 + ], + "lines": [ + { + "bbox": [ + 105, + 512, + 182, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 133, + 526 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 512, + 182, + 531 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\lambda ^ { * } = \\frac { d \\sigma ^ { 2 } } { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } } \\end{array}", + "type": "inline_equation" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 541, + 197, + 553 + ], + "lines": [ + { + "bbox": [ + 105, + 540, + 199, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 199, + 554 + ], + "score": 1.0, + "content": "Proof. In Section A.1.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "title", + "bbox": [ + 107, + 568, + 403, + 582 + ], + "lines": [ + { + "bbox": [ + 104, + 567, + 404, + 583 + ], + "spans": [ + { + "bbox": [ + 104, + 567, + 404, + 583 + ], + "score": 1.0, + "content": "3 MODEL-WISE MONOTONICITY IN RIDGE REGRESSION", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 107, + 593, + 505, + 627 + ], + "lines": [ + { + "bbox": [ + 105, + 592, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 592, + 505, + 606 + ], + "score": 1.0, + "content": "In this section, we show that for a certain family of linear models, optimal regularization prevents", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 604, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 616 + ], + "score": 1.0, + "content": "model-wise double descent. That is, for a fixed number of samples, larger models are not worse than", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 615, + 172, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 172, + 626 + ], + "score": 1.0, + "content": "smaller models.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 106, + 631, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 631, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 426, + 645 + ], + "score": 1.0, + "content": "We consider the following learning problem. Informally, covariates live in a", + "type": "text" + }, + { + "bbox": [ + 426, + 634, + 433, + 643 + ], + "score": 0.79, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 631, + 505, + 645 + ], + "score": 1.0, + "content": "-dimensional am-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 643, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 643, + 445, + 655 + ], + "score": 1.0, + "content": "bient space, and we consider models which first linearly project down to a random", + "type": "text" + }, + { + "bbox": [ + 446, + 644, + 452, + 653 + ], + "score": 0.79, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 643, + 505, + 655 + ], + "score": 1.0, + "content": "-dimensional", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 381, + 667 + ], + "score": 1.0, + "content": "subspace, then perform ridge regression in that subspace for some", + "type": "text" + }, + { + "bbox": [ + 382, + 654, + 410, + 665 + ], + "score": 0.91, + "content": "d \\leq p", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 654, + 505, + 667 + ], + "score": 1.0, + "content": ". Formally, the covari-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 664, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 122, + 678 + ], + "score": 1.0, + "content": "ate", + "type": "text" + }, + { + "bbox": [ + 122, + 665, + 157, + 675 + ], + "score": 0.91, + "content": "x \\in \\mathbb { R } ^ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 664, + 235, + 678 + ], + "score": 1.0, + "content": "is generated from", + "type": "text" + }, + { + "bbox": [ + 235, + 664, + 272, + 677 + ], + "score": 0.93, + "content": "\\bar { \\mathcal { N } } ( 0 , I _ { p } )", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 664, + 416, + 678 + ], + "score": 1.0, + "content": ", and the response is generated by", + "type": "text" + }, + { + "bbox": [ + 417, + 665, + 482, + 676 + ], + "score": 0.91, + "content": "y = \\langle x , \\theta \\rangle + \\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 664, + 506, + 678 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 675, + 506, + 692 + ], + "spans": [ + { + "bbox": [ + 107, + 676, + 168, + 689 + ], + "score": 0.92, + "content": "\\varepsilon \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 675, + 313, + 692 + ], + "score": 1.0, + "content": "and for some unknown parameter", + "type": "text" + }, + { + "bbox": [ + 313, + 677, + 348, + 687 + ], + "score": 0.91, + "content": "\\theta \\in \\mathbb { R } ^ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 675, + 382, + 692 + ], + "score": 1.0, + "content": ". Next,", + "type": "text" + }, + { + "bbox": [ + 383, + 679, + 390, + 687 + ], + "score": 0.71, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 675, + 434, + 692 + ], + "score": 1.0, + "content": "examples", + "type": "text" + }, + { + "bbox": [ + 434, + 677, + 488, + 689 + ], + "score": 0.92, + "content": "\\{ ( x _ { i } , y _ { i } ) \\} _ { i = 1 } ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 675, + 506, + 692 + ], + "score": 1.0, + "content": "are", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 352, + 700 + ], + "score": 1.0, + "content": "sampled i.i.d from this distribution. For a given model size", + "type": "text" + }, + { + "bbox": [ + 352, + 688, + 380, + 699 + ], + "score": 0.93, + "content": "d \\leq p", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 687, + 505, + 700 + ], + "score": 1.0, + "content": ", we first sample a random or-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 697, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 180, + 712 + ], + "score": 1.0, + "content": "thonormal matrix", + "type": "text" + }, + { + "bbox": [ + 180, + 698, + 225, + 709 + ], + "score": 0.92, + "content": "P \\in \\mathbb { R } ^ { d \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 697, + 505, + 712 + ], + "score": 1.0, + "content": "which specifies our model. We then consider models which operate", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 119, + 723 + ], + "score": 1.0, + "content": "on", + "type": "text" + }, + { + "bbox": [ + 120, + 709, + 195, + 722 + ], + "score": 0.92, + "content": "( \\widetilde { x } _ { i } , y _ { i } ) \\in \\mathbb { R } ^ { d } \\times \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 708, + 226, + 723 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 226, + 710, + 267, + 721 + ], + "score": 0.91, + "content": "\\widetilde { x _ { i } } = P x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 708, + 414, + 723 + ], + "score": 1.0, + "content": ". We denote the joint distribution of", + "type": "text" + }, + { + "bbox": [ + 414, + 709, + 437, + 721 + ], + "score": 0.92, + "content": "( \\widetilde { x } , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 708, + 451, + 723 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 452, + 710, + 461, + 720 + ], + "score": 0.77, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 461, + 708, + 506, + 723 + ], + "score": 1.0, + "content": ". Here, we", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 720, + 486, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 168, + 733 + ], + "score": 1.0, + "content": "eemphasize that", + "type": "text" + }, + { + "bbox": [ + 168, + 723, + 175, + 732 + ], + "score": 0.81, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 175, + 720, + 326, + 733 + ], + "score": 1.0, + "content": "eis some large ambient dimension and", + "type": "text" + }, + { + "bbox": [ + 326, + 721, + 351, + 732 + ], + "score": 0.91, + "content": "d \\leq p", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 720, + 486, + 733 + ], + "score": 1.0, + "content": "eis the size of the model we learn.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 37 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 541, + 505, + 552 + ], + "lines": [ + { + "bbox": [ + 496, + 543, + 504, + 551 + ], + "spans": [ + { + "bbox": [ + 496, + 543, + 504, + 551 + ], + "score": 0.998, + "content": "□", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 495, + 406, + 504, + 416 + ], + "lines": [ + { + "bbox": [ + 496, + 408, + 504, + 415 + ], + "spans": [ + { + "bbox": [ + 496, + 408, + 504, + 415 + ], + "score": 0.994, + "content": "□", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 104, + 82, + 481, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 481, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 470, + 95 + ], + "score": 1.0, + "content": "From Lemma 1, the below lemma follows directly by taking derivatives to find the optimal", + "type": "text" + }, + { + "bbox": [ + 470, + 83, + 477, + 92 + ], + "score": 0.77, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 81, + 481, + 95 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 81, + 481, + 95 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 97, + 506, + 127 + ], + "lines": [ + { + "bbox": [ + 103, + 96, + 505, + 113 + ], + "spans": [ + { + "bbox": [ + 103, + 96, + 462, + 113 + ], + "score": 1.0, + "content": "Lemma 2. In the setting of Theorem 1, the optimal ridge parameter is constant for all", + "type": "text" + }, + { + "bbox": [ + 462, + 100, + 469, + 108 + ], + "score": 0.63, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 96, + 475, + 113 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 476, + 97, + 505, + 110 + ], + "score": 0.85, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } } =", + "type": "inline_equation" + } + ], + "index": 1 + }, + { + "bbox": [ + 107, + 108, + 369, + 130 + ], + "spans": [ + { + "bbox": [ + 107, + 109, + 132, + 127 + ], + "score": 0.92, + "content": "\\frac { d \\sigma ^ { 2 } } { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 108, + 369, + 130 + ], + "score": 1.0, + "content": ". Moreover, the optimal expected test risk can be written as", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5, + "bbox_fs": [ + 103, + 96, + 505, + 130 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 196, + 131, + 415, + 166 + ], + "lines": [ + { + "bbox": [ + 196, + 131, + 415, + 166 + ], + "spans": [ + { + "bbox": [ + 196, + 131, + 415, + 166 + ], + "score": 0.94, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } ) = \\operatorname * { l } _ { ( \\gamma _ { 1 } , \\ldots \\gamma _ { d } ) \\sim \\Gamma _ { n } } \\left[ \\sum _ { i = 1 } ^ { d } \\frac { \\sigma ^ { 2 } } { \\gamma _ { i } ^ { 2 } + d \\sigma ^ { 2 } / | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } \\right] + \\sigma ^ { 2 }", + "type": "interline_equation", + "image_path": "e5430d69b46fe619155e1f8482e9e60dbcbbee1ff0353cd69134b248c0fec2e1.jpg" + } + ] + } + ], + "index": 3.5, + "virtual_lines": [ + { + "bbox": [ + 196, + 131, + 415, + 148.5 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 196, + 148.5, + 415, + 166.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 174, + 505, + 197 + ], + "lines": [ + { + "bbox": [ + 105, + 173, + 505, + 188 + ], + "spans": [ + { + "bbox": [ + 105, + 173, + 505, + 188 + ], + "score": 1.0, + "content": "Proofs of Lemma 1 and 2 are deferred to the Appendix, Section A.1. Now we are ready to prove", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 185, + 156, + 197 + ], + "spans": [ + { + "bbox": [ + 106, + 185, + 156, + 197 + ], + "score": 1.0, + "content": "Theorem 1.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 173, + 505, + 197 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 207, + 505, + 261 + ], + "lines": [ + { + "bbox": [ + 104, + 205, + 506, + 224 + ], + "spans": [ + { + "bbox": [ + 104, + 205, + 179, + 224 + ], + "score": 1.0, + "content": "Proof of Theorem", + "type": "text" + }, + { + "bbox": [ + 179, + 210, + 185, + 219 + ], + "score": 0.33, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 205, + 208, + 224 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 209, + 207, + 276, + 220 + ], + "score": 0.92, + "content": "\\widetilde { X } \\ \\in \\ \\mathbb { R } ^ { ( n + 1 ) \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 205, + 297, + 224 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 297, + 209, + 348, + 220 + ], + "score": 0.91, + "content": "\\boldsymbol { X } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 205, + 506, + 224 + ], + "score": 1.0, + "content": "be any two matrices which differ by", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 220, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 190, + 234 + ], + "score": 1.0, + "content": "only the last row of", + "type": "text" + }, + { + "bbox": [ + 190, + 220, + 200, + 232 + ], + "score": 0.86, + "content": "\\widetilde { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 221, + 505, + 234 + ], + "score": 1.0, + "content": ". By the Cauchy interlacing theorem Theorem 4.3.4 of Horn et al. (1990)", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 233, + 506, + 247 + ], + "spans": [ + { + "bbox": [ + 105, + 234, + 376, + 247 + ], + "score": 1.0, + "content": "(c.f.,Lemma 3.4 of Marcus et al. (2014)), the singular values of", + "type": "text" + }, + { + "bbox": [ + 376, + 235, + 387, + 245 + ], + "score": 0.83, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 234, + 407, + 247 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 407, + 233, + 417, + 245 + ], + "score": 0.88, + "content": "\\widetilde { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 234, + 485, + 247 + ], + "score": 1.0, + "content": "are interlaced:", + "type": "text" + }, + { + "bbox": [ + 486, + 235, + 497, + 245 + ], + "score": 0.54, + "content": "\\forall i", + "type": "inline_equation" + }, + { + "bbox": [ + 497, + 234, + 506, + 247 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 246, + 372, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 246, + 220, + 261 + ], + "score": 0.92, + "content": "\\gamma _ { i - 1 } ( X ) \\geq \\gamma _ { i } ( { \\widetilde { X } } ) \\geq \\gamma _ { i } ( X )", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 247, + 248, + 261 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 248, + 248, + 268, + 260 + ], + "score": 0.91, + "content": "\\gamma _ { i } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 247, + 293, + 261 + ], + "score": 1.0, + "content": "is the", + "type": "text" + }, + { + "bbox": [ + 294, + 249, + 298, + 258 + ], + "score": 0.74, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 247, + 372, + 261 + ], + "score": 1.0, + "content": "-th singular value.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8.5, + "bbox_fs": [ + 104, + 205, + 506, + 261 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 266, + 505, + 312 + ], + "lines": [ + { + "bbox": [ + 105, + 265, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 160, + 280 + ], + "score": 1.0, + "content": "If we couple", + "type": "text" + }, + { + "bbox": [ + 160, + 265, + 171, + 277 + ], + "score": 0.86, + "content": "\\widetilde { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 266, + 189, + 280 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 190, + 267, + 200, + 277 + ], + "score": 0.82, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 266, + 305, + 280 + ], + "score": 1.0, + "content": ", it will induce a coupling", + "type": "text" + }, + { + "bbox": [ + 306, + 267, + 315, + 277 + ], + "score": 0.62, + "content": "\\Pi", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 266, + 420, + 280 + ], + "score": 1.0, + "content": "between the distributions", + "type": "text" + }, + { + "bbox": [ + 420, + 268, + 443, + 279 + ], + "score": 0.91, + "content": "\\Gamma _ { n + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 266, + 461, + 280 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 462, + 268, + 474, + 278 + ], + "score": 0.86, + "content": "\\Gamma _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 266, + 505, + 280 + ], + "score": 1.0, + "content": ", of the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 277, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 255, + 290 + ], + "score": 1.0, + "content": "singular values of the data matrix for", + "type": "text" + }, + { + "bbox": [ + 255, + 279, + 279, + 289 + ], + "score": 0.9, + "content": "n + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 277, + 297, + 290 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 298, + 280, + 305, + 288 + ], + "score": 0.78, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 277, + 452, + 290 + ], + "score": 1.0, + "content": "samples. This coupling satisfies that", + "type": "text" + }, + { + "bbox": [ + 452, + 279, + 483, + 289 + ], + "score": 0.92, + "content": "\\widetilde { \\gamma } _ { i } \\geq \\gamma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 277, + 505, + 290 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 288, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 174, + 302 + ], + "score": 1.0, + "content": "probability 1 for", + "type": "text" + }, + { + "bbox": [ + 174, + 289, + 245, + 301 + ], + "score": 0.91, + "content": "( \\{ \\widetilde { \\gamma } _ { i } \\} , \\{ \\gamma _ { i } \\} ) \\sim \\Pi", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 288, + 505, + 302 + ], + "score": 1.0, + "content": "e. Now, expand the test risk using Lemma 2, and observe that each", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 300, + 417, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 378, + 312 + ], + "score": 1.0, + "content": "eterm in the sum of Equation (4) below is monotone decreasing with", + "type": "text" + }, + { + "bbox": [ + 378, + 301, + 387, + 312 + ], + "score": 0.85, + "content": "\\gamma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 388, + 300, + 417, + 312 + ], + "score": 1.0, + "content": ". Thus:", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 265, + 505, + 312 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 191, + 315, + 419, + 403 + ], + "lines": [ + { + "bbox": [ + 191, + 315, + 419, + 403 + ], + "spans": [ + { + "bbox": [ + 191, + 315, + 419, + 403 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } ) = \\underset { ( \\gamma _ { 1 } , \\ldots , \\gamma _ { d } ) \\sim \\Gamma _ { n } } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } \\frac { \\sigma ^ { 2 } } { \\gamma _ { i } ^ { 2 } + d \\sigma ^ { 2 } / | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } \\right] + \\sigma ^ { 2 } } \\\\ & { \\qquad \\quad \\overset { \\mathbb { E } } { \\ge } \\underset { ( \\widetilde { \\gamma } _ { 1 } , \\ldots , \\widetilde { \\gamma } _ { d } ) \\sim \\Gamma _ { n + 1 } } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } \\frac { \\sigma ^ { 2 } } { \\widetilde { \\gamma } _ { i } ^ { 2 } + d \\sigma ^ { 2 } / | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } \\right] + \\sigma ^ { 2 } } \\\\ & { \\qquad = \\overline { { R } } ( \\hat { \\beta } _ { n + 1 } ^ { \\mathrm { o p t } } ) } \\end{array}", + "type": "interline_equation", + "image_path": "394fb265e7acb3aca9e90fbd87720cebac655f2a76eaa31a335aed3b7bf29338.jpg" + } + ] + } + ], + "index": 17.5, + "virtual_lines": [ + { + "bbox": [ + 191, + 315, + 419, + 329.6666666666667 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 191, + 329.6666666666667, + 419, + 344.33333333333337 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 191, + 344.33333333333337, + 419, + 359.00000000000006 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 191, + 359.00000000000006, + 419, + 373.66666666666674 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 191, + 373.66666666666674, + 419, + 388.3333333333334 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 191, + 388.3333333333334, + 419, + 403.0000000000001 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 429, + 505, + 462 + ], + "lines": [ + { + "bbox": [ + 105, + 428, + 504, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 496, + 442 + ], + "score": 1.0, + "content": "By similar techniques, we can also prove that overregularization —that is, using ridge parameters", + "type": "text" + }, + { + "bbox": [ + 497, + 430, + 504, + 439 + ], + "score": 0.75, + "content": "\\lambda", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 440, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 505, + 452 + ], + "score": 1.0, + "content": "larger than the optimal value— is still monotonic. This proves the behavior empirically observed in", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 450, + 146, + 465 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 146, + 465 + ], + "score": 1.0, + "content": "Figure 1.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 428, + 505, + 465 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 465, + 505, + 488 + ], + "lines": [ + { + "bbox": [ + 106, + 465, + 505, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 465, + 294, + 478 + ], + "score": 1.0, + "content": "Theorem 2. In the same setting as Theorem", + "type": "text" + }, + { + "bbox": [ + 294, + 466, + 300, + 475 + ], + "score": 0.5, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 465, + 505, + 478 + ], + "score": 1.0, + "content": ", over-regularized regression is also monotonic in", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 476, + 410, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 476, + 204, + 489 + ], + "score": 1.0, + "content": "samples. That is, for all", + "type": "text" + }, + { + "bbox": [ + 204, + 477, + 327, + 488 + ], + "score": 0.9, + "content": "d \\in \\mathbb { N } , n \\in \\mathbb { N } , \\sigma > 0 , \\beta ^ { * } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 476, + 410, + 489 + ], + "score": 1.0, + "content": ", the following holds", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 465, + 505, + 489 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 232, + 492, + 380, + 508 + ], + "lines": [ + { + "bbox": [ + 232, + 492, + 380, + 508 + ], + "spans": [ + { + "bbox": [ + 232, + 492, + 380, + 508 + ], + "score": 0.9, + "content": "\\forall \\lambda \\geq \\lambda ^ { * } : \\quad \\overline { { { R } } } ( \\widehat { \\beta } _ { n + 1 , \\lambda } ) \\leq \\overline { { { R } } } ( \\widehat { \\beta } _ { n , \\lambda } )", + "type": "interline_equation", + "image_path": "a578df214e9bb7e84f8394d7f15346d3c032904414a25d33ee34685761e5d638.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 232, + 492, + 380, + 508 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 512, + 185, + 531 + ], + "lines": [ + { + "bbox": [ + 105, + 512, + 182, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 133, + 526 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 512, + 182, + 531 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\lambda ^ { * } = \\frac { d \\sigma ^ { 2 } } { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } } \\end{array}", + "type": "inline_equation" + } + ], + "index": 27 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 512, + 182, + 531 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 541, + 197, + 553 + ], + "lines": [ + { + "bbox": [ + 105, + 540, + 199, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 199, + 554 + ], + "score": 1.0, + "content": "Proof. In Section A.1.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 540, + 199, + 554 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 568, + 403, + 582 + ], + "lines": [ + { + "bbox": [ + 104, + 567, + 404, + 583 + ], + "spans": [ + { + "bbox": [ + 104, + 567, + 404, + 583 + ], + "score": 1.0, + "content": "3 MODEL-WISE MONOTONICITY IN RIDGE REGRESSION", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 107, + 593, + 505, + 627 + ], + "lines": [ + { + "bbox": [ + 105, + 592, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 592, + 505, + 606 + ], + "score": 1.0, + "content": "In this section, we show that for a certain family of linear models, optimal regularization prevents", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 604, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 616 + ], + "score": 1.0, + "content": "model-wise double descent. That is, for a fixed number of samples, larger models are not worse than", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 615, + 172, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 172, + 626 + ], + "score": 1.0, + "content": "smaller models.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 592, + 505, + 626 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 631, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 631, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 426, + 645 + ], + "score": 1.0, + "content": "We consider the following learning problem. Informally, covariates live in a", + "type": "text" + }, + { + "bbox": [ + 426, + 634, + 433, + 643 + ], + "score": 0.79, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 631, + 505, + 645 + ], + "score": 1.0, + "content": "-dimensional am-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 643, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 643, + 445, + 655 + ], + "score": 1.0, + "content": "bient space, and we consider models which first linearly project down to a random", + "type": "text" + }, + { + "bbox": [ + 446, + 644, + 452, + 653 + ], + "score": 0.79, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 643, + 505, + 655 + ], + "score": 1.0, + "content": "-dimensional", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 381, + 667 + ], + "score": 1.0, + "content": "subspace, then perform ridge regression in that subspace for some", + "type": "text" + }, + { + "bbox": [ + 382, + 654, + 410, + 665 + ], + "score": 0.91, + "content": "d \\leq p", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 654, + 505, + 667 + ], + "score": 1.0, + "content": ". Formally, the covari-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 664, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 122, + 678 + ], + "score": 1.0, + "content": "ate", + "type": "text" + }, + { + "bbox": [ + 122, + 665, + 157, + 675 + ], + "score": 0.91, + "content": "x \\in \\mathbb { R } ^ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 664, + 235, + 678 + ], + "score": 1.0, + "content": "is generated from", + "type": "text" + }, + { + "bbox": [ + 235, + 664, + 272, + 677 + ], + "score": 0.93, + "content": "\\bar { \\mathcal { N } } ( 0 , I _ { p } )", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 664, + 416, + 678 + ], + "score": 1.0, + "content": ", and the response is generated by", + "type": "text" + }, + { + "bbox": [ + 417, + 665, + 482, + 676 + ], + "score": 0.91, + "content": "y = \\langle x , \\theta \\rangle + \\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 664, + 506, + 678 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 675, + 506, + 692 + ], + "spans": [ + { + "bbox": [ + 107, + 676, + 168, + 689 + ], + "score": 0.92, + "content": "\\varepsilon \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 675, + 313, + 692 + ], + "score": 1.0, + "content": "and for some unknown parameter", + "type": "text" + }, + { + "bbox": [ + 313, + 677, + 348, + 687 + ], + "score": 0.91, + "content": "\\theta \\in \\mathbb { R } ^ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 675, + 382, + 692 + ], + "score": 1.0, + "content": ". Next,", + "type": "text" + }, + { + "bbox": [ + 383, + 679, + 390, + 687 + ], + "score": 0.71, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 675, + 434, + 692 + ], + "score": 1.0, + "content": "examples", + "type": "text" + }, + { + "bbox": [ + 434, + 677, + 488, + 689 + ], + "score": 0.92, + "content": "\\{ ( x _ { i } , y _ { i } ) \\} _ { i = 1 } ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 675, + 506, + 692 + ], + "score": 1.0, + "content": "are", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 352, + 700 + ], + "score": 1.0, + "content": "sampled i.i.d from this distribution. For a given model size", + "type": "text" + }, + { + "bbox": [ + 352, + 688, + 380, + 699 + ], + "score": 0.93, + "content": "d \\leq p", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 687, + 505, + 700 + ], + "score": 1.0, + "content": ", we first sample a random or-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 697, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 180, + 712 + ], + "score": 1.0, + "content": "thonormal matrix", + "type": "text" + }, + { + "bbox": [ + 180, + 698, + 225, + 709 + ], + "score": 0.92, + "content": "P \\in \\mathbb { R } ^ { d \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 697, + 505, + 712 + ], + "score": 1.0, + "content": "which specifies our model. We then consider models which operate", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 119, + 723 + ], + "score": 1.0, + "content": "on", + "type": "text" + }, + { + "bbox": [ + 120, + 709, + 195, + 722 + ], + "score": 0.92, + "content": "( \\widetilde { x } _ { i } , y _ { i } ) \\in \\mathbb { R } ^ { d } \\times \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 708, + 226, + 723 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 226, + 710, + 267, + 721 + ], + "score": 0.91, + "content": "\\widetilde { x _ { i } } = P x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 708, + 414, + 723 + ], + "score": 1.0, + "content": ". We denote the joint distribution of", + "type": "text" + }, + { + "bbox": [ + 414, + 709, + 437, + 721 + ], + "score": 0.92, + "content": "( \\widetilde { x } , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 708, + 451, + 723 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 452, + 710, + 461, + 720 + ], + "score": 0.77, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 461, + 708, + 506, + 723 + ], + "score": 1.0, + "content": ". Here, we", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 720, + 486, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 168, + 733 + ], + "score": 1.0, + "content": "eemphasize that", + "type": "text" + }, + { + "bbox": [ + 168, + 723, + 175, + 732 + ], + "score": 0.81, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 175, + 720, + 326, + 733 + ], + "score": 1.0, + "content": "eis some large ambient dimension and", + "type": "text" + }, + { + "bbox": [ + 326, + 721, + 351, + 732 + ], + "score": 0.91, + "content": "d \\leq p", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 720, + 486, + 733 + ], + "score": 1.0, + "content": "eis the size of the model we learn.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 631, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 505, + 147 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 153, + 96 + ], + "score": 1.0, + "content": "For a fixed", + "type": "text" + }, + { + "bbox": [ + 154, + 83, + 163, + 92 + ], + "score": 0.79, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 81, + 299, + 96 + ], + "score": 1.0, + "content": ", we want to learn a linear model", + "type": "text" + }, + { + "bbox": [ + 299, + 81, + 363, + 96 + ], + "score": 0.93, + "content": "f _ { \\hat { \\beta } } ( \\tilde { x } ) = \\langle \\tilde { x } , \\hat { \\beta } \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 81, + 424, + 96 + ], + "score": 1.0, + "content": "for estimating", + "type": "text" + }, + { + "bbox": [ + 424, + 85, + 431, + 94 + ], + "score": 0.75, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 81, + 505, + 96 + ], + "score": 1.0, + "content": ", with small mean", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 96, + 505, + 111 + ], + "spans": [ + { + "bbox": [ + 105, + 96, + 227, + 111 + ], + "score": 1.0, + "content": "squared error on distribution:", + "type": "text" + }, + { + "bbox": [ + 227, + 96, + 370, + 111 + ], + "score": 0.92, + "content": "R _ { P } ( \\hat { \\beta } ) : = \\mathbb { E } _ { ( \\tilde { x } , y ) \\sim \\mathcal { D } } [ ( \\langle \\tilde { x } , \\hat { \\beta } \\rangle - y ) ^ { 2 } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 96, + 392, + 111 + ], + "score": 1.0, + "content": ". For", + "type": "text" + }, + { + "bbox": [ + 392, + 99, + 400, + 108 + ], + "score": 0.76, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 96, + 436, + 111 + ], + "score": 1.0, + "content": "samples", + "type": "text" + }, + { + "bbox": [ + 437, + 97, + 466, + 110 + ], + "score": 0.92, + "content": "( x _ { i } , y _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 96, + 483, + 111 + ], + "score": 1.0, + "content": ", let", + "type": "text" + }, + { + "bbox": [ + 484, + 97, + 505, + 109 + ], + "score": 0.85, + "content": "X \\in", + "type": "inline_equation" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 109, + 506, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 111, + 131, + 122 + ], + "score": 0.89, + "content": "\\mathbb { R } ^ { n \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 109, + 213, + 125 + ], + "score": 1.0, + "content": "be the data matrix,", + "type": "text" + }, + { + "bbox": [ + 214, + 110, + 302, + 122 + ], + "score": 0.9, + "content": "\\widetilde { X } \\ = X P ^ { T } \\ \\in \\ \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 109, + 440, + 125 + ], + "score": 1.0, + "content": "be the projected data matrix and", + "type": "text" + }, + { + "bbox": [ + 441, + 112, + 475, + 124 + ], + "score": 0.92, + "content": "\\vec { y } \\in \\mathbb R ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 109, + 506, + 125 + ], + "score": 1.0, + "content": "be the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 123, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 228, + 137 + ], + "score": 1.0, + "content": "responses. For any estimator", + "type": "text" + }, + { + "bbox": [ + 228, + 123, + 262, + 137 + ], + "score": 0.93, + "content": "\\hat { \\beta } ( \\widetilde { X } , \\vec { y } )", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 123, + 505, + 137 + ], + "score": 1.0, + "content": "as a function of the observed samples, define the expected", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 135, + 203, + 148 + ], + "spans": [ + { + "bbox": [ + 105, + 135, + 203, + 148 + ], + "score": 1.0, + "content": "risk of the estimator as:", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "interline_equation", + "bbox": [ + 237, + 149, + 374, + 174 + ], + "lines": [ + { + "bbox": [ + 237, + 149, + 374, + 174 + ], + "spans": [ + { + "bbox": [ + 237, + 149, + 374, + 174 + ], + "score": 0.93, + "content": "\\overline { { R } } ( \\hat { \\beta } ) : = \\operatorname * { \\mathbb { E } } _ { P } \\operatorname * { \\mathbb { E } } _ { \\tilde { X } , \\vec { y } \\sim \\mathcal { D } ^ { n } } [ R _ { P } ( \\hat { \\beta } ( \\tilde { X } , \\vec { y } ) ]", + "type": "interline_equation", + "image_path": "471b0b050ee0b25d6039c368a191eda06e0d7ece3a4fd4107b6fcd61419bdb12.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 237, + 149, + 374, + 174 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 178, + 420, + 190 + ], + "lines": [ + { + "bbox": [ + 106, + 177, + 419, + 191 + ], + "spans": [ + { + "bbox": [ + 106, + 177, + 363, + 191 + ], + "score": 1.0, + "content": "We consider the regularized least-squares estimator. For a given", + "type": "text" + }, + { + "bbox": [ + 363, + 178, + 389, + 189 + ], + "score": 0.9, + "content": "\\lambda > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 177, + 419, + 191 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "interline_equation", + "bbox": [ + 175, + 193, + 437, + 217 + ], + "lines": [ + { + "bbox": [ + 175, + 193, + 437, + 217 + ], + "spans": [ + { + "bbox": [ + 175, + 193, + 437, + 217 + ], + "score": 0.92, + "content": "\\hat { \\beta } _ { d , \\lambda } : = \\underset { \\beta } { \\mathrm { a r g m i n } } | | \\widetilde { X } \\beta - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda | | \\beta | | _ { 2 } ^ { 2 } = ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I _ { d } ) ^ { - 1 } \\widetilde { X } ^ { T } \\vec { y }", + "type": "interline_equation", + "image_path": "d84149205d19f5e433d4ef05d807c1baeb63bf431d05a7edb609aeb394e83063.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 175, + 193, + 437, + 217 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 222, + 505, + 274 + ], + "lines": [ + { + "bbox": [ + 105, + 221, + 506, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 123, + 236 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 222, + 139, + 236 + ], + "score": 0.91, + "content": "\\lambda _ { d } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 221, + 506, + 236 + ], + "score": 1.0, + "content": "be the optimal ridge parameter (that achieves the minimum expected risk) for a model of", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 102, + 230, + 508, + 252 + ], + "spans": [ + { + "bbox": [ + 102, + 230, + 124, + 252 + ], + "score": 1.0, + "content": "size", + "type": "text" + }, + { + "bbox": [ + 125, + 237, + 131, + 247 + ], + "score": 0.78, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 230, + 155, + 252 + ], + "score": 1.0, + "content": "d, with", + "type": "text" + }, + { + "bbox": [ + 155, + 239, + 163, + 247 + ], + "score": 0.74, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 230, + 203, + 252 + ], + "score": 1.0, + "content": "samples:", + "type": "text" + }, + { + "bbox": [ + 203, + 235, + 320, + 250 + ], + "score": 0.92, + "content": "\\lambda _ { d } ^ { \\mathrm { o p t } } : = \\mathrm { a r g m i n } _ { \\lambda \\ge 0 } \\overline { { R } } ( \\hat { \\beta } _ { d , \\lambda } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 230, + 341, + 252 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 341, + 235, + 358, + 249 + ], + "score": 0.92, + "content": "\\hat { \\beta } _ { d } ^ { \\mathrm { { o p t } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 230, + 508, + 252 + ], + "score": 1.0, + "content": "be the estimator that corresponds to", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 103, + 245, + 507, + 267 + ], + "spans": [ + { + "bbox": [ + 103, + 245, + 122, + 267 + ], + "score": 1.0, + "content": "the", + "type": "text" + }, + { + "bbox": [ + 122, + 250, + 138, + 264 + ], + "score": 0.91, + "content": "\\lambda _ { d } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 245, + 171, + 267 + ], + "score": 1.0, + "content": ", that is", + "type": "text" + }, + { + "bbox": [ + 171, + 250, + 342, + 264 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\hat { \\beta } _ { d } ^ { \\mathrm { o p t } } : = \\operatorname * { a r g m i n } _ { \\beta } | | \\widetilde { X } \\beta - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda _ { d } ^ { \\mathrm { o p t } } | | \\beta | | _ { 2 } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 245, + 507, + 267 + ], + "score": 1.0, + "content": ". Now, our main theorem in this setting", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 262, + 457, + 275 + ], + "spans": [ + { + "bbox": [ + 106, + 262, + 204, + 275 + ], + "score": 1.0, + "content": "shows that with optimal", + "type": "text" + }, + { + "bbox": [ + 204, + 264, + 214, + 273 + ], + "score": 0.83, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 262, + 457, + 275 + ], + "score": 1.0, + "content": "regularization, test performance is monotonic in model size.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 106, + 277, + 505, + 299 + ], + "lines": [ + { + "bbox": [ + 106, + 277, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 106, + 277, + 505, + 289 + ], + "score": 1.0, + "content": "Theorem 3. In the setting above, the expected test risk of the optimally-regularized model is mono-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 287, + 452, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 198, + 300 + ], + "score": 1.0, + "content": "tonic in the model size", + "type": "text" + }, + { + "bbox": [ + 198, + 288, + 205, + 298 + ], + "score": 0.53, + "content": "d .", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 287, + 268, + 300 + ], + "score": 1.0, + "content": ". That is, for all", + "type": "text" + }, + { + "bbox": [ + 268, + 288, + 414, + 299 + ], + "score": 0.89, + "content": "p \\in \\mathbb { N } , \\theta \\in \\mathbb { R } ^ { p } , d \\leq p , n \\in \\mathbb { N } , \\sigma > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 287, + 452, + 300 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "interline_equation", + "bbox": [ + 264, + 303, + 346, + 320 + ], + "lines": [ + { + "bbox": [ + 264, + 303, + 346, + 320 + ], + "spans": [ + { + "bbox": [ + 264, + 303, + 346, + 320 + ], + "score": 0.9, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { d + 1 } ^ { \\mathrm { o p t } } ) \\leq \\overline { { R } } ( \\hat { \\beta } _ { d } ^ { \\mathrm { o p t } } )", + "type": "interline_equation", + "image_path": "220172f9a1811307d4805215b213850851fc08625c6f7fcb7e7c4f9092ce607d.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 264, + 303, + 346, + 320 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 328, + 462, + 341 + ], + "lines": [ + { + "bbox": [ + 106, + 327, + 464, + 342 + ], + "spans": [ + { + "bbox": [ + 106, + 327, + 464, + 342 + ], + "score": 1.0, + "content": "The proof of Theorem 3 is in Appendix A.2, and follows closely the proof of Theorem 1.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "title", + "bbox": [ + 107, + 355, + 335, + 369 + ], + "lines": [ + { + "bbox": [ + 105, + 354, + 336, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 336, + 371 + ], + "score": 1.0, + "content": "4 COUNTEREXAMPLES TO MONOTONICITY", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 380, + 505, + 425 + ], + "lines": [ + { + "bbox": [ + 105, + 380, + 505, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 505, + 393 + ], + "score": 1.0, + "content": "In this section, we show that optimally-regularized ridge regression is not always monotonic in", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 392, + 505, + 404 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 295, + 404 + ], + "score": 1.0, + "content": "samples. We give a numeric counterexample in", + "type": "text" + }, + { + "bbox": [ + 295, + 392, + 320, + 402 + ], + "score": 0.9, + "content": "d = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 392, + 505, + 404 + ], + "score": 1.0, + "content": "dimensions, with non-gaussian covariates and", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 403, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 505, + 415 + ], + "score": 1.0, + "content": "heteroscedastic noise. This does not contradict our main theorem in Section 2, since this distribution", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 414, + 300, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 300, + 425 + ], + "score": 1.0, + "content": "is not jointly Gaussian with isotropic marginals.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18.5 + }, + { + "type": "text", + "bbox": [ + 106, + 429, + 505, + 529 + ], + "lines": [ + { + "bbox": [ + 106, + 430, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 106, + 430, + 353, + 443 + ], + "score": 1.0, + "content": "Counterexample. Here we give an example of a distribution", + "type": "text" + }, + { + "bbox": [ + 353, + 430, + 377, + 442 + ], + "score": 0.91, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 430, + 506, + 443 + ], + "score": 1.0, + "content": "for which the expected error of", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 441, + 506, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 281, + 453 + ], + "score": 1.0, + "content": "optimally-regularized ridge regression with", + "type": "text" + }, + { + "bbox": [ + 282, + 442, + 308, + 451 + ], + "score": 0.89, + "content": "n = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 441, + 419, + 453 + ], + "score": 1.0, + "content": "samples is worse than with", + "type": "text" + }, + { + "bbox": [ + 419, + 442, + 446, + 451 + ], + "score": 0.9, + "content": "n = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 441, + 506, + 453 + ], + "score": 1.0, + "content": "samples. This", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 452, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 106, + 452, + 399, + 464 + ], + "score": 1.0, + "content": "counterexample is most intuitive to understand when the ridge parameter", + "type": "text" + }, + { + "bbox": [ + 400, + 453, + 407, + 462 + ], + "score": 0.79, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 452, + 505, + 464 + ], + "score": 1.0, + "content": "is allowed to depend on", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 462, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 218, + 475 + ], + "score": 1.0, + "content": "the specific sample instance", + "type": "text" + }, + { + "bbox": [ + 219, + 463, + 245, + 474 + ], + "score": 0.91, + "content": "( X , { \\vec { y } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 462, + 285, + 475 + ], + "score": 1.0, + "content": "as well as", + "type": "text" + }, + { + "bbox": [ + 286, + 462, + 297, + 473 + ], + "score": 0.86, + "content": "n ^ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 462, + 505, + 475 + ], + "score": 1.0, + "content": ". We sketch the intuition for this below. Consider the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 473, + 506, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 209, + 487 + ], + "score": 1.0, + "content": "following distribution on", + "type": "text" + }, + { + "bbox": [ + 210, + 474, + 233, + 486 + ], + "score": 0.91, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 473, + 245, + 487 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 246, + 474, + 272, + 484 + ], + "score": 0.9, + "content": "d = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 473, + 506, + 487 + ], + "score": 1.0, + "content": "dimensions. This distribution has one “clean” coordinate", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 484, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 484, + 301, + 498 + ], + "score": 1.0, + "content": "and one “noisy” coordinate. The distribution is:", + "type": "text" + }, + { + "bbox": [ + 302, + 485, + 365, + 497 + ], + "score": 0.93, + "content": "( x , y ) = ( { \\vec { e } } _ { 1 } , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 484, + 434, + 498 + ], + "score": 1.0, + "content": "with probability", + "type": "text" + }, + { + "bbox": [ + 434, + 485, + 447, + 495 + ], + "score": 0.31, + "content": "1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 484, + 469, + 498 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 469, + 485, + 505, + 497 + ], + "score": 0.91, + "content": "( x , y ) =", + "type": "inline_equation" + } + ], + "index": 26 + }, + { + "bbox": [ + 107, + 495, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 107, + 496, + 146, + 507 + ], + "score": 0.91, + "content": "( \\vec { e } _ { 2 } , \\pm 1 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 495, + 216, + 508 + ], + "score": 1.0, + "content": "w.p. 1/2. Where", + "type": "text" + }, + { + "bbox": [ + 216, + 496, + 235, + 506 + ], + "score": 0.86, + "content": "\\pm 1 0", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 495, + 505, + 508 + ], + "score": 1.0, + "content": "is uniformly random independent noise. This distribution is “well-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 506, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 104, + 506, + 305, + 520 + ], + "score": 1.0, + "content": "specified” in that the optimal predictor is linear in", + "type": "text" + }, + { + "bbox": [ + 305, + 508, + 312, + 517 + ], + "score": 0.39, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 507, + 385, + 519 + ], + "score": 0.9, + "content": ": \\mathbb { E } [ y | x ] = \\langle \\beta ^ { * } , x \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 506, + 400, + 520 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 401, + 507, + 446, + 519 + ], + "score": 0.93, + "content": "\\beta ^ { * } = [ 1 , 0 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 506, + 506, + 520 + ], + "score": 1.0, + "content": ". However, the", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 518, + 205, + 530 + ], + "spans": [ + { + "bbox": [ + 106, + 518, + 205, + 530 + ], + "score": 1.0, + "content": "noise is heteroscedastic.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 534, + 505, + 568 + ], + "lines": [ + { + "bbox": [ + 105, + 534, + 505, + 547 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 123, + 547 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 123, + 535, + 149, + 545 + ], + "score": 0.9, + "content": "n = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 534, + 374, + 547 + ], + "score": 1.0, + "content": "samples, the estimator can decide whether to use small", + "type": "text" + }, + { + "bbox": [ + 374, + 535, + 381, + 545 + ], + "score": 0.79, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 534, + 416, + 547 + ], + "score": 1.0, + "content": "or large", + "type": "text" + }, + { + "bbox": [ + 416, + 535, + 423, + 545 + ], + "score": 0.79, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 534, + 505, + 547 + ], + "score": 1.0, + "content": "depending on if the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 546, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 106, + 546, + 415, + 558 + ], + "score": 1.0, + "content": "sampled coordinate is the “clean” or “noisy” one. Specifically, for the sample", + "type": "text" + }, + { + "bbox": [ + 415, + 546, + 439, + 557 + ], + "score": 0.9, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 546, + 452, + 558 + ], + "score": 1.0, + "content": ": If", + "type": "text" + }, + { + "bbox": [ + 453, + 546, + 482, + 556 + ], + "score": 0.91, + "content": "x = \\vec { e } _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 546, + 505, + 558 + ], + "score": 1.0, + "content": ", then", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 556, + 453, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 228, + 570 + ], + "score": 1.0, + "content": "the optimal ridge parameter is", + "type": "text" + }, + { + "bbox": [ + 228, + 557, + 254, + 567 + ], + "score": 0.89, + "content": "\\lambda = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 556, + 267, + 570 + ], + "score": 1.0, + "content": ". If", + "type": "text" + }, + { + "bbox": [ + 267, + 557, + 296, + 568 + ], + "score": 0.92, + "content": "x = \\vec { e } _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 556, + 419, + 570 + ], + "score": 1.0, + "content": ", then the optimal parameter is", + "type": "text" + }, + { + "bbox": [ + 419, + 558, + 449, + 567 + ], + "score": 0.88, + "content": "\\lambda = \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 556, + 453, + 570 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 573, + 505, + 617 + ], + "lines": [ + { + "bbox": [ + 105, + 573, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 122, + 585 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 123, + 574, + 149, + 583 + ], + "score": 0.89, + "content": "n = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 573, + 253, + 585 + ], + "score": 1.0, + "content": "samples, with probability", + "type": "text" + }, + { + "bbox": [ + 253, + 573, + 270, + 585 + ], + "score": 0.81, + "content": "1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 573, + 505, + 585 + ], + "score": 1.0, + "content": "the two samples will hit both coordinates. In this case, the", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 584, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 584, + 259, + 596 + ], + "score": 1.0, + "content": "estimator must chose a single value of", + "type": "text" + }, + { + "bbox": [ + 260, + 585, + 267, + 594 + ], + "score": 0.8, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 584, + 505, + 596 + ], + "score": 1.0, + "content": "uniformly for both coordinates. This yields to a suboptimal", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "score": 1.0, + "content": "tradeoff, since the “noisy” coordinate demands large regularization, but this hurts estimation on the", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 605, + 186, + 618 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 186, + 618 + ], + "score": 1.0, + "content": "“clean” coordinate.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 107, + 622, + 505, + 668 + ], + "lines": [ + { + "bbox": [ + 105, + 622, + 505, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 505, + 635 + ], + "score": 1.0, + "content": "It turns out that a slight modification to the above also serves as a counterexample to monotonicity", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 246, + 646 + ], + "score": 1.0, + "content": "when the regularization parameter", + "type": "text" + }, + { + "bbox": [ + 246, + 634, + 253, + 644 + ], + "score": 0.81, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 633, + 371, + 646 + ], + "score": 1.0, + "content": "is chosen only depending on", + "type": "text" + }, + { + "bbox": [ + 371, + 636, + 379, + 644 + ], + "score": 0.69, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 633, + 478, + 646 + ], + "score": 1.0, + "content": "(and not on the instance", + "type": "text" + }, + { + "bbox": [ + 479, + 634, + 500, + 645 + ], + "score": 0.87, + "content": "X , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 633, + 505, + 646 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 644, + 506, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 187, + 658 + ], + "score": 1.0, + "content": "The distribution is:", + "type": "text" + }, + { + "bbox": [ + 187, + 645, + 252, + 657 + ], + "score": 0.93, + "content": "( x , y ) = ( \\vec { e } _ { 1 } , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 644, + 312, + 658 + ], + "score": 1.0, + "content": "w.p. 0.98 and", + "type": "text" + }, + { + "bbox": [ + 312, + 645, + 389, + 657 + ], + "score": 0.92, + "content": "( x , y ) = ( \\vec { e } _ { 2 } , \\pm 2 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 644, + 506, + 658 + ], + "score": 1.0, + "content": "w.p. 0.02. This distribution", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 655, + 216, + 669 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 216, + 669 + ], + "score": 1.0, + "content": "has the following property.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 107, + 669, + 505, + 705 + ], + "lines": [ + { + "bbox": [ + 105, + 667, + 505, + 685 + ], + "spans": [ + { + "bbox": [ + 105, + 667, + 268, + 685 + ], + "score": 1.0, + "content": "Theorem 4. There exists a distribution", + "type": "text" + }, + { + "bbox": [ + 268, + 671, + 278, + 680 + ], + "score": 0.78, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 667, + 300, + 685 + ], + "score": 1.0, + "content": "over", + "type": "text" + }, + { + "bbox": [ + 300, + 670, + 324, + 682 + ], + "score": 0.91, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 667, + 340, + 685 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 340, + 669, + 403, + 682 + ], + "score": 0.93, + "content": "x \\in \\mathbb { R } ^ { 2 } , y \\in \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 667, + 505, + 685 + ], + "score": 1.0, + "content": "with the following prop-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 680, + 505, + 697 + ], + "spans": [ + { + "bbox": [ + 105, + 680, + 150, + 697 + ], + "score": 1.0, + "content": "erties. Let", + "type": "text" + }, + { + "bbox": [ + 150, + 681, + 167, + 694 + ], + "score": 0.9, + "content": "\\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 680, + 399, + 697 + ], + "score": 1.0, + "content": "be the optimally-regularized ridge regression solution for", + "type": "text" + }, + { + "bbox": [ + 399, + 686, + 406, + 693 + ], + "score": 0.25, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 680, + 443, + 697 + ], + "score": 1.0, + "content": "samples", + "type": "text" + }, + { + "bbox": [ + 443, + 683, + 469, + 695 + ], + "score": 0.91, + "content": "( X , { \\vec { y } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 680, + 492, + 697 + ], + "score": 1.0, + "content": "from", + "type": "text" + }, + { + "bbox": [ + 492, + 684, + 501, + 693 + ], + "score": 0.76, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 680, + 505, + 697 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 692, + 133, + 707 + ], + "spans": [ + { + "bbox": [ + 105, + 692, + 133, + 707 + ], + "score": 1.0, + "content": "Then:", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42 + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 711, + 506, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 708, + 506, + 724 + ], + "spans": [ + { + "bbox": [ + 118, + 708, + 408, + 724 + ], + "score": 1.0, + "content": "1Recall, our model of optimal ridge regularization from Section 2 only allows", + "type": "text" + }, + { + "bbox": [ + 409, + 712, + 415, + 721 + ], + "score": 0.8, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 708, + 468, + 724 + ], + "score": 1.0, + "content": "to depend on", + "type": "text" + }, + { + "bbox": [ + 468, + 714, + 474, + 721 + ], + "score": 0.74, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 708, + 506, + 724 + ], + "score": 1.0, + "content": "(not on", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 718, + 133, + 735 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 127, + 732 + ], + "score": 0.89, + "content": "X , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 128, + 718, + 133, + 735 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 27, + 292, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 310, + 761 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 310, + 761 + ], + "score": 1.0, + "content": "6", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 505, + 147 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 153, + 96 + ], + "score": 1.0, + "content": "For a fixed", + "type": "text" + }, + { + "bbox": [ + 154, + 83, + 163, + 92 + ], + "score": 0.79, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 81, + 299, + 96 + ], + "score": 1.0, + "content": ", we want to learn a linear model", + "type": "text" + }, + { + "bbox": [ + 299, + 81, + 363, + 96 + ], + "score": 0.93, + "content": "f _ { \\hat { \\beta } } ( \\tilde { x } ) = \\langle \\tilde { x } , \\hat { \\beta } \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 81, + 424, + 96 + ], + "score": 1.0, + "content": "for estimating", + "type": "text" + }, + { + "bbox": [ + 424, + 85, + 431, + 94 + ], + "score": 0.75, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 81, + 505, + 96 + ], + "score": 1.0, + "content": ", with small mean", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 96, + 505, + 111 + ], + "spans": [ + { + "bbox": [ + 105, + 96, + 227, + 111 + ], + "score": 1.0, + "content": "squared error on distribution:", + "type": "text" + }, + { + "bbox": [ + 227, + 96, + 370, + 111 + ], + "score": 0.92, + "content": "R _ { P } ( \\hat { \\beta } ) : = \\mathbb { E } _ { ( \\tilde { x } , y ) \\sim \\mathcal { D } } [ ( \\langle \\tilde { x } , \\hat { \\beta } \\rangle - y ) ^ { 2 } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 96, + 392, + 111 + ], + "score": 1.0, + "content": ". For", + "type": "text" + }, + { + "bbox": [ + 392, + 99, + 400, + 108 + ], + "score": 0.76, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 96, + 436, + 111 + ], + "score": 1.0, + "content": "samples", + "type": "text" + }, + { + "bbox": [ + 437, + 97, + 466, + 110 + ], + "score": 0.92, + "content": "( x _ { i } , y _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 96, + 483, + 111 + ], + "score": 1.0, + "content": ", let", + "type": "text" + }, + { + "bbox": [ + 484, + 97, + 505, + 109 + ], + "score": 0.85, + "content": "X \\in", + "type": "inline_equation" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 109, + 506, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 111, + 131, + 122 + ], + "score": 0.89, + "content": "\\mathbb { R } ^ { n \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 109, + 213, + 125 + ], + "score": 1.0, + "content": "be the data matrix,", + "type": "text" + }, + { + "bbox": [ + 214, + 110, + 302, + 122 + ], + "score": 0.9, + "content": "\\widetilde { X } \\ = X P ^ { T } \\ \\in \\ \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 109, + 440, + 125 + ], + "score": 1.0, + "content": "be the projected data matrix and", + "type": "text" + }, + { + "bbox": [ + 441, + 112, + 475, + 124 + ], + "score": 0.92, + "content": "\\vec { y } \\in \\mathbb R ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 109, + 506, + 125 + ], + "score": 1.0, + "content": "be the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 123, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 228, + 137 + ], + "score": 1.0, + "content": "responses. For any estimator", + "type": "text" + }, + { + "bbox": [ + 228, + 123, + 262, + 137 + ], + "score": 0.93, + "content": "\\hat { \\beta } ( \\widetilde { X } , \\vec { y } )", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 123, + 505, + 137 + ], + "score": 1.0, + "content": "as a function of the observed samples, define the expected", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 135, + 203, + 148 + ], + "spans": [ + { + "bbox": [ + 105, + 135, + 203, + 148 + ], + "score": 1.0, + "content": "risk of the estimator as:", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 81, + 506, + 148 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 237, + 149, + 374, + 174 + ], + "lines": [ + { + "bbox": [ + 237, + 149, + 374, + 174 + ], + "spans": [ + { + "bbox": [ + 237, + 149, + 374, + 174 + ], + "score": 0.93, + "content": "\\overline { { R } } ( \\hat { \\beta } ) : = \\operatorname * { \\mathbb { E } } _ { P } \\operatorname * { \\mathbb { E } } _ { \\tilde { X } , \\vec { y } \\sim \\mathcal { D } ^ { n } } [ R _ { P } ( \\hat { \\beta } ( \\tilde { X } , \\vec { y } ) ]", + "type": "interline_equation", + "image_path": "471b0b050ee0b25d6039c368a191eda06e0d7ece3a4fd4107b6fcd61419bdb12.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 237, + 149, + 374, + 174 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 178, + 420, + 190 + ], + "lines": [ + { + "bbox": [ + 106, + 177, + 419, + 191 + ], + "spans": [ + { + "bbox": [ + 106, + 177, + 363, + 191 + ], + "score": 1.0, + "content": "We consider the regularized least-squares estimator. For a given", + "type": "text" + }, + { + "bbox": [ + 363, + 178, + 389, + 189 + ], + "score": 0.9, + "content": "\\lambda > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 177, + 419, + 191 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 177, + 419, + 191 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 175, + 193, + 437, + 217 + ], + "lines": [ + { + "bbox": [ + 175, + 193, + 437, + 217 + ], + "spans": [ + { + "bbox": [ + 175, + 193, + 437, + 217 + ], + "score": 0.92, + "content": "\\hat { \\beta } _ { d , \\lambda } : = \\underset { \\beta } { \\mathrm { a r g m i n } } | | \\widetilde { X } \\beta - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda | | \\beta | | _ { 2 } ^ { 2 } = ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I _ { d } ) ^ { - 1 } \\widetilde { X } ^ { T } \\vec { y }", + "type": "interline_equation", + "image_path": "d84149205d19f5e433d4ef05d807c1baeb63bf431d05a7edb609aeb394e83063.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 175, + 193, + 437, + 217 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 222, + 505, + 274 + ], + "lines": [ + { + "bbox": [ + 105, + 221, + 506, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 123, + 236 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 222, + 139, + 236 + ], + "score": 0.91, + "content": "\\lambda _ { d } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 221, + 506, + 236 + ], + "score": 1.0, + "content": "be the optimal ridge parameter (that achieves the minimum expected risk) for a model of", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 102, + 230, + 508, + 252 + ], + "spans": [ + { + "bbox": [ + 102, + 230, + 124, + 252 + ], + "score": 1.0, + "content": "size", + "type": "text" + }, + { + "bbox": [ + 125, + 237, + 131, + 247 + ], + "score": 0.78, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 230, + 155, + 252 + ], + "score": 1.0, + "content": "d, with", + "type": "text" + }, + { + "bbox": [ + 155, + 239, + 163, + 247 + ], + "score": 0.74, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 230, + 203, + 252 + ], + "score": 1.0, + "content": "samples:", + "type": "text" + }, + { + "bbox": [ + 203, + 235, + 320, + 250 + ], + "score": 0.92, + "content": "\\lambda _ { d } ^ { \\mathrm { o p t } } : = \\mathrm { a r g m i n } _ { \\lambda \\ge 0 } \\overline { { R } } ( \\hat { \\beta } _ { d , \\lambda } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 230, + 341, + 252 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 341, + 235, + 358, + 249 + ], + "score": 0.92, + "content": "\\hat { \\beta } _ { d } ^ { \\mathrm { { o p t } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 230, + 508, + 252 + ], + "score": 1.0, + "content": "be the estimator that corresponds to", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 103, + 245, + 507, + 267 + ], + "spans": [ + { + "bbox": [ + 103, + 245, + 122, + 267 + ], + "score": 1.0, + "content": "the", + "type": "text" + }, + { + "bbox": [ + 122, + 250, + 138, + 264 + ], + "score": 0.91, + "content": "\\lambda _ { d } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 245, + 171, + 267 + ], + "score": 1.0, + "content": ", that is", + "type": "text" + }, + { + "bbox": [ + 171, + 250, + 342, + 264 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\hat { \\beta } _ { d } ^ { \\mathrm { o p t } } : = \\operatorname * { a r g m i n } _ { \\beta } | | \\widetilde { X } \\beta - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda _ { d } ^ { \\mathrm { o p t } } | | \\beta | | _ { 2 } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 245, + 507, + 267 + ], + "score": 1.0, + "content": ". Now, our main theorem in this setting", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 262, + 457, + 275 + ], + "spans": [ + { + "bbox": [ + 106, + 262, + 204, + 275 + ], + "score": 1.0, + "content": "shows that with optimal", + "type": "text" + }, + { + "bbox": [ + 204, + 264, + 214, + 273 + ], + "score": 0.83, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 262, + 457, + 275 + ], + "score": 1.0, + "content": "regularization, test performance is monotonic in model size.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5, + "bbox_fs": [ + 102, + 221, + 508, + 275 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 277, + 505, + 299 + ], + "lines": [ + { + "bbox": [ + 106, + 277, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 106, + 277, + 505, + 289 + ], + "score": 1.0, + "content": "Theorem 3. In the setting above, the expected test risk of the optimally-regularized model is mono-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 287, + 452, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 198, + 300 + ], + "score": 1.0, + "content": "tonic in the model size", + "type": "text" + }, + { + "bbox": [ + 198, + 288, + 205, + 298 + ], + "score": 0.53, + "content": "d .", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 287, + 268, + 300 + ], + "score": 1.0, + "content": ". That is, for all", + "type": "text" + }, + { + "bbox": [ + 268, + 288, + 414, + 299 + ], + "score": 0.89, + "content": "p \\in \\mathbb { N } , \\theta \\in \\mathbb { R } ^ { p } , d \\leq p , n \\in \\mathbb { N } , \\sigma > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 287, + 452, + 300 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 277, + 505, + 300 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 264, + 303, + 346, + 320 + ], + "lines": [ + { + "bbox": [ + 264, + 303, + 346, + 320 + ], + "spans": [ + { + "bbox": [ + 264, + 303, + 346, + 320 + ], + "score": 0.9, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { d + 1 } ^ { \\mathrm { o p t } } ) \\leq \\overline { { R } } ( \\hat { \\beta } _ { d } ^ { \\mathrm { o p t } } )", + "type": "interline_equation", + "image_path": "220172f9a1811307d4805215b213850851fc08625c6f7fcb7e7c4f9092ce607d.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 264, + 303, + 346, + 320 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 328, + 462, + 341 + ], + "lines": [ + { + "bbox": [ + 106, + 327, + 464, + 342 + ], + "spans": [ + { + "bbox": [ + 106, + 327, + 464, + 342 + ], + "score": 1.0, + "content": "The proof of Theorem 3 is in Appendix A.2, and follows closely the proof of Theorem 1.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15, + "bbox_fs": [ + 106, + 327, + 464, + 342 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 355, + 335, + 369 + ], + "lines": [ + { + "bbox": [ + 105, + 354, + 336, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 336, + 371 + ], + "score": 1.0, + "content": "4 COUNTEREXAMPLES TO MONOTONICITY", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 380, + 505, + 425 + ], + "lines": [ + { + "bbox": [ + 105, + 380, + 505, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 505, + 393 + ], + "score": 1.0, + "content": "In this section, we show that optimally-regularized ridge regression is not always monotonic in", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 392, + 505, + 404 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 295, + 404 + ], + "score": 1.0, + "content": "samples. We give a numeric counterexample in", + "type": "text" + }, + { + "bbox": [ + 295, + 392, + 320, + 402 + ], + "score": 0.9, + "content": "d = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 392, + 505, + 404 + ], + "score": 1.0, + "content": "dimensions, with non-gaussian covariates and", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 403, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 505, + 415 + ], + "score": 1.0, + "content": "heteroscedastic noise. This does not contradict our main theorem in Section 2, since this distribution", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 414, + 300, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 300, + 425 + ], + "score": 1.0, + "content": "is not jointly Gaussian with isotropic marginals.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 380, + 505, + 425 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 429, + 505, + 529 + ], + "lines": [ + { + "bbox": [ + 106, + 430, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 106, + 430, + 353, + 443 + ], + "score": 1.0, + "content": "Counterexample. Here we give an example of a distribution", + "type": "text" + }, + { + "bbox": [ + 353, + 430, + 377, + 442 + ], + "score": 0.91, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 430, + 506, + 443 + ], + "score": 1.0, + "content": "for which the expected error of", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 441, + 506, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 281, + 453 + ], + "score": 1.0, + "content": "optimally-regularized ridge regression with", + "type": "text" + }, + { + "bbox": [ + 282, + 442, + 308, + 451 + ], + "score": 0.89, + "content": "n = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 441, + 419, + 453 + ], + "score": 1.0, + "content": "samples is worse than with", + "type": "text" + }, + { + "bbox": [ + 419, + 442, + 446, + 451 + ], + "score": 0.9, + "content": "n = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 441, + 506, + 453 + ], + "score": 1.0, + "content": "samples. This", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 452, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 106, + 452, + 399, + 464 + ], + "score": 1.0, + "content": "counterexample is most intuitive to understand when the ridge parameter", + "type": "text" + }, + { + "bbox": [ + 400, + 453, + 407, + 462 + ], + "score": 0.79, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 452, + 505, + 464 + ], + "score": 1.0, + "content": "is allowed to depend on", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 462, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 218, + 475 + ], + "score": 1.0, + "content": "the specific sample instance", + "type": "text" + }, + { + "bbox": [ + 219, + 463, + 245, + 474 + ], + "score": 0.91, + "content": "( X , { \\vec { y } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 462, + 285, + 475 + ], + "score": 1.0, + "content": "as well as", + "type": "text" + }, + { + "bbox": [ + 286, + 462, + 297, + 473 + ], + "score": 0.86, + "content": "n ^ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 462, + 505, + 475 + ], + "score": 1.0, + "content": ". We sketch the intuition for this below. Consider the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 473, + 506, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 209, + 487 + ], + "score": 1.0, + "content": "following distribution on", + "type": "text" + }, + { + "bbox": [ + 210, + 474, + 233, + 486 + ], + "score": 0.91, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 473, + 245, + 487 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 246, + 474, + 272, + 484 + ], + "score": 0.9, + "content": "d = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 473, + 506, + 487 + ], + "score": 1.0, + "content": "dimensions. This distribution has one “clean” coordinate", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 484, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 484, + 301, + 498 + ], + "score": 1.0, + "content": "and one “noisy” coordinate. The distribution is:", + "type": "text" + }, + { + "bbox": [ + 302, + 485, + 365, + 497 + ], + "score": 0.93, + "content": "( x , y ) = ( { \\vec { e } } _ { 1 } , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 484, + 434, + 498 + ], + "score": 1.0, + "content": "with probability", + "type": "text" + }, + { + "bbox": [ + 434, + 485, + 447, + 495 + ], + "score": 0.31, + "content": "1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 484, + 469, + 498 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 469, + 485, + 505, + 497 + ], + "score": 0.91, + "content": "( x , y ) =", + "type": "inline_equation" + } + ], + "index": 26 + }, + { + "bbox": [ + 107, + 495, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 107, + 496, + 146, + 507 + ], + "score": 0.91, + "content": "( \\vec { e } _ { 2 } , \\pm 1 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 495, + 216, + 508 + ], + "score": 1.0, + "content": "w.p. 1/2. Where", + "type": "text" + }, + { + "bbox": [ + 216, + 496, + 235, + 506 + ], + "score": 0.86, + "content": "\\pm 1 0", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 495, + 505, + 508 + ], + "score": 1.0, + "content": "is uniformly random independent noise. This distribution is “well-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 506, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 104, + 506, + 305, + 520 + ], + "score": 1.0, + "content": "specified” in that the optimal predictor is linear in", + "type": "text" + }, + { + "bbox": [ + 305, + 508, + 312, + 517 + ], + "score": 0.39, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 507, + 385, + 519 + ], + "score": 0.9, + "content": ": \\mathbb { E } [ y | x ] = \\langle \\beta ^ { * } , x \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 506, + 400, + 520 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 401, + 507, + 446, + 519 + ], + "score": 0.93, + "content": "\\beta ^ { * } = [ 1 , 0 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 506, + 506, + 520 + ], + "score": 1.0, + "content": ". However, the", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 518, + 205, + 530 + ], + "spans": [ + { + "bbox": [ + 106, + 518, + 205, + 530 + ], + "score": 1.0, + "content": "noise is heteroscedastic.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 25, + "bbox_fs": [ + 104, + 430, + 506, + 530 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 534, + 505, + 568 + ], + "lines": [ + { + "bbox": [ + 105, + 534, + 505, + 547 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 123, + 547 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 123, + 535, + 149, + 545 + ], + "score": 0.9, + "content": "n = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 534, + 374, + 547 + ], + "score": 1.0, + "content": "samples, the estimator can decide whether to use small", + "type": "text" + }, + { + "bbox": [ + 374, + 535, + 381, + 545 + ], + "score": 0.79, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 534, + 416, + 547 + ], + "score": 1.0, + "content": "or large", + "type": "text" + }, + { + "bbox": [ + 416, + 535, + 423, + 545 + ], + "score": 0.79, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 534, + 505, + 547 + ], + "score": 1.0, + "content": "depending on if the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 546, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 106, + 546, + 415, + 558 + ], + "score": 1.0, + "content": "sampled coordinate is the “clean” or “noisy” one. Specifically, for the sample", + "type": "text" + }, + { + "bbox": [ + 415, + 546, + 439, + 557 + ], + "score": 0.9, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 546, + 452, + 558 + ], + "score": 1.0, + "content": ": If", + "type": "text" + }, + { + "bbox": [ + 453, + 546, + 482, + 556 + ], + "score": 0.91, + "content": "x = \\vec { e } _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 546, + 505, + 558 + ], + "score": 1.0, + "content": ", then", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 556, + 453, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 228, + 570 + ], + "score": 1.0, + "content": "the optimal ridge parameter is", + "type": "text" + }, + { + "bbox": [ + 228, + 557, + 254, + 567 + ], + "score": 0.89, + "content": "\\lambda = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 556, + 267, + 570 + ], + "score": 1.0, + "content": ". If", + "type": "text" + }, + { + "bbox": [ + 267, + 557, + 296, + 568 + ], + "score": 0.92, + "content": "x = \\vec { e } _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 556, + 419, + 570 + ], + "score": 1.0, + "content": ", then the optimal parameter is", + "type": "text" + }, + { + "bbox": [ + 419, + 558, + 449, + 567 + ], + "score": 0.88, + "content": "\\lambda = \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 556, + 453, + 570 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 534, + 505, + 570 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 573, + 505, + 617 + ], + "lines": [ + { + "bbox": [ + 105, + 573, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 122, + 585 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 123, + 574, + 149, + 583 + ], + "score": 0.89, + "content": "n = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 573, + 253, + 585 + ], + "score": 1.0, + "content": "samples, with probability", + "type": "text" + }, + { + "bbox": [ + 253, + 573, + 270, + 585 + ], + "score": 0.81, + "content": "1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 573, + 505, + 585 + ], + "score": 1.0, + "content": "the two samples will hit both coordinates. In this case, the", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 584, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 584, + 259, + 596 + ], + "score": 1.0, + "content": "estimator must chose a single value of", + "type": "text" + }, + { + "bbox": [ + 260, + 585, + 267, + 594 + ], + "score": 0.8, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 584, + 505, + 596 + ], + "score": 1.0, + "content": "uniformly for both coordinates. This yields to a suboptimal", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "score": 1.0, + "content": "tradeoff, since the “noisy” coordinate demands large regularization, but this hurts estimation on the", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 605, + 186, + 618 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 186, + 618 + ], + "score": 1.0, + "content": "“clean” coordinate.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34.5, + "bbox_fs": [ + 105, + 573, + 505, + 618 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 622, + 505, + 668 + ], + "lines": [ + { + "bbox": [ + 105, + 622, + 505, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 505, + 635 + ], + "score": 1.0, + "content": "It turns out that a slight modification to the above also serves as a counterexample to monotonicity", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 246, + 646 + ], + "score": 1.0, + "content": "when the regularization parameter", + "type": "text" + }, + { + "bbox": [ + 246, + 634, + 253, + 644 + ], + "score": 0.81, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 633, + 371, + 646 + ], + "score": 1.0, + "content": "is chosen only depending on", + "type": "text" + }, + { + "bbox": [ + 371, + 636, + 379, + 644 + ], + "score": 0.69, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 633, + 478, + 646 + ], + "score": 1.0, + "content": "(and not on the instance", + "type": "text" + }, + { + "bbox": [ + 479, + 634, + 500, + 645 + ], + "score": 0.87, + "content": "X , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 633, + 505, + 646 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 644, + 506, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 187, + 658 + ], + "score": 1.0, + "content": "The distribution is:", + "type": "text" + }, + { + "bbox": [ + 187, + 645, + 252, + 657 + ], + "score": 0.93, + "content": "( x , y ) = ( \\vec { e } _ { 1 } , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 644, + 312, + 658 + ], + "score": 1.0, + "content": "w.p. 0.98 and", + "type": "text" + }, + { + "bbox": [ + 312, + 645, + 389, + 657 + ], + "score": 0.92, + "content": "( x , y ) = ( \\vec { e } _ { 2 } , \\pm 2 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 644, + 506, + 658 + ], + "score": 1.0, + "content": "w.p. 0.02. This distribution", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 655, + 216, + 669 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 216, + 669 + ], + "score": 1.0, + "content": "has the following property.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 622, + 506, + 669 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 669, + 505, + 705 + ], + "lines": [ + { + "bbox": [ + 105, + 667, + 505, + 685 + ], + "spans": [ + { + "bbox": [ + 105, + 667, + 268, + 685 + ], + "score": 1.0, + "content": "Theorem 4. There exists a distribution", + "type": "text" + }, + { + "bbox": [ + 268, + 671, + 278, + 680 + ], + "score": 0.78, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 667, + 300, + 685 + ], + "score": 1.0, + "content": "over", + "type": "text" + }, + { + "bbox": [ + 300, + 670, + 324, + 682 + ], + "score": 0.91, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 667, + 340, + 685 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 340, + 669, + 403, + 682 + ], + "score": 0.93, + "content": "x \\in \\mathbb { R } ^ { 2 } , y \\in \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 667, + 505, + 685 + ], + "score": 1.0, + "content": "with the following prop-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 680, + 505, + 697 + ], + "spans": [ + { + "bbox": [ + 105, + 680, + 150, + 697 + ], + "score": 1.0, + "content": "erties. Let", + "type": "text" + }, + { + "bbox": [ + 150, + 681, + 167, + 694 + ], + "score": 0.9, + "content": "\\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 680, + 399, + 697 + ], + "score": 1.0, + "content": "be the optimally-regularized ridge regression solution for", + "type": "text" + }, + { + "bbox": [ + 399, + 686, + 406, + 693 + ], + "score": 0.25, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 680, + 443, + 697 + ], + "score": 1.0, + "content": "samples", + "type": "text" + }, + { + "bbox": [ + 443, + 683, + 469, + 695 + ], + "score": 0.91, + "content": "( X , { \\vec { y } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 680, + 492, + 697 + ], + "score": 1.0, + "content": "from", + "type": "text" + }, + { + "bbox": [ + 492, + 684, + 501, + 693 + ], + "score": 0.76, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 680, + 505, + 697 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 692, + 133, + 707 + ], + "spans": [ + { + "bbox": [ + 105, + 692, + 133, + 707 + ], + "score": 1.0, + "content": "Then:", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42, + "bbox_fs": [ + 105, + 667, + 505, + 707 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 129, + 81, + 392, + 95 + ], + "lines": [ + { + "bbox": [ + 129, + 79, + 393, + 97 + ], + "spans": [ + { + "bbox": [ + 129, + 79, + 258, + 97 + ], + "score": 1.0, + "content": "1. D is “well-specified” in that", + "type": "text" + }, + { + "bbox": [ + 258, + 82, + 293, + 95 + ], + "score": 0.85, + "content": "\\mathbb { E } p [ y | x ]", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 79, + 382, + 97 + ], + "score": 1.0, + "content": "is a linear function of", + "type": "text" + }, + { + "bbox": [ + 382, + 85, + 389, + 92 + ], + "score": 0.58, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 79, + 393, + 97 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 127, + 104, + 503, + 117 + ], + "lines": [ + { + "bbox": [ + 128, + 103, + 504, + 118 + ], + "spans": [ + { + "bbox": [ + 128, + 103, + 335, + 118 + ], + "score": 1.0, + "content": "2. The expected test risk increases as a function of", + "type": "text" + }, + { + "bbox": [ + 335, + 107, + 342, + 115 + ], + "score": 0.57, + "content": "n _ { \\ast }", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 103, + 380, + 118 + ], + "score": 1.0, + "content": ", between", + "type": "text" + }, + { + "bbox": [ + 381, + 105, + 406, + 114 + ], + "score": 0.89, + "content": "n = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 103, + 425, + 118 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 425, + 105, + 450, + 114 + ], + "score": 0.87, + "content": "n = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 103, + 504, + 118 + ], + "score": 1.0, + "content": ". Specifically", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "interline_equation", + "bbox": [ + 279, + 123, + 368, + 139 + ], + "lines": [ + { + "bbox": [ + 279, + 123, + 368, + 139 + ], + "spans": [ + { + "bbox": [ + 279, + 123, + 368, + 139 + ], + "score": 0.9, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n = 1 } ^ { \\mathrm { o p t } } ) < \\overline { { R } } ( \\hat { \\beta } _ { n = 2 } ^ { \\mathrm { o p t } } )", + "type": "interline_equation", + "image_path": "5c348faa011f7bcdbd72bd75ff6cd0e528571f73042b72f9974ff9f74bbe14c5.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 279, + 123, + 368, + 139 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 160, + 505, + 207 + ], + "lines": [ + { + "bbox": [ + 102, + 157, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 102, + 157, + 153, + 177 + ], + "score": 1.0, + "content": "Proof. For", + "type": "text" + }, + { + "bbox": [ + 154, + 162, + 184, + 171 + ], + "score": 0.89, + "content": "n = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 157, + 453, + 177 + ], + "score": 1.0, + "content": "samples, it can be confirmed analytically that the expected risk", + "type": "text" + }, + { + "bbox": [ + 453, + 159, + 505, + 173 + ], + "score": 0.91, + "content": "\\overline { { { R } } } ( \\hat { \\beta } _ { n = 1 } ^ { \\mathrm { o p t } } ) ~ <", + "type": "inline_equation" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 172, + 506, + 184 + ], + "spans": [ + { + "bbox": [ + 105, + 172, + 224, + 184 + ], + "score": 1.0, + "content": "8.157. This is achieved with", + "type": "text" + }, + { + "bbox": [ + 224, + 172, + 339, + 184 + ], + "score": 0.88, + "content": "\\lambda = 4 0 0 / 2 4 0 1 \\approx 0 . 1 6 6 5 9 7 .", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 172, + 359, + 184 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 359, + 172, + 386, + 182 + ], + "score": 0.89, + "content": "n = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 172, + 506, + 184 + ], + "score": 1.0, + "content": "samples, it can be confirmed", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 102, + 180, + 508, + 201 + ], + "spans": [ + { + "bbox": [ + 102, + 180, + 328, + 201 + ], + "score": 1.0, + "content": "numerically (via Mathematica) that the expected risk", + "type": "text" + }, + { + "bbox": [ + 329, + 183, + 406, + 197 + ], + "score": 0.91, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n = 2 } ^ { \\mathrm { o p t } } ) ~ > ~ 8 . 1 7 9", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 180, + 508, + 201 + ], + "score": 1.0, + "content": ". This is achieved with", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 196, + 506, + 207 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 164, + 207 + ], + "score": 0.86, + "content": "\\lambda = 0 . 6 4 2 5 2 5", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 196, + 168, + 207 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 494, + 196, + 506, + 207 + ], + "score": 0.998, + "content": "□", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + }, + { + "type": "title", + "bbox": [ + 108, + 227, + 201, + 240 + ], + "lines": [ + { + "bbox": [ + 105, + 227, + 201, + 242 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 201, + 242 + ], + "score": 1.0, + "content": "5 EXPERIMENTS", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 108, + 255, + 505, + 278 + ], + "lines": [ + { + "bbox": [ + 106, + 255, + 505, + 269 + ], + "spans": [ + { + "bbox": [ + 106, + 255, + 307, + 269 + ], + "score": 1.0, + "content": "We now experimentally demonstrate that optimal", + "type": "text" + }, + { + "bbox": [ + 308, + 257, + 317, + 267 + ], + "score": 0.88, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 255, + 505, + 269 + ], + "score": 1.0, + "content": "regularization can mitigate double descent, in", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 267, + 291, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 291, + 278 + ], + "score": 1.0, + "content": "more general settings than Theorems 1 and 3.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "title", + "bbox": [ + 107, + 296, + 239, + 307 + ], + "lines": [ + { + "bbox": [ + 106, + 296, + 239, + 309 + ], + "spans": [ + { + "bbox": [ + 106, + 296, + 239, + 309 + ], + "score": 1.0, + "content": "5.1 SAMPLE MONOTONICITY", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 106, + 319, + 503, + 342 + ], + "lines": [ + { + "bbox": [ + 105, + 318, + 504, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 309, + 333 + ], + "score": 1.0, + "content": "Here we show various settings where optimal", + "type": "text" + }, + { + "bbox": [ + 309, + 320, + 320, + 331 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 318, + 504, + 333 + ], + "score": 1.0, + "content": "regularization empirically induces sample-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 330, + 207, + 343 + ], + "spans": [ + { + "bbox": [ + 106, + 330, + 207, + 343 + ], + "score": 1.0, + "content": "monotonic performance.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 106, + 358, + 505, + 417 + ], + "lines": [ + { + "bbox": [ + 106, + 358, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 106, + 358, + 505, + 370 + ], + "score": 1.0, + "content": "Nonisotropic Regression. We first consider the setting of Theorem 1, but with non-isotropic co-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 369, + 504, + 381 + ], + "spans": [ + { + "bbox": [ + 104, + 369, + 145, + 381 + ], + "score": 1.0, + "content": "variantes", + "type": "text" + }, + { + "bbox": [ + 145, + 371, + 152, + 379 + ], + "score": 0.73, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 369, + 359, + 381 + ], + "score": 1.0, + "content": ". That is, we perform ridge regression on samples", + "type": "text" + }, + { + "bbox": [ + 360, + 370, + 383, + 381 + ], + "score": 0.92, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 369, + 470, + 381 + ], + "score": 1.0, + "content": ", where the covariate", + "type": "text" + }, + { + "bbox": [ + 470, + 369, + 504, + 380 + ], + "score": 0.9, + "content": "\\boldsymbol { x } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 380, + 504, + 393 + ], + "spans": [ + { + "bbox": [ + 106, + 381, + 181, + 393 + ], + "score": 1.0, + "content": "is generated from", + "type": "text" + }, + { + "bbox": [ + 181, + 380, + 216, + 393 + ], + "score": 0.93, + "content": "\\mathcal { N } ( 0 , \\Sigma )", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 381, + 232, + 393 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 232, + 381, + 266, + 392 + ], + "score": 0.94, + "content": "\\Sigma \\neq I _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 381, + 435, + 393 + ], + "score": 1.0, + "content": ". As before, the response is generated by", + "type": "text" + }, + { + "bbox": [ + 435, + 380, + 504, + 393 + ], + "score": 0.92, + "content": "y = \\langle x , \\beta ^ { * } \\rangle + \\varepsilon", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 390, + 505, + 404 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 127, + 404 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 127, + 391, + 184, + 403 + ], + "score": 0.92, + "content": "\\varepsilon \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 390, + 306, + 404 + ], + "score": 1.0, + "content": "for some unknown parameter", + "type": "text" + }, + { + "bbox": [ + 306, + 391, + 343, + 403 + ], + "score": 0.93, + "content": "\\beta ^ { * } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 390, + 505, + 404 + ], + "score": 1.0, + "content": ". We consider the same ridge regression", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 403, + 313, + 418 + ], + "spans": [ + { + "bbox": [ + 106, + 404, + 148, + 417 + ], + "score": 1.0, + "content": "estimator,", + "type": "text" + }, + { + "bbox": [ + 149, + 403, + 309, + 418 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\boldsymbol { \\beta } } \\| X { \\boldsymbol { \\beta } } - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| { \\boldsymbol { \\beta } } \\| _ { 2 } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 404, + 313, + 417 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15 + }, + { + "type": "image", + "bbox": [ + 144, + 433, + 297, + 586 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 144, + 433, + 297, + 586 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 144, + 433, + 297, + 586 + ], + "spans": [ + { + "bbox": [ + 144, + 433, + 297, + 586 + ], + "score": 0.967, + "type": "image", + "image_path": "6bbe45f3d0113a0cbb86e816d67e9834573c85c456540349b12e6e02c25001ba.jpg" + } + ] + } + ], + "index": 18.5, + "virtual_lines": [ + { + "bbox": [ + 144, + 433, + 297, + 509.5 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 144, + 509.5, + 297, + 586.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 309, + 500, + 474, + 588 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 308, + 499, + 474, + 513 + ], + "spans": [ + { + "bbox": [ + 308, + 499, + 474, + 513 + ], + "score": 1.0, + "content": "Figure 2: Test Risk vs. Num. Samples", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 308, + 511, + 473, + 524 + ], + "spans": [ + { + "bbox": [ + 308, + 511, + 473, + 524 + ], + "score": 1.0, + "content": "for Non-Isotropic Ridge Regression in", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 310, + 522, + 473, + 535 + ], + "spans": [ + { + "bbox": [ + 310, + 523, + 343, + 533 + ], + "score": 0.88, + "content": "d = 3 0", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 522, + 473, + 535 + ], + "score": 1.0, + "content": "dimensions. Unregularized re-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 308, + 534, + 473, + 546 + ], + "spans": [ + { + "bbox": [ + 308, + 534, + 473, + 546 + ], + "score": 1.0, + "content": "gression is non-monotonic in samples,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 309, + 545, + 474, + 556 + ], + "spans": [ + { + "bbox": [ + 309, + 545, + 474, + 556 + ], + "score": 1.0, + "content": "but optimally-regularized regression is", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 309, + 555, + 473, + 567 + ], + "spans": [ + { + "bbox": [ + 309, + 555, + 473, + 567 + ], + "score": 1.0, + "content": "monotonic. Note the optimal regulariza-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 309, + 567, + 474, + 578 + ], + "spans": [ + { + "bbox": [ + 309, + 567, + 327, + 578 + ], + "score": 1.0, + "content": "tion", + "type": "text" + }, + { + "bbox": [ + 327, + 567, + 335, + 576 + ], + "score": 0.62, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 567, + 474, + 578 + ], + "score": 1.0, + "content": "depends on the number of samples", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 310, + 578, + 322, + 590 + ], + "spans": [ + { + "bbox": [ + 310, + 580, + 317, + 587 + ], + "score": 0.43, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 578, + 322, + 590 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 23.5 + }, + { + "type": "image_caption", + "bbox": [ + 106, + 602, + 505, + 646 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 602, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 602, + 369, + 613 + ], + "score": 1.0, + "content": "Figure 2 shows one instance of this, for a particular choice of", + "type": "text" + }, + { + "bbox": [ + 369, + 603, + 378, + 612 + ], + "score": 0.8, + "content": "\\Sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 602, + 398, + 613 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 398, + 603, + 410, + 613 + ], + "score": 0.89, + "content": "\\beta ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 602, + 484, + 613 + ], + "score": 1.0, + "content": ". The covariance", + "type": "text" + }, + { + "bbox": [ + 485, + 603, + 493, + 612 + ], + "score": 0.81, + "content": "\\Sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 494, + 602, + 505, + 613 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 612, + 505, + 625 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 165, + 625 + ], + "score": 1.0, + "content": "diagonal, with", + "type": "text" + }, + { + "bbox": [ + 166, + 613, + 206, + 625 + ], + "score": 0.93, + "content": "\\Sigma _ { i , i } = 1 0", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 612, + 221, + 625 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 221, + 613, + 249, + 624 + ], + "score": 0.91, + "content": "i \\leq 1 5", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 612, + 267, + 625 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 267, + 613, + 302, + 625 + ], + "score": 0.93, + "content": "\\Sigma _ { i , i } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 612, + 317, + 625 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 317, + 613, + 345, + 623 + ], + "score": 0.9, + "content": "i > 1 5", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 612, + 505, + 625 + ], + "score": 1.0, + "content": ". That is, the covariance has one “large”", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 623, + 506, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 348, + 636 + ], + "score": 1.0, + "content": "eigenspace and one “small” eigenspace. The ground-truth", + "type": "text" + }, + { + "bbox": [ + 348, + 623, + 426, + 635 + ], + "score": 0.92, + "content": "\\beta ^ { * } = 0 . 1 \\vec { e _ { 1 } } + e _ { 3 0 } ^ { }", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 623, + 506, + 636 + ], + "score": 1.0, + "content": ", which lies almost", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 635, + 416, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 635, + 272, + 648 + ], + "score": 1.0, + "content": "entirely within the “small” eigenspace of", + "type": "text" + }, + { + "bbox": [ + 272, + 635, + 280, + 645 + ], + "score": 0.67, + "content": "\\Sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 635, + 378, + 648 + ], + "score": 1.0, + "content": ". The noise parameter is", + "type": "text" + }, + { + "bbox": [ + 378, + 636, + 411, + 645 + ], + "score": 0.87, + "content": "\\sigma = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 635, + 416, + 648 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 29.5 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 107, + 653, + 505, + 709 + ], + "lines": [ + { + "bbox": [ + 105, + 652, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 652, + 261, + 667 + ], + "score": 1.0, + "content": "We see that unregularized regression", + "type": "text" + }, + { + "bbox": [ + 262, + 654, + 291, + 664 + ], + "score": 0.85, + "content": "\\lambda = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 652, + 505, + 667 + ], + "score": 1.0, + "content": ") actually undergoes “triple descent”2 in this setting,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 665, + 504, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 665, + 211, + 677 + ], + "score": 1.0, + "content": "with the first peak around", + "type": "text" + }, + { + "bbox": [ + 211, + 665, + 242, + 675 + ], + "score": 0.9, + "content": "n = 1 5", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 665, + 504, + 677 + ], + "score": 1.0, + "content": "samples due to the 15-dimensional large eigenspace, and the sec-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 676, + 505, + 688 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 155, + 688 + ], + "score": 1.0, + "content": "ond peak at", + "type": "text" + }, + { + "bbox": [ + 155, + 676, + 182, + 686 + ], + "score": 0.9, + "content": "n = d", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 676, + 505, + 688 + ], + "score": 1.0, + "content": ". In this setting, optimally-regularized ridge regression is empirically monotonic", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 686, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 481, + 700 + ], + "score": 1.0, + "content": "in samples (Figure 2). Unlike the isotropic setting of Section 2, the optimal ridge parameter", + "type": "text" + }, + { + "bbox": [ + 482, + 687, + 494, + 698 + ], + "score": 0.88, + "content": "\\lambda _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 686, + 505, + 700 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 697, + 343, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 331, + 711 + ], + "score": 1.0, + "content": "no longer a constant, but varies with number of samples", + "type": "text" + }, + { + "bbox": [ + 332, + 700, + 339, + 707 + ], + "score": 0.76, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 697, + 343, + 711 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 117, + 721, + 432, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 719, + 432, + 734 + ], + "spans": [ + { + "bbox": [ + 118, + 719, + 432, + 734 + ], + "score": 1.0, + "content": "2See also the “multiple descent” behavior of kernel interpolants in Liang et al. (2020).", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 26, + 292, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "score": 1.0, + "content": "7", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 129, + 81, + 392, + 95 + ], + "lines": [ + { + "bbox": [ + 129, + 79, + 393, + 97 + ], + "spans": [ + { + "bbox": [ + 129, + 79, + 258, + 97 + ], + "score": 1.0, + "content": "1. D is “well-specified” in that", + "type": "text" + }, + { + "bbox": [ + 258, + 82, + 293, + 95 + ], + "score": 0.85, + "content": "\\mathbb { E } p [ y | x ]", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 79, + 382, + 97 + ], + "score": 1.0, + "content": "is a linear function of", + "type": "text" + }, + { + "bbox": [ + 382, + 85, + 389, + 92 + ], + "score": 0.58, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 79, + 393, + 97 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 129, + 79, + 393, + 97 + ] + }, + { + "type": "text", + "bbox": [ + 127, + 104, + 503, + 117 + ], + "lines": [ + { + "bbox": [ + 128, + 103, + 504, + 118 + ], + "spans": [ + { + "bbox": [ + 128, + 103, + 335, + 118 + ], + "score": 1.0, + "content": "2. The expected test risk increases as a function of", + "type": "text" + }, + { + "bbox": [ + 335, + 107, + 342, + 115 + ], + "score": 0.57, + "content": "n _ { \\ast }", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 103, + 380, + 118 + ], + "score": 1.0, + "content": ", between", + "type": "text" + }, + { + "bbox": [ + 381, + 105, + 406, + 114 + ], + "score": 0.89, + "content": "n = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 103, + 425, + 118 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 425, + 105, + 450, + 114 + ], + "score": 0.87, + "content": "n = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 103, + 504, + 118 + ], + "score": 1.0, + "content": ". Specifically", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1, + "bbox_fs": [ + 128, + 103, + 504, + 118 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 279, + 123, + 368, + 139 + ], + "lines": [ + { + "bbox": [ + 279, + 123, + 368, + 139 + ], + "spans": [ + { + "bbox": [ + 279, + 123, + 368, + 139 + ], + "score": 0.9, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n = 1 } ^ { \\mathrm { o p t } } ) < \\overline { { R } } ( \\hat { \\beta } _ { n = 2 } ^ { \\mathrm { o p t } } )", + "type": "interline_equation", + "image_path": "5c348faa011f7bcdbd72bd75ff6cd0e528571f73042b72f9974ff9f74bbe14c5.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 279, + 123, + 368, + 139 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 160, + 505, + 207 + ], + "lines": [ + { + "bbox": [ + 102, + 157, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 102, + 157, + 153, + 177 + ], + "score": 1.0, + "content": "Proof. For", + "type": "text" + }, + { + "bbox": [ + 154, + 162, + 184, + 171 + ], + "score": 0.89, + "content": "n = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 157, + 453, + 177 + ], + "score": 1.0, + "content": "samples, it can be confirmed analytically that the expected risk", + "type": "text" + }, + { + "bbox": [ + 453, + 159, + 505, + 173 + ], + "score": 0.91, + "content": "\\overline { { { R } } } ( \\hat { \\beta } _ { n = 1 } ^ { \\mathrm { o p t } } ) ~ <", + "type": "inline_equation" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 172, + 506, + 184 + ], + "spans": [ + { + "bbox": [ + 105, + 172, + 224, + 184 + ], + "score": 1.0, + "content": "8.157. This is achieved with", + "type": "text" + }, + { + "bbox": [ + 224, + 172, + 339, + 184 + ], + "score": 0.88, + "content": "\\lambda = 4 0 0 / 2 4 0 1 \\approx 0 . 1 6 6 5 9 7 .", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 172, + 359, + 184 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 359, + 172, + 386, + 182 + ], + "score": 0.89, + "content": "n = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 172, + 506, + 184 + ], + "score": 1.0, + "content": "samples, it can be confirmed", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 102, + 180, + 508, + 201 + ], + "spans": [ + { + "bbox": [ + 102, + 180, + 328, + 201 + ], + "score": 1.0, + "content": "numerically (via Mathematica) that the expected risk", + "type": "text" + }, + { + "bbox": [ + 329, + 183, + 406, + 197 + ], + "score": 0.91, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n = 2 } ^ { \\mathrm { o p t } } ) ~ > ~ 8 . 1 7 9", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 180, + 508, + 201 + ], + "score": 1.0, + "content": ". This is achieved with", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 196, + 506, + 207 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 164, + 207 + ], + "score": 0.86, + "content": "\\lambda = 0 . 6 4 2 5 2 5", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 196, + 168, + 207 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 494, + 196, + 506, + 207 + ], + "score": 0.998, + "content": "□", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5, + "bbox_fs": [ + 102, + 157, + 508, + 207 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 227, + 201, + 240 + ], + "lines": [ + { + "bbox": [ + 105, + 227, + 201, + 242 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 201, + 242 + ], + "score": 1.0, + "content": "5 EXPERIMENTS", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 108, + 255, + 505, + 278 + ], + "lines": [ + { + "bbox": [ + 106, + 255, + 505, + 269 + ], + "spans": [ + { + "bbox": [ + 106, + 255, + 307, + 269 + ], + "score": 1.0, + "content": "We now experimentally demonstrate that optimal", + "type": "text" + }, + { + "bbox": [ + 308, + 257, + 317, + 267 + ], + "score": 0.88, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 255, + 505, + 269 + ], + "score": 1.0, + "content": "regularization can mitigate double descent, in", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 267, + 291, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 291, + 278 + ], + "score": 1.0, + "content": "more general settings than Theorems 1 and 3.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 255, + 505, + 278 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 296, + 239, + 307 + ], + "lines": [ + { + "bbox": [ + 106, + 296, + 239, + 309 + ], + "spans": [ + { + "bbox": [ + 106, + 296, + 239, + 309 + ], + "score": 1.0, + "content": "5.1 SAMPLE MONOTONICITY", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 106, + 319, + 503, + 342 + ], + "lines": [ + { + "bbox": [ + 105, + 318, + 504, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 309, + 333 + ], + "score": 1.0, + "content": "Here we show various settings where optimal", + "type": "text" + }, + { + "bbox": [ + 309, + 320, + 320, + 331 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 318, + 504, + 333 + ], + "score": 1.0, + "content": "regularization empirically induces sample-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 330, + 207, + 343 + ], + "spans": [ + { + "bbox": [ + 106, + 330, + 207, + 343 + ], + "score": 1.0, + "content": "monotonic performance.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 318, + 504, + 343 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 358, + 505, + 417 + ], + "lines": [ + { + "bbox": [ + 106, + 358, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 106, + 358, + 505, + 370 + ], + "score": 1.0, + "content": "Nonisotropic Regression. We first consider the setting of Theorem 1, but with non-isotropic co-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 369, + 504, + 381 + ], + "spans": [ + { + "bbox": [ + 104, + 369, + 145, + 381 + ], + "score": 1.0, + "content": "variantes", + "type": "text" + }, + { + "bbox": [ + 145, + 371, + 152, + 379 + ], + "score": 0.73, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 369, + 359, + 381 + ], + "score": 1.0, + "content": ". That is, we perform ridge regression on samples", + "type": "text" + }, + { + "bbox": [ + 360, + 370, + 383, + 381 + ], + "score": 0.92, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 369, + 470, + 381 + ], + "score": 1.0, + "content": ", where the covariate", + "type": "text" + }, + { + "bbox": [ + 470, + 369, + 504, + 380 + ], + "score": 0.9, + "content": "\\boldsymbol { x } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 380, + 504, + 393 + ], + "spans": [ + { + "bbox": [ + 106, + 381, + 181, + 393 + ], + "score": 1.0, + "content": "is generated from", + "type": "text" + }, + { + "bbox": [ + 181, + 380, + 216, + 393 + ], + "score": 0.93, + "content": "\\mathcal { N } ( 0 , \\Sigma )", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 381, + 232, + 393 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 232, + 381, + 266, + 392 + ], + "score": 0.94, + "content": "\\Sigma \\neq I _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 381, + 435, + 393 + ], + "score": 1.0, + "content": ". As before, the response is generated by", + "type": "text" + }, + { + "bbox": [ + 435, + 380, + 504, + 393 + ], + "score": 0.92, + "content": "y = \\langle x , \\beta ^ { * } \\rangle + \\varepsilon", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 390, + 505, + 404 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 127, + 404 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 127, + 391, + 184, + 403 + ], + "score": 0.92, + "content": "\\varepsilon \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 390, + 306, + 404 + ], + "score": 1.0, + "content": "for some unknown parameter", + "type": "text" + }, + { + "bbox": [ + 306, + 391, + 343, + 403 + ], + "score": 0.93, + "content": "\\beta ^ { * } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 390, + 505, + 404 + ], + "score": 1.0, + "content": ". We consider the same ridge regression", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 403, + 313, + 418 + ], + "spans": [ + { + "bbox": [ + 106, + 404, + 148, + 417 + ], + "score": 1.0, + "content": "estimator,", + "type": "text" + }, + { + "bbox": [ + 149, + 403, + 309, + 418 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\boldsymbol { \\beta } } \\| X { \\boldsymbol { \\beta } } - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| { \\boldsymbol { \\beta } } \\| _ { 2 } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 404, + 313, + 417 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15, + "bbox_fs": [ + 104, + 358, + 505, + 418 + ] + }, + { + "type": "image", + "bbox": [ + 144, + 433, + 297, + 586 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 144, + 433, + 297, + 586 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 144, + 433, + 297, + 586 + ], + "spans": [ + { + "bbox": [ + 144, + 433, + 297, + 586 + ], + "score": 0.967, + "type": "image", + "image_path": "6bbe45f3d0113a0cbb86e816d67e9834573c85c456540349b12e6e02c25001ba.jpg" + } + ] + } + ], + "index": 18.5, + "virtual_lines": [ + { + "bbox": [ + 144, + 433, + 297, + 509.5 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 144, + 509.5, + 297, + 586.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 309, + 500, + 474, + 588 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 308, + 499, + 474, + 513 + ], + "spans": [ + { + "bbox": [ + 308, + 499, + 474, + 513 + ], + "score": 1.0, + "content": "Figure 2: Test Risk vs. Num. Samples", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 308, + 511, + 473, + 524 + ], + "spans": [ + { + "bbox": [ + 308, + 511, + 473, + 524 + ], + "score": 1.0, + "content": "for Non-Isotropic Ridge Regression in", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 310, + 522, + 473, + 535 + ], + "spans": [ + { + "bbox": [ + 310, + 523, + 343, + 533 + ], + "score": 0.88, + "content": "d = 3 0", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 522, + 473, + 535 + ], + "score": 1.0, + "content": "dimensions. Unregularized re-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 308, + 534, + 473, + 546 + ], + "spans": [ + { + "bbox": [ + 308, + 534, + 473, + 546 + ], + "score": 1.0, + "content": "gression is non-monotonic in samples,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 309, + 545, + 474, + 556 + ], + "spans": [ + { + "bbox": [ + 309, + 545, + 474, + 556 + ], + "score": 1.0, + "content": "but optimally-regularized regression is", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 309, + 555, + 473, + 567 + ], + "spans": [ + { + "bbox": [ + 309, + 555, + 473, + 567 + ], + "score": 1.0, + "content": "monotonic. Note the optimal regulariza-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 309, + 567, + 474, + 578 + ], + "spans": [ + { + "bbox": [ + 309, + 567, + 327, + 578 + ], + "score": 1.0, + "content": "tion", + "type": "text" + }, + { + "bbox": [ + 327, + 567, + 335, + 576 + ], + "score": 0.62, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 567, + 474, + 578 + ], + "score": 1.0, + "content": "depends on the number of samples", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 310, + 578, + 322, + 590 + ], + "spans": [ + { + "bbox": [ + 310, + 580, + 317, + 587 + ], + "score": 0.43, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 578, + 322, + 590 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 23.5 + }, + { + "type": "image_caption", + "bbox": [ + 106, + 602, + 505, + 646 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 602, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 602, + 369, + 613 + ], + "score": 1.0, + "content": "Figure 2 shows one instance of this, for a particular choice of", + "type": "text" + }, + { + "bbox": [ + 369, + 603, + 378, + 612 + ], + "score": 0.8, + "content": "\\Sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 602, + 398, + 613 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 398, + 603, + 410, + 613 + ], + "score": 0.89, + "content": "\\beta ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 602, + 484, + 613 + ], + "score": 1.0, + "content": ". The covariance", + "type": "text" + }, + { + "bbox": [ + 485, + 603, + 493, + 612 + ], + "score": 0.81, + "content": "\\Sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 494, + 602, + 505, + 613 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 612, + 505, + 625 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 165, + 625 + ], + "score": 1.0, + "content": "diagonal, with", + "type": "text" + }, + { + "bbox": [ + 166, + 613, + 206, + 625 + ], + "score": 0.93, + "content": "\\Sigma _ { i , i } = 1 0", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 612, + 221, + 625 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 221, + 613, + 249, + 624 + ], + "score": 0.91, + "content": "i \\leq 1 5", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 612, + 267, + 625 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 267, + 613, + 302, + 625 + ], + "score": 0.93, + "content": "\\Sigma _ { i , i } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 612, + 317, + 625 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 317, + 613, + 345, + 623 + ], + "score": 0.9, + "content": "i > 1 5", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 612, + 505, + 625 + ], + "score": 1.0, + "content": ". That is, the covariance has one “large”", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 623, + 506, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 348, + 636 + ], + "score": 1.0, + "content": "eigenspace and one “small” eigenspace. The ground-truth", + "type": "text" + }, + { + "bbox": [ + 348, + 623, + 426, + 635 + ], + "score": 0.92, + "content": "\\beta ^ { * } = 0 . 1 \\vec { e _ { 1 } } + e _ { 3 0 } ^ { }", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 623, + 506, + 636 + ], + "score": 1.0, + "content": ", which lies almost", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 635, + 416, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 635, + 272, + 648 + ], + "score": 1.0, + "content": "entirely within the “small” eigenspace of", + "type": "text" + }, + { + "bbox": [ + 272, + 635, + 280, + 645 + ], + "score": 0.67, + "content": "\\Sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 635, + 378, + 648 + ], + "score": 1.0, + "content": ". The noise parameter is", + "type": "text" + }, + { + "bbox": [ + 378, + 636, + 411, + 645 + ], + "score": 0.87, + "content": "\\sigma = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 635, + 416, + 648 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 29.5 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 107, + 653, + 505, + 709 + ], + "lines": [ + { + "bbox": [ + 105, + 652, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 652, + 261, + 667 + ], + "score": 1.0, + "content": "We see that unregularized regression", + "type": "text" + }, + { + "bbox": [ + 262, + 654, + 291, + 664 + ], + "score": 0.85, + "content": "\\lambda = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 652, + 505, + 667 + ], + "score": 1.0, + "content": ") actually undergoes “triple descent”2 in this setting,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 665, + 504, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 665, + 211, + 677 + ], + "score": 1.0, + "content": "with the first peak around", + "type": "text" + }, + { + "bbox": [ + 211, + 665, + 242, + 675 + ], + "score": 0.9, + "content": "n = 1 5", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 665, + 504, + 677 + ], + "score": 1.0, + "content": "samples due to the 15-dimensional large eigenspace, and the sec-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 676, + 505, + 688 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 155, + 688 + ], + "score": 1.0, + "content": "ond peak at", + "type": "text" + }, + { + "bbox": [ + 155, + 676, + 182, + 686 + ], + "score": 0.9, + "content": "n = d", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 676, + 505, + 688 + ], + "score": 1.0, + "content": ". In this setting, optimally-regularized ridge regression is empirically monotonic", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 686, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 481, + 700 + ], + "score": 1.0, + "content": "in samples (Figure 2). Unlike the isotropic setting of Section 2, the optimal ridge parameter", + "type": "text" + }, + { + "bbox": [ + 482, + 687, + 494, + 698 + ], + "score": 0.88, + "content": "\\lambda _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 686, + 505, + 700 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 697, + 343, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 331, + 711 + ], + "score": 1.0, + "content": "no longer a constant, but varies with number of samples", + "type": "text" + }, + { + "bbox": [ + 332, + 700, + 339, + 707 + ], + "score": 0.76, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 697, + 343, + 711 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 652, + 505, + 711 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 194 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "Random ReLU Features. We consider random ReLU features, in the random features framework", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 361, + 106 + ], + "score": 1.0, + "content": "of Rahimi & Recht (2008). For a given number of features", + "type": "text" + }, + { + "bbox": [ + 361, + 94, + 371, + 104 + ], + "score": 0.75, + "content": "D", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 93, + 477, + 106 + ], + "score": 1.0, + "content": ", and number of samples", + "type": "text" + }, + { + "bbox": [ + 477, + 96, + 485, + 104 + ], + "score": 0.72, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 93, + 505, + 106 + ], + "score": 1.0, + "content": ", the", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 103, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 104, + 103, + 505, + 118 + ], + "score": 1.0, + "content": "random feature classifier is obtained by performing regularized linear regression on the embedding√", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 115, + 506, + 130 + ], + "spans": [ + { + "bbox": [ + 106, + 117, + 182, + 129 + ], + "score": 0.9, + "content": "\\tilde { x } : = \\mathrm { R e L U } ( W x )", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 115, + 214, + 130 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 214, + 115, + 265, + 127 + ], + "score": 0.93, + "content": "W \\in \\mathbb { R } ^ { D \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 115, + 434, + 130 + ], + "score": 1.0, + "content": "is a matrix with each entry sampled i.i.d", + "type": "text" + }, + { + "bbox": [ + 435, + 115, + 486, + 129 + ], + "score": 0.93, + "content": "\\mathcal { N } ( 0 , 1 / \\sqrt { d } )", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 115, + 506, + 130 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 505, + 140 + ], + "score": 1.0, + "content": "ReLU applies pointwise. This is equivalent to a 2-layer fully-connected neural network with a", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 138, + 506, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 316, + 151 + ], + "score": 1.0, + "content": "frozen (randomly-initialized) first layer, trained with", + "type": "text" + }, + { + "bbox": [ + 316, + 139, + 326, + 150 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 138, + 506, + 151 + ], + "score": 1.0, + "content": "loss and weight decay. In Appendix A.4, we", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 149, + 506, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 506, + 163 + ], + "score": 1.0, + "content": "apply random features to Fashion-MNIST Xiao et al. (2017). From Appendix Figure 4a, we see that", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 161, + 504, + 173 + ], + "spans": [ + { + "bbox": [ + 106, + 161, + 335, + 173 + ], + "score": 1.0, + "content": "underregularized models are non-monotonic, but optimal", + "type": "text" + }, + { + "bbox": [ + 335, + 161, + 345, + 172 + ], + "score": 0.86, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 161, + 504, + 173 + ], + "score": 1.0, + "content": "regularization is monotonic in samples.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 104, + 171, + 506, + 185 + ], + "spans": [ + { + "bbox": [ + 104, + 171, + 262, + 185 + ], + "score": 1.0, + "content": "Moreover, the optimal ridge parameter", + "type": "text" + }, + { + "bbox": [ + 263, + 172, + 270, + 182 + ], + "score": 0.79, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 171, + 388, + 185 + ], + "score": 1.0, + "content": "appears to be constant for all", + "type": "text" + }, + { + "bbox": [ + 388, + 174, + 395, + 182 + ], + "score": 0.73, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 171, + 506, + 185 + ], + "score": 1.0, + "content": ", similar to our results from", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 182, + 247, + 195 + ], + "spans": [ + { + "bbox": [ + 106, + 182, + 247, + 195 + ], + "score": 1.0, + "content": "the isotropic setting in Theorem 1.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 4.5 + }, + { + "type": "title", + "bbox": [ + 108, + 208, + 258, + 219 + ], + "lines": [ + { + "bbox": [ + 106, + 207, + 260, + 220 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 260, + 220 + ], + "score": 1.0, + "content": "5.2 MODEL-SIZE MONOTONICITY", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 105, + 228, + 495, + 240 + ], + "lines": [ + { + "bbox": [ + 106, + 227, + 497, + 241 + ], + "spans": [ + { + "bbox": [ + 106, + 227, + 264, + 241 + ], + "score": 1.0, + "content": "Here we empirically show that optimal", + "type": "text" + }, + { + "bbox": [ + 264, + 229, + 273, + 240 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 274, + 227, + 497, + 241 + ], + "score": 1.0, + "content": "regularization can mitigate model-wise double descent.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 252, + 505, + 318 + ], + "lines": [ + { + "bbox": [ + 105, + 252, + 505, + 265 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 505, + 265 + ], + "score": 1.0, + "content": "Random ReLU Features. We consider the same experimental setup as in Section 5.1, but now fix", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 261, + 506, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 200, + 279 + ], + "score": 1.0, + "content": "the number of samples", + "type": "text" + }, + { + "bbox": [ + 200, + 266, + 208, + 274 + ], + "score": 0.64, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 261, + 375, + 279 + ], + "score": 1.0, + "content": ", and vary the number of random features", + "type": "text" + }, + { + "bbox": [ + 376, + 264, + 385, + 273 + ], + "score": 0.74, + "content": "D", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 261, + 506, + 279 + ], + "score": 1.0, + "content": ". This corresponds to varying", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 273, + 506, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 506, + 287 + ], + "score": 1.0, + "content": "the width of the corresponding 2-layer neural network. Figure 4b in Appendix A.4 shows the test", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 285, + 505, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 279, + 298 + ], + "score": 1.0, + "content": "error of the random features classifier, for", + "type": "text" + }, + { + "bbox": [ + 280, + 286, + 318, + 296 + ], + "score": 0.89, + "content": "n = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 285, + 505, + 298 + ], + "score": 1.0, + "content": "train samples and varying number of random", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 296, + 504, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 493, + 309 + ], + "score": 1.0, + "content": "features. We see that underregularized models undergo model-wise double descent, but optimal", + "type": "text" + }, + { + "bbox": [ + 494, + 297, + 504, + 307 + ], + "score": 0.84, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 307, + 264, + 319 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 264, + 319 + ], + "score": 1.0, + "content": "regularization prevents double descent.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 107, + 331, + 257, + 528 + ], + "lines": [ + { + "bbox": [ + 106, + 330, + 257, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 330, + 257, + 344 + ], + "score": 1.0, + "content": "Convolutional Neural Networks.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 341, + 258, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 341, + 258, + 354 + ], + "score": 1.0, + "content": "We follow the experimental setup of", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 353, + 258, + 365 + ], + "spans": [ + { + "bbox": [ + 106, + 353, + 258, + 365 + ], + "score": 1.0, + "content": "Nakkiran et al. (2020) for model-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 362, + 258, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 258, + 378 + ], + "score": 1.0, + "content": "wise double descent, and add varying", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 375, + 258, + 387 + ], + "spans": [ + { + "bbox": [ + 106, + 375, + 154, + 387 + ], + "score": 1.0, + "content": "amounts of", + "type": "text" + }, + { + "bbox": [ + 155, + 375, + 165, + 386 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 375, + 258, + 387 + ], + "score": 1.0, + "content": "regularization (weight", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 386, + 258, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 386, + 258, + 397 + ], + "score": 1.0, + "content": "decay). We chose the following set-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 396, + 258, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 258, + 408 + ], + "score": 1.0, + "content": "ting from Nakkiran et al. (2020), be-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 408, + 258, + 420 + ], + "spans": [ + { + "bbox": [ + 106, + 408, + 258, + 420 + ], + "score": 1.0, + "content": "cause it exhibits double descent even", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 419, + 258, + 430 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 258, + 430 + ], + "score": 1.0, + "content": "with no added label noise. We con-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 429, + 258, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 429, + 258, + 442 + ], + "score": 1.0, + "content": "sider the same family of 5-layer con-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 441, + 258, + 452 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 258, + 452 + ], + "score": 1.0, + "content": "volutional neural networks (CNNs)", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 451, + 258, + 464 + ], + "spans": [ + { + "bbox": [ + 106, + 451, + 258, + 464 + ], + "score": 1.0, + "content": "from Nakkiran et al. (2020), con-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 463, + 258, + 474 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 258, + 474 + ], + "score": 1.0, + "content": "sisting of 4 convolutional layers of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 474, + 257, + 486 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 136, + 486 + ], + "score": 1.0, + "content": "widths", + "type": "text" + }, + { + "bbox": [ + 136, + 474, + 192, + 486 + ], + "score": 0.92, + "content": "[ k , 2 k , 4 k , 8 k ]", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 474, + 240, + 486 + ], + "score": 1.0, + "content": "for varying", + "type": "text" + }, + { + "bbox": [ + 240, + 474, + 257, + 484 + ], + "score": 0.84, + "content": "k \\in", + "type": "inline_equation" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 484, + 257, + 496 + ], + "spans": [ + { + "bbox": [ + 106, + 485, + 115, + 495 + ], + "score": 0.39, + "content": "\\mathbb { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 484, + 257, + 496 + ], + "score": 1.0, + "content": ". We train and test on CIFAR-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 495, + 257, + 507 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 257, + 507 + ], + "score": 1.0, + "content": "100 (Krizhevsky et al., 2009), an im-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 507, + 258, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 258, + 518 + ], + "score": 1.0, + "content": "age classification problem with 100", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 518, + 258, + 529 + ], + "spans": [ + { + "bbox": [ + 106, + 518, + 258, + 529 + ], + "score": 1.0, + "content": "classes. Inputs are normalized to", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 26.5 + }, + { + "type": "image", + "bbox": [ + 279, + 348, + 489, + 469 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 279, + 348, + 489, + 469 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 279, + 348, + 489, + 469 + ], + "spans": [ + { + "bbox": [ + 279, + 348, + 489, + 469 + ], + "score": 0.969, + "type": "image", + "image_path": "b59ffa519889838486fdb1bea9435eca85527fcc4c5ff780a6f8610321941a4b.jpg" + } + ] + } + ], + "index": 40, + "virtual_lines": [ + { + "bbox": [ + 279, + 348, + 489, + 361.44444444444446 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 279, + 361.44444444444446, + 489, + 374.8888888888889 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 279, + 374.8888888888889, + 489, + 388.33333333333337 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 279, + 388.33333333333337, + 489, + 401.7777777777778 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 279, + 401.7777777777778, + 489, + 415.2222222222223 + ], + "spans": [], + "index": 40 + }, + { + "bbox": [ + 279, + 415.2222222222223, + 489, + 428.66666666666674 + ], + "spans": [], + "index": 41 + }, + { + "bbox": [ + 279, + 428.66666666666674, + 489, + 442.1111111111112 + ], + "spans": [], + "index": 42 + }, + { + "bbox": [ + 279, + 442.1111111111112, + 489, + 455.55555555555566 + ], + "spans": [], + "index": 43 + }, + { + "bbox": [ + 279, + 455.55555555555566, + 489, + 469.0000000000001 + ], + "spans": [], + "index": 44 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 264, + 481, + 504, + 515 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 263, + 479, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 263, + 479, + 506, + 495 + ], + "score": 1.0, + "content": "Figure 3: Test Error vs. Model Size for 5-layer CNNs on", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 264, + 492, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 264, + 492, + 341, + 505 + ], + "score": 1.0, + "content": "CIFAR-100, with", + "type": "text" + }, + { + "bbox": [ + 342, + 493, + 352, + 504 + ], + "score": 0.85, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 492, + 505, + 505 + ], + "score": 1.0, + "content": "regularization (weight decay). Note", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 264, + 504, + 453, + 516 + ], + "spans": [ + { + "bbox": [ + 264, + 504, + 387, + 516 + ], + "score": 1.0, + "content": "that the optimal regularization", + "type": "text" + }, + { + "bbox": [ + 388, + 504, + 395, + 513 + ], + "score": 0.76, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 504, + 442, + 516 + ], + "score": 1.0, + "content": "varies with", + "type": "text" + }, + { + "bbox": [ + 442, + 506, + 449, + 513 + ], + "score": 0.74, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 504, + 453, + 516 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46 + } + ], + "index": 43.0 + }, + { + "type": "text", + "bbox": [ + 107, + 528, + 505, + 618 + ], + "lines": [ + { + "bbox": [ + 107, + 527, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 107, + 528, + 140, + 540 + ], + "score": 0.92, + "content": "[ - 1 , 1 ] ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 527, + 506, + 542 + ], + "score": 1.0, + "content": ", and we use standard data-augmentation of random horizontal flip and random crop with 4-", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 538, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 505, + 554 + ], + "score": 1.0, + "content": "pixel padding. All models are trained using Stochastic Gradient Descent (SGD) on the cross-entropy", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 550, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 185, + 565 + ], + "score": 1.0, + "content": "loss, with step size", + "type": "text" + }, + { + "bbox": [ + 186, + 550, + 267, + 564 + ], + "score": 0.92, + "content": "0 . 1 / \\sqrt { \\lfloor { T / 5 1 2 } \\rfloor + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 551, + 297, + 565 + ], + "score": 1.0, + "content": "at step", + "type": "text" + }, + { + "bbox": [ + 298, + 552, + 306, + 562 + ], + "score": 0.6, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 551, + 505, + 565 + ], + "score": 1.0, + "content": ". We train for 1e6 gradient steps, and use weight", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 563, + 505, + 575 + ], + "spans": [ + { + "bbox": [ + 106, + 563, + 132, + 575 + ], + "score": 1.0, + "content": "decay", + "type": "text" + }, + { + "bbox": [ + 132, + 563, + 140, + 573 + ], + "score": 0.73, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 563, + 187, + 575 + ], + "score": 1.0, + "content": "for varying", + "type": "text" + }, + { + "bbox": [ + 187, + 564, + 195, + 573 + ], + "score": 0.62, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 563, + 366, + 575 + ], + "score": 1.0, + "content": ". Due to optimization instabilities for large", + "type": "text" + }, + { + "bbox": [ + 366, + 563, + 373, + 573 + ], + "score": 0.72, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 563, + 505, + 575 + ], + "score": 1.0, + "content": ", we use the model with the min-", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 574, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 574, + 505, + 586 + ], + "score": 1.0, + "content": "imum train loss among the last 5K gradient steps. Figure 3 shows the test error of these models on", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 105, + 584, + 506, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 584, + 506, + 597 + ], + "score": 1.0, + "content": "CIFAR-100. Although unregularized and under-reguarized models exhibit double descent, the test", + "type": "text" + } + ], + "index": 53 + }, + { + "bbox": [ + 105, + 596, + 504, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 496, + 608 + ], + "score": 1.0, + "content": "error of optimally-regularized models is largely monotonic. Note that the optimal regularization", + "type": "text" + }, + { + "bbox": [ + 497, + 596, + 504, + 606 + ], + "score": 0.75, + "content": "\\lambda", + "type": "inline_equation" + } + ], + "index": 54 + }, + { + "bbox": [ + 106, + 607, + 448, + 619 + ], + "spans": [ + { + "bbox": [ + 106, + 607, + 448, + 619 + ], + "score": 1.0, + "content": "varies with the model size — no single regularization value is optimal for all models.", + "type": "text" + } + ], + "index": 55 + } + ], + "index": 51.5 + }, + { + "type": "title", + "bbox": [ + 108, + 635, + 287, + 647 + ], + "lines": [ + { + "bbox": [ + 104, + 632, + 289, + 650 + ], + "spans": [ + { + "bbox": [ + 104, + 632, + 289, + 650 + ], + "score": 1.0, + "content": "6 DISCUSSION AND CONCLUSION", + "type": "text" + } + ], + "index": 56 + } + ], + "index": 56 + }, + { + "type": "text", + "bbox": [ + 107, + 659, + 505, + 693 + ], + "lines": [ + { + "bbox": [ + 105, + 659, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 505, + 672 + ], + "score": 1.0, + "content": "In this work, we study the double descent phenomenon in the context of optimal regularization. We", + "type": "text" + } + ], + "index": 57 + }, + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "score": 1.0, + "content": "show that, while unregularized or under-regularized models often have non-monotonic behavior,", + "type": "text" + } + ], + "index": 58 + }, + { + "bbox": [ + 105, + 682, + 312, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 312, + 693 + ], + "score": 1.0, + "content": "appropriate regularization can eliminate this effect.", + "type": "text" + } + ], + "index": 59 + } + ], + "index": 58 + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "Theoretically, we prove that for certain linear regression models with isotropic covariates, optimally-", + "type": "text" + } + ], + "index": 60 + }, + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 131, + 722 + ], + "score": 1.0, + "content": "tuned", + "type": "text" + }, + { + "bbox": [ + 132, + 710, + 142, + 721 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 710, + 506, + 722 + ], + "score": 1.0, + "content": "regularization achieves monotonic test performance as we grow either the sample size or", + "type": "text" + } + ], + "index": 61 + }, + { + "bbox": [ + 106, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "the model size. These are the first non-asymptotic monotonicity results we are aware of in linear", + "type": "text" + } + ], + "index": 62 + } + ], + "index": 61 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 292, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 761 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 761 + ], + "score": 1.0, + "content": "8", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 194 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "Random ReLU Features. We consider random ReLU features, in the random features framework", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 361, + 106 + ], + "score": 1.0, + "content": "of Rahimi & Recht (2008). For a given number of features", + "type": "text" + }, + { + "bbox": [ + 361, + 94, + 371, + 104 + ], + "score": 0.75, + "content": "D", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 93, + 477, + 106 + ], + "score": 1.0, + "content": ", and number of samples", + "type": "text" + }, + { + "bbox": [ + 477, + 96, + 485, + 104 + ], + "score": 0.72, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 93, + 505, + 106 + ], + "score": 1.0, + "content": ", the", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 103, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 104, + 103, + 505, + 118 + ], + "score": 1.0, + "content": "random feature classifier is obtained by performing regularized linear regression on the embedding√", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 115, + 506, + 130 + ], + "spans": [ + { + "bbox": [ + 106, + 117, + 182, + 129 + ], + "score": 0.9, + "content": "\\tilde { x } : = \\mathrm { R e L U } ( W x )", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 115, + 214, + 130 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 214, + 115, + 265, + 127 + ], + "score": 0.93, + "content": "W \\in \\mathbb { R } ^ { D \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 115, + 434, + 130 + ], + "score": 1.0, + "content": "is a matrix with each entry sampled i.i.d", + "type": "text" + }, + { + "bbox": [ + 435, + 115, + 486, + 129 + ], + "score": 0.93, + "content": "\\mathcal { N } ( 0 , 1 / \\sqrt { d } )", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 115, + 506, + 130 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 505, + 140 + ], + "score": 1.0, + "content": "ReLU applies pointwise. This is equivalent to a 2-layer fully-connected neural network with a", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 138, + 506, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 316, + 151 + ], + "score": 1.0, + "content": "frozen (randomly-initialized) first layer, trained with", + "type": "text" + }, + { + "bbox": [ + 316, + 139, + 326, + 150 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 138, + 506, + 151 + ], + "score": 1.0, + "content": "loss and weight decay. In Appendix A.4, we", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 149, + 506, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 506, + 163 + ], + "score": 1.0, + "content": "apply random features to Fashion-MNIST Xiao et al. (2017). From Appendix Figure 4a, we see that", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 161, + 504, + 173 + ], + "spans": [ + { + "bbox": [ + 106, + 161, + 335, + 173 + ], + "score": 1.0, + "content": "underregularized models are non-monotonic, but optimal", + "type": "text" + }, + { + "bbox": [ + 335, + 161, + 345, + 172 + ], + "score": 0.86, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 161, + 504, + 173 + ], + "score": 1.0, + "content": "regularization is monotonic in samples.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 104, + 171, + 506, + 185 + ], + "spans": [ + { + "bbox": [ + 104, + 171, + 262, + 185 + ], + "score": 1.0, + "content": "Moreover, the optimal ridge parameter", + "type": "text" + }, + { + "bbox": [ + 263, + 172, + 270, + 182 + ], + "score": 0.79, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 171, + 388, + 185 + ], + "score": 1.0, + "content": "appears to be constant for all", + "type": "text" + }, + { + "bbox": [ + 388, + 174, + 395, + 182 + ], + "score": 0.73, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 171, + 506, + 185 + ], + "score": 1.0, + "content": ", similar to our results from", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 182, + 247, + 195 + ], + "spans": [ + { + "bbox": [ + 106, + 182, + 247, + 195 + ], + "score": 1.0, + "content": "the isotropic setting in Theorem 1.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 4.5, + "bbox_fs": [ + 104, + 82, + 506, + 195 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 208, + 258, + 219 + ], + "lines": [ + { + "bbox": [ + 106, + 207, + 260, + 220 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 260, + 220 + ], + "score": 1.0, + "content": "5.2 MODEL-SIZE MONOTONICITY", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 105, + 228, + 495, + 240 + ], + "lines": [ + { + "bbox": [ + 106, + 227, + 497, + 241 + ], + "spans": [ + { + "bbox": [ + 106, + 227, + 264, + 241 + ], + "score": 1.0, + "content": "Here we empirically show that optimal", + "type": "text" + }, + { + "bbox": [ + 264, + 229, + 273, + 240 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 274, + 227, + 497, + 241 + ], + "score": 1.0, + "content": "regularization can mitigate model-wise double descent.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11, + "bbox_fs": [ + 106, + 227, + 497, + 241 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 252, + 505, + 318 + ], + "lines": [ + { + "bbox": [ + 105, + 252, + 505, + 265 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 505, + 265 + ], + "score": 1.0, + "content": "Random ReLU Features. We consider the same experimental setup as in Section 5.1, but now fix", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 261, + 506, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 200, + 279 + ], + "score": 1.0, + "content": "the number of samples", + "type": "text" + }, + { + "bbox": [ + 200, + 266, + 208, + 274 + ], + "score": 0.64, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 261, + 375, + 279 + ], + "score": 1.0, + "content": ", and vary the number of random features", + "type": "text" + }, + { + "bbox": [ + 376, + 264, + 385, + 273 + ], + "score": 0.74, + "content": "D", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 261, + 506, + 279 + ], + "score": 1.0, + "content": ". This corresponds to varying", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 273, + 506, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 506, + 287 + ], + "score": 1.0, + "content": "the width of the corresponding 2-layer neural network. Figure 4b in Appendix A.4 shows the test", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 285, + 505, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 279, + 298 + ], + "score": 1.0, + "content": "error of the random features classifier, for", + "type": "text" + }, + { + "bbox": [ + 280, + 286, + 318, + 296 + ], + "score": 0.89, + "content": "n = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 285, + 505, + 298 + ], + "score": 1.0, + "content": "train samples and varying number of random", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 296, + 504, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 493, + 309 + ], + "score": 1.0, + "content": "features. We see that underregularized models undergo model-wise double descent, but optimal", + "type": "text" + }, + { + "bbox": [ + 494, + 297, + 504, + 307 + ], + "score": 0.84, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 307, + 264, + 319 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 264, + 319 + ], + "score": 1.0, + "content": "regularization prevents double descent.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 252, + 506, + 319 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 331, + 257, + 528 + ], + "lines": [ + { + "bbox": [ + 106, + 330, + 257, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 330, + 257, + 344 + ], + "score": 1.0, + "content": "Convolutional Neural Networks.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 341, + 258, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 341, + 258, + 354 + ], + "score": 1.0, + "content": "We follow the experimental setup of", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 353, + 258, + 365 + ], + "spans": [ + { + "bbox": [ + 106, + 353, + 258, + 365 + ], + "score": 1.0, + "content": "Nakkiran et al. (2020) for model-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 362, + 258, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 258, + 378 + ], + "score": 1.0, + "content": "wise double descent, and add varying", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 375, + 258, + 387 + ], + "spans": [ + { + "bbox": [ + 106, + 375, + 154, + 387 + ], + "score": 1.0, + "content": "amounts of", + "type": "text" + }, + { + "bbox": [ + 155, + 375, + 165, + 386 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 375, + 258, + 387 + ], + "score": 1.0, + "content": "regularization (weight", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 386, + 258, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 386, + 258, + 397 + ], + "score": 1.0, + "content": "decay). We chose the following set-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 396, + 258, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 258, + 408 + ], + "score": 1.0, + "content": "ting from Nakkiran et al. (2020), be-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 408, + 258, + 420 + ], + "spans": [ + { + "bbox": [ + 106, + 408, + 258, + 420 + ], + "score": 1.0, + "content": "cause it exhibits double descent even", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 419, + 258, + 430 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 258, + 430 + ], + "score": 1.0, + "content": "with no added label noise. We con-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 429, + 258, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 429, + 258, + 442 + ], + "score": 1.0, + "content": "sider the same family of 5-layer con-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 441, + 258, + 452 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 258, + 452 + ], + "score": 1.0, + "content": "volutional neural networks (CNNs)", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 451, + 258, + 464 + ], + "spans": [ + { + "bbox": [ + 106, + 451, + 258, + 464 + ], + "score": 1.0, + "content": "from Nakkiran et al. (2020), con-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 463, + 258, + 474 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 258, + 474 + ], + "score": 1.0, + "content": "sisting of 4 convolutional layers of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 474, + 257, + 486 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 136, + 486 + ], + "score": 1.0, + "content": "widths", + "type": "text" + }, + { + "bbox": [ + 136, + 474, + 192, + 486 + ], + "score": 0.92, + "content": "[ k , 2 k , 4 k , 8 k ]", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 474, + 240, + 486 + ], + "score": 1.0, + "content": "for varying", + "type": "text" + }, + { + "bbox": [ + 240, + 474, + 257, + 484 + ], + "score": 0.84, + "content": "k \\in", + "type": "inline_equation" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 484, + 257, + 496 + ], + "spans": [ + { + "bbox": [ + 106, + 485, + 115, + 495 + ], + "score": 0.39, + "content": "\\mathbb { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 484, + 257, + 496 + ], + "score": 1.0, + "content": ". We train and test on CIFAR-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 495, + 257, + 507 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 257, + 507 + ], + "score": 1.0, + "content": "100 (Krizhevsky et al., 2009), an im-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 507, + 258, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 258, + 518 + ], + "score": 1.0, + "content": "age classification problem with 100", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 518, + 258, + 529 + ], + "spans": [ + { + "bbox": [ + 106, + 518, + 258, + 529 + ], + "score": 1.0, + "content": "classes. Inputs are normalized to", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 330, + 258, + 529 + ] + }, + { + "type": "image", + "bbox": [ + 279, + 348, + 489, + 469 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 279, + 348, + 489, + 469 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 279, + 348, + 489, + 469 + ], + "spans": [ + { + "bbox": [ + 279, + 348, + 489, + 469 + ], + "score": 0.969, + "type": "image", + "image_path": "b59ffa519889838486fdb1bea9435eca85527fcc4c5ff780a6f8610321941a4b.jpg" + } + ] + } + ], + "index": 40, + "virtual_lines": [ + { + "bbox": [ + 279, + 348, + 489, + 361.44444444444446 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 279, + 361.44444444444446, + 489, + 374.8888888888889 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 279, + 374.8888888888889, + 489, + 388.33333333333337 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 279, + 388.33333333333337, + 489, + 401.7777777777778 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 279, + 401.7777777777778, + 489, + 415.2222222222223 + ], + "spans": [], + "index": 40 + }, + { + "bbox": [ + 279, + 415.2222222222223, + 489, + 428.66666666666674 + ], + "spans": [], + "index": 41 + }, + { + "bbox": [ + 279, + 428.66666666666674, + 489, + 442.1111111111112 + ], + "spans": [], + "index": 42 + }, + { + "bbox": [ + 279, + 442.1111111111112, + 489, + 455.55555555555566 + ], + "spans": [], + "index": 43 + }, + { + "bbox": [ + 279, + 455.55555555555566, + 489, + 469.0000000000001 + ], + "spans": [], + "index": 44 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 264, + 481, + 504, + 515 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 263, + 479, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 263, + 479, + 506, + 495 + ], + "score": 1.0, + "content": "Figure 3: Test Error vs. Model Size for 5-layer CNNs on", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 264, + 492, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 264, + 492, + 341, + 505 + ], + "score": 1.0, + "content": "CIFAR-100, with", + "type": "text" + }, + { + "bbox": [ + 342, + 493, + 352, + 504 + ], + "score": 0.85, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 492, + 505, + 505 + ], + "score": 1.0, + "content": "regularization (weight decay). Note", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 264, + 504, + 453, + 516 + ], + "spans": [ + { + "bbox": [ + 264, + 504, + 387, + 516 + ], + "score": 1.0, + "content": "that the optimal regularization", + "type": "text" + }, + { + "bbox": [ + 388, + 504, + 395, + 513 + ], + "score": 0.76, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 504, + 442, + 516 + ], + "score": 1.0, + "content": "varies with", + "type": "text" + }, + { + "bbox": [ + 442, + 506, + 449, + 513 + ], + "score": 0.74, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 504, + 453, + 516 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46 + } + ], + "index": 43.0 + }, + { + "type": "text", + "bbox": [ + 107, + 528, + 505, + 618 + ], + "lines": [ + { + "bbox": [ + 107, + 527, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 107, + 528, + 140, + 540 + ], + "score": 0.92, + "content": "[ - 1 , 1 ] ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 527, + 506, + 542 + ], + "score": 1.0, + "content": ", and we use standard data-augmentation of random horizontal flip and random crop with 4-", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 538, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 505, + 554 + ], + "score": 1.0, + "content": "pixel padding. All models are trained using Stochastic Gradient Descent (SGD) on the cross-entropy", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 550, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 185, + 565 + ], + "score": 1.0, + "content": "loss, with step size", + "type": "text" + }, + { + "bbox": [ + 186, + 550, + 267, + 564 + ], + "score": 0.92, + "content": "0 . 1 / \\sqrt { \\lfloor { T / 5 1 2 } \\rfloor + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 551, + 297, + 565 + ], + "score": 1.0, + "content": "at step", + "type": "text" + }, + { + "bbox": [ + 298, + 552, + 306, + 562 + ], + "score": 0.6, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 551, + 505, + 565 + ], + "score": 1.0, + "content": ". We train for 1e6 gradient steps, and use weight", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 563, + 505, + 575 + ], + "spans": [ + { + "bbox": [ + 106, + 563, + 132, + 575 + ], + "score": 1.0, + "content": "decay", + "type": "text" + }, + { + "bbox": [ + 132, + 563, + 140, + 573 + ], + "score": 0.73, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 563, + 187, + 575 + ], + "score": 1.0, + "content": "for varying", + "type": "text" + }, + { + "bbox": [ + 187, + 564, + 195, + 573 + ], + "score": 0.62, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 563, + 366, + 575 + ], + "score": 1.0, + "content": ". Due to optimization instabilities for large", + "type": "text" + }, + { + "bbox": [ + 366, + 563, + 373, + 573 + ], + "score": 0.72, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 563, + 505, + 575 + ], + "score": 1.0, + "content": ", we use the model with the min-", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 574, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 574, + 505, + 586 + ], + "score": 1.0, + "content": "imum train loss among the last 5K gradient steps. Figure 3 shows the test error of these models on", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 105, + 584, + 506, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 584, + 506, + 597 + ], + "score": 1.0, + "content": "CIFAR-100. Although unregularized and under-reguarized models exhibit double descent, the test", + "type": "text" + } + ], + "index": 53 + }, + { + "bbox": [ + 105, + 596, + 504, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 496, + 608 + ], + "score": 1.0, + "content": "error of optimally-regularized models is largely monotonic. Note that the optimal regularization", + "type": "text" + }, + { + "bbox": [ + 497, + 596, + 504, + 606 + ], + "score": 0.75, + "content": "\\lambda", + "type": "inline_equation" + } + ], + "index": 54 + }, + { + "bbox": [ + 106, + 607, + 448, + 619 + ], + "spans": [ + { + "bbox": [ + 106, + 607, + 448, + 619 + ], + "score": 1.0, + "content": "varies with the model size — no single regularization value is optimal for all models.", + "type": "text" + } + ], + "index": 55 + } + ], + "index": 51.5, + "bbox_fs": [ + 105, + 527, + 506, + 619 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 635, + 287, + 647 + ], + "lines": [ + { + "bbox": [ + 104, + 632, + 289, + 650 + ], + "spans": [ + { + "bbox": [ + 104, + 632, + 289, + 650 + ], + "score": 1.0, + "content": "6 DISCUSSION AND CONCLUSION", + "type": "text" + } + ], + "index": 56 + } + ], + "index": 56 + }, + { + "type": "text", + "bbox": [ + 107, + 659, + 505, + 693 + ], + "lines": [ + { + "bbox": [ + 105, + 659, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 505, + 672 + ], + "score": 1.0, + "content": "In this work, we study the double descent phenomenon in the context of optimal regularization. We", + "type": "text" + } + ], + "index": 57 + }, + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "score": 1.0, + "content": "show that, while unregularized or under-regularized models often have non-monotonic behavior,", + "type": "text" + } + ], + "index": 58 + }, + { + "bbox": [ + 105, + 682, + 312, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 312, + 693 + ], + "score": 1.0, + "content": "appropriate regularization can eliminate this effect.", + "type": "text" + } + ], + "index": 59 + } + ], + "index": 58, + "bbox_fs": [ + 105, + 659, + 505, + 693 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "Theoretically, we prove that for certain linear regression models with isotropic covariates, optimally-", + "type": "text" + } + ], + "index": 60 + }, + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 131, + 722 + ], + "score": 1.0, + "content": "tuned", + "type": "text" + }, + { + "bbox": [ + 132, + 710, + 142, + 721 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 710, + 506, + 722 + ], + "score": 1.0, + "content": "regularization achieves monotonic test performance as we grow either the sample size or", + "type": "text" + } + ], + "index": 61 + }, + { + "bbox": [ + 106, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "the model size. These are the first non-asymptotic monotonicity results we are aware of in linear", + "type": "text" + } + ], + "index": 62 + }, + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 380, + 95 + ], + "score": 1.0, + "content": "regression. We also demonstrate empirically that optimally-tuned", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 380, + 83, + 391, + 93 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 391, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "regularization can mitigate", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 506, + 106 + ], + "score": 1.0, + "content": "double descent for more general models, including neural networks. We hope that our results can", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 505, + 117 + ], + "score": 1.0, + "content": "motivate future work on mitigating the double descent phenomenon, and allow us to train high", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 116, + 426, + 127 + ], + "spans": [ + { + "bbox": [ + 105, + 116, + 426, + 127 + ], + "score": 1.0, + "content": "performance models which do not exhibit unexpected nonmonotonic behaviors.", + "type": "text", + "cross_page": true + } + ], + "index": 3 + } + ], + "index": 61, + "bbox_fs": [ + 106, + 698, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 126 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 380, + 95 + ], + "score": 1.0, + "content": "regression. We also demonstrate empirically that optimally-tuned", + "type": "text" + }, + { + "bbox": [ + 380, + 83, + 391, + 93 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "regularization can mitigate", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 506, + 106 + ], + "score": 1.0, + "content": "double descent for more general models, including neural networks. We hope that our results can", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 505, + 117 + ], + "score": 1.0, + "content": "motivate future work on mitigating the double descent phenomenon, and allow us to train high", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 116, + 426, + 127 + ], + "spans": [ + { + "bbox": [ + 105, + 116, + 426, + 127 + ], + "score": 1.0, + "content": "performance models which do not exhibit unexpected nonmonotonic behaviors.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "text", + "bbox": [ + 107, + 139, + 505, + 217 + ], + "lines": [ + { + "bbox": [ + 106, + 139, + 505, + 152 + ], + "spans": [ + { + "bbox": [ + 106, + 139, + 505, + 152 + ], + "score": 1.0, + "content": "Open Questions. Our work suggests a number of natural open questions. First, it is open to", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 150, + 505, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 505, + 163 + ], + "score": 1.0, + "content": "prove (or disprove) that optimal ridge regression is sample-monotonic for non-isotropic Gaussian", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 161, + 505, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 161, + 505, + 174 + ], + "score": 1.0, + "content": "covariates. We conjecture that it is, and outline a potential route to proving this (via Conjectures 1", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 172, + 506, + 186 + ], + "spans": [ + { + "bbox": [ + 105, + 172, + 506, + 186 + ], + "score": 1.0, + "content": "and 2 in the Appendix). Second, more broadly, it is open to prove sample-wise or model-wise", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 183, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 183, + 505, + 196 + ], + "score": 1.0, + "content": "monotonicity for more general (non-linear) models with appropriate regularizers. Finally, it is open", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 194, + 506, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 506, + 208 + ], + "score": 1.0, + "content": "to understand why large neural networks in practice are often sample-monotonic in realistic regimes", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 205, + 356, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 205, + 356, + 218 + ], + "score": 1.0, + "content": "of sample sizes, even without careful choice of regularization.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7 + }, + { + "type": "title", + "bbox": [ + 107, + 234, + 175, + 245 + ], + "lines": [ + { + "bbox": [ + 106, + 234, + 176, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 176, + 246 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 105, + 248, + 506, + 724 + ], + "lines": [ + { + "bbox": [ + 105, + 252, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 505, + 266 + ], + "score": 1.0, + "content": "Madhu S Advani and Andrew M Saxe. High-dimensional dynamics of generalization error in neural", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 263, + 321, + 277 + ], + "spans": [ + { + "bbox": [ + 115, + 263, + 321, + 277 + ], + "score": 1.0, + "content": "networks. arXiv preprint arXiv:1710.03667, 2017.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 282, + 505, + 298 + ], + "spans": [ + { + "bbox": [ + 104, + 282, + 505, + 298 + ], + "score": 1.0, + "content": "Peter L Bartlett, Philip M Long, Gabor Lugosi, and Alexander Tsigler. Benign overfitting in linear ´", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 114, + 293, + 326, + 308 + ], + "spans": [ + { + "bbox": [ + 114, + 293, + 326, + 308 + ], + "score": 1.0, + "content": "regression. arXiv preprint arXiv:1906.11300, 2019.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 311, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 505, + 328 + ], + "score": 1.0, + "content": "Mikhail Belkin, Daniel Hsu, Siyuan Ma, and Soumik Mandal. Reconciling modern machine learning", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 324, + 406, + 338 + ], + "spans": [ + { + "bbox": [ + 115, + 324, + 406, + 338 + ], + "score": 1.0, + "content": "and the bias-variance trade-off. arXiv preprint arXiv:1812.11118, 2018.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 344, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 344, + 505, + 357 + ], + "score": 1.0, + "content": "Mikhail Belkin, Daniel Hsu, and Ji Xu. Two models of double descent for weak features. arXiv", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 113, + 355, + 254, + 367 + ], + "spans": [ + { + "bbox": [ + 113, + 355, + 254, + 367 + ], + "score": 1.0, + "content": "preprint arXiv:1903.07571, 2019.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 372, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 505, + 388 + ], + "score": 1.0, + "content": "Koby Bibas, Yaniv Fogel, and Meir Feder. A new look at an old problem: A universal learning", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 114, + 385, + 401, + 398 + ], + "spans": [ + { + "bbox": [ + 114, + 385, + 401, + 398 + ], + "score": 1.0, + "content": "approach to linear regression. arXiv preprint arXiv:1905.04708, 2019.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 403, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 505, + 419 + ], + "score": 1.0, + "content": "Stephane d’Ascoli, Levent Sagun, and Giulio Biroli. Triple descent and the two kinds of overfitting: ´", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 415, + 405, + 429 + ], + "spans": [ + { + "bbox": [ + 115, + 415, + 405, + 429 + ], + "score": 1.0, + "content": "Where & why do they appear? arXiv preprint arXiv:2006.03509, 2020.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 434, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 505, + 448 + ], + "score": 1.0, + "content": "Zeyu Deng, Abla Kammoun, and Christos Thrampoulidis. A model of double descent for high-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 446, + 441, + 459 + ], + "spans": [ + { + "bbox": [ + 115, + 446, + 441, + 459 + ], + "score": 1.0, + "content": "dimensional binary linear classification. arXiv preprint arXiv:1911.05822, 2019.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 464, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 506, + 479 + ], + "score": 1.0, + "content": "Michał Derezinski, Feynman Liang, and Michael W. Mahoney. Exact expressions for double descent ´", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 114, + 475, + 369, + 491 + ], + "spans": [ + { + "bbox": [ + 114, + 475, + 369, + 491 + ], + "score": 1.0, + "content": "and implicit regularization via surrogate random design, 2019.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 494, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 494, + 506, + 510 + ], + "score": 1.0, + "content": "Edgar Dobriban and Yue Sheng. Wonder: Weighted one-shot distributed ridge regression in high", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 506, + 330, + 519 + ], + "spans": [ + { + "bbox": [ + 115, + 506, + 330, + 519 + ], + "score": 1.0, + "content": "dimensions. arXiv preprint arXiv:1903.09321, 2019.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 525, + 505, + 539 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 505, + 539 + ], + "score": 1.0, + "content": "Edgar Dobriban, Stefan Wager, et al. High-dimensional asymptotics of prediction: Ridge regression", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 537, + 379, + 550 + ], + "spans": [ + { + "bbox": [ + 115, + 537, + 379, + 550 + ], + "score": 1.0, + "content": "and classification. The Annals of Statistics, 46(1):247–279, 2018.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 555, + 506, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 506, + 570 + ], + "score": 1.0, + "content": "Robert PW Duin. Small sample size generalization. In Proceedings of the Scandinavian Confer-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 567, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 115, + 567, + 505, + 579 + ], + "score": 1.0, + "content": "ence on Image Analysis, volume 2, pp. 957–964. PROCEEDINGS PUBLISHED BY VARIOUS", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 577, + 205, + 590 + ], + "spans": [ + { + "bbox": [ + 115, + 577, + 205, + 590 + ], + "score": 1.0, + "content": "PUBLISHERS, 1995.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 596, + 506, + 612 + ], + "spans": [ + { + "bbox": [ + 104, + 596, + 506, + 612 + ], + "score": 1.0, + "content": "Robert PW Duin. Classifiers in almost empty spaces. In Proceedings 15th International Conference", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 114, + 608, + 392, + 621 + ], + "spans": [ + { + "bbox": [ + 114, + 608, + 392, + 621 + ], + "score": 1.0, + "content": "on Pattern Recognition. ICPR-2000, volume 2, pp. 1–7. IEEE, 2000.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 627, + 506, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 506, + 642 + ], + "score": 1.0, + "content": "Mario Geiger, Arthur Jacot, Stefano Spigler, Franck Gabriel, Levent Sagun, Stephane d’Ascoli, ´", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 638, + 506, + 653 + ], + "spans": [ + { + "bbox": [ + 115, + 638, + 506, + 653 + ], + "score": 1.0, + "content": "Giulio Biroli, Clement Hongler, and Matthieu Wyart. Scaling description of generalization with ´", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 114, + 649, + 443, + 663 + ], + "spans": [ + { + "bbox": [ + 114, + 649, + 443, + 663 + ], + "score": 1.0, + "content": "number of parameters in deep learning. arXiv preprint arXiv:1901.01608, 2019a.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 669, + 506, + 682 + ], + "spans": [ + { + "bbox": [ + 106, + 669, + 506, + 682 + ], + "score": 1.0, + "content": "Mario Geiger, Stefano Spigler, Stephane d’Ascoli, Levent Sagun, Marco Baity-Jesi, Giulio Biroli, ´", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 114, + 678, + 506, + 694 + ], + "spans": [ + { + "bbox": [ + 114, + 678, + 506, + 694 + ], + "score": 1.0, + "content": "and Matthieu Wyart. Jamming transition as a paradigm to understand the loss landscape of deep", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 691, + 358, + 704 + ], + "spans": [ + { + "bbox": [ + 115, + 691, + 358, + 704 + ], + "score": 1.0, + "content": "neural networks. Physical Review E, 100(1):012115, 2019b.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 708, + 504, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 504, + 723 + ], + "score": 1.0, + "content": "Trevor Hastie, Andrea Montanari, Saharon Rosset, and Ryan J. Tibshirani. Surprises in high-", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 502, + 732 + ], + "lines": [ + { + "bbox": [ + 117, + 720, + 340, + 733 + ], + "spans": [ + { + "bbox": [ + 117, + 720, + 340, + 733 + ], + "score": 1.0, + "content": "dimensional ridgeless least squares interpolation, 2019.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 44 + } + ], + "page_idx": 8, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 292, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "9", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 126 + ], + "lines": [], + "index": 1.5, + "bbox_fs": [ + 105, + 82, + 506, + 127 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 139, + 505, + 217 + ], + "lines": [ + { + "bbox": [ + 106, + 139, + 505, + 152 + ], + "spans": [ + { + "bbox": [ + 106, + 139, + 505, + 152 + ], + "score": 1.0, + "content": "Open Questions. Our work suggests a number of natural open questions. First, it is open to", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 150, + 505, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 505, + 163 + ], + "score": 1.0, + "content": "prove (or disprove) that optimal ridge regression is sample-monotonic for non-isotropic Gaussian", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 161, + 505, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 161, + 505, + 174 + ], + "score": 1.0, + "content": "covariates. We conjecture that it is, and outline a potential route to proving this (via Conjectures 1", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 172, + 506, + 186 + ], + "spans": [ + { + "bbox": [ + 105, + 172, + 506, + 186 + ], + "score": 1.0, + "content": "and 2 in the Appendix). Second, more broadly, it is open to prove sample-wise or model-wise", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 183, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 183, + 505, + 196 + ], + "score": 1.0, + "content": "monotonicity for more general (non-linear) models with appropriate regularizers. Finally, it is open", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 194, + 506, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 506, + 208 + ], + "score": 1.0, + "content": "to understand why large neural networks in practice are often sample-monotonic in realistic regimes", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 205, + 356, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 205, + 356, + 218 + ], + "score": 1.0, + "content": "of sample sizes, even without careful choice of regularization.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 139, + 506, + 218 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 234, + 175, + 245 + ], + "lines": [ + { + "bbox": [ + 106, + 234, + 176, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 176, + 246 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "list", + "bbox": [ + 105, + 248, + 506, + 724 + ], + "lines": [ + { + "bbox": [ + 105, + 252, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 505, + 266 + ], + "score": 1.0, + "content": "Madhu S Advani and Andrew M Saxe. High-dimensional dynamics of generalization error in neural", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 263, + 321, + 277 + ], + "spans": [ + { + "bbox": [ + 115, + 263, + 321, + 277 + ], + "score": 1.0, + "content": "networks. arXiv preprint arXiv:1710.03667, 2017.", + "type": "text" + } + ], + "index": 13, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 282, + 505, + 298 + ], + "spans": [ + { + "bbox": [ + 104, + 282, + 505, + 298 + ], + "score": 1.0, + "content": "Peter L Bartlett, Philip M Long, Gabor Lugosi, and Alexander Tsigler. Benign overfitting in linear ´", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 293, + 326, + 308 + ], + "spans": [ + { + "bbox": [ + 114, + 293, + 326, + 308 + ], + "score": 1.0, + "content": "regression. arXiv preprint arXiv:1906.11300, 2019.", + "type": "text" + } + ], + "index": 15, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 311, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 505, + 328 + ], + "score": 1.0, + "content": "Mikhail Belkin, Daniel Hsu, Siyuan Ma, and Soumik Mandal. Reconciling modern machine learning", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 324, + 406, + 338 + ], + "spans": [ + { + "bbox": [ + 115, + 324, + 406, + 338 + ], + "score": 1.0, + "content": "and the bias-variance trade-off. arXiv preprint arXiv:1812.11118, 2018.", + "type": "text" + } + ], + "index": 17, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 344, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 344, + 505, + 357 + ], + "score": 1.0, + "content": "Mikhail Belkin, Daniel Hsu, and Ji Xu. Two models of double descent for weak features. arXiv", + "type": "text" + } + ], + "index": 18, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 355, + 254, + 367 + ], + "spans": [ + { + "bbox": [ + 113, + 355, + 254, + 367 + ], + "score": 1.0, + "content": "preprint arXiv:1903.07571, 2019.", + "type": "text" + } + ], + "index": 19, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 372, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 505, + 388 + ], + "score": 1.0, + "content": "Koby Bibas, Yaniv Fogel, and Meir Feder. A new look at an old problem: A universal learning", + "type": "text" + } + ], + "index": 20, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 385, + 401, + 398 + ], + "spans": [ + { + "bbox": [ + 114, + 385, + 401, + 398 + ], + "score": 1.0, + "content": "approach to linear regression. arXiv preprint arXiv:1905.04708, 2019.", + "type": "text" + } + ], + "index": 21, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 403, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 505, + 419 + ], + "score": 1.0, + "content": "Stephane d’Ascoli, Levent Sagun, and Giulio Biroli. Triple descent and the two kinds of overfitting: ´", + "type": "text" + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 415, + 405, + 429 + ], + "spans": [ + { + "bbox": [ + 115, + 415, + 405, + 429 + ], + "score": 1.0, + "content": "Where & why do they appear? arXiv preprint arXiv:2006.03509, 2020.", + "type": "text" + } + ], + "index": 23, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 434, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 505, + 448 + ], + "score": 1.0, + "content": "Zeyu Deng, Abla Kammoun, and Christos Thrampoulidis. A model of double descent for high-", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 446, + 441, + 459 + ], + "spans": [ + { + "bbox": [ + 115, + 446, + 441, + 459 + ], + "score": 1.0, + "content": "dimensional binary linear classification. arXiv preprint arXiv:1911.05822, 2019.", + "type": "text" + } + ], + "index": 25, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 464, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 506, + 479 + ], + "score": 1.0, + "content": "Michał Derezinski, Feynman Liang, and Michael W. Mahoney. Exact expressions for double descent ´", + "type": "text" + } + ], + "index": 26, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 475, + 369, + 491 + ], + "spans": [ + { + "bbox": [ + 114, + 475, + 369, + 491 + ], + "score": 1.0, + "content": "and implicit regularization via surrogate random design, 2019.", + "type": "text" + } + ], + "index": 27, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 494, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 494, + 506, + 510 + ], + "score": 1.0, + "content": "Edgar Dobriban and Yue Sheng. Wonder: Weighted one-shot distributed ridge regression in high", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 506, + 330, + 519 + ], + "spans": [ + { + "bbox": [ + 115, + 506, + 330, + 519 + ], + "score": 1.0, + "content": "dimensions. arXiv preprint arXiv:1903.09321, 2019.", + "type": "text" + } + ], + "index": 29, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 525, + 505, + 539 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 505, + 539 + ], + "score": 1.0, + "content": "Edgar Dobriban, Stefan Wager, et al. High-dimensional asymptotics of prediction: Ridge regression", + "type": "text" + } + ], + "index": 30, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 537, + 379, + 550 + ], + "spans": [ + { + "bbox": [ + 115, + 537, + 379, + 550 + ], + "score": 1.0, + "content": "and classification. The Annals of Statistics, 46(1):247–279, 2018.", + "type": "text" + } + ], + "index": 31, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 555, + 506, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 506, + 570 + ], + "score": 1.0, + "content": "Robert PW Duin. Small sample size generalization. In Proceedings of the Scandinavian Confer-", + "type": "text" + } + ], + "index": 32, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 567, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 115, + 567, + 505, + 579 + ], + "score": 1.0, + "content": "ence on Image Analysis, volume 2, pp. 957–964. PROCEEDINGS PUBLISHED BY VARIOUS", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 577, + 205, + 590 + ], + "spans": [ + { + "bbox": [ + 115, + 577, + 205, + 590 + ], + "score": 1.0, + "content": "PUBLISHERS, 1995.", + "type": "text" + } + ], + "index": 34, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 596, + 506, + 612 + ], + "spans": [ + { + "bbox": [ + 104, + 596, + 506, + 612 + ], + "score": 1.0, + "content": "Robert PW Duin. Classifiers in almost empty spaces. In Proceedings 15th International Conference", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 608, + 392, + 621 + ], + "spans": [ + { + "bbox": [ + 114, + 608, + 392, + 621 + ], + "score": 1.0, + "content": "on Pattern Recognition. ICPR-2000, volume 2, pp. 1–7. IEEE, 2000.", + "type": "text" + } + ], + "index": 36, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 627, + 506, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 506, + 642 + ], + "score": 1.0, + "content": "Mario Geiger, Arthur Jacot, Stefano Spigler, Franck Gabriel, Levent Sagun, Stephane d’Ascoli, ´", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 638, + 506, + 653 + ], + "spans": [ + { + "bbox": [ + 115, + 638, + 506, + 653 + ], + "score": 1.0, + "content": "Giulio Biroli, Clement Hongler, and Matthieu Wyart. Scaling description of generalization with ´", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 114, + 649, + 443, + 663 + ], + "spans": [ + { + "bbox": [ + 114, + 649, + 443, + 663 + ], + "score": 1.0, + "content": "number of parameters in deep learning. arXiv preprint arXiv:1901.01608, 2019a.", + "type": "text" + } + ], + "index": 39, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 669, + 506, + 682 + ], + "spans": [ + { + "bbox": [ + 106, + 669, + 506, + 682 + ], + "score": 1.0, + "content": "Mario Geiger, Stefano Spigler, Stephane d’Ascoli, Levent Sagun, Marco Baity-Jesi, Giulio Biroli, ´", + "type": "text" + } + ], + "index": 40, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 678, + 506, + 694 + ], + "spans": [ + { + "bbox": [ + 114, + 678, + 506, + 694 + ], + "score": 1.0, + "content": "and Matthieu Wyart. Jamming transition as a paradigm to understand the loss landscape of deep", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 691, + 358, + 704 + ], + "spans": [ + { + "bbox": [ + 115, + 691, + 358, + 704 + ], + "score": 1.0, + "content": "neural networks. Physical Review E, 100(1):012115, 2019b.", + "type": "text" + } + ], + "index": 42, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 708, + 504, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 504, + 723 + ], + "score": 1.0, + "content": "Trevor Hastie, Andrea Montanari, Saharon Rosset, and Ryan J. Tibshirani. Surprises in high-", + "type": "text" + } + ], + "index": 43, + "is_list_start_line": true + } + ], + "index": 27.5, + "bbox_fs": [ + 104, + 252, + 506, + 723 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 502, + 732 + ], + "lines": [ + { + "bbox": [ + 117, + 720, + 340, + 733 + ], + "spans": [ + { + "bbox": [ + 117, + 720, + 340, + 733 + ], + "score": 1.0, + "content": "dimensional ridgeless least squares interpolation, 2019.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 44, + "bbox_fs": [ + 117, + 720, + 340, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 505, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 505, + 97 + ], + "score": 1.0, + "content": "Roger A Horn, Roger A Horn, and Charles R Johnson. Matrix Analysis. Cambridge University", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 92, + 168, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 92, + 168, + 106 + ], + "score": 1.0, + "content": "Press, 1990.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 112, + 503, + 145 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 505, + 125 + ], + "score": 1.0, + "content": "Dmitry Kobak, Jonathan Lomond, and Benoit Sanchez. Optimal ridge penalty for real-world high-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 115, + 123, + 505, + 136 + ], + "score": 1.0, + "content": "dimensional data can be zero or negative due to the implicit ridge regularization. arXiv preprint", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 134, + 219, + 145 + ], + "spans": [ + { + "bbox": [ + 115, + 134, + 219, + 145 + ], + "score": 1.0, + "content": "arXiv:1805.10939, 2018.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 105, + 152, + 503, + 176 + ], + "lines": [ + { + "bbox": [ + 105, + 151, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 505, + 167 + ], + "score": 1.0, + "content": "Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 114, + 162, + 143, + 177 + ], + "spans": [ + { + "bbox": [ + 114, + 162, + 143, + 177 + ], + "score": 1.0, + "content": "2009.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 106, + 182, + 504, + 205 + ], + "lines": [ + { + "bbox": [ + 106, + 182, + 505, + 195 + ], + "spans": [ + { + "bbox": [ + 106, + 182, + 505, + 195 + ], + "score": 1.0, + "content": "Andrew K Lampinen and Surya Ganguli. An analytic theory of generalization dynamics and transfer", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 193, + 413, + 206 + ], + "spans": [ + { + "bbox": [ + 115, + 193, + 413, + 206 + ], + "score": 1.0, + "content": "learning in deep linear networks. arXiv preprint arXiv:1809.10374, 2018.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 106, + 212, + 504, + 235 + ], + "lines": [ + { + "bbox": [ + 107, + 211, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 107, + 211, + 505, + 225 + ], + "score": 1.0, + "content": "Yann Le Cun, Ido Kanter, and Sara A Solla. Eigenvalues of covariance matrices: Application to", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 223, + 398, + 235 + ], + "spans": [ + { + "bbox": [ + 116, + 223, + 398, + 235 + ], + "score": 1.0, + "content": "neural-network learning. Physical Review Letters, 66(18):2396, 1991.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 107, + 241, + 503, + 265 + ], + "lines": [ + { + "bbox": [ + 106, + 240, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 106, + 240, + 505, + 254 + ], + "score": 1.0, + "content": "Yann LeCun, Ido Kanter, and Sara A Solla. Second order properties of error surfaces: Learning time", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 253, + 496, + 265 + ], + "spans": [ + { + "bbox": [ + 116, + 253, + 496, + 265 + ], + "score": 1.0, + "content": "and generalization. In Advances in neural information processing systems, pp. 918–924, 1991.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 106, + 271, + 504, + 294 + ], + "lines": [ + { + "bbox": [ + 105, + 271, + 505, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 271, + 505, + 285 + ], + "score": 1.0, + "content": "Tengyuan Liang and Alexander Rakhlin. Just interpolate: Kernel” ridgeless” regression can gener-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 282, + 303, + 295 + ], + "spans": [ + { + "bbox": [ + 116, + 282, + 303, + 295 + ], + "score": 1.0, + "content": "alize. arXiv preprint arXiv:1808.00387, 2018.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 300, + 504, + 324 + ], + "lines": [ + { + "bbox": [ + 106, + 300, + 504, + 313 + ], + "spans": [ + { + "bbox": [ + 106, + 300, + 504, + 313 + ], + "score": 1.0, + "content": "Tengyuan Liang, Alexander Rakhlin, and Xiyu Zhai. On the risk of minimum-norm interpolants", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 312, + 443, + 325 + ], + "spans": [ + { + "bbox": [ + 115, + 312, + 443, + 325 + ], + "score": 1.0, + "content": "and restricted lower isometry of kernels. arXiv preprint arXiv:1908.10292, 2019.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 105, + 330, + 504, + 354 + ], + "lines": [ + { + "bbox": [ + 106, + 330, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 330, + 505, + 344 + ], + "score": 1.0, + "content": "Tengyuan Liang, Alexander Rakhlin, and Xiyu Zhai. On the multiple descent of minimum-norm", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 342, + 355, + 354 + ], + "spans": [ + { + "bbox": [ + 115, + 342, + 355, + 354 + ], + "score": 1.0, + "content": "interpolants and restricted lower isometry of kernels. 2020.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 108, + 360, + 503, + 395 + ], + "lines": [ + { + "bbox": [ + 106, + 361, + 505, + 373 + ], + "spans": [ + { + "bbox": [ + 106, + 361, + 505, + 373 + ], + "score": 1.0, + "content": "Marco Loog and Robert PW Duin. The dipping phenomenon. In Joint IAPR International Work-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 371, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 116, + 371, + 505, + 384 + ], + "score": 1.0, + "content": "shops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 383, + 318, + 395 + ], + "spans": [ + { + "bbox": [ + 116, + 383, + 318, + 395 + ], + "score": 1.0, + "content": "Recognition (SSPR), pp. 310–317. Springer, 2012.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 401, + 502, + 425 + ], + "lines": [ + { + "bbox": [ + 106, + 401, + 504, + 414 + ], + "spans": [ + { + "bbox": [ + 106, + 401, + 504, + 414 + ], + "score": 1.0, + "content": "Marco Loog, Tom Viering, and Alexander Mey. Minimizers of the empirical risk and risk mono-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 413, + 466, + 425 + ], + "spans": [ + { + "bbox": [ + 116, + 413, + 466, + 425 + ], + "score": 1.0, + "content": "tonicity. In Advances in Neural Information Processing Systems, pp. 7476–7485, 2019.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 106, + 430, + 503, + 454 + ], + "lines": [ + { + "bbox": [ + 107, + 432, + 504, + 443 + ], + "spans": [ + { + "bbox": [ + 107, + 432, + 504, + 443 + ], + "score": 1.0, + "content": "Yasaman Mahdaviyeh and Zacharie Naulet. Asymptotic risk of least squares minimum norm esti-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 442, + 444, + 454 + ], + "spans": [ + { + "bbox": [ + 115, + 442, + 444, + 454 + ], + "score": 1.0, + "content": "mator under the spike covariance model. arXiv preprint arXiv:1912.13421, 2019.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 105, + 460, + 504, + 484 + ], + "lines": [ + { + "bbox": [ + 106, + 460, + 506, + 473 + ], + "spans": [ + { + "bbox": [ + 106, + 460, + 506, + 473 + ], + "score": 1.0, + "content": "Adam W Marcus, Daniel A Spielman, and Nikhil Srivastava. Ramanujan graphs and the solution of", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 471, + 389, + 484 + ], + "spans": [ + { + "bbox": [ + 116, + 471, + 389, + 484 + ], + "score": 1.0, + "content": "the kadison-singer problem. arXiv preprint arXiv:1408.4421, 2014.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 105, + 490, + 504, + 513 + ], + "lines": [ + { + "bbox": [ + 105, + 490, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 490, + 505, + 504 + ], + "score": 1.0, + "content": "Song Mei and Andrea Montanari. The generalization error of random features regression: Precise", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 502, + 436, + 513 + ], + "spans": [ + { + "bbox": [ + 115, + 502, + 436, + 513 + ], + "score": 1.0, + "content": "asymptotics and double descent curve. arXiv preprint arXiv:1908.05355, 2019.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 104, + 520, + 504, + 543 + ], + "lines": [ + { + "bbox": [ + 106, + 520, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 520, + 505, + 533 + ], + "score": 1.0, + "content": "Partha P. Mitra. Understanding overfitting peaks in generalization error: Analytical risk curves for", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 531, + 374, + 544 + ], + "spans": [ + { + "bbox": [ + 116, + 531, + 374, + 544 + ], + "score": 1.0, + "content": "l2 and l1 penalized interpolation. ArXiv, abs/1906.03667, 2019.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 106, + 549, + 504, + 573 + ], + "lines": [ + { + "bbox": [ + 106, + 549, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 549, + 505, + 563 + ], + "score": 1.0, + "content": "Vidya Muthukumar, Kailas Vodrahalli, and Anant Sahai. Harmless interpolation of noisy data in", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 561, + 326, + 573 + ], + "spans": [ + { + "bbox": [ + 115, + 561, + 326, + 573 + ], + "score": 1.0, + "content": "regression. arXiv preprint arXiv:1903.09139, 2019.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 105, + 579, + 504, + 603 + ], + "lines": [ + { + "bbox": [ + 106, + 579, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 505, + 592 + ], + "score": 1.0, + "content": "Preetum Nakkiran. More data can hurt for linear regression: Sample-wise double descent. arXiv", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 591, + 254, + 603 + ], + "spans": [ + { + "bbox": [ + 115, + 591, + 254, + 603 + ], + "score": 1.0, + "content": "preprint arXiv:1912.07242, 2019.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 106, + 609, + 504, + 644 + ], + "lines": [ + { + "bbox": [ + 105, + 608, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 506, + 623 + ], + "score": 1.0, + "content": "Preetum Nakkiran, Gal Kaplun, Yamini Bansal, Tristan Yang, Boaz Barak, and Ilya Sutskever. Deep", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 620, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 116, + 620, + 505, + 633 + ], + "score": 1.0, + "content": "double descent: Where bigger models and more data hurt. In International Conference on Learn-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 632, + 505, + 644 + ], + "spans": [ + { + "bbox": [ + 116, + 632, + 434, + 644 + ], + "score": 1.0, + "content": "ing Representations, 2020. URL https://openreview.net/forum?id", + "type": "text" + }, + { + "bbox": [ + 435, + 633, + 441, + 641 + ], + "score": 0.45, + "content": "\\underline { { \\underline { { \\mathbf { \\Pi } } } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 632, + 505, + 644 + ], + "score": 1.0, + "content": "B1g5sA4twr.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 105, + 650, + 504, + 684 + ], + "lines": [ + { + "bbox": [ + 105, + 649, + 504, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 504, + 662 + ], + "score": 1.0, + "content": "Brady Neal, Sarthak Mittal, Aristide Baratin, Vinayak Tantia, Matthew Scicluna, Simon Lacoste-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 662, + 504, + 672 + ], + "spans": [ + { + "bbox": [ + 116, + 662, + 504, + 672 + ], + "score": 1.0, + "content": "Julien, and Ioannis Mitliagkas. A modern take on the bias-variance tradeoff in neural networks.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 672, + 279, + 684 + ], + "spans": [ + { + "bbox": [ + 116, + 672, + 279, + 684 + ], + "score": 1.0, + "content": "arXiv preprint arXiv:1810.08591, 2018.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 105, + 690, + 505, + 713 + ], + "lines": [ + { + "bbox": [ + 105, + 689, + 506, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 506, + 705 + ], + "score": 1.0, + "content": "Manfred Opper. Statistical mechanics of learning: Generalization. The Handbook of Brain Theory", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 702, + 272, + 713 + ], + "spans": [ + { + "bbox": [ + 116, + 702, + 272, + 713 + ], + "score": 1.0, + "content": "and Neural Networks, 922-925., 1995.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5 + }, + { + "type": "text", + "bbox": [ + 106, + 720, + 456, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 720, + 458, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 458, + 734 + ], + "score": 1.0, + "content": "Manfred Opper. Learning to generalize. Frontiers of Life, 3(part 2), pp.763-775., 2001.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 44 + } + ], + "page_idx": 9, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 292, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "10", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 505, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 505, + 97 + ], + "score": 1.0, + "content": "Roger A Horn, Roger A Horn, and Charles R Johnson. Matrix Analysis. Cambridge University", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 92, + 168, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 92, + 168, + 106 + ], + "score": 1.0, + "content": "Press, 1990.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 80, + 505, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 112, + 503, + 145 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 505, + 125 + ], + "score": 1.0, + "content": "Dmitry Kobak, Jonathan Lomond, and Benoit Sanchez. Optimal ridge penalty for real-world high-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 115, + 123, + 505, + 136 + ], + "score": 1.0, + "content": "dimensional data can be zero or negative due to the implicit ridge regularization. arXiv preprint", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 134, + 219, + 145 + ], + "spans": [ + { + "bbox": [ + 115, + 134, + 219, + 145 + ], + "score": 1.0, + "content": "arXiv:1805.10939, 2018.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 111, + 505, + 145 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 152, + 503, + 176 + ], + "lines": [ + { + "bbox": [ + 105, + 151, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 505, + 167 + ], + "score": 1.0, + "content": "Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 114, + 162, + 143, + 177 + ], + "spans": [ + { + "bbox": [ + 114, + 162, + 143, + 177 + ], + "score": 1.0, + "content": "2009.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 151, + 505, + 177 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 182, + 504, + 205 + ], + "lines": [ + { + "bbox": [ + 106, + 182, + 505, + 195 + ], + "spans": [ + { + "bbox": [ + 106, + 182, + 505, + 195 + ], + "score": 1.0, + "content": "Andrew K Lampinen and Surya Ganguli. An analytic theory of generalization dynamics and transfer", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 193, + 413, + 206 + ], + "spans": [ + { + "bbox": [ + 115, + 193, + 413, + 206 + ], + "score": 1.0, + "content": "learning in deep linear networks. arXiv preprint arXiv:1809.10374, 2018.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 106, + 182, + 505, + 206 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 212, + 504, + 235 + ], + "lines": [ + { + "bbox": [ + 107, + 211, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 107, + 211, + 505, + 225 + ], + "score": 1.0, + "content": "Yann Le Cun, Ido Kanter, and Sara A Solla. Eigenvalues of covariance matrices: Application to", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 223, + 398, + 235 + ], + "spans": [ + { + "bbox": [ + 116, + 223, + 398, + 235 + ], + "score": 1.0, + "content": "neural-network learning. Physical Review Letters, 66(18):2396, 1991.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 107, + 211, + 505, + 235 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 241, + 503, + 265 + ], + "lines": [ + { + "bbox": [ + 106, + 240, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 106, + 240, + 505, + 254 + ], + "score": 1.0, + "content": "Yann LeCun, Ido Kanter, and Sara A Solla. Second order properties of error surfaces: Learning time", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 253, + 496, + 265 + ], + "spans": [ + { + "bbox": [ + 116, + 253, + 496, + 265 + ], + "score": 1.0, + "content": "and generalization. In Advances in neural information processing systems, pp. 918–924, 1991.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 106, + 240, + 505, + 265 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 271, + 504, + 294 + ], + "lines": [ + { + "bbox": [ + 105, + 271, + 505, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 271, + 505, + 285 + ], + "score": 1.0, + "content": "Tengyuan Liang and Alexander Rakhlin. Just interpolate: Kernel” ridgeless” regression can gener-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 282, + 303, + 295 + ], + "spans": [ + { + "bbox": [ + 116, + 282, + 303, + 295 + ], + "score": 1.0, + "content": "alize. arXiv preprint arXiv:1808.00387, 2018.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 271, + 505, + 295 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 300, + 504, + 324 + ], + "lines": [ + { + "bbox": [ + 106, + 300, + 504, + 313 + ], + "spans": [ + { + "bbox": [ + 106, + 300, + 504, + 313 + ], + "score": 1.0, + "content": "Tengyuan Liang, Alexander Rakhlin, and Xiyu Zhai. On the risk of minimum-norm interpolants", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 312, + 443, + 325 + ], + "spans": [ + { + "bbox": [ + 115, + 312, + 443, + 325 + ], + "score": 1.0, + "content": "and restricted lower isometry of kernels. arXiv preprint arXiv:1908.10292, 2019.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 106, + 300, + 504, + 325 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 330, + 504, + 354 + ], + "lines": [ + { + "bbox": [ + 106, + 330, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 330, + 505, + 344 + ], + "score": 1.0, + "content": "Tengyuan Liang, Alexander Rakhlin, and Xiyu Zhai. On the multiple descent of minimum-norm", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 342, + 355, + 354 + ], + "spans": [ + { + "bbox": [ + 115, + 342, + 355, + 354 + ], + "score": 1.0, + "content": "interpolants and restricted lower isometry of kernels. 2020.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5, + "bbox_fs": [ + 106, + 330, + 505, + 354 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 360, + 503, + 395 + ], + "lines": [ + { + "bbox": [ + 106, + 361, + 505, + 373 + ], + "spans": [ + { + "bbox": [ + 106, + 361, + 505, + 373 + ], + "score": 1.0, + "content": "Marco Loog and Robert PW Duin. The dipping phenomenon. In Joint IAPR International Work-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 371, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 116, + 371, + 505, + 384 + ], + "score": 1.0, + "content": "shops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 383, + 318, + 395 + ], + "spans": [ + { + "bbox": [ + 116, + 383, + 318, + 395 + ], + "score": 1.0, + "content": "Recognition (SSPR), pp. 310–317. Springer, 2012.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20, + "bbox_fs": [ + 106, + 361, + 505, + 395 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 401, + 502, + 425 + ], + "lines": [ + { + "bbox": [ + 106, + 401, + 504, + 414 + ], + "spans": [ + { + "bbox": [ + 106, + 401, + 504, + 414 + ], + "score": 1.0, + "content": "Marco Loog, Tom Viering, and Alexander Mey. Minimizers of the empirical risk and risk mono-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 413, + 466, + 425 + ], + "spans": [ + { + "bbox": [ + 116, + 413, + 466, + 425 + ], + "score": 1.0, + "content": "tonicity. In Advances in Neural Information Processing Systems, pp. 7476–7485, 2019.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5, + "bbox_fs": [ + 106, + 401, + 504, + 425 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 430, + 503, + 454 + ], + "lines": [ + { + "bbox": [ + 107, + 432, + 504, + 443 + ], + "spans": [ + { + "bbox": [ + 107, + 432, + 504, + 443 + ], + "score": 1.0, + "content": "Yasaman Mahdaviyeh and Zacharie Naulet. Asymptotic risk of least squares minimum norm esti-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 442, + 444, + 454 + ], + "spans": [ + { + "bbox": [ + 115, + 442, + 444, + 454 + ], + "score": 1.0, + "content": "mator under the spike covariance model. arXiv preprint arXiv:1912.13421, 2019.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 107, + 432, + 504, + 454 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 460, + 504, + 484 + ], + "lines": [ + { + "bbox": [ + 106, + 460, + 506, + 473 + ], + "spans": [ + { + "bbox": [ + 106, + 460, + 506, + 473 + ], + "score": 1.0, + "content": "Adam W Marcus, Daniel A Spielman, and Nikhil Srivastava. Ramanujan graphs and the solution of", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 471, + 389, + 484 + ], + "spans": [ + { + "bbox": [ + 116, + 471, + 389, + 484 + ], + "score": 1.0, + "content": "the kadison-singer problem. arXiv preprint arXiv:1408.4421, 2014.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 106, + 460, + 506, + 484 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 490, + 504, + 513 + ], + "lines": [ + { + "bbox": [ + 105, + 490, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 490, + 505, + 504 + ], + "score": 1.0, + "content": "Song Mei and Andrea Montanari. The generalization error of random features regression: Precise", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 502, + 436, + 513 + ], + "spans": [ + { + "bbox": [ + 115, + 502, + 436, + 513 + ], + "score": 1.0, + "content": "asymptotics and double descent curve. arXiv preprint arXiv:1908.05355, 2019.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 490, + 505, + 513 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 520, + 504, + 543 + ], + "lines": [ + { + "bbox": [ + 106, + 520, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 520, + 505, + 533 + ], + "score": 1.0, + "content": "Partha P. Mitra. Understanding overfitting peaks in generalization error: Analytical risk curves for", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 531, + 374, + 544 + ], + "spans": [ + { + "bbox": [ + 116, + 531, + 374, + 544 + ], + "score": 1.0, + "content": "l2 and l1 penalized interpolation. ArXiv, abs/1906.03667, 2019.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5, + "bbox_fs": [ + 106, + 520, + 505, + 544 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 549, + 504, + 573 + ], + "lines": [ + { + "bbox": [ + 106, + 549, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 549, + 505, + 563 + ], + "score": 1.0, + "content": "Vidya Muthukumar, Kailas Vodrahalli, and Anant Sahai. Harmless interpolation of noisy data in", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 561, + 326, + 573 + ], + "spans": [ + { + "bbox": [ + 115, + 561, + 326, + 573 + ], + "score": 1.0, + "content": "regression. arXiv preprint arXiv:1903.09139, 2019.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 106, + 549, + 505, + 573 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 579, + 504, + 603 + ], + "lines": [ + { + "bbox": [ + 106, + 579, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 505, + 592 + ], + "score": 1.0, + "content": "Preetum Nakkiran. More data can hurt for linear regression: Sample-wise double descent. arXiv", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 591, + 254, + 603 + ], + "spans": [ + { + "bbox": [ + 115, + 591, + 254, + 603 + ], + "score": 1.0, + "content": "preprint arXiv:1912.07242, 2019.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5, + "bbox_fs": [ + 106, + 579, + 505, + 603 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 609, + 504, + 644 + ], + "lines": [ + { + "bbox": [ + 105, + 608, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 506, + 623 + ], + "score": 1.0, + "content": "Preetum Nakkiran, Gal Kaplun, Yamini Bansal, Tristan Yang, Boaz Barak, and Ilya Sutskever. Deep", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 620, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 116, + 620, + 505, + 633 + ], + "score": 1.0, + "content": "double descent: Where bigger models and more data hurt. In International Conference on Learn-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 632, + 505, + 644 + ], + "spans": [ + { + "bbox": [ + 116, + 632, + 434, + 644 + ], + "score": 1.0, + "content": "ing Representations, 2020. URL https://openreview.net/forum?id", + "type": "text" + }, + { + "bbox": [ + 435, + 633, + 441, + 641 + ], + "score": 0.45, + "content": "\\underline { { \\underline { { \\mathbf { \\Pi } } } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 632, + 505, + 644 + ], + "score": 1.0, + "content": "B1g5sA4twr.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 608, + 506, + 644 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 650, + 504, + 684 + ], + "lines": [ + { + "bbox": [ + 105, + 649, + 504, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 504, + 662 + ], + "score": 1.0, + "content": "Brady Neal, Sarthak Mittal, Aristide Baratin, Vinayak Tantia, Matthew Scicluna, Simon Lacoste-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 662, + 504, + 672 + ], + "spans": [ + { + "bbox": [ + 116, + 662, + 504, + 672 + ], + "score": 1.0, + "content": "Julien, and Ioannis Mitliagkas. A modern take on the bias-variance tradeoff in neural networks.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 672, + 279, + 684 + ], + "spans": [ + { + "bbox": [ + 116, + 672, + 279, + 684 + ], + "score": 1.0, + "content": "arXiv preprint arXiv:1810.08591, 2018.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 649, + 504, + 684 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 690, + 505, + 713 + ], + "lines": [ + { + "bbox": [ + 105, + 689, + 506, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 506, + 705 + ], + "score": 1.0, + "content": "Manfred Opper. Statistical mechanics of learning: Generalization. The Handbook of Brain Theory", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 702, + 272, + 713 + ], + "spans": [ + { + "bbox": [ + 116, + 702, + 272, + 713 + ], + "score": 1.0, + "content": "and Neural Networks, 922-925., 1995.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5, + "bbox_fs": [ + 105, + 689, + 506, + 713 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 720, + 456, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 720, + 458, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 458, + 734 + ], + "score": 1.0, + "content": "Manfred Opper. Learning to generalize. Frontiers of Life, 3(part 2), pp.763-775., 2001.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 44, + "bbox_fs": [ + 105, + 720, + 458, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Ali Rahimi and Benjamin Recht. Random features for large-scale kernel machines. In Advances in", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 94, + 365, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 94, + 365, + 106 + ], + "score": 1.0, + "content": "neural information processing systems, pp. 1177–1184, 2008.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 111, + 504, + 135 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 505, + 125 + ], + "score": 1.0, + "content": "Marina Skurichina and Robert PW Duin. Bagging, boosting and the random subspace method for", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 123, + 404, + 136 + ], + "spans": [ + { + "bbox": [ + 115, + 123, + 404, + 136 + ], + "score": 1.0, + "content": "linear classifiers. Pattern Analysis & Applications, 5(2):121–135, 2002.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 109, + 141, + 504, + 176 + ], + "lines": [ + { + "bbox": [ + 107, + 142, + 504, + 155 + ], + "spans": [ + { + "bbox": [ + 107, + 142, + 504, + 155 + ], + "score": 1.0, + "content": "Stefano Spigler, Mario Geiger, Stephane d’Ascoli, Levent Sagun, Giulio Biroli, and Matthieu Wyart.´", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 154, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 116, + 154, + 505, + 166 + ], + "score": 1.0, + "content": "A jamming transition from under-to over-parametrization affects loss landscape and generaliza-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 164, + 300, + 176 + ], + "spans": [ + { + "bbox": [ + 115, + 164, + 300, + 176 + ], + "score": 1.0, + "content": "tion. arXiv preprint arXiv:1810.09665, 2018.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 105, + 182, + 504, + 205 + ], + "lines": [ + { + "bbox": [ + 105, + 182, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 505, + 196 + ], + "score": 1.0, + "content": "Gerard V Trunk. A problem of dimensionality: A simple example. IEEE Transactions on pattern", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 194, + 336, + 206 + ], + "spans": [ + { + "bbox": [ + 115, + 194, + 336, + 206 + ], + "score": 1.0, + "content": "analysis and machine intelligence, (3):306–307, 1979.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 105, + 213, + 504, + 236 + ], + "lines": [ + { + "bbox": [ + 106, + 213, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 106, + 213, + 505, + 226 + ], + "score": 1.0, + "content": "Han Xiao, Kashif Rasul, and Roland Vollgraf. Fashion-mnist: a novel image dataset for benchmark-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 224, + 415, + 236 + ], + "spans": [ + { + "bbox": [ + 115, + 224, + 415, + 236 + ], + "score": 1.0, + "content": "ing machine learning algorithms. arXiv preprint arXiv:1708.07747, 2017.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 105, + 243, + 504, + 266 + ], + "lines": [ + { + "bbox": [ + 105, + 242, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 505, + 256 + ], + "score": 1.0, + "content": "Ji Xu and Daniel J Hsu. On the number of variables to use in principal component regression. In", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 254, + 420, + 266 + ], + "spans": [ + { + "bbox": [ + 115, + 254, + 420, + 266 + ], + "score": 1.0, + "content": "Advances in Neural Information Processing Systems, pp. 5095–5104, 2019.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + } + ], + "page_idx": 10, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 292, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Ali Rahimi and Benjamin Recht. Random features for large-scale kernel machines. In Advances in", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 94, + 365, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 94, + 365, + 106 + ], + "score": 1.0, + "content": "neural information processing systems, pp. 1177–1184, 2008.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 106, + 82, + 505, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 111, + 504, + 135 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 505, + 125 + ], + "score": 1.0, + "content": "Marina Skurichina and Robert PW Duin. Bagging, boosting and the random subspace method for", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 123, + 404, + 136 + ], + "spans": [ + { + "bbox": [ + 115, + 123, + 404, + 136 + ], + "score": 1.0, + "content": "linear classifiers. Pattern Analysis & Applications, 5(2):121–135, 2002.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 111, + 505, + 136 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 141, + 504, + 176 + ], + "lines": [ + { + "bbox": [ + 107, + 142, + 504, + 155 + ], + "spans": [ + { + "bbox": [ + 107, + 142, + 504, + 155 + ], + "score": 1.0, + "content": "Stefano Spigler, Mario Geiger, Stephane d’Ascoli, Levent Sagun, Giulio Biroli, and Matthieu Wyart.´", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 154, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 116, + 154, + 505, + 166 + ], + "score": 1.0, + "content": "A jamming transition from under-to over-parametrization affects loss landscape and generaliza-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 164, + 300, + 176 + ], + "spans": [ + { + "bbox": [ + 115, + 164, + 300, + 176 + ], + "score": 1.0, + "content": "tion. arXiv preprint arXiv:1810.09665, 2018.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5, + "bbox_fs": [ + 107, + 142, + 505, + 176 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 182, + 504, + 205 + ], + "lines": [ + { + "bbox": [ + 105, + 182, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 505, + 196 + ], + "score": 1.0, + "content": "Gerard V Trunk. A problem of dimensionality: A simple example. IEEE Transactions on pattern", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 194, + 336, + 206 + ], + "spans": [ + { + "bbox": [ + 115, + 194, + 336, + 206 + ], + "score": 1.0, + "content": "analysis and machine intelligence, (3):306–307, 1979.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 182, + 505, + 206 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 213, + 504, + 236 + ], + "lines": [ + { + "bbox": [ + 106, + 213, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 106, + 213, + 505, + 226 + ], + "score": 1.0, + "content": "Han Xiao, Kashif Rasul, and Roland Vollgraf. Fashion-mnist: a novel image dataset for benchmark-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 224, + 415, + 236 + ], + "spans": [ + { + "bbox": [ + 115, + 224, + 415, + 236 + ], + "score": 1.0, + "content": "ing machine learning algorithms. arXiv preprint arXiv:1708.07747, 2017.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 106, + 213, + 505, + 236 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 243, + 504, + 266 + ], + "lines": [ + { + "bbox": [ + 105, + 242, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 505, + 256 + ], + "score": 1.0, + "content": "Ji Xu and Daniel J Hsu. On the number of variables to use in principal component regression. In", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 254, + 420, + 266 + ], + "spans": [ + { + "bbox": [ + 115, + 254, + 420, + 266 + ], + "score": 1.0, + "content": "Advances in Neural Information Processing Systems, pp. 5095–5104, 2019.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 242, + 505, + 266 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 182, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 79, + 185, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 79, + 185, + 97 + ], + "score": 1.0, + "content": "A APPENDIX", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 109, + 505, + 154 + ], + "lines": [ + { + "bbox": [ + 105, + 109, + 505, + 121 + ], + "spans": [ + { + "bbox": [ + 105, + 109, + 505, + 121 + ], + "score": 1.0, + "content": "In Section A.1 and A.2 we provide the proofs for sample-monotonicity and model-size monotonic-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 120, + 505, + 132 + ], + "spans": [ + { + "bbox": [ + 105, + 120, + 505, + 132 + ], + "score": 1.0, + "content": "ity. In Section A.4 we include additional and omitted plots. In Section B we investigate whether", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 131, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 131, + 505, + 144 + ], + "score": 1.0, + "content": "monotonicity provably holds in more general models, and present a monotonicity conjecture for", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 143, + 207, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 207, + 155 + ], + "score": 1.0, + "content": "non-isotropic covariates.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 108, + 171, + 277, + 182 + ], + "lines": [ + { + "bbox": [ + 106, + 171, + 279, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 279, + 183 + ], + "score": 1.0, + "content": "A.1 SAMPLE MONOTONICITY PROOFS", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 194, + 207, + 206 + ], + "lines": [ + { + "bbox": [ + 105, + 192, + 209, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 209, + 208 + ], + "score": 1.0, + "content": "First we prove Lemma 1.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 225, + 438, + 238 + ], + "lines": [ + { + "bbox": [ + 105, + 224, + 440, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 224, + 173, + 240 + ], + "score": 1.0, + "content": "Proof of Lemma", + "type": "text" + }, + { + "bbox": [ + 174, + 227, + 179, + 236 + ], + "score": 0.49, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 224, + 239, + 240 + ], + "score": 1.0, + "content": ". For isotropic", + "type": "text" + }, + { + "bbox": [ + 239, + 228, + 246, + 236 + ], + "score": 0.77, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 224, + 440, + 240 + ], + "score": 1.0, + "content": ", the test risk is related to the parameter error as:", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "interline_equation", + "bbox": [ + 205, + 244, + 406, + 311 + ], + "lines": [ + { + "bbox": [ + 205, + 244, + 406, + 311 + ], + "spans": [ + { + "bbox": [ + 205, + 244, + 406, + 311 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { R ( \\hat { \\beta } ) : = \\underset { ( x , y ) \\sim \\mathcal { D } } { \\mathbb { E } } [ ( \\langle x , \\hat { \\beta } \\rangle - y ) ^ { 2 } ] } \\\\ & { \\quad \\quad = \\underset { x \\sim \\mathcal { N } ( 0 , I _ { d } ) , \\eta \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } ) } { \\mathbb { E } } [ ( \\langle x , \\hat { \\beta } - \\beta ^ { * } \\rangle + \\eta ) ^ { 2 } ] } \\\\ & { \\quad \\quad = | | \\hat { \\beta } - \\beta ^ { * } | | _ { 2 } ^ { 2 } + \\sigma ^ { 2 } } \\end{array}", + "type": "interline_equation", + "image_path": "c97d13ce47a347c33a9d571dff6f8d2d6723326494388228cf1b8a50d62e7ccc.jpg" + } + ] + } + ], + "index": 9.5, + "virtual_lines": [ + { + "bbox": [ + 205, + 244, + 406, + 260.75 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 205, + 260.75, + 406, + 277.5 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 205, + 277.5, + 406, + 294.25 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 205, + 294.25, + 406, + 311.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 317, + 286, + 330 + ], + "lines": [ + { + "bbox": [ + 104, + 314, + 287, + 334 + ], + "spans": [ + { + "bbox": [ + 104, + 314, + 203, + 334 + ], + "score": 1.0, + "content": "Plugging in the form of", + "type": "text" + }, + { + "bbox": [ + 203, + 317, + 222, + 331 + ], + "score": 0.92, + "content": "\\hat { \\beta } _ { n , \\lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 314, + 287, + 334 + ], + "score": 1.0, + "content": "and expanding:", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "interline_equation", + "bbox": [ + 141, + 336, + 468, + 468 + ], + "lines": [ + { + "bbox": [ + 141, + 336, + 468, + 468 + ], + "spans": [ + { + "bbox": [ + 141, + 336, + 468, + 468 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\bar { R } ( \\hat { \\beta } _ { n , \\lambda } ) : = \\underset { X , y \\sim \\mathcal { D } ^ { n } } { \\mathbb { E } } [ R ( \\hat { \\beta } _ { n , \\lambda } ) ] } \\\\ & { = \\mathbb { E } [ \\| \\hat { \\beta } _ { n , \\lambda } - \\beta ^ { * } \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { = \\underset { X , y } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } y - \\beta \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { = \\underset { X , \\eta \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } I _ { n } ) } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } ( X \\beta ^ { * } + \\eta ) - \\beta ^ { * } \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { = \\underset { X } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } X \\beta ^ { * } - \\beta ^ { * } \\| _ { 2 } ^ { 2 } ] + \\underset { X , \\eta } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } \\eta \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { = \\underset { X } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } X \\beta ^ { * } - \\beta ^ { * } \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } \\| _ { F } ^ { 2 } ] + \\sigma ^ { 2 } } \\end{array}", + "type": "interline_equation", + "image_path": "c911b8b3710c18864e6f659d837cf52911f7d4f019ed2f3dd867f5c0d66b6396.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 141, + 336, + 468, + 380.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 141, + 380.0, + 468, + 424.0 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 141, + 424.0, + 468, + 468.0 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 474, + 505, + 509 + ], + "lines": [ + { + "bbox": [ + 105, + 473, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 144, + 487 + ], + "score": 1.0, + "content": "Now let", + "type": "text" + }, + { + "bbox": [ + 144, + 474, + 203, + 485 + ], + "score": 0.91, + "content": "X \\ = \\ U \\Sigma V ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 473, + 390, + 487 + ], + "score": 1.0, + "content": "be the full singular value decomposition of", + "type": "text" + }, + { + "bbox": [ + 391, + 476, + 401, + 485 + ], + "score": 0.83, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 473, + 428, + 487 + ], + "score": 1.0, + "content": ", with", + "type": "text" + }, + { + "bbox": [ + 429, + 475, + 505, + 487 + ], + "score": 0.88, + "content": "U \\ \\in \\ \\mathbb { R } ^ { n \\times n } , \\Sigma \\ \\in", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 107, + 483, + 506, + 501 + ], + "spans": [ + { + "bbox": [ + 107, + 486, + 179, + 497 + ], + "score": 0.88, + "content": "\\mathbb { R } ^ { n \\times d } , V \\in \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 483, + 202, + 501 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 202, + 486, + 247, + 498 + ], + "score": 0.91, + "content": "( \\gamma _ { 1 } , \\ldots \\gamma _ { d } )", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 483, + 395, + 501 + ], + "score": 1.0, + "content": "denote the singular values, defining", + "type": "text" + }, + { + "bbox": [ + 395, + 487, + 425, + 498 + ], + "score": 0.9, + "content": "\\gamma _ { i } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 483, + 442, + 501 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 442, + 487, + 501, + 498 + ], + "score": 0.89, + "content": "i > \\operatorname* { m i n } ( n , d )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 483, + 506, + 501 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 496, + 181, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 181, + 510 + ], + "score": 1.0, + "content": "Then, continuing:", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17 + }, + { + "type": "interline_equation", + "bbox": [ + 126, + 515, + 468, + 642 + ], + "lines": [ + { + "bbox": [ + 126, + 515, + 468, + 642 + ], + "spans": [ + { + "bbox": [ + 126, + 515, + 468, + 642 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\underset { V , \\Sigma } { \\mathbb { E } } [ | | \\mathrm { d i a g } ( \\{ \\frac { - \\lambda } { \\gamma _ { i } ^ { 2 } + \\lambda } \\} ) V ^ { T } \\beta ^ { * } | | _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } } \\\\ & { \\quad \\quad = \\underset { z \\sim \\mathrm { U n i f } ( 1 ) \\frac { \\mathbb { E } } { \\delta } } { \\underbrace { \\mathrm { U } \\mathrm { E } } } [ | | \\mathrm { d i a g } ( \\{ \\frac { - \\lambda } { \\gamma _ { i } ^ { 2 } + \\lambda } \\} ) z | | _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } } \\\\ & { \\quad \\quad = \\frac { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } { d } \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { \\lambda ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } } \\\\ & { \\quad \\quad = \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } / d + \\sigma ^ { 2 } \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } } \\end{array}", + "type": "interline_equation", + "image_path": "040b59fb6e2e081b3c86b7cc23e606f3f2af2702a88eacaab6aa38b59506e573.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 126, + 515, + 468, + 557.3333333333334 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 126, + 557.3333333333334, + 468, + 599.6666666666667 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 126, + 599.6666666666667, + 468, + 642.0000000000001 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 648, + 504, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 647, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 352, + 661 + ], + "score": 1.0, + "content": "In Line (10) follows because by symmetry, the distribution of", + "type": "text" + }, + { + "bbox": [ + 353, + 649, + 362, + 658 + ], + "score": 0.83, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 647, + 505, + 661 + ], + "score": 1.0, + "content": "is a uniformly random orthonormal", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 657, + 506, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 154, + 672 + ], + "score": 1.0, + "content": "matrix, and", + "type": "text" + }, + { + "bbox": [ + 155, + 660, + 163, + 669 + ], + "score": 0.85, + "content": "\\Sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 657, + 235, + 672 + ], + "score": 1.0, + "content": "is independent of", + "type": "text" + }, + { + "bbox": [ + 236, + 660, + 244, + 669 + ], + "score": 0.83, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 657, + 274, + 672 + ], + "score": 1.0, + "content": ". Thus,", + "type": "text" + }, + { + "bbox": [ + 274, + 658, + 321, + 671 + ], + "score": 0.92, + "content": "z : = V ^ { T } \\beta ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 657, + 506, + 672 + ], + "score": 1.0, + "content": "is distributed as a uniformly random point on", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 668, + 237, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 205, + 684 + ], + "score": 1.0, + "content": "the unit sphere of radius", + "type": "text" + }, + { + "bbox": [ + 205, + 670, + 232, + 682 + ], + "score": 0.91, + "content": "| | \\beta ^ { * } | | _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 668, + 237, + 684 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 720, + 209, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 719, + 210, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 719, + 210, + 734 + ], + "score": 1.0, + "content": "Next we prove Lemma 2.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + } + ], + "page_idx": 11, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 292, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "12", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 495, + 689, + 504, + 699 + ], + "lines": [ + { + "bbox": [ + 496, + 691, + 504, + 699 + ], + "spans": [ + { + "bbox": [ + 496, + 691, + 504, + 699 + ], + "score": 0.997, + "content": "□", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 182, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 79, + 185, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 79, + 185, + 97 + ], + "score": 1.0, + "content": "A APPENDIX", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 109, + 505, + 154 + ], + "lines": [ + { + "bbox": [ + 105, + 109, + 505, + 121 + ], + "spans": [ + { + "bbox": [ + 105, + 109, + 505, + 121 + ], + "score": 1.0, + "content": "In Section A.1 and A.2 we provide the proofs for sample-monotonicity and model-size monotonic-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 120, + 505, + 132 + ], + "spans": [ + { + "bbox": [ + 105, + 120, + 505, + 132 + ], + "score": 1.0, + "content": "ity. In Section A.4 we include additional and omitted plots. In Section B we investigate whether", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 131, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 131, + 505, + 144 + ], + "score": 1.0, + "content": "monotonicity provably holds in more general models, and present a monotonicity conjecture for", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 143, + 207, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 207, + 155 + ], + "score": 1.0, + "content": "non-isotropic covariates.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 109, + 505, + 155 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 171, + 277, + 182 + ], + "lines": [ + { + "bbox": [ + 106, + 171, + 279, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 279, + 183 + ], + "score": 1.0, + "content": "A.1 SAMPLE MONOTONICITY PROOFS", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 194, + 207, + 206 + ], + "lines": [ + { + "bbox": [ + 105, + 192, + 209, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 209, + 208 + ], + "score": 1.0, + "content": "First we prove Lemma 1.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6, + "bbox_fs": [ + 105, + 192, + 209, + 208 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 225, + 438, + 238 + ], + "lines": [ + { + "bbox": [ + 105, + 224, + 440, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 224, + 173, + 240 + ], + "score": 1.0, + "content": "Proof of Lemma", + "type": "text" + }, + { + "bbox": [ + 174, + 227, + 179, + 236 + ], + "score": 0.49, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 224, + 239, + 240 + ], + "score": 1.0, + "content": ". For isotropic", + "type": "text" + }, + { + "bbox": [ + 239, + 228, + 246, + 236 + ], + "score": 0.77, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 224, + 440, + 240 + ], + "score": 1.0, + "content": ", the test risk is related to the parameter error as:", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 224, + 440, + 240 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 205, + 244, + 406, + 311 + ], + "lines": [ + { + "bbox": [ + 205, + 244, + 406, + 311 + ], + "spans": [ + { + "bbox": [ + 205, + 244, + 406, + 311 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { R ( \\hat { \\beta } ) : = \\underset { ( x , y ) \\sim \\mathcal { D } } { \\mathbb { E } } [ ( \\langle x , \\hat { \\beta } \\rangle - y ) ^ { 2 } ] } \\\\ & { \\quad \\quad = \\underset { x \\sim \\mathcal { N } ( 0 , I _ { d } ) , \\eta \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } ) } { \\mathbb { E } } [ ( \\langle x , \\hat { \\beta } - \\beta ^ { * } \\rangle + \\eta ) ^ { 2 } ] } \\\\ & { \\quad \\quad = | | \\hat { \\beta } - \\beta ^ { * } | | _ { 2 } ^ { 2 } + \\sigma ^ { 2 } } \\end{array}", + "type": "interline_equation", + "image_path": "c97d13ce47a347c33a9d571dff6f8d2d6723326494388228cf1b8a50d62e7ccc.jpg" + } + ] + } + ], + "index": 9.5, + "virtual_lines": [ + { + "bbox": [ + 205, + 244, + 406, + 260.75 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 205, + 260.75, + 406, + 277.5 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 205, + 277.5, + 406, + 294.25 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 205, + 294.25, + 406, + 311.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 317, + 286, + 330 + ], + "lines": [ + { + "bbox": [ + 104, + 314, + 287, + 334 + ], + "spans": [ + { + "bbox": [ + 104, + 314, + 203, + 334 + ], + "score": 1.0, + "content": "Plugging in the form of", + "type": "text" + }, + { + "bbox": [ + 203, + 317, + 222, + 331 + ], + "score": 0.92, + "content": "\\hat { \\beta } _ { n , \\lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 314, + 287, + 334 + ], + "score": 1.0, + "content": "and expanding:", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 104, + 314, + 287, + 334 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 141, + 336, + 468, + 468 + ], + "lines": [ + { + "bbox": [ + 141, + 336, + 468, + 468 + ], + "spans": [ + { + "bbox": [ + 141, + 336, + 468, + 468 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\bar { R } ( \\hat { \\beta } _ { n , \\lambda } ) : = \\underset { X , y \\sim \\mathcal { D } ^ { n } } { \\mathbb { E } } [ R ( \\hat { \\beta } _ { n , \\lambda } ) ] } \\\\ & { = \\mathbb { E } [ \\| \\hat { \\beta } _ { n , \\lambda } - \\beta ^ { * } \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { = \\underset { X , y } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } y - \\beta \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { = \\underset { X , \\eta \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } I _ { n } ) } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } ( X \\beta ^ { * } + \\eta ) - \\beta ^ { * } \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { = \\underset { X } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } X \\beta ^ { * } - \\beta ^ { * } \\| _ { 2 } ^ { 2 } ] + \\underset { X , \\eta } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } \\eta \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { = \\underset { X } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } X \\beta ^ { * } - \\beta ^ { * } \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } \\| _ { F } ^ { 2 } ] + \\sigma ^ { 2 } } \\end{array}", + "type": "interline_equation", + "image_path": "c911b8b3710c18864e6f659d837cf52911f7d4f019ed2f3dd867f5c0d66b6396.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 141, + 336, + 468, + 380.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 141, + 380.0, + 468, + 424.0 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 141, + 424.0, + 468, + 468.0 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 474, + 505, + 509 + ], + "lines": [ + { + "bbox": [ + 105, + 473, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 144, + 487 + ], + "score": 1.0, + "content": "Now let", + "type": "text" + }, + { + "bbox": [ + 144, + 474, + 203, + 485 + ], + "score": 0.91, + "content": "X \\ = \\ U \\Sigma V ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 473, + 390, + 487 + ], + "score": 1.0, + "content": "be the full singular value decomposition of", + "type": "text" + }, + { + "bbox": [ + 391, + 476, + 401, + 485 + ], + "score": 0.83, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 473, + 428, + 487 + ], + "score": 1.0, + "content": ", with", + "type": "text" + }, + { + "bbox": [ + 429, + 475, + 505, + 487 + ], + "score": 0.88, + "content": "U \\ \\in \\ \\mathbb { R } ^ { n \\times n } , \\Sigma \\ \\in", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 107, + 483, + 506, + 501 + ], + "spans": [ + { + "bbox": [ + 107, + 486, + 179, + 497 + ], + "score": 0.88, + "content": "\\mathbb { R } ^ { n \\times d } , V \\in \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 483, + 202, + 501 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 202, + 486, + 247, + 498 + ], + "score": 0.91, + "content": "( \\gamma _ { 1 } , \\ldots \\gamma _ { d } )", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 483, + 395, + 501 + ], + "score": 1.0, + "content": "denote the singular values, defining", + "type": "text" + }, + { + "bbox": [ + 395, + 487, + 425, + 498 + ], + "score": 0.9, + "content": "\\gamma _ { i } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 483, + 442, + 501 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 442, + 487, + 501, + 498 + ], + "score": 0.89, + "content": "i > \\operatorname* { m i n } ( n , d )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 483, + 506, + 501 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 496, + 181, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 181, + 510 + ], + "score": 1.0, + "content": "Then, continuing:", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 473, + 506, + 510 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 126, + 515, + 468, + 642 + ], + "lines": [ + { + "bbox": [ + 126, + 515, + 468, + 642 + ], + "spans": [ + { + "bbox": [ + 126, + 515, + 468, + 642 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\underset { V , \\Sigma } { \\mathbb { E } } [ | | \\mathrm { d i a g } ( \\{ \\frac { - \\lambda } { \\gamma _ { i } ^ { 2 } + \\lambda } \\} ) V ^ { T } \\beta ^ { * } | | _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } } \\\\ & { \\quad \\quad = \\underset { z \\sim \\mathrm { U n i f } ( 1 ) \\frac { \\mathbb { E } } { \\delta } } { \\underbrace { \\mathrm { U } \\mathrm { E } } } [ | | \\mathrm { d i a g } ( \\{ \\frac { - \\lambda } { \\gamma _ { i } ^ { 2 } + \\lambda } \\} ) z | | _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } } \\\\ & { \\quad \\quad = \\frac { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } { d } \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { \\lambda ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } } \\\\ & { \\quad \\quad = \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } / d + \\sigma ^ { 2 } \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } } \\end{array}", + "type": "interline_equation", + "image_path": "040b59fb6e2e081b3c86b7cc23e606f3f2af2702a88eacaab6aa38b59506e573.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 126, + 515, + 468, + 557.3333333333334 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 126, + 557.3333333333334, + 468, + 599.6666666666667 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 126, + 599.6666666666667, + 468, + 642.0000000000001 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 648, + 504, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 647, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 352, + 661 + ], + "score": 1.0, + "content": "In Line (10) follows because by symmetry, the distribution of", + "type": "text" + }, + { + "bbox": [ + 353, + 649, + 362, + 658 + ], + "score": 0.83, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 647, + 505, + 661 + ], + "score": 1.0, + "content": "is a uniformly random orthonormal", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 657, + 506, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 154, + 672 + ], + "score": 1.0, + "content": "matrix, and", + "type": "text" + }, + { + "bbox": [ + 155, + 660, + 163, + 669 + ], + "score": 0.85, + "content": "\\Sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 657, + 235, + 672 + ], + "score": 1.0, + "content": "is independent of", + "type": "text" + }, + { + "bbox": [ + 236, + 660, + 244, + 669 + ], + "score": 0.83, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 657, + 274, + 672 + ], + "score": 1.0, + "content": ". Thus,", + "type": "text" + }, + { + "bbox": [ + 274, + 658, + 321, + 671 + ], + "score": 0.92, + "content": "z : = V ^ { T } \\beta ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 657, + 506, + 672 + ], + "score": 1.0, + "content": "is distributed as a uniformly random point on", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 668, + 237, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 205, + 684 + ], + "score": 1.0, + "content": "the unit sphere of radius", + "type": "text" + }, + { + "bbox": [ + 205, + 670, + 232, + 682 + ], + "score": 0.91, + "content": "| | \\beta ^ { * } | | _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 668, + 237, + 684 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 647, + 506, + 684 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 720, + 209, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 719, + 210, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 719, + 210, + 734 + ], + "score": 1.0, + "content": "Next we prove Lemma 2.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25, + "bbox_fs": [ + 106, + 719, + 210, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 104, + 81, + 485, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 486, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 486, + 96 + ], + "score": 1.0, + "content": "Proof of Lemma 2. First, we determine the optimal ridge parameter. Using Lemma 1, we have", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 190, + 101, + 420, + 185 + ], + "lines": [ + { + "bbox": [ + 190, + 101, + 420, + 185 + ], + "spans": [ + { + "bbox": [ + 190, + 101, + 420, + 185 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\frac { \\partial } { \\partial \\lambda } \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\frac { \\partial } { \\partial \\lambda } _ { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma } \\left[ \\displaystyle \\sum _ { i } \\frac { | | \\beta | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } / d + \\sigma ^ { 2 } \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } \\right] } \\\\ & { = 2 ( | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda / d - \\sigma ^ { 2 } ) _ { ( \\underbrace { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma } _ { > 0 } } \\left[ \\displaystyle \\sum _ { i } \\frac { \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 3 } } \\right] } \\end{array}", + "type": "interline_equation", + "image_path": "a623c8e79a24fdd865da11d4fdff60646c3d940ef3f190067fd57aa38bac12da.jpg" + } + ] + } + ], + "index": 3.5, + "virtual_lines": [ + { + "bbox": [ + 190, + 101, + 420, + 115.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 190, + 115.0, + 420, + 129.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 190, + 129.0, + 420, + 143.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 190, + 143.0, + 420, + 157.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 190, + 157.0, + 420, + 171.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 190, + 171.0, + 420, + 185.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 191, + 412, + 210 + ], + "lines": [ + { + "bbox": [ + 104, + 191, + 410, + 211 + ], + "spans": [ + { + "bbox": [ + 104, + 191, + 132, + 211 + ], + "score": 1.0, + "content": "Thus,", + "type": "text" + }, + { + "bbox": [ + 132, + 192, + 267, + 210 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\frac { \\partial } { \\partial \\lambda } \\overline { { R } } ( \\widehat { \\beta } _ { n , \\lambda } ) = 0 \\implies \\lambda = \\frac { d \\sigma ^ { 2 } } { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 191, + 355, + 211 + ], + "score": 1.0, + "content": "and we conclude that", + "type": "text" + }, + { + "bbox": [ + 356, + 192, + 410, + 210 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\lambda _ { n } ^ { \\mathrm { o p t } } = \\frac { d \\sigma ^ { 2 } } { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } } \\end{array}", + "type": "inline_equation" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 216, + 371, + 228 + ], + "lines": [ + { + "bbox": [ + 105, + 216, + 371, + 230 + ], + "spans": [ + { + "bbox": [ + 105, + 216, + 371, + 230 + ], + "score": 1.0, + "content": "For this optimal parameter, the test risk follows from Lemma 1 as", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 234, + 400, + 289 + ], + "lines": [ + { + "bbox": [ + 210, + 234, + 400, + 289 + ], + "spans": [ + { + "bbox": [ + 210, + 234, + 400, + 289 + ], + "score": 0.92, + "content": "\\begin{array} { l } { \\displaystyle \\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } ) = \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) } \\\\ { \\displaystyle = \\frac { \\mathbb { E } } { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma _ { n } } \\left[ \\sum _ { i = 1 } ^ { d } \\frac { \\sigma ^ { 2 } } { \\gamma _ { i } ^ { 2 } + d \\sigma ^ { 2 } / | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } \\right] + \\sigma ^ { 2 } } \\end{array}", + "type": "interline_equation", + "image_path": "48d72fd4dc42f61ccda5d47fc0360cd5f8963fbe8f3f90da572f6323560f904d.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 210, + 234, + 400, + 252.33333333333334 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 210, + 252.33333333333334, + 400, + 270.6666666666667 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 210, + 270.6666666666667, + 400, + 289.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 327, + 505, + 361 + ], + "lines": [ + { + "bbox": [ + 106, + 326, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 106, + 326, + 505, + 340 + ], + "score": 1.0, + "content": "Proof of Theorem 2. We follow a similar proof strategy as in Theorem 1: we invoke singular value", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 338, + 506, + 352 + ], + "spans": [ + { + "bbox": [ + 105, + 338, + 152, + 352 + ], + "score": 1.0, + "content": "interlacing", + "type": "text" + }, + { + "bbox": [ + 153, + 339, + 189, + 350 + ], + "score": 0.89, + "content": "( \\widetilde { \\gamma } _ { i } \\geq \\gamma _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 338, + 506, + 352 + ], + "score": 1.0, + "content": "for the data matrix when adding a single sample. We then apply Lemma 1 to", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 349, + 383, + 362 + ], + "spans": [ + { + "bbox": [ + 106, + 349, + 383, + 362 + ], + "score": 1.0, + "content": "eargue that the test risk varies monotonically with the singular values.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 107, + 369, + 143, + 380 + ], + "lines": [ + { + "bbox": [ + 105, + 367, + 144, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 144, + 381 + ], + "score": 1.0, + "content": "We have", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "interline_equation", + "bbox": [ + 207, + 379, + 404, + 424 + ], + "lines": [ + { + "bbox": [ + 207, + 379, + 404, + 424 + ], + "spans": [ + { + "bbox": [ + 207, + 379, + 404, + 424 + ], + "score": 0.94, + "content": "{ \\overline { { R } } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\operatorname * { \\mathbb { E } } _ { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma } [ \\sum _ { i } \\underbrace { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } / d + \\sigma ^ { 2 } \\gamma _ { i } ^ { 2 } } _ { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ]", + "type": "interline_equation", + "image_path": "de3244b98b022f93b1ca9519f7631fa81e4e9af584f4d8319f85bbc231b1557d.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 207, + 379, + 404, + 394.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 207, + 394.0, + 404, + 409.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 207, + 409.0, + 404, + 424.0 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 429, + 339, + 441 + ], + "lines": [ + { + "bbox": [ + 106, + 428, + 340, + 443 + ], + "spans": [ + { + "bbox": [ + 106, + 428, + 325, + 443 + ], + "score": 1.0, + "content": "and we compute how each term in the sum varies with", + "type": "text" + }, + { + "bbox": [ + 325, + 432, + 335, + 441 + ], + "score": 0.84, + "content": "\\gamma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 428, + 340, + 443 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "interline_equation", + "bbox": [ + 199, + 447, + 411, + 507 + ], + "lines": [ + { + "bbox": [ + 199, + 447, + 411, + 507 + ], + "spans": [ + { + "bbox": [ + 199, + 447, + 411, + 507 + ], + "score": 0.94, + "content": "\\begin{array} { l } { \\displaystyle { \\frac { \\partial } { \\partial \\gamma _ { i } } \\sum _ { i } S ( \\gamma _ { i } ) = \\frac { \\partial } { \\partial \\gamma _ { i } } S ( \\gamma _ { i } ) } } \\\\ { \\displaystyle { \\quad = ( \\frac { - 2 \\gamma _ { i } } { d } ) \\frac { 2 | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } + d \\sigma ^ { 2 } ( \\gamma _ { i } ^ { 2 } - \\lambda ) } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 3 } } } } \\end{array}", + "type": "interline_equation", + "image_path": "083dc399d19565db2a21c827567743ee4f98ee2e1b3dd3f08e16f076c93b48f9.jpg" + } + ] + } + ], + "index": 21.5, + "virtual_lines": [ + { + "bbox": [ + 199, + 447, + 411, + 462.0 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 199, + 462.0, + 411, + 477.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 199, + 477.0, + 411, + 492.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 199, + 492.0, + 411, + 507.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 514, + 164, + 525 + ], + "lines": [ + { + "bbox": [ + 105, + 512, + 165, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 165, + 526 + ], + "score": 1.0, + "content": "Thus we have", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "interline_equation", + "bbox": [ + 235, + 530, + 376, + 559 + ], + "lines": [ + { + "bbox": [ + 235, + 530, + 376, + 559 + ], + "spans": [ + { + "bbox": [ + 235, + 530, + 376, + 559 + ], + "score": 0.93, + "content": "\\lambda \\geq \\frac { d \\sigma ^ { 2 } } { 2 \\vert \\vert \\beta ^ { * } \\vert \\vert ^ { 2 } } \\implies \\frac { \\partial } { \\partial \\gamma _ { i } } S ( \\gamma _ { i } ) \\leq 0", + "type": "interline_equation", + "image_path": "56481a4012179ea03ab8bd2ae7aed121ef63b3b0de4415a7172237c75670635e.jpg" + } + ] + } + ], + "index": 25.5, + "virtual_lines": [ + { + "bbox": [ + 235, + 530, + 376, + 544.5 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 235, + 544.5, + 376, + 559.0 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 565, + 442, + 577 + ], + "lines": [ + { + "bbox": [ + 105, + 564, + 443, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 443, + 579 + ], + "score": 1.0, + "content": "By the coupling argument in Theorem 1, this implies that the test risk is monotonic:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 600, + 424, + 703 + ], + "lines": [ + { + "bbox": [ + 186, + 600, + 424, + 703 + ], + "spans": [ + { + "bbox": [ + 186, + 600, + 424, + 703 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\overline { { R } } ( \\hat { \\beta } _ { n + 1 , \\lambda } ) - \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) } \\\\ & { \\quad = \\underset { ( \\widetilde { \\gamma } _ { 1 } , \\dots , \\widetilde { \\gamma } _ { d } ) \\sim \\Gamma _ { n + 1 } } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } S ( \\widetilde { \\gamma } _ { i } ) \\right] - \\underset { ( \\gamma _ { 1 } , \\dots , \\gamma _ { d } ) \\sim \\Gamma _ { n } } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } S ( \\gamma _ { i } ) \\right] } \\\\ & { \\quad = \\underset { ( \\{ \\widetilde { \\gamma } _ { i } \\} , \\{ \\gamma _ { i } \\} ) \\sim \\Pi } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } S ( \\widetilde { \\gamma } _ { i } ) - S ( \\gamma _ { i } ) \\right] } \\\\ & { \\quad \\le 0 } \\end{array}", + "type": "interline_equation", + "image_path": "e72e37a8203a6e75f3017eb409e9edb1d55d482ed226ed8392499a42f1c091c7.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 186, + 600, + 424, + 614.7142857142857 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 186, + 614.7142857142857, + 424, + 629.4285714285713 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 186, + 629.4285714285713, + 424, + 644.142857142857 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 186, + 644.142857142857, + 424, + 658.8571428571427 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 186, + 658.8571428571427, + 424, + 673.5714285714283 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 186, + 673.5714285714283, + 424, + 688.285714285714 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 186, + 688.285714285714, + 424, + 702.9999999999997 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 506, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 707, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 707, + 133, + 723 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 710, + 142, + 720 + ], + "score": 0.8, + "content": "\\Pi", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 707, + 505, + 723 + ], + "score": 1.0, + "content": "is the coupling. Line (17) follows from Equation (15), and the fact that the coupling obeys", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 718, + 504, + 735 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 138, + 732 + ], + "score": 0.91, + "content": "\\widetilde { \\gamma } _ { i } \\geq \\gamma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 718, + 143, + 735 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 496, + 723, + 504, + 730 + ], + "score": 0.994, + "content": "□", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5 + } + ], + "page_idx": 12, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 761 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "13", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 294, + 505, + 305 + ], + "lines": [ + { + "bbox": [ + 495, + 296, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 495, + 296, + 505, + 306 + ], + "score": 0.999, + "content": "□", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 104, + 81, + 485, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 486, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 486, + 96 + ], + "score": 1.0, + "content": "Proof of Lemma 2. First, we determine the optimal ridge parameter. Using Lemma 1, we have", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 82, + 486, + 96 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 190, + 101, + 420, + 185 + ], + "lines": [ + { + "bbox": [ + 190, + 101, + 420, + 185 + ], + "spans": [ + { + "bbox": [ + 190, + 101, + 420, + 185 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\frac { \\partial } { \\partial \\lambda } \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\frac { \\partial } { \\partial \\lambda } _ { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma } \\left[ \\displaystyle \\sum _ { i } \\frac { | | \\beta | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } / d + \\sigma ^ { 2 } \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } \\right] } \\\\ & { = 2 ( | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda / d - \\sigma ^ { 2 } ) _ { ( \\underbrace { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma } _ { > 0 } } \\left[ \\displaystyle \\sum _ { i } \\frac { \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 3 } } \\right] } \\end{array}", + "type": "interline_equation", + "image_path": "a623c8e79a24fdd865da11d4fdff60646c3d940ef3f190067fd57aa38bac12da.jpg" + } + ] + } + ], + "index": 3.5, + "virtual_lines": [ + { + "bbox": [ + 190, + 101, + 420, + 115.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 190, + 115.0, + 420, + 129.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 190, + 129.0, + 420, + 143.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 190, + 143.0, + 420, + 157.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 190, + 157.0, + 420, + 171.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 190, + 171.0, + 420, + 185.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 191, + 412, + 210 + ], + "lines": [ + { + "bbox": [ + 104, + 191, + 410, + 211 + ], + "spans": [ + { + "bbox": [ + 104, + 191, + 132, + 211 + ], + "score": 1.0, + "content": "Thus,", + "type": "text" + }, + { + "bbox": [ + 132, + 192, + 267, + 210 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\frac { \\partial } { \\partial \\lambda } \\overline { { R } } ( \\widehat { \\beta } _ { n , \\lambda } ) = 0 \\implies \\lambda = \\frac { d \\sigma ^ { 2 } } { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 191, + 355, + 211 + ], + "score": 1.0, + "content": "and we conclude that", + "type": "text" + }, + { + "bbox": [ + 356, + 192, + 410, + 210 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\lambda _ { n } ^ { \\mathrm { o p t } } = \\frac { d \\sigma ^ { 2 } } { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } } \\end{array}", + "type": "inline_equation" + } + ], + "index": 7 + } + ], + "index": 7, + "bbox_fs": [ + 104, + 191, + 410, + 211 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 216, + 371, + 228 + ], + "lines": [ + { + "bbox": [ + 105, + 216, + 371, + 230 + ], + "spans": [ + { + "bbox": [ + 105, + 216, + 371, + 230 + ], + "score": 1.0, + "content": "For this optimal parameter, the test risk follows from Lemma 1 as", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 216, + 371, + 230 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 234, + 400, + 289 + ], + "lines": [ + { + "bbox": [ + 210, + 234, + 400, + 289 + ], + "spans": [ + { + "bbox": [ + 210, + 234, + 400, + 289 + ], + "score": 0.92, + "content": "\\begin{array} { l } { \\displaystyle \\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } ) = \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) } \\\\ { \\displaystyle = \\frac { \\mathbb { E } } { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma _ { n } } \\left[ \\sum _ { i = 1 } ^ { d } \\frac { \\sigma ^ { 2 } } { \\gamma _ { i } ^ { 2 } + d \\sigma ^ { 2 } / | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } \\right] + \\sigma ^ { 2 } } \\end{array}", + "type": "interline_equation", + "image_path": "48d72fd4dc42f61ccda5d47fc0360cd5f8963fbe8f3f90da572f6323560f904d.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 210, + 234, + 400, + 252.33333333333334 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 210, + 252.33333333333334, + 400, + 270.6666666666667 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 210, + 270.6666666666667, + 400, + 289.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 327, + 505, + 361 + ], + "lines": [ + { + "bbox": [ + 106, + 326, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 106, + 326, + 505, + 340 + ], + "score": 1.0, + "content": "Proof of Theorem 2. We follow a similar proof strategy as in Theorem 1: we invoke singular value", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 338, + 506, + 352 + ], + "spans": [ + { + "bbox": [ + 105, + 338, + 152, + 352 + ], + "score": 1.0, + "content": "interlacing", + "type": "text" + }, + { + "bbox": [ + 153, + 339, + 189, + 350 + ], + "score": 0.89, + "content": "( \\widetilde { \\gamma } _ { i } \\geq \\gamma _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 338, + 506, + 352 + ], + "score": 1.0, + "content": "for the data matrix when adding a single sample. We then apply Lemma 1 to", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 349, + 383, + 362 + ], + "spans": [ + { + "bbox": [ + 106, + 349, + 383, + 362 + ], + "score": 1.0, + "content": "eargue that the test risk varies monotonically with the singular values.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 326, + 506, + 362 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 369, + 143, + 380 + ], + "lines": [ + { + "bbox": [ + 105, + 367, + 144, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 144, + 381 + ], + "score": 1.0, + "content": "We have", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 367, + 144, + 381 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 207, + 379, + 404, + 424 + ], + "lines": [ + { + "bbox": [ + 207, + 379, + 404, + 424 + ], + "spans": [ + { + "bbox": [ + 207, + 379, + 404, + 424 + ], + "score": 0.94, + "content": "{ \\overline { { R } } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\operatorname * { \\mathbb { E } } _ { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma } [ \\sum _ { i } \\underbrace { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } / d + \\sigma ^ { 2 } \\gamma _ { i } ^ { 2 } } _ { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ]", + "type": "interline_equation", + "image_path": "de3244b98b022f93b1ca9519f7631fa81e4e9af584f4d8319f85bbc231b1557d.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 207, + 379, + 404, + 394.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 207, + 394.0, + 404, + 409.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 207, + 409.0, + 404, + 424.0 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 429, + 339, + 441 + ], + "lines": [ + { + "bbox": [ + 106, + 428, + 340, + 443 + ], + "spans": [ + { + "bbox": [ + 106, + 428, + 325, + 443 + ], + "score": 1.0, + "content": "and we compute how each term in the sum varies with", + "type": "text" + }, + { + "bbox": [ + 325, + 432, + 335, + 441 + ], + "score": 0.84, + "content": "\\gamma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 428, + 340, + 443 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19, + "bbox_fs": [ + 106, + 428, + 340, + 443 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 199, + 447, + 411, + 507 + ], + "lines": [ + { + "bbox": [ + 199, + 447, + 411, + 507 + ], + "spans": [ + { + "bbox": [ + 199, + 447, + 411, + 507 + ], + "score": 0.94, + "content": "\\begin{array} { l } { \\displaystyle { \\frac { \\partial } { \\partial \\gamma _ { i } } \\sum _ { i } S ( \\gamma _ { i } ) = \\frac { \\partial } { \\partial \\gamma _ { i } } S ( \\gamma _ { i } ) } } \\\\ { \\displaystyle { \\quad = ( \\frac { - 2 \\gamma _ { i } } { d } ) \\frac { 2 | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } + d \\sigma ^ { 2 } ( \\gamma _ { i } ^ { 2 } - \\lambda ) } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 3 } } } } \\end{array}", + "type": "interline_equation", + "image_path": "083dc399d19565db2a21c827567743ee4f98ee2e1b3dd3f08e16f076c93b48f9.jpg" + } + ] + } + ], + "index": 21.5, + "virtual_lines": [ + { + "bbox": [ + 199, + 447, + 411, + 462.0 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 199, + 462.0, + 411, + 477.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 199, + 477.0, + 411, + 492.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 199, + 492.0, + 411, + 507.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 514, + 164, + 525 + ], + "lines": [ + { + "bbox": [ + 105, + 512, + 165, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 165, + 526 + ], + "score": 1.0, + "content": "Thus we have", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 512, + 165, + 526 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 235, + 530, + 376, + 559 + ], + "lines": [ + { + "bbox": [ + 235, + 530, + 376, + 559 + ], + "spans": [ + { + "bbox": [ + 235, + 530, + 376, + 559 + ], + "score": 0.93, + "content": "\\lambda \\geq \\frac { d \\sigma ^ { 2 } } { 2 \\vert \\vert \\beta ^ { * } \\vert \\vert ^ { 2 } } \\implies \\frac { \\partial } { \\partial \\gamma _ { i } } S ( \\gamma _ { i } ) \\leq 0", + "type": "interline_equation", + "image_path": "56481a4012179ea03ab8bd2ae7aed121ef63b3b0de4415a7172237c75670635e.jpg" + } + ] + } + ], + "index": 25.5, + "virtual_lines": [ + { + "bbox": [ + 235, + 530, + 376, + 544.5 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 235, + 544.5, + 376, + 559.0 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 565, + 442, + 577 + ], + "lines": [ + { + "bbox": [ + 105, + 564, + 443, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 443, + 579 + ], + "score": 1.0, + "content": "By the coupling argument in Theorem 1, this implies that the test risk is monotonic:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 564, + 443, + 579 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 600, + 424, + 703 + ], + "lines": [ + { + "bbox": [ + 186, + 600, + 424, + 703 + ], + "spans": [ + { + "bbox": [ + 186, + 600, + 424, + 703 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\overline { { R } } ( \\hat { \\beta } _ { n + 1 , \\lambda } ) - \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) } \\\\ & { \\quad = \\underset { ( \\widetilde { \\gamma } _ { 1 } , \\dots , \\widetilde { \\gamma } _ { d } ) \\sim \\Gamma _ { n + 1 } } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } S ( \\widetilde { \\gamma } _ { i } ) \\right] - \\underset { ( \\gamma _ { 1 } , \\dots , \\gamma _ { d } ) \\sim \\Gamma _ { n } } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } S ( \\gamma _ { i } ) \\right] } \\\\ & { \\quad = \\underset { ( \\{ \\widetilde { \\gamma } _ { i } \\} , \\{ \\gamma _ { i } \\} ) \\sim \\Pi } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } S ( \\widetilde { \\gamma } _ { i } ) - S ( \\gamma _ { i } ) \\right] } \\\\ & { \\quad \\le 0 } \\end{array}", + "type": "interline_equation", + "image_path": "e72e37a8203a6e75f3017eb409e9edb1d55d482ed226ed8392499a42f1c091c7.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 186, + 600, + 424, + 614.7142857142857 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 186, + 614.7142857142857, + 424, + 629.4285714285713 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 186, + 629.4285714285713, + 424, + 644.142857142857 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 186, + 644.142857142857, + 424, + 658.8571428571427 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 186, + 658.8571428571427, + 424, + 673.5714285714283 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 186, + 673.5714285714283, + 424, + 688.285714285714 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 186, + 688.285714285714, + 424, + 702.9999999999997 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 506, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 707, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 707, + 133, + 723 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 710, + 142, + 720 + ], + "score": 0.8, + "content": "\\Pi", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 707, + 505, + 723 + ], + "score": 1.0, + "content": "is the coupling. Line (17) follows from Equation (15), and the fact that the coupling obeys", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 718, + 504, + 735 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 138, + 732 + ], + "score": 0.91, + "content": "\\widetilde { \\gamma } _ { i } \\geq \\gamma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 718, + 143, + 735 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 496, + 723, + 504, + 730 + ], + "score": 0.994, + "content": "□", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 707, + 505, + 735 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 82, + 259, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 260, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 260, + 95 + ], + "score": 1.0, + "content": "A.2 PROJECTION MODEL PROOFS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 102, + 505, + 153 + ], + "lines": [ + { + "bbox": [ + 105, + 101, + 504, + 116 + ], + "spans": [ + { + "bbox": [ + 105, + 101, + 185, + 116 + ], + "score": 1.0, + "content": "Lemma 3. For all", + "type": "text" + }, + { + "bbox": [ + 186, + 104, + 218, + 114 + ], + "score": 0.86, + "content": "\\theta \\in \\mathbb { R } ^ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 101, + 222, + 116 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 222, + 104, + 261, + 115 + ], + "score": 0.82, + "content": "d , n \\in \\mathbb { N } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 101, + 283, + 116 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 284, + 104, + 311, + 114 + ], + "score": 0.88, + "content": "\\lambda > 0 ;", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 101, + 328, + 116 + ], + "score": 1.0, + "content": ", let", + "type": "text" + }, + { + "bbox": [ + 329, + 103, + 376, + 114 + ], + "score": 0.91, + "content": "\\ b { X } \\in \\mathbb { R } ^ { n \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 101, + 470, + 116 + ], + "score": 1.0, + "content": "be a matrix with i.i.d.", + "type": "text" + }, + { + "bbox": [ + 471, + 103, + 504, + 115 + ], + "score": 0.92, + "content": "\\mathcal { N } ( 0 , 1 )", + "type": "inline_equation" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 112, + 503, + 131 + ], + "spans": [ + { + "bbox": [ + 104, + 112, + 157, + 131 + ], + "score": 1.0, + "content": "entries. Let", + "type": "text" + }, + { + "bbox": [ + 157, + 115, + 203, + 127 + ], + "score": 0.91, + "content": "P \\in \\mathbb { R } ^ { d \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 112, + 376, + 131 + ], + "score": 1.0, + "content": "be a random orthonormal matrix. Define", + "type": "text" + }, + { + "bbox": [ + 376, + 114, + 428, + 127 + ], + "score": 0.91, + "content": "\\widetilde { X } : = X P ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 112, + 451, + 131 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 451, + 116, + 503, + 129 + ], + "score": 0.89, + "content": "\\left( \\gamma _ { 1 } , \\dots , \\gamma _ { m } \\right)", + "type": "inline_equation" + } + ], + "index": 2 + }, + { + "bbox": [ + 104, + 126, + 506, + 142 + ], + "spans": [ + { + "bbox": [ + 104, + 126, + 282, + 142 + ], + "score": 1.0, + "content": "be the singular values of the data matrix", + "type": "text" + }, + { + "bbox": [ + 282, + 127, + 333, + 140 + ], + "score": 0.91, + "content": "\\tilde { X } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 126, + 354, + 142 + ], + "score": 1.0, + "content": ", for", + "type": "text" + }, + { + "bbox": [ + 354, + 129, + 428, + 141 + ], + "score": 0.87, + "content": "m : = \\operatorname* { m a x } ( n , d )", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 126, + 454, + 142 + ], + "score": 1.0, + "content": "(with", + "type": "text" + }, + { + "bbox": [ + 454, + 129, + 488, + 141 + ], + "score": 0.9, + "content": "\\gamma _ { i } ~ = ~ 0", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 126, + 506, + 142 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 107, + 138, + 407, + 154 + ], + "spans": [ + { + "bbox": [ + 107, + 140, + 167, + 152 + ], + "score": 0.91, + "content": "i > \\operatorname* { m i n } ( n , d ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 138, + 187, + 154 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 187, + 140, + 199, + 151 + ], + "score": 0.87, + "content": "\\Gamma _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 138, + 351, + 154 + ], + "score": 1.0, + "content": "be the distribution of singular values", + "type": "text" + }, + { + "bbox": [ + 351, + 141, + 402, + 153 + ], + "score": 0.88, + "content": "\\left( \\gamma _ { 1 } , \\ldots , \\gamma _ { m } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 138, + 407, + 154 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 106, + 156, + 506, + 190 + ], + "lines": [ + { + "bbox": [ + 101, + 155, + 505, + 180 + ], + "spans": [ + { + "bbox": [ + 101, + 155, + 328, + 180 + ], + "score": 1.0, + "content": "Then, the optimal ridge parameter is constant for all", + "type": "text" + }, + { + "bbox": [ + 329, + 160, + 335, + 170 + ], + "score": 0.55, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 155, + 342, + 180 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 343, + 157, + 399, + 176 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\lambda _ { d } ^ { \\mathrm { o p t } } = \\frac { p ^ { 2 } \\widetilde \\sigma ^ { 2 } } { d | | \\theta | | _ { 2 } ^ { 2 } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 155, + 476, + 178 + ], + "score": 1.0, + "content": ". where we define", + "type": "text" + }, + { + "bbox": [ + 477, + 159, + 505, + 172 + ], + "score": 0.86, + "content": "\\widetilde { \\sigma } ^ { 2 } : = \\ :", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 107, + 174, + 406, + 191 + ], + "spans": [ + { + "bbox": [ + 107, + 174, + 167, + 191 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\sigma ^ { 2 } + \\frac { p - d } { p } | | \\boldsymbol { \\theta } | | _ { 2 } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 174, + 406, + 190 + ], + "score": 1.0, + "content": ". Moreover, the optimal expected test risk can be written as", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "interline_equation", + "bbox": [ + 204, + 195, + 406, + 236 + ], + "lines": [ + { + "bbox": [ + 204, + 195, + 406, + 236 + ], + "spans": [ + { + "bbox": [ + 204, + 195, + 406, + 236 + ], + "score": 0.94, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { d } ^ { \\mathrm { o p t } } ) = \\widetilde { \\sigma } ^ { 2 } + \\underset { ( \\gamma _ { 1 } , \\ldots , \\gamma _ { m } ) \\sim \\Gamma _ { d } } { \\mathbb { E } } \\left[ \\sum _ { i = 1 } ^ { p } \\frac { \\widetilde { \\sigma } ^ { 2 } } { \\gamma _ { i } ^ { 2 } + \\frac { \\widetilde { \\sigma } ^ { 2 } p ^ { 2 } } { d | | \\theta | | _ { 2 } ^ { 2 } } } \\right]", + "type": "interline_equation", + "image_path": "468fe85c9587c5a5c7cbe90d3a3b9b112d10447b03fa0a4f7669fc3630f11d15.jpg" + } + ] + } + ], + "index": 7.5, + "virtual_lines": [ + { + "bbox": [ + 204, + 195, + 406, + 215.5 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 204, + 215.5, + 406, + 236.0 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 246, + 503, + 269 + ], + "lines": [ + { + "bbox": [ + 105, + 245, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 505, + 260 + ], + "score": 1.0, + "content": "Proof. This proof follows exactly analogously as the proof of Lemma 2 from Lemma 1, in Sec-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 257, + 505, + 269 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 145, + 269 + ], + "score": 1.0, + "content": "tion A.1.", + "type": "text" + }, + { + "bbox": [ + 495, + 258, + 505, + 268 + ], + "score": 1.0, + "content": "□", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 105, + 275, + 504, + 301 + ], + "lines": [ + { + "bbox": [ + 105, + 273, + 504, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 185, + 289 + ], + "score": 1.0, + "content": "Lemma 4. For all", + "type": "text" + }, + { + "bbox": [ + 186, + 276, + 217, + 286 + ], + "score": 0.62, + "content": "\\theta \\in \\mathbb { R } ^ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 273, + 222, + 289 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 222, + 276, + 261, + 287 + ], + "score": 0.65, + "content": "d , n \\in \\mathbb { N } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 273, + 283, + 289 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 284, + 276, + 311, + 286 + ], + "score": 0.88, + "content": "\\lambda > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 273, + 328, + 289 + ], + "score": 1.0, + "content": ", let", + "type": "text" + }, + { + "bbox": [ + 329, + 276, + 376, + 286 + ], + "score": 0.91, + "content": "\\ b { X } \\in \\mathbb { R } ^ { n \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 273, + 470, + 289 + ], + "score": 1.0, + "content": "be a matrix with i.i.d.", + "type": "text" + }, + { + "bbox": [ + 471, + 275, + 504, + 288 + ], + "score": 0.92, + "content": "\\mathcal { N } ( 0 , 1 )", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 287, + 477, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 154, + 302 + ], + "score": 1.0, + "content": "entries. Let", + "type": "text" + }, + { + "bbox": [ + 155, + 288, + 198, + 299 + ], + "score": 0.91, + "content": "P \\in \\mathbb { R } ^ { d \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 287, + 365, + 302 + ], + "score": 1.0, + "content": "be a random orthonormal matrix. Define", + "type": "text" + }, + { + "bbox": [ + 365, + 287, + 414, + 299 + ], + "score": 0.91, + "content": "\\widetilde X : = X P ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 287, + 433, + 302 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 433, + 289, + 473, + 301 + ], + "score": 0.91, + "content": "\\beta ^ { * } : = P \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 287, + 477, + 302 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 106, + 306, + 505, + 331 + ], + "lines": [ + { + "bbox": [ + 105, + 304, + 506, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 304, + 123, + 321 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 308, + 175, + 319 + ], + "score": 0.89, + "content": "\\left( \\gamma _ { 1 } , \\dots , \\gamma _ { m } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 304, + 344, + 321 + ], + "score": 1.0, + "content": "be the singular values of the data matrix", + "type": "text" + }, + { + "bbox": [ + 345, + 306, + 392, + 318 + ], + "score": 0.91, + "content": "\\tilde { X } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 304, + 411, + 321 + ], + "score": 1.0, + "content": ", for", + "type": "text" + }, + { + "bbox": [ + 411, + 307, + 480, + 319 + ], + "score": 0.9, + "content": "m : = \\operatorname* { m a x } ( n , d )", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 304, + 506, + 321 + ], + "score": 1.0, + "content": "(with", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 317, + 451, + 333 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 134, + 330 + ], + "score": 0.76, + "content": "\\gamma _ { i } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 317, + 149, + 333 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 150, + 318, + 210, + 330 + ], + "score": 0.88, + "content": "i > \\operatorname* { m i n } ( n , d ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 317, + 230, + 333 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 231, + 319, + 243, + 330 + ], + "score": 0.88, + "content": "\\Gamma _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 317, + 394, + 333 + ], + "score": 1.0, + "content": "be the distribution of singular values", + "type": "text" + }, + { + "bbox": [ + 394, + 319, + 446, + 330 + ], + "score": 0.89, + "content": "\\left( \\gamma _ { 1 } , \\dots , \\gamma _ { m } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 317, + 451, + 333 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 107, + 335, + 226, + 347 + ], + "lines": [ + { + "bbox": [ + 106, + 335, + 226, + 348 + ], + "spans": [ + { + "bbox": [ + 106, + 335, + 226, + 348 + ], + "score": 1.0, + "content": "Then, the expected test risk is", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 352, + 419, + 439 + ], + "lines": [ + { + "bbox": [ + 192, + 352, + 419, + 439 + ], + "spans": [ + { + "bbox": [ + 192, + 352, + 419, + 439 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\overline { { R } } ( \\hat { \\beta } _ { d , \\lambda } ) : = \\underset { P } { \\mathbb { E } } \\underset { \\widetilde { X } , \\widetilde { y } \\sim \\mathcal { D } ^ { n } } { \\mathbb { E } } [ R _ { P } ( \\hat { \\beta } _ { d , \\lambda } ( \\widetilde { X } , \\overrightarrow { y } ) ] } \\\\ & { = \\sigma ^ { 2 } + ( 1 - \\frac { d } { p } ) | | \\theta | | _ { 2 } ^ { 2 } } \\\\ & { + \\underset { ( \\gamma _ { 1 } , \\dotsc , \\gamma _ { m } ) \\sim \\Gamma _ { d } } { \\mathbb { E } } \\left[ \\underset { i = 1 } { \\overset { p } { \\sum } } \\frac { ( \\sigma ^ { 2 } + \\frac { p - d } { p } | | \\theta | | _ { 2 } ^ { 2 } ) \\gamma _ { i } ^ { 2 } + \\frac { d } { p ^ { 2 } } | | \\theta | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } \\right] } \\end{array}", + "type": "interline_equation", + "image_path": "741d2372fad09c0cbce14bcf5839b8447076a4cbcd48b57657173a4429b1c348.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 192, + 352, + 419, + 369.4 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 192, + 369.4, + 419, + 386.79999999999995 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 192, + 386.79999999999995, + 419, + 404.19999999999993 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 192, + 404.19999999999993, + 419, + 421.5999999999999 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 192, + 421.5999999999999, + 419, + 438.9999999999999 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 449, + 504, + 471 + ], + "lines": [ + { + "bbox": [ + 106, + 448, + 505, + 462 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 505, + 462 + ], + "score": 1.0, + "content": "Proof of Lemma 4. We first define the parameter that minimizes the population risk. It follows", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 459, + 160, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 160, + 474 + ], + "score": 1.0, + "content": "directly that:", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "interline_equation", + "bbox": [ + 246, + 470, + 365, + 492 + ], + "lines": [ + { + "bbox": [ + 246, + 470, + 365, + 492 + ], + "spans": [ + { + "bbox": [ + 246, + 470, + 365, + 492 + ], + "score": 0.93, + "content": "\\beta _ { P } ^ { * } : = \\underset { \\beta \\in \\mathbb { R } ^ { d } } { \\mathrm { a r g m i n } } R _ { P } ( \\beta ) = P \\theta", + "type": "interline_equation", + "image_path": "35bea86cddbd631fb6b4870684bfe035967b6d8211cf49b4cb25e93f8ad7fe5c.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 246, + 470, + 365, + 492 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 501, + 234, + 513 + ], + "lines": [ + { + "bbox": [ + 106, + 501, + 235, + 514 + ], + "spans": [ + { + "bbox": [ + 106, + 501, + 235, + 514 + ], + "score": 1.0, + "content": "First, we can expand the risk as", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "interline_equation", + "bbox": [ + 204, + 517, + 407, + 652 + ], + "lines": [ + { + "bbox": [ + 204, + 517, + 407, + 652 + ], + "spans": [ + { + "bbox": [ + 204, + 517, + 407, + 652 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { R ( \\hat { \\beta } ) = \\underset { ( \\bar { x } , y ) \\sim \\mathcal { D } } { \\mathbb { E } } [ ( \\langle P x , \\hat { \\beta } \\rangle - y ) ^ { 2 } ] } \\\\ & { \\quad = \\underset { ( \\bar { x } , y ) \\sim \\mathcal { D } , \\eta \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } ) } { \\mathbb { E } } [ ( \\langle x , P ^ { T } \\hat { \\beta } - \\theta \\rangle + \\eta ) ^ { 2 } ] } \\\\ & { \\quad = \\sigma ^ { 2 } + \\vert \\vert \\theta - P ^ { T } \\hat { \\beta } \\vert \\vert _ { 2 } ^ { 2 } } \\\\ & { \\quad = \\sigma ^ { 2 } + \\vert \\vert \\theta - P ^ { T } \\beta ^ { * } \\vert \\vert _ { 2 } ^ { 2 } + \\vert \\vert P ^ { T } \\beta ^ { * } - P ^ { T } \\hat { \\beta } \\vert \\vert _ { 2 } ^ { 2 } } \\\\ & { \\quad + 2 \\langle ( \\theta - P ^ { T } \\beta ^ { * } ) , P ^ { T } \\beta ^ { * } - P ^ { T } \\hat { \\beta } \\rangle } \\\\ & { \\quad = \\sigma ^ { 2 } + \\vert \\vert \\theta - P ^ { T } \\beta ^ { * } \\vert \\vert _ { 2 } ^ { 2 } + \\vert \\vert P ^ { T } \\beta ^ { * } - P ^ { T } \\hat { \\beta } \\vert \\vert _ { 2 } ^ { 2 } } \\\\ & { \\quad = \\sigma ^ { 2 } + \\vert \\vert \\vert \\theta - P ^ { T } P \\theta \\vert \\vert _ { 2 } ^ { 2 } + \\vert \\vert \\beta ^ { * } - \\hat { \\beta } \\vert \\vert _ { 2 } ^ { 2 } } \\end{array}", + "type": "interline_equation", + "image_path": "03d187ef1b8071dac932f45747b3294d7774fd0b3adde9b08928e633c8afcb6b.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 204, + 517, + 407, + 532.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 204, + 532.0, + 407, + 547.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 204, + 547.0, + 407, + 562.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 204, + 562.0, + 407, + 577.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 204, + 577.0, + 407, + 592.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 204, + 592.0, + 407, + 607.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 204, + 607.0, + 407, + 622.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 204, + 622.0, + 407, + 637.0 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 204, + 637.0, + 407, + 652.0 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 660, + 505, + 684 + ], + "lines": [ + { + "bbox": [ + 106, + 660, + 505, + 673 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 442, + 673 + ], + "score": 1.0, + "content": "The cross terms in Line (22) vanish because the first-order optimality condition for", + "type": "text" + }, + { + "bbox": [ + 442, + 661, + 453, + 672 + ], + "score": 0.89, + "content": "\\beta ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 660, + 505, + 673 + ], + "score": 1.0, + "content": "implies that", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 107, + 669, + 444, + 685 + ], + "spans": [ + { + "bbox": [ + 107, + 672, + 118, + 683 + ], + "score": 0.87, + "content": "\\beta ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 119, + 669, + 154, + 685 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + }, + { + "bbox": [ + 154, + 671, + 235, + 684 + ], + "score": 0.92, + "content": "P ( \\theta ^ { * } - P ^ { T } \\beta ^ { * } ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 669, + 444, + 685 + ], + "score": 1.0, + "content": ". We now simplify each of the two remaining terms.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 106, + 689, + 184, + 700 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 185, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 185, + 701 + ], + "score": 1.0, + "content": "First, we have that:", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 704, + 374, + 731 + ], + "lines": [ + { + "bbox": [ + 236, + 704, + 374, + 731 + ], + "spans": [ + { + "bbox": [ + 236, + 704, + 374, + 731 + ], + "score": 0.93, + "content": "\\underset { P } { \\mathbb { E } } | | \\theta - P ^ { T } P \\theta | | _ { 2 } ^ { 2 } = ( 1 - \\frac { d } { p } ) | | \\theta | | _ { 2 } ^ { 2 }", + "type": "interline_equation", + "image_path": "4669a600f5dddc038e7c628ec71b91a5531e739c9c42893ae9b17ddadb44a8bd.jpg" + } + ] + } + ], + "index": 37, + "virtual_lines": [ + { + "bbox": [ + 236, + 704, + 374, + 731 + ], + "spans": [], + "index": 37 + } + ] + } + ], + "page_idx": 13, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "14", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 82, + 259, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 260, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 260, + 95 + ], + "score": 1.0, + "content": "A.2 PROJECTION MODEL PROOFS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 102, + 505, + 153 + ], + "lines": [ + { + "bbox": [ + 105, + 101, + 504, + 116 + ], + "spans": [ + { + "bbox": [ + 105, + 101, + 185, + 116 + ], + "score": 1.0, + "content": "Lemma 3. For all", + "type": "text" + }, + { + "bbox": [ + 186, + 104, + 218, + 114 + ], + "score": 0.86, + "content": "\\theta \\in \\mathbb { R } ^ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 101, + 222, + 116 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 222, + 104, + 261, + 115 + ], + "score": 0.82, + "content": "d , n \\in \\mathbb { N } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 101, + 283, + 116 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 284, + 104, + 311, + 114 + ], + "score": 0.88, + "content": "\\lambda > 0 ;", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 101, + 328, + 116 + ], + "score": 1.0, + "content": ", let", + "type": "text" + }, + { + "bbox": [ + 329, + 103, + 376, + 114 + ], + "score": 0.91, + "content": "\\ b { X } \\in \\mathbb { R } ^ { n \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 101, + 470, + 116 + ], + "score": 1.0, + "content": "be a matrix with i.i.d.", + "type": "text" + }, + { + "bbox": [ + 471, + 103, + 504, + 115 + ], + "score": 0.92, + "content": "\\mathcal { N } ( 0 , 1 )", + "type": "inline_equation" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 112, + 503, + 131 + ], + "spans": [ + { + "bbox": [ + 104, + 112, + 157, + 131 + ], + "score": 1.0, + "content": "entries. Let", + "type": "text" + }, + { + "bbox": [ + 157, + 115, + 203, + 127 + ], + "score": 0.91, + "content": "P \\in \\mathbb { R } ^ { d \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 112, + 376, + 131 + ], + "score": 1.0, + "content": "be a random orthonormal matrix. Define", + "type": "text" + }, + { + "bbox": [ + 376, + 114, + 428, + 127 + ], + "score": 0.91, + "content": "\\widetilde { X } : = X P ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 112, + 451, + 131 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 451, + 116, + 503, + 129 + ], + "score": 0.89, + "content": "\\left( \\gamma _ { 1 } , \\dots , \\gamma _ { m } \\right)", + "type": "inline_equation" + } + ], + "index": 2 + }, + { + "bbox": [ + 104, + 126, + 506, + 142 + ], + "spans": [ + { + "bbox": [ + 104, + 126, + 282, + 142 + ], + "score": 1.0, + "content": "be the singular values of the data matrix", + "type": "text" + }, + { + "bbox": [ + 282, + 127, + 333, + 140 + ], + "score": 0.91, + "content": "\\tilde { X } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 126, + 354, + 142 + ], + "score": 1.0, + "content": ", for", + "type": "text" + }, + { + "bbox": [ + 354, + 129, + 428, + 141 + ], + "score": 0.87, + "content": "m : = \\operatorname* { m a x } ( n , d )", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 126, + 454, + 142 + ], + "score": 1.0, + "content": "(with", + "type": "text" + }, + { + "bbox": [ + 454, + 129, + 488, + 141 + ], + "score": 0.9, + "content": "\\gamma _ { i } ~ = ~ 0", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 126, + 506, + 142 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 107, + 138, + 407, + 154 + ], + "spans": [ + { + "bbox": [ + 107, + 140, + 167, + 152 + ], + "score": 0.91, + "content": "i > \\operatorname* { m i n } ( n , d ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 138, + 187, + 154 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 187, + 140, + 199, + 151 + ], + "score": 0.87, + "content": "\\Gamma _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 138, + 351, + 154 + ], + "score": 1.0, + "content": "be the distribution of singular values", + "type": "text" + }, + { + "bbox": [ + 351, + 141, + 402, + 153 + ], + "score": 0.88, + "content": "\\left( \\gamma _ { 1 } , \\ldots , \\gamma _ { m } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 138, + 407, + 154 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2.5, + "bbox_fs": [ + 104, + 101, + 506, + 154 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 156, + 506, + 190 + ], + "lines": [ + { + "bbox": [ + 101, + 155, + 505, + 180 + ], + "spans": [ + { + "bbox": [ + 101, + 155, + 328, + 180 + ], + "score": 1.0, + "content": "Then, the optimal ridge parameter is constant for all", + "type": "text" + }, + { + "bbox": [ + 329, + 160, + 335, + 170 + ], + "score": 0.55, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 155, + 342, + 180 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 343, + 157, + 399, + 176 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\lambda _ { d } ^ { \\mathrm { o p t } } = \\frac { p ^ { 2 } \\widetilde \\sigma ^ { 2 } } { d | | \\theta | | _ { 2 } ^ { 2 } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 155, + 476, + 178 + ], + "score": 1.0, + "content": ". where we define", + "type": "text" + }, + { + "bbox": [ + 477, + 159, + 505, + 172 + ], + "score": 0.86, + "content": "\\widetilde { \\sigma } ^ { 2 } : = \\ :", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 107, + 174, + 406, + 191 + ], + "spans": [ + { + "bbox": [ + 107, + 174, + 167, + 191 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\sigma ^ { 2 } + \\frac { p - d } { p } | | \\boldsymbol { \\theta } | | _ { 2 } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 174, + 406, + 190 + ], + "score": 1.0, + "content": ". Moreover, the optimal expected test risk can be written as", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 101, + 155, + 505, + 191 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 204, + 195, + 406, + 236 + ], + "lines": [ + { + "bbox": [ + 204, + 195, + 406, + 236 + ], + "spans": [ + { + "bbox": [ + 204, + 195, + 406, + 236 + ], + "score": 0.94, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { d } ^ { \\mathrm { o p t } } ) = \\widetilde { \\sigma } ^ { 2 } + \\underset { ( \\gamma _ { 1 } , \\ldots , \\gamma _ { m } ) \\sim \\Gamma _ { d } } { \\mathbb { E } } \\left[ \\sum _ { i = 1 } ^ { p } \\frac { \\widetilde { \\sigma } ^ { 2 } } { \\gamma _ { i } ^ { 2 } + \\frac { \\widetilde { \\sigma } ^ { 2 } p ^ { 2 } } { d | | \\theta | | _ { 2 } ^ { 2 } } } \\right]", + "type": "interline_equation", + "image_path": "468fe85c9587c5a5c7cbe90d3a3b9b112d10447b03fa0a4f7669fc3630f11d15.jpg" + } + ] + } + ], + "index": 7.5, + "virtual_lines": [ + { + "bbox": [ + 204, + 195, + 406, + 215.5 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 204, + 215.5, + 406, + 236.0 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 246, + 503, + 269 + ], + "lines": [ + { + "bbox": [ + 105, + 245, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 505, + 260 + ], + "score": 1.0, + "content": "Proof. This proof follows exactly analogously as the proof of Lemma 2 from Lemma 1, in Sec-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 257, + 505, + 269 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 145, + 269 + ], + "score": 1.0, + "content": "tion A.1.", + "type": "text" + }, + { + "bbox": [ + 495, + 258, + 505, + 268 + ], + "score": 1.0, + "content": "□", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 245, + 505, + 269 + ] + }, + { + "type": "list", + "bbox": [ + 105, + 275, + 504, + 301 + ], + "lines": [ + { + "bbox": [ + 105, + 273, + 504, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 185, + 289 + ], + "score": 1.0, + "content": "Lemma 4. For all", + "type": "text" + }, + { + "bbox": [ + 186, + 276, + 217, + 286 + ], + "score": 0.62, + "content": "\\theta \\in \\mathbb { R } ^ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 273, + 222, + 289 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 222, + 276, + 261, + 287 + ], + "score": 0.65, + "content": "d , n \\in \\mathbb { N } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 273, + 283, + 289 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 284, + 276, + 311, + 286 + ], + "score": 0.88, + "content": "\\lambda > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 273, + 328, + 289 + ], + "score": 1.0, + "content": ", let", + "type": "text" + }, + { + "bbox": [ + 329, + 276, + 376, + 286 + ], + "score": 0.91, + "content": "\\ b { X } \\in \\mathbb { R } ^ { n \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 273, + 470, + 289 + ], + "score": 1.0, + "content": "be a matrix with i.i.d.", + "type": "text" + }, + { + "bbox": [ + 471, + 275, + 504, + 288 + ], + "score": 0.92, + "content": "\\mathcal { N } ( 0 , 1 )", + "type": "inline_equation" + } + ], + "index": 11, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 287, + 477, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 154, + 302 + ], + "score": 1.0, + "content": "entries. Let", + "type": "text" + }, + { + "bbox": [ + 155, + 288, + 198, + 299 + ], + "score": 0.91, + "content": "P \\in \\mathbb { R } ^ { d \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 287, + 365, + 302 + ], + "score": 1.0, + "content": "be a random orthonormal matrix. Define", + "type": "text" + }, + { + "bbox": [ + 365, + 287, + 414, + 299 + ], + "score": 0.91, + "content": "\\widetilde X : = X P ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 287, + 433, + 302 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 433, + 289, + 473, + 301 + ], + "score": 0.91, + "content": "\\beta ^ { * } : = P \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 287, + 477, + 302 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true, + "is_list_end_line": true + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 273, + 504, + 302 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 306, + 505, + 331 + ], + "lines": [ + { + "bbox": [ + 105, + 304, + 506, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 304, + 123, + 321 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 308, + 175, + 319 + ], + "score": 0.89, + "content": "\\left( \\gamma _ { 1 } , \\dots , \\gamma _ { m } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 304, + 344, + 321 + ], + "score": 1.0, + "content": "be the singular values of the data matrix", + "type": "text" + }, + { + "bbox": [ + 345, + 306, + 392, + 318 + ], + "score": 0.91, + "content": "\\tilde { X } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 304, + 411, + 321 + ], + "score": 1.0, + "content": ", for", + "type": "text" + }, + { + "bbox": [ + 411, + 307, + 480, + 319 + ], + "score": 0.9, + "content": "m : = \\operatorname* { m a x } ( n , d )", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 304, + 506, + 321 + ], + "score": 1.0, + "content": "(with", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 317, + 451, + 333 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 134, + 330 + ], + "score": 0.76, + "content": "\\gamma _ { i } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 317, + 149, + 333 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 150, + 318, + 210, + 330 + ], + "score": 0.88, + "content": "i > \\operatorname* { m i n } ( n , d ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 317, + 230, + 333 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 231, + 319, + 243, + 330 + ], + "score": 0.88, + "content": "\\Gamma _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 317, + 394, + 333 + ], + "score": 1.0, + "content": "be the distribution of singular values", + "type": "text" + }, + { + "bbox": [ + 394, + 319, + 446, + 330 + ], + "score": 0.89, + "content": "\\left( \\gamma _ { 1 } , \\dots , \\gamma _ { m } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 317, + 451, + 333 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 304, + 506, + 333 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 335, + 226, + 347 + ], + "lines": [ + { + "bbox": [ + 106, + 335, + 226, + 348 + ], + "spans": [ + { + "bbox": [ + 106, + 335, + 226, + 348 + ], + "score": 1.0, + "content": "Then, the expected test risk is", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15, + "bbox_fs": [ + 106, + 335, + 226, + 348 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 352, + 419, + 439 + ], + "lines": [ + { + "bbox": [ + 192, + 352, + 419, + 439 + ], + "spans": [ + { + "bbox": [ + 192, + 352, + 419, + 439 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\overline { { R } } ( \\hat { \\beta } _ { d , \\lambda } ) : = \\underset { P } { \\mathbb { E } } \\underset { \\widetilde { X } , \\widetilde { y } \\sim \\mathcal { D } ^ { n } } { \\mathbb { E } } [ R _ { P } ( \\hat { \\beta } _ { d , \\lambda } ( \\widetilde { X } , \\overrightarrow { y } ) ] } \\\\ & { = \\sigma ^ { 2 } + ( 1 - \\frac { d } { p } ) | | \\theta | | _ { 2 } ^ { 2 } } \\\\ & { + \\underset { ( \\gamma _ { 1 } , \\dotsc , \\gamma _ { m } ) \\sim \\Gamma _ { d } } { \\mathbb { E } } \\left[ \\underset { i = 1 } { \\overset { p } { \\sum } } \\frac { ( \\sigma ^ { 2 } + \\frac { p - d } { p } | | \\theta | | _ { 2 } ^ { 2 } ) \\gamma _ { i } ^ { 2 } + \\frac { d } { p ^ { 2 } } | | \\theta | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } \\right] } \\end{array}", + "type": "interline_equation", + "image_path": "741d2372fad09c0cbce14bcf5839b8447076a4cbcd48b57657173a4429b1c348.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 192, + 352, + 419, + 369.4 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 192, + 369.4, + 419, + 386.79999999999995 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 192, + 386.79999999999995, + 419, + 404.19999999999993 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 192, + 404.19999999999993, + 419, + 421.5999999999999 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 192, + 421.5999999999999, + 419, + 438.9999999999999 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 449, + 504, + 471 + ], + "lines": [ + { + "bbox": [ + 106, + 448, + 505, + 462 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 505, + 462 + ], + "score": 1.0, + "content": "Proof of Lemma 4. We first define the parameter that minimizes the population risk. It follows", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 459, + 160, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 160, + 474 + ], + "score": 1.0, + "content": "directly that:", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 448, + 505, + 474 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 246, + 470, + 365, + 492 + ], + "lines": [ + { + "bbox": [ + 246, + 470, + 365, + 492 + ], + "spans": [ + { + "bbox": [ + 246, + 470, + 365, + 492 + ], + "score": 0.93, + "content": "\\beta _ { P } ^ { * } : = \\underset { \\beta \\in \\mathbb { R } ^ { d } } { \\mathrm { a r g m i n } } R _ { P } ( \\beta ) = P \\theta", + "type": "interline_equation", + "image_path": "35bea86cddbd631fb6b4870684bfe035967b6d8211cf49b4cb25e93f8ad7fe5c.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 246, + 470, + 365, + 492 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 501, + 234, + 513 + ], + "lines": [ + { + "bbox": [ + 106, + 501, + 235, + 514 + ], + "spans": [ + { + "bbox": [ + 106, + 501, + 235, + 514 + ], + "score": 1.0, + "content": "First, we can expand the risk as", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 106, + 501, + 235, + 514 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 204, + 517, + 407, + 652 + ], + "lines": [ + { + "bbox": [ + 204, + 517, + 407, + 652 + ], + "spans": [ + { + "bbox": [ + 204, + 517, + 407, + 652 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { R ( \\hat { \\beta } ) = \\underset { ( \\bar { x } , y ) \\sim \\mathcal { D } } { \\mathbb { E } } [ ( \\langle P x , \\hat { \\beta } \\rangle - y ) ^ { 2 } ] } \\\\ & { \\quad = \\underset { ( \\bar { x } , y ) \\sim \\mathcal { D } , \\eta \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } ) } { \\mathbb { E } } [ ( \\langle x , P ^ { T } \\hat { \\beta } - \\theta \\rangle + \\eta ) ^ { 2 } ] } \\\\ & { \\quad = \\sigma ^ { 2 } + \\vert \\vert \\theta - P ^ { T } \\hat { \\beta } \\vert \\vert _ { 2 } ^ { 2 } } \\\\ & { \\quad = \\sigma ^ { 2 } + \\vert \\vert \\theta - P ^ { T } \\beta ^ { * } \\vert \\vert _ { 2 } ^ { 2 } + \\vert \\vert P ^ { T } \\beta ^ { * } - P ^ { T } \\hat { \\beta } \\vert \\vert _ { 2 } ^ { 2 } } \\\\ & { \\quad + 2 \\langle ( \\theta - P ^ { T } \\beta ^ { * } ) , P ^ { T } \\beta ^ { * } - P ^ { T } \\hat { \\beta } \\rangle } \\\\ & { \\quad = \\sigma ^ { 2 } + \\vert \\vert \\theta - P ^ { T } \\beta ^ { * } \\vert \\vert _ { 2 } ^ { 2 } + \\vert \\vert P ^ { T } \\beta ^ { * } - P ^ { T } \\hat { \\beta } \\vert \\vert _ { 2 } ^ { 2 } } \\\\ & { \\quad = \\sigma ^ { 2 } + \\vert \\vert \\vert \\theta - P ^ { T } P \\theta \\vert \\vert _ { 2 } ^ { 2 } + \\vert \\vert \\beta ^ { * } - \\hat { \\beta } \\vert \\vert _ { 2 } ^ { 2 } } \\end{array}", + "type": "interline_equation", + "image_path": "03d187ef1b8071dac932f45747b3294d7774fd0b3adde9b08928e633c8afcb6b.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 204, + 517, + 407, + 532.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 204, + 532.0, + 407, + 547.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 204, + 547.0, + 407, + 562.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 204, + 562.0, + 407, + 577.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 204, + 577.0, + 407, + 592.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 204, + 592.0, + 407, + 607.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 204, + 607.0, + 407, + 622.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 204, + 622.0, + 407, + 637.0 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 204, + 637.0, + 407, + 652.0 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 660, + 505, + 684 + ], + "lines": [ + { + "bbox": [ + 106, + 660, + 505, + 673 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 442, + 673 + ], + "score": 1.0, + "content": "The cross terms in Line (22) vanish because the first-order optimality condition for", + "type": "text" + }, + { + "bbox": [ + 442, + 661, + 453, + 672 + ], + "score": 0.89, + "content": "\\beta ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 660, + 505, + 673 + ], + "score": 1.0, + "content": "implies that", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 107, + 669, + 444, + 685 + ], + "spans": [ + { + "bbox": [ + 107, + 672, + 118, + 683 + ], + "score": 0.87, + "content": "\\beta ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 119, + 669, + 154, + 685 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + }, + { + "bbox": [ + 154, + 671, + 235, + 684 + ], + "score": 0.92, + "content": "P ( \\theta ^ { * } - P ^ { T } \\beta ^ { * } ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 669, + 444, + 685 + ], + "score": 1.0, + "content": ". We now simplify each of the two remaining terms.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5, + "bbox_fs": [ + 106, + 660, + 505, + 685 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 689, + 184, + 700 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 185, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 185, + 701 + ], + "score": 1.0, + "content": "First, we have that:", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 687, + 185, + 701 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 704, + 374, + 731 + ], + "lines": [ + { + "bbox": [ + 236, + 704, + 374, + 731 + ], + "spans": [ + { + "bbox": [ + 236, + 704, + 374, + 731 + ], + "score": 0.93, + "content": "\\underset { P } { \\mathbb { E } } | | \\theta - P ^ { T } P \\theta | | _ { 2 } ^ { 2 } = ( 1 - \\frac { d } { p } ) | | \\theta | | _ { 2 } ^ { 2 }", + "type": "interline_equation", + "image_path": "4669a600f5dddc038e7c628ec71b91a5531e739c9c42893ae9b17ddadb44a8bd.jpg" + } + ] + } + ], + "index": 37, + "virtual_lines": [ + { + "bbox": [ + 236, + 704, + 374, + 731 + ], + "spans": [], + "index": 37 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 424, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 425, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 129, + 96 + ], + "score": 1.0, + "content": "since", + "type": "text" + }, + { + "bbox": [ + 129, + 81, + 153, + 92 + ], + "score": 0.91, + "content": "P ^ { T } P", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 80, + 323, + 96 + ], + "score": 1.0, + "content": "is an orthogonal projection onto a random", + "type": "text" + }, + { + "bbox": [ + 324, + 83, + 330, + 92 + ], + "score": 0.78, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 80, + 425, + 96 + ], + "score": 1.0, + "content": "-dimensional subspace.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 100, + 404, + 114 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 404, + 116 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 190, + 116 + ], + "score": 1.0, + "content": "Now, recall we have", + "type": "text" + }, + { + "bbox": [ + 190, + 102, + 241, + 113 + ], + "score": 0.92, + "content": "{ \\vec { y } } = X \\theta + \\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 99, + 269, + 116 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 269, + 101, + 336, + 114 + ], + "score": 0.92, + "content": "\\eta \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } I _ { n } )", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 99, + 404, + 116 + ], + "score": 1.0, + "content": ". Expand this as:", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 138, + 380, + 187 + ], + "lines": [ + { + "bbox": [ + 231, + 138, + 380, + 187 + ], + "spans": [ + { + "bbox": [ + 231, + 138, + 380, + 187 + ], + "score": 0.93, + "content": "\\begin{array} { l } { { \\vec { y } = X \\theta + \\eta } } \\\\ { { \\ = X P ^ { T } P \\theta + X ( 1 - P ^ { T } P ) \\theta + \\eta } } \\\\ { { \\ = \\widetilde { X } \\beta ^ { * } + \\varepsilon + \\eta } } \\end{array}", + "type": "interline_equation", + "image_path": "c1a9b8472650c02f7455387333ca5dfa7f0349357d7a1ca1091251cf1e45a972.jpg" + } + ] + } + ], + "index": 2.5, + "virtual_lines": [ + { + "bbox": [ + 231, + 138, + 380, + 162.5 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 231, + 162.5, + 380, + 187.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 194, + 505, + 231 + ], + "lines": [ + { + "bbox": [ + 105, + 194, + 505, + 209 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 133, + 209 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 195, + 214, + 208 + ], + "score": 0.91, + "content": "\\varepsilon : = X ( 1 - P ^ { T } P ) \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 194, + 318, + 209 + ], + "score": 1.0, + "content": ". Note that conditioned on", + "type": "text" + }, + { + "bbox": [ + 318, + 197, + 327, + 206 + ], + "score": 0.83, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 194, + 391, + 209 + ], + "score": 1.0, + "content": ", the three terms", + "type": "text" + }, + { + "bbox": [ + 391, + 194, + 411, + 208 + ], + "score": 0.88, + "content": "\\widetilde { X } , \\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 194, + 428, + 209 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 428, + 199, + 435, + 208 + ], + "score": 0.8, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 194, + 505, + 209 + ], + "score": 1.0, + "content": "are conditionally", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 206, + 505, + 221 + ], + "spans": [ + { + "bbox": [ + 105, + 206, + 184, + 221 + ], + "score": 1.0, + "content": "independent, since", + "type": "text" + }, + { + "bbox": [ + 185, + 208, + 208, + 217 + ], + "score": 0.85, + "content": "P ^ { T } P", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 206, + 227, + 221 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 227, + 207, + 275, + 219 + ], + "score": 0.9, + "content": "( I - P ^ { T } P )", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 206, + 308, + 221 + ], + "score": 1.0, + "content": "project", + "type": "text" + }, + { + "bbox": [ + 308, + 208, + 318, + 217 + ], + "score": 0.84, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 206, + 486, + 221 + ], + "score": 1.0, + "content": "onto orthogonal subspaces. And further,", + "type": "text" + }, + { + "bbox": [ + 487, + 209, + 505, + 218 + ], + "score": 0.81, + "content": "\\varepsilon \\sim", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 107, + 216, + 216, + 231 + ], + "spans": [ + { + "bbox": [ + 107, + 218, + 212, + 230 + ], + "score": 0.92, + "content": "\\mathcal { N } ( \\dot { 0 _ { \\cdot } } | | ( 1 - P ^ { T } P ) \\theta | | ^ { 2 } I _ { n } )", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 216, + 216, + 231 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5 + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 253, + 423, + 374 + ], + "lines": [ + { + "bbox": [ + 189, + 253, + 423, + 374 + ], + "spans": [ + { + "bbox": [ + 189, + 253, + 423, + 374 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\frac { \\mathbb { E } } { P } \\underset { \\tilde { X } , y } { \\mathbb { E } } | | \\hat { \\boldsymbol { \\beta } } - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { = \\underset { P } { \\mathbb { E } } \\underset { \\tilde { X } , y } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\boldsymbol { y } - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { = \\underset { P } { \\mathbb { E } } \\underset { \\tilde { X } , y , \\varepsilon , \\eta } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } ( \\widetilde { X } \\boldsymbol { \\beta } ^ { * } + \\varepsilon + \\eta ) - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { = \\underset { P } { \\overset { \\mathbb { E } } { \\mathbb { X } } } \\underset { y , \\varepsilon , \\eta } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\widetilde { X } \\boldsymbol { \\beta } ^ { * } - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { = \\underset { P } { \\overset { \\mathbb { E } } { \\mathbb { X } } } \\underset { y , \\varepsilon , \\eta } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\widetilde { X } \\boldsymbol { \\beta } ^ { * } - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { + \\| ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\varepsilon | | _ { 2 } ^ { 2 } + | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\eta | | _ { 2 } ^ { 2 } ] } \\end{array}", + "type": "interline_equation", + "image_path": "60e0378b64b76b4eab2103bf6418c25dfbf2648197e5f3b7ca1f73f584e033df.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 189, + 253, + 423, + 270.2857142857143 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 189, + 270.2857142857143, + 423, + 287.57142857142856 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 189, + 287.57142857142856, + 423, + 304.85714285714283 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 189, + 304.85714285714283, + 423, + 322.1428571428571 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 189, + 322.1428571428571, + 423, + 339.4285714285714 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 189, + 339.4285714285714, + 423, + 356.71428571428567 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 189, + 356.71428571428567, + 423, + 373.99999999999994 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 402, + 372, + 416 + ], + "lines": [ + { + "bbox": [ + 105, + 401, + 373, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 153, + 417 + ], + "score": 1.0, + "content": "Now, since", + "type": "text" + }, + { + "bbox": [ + 153, + 402, + 163, + 414 + ], + "score": 0.87, + "content": "\\widetilde { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 401, + 290, + 417 + ], + "score": 1.0, + "content": "is conditionally independent of", + "type": "text" + }, + { + "bbox": [ + 291, + 407, + 297, + 414 + ], + "score": 0.79, + "content": "\\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 401, + 360, + 417 + ], + "score": 1.0, + "content": "conditioned on", + "type": "text" + }, + { + "bbox": [ + 360, + 405, + 369, + 414 + ], + "score": 0.84, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 401, + 373, + 417 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "interline_equation", + "bbox": [ + 153, + 421, + 384, + 550 + ], + "lines": [ + { + "bbox": [ + 153, + 421, + 384, + 550 + ], + "spans": [ + { + "bbox": [ + 153, + 421, + 384, + 550 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\frac { \\mathbb { E } } { F } \\underset { \\tilde { X } , y , \\varepsilon | P } { \\mathbb { E } } \\ \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\varepsilon \\rVert _ { 2 } ^ { 2 } } \\\\ & { = \\mathbb { E } \\ \\underset { \\tilde { Y } } { \\mathbb { E } } \\ [ \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\rVert _ { F } ^ { 2 } \\ \\underset { \\varepsilon | P } { \\mathbb { E } } [ \\lVert \\varepsilon \\rVert _ { 2 } ^ { 2 } ] } \\\\ & { = \\frac { \\mathbb { E } } { \\frac { \\mathbb { E } } { \\tilde { X } } } \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\rVert _ { F } ^ { 2 } \\ \\underset { \\varepsilon , \\varepsilon } { \\mathbb { E } } [ \\lVert \\varepsilon \\rVert _ { 2 } ^ { 2 } ] } \\\\ & { = \\underset { \\tilde { X } } { \\mathbb { E } } [ \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\rVert _ { F } ^ { 2 } ] \\cdot \\underset { { P } , X } { \\mathbb { E } } [ \\lVert X ( 1 - P ^ { T } P ) \\theta \\rVert _ { 2 } ^ { 2 } ] } \\\\ & { = \\underset { \\tilde { X } } { \\mathbb { E } } [ \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\rVert _ { F } ^ { 2 } ] ( \\frac { p - d } { p } | \\theta \\rVert _ { 2 } ^ { 2 } ) } \\end{array}", + "type": "interline_equation", + "image_path": "15570c750f46fbfdd10667eca45b3e9a24a57fe46a295a8570217d0ece4d3a0e.jpg" + } + ] + } + ], + "index": 18.5, + "virtual_lines": [ + { + "bbox": [ + 153, + 421, + 384, + 437.125 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 153, + 437.125, + 384, + 453.25 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 153, + 453.25, + 384, + 469.375 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 153, + 469.375, + 384, + 485.5 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 153, + 485.5, + 384, + 501.625 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 153, + 501.625, + 384, + 517.75 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 153, + 517.75, + 384, + 533.875 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 153, + 533.875, + 384, + 550.0 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 557, + 446, + 572 + ], + "lines": [ + { + "bbox": [ + 105, + 556, + 447, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 343, + 573 + ], + "score": 1.0, + "content": "where Line (37) holds because the marginal distribution of", + "type": "text" + }, + { + "bbox": [ + 343, + 558, + 353, + 569 + ], + "score": 0.87, + "content": "\\widetilde { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 556, + 434, + 573 + ], + "score": 1.0, + "content": "does not depend on", + "type": "text" + }, + { + "bbox": [ + 434, + 560, + 443, + 569 + ], + "score": 0.83, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 556, + 447, + 573 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 106, + 578, + 147, + 590 + ], + "lines": [ + { + "bbox": [ + 106, + 576, + 149, + 592 + ], + "spans": [ + { + "bbox": [ + 106, + 576, + 149, + 592 + ], + "score": 1.0, + "content": "Similarly,", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "interline_equation", + "bbox": [ + 233, + 596, + 379, + 646 + ], + "lines": [ + { + "bbox": [ + 233, + 596, + 379, + 646 + ], + "spans": [ + { + "bbox": [ + 233, + 596, + 379, + 646 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\frac { \\mathbb { E } } { P } \\underset { \\widetilde { X } , y , \\eta | P } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\eta | | _ { 2 } ^ { 2 } } \\\\ & { = \\sigma ^ { 2 } \\underset { \\widetilde { X } } { \\mathbb { E } } [ | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } | | _ { F } ^ { 2 } ] } \\end{array}", + "type": "interline_equation", + "image_path": "27105b3c05a2ab3257c0e5570b44af98c9a9c874e94dd0667e9c9edeff10bd14.jpg" + } + ] + } + ], + "index": 25.5, + "virtual_lines": [ + { + "bbox": [ + 233, + 596, + 379, + 621.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 233, + 621.0, + 379, + 646.0 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 662, + 505, + 698 + ], + "lines": [ + { + "bbox": [ + 104, + 660, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 104, + 660, + 144, + 677 + ], + "score": 1.0, + "content": "Now let", + "type": "text" + }, + { + "bbox": [ + 144, + 662, + 203, + 674 + ], + "score": 0.91, + "content": "\\tilde { \\cal X } \\ = \\ { \\cal U } \\Sigma { \\cal V } ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 660, + 390, + 677 + ], + "score": 1.0, + "content": "be the full singular value decomposition of", + "type": "text" + }, + { + "bbox": [ + 391, + 662, + 401, + 674 + ], + "score": 0.86, + "content": "\\widetilde { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 660, + 428, + 677 + ], + "score": 1.0, + "content": ", with", + "type": "text" + }, + { + "bbox": [ + 429, + 663, + 505, + 676 + ], + "score": 0.89, + "content": "U \\ \\in \\ \\mathbb { R } ^ { n \\times n } , \\Sigma \\ \\in", + "type": "inline_equation" + } + ], + "index": 27 + }, + { + "bbox": [ + 107, + 672, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 107, + 674, + 178, + 686 + ], + "score": 0.86, + "content": "\\mathbb { R } ^ { n \\times d } , V \\in \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 672, + 199, + 690 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 200, + 675, + 248, + 687 + ], + "score": 0.89, + "content": "( \\gamma _ { 1 } , \\dots \\gamma _ { m } )", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 672, + 385, + 690 + ], + "score": 1.0, + "content": "denote the singular values, where", + "type": "text" + }, + { + "bbox": [ + 386, + 675, + 451, + 687 + ], + "score": 0.93, + "content": "m = \\operatorname* { m a x } ( n , d )", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 672, + 506, + 690 + ], + "score": 1.0, + "content": "and defining", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 685, + 213, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 135, + 698 + ], + "score": 0.89, + "content": "\\gamma _ { i } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 685, + 150, + 699 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 150, + 686, + 207, + 698 + ], + "score": 0.92, + "content": "i > \\operatorname* { m i n } ( n , d )", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 685, + 213, + 699 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 106, + 705, + 505, + 733 + ], + "lines": [ + { + "bbox": [ + 106, + 704, + 504, + 720 + ], + "spans": [ + { + "bbox": [ + 106, + 704, + 215, + 720 + ], + "score": 1.0, + "content": "Observe that by symmetry,", + "type": "text" + }, + { + "bbox": [ + 215, + 705, + 261, + 718 + ], + "score": 0.92, + "content": "\\widetilde { X } = X P ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 704, + 279, + 720 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 280, + 709, + 288, + 717 + ], + "score": 0.78, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 704, + 474, + 720 + ], + "score": 1.0, + "content": "are independent, because the joint distribution", + "type": "text" + }, + { + "bbox": [ + 474, + 705, + 504, + 719 + ], + "score": 0.91, + "content": "( \\widetilde { X } , P )", + "type": "inline_equation" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 718, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 718, + 239, + 734 + ], + "score": 1.0, + "content": "is equivalent to the distribution", + "type": "text" + }, + { + "bbox": [ + 239, + 719, + 284, + 732 + ], + "score": 0.92, + "content": "( \\widetilde { X } Q , P Q )", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 718, + 396, + 734 + ], + "score": 1.0, + "content": "for a random orthonormal", + "type": "text" + }, + { + "bbox": [ + 397, + 720, + 444, + 732 + ], + "score": 0.92, + "content": "Q \\in \\mathbb { R } ^ { p \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 718, + 475, + 734 + ], + "score": 1.0, + "content": ". Thus", + "type": "text" + }, + { + "bbox": [ + 475, + 719, + 486, + 730 + ], + "score": 0.85, + "content": "\\widetilde { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 718, + 505, + 734 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + } + ], + "page_idx": 14, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "15", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 424, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 425, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 129, + 96 + ], + "score": 1.0, + "content": "since", + "type": "text" + }, + { + "bbox": [ + 129, + 81, + 153, + 92 + ], + "score": 0.91, + "content": "P ^ { T } P", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 80, + 323, + 96 + ], + "score": 1.0, + "content": "is an orthogonal projection onto a random", + "type": "text" + }, + { + "bbox": [ + 324, + 83, + 330, + 92 + ], + "score": 0.78, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 80, + 425, + 96 + ], + "score": 1.0, + "content": "-dimensional subspace.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 80, + 425, + 96 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 100, + 404, + 114 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 404, + 116 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 190, + 116 + ], + "score": 1.0, + "content": "Now, recall we have", + "type": "text" + }, + { + "bbox": [ + 190, + 102, + 241, + 113 + ], + "score": 0.92, + "content": "{ \\vec { y } } = X \\theta + \\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 99, + 269, + 116 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 269, + 101, + 336, + 114 + ], + "score": 0.92, + "content": "\\eta \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } I _ { n } )", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 99, + 404, + 116 + ], + "score": 1.0, + "content": ". Expand this as:", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 99, + 404, + 116 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 138, + 380, + 187 + ], + "lines": [ + { + "bbox": [ + 231, + 138, + 380, + 187 + ], + "spans": [ + { + "bbox": [ + 231, + 138, + 380, + 187 + ], + "score": 0.93, + "content": "\\begin{array} { l } { { \\vec { y } = X \\theta + \\eta } } \\\\ { { \\ = X P ^ { T } P \\theta + X ( 1 - P ^ { T } P ) \\theta + \\eta } } \\\\ { { \\ = \\widetilde { X } \\beta ^ { * } + \\varepsilon + \\eta } } \\end{array}", + "type": "interline_equation", + "image_path": "c1a9b8472650c02f7455387333ca5dfa7f0349357d7a1ca1091251cf1e45a972.jpg" + } + ] + } + ], + "index": 2.5, + "virtual_lines": [ + { + "bbox": [ + 231, + 138, + 380, + 162.5 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 231, + 162.5, + 380, + 187.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 194, + 505, + 231 + ], + "lines": [ + { + "bbox": [ + 105, + 194, + 505, + 209 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 133, + 209 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 195, + 214, + 208 + ], + "score": 0.91, + "content": "\\varepsilon : = X ( 1 - P ^ { T } P ) \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 194, + 318, + 209 + ], + "score": 1.0, + "content": ". Note that conditioned on", + "type": "text" + }, + { + "bbox": [ + 318, + 197, + 327, + 206 + ], + "score": 0.83, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 194, + 391, + 209 + ], + "score": 1.0, + "content": ", the three terms", + "type": "text" + }, + { + "bbox": [ + 391, + 194, + 411, + 208 + ], + "score": 0.88, + "content": "\\widetilde { X } , \\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 194, + 428, + 209 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 428, + 199, + 435, + 208 + ], + "score": 0.8, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 194, + 505, + 209 + ], + "score": 1.0, + "content": "are conditionally", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 206, + 505, + 221 + ], + "spans": [ + { + "bbox": [ + 105, + 206, + 184, + 221 + ], + "score": 1.0, + "content": "independent, since", + "type": "text" + }, + { + "bbox": [ + 185, + 208, + 208, + 217 + ], + "score": 0.85, + "content": "P ^ { T } P", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 206, + 227, + 221 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 227, + 207, + 275, + 219 + ], + "score": 0.9, + "content": "( I - P ^ { T } P )", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 206, + 308, + 221 + ], + "score": 1.0, + "content": "project", + "type": "text" + }, + { + "bbox": [ + 308, + 208, + 318, + 217 + ], + "score": 0.84, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 206, + 486, + 221 + ], + "score": 1.0, + "content": "onto orthogonal subspaces. And further,", + "type": "text" + }, + { + "bbox": [ + 487, + 209, + 505, + 218 + ], + "score": 0.81, + "content": "\\varepsilon \\sim", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 107, + 216, + 216, + 231 + ], + "spans": [ + { + "bbox": [ + 107, + 218, + 212, + 230 + ], + "score": 0.92, + "content": "\\mathcal { N } ( \\dot { 0 _ { \\cdot } } | | ( 1 - P ^ { T } P ) \\theta | | ^ { 2 } I _ { n } )", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 216, + 216, + 231 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 194, + 505, + 231 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 253, + 423, + 374 + ], + "lines": [ + { + "bbox": [ + 189, + 253, + 423, + 374 + ], + "spans": [ + { + "bbox": [ + 189, + 253, + 423, + 374 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\frac { \\mathbb { E } } { P } \\underset { \\tilde { X } , y } { \\mathbb { E } } | | \\hat { \\boldsymbol { \\beta } } - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { = \\underset { P } { \\mathbb { E } } \\underset { \\tilde { X } , y } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\boldsymbol { y } - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { = \\underset { P } { \\mathbb { E } } \\underset { \\tilde { X } , y , \\varepsilon , \\eta } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } ( \\widetilde { X } \\boldsymbol { \\beta } ^ { * } + \\varepsilon + \\eta ) - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { = \\underset { P } { \\overset { \\mathbb { E } } { \\mathbb { X } } } \\underset { y , \\varepsilon , \\eta } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\widetilde { X } \\boldsymbol { \\beta } ^ { * } - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { = \\underset { P } { \\overset { \\mathbb { E } } { \\mathbb { X } } } \\underset { y , \\varepsilon , \\eta } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\widetilde { X } \\boldsymbol { \\beta } ^ { * } - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { + \\| ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\varepsilon | | _ { 2 } ^ { 2 } + | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\eta | | _ { 2 } ^ { 2 } ] } \\end{array}", + "type": "interline_equation", + "image_path": "60e0378b64b76b4eab2103bf6418c25dfbf2648197e5f3b7ca1f73f584e033df.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 189, + 253, + 423, + 270.2857142857143 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 189, + 270.2857142857143, + 423, + 287.57142857142856 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 189, + 287.57142857142856, + 423, + 304.85714285714283 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 189, + 304.85714285714283, + 423, + 322.1428571428571 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 189, + 322.1428571428571, + 423, + 339.4285714285714 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 189, + 339.4285714285714, + 423, + 356.71428571428567 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 189, + 356.71428571428567, + 423, + 373.99999999999994 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 402, + 372, + 416 + ], + "lines": [ + { + "bbox": [ + 105, + 401, + 373, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 153, + 417 + ], + "score": 1.0, + "content": "Now, since", + "type": "text" + }, + { + "bbox": [ + 153, + 402, + 163, + 414 + ], + "score": 0.87, + "content": "\\widetilde { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 401, + 290, + 417 + ], + "score": 1.0, + "content": "is conditionally independent of", + "type": "text" + }, + { + "bbox": [ + 291, + 407, + 297, + 414 + ], + "score": 0.79, + "content": "\\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 401, + 360, + 417 + ], + "score": 1.0, + "content": "conditioned on", + "type": "text" + }, + { + "bbox": [ + 360, + 405, + 369, + 414 + ], + "score": 0.84, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 401, + 373, + 417 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 401, + 373, + 417 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 153, + 421, + 384, + 550 + ], + "lines": [ + { + "bbox": [ + 153, + 421, + 384, + 550 + ], + "spans": [ + { + "bbox": [ + 153, + 421, + 384, + 550 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\frac { \\mathbb { E } } { F } \\underset { \\tilde { X } , y , \\varepsilon | P } { \\mathbb { E } } \\ \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\varepsilon \\rVert _ { 2 } ^ { 2 } } \\\\ & { = \\mathbb { E } \\ \\underset { \\tilde { Y } } { \\mathbb { E } } \\ [ \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\rVert _ { F } ^ { 2 } \\ \\underset { \\varepsilon | P } { \\mathbb { E } } [ \\lVert \\varepsilon \\rVert _ { 2 } ^ { 2 } ] } \\\\ & { = \\frac { \\mathbb { E } } { \\frac { \\mathbb { E } } { \\tilde { X } } } \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\rVert _ { F } ^ { 2 } \\ \\underset { \\varepsilon , \\varepsilon } { \\mathbb { E } } [ \\lVert \\varepsilon \\rVert _ { 2 } ^ { 2 } ] } \\\\ & { = \\underset { \\tilde { X } } { \\mathbb { E } } [ \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\rVert _ { F } ^ { 2 } ] \\cdot \\underset { { P } , X } { \\mathbb { E } } [ \\lVert X ( 1 - P ^ { T } P ) \\theta \\rVert _ { 2 } ^ { 2 } ] } \\\\ & { = \\underset { \\tilde { X } } { \\mathbb { E } } [ \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\rVert _ { F } ^ { 2 } ] ( \\frac { p - d } { p } | \\theta \\rVert _ { 2 } ^ { 2 } ) } \\end{array}", + "type": "interline_equation", + "image_path": "15570c750f46fbfdd10667eca45b3e9a24a57fe46a295a8570217d0ece4d3a0e.jpg" + } + ] + } + ], + "index": 18.5, + "virtual_lines": [ + { + "bbox": [ + 153, + 421, + 384, + 437.125 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 153, + 437.125, + 384, + 453.25 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 153, + 453.25, + 384, + 469.375 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 153, + 469.375, + 384, + 485.5 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 153, + 485.5, + 384, + 501.625 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 153, + 501.625, + 384, + 517.75 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 153, + 517.75, + 384, + 533.875 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 153, + 533.875, + 384, + 550.0 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 557, + 446, + 572 + ], + "lines": [ + { + "bbox": [ + 105, + 556, + 447, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 343, + 573 + ], + "score": 1.0, + "content": "where Line (37) holds because the marginal distribution of", + "type": "text" + }, + { + "bbox": [ + 343, + 558, + 353, + 569 + ], + "score": 0.87, + "content": "\\widetilde { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 556, + 434, + 573 + ], + "score": 1.0, + "content": "does not depend on", + "type": "text" + }, + { + "bbox": [ + 434, + 560, + 443, + 569 + ], + "score": 0.83, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 556, + 447, + 573 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 556, + 447, + 573 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 578, + 147, + 590 + ], + "lines": [ + { + "bbox": [ + 106, + 576, + 149, + 592 + ], + "spans": [ + { + "bbox": [ + 106, + 576, + 149, + 592 + ], + "score": 1.0, + "content": "Similarly,", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 106, + 576, + 149, + 592 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 233, + 596, + 379, + 646 + ], + "lines": [ + { + "bbox": [ + 233, + 596, + 379, + 646 + ], + "spans": [ + { + "bbox": [ + 233, + 596, + 379, + 646 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\frac { \\mathbb { E } } { P } \\underset { \\widetilde { X } , y , \\eta | P } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\eta | | _ { 2 } ^ { 2 } } \\\\ & { = \\sigma ^ { 2 } \\underset { \\widetilde { X } } { \\mathbb { E } } [ | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } | | _ { F } ^ { 2 } ] } \\end{array}", + "type": "interline_equation", + "image_path": "27105b3c05a2ab3257c0e5570b44af98c9a9c874e94dd0667e9c9edeff10bd14.jpg" + } + ] + } + ], + "index": 25.5, + "virtual_lines": [ + { + "bbox": [ + 233, + 596, + 379, + 621.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 233, + 621.0, + 379, + 646.0 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 662, + 505, + 698 + ], + "lines": [ + { + "bbox": [ + 104, + 660, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 104, + 660, + 144, + 677 + ], + "score": 1.0, + "content": "Now let", + "type": "text" + }, + { + "bbox": [ + 144, + 662, + 203, + 674 + ], + "score": 0.91, + "content": "\\tilde { \\cal X } \\ = \\ { \\cal U } \\Sigma { \\cal V } ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 660, + 390, + 677 + ], + "score": 1.0, + "content": "be the full singular value decomposition of", + "type": "text" + }, + { + "bbox": [ + 391, + 662, + 401, + 674 + ], + "score": 0.86, + "content": "\\widetilde { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 660, + 428, + 677 + ], + "score": 1.0, + "content": ", with", + "type": "text" + }, + { + "bbox": [ + 429, + 663, + 505, + 676 + ], + "score": 0.89, + "content": "U \\ \\in \\ \\mathbb { R } ^ { n \\times n } , \\Sigma \\ \\in", + "type": "inline_equation" + } + ], + "index": 27 + }, + { + "bbox": [ + 107, + 672, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 107, + 674, + 178, + 686 + ], + "score": 0.86, + "content": "\\mathbb { R } ^ { n \\times d } , V \\in \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 672, + 199, + 690 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 200, + 675, + 248, + 687 + ], + "score": 0.89, + "content": "( \\gamma _ { 1 } , \\dots \\gamma _ { m } )", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 672, + 385, + 690 + ], + "score": 1.0, + "content": "denote the singular values, where", + "type": "text" + }, + { + "bbox": [ + 386, + 675, + 451, + 687 + ], + "score": 0.93, + "content": "m = \\operatorname* { m a x } ( n , d )", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 672, + 506, + 690 + ], + "score": 1.0, + "content": "and defining", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 685, + 213, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 135, + 698 + ], + "score": 0.89, + "content": "\\gamma _ { i } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 685, + 150, + 699 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 150, + 686, + 207, + 698 + ], + "score": 0.92, + "content": "i > \\operatorname* { m i n } ( n , d )", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 685, + 213, + 699 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28, + "bbox_fs": [ + 104, + 660, + 506, + 699 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 705, + 505, + 733 + ], + "lines": [ + { + "bbox": [ + 106, + 704, + 504, + 720 + ], + "spans": [ + { + "bbox": [ + 106, + 704, + 215, + 720 + ], + "score": 1.0, + "content": "Observe that by symmetry,", + "type": "text" + }, + { + "bbox": [ + 215, + 705, + 261, + 718 + ], + "score": 0.92, + "content": "\\widetilde { X } = X P ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 704, + 279, + 720 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 280, + 709, + 288, + 717 + ], + "score": 0.78, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 704, + 474, + 720 + ], + "score": 1.0, + "content": "are independent, because the joint distribution", + "type": "text" + }, + { + "bbox": [ + 474, + 705, + 504, + 719 + ], + "score": 0.91, + "content": "( \\widetilde { X } , P )", + "type": "inline_equation" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 718, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 718, + 239, + 734 + ], + "score": 1.0, + "content": "is equivalent to the distribution", + "type": "text" + }, + { + "bbox": [ + 239, + 719, + 284, + 732 + ], + "score": 0.92, + "content": "( \\widetilde { X } Q , P Q )", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 718, + 396, + 734 + ], + "score": 1.0, + "content": "for a random orthonormal", + "type": "text" + }, + { + "bbox": [ + 397, + 720, + 444, + 732 + ], + "score": 0.92, + "content": "Q \\in \\mathbb { R } ^ { p \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 718, + 475, + 734 + ], + "score": 1.0, + "content": ". Thus", + "type": "text" + }, + { + "bbox": [ + 475, + 719, + 486, + 730 + ], + "score": 0.85, + "content": "\\widetilde { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 718, + 505, + 734 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 704, + 505, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 287, + 94 + ], + "lines": [ + { + "bbox": [ + 107, + 81, + 288, + 96 + ], + "spans": [ + { + "bbox": [ + 107, + 83, + 145, + 94 + ], + "score": 0.91, + "content": "\\beta ^ { * } = P \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 81, + 288, + 96 + ], + "score": 1.0, + "content": "are also independent, and we have:", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 207, + 99, + 406, + 304 + ], + "lines": [ + { + "bbox": [ + 207, + 99, + 406, + 304 + ], + "spans": [ + { + "bbox": [ + 207, + 99, + 406, + 304 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathbb { E } \\mathbb { E } \\| \\{ \\hat { X } ^ { \\prime } \\} \\hat { X } + \\lambda \\mathcal { I } \\} ^ { - 1 } \\hat { X } ^ { \\prime } \\hat { X } ^ { \\prime } - \\delta ^ { * } \\} \\| _ { 2 } ^ { 2 } } \\\\ & { = \\frac { 1 } { b } \\mathbb { E } \\hat { X } ^ { \\prime } \\| \\mathrm { H i s s } ( \\hat { \\mathcal { Z } } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda ) b ^ { \\mathcal { N } / 2 } \\| _ { 2 } ^ { 2 } } \\\\ & { = \\mathbb { E } \\mathbb { E } \\mathbb { E } \\mathbb { E } \\mathbb { E } \\bigg [ \\| \\mathrm { H i s s } ( \\hat { \\mathcal { Z } } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda ) \\| ^ { \\mathcal { N } / 2 } b ^ { \\mathcal { N } / 2 } \\| _ { 2 } ^ { 2 } } \\\\ & { - \\mathbb { E } \\mathbb { E } \\mathbb { E } \\mathbb { E } \\bigg [ \\| \\mathrm { H i s s } ( \\hat { \\mathcal { Z } } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda ) \\| ^ { \\mathcal { N } / 2 } \\bigg ] \\| _ { 2 } ^ { 2 } } \\\\ & { = \\mathbb { E } _ { \\hat { X } ^ { \\prime } \\sim \\mathrm { N } \\times \\mathrm { W } ( \\hat { \\mathcal { Z } } ) } \\mathbb { E } \\| \\mathrm { H i s s } ( \\hat { \\mathcal { Z } } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda ) \\| ^ { \\mathcal { N } / 2 } } \\\\ & { = \\mathbb { E } \\mathbb { E } \\| \\hat { X } ^ { \\prime } \\| ^ { 2 } \\mathbb { E } \\| \\mathrm { H } ^ { 2 } \\mathbb { E } \\bigg [ \\mathrm { H } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda \\Big ] ^ { \\| \\mathcal { N } / 2 } } \\\\ & { = \\frac { 1 } { b } \\mathbb { E } \\hat { X } ^ { \\prime } \\| ^ { 2 } \\mathbb { E } \\bigg [ \\mathcal { P } _ { \\frac { e } { 2 } } ^ { - 1 } \\frac { \\lambda ^ { 2 } } { b } \\Big ] ^ { 2 } } \\\\ & = \\frac { 1 } { b } \\mathbb { E } \\frac { \\hat { X } ^ { \\prime } } { \\| \\mathcal { P } \\| \\mathcal { P } \\| ^ { 2 } \\| _ { 2 } ^ { 2 } } \\mathbb { E } \\bigg [ \\int _ { 0 } ^ { \\mathcal { N } / 2 } \\frac { \\lambda ^ { 2 } } \\| \\mathcal { P } \\| _ { 2 } ^ { 2 } \\end{array}", + "type": "interline_equation", + "image_path": "2c5cf2c29a1457b5e11f9237a8780aec3ba4175cc252997049b6d706d1666b43.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 207, + 99, + 406, + 114.76923076923077 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 207, + 114.76923076923077, + 406, + 130.53846153846155 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 207, + 130.53846153846155, + 406, + 146.30769230769232 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 207, + 146.30769230769232, + 406, + 162.0769230769231 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 207, + 162.0769230769231, + 406, + 177.84615384615387 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 207, + 177.84615384615387, + 406, + 193.61538461538464 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 207, + 193.61538461538464, + 406, + 209.38461538461542 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 207, + 209.38461538461542, + 406, + 225.1538461538462 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 207, + 225.1538461538462, + 406, + 240.92307692307696 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 207, + 240.92307692307696, + 406, + 256.69230769230774 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 207, + 256.69230769230774, + 406, + 272.4615384615385 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 207, + 272.4615384615385, + 406, + 288.2307692307693 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 207, + 288.2307692307693, + 406, + 304.00000000000006 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 317, + 436, + 330 + ], + "lines": [ + { + "bbox": [ + 106, + 316, + 437, + 331 + ], + "spans": [ + { + "bbox": [ + 106, + 316, + 437, + 331 + ], + "score": 1.0, + "content": "Finally, continuing from Line (33), we can use Lines (38), (40), and (47) to write:", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "interline_equation", + "bbox": [ + 202, + 336, + 408, + 520 + ], + "lines": [ + { + "bbox": [ + 202, + 336, + 408, + 520 + ], + "spans": [ + { + "bbox": [ + 202, + 336, + 408, + 520 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\frac { \\mathbb { E } } { \\rho } \\frac { \\| \\tilde { \\rho } - \\tilde { \\rho } ^ { - 1 } \\| ^ { 2 } } { \\mathcal { F } _ { x , y } } } \\\\ & { = ( \\sigma ^ { 2 } + \\frac { \\rho - \\tilde { \\rho } - d } { p } \\| \\theta \\| _ { 2 } ^ { 2 } \\frac { \\mathbb { E } \\| ( \\tilde { X } ^ { \\mathcal { T } } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { \\mathcal { T } } \\| _ { \\mathcal { F } _ { x } ^ { 1 } } ^ { 2 } } { \\mathcal { F } _ { x } ^ { 1 } } } \\\\ & { + \\frac { d } { \\gamma } \\| \\theta \\| _ { 2 } ^ { 2 } \\frac { \\mathbb { E } } { \\varepsilon } \\| \\sum _ { i } ^ { 2 } \\frac { \\lambda ^ { 2 } } { ( \\sqrt { d } ^ { 2 } + \\lambda I ) ^ { 2 } } | } \\\\ & { = ( \\sigma ^ { 2 } + \\frac { p - d } { p } \\| \\theta \\| _ { 2 } ^ { 2 } ) \\frac { \\mathbb { E } } { \\Sigma } \\frac { \\gamma ^ { 2 } } { \\varepsilon } \\langle \\frac { \\eta _ { i } ^ { 2 } } { ( \\sqrt { d } ^ { 2 } + \\lambda I ) ^ { 2 } } | } \\\\ & { + \\frac { d } { \\gamma ^ { 2 } } \\| \\theta \\| _ { 2 } ^ { 2 } \\frac { \\mathbb { E } } { \\Sigma } \\frac { \\lambda ^ { 2 } } { \\langle \\frac { \\eta _ { i } ^ { 2 } + \\lambda I \\rangle ^ { 2 } } { \\varepsilon } } | } \\\\ & = \\frac { \\mathbb { E } } { \\nu } \\langle \\frac { ( \\sigma ^ { 2 } + \\frac { p - d - \\tilde { \\rho } - \\tilde { \\rho } - \\tilde { \\rho } - \\tilde { \\rho } } { i } ) | \\theta \\rangle _ { 2 } ^ { 2 } \\sqrt { \\frac { \\lambda ^ { 2 } } { \\varepsilon } + \\frac { d } { \\gamma ^ { 2 } } | \\theta | _ { 2 } ^ { 2 } \\lambda ^ { 2 } } } \\end{array}", + "type": "interline_equation", + "image_path": "afc96577bb1030ba4580be2296ccfb837633a4009485fbd8ae0a3eea348ab376.jpg" + } + ] + } + ], + "index": 20.5, + "virtual_lines": [ + { + "bbox": [ + 202, + 336, + 408, + 351.3333333333333 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 202, + 351.3333333333333, + 408, + 366.66666666666663 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 202, + 366.66666666666663, + 408, + 381.99999999999994 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 202, + 381.99999999999994, + 408, + 397.33333333333326 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 202, + 397.33333333333326, + 408, + 412.6666666666666 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 202, + 412.6666666666666, + 408, + 427.9999999999999 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 202, + 427.9999999999999, + 408, + 443.3333333333332 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 202, + 443.3333333333332, + 408, + 458.6666666666665 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 202, + 458.6666666666665, + 408, + 473.99999999999983 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 202, + 473.99999999999983, + 408, + 489.33333333333314 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 202, + 489.33333333333314, + 408, + 504.66666666666646 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 202, + 504.66666666666646, + 408, + 519.9999999999998 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 533, + 396, + 545 + ], + "lines": [ + { + "bbox": [ + 105, + 532, + 396, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 396, + 546 + ], + "score": 1.0, + "content": "Now, we can continue from Line (24), and apply lines (25), to conclude:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "interline_equation", + "bbox": [ + 198, + 568, + 413, + 648 + ], + "lines": [ + { + "bbox": [ + 198, + 568, + 413, + 648 + ], + "spans": [ + { + "bbox": [ + 198, + 568, + 413, + 648 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathbb { E } \\big [ R ( \\hat { \\beta } ) \\big ] = \\sigma ^ { 2 } + \\mathbb { E } [ | | \\theta - P ^ { T } P \\theta | | _ { 2 } ^ { 2 } ] + \\mathbb { E } [ | | \\beta ^ { * } - \\hat { \\beta } | | _ { 2 } ^ { 2 } ] } \\\\ & { \\qquad = \\sigma ^ { 2 } + ( 1 - \\frac { d } { p } ) | | \\theta | | _ { 2 } ^ { 2 } } \\\\ & { \\qquad + \\mathbb { E } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { p } \\frac { \\big ( \\sigma ^ { 2 } + \\frac { p - d } { p } | | \\theta | | _ { 2 } ^ { 2 } \\big ) \\gamma _ { i } ^ { 2 } + \\frac { d } { p ^ { 2 } } | | \\theta | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } } { \\big ( \\gamma _ { i } ^ { 2 } + \\lambda \\big ) ^ { 2 } } \\right] } \\end{array}", + "type": "interline_equation", + "image_path": "de85f54a0f8d77f7a08c992950801522d81c9da4a94877208449fe5367012368.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 198, + 568, + 413, + 584.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 198, + 584.0, + 413, + 600.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 198, + 600.0, + 413, + 616.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 198, + 616.0, + 413, + 632.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 198, + 632.0, + 413, + 648.0 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 684, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 684, + 506, + 699 + ], + "spans": [ + { + "bbox": [ + 105, + 684, + 431, + 699 + ], + "score": 1.0, + "content": "Proof of Theorem 3. This follows analogously to the proof of Theorem 1, Let", + "type": "text" + }, + { + "bbox": [ + 432, + 684, + 446, + 697 + ], + "score": 0.91, + "content": "\\widetilde { X } _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 684, + 466, + 699 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 466, + 684, + 491, + 698 + ], + "score": 0.93, + "content": "\\widetilde { X } _ { d + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 684, + 506, + 699 + ], + "score": 1.0, + "content": "be", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 694, + 505, + 710 + ], + "spans": [ + { + "bbox": [ + 105, + 694, + 232, + 710 + ], + "score": 1.0, + "content": "the observed data matrices for", + "type": "text" + }, + { + "bbox": [ + 232, + 697, + 239, + 707 + ], + "score": 0.81, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 694, + 258, + 710 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 258, + 697, + 283, + 707 + ], + "score": 0.9, + "content": "d + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 694, + 505, + 710 + ], + "score": 1.0, + "content": "e emodel size. As in Theorem 1, there exists a coupling", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 707, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 116, + 720 + ], + "score": 0.34, + "content": "\\Pi", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 708, + 222, + 722 + ], + "score": 1.0, + "content": "between the distributions", + "type": "text" + }, + { + "bbox": [ + 222, + 710, + 235, + 721 + ], + "score": 0.89, + "content": "\\Gamma _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 708, + 254, + 722 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 254, + 709, + 276, + 721 + ], + "score": 0.91, + "content": "\\Gamma _ { d + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 708, + 381, + 722 + ], + "score": 1.0, + "content": "of the singular values of", + "type": "text" + }, + { + "bbox": [ + 382, + 707, + 396, + 721 + ], + "score": 0.91, + "content": "\\widetilde { X } _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 396, + 708, + 415, + 722 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 416, + 707, + 440, + 721 + ], + "score": 0.93, + "content": "\\widetilde { X } _ { d + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "such that these", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 720, + 228, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 228, + 732 + ], + "score": 1.0, + "content": "singular values are interlaced.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34.5 + } + ], + "page_idx": 15, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 292, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 293, + 39 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 293, + 39 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 14 + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 653, + 505, + 664 + ], + "lines": [ + { + "bbox": [ + 495, + 655, + 505, + 665 + ], + "spans": [ + { + "bbox": [ + 495, + 655, + 505, + 665 + ], + "score": 0.999, + "content": "□", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 287, + 94 + ], + "lines": [ + { + "bbox": [ + 107, + 81, + 288, + 96 + ], + "spans": [ + { + "bbox": [ + 107, + 83, + 145, + 94 + ], + "score": 0.91, + "content": "\\beta ^ { * } = P \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 81, + 288, + 96 + ], + "score": 1.0, + "content": "are also independent, and we have:", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 107, + 81, + 288, + 96 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 207, + 99, + 406, + 304 + ], + "lines": [ + { + "bbox": [ + 207, + 99, + 406, + 304 + ], + "spans": [ + { + "bbox": [ + 207, + 99, + 406, + 304 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathbb { E } \\mathbb { E } \\| \\{ \\hat { X } ^ { \\prime } \\} \\hat { X } + \\lambda \\mathcal { I } \\} ^ { - 1 } \\hat { X } ^ { \\prime } \\hat { X } ^ { \\prime } - \\delta ^ { * } \\} \\| _ { 2 } ^ { 2 } } \\\\ & { = \\frac { 1 } { b } \\mathbb { E } \\hat { X } ^ { \\prime } \\| \\mathrm { H i s s } ( \\hat { \\mathcal { Z } } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda ) b ^ { \\mathcal { N } / 2 } \\| _ { 2 } ^ { 2 } } \\\\ & { = \\mathbb { E } \\mathbb { E } \\mathbb { E } \\mathbb { E } \\mathbb { E } \\bigg [ \\| \\mathrm { H i s s } ( \\hat { \\mathcal { Z } } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda ) \\| ^ { \\mathcal { N } / 2 } b ^ { \\mathcal { N } / 2 } \\| _ { 2 } ^ { 2 } } \\\\ & { - \\mathbb { E } \\mathbb { E } \\mathbb { E } \\mathbb { E } \\bigg [ \\| \\mathrm { H i s s } ( \\hat { \\mathcal { Z } } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda ) \\| ^ { \\mathcal { N } / 2 } \\bigg ] \\| _ { 2 } ^ { 2 } } \\\\ & { = \\mathbb { E } _ { \\hat { X } ^ { \\prime } \\sim \\mathrm { N } \\times \\mathrm { W } ( \\hat { \\mathcal { Z } } ) } \\mathbb { E } \\| \\mathrm { H i s s } ( \\hat { \\mathcal { Z } } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda ) \\| ^ { \\mathcal { N } / 2 } } \\\\ & { = \\mathbb { E } \\mathbb { E } \\| \\hat { X } ^ { \\prime } \\| ^ { 2 } \\mathbb { E } \\| \\mathrm { H } ^ { 2 } \\mathbb { E } \\bigg [ \\mathrm { H } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda \\Big ] ^ { \\| \\mathcal { N } / 2 } } \\\\ & { = \\frac { 1 } { b } \\mathbb { E } \\hat { X } ^ { \\prime } \\| ^ { 2 } \\mathbb { E } \\bigg [ \\mathcal { P } _ { \\frac { e } { 2 } } ^ { - 1 } \\frac { \\lambda ^ { 2 } } { b } \\Big ] ^ { 2 } } \\\\ & = \\frac { 1 } { b } \\mathbb { E } \\frac { \\hat { X } ^ { \\prime } } { \\| \\mathcal { P } \\| \\mathcal { P } \\| ^ { 2 } \\| _ { 2 } ^ { 2 } } \\mathbb { E } \\bigg [ \\int _ { 0 } ^ { \\mathcal { N } / 2 } \\frac { \\lambda ^ { 2 } } \\| \\mathcal { P } \\| _ { 2 } ^ { 2 } \\end{array}", + "type": "interline_equation", + "image_path": "2c5cf2c29a1457b5e11f9237a8780aec3ba4175cc252997049b6d706d1666b43.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 207, + 99, + 406, + 114.76923076923077 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 207, + 114.76923076923077, + 406, + 130.53846153846155 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 207, + 130.53846153846155, + 406, + 146.30769230769232 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 207, + 146.30769230769232, + 406, + 162.0769230769231 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 207, + 162.0769230769231, + 406, + 177.84615384615387 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 207, + 177.84615384615387, + 406, + 193.61538461538464 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 207, + 193.61538461538464, + 406, + 209.38461538461542 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 207, + 209.38461538461542, + 406, + 225.1538461538462 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 207, + 225.1538461538462, + 406, + 240.92307692307696 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 207, + 240.92307692307696, + 406, + 256.69230769230774 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 207, + 256.69230769230774, + 406, + 272.4615384615385 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 207, + 272.4615384615385, + 406, + 288.2307692307693 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 207, + 288.2307692307693, + 406, + 304.00000000000006 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 317, + 436, + 330 + ], + "lines": [ + { + "bbox": [ + 106, + 316, + 437, + 331 + ], + "spans": [ + { + "bbox": [ + 106, + 316, + 437, + 331 + ], + "score": 1.0, + "content": "Finally, continuing from Line (33), we can use Lines (38), (40), and (47) to write:", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 106, + 316, + 437, + 331 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 202, + 336, + 408, + 520 + ], + "lines": [ + { + "bbox": [ + 202, + 336, + 408, + 520 + ], + "spans": [ + { + "bbox": [ + 202, + 336, + 408, + 520 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\frac { \\mathbb { E } } { \\rho } \\frac { \\| \\tilde { \\rho } - \\tilde { \\rho } ^ { - 1 } \\| ^ { 2 } } { \\mathcal { F } _ { x , y } } } \\\\ & { = ( \\sigma ^ { 2 } + \\frac { \\rho - \\tilde { \\rho } - d } { p } \\| \\theta \\| _ { 2 } ^ { 2 } \\frac { \\mathbb { E } \\| ( \\tilde { X } ^ { \\mathcal { T } } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { \\mathcal { T } } \\| _ { \\mathcal { F } _ { x } ^ { 1 } } ^ { 2 } } { \\mathcal { F } _ { x } ^ { 1 } } } \\\\ & { + \\frac { d } { \\gamma } \\| \\theta \\| _ { 2 } ^ { 2 } \\frac { \\mathbb { E } } { \\varepsilon } \\| \\sum _ { i } ^ { 2 } \\frac { \\lambda ^ { 2 } } { ( \\sqrt { d } ^ { 2 } + \\lambda I ) ^ { 2 } } | } \\\\ & { = ( \\sigma ^ { 2 } + \\frac { p - d } { p } \\| \\theta \\| _ { 2 } ^ { 2 } ) \\frac { \\mathbb { E } } { \\Sigma } \\frac { \\gamma ^ { 2 } } { \\varepsilon } \\langle \\frac { \\eta _ { i } ^ { 2 } } { ( \\sqrt { d } ^ { 2 } + \\lambda I ) ^ { 2 } } | } \\\\ & { + \\frac { d } { \\gamma ^ { 2 } } \\| \\theta \\| _ { 2 } ^ { 2 } \\frac { \\mathbb { E } } { \\Sigma } \\frac { \\lambda ^ { 2 } } { \\langle \\frac { \\eta _ { i } ^ { 2 } + \\lambda I \\rangle ^ { 2 } } { \\varepsilon } } | } \\\\ & = \\frac { \\mathbb { E } } { \\nu } \\langle \\frac { ( \\sigma ^ { 2 } + \\frac { p - d - \\tilde { \\rho } - \\tilde { \\rho } - \\tilde { \\rho } - \\tilde { \\rho } } { i } ) | \\theta \\rangle _ { 2 } ^ { 2 } \\sqrt { \\frac { \\lambda ^ { 2 } } { \\varepsilon } + \\frac { d } { \\gamma ^ { 2 } } | \\theta | _ { 2 } ^ { 2 } \\lambda ^ { 2 } } } \\end{array}", + "type": "interline_equation", + "image_path": "afc96577bb1030ba4580be2296ccfb837633a4009485fbd8ae0a3eea348ab376.jpg" + } + ] + } + ], + "index": 20.5, + "virtual_lines": [ + { + "bbox": [ + 202, + 336, + 408, + 351.3333333333333 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 202, + 351.3333333333333, + 408, + 366.66666666666663 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 202, + 366.66666666666663, + 408, + 381.99999999999994 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 202, + 381.99999999999994, + 408, + 397.33333333333326 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 202, + 397.33333333333326, + 408, + 412.6666666666666 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 202, + 412.6666666666666, + 408, + 427.9999999999999 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 202, + 427.9999999999999, + 408, + 443.3333333333332 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 202, + 443.3333333333332, + 408, + 458.6666666666665 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 202, + 458.6666666666665, + 408, + 473.99999999999983 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 202, + 473.99999999999983, + 408, + 489.33333333333314 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 202, + 489.33333333333314, + 408, + 504.66666666666646 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 202, + 504.66666666666646, + 408, + 519.9999999999998 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 533, + 396, + 545 + ], + "lines": [ + { + "bbox": [ + 105, + 532, + 396, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 396, + 546 + ], + "score": 1.0, + "content": "Now, we can continue from Line (24), and apply lines (25), to conclude:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 532, + 396, + 546 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 198, + 568, + 413, + 648 + ], + "lines": [ + { + "bbox": [ + 198, + 568, + 413, + 648 + ], + "spans": [ + { + "bbox": [ + 198, + 568, + 413, + 648 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathbb { E } \\big [ R ( \\hat { \\beta } ) \\big ] = \\sigma ^ { 2 } + \\mathbb { E } [ | | \\theta - P ^ { T } P \\theta | | _ { 2 } ^ { 2 } ] + \\mathbb { E } [ | | \\beta ^ { * } - \\hat { \\beta } | | _ { 2 } ^ { 2 } ] } \\\\ & { \\qquad = \\sigma ^ { 2 } + ( 1 - \\frac { d } { p } ) | | \\theta | | _ { 2 } ^ { 2 } } \\\\ & { \\qquad + \\mathbb { E } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { p } \\frac { \\big ( \\sigma ^ { 2 } + \\frac { p - d } { p } | | \\theta | | _ { 2 } ^ { 2 } \\big ) \\gamma _ { i } ^ { 2 } + \\frac { d } { p ^ { 2 } } | | \\theta | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } } { \\big ( \\gamma _ { i } ^ { 2 } + \\lambda \\big ) ^ { 2 } } \\right] } \\end{array}", + "type": "interline_equation", + "image_path": "de85f54a0f8d77f7a08c992950801522d81c9da4a94877208449fe5367012368.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 198, + 568, + 413, + 584.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 198, + 584.0, + 413, + 600.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 198, + 600.0, + 413, + 616.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 198, + 616.0, + 413, + 632.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 198, + 632.0, + 413, + 648.0 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 684, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 684, + 506, + 699 + ], + "spans": [ + { + "bbox": [ + 105, + 684, + 431, + 699 + ], + "score": 1.0, + "content": "Proof of Theorem 3. This follows analogously to the proof of Theorem 1, Let", + "type": "text" + }, + { + "bbox": [ + 432, + 684, + 446, + 697 + ], + "score": 0.91, + "content": "\\widetilde { X } _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 684, + 466, + 699 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 466, + 684, + 491, + 698 + ], + "score": 0.93, + "content": "\\widetilde { X } _ { d + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 684, + 506, + 699 + ], + "score": 1.0, + "content": "be", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 694, + 505, + 710 + ], + "spans": [ + { + "bbox": [ + 105, + 694, + 232, + 710 + ], + "score": 1.0, + "content": "the observed data matrices for", + "type": "text" + }, + { + "bbox": [ + 232, + 697, + 239, + 707 + ], + "score": 0.81, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 694, + 258, + 710 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 258, + 697, + 283, + 707 + ], + "score": 0.9, + "content": "d + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 694, + 505, + 710 + ], + "score": 1.0, + "content": "e emodel size. As in Theorem 1, there exists a coupling", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 707, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 116, + 720 + ], + "score": 0.34, + "content": "\\Pi", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 708, + 222, + 722 + ], + "score": 1.0, + "content": "between the distributions", + "type": "text" + }, + { + "bbox": [ + 222, + 710, + 235, + 721 + ], + "score": 0.89, + "content": "\\Gamma _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 708, + 254, + 722 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 254, + 709, + 276, + 721 + ], + "score": 0.91, + "content": "\\Gamma _ { d + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 708, + 381, + 722 + ], + "score": 1.0, + "content": "of the singular values of", + "type": "text" + }, + { + "bbox": [ + 382, + 707, + 396, + 721 + ], + "score": 0.91, + "content": "\\widetilde { X } _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 396, + 708, + 415, + 722 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 416, + 707, + 440, + 721 + ], + "score": 0.93, + "content": "\\widetilde { X } _ { d + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "such that these", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 720, + 228, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 228, + 732 + ], + "score": 1.0, + "content": "singular values are interlaced.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34.5, + "bbox_fs": [ + 105, + 684, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 183, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 185, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 185, + 96 + ], + "score": 1.0, + "content": "Thus by Lemma 3,", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 199, + 99, + 409, + 197 + ], + "lines": [ + { + "bbox": [ + 199, + 99, + 409, + 197 + ], + "spans": [ + { + "bbox": [ + 199, + 99, + 409, + 197 + ], + "score": 0.94, + "content": "\\begin{array} { l } { \\overline { { R } } ( \\hat { \\beta } _ { d } ^ { \\mathrm { o p t } } ) = \\widetilde { \\sigma } ^ { 2 } + \\underset { ( \\gamma _ { 1 } , \\ldots , \\gamma _ { m } ) \\sim \\Gamma _ { d + 1 } } { \\mathbb { E } } \\left[ \\overset { p } { \\underset { i = 1 } { \\sum } } \\frac { \\widetilde { \\sigma } ^ { 2 } } { \\gamma _ { i } ^ { 2 } + \\frac { \\widetilde { \\sigma } ^ { 2 } p ^ { 2 } } { d | \\boldsymbol { \\theta } | | _ { 2 } ^ { 2 } } } \\right] } \\\\ { \\geq \\widetilde { \\sigma } ^ { 2 } + \\underset { ( \\widetilde { \\gamma } _ { 1 } , \\ldots , \\widetilde { \\gamma } _ { m } ) \\sim \\Gamma _ { d + 1 } } { \\mathbb { E } } \\left[ \\overset { p } { \\underset { i = 1 } { \\sum } } \\frac { \\widetilde { \\sigma } ^ { 2 } } { \\widetilde { \\gamma } _ { i } ^ { 2 } + \\frac { \\widetilde { \\sigma } ^ { 2 } p ^ { 2 } } { d | \\boldsymbol { \\theta } | | _ { 2 } ^ { 2 } } } \\right] } \\\\ { = \\overline { { R } } ( \\hat { \\beta } _ { d + 1 } ^ { \\mathrm { o p t } } ) } \\end{array}", + "type": "interline_equation", + "image_path": "1ea674240f9e02dc5bd479332892e9eca74d4cd7c9535d5e38da57b023ff0bac.jpg" + } + ] + } + ], + "index": 3.5, + "virtual_lines": [ + { + "bbox": [ + 199, + 99, + 409, + 115.33333333333333 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 199, + 115.33333333333333, + 409, + 131.66666666666666 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 199, + 131.66666666666666, + 409, + 148.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 199, + 148.0, + 409, + 164.33333333333334 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 199, + 164.33333333333334, + 409, + 180.66666666666669 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 199, + 180.66666666666669, + 409, + 197.00000000000003 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "title", + "bbox": [ + 108, + 225, + 254, + 237 + ], + "lines": [ + { + "bbox": [ + 106, + 225, + 255, + 238 + ], + "spans": [ + { + "bbox": [ + 106, + 225, + 255, + 238 + ], + "score": 1.0, + "content": "A.3 NONISOTROPIC REDUCTION", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 245, + 505, + 291 + ], + "lines": [ + { + "bbox": [ + 106, + 246, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 106, + 246, + 505, + 258 + ], + "score": 1.0, + "content": "Here we observe that results on isotropic regression in Section 2 also imply that ridge regression", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 258, + 505, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 505, + 270 + ], + "score": 1.0, + "content": "can be made sample-monotonic even for non-isotropic covariates, if an appropriate regularzier is", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 268, + 506, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 506, + 281 + ], + "score": 1.0, + "content": "applied. Specifically, the regularizer depends on the covariance on the inputs. This follows from a", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 280, + 390, + 292 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 390, + 292 + ], + "score": 1.0, + "content": "general equivalence between the non-isotropic and isotropic problems.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 106, + 293, + 503, + 317 + ], + "lines": [ + { + "bbox": [ + 104, + 292, + 501, + 306 + ], + "spans": [ + { + "bbox": [ + 104, + 292, + 185, + 306 + ], + "score": 1.0, + "content": "Lemma 5. For all", + "type": "text" + }, + { + "bbox": [ + 185, + 294, + 306, + 306 + ], + "score": 0.92, + "content": "n \\in \\mathbb { N } , d \\in \\mathbb { N } , \\lambda \\in \\mathbb { R } , \\sigma \\in \\mathbb { R } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 292, + 355, + 306 + ], + "score": 1.0, + "content": "covariance", + "type": "text" + }, + { + "bbox": [ + 356, + 293, + 399, + 304 + ], + "score": 0.9, + "content": "\\Sigma \\in \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 292, + 453, + 306 + ], + "score": 1.0, + "content": ", PSD matrix", + "type": "text" + }, + { + "bbox": [ + 454, + 293, + 501, + 304 + ], + "score": 0.91, + "content": "M \\in \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 304, + 299, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 304, + 177, + 318 + ], + "score": 1.0, + "content": "and ground-truth", + "type": "text" + }, + { + "bbox": [ + 178, + 305, + 213, + 317 + ], + "score": 0.91, + "content": "\\beta ^ { * } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 304, + 299, + 318 + ], + "score": 1.0, + "content": ", the following holds.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 108, + 322, + 258, + 334 + ], + "lines": [ + { + "bbox": [ + 106, + 321, + 260, + 336 + ], + "spans": [ + { + "bbox": [ + 106, + 321, + 260, + 336 + ], + "score": 1.0, + "content": "Consider the following two problems:", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 130, + 343, + 505, + 388 + ], + "lines": [ + { + "bbox": [ + 129, + 343, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 129, + 343, + 370, + 356 + ], + "score": 1.0, + "content": "1. Regularized regression on isotropic covariates, and an", + "type": "text" + }, + { + "bbox": [ + 370, + 344, + 382, + 353 + ], + "score": 0.8, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 343, + 505, + 356 + ], + "score": 1.0, + "content": "-regularizer. That is, suppose", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 354, + 504, + 368 + ], + "spans": [ + { + "bbox": [ + 142, + 357, + 149, + 364 + ], + "score": 0.46, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 354, + 187, + 368 + ], + "score": 1.0, + "content": "samples", + "type": "text" + }, + { + "bbox": [ + 188, + 355, + 211, + 366 + ], + "score": 0.9, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 354, + 324, + 368 + ], + "score": 1.0, + "content": "are drawn with covariates", + "type": "text" + }, + { + "bbox": [ + 324, + 354, + 383, + 367 + ], + "score": 0.93, + "content": "x \\sim \\mathcal { N } ( 0 , I _ { d } )", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 354, + 442, + 368 + ], + "score": 1.0, + "content": "and response", + "type": "text" + }, + { + "bbox": [ + 442, + 354, + 504, + 367 + ], + "score": 0.91, + "content": "y = \\langle \\beta ^ { * } , x \\rangle +", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 142, + 363, + 506, + 379 + ], + "spans": [ + { + "bbox": [ + 142, + 365, + 180, + 378 + ], + "score": 0.92, + "content": "\\mathcal { N } ( 0 , \\bar { \\sigma } ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 363, + 206, + 379 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 206, + 365, + 256, + 376 + ], + "score": 0.91, + "content": "\\ b { \\hat { X } } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 363, + 396, + 379 + ], + "score": 1.0, + "content": "be the matrix of covariates, and", + "type": "text" + }, + { + "bbox": [ + 396, + 366, + 403, + 377 + ], + "score": 0.79, + "content": "\\vec { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 363, + 506, + 379 + ], + "score": 1.0, + "content": "the vector of responses.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 142, + 376, + 183, + 388 + ], + "spans": [ + { + "bbox": [ + 142, + 376, + 183, + 388 + ], + "score": 1.0, + "content": "Consider", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16.5 + }, + { + "type": "interline_equation", + "bbox": [ + 246, + 391, + 400, + 415 + ], + "lines": [ + { + "bbox": [ + 246, + 391, + 400, + 415 + ], + "spans": [ + { + "bbox": [ + 246, + 391, + 400, + 415 + ], + "score": 0.93, + "content": "{ \\hat { \\beta } } _ { \\lambda } : = \\operatorname * { a r g m i n } _ { \\beta } | | X \\beta - { \\vec { y } } | | _ { 2 } ^ { 2 } + \\lambda | | \\beta | | _ { M } ^ { 2 }", + "type": "interline_equation", + "image_path": "02363f18ece46693d693587db157e2dcdb085e1e18082f637c3f89a762f72274.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 246, + 391, + 400, + 415 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 142, + 421, + 463, + 436 + ], + "lines": [ + { + "bbox": [ + 142, + 420, + 464, + 437 + ], + "spans": [ + { + "bbox": [ + 142, + 420, + 158, + 437 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 158, + 421, + 273, + 435 + ], + "score": 0.92, + "content": "\\overline { { R } } = \\mathbb { E } _ { X , y } [ | | \\hat { \\beta } - \\beta ^ { * } | | _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 420, + 464, + 437 + ], + "score": 1.0, + "content": "be the expected test risk of the above estimator.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 131, + 442, + 504, + 477 + ], + "lines": [ + { + "bbox": [ + 128, + 440, + 506, + 458 + ], + "spans": [ + { + "bbox": [ + 128, + 440, + 308, + 458 + ], + "score": 1.0, + "content": "2. Regularized regression with covariance", + "type": "text" + }, + { + "bbox": [ + 309, + 444, + 317, + 454 + ], + "score": 0.78, + "content": "\\Sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 440, + 357, + 458 + ], + "score": 1.0, + "content": ", and an", + "type": "text" + }, + { + "bbox": [ + 357, + 442, + 415, + 455 + ], + "score": 0.9, + "content": "( \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 440, + 506, + 458 + ], + "score": 1.0, + "content": "-regularizer. That is,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 140, + 453, + 505, + 470 + ], + "spans": [ + { + "bbox": [ + 140, + 453, + 178, + 470 + ], + "score": 1.0, + "content": "suppose", + "type": "text" + }, + { + "bbox": [ + 178, + 458, + 186, + 465 + ], + "score": 0.34, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 453, + 225, + 470 + ], + "score": 1.0, + "content": "samples", + "type": "text" + }, + { + "bbox": [ + 225, + 455, + 248, + 467 + ], + "score": 0.91, + "content": "( \\widetilde { x } , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 453, + 364, + 470 + ], + "score": 1.0, + "content": "are drawn with covariates", + "type": "text" + }, + { + "bbox": [ + 364, + 455, + 423, + 467 + ], + "score": 0.92, + "content": "\\widetilde { x } \\sim \\mathcal { N } ( 0 , \\Sigma )", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 453, + 484, + 470 + ], + "score": 1.0, + "content": "and response", + "type": "text" + }, + { + "bbox": [ + 484, + 456, + 505, + 467 + ], + "score": 0.84, + "content": "y =", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 143, + 466, + 239, + 478 + ], + "spans": [ + { + "bbox": [ + 143, + 466, + 221, + 478 + ], + "score": 0.92, + "content": "\\langle z ^ { \\ast } , \\widetilde { x } \\rangle + \\mathcal { N } ( 0 , \\widetilde { \\sigma } ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 466, + 239, + 478 + ], + "score": 1.0, + "content": "e, for", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "interline_equation", + "bbox": [ + 292, + 476, + 354, + 491 + ], + "lines": [ + { + "bbox": [ + 292, + 476, + 354, + 491 + ], + "spans": [ + { + "bbox": [ + 292, + 476, + 354, + 491 + ], + "score": 0.92, + "content": "z ^ { * } = \\Sigma ^ { - 1 / 2 } \\beta ^ { * }", + "type": "interline_equation", + "image_path": "df06493abeb238642e8c8f74a3139cd40fd2e81f06e4936a7d7cad291c1fde94.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 292, + 476, + 354, + 491 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 142, + 495, + 477, + 508 + ], + "lines": [ + { + "bbox": [ + 140, + 492, + 478, + 510 + ], + "spans": [ + { + "bbox": [ + 140, + 492, + 158, + 510 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 158, + 494, + 203, + 506 + ], + "score": 0.91, + "content": "\\widetilde { X } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 492, + 333, + 510 + ], + "score": 1.0, + "content": "be the matrix of covariates, and", + "type": "text" + }, + { + "bbox": [ + 334, + 496, + 340, + 508 + ], + "score": 0.77, + "content": "\\vec { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 492, + 478, + 510 + ], + "score": 1.0, + "content": "the vector of responses. Consider", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 512, + 415, + 534 + ], + "lines": [ + { + "bbox": [ + 231, + 512, + 415, + 534 + ], + "spans": [ + { + "bbox": [ + 231, + 512, + 415, + 534 + ], + "score": 0.93, + "content": "\\hat { z } _ { \\lambda } : = \\operatorname * { a r g m i n } _ { z } | | \\widetilde { X } z - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda | | z | | _ { \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } } ^ { 2 }", + "type": "interline_equation", + "image_path": "cda5be67a395c20ef4b5af3f81051ab51976eb309c81bc6b7d01c1f24c2eb8c2.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 231, + 512, + 415, + 534 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 141, + 541, + 463, + 556 + ], + "lines": [ + { + "bbox": [ + 142, + 540, + 465, + 557 + ], + "spans": [ + { + "bbox": [ + 142, + 540, + 158, + 557 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 158, + 540, + 273, + 557 + ], + "score": 0.9, + "content": "\\widetilde { R } = \\mathbb { E } _ { \\widetilde { X } , y } [ | | \\hat { z } - z ^ { * } | | _ { \\Sigma } ^ { 2 } ] + \\sigma ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 274, + 540, + 465, + 557 + ], + "score": 1.0, + "content": "be the expected test risk of the above estimator.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 565, + 383, + 577 + ], + "lines": [ + { + "bbox": [ + 106, + 564, + 384, + 579 + ], + "spans": [ + { + "bbox": [ + 106, + 564, + 384, + 579 + ], + "score": 1.0, + "content": "Then, the expected test risks of the above two problems are identical:", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "interline_equation", + "bbox": [ + 289, + 582, + 322, + 596 + ], + "lines": [ + { + "bbox": [ + 289, + 582, + 322, + 596 + ], + "spans": [ + { + "bbox": [ + 289, + 582, + 322, + 596 + ], + "score": 0.9, + "content": "\\overline { { R } } = \\widetilde { R }", + "type": "interline_equation", + "image_path": "db5f0c07ae954bc35d619d405280e49178abec00d0dba3e56fe2951dd749e615.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 289, + 582, + 322, + 596 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 609, + 505, + 634 + ], + "lines": [ + { + "bbox": [ + 105, + 608, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 262, + 623 + ], + "score": 1.0, + "content": "Proof of Lemma 5. The distribution of", + "type": "text" + }, + { + "bbox": [ + 262, + 608, + 272, + 620 + ], + "score": 0.88, + "content": "\\widetilde { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 608, + 403, + 623 + ], + "score": 1.0, + "content": "in the Problem 2 is equivalent to", + "type": "text" + }, + { + "bbox": [ + 404, + 609, + 433, + 621 + ], + "score": 0.91, + "content": "X \\Sigma ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 608, + 464, + 623 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 464, + 611, + 474, + 620 + ], + "score": 0.85, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 608, + 506, + 623 + ], + "score": 1.0, + "content": "is as in", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 619, + 506, + 636 + ], + "spans": [ + { + "bbox": [ + 104, + 619, + 403, + 636 + ], + "score": 1.0, + "content": "Problem 1. Thus, the two settings are equivalent by the change-of-variable", + "type": "text" + }, + { + "bbox": [ + 404, + 621, + 450, + 633 + ], + "score": 0.92, + "content": "\\beta = \\Sigma ^ { 1 / 2 } z", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 619, + 506, + 636 + ], + "score": 1.0, + "content": ". Specifically,", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + }, + { + "type": "interline_equation", + "bbox": [ + 206, + 638, + 406, + 731 + ], + "lines": [ + { + "bbox": [ + 206, + 638, + 406, + 731 + ], + "spans": [ + { + "bbox": [ + 206, + 638, + 406, + 731 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\hat { z } _ { \\lambda } : = \\underset { z } { \\mathrm { a r g m i n } } \\left| \\lvert \\tilde { X } z - \\bar { y } \\rvert \\right| _ { 2 } ^ { 2 } + \\lambda \\lvert | z \\rvert | _ { \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } } ^ { 2 } } \\\\ & { = \\underset { z } { \\mathrm { a r g m i n } } \\left| \\lvert X \\Sigma ^ { 1 / 2 } z - \\bar { y } \\rvert \\right| _ { 2 } ^ { 2 } + \\lambda z ^ { T } \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } z } \\\\ & { = \\underset { z } { \\mathrm { a r g m i n } } \\left| \\lvert X \\Sigma ^ { 1 / 2 } z - \\bar { y } \\rvert \\right| _ { 2 } ^ { 2 } + \\lambda z ^ { T } \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } z } \\\\ & { = \\Sigma ^ { - 1 / 2 } \\underset { \\beta = \\Sigma ^ { 1 / 2 } z } { \\mathrm { a r g m i n } } \\left| \\lvert X \\beta - \\bar { y } \\rvert \\right| _ { 2 } ^ { 2 } + \\lambda \\beta ^ { T } M \\beta } \\end{array}", + "type": "interline_equation", + "image_path": "f0beeb018cf7057c374d082f97552de1cc35ea24d3586872370a3e8651b97efd.jpg" + } + ] + } + ], + "index": 34.5, + "virtual_lines": [ + { + "bbox": [ + 206, + 638, + 406, + 653.5 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 206, + 653.5, + 406, + 669.0 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 206, + 669.0, + 406, + 684.5 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 206, + 684.5, + 406, + 700.0 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 206, + 700.0, + 406, + 715.5 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 206, + 715.5, + 406, + 731.0 + ], + "spans": [], + "index": 37 + } + ] + } + ], + "page_idx": 16, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "17", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 200, + 505, + 211 + ], + "lines": [ + { + "bbox": [ + 496, + 202, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 496, + 202, + 505, + 212 + ], + "score": 0.998, + "content": "□", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 183, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 185, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 185, + 96 + ], + "score": 1.0, + "content": "Thus by Lemma 3,", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 81, + 185, + 96 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 199, + 99, + 409, + 197 + ], + "lines": [ + { + "bbox": [ + 199, + 99, + 409, + 197 + ], + "spans": [ + { + "bbox": [ + 199, + 99, + 409, + 197 + ], + "score": 0.94, + "content": "\\begin{array} { l } { \\overline { { R } } ( \\hat { \\beta } _ { d } ^ { \\mathrm { o p t } } ) = \\widetilde { \\sigma } ^ { 2 } + \\underset { ( \\gamma _ { 1 } , \\ldots , \\gamma _ { m } ) \\sim \\Gamma _ { d + 1 } } { \\mathbb { E } } \\left[ \\overset { p } { \\underset { i = 1 } { \\sum } } \\frac { \\widetilde { \\sigma } ^ { 2 } } { \\gamma _ { i } ^ { 2 } + \\frac { \\widetilde { \\sigma } ^ { 2 } p ^ { 2 } } { d | \\boldsymbol { \\theta } | | _ { 2 } ^ { 2 } } } \\right] } \\\\ { \\geq \\widetilde { \\sigma } ^ { 2 } + \\underset { ( \\widetilde { \\gamma } _ { 1 } , \\ldots , \\widetilde { \\gamma } _ { m } ) \\sim \\Gamma _ { d + 1 } } { \\mathbb { E } } \\left[ \\overset { p } { \\underset { i = 1 } { \\sum } } \\frac { \\widetilde { \\sigma } ^ { 2 } } { \\widetilde { \\gamma } _ { i } ^ { 2 } + \\frac { \\widetilde { \\sigma } ^ { 2 } p ^ { 2 } } { d | \\boldsymbol { \\theta } | | _ { 2 } ^ { 2 } } } \\right] } \\\\ { = \\overline { { R } } ( \\hat { \\beta } _ { d + 1 } ^ { \\mathrm { o p t } } ) } \\end{array}", + "type": "interline_equation", + "image_path": "1ea674240f9e02dc5bd479332892e9eca74d4cd7c9535d5e38da57b023ff0bac.jpg" + } + ] + } + ], + "index": 3.5, + "virtual_lines": [ + { + "bbox": [ + 199, + 99, + 409, + 115.33333333333333 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 199, + 115.33333333333333, + 409, + 131.66666666666666 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 199, + 131.66666666666666, + 409, + 148.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 199, + 148.0, + 409, + 164.33333333333334 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 199, + 164.33333333333334, + 409, + 180.66666666666669 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 199, + 180.66666666666669, + 409, + 197.00000000000003 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "title", + "bbox": [ + 108, + 225, + 254, + 237 + ], + "lines": [ + { + "bbox": [ + 106, + 225, + 255, + 238 + ], + "spans": [ + { + "bbox": [ + 106, + 225, + 255, + 238 + ], + "score": 1.0, + "content": "A.3 NONISOTROPIC REDUCTION", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 245, + 505, + 291 + ], + "lines": [ + { + "bbox": [ + 106, + 246, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 106, + 246, + 505, + 258 + ], + "score": 1.0, + "content": "Here we observe that results on isotropic regression in Section 2 also imply that ridge regression", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 258, + 505, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 505, + 270 + ], + "score": 1.0, + "content": "can be made sample-monotonic even for non-isotropic covariates, if an appropriate regularzier is", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 268, + 506, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 506, + 281 + ], + "score": 1.0, + "content": "applied. Specifically, the regularizer depends on the covariance on the inputs. This follows from a", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 280, + 390, + 292 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 390, + 292 + ], + "score": 1.0, + "content": "general equivalence between the non-isotropic and isotropic problems.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 246, + 506, + 292 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 293, + 503, + 317 + ], + "lines": [ + { + "bbox": [ + 104, + 292, + 501, + 306 + ], + "spans": [ + { + "bbox": [ + 104, + 292, + 185, + 306 + ], + "score": 1.0, + "content": "Lemma 5. For all", + "type": "text" + }, + { + "bbox": [ + 185, + 294, + 306, + 306 + ], + "score": 0.92, + "content": "n \\in \\mathbb { N } , d \\in \\mathbb { N } , \\lambda \\in \\mathbb { R } , \\sigma \\in \\mathbb { R } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 292, + 355, + 306 + ], + "score": 1.0, + "content": "covariance", + "type": "text" + }, + { + "bbox": [ + 356, + 293, + 399, + 304 + ], + "score": 0.9, + "content": "\\Sigma \\in \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 292, + 453, + 306 + ], + "score": 1.0, + "content": ", PSD matrix", + "type": "text" + }, + { + "bbox": [ + 454, + 293, + 501, + 304 + ], + "score": 0.91, + "content": "M \\in \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 304, + 299, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 304, + 177, + 318 + ], + "score": 1.0, + "content": "and ground-truth", + "type": "text" + }, + { + "bbox": [ + 178, + 305, + 213, + 317 + ], + "score": 0.91, + "content": "\\beta ^ { * } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 304, + 299, + 318 + ], + "score": 1.0, + "content": ", the following holds.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 104, + 292, + 501, + 318 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 322, + 258, + 334 + ], + "lines": [ + { + "bbox": [ + 106, + 321, + 260, + 336 + ], + "spans": [ + { + "bbox": [ + 106, + 321, + 260, + 336 + ], + "score": 1.0, + "content": "Consider the following two problems:", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 106, + 321, + 260, + 336 + ] + }, + { + "type": "text", + "bbox": [ + 130, + 343, + 505, + 388 + ], + "lines": [ + { + "bbox": [ + 129, + 343, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 129, + 343, + 370, + 356 + ], + "score": 1.0, + "content": "1. Regularized regression on isotropic covariates, and an", + "type": "text" + }, + { + "bbox": [ + 370, + 344, + 382, + 353 + ], + "score": 0.8, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 343, + 505, + 356 + ], + "score": 1.0, + "content": "-regularizer. That is, suppose", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 354, + 504, + 368 + ], + "spans": [ + { + "bbox": [ + 142, + 357, + 149, + 364 + ], + "score": 0.46, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 354, + 187, + 368 + ], + "score": 1.0, + "content": "samples", + "type": "text" + }, + { + "bbox": [ + 188, + 355, + 211, + 366 + ], + "score": 0.9, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 354, + 324, + 368 + ], + "score": 1.0, + "content": "are drawn with covariates", + "type": "text" + }, + { + "bbox": [ + 324, + 354, + 383, + 367 + ], + "score": 0.93, + "content": "x \\sim \\mathcal { N } ( 0 , I _ { d } )", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 354, + 442, + 368 + ], + "score": 1.0, + "content": "and response", + "type": "text" + }, + { + "bbox": [ + 442, + 354, + 504, + 367 + ], + "score": 0.91, + "content": "y = \\langle \\beta ^ { * } , x \\rangle +", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 142, + 363, + 506, + 379 + ], + "spans": [ + { + "bbox": [ + 142, + 365, + 180, + 378 + ], + "score": 0.92, + "content": "\\mathcal { N } ( 0 , \\bar { \\sigma } ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 363, + 206, + 379 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 206, + 365, + 256, + 376 + ], + "score": 0.91, + "content": "\\ b { \\hat { X } } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 363, + 396, + 379 + ], + "score": 1.0, + "content": "be the matrix of covariates, and", + "type": "text" + }, + { + "bbox": [ + 396, + 366, + 403, + 377 + ], + "score": 0.79, + "content": "\\vec { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 363, + 506, + 379 + ], + "score": 1.0, + "content": "the vector of responses.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 142, + 376, + 183, + 388 + ], + "spans": [ + { + "bbox": [ + 142, + 376, + 183, + 388 + ], + "score": 1.0, + "content": "Consider", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16.5, + "bbox_fs": [ + 129, + 343, + 506, + 388 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 246, + 391, + 400, + 415 + ], + "lines": [ + { + "bbox": [ + 246, + 391, + 400, + 415 + ], + "spans": [ + { + "bbox": [ + 246, + 391, + 400, + 415 + ], + "score": 0.93, + "content": "{ \\hat { \\beta } } _ { \\lambda } : = \\operatorname * { a r g m i n } _ { \\beta } | | X \\beta - { \\vec { y } } | | _ { 2 } ^ { 2 } + \\lambda | | \\beta | | _ { M } ^ { 2 }", + "type": "interline_equation", + "image_path": "02363f18ece46693d693587db157e2dcdb085e1e18082f637c3f89a762f72274.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 246, + 391, + 400, + 415 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 142, + 421, + 463, + 436 + ], + "lines": [ + { + "bbox": [ + 142, + 420, + 464, + 437 + ], + "spans": [ + { + "bbox": [ + 142, + 420, + 158, + 437 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 158, + 421, + 273, + 435 + ], + "score": 0.92, + "content": "\\overline { { R } } = \\mathbb { E } _ { X , y } [ | | \\hat { \\beta } - \\beta ^ { * } | | _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 420, + 464, + 437 + ], + "score": 1.0, + "content": "be the expected test risk of the above estimator.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 142, + 420, + 464, + 437 + ] + }, + { + "type": "text", + "bbox": [ + 131, + 442, + 504, + 477 + ], + "lines": [ + { + "bbox": [ + 128, + 440, + 506, + 458 + ], + "spans": [ + { + "bbox": [ + 128, + 440, + 308, + 458 + ], + "score": 1.0, + "content": "2. Regularized regression with covariance", + "type": "text" + }, + { + "bbox": [ + 309, + 444, + 317, + 454 + ], + "score": 0.78, + "content": "\\Sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 440, + 357, + 458 + ], + "score": 1.0, + "content": ", and an", + "type": "text" + }, + { + "bbox": [ + 357, + 442, + 415, + 455 + ], + "score": 0.9, + "content": "( \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 440, + 506, + 458 + ], + "score": 1.0, + "content": "-regularizer. That is,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 140, + 453, + 505, + 470 + ], + "spans": [ + { + "bbox": [ + 140, + 453, + 178, + 470 + ], + "score": 1.0, + "content": "suppose", + "type": "text" + }, + { + "bbox": [ + 178, + 458, + 186, + 465 + ], + "score": 0.34, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 453, + 225, + 470 + ], + "score": 1.0, + "content": "samples", + "type": "text" + }, + { + "bbox": [ + 225, + 455, + 248, + 467 + ], + "score": 0.91, + "content": "( \\widetilde { x } , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 453, + 364, + 470 + ], + "score": 1.0, + "content": "are drawn with covariates", + "type": "text" + }, + { + "bbox": [ + 364, + 455, + 423, + 467 + ], + "score": 0.92, + "content": "\\widetilde { x } \\sim \\mathcal { N } ( 0 , \\Sigma )", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 453, + 484, + 470 + ], + "score": 1.0, + "content": "and response", + "type": "text" + }, + { + "bbox": [ + 484, + 456, + 505, + 467 + ], + "score": 0.84, + "content": "y =", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 143, + 466, + 239, + 478 + ], + "spans": [ + { + "bbox": [ + 143, + 466, + 221, + 478 + ], + "score": 0.92, + "content": "\\langle z ^ { \\ast } , \\widetilde { x } \\rangle + \\mathcal { N } ( 0 , \\widetilde { \\sigma } ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 466, + 239, + 478 + ], + "score": 1.0, + "content": "e, for", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 128, + 440, + 506, + 478 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 292, + 476, + 354, + 491 + ], + "lines": [ + { + "bbox": [ + 292, + 476, + 354, + 491 + ], + "spans": [ + { + "bbox": [ + 292, + 476, + 354, + 491 + ], + "score": 0.92, + "content": "z ^ { * } = \\Sigma ^ { - 1 / 2 } \\beta ^ { * }", + "type": "interline_equation", + "image_path": "df06493abeb238642e8c8f74a3139cd40fd2e81f06e4936a7d7cad291c1fde94.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 292, + 476, + 354, + 491 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 142, + 495, + 477, + 508 + ], + "lines": [ + { + "bbox": [ + 140, + 492, + 478, + 510 + ], + "spans": [ + { + "bbox": [ + 140, + 492, + 158, + 510 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 158, + 494, + 203, + 506 + ], + "score": 0.91, + "content": "\\widetilde { X } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 492, + 333, + 510 + ], + "score": 1.0, + "content": "be the matrix of covariates, and", + "type": "text" + }, + { + "bbox": [ + 334, + 496, + 340, + 508 + ], + "score": 0.77, + "content": "\\vec { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 492, + 478, + 510 + ], + "score": 1.0, + "content": "the vector of responses. Consider", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25, + "bbox_fs": [ + 140, + 492, + 478, + 510 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 512, + 415, + 534 + ], + "lines": [ + { + "bbox": [ + 231, + 512, + 415, + 534 + ], + "spans": [ + { + "bbox": [ + 231, + 512, + 415, + 534 + ], + "score": 0.93, + "content": "\\hat { z } _ { \\lambda } : = \\operatorname * { a r g m i n } _ { z } | | \\widetilde { X } z - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda | | z | | _ { \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } } ^ { 2 }", + "type": "interline_equation", + "image_path": "cda5be67a395c20ef4b5af3f81051ab51976eb309c81bc6b7d01c1f24c2eb8c2.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 231, + 512, + 415, + 534 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 141, + 541, + 463, + 556 + ], + "lines": [ + { + "bbox": [ + 142, + 540, + 465, + 557 + ], + "spans": [ + { + "bbox": [ + 142, + 540, + 158, + 557 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 158, + 540, + 273, + 557 + ], + "score": 0.9, + "content": "\\widetilde { R } = \\mathbb { E } _ { \\widetilde { X } , y } [ | | \\hat { z } - z ^ { * } | | _ { \\Sigma } ^ { 2 } ] + \\sigma ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 274, + 540, + 465, + 557 + ], + "score": 1.0, + "content": "be the expected test risk of the above estimator.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27, + "bbox_fs": [ + 142, + 540, + 465, + 557 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 565, + 383, + 577 + ], + "lines": [ + { + "bbox": [ + 106, + 564, + 384, + 579 + ], + "spans": [ + { + "bbox": [ + 106, + 564, + 384, + 579 + ], + "score": 1.0, + "content": "Then, the expected test risks of the above two problems are identical:", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 106, + 564, + 384, + 579 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 289, + 582, + 322, + 596 + ], + "lines": [ + { + "bbox": [ + 289, + 582, + 322, + 596 + ], + "spans": [ + { + "bbox": [ + 289, + 582, + 322, + 596 + ], + "score": 0.9, + "content": "\\overline { { R } } = \\widetilde { R }", + "type": "interline_equation", + "image_path": "db5f0c07ae954bc35d619d405280e49178abec00d0dba3e56fe2951dd749e615.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 289, + 582, + 322, + 596 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 609, + 505, + 634 + ], + "lines": [ + { + "bbox": [ + 105, + 608, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 262, + 623 + ], + "score": 1.0, + "content": "Proof of Lemma 5. The distribution of", + "type": "text" + }, + { + "bbox": [ + 262, + 608, + 272, + 620 + ], + "score": 0.88, + "content": "\\widetilde { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 608, + 403, + 623 + ], + "score": 1.0, + "content": "in the Problem 2 is equivalent to", + "type": "text" + }, + { + "bbox": [ + 404, + 609, + 433, + 621 + ], + "score": 0.91, + "content": "X \\Sigma ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 608, + 464, + 623 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 464, + 611, + 474, + 620 + ], + "score": 0.85, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 608, + 506, + 623 + ], + "score": 1.0, + "content": "is as in", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 619, + 506, + 636 + ], + "spans": [ + { + "bbox": [ + 104, + 619, + 403, + 636 + ], + "score": 1.0, + "content": "Problem 1. Thus, the two settings are equivalent by the change-of-variable", + "type": "text" + }, + { + "bbox": [ + 404, + 621, + 450, + 633 + ], + "score": 0.92, + "content": "\\beta = \\Sigma ^ { 1 / 2 } z", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 619, + 506, + 636 + ], + "score": 1.0, + "content": ". Specifically,", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5, + "bbox_fs": [ + 104, + 608, + 506, + 636 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 206, + 638, + 406, + 731 + ], + "lines": [ + { + "bbox": [ + 206, + 638, + 406, + 731 + ], + "spans": [ + { + "bbox": [ + 206, + 638, + 406, + 731 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\hat { z } _ { \\lambda } : = \\underset { z } { \\mathrm { a r g m i n } } \\left| \\lvert \\tilde { X } z - \\bar { y } \\rvert \\right| _ { 2 } ^ { 2 } + \\lambda \\lvert | z \\rvert | _ { \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } } ^ { 2 } } \\\\ & { = \\underset { z } { \\mathrm { a r g m i n } } \\left| \\lvert X \\Sigma ^ { 1 / 2 } z - \\bar { y } \\rvert \\right| _ { 2 } ^ { 2 } + \\lambda z ^ { T } \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } z } \\\\ & { = \\underset { z } { \\mathrm { a r g m i n } } \\left| \\lvert X \\Sigma ^ { 1 / 2 } z - \\bar { y } \\rvert \\right| _ { 2 } ^ { 2 } + \\lambda z ^ { T } \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } z } \\\\ & { = \\Sigma ^ { - 1 / 2 } \\underset { \\beta = \\Sigma ^ { 1 / 2 } z } { \\mathrm { a r g m i n } } \\left| \\lvert X \\beta - \\bar { y } \\rvert \\right| _ { 2 } ^ { 2 } + \\lambda \\beta ^ { T } M \\beta } \\end{array}", + "type": "interline_equation", + "image_path": "f0beeb018cf7057c374d082f97552de1cc35ea24d3586872370a3e8651b97efd.jpg" + } + ] + } + ], + "index": 34.5, + "virtual_lines": [ + { + "bbox": [ + 206, + 638, + 406, + 653.5 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 206, + 653.5, + 406, + 669.0 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 206, + 669.0, + 406, + 684.5 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 206, + 684.5, + 406, + 700.0 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 206, + 700.0, + 406, + 715.5 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 206, + 715.5, + 406, + 731.0 + ], + "spans": [], + "index": 37 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 81, + 420, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 420, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 192, + 96 + ], + "score": 1.0, + "content": "Further, the response", + "type": "text" + }, + { + "bbox": [ + 193, + 82, + 258, + 95 + ], + "score": 0.94, + "content": "\\langle z ^ { * } , { \\widetilde { x } } \\rangle = \\langle \\beta , x \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 81, + 420, + 96 + ], + "score": 1.0, + "content": ", and the test risk transforms identically:", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 250, + 97, + 361, + 161 + ], + "lines": [ + { + "bbox": [ + 250, + 97, + 361, + 161 + ], + "spans": [ + { + "bbox": [ + 250, + 97, + 361, + 161 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\widetilde { R } = \\underset { \\widetilde { X } , y } { \\mathbb { E } } \\left[ \\vert \\vert \\hat { z } - z ^ { * } \\vert \\vert _ { \\Sigma } ^ { 2 } \\right] + \\sigma ^ { 2 } } \\\\ { = \\underset { X , y } { \\mathbb { E } } \\left[ \\vert \\vert \\hat { \\beta } - \\beta ^ { * } \\vert \\vert _ { 2 } ^ { 2 } \\right] + \\sigma ^ { 2 } } \\\\ { = \\overline { { R } } } \\end{array}", + "type": "interline_equation", + "image_path": "ba8c337424aa66b3e400992cc04938b8a52ee3d159056665cd8655fcb3352401.jpg" + } + ] + } + ], + "index": 1.5, + "virtual_lines": [ + { + "bbox": [ + 250, + 97, + 361, + 129.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 250, + 129.0, + 361, + 161.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 186, + 504, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 185, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 252, + 200 + ], + "score": 1.0, + "content": "This implies that if the covariance", + "type": "text" + }, + { + "bbox": [ + 253, + 187, + 261, + 197 + ], + "score": 0.82, + "content": "\\Sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 185, + 427, + 200 + ], + "score": 1.0, + "content": "is known, then ridge regression with a", + "type": "text" + }, + { + "bbox": [ + 427, + 186, + 446, + 197 + ], + "score": 0.9, + "content": "\\Sigma ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 185, + 506, + 200 + ], + "score": 1.0, + "content": "regularizer is", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 198, + 186, + 210 + ], + "spans": [ + { + "bbox": [ + 106, + 198, + 186, + 210 + ], + "score": 1.0, + "content": "sample-monotonic.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 107, + 210, + 504, + 234 + ], + "lines": [ + { + "bbox": [ + 105, + 208, + 506, + 225 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 190, + 225 + ], + "score": 1.0, + "content": "Theorem 5. For all", + "type": "text" + }, + { + "bbox": [ + 190, + 212, + 277, + 223 + ], + "score": 0.9, + "content": "n \\in \\mathbb { N } , d \\in \\mathbb { N } , \\sigma \\in \\mathbb { R } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 208, + 327, + 225 + ], + "score": 1.0, + "content": ", covariance", + "type": "text" + }, + { + "bbox": [ + 328, + 210, + 371, + 222 + ], + "score": 0.92, + "content": "\\Sigma \\in \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 208, + 450, + 225 + ], + "score": 1.0, + "content": ", and ground-truths", + "type": "text" + }, + { + "bbox": [ + 450, + 211, + 486, + 223 + ], + "score": 0.93, + "content": "\\beta ^ { * } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 208, + 506, + 225 + ], + "score": 1.0, + "content": ", th e", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 221, + 173, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 173, + 235 + ], + "score": 1.0, + "content": "following holds.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 106, + 239, + 505, + 272 + ], + "lines": [ + { + "bbox": [ + 105, + 237, + 505, + 252 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 143, + 252 + ], + "score": 1.0, + "content": "Suppose", + "type": "text" + }, + { + "bbox": [ + 143, + 242, + 150, + 249 + ], + "score": 0.38, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 237, + 188, + 252 + ], + "score": 1.0, + "content": "samples", + "type": "text" + }, + { + "bbox": [ + 189, + 239, + 212, + 250 + ], + "score": 0.89, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 237, + 325, + 252 + ], + "score": 1.0, + "content": "are drawn with covariates", + "type": "text" + }, + { + "bbox": [ + 325, + 239, + 382, + 251 + ], + "score": 0.93, + "content": "x \\sim \\mathcal { N } ( 0 , \\Sigma )", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 237, + 441, + 252 + ], + "score": 1.0, + "content": "and response", + "type": "text" + }, + { + "bbox": [ + 442, + 239, + 505, + 251 + ], + "score": 0.9, + "content": "y = \\langle \\beta ^ { * } , x \\rangle +", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 249, + 505, + 263 + ], + "spans": [ + { + "bbox": [ + 107, + 250, + 145, + 262 + ], + "score": 0.92, + "content": "{ \\mathcal { N } } ( 0 , \\sigma ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 249, + 167, + 263 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 167, + 250, + 214, + 261 + ], + "score": 0.9, + "content": "\\ b { X } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 249, + 348, + 263 + ], + "score": 1.0, + "content": "be the matrix of covariates, and", + "type": "text" + }, + { + "bbox": [ + 349, + 251, + 356, + 262 + ], + "score": 0.75, + "content": "\\vec { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 249, + 474, + 263 + ], + "score": 1.0, + "content": "the vector of responses. For", + "type": "text" + }, + { + "bbox": [ + 474, + 251, + 501, + 261 + ], + "score": 0.87, + "content": "\\lambda > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 249, + 505, + 263 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 260, + 357, + 274 + ], + "spans": [ + { + "bbox": [ + 105, + 260, + 284, + 274 + ], + "score": 1.0, + "content": "consider the ridge regression estimator with", + "type": "text" + }, + { + "bbox": [ + 285, + 261, + 303, + 271 + ], + "score": 0.9, + "content": "\\Sigma ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 260, + 357, + 274 + ], + "score": 1.0, + "content": "-regularizer:", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + }, + { + "type": "interline_equation", + "bbox": [ + 221, + 276, + 389, + 298 + ], + "lines": [ + { + "bbox": [ + 221, + 276, + 389, + 298 + ], + "spans": [ + { + "bbox": [ + 221, + 276, + 389, + 298 + ], + "score": 0.93, + "content": "\\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\boldsymbol { \\beta } } \\| X \\boldsymbol { \\beta } - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| \\boldsymbol { \\beta } \\| _ { \\Sigma ^ { - 1 } } ^ { 2 }", + "type": "interline_equation", + "image_path": "44c9a87571ee9323acf796aef81530d801ad3a2c6383f1a76da675ec70121a13.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 221, + 276, + 389, + 298 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 308, + 504, + 334 + ], + "lines": [ + { + "bbox": [ + 105, + 307, + 506, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 122, + 323 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 122, + 308, + 254, + 324 + ], + "score": 0.93, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) : = \\mathbb { E } _ { \\hat { \\beta } } \\| \\hat { \\beta } - \\beta ^ { * } \\| _ { \\Sigma } + \\sigma ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 307, + 461, + 323 + ], + "score": 1.0, + "content": "be the expected test risk of the above estimator. Let", + "type": "text" + }, + { + "bbox": [ + 461, + 308, + 477, + 320 + ], + "score": 0.89, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 307, + 506, + 323 + ], + "score": 1.0, + "content": "be the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 321, + 447, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 321, + 401, + 335 + ], + "score": 1.0, + "content": "optimal ridge parameter (that achieves the minimum expected risk) given", + "type": "text" + }, + { + "bbox": [ + 401, + 325, + 408, + 332 + ], + "score": 0.36, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 321, + 447, + 335 + ], + "score": 1.0, + "content": "samples:", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "interline_equation", + "bbox": [ + 254, + 336, + 357, + 358 + ], + "lines": [ + { + "bbox": [ + 254, + 336, + 357, + 358 + ], + "spans": [ + { + "bbox": [ + 254, + 336, + 357, + 358 + ], + "score": 0.94, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } } : = \\operatorname * { a r g m i n } _ { \\lambda } \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) )", + "type": "interline_equation", + "image_path": "6a255aa91999f671497ccad33844b9a826f3e210b626c3c0aa2f0b93fc75385e.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 254, + 336, + 357, + 358 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 362, + 504, + 386 + ], + "lines": [ + { + "bbox": [ + 104, + 360, + 505, + 379 + ], + "spans": [ + { + "bbox": [ + 104, + 360, + 138, + 379 + ], + "score": 1.0, + "content": "And let", + "type": "text" + }, + { + "bbox": [ + 138, + 362, + 155, + 375 + ], + "score": 0.9, + "content": "\\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 360, + 318, + 379 + ], + "score": 1.0, + "content": "be the estimator that corresponds to the", + "type": "text" + }, + { + "bbox": [ + 318, + 363, + 334, + 375 + ], + "score": 0.9, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 360, + 505, + 379 + ], + "score": 1.0, + "content": ". Then, the expected test risk of optimally-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 374, + 326, + 388 + ], + "spans": [ + { + "bbox": [ + 106, + 374, + 326, + 388 + ], + "score": 1.0, + "content": "regularized linear regression is monotonic in samples:", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "interline_equation", + "bbox": [ + 264, + 389, + 347, + 406 + ], + "lines": [ + { + "bbox": [ + 264, + 389, + 347, + 406 + ], + "spans": [ + { + "bbox": [ + 264, + 389, + 347, + 406 + ], + "score": 0.92, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n + 1 } ^ { \\mathrm { o p t } } ) \\leq \\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } )", + "type": "interline_equation", + "image_path": "e4739674d976e6c2ef07dabe2d407a650cf2cf0edb0ee50ad6200a5333c108d0.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 264, + 389, + 347, + 406 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 415, + 505, + 438 + ], + "lines": [ + { + "bbox": [ + 106, + 415, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 415, + 399, + 428 + ], + "score": 1.0, + "content": "Proof. This follows directly by applying the reduction in Lemma 5 for", + "type": "text" + }, + { + "bbox": [ + 399, + 416, + 437, + 426 + ], + "score": 0.92, + "content": "M = I _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 415, + 505, + 428 + ], + "score": 1.0, + "content": "to reduce to the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 426, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 473, + 438 + ], + "score": 1.0, + "content": "isotropic case, and then applying the monotonicity of isotropic regression from Theorem 1.", + "type": "text" + }, + { + "bbox": [ + 493, + 426, + 505, + 437 + ], + "score": 0.999, + "content": "□", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5 + }, + { + "type": "title", + "bbox": [ + 108, + 450, + 219, + 461 + ], + "lines": [ + { + "bbox": [ + 106, + 448, + 221, + 463 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 221, + 463 + ], + "score": 1.0, + "content": "A.4 ADDITIONAL PLOTS", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 470, + 505, + 504 + ], + "lines": [ + { + "bbox": [ + 106, + 470, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 106, + 470, + 505, + 482 + ], + "score": 1.0, + "content": "We apply random features to Fashion-MNIST Xiao et al. (2017), an image classification problem", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 228, + 493 + ], + "score": 1.0, + "content": "with 10 classes. Input images", + "type": "text" + }, + { + "bbox": [ + 229, + 480, + 261, + 491 + ], + "score": 0.91, + "content": "x \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 480, + 390, + 493 + ], + "score": 1.0, + "content": "are normalized and flattened to", + "type": "text" + }, + { + "bbox": [ + 390, + 480, + 424, + 493 + ], + "score": 0.95, + "content": "[ - \\bar { 1 } , 1 ] ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 480, + 439, + 493 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 440, + 481, + 475, + 491 + ], + "score": 0.89, + "content": "d = 7 8 4", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 480, + 505, + 493 + ], + "score": 1.0, + "content": ". Class", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 491, + 359, + 505 + ], + "spans": [ + { + "bbox": [ + 104, + 491, + 257, + 505 + ], + "score": 1.0, + "content": "labels are encoded as one-hot vectors", + "type": "text" + }, + { + "bbox": [ + 258, + 492, + 354, + 504 + ], + "score": 0.94, + "content": "y \\in \\{ \\vec { e _ { 1 } } , \\dots e _ { 1 0 } ^ { } \\} \\subset \\mathbb { R } ^ { 1 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 491, + 359, + 505 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + }, + { + "type": "title", + "bbox": [ + 108, + 518, + 417, + 532 + ], + "lines": [ + { + "bbox": [ + 105, + 518, + 419, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 419, + 534 + ], + "score": 1.0, + "content": "B TOWARDS MONOTONICITY WITH GENERAL COVARIATES", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 106, + 542, + 505, + 620 + ], + "lines": [ + { + "bbox": [ + 106, + 543, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 505, + 555 + ], + "score": 1.0, + "content": "Here we investigate whether monotonicity provably holds in more general models, inspired by the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 554, + 506, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 506, + 565 + ], + "score": 1.0, + "content": "experimental results. As a first step, we consider Gaussian (but not isotropic) covariances and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 565, + 505, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 565, + 505, + 577 + ], + "score": 1.0, + "content": "homeostatic noise. That is, we consider ridge regression in the setting of Section 2, but with", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 107, + 574, + 506, + 589 + ], + "spans": [ + { + "bbox": [ + 107, + 576, + 163, + 588 + ], + "score": 0.93, + "content": "x \\sim \\mathcal { N } ( 0 , \\Sigma )", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 574, + 185, + 589 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 185, + 576, + 285, + 588 + ], + "score": 0.92, + "content": "y \\sim \\langle x , \\beta ^ { * } \\rangle + N ( 0 , \\sigma ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 574, + 506, + 589 + ], + "score": 1.0, + "content": ". In this section, we observe that ridge regression can", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 586, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 505, + 599 + ], + "score": 1.0, + "content": "be made sample-monotonic with a modified regularizer. We also conjecture that ridge regression", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 596, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 104, + 596, + 505, + 612 + ], + "score": 1.0, + "content": "is sample-monotonic without modifying the regularizer, and we outline a potential proof strategy", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 608, + 234, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 234, + 622 + ], + "score": 1.0, + "content": "along with numerical evidence.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 27 + }, + { + "type": "title", + "bbox": [ + 108, + 632, + 258, + 644 + ], + "lines": [ + { + "bbox": [ + 106, + 632, + 259, + 644 + ], + "spans": [ + { + "bbox": [ + 106, + 632, + 259, + 644 + ], + "score": 1.0, + "content": "B.1 ADAPTIVE REGULARIZATION", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 106, + 652, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 653, + 505, + 666 + ], + "spans": [ + { + "bbox": [ + 106, + 653, + 505, + 666 + ], + "score": 1.0, + "content": "The results on isotropic regression in Section 2 imply that ridge regression can be made sample-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 664, + 505, + 676 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 505, + 676 + ], + "score": 1.0, + "content": "monotonic even for non-isotropic covariates, if an appropriate regularizer is applied. Specifically,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 673, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 673, + 392, + 689 + ], + "score": 1.0, + "content": "the appropriate regularizer depends on the covariance of the inputs. For", + "type": "text" + }, + { + "bbox": [ + 392, + 675, + 446, + 687 + ], + "score": 0.92, + "content": "\\boldsymbol { x } \\sim \\mathcal { N } ( 0 , \\Sigma )", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 673, + 505, + 689 + ], + "score": 1.0, + "content": ", the following", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 685, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 104, + 685, + 314, + 703 + ], + "score": 1.0, + "content": "estimator is sample-monotonic for optimally-tuned", + "type": "text" + }, + { + "bbox": [ + 314, + 687, + 321, + 698 + ], + "score": 0.44, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 685, + 326, + 703 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 326, + 686, + 501, + 701 + ], + "score": 0.81, + "content": "\\begin{array} { r } { \\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\boldsymbol { \\beta } } \\| X \\boldsymbol { \\beta } - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| \\boldsymbol { \\beta } \\| _ { \\Sigma ^ { - 1 } } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 685, + 505, + 703 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "This follows directly from Theorem 1 by applying a change-of-variable; full details of this equiva-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 358, + 723 + ], + "score": 1.0, + "content": "lence are in Section A.3. Note that if the population covariance", + "type": "text" + }, + { + "bbox": [ + 359, + 710, + 367, + 720 + ], + "score": 0.82, + "content": "\\Sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "is not known, it can potentially be", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 721, + 231, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 231, + 732 + ], + "score": 1.0, + "content": "estimated from unlabeled data.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 35 + } + ], + "page_idx": 17, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 763 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 763 + ], + "score": 1.0, + "content": "18", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 495, + 164, + 504, + 174 + ], + "lines": [ + { + "bbox": [ + 496, + 166, + 504, + 173 + ], + "spans": [ + { + "bbox": [ + 496, + 166, + 504, + 173 + ], + "score": 0.993, + "content": "□", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 81, + 420, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 420, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 192, + 96 + ], + "score": 1.0, + "content": "Further, the response", + "type": "text" + }, + { + "bbox": [ + 193, + 82, + 258, + 95 + ], + "score": 0.94, + "content": "\\langle z ^ { * } , { \\widetilde { x } } \\rangle = \\langle \\beta , x \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 81, + 420, + 96 + ], + "score": 1.0, + "content": ", and the test risk transforms identically:", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 81, + 420, + 96 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 250, + 97, + 361, + 161 + ], + "lines": [ + { + "bbox": [ + 250, + 97, + 361, + 161 + ], + "spans": [ + { + "bbox": [ + 250, + 97, + 361, + 161 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\widetilde { R } = \\underset { \\widetilde { X } , y } { \\mathbb { E } } \\left[ \\vert \\vert \\hat { z } - z ^ { * } \\vert \\vert _ { \\Sigma } ^ { 2 } \\right] + \\sigma ^ { 2 } } \\\\ { = \\underset { X , y } { \\mathbb { E } } \\left[ \\vert \\vert \\hat { \\beta } - \\beta ^ { * } \\vert \\vert _ { 2 } ^ { 2 } \\right] + \\sigma ^ { 2 } } \\\\ { = \\overline { { R } } } \\end{array}", + "type": "interline_equation", + "image_path": "ba8c337424aa66b3e400992cc04938b8a52ee3d159056665cd8655fcb3352401.jpg" + } + ] + } + ], + "index": 1.5, + "virtual_lines": [ + { + "bbox": [ + 250, + 97, + 361, + 129.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 250, + 129.0, + 361, + 161.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 186, + 504, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 185, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 252, + 200 + ], + "score": 1.0, + "content": "This implies that if the covariance", + "type": "text" + }, + { + "bbox": [ + 253, + 187, + 261, + 197 + ], + "score": 0.82, + "content": "\\Sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 185, + 427, + 200 + ], + "score": 1.0, + "content": "is known, then ridge regression with a", + "type": "text" + }, + { + "bbox": [ + 427, + 186, + 446, + 197 + ], + "score": 0.9, + "content": "\\Sigma ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 185, + 506, + 200 + ], + "score": 1.0, + "content": "regularizer is", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 198, + 186, + 210 + ], + "spans": [ + { + "bbox": [ + 106, + 198, + 186, + 210 + ], + "score": 1.0, + "content": "sample-monotonic.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 185, + 506, + 210 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 210, + 504, + 234 + ], + "lines": [ + { + "bbox": [ + 105, + 208, + 506, + 225 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 190, + 225 + ], + "score": 1.0, + "content": "Theorem 5. For all", + "type": "text" + }, + { + "bbox": [ + 190, + 212, + 277, + 223 + ], + "score": 0.9, + "content": "n \\in \\mathbb { N } , d \\in \\mathbb { N } , \\sigma \\in \\mathbb { R } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 208, + 327, + 225 + ], + "score": 1.0, + "content": ", covariance", + "type": "text" + }, + { + "bbox": [ + 328, + 210, + 371, + 222 + ], + "score": 0.92, + "content": "\\Sigma \\in \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 208, + 450, + 225 + ], + "score": 1.0, + "content": ", and ground-truths", + "type": "text" + }, + { + "bbox": [ + 450, + 211, + 486, + 223 + ], + "score": 0.93, + "content": "\\beta ^ { * } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 208, + 506, + 225 + ], + "score": 1.0, + "content": ", th e", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 221, + 173, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 173, + 235 + ], + "score": 1.0, + "content": "following holds.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 208, + 506, + 235 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 239, + 505, + 272 + ], + "lines": [ + { + "bbox": [ + 105, + 237, + 505, + 252 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 143, + 252 + ], + "score": 1.0, + "content": "Suppose", + "type": "text" + }, + { + "bbox": [ + 143, + 242, + 150, + 249 + ], + "score": 0.38, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 237, + 188, + 252 + ], + "score": 1.0, + "content": "samples", + "type": "text" + }, + { + "bbox": [ + 189, + 239, + 212, + 250 + ], + "score": 0.89, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 237, + 325, + 252 + ], + "score": 1.0, + "content": "are drawn with covariates", + "type": "text" + }, + { + "bbox": [ + 325, + 239, + 382, + 251 + ], + "score": 0.93, + "content": "x \\sim \\mathcal { N } ( 0 , \\Sigma )", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 237, + 441, + 252 + ], + "score": 1.0, + "content": "and response", + "type": "text" + }, + { + "bbox": [ + 442, + 239, + 505, + 251 + ], + "score": 0.9, + "content": "y = \\langle \\beta ^ { * } , x \\rangle +", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 249, + 505, + 263 + ], + "spans": [ + { + "bbox": [ + 107, + 250, + 145, + 262 + ], + "score": 0.92, + "content": "{ \\mathcal { N } } ( 0 , \\sigma ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 249, + 167, + 263 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 167, + 250, + 214, + 261 + ], + "score": 0.9, + "content": "\\ b { X } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 249, + 348, + 263 + ], + "score": 1.0, + "content": "be the matrix of covariates, and", + "type": "text" + }, + { + "bbox": [ + 349, + 251, + 356, + 262 + ], + "score": 0.75, + "content": "\\vec { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 249, + 474, + 263 + ], + "score": 1.0, + "content": "the vector of responses. For", + "type": "text" + }, + { + "bbox": [ + 474, + 251, + 501, + 261 + ], + "score": 0.87, + "content": "\\lambda > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 249, + 505, + 263 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 260, + 357, + 274 + ], + "spans": [ + { + "bbox": [ + 105, + 260, + 284, + 274 + ], + "score": 1.0, + "content": "consider the ridge regression estimator with", + "type": "text" + }, + { + "bbox": [ + 285, + 261, + 303, + 271 + ], + "score": 0.9, + "content": "\\Sigma ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 260, + 357, + 274 + ], + "score": 1.0, + "content": "-regularizer:", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 237, + 505, + 274 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 221, + 276, + 389, + 298 + ], + "lines": [ + { + "bbox": [ + 221, + 276, + 389, + 298 + ], + "spans": [ + { + "bbox": [ + 221, + 276, + 389, + 298 + ], + "score": 0.93, + "content": "\\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\boldsymbol { \\beta } } \\| X \\boldsymbol { \\beta } - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| \\boldsymbol { \\beta } \\| _ { \\Sigma ^ { - 1 } } ^ { 2 }", + "type": "interline_equation", + "image_path": "44c9a87571ee9323acf796aef81530d801ad3a2c6383f1a76da675ec70121a13.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 221, + 276, + 389, + 298 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 308, + 504, + 334 + ], + "lines": [ + { + "bbox": [ + 105, + 307, + 506, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 122, + 323 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 122, + 308, + 254, + 324 + ], + "score": 0.93, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) : = \\mathbb { E } _ { \\hat { \\beta } } \\| \\hat { \\beta } - \\beta ^ { * } \\| _ { \\Sigma } + \\sigma ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 307, + 461, + 323 + ], + "score": 1.0, + "content": "be the expected test risk of the above estimator. Let", + "type": "text" + }, + { + "bbox": [ + 461, + 308, + 477, + 320 + ], + "score": 0.89, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 307, + 506, + 323 + ], + "score": 1.0, + "content": "be the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 321, + 447, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 321, + 401, + 335 + ], + "score": 1.0, + "content": "optimal ridge parameter (that achieves the minimum expected risk) given", + "type": "text" + }, + { + "bbox": [ + 401, + 325, + 408, + 332 + ], + "score": 0.36, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 321, + 447, + 335 + ], + "score": 1.0, + "content": "samples:", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 307, + 506, + 335 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 254, + 336, + 357, + 358 + ], + "lines": [ + { + "bbox": [ + 254, + 336, + 357, + 358 + ], + "spans": [ + { + "bbox": [ + 254, + 336, + 357, + 358 + ], + "score": 0.94, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } } : = \\operatorname * { a r g m i n } _ { \\lambda } \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) )", + "type": "interline_equation", + "image_path": "6a255aa91999f671497ccad33844b9a826f3e210b626c3c0aa2f0b93fc75385e.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 254, + 336, + 357, + 358 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 362, + 504, + 386 + ], + "lines": [ + { + "bbox": [ + 104, + 360, + 505, + 379 + ], + "spans": [ + { + "bbox": [ + 104, + 360, + 138, + 379 + ], + "score": 1.0, + "content": "And let", + "type": "text" + }, + { + "bbox": [ + 138, + 362, + 155, + 375 + ], + "score": 0.9, + "content": "\\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 360, + 318, + 379 + ], + "score": 1.0, + "content": "be the estimator that corresponds to the", + "type": "text" + }, + { + "bbox": [ + 318, + 363, + 334, + 375 + ], + "score": 0.9, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 360, + 505, + 379 + ], + "score": 1.0, + "content": ". Then, the expected test risk of optimally-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 374, + 326, + 388 + ], + "spans": [ + { + "bbox": [ + 106, + 374, + 326, + 388 + ], + "score": 1.0, + "content": "regularized linear regression is monotonic in samples:", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 104, + 360, + 505, + 388 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 264, + 389, + 347, + 406 + ], + "lines": [ + { + "bbox": [ + 264, + 389, + 347, + 406 + ], + "spans": [ + { + "bbox": [ + 264, + 389, + 347, + 406 + ], + "score": 0.92, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n + 1 } ^ { \\mathrm { o p t } } ) \\leq \\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } )", + "type": "interline_equation", + "image_path": "e4739674d976e6c2ef07dabe2d407a650cf2cf0edb0ee50ad6200a5333c108d0.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 264, + 389, + 347, + 406 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 415, + 505, + 438 + ], + "lines": [ + { + "bbox": [ + 106, + 415, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 415, + 399, + 428 + ], + "score": 1.0, + "content": "Proof. This follows directly by applying the reduction in Lemma 5 for", + "type": "text" + }, + { + "bbox": [ + 399, + 416, + 437, + 426 + ], + "score": 0.92, + "content": "M = I _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 415, + 505, + 428 + ], + "score": 1.0, + "content": "to reduce to the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 426, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 473, + 438 + ], + "score": 1.0, + "content": "isotropic case, and then applying the monotonicity of isotropic regression from Theorem 1.", + "type": "text" + }, + { + "bbox": [ + 493, + 426, + 505, + 437 + ], + "score": 0.999, + "content": "□", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 415, + 505, + 438 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 450, + 219, + 461 + ], + "lines": [ + { + "bbox": [ + 106, + 448, + 221, + 463 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 221, + 463 + ], + "score": 1.0, + "content": "A.4 ADDITIONAL PLOTS", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 470, + 505, + 504 + ], + "lines": [ + { + "bbox": [ + 106, + 470, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 106, + 470, + 505, + 482 + ], + "score": 1.0, + "content": "We apply random features to Fashion-MNIST Xiao et al. (2017), an image classification problem", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 228, + 493 + ], + "score": 1.0, + "content": "with 10 classes. Input images", + "type": "text" + }, + { + "bbox": [ + 229, + 480, + 261, + 491 + ], + "score": 0.91, + "content": "x \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 480, + 390, + 493 + ], + "score": 1.0, + "content": "are normalized and flattened to", + "type": "text" + }, + { + "bbox": [ + 390, + 480, + 424, + 493 + ], + "score": 0.95, + "content": "[ - \\bar { 1 } , 1 ] ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 480, + 439, + 493 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 440, + 481, + 475, + 491 + ], + "score": 0.89, + "content": "d = 7 8 4", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 480, + 505, + 493 + ], + "score": 1.0, + "content": ". Class", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 491, + 359, + 505 + ], + "spans": [ + { + "bbox": [ + 104, + 491, + 257, + 505 + ], + "score": 1.0, + "content": "labels are encoded as one-hot vectors", + "type": "text" + }, + { + "bbox": [ + 258, + 492, + 354, + 504 + ], + "score": 0.94, + "content": "y \\in \\{ \\vec { e _ { 1 } } , \\dots e _ { 1 0 } ^ { } \\} \\subset \\mathbb { R } ^ { 1 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 491, + 359, + 505 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21, + "bbox_fs": [ + 104, + 470, + 505, + 505 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 518, + 417, + 532 + ], + "lines": [ + { + "bbox": [ + 105, + 518, + 419, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 419, + 534 + ], + "score": 1.0, + "content": "B TOWARDS MONOTONICITY WITH GENERAL COVARIATES", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 106, + 542, + 505, + 620 + ], + "lines": [ + { + "bbox": [ + 106, + 543, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 505, + 555 + ], + "score": 1.0, + "content": "Here we investigate whether monotonicity provably holds in more general models, inspired by the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 554, + 506, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 506, + 565 + ], + "score": 1.0, + "content": "experimental results. As a first step, we consider Gaussian (but not isotropic) covariances and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 565, + 505, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 565, + 505, + 577 + ], + "score": 1.0, + "content": "homeostatic noise. That is, we consider ridge regression in the setting of Section 2, but with", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 107, + 574, + 506, + 589 + ], + "spans": [ + { + "bbox": [ + 107, + 576, + 163, + 588 + ], + "score": 0.93, + "content": "x \\sim \\mathcal { N } ( 0 , \\Sigma )", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 574, + 185, + 589 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 185, + 576, + 285, + 588 + ], + "score": 0.92, + "content": "y \\sim \\langle x , \\beta ^ { * } \\rangle + N ( 0 , \\sigma ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 574, + 506, + 589 + ], + "score": 1.0, + "content": ". In this section, we observe that ridge regression can", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 586, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 505, + 599 + ], + "score": 1.0, + "content": "be made sample-monotonic with a modified regularizer. We also conjecture that ridge regression", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 596, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 104, + 596, + 505, + 612 + ], + "score": 1.0, + "content": "is sample-monotonic without modifying the regularizer, and we outline a potential proof strategy", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 608, + 234, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 234, + 622 + ], + "score": 1.0, + "content": "along with numerical evidence.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 27, + "bbox_fs": [ + 104, + 543, + 506, + 622 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 632, + 258, + 644 + ], + "lines": [ + { + "bbox": [ + 106, + 632, + 259, + 644 + ], + "spans": [ + { + "bbox": [ + 106, + 632, + 259, + 644 + ], + "score": 1.0, + "content": "B.1 ADAPTIVE REGULARIZATION", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 106, + 652, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 653, + 505, + 666 + ], + "spans": [ + { + "bbox": [ + 106, + 653, + 505, + 666 + ], + "score": 1.0, + "content": "The results on isotropic regression in Section 2 imply that ridge regression can be made sample-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 664, + 505, + 676 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 505, + 676 + ], + "score": 1.0, + "content": "monotonic even for non-isotropic covariates, if an appropriate regularizer is applied. Specifically,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 673, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 673, + 392, + 689 + ], + "score": 1.0, + "content": "the appropriate regularizer depends on the covariance of the inputs. For", + "type": "text" + }, + { + "bbox": [ + 392, + 675, + 446, + 687 + ], + "score": 0.92, + "content": "\\boldsymbol { x } \\sim \\mathcal { N } ( 0 , \\Sigma )", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 673, + 505, + 689 + ], + "score": 1.0, + "content": ", the following", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 685, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 104, + 685, + 314, + 703 + ], + "score": 1.0, + "content": "estimator is sample-monotonic for optimally-tuned", + "type": "text" + }, + { + "bbox": [ + 314, + 687, + 321, + 698 + ], + "score": 0.44, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 685, + 326, + 703 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 326, + 686, + 501, + 701 + ], + "score": 0.81, + "content": "\\begin{array} { r } { \\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\boldsymbol { \\beta } } \\| X \\boldsymbol { \\beta } - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| \\boldsymbol { \\beta } \\| _ { \\Sigma ^ { - 1 } } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 685, + 505, + 703 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "This follows directly from Theorem 1 by applying a change-of-variable; full details of this equiva-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 358, + 723 + ], + "score": 1.0, + "content": "lence are in Section A.3. Note that if the population covariance", + "type": "text" + }, + { + "bbox": [ + 359, + 710, + 367, + 720 + ], + "score": 0.82, + "content": "\\Sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "is not known, it can potentially be", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 721, + 231, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 231, + 732 + ], + "score": 1.0, + "content": "estimated from unlabeled data.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 35, + "bbox_fs": [ + 104, + 653, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 110, + 87, + 282, + 255 + ], + "blocks": [ + { + "type": "image_caption", + "bbox": [ + 142, + 84, + 264, + 91 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 142, + 83, + 266, + 92 + ], + "spans": [ + { + "bbox": [ + 142, + 83, + 266, + 92 + ], + "score": 0.985, + "content": "Test Error for Regularized Random Features", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "image_body", + "bbox": [ + 110, + 87, + 282, + 255 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 87, + 282, + 255 + ], + "spans": [ + { + "bbox": [ + 110, + 87, + 282, + 255 + ], + "score": 0.966, + "type": "image", + "image_path": "6d706f197addd390fb2defce66fd1cd5af413a8242fbc58ab89186d03af9186f.jpg" + } + ] + } + ], + "index": 6.5, + "virtual_lines": [ + { + "bbox": [ + 110, + 87, + 282, + 101.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 110, + 101.0, + 282, + 115.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 110, + 115.0, + 282, + 129.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 110, + 129.0, + 282, + 143.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 110, + 143.0, + 282, + 157.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 110, + 157.0, + 282, + 171.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 110, + 171.0, + 282, + 185.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 110, + 185.0, + 282, + 199.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 110, + 199.0, + 282, + 213.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 110, + 213.0, + 282, + 227.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 110, + 227.0, + 282, + 241.0 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 110, + 241.0, + 282, + 255.0 + ], + "spans": [], + "index": 12 + } + ] + } + ], + "index": 3.25 + }, + { + "type": "text", + "bbox": [ + 106, + 264, + 286, + 285 + ], + "lines": [ + { + "bbox": [ + 106, + 263, + 287, + 276 + ], + "spans": [ + { + "bbox": [ + 106, + 263, + 287, + 276 + ], + "score": 1.0, + "content": "(a) Test Classification Error vs. Number of Train-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 273, + 155, + 286 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 155, + 286 + ], + "score": 1.0, + "content": "ing Samples.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "image", + "bbox": [ + 328, + 88, + 500, + 255 + ], + "blocks": [ + { + "type": "image_caption", + "bbox": [ + 360, + 84, + 482, + 91 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 360, + 84, + 483, + 93 + ], + "spans": [ + { + "bbox": [ + 360, + 84, + 483, + 93 + ], + "score": 0.972, + "content": "Test Errorfor Regularized Random Features", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "image_body", + "bbox": [ + 328, + 88, + 500, + 255 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 328, + 88, + 500, + 255 + ], + "spans": [ + { + "bbox": [ + 328, + 88, + 500, + 255 + ], + "score": 0.967, + "type": "image", + "image_path": "ce3f799d5bd5415e26ca617c4e47e654875a8b6c2557b5bf3b3c7007b6a14a4f.jpg" + } + ] + } + ], + "index": 21.5, + "virtual_lines": [ + { + "bbox": [ + 328, + 88, + 500, + 101.91666666666667 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 328, + 101.91666666666667, + 500, + 115.83333333333334 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 328, + 115.83333333333334, + 500, + 129.75 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 328, + 129.75, + 500, + 143.66666666666666 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 328, + 143.66666666666666, + 500, + 157.58333333333331 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 328, + 157.58333333333331, + 500, + 171.49999999999997 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 328, + 171.49999999999997, + 500, + 185.41666666666663 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 328, + 185.41666666666663, + 500, + 199.3333333333333 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 328, + 199.3333333333333, + 500, + 213.24999999999994 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 328, + 213.24999999999994, + 500, + 227.1666666666666 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 328, + 227.1666666666666, + 500, + 241.08333333333326 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 328, + 241.08333333333326, + 500, + 254.99999999999991 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 324, + 264, + 504, + 285 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 324, + 263, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 324, + 263, + 505, + 276 + ], + "score": 1.0, + "content": "(b) Test Classification Error vs. Model Size", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 324, + 273, + 439, + 286 + ], + "spans": [ + { + "bbox": [ + 324, + 273, + 439, + 286 + ], + "score": 1.0, + "content": "(Number of Random Features).", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 106, + 294, + 506, + 349 + ], + "lines": [ + { + "bbox": [ + 106, + 294, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 505, + 306 + ], + "score": 1.0, + "content": "Figure 4: Double-descent for Random ReLU Features. Test classification error as a function of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 305, + 504, + 317 + ], + "spans": [ + { + "bbox": [ + 105, + 305, + 463, + 317 + ], + "score": 1.0, + "content": "model size and sample size for Random ReLU Features on Fashion-MNIST. Left: with", + "type": "text" + }, + { + "bbox": [ + 464, + 305, + 504, + 316 + ], + "score": 0.89, + "content": "D = 5 0 0", + "type": "inline_equation" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 315, + 505, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 193, + 329 + ], + "score": 1.0, + "content": "features. Right: with", + "type": "text" + }, + { + "bbox": [ + 194, + 316, + 231, + 327 + ], + "score": 0.89, + "content": "n = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 315, + 505, + 329 + ], + "score": 1.0, + "content": "samples. See Figures 7, 8 for the corresponding test Mean Squared", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 327, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 505, + 340 + ], + "score": 1.0, + "content": "Error. See Appendix D of Nakkiran et al. (2020) for the performance of these unregularized models", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 337, + 348, + 352 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 225, + 352 + ], + "score": 1.0, + "content": "plotted across Num. Samples", + "type": "text" + }, + { + "bbox": [ + 226, + 339, + 235, + 349 + ], + "score": 0.7, + "content": "\\times", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 337, + 348, + 352 + ], + "score": 1.0, + "content": "Model Size simultaneously.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32 + }, + { + "type": "image", + "bbox": [ + 171, + 366, + 439, + 518 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 171, + 366, + 439, + 518 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 171, + 366, + 439, + 518 + ], + "spans": [ + { + "bbox": [ + 171, + 366, + 439, + 518 + ], + "score": 0.971, + "type": "image", + "image_path": "05df2a46592e323dc1205edaa5fa11d2355d7bba6df96212a7b9f700cd4a121b.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 171, + 366, + 439, + 416.6666666666667 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 171, + 416.6666666666667, + 439, + 467.33333333333337 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 171, + 467.33333333333337, + 439, + 518.0 + ], + "spans": [], + "index": 37 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 532, + 504, + 555 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 105, + 530, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 434, + 545 + ], + "score": 1.0, + "content": "Figure 5: Train Error vs. Model Size for 5-layer CNNs on CIFAR-100, with", + "type": "text" + }, + { + "bbox": [ + 434, + 532, + 444, + 543 + ], + "score": 0.86, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 530, + 505, + 545 + ], + "score": 1.0, + "content": "regularization", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 543, + 171, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 171, + 556 + ], + "score": 1.0, + "content": "(weight decay).", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + } + ], + "index": 37.25 + }, + { + "type": "title", + "bbox": [ + 108, + 574, + 289, + 586 + ], + "lines": [ + { + "bbox": [ + 106, + 574, + 290, + 587 + ], + "spans": [ + { + "bbox": [ + 106, + 574, + 290, + 587 + ], + "score": 1.0, + "content": "B.2 TOWARDS PROVING MONOTONICITY", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 106, + 595, + 505, + 640 + ], + "lines": [ + { + "bbox": [ + 106, + 596, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 505, + 608 + ], + "score": 1.0, + "content": "We conjecture that optimally-regularized ridge regression is sample-monotonic for non-isotropic", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 606, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 606, + 506, + 618 + ], + "score": 1.0, + "content": "covariates, even without modifying the regularizer (as suggested by the experiment in Figure 2). We", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 617, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 506, + 630 + ], + "score": 1.0, + "content": "derive a sufficient condition for monotonicity, which we have numerically verified in a variety of", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 627, + 316, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 316, + 642 + ], + "score": 1.0, + "content": "instances. Specifically, we conjecture the following.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42.5 + }, + { + "type": "text", + "bbox": [ + 106, + 642, + 505, + 689 + ], + "lines": [ + { + "bbox": [ + 105, + 639, + 506, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 201, + 656 + ], + "score": 1.0, + "content": "Conjecture 1. For all", + "type": "text" + }, + { + "bbox": [ + 201, + 642, + 230, + 653 + ], + "score": 0.89, + "content": "d \\in \\mathbb { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 639, + 339, + 656 + ], + "score": 1.0, + "content": ", and all PSD covariances", + "type": "text" + }, + { + "bbox": [ + 339, + 641, + 385, + 653 + ], + "score": 0.92, + "content": "\\Sigma \\in \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 639, + 506, + 656 + ], + "score": 1.0, + "content": ", consider the distribution on", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 107, + 653, + 506, + 666 + ], + "spans": [ + { + "bbox": [ + 107, + 654, + 131, + 666 + ], + "score": 0.9, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 653, + 158, + 666 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 159, + 653, + 212, + 666 + ], + "score": 0.93, + "content": "x \\sim \\mathcal { N } ( 0 , \\Sigma )", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 653, + 234, + 666 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 234, + 653, + 331, + 666 + ], + "score": 0.91, + "content": "y \\sim \\langle x , \\beta ^ { * } \\rangle + \\mathcal { N } ( 0 , \\sigma ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 332, + 653, + 506, + 666 + ], + "score": 1.0, + "content": ". Then, we conjecture that the expected test", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 104, + 665, + 506, + 680 + ], + "spans": [ + { + "bbox": [ + 104, + 665, + 261, + 680 + ], + "score": 1.0, + "content": "risk of the ridge regression estimator:", + "type": "text" + }, + { + "bbox": [ + 262, + 666, + 424, + 680 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\boldsymbol { \\beta } } \\| X { \\boldsymbol { \\beta } } - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| { \\boldsymbol { \\beta } } \\| _ { 2 } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 665, + 506, + 680 + ], + "score": 1.0, + "content": "for optimally-tuned", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 107, + 677, + 438, + 690 + ], + "spans": [ + { + "bbox": [ + 107, + 678, + 132, + 689 + ], + "score": 0.88, + "content": "\\lambda \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 677, + 337, + 690 + ], + "score": 1.0, + "content": ", is monotone non-increasing in number of samples", + "type": "text" + }, + { + "bbox": [ + 337, + 680, + 344, + 687 + ], + "score": 0.61, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 344, + 677, + 408, + 690 + ], + "score": 1.0, + "content": ". That is, for all", + "type": "text" + }, + { + "bbox": [ + 408, + 678, + 434, + 688 + ], + "score": 0.88, + "content": "n \\in \\mathbb { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 677, + 438, + 690 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 46.5 + }, + { + "type": "interline_equation", + "bbox": [ + 239, + 693, + 372, + 714 + ], + "lines": [ + { + "bbox": [ + 239, + 693, + 372, + 714 + ], + "spans": [ + { + "bbox": [ + 239, + 693, + 372, + 714 + ], + "score": 0.92, + "content": "\\operatorname * { i n f } _ { \\lambda \\geq 0 } \\overline { { { R } } } ( \\hat { \\beta } _ { n + 1 , \\lambda } ) \\leq \\operatorname * { i n f } _ { \\lambda \\geq 0 } \\overline { { { R } } } ( \\hat { \\beta } _ { n , \\lambda } )", + "type": "interline_equation", + "image_path": "c9c57ee5be88035eb586dc57d2d1e0b886158489d7bd35b146d1aa191662b2a5.jpg" + } + ] + } + ], + "index": 49, + "virtual_lines": [ + { + "bbox": [ + 239, + 693, + 372, + 714 + ], + "spans": [], + "index": 49 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 718, + 299, + 734 + ], + "lines": [ + { + "bbox": [ + 105, + 717, + 299, + 736 + ], + "spans": [ + { + "bbox": [ + 105, + 717, + 173, + 736 + ], + "score": 1.0, + "content": "where we define", + "type": "text" + }, + { + "bbox": [ + 173, + 718, + 296, + 733 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\hat { \\beta } _ { n , 0 } : = \\operatorname* { l i m } _ { \\lambda \\to 0 + } \\hat { \\beta } _ { n , \\lambda } = X ^ { \\dagger } y } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 717, + 299, + 736 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 50 + } + ], + "page_idx": 18, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 291, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 14 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 110, + 87, + 282, + 255 + ], + "blocks": [ + { + "type": "image_caption", + "bbox": [ + 142, + 84, + 264, + 91 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 142, + 83, + 266, + 92 + ], + "spans": [ + { + "bbox": [ + 142, + 83, + 266, + 92 + ], + "score": 0.985, + "content": "Test Error for Regularized Random Features", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "image_body", + "bbox": [ + 110, + 87, + 282, + 255 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 87, + 282, + 255 + ], + "spans": [ + { + "bbox": [ + 110, + 87, + 282, + 255 + ], + "score": 0.966, + "type": "image", + "image_path": "6d706f197addd390fb2defce66fd1cd5af413a8242fbc58ab89186d03af9186f.jpg" + } + ] + } + ], + "index": 6.5, + "virtual_lines": [ + { + "bbox": [ + 110, + 87, + 282, + 101.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 110, + 101.0, + 282, + 115.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 110, + 115.0, + 282, + 129.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 110, + 129.0, + 282, + 143.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 110, + 143.0, + 282, + 157.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 110, + 157.0, + 282, + 171.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 110, + 171.0, + 282, + 185.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 110, + 185.0, + 282, + 199.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 110, + 199.0, + 282, + 213.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 110, + 213.0, + 282, + 227.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 110, + 227.0, + 282, + 241.0 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 110, + 241.0, + 282, + 255.0 + ], + "spans": [], + "index": 12 + } + ] + } + ], + "index": 3.25 + }, + { + "type": "text", + "bbox": [ + 106, + 264, + 286, + 285 + ], + "lines": [ + { + "bbox": [ + 106, + 263, + 287, + 276 + ], + "spans": [ + { + "bbox": [ + 106, + 263, + 287, + 276 + ], + "score": 1.0, + "content": "(a) Test Classification Error vs. Number of Train-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 273, + 155, + 286 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 155, + 286 + ], + "score": 1.0, + "content": "ing Samples.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 263, + 287, + 286 + ] + }, + { + "type": "image", + "bbox": [ + 328, + 88, + 500, + 255 + ], + "blocks": [ + { + "type": "image_caption", + "bbox": [ + 360, + 84, + 482, + 91 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 360, + 84, + 483, + 93 + ], + "spans": [ + { + "bbox": [ + 360, + 84, + 483, + 93 + ], + "score": 0.972, + "content": "Test Errorfor Regularized Random Features", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "image_body", + "bbox": [ + 328, + 88, + 500, + 255 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 328, + 88, + 500, + 255 + ], + "spans": [ + { + "bbox": [ + 328, + 88, + 500, + 255 + ], + "score": 0.967, + "type": "image", + "image_path": "ce3f799d5bd5415e26ca617c4e47e654875a8b6c2557b5bf3b3c7007b6a14a4f.jpg" + } + ] + } + ], + "index": 21.5, + "virtual_lines": [ + { + "bbox": [ + 328, + 88, + 500, + 101.91666666666667 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 328, + 101.91666666666667, + 500, + 115.83333333333334 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 328, + 115.83333333333334, + 500, + 129.75 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 328, + 129.75, + 500, + 143.66666666666666 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 328, + 143.66666666666666, + 500, + 157.58333333333331 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 328, + 157.58333333333331, + 500, + 171.49999999999997 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 328, + 171.49999999999997, + 500, + 185.41666666666663 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 328, + 185.41666666666663, + 500, + 199.3333333333333 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 328, + 199.3333333333333, + 500, + 213.24999999999994 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 328, + 213.24999999999994, + 500, + 227.1666666666666 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 328, + 227.1666666666666, + 500, + 241.08333333333326 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 328, + 241.08333333333326, + 500, + 254.99999999999991 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 324, + 264, + 504, + 285 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 324, + 263, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 324, + 263, + 505, + 276 + ], + "score": 1.0, + "content": "(b) Test Classification Error vs. Model Size", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 324, + 273, + 439, + 286 + ], + "spans": [ + { + "bbox": [ + 324, + 273, + 439, + 286 + ], + "score": 1.0, + "content": "(Number of Random Features).", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 106, + 294, + 506, + 349 + ], + "lines": [ + { + "bbox": [ + 106, + 294, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 505, + 306 + ], + "score": 1.0, + "content": "Figure 4: Double-descent for Random ReLU Features. Test classification error as a function of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 305, + 504, + 317 + ], + "spans": [ + { + "bbox": [ + 105, + 305, + 463, + 317 + ], + "score": 1.0, + "content": "model size and sample size for Random ReLU Features on Fashion-MNIST. Left: with", + "type": "text" + }, + { + "bbox": [ + 464, + 305, + 504, + 316 + ], + "score": 0.89, + "content": "D = 5 0 0", + "type": "inline_equation" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 315, + 505, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 193, + 329 + ], + "score": 1.0, + "content": "features. Right: with", + "type": "text" + }, + { + "bbox": [ + 194, + 316, + 231, + 327 + ], + "score": 0.89, + "content": "n = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 315, + 505, + 329 + ], + "score": 1.0, + "content": "samples. See Figures 7, 8 for the corresponding test Mean Squared", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 327, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 505, + 340 + ], + "score": 1.0, + "content": "Error. See Appendix D of Nakkiran et al. (2020) for the performance of these unregularized models", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 337, + 348, + 352 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 225, + 352 + ], + "score": 1.0, + "content": "plotted across Num. Samples", + "type": "text" + }, + { + "bbox": [ + 226, + 339, + 235, + 349 + ], + "score": 0.7, + "content": "\\times", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 337, + 348, + 352 + ], + "score": 1.0, + "content": "Model Size simultaneously.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 294, + 505, + 352 + ] + }, + { + "type": "image", + "bbox": [ + 171, + 366, + 439, + 518 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 171, + 366, + 439, + 518 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 171, + 366, + 439, + 518 + ], + "spans": [ + { + "bbox": [ + 171, + 366, + 439, + 518 + ], + "score": 0.971, + "type": "image", + "image_path": "05df2a46592e323dc1205edaa5fa11d2355d7bba6df96212a7b9f700cd4a121b.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 171, + 366, + 439, + 416.6666666666667 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 171, + 416.6666666666667, + 439, + 467.33333333333337 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 171, + 467.33333333333337, + 439, + 518.0 + ], + "spans": [], + "index": 37 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 532, + 504, + 555 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 105, + 530, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 434, + 545 + ], + "score": 1.0, + "content": "Figure 5: Train Error vs. Model Size for 5-layer CNNs on CIFAR-100, with", + "type": "text" + }, + { + "bbox": [ + 434, + 532, + 444, + 543 + ], + "score": 0.86, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 530, + 505, + 545 + ], + "score": 1.0, + "content": "regularization", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 543, + 171, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 171, + 556 + ], + "score": 1.0, + "content": "(weight decay).", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + } + ], + "index": 37.25 + }, + { + "type": "title", + "bbox": [ + 108, + 574, + 289, + 586 + ], + "lines": [ + { + "bbox": [ + 106, + 574, + 290, + 587 + ], + "spans": [ + { + "bbox": [ + 106, + 574, + 290, + 587 + ], + "score": 1.0, + "content": "B.2 TOWARDS PROVING MONOTONICITY", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 106, + 595, + 505, + 640 + ], + "lines": [ + { + "bbox": [ + 106, + 596, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 505, + 608 + ], + "score": 1.0, + "content": "We conjecture that optimally-regularized ridge regression is sample-monotonic for non-isotropic", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 606, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 606, + 506, + 618 + ], + "score": 1.0, + "content": "covariates, even without modifying the regularizer (as suggested by the experiment in Figure 2). We", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 617, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 506, + 630 + ], + "score": 1.0, + "content": "derive a sufficient condition for monotonicity, which we have numerically verified in a variety of", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 627, + 316, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 316, + 642 + ], + "score": 1.0, + "content": "instances. Specifically, we conjecture the following.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42.5, + "bbox_fs": [ + 105, + 596, + 506, + 642 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 642, + 505, + 689 + ], + "lines": [ + { + "bbox": [ + 105, + 639, + 506, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 201, + 656 + ], + "score": 1.0, + "content": "Conjecture 1. For all", + "type": "text" + }, + { + "bbox": [ + 201, + 642, + 230, + 653 + ], + "score": 0.89, + "content": "d \\in \\mathbb { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 639, + 339, + 656 + ], + "score": 1.0, + "content": ", and all PSD covariances", + "type": "text" + }, + { + "bbox": [ + 339, + 641, + 385, + 653 + ], + "score": 0.92, + "content": "\\Sigma \\in \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 639, + 506, + 656 + ], + "score": 1.0, + "content": ", consider the distribution on", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 107, + 653, + 506, + 666 + ], + "spans": [ + { + "bbox": [ + 107, + 654, + 131, + 666 + ], + "score": 0.9, + "content": "( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 653, + 158, + 666 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 159, + 653, + 212, + 666 + ], + "score": 0.93, + "content": "x \\sim \\mathcal { N } ( 0 , \\Sigma )", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 653, + 234, + 666 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 234, + 653, + 331, + 666 + ], + "score": 0.91, + "content": "y \\sim \\langle x , \\beta ^ { * } \\rangle + \\mathcal { N } ( 0 , \\sigma ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 332, + 653, + 506, + 666 + ], + "score": 1.0, + "content": ". Then, we conjecture that the expected test", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 104, + 665, + 506, + 680 + ], + "spans": [ + { + "bbox": [ + 104, + 665, + 261, + 680 + ], + "score": 1.0, + "content": "risk of the ridge regression estimator:", + "type": "text" + }, + { + "bbox": [ + 262, + 666, + 424, + 680 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\boldsymbol { \\beta } } \\| X { \\boldsymbol { \\beta } } - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| { \\boldsymbol { \\beta } } \\| _ { 2 } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 665, + 506, + 680 + ], + "score": 1.0, + "content": "for optimally-tuned", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 107, + 677, + 438, + 690 + ], + "spans": [ + { + "bbox": [ + 107, + 678, + 132, + 689 + ], + "score": 0.88, + "content": "\\lambda \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 677, + 337, + 690 + ], + "score": 1.0, + "content": ", is monotone non-increasing in number of samples", + "type": "text" + }, + { + "bbox": [ + 337, + 680, + 344, + 687 + ], + "score": 0.61, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 344, + 677, + 408, + 690 + ], + "score": 1.0, + "content": ". That is, for all", + "type": "text" + }, + { + "bbox": [ + 408, + 678, + 434, + 688 + ], + "score": 0.88, + "content": "n \\in \\mathbb { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 677, + 438, + 690 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 46.5, + "bbox_fs": [ + 104, + 639, + 506, + 690 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 239, + 693, + 372, + 714 + ], + "lines": [ + { + "bbox": [ + 239, + 693, + 372, + 714 + ], + "spans": [ + { + "bbox": [ + 239, + 693, + 372, + 714 + ], + "score": 0.92, + "content": "\\operatorname * { i n f } _ { \\lambda \\geq 0 } \\overline { { { R } } } ( \\hat { \\beta } _ { n + 1 , \\lambda } ) \\leq \\operatorname * { i n f } _ { \\lambda \\geq 0 } \\overline { { { R } } } ( \\hat { \\beta } _ { n , \\lambda } )", + "type": "interline_equation", + "image_path": "c9c57ee5be88035eb586dc57d2d1e0b886158489d7bd35b146d1aa191662b2a5.jpg" + } + ] + } + ], + "index": 49, + "virtual_lines": [ + { + "bbox": [ + 239, + 693, + 372, + 714 + ], + "spans": [], + "index": 49 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 718, + 299, + 734 + ], + "lines": [ + { + "bbox": [ + 105, + 717, + 299, + 736 + ], + "spans": [ + { + "bbox": [ + 105, + 717, + 173, + 736 + ], + "score": 1.0, + "content": "where we define", + "type": "text" + }, + { + "bbox": [ + 173, + 718, + 296, + 733 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\hat { \\beta } _ { n , 0 } : = \\operatorname* { l i m } _ { \\lambda \\to 0 + } \\hat { \\beta } _ { n , \\lambda } = X ^ { \\dagger } y } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 717, + 299, + 736 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 50, + "bbox_fs": [ + 105, + 717, + 299, + 736 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 200, + 85, + 411, + 294 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 200, + 85, + 411, + 294 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 200, + 85, + 411, + 294 + ], + "spans": [ + { + "bbox": [ + 200, + 85, + 411, + 294 + ], + "score": 0.972, + "type": "image", + "image_path": "d4048491df9a41611fd80fea0aeac569328ee316a77886c71b4c9d4ba9170d40.jpg" + } + ] + } + ], + "index": 7.5, + "virtual_lines": [ + { + "bbox": [ + 200, + 85, + 411, + 98.0625 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 200, + 98.0625, + 411, + 111.125 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 200, + 111.125, + 411, + 124.1875 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 200, + 124.1875, + 411, + 137.25 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 200, + 137.25, + 411, + 150.3125 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 200, + 150.3125, + 411, + 163.375 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 200, + 163.375, + 411, + 176.4375 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 200, + 176.4375, + 411, + 189.5 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 200, + 189.5, + 411, + 202.5625 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 200, + 202.5625, + 411, + 215.625 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 200, + 215.625, + 411, + 228.6875 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 200, + 228.6875, + 411, + 241.75 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 200, + 241.75, + 411, + 254.8125 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 200, + 254.8125, + 411, + 267.875 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 200, + 267.875, + 411, + 280.9375 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 200, + 280.9375, + 411, + 294.0 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 307, + 503, + 334 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 423, + 321 + ], + "score": 1.0, + "content": "Figure 6: Train MSE vs. Num. Samples for Non-Isotropic Ridge Regression in", + "type": "text" + }, + { + "bbox": [ + 424, + 308, + 454, + 318 + ], + "score": 0.89, + "content": "d = 3 0", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 307, + 505, + 321 + ], + "score": 1.0, + "content": "dimensions,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 319, + 352, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 291, + 335 + ], + "score": 1.0, + "content": "in the setting of Figure 2. Plotting train MSE:", + "type": "text" + }, + { + "bbox": [ + 291, + 319, + 348, + 334 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\frac { 1 } { n } | | X \\hat { \\boldsymbol { \\beta } } - \\vec { y } | | _ { 2 } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 319, + 352, + 335 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + } + ], + "index": 12.0 + }, + { + "type": "image", + "bbox": [ + 200, + 351, + 411, + 560 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 200, + 351, + 411, + 560 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 200, + 351, + 411, + 560 + ], + "spans": [ + { + "bbox": [ + 200, + 351, + 411, + 560 + ], + "score": 0.973, + "type": "image", + "image_path": "aa84a8ffbd2beefb1d745ab29a4ccc613c56c1dfa1eef8d51380a0483dcffecb.jpg" + } + ] + } + ], + "index": 25.5, + "virtual_lines": [ + { + "bbox": [ + 200, + 351, + 411, + 364.0625 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 200, + 364.0625, + 411, + 377.125 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 200, + 377.125, + 411, + 390.1875 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 200, + 390.1875, + 411, + 403.25 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 200, + 403.25, + 411, + 416.3125 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 200, + 416.3125, + 411, + 429.375 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 200, + 429.375, + 411, + 442.4375 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 200, + 442.4375, + 411, + 455.5 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 200, + 455.5, + 411, + 468.5625 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 200, + 468.5625, + 411, + 481.625 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 200, + 481.625, + 411, + 494.6875 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 200, + 494.6875, + 411, + 507.75 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 200, + 507.75, + 411, + 520.8125 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 200, + 520.8125, + 411, + 533.875 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 200, + 533.875, + 411, + 546.9375 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 200, + 546.9375, + 411, + 560.0 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 574, + 502, + 596 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 573, + 504, + 586 + ], + "spans": [ + { + "bbox": [ + 106, + 573, + 504, + 586 + ], + "score": 1.0, + "content": "Figure 7: Test Mean Squared Error vs. Num Train Samples for Random ReLU Features on Fashion-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 585, + 237, + 597 + ], + "spans": [ + { + "bbox": [ + 106, + 585, + 162, + 597 + ], + "score": 1.0, + "content": "MNIST, with", + "type": "text" + }, + { + "bbox": [ + 162, + 586, + 200, + 596 + ], + "score": 0.9, + "content": "D = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 585, + 237, + 597 + ], + "score": 1.0, + "content": "features.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5 + } + ], + "index": 30.0 + }, + { + "type": "text", + "bbox": [ + 107, + 621, + 505, + 677 + ], + "lines": [ + { + "bbox": [ + 106, + 621, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 505, + 633 + ], + "score": 1.0, + "content": "In Appendix B.3 we present a technical conjecture in random matrix theory (Conjecture 2) which", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 630, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 506, + 646 + ], + "score": 1.0, + "content": "suffices to prove Conjecture 1. Proving this Conjecture 2 presents a number of technical challenges,", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 643, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 643, + 505, + 655 + ], + "score": 1.0, + "content": "but we have numerically verified it in a variety of cases. It can also be shown that Conjecture 2 is true", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 654, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 131, + 667 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 131, + 654, + 160, + 666 + ], + "score": 0.91, + "content": "Q = I", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 654, + 506, + 667 + ], + "score": 1.0, + "content": ", corresponding to isotropic covariates. We prove the reduction between Conjecture 2", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 666, + 202, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 202, + 677 + ], + "score": 1.0, + "content": "and 1 in Appendix B.3.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38 + }, + { + "type": "title", + "bbox": [ + 108, + 695, + 298, + 707 + ], + "lines": [ + { + "bbox": [ + 105, + 694, + 300, + 709 + ], + "spans": [ + { + "bbox": [ + 105, + 694, + 300, + 709 + ], + "score": 1.0, + "content": "B.3 MONOTONICITY CONJECTURE PROOFS", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 103, + 720, + 475, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 719, + 477, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 477, + 734 + ], + "score": 1.0, + "content": "In order to establish Conjecture 1, it is sufficient to prove the following technical conjecture.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 42 + } + ], + "page_idx": 19, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 292, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 15 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 200, + 85, + 411, + 294 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 200, + 85, + 411, + 294 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 200, + 85, + 411, + 294 + ], + "spans": [ + { + "bbox": [ + 200, + 85, + 411, + 294 + ], + "score": 0.972, + "type": "image", + "image_path": "d4048491df9a41611fd80fea0aeac569328ee316a77886c71b4c9d4ba9170d40.jpg" + } + ] + } + ], + "index": 7.5, + "virtual_lines": [ + { + "bbox": [ + 200, + 85, + 411, + 98.0625 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 200, + 98.0625, + 411, + 111.125 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 200, + 111.125, + 411, + 124.1875 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 200, + 124.1875, + 411, + 137.25 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 200, + 137.25, + 411, + 150.3125 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 200, + 150.3125, + 411, + 163.375 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 200, + 163.375, + 411, + 176.4375 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 200, + 176.4375, + 411, + 189.5 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 200, + 189.5, + 411, + 202.5625 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 200, + 202.5625, + 411, + 215.625 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 200, + 215.625, + 411, + 228.6875 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 200, + 228.6875, + 411, + 241.75 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 200, + 241.75, + 411, + 254.8125 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 200, + 254.8125, + 411, + 267.875 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 200, + 267.875, + 411, + 280.9375 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 200, + 280.9375, + 411, + 294.0 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 307, + 503, + 334 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 423, + 321 + ], + "score": 1.0, + "content": "Figure 6: Train MSE vs. Num. Samples for Non-Isotropic Ridge Regression in", + "type": "text" + }, + { + "bbox": [ + 424, + 308, + 454, + 318 + ], + "score": 0.89, + "content": "d = 3 0", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 307, + 505, + 321 + ], + "score": 1.0, + "content": "dimensions,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 319, + 352, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 291, + 335 + ], + "score": 1.0, + "content": "in the setting of Figure 2. Plotting train MSE:", + "type": "text" + }, + { + "bbox": [ + 291, + 319, + 348, + 334 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\frac { 1 } { n } | | X \\hat { \\boldsymbol { \\beta } } - \\vec { y } | | _ { 2 } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 319, + 352, + 335 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + } + ], + "index": 12.0 + }, + { + "type": "image", + "bbox": [ + 200, + 351, + 411, + 560 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 200, + 351, + 411, + 560 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 200, + 351, + 411, + 560 + ], + "spans": [ + { + "bbox": [ + 200, + 351, + 411, + 560 + ], + "score": 0.973, + "type": "image", + "image_path": "aa84a8ffbd2beefb1d745ab29a4ccc613c56c1dfa1eef8d51380a0483dcffecb.jpg" + } + ] + } + ], + "index": 25.5, + "virtual_lines": [ + { + "bbox": [ + 200, + 351, + 411, + 364.0625 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 200, + 364.0625, + 411, + 377.125 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 200, + 377.125, + 411, + 390.1875 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 200, + 390.1875, + 411, + 403.25 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 200, + 403.25, + 411, + 416.3125 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 200, + 416.3125, + 411, + 429.375 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 200, + 429.375, + 411, + 442.4375 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 200, + 442.4375, + 411, + 455.5 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 200, + 455.5, + 411, + 468.5625 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 200, + 468.5625, + 411, + 481.625 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 200, + 481.625, + 411, + 494.6875 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 200, + 494.6875, + 411, + 507.75 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 200, + 507.75, + 411, + 520.8125 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 200, + 520.8125, + 411, + 533.875 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 200, + 533.875, + 411, + 546.9375 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 200, + 546.9375, + 411, + 560.0 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 574, + 502, + 596 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 573, + 504, + 586 + ], + "spans": [ + { + "bbox": [ + 106, + 573, + 504, + 586 + ], + "score": 1.0, + "content": "Figure 7: Test Mean Squared Error vs. Num Train Samples for Random ReLU Features on Fashion-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 585, + 237, + 597 + ], + "spans": [ + { + "bbox": [ + 106, + 585, + 162, + 597 + ], + "score": 1.0, + "content": "MNIST, with", + "type": "text" + }, + { + "bbox": [ + 162, + 586, + 200, + 596 + ], + "score": 0.9, + "content": "D = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 585, + 237, + 597 + ], + "score": 1.0, + "content": "features.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5 + } + ], + "index": 30.0 + }, + { + "type": "text", + "bbox": [ + 107, + 621, + 505, + 677 + ], + "lines": [ + { + "bbox": [ + 106, + 621, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 505, + 633 + ], + "score": 1.0, + "content": "In Appendix B.3 we present a technical conjecture in random matrix theory (Conjecture 2) which", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 630, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 506, + 646 + ], + "score": 1.0, + "content": "suffices to prove Conjecture 1. Proving this Conjecture 2 presents a number of technical challenges,", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 643, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 643, + 505, + 655 + ], + "score": 1.0, + "content": "but we have numerically verified it in a variety of cases. It can also be shown that Conjecture 2 is true", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 654, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 131, + 667 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 131, + 654, + 160, + 666 + ], + "score": 0.91, + "content": "Q = I", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 654, + 506, + 667 + ], + "score": 1.0, + "content": ", corresponding to isotropic covariates. We prove the reduction between Conjecture 2", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 666, + 202, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 202, + 677 + ], + "score": 1.0, + "content": "and 1 in Appendix B.3.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38, + "bbox_fs": [ + 105, + 621, + 506, + 677 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 695, + 298, + 707 + ], + "lines": [ + { + "bbox": [ + 105, + 694, + 300, + 709 + ], + "spans": [ + { + "bbox": [ + 105, + 694, + 300, + 709 + ], + "score": 1.0, + "content": "B.3 MONOTONICITY CONJECTURE PROOFS", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 103, + 720, + 475, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 719, + 477, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 477, + 734 + ], + "score": 1.0, + "content": "In order to establish Conjecture 1, it is sufficient to prove the following technical conjecture.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 42, + "bbox_fs": [ + 105, + 719, + 477, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 200, + 84, + 411, + 295 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 200, + 84, + 411, + 295 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 200, + 84, + 411, + 295 + ], + "spans": [ + { + "bbox": [ + 200, + 84, + 411, + 295 + ], + "score": 0.973, + "type": "image", + "image_path": "8eda0db61a5bd63cb07df9565b6981c5a80a7fd865e013f9ce281e419515418e.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 200, + 84, + 411, + 98.06666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 200, + 98.06666666666666, + 411, + 112.13333333333333 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 200, + 112.13333333333333, + 411, + 126.19999999999999 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 200, + 126.19999999999999, + 411, + 140.26666666666665 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 200, + 140.26666666666665, + 411, + 154.33333333333331 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 200, + 154.33333333333331, + 411, + 168.39999999999998 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 200, + 168.39999999999998, + 411, + 182.46666666666664 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 200, + 182.46666666666664, + 411, + 196.5333333333333 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 200, + 196.5333333333333, + 411, + 210.59999999999997 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 200, + 210.59999999999997, + 411, + 224.66666666666663 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 200, + 224.66666666666663, + 411, + 238.7333333333333 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 200, + 238.7333333333333, + 411, + 252.79999999999995 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 200, + 252.79999999999995, + 411, + 266.8666666666666 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 200, + 266.8666666666666, + 411, + 280.9333333333333 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 200, + 280.9333333333333, + 411, + 294.99999999999994 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 307, + 502, + 331 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 307, + 504, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 504, + 320 + ], + "score": 1.0, + "content": "Figure 8: Test Mean Squared Error vs. Num Features for Random ReLU Features on Fashion-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 318, + 235, + 331 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 162, + 331 + ], + "score": 1.0, + "content": "MNIST, with", + "type": "text" + }, + { + "bbox": [ + 162, + 319, + 198, + 330 + ], + "score": 0.88, + "content": "n = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 318, + 235, + 331 + ], + "score": 1.0, + "content": "samples.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + } + ], + "index": 11.25 + }, + { + "type": "text", + "bbox": [ + 107, + 351, + 504, + 375 + ], + "lines": [ + { + "bbox": [ + 104, + 349, + 507, + 365 + ], + "spans": [ + { + "bbox": [ + 104, + 349, + 200, + 365 + ], + "score": 1.0, + "content": "Conjecture 2. For all", + "type": "text" + }, + { + "bbox": [ + 201, + 352, + 295, + 363 + ], + "score": 0.28, + "content": "n \\in \\mathbb { N } , d \\geq n , \\lambda > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 349, + 439, + 365 + ], + "score": 1.0, + "content": ", symmetric positive definite matrix", + "type": "text" + }, + { + "bbox": [ + 440, + 351, + 486, + 364 + ], + "score": 0.92, + "content": "Q \\in \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 349, + 507, + 365 + ], + "score": 1.0, + "content": ", the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 362, + 173, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 173, + 376 + ], + "score": 1.0, + "content": "following holds.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 106, + 380, + 135, + 392 + ], + "lines": [ + { + "bbox": [ + 104, + 378, + 137, + 396 + ], + "spans": [ + { + "bbox": [ + 104, + 378, + 137, + 396 + ], + "score": 1.0, + "content": "Define", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "interline_equation", + "bbox": [ + 243, + 389, + 368, + 409 + ], + "lines": [ + { + "bbox": [ + 243, + 389, + 368, + 409 + ], + "spans": [ + { + "bbox": [ + 243, + 389, + 368, + 409 + ], + "score": 0.93, + "content": "G _ { \\lambda } ^ { n } : = \\lambda ^ { 2 } \\underset { X } { \\mathbb { E } } [ ( X ^ { T } X + \\lambda Q ) ^ { - 2 } ]", + "type": "interline_equation", + "image_path": "ad76a8c087b005ddee977955e15dff2088f817370c0193f16b774104a3fb7cc1.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 243, + 389, + 368, + 409 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 412, + 414, + 425 + ], + "lines": [ + { + "bbox": [ + 105, + 410, + 414, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 133, + 428 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 412, + 178, + 424 + ], + "score": 0.92, + "content": "\\ b { X } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 410, + 309, + 428 + ], + "score": 1.0, + "content": "is sampled with each entry i.i.d.", + "type": "text" + }, + { + "bbox": [ + 309, + 413, + 342, + 425 + ], + "score": 0.92, + "content": "\\mathcal { N } ( 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 410, + 414, + 428 + ], + "score": 1.0, + "content": ". Similarly, define", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "interline_equation", + "bbox": [ + 234, + 430, + 377, + 450 + ], + "lines": [ + { + "bbox": [ + 234, + 430, + 377, + 450 + ], + "spans": [ + { + "bbox": [ + 234, + 430, + 377, + 450 + ], + "score": 0.93, + "content": "H _ { \\lambda } ^ { n } : = \\mathbb { E } [ | | X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } | | _ { F } ^ { 2 } ]", + "type": "interline_equation", + "image_path": "231a0f4ef6fbdc38727280f01461eda169b50c285dd0fde6c57d63e46a831858.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 234, + 430, + 377, + 450 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 456, + 336, + 468 + ], + "lines": [ + { + "bbox": [ + 105, + 454, + 337, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 209, + 470 + ], + "score": 1.0, + "content": "The expected test risk for", + "type": "text" + }, + { + "bbox": [ + 209, + 459, + 216, + 466 + ], + "score": 0.55, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 454, + 337, + 470 + ], + "score": 1.0, + "content": "samples can be expressed as:", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "interline_equation", + "bbox": [ + 227, + 473, + 385, + 488 + ], + "lines": [ + { + "bbox": [ + 227, + 473, + 385, + 488 + ], + "spans": [ + { + "bbox": [ + 227, + 473, + 385, + 488 + ], + "score": 0.92, + "content": "\\overline { { { R } } } ( \\hat { \\beta } _ { n , \\lambda } ) = ( \\beta ^ { * } ) ^ { T } G _ { \\lambda } ^ { n } \\beta ^ { * } + \\sigma ^ { 2 } H _ { \\lambda } ^ { n } + \\sigma ^ { 2 }", + "type": "interline_equation", + "image_path": "c89974b87c986d9d15a75f2dd3fb1e0db209a7da6355aa40f2d30e736ed328c1.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 227, + 473, + 385, + 488 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 499, + 344, + 511 + ], + "lines": [ + { + "bbox": [ + 106, + 499, + 344, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 499, + 344, + 513 + ], + "score": 1.0, + "content": "Then, we conjecture that the following two conditions hold.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 130, + 521, + 138, + 532 + ], + "lines": [ + { + "bbox": [ + 129, + 521, + 140, + 535 + ], + "spans": [ + { + "bbox": [ + 129, + 521, + 140, + 535 + ], + "score": 1.0, + "content": "1.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "interline_equation", + "bbox": [ + 298, + 530, + 349, + 545 + ], + "lines": [ + { + "bbox": [ + 298, + 530, + 349, + 545 + ], + "spans": [ + { + "bbox": [ + 298, + 530, + 349, + 545 + ], + "score": 0.93, + "content": "G _ { \\lambda } ^ { n } \\succeq G _ { \\lambda } ^ { n + 1 }", + "type": "interline_equation", + "image_path": "336184f3133bbe3606ffc5cf5d47e56e1ddb0b17a540f79cdd78752af7fc88b0.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 298, + 530, + 349, + 545 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 130, + 554, + 138, + 564 + ], + "lines": [ + { + "bbox": [ + 129, + 553, + 140, + 567 + ], + "spans": [ + { + "bbox": [ + 129, + 553, + 140, + 567 + ], + "score": 1.0, + "content": "2.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "interline_equation", + "bbox": [ + 230, + 568, + 417, + 595 + ], + "lines": [ + { + "bbox": [ + 230, + 568, + 417, + 595 + ], + "spans": [ + { + "bbox": [ + 230, + 568, + 417, + 595 + ], + "score": 0.93, + "content": "( G _ { \\lambda } ^ { n } - G _ { \\lambda } ^ { n + 1 } ) - ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) \\frac { d G _ { \\lambda } ^ { n } / d \\lambda } { d H _ { \\lambda } ^ { n } / d \\lambda } \\succeq 0", + "type": "interline_equation", + "image_path": "5c3c2fe8f8069e1ad2ae74cc0f35a3b3a716f86e6780793a14502d60454d7f41.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 230, + 568, + 417, + 595 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 600, + 294, + 613 + ], + "lines": [ + { + "bbox": [ + 105, + 598, + 291, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 286, + 615 + ], + "score": 1.0, + "content": "Lemma 6. Conjecture 2 implies Conjecture", + "type": "text" + }, + { + "bbox": [ + 286, + 601, + 291, + 610 + ], + "score": 0.59, + "content": "^ { l }", + "type": "inline_equation" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 106, + 624, + 505, + 669 + ], + "lines": [ + { + "bbox": [ + 105, + 624, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 505, + 637 + ], + "score": 1.0, + "content": "Proof. By the reduction in Section A.3, showing monotonicity for non-isotropic regression with", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 637, + 505, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 637, + 505, + 648 + ], + "score": 1.0, + "content": "an isotropic regularizer is equivalent to showing monotonicity for isotropic regression with a non-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 646, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 505, + 660 + ], + "score": 1.0, + "content": "isotropic regularizer. Thus, we consider the latter. Specifically, Conjecture 1 is equivalent to showing", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 659, + 231, + 670 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 231, + 670 + ], + "score": 1.0, + "content": "monotonicity for the estimator", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32.5 + }, + { + "type": "interline_equation", + "bbox": [ + 221, + 674, + 388, + 715 + ], + "lines": [ + { + "bbox": [ + 221, + 674, + 388, + 715 + ], + "spans": [ + { + "bbox": [ + 221, + 674, + 388, + 715 + ], + "score": 0.93, + "content": "\\begin{array} { r l } { { \\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\beta } \\| X \\beta - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| \\beta \\| _ { \\Sigma ^ { - 1 } } ^ { 2 } } } \\\\ & { = ( X ^ { T } X + \\lambda \\Sigma ^ { - 1 } ) ^ { - 1 } X ^ { T } y } \\end{array}", + "type": "interline_equation", + "image_path": "6c41e816d4f887f9bde12f642fb19207753ffa9bfb323e88287605e629300b7c.jpg" + } + ] + } + ], + "index": 35.5, + "virtual_lines": [ + { + "bbox": [ + 221, + 674, + 388, + 694.5 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 221, + 694.5, + 388, + 715.0 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 719, + 354, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 718, + 354, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 718, + 133, + 734 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 720, + 185, + 732 + ], + "score": 0.93, + "content": "x \\sim \\mathcal { N } ( 0 , I )", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 718, + 253, + 734 + ], + "score": 1.0, + "content": "is isotropic, and", + "type": "text" + }, + { + "bbox": [ + 253, + 720, + 350, + 732 + ], + "score": 0.9, + "content": "y \\sim \\langle x , \\beta ^ { * } \\rangle + \\mathcal { N } ( 0 , \\sigma ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 351, + 718, + 354, + 734 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + } + ], + "page_idx": 20, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 292, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 312, + 765 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 312, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 14 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 200, + 84, + 411, + 295 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 200, + 84, + 411, + 295 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 200, + 84, + 411, + 295 + ], + "spans": [ + { + "bbox": [ + 200, + 84, + 411, + 295 + ], + "score": 0.973, + "type": "image", + "image_path": "8eda0db61a5bd63cb07df9565b6981c5a80a7fd865e013f9ce281e419515418e.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 200, + 84, + 411, + 98.06666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 200, + 98.06666666666666, + 411, + 112.13333333333333 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 200, + 112.13333333333333, + 411, + 126.19999999999999 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 200, + 126.19999999999999, + 411, + 140.26666666666665 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 200, + 140.26666666666665, + 411, + 154.33333333333331 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 200, + 154.33333333333331, + 411, + 168.39999999999998 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 200, + 168.39999999999998, + 411, + 182.46666666666664 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 200, + 182.46666666666664, + 411, + 196.5333333333333 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 200, + 196.5333333333333, + 411, + 210.59999999999997 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 200, + 210.59999999999997, + 411, + 224.66666666666663 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 200, + 224.66666666666663, + 411, + 238.7333333333333 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 200, + 238.7333333333333, + 411, + 252.79999999999995 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 200, + 252.79999999999995, + 411, + 266.8666666666666 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 200, + 266.8666666666666, + 411, + 280.9333333333333 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 200, + 280.9333333333333, + 411, + 294.99999999999994 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 307, + 502, + 331 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 307, + 504, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 504, + 320 + ], + "score": 1.0, + "content": "Figure 8: Test Mean Squared Error vs. Num Features for Random ReLU Features on Fashion-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 318, + 235, + 331 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 162, + 331 + ], + "score": 1.0, + "content": "MNIST, with", + "type": "text" + }, + { + "bbox": [ + 162, + 319, + 198, + 330 + ], + "score": 0.88, + "content": "n = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 318, + 235, + 331 + ], + "score": 1.0, + "content": "samples.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + } + ], + "index": 11.25 + }, + { + "type": "text", + "bbox": [ + 107, + 351, + 504, + 375 + ], + "lines": [ + { + "bbox": [ + 104, + 349, + 507, + 365 + ], + "spans": [ + { + "bbox": [ + 104, + 349, + 200, + 365 + ], + "score": 1.0, + "content": "Conjecture 2. For all", + "type": "text" + }, + { + "bbox": [ + 201, + 352, + 295, + 363 + ], + "score": 0.28, + "content": "n \\in \\mathbb { N } , d \\geq n , \\lambda > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 349, + 439, + 365 + ], + "score": 1.0, + "content": ", symmetric positive definite matrix", + "type": "text" + }, + { + "bbox": [ + 440, + 351, + 486, + 364 + ], + "score": 0.92, + "content": "Q \\in \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 349, + 507, + 365 + ], + "score": 1.0, + "content": ", the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 362, + 173, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 173, + 376 + ], + "score": 1.0, + "content": "following holds.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5, + "bbox_fs": [ + 104, + 349, + 507, + 376 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 380, + 135, + 392 + ], + "lines": [ + { + "bbox": [ + 104, + 378, + 137, + 396 + ], + "spans": [ + { + "bbox": [ + 104, + 378, + 137, + 396 + ], + "score": 1.0, + "content": "Define", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19, + "bbox_fs": [ + 104, + 378, + 137, + 396 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 243, + 389, + 368, + 409 + ], + "lines": [ + { + "bbox": [ + 243, + 389, + 368, + 409 + ], + "spans": [ + { + "bbox": [ + 243, + 389, + 368, + 409 + ], + "score": 0.93, + "content": "G _ { \\lambda } ^ { n } : = \\lambda ^ { 2 } \\underset { X } { \\mathbb { E } } [ ( X ^ { T } X + \\lambda Q ) ^ { - 2 } ]", + "type": "interline_equation", + "image_path": "ad76a8c087b005ddee977955e15dff2088f817370c0193f16b774104a3fb7cc1.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 243, + 389, + 368, + 409 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 412, + 414, + 425 + ], + "lines": [ + { + "bbox": [ + 105, + 410, + 414, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 133, + 428 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 412, + 178, + 424 + ], + "score": 0.92, + "content": "\\ b { X } \\in \\mathbb { R } ^ { n \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 410, + 309, + 428 + ], + "score": 1.0, + "content": "is sampled with each entry i.i.d.", + "type": "text" + }, + { + "bbox": [ + 309, + 413, + 342, + 425 + ], + "score": 0.92, + "content": "\\mathcal { N } ( 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 410, + 414, + 428 + ], + "score": 1.0, + "content": ". Similarly, define", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 410, + 414, + 428 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 234, + 430, + 377, + 450 + ], + "lines": [ + { + "bbox": [ + 234, + 430, + 377, + 450 + ], + "spans": [ + { + "bbox": [ + 234, + 430, + 377, + 450 + ], + "score": 0.93, + "content": "H _ { \\lambda } ^ { n } : = \\mathbb { E } [ | | X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } | | _ { F } ^ { 2 } ]", + "type": "interline_equation", + "image_path": "231a0f4ef6fbdc38727280f01461eda169b50c285dd0fde6c57d63e46a831858.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 234, + 430, + 377, + 450 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 456, + 336, + 468 + ], + "lines": [ + { + "bbox": [ + 105, + 454, + 337, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 209, + 470 + ], + "score": 1.0, + "content": "The expected test risk for", + "type": "text" + }, + { + "bbox": [ + 209, + 459, + 216, + 466 + ], + "score": 0.55, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 454, + 337, + 470 + ], + "score": 1.0, + "content": "samples can be expressed as:", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 454, + 337, + 470 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 227, + 473, + 385, + 488 + ], + "lines": [ + { + "bbox": [ + 227, + 473, + 385, + 488 + ], + "spans": [ + { + "bbox": [ + 227, + 473, + 385, + 488 + ], + "score": 0.92, + "content": "\\overline { { { R } } } ( \\hat { \\beta } _ { n , \\lambda } ) = ( \\beta ^ { * } ) ^ { T } G _ { \\lambda } ^ { n } \\beta ^ { * } + \\sigma ^ { 2 } H _ { \\lambda } ^ { n } + \\sigma ^ { 2 }", + "type": "interline_equation", + "image_path": "c89974b87c986d9d15a75f2dd3fb1e0db209a7da6355aa40f2d30e736ed328c1.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 227, + 473, + 385, + 488 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 499, + 344, + 511 + ], + "lines": [ + { + "bbox": [ + 106, + 499, + 344, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 499, + 344, + 513 + ], + "score": 1.0, + "content": "Then, we conjecture that the following two conditions hold.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25, + "bbox_fs": [ + 106, + 499, + 344, + 513 + ] + }, + { + "type": "text", + "bbox": [ + 130, + 521, + 138, + 532 + ], + "lines": [ + { + "bbox": [ + 129, + 521, + 140, + 535 + ], + "spans": [ + { + "bbox": [ + 129, + 521, + 140, + 535 + ], + "score": 1.0, + "content": "1.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26, + "bbox_fs": [ + 129, + 521, + 140, + 535 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 298, + 530, + 349, + 545 + ], + "lines": [ + { + "bbox": [ + 298, + 530, + 349, + 545 + ], + "spans": [ + { + "bbox": [ + 298, + 530, + 349, + 545 + ], + "score": 0.93, + "content": "G _ { \\lambda } ^ { n } \\succeq G _ { \\lambda } ^ { n + 1 }", + "type": "interline_equation", + "image_path": "336184f3133bbe3606ffc5cf5d47e56e1ddb0b17a540f79cdd78752af7fc88b0.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 298, + 530, + 349, + 545 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 130, + 554, + 138, + 564 + ], + "lines": [ + { + "bbox": [ + 129, + 553, + 140, + 567 + ], + "spans": [ + { + "bbox": [ + 129, + 553, + 140, + 567 + ], + "score": 1.0, + "content": "2.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 129, + 553, + 140, + 567 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 230, + 568, + 417, + 595 + ], + "lines": [ + { + "bbox": [ + 230, + 568, + 417, + 595 + ], + "spans": [ + { + "bbox": [ + 230, + 568, + 417, + 595 + ], + "score": 0.93, + "content": "( G _ { \\lambda } ^ { n } - G _ { \\lambda } ^ { n + 1 } ) - ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) \\frac { d G _ { \\lambda } ^ { n } / d \\lambda } { d H _ { \\lambda } ^ { n } / d \\lambda } \\succeq 0", + "type": "interline_equation", + "image_path": "5c3c2fe8f8069e1ad2ae74cc0f35a3b3a716f86e6780793a14502d60454d7f41.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 230, + 568, + 417, + 595 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 600, + 294, + 613 + ], + "lines": [ + { + "bbox": [ + 105, + 598, + 291, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 286, + 615 + ], + "score": 1.0, + "content": "Lemma 6. Conjecture 2 implies Conjecture", + "type": "text" + }, + { + "bbox": [ + 286, + 601, + 291, + 610 + ], + "score": 0.59, + "content": "^ { l }", + "type": "inline_equation" + } + ], + "index": 30 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 598, + 291, + 615 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 624, + 505, + 669 + ], + "lines": [ + { + "bbox": [ + 105, + 624, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 505, + 637 + ], + "score": 1.0, + "content": "Proof. By the reduction in Section A.3, showing monotonicity for non-isotropic regression with", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 637, + 505, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 637, + 505, + 648 + ], + "score": 1.0, + "content": "an isotropic regularizer is equivalent to showing monotonicity for isotropic regression with a non-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 646, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 505, + 660 + ], + "score": 1.0, + "content": "isotropic regularizer. Thus, we consider the latter. Specifically, Conjecture 1 is equivalent to showing", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 659, + 231, + 670 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 231, + 670 + ], + "score": 1.0, + "content": "monotonicity for the estimator", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 624, + 505, + 670 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 221, + 674, + 388, + 715 + ], + "lines": [ + { + "bbox": [ + 221, + 674, + 388, + 715 + ], + "spans": [ + { + "bbox": [ + 221, + 674, + 388, + 715 + ], + "score": 0.93, + "content": "\\begin{array} { r l } { { \\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\beta } \\| X \\beta - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| \\beta \\| _ { \\Sigma ^ { - 1 } } ^ { 2 } } } \\\\ & { = ( X ^ { T } X + \\lambda \\Sigma ^ { - 1 } ) ^ { - 1 } X ^ { T } y } \\end{array}", + "type": "interline_equation", + "image_path": "6c41e816d4f887f9bde12f642fb19207753ffa9bfb323e88287605e629300b7c.jpg" + } + ] + } + ], + "index": 35.5, + "virtual_lines": [ + { + "bbox": [ + 221, + 674, + 388, + 694.5 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 221, + 694.5, + 388, + 715.0 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 719, + 354, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 718, + 354, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 718, + 133, + 734 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 720, + 185, + 732 + ], + "score": 0.93, + "content": "x \\sim \\mathcal { N } ( 0 , I )", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 718, + 253, + 734 + ], + "score": 1.0, + "content": "is isotropic, and", + "type": "text" + }, + { + "bbox": [ + 253, + 720, + 350, + 732 + ], + "score": 0.9, + "content": "y \\sim \\langle x , \\beta ^ { * } \\rangle + \\mathcal { N } ( 0 , \\sigma ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 351, + 718, + 354, + 734 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 718, + 354, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 426, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 427, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 158, + 96 + ], + "score": 1.0, + "content": "Now, letting", + "type": "text" + }, + { + "bbox": [ + 158, + 82, + 200, + 94 + ], + "score": 0.92, + "content": "\\boldsymbol { Q } : = \\boldsymbol { \\Sigma } ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 81, + 372, + 96 + ], + "score": 1.0, + "content": ", the expected test risk of this estimator for", + "type": "text" + }, + { + "bbox": [ + 372, + 85, + 380, + 92 + ], + "score": 0.74, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 81, + 427, + 96 + ], + "score": 1.0, + "content": "samples is:", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 98, + 514, + 250 + ], + "lines": [ + { + "bbox": [ + 111, + 98, + 514, + 250 + ], + "spans": [ + { + "bbox": [ + 111, + 98, + 514, + 250 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\mathbb { E } [ \\left. \\hat { \\beta } _ { n , \\lambda } \\right. = \\underset { X , y } { \\mathbb { E } } [ \\left. \\hat { \\beta } _ { n , \\lambda } - \\beta ^ { * } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X , y } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } y - \\beta ^ { * } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X , \\eta = N ; 0 } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } ( X \\beta ^ { * } + \\eta ) - \\beta ^ { * } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X , \\eta = N ; 0 } { \\mathbb { E } } [ ( 0 , \\lambda ^ { 2 } Y ^ { T } \\eta _ { n } ^ { 2 } ) ] \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } ( X \\beta ^ { * } + \\eta ) - \\beta ^ { * } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } X \\beta ^ { * } - \\beta ^ { * } ) \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } \\right. _ { F } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } ( X ^ { T } X + \\lambda Q - \\lambda Q ) \\beta ^ { * } - \\beta ^ { * } ) \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } \\right. _ { F } ^ { 2 } ] } \\\\ & \\quad = \\lambda ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } \\right. _ { F } ^ { 2 } ] + \\sigma \\end{array}", + "type": "interline_equation", + "image_path": "b0c0704953e261076194e5ff818a464b49094b93133c27b3b95b7aa2feff2dd1.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 111, + 98, + 514, + 148.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 111, + 148.66666666666666, + 514, + 199.33333333333331 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 111, + 199.33333333333331, + 514, + 249.99999999999997 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 260, + 196, + 272 + ], + "lines": [ + { + "bbox": [ + 106, + 259, + 196, + 273 + ], + "spans": [ + { + "bbox": [ + 106, + 259, + 196, + 273 + ], + "score": 1.0, + "content": "Consider the infimum", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "interline_equation", + "bbox": [ + 278, + 276, + 332, + 297 + ], + "lines": [ + { + "bbox": [ + 278, + 276, + 332, + 297 + ], + "spans": [ + { + "bbox": [ + 278, + 276, + 332, + 297 + ], + "score": 0.92, + "content": "\\operatorname* { i n f } _ { \\lambda \\geq 0 } { \\overline { { R } } } ( { \\hat { \\beta } } _ { n , \\lambda } )", + "type": "interline_equation", + "image_path": "13c55acf6258506f84d51c2ef9587f1fae07d58b644a432c0ea44cbe3d20e3df.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 278, + 276, + 332, + 297 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 303, + 240, + 315 + ], + "lines": [ + { + "bbox": [ + 106, + 301, + 240, + 316 + ], + "spans": [ + { + "bbox": [ + 106, + 301, + 240, + 316 + ], + "score": 1.0, + "content": "We consider several cases below.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 320, + 504, + 343 + ], + "lines": [ + { + "bbox": [ + 106, + 318, + 506, + 334 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 402, + 334 + ], + "score": 1.0, + "content": "Case (1). Suppose the infimum in Equation 71 is achieved in the limit", + "type": "text" + }, + { + "bbox": [ + 402, + 321, + 446, + 331 + ], + "score": 0.91, + "content": "\\lambda \\to + \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 318, + 506, + 334 + ], + "score": 1.0, + "content": ". In this case,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 332, + 245, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 332, + 245, + 344 + ], + "score": 1.0, + "content": "monotonicity trivially holds, since", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "interline_equation", + "bbox": [ + 219, + 348, + 392, + 369 + ], + "lines": [ + { + "bbox": [ + 219, + 348, + 392, + 369 + ], + "spans": [ + { + "bbox": [ + 219, + 348, + 392, + 369 + ], + "score": 0.92, + "content": "\\operatorname* { l i m } _ { \\lambda \\to \\infty } \\overline { { { R } } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\overline { { { R } } } ( \\vec { 0 } ) = \\operatorname* { l i m } _ { \\lambda \\to \\infty } \\overline { { { R } } } ( \\hat { \\beta } _ { n + 1 , \\lambda } )", + "type": "interline_equation", + "image_path": "6ae7607f4c9c2ddad443112fd1792e84f875d21cc7082bbeefac25b604d59f7f.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 219, + 348, + 392, + 369 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 383, + 504, + 407 + ], + "lines": [ + { + "bbox": [ + 105, + 380, + 507, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 383, + 397 + ], + "score": 1.0, + "content": "Case (2). Suppose the infimum in Equation 71 is achieved by some", + "type": "text" + }, + { + "bbox": [ + 383, + 383, + 420, + 394 + ], + "score": 0.93, + "content": "\\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 380, + 507, + 397 + ], + "score": 1.0, + "content": "in the interior of the", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 393, + 154, + 408 + ], + "spans": [ + { + "bbox": [ + 104, + 393, + 120, + 408 + ], + "score": 1.0, + "content": "set", + "type": "text" + }, + { + "bbox": [ + 121, + 395, + 148, + 407 + ], + "score": 0.91, + "content": "( 0 , \\infty )", + "type": "inline_equation" + }, + { + "bbox": [ + 148, + 393, + 154, + 408 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 107, + 413, + 505, + 437 + ], + "lines": [ + { + "bbox": [ + 105, + 410, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 142, + 428 + ], + "score": 1.0, + "content": "Because", + "type": "text" + }, + { + "bbox": [ + 143, + 412, + 177, + 426 + ], + "score": 0.93, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } )", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 410, + 321, + 428 + ], + "score": 1.0, + "content": "is continuous and differentiable in", + "type": "text" + }, + { + "bbox": [ + 321, + 415, + 328, + 424 + ], + "score": 0.81, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 410, + 357, + 428 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 358, + 414, + 406, + 426 + ], + "score": 0.93, + "content": "\\lambda \\in ( 0 , \\infty )", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 410, + 465, + 428 + ], + "score": 1.0, + "content": ", we have that", + "type": "text" + }, + { + "bbox": [ + 465, + 413, + 481, + 425 + ], + "score": 0.93, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 410, + 505, + 428 + ], + "score": 1.0, + "content": "must", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 425, + 320, + 438 + ], + "spans": [ + { + "bbox": [ + 106, + 425, + 320, + 438 + ], + "score": 1.0, + "content": "satisfy the following first-order optimality condition:", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "interline_equation", + "bbox": [ + 222, + 442, + 392, + 498 + ], + "lines": [ + { + "bbox": [ + 222, + 442, + 392, + 498 + ], + "spans": [ + { + "bbox": [ + 222, + 442, + 392, + 498 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\frac { d \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) } { d \\lambda } \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } = 0 } \\\\ { \\implies ( \\beta ^ { * } ) ^ { T } \\frac { d G _ { \\lambda } ^ { n } } { d \\lambda } \\beta ^ { * } + \\sigma ^ { 2 } \\frac { d H _ { \\lambda } ^ { n } } { d \\lambda } \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } = 0 } \\end{array}", + "type": "interline_equation", + "image_path": "bd5812ddb8e5b3a3003763dbc4df1c1083a51b8491f6169af12151e16bdf1fe2.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 222, + 442, + 392, + 460.6666666666667 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 222, + 460.6666666666667, + 392, + 479.33333333333337 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 222, + 479.33333333333337, + 392, + 498.00000000000006 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 501, + 324, + 513 + ], + "lines": [ + { + "bbox": [ + 106, + 499, + 324, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 499, + 324, + 515 + ], + "score": 1.0, + "content": "We will later use this condition to show monotonicity.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 519, + 504, + 546 + ], + "lines": [ + { + "bbox": [ + 105, + 516, + 505, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 357, + 534 + ], + "score": 1.0, + "content": "Case (3). Suppose the infimum in Equation 71 is achieved at", + "type": "text" + }, + { + "bbox": [ + 357, + 519, + 393, + 532 + ], + "score": 0.92, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 516, + 471, + 534 + ], + "score": 1.0, + "content": ". Recall, we define", + "type": "text" + }, + { + "bbox": [ + 471, + 519, + 505, + 533 + ], + "score": 0.95, + "content": "\\hat { \\beta } _ { n , 0 } : =", + "type": "inline_equation" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 532, + 238, + 547 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 164, + 546 + ], + "score": 0.93, + "content": "\\mathrm { l i m } _ { \\lambda \\to 0 + } \\hat { \\beta } _ { n , \\lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 532, + 238, + 547 + ], + "score": 1.0, + "content": ". This means that,", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "interline_equation", + "bbox": [ + 199, + 552, + 413, + 580 + ], + "lines": [ + { + "bbox": [ + 199, + 552, + 413, + 580 + ], + "spans": [ + { + "bbox": [ + 199, + 552, + 413, + 580 + ], + "score": 0.92, + "content": "\\frac { d \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) } { d \\lambda } \\Big | _ { \\lambda = 0 } = ( \\beta ^ { * } ) ^ { T } \\frac { d G _ { \\lambda } ^ { n } } { d \\lambda } \\beta ^ { * } + \\sigma ^ { 2 } \\frac { d H _ { \\lambda } ^ { n } } { d \\lambda } \\Big | _ { \\lambda = 0 } \\geq 0", + "type": "interline_equation", + "image_path": "c95a4e0017eb4b8708bb725a904978d94b5de54f2554ec63647774db25cd0a72.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 199, + 552, + 413, + 580 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 591, + 505, + 617 + ], + "lines": [ + { + "bbox": [ + 105, + 589, + 505, + 609 + ], + "spans": [ + { + "bbox": [ + 105, + 589, + 169, + 609 + ], + "score": 1.0, + "content": "Note that since", + "type": "text" + }, + { + "bbox": [ + 170, + 591, + 207, + 607 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\frac { d H _ { \\lambda } ^ { n } } { d \\lambda } \\leq 0 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 589, + 505, + 609 + ], + "score": 1.0, + "content": ", both Equations (73) and (74) in Case (2) and Case (3) respectively imply", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 604, + 126, + 617 + ], + "spans": [ + { + "bbox": [ + 104, + 604, + 126, + 617 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "interline_equation", + "bbox": [ + 243, + 620, + 367, + 651 + ], + "lines": [ + { + "bbox": [ + 243, + 620, + 367, + 651 + ], + "spans": [ + { + "bbox": [ + 243, + 620, + 367, + 651 + ], + "score": 0.94, + "content": "\\sigma ^ { 2 } \\leq - \\frac { ( \\beta ^ { * } ) ^ { T } ( \\frac { d G _ { \\lambda } ^ { n } } { d \\lambda } ) \\beta ^ { * } } { d H _ { \\lambda } ^ { n } / d \\lambda } \\Big \\vert _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } }", + "type": "interline_equation", + "image_path": "6e211998885ace57711bcff68cdbeb605671fe5b714974d9087bbcd54d6a9332.jpg" + } + ] + } + ], + "index": 23.5, + "virtual_lines": [ + { + "bbox": [ + 243, + 620, + 367, + 635.5 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 243, + 635.5, + 367, + 651.0 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 664, + 505, + 689 + ], + "lines": [ + { + "bbox": [ + 104, + 662, + 506, + 680 + ], + "spans": [ + { + "bbox": [ + 104, + 662, + 363, + 680 + ], + "score": 1.0, + "content": "Now, assuming Conjecture 2, we will show that the choice of", + "type": "text" + }, + { + "bbox": [ + 363, + 664, + 380, + 676 + ], + "score": 0.91, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 662, + 506, + 680 + ], + "score": 1.0, + "content": "in Cases (2) and (3) has non-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 676, + 302, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 198, + 690 + ], + "score": 1.0, + "content": "increasing test risk for", + "type": "text" + }, + { + "bbox": [ + 199, + 677, + 230, + 689 + ], + "score": 0.92, + "content": "( n + 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 676, + 302, + 690 + ], + "score": 1.0, + "content": "samples. That is,", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "interline_equation", + "bbox": [ + 252, + 694, + 359, + 711 + ], + "lines": [ + { + "bbox": [ + 252, + 694, + 359, + 711 + ], + "spans": [ + { + "bbox": [ + 252, + 694, + 359, + 711 + ], + "score": 0.91, + "content": "\\overline { { R } } ( \\widehat { \\beta } _ { n , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) \\geq \\overline { { R } } ( \\widehat { \\beta } _ { n + 1 , \\lambda _ { n } ^ { \\mathrm { o p t } } } )", + "type": "interline_equation", + "image_path": "1ef487276cca9054802b0d0ae7cb3f1d48e7c75f3f3742cad65981740d6a61b4.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 252, + 694, + 359, + 711 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 717, + 410, + 734 + ], + "lines": [ + { + "bbox": [ + 101, + 711, + 414, + 738 + ], + "spans": [ + { + "bbox": [ + 101, + 711, + 414, + 738 + ], + "score": 1.0, + "content": "This implies the desired monotonicity, since R(βˆn+1,λoptn ) ≥ R(βˆn+1,λoptn+1 ).", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + } + ], + "page_idx": 21, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 313, + 765 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 313, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 15 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 426, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 427, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 158, + 96 + ], + "score": 1.0, + "content": "Now, letting", + "type": "text" + }, + { + "bbox": [ + 158, + 82, + 200, + 94 + ], + "score": 0.92, + "content": "\\boldsymbol { Q } : = \\boldsymbol { \\Sigma } ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 81, + 372, + 96 + ], + "score": 1.0, + "content": ", the expected test risk of this estimator for", + "type": "text" + }, + { + "bbox": [ + 372, + 85, + 380, + 92 + ], + "score": 0.74, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 81, + 427, + 96 + ], + "score": 1.0, + "content": "samples is:", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 81, + 427, + 96 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 98, + 514, + 250 + ], + "lines": [ + { + "bbox": [ + 111, + 98, + 514, + 250 + ], + "spans": [ + { + "bbox": [ + 111, + 98, + 514, + 250 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\mathbb { E } [ \\left. \\hat { \\beta } _ { n , \\lambda } \\right. = \\underset { X , y } { \\mathbb { E } } [ \\left. \\hat { \\beta } _ { n , \\lambda } - \\beta ^ { * } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X , y } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } y - \\beta ^ { * } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X , \\eta = N ; 0 } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } ( X \\beta ^ { * } + \\eta ) - \\beta ^ { * } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X , \\eta = N ; 0 } { \\mathbb { E } } [ ( 0 , \\lambda ^ { 2 } Y ^ { T } \\eta _ { n } ^ { 2 } ) ] \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } ( X \\beta ^ { * } + \\eta ) - \\beta ^ { * } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } X \\beta ^ { * } - \\beta ^ { * } ) \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } \\right. _ { F } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } ( X ^ { T } X + \\lambda Q - \\lambda Q ) \\beta ^ { * } - \\beta ^ { * } ) \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } \\right. _ { F } ^ { 2 } ] } \\\\ & \\quad = \\lambda ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } \\right. _ { F } ^ { 2 } ] + \\sigma \\end{array}", + "type": "interline_equation", + "image_path": "b0c0704953e261076194e5ff818a464b49094b93133c27b3b95b7aa2feff2dd1.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 111, + 98, + 514, + 148.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 111, + 148.66666666666666, + 514, + 199.33333333333331 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 111, + 199.33333333333331, + 514, + 249.99999999999997 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 260, + 196, + 272 + ], + "lines": [ + { + "bbox": [ + 106, + 259, + 196, + 273 + ], + "spans": [ + { + "bbox": [ + 106, + 259, + 196, + 273 + ], + "score": 1.0, + "content": "Consider the infimum", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 106, + 259, + 196, + 273 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 278, + 276, + 332, + 297 + ], + "lines": [ + { + "bbox": [ + 278, + 276, + 332, + 297 + ], + "spans": [ + { + "bbox": [ + 278, + 276, + 332, + 297 + ], + "score": 0.92, + "content": "\\operatorname* { i n f } _ { \\lambda \\geq 0 } { \\overline { { R } } } ( { \\hat { \\beta } } _ { n , \\lambda } )", + "type": "interline_equation", + "image_path": "13c55acf6258506f84d51c2ef9587f1fae07d58b644a432c0ea44cbe3d20e3df.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 278, + 276, + 332, + 297 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 303, + 240, + 315 + ], + "lines": [ + { + "bbox": [ + 106, + 301, + 240, + 316 + ], + "spans": [ + { + "bbox": [ + 106, + 301, + 240, + 316 + ], + "score": 1.0, + "content": "We consider several cases below.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 301, + 240, + 316 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 320, + 504, + 343 + ], + "lines": [ + { + "bbox": [ + 106, + 318, + 506, + 334 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 402, + 334 + ], + "score": 1.0, + "content": "Case (1). Suppose the infimum in Equation 71 is achieved in the limit", + "type": "text" + }, + { + "bbox": [ + 402, + 321, + 446, + 331 + ], + "score": 0.91, + "content": "\\lambda \\to + \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 318, + 506, + 334 + ], + "score": 1.0, + "content": ". In this case,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 332, + 245, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 332, + 245, + 344 + ], + "score": 1.0, + "content": "monotonicity trivially holds, since", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 106, + 318, + 506, + 344 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 219, + 348, + 392, + 369 + ], + "lines": [ + { + "bbox": [ + 219, + 348, + 392, + 369 + ], + "spans": [ + { + "bbox": [ + 219, + 348, + 392, + 369 + ], + "score": 0.92, + "content": "\\operatorname* { l i m } _ { \\lambda \\to \\infty } \\overline { { { R } } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\overline { { { R } } } ( \\vec { 0 } ) = \\operatorname* { l i m } _ { \\lambda \\to \\infty } \\overline { { { R } } } ( \\hat { \\beta } _ { n + 1 , \\lambda } )", + "type": "interline_equation", + "image_path": "6ae7607f4c9c2ddad443112fd1792e84f875d21cc7082bbeefac25b604d59f7f.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 219, + 348, + 392, + 369 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 383, + 504, + 407 + ], + "lines": [ + { + "bbox": [ + 105, + 380, + 507, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 383, + 397 + ], + "score": 1.0, + "content": "Case (2). Suppose the infimum in Equation 71 is achieved by some", + "type": "text" + }, + { + "bbox": [ + 383, + 383, + 420, + 394 + ], + "score": 0.93, + "content": "\\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 380, + 507, + 397 + ], + "score": 1.0, + "content": "in the interior of the", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 393, + 154, + 408 + ], + "spans": [ + { + "bbox": [ + 104, + 393, + 120, + 408 + ], + "score": 1.0, + "content": "set", + "type": "text" + }, + { + "bbox": [ + 121, + 395, + 148, + 407 + ], + "score": 0.91, + "content": "( 0 , \\infty )", + "type": "inline_equation" + }, + { + "bbox": [ + 148, + 393, + 154, + 408 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 104, + 380, + 507, + 408 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 413, + 505, + 437 + ], + "lines": [ + { + "bbox": [ + 105, + 410, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 142, + 428 + ], + "score": 1.0, + "content": "Because", + "type": "text" + }, + { + "bbox": [ + 143, + 412, + 177, + 426 + ], + "score": 0.93, + "content": "\\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } )", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 410, + 321, + 428 + ], + "score": 1.0, + "content": "is continuous and differentiable in", + "type": "text" + }, + { + "bbox": [ + 321, + 415, + 328, + 424 + ], + "score": 0.81, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 410, + 357, + 428 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 358, + 414, + 406, + 426 + ], + "score": 0.93, + "content": "\\lambda \\in ( 0 , \\infty )", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 410, + 465, + 428 + ], + "score": 1.0, + "content": ", we have that", + "type": "text" + }, + { + "bbox": [ + 465, + 413, + 481, + 425 + ], + "score": 0.93, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 410, + 505, + 428 + ], + "score": 1.0, + "content": "must", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 425, + 320, + 438 + ], + "spans": [ + { + "bbox": [ + 106, + 425, + 320, + 438 + ], + "score": 1.0, + "content": "satisfy the following first-order optimality condition:", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 410, + 505, + 438 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 222, + 442, + 392, + 498 + ], + "lines": [ + { + "bbox": [ + 222, + 442, + 392, + 498 + ], + "spans": [ + { + "bbox": [ + 222, + 442, + 392, + 498 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\frac { d \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) } { d \\lambda } \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } = 0 } \\\\ { \\implies ( \\beta ^ { * } ) ^ { T } \\frac { d G _ { \\lambda } ^ { n } } { d \\lambda } \\beta ^ { * } + \\sigma ^ { 2 } \\frac { d H _ { \\lambda } ^ { n } } { d \\lambda } \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } = 0 } \\end{array}", + "type": "interline_equation", + "image_path": "bd5812ddb8e5b3a3003763dbc4df1c1083a51b8491f6169af12151e16bdf1fe2.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 222, + 442, + 392, + 460.6666666666667 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 222, + 460.6666666666667, + 392, + 479.33333333333337 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 222, + 479.33333333333337, + 392, + 498.00000000000006 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 501, + 324, + 513 + ], + "lines": [ + { + "bbox": [ + 106, + 499, + 324, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 499, + 324, + 515 + ], + "score": 1.0, + "content": "We will later use this condition to show monotonicity.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17, + "bbox_fs": [ + 106, + 499, + 324, + 515 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 519, + 504, + 546 + ], + "lines": [ + { + "bbox": [ + 105, + 516, + 505, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 357, + 534 + ], + "score": 1.0, + "content": "Case (3). Suppose the infimum in Equation 71 is achieved at", + "type": "text" + }, + { + "bbox": [ + 357, + 519, + 393, + 532 + ], + "score": 0.92, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 516, + 471, + 534 + ], + "score": 1.0, + "content": ". Recall, we define", + "type": "text" + }, + { + "bbox": [ + 471, + 519, + 505, + 533 + ], + "score": 0.95, + "content": "\\hat { \\beta } _ { n , 0 } : =", + "type": "inline_equation" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 532, + 238, + 547 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 164, + 546 + ], + "score": 0.93, + "content": "\\mathrm { l i m } _ { \\lambda \\to 0 + } \\hat { \\beta } _ { n , \\lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 532, + 238, + 547 + ], + "score": 1.0, + "content": ". This means that,", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 516, + 505, + 547 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 199, + 552, + 413, + 580 + ], + "lines": [ + { + "bbox": [ + 199, + 552, + 413, + 580 + ], + "spans": [ + { + "bbox": [ + 199, + 552, + 413, + 580 + ], + "score": 0.92, + "content": "\\frac { d \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) } { d \\lambda } \\Big | _ { \\lambda = 0 } = ( \\beta ^ { * } ) ^ { T } \\frac { d G _ { \\lambda } ^ { n } } { d \\lambda } \\beta ^ { * } + \\sigma ^ { 2 } \\frac { d H _ { \\lambda } ^ { n } } { d \\lambda } \\Big | _ { \\lambda = 0 } \\geq 0", + "type": "interline_equation", + "image_path": "c95a4e0017eb4b8708bb725a904978d94b5de54f2554ec63647774db25cd0a72.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 199, + 552, + 413, + 580 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 591, + 505, + 617 + ], + "lines": [ + { + "bbox": [ + 105, + 589, + 505, + 609 + ], + "spans": [ + { + "bbox": [ + 105, + 589, + 169, + 609 + ], + "score": 1.0, + "content": "Note that since", + "type": "text" + }, + { + "bbox": [ + 170, + 591, + 207, + 607 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\frac { d H _ { \\lambda } ^ { n } } { d \\lambda } \\leq 0 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 589, + 505, + 609 + ], + "score": 1.0, + "content": ", both Equations (73) and (74) in Case (2) and Case (3) respectively imply", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 604, + 126, + 617 + ], + "spans": [ + { + "bbox": [ + 104, + 604, + 126, + 617 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 104, + 589, + 505, + 617 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 243, + 620, + 367, + 651 + ], + "lines": [ + { + "bbox": [ + 243, + 620, + 367, + 651 + ], + "spans": [ + { + "bbox": [ + 243, + 620, + 367, + 651 + ], + "score": 0.94, + "content": "\\sigma ^ { 2 } \\leq - \\frac { ( \\beta ^ { * } ) ^ { T } ( \\frac { d G _ { \\lambda } ^ { n } } { d \\lambda } ) \\beta ^ { * } } { d H _ { \\lambda } ^ { n } / d \\lambda } \\Big \\vert _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } }", + "type": "interline_equation", + "image_path": "6e211998885ace57711bcff68cdbeb605671fe5b714974d9087bbcd54d6a9332.jpg" + } + ] + } + ], + "index": 23.5, + "virtual_lines": [ + { + "bbox": [ + 243, + 620, + 367, + 635.5 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 243, + 635.5, + 367, + 651.0 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 664, + 505, + 689 + ], + "lines": [ + { + "bbox": [ + 104, + 662, + 506, + 680 + ], + "spans": [ + { + "bbox": [ + 104, + 662, + 363, + 680 + ], + "score": 1.0, + "content": "Now, assuming Conjecture 2, we will show that the choice of", + "type": "text" + }, + { + "bbox": [ + 363, + 664, + 380, + 676 + ], + "score": 0.91, + "content": "\\lambda _ { n } ^ { \\mathrm { o p t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 662, + 506, + 680 + ], + "score": 1.0, + "content": "in Cases (2) and (3) has non-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 676, + 302, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 198, + 690 + ], + "score": 1.0, + "content": "increasing test risk for", + "type": "text" + }, + { + "bbox": [ + 199, + 677, + 230, + 689 + ], + "score": 0.92, + "content": "( n + 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 676, + 302, + 690 + ], + "score": 1.0, + "content": "samples. That is,", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 104, + 662, + 506, + 690 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 252, + 694, + 359, + 711 + ], + "lines": [ + { + "bbox": [ + 252, + 694, + 359, + 711 + ], + "spans": [ + { + "bbox": [ + 252, + 694, + 359, + 711 + ], + "score": 0.91, + "content": "\\overline { { R } } ( \\widehat { \\beta } _ { n , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) \\geq \\overline { { R } } ( \\widehat { \\beta } _ { n + 1 , \\lambda _ { n } ^ { \\mathrm { o p t } } } )", + "type": "interline_equation", + "image_path": "1ef487276cca9054802b0d0ae7cb3f1d48e7c75f3f3742cad65981740d6a61b4.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 252, + 694, + 359, + 711 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 717, + 410, + 734 + ], + "lines": [ + { + "bbox": [ + 101, + 711, + 414, + 738 + ], + "spans": [ + { + "bbox": [ + 101, + 711, + 414, + 738 + ], + "score": 1.0, + "content": "This implies the desired monotonicity, since R(βˆn+1,λoptn ) ≥ R(βˆn+1,λoptn+1 ).", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 101, + 711, + 414, + 738 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 505, + 106 + ], + "lines": [ + { + "bbox": [ + 103, + 77, + 507, + 100 + ], + "spans": [ + { + "bbox": [ + 103, + 77, + 235, + 100 + ], + "score": 1.0, + "content": "We first consider the case when", + "type": "text" + }, + { + "bbox": [ + 236, + 81, + 333, + 96 + ], + "score": 0.94, + "content": "H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 77, + 422, + 100 + ], + "score": 1.0, + "content": ". In this case, because", + "type": "text" + }, + { + "bbox": [ + 422, + 81, + 491, + 95 + ], + "score": 0.93, + "content": "G _ { \\lambda } ^ { n } - G _ { \\lambda } ^ { n + 1 } \\succeq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 492, + 77, + 507, + 100 + ], + "score": 1.0, + "content": "by", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 193, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 193, + 106 + ], + "score": 1.0, + "content": "assumption, we have", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "interline_equation", + "bbox": [ + 145, + 110, + 465, + 149 + ], + "lines": [ + { + "bbox": [ + 145, + 110, + 465, + 149 + ], + "spans": [ + { + "bbox": [ + 145, + 110, + 465, + 149 + ], + "score": 0.91, + "content": "\\begin{array} { r l r } { { \\overline { { R } } ( \\widehat { \\beta } _ { n , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) - \\overline { { R } } ( \\widehat { \\beta } _ { n + 1 , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) = ( \\beta ^ { * } ) ^ { T } ( G _ { \\lambda } ^ { n } - G _ { \\lambda } ^ { n + 1 } ) \\beta ^ { * } + \\sigma ^ { 2 } ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } } } \\\\ & { } & { \\geq 0 \\quad \\quad } \\end{array}", + "type": "interline_equation", + "image_path": "07aa3c990d95a8ac383860c5d76349205b0b166f3e65d75762e8e6f9ec27e44e.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 145, + 110, + 465, + 123.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 145, + 123.0, + 465, + 136.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 145, + 136.0, + 465, + 149.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 153, + 349, + 168 + ], + "lines": [ + { + "bbox": [ + 104, + 150, + 351, + 172 + ], + "spans": [ + { + "bbox": [ + 104, + 150, + 187, + 172 + ], + "score": 1.0, + "content": "Otherwise, assume.", + "type": "text" + }, + { + "bbox": [ + 187, + 153, + 284, + 168 + ], + "score": 0.93, + "content": "H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } \\leq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 150, + 351, + 172 + ], + "score": 1.0, + "content": ". Then we have:", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "interline_equation", + "bbox": [ + 114, + 174, + 489, + 300 + ], + "lines": [ + { + "bbox": [ + 114, + 174, + 489, + 300 + ], + "spans": [ + { + "bbox": [ + 114, + 174, + 489, + 300 + ], + "score": 0.85, + "content": "\\begin{array} { r l } { \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda _ { n } ^ { \\smash { \\mathrm { o u t } } } } ) - \\overline { { R } } ( \\hat { \\beta } _ { n + 1 , \\lambda _ { n } ^ { \\smash { \\mathrm { o u t } } } } ) = ( \\beta ^ { * } ) ^ { T } ( G _ { \\lambda } ^ { m } - G _ { \\lambda } ^ { m + 1 } ) \\beta ^ { * } + \\sigma ^ { 2 } ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\smash { \\mathrm { o u t } } } } } & { \\qquad \\mathrm { ( } } \\\\ & { \\qquad \\geq ( \\beta ^ { * } ) ^ { T } ( G _ { \\lambda } ^ { m } - G _ { \\lambda } ^ { m + 1 } ) \\beta ^ { * } - ( \\beta ^ { * } ) ^ { T } ( \\frac { d G _ { \\lambda } ^ { n } } { d \\lambda } ) \\beta ^ { * } \\frac { ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) } { d H _ { \\lambda } ^ { \\lambda } / d \\lambda } \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\smash { \\mathrm { o u t } } } } } \\\\ & { \\qquad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad } \\\\ & { = ( \\beta ^ { * } ) ^ { T } \\underbrace { \\Bigg ( ( G _ { \\lambda } ^ { m } - G _ { \\lambda } ^ { n + 1 } ) - ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) \\frac { d G _ { \\lambda } ^ { m } / d \\lambda } { d H _ { \\lambda } ^ { n } / d \\lambda } \\Big ) \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o u t } } } \\beta ^ { * } } _ { \\geq 0 \\mathrm { b y c o n j e c u r e 2 } } } \\\\ & { \\qquad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\geq 0 } \\end{array}", + "type": "interline_equation", + "image_path": "b15faae1a9fffa8999e8e06d3794f4e39afa6731de30d9facd85224487832d0a.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 114, + 174, + 489, + 216.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 114, + 216.0, + 489, + 258.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 114, + 258.0, + 489, + 300.0 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 303, + 150, + 314 + ], + "lines": [ + { + "bbox": [ + 105, + 302, + 151, + 314 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 151, + 314 + ], + "score": 1.0, + "content": "as desired.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + } + ], + "page_idx": 22, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 312, + 763 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 312, + 763 + ], + "score": 1.0, + "content": "23", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 320, + 505, + 331 + ], + "lines": [ + { + "bbox": [ + 496, + 322, + 504, + 330 + ], + "spans": [ + { + "bbox": [ + 496, + 322, + 504, + 330 + ], + "score": 0.997, + "content": "□", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 505, + 106 + ], + "lines": [ + { + "bbox": [ + 103, + 77, + 507, + 100 + ], + "spans": [ + { + "bbox": [ + 103, + 77, + 235, + 100 + ], + "score": 1.0, + "content": "We first consider the case when", + "type": "text" + }, + { + "bbox": [ + 236, + 81, + 333, + 96 + ], + "score": 0.94, + "content": "H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 77, + 422, + 100 + ], + "score": 1.0, + "content": ". In this case, because", + "type": "text" + }, + { + "bbox": [ + 422, + 81, + 491, + 95 + ], + "score": 0.93, + "content": "G _ { \\lambda } ^ { n } - G _ { \\lambda } ^ { n + 1 } \\succeq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 492, + 77, + 507, + 100 + ], + "score": 1.0, + "content": "by", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 193, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 193, + 106 + ], + "score": 1.0, + "content": "assumption, we have", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 103, + 77, + 507, + 106 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 145, + 110, + 465, + 149 + ], + "lines": [ + { + "bbox": [ + 145, + 110, + 465, + 149 + ], + "spans": [ + { + "bbox": [ + 145, + 110, + 465, + 149 + ], + "score": 0.91, + "content": "\\begin{array} { r l r } { { \\overline { { R } } ( \\widehat { \\beta } _ { n , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) - \\overline { { R } } ( \\widehat { \\beta } _ { n + 1 , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) = ( \\beta ^ { * } ) ^ { T } ( G _ { \\lambda } ^ { n } - G _ { \\lambda } ^ { n + 1 } ) \\beta ^ { * } + \\sigma ^ { 2 } ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } } } \\\\ & { } & { \\geq 0 \\quad \\quad } \\end{array}", + "type": "interline_equation", + "image_path": "07aa3c990d95a8ac383860c5d76349205b0b166f3e65d75762e8e6f9ec27e44e.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 145, + 110, + 465, + 123.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 145, + 123.0, + 465, + 136.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 145, + 136.0, + 465, + 149.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 153, + 349, + 168 + ], + "lines": [ + { + "bbox": [ + 104, + 150, + 351, + 172 + ], + "spans": [ + { + "bbox": [ + 104, + 150, + 187, + 172 + ], + "score": 1.0, + "content": "Otherwise, assume.", + "type": "text" + }, + { + "bbox": [ + 187, + 153, + 284, + 168 + ], + "score": 0.93, + "content": "H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } \\leq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 150, + 351, + 172 + ], + "score": 1.0, + "content": ". Then we have:", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 104, + 150, + 351, + 172 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 114, + 174, + 489, + 300 + ], + "lines": [ + { + "bbox": [ + 114, + 174, + 489, + 300 + ], + "spans": [ + { + "bbox": [ + 114, + 174, + 489, + 300 + ], + "score": 0.85, + "content": "\\begin{array} { r l } { \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda _ { n } ^ { \\smash { \\mathrm { o u t } } } } ) - \\overline { { R } } ( \\hat { \\beta } _ { n + 1 , \\lambda _ { n } ^ { \\smash { \\mathrm { o u t } } } } ) = ( \\beta ^ { * } ) ^ { T } ( G _ { \\lambda } ^ { m } - G _ { \\lambda } ^ { m + 1 } ) \\beta ^ { * } + \\sigma ^ { 2 } ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\smash { \\mathrm { o u t } } } } } & { \\qquad \\mathrm { ( } } \\\\ & { \\qquad \\geq ( \\beta ^ { * } ) ^ { T } ( G _ { \\lambda } ^ { m } - G _ { \\lambda } ^ { m + 1 } ) \\beta ^ { * } - ( \\beta ^ { * } ) ^ { T } ( \\frac { d G _ { \\lambda } ^ { n } } { d \\lambda } ) \\beta ^ { * } \\frac { ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) } { d H _ { \\lambda } ^ { \\lambda } / d \\lambda } \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\smash { \\mathrm { o u t } } } } } \\\\ & { \\qquad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad } \\\\ & { = ( \\beta ^ { * } ) ^ { T } \\underbrace { \\Bigg ( ( G _ { \\lambda } ^ { m } - G _ { \\lambda } ^ { n + 1 } ) - ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) \\frac { d G _ { \\lambda } ^ { m } / d \\lambda } { d H _ { \\lambda } ^ { n } / d \\lambda } \\Big ) \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o u t } } } \\beta ^ { * } } _ { \\geq 0 \\mathrm { b y c o n j e c u r e 2 } } } \\\\ & { \\qquad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\geq 0 } \\end{array}", + "type": "interline_equation", + "image_path": "b15faae1a9fffa8999e8e06d3794f4e39afa6731de30d9facd85224487832d0a.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 114, + 174, + 489, + 216.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 114, + 216.0, + 489, + 258.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 114, + 258.0, + 489, + 300.0 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 303, + 150, + 314 + ], + "lines": [ + { + "bbox": [ + 105, + 302, + 151, + 314 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 151, + 314 + ], + "score": 1.0, + "content": "as desired.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 302, + 151, + 314 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/7R7fAoUygoa/7R7fAoUygoa_model.json b/parse/train/7R7fAoUygoa/7R7fAoUygoa_model.json new file mode 100644 index 0000000000000000000000000000000000000000..5f3e3499af569645b07df04626c44596b4c00d64 --- /dev/null +++ b/parse/train/7R7fAoUygoa/7R7fAoUygoa_model.json @@ -0,0 +1,35835 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 760, + 1302, + 760, + 1302, + 1155, + 398, + 1155 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1285, + 1403, + 1285, + 1403, + 1650, + 298, + 1650 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 299, + 1668, + 1402, + 1668, + 1402, + 1878, + 299, + 1878 + ], + "score": 0.977 + }, + { + "category_id": 0, + "poly": [ + 300, + 220, + 1400, + 220, + 1400, + 321, + 300, + 321 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 313, + 377, + 684, + 377, + 684, + 468, + 313, + 468 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 1031, + 378, + 1385, + 378, + 1385, + 469, + 1031, + 469 + ], + "score": 0.947 + }, + { + "category_id": 1, + "poly": [ + 304, + 1972, + 1393, + 1972, + 1393, + 2034, + 304, + 2034 + ], + "score": 0.937 + }, + { + "category_id": 1, + "poly": [ + 959, + 517, + 1312, + 517, + 1312, + 608, + 959, + 608 + ], + "score": 0.934 + }, + { + "category_id": 0, + "poly": [ + 302, + 1216, + 573, + 1216, + 573, + 1250, + 302, + 1250 + ], + "score": 0.894 + }, + { + "category_id": 0, + "poly": [ + 773, + 689, + 927, + 689, + 927, + 722, + 773, + 722 + ], + "score": 0.874 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 813, + 75, + 813, + 104, + 299, + 104 + ], + "score": 0.873 + }, + { + "category_id": 1, + "poly": [ + 315, + 549, + 854, + 549, + 854, + 607, + 315, + 607 + ], + "score": 0.797 + }, + { + "category_id": 0, + "poly": [ + 315, + 518, + 484, + 518, + 484, + 545, + 315, + 545 + ], + "score": 0.73 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 857, + 2088, + 857, + 2112, + 842, + 2112 + ], + "score": 0.574 + }, + { + "category_id": 1, + "poly": [ + 319, + 1911, + 1378, + 1911, + 1378, + 1943, + 319, + 1943 + ], + "score": 0.545 + }, + { + "category_id": 0, + "poly": [ + 319, + 1911, + 1378, + 1911, + 1378, + 1943, + 319, + 1943 + ], + "score": 0.45 + }, + { + "category_id": 0, + "poly": [ + 960, + 518, + 1096, + 518, + 1096, + 547, + 960, + 547 + ], + "score": 0.14 + }, + { + "category_id": 13, + "poly": [ + 965, + 1035, + 992, + 1035, + 992, + 1064, + 965, + 1064 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 933, + 973, + 961, + 973, + 961, + 1003, + 933, + 1003 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 218.0, + 1405.0, + 218.0, + 1405.0, + 274.0, + 295.0, + 274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 274.0, + 503.0, + 274.0, + 503.0, + 327.0, + 294.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1212.0, + 579.0, + 1212.0, + 579.0, + 1258.0, + 294.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 768.0, + 685.0, + 934.0, + 685.0, + 934.0, + 728.0, + 768.0, + 728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 815.0, + 72.0, + 815.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 515.0, + 488.0, + 515.0, + 488.0, + 549.0, + 310.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 841.0, + 2088.0, + 858.0, + 2088.0, + 858.0, + 2116.0, + 841.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1909.0, + 1382.0, + 1909.0, + 1382.0, + 1948.0, + 320.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 513.0, + 1101.0, + 513.0, + 1101.0, + 553.0, + 955.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 758.0, + 1302.0, + 758.0, + 1302.0, + 795.0, + 394.0, + 795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 790.0, + 1305.0, + 790.0, + 1305.0, + 822.0, + 395.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 821.0, + 1305.0, + 821.0, + 1305.0, + 852.0, + 393.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 851.0, + 1307.0, + 851.0, + 1307.0, + 882.0, + 394.0, + 882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 881.0, + 1306.0, + 881.0, + 1306.0, + 913.0, + 394.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 914.0, + 1304.0, + 914.0, + 1304.0, + 943.0, + 396.0, + 943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 943.0, + 1306.0, + 943.0, + 1306.0, + 975.0, + 394.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 974.0, + 932.0, + 974.0, + 932.0, + 1006.0, + 395.0, + 1006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 962.0, + 974.0, + 1305.0, + 974.0, + 1305.0, + 1006.0, + 962.0, + 1006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1003.0, + 1307.0, + 1003.0, + 1307.0, + 1038.0, + 394.0, + 1038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1034.0, + 964.0, + 1034.0, + 964.0, + 1068.0, + 394.0, + 1068.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 993.0, + 1034.0, + 1305.0, + 1034.0, + 1305.0, + 1068.0, + 993.0, + 1068.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1064.0, + 1306.0, + 1064.0, + 1306.0, + 1099.0, + 394.0, + 1099.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1095.0, + 1306.0, + 1095.0, + 1306.0, + 1130.0, + 393.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1125.0, + 1099.0, + 1125.0, + 1099.0, + 1161.0, + 393.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1280.0, + 1407.0, + 1280.0, + 1407.0, + 1323.0, + 292.0, + 1323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1311.0, + 1407.0, + 1311.0, + 1407.0, + 1353.0, + 292.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1346.0, + 1405.0, + 1346.0, + 1405.0, + 1380.0, + 294.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1375.0, + 1405.0, + 1375.0, + 1405.0, + 1409.0, + 296.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1405.0, + 1404.0, + 1405.0, + 1404.0, + 1441.0, + 293.0, + 1441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1437.0, + 1405.0, + 1437.0, + 1405.0, + 1471.0, + 294.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1467.0, + 1404.0, + 1467.0, + 1404.0, + 1501.0, + 294.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1499.0, + 1405.0, + 1499.0, + 1405.0, + 1533.0, + 294.0, + 1533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1529.0, + 1405.0, + 1529.0, + 1405.0, + 1563.0, + 294.0, + 1563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1560.0, + 1405.0, + 1560.0, + 1405.0, + 1593.0, + 294.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1589.0, + 1405.0, + 1589.0, + 1405.0, + 1622.0, + 294.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1621.0, + 1361.0, + 1621.0, + 1361.0, + 1655.0, + 294.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1666.0, + 1407.0, + 1666.0, + 1407.0, + 1704.0, + 295.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1697.0, + 1402.0, + 1697.0, + 1402.0, + 1733.0, + 294.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1729.0, + 1406.0, + 1729.0, + 1406.0, + 1763.0, + 295.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1758.0, + 1406.0, + 1758.0, + 1406.0, + 1792.0, + 295.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1790.0, + 1403.0, + 1790.0, + 1403.0, + 1820.0, + 297.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1820.0, + 1406.0, + 1820.0, + 1406.0, + 1853.0, + 293.0, + 1853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1849.0, + 371.0, + 1849.0, + 371.0, + 1882.0, + 294.0, + 1882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 379.0, + 541.0, + 379.0, + 541.0, + 408.0, + 314.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 403.0, + 533.0, + 403.0, + 533.0, + 443.0, + 311.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 440.0, + 684.0, + 440.0, + 684.0, + 469.0, + 310.0, + 469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 376.0, + 1229.0, + 376.0, + 1229.0, + 411.0, + 1029.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 402.0, + 1252.0, + 402.0, + 1252.0, + 443.0, + 1029.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1027.0, + 439.0, + 1387.0, + 439.0, + 1387.0, + 469.0, + 1027.0, + 469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 1971.0, + 1397.0, + 1971.0, + 1397.0, + 2007.0, + 299.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 2002.0, + 1398.0, + 2002.0, + 1398.0, + 2040.0, + 297.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 515.0, + 1100.0, + 515.0, + 1100.0, + 551.0, + 956.0, + 551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 542.0, + 1182.0, + 542.0, + 1182.0, + 581.0, + 956.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 579.0, + 1312.0, + 579.0, + 1312.0, + 609.0, + 956.0, + 609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 543.0, + 856.0, + 543.0, + 856.0, + 581.0, + 312.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 580.0, + 684.0, + 580.0, + 684.0, + 611.0, + 315.0, + 611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1909.0, + 1382.0, + 1909.0, + 1382.0, + 1948.0, + 320.0, + 1948.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 872, + 1403, + 872, + 1403, + 1086, + 297, + 1086 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1682, + 1403, + 1682, + 1403, + 1865, + 298, + 1865 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 296, + 1239, + 1404, + 1239, + 1404, + 1484, + 296, + 1484 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1498, + 1403, + 1498, + 1403, + 1622, + 298, + 1622 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 299, + 1881, + 1402, + 1881, + 1402, + 2034, + 299, + 2034 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 297, + 1101, + 1403, + 1101, + 1403, + 1223, + 297, + 1223 + ], + "score": 0.971 + }, + { + "category_id": 3, + "poly": [ + 348, + 236, + 824, + 236, + 824, + 711, + 348, + 711 + ], + "score": 0.97 + }, + { + "category_id": 4, + "poly": [ + 861, + 443, + 1370, + 443, + 1370, + 721, + 861, + 721 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 297, + 777, + 1400, + 777, + 1400, + 839, + 297, + 839 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 300, + 1637, + 605, + 1637, + 605, + 1667, + 300, + 1667 + ], + "score": 0.892 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 812, + 76, + 812, + 104, + 300, + 104 + ], + "score": 0.886 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2112, + 841, + 2112 + ], + "score": 0.716 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.1 + }, + { + "category_id": 13, + "poly": [ + 862, + 628, + 914, + 628, + 914, + 662, + 862, + 662 + ], + "score": 0.89, + "latex": "\\lambda _ { o p t }" + }, + { + "category_id": 13, + "poly": [ + 1125, + 567, + 1252, + 567, + 1252, + 601, + 1125, + 601 + ], + "score": 0.88, + "latex": "( \\lambda = \\lambda _ { o p t } )" + }, + { + "category_id": 13, + "poly": [ + 1303, + 476, + 1369, + 476, + 1369, + 506, + 1303, + 506 + ], + "score": 0.86, + "latex": "d \\_ =" + }, + { + "category_id": 13, + "poly": [ + 390, + 1530, + 418, + 1530, + 418, + 1560, + 390, + 1560 + ], + "score": 0.85, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 513, + 1332, + 532, + 1332, + 532, + 1358, + 513, + 1358 + ], + "score": 0.78, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 863, + 665, + 883, + 665, + 883, + 686, + 863, + 686 + ], + "score": 0.64, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1192, + 1271, + 1211, + 1271, + 1211, + 1298, + 1192, + 1298 + ], + "score": 0.63, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 753, + 500, + 806, + 500, + 806, + 516, + 753, + 516 + ], + "score": 0.34, + "latex": "\\lambda = 2 ^ { 4 } \\lambda _ { o p t }" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 232.0, + 752.0, + 232.0, + 752.0, + 258.0, + 465.0, + 258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 363.0, + 245.0, + 399.0, + 245.0, + 399.0, + 267.0, + 363.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 258.0, + 787.0, + 258.0, + 787.0, + 279.0, + 746.0, + 279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 269.0, + 818.0, + 269.0, + 818.0, + 300.0, + 746.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 298.0, + 399.0, + 298.0, + 399.0, + 320.0, + 364.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 745.0, + 288.0, + 820.0, + 288.0, + 820.0, + 339.0, + 745.0, + 339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 325.0, + 820.0, + 325.0, + 820.0, + 357.0, + 746.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 351.0, + 400.0, + 351.0, + 400.0, + 372.0, + 364.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 343.0, + 820.0, + 343.0, + 820.0, + 376.0, + 746.0, + 376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 362.0, + 819.0, + 362.0, + 819.0, + 394.0, + 746.0, + 394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 343.0, + 366.0, + 372.0, + 366.0, + 372.0, + 498.0, + 343.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 381.0, + 819.0, + 381.0, + 819.0, + 413.0, + 746.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 363.0, + 403.0, + 398.0, + 403.0, + 398.0, + 425.0, + 363.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 400.0, + 818.0, + 400.0, + 818.0, + 431.0, + 747.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 745.0, + 419.0, + 802.0, + 419.0, + 802.0, + 449.0, + 745.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 434.0, + 815.0, + 434.0, + 815.0, + 468.0, + 747.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 456.0, + 399.0, + 456.0, + 399.0, + 477.0, + 364.0, + 477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 454.0, + 814.0, + 454.0, + 814.0, + 486.0, + 747.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 472.0, + 814.0, + 472.0, + 814.0, + 504.0, + 747.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 347.0, + 486.0, + 370.0, + 486.0, + 370.0, + 562.0, + 347.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 508.0, + 398.0, + 508.0, + 398.0, + 530.0, + 364.0, + 530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 561.0, + 399.0, + 561.0, + 399.0, + 583.0, + 364.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 613.0, + 399.0, + 613.0, + 399.0, + 635.0, + 364.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 666.0, + 399.0, + 666.0, + 399.0, + 688.0, + 364.0, + 688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 677.0, + 424.0, + 677.0, + 424.0, + 695.0, + 408.0, + 695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 479.0, + 675.0, + 511.0, + 675.0, + 511.0, + 697.0, + 479.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 557.0, + 676.0, + 589.0, + 676.0, + 589.0, + 697.0, + 557.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 636.0, + 675.0, + 668.0, + 675.0, + 668.0, + 697.0, + 636.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 714.0, + 676.0, + 746.0, + 676.0, + 746.0, + 697.0, + 714.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 676.0, + 827.0, + 676.0, + 827.0, + 697.0, + 790.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 554.0, + 687.0, + 663.0, + 687.0, + 663.0, + 715.0, + 554.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 748.0, + 493.0, + 810.0, + 493.0, + 810.0, + 520.0, + 748.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 444.0, + 1370.0, + 444.0, + 1370.0, + 479.0, + 860.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 475.0, + 1302.0, + 475.0, + 1302.0, + 509.0, + 860.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 503.0, + 1372.0, + 503.0, + 1372.0, + 542.0, + 858.0, + 542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 859.0, + 537.0, + 1370.0, + 537.0, + 1370.0, + 571.0, + 859.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 859.0, + 567.0, + 1124.0, + 567.0, + 1124.0, + 602.0, + 859.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1253.0, + 567.0, + 1371.0, + 567.0, + 1371.0, + 602.0, + 1253.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 859.0, + 597.0, + 1371.0, + 597.0, + 1371.0, + 631.0, + 859.0, + 631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 626.0, + 1373.0, + 626.0, + 1373.0, + 664.0, + 915.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 657.0, + 862.0, + 657.0, + 862.0, + 693.0, + 858.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 884.0, + 657.0, + 1372.0, + 657.0, + 1372.0, + 693.0, + 884.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 685.0, + 971.0, + 685.0, + 971.0, + 725.0, + 858.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 815.0, + 73.0, + 815.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2121.0, + 839.0, + 2121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2120.0, + 838.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 870.0, + 1403.0, + 870.0, + 1403.0, + 907.0, + 295.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 902.0, + 1405.0, + 902.0, + 1405.0, + 939.0, + 294.0, + 939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 934.0, + 1405.0, + 934.0, + 1405.0, + 968.0, + 293.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 963.0, + 1405.0, + 963.0, + 1405.0, + 1000.0, + 294.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 992.0, + 1405.0, + 992.0, + 1405.0, + 1031.0, + 294.0, + 1031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1023.0, + 1402.0, + 1023.0, + 1402.0, + 1061.0, + 294.0, + 1061.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1058.0, + 603.0, + 1058.0, + 603.0, + 1088.0, + 296.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1680.0, + 1405.0, + 1680.0, + 1405.0, + 1717.0, + 293.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1712.0, + 1404.0, + 1712.0, + 1404.0, + 1748.0, + 292.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1742.0, + 1405.0, + 1742.0, + 1405.0, + 1779.0, + 293.0, + 1779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1775.0, + 1405.0, + 1775.0, + 1405.0, + 1806.0, + 296.0, + 1806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1803.0, + 1406.0, + 1803.0, + 1406.0, + 1840.0, + 292.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1837.0, + 1134.0, + 1837.0, + 1134.0, + 1866.0, + 296.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1236.0, + 1404.0, + 1236.0, + 1404.0, + 1275.0, + 291.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1270.0, + 1191.0, + 1270.0, + 1191.0, + 1304.0, + 295.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1212.0, + 1270.0, + 1405.0, + 1270.0, + 1405.0, + 1304.0, + 1212.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1303.0, + 1402.0, + 1303.0, + 1402.0, + 1333.0, + 295.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1332.0, + 512.0, + 1332.0, + 512.0, + 1365.0, + 294.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 533.0, + 1332.0, + 1405.0, + 1332.0, + 1405.0, + 1365.0, + 533.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1361.0, + 1405.0, + 1361.0, + 1405.0, + 1395.0, + 294.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1390.0, + 1406.0, + 1390.0, + 1406.0, + 1427.0, + 294.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1421.0, + 1405.0, + 1421.0, + 1405.0, + 1459.0, + 294.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1454.0, + 1165.0, + 1454.0, + 1165.0, + 1486.0, + 294.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1497.0, + 1404.0, + 1497.0, + 1404.0, + 1532.0, + 292.0, + 1532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1530.0, + 389.0, + 1530.0, + 389.0, + 1562.0, + 294.0, + 1562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 419.0, + 1530.0, + 1402.0, + 1530.0, + 1402.0, + 1562.0, + 419.0, + 1562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1561.0, + 1403.0, + 1561.0, + 1403.0, + 1594.0, + 294.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1593.0, + 1058.0, + 1593.0, + 1058.0, + 1623.0, + 293.0, + 1623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1880.0, + 1404.0, + 1880.0, + 1404.0, + 1915.0, + 297.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1913.0, + 1404.0, + 1913.0, + 1404.0, + 1946.0, + 297.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1943.0, + 1404.0, + 1943.0, + 1404.0, + 1976.0, + 295.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1971.0, + 1404.0, + 1971.0, + 1404.0, + 2008.0, + 295.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2001.0, + 1404.0, + 2001.0, + 1404.0, + 2038.0, + 294.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1101.0, + 1404.0, + 1101.0, + 1404.0, + 1137.0, + 293.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1132.0, + 1405.0, + 1132.0, + 1405.0, + 1167.0, + 294.0, + 1167.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1163.0, + 1405.0, + 1163.0, + 1405.0, + 1199.0, + 293.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1194.0, + 626.0, + 1194.0, + 626.0, + 1227.0, + 293.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 773.0, + 1404.0, + 773.0, + 1404.0, + 816.0, + 292.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 808.0, + 741.0, + 808.0, + 741.0, + 842.0, + 295.0, + 842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1633.0, + 610.0, + 1633.0, + 610.0, + 1670.0, + 295.0, + 1670.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1179, + 1404, + 1179, + 1404, + 1423, + 298, + 1423 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 297, + 1669, + 1404, + 1669, + 1404, + 2034, + 297, + 2034 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 1438, + 1404, + 1438, + 1404, + 1652, + 298, + 1652 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1402, + 229, + 1402, + 352, + 299, + 352 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 301, + 963, + 1404, + 963, + 1404, + 1086, + 301, + 1086 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 300, + 368, + 1404, + 368, + 1404, + 491, + 300, + 491 + ], + "score": 0.961 + }, + { + "category_id": 1, + "poly": [ + 361, + 519, + 1403, + 519, + 1403, + 936, + 361, + 936 + ], + "score": 0.96 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 813, + 76, + 813, + 104, + 300, + 104 + ], + "score": 0.899 + }, + { + "category_id": 0, + "poly": [ + 301, + 1123, + 577, + 1123, + 577, + 1154, + 301, + 1154 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.618 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.409 + }, + { + "category_id": 13, + "poly": [ + 919, + 1973, + 966, + 1973, + 966, + 2006, + 919, + 2006 + ], + "score": 0.9, + "latex": "d / n" + }, + { + "category_id": 13, + "poly": [ + 889, + 815, + 917, + 815, + 917, + 844, + 889, + 844 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1211, + 1944, + 1229, + 1944, + 1229, + 1970, + 1211, + 1970 + ], + "score": 0.75, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 395, + 1978, + 416, + 1978, + 416, + 2000, + 395, + 2000 + ], + "score": 0.66, + "latex": "n" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 72.0, + 816.0, + 72.0, + 816.0, + 110.0, + 294.0, + 110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1120.0, + 581.0, + 1120.0, + 581.0, + 1159.0, + 296.0, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 860.0, + 2085.0, + 860.0, + 2116.0, + 839.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1177.0, + 1405.0, + 1177.0, + 1405.0, + 1216.0, + 293.0, + 1216.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1210.0, + 1405.0, + 1210.0, + 1405.0, + 1244.0, + 294.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1241.0, + 1406.0, + 1241.0, + 1406.0, + 1275.0, + 294.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1271.0, + 1405.0, + 1271.0, + 1405.0, + 1305.0, + 296.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1302.0, + 1405.0, + 1302.0, + 1405.0, + 1336.0, + 293.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1332.0, + 1406.0, + 1332.0, + 1406.0, + 1365.0, + 294.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1365.0, + 1405.0, + 1365.0, + 1405.0, + 1395.0, + 296.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1393.0, + 435.0, + 1393.0, + 435.0, + 1428.0, + 294.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1665.0, + 1397.0, + 1665.0, + 1397.0, + 1704.0, + 294.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1699.0, + 1402.0, + 1699.0, + 1402.0, + 1733.0, + 295.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1730.0, + 1404.0, + 1730.0, + 1404.0, + 1761.0, + 296.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1759.0, + 1405.0, + 1759.0, + 1405.0, + 1793.0, + 295.0, + 1793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1786.0, + 1405.0, + 1786.0, + 1405.0, + 1826.0, + 291.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1818.0, + 1405.0, + 1818.0, + 1405.0, + 1856.0, + 292.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1850.0, + 1405.0, + 1850.0, + 1405.0, + 1884.0, + 292.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1881.0, + 1404.0, + 1881.0, + 1404.0, + 1914.0, + 294.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1912.0, + 1404.0, + 1912.0, + 1404.0, + 1946.0, + 295.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 1210.0, + 1942.0, + 1210.0, + 1976.0, + 294.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1230.0, + 1942.0, + 1406.0, + 1942.0, + 1406.0, + 1976.0, + 1230.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1973.0, + 394.0, + 1973.0, + 394.0, + 2006.0, + 295.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 417.0, + 1973.0, + 918.0, + 1973.0, + 918.0, + 2006.0, + 417.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 967.0, + 1973.0, + 1405.0, + 1973.0, + 1405.0, + 2006.0, + 967.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1999.0, + 1405.0, + 1999.0, + 1405.0, + 2039.0, + 292.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1438.0, + 1404.0, + 1438.0, + 1404.0, + 1473.0, + 294.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1470.0, + 1406.0, + 1470.0, + 1406.0, + 1502.0, + 294.0, + 1502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1500.0, + 1404.0, + 1500.0, + 1404.0, + 1534.0, + 292.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1532.0, + 1402.0, + 1532.0, + 1402.0, + 1566.0, + 294.0, + 1566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1561.0, + 1405.0, + 1561.0, + 1405.0, + 1595.0, + 294.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1589.0, + 1405.0, + 1589.0, + 1405.0, + 1628.0, + 292.0, + 1628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1622.0, + 645.0, + 1622.0, + 645.0, + 1657.0, + 294.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 229.0, + 1407.0, + 229.0, + 1407.0, + 266.0, + 292.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 263.0, + 1404.0, + 263.0, + 1404.0, + 295.0, + 295.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 292.0, + 1407.0, + 292.0, + 1407.0, + 327.0, + 294.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 324.0, + 627.0, + 324.0, + 627.0, + 353.0, + 295.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 961.0, + 1403.0, + 961.0, + 1403.0, + 998.0, + 294.0, + 998.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 993.0, + 1404.0, + 993.0, + 1404.0, + 1027.0, + 294.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1023.0, + 1404.0, + 1023.0, + 1404.0, + 1059.0, + 296.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1057.0, + 1340.0, + 1057.0, + 1340.0, + 1086.0, + 297.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 369.0, + 1404.0, + 369.0, + 1404.0, + 402.0, + 296.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 398.0, + 1403.0, + 398.0, + 1403.0, + 431.0, + 295.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 428.0, + 1405.0, + 428.0, + 1405.0, + 465.0, + 291.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 460.0, + 498.0, + 460.0, + 498.0, + 493.0, + 295.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 517.0, + 1404.0, + 517.0, + 1404.0, + 553.0, + 362.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 550.0, + 1405.0, + 550.0, + 1405.0, + 582.0, + 394.0, + 582.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 581.0, + 1404.0, + 581.0, + 1404.0, + 612.0, + 393.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 611.0, + 524.0, + 611.0, + 524.0, + 641.0, + 395.0, + 641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 359.0, + 650.0, + 1404.0, + 650.0, + 1404.0, + 685.0, + 359.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 683.0, + 1405.0, + 683.0, + 1405.0, + 716.0, + 392.0, + 716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 711.0, + 1404.0, + 711.0, + 1404.0, + 746.0, + 393.0, + 746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 743.0, + 1163.0, + 743.0, + 1163.0, + 775.0, + 394.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 359.0, + 782.0, + 1404.0, + 782.0, + 1404.0, + 818.0, + 359.0, + 818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 812.0, + 888.0, + 812.0, + 888.0, + 849.0, + 391.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.0, + 812.0, + 1407.0, + 812.0, + 1407.0, + 849.0, + 918.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 845.0, + 1404.0, + 845.0, + 1404.0, + 878.0, + 394.0, + 878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 876.0, + 1404.0, + 876.0, + 1404.0, + 909.0, + 395.0, + 909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 906.0, + 729.0, + 906.0, + 729.0, + 939.0, + 395.0, + 939.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 638, + 1405, + 638, + 1405, + 899, + 296, + 899 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 1637, + 1404, + 1637, + 1404, + 1831, + 297, + 1831 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 1149, + 1406, + 1149, + 1406, + 1332, + 297, + 1332 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 499, + 1403, + 499, + 1403, + 625, + 298, + 625 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1496, + 1404, + 1496, + 1404, + 1622, + 298, + 1622 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 228, + 1404, + 228, + 1404, + 385, + 297, + 385 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 300, + 1839, + 1402, + 1839, + 1402, + 1934, + 300, + 1934 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 298, + 1339, + 1404, + 1339, + 1404, + 1431, + 298, + 1431 + ], + "score": 0.968 + }, + { + "category_id": 8, + "poly": [ + 526, + 1950, + 1171, + 1950, + 1171, + 2045, + 526, + 2045 + ], + "score": 0.957 + }, + { + "category_id": 8, + "poly": [ + 665, + 913, + 1036, + 913, + 1036, + 973, + 665, + 973 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 298, + 989, + 1406, + 989, + 1406, + 1052, + 298, + 1052 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 484, + 1068, + 1218, + 1068, + 1218, + 1127, + 484, + 1127 + ], + "score": 0.949 + }, + { + "category_id": 8, + "poly": [ + 733, + 1430, + 965, + 1430, + 965, + 1476, + 733, + 1476 + ], + "score": 0.938 + }, + { + "category_id": 0, + "poly": [ + 298, + 429, + 1058, + 429, + 1058, + 466, + 298, + 466 + ], + "score": 0.921 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.902 + }, + { + "category_id": 9, + "poly": [ + 1366, + 922, + 1400, + 922, + 1400, + 952, + 1366, + 952 + ], + "score": 0.886 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1076, + 1400, + 1076, + 1400, + 1106, + 1366, + 1106 + ], + "score": 0.874 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2111, + 841, + 2111 + ], + "score": 0.788 + }, + { + "category_id": 14, + "poly": [ + 527, + 1948, + 1173, + 1948, + 1173, + 2045, + 527, + 2045 + ], + "score": 0.95, + "latex": "\\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\operatorname * { \\mathbb { E } } _ { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma _ { n } } \\left[ \\sum _ { i = 1 } ^ { d } \\frac { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } / d + \\sigma ^ { 2 } \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } \\right] + \\sigma ^ { 2 }" + }, + { + "category_id": 14, + "poly": [ + 664, + 912, + 1036, + 912, + 1036, + 974, + 664, + 974 + ], + "score": 0.94, + "latex": "{ \\overline { { R } } } ( { \\hat { \\beta } } _ { n } ) : = \\operatorname * { \\mathbb { E } } _ { X , y \\sim { \\mathcal { D } } ^ { n } } [ R ( { \\hat { \\beta } } _ { n } ( X , { \\vec { y } } ) ) ]" + }, + { + "category_id": 13, + "poly": [ + 918, + 830, + 1023, + 830, + 1023, + 869, + 918, + 869 + ], + "score": 0.94, + "latex": "\\hat { \\beta } _ { n } ( X , \\vec { y } )" + }, + { + "category_id": 13, + "poly": [ + 742, + 1737, + 953, + 1737, + 953, + 1772, + 742, + 1772 + ], + "score": 0.93, + "latex": "\\mathbb { E } [ g ( \\gamma , \\sigma , n , d , \\beta ^ { * } ) ]" + }, + { + "category_id": 13, + "poly": [ + 568, + 1637, + 656, + 1637, + 656, + 1675, + 568, + 1675 + ], + "score": 0.93, + "latex": "\\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } } )" + }, + { + "category_id": 13, + "poly": [ + 492, + 1734, + 580, + 1734, + 580, + 1772, + 492, + 1772 + ], + "score": 0.93, + "latex": "\\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } } )" + }, + { + "category_id": 13, + "poly": [ + 374, + 763, + 546, + 763, + 546, + 796, + 374, + 796 + ], + "score": 0.93, + "latex": "f _ { \\beta } ( x ) = \\langle x , \\beta \\rangle" + }, + { + "category_id": 13, + "poly": [ + 1159, + 671, + 1344, + 671, + 1344, + 704, + 1159, + 704 + ], + "score": 0.93, + "latex": "y = \\langle x , \\beta ^ { * } \\rangle + \\varepsilon" + }, + { + "category_id": 14, + "poly": [ + 487, + 1067, + 1216, + 1067, + 1216, + 1132, + 487, + 1132 + ], + "score": 0.93, + "latex": "\\hat { \\beta } _ { n , \\lambda } : = \\underset { \\beta } { \\operatorname { a r g m i n } } | | X \\beta - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda | | \\beta | | _ { 2 } ^ { 2 } = ( X ^ { T } X + \\lambda I _ { d } ) ^ { - 1 } X ^ { T } \\vec { y }" + }, + { + "category_id": 13, + "poly": [ + 1031, + 1735, + 1118, + 1735, + 1118, + 1770, + 1031, + 1770 + ], + "score": 0.92, + "latex": "\\gamma \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 1066, + 1370, + 1171, + 1370, + 1171, + 1403, + 1066, + 1403 + ], + "score": 0.92, + "latex": "\\beta ^ { * } \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 297, + 701, + 455, + 701, + 455, + 735, + 297, + 735 + ], + "score": 0.92, + "latex": "\\varepsilon \\sim \\mathcal { N } ( 0 , \\bar { \\sigma } ^ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 595, + 672, + 696, + 672, + 696, + 705, + 595, + 705 + ], + "score": 0.92, + "latex": "\\mathcal { N } ( 0 , I _ { d } )" + }, + { + "category_id": 13, + "poly": [ + 1109, + 1642, + 1205, + 1642, + 1205, + 1674, + 1109, + 1674 + ], + "score": 0.92, + "latex": "( n , \\sigma , \\beta ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1402, + 400, + 1402, + 400, + 1433, + 297, + 1433 + ], + "score": 0.91, + "latex": "\\mathbb { N } , \\sigma > 0" + }, + { + "category_id": 13, + "poly": [ + 934, + 1184, + 1286, + 1184, + 1286, + 1225, + 934, + 1225 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\lambda _ { n } ^ { \\mathrm { o p t } } : = \\operatorname * { a r g m i n } _ { \\lambda : \\lambda \\geq 0 } \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 723, + 733, + 870, + 733, + 870, + 766, + 723, + 766 + ], + "score": 0.91, + "latex": "\\{ ( x _ { i } , y _ { i } ) \\} _ { i = 1 } ^ { n }" + }, + { + "category_id": 13, + "poly": [ + 333, + 798, + 462, + 798, + 462, + 827, + 333, + 827 + ], + "score": 0.91, + "latex": "\\ b { X } \\in \\mathbb { R } ^ { n \\times d }" + }, + { + "category_id": 14, + "poly": [ + 734, + 1429, + 965, + 1429, + 965, + 1475, + 734, + 1475 + ], + "score": 0.91, + "latex": "\\overline { { R } } ( \\hat { \\beta } _ { n + 1 } ^ { \\mathrm { o p t } } ) \\leq \\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } )" + }, + { + "category_id": 13, + "poly": [ + 644, + 1559, + 745, + 1559, + 745, + 1591, + 644, + 1591 + ], + "score": 0.91, + "latex": "n , d \\in \\mathbb { N }" + }, + { + "category_id": 13, + "poly": [ + 1020, + 1265, + 1066, + 1265, + 1066, + 1300, + 1020, + 1300 + ], + "score": 0.91, + "latex": "\\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } }" + }, + { + "category_id": 13, + "poly": [ + 936, + 1150, + 982, + 1150, + 982, + 1183, + 936, + 1183 + ], + "score": 0.9, + "latex": "\\lambda _ { n } ^ { \\mathrm { o p t } }" + }, + { + "category_id": 13, + "poly": [ + 377, + 1870, + 504, + 1870, + 504, + 1900, + 377, + 1900 + ], + "score": 0.9, + "latex": "\\ b { X } \\in \\mathbb { R } ^ { n \\times d }" + }, + { + "category_id": 13, + "poly": [ + 850, + 763, + 1223, + 763, + 1223, + 798, + 850, + 798 + ], + "score": 0.9, + "latex": "\\bar { R } ( \\beta ) : = \\mathbb { E } _ { ( x , y ) \\sim \\mathcal { D } } [ ( \\langle x , \\beta \\rangle - y ) ^ { 2 } ]" + }, + { + "category_id": 13, + "poly": [ + 755, + 1225, + 800, + 1225, + 800, + 1259, + 755, + 1259 + ], + "score": 0.9, + "latex": "\\lambda _ { n } ^ { \\mathrm { o p t } }" + }, + { + "category_id": 13, + "poly": [ + 298, + 670, + 386, + 670, + 386, + 699, + 298, + 699 + ], + "score": 0.9, + "latex": "x \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 1300, + 703, + 1365, + 703, + 1365, + 735, + 1300, + 735 + ], + "score": 0.9, + "latex": "( x , y )" + }, + { + "category_id": 13, + "poly": [ + 1265, + 1372, + 1404, + 1372, + 1404, + 1403, + 1265, + 1403 + ], + "score": 0.9, + "latex": "d \\in \\mathbb { N } , n \\in" + }, + { + "category_id": 13, + "poly": [ + 1061, + 800, + 1149, + 800, + 1149, + 831, + 1061, + 831 + ], + "score": 0.9, + "latex": "\\vec { y } \\in \\mathbb R ^ { n }" + }, + { + "category_id": 13, + "poly": [ + 1354, + 1184, + 1401, + 1184, + 1401, + 1222, + 1354, + 1222 + ], + "score": 0.9, + "latex": "\\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } }" + }, + { + "category_id": 13, + "poly": [ + 802, + 1840, + 1003, + 1840, + 1003, + 1873, + 802, + 1873 + ], + "score": 0.9, + "latex": "\\gamma = ( \\gamma _ { 1 } , \\ldots , \\gamma _ { d } )" + }, + { + "category_id": 13, + "poly": [ + 795, + 701, + 894, + 701, + 894, + 732, + 795, + 732 + ], + "score": 0.9, + "latex": "\\beta ^ { * } \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 825, + 798, + 862, + 798, + 862, + 832, + 825, + 832 + ], + "score": 0.9, + "latex": "x _ { i } ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 429, + 1021, + 498, + 1021, + 498, + 1049, + 429, + 1049 + ], + "score": 0.9, + "latex": "\\lambda > 0" + }, + { + "category_id": 13, + "poly": [ + 358, + 1529, + 390, + 1529, + 390, + 1560, + 358, + 1560 + ], + "score": 0.88, + "latex": "\\beta ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 914, + 1226, + 1394, + 1226, + 1394, + 1265, + 914, + 1265 + ], + "score": 0.88, + "latex": "\\begin{array} { r } { \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } : = \\operatorname * { a r g m i n } _ { \\beta } | | X \\beta - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda _ { n } ^ { \\mathrm { o p t } } | | \\beta | | _ { 2 } ^ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 765, + 1874, + 845, + 1874, + 845, + 1904, + 765, + 1904 + ], + "score": 0.88, + "latex": "\\gamma _ { i } = 0" + }, + { + "category_id": 13, + "poly": [ + 1022, + 1873, + 1057, + 1873, + 1057, + 1902, + 1022, + 1902 + ], + "score": 0.87, + "latex": "\\Gamma _ { n }" + }, + { + "category_id": 13, + "poly": [ + 360, + 1155, + 389, + 1155, + 389, + 1184, + 360, + 1184 + ], + "score": 0.87, + "latex": "I _ { d }" + }, + { + "category_id": 13, + "poly": [ + 889, + 1875, + 959, + 1875, + 959, + 1902, + 889, + 1902 + ], + "score": 0.82, + "latex": "i > n ." + }, + { + "category_id": 13, + "poly": [ + 551, + 840, + 576, + 840, + 576, + 867, + 551, + 867 + ], + "score": 0.81, + "latex": "y _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1089, + 734, + 1113, + 734, + 1113, + 759, + 1089, + 759 + ], + "score": 0.8, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 371, + 1770, + 399, + 1770, + 399, + 1796, + 371, + 1796 + ], + "score": 0.8, + "latex": "X" + }, + { + "category_id": 13, + "poly": [ + 532, + 1155, + 551, + 1155, + 551, + 1181, + 532, + 1181 + ], + "score": 0.78, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 1020, + 642, + 1039, + 642, + 1039, + 668, + 1020, + 668 + ], + "score": 0.77, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 491, + 740, + 511, + 740, + 511, + 760, + 491, + 760 + ], + "score": 0.76, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 298, + 735, + 322, + 735, + 322, + 760, + 298, + 760 + ], + "score": 0.74, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 1381, + 1276, + 1401, + 1276, + 1401, + 1296, + 1381, + 1296 + ], + "score": 0.74, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1204, + 842, + 1224, + 842, + 1224, + 863, + 1204, + 863 + ], + "score": 0.74, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 798, + 1196, + 818, + 1196, + 818, + 1217, + 798, + 1217 + ], + "score": 0.73, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1303, + 1876, + 1322, + 1876, + 1322, + 1904, + 1303, + 1904 + ], + "score": 0.73, + "latex": "\\gamma ." + }, + { + "category_id": 13, + "poly": [ + 1265, + 1643, + 1283, + 1643, + 1283, + 1670, + 1265, + 1670 + ], + "score": 0.65, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 733, + 1843, + 748, + 1843, + 748, + 1868, + 733, + 1868 + ], + "score": 0.58, + "latex": "^ { l }" + }, + { + "category_id": 13, + "poly": [ + 553, + 1873, + 626, + 1873, + 626, + 1903, + 553, + 1903 + ], + "score": 0.53, + "latex": "n < d" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 426.0, + 1062.0, + 426.0, + 1062.0, + 472.0, + 292.0, + 472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 815.0, + 73.0, + 815.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2118.0, + 839.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 639.0, + 1019.0, + 639.0, + 1019.0, + 674.0, + 295.0, + 674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 639.0, + 1405.0, + 639.0, + 1405.0, + 674.0, + 1040.0, + 674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 667.0, + 297.0, + 667.0, + 297.0, + 706.0, + 291.0, + 706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 387.0, + 667.0, + 594.0, + 667.0, + 594.0, + 706.0, + 387.0, + 706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 667.0, + 1158.0, + 667.0, + 1158.0, + 706.0, + 697.0, + 706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1345.0, + 667.0, + 1405.0, + 667.0, + 1405.0, + 706.0, + 1345.0, + 706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 693.0, + 296.0, + 693.0, + 296.0, + 740.0, + 290.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 456.0, + 693.0, + 794.0, + 693.0, + 794.0, + 740.0, + 456.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 895.0, + 693.0, + 1299.0, + 693.0, + 1299.0, + 740.0, + 895.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1366.0, + 693.0, + 1406.0, + 693.0, + 1406.0, + 740.0, + 1366.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 728.0, + 297.0, + 728.0, + 297.0, + 770.0, + 293.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 728.0, + 490.0, + 728.0, + 490.0, + 770.0, + 323.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 728.0, + 722.0, + 728.0, + 722.0, + 770.0, + 512.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 728.0, + 1088.0, + 728.0, + 1088.0, + 770.0, + 871.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 728.0, + 1407.0, + 728.0, + 1407.0, + 770.0, + 1114.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 760.0, + 373.0, + 760.0, + 373.0, + 802.0, + 291.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 547.0, + 760.0, + 849.0, + 760.0, + 849.0, + 802.0, + 547.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 760.0, + 1406.0, + 760.0, + 1406.0, + 802.0, + 1224.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 791.0, + 332.0, + 791.0, + 332.0, + 837.0, + 290.0, + 837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 791.0, + 824.0, + 791.0, + 824.0, + 837.0, + 463.0, + 837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 791.0, + 1060.0, + 791.0, + 1060.0, + 837.0, + 863.0, + 837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 791.0, + 1407.0, + 791.0, + 1407.0, + 837.0, + 1150.0, + 837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 835.0, + 550.0, + 835.0, + 550.0, + 870.0, + 294.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 835.0, + 917.0, + 835.0, + 917.0, + 870.0, + 577.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1024.0, + 835.0, + 1203.0, + 835.0, + 1203.0, + 870.0, + 1024.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 835.0, + 1405.0, + 835.0, + 1405.0, + 870.0, + 1225.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 865.0, + 709.0, + 865.0, + 709.0, + 899.0, + 295.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1636.0, + 567.0, + 1636.0, + 567.0, + 1680.0, + 292.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 1636.0, + 1108.0, + 1636.0, + 1108.0, + 1680.0, + 657.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 1636.0, + 1264.0, + 1636.0, + 1264.0, + 1680.0, + 1206.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1284.0, + 1636.0, + 1406.0, + 1636.0, + 1406.0, + 1680.0, + 1284.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1671.0, + 1404.0, + 1671.0, + 1404.0, + 1708.0, + 296.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1701.0, + 1405.0, + 1701.0, + 1405.0, + 1738.0, + 295.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1731.0, + 491.0, + 1731.0, + 491.0, + 1776.0, + 292.0, + 1776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 581.0, + 1731.0, + 741.0, + 1731.0, + 741.0, + 1776.0, + 581.0, + 1776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1731.0, + 1030.0, + 1731.0, + 1030.0, + 1776.0, + 954.0, + 1776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1119.0, + 1731.0, + 1406.0, + 1731.0, + 1406.0, + 1776.0, + 1119.0, + 1776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1765.0, + 370.0, + 1765.0, + 370.0, + 1805.0, + 294.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 400.0, + 1765.0, + 1405.0, + 1765.0, + 1405.0, + 1805.0, + 400.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1797.0, + 1044.0, + 1797.0, + 1044.0, + 1835.0, + 294.0, + 1835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1144.0, + 359.0, + 1144.0, + 359.0, + 1191.0, + 291.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 1144.0, + 531.0, + 1144.0, + 531.0, + 1191.0, + 390.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 552.0, + 1144.0, + 935.0, + 1144.0, + 935.0, + 1191.0, + 552.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 1144.0, + 1411.0, + 1144.0, + 1411.0, + 1191.0, + 983.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 1177.0, + 797.0, + 1177.0, + 797.0, + 1233.0, + 285.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 1177.0, + 933.0, + 1177.0, + 933.0, + 1233.0, + 819.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1287.0, + 1177.0, + 1353.0, + 1177.0, + 1353.0, + 1233.0, + 1287.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1177.0, + 1415.0, + 1177.0, + 1415.0, + 1233.0, + 1402.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1216.0, + 754.0, + 1216.0, + 754.0, + 1268.0, + 290.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 801.0, + 1216.0, + 913.0, + 1216.0, + 913.0, + 1268.0, + 801.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 1216.0, + 1406.0, + 1216.0, + 1406.0, + 1268.0, + 1395.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1258.0, + 1019.0, + 1258.0, + 1019.0, + 1310.0, + 290.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 1258.0, + 1380.0, + 1258.0, + 1380.0, + 1310.0, + 1067.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1258.0, + 1411.0, + 1258.0, + 1411.0, + 1310.0, + 1402.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1298.0, + 413.0, + 1298.0, + 413.0, + 1330.0, + 294.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 501.0, + 1407.0, + 501.0, + 1407.0, + 537.0, + 293.0, + 537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 533.0, + 1403.0, + 533.0, + 1403.0, + 566.0, + 294.0, + 566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 562.0, + 1405.0, + 562.0, + 1405.0, + 597.0, + 293.0, + 597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 594.0, + 1168.0, + 594.0, + 1168.0, + 627.0, + 296.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1494.0, + 1404.0, + 1494.0, + 1404.0, + 1533.0, + 292.0, + 1533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1528.0, + 357.0, + 1528.0, + 357.0, + 1565.0, + 293.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 1528.0, + 1405.0, + 1528.0, + 1405.0, + 1565.0, + 391.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1559.0, + 643.0, + 1559.0, + 643.0, + 1594.0, + 292.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1559.0, + 1406.0, + 1559.0, + 1406.0, + 1594.0, + 746.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1591.0, + 1154.0, + 1591.0, + 1154.0, + 1624.0, + 293.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 230.0, + 1402.0, + 230.0, + 1402.0, + 264.0, + 296.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 260.0, + 1404.0, + 260.0, + 1404.0, + 296.0, + 294.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 292.0, + 1405.0, + 292.0, + 1405.0, + 325.0, + 295.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 319.0, + 1406.0, + 319.0, + 1406.0, + 357.0, + 292.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 348.0, + 1086.0, + 348.0, + 1086.0, + 391.0, + 292.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1838.0, + 732.0, + 1838.0, + 732.0, + 1876.0, + 294.0, + 1876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 1838.0, + 801.0, + 1838.0, + 801.0, + 1876.0, + 749.0, + 1876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1004.0, + 1838.0, + 1406.0, + 1838.0, + 1406.0, + 1876.0, + 1004.0, + 1876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1865.0, + 376.0, + 1865.0, + 376.0, + 1910.0, + 291.0, + 1910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 505.0, + 1865.0, + 552.0, + 1865.0, + 552.0, + 1910.0, + 505.0, + 1910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 1865.0, + 764.0, + 1865.0, + 764.0, + 1910.0, + 627.0, + 1910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 846.0, + 1865.0, + 888.0, + 1865.0, + 888.0, + 1910.0, + 846.0, + 1910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 960.0, + 1865.0, + 1021.0, + 1865.0, + 1021.0, + 1910.0, + 960.0, + 1910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 1865.0, + 1302.0, + 1865.0, + 1302.0, + 1910.0, + 1058.0, + 1910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1323.0, + 1865.0, + 1406.0, + 1865.0, + 1406.0, + 1910.0, + 1323.0, + 1910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1901.0, + 563.0, + 1901.0, + 563.0, + 1935.0, + 296.0, + 1935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1337.0, + 1408.0, + 1337.0, + 1408.0, + 1375.0, + 293.0, + 1375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1368.0, + 1065.0, + 1368.0, + 1065.0, + 1405.0, + 293.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1172.0, + 1368.0, + 1264.0, + 1368.0, + 1264.0, + 1405.0, + 1172.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1399.0, + 296.0, + 1399.0, + 296.0, + 1435.0, + 293.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 1399.0, + 411.0, + 1399.0, + 411.0, + 1435.0, + 401.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 985.0, + 1403.0, + 985.0, + 1403.0, + 1027.0, + 296.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1018.0, + 428.0, + 1018.0, + 428.0, + 1054.0, + 295.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1018.0, + 584.0, + 1018.0, + 584.0, + 1054.0, + 499.0, + 1054.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1754, + 1405, + 1754, + 1405, + 2036, + 296, + 2036 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1648, + 1404, + 1648, + 1404, + 1742, + 298, + 1742 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 740, + 1404, + 740, + 1404, + 867, + 298, + 867 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 296, + 577, + 1404, + 577, + 1404, + 725, + 296, + 725 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 1192, + 1403, + 1192, + 1403, + 1285, + 299, + 1285 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 545, + 368, + 1155, + 368, + 1155, + 462, + 545, + 462 + ], + "score": 0.959 + }, + { + "category_id": 1, + "poly": [ + 300, + 486, + 1403, + 486, + 1403, + 549, + 300, + 549 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 295, + 1293, + 1404, + 1293, + 1404, + 1358, + 295, + 1358 + ], + "score": 0.942 + }, + { + "category_id": 8, + "poly": [ + 650, + 1370, + 1057, + 1370, + 1057, + 1414, + 650, + 1414 + ], + "score": 0.939 + }, + { + "category_id": 8, + "poly": [ + 533, + 881, + 1142, + 881, + 1142, + 973, + 533, + 973 + ], + "score": 0.937 + }, + { + "category_id": 0, + "poly": [ + 298, + 1578, + 1120, + 1578, + 1120, + 1617, + 298, + 1617 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 298, + 1504, + 549, + 1504, + 549, + 1537, + 298, + 1537 + ], + "score": 0.921 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 814, + 73, + 814, + 106, + 298, + 106 + ], + "score": 0.92 + }, + { + "category_id": 1, + "poly": [ + 298, + 1424, + 515, + 1424, + 515, + 1475, + 298, + 1475 + ], + "score": 0.9 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1082, + 1400, + 1082, + 1400, + 1112, + 1366, + 1112 + ], + "score": 0.887 + }, + { + "category_id": 9, + "poly": [ + 1365, + 398, + 1400, + 398, + 1400, + 429, + 1365, + 429 + ], + "score": 0.886 + }, + { + "category_id": 1, + "poly": [ + 290, + 228, + 1338, + 228, + 1338, + 264, + 290, + 264 + ], + "score": 0.881 + }, + { + "category_id": 9, + "poly": [ + 1365, + 912, + 1400, + 912, + 1400, + 941, + 1365, + 941 + ], + "score": 0.875 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1009, + 1400, + 1009, + 1400, + 1039, + 1365, + 1039 + ], + "score": 0.866 + }, + { + "category_id": 8, + "poly": [ + 627, + 980, + 1163, + 980, + 1163, + 1071, + 627, + 1071 + ], + "score": 0.857 + }, + { + "category_id": 1, + "poly": [ + 292, + 272, + 1408, + 272, + 1408, + 353, + 292, + 353 + ], + "score": 0.854 + }, + { + "category_id": 2, + "poly": [ + 1374, + 1505, + 1403, + 1505, + 1403, + 1534, + 1374, + 1534 + ], + "score": 0.838 + }, + { + "category_id": 2, + "poly": [ + 1375, + 1129, + 1401, + 1129, + 1401, + 1157, + 1375, + 1157 + ], + "score": 0.764 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.743 + }, + { + "category_id": 8, + "poly": [ + 628, + 1076, + 763, + 1076, + 763, + 1118, + 628, + 1118 + ], + "score": 0.718 + }, + { + "category_id": 14, + "poly": [ + 531, + 877, + 1166, + 877, + 1166, + 1121, + 531, + 1121 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { \\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } ) = \\underset { ( \\gamma _ { 1 } , \\ldots , \\gamma _ { d } ) \\sim \\Gamma _ { n } } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } \\frac { \\sigma ^ { 2 } } { \\gamma _ { i } ^ { 2 } + d \\sigma ^ { 2 } / | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } \\right] + \\sigma ^ { 2 } } \\\\ & { \\qquad \\quad \\overset { \\mathbb { E } } { \\ge } \\underset { ( \\widetilde { \\gamma } _ { 1 } , \\ldots , \\widetilde { \\gamma } _ { d } ) \\sim \\Gamma _ { n + 1 } } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } \\frac { \\sigma ^ { 2 } } { \\widetilde { \\gamma } _ { i } ^ { 2 } + d \\sigma ^ { 2 } / | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } \\right] + \\sigma ^ { 2 } } \\\\ & { \\qquad = \\overline { { R } } ( \\hat { \\beta } _ { n + 1 } ^ { \\mathrm { o p t } } ) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 545, + 364, + 1155, + 364, + 1155, + 462, + 545, + 462 + ], + "score": 0.94, + "latex": "\\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } ) = \\operatorname * { l } _ { ( \\gamma _ { 1 } , \\ldots \\gamma _ { d } ) \\sim \\Gamma _ { n } } \\left[ \\sum _ { i = 1 } ^ { d } \\frac { \\sigma ^ { 2 } } { \\gamma _ { i } ^ { 2 } + d \\sigma ^ { 2 } / | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } \\right] + \\sigma ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 371, + 1424, + 507, + 1424, + 507, + 1475, + 371, + 1475 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\lambda ^ { * } = \\frac { d \\sigma ^ { 2 } } { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 655, + 1847, + 757, + 1847, + 757, + 1883, + 655, + 1883 + ], + "score": 0.93, + "latex": "\\bar { \\mathcal { N } } ( 0 , I _ { p } )" + }, + { + "category_id": 13, + "poly": [ + 980, + 1912, + 1056, + 1912, + 1056, + 1944, + 980, + 1944 + ], + "score": 0.93, + "latex": "d \\leq p" + }, + { + "category_id": 13, + "poly": [ + 298, + 1880, + 467, + 1880, + 467, + 1914, + 298, + 1914 + ], + "score": 0.92, + "latex": "\\varepsilon \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 297, + 685, + 613, + 685, + 613, + 725, + 297, + 725 + ], + "score": 0.92, + "latex": "\\gamma _ { i - 1 } ( X ) \\geq \\gamma _ { i } ( { \\widetilde { X } } ) \\geq \\gamma _ { i } ( X )" + }, + { + "category_id": 13, + "poly": [ + 1257, + 775, + 1344, + 775, + 1344, + 805, + 1257, + 805 + ], + "score": 0.92, + "latex": "\\widetilde { \\gamma } _ { i } \\geq \\gamma _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1151, + 1972, + 1216, + 1972, + 1216, + 2005, + 1151, + 2005 + ], + "score": 0.92, + "latex": "( \\widetilde { x } , y )" + }, + { + "category_id": 13, + "poly": [ + 501, + 1940, + 627, + 1940, + 627, + 1970, + 501, + 1970 + ], + "score": 0.92, + "latex": "P \\in \\mathbb { R } ^ { d \\times p }" + }, + { + "category_id": 13, + "poly": [ + 299, + 304, + 369, + 304, + 369, + 354, + 299, + 354 + ], + "score": 0.92, + "latex": "\\frac { d \\sigma ^ { 2 } } { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } }" + }, + { + "category_id": 13, + "poly": [ + 581, + 577, + 768, + 577, + 768, + 612, + 581, + 612 + ], + "score": 0.92, + "latex": "\\widetilde { X } \\ \\in \\ \\mathbb { R } ^ { ( n + 1 ) \\times d }" + }, + { + "category_id": 13, + "poly": [ + 334, + 1971, + 542, + 1971, + 542, + 2006, + 334, + 2006 + ], + "score": 0.92, + "latex": "( \\widetilde { x } _ { i } , y _ { i } ) \\in \\mathbb { R } ^ { d } \\times \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 1207, + 1881, + 1356, + 1881, + 1356, + 1916, + 1207, + 1916 + ], + "score": 0.92, + "latex": "\\{ ( x _ { i } , y _ { i } ) \\} _ { i = 1 } ^ { n }" + }, + { + "category_id": 13, + "poly": [ + 908, + 2004, + 977, + 2004, + 977, + 2035, + 908, + 2035 + ], + "score": 0.91, + "latex": "d \\leq p" + }, + { + "category_id": 13, + "poly": [ + 1062, + 1818, + 1139, + 1818, + 1139, + 1849, + 1062, + 1849 + ], + "score": 0.91, + "latex": "d \\leq p" + }, + { + "category_id": 13, + "poly": [ + 826, + 581, + 967, + 581, + 967, + 612, + 826, + 612 + ], + "score": 0.91, + "latex": "\\boldsymbol { X } \\in \\mathbb { R } ^ { n \\times d }" + }, + { + "category_id": 13, + "poly": [ + 1168, + 745, + 1231, + 745, + 1231, + 776, + 1168, + 776 + ], + "score": 0.91, + "latex": "\\Gamma _ { n + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1159, + 1848, + 1341, + 1848, + 1341, + 1880, + 1159, + 1880 + ], + "score": 0.91, + "latex": "y = \\langle x , \\theta \\rangle + \\varepsilon" + }, + { + "category_id": 13, + "poly": [ + 629, + 1973, + 743, + 1973, + 743, + 2003, + 629, + 2003 + ], + "score": 0.91, + "latex": "\\widetilde { x _ { i } } = P x _ { i }" + }, + { + "category_id": 13, + "poly": [ + 691, + 690, + 747, + 690, + 747, + 724, + 691, + 724 + ], + "score": 0.91, + "latex": "\\gamma _ { i } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 340, + 1848, + 438, + 1848, + 438, + 1876, + 340, + 1876 + ], + "score": 0.91, + "latex": "x \\in \\mathbb { R } ^ { p }" + }, + { + "category_id": 13, + "poly": [ + 872, + 1881, + 968, + 1881, + 968, + 1910, + 872, + 1910 + ], + "score": 0.91, + "latex": "\\theta \\in \\mathbb { R } ^ { p }" + }, + { + "category_id": 13, + "poly": [ + 486, + 803, + 682, + 803, + 682, + 837, + 486, + 837 + ], + "score": 0.91, + "latex": "( \\{ \\widetilde { \\gamma } _ { i } \\} , \\{ \\gamma _ { i } \\} ) \\sim \\Pi" + }, + { + "category_id": 14, + "poly": [ + 647, + 1369, + 1056, + 1369, + 1056, + 1412, + 647, + 1412 + ], + "score": 0.9, + "latex": "\\forall \\lambda \\geq \\lambda ^ { * } : \\quad \\overline { { { R } } } ( \\widehat { \\beta } _ { n + 1 , \\lambda } ) \\leq \\overline { { { R } } } ( \\widehat { \\beta } _ { n , \\lambda } )" + }, + { + "category_id": 13, + "poly": [ + 711, + 775, + 777, + 775, + 777, + 803, + 711, + 803 + ], + "score": 0.9, + "latex": "n + 1" + }, + { + "category_id": 13, + "poly": [ + 568, + 1325, + 909, + 1325, + 909, + 1357, + 568, + 1357 + ], + "score": 0.9, + "latex": "d \\in \\mathbb { N } , n \\in \\mathbb { N } , \\sigma > 0 , \\beta ^ { * } \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 1132, + 649, + 1160, + 649, + 1160, + 682, + 1132, + 682 + ], + "score": 0.88, + "latex": "\\widetilde { X }" + }, + { + "category_id": 13, + "poly": [ + 1284, + 745, + 1319, + 745, + 1319, + 774, + 1284, + 774 + ], + "score": 0.86, + "latex": "\\Gamma _ { n }" + }, + { + "category_id": 13, + "poly": [ + 446, + 737, + 475, + 737, + 475, + 771, + 446, + 771 + ], + "score": 0.86, + "latex": "\\widetilde { X }" + }, + { + "category_id": 13, + "poly": [ + 529, + 613, + 557, + 613, + 557, + 646, + 529, + 646 + ], + "score": 0.86, + "latex": "\\widetilde { X }" + }, + { + "category_id": 13, + "poly": [ + 1323, + 270, + 1404, + 270, + 1404, + 306, + 1323, + 306 + ], + "score": 0.85, + "latex": "\\lambda _ { n } ^ { \\mathrm { o p t } } =" + }, + { + "category_id": 13, + "poly": [ + 1051, + 838, + 1077, + 838, + 1077, + 867, + 1051, + 867 + ], + "score": 0.85, + "latex": "\\gamma _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1046, + 654, + 1076, + 654, + 1076, + 682, + 1046, + 682 + ], + "score": 0.83, + "latex": "X" + }, + { + "category_id": 13, + "poly": [ + 528, + 744, + 556, + 744, + 556, + 771, + 528, + 771 + ], + "score": 0.82, + "latex": "X" + }, + { + "category_id": 13, + "poly": [ + 469, + 2009, + 487, + 2009, + 487, + 2035, + 469, + 2035 + ], + "score": 0.81, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 1239, + 1789, + 1257, + 1789, + 1257, + 1815, + 1239, + 1815 + ], + "score": 0.79, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 1185, + 1762, + 1203, + 1762, + 1203, + 1788, + 1185, + 1788 + ], + "score": 0.79, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 828, + 779, + 848, + 779, + 848, + 801, + 828, + 801 + ], + "score": 0.78, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1256, + 1974, + 1281, + 1974, + 1281, + 2000, + 1256, + 2000 + ], + "score": 0.77, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 1308, + 232, + 1327, + 232, + 1327, + 258, + 1308, + 258 + ], + "score": 0.77, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1381, + 1195, + 1401, + 1195, + 1401, + 1221, + 1381, + 1221 + ], + "score": 0.75, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 817, + 692, + 830, + 692, + 830, + 718, + 817, + 718 + ], + "score": 0.74, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1064, + 1888, + 1085, + 1888, + 1085, + 1909, + 1064, + 1909 + ], + "score": 0.71, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1286, + 279, + 1305, + 279, + 1305, + 302, + 1286, + 302 + ], + "score": 0.63, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 850, + 744, + 875, + 744, + 875, + 771, + 850, + 771 + ], + "score": 0.62, + "latex": "\\Pi" + }, + { + "category_id": 13, + "poly": [ + 1350, + 654, + 1382, + 654, + 1382, + 683, + 1350, + 683 + ], + "score": 0.54, + "latex": "\\forall i" + }, + { + "category_id": 13, + "poly": [ + 819, + 1297, + 834, + 1297, + 834, + 1322, + 819, + 1322 + ], + "score": 0.5, + "latex": "I" + }, + { + "category_id": 13, + "poly": [ + 499, + 585, + 515, + 585, + 515, + 611, + 499, + 611 + ], + "score": 0.33, + "latex": "^ { l }" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1577.0, + 1123.0, + 1577.0, + 1123.0, + 1622.0, + 291.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 815.0, + 72.0, + 815.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1379.0, + 1510.0, + 1402.0, + 1510.0, + 1402.0, + 1533.0, + 1379.0, + 1533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1379.0, + 1134.0, + 1401.0, + 1134.0, + 1401.0, + 1155.0, + 1379.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2119.0, + 838.0, + 2119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1753.0, + 1184.0, + 1753.0, + 1184.0, + 1792.0, + 295.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1204.0, + 1753.0, + 1403.0, + 1753.0, + 1403.0, + 1792.0, + 1204.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1788.0, + 1238.0, + 1788.0, + 1238.0, + 1821.0, + 295.0, + 1821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1258.0, + 1788.0, + 1403.0, + 1788.0, + 1403.0, + 1821.0, + 1258.0, + 1821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1817.0, + 1061.0, + 1817.0, + 1061.0, + 1854.0, + 294.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 1817.0, + 1403.0, + 1817.0, + 1403.0, + 1854.0, + 1140.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1845.0, + 339.0, + 1845.0, + 339.0, + 1886.0, + 293.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 1845.0, + 654.0, + 1845.0, + 654.0, + 1886.0, + 439.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 758.0, + 1845.0, + 1158.0, + 1845.0, + 1158.0, + 1886.0, + 758.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1342.0, + 1845.0, + 1406.0, + 1845.0, + 1406.0, + 1886.0, + 1342.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1875.0, + 297.0, + 1875.0, + 297.0, + 1924.0, + 289.0, + 1924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 468.0, + 1875.0, + 871.0, + 1875.0, + 871.0, + 1924.0, + 468.0, + 1924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 969.0, + 1875.0, + 1063.0, + 1875.0, + 1063.0, + 1924.0, + 969.0, + 1924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1086.0, + 1875.0, + 1206.0, + 1875.0, + 1206.0, + 1924.0, + 1086.0, + 1924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1357.0, + 1875.0, + 1408.0, + 1875.0, + 1408.0, + 1924.0, + 1357.0, + 1924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1910.0, + 979.0, + 1910.0, + 979.0, + 1947.0, + 294.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1057.0, + 1910.0, + 1405.0, + 1910.0, + 1405.0, + 1947.0, + 1057.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1937.0, + 500.0, + 1937.0, + 500.0, + 1979.0, + 293.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 1937.0, + 1405.0, + 1937.0, + 1405.0, + 1979.0, + 628.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1968.0, + 333.0, + 1968.0, + 333.0, + 2010.0, + 294.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 543.0, + 1968.0, + 628.0, + 1968.0, + 628.0, + 2010.0, + 543.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 744.0, + 1968.0, + 1150.0, + 1968.0, + 1150.0, + 2010.0, + 744.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1968.0, + 1255.0, + 1968.0, + 1255.0, + 2010.0, + 1217.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1282.0, + 1968.0, + 1406.0, + 1968.0, + 1406.0, + 2010.0, + 1282.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2001.0, + 468.0, + 2001.0, + 468.0, + 2037.0, + 295.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 488.0, + 2001.0, + 907.0, + 2001.0, + 907.0, + 2037.0, + 488.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 978.0, + 2001.0, + 1352.0, + 2001.0, + 1352.0, + 2037.0, + 978.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1646.0, + 1404.0, + 1646.0, + 1404.0, + 1684.0, + 293.0, + 1684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1678.0, + 1405.0, + 1678.0, + 1405.0, + 1713.0, + 293.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1711.0, + 478.0, + 1711.0, + 478.0, + 1740.0, + 294.0, + 1740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 740.0, + 445.0, + 740.0, + 445.0, + 779.0, + 292.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 476.0, + 740.0, + 527.0, + 740.0, + 527.0, + 779.0, + 476.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 557.0, + 740.0, + 849.0, + 740.0, + 849.0, + 779.0, + 557.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 740.0, + 1167.0, + 740.0, + 1167.0, + 779.0, + 876.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1232.0, + 740.0, + 1283.0, + 740.0, + 1283.0, + 779.0, + 1232.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1320.0, + 740.0, + 1405.0, + 740.0, + 1405.0, + 779.0, + 1320.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 772.0, + 710.0, + 772.0, + 710.0, + 807.0, + 292.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 772.0, + 827.0, + 772.0, + 827.0, + 807.0, + 778.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 849.0, + 772.0, + 1256.0, + 772.0, + 1256.0, + 807.0, + 849.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1345.0, + 772.0, + 1405.0, + 772.0, + 1405.0, + 807.0, + 1345.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 802.0, + 485.0, + 802.0, + 485.0, + 839.0, + 293.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 802.0, + 1404.0, + 802.0, + 1404.0, + 839.0, + 683.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 835.0, + 1050.0, + 835.0, + 1050.0, + 869.0, + 294.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 835.0, + 1160.0, + 835.0, + 1160.0, + 869.0, + 1078.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 572.0, + 498.0, + 572.0, + 498.0, + 623.0, + 290.0, + 623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 572.0, + 580.0, + 572.0, + 580.0, + 623.0, + 516.0, + 623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 572.0, + 825.0, + 572.0, + 825.0, + 623.0, + 769.0, + 623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 968.0, + 572.0, + 1407.0, + 572.0, + 1407.0, + 623.0, + 968.0, + 623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 616.0, + 528.0, + 616.0, + 528.0, + 652.0, + 295.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 558.0, + 616.0, + 1405.0, + 616.0, + 1405.0, + 652.0, + 558.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 652.0, + 1045.0, + 652.0, + 1045.0, + 688.0, + 294.0, + 688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 652.0, + 1131.0, + 652.0, + 1131.0, + 688.0, + 1077.0, + 688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1161.0, + 652.0, + 1349.0, + 652.0, + 1349.0, + 688.0, + 1161.0, + 688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1383.0, + 652.0, + 1406.0, + 652.0, + 1406.0, + 688.0, + 1383.0, + 688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 688.0, + 690.0, + 688.0, + 690.0, + 727.0, + 614.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 748.0, + 688.0, + 816.0, + 688.0, + 816.0, + 727.0, + 748.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 688.0, + 1036.0, + 688.0, + 1036.0, + 727.0, + 831.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1191.0, + 1380.0, + 1191.0, + 1380.0, + 1229.0, + 294.0, + 1229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1224.0, + 1404.0, + 1224.0, + 1404.0, + 1258.0, + 294.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1252.0, + 408.0, + 1252.0, + 408.0, + 1292.0, + 292.0, + 1292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 482.0, + 1405.0, + 482.0, + 1405.0, + 524.0, + 293.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 516.0, + 435.0, + 516.0, + 435.0, + 549.0, + 296.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1293.0, + 818.0, + 1293.0, + 818.0, + 1329.0, + 297.0, + 1329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1293.0, + 1405.0, + 1293.0, + 1405.0, + 1329.0, + 835.0, + 1329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1324.0, + 567.0, + 1324.0, + 567.0, + 1359.0, + 294.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 910.0, + 1324.0, + 1140.0, + 1324.0, + 1140.0, + 1359.0, + 910.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1502.0, + 555.0, + 1502.0, + 555.0, + 1541.0, + 294.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1431.0, + 370.0, + 1431.0, + 370.0, + 1462.0, + 294.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 508.0, + 1439.0, + 523.0, + 1439.0, + 523.0, + 1482.0, + 508.0, + 1482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 444.0, + 1420.5, + 502.0, + 1420.5, + 502.0, + 1452.5, + 444.0, + 1452.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 227.0, + 1307.0, + 227.0, + 1307.0, + 265.0, + 293.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1328.0, + 227.0, + 1338.0, + 227.0, + 1338.0, + 265.0, + 1328.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 267.0, + 1285.0, + 267.0, + 1285.0, + 314.0, + 287.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 267.0, + 1322.0, + 267.0, + 1322.0, + 314.0, + 1306.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 301.0, + 298.0, + 301.0, + 298.0, + 362.0, + 295.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 301.0, + 1027.0, + 301.0, + 1027.0, + 362.0, + 370.0, + 362.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1194, + 1405, + 1194, + 1405, + 1472, + 297, + 1472 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1057, + 1404, + 1057, + 1404, + 1181, + 298, + 1181 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 296, + 225, + 1405, + 225, + 1405, + 410, + 296, + 410 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 619, + 1405, + 619, + 1405, + 763, + 298, + 763 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1592, + 1404, + 1592, + 1404, + 1716, + 298, + 1716 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 298, + 1730, + 1403, + 1730, + 1403, + 1856, + 298, + 1856 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 297, + 1486, + 1405, + 1486, + 1405, + 1580, + 297, + 1580 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 298, + 1861, + 1403, + 1861, + 1403, + 1959, + 298, + 1959 + ], + "score": 0.961 + }, + { + "category_id": 8, + "poly": [ + 662, + 418, + 1039, + 418, + 1039, + 483, + 662, + 483 + ], + "score": 0.954 + }, + { + "category_id": 8, + "poly": [ + 735, + 843, + 964, + 843, + 964, + 892, + 735, + 892 + ], + "score": 0.943 + }, + { + "category_id": 1, + "poly": [ + 295, + 770, + 1403, + 770, + 1403, + 833, + 295, + 833 + ], + "score": 0.943 + }, + { + "category_id": 8, + "poly": [ + 487, + 538, + 1214, + 538, + 1214, + 598, + 487, + 598 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 297, + 495, + 1167, + 495, + 1167, + 529, + 297, + 529 + ], + "score": 0.932 + }, + { + "category_id": 1, + "poly": [ + 295, + 912, + 1286, + 912, + 1286, + 948, + 295, + 948 + ], + "score": 0.929 + }, + { + "category_id": 2, + "poly": [ + 298, + 1977, + 1406, + 1977, + 1406, + 2035, + 298, + 2035 + ], + "score": 0.921 + }, + { + "category_id": 0, + "poly": [ + 298, + 988, + 932, + 988, + 932, + 1025, + 298, + 1025 + ], + "score": 0.913 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 813, + 75, + 813, + 105, + 299, + 105 + ], + "score": 0.911 + }, + { + "category_id": 9, + "poly": [ + 1366, + 549, + 1400, + 549, + 1400, + 580, + 1366, + 580 + ], + "score": 0.887 + }, + { + "category_id": 9, + "poly": [ + 1365, + 426, + 1401, + 426, + 1401, + 457, + 1365, + 457 + ], + "score": 0.876 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2112, + 840, + 2112 + ], + "score": 0.803 + }, + { + "category_id": 14, + "poly": [ + 660, + 415, + 1040, + 415, + 1040, + 484, + 660, + 484 + ], + "score": 0.93, + "latex": "\\overline { { R } } ( \\hat { \\beta } ) : = \\operatorname * { \\mathbb { E } } _ { P } \\operatorname * { \\mathbb { E } } _ { \\tilde { X } , \\vec { y } \\sim \\mathcal { D } ^ { n } } [ R _ { P } ( \\hat { \\beta } ( \\tilde { X } , \\vec { y } ) ]" + }, + { + "category_id": 13, + "poly": [ + 833, + 225, + 1010, + 225, + 1010, + 268, + 833, + 268 + ], + "score": 0.93, + "latex": "f _ { \\hat { \\beta } } ( \\tilde { x } ) = \\langle \\tilde { x } , \\hat { \\beta } \\rangle" + }, + { + "category_id": 13, + "poly": [ + 839, + 1348, + 1016, + 1348, + 1016, + 1382, + 839, + 1382 + ], + "score": 0.93, + "latex": "( x , y ) = ( { \\vec { e } } _ { 1 } , 1 )" + }, + { + "category_id": 13, + "poly": [ + 521, + 1792, + 700, + 1792, + 700, + 1826, + 521, + 1826 + ], + "score": 0.93, + "latex": "( x , y ) = ( \\vec { e } _ { 1 } , 1 )" + }, + { + "category_id": 13, + "poly": [ + 946, + 1861, + 1122, + 1861, + 1122, + 1895, + 946, + 1895 + ], + "score": 0.93, + "latex": "x \\in \\mathbb { R } ^ { 2 } , y \\in \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 1114, + 1409, + 1239, + 1409, + 1239, + 1443, + 1114, + 1443 + ], + "score": 0.93, + "latex": "\\beta ^ { * } = [ 1 , 0 ]" + }, + { + "category_id": 13, + "poly": [ + 636, + 342, + 728, + 342, + 728, + 381, + 636, + 381 + ], + "score": 0.93, + "latex": "\\hat { \\beta } ( \\widetilde { X } , \\vec { y } )" + }, + { + "category_id": 13, + "poly": [ + 869, + 1792, + 1083, + 1792, + 1083, + 1826, + 869, + 1826 + ], + "score": 0.92, + "latex": "( x , y ) = ( \\vec { e } _ { 2 } , \\pm 2 0 )" + }, + { + "category_id": 13, + "poly": [ + 633, + 267, + 1030, + 267, + 1030, + 309, + 633, + 309 + ], + "score": 0.92, + "latex": "R _ { P } ( \\hat { \\beta } ) : = \\mathbb { E } _ { ( \\tilde { x } , y ) \\sim \\mathcal { D } } [ ( \\langle \\tilde { x } , \\hat { \\beta } \\rangle - y ) ^ { 2 } ]" + }, + { + "category_id": 13, + "poly": [ + 1214, + 272, + 1296, + 272, + 1296, + 306, + 1214, + 306 + ], + "score": 0.92, + "latex": "( x _ { i } , y _ { i } )" + }, + { + "category_id": 13, + "poly": [ + 949, + 654, + 996, + 654, + 996, + 694, + 949, + 694 + ], + "score": 0.92, + "latex": "\\hat { \\beta } _ { d } ^ { \\mathrm { { o p t } } }" + }, + { + "category_id": 13, + "poly": [ + 565, + 654, + 890, + 654, + 890, + 695, + 565, + 695 + ], + "score": 0.92, + "latex": "\\lambda _ { d } ^ { \\mathrm { o p t } } : = \\mathrm { a r g m i n } _ { \\lambda \\ge 0 } \\overline { { R } } ( \\hat { \\beta } _ { d , \\lambda } ) )" + }, + { + "category_id": 13, + "poly": [ + 1225, + 312, + 1321, + 312, + 1321, + 345, + 1225, + 345 + ], + "score": 0.92, + "latex": "\\vec { y } \\in \\mathbb R ^ { n }" + }, + { + "category_id": 14, + "poly": [ + 488, + 538, + 1216, + 538, + 1216, + 604, + 488, + 604 + ], + "score": 0.92, + "latex": "\\hat { \\beta } _ { d , \\lambda } : = \\underset { \\beta } { \\mathrm { a r g m i n } } | | \\widetilde { X } \\beta - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda | | \\beta | | _ { 2 } ^ { 2 } = ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I _ { d } ) ^ { - 1 } \\widetilde { X } ^ { T } \\vec { y }" + }, + { + "category_id": 13, + "poly": [ + 744, + 1548, + 824, + 1548, + 824, + 1578, + 744, + 1578 + ], + "score": 0.92, + "latex": "x = \\vec { e } _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1305, + 1348, + 1404, + 1348, + 1404, + 1381, + 1305, + 1381 + ], + "score": 0.91, + "latex": "( x , y ) =" + }, + { + "category_id": 13, + "poly": [ + 983, + 1197, + 1048, + 1197, + 1048, + 1230, + 983, + 1230 + ], + "score": 0.91, + "latex": "( x , y )" + }, + { + "category_id": 13, + "poly": [ + 1233, + 1898, + 1305, + 1898, + 1305, + 1931, + 1233, + 1931 + ], + "score": 0.91, + "latex": "( X , { \\vec { y } } )" + }, + { + "category_id": 13, + "poly": [ + 836, + 1862, + 901, + 1862, + 901, + 1896, + 836, + 1896 + ], + "score": 0.91, + "latex": "( x , y )" + }, + { + "category_id": 13, + "poly": [ + 343, + 619, + 388, + 619, + 388, + 657, + 343, + 657 + ], + "score": 0.91, + "latex": "\\lambda _ { d } ^ { \\mathrm { o p t } }" + }, + { + "category_id": 13, + "poly": [ + 1259, + 1517, + 1339, + 1517, + 1339, + 1547, + 1259, + 1547 + ], + "score": 0.91, + "latex": "x = \\vec { e } _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 299, + 1379, + 408, + 1379, + 408, + 1411, + 299, + 1411 + ], + "score": 0.91, + "latex": "( \\vec { e } _ { 2 } , \\pm 1 0 )" + }, + { + "category_id": 13, + "poly": [ + 584, + 1319, + 649, + 1319, + 649, + 1351, + 584, + 1351 + ], + "score": 0.91, + "latex": "( x , y )" + }, + { + "category_id": 13, + "poly": [ + 609, + 1288, + 681, + 1288, + 681, + 1319, + 609, + 1319 + ], + "score": 0.91, + "latex": "( X , { \\vec { y } } )" + }, + { + "category_id": 13, + "poly": [ + 340, + 695, + 385, + 695, + 385, + 734, + 340, + 734 + ], + "score": 0.91, + "latex": "\\lambda _ { d } ^ { \\mathrm { o p t } }" + }, + { + "category_id": 13, + "poly": [ + 476, + 695, + 951, + 695, + 951, + 735, + 476, + 735 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\hat { \\beta } _ { d } ^ { \\mathrm { o p t } } : = \\operatorname * { a r g m i n } _ { \\beta } | | \\widetilde { X } \\beta - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda _ { d } ^ { \\mathrm { o p t } } | | \\beta | | _ { 2 } ^ { 2 } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 734, + 844, + 963, + 844, + 963, + 890, + 734, + 890 + ], + "score": 0.9, + "latex": "\\overline { { R } } ( \\hat { \\beta } _ { d + 1 } ^ { \\mathrm { o p t } } ) \\leq \\overline { { R } } ( \\hat { \\beta } _ { d } ^ { \\mathrm { o p t } } )" + }, + { + "category_id": 13, + "poly": [ + 1155, + 1517, + 1220, + 1517, + 1220, + 1549, + 1155, + 1549 + ], + "score": 0.9, + "latex": "( x , y )" + }, + { + "category_id": 13, + "poly": [ + 418, + 1893, + 464, + 1893, + 464, + 1930, + 418, + 1930 + ], + "score": 0.9, + "latex": "\\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } }" + }, + { + "category_id": 13, + "poly": [ + 1011, + 497, + 1081, + 497, + 1081, + 525, + 1011, + 525 + ], + "score": 0.9, + "latex": "\\lambda > 0" + }, + { + "category_id": 13, + "poly": [ + 1166, + 1228, + 1239, + 1228, + 1239, + 1255, + 1166, + 1255 + ], + "score": 0.9, + "latex": "n = 1" + }, + { + "category_id": 13, + "poly": [ + 343, + 1488, + 416, + 1488, + 416, + 1515, + 343, + 1515 + ], + "score": 0.9, + "latex": "n = 1" + }, + { + "category_id": 13, + "poly": [ + 684, + 1319, + 757, + 1319, + 757, + 1346, + 684, + 1346 + ], + "score": 0.9, + "latex": "d = 2" + }, + { + "category_id": 13, + "poly": [ + 822, + 1089, + 891, + 1089, + 891, + 1117, + 822, + 1117 + ], + "score": 0.9, + "latex": "d = 2" + }, + { + "category_id": 13, + "poly": [ + 595, + 308, + 841, + 308, + 841, + 341, + 595, + 341 + ], + "score": 0.9, + "latex": "\\widetilde { X } \\ = X P ^ { T } \\ \\in \\ \\mathbb { R } ^ { n \\times d }" + }, + { + "category_id": 13, + "poly": [ + 869, + 1409, + 1072, + 1409, + 1072, + 1443, + 869, + 1443 + ], + "score": 0.9, + "latex": ": \\mathbb { E } [ y | x ] = \\langle \\beta ^ { * } , x \\rangle" + }, + { + "category_id": 13, + "poly": [ + 747, + 801, + 1150, + 801, + 1150, + 833, + 747, + 833 + ], + "score": 0.89, + "latex": "p \\in \\mathbb { N } , \\theta \\in \\mathbb { R } ^ { p } , d \\leq p , n \\in \\mathbb { N } , \\sigma > 0" + }, + { + "category_id": 13, + "poly": [ + 636, + 1548, + 706, + 1548, + 706, + 1576, + 636, + 1576 + ], + "score": 0.89, + "latex": "\\lambda = 0" + }, + { + "category_id": 13, + "poly": [ + 784, + 1228, + 857, + 1228, + 857, + 1255, + 784, + 1255 + ], + "score": 0.89, + "latex": "n = 2" + }, + { + "category_id": 13, + "poly": [ + 342, + 1595, + 414, + 1595, + 414, + 1622, + 342, + 1622 + ], + "score": 0.89, + "latex": "n = 2" + }, + { + "category_id": 13, + "poly": [ + 297, + 2005, + 355, + 2005, + 355, + 2034, + 297, + 2034 + ], + "score": 0.89, + "latex": "X , y )" + }, + { + "category_id": 13, + "poly": [ + 297, + 310, + 364, + 310, + 364, + 340, + 297, + 340 + ], + "score": 0.89, + "latex": "\\mathbb { R } ^ { n \\times p }" + }, + { + "category_id": 13, + "poly": [ + 1166, + 1550, + 1249, + 1550, + 1249, + 1575, + 1166, + 1575 + ], + "score": 0.88, + "latex": "\\lambda = \\infty" + }, + { + "category_id": 13, + "poly": [ + 1331, + 1762, + 1391, + 1762, + 1391, + 1794, + 1331, + 1794 + ], + "score": 0.87, + "latex": "X , y )" + }, + { + "category_id": 13, + "poly": [ + 601, + 1380, + 655, + 1380, + 655, + 1408, + 601, + 1408 + ], + "score": 0.86, + "latex": "\\pm 1 0" + }, + { + "category_id": 13, + "poly": [ + 795, + 1286, + 825, + 1286, + 825, + 1315, + 795, + 1315 + ], + "score": 0.86, + "latex": "n ^ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1345, + 272, + 1404, + 272, + 1404, + 304, + 1345, + 304 + ], + "score": 0.85, + "latex": "X \\in" + }, + { + "category_id": 13, + "poly": [ + 569, + 734, + 596, + 734, + 596, + 761, + 569, + 761 + ], + "score": 0.83, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 705, + 1593, + 750, + 1593, + 750, + 1626, + 705, + 1626 + ], + "score": 0.81, + "latex": "1 / 2" + }, + { + "category_id": 13, + "poly": [ + 685, + 1763, + 705, + 1763, + 705, + 1789, + 685, + 1789 + ], + "score": 0.81, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1137, + 1979, + 1155, + 1979, + 1155, + 2003, + 1137, + 2003 + ], + "score": 0.8, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 723, + 1627, + 743, + 1627, + 743, + 1651, + 723, + 1651 + ], + "score": 0.8, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 428, + 232, + 453, + 232, + 453, + 258, + 428, + 258 + ], + "score": 0.79, + "latex": "P" + }, + { + "category_id": 13, + "poly": [ + 1112, + 1259, + 1131, + 1259, + 1131, + 1285, + 1112, + 1285 + ], + "score": 0.79, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1040, + 1488, + 1060, + 1488, + 1060, + 1514, + 1040, + 1514 + ], + "score": 0.79, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1157, + 1488, + 1177, + 1488, + 1177, + 1514, + 1157, + 1514 + ], + "score": 0.79, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 747, + 1864, + 773, + 1864, + 773, + 1890, + 747, + 1890 + ], + "score": 0.78, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 348, + 661, + 366, + 661, + 366, + 687, + 348, + 687 + ], + "score": 0.78, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 1091, + 277, + 1112, + 277, + 1112, + 301, + 1091, + 301 + ], + "score": 0.76, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1369, + 1900, + 1392, + 1900, + 1392, + 1926, + 1369, + 1926 + ], + "score": 0.76, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 1180, + 237, + 1199, + 237, + 1199, + 263, + 1180, + 263 + ], + "score": 0.75, + "latex": "y" + }, + { + "category_id": 13, + "poly": [ + 433, + 665, + 454, + 665, + 454, + 687, + 433, + 687 + ], + "score": 0.74, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1301, + 1984, + 1319, + 1984, + 1319, + 2003, + 1301, + 2003 + ], + "score": 0.74, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1033, + 1768, + 1053, + 1768, + 1053, + 1789, + 1033, + 1789 + ], + "score": 0.69, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 552, + 802, + 571, + 802, + 571, + 828, + 552, + 828 + ], + "score": 0.53, + "latex": "d ." + }, + { + "category_id": 13, + "poly": [ + 849, + 1413, + 869, + 1413, + 869, + 1437, + 849, + 1437 + ], + "score": 0.39, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 1207, + 1349, + 1244, + 1349, + 1244, + 1377, + 1207, + 1377 + ], + "score": 0.31, + "latex": "1 / 2" + }, + { + "category_id": 13, + "poly": [ + 1111, + 1906, + 1130, + 1906, + 1130, + 1926, + 1111, + 1926 + ], + "score": 0.25, + "latex": "n" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1969.0, + 1136.0, + 1969.0, + 1136.0, + 2013.0, + 330.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 1969.0, + 1300.0, + 1969.0, + 1300.0, + 2013.0, + 1156.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1320.0, + 1969.0, + 1406.0, + 1969.0, + 1406.0, + 2013.0, + 1320.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1997.0, + 296.0, + 1997.0, + 296.0, + 2042.0, + 290.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 1997.0, + 371.0, + 1997.0, + 371.0, + 2042.0, + 356.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 986.0, + 934.0, + 986.0, + 934.0, + 1031.0, + 292.0, + 1031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 815.0, + 73.0, + 815.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2116.0, + 840.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1195.0, + 982.0, + 1195.0, + 982.0, + 1232.0, + 297.0, + 1232.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 1195.0, + 1407.0, + 1195.0, + 1407.0, + 1232.0, + 1049.0, + 1232.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1227.0, + 783.0, + 1227.0, + 783.0, + 1261.0, + 294.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 1227.0, + 1165.0, + 1227.0, + 1165.0, + 1261.0, + 858.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1240.0, + 1227.0, + 1406.0, + 1227.0, + 1406.0, + 1261.0, + 1240.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1258.0, + 1111.0, + 1258.0, + 1111.0, + 1291.0, + 295.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1132.0, + 1258.0, + 1405.0, + 1258.0, + 1405.0, + 1291.0, + 1132.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1286.0, + 608.0, + 1286.0, + 608.0, + 1322.0, + 295.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 1286.0, + 794.0, + 1286.0, + 794.0, + 1322.0, + 682.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 826.0, + 1286.0, + 1405.0, + 1286.0, + 1405.0, + 1322.0, + 826.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1316.0, + 583.0, + 1316.0, + 583.0, + 1353.0, + 294.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 650.0, + 1316.0, + 683.0, + 1316.0, + 683.0, + 1353.0, + 650.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 758.0, + 1316.0, + 1407.0, + 1316.0, + 1407.0, + 1353.0, + 758.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1347.0, + 838.0, + 1347.0, + 838.0, + 1384.0, + 295.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 1347.0, + 1206.0, + 1347.0, + 1206.0, + 1384.0, + 1017.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1245.0, + 1347.0, + 1304.0, + 1347.0, + 1304.0, + 1384.0, + 1245.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1376.0, + 298.0, + 1376.0, + 298.0, + 1413.0, + 295.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 409.0, + 1376.0, + 600.0, + 1376.0, + 600.0, + 1413.0, + 409.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 656.0, + 1376.0, + 1405.0, + 1376.0, + 1405.0, + 1413.0, + 656.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1408.0, + 848.0, + 1408.0, + 848.0, + 1446.0, + 291.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1073.0, + 1408.0, + 1113.0, + 1408.0, + 1113.0, + 1446.0, + 1073.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1240.0, + 1408.0, + 1406.0, + 1408.0, + 1406.0, + 1446.0, + 1240.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1441.0, + 570.0, + 1441.0, + 570.0, + 1473.0, + 295.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1056.0, + 1405.0, + 1056.0, + 1405.0, + 1093.0, + 292.0, + 1093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1090.0, + 821.0, + 1090.0, + 821.0, + 1123.0, + 294.0, + 1123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 1090.0, + 1405.0, + 1090.0, + 1405.0, + 1123.0, + 892.0, + 1123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1120.0, + 1404.0, + 1120.0, + 1404.0, + 1153.0, + 294.0, + 1153.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1151.0, + 835.0, + 1151.0, + 835.0, + 1183.0, + 294.0, + 1183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 427.0, + 227.0, + 427.0, + 267.0, + 294.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 227.0, + 832.0, + 227.0, + 832.0, + 267.0, + 454.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1011.0, + 227.0, + 1179.0, + 227.0, + 1179.0, + 267.0, + 1011.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1200.0, + 227.0, + 1405.0, + 227.0, + 1405.0, + 267.0, + 1200.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 268.0, + 632.0, + 268.0, + 632.0, + 311.0, + 293.0, + 311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1031.0, + 268.0, + 1090.0, + 268.0, + 1090.0, + 311.0, + 1031.0, + 311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1113.0, + 268.0, + 1213.0, + 268.0, + 1213.0, + 311.0, + 1113.0, + 311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1297.0, + 268.0, + 1344.0, + 268.0, + 1344.0, + 311.0, + 1297.0, + 311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 305.0, + 296.0, + 305.0, + 296.0, + 348.0, + 291.0, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 365.0, + 305.0, + 594.0, + 305.0, + 594.0, + 348.0, + 365.0, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 305.0, + 1224.0, + 305.0, + 1224.0, + 348.0, + 842.0, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1322.0, + 305.0, + 1406.0, + 305.0, + 1406.0, + 348.0, + 1322.0, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 343.0, + 635.0, + 343.0, + 635.0, + 382.0, + 293.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 729.0, + 343.0, + 1405.0, + 343.0, + 1405.0, + 382.0, + 729.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 375.0, + 564.0, + 375.0, + 564.0, + 412.0, + 294.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 615.0, + 342.0, + 615.0, + 342.0, + 658.0, + 293.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 389.0, + 615.0, + 1408.0, + 615.0, + 1408.0, + 658.0, + 389.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 641.0, + 347.0, + 641.0, + 347.0, + 701.0, + 284.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 641.0, + 432.0, + 641.0, + 432.0, + 701.0, + 367.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 455.0, + 641.0, + 564.0, + 641.0, + 564.0, + 701.0, + 455.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 641.0, + 948.0, + 641.0, + 948.0, + 701.0, + 891.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 641.0, + 1413.0, + 641.0, + 1413.0, + 701.0, + 997.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 683.0, + 339.0, + 683.0, + 339.0, + 743.0, + 287.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 386.0, + 683.0, + 475.0, + 683.0, + 475.0, + 743.0, + 386.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 683.0, + 1410.0, + 683.0, + 1410.0, + 743.0, + 952.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 729.0, + 568.0, + 729.0, + 568.0, + 765.0, + 295.0, + 765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 729.0, + 1271.0, + 729.0, + 1271.0, + 765.0, + 597.0, + 765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1593.0, + 341.0, + 1593.0, + 341.0, + 1626.0, + 294.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 415.0, + 1593.0, + 704.0, + 1593.0, + 704.0, + 1626.0, + 415.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 751.0, + 1593.0, + 1404.0, + 1593.0, + 1404.0, + 1626.0, + 751.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1624.0, + 722.0, + 1624.0, + 722.0, + 1656.0, + 294.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 744.0, + 1624.0, + 1405.0, + 1624.0, + 1405.0, + 1656.0, + 744.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1654.0, + 1405.0, + 1654.0, + 1405.0, + 1690.0, + 293.0, + 1690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1683.0, + 517.0, + 1683.0, + 517.0, + 1717.0, + 296.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1729.0, + 1403.0, + 1729.0, + 1403.0, + 1765.0, + 293.0, + 1765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1760.0, + 684.0, + 1760.0, + 684.0, + 1795.0, + 294.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 706.0, + 1760.0, + 1032.0, + 1760.0, + 1032.0, + 1795.0, + 706.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 1760.0, + 1330.0, + 1760.0, + 1330.0, + 1795.0, + 1054.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1392.0, + 1760.0, + 1404.0, + 1760.0, + 1404.0, + 1795.0, + 1392.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1789.0, + 520.0, + 1789.0, + 520.0, + 1828.0, + 293.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 1789.0, + 868.0, + 1789.0, + 868.0, + 1828.0, + 701.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1084.0, + 1789.0, + 1407.0, + 1789.0, + 1407.0, + 1828.0, + 1084.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1821.0, + 601.0, + 1821.0, + 601.0, + 1859.0, + 294.0, + 1859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1484.0, + 342.0, + 1484.0, + 342.0, + 1522.0, + 294.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 417.0, + 1484.0, + 1039.0, + 1484.0, + 1039.0, + 1522.0, + 417.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1061.0, + 1484.0, + 1156.0, + 1484.0, + 1156.0, + 1522.0, + 1061.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1178.0, + 1484.0, + 1405.0, + 1484.0, + 1405.0, + 1522.0, + 1178.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1517.0, + 1154.0, + 1517.0, + 1154.0, + 1551.0, + 295.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1221.0, + 1517.0, + 1258.0, + 1517.0, + 1258.0, + 1551.0, + 1221.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1340.0, + 1517.0, + 1403.0, + 1517.0, + 1403.0, + 1551.0, + 1340.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1545.0, + 635.0, + 1545.0, + 635.0, + 1584.0, + 294.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 707.0, + 1545.0, + 743.0, + 1545.0, + 743.0, + 1584.0, + 707.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 825.0, + 1545.0, + 1165.0, + 1545.0, + 1165.0, + 1584.0, + 825.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1250.0, + 1545.0, + 1261.0, + 1545.0, + 1261.0, + 1584.0, + 1250.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1854.0, + 746.0, + 1854.0, + 746.0, + 1903.0, + 293.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 774.0, + 1854.0, + 835.0, + 1854.0, + 835.0, + 1903.0, + 774.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 902.0, + 1854.0, + 945.0, + 1854.0, + 945.0, + 1903.0, + 902.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1123.0, + 1854.0, + 1404.0, + 1854.0, + 1404.0, + 1903.0, + 1123.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1891.0, + 417.0, + 1891.0, + 417.0, + 1937.0, + 292.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 1891.0, + 1110.0, + 1891.0, + 1110.0, + 1937.0, + 465.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 1891.0, + 1232.0, + 1891.0, + 1232.0, + 1937.0, + 1131.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 1891.0, + 1368.0, + 1891.0, + 1368.0, + 1937.0, + 1306.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1393.0, + 1891.0, + 1404.0, + 1891.0, + 1404.0, + 1937.0, + 1393.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1924.0, + 372.0, + 1924.0, + 372.0, + 1966.0, + 294.0, + 1966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 770.0, + 1403.0, + 770.0, + 1403.0, + 805.0, + 295.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 799.0, + 551.0, + 799.0, + 551.0, + 836.0, + 293.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 572.0, + 799.0, + 746.0, + 799.0, + 746.0, + 836.0, + 572.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 799.0, + 1258.0, + 799.0, + 1258.0, + 836.0, + 1151.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 493.0, + 1010.0, + 493.0, + 1010.0, + 533.0, + 297.0, + 533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1082.0, + 493.0, + 1166.0, + 493.0, + 1166.0, + 533.0, + 1082.0, + 533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 911.0, + 1291.0, + 911.0, + 1291.0, + 950.0, + 295.0, + 950.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 995, + 1405, + 995, + 1405, + 1161, + 297, + 1161 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1816, + 1404, + 1816, + 1404, + 1970, + 298, + 1970 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 296, + 445, + 1404, + 445, + 1404, + 576, + 296, + 576 + ], + "score": 0.971 + }, + { + "category_id": 3, + "poly": [ + 400, + 1205, + 826, + 1205, + 826, + 1629, + 400, + 1629 + ], + "score": 0.967 + }, + { + "category_id": 4, + "poly": [ + 860, + 1390, + 1317, + 1390, + 1317, + 1634, + 860, + 1634 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 300, + 711, + 1404, + 711, + 1404, + 774, + 300, + 774 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 297, + 888, + 1398, + 888, + 1398, + 951, + 297, + 951 + ], + "score": 0.943 + }, + { + "category_id": 8, + "poly": [ + 775, + 342, + 1022, + 342, + 1022, + 390, + 775, + 390 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 361, + 227, + 1090, + 227, + 1090, + 265, + 361, + 265 + ], + "score": 0.919 + }, + { + "category_id": 0, + "poly": [ + 300, + 633, + 559, + 633, + 559, + 668, + 300, + 668 + ], + "score": 0.916 + }, + { + "category_id": 0, + "poly": [ + 299, + 823, + 665, + 823, + 665, + 855, + 299, + 855 + ], + "score": 0.912 + }, + { + "category_id": 1, + "poly": [ + 354, + 290, + 1398, + 290, + 1398, + 325, + 354, + 325 + ], + "score": 0.912 + }, + { + "category_id": 2, + "poly": [ + 325, + 2004, + 1200, + 2004, + 1200, + 2034, + 325, + 2034 + ], + "score": 0.904 + }, + { + "category_id": 2, + "poly": [ + 299, + 74, + 813, + 74, + 813, + 105, + 299, + 105 + ], + "score": 0.899 + }, + { + "category_id": 4, + "poly": [ + 297, + 1673, + 1404, + 1673, + 1404, + 1796, + 297, + 1796 + ], + "score": 0.762 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 858, + 2087, + 858, + 2111, + 841, + 2111 + ], + "score": 0.692 + }, + { + "category_id": 1, + "poly": [ + 297, + 1673, + 1404, + 1673, + 1404, + 1796, + 297, + 1796 + ], + "score": 0.315 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 859, + 2087, + 859, + 2111, + 841, + 2111 + ], + "score": 0.233 + }, + { + "category_id": 13, + "poly": [ + 647, + 1059, + 739, + 1059, + 739, + 1091, + 647, + 1091 + ], + "score": 0.94, + "latex": "\\Sigma \\neq I _ { d }" + }, + { + "category_id": 13, + "poly": [ + 462, + 1704, + 574, + 1704, + 574, + 1737, + 462, + 1737 + ], + "score": 0.93, + "latex": "\\Sigma _ { i , i } = 1 0" + }, + { + "category_id": 13, + "poly": [ + 743, + 1704, + 841, + 1704, + 841, + 1737, + 743, + 1737 + ], + "score": 0.93, + "latex": "\\Sigma _ { i , i } = 1" + }, + { + "category_id": 13, + "poly": [ + 852, + 1087, + 953, + 1087, + 953, + 1120, + 852, + 1120 + ], + "score": 0.93, + "latex": "\\beta ^ { * } \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 504, + 1058, + 600, + 1058, + 600, + 1092, + 504, + 1092 + ], + "score": 0.93, + "latex": "\\mathcal { N } ( 0 , \\Sigma )" + }, + { + "category_id": 13, + "poly": [ + 354, + 1088, + 513, + 1088, + 513, + 1121, + 354, + 1121 + ], + "score": 0.92, + "latex": "\\varepsilon \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 969, + 1733, + 1184, + 1733, + 1184, + 1766, + 969, + 1766 + ], + "score": 0.92, + "latex": "\\beta ^ { * } = 0 . 1 \\vec { e _ { 1 } } + e _ { 3 0 } ^ { }" + }, + { + "category_id": 13, + "poly": [ + 1000, + 1028, + 1065, + 1028, + 1065, + 1061, + 1000, + 1061 + ], + "score": 0.92, + "latex": "( x , y )" + }, + { + "category_id": 13, + "poly": [ + 1211, + 1058, + 1402, + 1058, + 1402, + 1092, + 1211, + 1092 + ], + "score": 0.92, + "latex": "y = \\langle x , \\beta ^ { * } \\rangle + \\varepsilon" + }, + { + "category_id": 13, + "poly": [ + 1260, + 443, + 1404, + 443, + 1404, + 483, + 1260, + 483 + ], + "score": 0.91, + "latex": "\\overline { { { R } } } ( \\hat { \\beta } _ { n = 1 } ^ { \\mathrm { o p t } } ) ~ <" + }, + { + "category_id": 13, + "poly": [ + 914, + 510, + 1130, + 510, + 1130, + 549, + 914, + 549 + ], + "score": 0.91, + "latex": "\\overline { { R } } ( \\hat { \\beta } _ { n = 2 } ^ { \\mathrm { o p t } } ) ~ > ~ 8 . 1 7 9" + }, + { + "category_id": 13, + "poly": [ + 616, + 1704, + 694, + 1704, + 694, + 1734, + 616, + 1734 + ], + "score": 0.91, + "latex": "i \\leq 1 5" + }, + { + "category_id": 14, + "poly": [ + 775, + 343, + 1023, + 343, + 1023, + 388, + 775, + 388 + ], + "score": 0.9, + "latex": "\\overline { { R } } ( \\hat { \\beta } _ { n = 1 } ^ { \\mathrm { o p t } } ) < \\overline { { R } } ( \\hat { \\beta } _ { n = 2 } ^ { \\mathrm { o p t } } )" + }, + { + "category_id": 13, + "poly": [ + 883, + 1704, + 960, + 1704, + 960, + 1733, + 883, + 1733 + ], + "score": 0.9, + "latex": "i > 1 5" + }, + { + "category_id": 13, + "poly": [ + 433, + 1879, + 507, + 1879, + 507, + 1906, + 433, + 1906 + ], + "score": 0.9, + "latex": "n = d" + }, + { + "category_id": 13, + "poly": [ + 414, + 1122, + 860, + 1122, + 860, + 1162, + 414, + 1162 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\boldsymbol { \\beta } } \\| X { \\boldsymbol { \\beta } } - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| { \\boldsymbol { \\beta } } \\| _ { 2 } ^ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1308, + 1026, + 1400, + 1026, + 1400, + 1056, + 1308, + 1056 + ], + "score": 0.9, + "latex": "\\boldsymbol { x } \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 588, + 1849, + 673, + 1849, + 673, + 1876, + 588, + 1876 + ], + "score": 0.9, + "latex": "n = 1 5" + }, + { + "category_id": 13, + "poly": [ + 428, + 450, + 513, + 450, + 513, + 477, + 428, + 477 + ], + "score": 0.89, + "latex": "n = 1" + }, + { + "category_id": 13, + "poly": [ + 1059, + 294, + 1130, + 294, + 1130, + 319, + 1059, + 319 + ], + "score": 0.89, + "latex": "n = 1" + }, + { + "category_id": 13, + "poly": [ + 999, + 480, + 1074, + 480, + 1074, + 507, + 999, + 507 + ], + "score": 0.89, + "latex": "n = 2" + }, + { + "category_id": 13, + "poly": [ + 1108, + 1675, + 1140, + 1675, + 1140, + 1705, + 1108, + 1705 + ], + "score": 0.89, + "latex": "\\beta ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1339, + 1909, + 1374, + 1909, + 1374, + 1939, + 1339, + 1939 + ], + "score": 0.88, + "latex": "\\lambda _ { n }" + }, + { + "category_id": 13, + "poly": [ + 862, + 1453, + 954, + 1453, + 954, + 1483, + 862, + 1483 + ], + "score": 0.88, + "latex": "d = 3 0" + }, + { + "category_id": 13, + "poly": [ + 624, + 479, + 942, + 479, + 942, + 512, + 624, + 512 + ], + "score": 0.88, + "latex": "\\lambda = 4 0 0 / 2 4 0 1 \\approx 0 . 1 6 6 5 9 7 ." + }, + { + "category_id": 13, + "poly": [ + 856, + 714, + 882, + 714, + 882, + 743, + 856, + 743 + ], + "score": 0.88, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1051, + 1767, + 1142, + 1767, + 1142, + 1793, + 1051, + 1793 + ], + "score": 0.87, + "latex": "\\sigma = 0 . 5" + }, + { + "category_id": 13, + "poly": [ + 1182, + 293, + 1252, + 293, + 1252, + 319, + 1182, + 319 + ], + "score": 0.87, + "latex": "n = 2" + }, + { + "category_id": 13, + "poly": [ + 861, + 891, + 890, + 891, + 890, + 920, + 861, + 920 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 297, + 545, + 458, + 545, + 458, + 575, + 297, + 575 + ], + "score": 0.86, + "latex": "\\lambda = 0 . 6 4 2 5 2 5" + }, + { + "category_id": 13, + "poly": [ + 728, + 1819, + 809, + 1819, + 809, + 1847, + 728, + 1847 + ], + "score": 0.85, + "latex": "\\lambda = 0" + }, + { + "category_id": 13, + "poly": [ + 719, + 230, + 814, + 230, + 814, + 264, + 719, + 264 + ], + "score": 0.85, + "latex": "\\mathbb { E } p [ y | x ]" + }, + { + "category_id": 13, + "poly": [ + 1348, + 1675, + 1372, + 1675, + 1372, + 1701, + 1348, + 1701 + ], + "score": 0.81, + "latex": "\\Sigma" + }, + { + "category_id": 13, + "poly": [ + 1027, + 1675, + 1051, + 1675, + 1051, + 1701, + 1027, + 1701 + ], + "score": 0.8, + "latex": "\\Sigma" + }, + { + "category_id": 13, + "poly": [ + 923, + 1945, + 942, + 1945, + 942, + 1966, + 923, + 1966 + ], + "score": 0.76, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 405, + 1033, + 424, + 1033, + 424, + 1055, + 405, + 1055 + ], + "score": 0.73, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 757, + 1766, + 780, + 1766, + 780, + 1792, + 757, + 1792 + ], + "score": 0.67, + "latex": "\\Sigma" + }, + { + "category_id": 13, + "poly": [ + 911, + 1576, + 931, + 1576, + 931, + 1602, + 911, + 1602 + ], + "score": 0.62, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1063, + 237, + 1081, + 237, + 1081, + 258, + 1063, + 258 + ], + "score": 0.58, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 932, + 298, + 951, + 298, + 951, + 320, + 932, + 320 + ], + "score": 0.57, + "latex": "n _ { \\ast }" + }, + { + "category_id": 13, + "poly": [ + 862, + 1613, + 882, + 1613, + 882, + 1633, + 862, + 1633 + ], + "score": 0.43, + "latex": "n" + }, + { + "category_id": 15, + "poly": [ + 418.0, + 1215.0, + 437.0, + 1215.0, + 437.0, + 1232.0, + 418.0, + 1232.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 502.0, + 1202.0, + 758.0, + 1202.0, + 758.0, + 1226.0, + 502.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 1226.0, + 790.0, + 1226.0, + 790.0, + 1244.0, + 754.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 752.0, + 1238.0, + 815.0, + 1238.0, + 815.0, + 1258.0, + 752.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 1250.0, + 816.0, + 1250.0, + 816.0, + 1274.0, + 754.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1292.0, + 437.0, + 1292.0, + 437.0, + 1305.0, + 424.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 752.0, + 1280.0, + 811.0, + 1280.0, + 811.0, + 1301.0, + 752.0, + 1301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 1309.0, + 811.0, + 1309.0, + 811.0, + 1329.0, + 756.0, + 1329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 1320.0, + 821.0, + 1320.0, + 821.0, + 1339.0, + 756.0, + 1339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 1323.0, + 421.0, + 1323.0, + 421.0, + 1498.0, + 397.0, + 1498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1365.0, + 438.0, + 1365.0, + 438.0, + 1382.0, + 423.0, + 1382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 1444.0, + 434.0, + 1444.0, + 434.0, + 1454.0, + 425.0, + 1454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 1519.0, + 434.0, + 1519.0, + 434.0, + 1529.0, + 426.0, + 1529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1592.0, + 436.0, + 1592.0, + 436.0, + 1606.0, + 424.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 441.0, + 1599.0, + 454.0, + 1599.0, + 454.0, + 1613.0, + 441.0, + 1613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 1597.0, + 532.0, + 1597.0, + 532.0, + 1617.0, + 509.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 584.0, + 1598.0, + 604.0, + 1598.0, + 604.0, + 1616.0, + 584.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 655.0, + 1596.0, + 678.0, + 1596.0, + 678.0, + 1616.0, + 655.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 1598.0, + 750.0, + 1598.0, + 750.0, + 1615.0, + 730.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 1598.0, + 823.0, + 1598.0, + 823.0, + 1613.0, + 804.0, + 1613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 582.0, + 1606.0, + 679.0, + 1606.0, + 679.0, + 1632.0, + 582.0, + 1632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 752.0, + 1266.0, + 801.0, + 1266.0, + 801.0, + 1287.5, + 752.0, + 1287.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 752.0, + 1292.0, + 812.0, + 1292.0, + 812.0, + 1315.5, + 752.0, + 1315.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 1388.0, + 1318.0, + 1388.0, + 1318.0, + 1427.0, + 858.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 1420.0, + 1316.0, + 1420.0, + 1316.0, + 1457.0, + 858.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1451.0, + 1316.0, + 1451.0, + 1316.0, + 1487.0, + 955.0, + 1487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 1484.0, + 1316.0, + 1484.0, + 1316.0, + 1517.0, + 858.0, + 1517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 1514.0, + 1318.0, + 1514.0, + 1318.0, + 1547.0, + 860.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 859.0, + 1544.0, + 1316.0, + 1544.0, + 1316.0, + 1577.0, + 859.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 859.0, + 1575.0, + 910.0, + 1575.0, + 910.0, + 1608.0, + 859.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 1575.0, + 1317.0, + 1575.0, + 1317.0, + 1608.0, + 932.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 883.0, + 1608.0, + 896.0, + 1608.0, + 896.0, + 1639.0, + 883.0, + 1639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 633.0, + 560.0, + 633.0, + 560.0, + 673.0, + 293.0, + 673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 823.0, + 666.0, + 823.0, + 666.0, + 859.0, + 295.0, + 859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1999.0, + 1202.0, + 1999.0, + 1202.0, + 2039.0, + 330.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 815.0, + 72.0, + 815.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1673.0, + 1026.0, + 1673.0, + 1026.0, + 1705.0, + 295.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 1673.0, + 1107.0, + 1673.0, + 1107.0, + 1705.0, + 1052.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 1673.0, + 1347.0, + 1673.0, + 1347.0, + 1705.0, + 1141.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1373.0, + 1673.0, + 1405.0, + 1673.0, + 1405.0, + 1705.0, + 1373.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1702.0, + 461.0, + 1702.0, + 461.0, + 1738.0, + 294.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 1702.0, + 615.0, + 1702.0, + 615.0, + 1738.0, + 575.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 695.0, + 1702.0, + 742.0, + 1702.0, + 742.0, + 1738.0, + 695.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 1702.0, + 882.0, + 1702.0, + 882.0, + 1738.0, + 842.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 961.0, + 1702.0, + 1405.0, + 1702.0, + 1405.0, + 1738.0, + 961.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1733.0, + 968.0, + 1733.0, + 968.0, + 1767.0, + 292.0, + 1767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 1733.0, + 1407.0, + 1733.0, + 1407.0, + 1767.0, + 1185.0, + 1767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1764.0, + 756.0, + 1764.0, + 756.0, + 1800.0, + 295.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 781.0, + 1764.0, + 1050.0, + 1764.0, + 1050.0, + 1800.0, + 781.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1143.0, + 1764.0, + 1156.0, + 1764.0, + 1156.0, + 1800.0, + 1143.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2117.0, + 839.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2118.0, + 839.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 997.0, + 1403.0, + 997.0, + 1403.0, + 1030.0, + 295.0, + 1030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1025.0, + 404.0, + 1025.0, + 404.0, + 1061.0, + 291.0, + 1061.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 1025.0, + 999.0, + 1025.0, + 999.0, + 1061.0, + 425.0, + 1061.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1066.0, + 1025.0, + 1307.0, + 1025.0, + 1307.0, + 1061.0, + 1066.0, + 1061.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1025.0, + 1408.0, + 1025.0, + 1408.0, + 1061.0, + 1401.0, + 1061.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1059.0, + 503.0, + 1059.0, + 503.0, + 1092.0, + 295.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 1059.0, + 646.0, + 1059.0, + 646.0, + 1092.0, + 601.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 1059.0, + 1210.0, + 1059.0, + 1210.0, + 1092.0, + 740.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1085.0, + 353.0, + 1085.0, + 353.0, + 1124.0, + 295.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 514.0, + 1085.0, + 851.0, + 1085.0, + 851.0, + 1124.0, + 514.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1085.0, + 1405.0, + 1085.0, + 1405.0, + 1124.0, + 954.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1124.0, + 413.0, + 1124.0, + 413.0, + 1161.0, + 296.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 1124.0, + 871.0, + 1124.0, + 871.0, + 1161.0, + 861.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1812.0, + 727.0, + 1812.0, + 727.0, + 1853.0, + 294.0, + 1853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 810.0, + 1812.0, + 1404.0, + 1812.0, + 1404.0, + 1853.0, + 810.0, + 1853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1848.0, + 587.0, + 1848.0, + 587.0, + 1881.0, + 297.0, + 1881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 674.0, + 1848.0, + 1401.0, + 1848.0, + 1401.0, + 1881.0, + 674.0, + 1881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1878.0, + 432.0, + 1878.0, + 432.0, + 1912.0, + 294.0, + 1912.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 508.0, + 1878.0, + 1404.0, + 1878.0, + 1404.0, + 1912.0, + 508.0, + 1912.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1908.0, + 1338.0, + 1908.0, + 1338.0, + 1945.0, + 294.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1375.0, + 1908.0, + 1404.0, + 1908.0, + 1404.0, + 1945.0, + 1375.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1938.0, + 922.0, + 1938.0, + 922.0, + 1975.0, + 294.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 943.0, + 1938.0, + 954.0, + 1938.0, + 954.0, + 1975.0, + 943.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 438.0, + 427.0, + 438.0, + 427.0, + 494.0, + 285.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 514.0, + 438.0, + 1259.0, + 438.0, + 1259.0, + 494.0, + 514.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1405.0, + 438.0, + 1414.0, + 438.0, + 1414.0, + 494.0, + 1405.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 478.0, + 623.0, + 478.0, + 623.0, + 512.0, + 294.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 943.0, + 478.0, + 998.0, + 478.0, + 998.0, + 512.0, + 943.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1075.0, + 478.0, + 1406.0, + 478.0, + 1406.0, + 512.0, + 1075.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 500.0, + 913.0, + 500.0, + 913.0, + 560.0, + 285.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 500.0, + 1412.0, + 500.0, + 1412.0, + 560.0, + 1131.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 545.0, + 469.0, + 545.0, + 469.0, + 577.0, + 459.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1373.0, + 547.0, + 1406.0, + 547.0, + 1406.0, + 575.0, + 1373.0, + 575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 711.0, + 855.0, + 711.0, + 855.0, + 748.0, + 295.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 883.0, + 711.0, + 1404.0, + 711.0, + 1404.0, + 748.0, + 883.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 743.0, + 809.0, + 743.0, + 809.0, + 774.0, + 294.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 886.0, + 860.0, + 886.0, + 860.0, + 926.0, + 293.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 886.0, + 1402.0, + 886.0, + 1402.0, + 926.0, + 891.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 918.0, + 576.0, + 918.0, + 576.0, + 954.0, + 295.0, + 954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 360.0, + 222.0, + 718.0, + 222.0, + 718.0, + 271.0, + 360.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 815.0, + 222.0, + 1062.0, + 222.0, + 1062.0, + 271.0, + 815.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1082.0, + 222.0, + 1092.0, + 222.0, + 1092.0, + 271.0, + 1082.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 287.0, + 931.0, + 287.0, + 931.0, + 329.0, + 356.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 287.0, + 1058.0, + 287.0, + 1058.0, + 329.0, + 952.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 287.0, + 1181.0, + 287.0, + 1181.0, + 329.0, + 1131.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1253.0, + 287.0, + 1400.0, + 287.0, + 1400.0, + 329.0, + 1253.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1673.0, + 1026.0, + 1673.0, + 1026.0, + 1705.0, + 295.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 1673.0, + 1107.0, + 1673.0, + 1107.0, + 1705.0, + 1052.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 1673.0, + 1347.0, + 1673.0, + 1347.0, + 1705.0, + 1141.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1373.0, + 1673.0, + 1405.0, + 1673.0, + 1405.0, + 1705.0, + 1373.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1702.0, + 461.0, + 1702.0, + 461.0, + 1738.0, + 294.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 1702.0, + 615.0, + 1702.0, + 615.0, + 1738.0, + 575.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 695.0, + 1702.0, + 742.0, + 1702.0, + 742.0, + 1738.0, + 695.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 1702.0, + 882.0, + 1702.0, + 882.0, + 1738.0, + 842.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 961.0, + 1702.0, + 1405.0, + 1702.0, + 1405.0, + 1738.0, + 961.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1733.0, + 968.0, + 1733.0, + 968.0, + 1767.0, + 292.0, + 1767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 1733.0, + 1407.0, + 1733.0, + 1407.0, + 1767.0, + 1185.0, + 1767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1764.0, + 756.0, + 1764.0, + 756.0, + 1800.0, + 295.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 781.0, + 1764.0, + 1050.0, + 1764.0, + 1050.0, + 1800.0, + 781.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1143.0, + 1764.0, + 1156.0, + 1764.0, + 1156.0, + 1800.0, + 1143.0, + 1800.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 230, + 1404, + 230, + 1404, + 540, + 297, + 540 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 702, + 1403, + 702, + 1403, + 885, + 298, + 885 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1469, + 1404, + 1469, + 1404, + 1718, + 298, + 1718 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1833, + 1403, + 1833, + 1403, + 1926, + 299, + 1926 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 920, + 715, + 920, + 715, + 1469, + 298, + 1469 + ], + "score": 0.973 + }, + { + "category_id": 3, + "poly": [ + 775, + 967, + 1360, + 967, + 1360, + 1303, + 775, + 1303 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 300, + 1942, + 1402, + 1942, + 1402, + 2034, + 300, + 2034 + ], + "score": 0.969 + }, + { + "category_id": 4, + "poly": [ + 734, + 1338, + 1401, + 1338, + 1401, + 1431, + 734, + 1431 + ], + "score": 0.957 + }, + { + "category_id": 1, + "poly": [ + 294, + 635, + 1377, + 635, + 1377, + 668, + 294, + 668 + ], + "score": 0.92 + }, + { + "category_id": 0, + "poly": [ + 302, + 1764, + 798, + 1764, + 798, + 1799, + 302, + 1799 + ], + "score": 0.899 + }, + { + "category_id": 0, + "poly": [ + 302, + 578, + 718, + 578, + 718, + 609, + 302, + 609 + ], + "score": 0.893 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 812, + 76, + 812, + 104, + 300, + 104 + ], + "score": 0.889 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.787 + }, + { + "category_id": 0, + "poly": [ + 300, + 922, + 713, + 922, + 713, + 951, + 300, + 951 + ], + "score": 0.204 + }, + { + "category_id": 13, + "poly": [ + 1209, + 322, + 1351, + 322, + 1351, + 360, + 1209, + 360 + ], + "score": 0.93, + "latex": "\\mathcal { N } ( 0 , 1 / \\sqrt { d } )" + }, + { + "category_id": 13, + "poly": [ + 596, + 322, + 738, + 322, + 738, + 355, + 596, + 355 + ], + "score": 0.93, + "latex": "W \\in \\mathbb { R } ^ { D \\times d }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1468, + 389, + 1468, + 389, + 1502, + 298, + 1502 + ], + "score": 0.92, + "latex": "[ - 1 , 1 ] ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 379, + 1317, + 535, + 1317, + 535, + 1350, + 379, + 1350 + ], + "score": 0.92, + "latex": "[ k , 2 k , 4 k , 8 k ]" + }, + { + "category_id": 13, + "poly": [ + 517, + 1530, + 744, + 1530, + 744, + 1569, + 517, + 1569 + ], + "score": 0.92, + "latex": "0 . 1 / \\sqrt { \\lfloor { T / 5 1 2 } \\rfloor + 1 }" + }, + { + "category_id": 13, + "poly": [ + 297, + 325, + 506, + 325, + 506, + 359, + 297, + 359 + ], + "score": 0.9, + "latex": "\\tilde { x } : = \\mathrm { R e L U } ( W x )" + }, + { + "category_id": 13, + "poly": [ + 778, + 795, + 885, + 795, + 885, + 823, + 778, + 823 + ], + "score": 0.89, + "latex": "n = 5 0 0" + }, + { + "category_id": 13, + "poly": [ + 735, + 638, + 761, + 638, + 761, + 667, + 735, + 667 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 880, + 388, + 908, + 388, + 908, + 417, + 880, + 417 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 367, + 1973, + 395, + 1973, + 395, + 2003, + 367, + 2003 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 431, + 1044, + 459, + 1044, + 459, + 1074, + 431, + 1074 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 933, + 449, + 960, + 449, + 960, + 478, + 933, + 478 + ], + "score": 0.86, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 950, + 1370, + 979, + 1370, + 979, + 1400, + 950, + 1400 + ], + "score": 0.85, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1373, + 825, + 1401, + 825, + 1401, + 855, + 1373, + 855 + ], + "score": 0.84, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 668, + 1318, + 716, + 1318, + 716, + 1347, + 668, + 1347 + ], + "score": 0.84, + "latex": "k \\in" + }, + { + "category_id": 13, + "poly": [ + 731, + 480, + 751, + 480, + 751, + 506, + 731, + 506 + ], + "score": 0.79, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1078, + 1401, + 1098, + 1401, + 1098, + 1427, + 1078, + 1427 + ], + "score": 0.76, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1381, + 1657, + 1401, + 1657, + 1401, + 1684, + 1381, + 1684 + ], + "score": 0.75, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1005, + 262, + 1031, + 262, + 1031, + 289, + 1005, + 289 + ], + "score": 0.75, + "latex": "D" + }, + { + "category_id": 13, + "poly": [ + 1045, + 735, + 1072, + 735, + 1072, + 761, + 1045, + 761 + ], + "score": 0.74, + "latex": "D" + }, + { + "category_id": 13, + "poly": [ + 1230, + 1406, + 1249, + 1406, + 1249, + 1427, + 1230, + 1427 + ], + "score": 0.74, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1079, + 484, + 1098, + 484, + 1098, + 506, + 1079, + 506 + ], + "score": 0.73, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 369, + 1566, + 389, + 1566, + 389, + 1593, + 369, + 1593 + ], + "score": 0.73, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1018, + 1566, + 1038, + 1566, + 1038, + 1593, + 1018, + 1593 + ], + "score": 0.72, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1327, + 267, + 1348, + 267, + 1348, + 290, + 1327, + 290 + ], + "score": 0.72, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 558, + 740, + 578, + 740, + 578, + 762, + 558, + 762 + ], + "score": 0.64, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 522, + 1567, + 542, + 1567, + 542, + 1593, + 522, + 1593 + ], + "score": 0.62, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 828, + 1535, + 852, + 1535, + 852, + 1562, + 828, + 1562 + ], + "score": 0.6, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 297, + 1348, + 322, + 1348, + 322, + 1375, + 297, + 1375 + ], + "score": 0.39, + "latex": "\\mathbb { N }" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 969.0, + 1247.0, + 969.0, + 1247.0, + 990.0, + 928.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 987.0, + 819.0, + 987.0, + 819.0, + 1008.0, + 790.0, + 1008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1240.0, + 993.0, + 1318.0, + 993.0, + 1318.0, + 1015.0, + 1240.0, + 1015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 1008.0, + 1304.0, + 1008.0, + 1304.0, + 1028.0, + 1241.0, + 1028.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 1023.0, + 1298.0, + 1023.0, + 1298.0, + 1043.0, + 1241.0, + 1043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 1041.0, + 819.0, + 1041.0, + 819.0, + 1062.0, + 790.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1240.0, + 1037.0, + 1299.0, + 1037.0, + 1299.0, + 1059.0, + 1240.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1240.0, + 1051.0, + 1300.0, + 1051.0, + 1300.0, + 1074.0, + 1240.0, + 1074.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1242.0, + 1068.0, + 1293.0, + 1068.0, + 1293.0, + 1087.0, + 1242.0, + 1087.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1242.0, + 1083.0, + 1355.0, + 1083.0, + 1355.0, + 1102.0, + 1242.0, + 1102.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 773.0, + 1092.0, + 801.0, + 1092.0, + 801.0, + 1168.0, + 773.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 791.0, + 1094.0, + 815.0, + 1094.0, + 815.0, + 1114.0, + 791.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 792.0, + 1147.0, + 817.0, + 1147.0, + 817.0, + 1165.0, + 792.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 791.0, + 1200.0, + 817.0, + 1200.0, + 817.0, + 1219.0, + 791.0, + 1219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 791.0, + 1252.0, + 817.0, + 1252.0, + 817.0, + 1271.0, + 791.0, + 1271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 1271.0, + 839.0, + 1271.0, + 839.0, + 1287.0, + 823.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 1271.0, + 921.0, + 1271.0, + 921.0, + 1287.0, + 900.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 977.0, + 1269.0, + 1000.0, + 1269.0, + 1000.0, + 1289.0, + 977.0, + 1289.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1057.0, + 1271.0, + 1078.0, + 1271.0, + 1078.0, + 1287.0, + 1057.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 1270.0, + 1158.0, + 1270.0, + 1158.0, + 1288.0, + 1134.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1213.0, + 1271.0, + 1235.0, + 1271.0, + 1235.0, + 1287.0, + 1213.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1292.0, + 1269.0, + 1314.0, + 1269.0, + 1314.0, + 1288.0, + 1292.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1008.0, + 1281.0, + 1165.0, + 1281.0, + 1165.0, + 1305.0, + 1008.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 1333.0, + 1406.0, + 1333.0, + 1406.0, + 1377.0, + 733.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 735.0, + 1367.0, + 949.0, + 1367.0, + 949.0, + 1405.0, + 735.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 1367.0, + 1403.0, + 1367.0, + 1403.0, + 1405.0, + 980.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 735.0, + 1400.0, + 1077.0, + 1400.0, + 1077.0, + 1434.0, + 735.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1099.0, + 1400.0, + 1229.0, + 1400.0, + 1229.0, + 1434.0, + 1099.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1250.0, + 1400.0, + 1260.0, + 1400.0, + 1260.0, + 1434.0, + 1250.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1757.0, + 805.0, + 1757.0, + 805.0, + 1807.0, + 291.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 577.0, + 723.0, + 577.0, + 723.0, + 613.0, + 295.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 815.0, + 73.0, + 815.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2116.0, + 839.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 918.0, + 716.0, + 918.0, + 716.0, + 957.0, + 297.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 1404.0, + 229.0, + 1404.0, + 263.0, + 295.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 261.0, + 1004.0, + 261.0, + 1004.0, + 297.0, + 295.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 261.0, + 1326.0, + 261.0, + 1326.0, + 297.0, + 1032.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1349.0, + 261.0, + 1405.0, + 261.0, + 1405.0, + 297.0, + 1349.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 288.0, + 1405.0, + 288.0, + 1405.0, + 330.0, + 291.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 320.0, + 296.0, + 320.0, + 296.0, + 363.0, + 291.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 320.0, + 595.0, + 320.0, + 595.0, + 363.0, + 507.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 320.0, + 1208.0, + 320.0, + 1208.0, + 363.0, + 739.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 320.0, + 1407.0, + 320.0, + 1407.0, + 363.0, + 1352.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 354.0, + 1405.0, + 354.0, + 1405.0, + 390.0, + 294.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 386.0, + 879.0, + 386.0, + 879.0, + 422.0, + 294.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 386.0, + 1406.0, + 386.0, + 1406.0, + 422.0, + 909.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 416.0, + 1407.0, + 416.0, + 1407.0, + 453.0, + 292.0, + 453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 449.0, + 932.0, + 449.0, + 932.0, + 481.0, + 296.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 961.0, + 449.0, + 1402.0, + 449.0, + 1402.0, + 481.0, + 961.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 475.0, + 730.0, + 475.0, + 730.0, + 516.0, + 291.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 752.0, + 475.0, + 1078.0, + 475.0, + 1078.0, + 516.0, + 752.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1099.0, + 475.0, + 1406.0, + 475.0, + 1406.0, + 516.0, + 1099.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 508.0, + 687.0, + 508.0, + 687.0, + 544.0, + 295.0, + 544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 701.0, + 1404.0, + 701.0, + 1404.0, + 737.0, + 294.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 726.0, + 557.0, + 726.0, + 557.0, + 775.0, + 292.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 579.0, + 726.0, + 1044.0, + 726.0, + 1044.0, + 775.0, + 579.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1073.0, + 726.0, + 1407.0, + 726.0, + 1407.0, + 775.0, + 1073.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 761.0, + 1407.0, + 761.0, + 1407.0, + 799.0, + 293.0, + 799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 793.0, + 777.0, + 793.0, + 777.0, + 828.0, + 293.0, + 828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 793.0, + 1404.0, + 793.0, + 1404.0, + 828.0, + 886.0, + 828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 823.0, + 1372.0, + 823.0, + 1372.0, + 859.0, + 293.0, + 859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 855.0, + 735.0, + 855.0, + 735.0, + 888.0, + 293.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1465.0, + 297.0, + 1465.0, + 297.0, + 1506.0, + 294.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 1465.0, + 1406.0, + 1465.0, + 1406.0, + 1506.0, + 390.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1497.0, + 1404.0, + 1497.0, + 1404.0, + 1539.0, + 293.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1533.0, + 516.0, + 1533.0, + 516.0, + 1570.0, + 293.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 745.0, + 1533.0, + 827.0, + 1533.0, + 827.0, + 1570.0, + 745.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 853.0, + 1533.0, + 1404.0, + 1533.0, + 1404.0, + 1570.0, + 853.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1564.0, + 368.0, + 1564.0, + 368.0, + 1598.0, + 296.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 1564.0, + 521.0, + 1564.0, + 521.0, + 1598.0, + 390.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 543.0, + 1564.0, + 1017.0, + 1564.0, + 1017.0, + 1598.0, + 543.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 1564.0, + 1404.0, + 1564.0, + 1404.0, + 1598.0, + 1039.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1596.0, + 1405.0, + 1596.0, + 1405.0, + 1630.0, + 294.0, + 1630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1624.0, + 1406.0, + 1624.0, + 1406.0, + 1660.0, + 293.0, + 1660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1657.0, + 1380.0, + 1657.0, + 1380.0, + 1689.0, + 293.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1657.0, + 1406.0, + 1657.0, + 1406.0, + 1689.0, + 1402.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1687.0, + 1247.0, + 1687.0, + 1247.0, + 1721.0, + 296.0, + 1721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1831.0, + 1404.0, + 1831.0, + 1404.0, + 1867.0, + 293.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1863.0, + 1404.0, + 1863.0, + 1404.0, + 1900.0, + 294.0, + 1900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1895.0, + 869.0, + 1895.0, + 869.0, + 1926.0, + 293.0, + 1926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 920.0, + 715.0, + 920.0, + 715.0, + 953.0, + 297.0, + 953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 949.0, + 718.0, + 949.0, + 718.0, + 986.0, + 296.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 981.0, + 717.0, + 981.0, + 717.0, + 1014.0, + 296.0, + 1014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1007.0, + 719.0, + 1007.0, + 719.0, + 1050.0, + 294.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1044.0, + 430.0, + 1044.0, + 430.0, + 1077.0, + 296.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 1044.0, + 717.0, + 1044.0, + 717.0, + 1077.0, + 460.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1073.0, + 717.0, + 1073.0, + 717.0, + 1105.0, + 296.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1102.0, + 717.0, + 1102.0, + 717.0, + 1136.0, + 294.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1134.0, + 717.0, + 1134.0, + 717.0, + 1167.0, + 295.0, + 1167.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1165.0, + 717.0, + 1165.0, + 717.0, + 1197.0, + 296.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1194.0, + 717.0, + 1194.0, + 717.0, + 1228.0, + 296.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1226.0, + 717.0, + 1226.0, + 717.0, + 1258.0, + 296.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1254.0, + 718.0, + 1254.0, + 718.0, + 1289.0, + 296.0, + 1289.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1287.0, + 719.0, + 1287.0, + 719.0, + 1319.0, + 295.0, + 1319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1317.0, + 378.0, + 1317.0, + 378.0, + 1350.0, + 296.0, + 1350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 536.0, + 1317.0, + 667.0, + 1317.0, + 667.0, + 1350.0, + 536.0, + 1350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1346.0, + 716.0, + 1346.0, + 716.0, + 1378.0, + 323.0, + 1378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1377.0, + 716.0, + 1377.0, + 716.0, + 1409.0, + 297.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1409.0, + 717.0, + 1409.0, + 717.0, + 1440.0, + 294.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1439.0, + 717.0, + 1439.0, + 717.0, + 1471.0, + 296.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1941.0, + 1403.0, + 1941.0, + 1403.0, + 1978.0, + 295.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1974.0, + 366.0, + 1974.0, + 366.0, + 2007.0, + 296.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 1974.0, + 1406.0, + 1974.0, + 1406.0, + 2007.0, + 396.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2001.0, + 1406.0, + 2001.0, + 1406.0, + 2037.0, + 295.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 633.0, + 734.0, + 633.0, + 734.0, + 672.0, + 295.0, + 672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 762.0, + 633.0, + 1381.0, + 633.0, + 1381.0, + 672.0, + 762.0, + 672.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 388, + 1403, + 388, + 1403, + 603, + 298, + 603 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1402, + 229, + 1402, + 352, + 299, + 352 + ], + "score": 0.97 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 812, + 76, + 812, + 104, + 300, + 104 + ], + "score": 0.891 + }, + { + "category_id": 0, + "poly": [ + 299, + 650, + 487, + 650, + 487, + 683, + 299, + 683 + ], + "score": 0.884 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.767 + }, + { + "category_id": 1, + "poly": [ + 292, + 690, + 1407, + 690, + 1407, + 2012, + 292, + 2012 + ], + "score": 0.61 + }, + { + "category_id": 1, + "poly": [ + 299, + 1972, + 1396, + 1972, + 1396, + 2034, + 299, + 2034 + ], + "score": 0.376 + }, + { + "category_id": 13, + "poly": [ + 1058, + 232, + 1087, + 232, + 1087, + 261, + 1058, + 261 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 815.0, + 73.0, + 815.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 652.0, + 490.0, + 652.0, + 490.0, + 685.0, + 297.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2087.0, + 860.0, + 2087.0, + 860.0, + 2117.0, + 839.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 388.0, + 1405.0, + 388.0, + 1405.0, + 423.0, + 296.0, + 423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 419.0, + 1405.0, + 419.0, + 1405.0, + 455.0, + 293.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 449.0, + 1405.0, + 449.0, + 1405.0, + 486.0, + 292.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 478.0, + 1407.0, + 478.0, + 1407.0, + 518.0, + 292.0, + 518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 511.0, + 1403.0, + 511.0, + 1403.0, + 546.0, + 294.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 541.0, + 1407.0, + 541.0, + 1407.0, + 579.0, + 293.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 571.0, + 989.0, + 571.0, + 989.0, + 606.0, + 293.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 230.0, + 1057.0, + 230.0, + 1057.0, + 265.0, + 293.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1088.0, + 230.0, + 1406.0, + 230.0, + 1406.0, + 265.0, + 1088.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 259.0, + 1406.0, + 259.0, + 1406.0, + 296.0, + 293.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 293.0, + 1404.0, + 293.0, + 1404.0, + 325.0, + 294.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 323.0, + 1185.0, + 323.0, + 1185.0, + 354.0, + 294.0, + 354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 701.0, + 1404.0, + 701.0, + 1404.0, + 739.0, + 293.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 733.0, + 893.0, + 733.0, + 893.0, + 770.0, + 321.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 784.0, + 1403.0, + 784.0, + 1403.0, + 828.0, + 290.0, + 828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 816.0, + 906.0, + 816.0, + 906.0, + 858.0, + 319.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 865.0, + 1404.0, + 865.0, + 1404.0, + 913.0, + 292.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 902.0, + 1130.0, + 902.0, + 1130.0, + 939.0, + 322.0, + 939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 956.0, + 1404.0, + 956.0, + 1404.0, + 993.0, + 295.0, + 993.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 987.0, + 707.0, + 987.0, + 707.0, + 1022.0, + 316.0, + 1022.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1035.0, + 1404.0, + 1035.0, + 1404.0, + 1080.0, + 292.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1071.0, + 1114.0, + 1071.0, + 1114.0, + 1108.0, + 319.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1120.0, + 1403.0, + 1120.0, + 1403.0, + 1164.0, + 292.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1153.0, + 1126.0, + 1153.0, + 1126.0, + 1194.0, + 322.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1206.0, + 1403.0, + 1206.0, + 1403.0, + 1247.0, + 292.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1240.0, + 1226.0, + 1240.0, + 1226.0, + 1277.0, + 322.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1290.0, + 1407.0, + 1290.0, + 1407.0, + 1332.0, + 293.0, + 1332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1320.0, + 1025.0, + 1320.0, + 1025.0, + 1364.0, + 318.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1373.0, + 1406.0, + 1373.0, + 1406.0, + 1418.0, + 292.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1407.0, + 918.0, + 1407.0, + 918.0, + 1444.0, + 322.0, + 1444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1459.0, + 1404.0, + 1459.0, + 1404.0, + 1499.0, + 293.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1492.0, + 1055.0, + 1492.0, + 1055.0, + 1529.0, + 322.0, + 1529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1544.0, + 1406.0, + 1544.0, + 1406.0, + 1585.0, + 293.0, + 1585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1576.0, + 1404.0, + 1576.0, + 1404.0, + 1610.0, + 321.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1604.0, + 572.0, + 1604.0, + 572.0, + 1641.0, + 322.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1656.0, + 1406.0, + 1656.0, + 1406.0, + 1701.0, + 290.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1690.0, + 1090.0, + 1690.0, + 1090.0, + 1727.0, + 319.0, + 1727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1742.0, + 1406.0, + 1742.0, + 1406.0, + 1784.0, + 293.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1773.0, + 1407.0, + 1773.0, + 1407.0, + 1815.0, + 322.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1804.0, + 1233.0, + 1804.0, + 1233.0, + 1844.0, + 319.0, + 1844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1859.0, + 1406.0, + 1859.0, + 1406.0, + 1896.0, + 295.0, + 1896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1884.0, + 1407.0, + 1884.0, + 1407.0, + 1930.0, + 319.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1920.0, + 997.0, + 1920.0, + 997.0, + 1957.0, + 322.0, + 1957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1973.0, + 1402.0, + 1973.0, + 1402.0, + 2010.0, + 296.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1968.0, + 1401.0, + 1968.0, + 1401.0, + 2009.0, + 294.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 2002.0, + 945.0, + 2002.0, + 945.0, + 2037.0, + 325.0, + 2037.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 299, + 75, + 813, + 75, + 813, + 105, + 299, + 105 + ], + "score": 0.885 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 866, + 2088, + 866, + 2113, + 836, + 2113 + ], + "score": 0.83 + }, + { + "category_id": 1, + "poly": [ + 294, + 229, + 1401, + 229, + 1401, + 293, + 294, + 293 + ], + "score": 0.725 + }, + { + "category_id": 1, + "poly": [ + 294, + 424, + 1399, + 424, + 1399, + 489, + 294, + 489 + ], + "score": 0.632 + }, + { + "category_id": 1, + "poly": [ + 298, + 671, + 1399, + 671, + 1399, + 738, + 298, + 738 + ], + "score": 0.609 + }, + { + "category_id": 1, + "poly": [ + 296, + 312, + 1399, + 312, + 1399, + 405, + 296, + 405 + ], + "score": 0.6 + }, + { + "category_id": 1, + "poly": [ + 295, + 507, + 1401, + 507, + 1401, + 572, + 295, + 572 + ], + "score": 0.596 + }, + { + "category_id": 1, + "poly": [ + 295, + 754, + 1401, + 754, + 1401, + 819, + 295, + 819 + ], + "score": 0.591 + }, + { + "category_id": 1, + "poly": [ + 296, + 589, + 1402, + 589, + 1402, + 655, + 296, + 655 + ], + "score": 0.587 + }, + { + "category_id": 1, + "poly": [ + 294, + 1362, + 1401, + 1362, + 1401, + 1427, + 294, + 1427 + ], + "score": 0.569 + }, + { + "category_id": 1, + "poly": [ + 295, + 836, + 1400, + 836, + 1400, + 902, + 295, + 902 + ], + "score": 0.568 + }, + { + "category_id": 1, + "poly": [ + 295, + 1527, + 1401, + 1527, + 1401, + 1592, + 295, + 1592 + ], + "score": 0.559 + }, + { + "category_id": 1, + "poly": [ + 291, + 1445, + 1401, + 1445, + 1401, + 1510, + 291, + 1510 + ], + "score": 0.538 + }, + { + "category_id": 1, + "poly": [ + 296, + 1692, + 1401, + 1692, + 1401, + 1789, + 296, + 1789 + ], + "score": 0.528 + }, + { + "category_id": 1, + "poly": [ + 294, + 1806, + 1400, + 1806, + 1400, + 1901, + 294, + 1901 + ], + "score": 0.519 + }, + { + "category_id": 1, + "poly": [ + 292, + 1279, + 1401, + 1279, + 1401, + 1345, + 292, + 1345 + ], + "score": 0.518 + }, + { + "category_id": 1, + "poly": [ + 296, + 1197, + 1398, + 1197, + 1398, + 1262, + 296, + 1262 + ], + "score": 0.508 + }, + { + "category_id": 1, + "poly": [ + 300, + 1001, + 1399, + 1001, + 1399, + 1098, + 300, + 1098 + ], + "score": 0.506 + }, + { + "category_id": 1, + "poly": [ + 299, + 1114, + 1397, + 1114, + 1397, + 1181, + 299, + 1181 + ], + "score": 0.506 + }, + { + "category_id": 1, + "poly": [ + 293, + 919, + 1400, + 919, + 1400, + 984, + 293, + 984 + ], + "score": 0.505 + }, + { + "category_id": 1, + "poly": [ + 294, + 1919, + 1403, + 1919, + 1403, + 1983, + 294, + 1983 + ], + "score": 0.493 + }, + { + "category_id": 1, + "poly": [ + 295, + 2001, + 1269, + 2001, + 1269, + 2036, + 295, + 2036 + ], + "score": 0.48 + }, + { + "category_id": 1, + "poly": [ + 293, + 1609, + 1401, + 1609, + 1401, + 1675, + 293, + 1675 + ], + "score": 0.47 + }, + { + "category_id": 13, + "poly": [ + 1209, + 1760, + 1227, + 1760, + 1227, + 1782, + 1209, + 1782 + ], + "score": 0.45, + "latex": "\\underline { { \\underline { { \\mathbf { \\Pi } } } } }" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 815.0, + 73.0, + 815.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 224.0, + 1405.0, + 224.0, + 1405.0, + 270.0, + 292.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 258.0, + 469.0, + 258.0, + 469.0, + 296.0, + 321.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 420.0, + 1404.0, + 420.0, + 1404.0, + 464.0, + 292.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 450.0, + 399.0, + 450.0, + 399.0, + 493.0, + 319.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 669.0, + 1404.0, + 669.0, + 1404.0, + 708.0, + 297.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 703.0, + 1379.0, + 703.0, + 1379.0, + 738.0, + 323.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 310.0, + 1403.0, + 310.0, + 1403.0, + 349.0, + 294.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 343.0, + 1404.0, + 343.0, + 1404.0, + 379.0, + 322.0, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 374.0, + 610.0, + 374.0, + 610.0, + 403.0, + 322.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 507.0, + 1403.0, + 507.0, + 1403.0, + 543.0, + 297.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 538.0, + 1148.0, + 538.0, + 1148.0, + 574.0, + 322.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 753.0, + 1405.0, + 753.0, + 1405.0, + 794.0, + 294.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 785.0, + 844.0, + 785.0, + 844.0, + 821.0, + 323.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 588.0, + 1403.0, + 588.0, + 1403.0, + 626.0, + 298.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 622.0, + 1108.0, + 622.0, + 1108.0, + 654.0, + 323.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1362.0, + 1404.0, + 1362.0, + 1404.0, + 1400.0, + 294.0, + 1400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1395.0, + 1213.0, + 1395.0, + 1213.0, + 1427.0, + 322.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 835.0, + 1402.0, + 835.0, + 1402.0, + 872.0, + 296.0, + 872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 868.0, + 1233.0, + 868.0, + 1233.0, + 903.0, + 322.0, + 903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1526.0, + 1405.0, + 1526.0, + 1405.0, + 1565.0, + 295.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1560.0, + 906.0, + 1560.0, + 906.0, + 1593.0, + 320.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1445.0, + 1404.0, + 1445.0, + 1404.0, + 1481.0, + 295.0, + 1481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1476.0, + 1040.0, + 1476.0, + 1040.0, + 1512.0, + 323.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1689.0, + 1406.0, + 1689.0, + 1406.0, + 1732.0, + 293.0, + 1732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1724.0, + 1405.0, + 1724.0, + 1405.0, + 1759.0, + 324.0, + 1759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1757.0, + 1208.0, + 1757.0, + 1208.0, + 1791.0, + 324.0, + 1791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1228.0, + 1757.0, + 1405.0, + 1757.0, + 1405.0, + 1791.0, + 1228.0, + 1791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1805.0, + 1402.0, + 1805.0, + 1402.0, + 1841.0, + 294.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1839.0, + 1402.0, + 1839.0, + 1402.0, + 1869.0, + 324.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1868.0, + 775.0, + 1868.0, + 775.0, + 1901.0, + 323.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1280.0, + 1406.0, + 1280.0, + 1406.0, + 1316.0, + 296.0, + 1316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1311.0, + 1082.0, + 1311.0, + 1082.0, + 1346.0, + 323.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 1200.0, + 1402.0, + 1200.0, + 1402.0, + 1232.0, + 299.0, + 1232.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1230.0, + 1235.0, + 1230.0, + 1235.0, + 1263.0, + 321.0, + 1263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1003.0, + 1403.0, + 1003.0, + 1403.0, + 1037.0, + 296.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1033.0, + 1404.0, + 1033.0, + 1404.0, + 1068.0, + 324.0, + 1068.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1064.0, + 886.0, + 1064.0, + 886.0, + 1099.0, + 324.0, + 1099.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1114.0, + 1401.0, + 1114.0, + 1401.0, + 1150.0, + 295.0, + 1150.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1148.0, + 1297.0, + 1148.0, + 1297.0, + 1181.0, + 323.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 919.0, + 1405.0, + 919.0, + 1405.0, + 957.0, + 295.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 950.0, + 987.0, + 950.0, + 987.0, + 985.0, + 321.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1914.0, + 1406.0, + 1914.0, + 1406.0, + 1959.0, + 293.0, + 1959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1951.0, + 756.0, + 1951.0, + 756.0, + 1982.0, + 323.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2000.0, + 1274.0, + 2000.0, + 1274.0, + 2040.0, + 294.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1610.0, + 1404.0, + 1610.0, + 1404.0, + 1646.0, + 295.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1642.0, + 708.0, + 1642.0, + 708.0, + 1676.0, + 320.0, + 1676.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.874 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2112, + 836, + 2112 + ], + "score": 0.833 + }, + { + "category_id": 1, + "poly": [ + 293, + 229, + 1402, + 229, + 1402, + 294, + 293, + 294 + ], + "score": 0.617 + }, + { + "category_id": 1, + "poly": [ + 294, + 675, + 1402, + 675, + 1402, + 739, + 294, + 739 + ], + "score": 0.616 + }, + { + "category_id": 1, + "poly": [ + 293, + 592, + 1401, + 592, + 1401, + 656, + 293, + 656 + ], + "score": 0.586 + }, + { + "category_id": 1, + "poly": [ + 295, + 311, + 1401, + 311, + 1401, + 377, + 295, + 377 + ], + "score": 0.548 + }, + { + "category_id": 1, + "poly": [ + 304, + 394, + 1400, + 394, + 1400, + 489, + 304, + 489 + ], + "score": 0.528 + }, + { + "category_id": 1, + "poly": [ + 294, + 508, + 1401, + 508, + 1401, + 572, + 294, + 572 + ], + "score": 0.468 + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 815.0, + 73.0, + 815.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 228.0, + 1405.0, + 228.0, + 1405.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 262.0, + 1014.0, + 262.0, + 1014.0, + 295.0, + 321.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 674.0, + 1404.0, + 674.0, + 1404.0, + 712.0, + 292.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 706.0, + 1169.0, + 706.0, + 1169.0, + 740.0, + 321.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 592.0, + 1403.0, + 592.0, + 1403.0, + 628.0, + 295.0, + 628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 623.0, + 1153.0, + 623.0, + 1153.0, + 657.0, + 322.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 310.0, + 1405.0, + 310.0, + 1405.0, + 349.0, + 293.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 343.0, + 1124.0, + 343.0, + 1124.0, + 378.0, + 322.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 396.0, + 1401.0, + 396.0, + 1401.0, + 431.0, + 299.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 428.0, + 1403.0, + 428.0, + 1403.0, + 462.0, + 323.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 457.0, + 836.0, + 457.0, + 836.0, + 491.0, + 322.0, + 491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 507.0, + 1404.0, + 507.0, + 1404.0, + 545.0, + 294.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 540.0, + 935.0, + 540.0, + 935.0, + 573.0, + 322.0, + 573.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 303, + 1403, + 303, + 1403, + 428, + 298, + 428 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 299, + 1800, + 1402, + 1800, + 1402, + 1896, + 299, + 1896 + ], + "score": 0.972 + }, + { + "category_id": 8, + "poly": [ + 573, + 679, + 1129, + 679, + 1129, + 860, + 573, + 860 + ], + "score": 0.972 + }, + { + "category_id": 8, + "poly": [ + 396, + 940, + 1303, + 940, + 1303, + 1297, + 396, + 1297 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 298, + 1318, + 1403, + 1318, + 1403, + 1416, + 298, + 1416 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 298, + 2002, + 581, + 2002, + 581, + 2034, + 298, + 2034 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 297, + 627, + 1219, + 627, + 1219, + 662, + 297, + 662 + ], + "score": 0.924 + }, + { + "category_id": 1, + "poly": [ + 300, + 882, + 795, + 882, + 795, + 919, + 300, + 919 + ], + "score": 0.924 + }, + { + "category_id": 8, + "poly": [ + 353, + 1438, + 1170, + 1438, + 1170, + 1515, + 353, + 1515 + ], + "score": 0.911 + }, + { + "category_id": 0, + "poly": [ + 301, + 475, + 771, + 475, + 771, + 507, + 301, + 507 + ], + "score": 0.904 + }, + { + "category_id": 2, + "poly": [ + 299, + 74, + 813, + 74, + 813, + 105, + 299, + 105 + ], + "score": 0.902 + }, + { + "category_id": 1, + "poly": [ + 298, + 541, + 577, + 541, + 577, + 573, + 298, + 573 + ], + "score": 0.902 + }, + { + "category_id": 8, + "poly": [ + 457, + 1610, + 1099, + 1610, + 1099, + 1691, + 457, + 1691 + ], + "score": 0.898 + }, + { + "category_id": 0, + "poly": [ + 300, + 226, + 508, + 226, + 508, + 261, + 300, + 261 + ], + "score": 0.886 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1721, + 1400, + 1721, + 1400, + 1751, + 1352, + 1751 + ], + "score": 0.885 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1633, + 1400, + 1633, + 1400, + 1664, + 1352, + 1664 + ], + "score": 0.884 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1545, + 1400, + 1545, + 1400, + 1576, + 1352, + 1576 + ], + "score": 0.87 + }, + { + "category_id": 8, + "poly": [ + 445, + 1527, + 1300, + 1527, + 1300, + 1602, + 445, + 1602 + ], + "score": 0.867 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1458, + 1400, + 1458, + 1400, + 1487, + 1365, + 1487 + ], + "score": 0.865 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.864 + }, + { + "category_id": 2, + "poly": [ + 1375, + 1915, + 1402, + 1915, + 1402, + 1943, + 1375, + 1943 + ], + "score": 0.781 + }, + { + "category_id": 8, + "poly": [ + 456, + 1698, + 861, + 1698, + 861, + 1779, + 456, + 1779 + ], + "score": 0.651 + }, + { + "category_id": 14, + "poly": [ + 393, + 935, + 1302, + 935, + 1302, + 1301, + 393, + 1301 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } & { \\bar { R } ( \\hat { \\beta } _ { n , \\lambda } ) : = \\underset { X , y \\sim \\mathcal { D } ^ { n } } { \\mathbb { E } } [ R ( \\hat { \\beta } _ { n , \\lambda } ) ] } \\\\ & { = \\mathbb { E } [ \\| \\hat { \\beta } _ { n , \\lambda } - \\beta ^ { * } \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { = \\underset { X , y } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } y - \\beta \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { = \\underset { X , \\eta \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } I _ { n } ) } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } ( X \\beta ^ { * } + \\eta ) - \\beta ^ { * } \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { = \\underset { X } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } X \\beta ^ { * } - \\beta ^ { * } \\| _ { 2 } ^ { 2 } ] + \\underset { X , \\eta } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } \\eta \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { = \\underset { X } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } X \\beta ^ { * } - \\beta ^ { * } \\| _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\| ( X ^ { T } X + \\lambda I ) ^ { - 1 } X ^ { T } \\| _ { F } ^ { 2 } ] + \\sigma ^ { 2 } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 351, + 1432, + 1300, + 1432, + 1300, + 1785, + 351, + 1785 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } & { \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\underset { V , \\Sigma } { \\mathbb { E } } [ | | \\mathrm { d i a g } ( \\{ \\frac { - \\lambda } { \\gamma _ { i } ^ { 2 } + \\lambda } \\} ) V ^ { T } \\beta ^ { * } | | _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } } \\\\ & { \\quad \\quad = \\underset { z \\sim \\mathrm { U n i f } ( 1 ) \\frac { \\mathbb { E } } { \\delta } } { \\underbrace { \\mathrm { U } \\mathrm { E } } } [ | | \\mathrm { d i a g } ( \\{ \\frac { - \\lambda } { \\gamma _ { i } ^ { 2 } + \\lambda } \\} ) z | | _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } } \\\\ & { \\quad \\quad = \\frac { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } { d } \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { \\lambda ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } } \\\\ & { \\quad \\quad = \\underset { \\Sigma } { \\mathbb { E } } [ \\sum _ { i } \\frac { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } / d + \\sigma ^ { 2 } \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ] + \\sigma ^ { 2 } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 571, + 678, + 1129, + 678, + 1129, + 864, + 571, + 864 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { R ( \\hat { \\beta } ) : = \\underset { ( x , y ) \\sim \\mathcal { D } } { \\mathbb { E } } [ ( \\langle x , \\hat { \\beta } \\rangle - y ) ^ { 2 } ] } \\\\ & { \\quad \\quad = \\underset { x \\sim \\mathcal { N } ( 0 , I _ { d } ) , \\eta \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } ) } { \\mathbb { E } } [ ( \\langle x , \\hat { \\beta } - \\beta ^ { * } \\rangle + \\eta ) ^ { 2 } ] } \\\\ & { \\quad \\quad = | | \\hat { \\beta } - \\beta ^ { * } | | _ { 2 } ^ { 2 } + \\sigma ^ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 763, + 1830, + 892, + 1830, + 892, + 1864, + 763, + 1864 + ], + "score": 0.92, + "latex": "z : = V ^ { T } \\beta ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 565, + 881, + 617, + 881, + 617, + 921, + 565, + 921 + ], + "score": 0.92, + "latex": "\\hat { \\beta } _ { n , \\lambda }" + }, + { + "category_id": 13, + "poly": [ + 401, + 1319, + 564, + 1319, + 564, + 1349, + 401, + 1349 + ], + "score": 0.91, + "latex": "X \\ = \\ U \\Sigma V ^ { T }" + }, + { + "category_id": 13, + "poly": [ + 572, + 1863, + 647, + 1863, + 647, + 1896, + 572, + 1896 + ], + "score": 0.91, + "latex": "| | \\beta ^ { * } | | _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 563, + 1352, + 688, + 1352, + 688, + 1385, + 563, + 1385 + ], + "score": 0.91, + "latex": "( \\gamma _ { 1 } , \\ldots \\gamma _ { d } )" + }, + { + "category_id": 13, + "poly": [ + 1099, + 1353, + 1183, + 1353, + 1183, + 1384, + 1099, + 1384 + ], + "score": 0.9, + "latex": "\\gamma _ { i } = 0" + }, + { + "category_id": 13, + "poly": [ + 1229, + 1354, + 1393, + 1354, + 1393, + 1385, + 1229, + 1385 + ], + "score": 0.89, + "latex": "i > \\operatorname* { m i n } ( n , d )" + }, + { + "category_id": 13, + "poly": [ + 298, + 1350, + 499, + 1350, + 499, + 1383, + 298, + 1383 + ], + "score": 0.88, + "latex": "\\mathbb { R } ^ { n \\times d } , V \\in \\mathbb { R } ^ { d \\times d }" + }, + { + "category_id": 13, + "poly": [ + 1192, + 1321, + 1405, + 1321, + 1405, + 1353, + 1192, + 1353 + ], + "score": 0.88, + "latex": "U \\ \\in \\ \\mathbb { R } ^ { n \\times n } , \\Sigma \\ \\in" + }, + { + "category_id": 13, + "poly": [ + 431, + 1836, + 453, + 1836, + 453, + 1860, + 431, + 1860 + ], + "score": 0.85, + "latex": "\\Sigma" + }, + { + "category_id": 13, + "poly": [ + 981, + 1803, + 1006, + 1803, + 1006, + 1829, + 981, + 1829 + ], + "score": 0.83, + "latex": "V" + }, + { + "category_id": 13, + "poly": [ + 656, + 1834, + 680, + 1834, + 680, + 1860, + 656, + 1860 + ], + "score": 0.83, + "latex": "V" + }, + { + "category_id": 13, + "poly": [ + 1087, + 1323, + 1114, + 1323, + 1114, + 1349, + 1087, + 1349 + ], + "score": 0.83, + "latex": "X" + }, + { + "category_id": 13, + "poly": [ + 666, + 636, + 685, + 636, + 685, + 657, + 666, + 657 + ], + "score": 0.77, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 484, + 633, + 499, + 633, + 499, + 656, + 484, + 656 + ], + "score": 0.49, + "latex": "^ { l }" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 475.0, + 775.0, + 475.0, + 775.0, + 511.0, + 296.0, + 511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 815.0, + 72.0, + 815.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 220.0, + 514.0, + 220.0, + 514.0, + 270.0, + 293.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1380.0, + 1920.0, + 1401.0, + 1920.0, + 1401.0, + 1942.0, + 1380.0, + 1942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 305.0, + 1403.0, + 305.0, + 1403.0, + 337.0, + 294.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 334.0, + 1405.0, + 334.0, + 1405.0, + 369.0, + 294.0, + 369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 365.0, + 1404.0, + 365.0, + 1404.0, + 401.0, + 293.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 398.0, + 577.0, + 398.0, + 577.0, + 431.0, + 294.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1799.0, + 980.0, + 1799.0, + 980.0, + 1837.0, + 293.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 1799.0, + 1404.0, + 1799.0, + 1404.0, + 1837.0, + 1007.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1827.0, + 430.0, + 1827.0, + 430.0, + 1869.0, + 293.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 1827.0, + 655.0, + 1827.0, + 655.0, + 1869.0, + 454.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 1827.0, + 762.0, + 1827.0, + 762.0, + 1869.0, + 681.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 1827.0, + 1407.0, + 1827.0, + 1407.0, + 1869.0, + 893.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1856.0, + 571.0, + 1856.0, + 571.0, + 1900.0, + 293.0, + 1900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 1856.0, + 659.0, + 1856.0, + 659.0, + 1900.0, + 648.0, + 1900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1316.0, + 400.0, + 1316.0, + 400.0, + 1355.0, + 293.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 1316.0, + 1086.0, + 1316.0, + 1086.0, + 1355.0, + 565.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 1316.0, + 1191.0, + 1316.0, + 1191.0, + 1355.0, + 1115.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1342.0, + 297.0, + 1342.0, + 297.0, + 1393.0, + 290.0, + 1393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.0, + 1342.0, + 562.0, + 1342.0, + 562.0, + 1393.0, + 500.0, + 1393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 689.0, + 1342.0, + 1098.0, + 1342.0, + 1098.0, + 1393.0, + 689.0, + 1393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1184.0, + 1342.0, + 1228.0, + 1342.0, + 1228.0, + 1393.0, + 1184.0, + 1393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1342.0, + 1407.0, + 1342.0, + 1407.0, + 1393.0, + 1394.0, + 1393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1378.0, + 503.0, + 1378.0, + 503.0, + 1419.0, + 294.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1999.0, + 584.0, + 1999.0, + 584.0, + 2039.0, + 295.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 623.0, + 483.0, + 623.0, + 483.0, + 669.0, + 293.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.0, + 623.0, + 665.0, + 623.0, + 665.0, + 669.0, + 500.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 623.0, + 1224.0, + 623.0, + 1224.0, + 669.0, + 686.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 874.0, + 564.0, + 874.0, + 564.0, + 930.0, + 291.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 874.0, + 799.0, + 874.0, + 799.0, + 930.0, + 618.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 536.0, + 583.0, + 536.0, + 583.0, + 578.0, + 294.0, + 578.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 555, + 1245, + 1144, + 1245, + 1144, + 1410, + 555, + 1410 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 297, + 909, + 1405, + 909, + 1405, + 1005, + 297, + 1005 + ], + "score": 0.974 + }, + { + "category_id": 8, + "poly": [ + 532, + 281, + 1164, + 281, + 1164, + 511, + 532, + 511 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 576, + 1054, + 1122, + 1054, + 1122, + 1177, + 576, + 1177 + ], + "score": 0.959 + }, + { + "category_id": 8, + "poly": [ + 656, + 1475, + 1046, + 1475, + 1046, + 1554, + 656, + 1554 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 520, + 1671, + 1177, + 1671, + 1177, + 1949, + 520, + 1949 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 297, + 1970, + 1407, + 1970, + 1407, + 2037, + 297, + 2037 + ], + "score": 0.938 + }, + { + "category_id": 1, + "poly": [ + 298, + 1570, + 1228, + 1570, + 1228, + 1605, + 298, + 1605 + ], + "score": 0.937 + }, + { + "category_id": 1, + "poly": [ + 297, + 1428, + 456, + 1428, + 456, + 1460, + 297, + 1460 + ], + "score": 0.932 + }, + { + "category_id": 1, + "poly": [ + 299, + 533, + 1147, + 533, + 1147, + 585, + 299, + 585 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 296, + 1193, + 943, + 1193, + 943, + 1227, + 296, + 1227 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 298, + 1025, + 398, + 1025, + 398, + 1056, + 298, + 1056 + ], + "score": 0.919 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 814, + 73, + 814, + 106, + 298, + 106 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 291, + 227, + 1349, + 227, + 1349, + 265, + 291, + 265 + ], + "score": 0.918 + }, + { + "category_id": 1, + "poly": [ + 296, + 601, + 1032, + 601, + 1032, + 636, + 296, + 636 + ], + "score": 0.916 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1498, + 1402, + 1498, + 1402, + 1530, + 1351, + 1530 + ], + "score": 0.897 + }, + { + "category_id": 9, + "poly": [ + 1351, + 737, + 1401, + 737, + 1401, + 769, + 1351, + 769 + ], + "score": 0.893 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1849, + 1401, + 1849, + 1401, + 1880, + 1351, + 1880 + ], + "score": 0.891 + }, + { + "category_id": 8, + "poly": [ + 593, + 708, + 1110, + 708, + 1110, + 801, + 593, + 801 + ], + "score": 0.89 + }, + { + "category_id": 9, + "poly": [ + 1351, + 662, + 1401, + 662, + 1401, + 694, + 1351, + 694 + ], + "score": 0.887 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1917, + 1400, + 1917, + 1400, + 1948, + 1351, + 1948 + ], + "score": 0.885 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2114, + 836, + 2114 + ], + "score": 0.867 + }, + { + "category_id": 2, + "poly": [ + 1374, + 819, + 1403, + 819, + 1403, + 849, + 1374, + 849 + ], + "score": 0.832 + }, + { + "category_id": 8, + "poly": [ + 589, + 654, + 831, + 654, + 831, + 701, + 589, + 701 + ], + "score": 0.69 + }, + { + "category_id": 14, + "poly": [ + 518, + 1669, + 1179, + 1669, + 1179, + 1954, + 518, + 1954 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { \\overline { { R } } ( \\hat { \\beta } _ { n + 1 , \\lambda } ) - \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) } \\\\ & { \\quad = \\underset { ( \\widetilde { \\gamma } _ { 1 } , \\dots , \\widetilde { \\gamma } _ { d } ) \\sim \\Gamma _ { n + 1 } } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } S ( \\widetilde { \\gamma } _ { i } ) \\right] - \\underset { ( \\gamma _ { 1 } , \\dots , \\gamma _ { d } ) \\sim \\Gamma _ { n } } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } S ( \\gamma _ { i } ) \\right] } \\\\ & { \\quad = \\underset { ( \\{ \\widetilde { \\gamma } _ { i } \\} , \\{ \\gamma _ { i } \\} ) \\sim \\Pi } { \\mathbb { E } } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { d } S ( \\widetilde { \\gamma } _ { i } ) - S ( \\gamma _ { i } ) \\right] } \\\\ & { \\quad \\le 0 } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 576, + 1054, + 1123, + 1054, + 1123, + 1180, + 576, + 1180 + ], + "score": 0.94, + "latex": "{ \\overline { { R } } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\operatorname * { \\mathbb { E } } _ { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma } [ \\sum _ { i } \\underbrace { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } / d + \\sigma ^ { 2 } \\gamma _ { i } ^ { 2 } } _ { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } ]" + }, + { + "category_id": 14, + "poly": [ + 529, + 281, + 1167, + 281, + 1167, + 516, + 529, + 516 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { \\frac { \\partial } { \\partial \\lambda } \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\frac { \\partial } { \\partial \\lambda } _ { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma } \\left[ \\displaystyle \\sum _ { i } \\frac { | | \\beta | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } / d + \\sigma ^ { 2 } \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } \\right] } \\\\ & { = 2 ( | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda / d - \\sigma ^ { 2 } ) _ { ( \\underbrace { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma } _ { > 0 } } \\left[ \\displaystyle \\sum _ { i } \\frac { \\gamma _ { i } ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 3 } } \\right] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 989, + 534, + 1139, + 534, + 1139, + 584, + 989, + 584 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { \\lambda _ { n } ^ { \\mathrm { o p t } } = \\frac { d \\sigma ^ { 2 } } { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 553, + 1243, + 1143, + 1243, + 1143, + 1411, + 553, + 1411 + ], + "score": 0.94, + "latex": "\\begin{array} { l } { \\displaystyle { \\frac { \\partial } { \\partial \\gamma _ { i } } \\sum _ { i } S ( \\gamma _ { i } ) = \\frac { \\partial } { \\partial \\gamma _ { i } } S ( \\gamma _ { i } ) } } \\\\ { \\displaystyle { \\quad = ( \\frac { - 2 \\gamma _ { i } } { d } ) \\frac { 2 | | \\beta ^ { * } | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } + d \\sigma ^ { 2 } ( \\gamma _ { i } ^ { 2 } - \\lambda ) } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 3 } } } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 654, + 1473, + 1046, + 1473, + 1046, + 1553, + 654, + 1553 + ], + "score": 0.93, + "latex": "\\lambda \\geq \\frac { d \\sigma ^ { 2 } } { 2 \\vert \\vert \\beta ^ { * } \\vert \\vert ^ { 2 } } \\implies \\frac { \\partial } { \\partial \\gamma _ { i } } S ( \\gamma _ { i } ) \\leq 0" + }, + { + "category_id": 14, + "poly": [ + 585, + 651, + 1112, + 651, + 1112, + 804, + 585, + 804 + ], + "score": 0.92, + "latex": "\\begin{array} { l } { \\displaystyle \\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } ) = \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) } \\\\ { \\displaystyle = \\frac { \\mathbb { E } } { ( \\gamma _ { 1 } , \\dots \\gamma _ { d } ) \\sim \\Gamma _ { n } } \\left[ \\sum _ { i = 1 } ^ { d } \\frac { \\sigma ^ { 2 } } { \\gamma _ { i } ^ { 2 } + d \\sigma ^ { 2 } / | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } \\right] + \\sigma ^ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 368, + 534, + 743, + 534, + 743, + 584, + 368, + 584 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\frac { \\partial } { \\partial \\lambda } \\overline { { R } } ( \\widehat { \\beta } _ { n , \\lambda } ) = 0 \\implies \\lambda = \\frac { d \\sigma ^ { 2 } } { | | \\beta ^ { * } | | _ { 2 } ^ { 2 } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 297, + 2002, + 384, + 2002, + 384, + 2036, + 297, + 2036 + ], + "score": 0.91, + "latex": "\\widetilde { \\gamma } _ { i } \\geq \\gamma _ { i }" + }, + { + "category_id": 13, + "poly": [ + 425, + 942, + 527, + 942, + 527, + 974, + 425, + 974 + ], + "score": 0.89, + "latex": "( \\widetilde { \\gamma } _ { i } \\geq \\gamma _ { i } )" + }, + { + "category_id": 13, + "poly": [ + 905, + 1200, + 931, + 1200, + 931, + 1227, + 905, + 1227 + ], + "score": 0.84, + "latex": "\\gamma _ { i }" + }, + { + "category_id": 13, + "poly": [ + 372, + 1974, + 396, + 1974, + 396, + 2000, + 372, + 2000 + ], + "score": 0.8, + "latex": "\\Pi" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 815.0, + 72.0, + 815.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 824.0, + 1403.0, + 824.0, + 1403.0, + 851.0, + 1377.0, + 851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 908.0, + 1403.0, + 908.0, + 1403.0, + 947.0, + 295.0, + 947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 939.0, + 424.0, + 939.0, + 424.0, + 978.0, + 292.0, + 978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 528.0, + 939.0, + 1406.0, + 939.0, + 1406.0, + 978.0, + 528.0, + 978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 972.0, + 1066.0, + 972.0, + 1066.0, + 1008.0, + 295.0, + 1008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1966.0, + 371.0, + 1966.0, + 371.0, + 2010.0, + 292.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 1966.0, + 1405.0, + 1966.0, + 1405.0, + 2010.0, + 397.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1997.0, + 296.0, + 1997.0, + 296.0, + 2044.0, + 291.0, + 2044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 1997.0, + 399.0, + 1997.0, + 399.0, + 2044.0, + 385.0, + 2044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1378.0, + 2009.0, + 1400.0, + 2009.0, + 1400.0, + 2030.0, + 1378.0, + 2030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1567.0, + 1233.0, + 1567.0, + 1233.0, + 1609.0, + 292.0, + 1609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1423.0, + 459.0, + 1423.0, + 459.0, + 1463.0, + 294.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 531.0, + 367.0, + 531.0, + 367.0, + 587.0, + 291.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 744.0, + 531.0, + 988.0, + 531.0, + 988.0, + 587.0, + 744.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 530.0, + 1156.0, + 530.0, + 1156.0, + 590.0, + 1140.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1190.0, + 904.0, + 1190.0, + 904.0, + 1233.0, + 295.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 1190.0, + 945.0, + 1190.0, + 945.0, + 1233.0, + 932.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1020.0, + 401.0, + 1020.0, + 401.0, + 1060.0, + 293.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 228.0, + 1352.0, + 228.0, + 1352.0, + 268.0, + 294.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 600.0, + 1032.0, + 600.0, + 1032.0, + 639.0, + 293.0, + 639.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 284, + 1405, + 284, + 1405, + 425, + 296, + 425 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 297, + 436, + 1406, + 436, + 1406, + 528, + 297, + 528 + ], + "score": 0.969 + }, + { + "category_id": 8, + "poly": [ + 535, + 977, + 1161, + 977, + 1161, + 1220, + 535, + 1220 + ], + "score": 0.967 + }, + { + "category_id": 8, + "poly": [ + 569, + 545, + 1124, + 545, + 1124, + 656, + 569, + 656 + ], + "score": 0.956 + }, + { + "category_id": 8, + "poly": [ + 658, + 1961, + 1040, + 1961, + 1040, + 2030, + 658, + 2030 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 296, + 1835, + 1403, + 1835, + 1403, + 1900, + 296, + 1900 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 687, + 1309, + 1012, + 1309, + 1012, + 1367, + 687, + 1367 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 297, + 684, + 1398, + 684, + 1398, + 749, + 297, + 749 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 300, + 1248, + 1400, + 1248, + 1400, + 1310, + 300, + 1310 + ], + "score": 0.942 + }, + { + "category_id": 1, + "poly": [ + 294, + 765, + 1400, + 765, + 1400, + 837, + 294, + 837 + ], + "score": 0.937 + }, + { + "category_id": 8, + "poly": [ + 638, + 1577, + 884, + 1577, + 884, + 1616, + 638, + 1616 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 295, + 850, + 1404, + 850, + 1404, + 920, + 295, + 920 + ], + "score": 0.931 + }, + { + "category_id": 8, + "poly": [ + 633, + 1717, + 1128, + 1717, + 1128, + 1757, + 633, + 1757 + ], + "score": 0.928 + }, + { + "category_id": 8, + "poly": [ + 635, + 1509, + 1123, + 1509, + 1123, + 1570, + 635, + 1570 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 299, + 933, + 629, + 933, + 629, + 965, + 299, + 965 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 297, + 1393, + 652, + 1393, + 652, + 1425, + 297, + 1425 + ], + "score": 0.923 + }, + { + "category_id": 8, + "poly": [ + 569, + 1441, + 944, + 1441, + 944, + 1501, + 569, + 1501 + ], + "score": 0.921 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 814, + 73, + 814, + 106, + 298, + 106 + ], + "score": 0.917 + }, + { + "category_id": 8, + "poly": [ + 637, + 1670, + 1013, + 1670, + 1013, + 1709, + 637, + 1709 + ], + "score": 0.915 + }, + { + "category_id": 1, + "poly": [ + 297, + 1914, + 512, + 1914, + 512, + 1946, + 297, + 1946 + ], + "score": 0.912 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1978, + 1401, + 1978, + 1401, + 2010, + 1351, + 2010 + ], + "score": 0.897 + }, + { + "category_id": 8, + "poly": [ + 636, + 1762, + 1059, + 1762, + 1059, + 1806, + 636, + 1806 + ], + "score": 0.895 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1771, + 1400, + 1771, + 1400, + 1801, + 1352, + 1801 + ], + "score": 0.887 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1449, + 1400, + 1449, + 1400, + 1480, + 1351, + 1480 + ], + "score": 0.883 + }, + { + "category_id": 0, + "poly": [ + 301, + 228, + 722, + 228, + 722, + 262, + 301, + 262 + ], + "score": 0.88 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1583, + 1400, + 1583, + 1400, + 1613, + 1352, + 1613 + ], + "score": 0.877 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.875 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1516, + 1400, + 1516, + 1400, + 1547, + 1352, + 1547 + ], + "score": 0.874 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1723, + 1400, + 1723, + 1400, + 1754, + 1352, + 1754 + ], + "score": 0.872 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1676, + 1400, + 1676, + 1400, + 1707, + 1352, + 1707 + ], + "score": 0.871 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1629, + 1400, + 1629, + 1400, + 1660, + 1352, + 1660 + ], + "score": 0.87 + }, + { + "category_id": 8, + "poly": [ + 629, + 1623, + 1127, + 1623, + 1127, + 1664, + 629, + 1664 + ], + "score": 0.808 + }, + { + "category_id": 14, + "poly": [ + 568, + 1437, + 1132, + 1437, + 1132, + 1813, + 568, + 1813 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } & { R ( \\hat { \\beta } ) = \\underset { ( \\bar { x } , y ) \\sim \\mathcal { D } } { \\mathbb { E } } [ ( \\langle P x , \\hat { \\beta } \\rangle - y ) ^ { 2 } ] } \\\\ & { \\quad = \\underset { ( \\bar { x } , y ) \\sim \\mathcal { D } , \\eta \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } ) } { \\mathbb { E } } [ ( \\langle x , P ^ { T } \\hat { \\beta } - \\theta \\rangle + \\eta ) ^ { 2 } ] } \\\\ & { \\quad = \\sigma ^ { 2 } + \\vert \\vert \\theta - P ^ { T } \\hat { \\beta } \\vert \\vert _ { 2 } ^ { 2 } } \\\\ & { \\quad = \\sigma ^ { 2 } + \\vert \\vert \\theta - P ^ { T } \\beta ^ { * } \\vert \\vert _ { 2 } ^ { 2 } + \\vert \\vert P ^ { T } \\beta ^ { * } - P ^ { T } \\hat { \\beta } \\vert \\vert _ { 2 } ^ { 2 } } \\\\ & { \\quad + 2 \\langle ( \\theta - P ^ { T } \\beta ^ { * } ) , P ^ { T } \\beta ^ { * } - P ^ { T } \\hat { \\beta } \\rangle } \\\\ & { \\quad = \\sigma ^ { 2 } + \\vert \\vert \\theta - P ^ { T } \\beta ^ { * } \\vert \\vert _ { 2 } ^ { 2 } + \\vert \\vert P ^ { T } \\beta ^ { * } - P ^ { T } \\hat { \\beta } \\vert \\vert _ { 2 } ^ { 2 } } \\\\ & { \\quad = \\sigma ^ { 2 } + \\vert \\vert \\vert \\theta - P ^ { T } P \\theta \\vert \\vert _ { 2 } ^ { 2 } + \\vert \\vert \\beta ^ { * } - \\hat { \\beta } \\vert \\vert _ { 2 } ^ { 2 } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 535, + 978, + 1164, + 978, + 1164, + 1222, + 535, + 1222 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { \\overline { { R } } ( \\hat { \\beta } _ { d , \\lambda } ) : = \\underset { P } { \\mathbb { E } } \\underset { \\widetilde { X } , \\widetilde { y } \\sim \\mathcal { D } ^ { n } } { \\mathbb { E } } [ R _ { P } ( \\hat { \\beta } _ { d , \\lambda } ( \\widetilde { X } , \\overrightarrow { y } ) ] } \\\\ & { = \\sigma ^ { 2 } + ( 1 - \\frac { d } { p } ) | | \\theta | | _ { 2 } ^ { 2 } } \\\\ & { + \\underset { ( \\gamma _ { 1 } , \\dotsc , \\gamma _ { m } ) \\sim \\Gamma _ { d } } { \\mathbb { E } } \\left[ \\underset { i = 1 } { \\overset { p } { \\sum } } \\frac { ( \\sigma ^ { 2 } + \\frac { p - d } { p } | | \\theta | | _ { 2 } ^ { 2 } ) \\gamma _ { i } ^ { 2 } + \\frac { d } { p ^ { 2 } } | | \\theta | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } } { ( \\gamma _ { i } ^ { 2 } + \\lambda ) ^ { 2 } } \\right] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 953, + 437, + 1110, + 437, + 1110, + 490, + 953, + 490 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { \\lambda _ { d } ^ { \\mathrm { o p t } } = \\frac { p ^ { 2 } \\widetilde \\sigma ^ { 2 } } { d | | \\theta | | _ { 2 } ^ { 2 } } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 568, + 543, + 1128, + 543, + 1128, + 657, + 568, + 657 + ], + "score": 0.94, + "latex": "\\overline { { R } } ( \\hat { \\beta } _ { d } ^ { \\mathrm { o p t } } ) = \\widetilde { \\sigma } ^ { 2 } + \\underset { ( \\gamma _ { 1 } , \\ldots , \\gamma _ { m } ) \\sim \\Gamma _ { d } } { \\mathbb { E } } \\left[ \\sum _ { i = 1 } ^ { p } \\frac { \\widetilde { \\sigma } ^ { 2 } } { \\gamma _ { i } ^ { 2 } + \\frac { \\widetilde { \\sigma } ^ { 2 } p ^ { 2 } } { d | | \\theta | | _ { 2 } ^ { 2 } } } \\right]" + }, + { + "category_id": 14, + "poly": [ + 686, + 1306, + 1014, + 1306, + 1014, + 1369, + 686, + 1369 + ], + "score": 0.93, + "latex": "\\beta _ { P } ^ { * } : = \\underset { \\beta \\in \\mathbb { R } ^ { d } } { \\mathrm { a r g m i n } } R _ { P } ( \\beta ) = P \\theta" + }, + { + "category_id": 14, + "poly": [ + 658, + 1957, + 1041, + 1957, + 1041, + 2031, + 658, + 2031 + ], + "score": 0.93, + "latex": "\\underset { P } { \\mathbb { E } } | | \\theta - P ^ { T } P \\theta | | _ { 2 } ^ { 2 } = ( 1 - \\frac { d } { p } ) | | \\theta | | _ { 2 } ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 298, + 486, + 466, + 486, + 466, + 532, + 298, + 532 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\sigma ^ { 2 } + \\frac { p - d } { p } | | \\boldsymbol { \\theta } | | _ { 2 } ^ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1309, + 287, + 1400, + 287, + 1400, + 322, + 1309, + 322 + ], + "score": 0.92, + "latex": "\\mathcal { N } ( 0 , 1 )" + }, + { + "category_id": 13, + "poly": [ + 429, + 1865, + 654, + 1865, + 654, + 1900, + 429, + 1900 + ], + "score": 0.92, + "latex": "P ( \\theta ^ { * } - P ^ { T } \\beta ^ { * } ) = 0" + }, + { + "category_id": 13, + "poly": [ + 1309, + 766, + 1400, + 766, + 1400, + 801, + 1309, + 801 + ], + "score": 0.92, + "latex": "\\mathcal { N } ( 0 , 1 )" + }, + { + "category_id": 13, + "poly": [ + 914, + 767, + 1046, + 767, + 1046, + 796, + 914, + 796 + ], + "score": 0.91, + "latex": "\\ b { X } \\in \\mathbb { R } ^ { n \\times p }" + }, + { + "category_id": 13, + "poly": [ + 438, + 322, + 565, + 322, + 565, + 353, + 438, + 353 + ], + "score": 0.91, + "latex": "P \\in \\mathbb { R } ^ { d \\times p }" + }, + { + "category_id": 13, + "poly": [ + 298, + 391, + 464, + 391, + 464, + 424, + 298, + 424 + ], + "score": 0.91, + "latex": "i > \\operatorname* { m i n } ( n , d ) )" + }, + { + "category_id": 13, + "poly": [ + 914, + 288, + 1046, + 288, + 1046, + 317, + 914, + 317 + ], + "score": 0.91, + "latex": "\\ b { X } \\in \\mathbb { R } ^ { n \\times p }" + }, + { + "category_id": 13, + "poly": [ + 431, + 802, + 550, + 802, + 550, + 833, + 431, + 833 + ], + "score": 0.91, + "latex": "P \\in \\mathbb { R } ^ { d \\times p }" + }, + { + "category_id": 13, + "poly": [ + 1016, + 798, + 1151, + 798, + 1151, + 833, + 1016, + 833 + ], + "score": 0.91, + "latex": "\\widetilde X : = X P ^ { T }" + }, + { + "category_id": 13, + "poly": [ + 1205, + 804, + 1316, + 804, + 1316, + 837, + 1205, + 837 + ], + "score": 0.91, + "latex": "\\beta ^ { * } : = P \\theta" + }, + { + "category_id": 13, + "poly": [ + 959, + 851, + 1089, + 851, + 1089, + 884, + 959, + 884 + ], + "score": 0.91, + "latex": "\\tilde { X } \\in \\mathbb { R } ^ { n \\times d }" + }, + { + "category_id": 13, + "poly": [ + 1046, + 318, + 1189, + 318, + 1189, + 354, + 1046, + 354 + ], + "score": 0.91, + "latex": "\\widetilde { X } : = X P ^ { T }" + }, + { + "category_id": 13, + "poly": [ + 785, + 355, + 925, + 355, + 925, + 389, + 785, + 389 + ], + "score": 0.91, + "latex": "\\tilde { X } \\in \\mathbb { R } ^ { n \\times d }" + }, + { + "category_id": 13, + "poly": [ + 1143, + 855, + 1335, + 855, + 1335, + 888, + 1143, + 888 + ], + "score": 0.9, + "latex": "m : = \\operatorname* { m a x } ( n , d )" + }, + { + "category_id": 13, + "poly": [ + 1263, + 361, + 1358, + 361, + 1358, + 392, + 1263, + 392 + ], + "score": 0.9, + "latex": "\\gamma _ { i } ~ = ~ 0" + }, + { + "category_id": 13, + "poly": [ + 1254, + 324, + 1399, + 324, + 1399, + 359, + 1254, + 359 + ], + "score": 0.89, + "latex": "\\left( \\gamma _ { 1 } , \\dots , \\gamma _ { m } \\right)" + }, + { + "category_id": 13, + "poly": [ + 1096, + 888, + 1240, + 888, + 1240, + 919, + 1096, + 919 + ], + "score": 0.89, + "latex": "\\left( \\gamma _ { 1 } , \\dots , \\gamma _ { m } \\right)" + }, + { + "category_id": 13, + "poly": [ + 343, + 856, + 488, + 856, + 488, + 888, + 343, + 888 + ], + "score": 0.89, + "latex": "\\left( \\gamma _ { 1 } , \\dots , \\gamma _ { m } \\right)" + }, + { + "category_id": 13, + "poly": [ + 1230, + 1838, + 1261, + 1838, + 1261, + 1868, + 1230, + 1868 + ], + "score": 0.89, + "latex": "\\beta ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 789, + 289, + 866, + 289, + 866, + 318, + 789, + 318 + ], + "score": 0.88, + "latex": "\\lambda > 0 ;" + }, + { + "category_id": 13, + "poly": [ + 417, + 886, + 585, + 886, + 585, + 918, + 417, + 918 + ], + "score": 0.88, + "latex": "i > \\operatorname* { m i n } ( n , d ) )" + }, + { + "category_id": 13, + "poly": [ + 789, + 768, + 865, + 768, + 865, + 797, + 789, + 797 + ], + "score": 0.88, + "latex": "\\lambda > 0" + }, + { + "category_id": 13, + "poly": [ + 642, + 887, + 676, + 887, + 676, + 917, + 642, + 917 + ], + "score": 0.88, + "latex": "\\Gamma _ { d }" + }, + { + "category_id": 13, + "poly": [ + 976, + 392, + 1119, + 392, + 1119, + 425, + 976, + 425 + ], + "score": 0.88, + "latex": "\\left( \\gamma _ { 1 } , \\ldots , \\gamma _ { m } \\right)" + }, + { + "category_id": 13, + "poly": [ + 986, + 359, + 1189, + 359, + 1189, + 392, + 986, + 392 + ], + "score": 0.87, + "latex": "m : = \\operatorname* { m a x } ( n , d )" + }, + { + "category_id": 13, + "poly": [ + 522, + 391, + 555, + 391, + 555, + 421, + 522, + 421 + ], + "score": 0.87, + "latex": "\\Gamma _ { d }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1868, + 330, + 1868, + 330, + 1898, + 298, + 1898 + ], + "score": 0.87, + "latex": "\\beta ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 517, + 289, + 606, + 289, + 606, + 318, + 517, + 318 + ], + "score": 0.86, + "latex": "\\theta \\in \\mathbb { R } ^ { p }" + }, + { + "category_id": 13, + "poly": [ + 1325, + 444, + 1403, + 444, + 1403, + 479, + 1325, + 479 + ], + "score": 0.86, + "latex": "\\widetilde { \\sigma } ^ { 2 } : = \\ :" + }, + { + "category_id": 13, + "poly": [ + 619, + 289, + 727, + 289, + 727, + 320, + 619, + 320 + ], + "score": 0.82, + "latex": "d , n \\in \\mathbb { N } ," + }, + { + "category_id": 13, + "poly": [ + 297, + 889, + 374, + 889, + 374, + 918, + 297, + 918 + ], + "score": 0.76, + "latex": "\\gamma _ { i } = 0" + }, + { + "category_id": 13, + "poly": [ + 619, + 768, + 727, + 768, + 727, + 799, + 619, + 799 + ], + "score": 0.65, + "latex": "d , n \\in \\mathbb { N } ," + }, + { + "category_id": 13, + "poly": [ + 517, + 768, + 605, + 768, + 605, + 797, + 517, + 797 + ], + "score": 0.62, + "latex": "\\theta \\in \\mathbb { R } ^ { p }" + }, + { + "category_id": 13, + "poly": [ + 914, + 447, + 932, + 447, + 932, + 474, + 914, + 474 + ], + "score": 0.55, + "latex": "d" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 815.0, + 72.0, + 815.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 228.0, + 724.0, + 228.0, + 724.0, + 265.0, + 296.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 871.0, + 2085.0, + 871.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 283.0, + 516.0, + 283.0, + 516.0, + 323.0, + 293.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 283.0, + 618.0, + 283.0, + 618.0, + 323.0, + 607.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 728.0, + 283.0, + 788.0, + 283.0, + 788.0, + 323.0, + 728.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 283.0, + 913.0, + 283.0, + 913.0, + 323.0, + 867.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 283.0, + 1308.0, + 283.0, + 1308.0, + 323.0, + 1047.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 283.0, + 1405.0, + 283.0, + 1405.0, + 323.0, + 1401.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 313.0, + 437.0, + 313.0, + 437.0, + 365.0, + 290.0, + 365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 313.0, + 1045.0, + 313.0, + 1045.0, + 365.0, + 566.0, + 365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1190.0, + 313.0, + 1253.0, + 313.0, + 1253.0, + 365.0, + 1190.0, + 365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1400.0, + 313.0, + 1406.0, + 313.0, + 1406.0, + 365.0, + 1400.0, + 365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 351.0, + 784.0, + 351.0, + 784.0, + 397.0, + 291.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 351.0, + 985.0, + 351.0, + 985.0, + 397.0, + 926.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1190.0, + 351.0, + 1262.0, + 351.0, + 1262.0, + 397.0, + 1190.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1359.0, + 351.0, + 1406.0, + 351.0, + 1406.0, + 397.0, + 1359.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 386.0, + 297.0, + 386.0, + 297.0, + 429.0, + 290.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 386.0, + 521.0, + 386.0, + 521.0, + 429.0, + 465.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 556.0, + 386.0, + 975.0, + 386.0, + 975.0, + 429.0, + 556.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 386.0, + 1133.0, + 386.0, + 1133.0, + 429.0, + 1120.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 281.0, + 432.0, + 913.0, + 432.0, + 913.0, + 501.0, + 281.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 933.0, + 432.0, + 952.0, + 432.0, + 952.0, + 501.0, + 933.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1111.0, + 431.0, + 1324.0, + 431.0, + 1324.0, + 496.0, + 1111.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 484.0, + 297.0, + 484.0, + 297.0, + 528.0, + 292.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 484.0, + 1129.0, + 484.0, + 1129.0, + 528.0, + 467.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1835.0, + 1229.0, + 1835.0, + 1229.0, + 1871.0, + 296.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1262.0, + 1835.0, + 1405.0, + 1835.0, + 1405.0, + 1871.0, + 1262.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1861.0, + 297.0, + 1861.0, + 297.0, + 1904.0, + 294.0, + 1904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 1861.0, + 428.0, + 1861.0, + 428.0, + 1904.0, + 331.0, + 1904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 655.0, + 1861.0, + 1236.0, + 1861.0, + 1236.0, + 1904.0, + 655.0, + 1904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 683.0, + 1404.0, + 683.0, + 1404.0, + 723.0, + 293.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 715.0, + 403.0, + 715.0, + 403.0, + 749.0, + 293.0, + 749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1375.0, + 719.0, + 1403.0, + 719.0, + 1403.0, + 746.0, + 1375.0, + 746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1246.0, + 1405.0, + 1246.0, + 1405.0, + 1285.0, + 295.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1276.0, + 446.0, + 1276.0, + 446.0, + 1317.0, + 294.0, + 1317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 759.0, + 516.0, + 759.0, + 516.0, + 805.0, + 293.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 759.0, + 618.0, + 759.0, + 618.0, + 805.0, + 606.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 728.0, + 759.0, + 788.0, + 759.0, + 788.0, + 805.0, + 728.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 759.0, + 913.0, + 759.0, + 913.0, + 805.0, + 866.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 759.0, + 1308.0, + 759.0, + 1308.0, + 805.0, + 1047.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 759.0, + 1405.0, + 759.0, + 1405.0, + 805.0, + 1401.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 798.0, + 430.0, + 798.0, + 430.0, + 840.0, + 294.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 551.0, + 798.0, + 1015.0, + 798.0, + 1015.0, + 840.0, + 551.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 798.0, + 1204.0, + 798.0, + 1204.0, + 840.0, + 1152.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1317.0, + 798.0, + 1327.0, + 798.0, + 1327.0, + 840.0, + 1317.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 845.0, + 342.0, + 845.0, + 342.0, + 894.0, + 292.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 489.0, + 845.0, + 958.0, + 845.0, + 958.0, + 894.0, + 489.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1090.0, + 845.0, + 1142.0, + 845.0, + 1142.0, + 894.0, + 1090.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 845.0, + 1407.0, + 845.0, + 1407.0, + 894.0, + 1336.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 881.0, + 296.0, + 881.0, + 296.0, + 926.0, + 290.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 375.0, + 881.0, + 416.0, + 881.0, + 416.0, + 926.0, + 375.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 586.0, + 881.0, + 641.0, + 881.0, + 641.0, + 926.0, + 586.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 677.0, + 881.0, + 1095.0, + 881.0, + 1095.0, + 926.0, + 677.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 881.0, + 1254.0, + 881.0, + 1254.0, + 926.0, + 1241.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 931.0, + 630.0, + 931.0, + 630.0, + 968.0, + 297.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1393.0, + 653.0, + 1393.0, + 653.0, + 1429.0, + 296.0, + 1429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1910.0, + 516.0, + 1910.0, + 516.0, + 1949.0, + 293.0, + 1949.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 541, + 1405, + 541, + 1405, + 642, + 296, + 642 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 296, + 1840, + 1404, + 1840, + 1404, + 1941, + 296, + 1941 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 297, + 1960, + 1405, + 1960, + 1405, + 2037, + 297, + 2037 + ], + "score": 0.944 + }, + { + "category_id": 8, + "poly": [ + 652, + 1660, + 1053, + 1660, + 1053, + 1726, + 652, + 1726 + ], + "score": 0.936 + }, + { + "category_id": 8, + "poly": [ + 531, + 989, + 1172, + 989, + 1172, + 1036, + 531, + 1036 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 296, + 1119, + 1036, + 1119, + 1036, + 1157, + 296, + 1157 + ], + "score": 0.924 + }, + { + "category_id": 8, + "poly": [ + 529, + 708, + 728, + 708, + 728, + 773, + 529, + 773 + ], + "score": 0.924 + }, + { + "category_id": 8, + "poly": [ + 656, + 1732, + 1035, + 1732, + 1035, + 1793, + 656, + 1793 + ], + "score": 0.92 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 814, + 73, + 814, + 106, + 298, + 106 + ], + "score": 0.917 + }, + { + "category_id": 8, + "poly": [ + 430, + 1248, + 935, + 1248, + 935, + 1310, + 430, + 1310 + ], + "score": 0.917 + }, + { + "category_id": 8, + "poly": [ + 430, + 1174, + 826, + 1174, + 826, + 1242, + 430, + 1242 + ], + "score": 0.915 + }, + { + "category_id": 1, + "poly": [ + 296, + 1549, + 1240, + 1549, + 1240, + 1589, + 296, + 1589 + ], + "score": 0.91 + }, + { + "category_id": 8, + "poly": [ + 530, + 849, + 1173, + 849, + 1173, + 914, + 530, + 914 + ], + "score": 0.904 + }, + { + "category_id": 8, + "poly": [ + 531, + 779, + 985, + 779, + 985, + 843, + 531, + 843 + ], + "score": 0.899 + }, + { + "category_id": 8, + "poly": [ + 430, + 1386, + 1066, + 1386, + 1066, + 1445, + 430, + 1445 + ], + "score": 0.897 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1741, + 1400, + 1741, + 1400, + 1772, + 1351, + 1772 + ], + "score": 0.895 + }, + { + "category_id": 1, + "poly": [ + 298, + 280, + 1124, + 280, + 1124, + 318, + 298, + 318 + ], + "score": 0.894 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1184, + 1400, + 1184, + 1400, + 1215, + 1352, + 1215 + ], + "score": 0.885 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1669, + 1400, + 1669, + 1400, + 1700, + 1352, + 1700 + ], + "score": 0.885 + }, + { + "category_id": 9, + "poly": [ + 1352, + 928, + 1400, + 928, + 1400, + 959, + 1352, + 959 + ], + "score": 0.884 + }, + { + "category_id": 9, + "poly": [ + 1352, + 715, + 1400, + 715, + 1400, + 746, + 1352, + 746 + ], + "score": 0.884 + }, + { + "category_id": 1, + "poly": [ + 295, + 227, + 1178, + 227, + 1178, + 264, + 295, + 264 + ], + "score": 0.881 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1473, + 1400, + 1473, + 1400, + 1504, + 1351, + 1504 + ], + "score": 0.881 + }, + { + "category_id": 9, + "poly": [ + 1352, + 484, + 1400, + 484, + 1400, + 515, + 1352, + 515 + ], + "score": 0.88 + }, + { + "category_id": 9, + "poly": [ + 1352, + 392, + 1400, + 392, + 1400, + 423, + 1352, + 423 + ], + "score": 0.878 + }, + { + "category_id": 9, + "poly": [ + 1352, + 436, + 1400, + 436, + 1400, + 467, + 1352, + 467 + ], + "score": 0.877 + }, + { + "category_id": 1, + "poly": [ + 296, + 1607, + 410, + 1607, + 410, + 1640, + 296, + 1640 + ], + "score": 0.876 + }, + { + "category_id": 9, + "poly": [ + 1352, + 858, + 1400, + 858, + 1400, + 889, + 1352, + 889 + ], + "score": 0.876 + }, + { + "category_id": 9, + "poly": [ + 1187, + 1394, + 1402, + 1394, + 1402, + 1428, + 1187, + 1428 + ], + "score": 0.875 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1039, + 1400, + 1039, + 1400, + 1069, + 1352, + 1069 + ], + "score": 0.875 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1256, + 1400, + 1256, + 1400, + 1287, + 1352, + 1287 + ], + "score": 0.874 + }, + { + "category_id": 9, + "poly": [ + 1351, + 787, + 1400, + 787, + 1400, + 818, + 1351, + 818 + ], + "score": 0.873 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.868 + }, + { + "category_id": 9, + "poly": [ + 1352, + 999, + 1400, + 999, + 1400, + 1029, + 1352, + 1029 + ], + "score": 0.856 + }, + { + "category_id": 8, + "poly": [ + 530, + 919, + 1063, + 919, + 1063, + 984, + 530, + 984 + ], + "score": 0.829 + }, + { + "category_id": 8, + "poly": [ + 433, + 1319, + 888, + 1319, + 888, + 1380, + 433, + 1380 + ], + "score": 0.806 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1328, + 1400, + 1328, + 1400, + 1359, + 1352, + 1359 + ], + "score": 0.733 + }, + { + "category_id": 8, + "poly": [ + 431, + 1457, + 925, + 1457, + 925, + 1526, + 431, + 1526 + ], + "score": 0.665 + }, + { + "category_id": 8, + "poly": [ + 644, + 389, + 1056, + 389, + 1056, + 518, + 644, + 518 + ], + "score": 0.652 + }, + { + "category_id": 8, + "poly": [ + 645, + 390, + 792, + 390, + 792, + 424, + 645, + 424 + ], + "score": 0.502 + }, + { + "category_id": 8, + "poly": [ + 667, + 478, + 856, + 478, + 856, + 517, + 667, + 517 + ], + "score": 0.339 + }, + { + "category_id": 8, + "poly": [ + 433, + 1319, + 884, + 1319, + 884, + 1379, + 433, + 1379 + ], + "score": 0.29 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1328, + 1400, + 1328, + 1400, + 1359, + 1352, + 1359 + ], + "score": 0.208 + }, + { + "category_id": 8, + "poly": [ + 662, + 431, + 1057, + 431, + 1057, + 469, + 662, + 469 + ], + "score": 0.2 + }, + { + "category_id": 8, + "poly": [ + 531, + 919, + 1063, + 919, + 1063, + 984, + 531, + 984 + ], + "score": 0.12 + }, + { + "category_id": 8, + "poly": [ + 645, + 390, + 792, + 390, + 792, + 424, + 645, + 424 + ], + "score": 0.115 + }, + { + "category_id": 14, + "poly": [ + 525, + 705, + 1176, + 705, + 1176, + 1039, + 525, + 1039 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } & { \\frac { \\mathbb { E } } { P } \\underset { \\tilde { X } , y } { \\mathbb { E } } | | \\hat { \\boldsymbol { \\beta } } - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { = \\underset { P } { \\mathbb { E } } \\underset { \\tilde { X } , y } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\boldsymbol { y } - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { = \\underset { P } { \\mathbb { E } } \\underset { \\tilde { X } , y , \\varepsilon , \\eta } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } ( \\widetilde { X } \\boldsymbol { \\beta } ^ { * } + \\varepsilon + \\eta ) - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { = \\underset { P } { \\overset { \\mathbb { E } } { \\mathbb { X } } } \\underset { y , \\varepsilon , \\eta } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\widetilde { X } \\boldsymbol { \\beta } ^ { * } - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { = \\underset { P } { \\overset { \\mathbb { E } } { \\mathbb { X } } } \\underset { y , \\varepsilon , \\eta } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\widetilde { X } \\boldsymbol { \\beta } ^ { * } - \\boldsymbol { \\beta } ^ { * } | | _ { 2 } ^ { 2 } } \\\\ & { + \\| ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\varepsilon | | _ { 2 } ^ { 2 } + | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\eta | | _ { 2 } ^ { 2 } ] } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 427, + 1171, + 1069, + 1171, + 1069, + 1529, + 427, + 1529 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } & { \\frac { \\mathbb { E } } { F } \\underset { \\tilde { X } , y , \\varepsilon | P } { \\mathbb { E } } \\ \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\varepsilon \\rVert _ { 2 } ^ { 2 } } \\\\ & { = \\mathbb { E } \\ \\underset { \\tilde { Y } } { \\mathbb { E } } \\ [ \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\rVert _ { F } ^ { 2 } \\ \\underset { \\varepsilon | P } { \\mathbb { E } } [ \\lVert \\varepsilon \\rVert _ { 2 } ^ { 2 } ] } \\\\ & { = \\frac { \\mathbb { E } } { \\frac { \\mathbb { E } } { \\tilde { X } } } \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\rVert _ { F } ^ { 2 } \\ \\underset { \\varepsilon , \\varepsilon } { \\mathbb { E } } [ \\lVert \\varepsilon \\rVert _ { 2 } ^ { 2 } ] } \\\\ & { = \\underset { \\tilde { X } } { \\mathbb { E } } [ \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\rVert _ { F } ^ { 2 } ] \\cdot \\underset { { P } , X } { \\mathbb { E } } [ \\lVert X ( 1 - P ^ { T } P ) \\theta \\rVert _ { 2 } ^ { 2 } ] } \\\\ & { = \\underset { \\tilde { X } } { \\mathbb { E } } [ \\lVert ( \\tilde { X } ^ { T } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { T } \\rVert _ { F } ^ { 2 } ] ( \\frac { p - d } { p } | \\theta \\rVert _ { 2 } ^ { 2 } ) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 643, + 386, + 1056, + 386, + 1056, + 521, + 643, + 521 + ], + "score": 0.93, + "latex": "\\begin{array} { l } { { \\vec { y } = X \\theta + \\eta } } \\\\ { { \\ = X P ^ { T } P \\theta + X ( 1 - P ^ { T } P ) \\theta + \\eta } } \\\\ { { \\ = \\widetilde { X } \\beta ^ { * } + \\varepsilon + \\eta } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1073, + 1877, + 1254, + 1877, + 1254, + 1909, + 1073, + 1909 + ], + "score": 0.93, + "latex": "m = \\operatorname* { m a x } ( n , d )" + }, + { + "category_id": 13, + "poly": [ + 1103, + 2001, + 1234, + 2001, + 1234, + 2035, + 1103, + 2035 + ], + "score": 0.92, + "latex": "Q \\in \\mathbb { R } ^ { p \\times p }" + }, + { + "category_id": 14, + "poly": [ + 648, + 1656, + 1053, + 1656, + 1053, + 1797, + 648, + 1797 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\frac { \\mathbb { E } } { P } \\underset { \\widetilde { X } , y , \\eta | P } { \\mathbb { E } } | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } \\eta | | _ { 2 } ^ { 2 } } \\\\ & { = \\sigma ^ { 2 } \\underset { \\widetilde { X } } { \\mathbb { E } } [ | | ( \\widetilde { X } ^ { T } \\widetilde { X } + \\lambda I ) ^ { - 1 } \\widetilde { X } ^ { T } | | _ { F } ^ { 2 } ] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 529, + 284, + 671, + 284, + 671, + 316, + 529, + 316 + ], + "score": 0.92, + "latex": "{ \\vec { y } } = X \\theta + \\eta" + }, + { + "category_id": 13, + "poly": [ + 749, + 281, + 934, + 281, + 934, + 317, + 749, + 317 + ], + "score": 0.92, + "latex": "\\eta \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } I _ { n } )" + }, + { + "category_id": 13, + "poly": [ + 665, + 1998, + 789, + 1998, + 789, + 2036, + 665, + 2036 + ], + "score": 0.92, + "latex": "( \\widetilde { X } Q , P Q )" + }, + { + "category_id": 13, + "poly": [ + 418, + 1908, + 577, + 1908, + 577, + 1941, + 418, + 1941 + ], + "score": 0.92, + "latex": "i > \\operatorname* { m i n } ( n , d )" + }, + { + "category_id": 13, + "poly": [ + 298, + 606, + 589, + 606, + 589, + 641, + 298, + 641 + ], + "score": 0.92, + "latex": "\\mathcal { N } ( \\dot { 0 _ { \\cdot } } | | ( 1 - P ^ { T } P ) \\theta | | ^ { 2 } I _ { n } )" + }, + { + "category_id": 13, + "poly": [ + 599, + 1960, + 727, + 1960, + 727, + 1995, + 599, + 1995 + ], + "score": 0.92, + "latex": "\\widetilde { X } = X P ^ { T }" + }, + { + "category_id": 13, + "poly": [ + 1318, + 1960, + 1400, + 1960, + 1400, + 1999, + 1318, + 1999 + ], + "score": 0.91, + "latex": "( \\widetilde { X } , P )" + }, + { + "category_id": 13, + "poly": [ + 402, + 1841, + 565, + 1841, + 565, + 1874, + 402, + 1874 + ], + "score": 0.91, + "latex": "\\tilde { \\cal X } \\ = \\ { \\cal U } \\Sigma { \\cal V } ^ { T }" + }, + { + "category_id": 13, + "poly": [ + 371, + 544, + 595, + 544, + 595, + 579, + 371, + 579 + ], + "score": 0.91, + "latex": "\\varepsilon : = X ( 1 - P ^ { T } P ) \\theta" + }, + { + "category_id": 13, + "poly": [ + 361, + 227, + 425, + 227, + 425, + 258, + 361, + 258 + ], + "score": 0.91, + "latex": "P ^ { T } P" + }, + { + "category_id": 13, + "poly": [ + 633, + 576, + 765, + 576, + 765, + 611, + 633, + 611 + ], + "score": 0.9, + "latex": "( I - P ^ { T } P )" + }, + { + "category_id": 13, + "poly": [ + 556, + 1877, + 689, + 1877, + 689, + 1909, + 556, + 1909 + ], + "score": 0.89, + "latex": "( \\gamma _ { 1 } , \\dots \\gamma _ { m } )" + }, + { + "category_id": 13, + "poly": [ + 297, + 1910, + 375, + 1910, + 375, + 1940, + 297, + 1940 + ], + "score": 0.89, + "latex": "\\gamma _ { i } = 0" + }, + { + "category_id": 13, + "poly": [ + 1192, + 1844, + 1403, + 1844, + 1403, + 1878, + 1192, + 1878 + ], + "score": 0.89, + "latex": "U \\ \\in \\ \\mathbb { R } ^ { n \\times n } , \\Sigma \\ \\in" + }, + { + "category_id": 13, + "poly": [ + 1088, + 540, + 1142, + 540, + 1142, + 578, + 1088, + 578 + ], + "score": 0.88, + "latex": "\\widetilde { X } , \\varepsilon" + }, + { + "category_id": 13, + "poly": [ + 426, + 1118, + 454, + 1118, + 454, + 1150, + 426, + 1150 + ], + "score": 0.87, + "latex": "\\widetilde { X }" + }, + { + "category_id": 13, + "poly": [ + 954, + 1550, + 982, + 1550, + 982, + 1583, + 954, + 1583 + ], + "score": 0.87, + "latex": "\\widetilde { X }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1874, + 497, + 1874, + 497, + 1908, + 298, + 1908 + ], + "score": 0.86, + "latex": "\\mathbb { R } ^ { n \\times d } , V \\in \\mathbb { R } ^ { d \\times d }" + }, + { + "category_id": 13, + "poly": [ + 1087, + 1841, + 1115, + 1841, + 1115, + 1874, + 1087, + 1874 + ], + "score": 0.86, + "latex": "\\widetilde { X }" + }, + { + "category_id": 13, + "poly": [ + 1322, + 1999, + 1351, + 1999, + 1351, + 2030, + 1322, + 2030 + ], + "score": 0.85, + "latex": "\\widetilde { X }" + }, + { + "category_id": 13, + "poly": [ + 514, + 578, + 578, + 578, + 578, + 605, + 514, + 605 + ], + "score": 0.85, + "latex": "P ^ { T } P" + }, + { + "category_id": 13, + "poly": [ + 857, + 579, + 885, + 579, + 885, + 605, + 857, + 605 + ], + "score": 0.84, + "latex": "X" + }, + { + "category_id": 13, + "poly": [ + 1002, + 1126, + 1025, + 1126, + 1025, + 1151, + 1002, + 1151 + ], + "score": 0.84, + "latex": "P" + }, + { + "category_id": 13, + "poly": [ + 885, + 548, + 909, + 548, + 909, + 574, + 885, + 574 + ], + "score": 0.83, + "latex": "P" + }, + { + "category_id": 13, + "poly": [ + 1207, + 1557, + 1231, + 1557, + 1231, + 1583, + 1207, + 1583 + ], + "score": 0.83, + "latex": "P" + }, + { + "category_id": 13, + "poly": [ + 1353, + 581, + 1404, + 581, + 1404, + 608, + 1353, + 608 + ], + "score": 0.81, + "latex": "\\varepsilon \\sim" + }, + { + "category_id": 13, + "poly": [ + 1191, + 553, + 1209, + 553, + 1209, + 579, + 1191, + 579 + ], + "score": 0.8, + "latex": "\\eta" + }, + { + "category_id": 13, + "poly": [ + 809, + 1131, + 825, + 1131, + 825, + 1151, + 809, + 1151 + ], + "score": 0.79, + "latex": "\\varepsilon" + }, + { + "category_id": 13, + "poly": [ + 900, + 233, + 918, + 233, + 918, + 258, + 900, + 258 + ], + "score": 0.78, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 778, + 1970, + 802, + 1970, + 802, + 1994, + 778, + 1994 + ], + "score": 0.78, + "latex": "P" + }, + { + "category_id": 13, + "poly": [ + 1376, + 1406, + 1391, + 1406, + 1391, + 1422, + 1376, + 1422 + ], + "score": 0.73, + "latex": "\\varepsilon" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 815.0, + 72.0, + 815.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 540.0, + 370.0, + 540.0, + 370.0, + 583.0, + 294.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 540.0, + 884.0, + 540.0, + 884.0, + 583.0, + 596.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 910.0, + 540.0, + 1087.0, + 540.0, + 1087.0, + 583.0, + 910.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1143.0, + 540.0, + 1190.0, + 540.0, + 1190.0, + 583.0, + 1143.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1210.0, + 540.0, + 1403.0, + 540.0, + 1403.0, + 583.0, + 1210.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 573.0, + 513.0, + 573.0, + 513.0, + 614.0, + 293.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 579.0, + 573.0, + 632.0, + 573.0, + 632.0, + 614.0, + 579.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 766.0, + 573.0, + 856.0, + 573.0, + 856.0, + 614.0, + 766.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 573.0, + 1352.0, + 573.0, + 1352.0, + 614.0, + 886.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 601.0, + 297.0, + 601.0, + 297.0, + 644.0, + 292.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 601.0, + 600.0, + 601.0, + 600.0, + 644.0, + 590.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1836.0, + 401.0, + 1836.0, + 401.0, + 1882.0, + 291.0, + 1882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 1836.0, + 1086.0, + 1836.0, + 1086.0, + 1882.0, + 566.0, + 1882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 1836.0, + 1191.0, + 1836.0, + 1191.0, + 1882.0, + 1116.0, + 1882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1867.0, + 297.0, + 1867.0, + 297.0, + 1918.0, + 290.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 1867.0, + 555.0, + 1867.0, + 555.0, + 1918.0, + 498.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1867.0, + 1072.0, + 1867.0, + 1072.0, + 1918.0, + 690.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1255.0, + 1867.0, + 1408.0, + 1867.0, + 1408.0, + 1918.0, + 1255.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1904.0, + 296.0, + 1904.0, + 296.0, + 1943.0, + 292.0, + 1943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 376.0, + 1904.0, + 417.0, + 1904.0, + 417.0, + 1943.0, + 376.0, + 1943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 578.0, + 1904.0, + 593.0, + 1904.0, + 593.0, + 1943.0, + 578.0, + 1943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1958.0, + 598.0, + 1958.0, + 598.0, + 2001.0, + 295.0, + 2001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 728.0, + 1958.0, + 777.0, + 1958.0, + 777.0, + 2001.0, + 728.0, + 2001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 803.0, + 1958.0, + 1317.0, + 1958.0, + 1317.0, + 2001.0, + 803.0, + 2001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1997.0, + 664.0, + 1997.0, + 664.0, + 2039.0, + 292.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 1997.0, + 1102.0, + 1997.0, + 1102.0, + 2039.0, + 790.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1235.0, + 1997.0, + 1321.0, + 1997.0, + 1321.0, + 2039.0, + 1235.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 1997.0, + 1405.0, + 1997.0, + 1405.0, + 2039.0, + 1352.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1116.0, + 425.0, + 1116.0, + 425.0, + 1161.0, + 293.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 455.0, + 1116.0, + 808.0, + 1116.0, + 808.0, + 1161.0, + 455.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 826.0, + 1116.0, + 1001.0, + 1116.0, + 1001.0, + 1161.0, + 826.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1026.0, + 1116.0, + 1038.0, + 1116.0, + 1038.0, + 1161.0, + 1026.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1547.0, + 953.0, + 1547.0, + 953.0, + 1593.0, + 294.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 1547.0, + 1206.0, + 1547.0, + 1206.0, + 1593.0, + 983.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1232.0, + 1547.0, + 1243.0, + 1547.0, + 1243.0, + 1593.0, + 1232.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 276.0, + 528.0, + 276.0, + 528.0, + 323.0, + 293.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 672.0, + 276.0, + 748.0, + 276.0, + 748.0, + 323.0, + 672.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 935.0, + 276.0, + 1124.0, + 276.0, + 1124.0, + 323.0, + 935.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 224.0, + 360.0, + 224.0, + 360.0, + 269.0, + 294.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 224.0, + 899.0, + 224.0, + 899.0, + 269.0, + 426.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 224.0, + 1181.0, + 224.0, + 1181.0, + 269.0, + 919.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1602.0, + 414.0, + 1602.0, + 414.0, + 1647.0, + 295.0, + 1647.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 14, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1901, + 1404, + 1901, + 1404, + 2035, + 298, + 2035 + ], + "score": 0.973 + }, + { + "category_id": 8, + "poly": [ + 551, + 1580, + 1145, + 1580, + 1145, + 1799, + 551, + 1799 + ], + "score": 0.966 + }, + { + "category_id": 8, + "poly": [ + 574, + 1087, + 896, + 1087, + 896, + 1165, + 574, + 1165 + ], + "score": 0.945 + }, + { + "category_id": 8, + "poly": [ + 583, + 353, + 995, + 353, + 995, + 422, + 583, + 422 + ], + "score": 0.943 + }, + { + "category_id": 8, + "poly": [ + 583, + 429, + 996, + 429, + 996, + 498, + 583, + 498 + ], + "score": 0.942 + }, + { + "category_id": 8, + "poly": [ + 571, + 1009, + 1134, + 1009, + 1134, + 1079, + 571, + 1079 + ], + "score": 0.932 + }, + { + "category_id": 8, + "poly": [ + 583, + 583, + 938, + 583, + 938, + 662, + 583, + 662 + ], + "score": 0.932 + }, + { + "category_id": 8, + "poly": [ + 581, + 672, + 971, + 672, + 971, + 750, + 581, + 750 + ], + "score": 0.931 + }, + { + "category_id": 8, + "poly": [ + 583, + 760, + 907, + 760, + 907, + 840, + 583, + 840 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 296, + 1481, + 1102, + 1481, + 1102, + 1516, + 296, + 1516 + ], + "score": 0.93 + }, + { + "category_id": 8, + "poly": [ + 575, + 1264, + 897, + 1264, + 897, + 1340, + 575, + 1340 + ], + "score": 0.929 + }, + { + "category_id": 8, + "poly": [ + 572, + 1174, + 1021, + 1174, + 1021, + 1255, + 572, + 1255 + ], + "score": 0.928 + }, + { + "category_id": 8, + "poly": [ + 581, + 506, + 1124, + 506, + 1124, + 576, + 581, + 576 + ], + "score": 0.927 + }, + { + "category_id": 8, + "poly": [ + 573, + 1349, + 1059, + 1349, + 1059, + 1438, + 573, + 1438 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 295, + 881, + 1213, + 881, + 1213, + 917, + 295, + 917 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 798, + 229, + 798, + 262, + 298, + 262 + ], + "score": 0.922 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 813, + 74, + 813, + 106, + 298, + 106 + ], + "score": 0.91 + }, + { + "category_id": 8, + "poly": [ + 570, + 936, + 768, + 936, + 768, + 999, + 570, + 999 + ], + "score": 0.904 + }, + { + "category_id": 9, + "poly": [ + 1352, + 780, + 1401, + 780, + 1401, + 812, + 1352, + 812 + ], + "score": 0.889 + }, + { + "category_id": 9, + "poly": [ + 1352, + 944, + 1400, + 944, + 1400, + 975, + 1352, + 975 + ], + "score": 0.888 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1026, + 1400, + 1026, + 1400, + 1057, + 1352, + 1057 + ], + "score": 0.882 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1195, + 1400, + 1195, + 1400, + 1226, + 1352, + 1226 + ], + "score": 0.882 + }, + { + "category_id": 9, + "poly": [ + 1352, + 604, + 1400, + 604, + 1400, + 635, + 1352, + 635 + ], + "score": 0.881 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1107, + 1400, + 1107, + 1400, + 1138, + 1352, + 1138 + ], + "score": 0.881 + }, + { + "category_id": 9, + "poly": [ + 1352, + 523, + 1400, + 523, + 1400, + 553, + 1352, + 553 + ], + "score": 0.877 + }, + { + "category_id": 9, + "poly": [ + 1352, + 446, + 1400, + 446, + 1400, + 477, + 1352, + 477 + ], + "score": 0.876 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1283, + 1400, + 1283, + 1400, + 1314, + 1352, + 1314 + ], + "score": 0.876 + }, + { + "category_id": 9, + "poly": [ + 1352, + 292, + 1401, + 292, + 1401, + 323, + 1352, + 323 + ], + "score": 0.876 + }, + { + "category_id": 9, + "poly": [ + 1352, + 370, + 1400, + 370, + 1400, + 401, + 1352, + 401 + ], + "score": 0.876 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1379, + 1401, + 1379, + 1401, + 1410, + 1351, + 1410 + ], + "score": 0.875 + }, + { + "category_id": 9, + "poly": [ + 1352, + 692, + 1400, + 692, + 1400, + 723, + 1352, + 723 + ], + "score": 0.875 + }, + { + "category_id": 8, + "poly": [ + 577, + 281, + 1022, + 281, + 1022, + 345, + 577, + 345 + ], + "score": 0.863 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 866, + 2087, + 866, + 2113, + 836, + 2113 + ], + "score": 0.859 + }, + { + "category_id": 2, + "poly": [ + 1374, + 1816, + 1403, + 1816, + 1403, + 1846, + 1374, + 1846 + ], + "score": 0.826 + }, + { + "category_id": 8, + "poly": [ + 577, + 281, + 1021, + 281, + 1021, + 345, + 577, + 345 + ], + "score": 0.16 + }, + { + "category_id": 14, + "poly": [ + 562, + 935, + 1135, + 935, + 1135, + 1445, + 562, + 1445 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { \\frac { \\mathbb { E } } { \\rho } \\frac { \\| \\tilde { \\rho } - \\tilde { \\rho } ^ { - 1 } \\| ^ { 2 } } { \\mathcal { F } _ { x , y } } } \\\\ & { = ( \\sigma ^ { 2 } + \\frac { \\rho - \\tilde { \\rho } - d } { p } \\| \\theta \\| _ { 2 } ^ { 2 } \\frac { \\mathbb { E } \\| ( \\tilde { X } ^ { \\mathcal { T } } \\tilde { X } + \\lambda I ) ^ { - 1 } \\tilde { X } ^ { \\mathcal { T } } \\| _ { \\mathcal { F } _ { x } ^ { 1 } } ^ { 2 } } { \\mathcal { F } _ { x } ^ { 1 } } } \\\\ & { + \\frac { d } { \\gamma } \\| \\theta \\| _ { 2 } ^ { 2 } \\frac { \\mathbb { E } } { \\varepsilon } \\| \\sum _ { i } ^ { 2 } \\frac { \\lambda ^ { 2 } } { ( \\sqrt { d } ^ { 2 } + \\lambda I ) ^ { 2 } } | } \\\\ & { = ( \\sigma ^ { 2 } + \\frac { p - d } { p } \\| \\theta \\| _ { 2 } ^ { 2 } ) \\frac { \\mathbb { E } } { \\Sigma } \\frac { \\gamma ^ { 2 } } { \\varepsilon } \\langle \\frac { \\eta _ { i } ^ { 2 } } { ( \\sqrt { d } ^ { 2 } + \\lambda I ) ^ { 2 } } | } \\\\ & { + \\frac { d } { \\gamma ^ { 2 } } \\| \\theta \\| _ { 2 } ^ { 2 } \\frac { \\mathbb { E } } { \\Sigma } \\frac { \\lambda ^ { 2 } } { \\langle \\frac { \\eta _ { i } ^ { 2 } + \\lambda I \\rangle ^ { 2 } } { \\varepsilon } } | } \\\\ & = \\frac { \\mathbb { E } } { \\nu } \\langle \\frac { ( \\sigma ^ { 2 } + \\frac { p - d - \\tilde { \\rho } - \\tilde { \\rho } - \\tilde { \\rho } - \\tilde { \\rho } } { i } ) | \\theta \\rangle _ { 2 } ^ { 2 } \\sqrt { \\frac { \\lambda ^ { 2 } } { \\varepsilon } + \\frac { d } { \\gamma ^ { 2 } } | \\theta | _ { 2 } ^ { 2 } \\lambda ^ { 2 } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1156, + 1966, + 1224, + 1966, + 1224, + 2005, + 1156, + 2005 + ], + "score": 0.93, + "latex": "\\widetilde { X } _ { d + 1 }" + }, + { + "category_id": 14, + "poly": [ + 576, + 277, + 1128, + 277, + 1128, + 845, + 576, + 845 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\mathbb { E } \\mathbb { E } \\| \\{ \\hat { X } ^ { \\prime } \\} \\hat { X } + \\lambda \\mathcal { I } \\} ^ { - 1 } \\hat { X } ^ { \\prime } \\hat { X } ^ { \\prime } - \\delta ^ { * } \\} \\| _ { 2 } ^ { 2 } } \\\\ & { = \\frac { 1 } { b } \\mathbb { E } \\hat { X } ^ { \\prime } \\| \\mathrm { H i s s } ( \\hat { \\mathcal { Z } } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda ) b ^ { \\mathcal { N } / 2 } \\| _ { 2 } ^ { 2 } } \\\\ & { = \\mathbb { E } \\mathbb { E } \\mathbb { E } \\mathbb { E } \\mathbb { E } \\bigg [ \\| \\mathrm { H i s s } ( \\hat { \\mathcal { Z } } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda ) \\| ^ { \\mathcal { N } / 2 } b ^ { \\mathcal { N } / 2 } \\| _ { 2 } ^ { 2 } } \\\\ & { - \\mathbb { E } \\mathbb { E } \\mathbb { E } \\mathbb { E } \\bigg [ \\| \\mathrm { H i s s } ( \\hat { \\mathcal { Z } } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda ) \\| ^ { \\mathcal { N } / 2 } \\bigg ] \\| _ { 2 } ^ { 2 } } \\\\ & { = \\mathbb { E } _ { \\hat { X } ^ { \\prime } \\sim \\mathrm { N } \\times \\mathrm { W } ( \\hat { \\mathcal { Z } } ) } \\mathbb { E } \\| \\mathrm { H i s s } ( \\hat { \\mathcal { Z } } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda ) \\| ^ { \\mathcal { N } / 2 } } \\\\ & { = \\mathbb { E } \\mathbb { E } \\| \\hat { X } ^ { \\prime } \\| ^ { 2 } \\mathbb { E } \\| \\mathrm { H } ^ { 2 } \\mathbb { E } \\bigg [ \\mathrm { H } _ { \\frac { e } { 2 } } ^ { - 1 } \\lambda \\Big ] ^ { \\| \\mathcal { N } / 2 } } \\\\ & { = \\frac { 1 } { b } \\mathbb { E } \\hat { X } ^ { \\prime } \\| ^ { 2 } \\mathbb { E } \\bigg [ \\mathcal { P } _ { \\frac { e } { 2 } } ^ { - 1 } \\frac { \\lambda ^ { 2 } } { b } \\Big ] ^ { 2 } } \\\\ & = \\frac { 1 } { b } \\mathbb { E } \\frac { \\hat { X } ^ { \\prime } } { \\| \\mathcal { P } \\| \\mathcal { P } \\| ^ { 2 } \\| _ { 2 } ^ { 2 } } \\mathbb { E } \\bigg [ \\int _ { 0 } ^ { \\mathcal { N } / 2 } \\frac { \\lambda ^ { 2 } } \\| \\mathcal { P } \\| _ { 2 } ^ { 2 } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1297, + 1900, + 1364, + 1900, + 1364, + 1939, + 1297, + 1939 + ], + "score": 0.93, + "latex": "\\widetilde { X } _ { d + 1 }" + }, + { + "category_id": 14, + "poly": [ + 551, + 1578, + 1148, + 1578, + 1148, + 1802, + 551, + 1802 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\mathbb { E } \\big [ R ( \\hat { \\beta } ) \\big ] = \\sigma ^ { 2 } + \\mathbb { E } [ | | \\theta - P ^ { T } P \\theta | | _ { 2 } ^ { 2 } ] + \\mathbb { E } [ | | \\beta ^ { * } - \\hat { \\beta } | | _ { 2 } ^ { 2 } ] } \\\\ & { \\qquad = \\sigma ^ { 2 } + ( 1 - \\frac { d } { p } ) | | \\theta | | _ { 2 } ^ { 2 } } \\\\ & { \\qquad + \\mathbb { E } \\left[ \\displaystyle \\sum _ { i = 1 } ^ { p } \\frac { \\big ( \\sigma ^ { 2 } + \\frac { p - d } { p } | | \\theta | | _ { 2 } ^ { 2 } \\big ) \\gamma _ { i } ^ { 2 } + \\frac { d } { p ^ { 2 } } | | \\theta | | _ { 2 } ^ { 2 } \\lambda ^ { 2 } } { \\big ( \\gamma _ { i } ^ { 2 } + \\lambda \\big ) ^ { 2 } } \\right] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 231, + 403, + 231, + 403, + 262, + 298, + 262 + ], + "score": 0.91, + "latex": "\\beta ^ { * } = P \\theta" + }, + { + "category_id": 13, + "poly": [ + 1062, + 1966, + 1101, + 1966, + 1101, + 2003, + 1062, + 2003 + ], + "score": 0.91, + "latex": "\\widetilde { X } _ { d }" + }, + { + "category_id": 13, + "poly": [ + 708, + 1972, + 769, + 1972, + 769, + 2005, + 708, + 2005 + ], + "score": 0.91, + "latex": "\\Gamma _ { d + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1200, + 1900, + 1240, + 1900, + 1240, + 1937, + 1200, + 1937 + ], + "score": 0.91, + "latex": "\\widetilde { X } _ { d }" + }, + { + "category_id": 13, + "poly": [ + 719, + 1938, + 788, + 1938, + 788, + 1966, + 719, + 1966 + ], + "score": 0.9, + "latex": "d + 1" + }, + { + "category_id": 13, + "poly": [ + 619, + 1973, + 654, + 1973, + 654, + 2003, + 619, + 2003 + ], + "score": 0.89, + "latex": "\\Gamma _ { d }" + }, + { + "category_id": 13, + "poly": [ + 647, + 1938, + 666, + 1938, + 666, + 1964, + 647, + 1964 + ], + "score": 0.81, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 297, + 1972, + 323, + 1972, + 323, + 2001, + 297, + 2001 + ], + "score": 0.34, + "latex": "\\Pi" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 814.0, + 72.0, + 814.0, + 109.0, + 296.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2125.0, + 832.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 1820.0, + 1403.0, + 1820.0, + 1403.0, + 1848.0, + 1377.0, + 1848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1901.0, + 1199.0, + 1901.0, + 1199.0, + 1942.0, + 293.0, + 1942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 1901.0, + 1296.0, + 1901.0, + 1296.0, + 1942.0, + 1241.0, + 1942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1365.0, + 1901.0, + 1406.0, + 1901.0, + 1406.0, + 1942.0, + 1365.0, + 1942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1930.0, + 646.0, + 1930.0, + 646.0, + 1974.0, + 292.0, + 1974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 1930.0, + 718.0, + 1930.0, + 718.0, + 1974.0, + 667.0, + 1974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 789.0, + 1930.0, + 1405.0, + 1930.0, + 1405.0, + 1974.0, + 789.0, + 1974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1969.0, + 296.0, + 1969.0, + 296.0, + 2007.0, + 293.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1969.0, + 618.0, + 1969.0, + 618.0, + 2007.0, + 324.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 655.0, + 1969.0, + 707.0, + 1969.0, + 707.0, + 2007.0, + 655.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 1969.0, + 1061.0, + 1969.0, + 1061.0, + 2007.0, + 770.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1102.0, + 1969.0, + 1155.0, + 1969.0, + 1155.0, + 2007.0, + 1102.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 1969.0, + 1405.0, + 1969.0, + 1405.0, + 2007.0, + 1225.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2002.0, + 635.0, + 2002.0, + 635.0, + 2036.0, + 296.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1480.0, + 1102.0, + 1480.0, + 1102.0, + 1519.0, + 294.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 880.0, + 1215.0, + 880.0, + 1215.0, + 920.0, + 295.0, + 920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 226.0, + 801.0, + 226.0, + 801.0, + 267.0, + 404.0, + 267.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 15, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 683, + 1404, + 683, + 1404, + 809, + 297, + 809 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 363, + 953, + 1403, + 953, + 1403, + 1078, + 363, + 1078 + ], + "score": 0.976 + }, + { + "category_id": 8, + "poly": [ + 556, + 277, + 1136, + 277, + 1136, + 547, + 556, + 547 + ], + "score": 0.966 + }, + { + "category_id": 1, + "poly": [ + 364, + 1230, + 1402, + 1230, + 1402, + 1327, + 364, + 1327 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 295, + 816, + 1399, + 816, + 1399, + 882, + 295, + 882 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 296, + 1692, + 1403, + 1692, + 1403, + 1763, + 296, + 1763 + ], + "score": 0.945 + }, + { + "category_id": 8, + "poly": [ + 685, + 1090, + 1111, + 1090, + 1111, + 1149, + 685, + 1149 + ], + "score": 0.942 + }, + { + "category_id": 8, + "poly": [ + 642, + 1427, + 1154, + 1427, + 1154, + 1483, + 642, + 1483 + ], + "score": 0.938 + }, + { + "category_id": 8, + "poly": [ + 581, + 1965, + 1054, + 1965, + 1054, + 2026, + 581, + 2026 + ], + "score": 0.93 + }, + { + "category_id": 8, + "poly": [ + 814, + 1327, + 983, + 1327, + 983, + 1364, + 814, + 1364 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 511, + 229, + 511, + 263, + 298, + 263 + ], + "score": 0.929 + }, + { + "category_id": 0, + "poly": [ + 300, + 627, + 706, + 627, + 706, + 660, + 300, + 660 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 298, + 1571, + 1066, + 1571, + 1066, + 1605, + 298, + 1605 + ], + "score": 0.922 + }, + { + "category_id": 8, + "poly": [ + 807, + 1619, + 893, + 1619, + 893, + 1659, + 807, + 1659 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 396, + 1172, + 1288, + 1172, + 1288, + 1212, + 396, + 1212 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 393, + 1505, + 1287, + 1505, + 1287, + 1546, + 393, + 1546 + ], + "score": 0.918 + }, + { + "category_id": 1, + "poly": [ + 396, + 1377, + 1326, + 1377, + 1326, + 1413, + 396, + 1413 + ], + "score": 0.918 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 814, + 73, + 814, + 106, + 298, + 106 + ], + "score": 0.915 + }, + { + "category_id": 8, + "poly": [ + 573, + 1778, + 1080, + 1778, + 1080, + 1826, + 573, + 1826 + ], + "score": 0.9 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1098, + 1400, + 1098, + 1400, + 1128, + 1351, + 1128 + ], + "score": 0.9 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1435, + 1400, + 1435, + 1400, + 1466, + 1351, + 1466 + ], + "score": 0.887 + }, + { + "category_id": 1, + "poly": [ + 301, + 895, + 718, + 895, + 718, + 929, + 301, + 929 + ], + "score": 0.885 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1786, + 1400, + 1786, + 1400, + 1816, + 1351, + 1816 + ], + "score": 0.877 + }, + { + "category_id": 8, + "poly": [ + 580, + 1902, + 1124, + 1902, + 1124, + 1959, + 580, + 1959 + ], + "score": 0.875 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1909, + 1401, + 1909, + 1401, + 1940, + 1351, + 1940 + ], + "score": 0.875 + }, + { + "category_id": 8, + "poly": [ + 579, + 1839, + 1126, + 1839, + 1126, + 1890, + 579, + 1890 + ], + "score": 0.875 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1971, + 1401, + 1971, + 1401, + 2002, + 1351, + 2002 + ], + "score": 0.868 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2112, + 836, + 2112 + ], + "score": 0.867 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1847, + 1401, + 1847, + 1401, + 1878, + 1351, + 1878 + ], + "score": 0.862 + }, + { + "category_id": 2, + "poly": [ + 1374, + 556, + 1404, + 556, + 1404, + 588, + 1374, + 588 + ], + "score": 0.851 + }, + { + "category_id": 14, + "poly": [ + 573, + 1774, + 1129, + 1774, + 1129, + 2032, + 573, + 2032 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } & { \\hat { z } _ { \\lambda } : = \\underset { z } { \\mathrm { a r g m i n } } \\left| \\lvert \\tilde { X } z - \\bar { y } \\rvert \\right| _ { 2 } ^ { 2 } + \\lambda \\lvert | z \\rvert | _ { \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } } ^ { 2 } } \\\\ & { = \\underset { z } { \\mathrm { a r g m i n } } \\left| \\lvert X \\Sigma ^ { 1 / 2 } z - \\bar { y } \\rvert \\right| _ { 2 } ^ { 2 } + \\lambda z ^ { T } \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } z } \\\\ & { = \\underset { z } { \\mathrm { a r g m i n } } \\left| \\lvert X \\Sigma ^ { 1 / 2 } z - \\bar { y } \\rvert \\right| _ { 2 } ^ { 2 } + \\lambda z ^ { T } \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } z } \\\\ & { = \\Sigma ^ { - 1 / 2 } \\underset { \\beta = \\Sigma ^ { 1 / 2 } z } { \\mathrm { a r g m i n } } \\left| \\lvert X \\beta - \\bar { y } \\rvert \\right| _ { 2 } ^ { 2 } + \\lambda \\beta ^ { T } M \\beta } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 555, + 277, + 1138, + 277, + 1138, + 549, + 555, + 549 + ], + "score": 0.94, + "latex": "\\begin{array} { l } { \\overline { { R } } ( \\hat { \\beta } _ { d } ^ { \\mathrm { o p t } } ) = \\widetilde { \\sigma } ^ { 2 } + \\underset { ( \\gamma _ { 1 } , \\ldots , \\gamma _ { m } ) \\sim \\Gamma _ { d + 1 } } { \\mathbb { E } } \\left[ \\overset { p } { \\underset { i = 1 } { \\sum } } \\frac { \\widetilde { \\sigma } ^ { 2 } } { \\gamma _ { i } ^ { 2 } + \\frac { \\widetilde { \\sigma } ^ { 2 } p ^ { 2 } } { d | \\boldsymbol { \\theta } | | _ { 2 } ^ { 2 } } } \\right] } \\\\ { \\geq \\widetilde { \\sigma } ^ { 2 } + \\underset { ( \\widetilde { \\gamma } _ { 1 } , \\ldots , \\widetilde { \\gamma } _ { m } ) \\sim \\Gamma _ { d + 1 } } { \\mathbb { E } } \\left[ \\overset { p } { \\underset { i = 1 } { \\sum } } \\frac { \\widetilde { \\sigma } ^ { 2 } } { \\widetilde { \\gamma } _ { i } ^ { 2 } + \\frac { \\widetilde { \\sigma } ^ { 2 } p ^ { 2 } } { d | \\boldsymbol { \\theta } | | _ { 2 } ^ { 2 } } } \\right] } \\\\ { = \\overline { { R } } ( \\hat { \\beta } _ { d + 1 } ^ { \\mathrm { o p t } } ) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 685, + 1088, + 1113, + 1088, + 1113, + 1153, + 685, + 1153 + ], + "score": 0.93, + "latex": "{ \\hat { \\beta } } _ { \\lambda } : = \\operatorname * { a r g m i n } _ { \\beta } | | X \\beta - { \\vec { y } } | | _ { 2 } ^ { 2 } + \\lambda | | \\beta | | _ { M } ^ { 2 }" + }, + { + "category_id": 14, + "poly": [ + 642, + 1424, + 1153, + 1424, + 1153, + 1486, + 642, + 1486 + ], + "score": 0.93, + "latex": "\\hat { z } _ { \\lambda } : = \\operatorname * { a r g m i n } _ { z } | | \\widetilde { X } z - \\vec { y } | | _ { 2 } ^ { 2 } + \\lambda | | z | | _ { \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } } ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 901, + 986, + 1064, + 986, + 1064, + 1020, + 901, + 1020 + ], + "score": 0.93, + "latex": "x \\sim \\mathcal { N } ( 0 , I _ { d } )" + }, + { + "category_id": 13, + "poly": [ + 1123, + 1727, + 1250, + 1727, + 1250, + 1761, + 1123, + 1761 + ], + "score": 0.92, + "latex": "\\beta = \\Sigma ^ { 1 / 2 } z" + }, + { + "category_id": 13, + "poly": [ + 441, + 1171, + 760, + 1171, + 760, + 1211, + 441, + 1211 + ], + "score": 0.92, + "latex": "\\overline { { R } } = \\mathbb { E } _ { X , y } [ | | \\hat { \\beta } - \\beta ^ { * } | | _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 }" + }, + { + "category_id": 14, + "poly": [ + 813, + 1323, + 985, + 1323, + 985, + 1366, + 813, + 1366 + ], + "score": 0.92, + "latex": "z ^ { * } = \\Sigma ^ { - 1 / 2 } \\beta ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 515, + 818, + 851, + 818, + 851, + 850, + 515, + 850 + ], + "score": 0.92, + "latex": "n \\in \\mathbb { N } , d \\in \\mathbb { N } , \\lambda \\in \\mathbb { R } , \\sigma \\in \\mathbb { R } ," + }, + { + "category_id": 13, + "poly": [ + 398, + 1295, + 614, + 1295, + 614, + 1329, + 398, + 1329 + ], + "score": 0.92, + "latex": "\\langle z ^ { \\ast } , \\widetilde { x } \\rangle + \\mathcal { N } ( 0 , \\widetilde { \\sigma } ^ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 1013, + 1266, + 1177, + 1266, + 1177, + 1298, + 1013, + 1298 + ], + "score": 0.92, + "latex": "\\widetilde { x } \\sim \\mathcal { N } ( 0 , \\Sigma )" + }, + { + "category_id": 13, + "poly": [ + 397, + 1016, + 502, + 1016, + 502, + 1050, + 397, + 1050 + ], + "score": 0.92, + "latex": "\\mathcal { N } ( 0 , \\bar { \\sigma } ^ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 495, + 849, + 592, + 849, + 592, + 881, + 495, + 881 + ], + "score": 0.91, + "latex": "\\beta ^ { * } \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 574, + 1015, + 712, + 1015, + 712, + 1045, + 574, + 1045 + ], + "score": 0.91, + "latex": "\\ b { \\hat { X } } \\in \\mathbb { R } ^ { n \\times d }" + }, + { + "category_id": 13, + "poly": [ + 1229, + 986, + 1402, + 986, + 1402, + 1020, + 1229, + 1020 + ], + "score": 0.91, + "latex": "y = \\langle \\beta ^ { * } , x \\rangle +" + }, + { + "category_id": 13, + "poly": [ + 626, + 1266, + 691, + 1266, + 691, + 1298, + 626, + 1298 + ], + "score": 0.91, + "latex": "( \\widetilde { x } , y )" + }, + { + "category_id": 13, + "poly": [ + 440, + 1373, + 566, + 1373, + 566, + 1408, + 440, + 1408 + ], + "score": 0.91, + "latex": "\\widetilde { X } \\in \\mathbb { R } ^ { n \\times d }" + }, + { + "category_id": 13, + "poly": [ + 1123, + 1693, + 1205, + 1693, + 1205, + 1725, + 1123, + 1725 + ], + "score": 0.91, + "latex": "X \\Sigma ^ { 1 / 2 }" + }, + { + "category_id": 13, + "poly": [ + 1262, + 815, + 1394, + 815, + 1394, + 847, + 1262, + 847 + ], + "score": 0.91, + "latex": "M \\in \\mathbb { R } ^ { d \\times d }" + }, + { + "category_id": 13, + "poly": [ + 440, + 1502, + 761, + 1502, + 761, + 1549, + 440, + 1549 + ], + "score": 0.9, + "latex": "\\widetilde { R } = \\mathbb { E } _ { \\widetilde { X } , y } [ | | \\hat { z } - z ^ { * } | | _ { \\Sigma } ^ { 2 } ] + \\sigma ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 989, + 815, + 1111, + 815, + 1111, + 847, + 989, + 847 + ], + "score": 0.9, + "latex": "\\Sigma \\in \\mathbb { R } ^ { d \\times d }" + }, + { + "category_id": 13, + "poly": [ + 523, + 987, + 588, + 987, + 588, + 1019, + 523, + 1019 + ], + "score": 0.9, + "latex": "( x , y )" + }, + { + "category_id": 14, + "poly": [ + 805, + 1617, + 895, + 1617, + 895, + 1657, + 805, + 1657 + ], + "score": 0.9, + "latex": "\\overline { { R } } = \\widetilde { R }" + }, + { + "category_id": 13, + "poly": [ + 994, + 1230, + 1154, + 1230, + 1154, + 1265, + 994, + 1265 + ], + "score": 0.9, + "latex": "( \\Sigma ^ { 1 / 2 } M \\Sigma ^ { 1 / 2 } )" + }, + { + "category_id": 13, + "poly": [ + 730, + 1691, + 758, + 1691, + 758, + 1724, + 730, + 1724 + ], + "score": 0.88, + "latex": "\\widetilde { X }" + }, + { + "category_id": 13, + "poly": [ + 1291, + 1698, + 1318, + 1698, + 1318, + 1724, + 1291, + 1724 + ], + "score": 0.85, + "latex": "X" + }, + { + "category_id": 13, + "poly": [ + 1346, + 1269, + 1403, + 1269, + 1403, + 1298, + 1346, + 1298 + ], + "score": 0.84, + "latex": "y =" + }, + { + "category_id": 13, + "poly": [ + 1030, + 957, + 1062, + 957, + 1062, + 983, + 1030, + 983 + ], + "score": 0.8, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 1101, + 1018, + 1121, + 1018, + 1121, + 1049, + 1101, + 1049 + ], + "score": 0.79, + "latex": "\\vec { y }" + }, + { + "category_id": 13, + "poly": [ + 859, + 1236, + 882, + 1236, + 882, + 1262, + 859, + 1262 + ], + "score": 0.78, + "latex": "\\Sigma" + }, + { + "category_id": 13, + "poly": [ + 928, + 1380, + 947, + 1380, + 947, + 1412, + 928, + 1412 + ], + "score": 0.77, + "latex": "\\vec { y }" + }, + { + "category_id": 13, + "poly": [ + 397, + 994, + 416, + 994, + 416, + 1013, + 397, + 1013 + ], + "score": 0.46, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 497, + 1273, + 517, + 1273, + 517, + 1293, + 497, + 1293 + ], + "score": 0.34, + "latex": "n" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 625.0, + 710.0, + 625.0, + 710.0, + 663.0, + 295.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 815.0, + 72.0, + 815.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1378.0, + 562.0, + 1403.0, + 562.0, + 1403.0, + 590.0, + 1378.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 686.0, + 1404.0, + 686.0, + 1404.0, + 719.0, + 295.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 717.0, + 1405.0, + 717.0, + 1405.0, + 751.0, + 294.0, + 751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 747.0, + 1407.0, + 747.0, + 1407.0, + 781.0, + 292.0, + 781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 778.0, + 1086.0, + 778.0, + 1086.0, + 813.0, + 292.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 955.0, + 1029.0, + 955.0, + 1029.0, + 991.0, + 361.0, + 991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 955.0, + 1405.0, + 955.0, + 1405.0, + 991.0, + 1063.0, + 991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 984.0, + 396.0, + 984.0, + 396.0, + 1024.0, + 391.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 417.0, + 984.0, + 522.0, + 984.0, + 522.0, + 1024.0, + 417.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.0, + 984.0, + 900.0, + 984.0, + 900.0, + 1024.0, + 589.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 984.0, + 1228.0, + 984.0, + 1228.0, + 1024.0, + 1065.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 984.0, + 1407.0, + 984.0, + 1407.0, + 1024.0, + 1403.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 389.0, + 1011.0, + 396.0, + 1011.0, + 396.0, + 1053.0, + 389.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 503.0, + 1011.0, + 573.0, + 1011.0, + 573.0, + 1053.0, + 503.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 713.0, + 1011.0, + 1100.0, + 1011.0, + 1100.0, + 1053.0, + 713.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1122.0, + 1011.0, + 1406.0, + 1011.0, + 1406.0, + 1053.0, + 1122.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1045.0, + 510.0, + 1045.0, + 510.0, + 1080.0, + 395.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 1224.0, + 858.0, + 1224.0, + 858.0, + 1274.0, + 356.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 883.0, + 1224.0, + 993.0, + 1224.0, + 993.0, + 1274.0, + 883.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 1224.0, + 1406.0, + 1224.0, + 1406.0, + 1274.0, + 1155.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 1260.0, + 496.0, + 1260.0, + 496.0, + 1306.0, + 390.0, + 1306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 518.0, + 1260.0, + 625.0, + 1260.0, + 625.0, + 1306.0, + 518.0, + 1306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 1260.0, + 1012.0, + 1260.0, + 1012.0, + 1306.0, + 692.0, + 1306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1178.0, + 1260.0, + 1345.0, + 1260.0, + 1345.0, + 1306.0, + 1178.0, + 1306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 1295.0, + 664.0, + 1295.0, + 664.0, + 1330.0, + 615.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 813.0, + 514.0, + 813.0, + 514.0, + 852.0, + 291.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 852.0, + 813.0, + 988.0, + 813.0, + 988.0, + 852.0, + 852.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 813.0, + 1261.0, + 813.0, + 1261.0, + 852.0, + 1112.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 813.0, + 1402.0, + 813.0, + 1402.0, + 852.0, + 1395.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 845.0, + 494.0, + 845.0, + 494.0, + 885.0, + 293.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 845.0, + 831.0, + 845.0, + 831.0, + 885.0, + 593.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1690.0, + 729.0, + 1690.0, + 729.0, + 1731.0, + 294.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 759.0, + 1690.0, + 1122.0, + 1690.0, + 1122.0, + 1731.0, + 759.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 1690.0, + 1290.0, + 1690.0, + 1290.0, + 1731.0, + 1206.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1319.0, + 1690.0, + 1406.0, + 1690.0, + 1406.0, + 1731.0, + 1319.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1721.0, + 1122.0, + 1721.0, + 1122.0, + 1769.0, + 290.0, + 1769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 1721.0, + 1407.0, + 1721.0, + 1407.0, + 1769.0, + 1251.0, + 1769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 227.0, + 515.0, + 227.0, + 515.0, + 267.0, + 295.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1569.0, + 1067.0, + 1569.0, + 1067.0, + 1609.0, + 295.0, + 1609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1169.0, + 440.0, + 1169.0, + 440.0, + 1214.0, + 395.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 1169.0, + 1290.0, + 1169.0, + 1290.0, + 1214.0, + 761.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1502.0, + 439.0, + 1502.0, + 439.0, + 1548.0, + 395.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 762.0, + 1502.0, + 1292.0, + 1502.0, + 1292.0, + 1548.0, + 762.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 1369.0, + 439.0, + 1369.0, + 439.0, + 1419.0, + 391.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 567.0, + 1369.0, + 927.0, + 1369.0, + 927.0, + 1419.0, + 567.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 948.0, + 1369.0, + 1330.0, + 1369.0, + 1330.0, + 1419.0, + 948.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 892.0, + 723.0, + 892.0, + 723.0, + 934.0, + 297.0, + 934.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 16, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1508, + 1405, + 1508, + 1405, + 1723, + 297, + 1723 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 1812, + 1404, + 1812, + 1404, + 2034, + 297, + 2034 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 299, + 1306, + 1404, + 1306, + 1404, + 1402, + 299, + 1402 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 296, + 664, + 1405, + 664, + 1405, + 758, + 296, + 758 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 298, + 1153, + 1405, + 1153, + 1405, + 1217, + 298, + 1217 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 291, + 857, + 1401, + 857, + 1401, + 928, + 291, + 928 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 297, + 1008, + 1401, + 1008, + 1401, + 1074, + 297, + 1074 + ], + "score": 0.951 + }, + { + "category_id": 8, + "poly": [ + 617, + 767, + 1077, + 767, + 1077, + 825, + 617, + 825 + ], + "score": 0.942 + }, + { + "category_id": 1, + "poly": [ + 298, + 518, + 1402, + 518, + 1402, + 582, + 298, + 582 + ], + "score": 0.94 + }, + { + "category_id": 8, + "poly": [ + 707, + 938, + 993, + 938, + 993, + 995, + 707, + 995 + ], + "score": 0.938 + }, + { + "category_id": 8, + "poly": [ + 735, + 1082, + 966, + 1082, + 966, + 1128, + 735, + 1128 + ], + "score": 0.936 + }, + { + "category_id": 1, + "poly": [ + 298, + 586, + 1402, + 586, + 1402, + 652, + 298, + 652 + ], + "score": 0.936 + }, + { + "category_id": 0, + "poly": [ + 301, + 1441, + 1161, + 1441, + 1161, + 1478, + 301, + 1478 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 293, + 227, + 1167, + 227, + 1167, + 264, + 293, + 264 + ], + "score": 0.926 + }, + { + "category_id": 8, + "poly": [ + 697, + 273, + 1000, + 273, + 1000, + 337, + 697, + 337 + ], + "score": 0.916 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 814, + 73, + 814, + 106, + 298, + 106 + ], + "score": 0.915 + }, + { + "category_id": 0, + "poly": [ + 300, + 1250, + 611, + 1250, + 611, + 1282, + 300, + 1282 + ], + "score": 0.91 + }, + { + "category_id": 9, + "poly": [ + 1352, + 944, + 1400, + 944, + 1400, + 974, + 1352, + 974 + ], + "score": 0.902 + }, + { + "category_id": 0, + "poly": [ + 301, + 1758, + 717, + 1758, + 717, + 1789, + 301, + 1789 + ], + "score": 0.896 + }, + { + "category_id": 9, + "poly": [ + 1352, + 775, + 1400, + 775, + 1400, + 806, + 1352, + 806 + ], + "score": 0.889 + }, + { + "category_id": 9, + "poly": [ + 1352, + 413, + 1400, + 413, + 1400, + 443, + 1352, + 443 + ], + "score": 0.885 + }, + { + "category_id": 9, + "poly": [ + 1352, + 351, + 1400, + 351, + 1400, + 382, + 1352, + 382 + ], + "score": 0.883 + }, + { + "category_id": 9, + "poly": [ + 1352, + 280, + 1400, + 280, + 1400, + 311, + 1352, + 311 + ], + "score": 0.879 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.854 + }, + { + "category_id": 8, + "poly": [ + 725, + 344, + 1000, + 344, + 1000, + 401, + 725, + 401 + ], + "score": 0.787 + }, + { + "category_id": 2, + "poly": [ + 1375, + 457, + 1401, + 457, + 1401, + 484, + 1375, + 484 + ], + "score": 0.738 + }, + { + "category_id": 8, + "poly": [ + 727, + 410, + 785, + 410, + 785, + 442, + 727, + 442 + ], + "score": 0.515 + }, + { + "category_id": 13, + "poly": [ + 1086, + 1336, + 1178, + 1336, + 1178, + 1371, + 1086, + 1371 + ], + "score": 0.95, + "latex": "[ - \\bar { 1 } , 1 ] ^ { d }" + }, + { + "category_id": 14, + "poly": [ + 706, + 935, + 994, + 935, + 994, + 996, + 706, + 996 + ], + "score": 0.94, + "latex": "\\lambda _ { n } ^ { \\mathrm { o p t } } : = \\operatorname * { a r g m i n } _ { \\lambda } \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) )" + }, + { + "category_id": 14, + "poly": [ + 695, + 270, + 1004, + 270, + 1004, + 448, + 695, + 448 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { \\widetilde { R } = \\underset { \\widetilde { X } , y } { \\mathbb { E } } \\left[ \\vert \\vert \\hat { z } - z ^ { * } \\vert \\vert _ { \\Sigma } ^ { 2 } \\right] + \\sigma ^ { 2 } } \\\\ { = \\underset { X , y } { \\mathbb { E } } \\left[ \\vert \\vert \\hat { \\beta } - \\beta ^ { * } \\vert \\vert _ { 2 } ^ { 2 } \\right] + \\sigma ^ { 2 } } \\\\ { = \\overline { { R } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 717, + 1367, + 986, + 1367, + 986, + 1402, + 717, + 1402 + ], + "score": 0.94, + "latex": "y \\in \\{ \\vec { e _ { 1 } } , \\dots e _ { 1 0 } ^ { } \\} \\subset \\mathbb { R } ^ { 1 0 }" + }, + { + "category_id": 13, + "poly": [ + 537, + 230, + 719, + 230, + 719, + 264, + 537, + 264 + ], + "score": 0.94, + "latex": "\\langle z ^ { * } , { \\widetilde { x } } \\rangle = \\langle \\beta , x \\rangle" + }, + { + "category_id": 14, + "poly": [ + 615, + 767, + 1082, + 767, + 1082, + 830, + 615, + 830 + ], + "score": 0.93, + "latex": "\\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\boldsymbol { \\beta } } \\| X \\boldsymbol { \\beta } - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| \\boldsymbol { \\beta } \\| _ { \\Sigma ^ { - 1 } } ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1600, + 453, + 1600, + 453, + 1634, + 298, + 1634 + ], + "score": 0.93, + "latex": "x \\sim \\mathcal { N } ( 0 , \\Sigma )" + }, + { + "category_id": 13, + "poly": [ + 341, + 856, + 707, + 856, + 707, + 901, + 341, + 901 + ], + "score": 0.93, + "latex": "\\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) : = \\mathbb { E } _ { \\hat { \\beta } } \\| \\hat { \\beta } - \\beta ^ { * } \\| _ { \\Sigma } + \\sigma ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 905, + 665, + 1063, + 665, + 1063, + 698, + 905, + 698 + ], + "score": 0.93, + "latex": "x \\sim \\mathcal { N } ( 0 , \\Sigma )" + }, + { + "category_id": 13, + "poly": [ + 1251, + 587, + 1351, + 587, + 1351, + 621, + 1251, + 621 + ], + "score": 0.93, + "latex": "\\beta ^ { * } \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 516, + 1600, + 794, + 1600, + 794, + 1634, + 516, + 1634 + ], + "score": 0.92, + "latex": "y \\sim \\langle x , \\beta ^ { * } \\rangle + N ( 0 , \\sigma ^ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 1111, + 1156, + 1214, + 1156, + 1214, + 1185, + 1111, + 1185 + ], + "score": 0.92, + "latex": "M = I _ { d }" + }, + { + "category_id": 14, + "poly": [ + 734, + 1081, + 966, + 1081, + 966, + 1128, + 734, + 1128 + ], + "score": 0.92, + "latex": "\\overline { { R } } ( \\hat { \\beta } _ { n + 1 } ^ { \\mathrm { o p t } } ) \\leq \\overline { { R } } ( \\hat { \\beta } _ { n } ^ { \\mathrm { o p t } } )" + }, + { + "category_id": 13, + "poly": [ + 298, + 695, + 403, + 695, + 403, + 730, + 298, + 730 + ], + "score": 0.92, + "latex": "{ \\mathcal { N } } ( 0 , \\sigma ^ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 1090, + 1875, + 1239, + 1875, + 1239, + 1909, + 1090, + 1909 + ], + "score": 0.92, + "latex": "\\boldsymbol { x } \\sim \\mathcal { N } ( 0 , \\Sigma )" + }, + { + "category_id": 13, + "poly": [ + 912, + 586, + 1031, + 586, + 1031, + 618, + 912, + 618 + ], + "score": 0.92, + "latex": "\\Sigma \\in \\mathbb { R } ^ { d \\times d }" + }, + { + "category_id": 13, + "poly": [ + 637, + 1336, + 727, + 1336, + 727, + 1366, + 637, + 1366 + ], + "score": 0.91, + "latex": "x \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 530, + 589, + 772, + 589, + 772, + 621, + 530, + 621 + ], + "score": 0.9, + "latex": "n \\in \\mathbb { N } , d \\in \\mathbb { N } , \\sigma \\in \\mathbb { R } ," + }, + { + "category_id": 13, + "poly": [ + 385, + 1007, + 431, + 1007, + 431, + 1044, + 385, + 1044 + ], + "score": 0.9, + "latex": "\\hat { \\beta } _ { n } ^ { \\mathrm { { o p t } } }" + }, + { + "category_id": 13, + "poly": [ + 465, + 697, + 597, + 697, + 597, + 725, + 465, + 725 + ], + "score": 0.9, + "latex": "\\ b { X } \\in \\mathbb { R } ^ { n \\times d }" + }, + { + "category_id": 13, + "poly": [ + 1228, + 665, + 1403, + 665, + 1403, + 698, + 1228, + 698 + ], + "score": 0.9, + "latex": "y = \\langle \\beta ^ { * } , x \\rangle +" + }, + { + "category_id": 13, + "poly": [ + 792, + 725, + 844, + 725, + 844, + 755, + 792, + 755 + ], + "score": 0.9, + "latex": "\\Sigma ^ { - 1 }" + }, + { + "category_id": 13, + "poly": [ + 1188, + 519, + 1241, + 519, + 1241, + 549, + 1188, + 549 + ], + "score": 0.9, + "latex": "\\Sigma ^ { - 1 }" + }, + { + "category_id": 13, + "poly": [ + 886, + 1009, + 930, + 1009, + 930, + 1042, + 886, + 1042 + ], + "score": 0.9, + "latex": "\\lambda _ { n } ^ { \\mathrm { o p t } }" + }, + { + "category_id": 13, + "poly": [ + 525, + 665, + 590, + 665, + 590, + 697, + 525, + 697 + ], + "score": 0.89, + "latex": "( x , y )" + }, + { + "category_id": 13, + "poly": [ + 1223, + 1338, + 1322, + 1338, + 1322, + 1366, + 1223, + 1366 + ], + "score": 0.89, + "latex": "d = 7 8 4" + }, + { + "category_id": 13, + "poly": [ + 1283, + 858, + 1327, + 858, + 1327, + 891, + 1283, + 891 + ], + "score": 0.89, + "latex": "\\lambda _ { n } ^ { \\mathrm { o p t } }" + }, + { + "category_id": 13, + "poly": [ + 1318, + 699, + 1393, + 699, + 1393, + 726, + 1318, + 726 + ], + "score": 0.87, + "latex": "\\lambda > 0" + }, + { + "category_id": 13, + "poly": [ + 998, + 1974, + 1022, + 1974, + 1022, + 2000, + 998, + 2000 + ], + "score": 0.82, + "latex": "\\Sigma" + }, + { + "category_id": 13, + "poly": [ + 703, + 522, + 727, + 522, + 727, + 548, + 703, + 548 + ], + "score": 0.82, + "latex": "\\Sigma" + }, + { + "category_id": 13, + "poly": [ + 907, + 1908, + 1394, + 1908, + 1394, + 1948, + 907, + 1948 + ], + "score": 0.81, + "latex": "\\begin{array} { r } { \\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\boldsymbol { \\beta } } \\| X \\boldsymbol { \\beta } - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| \\boldsymbol { \\beta } \\| _ { \\Sigma ^ { - 1 } } ^ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 970, + 699, + 990, + 699, + 990, + 729, + 970, + 729 + ], + "score": 0.75, + "latex": "\\vec { y }" + }, + { + "category_id": 13, + "poly": [ + 874, + 1911, + 893, + 1911, + 893, + 1939, + 874, + 1939 + ], + "score": 0.44, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 399, + 673, + 419, + 673, + 419, + 693, + 399, + 693 + ], + "score": 0.38, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1115, + 903, + 1134, + 903, + 1134, + 923, + 1115, + 923 + ], + "score": 0.36, + "latex": "n" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1439.0, + 1165.0, + 1439.0, + 1165.0, + 1484.0, + 292.0, + 1484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 815.0, + 72.0, + 815.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1246.0, + 616.0, + 1246.0, + 616.0, + 1288.0, + 295.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1758.0, + 722.0, + 1758.0, + 722.0, + 1791.0, + 295.0, + 1791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2122.0, + 832.0, + 2122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1380.0, + 462.0, + 1401.0, + 462.0, + 1401.0, + 482.0, + 1380.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1510.0, + 1405.0, + 1510.0, + 1405.0, + 1544.0, + 295.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1540.0, + 1406.0, + 1540.0, + 1406.0, + 1572.0, + 294.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1572.0, + 1403.0, + 1572.0, + 1403.0, + 1603.0, + 295.0, + 1603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1597.0, + 297.0, + 1597.0, + 297.0, + 1638.0, + 291.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 1597.0, + 515.0, + 1597.0, + 515.0, + 1638.0, + 454.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 795.0, + 1597.0, + 1406.0, + 1597.0, + 1406.0, + 1638.0, + 795.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1630.0, + 1403.0, + 1630.0, + 1403.0, + 1666.0, + 292.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1657.0, + 1403.0, + 1657.0, + 1403.0, + 1700.0, + 291.0, + 1700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1689.0, + 652.0, + 1689.0, + 652.0, + 1728.0, + 294.0, + 1728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1815.0, + 1404.0, + 1815.0, + 1404.0, + 1850.0, + 295.0, + 1850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1845.0, + 1404.0, + 1845.0, + 1404.0, + 1880.0, + 294.0, + 1880.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1870.0, + 1089.0, + 1870.0, + 1089.0, + 1915.0, + 292.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1240.0, + 1870.0, + 1405.0, + 1870.0, + 1405.0, + 1915.0, + 1240.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1903.0, + 873.0, + 1903.0, + 873.0, + 1953.0, + 291.0, + 1953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1903.0, + 906.0, + 1903.0, + 906.0, + 1953.0, + 894.0, + 1953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 1903.0, + 1405.0, + 1903.0, + 1405.0, + 1953.0, + 1395.0, + 1953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1941.0, + 1404.0, + 1941.0, + 1404.0, + 1980.0, + 294.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1971.0, + 997.0, + 1971.0, + 997.0, + 2010.0, + 292.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1023.0, + 1971.0, + 1405.0, + 1971.0, + 1405.0, + 2010.0, + 1023.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2004.0, + 644.0, + 2004.0, + 644.0, + 2035.0, + 296.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1306.0, + 1403.0, + 1306.0, + 1403.0, + 1341.0, + 297.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1334.0, + 636.0, + 1334.0, + 636.0, + 1372.0, + 294.0, + 1372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 728.0, + 1334.0, + 1085.0, + 1334.0, + 1085.0, + 1372.0, + 728.0, + 1372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1179.0, + 1334.0, + 1222.0, + 1334.0, + 1222.0, + 1372.0, + 1179.0, + 1372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1323.0, + 1334.0, + 1405.0, + 1334.0, + 1405.0, + 1372.0, + 1323.0, + 1372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1364.0, + 716.0, + 1364.0, + 716.0, + 1405.0, + 290.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 987.0, + 1364.0, + 998.0, + 1364.0, + 998.0, + 1405.0, + 987.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 661.0, + 398.0, + 661.0, + 398.0, + 701.0, + 294.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 661.0, + 524.0, + 661.0, + 524.0, + 701.0, + 420.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 661.0, + 904.0, + 661.0, + 904.0, + 701.0, + 591.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 661.0, + 1227.0, + 661.0, + 1227.0, + 701.0, + 1064.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 692.0, + 297.0, + 692.0, + 297.0, + 733.0, + 291.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 692.0, + 464.0, + 692.0, + 464.0, + 733.0, + 404.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 692.0, + 969.0, + 692.0, + 969.0, + 733.0, + 598.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 692.0, + 1317.0, + 692.0, + 1317.0, + 733.0, + 991.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 692.0, + 1405.0, + 692.0, + 1405.0, + 733.0, + 1394.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 724.0, + 791.0, + 724.0, + 791.0, + 762.0, + 293.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 845.0, + 724.0, + 992.0, + 724.0, + 992.0, + 762.0, + 845.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1153.0, + 1110.0, + 1153.0, + 1110.0, + 1189.0, + 296.0, + 1189.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1215.0, + 1153.0, + 1405.0, + 1153.0, + 1405.0, + 1189.0, + 1215.0, + 1189.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1184.0, + 1314.0, + 1184.0, + 1314.0, + 1218.0, + 293.0, + 1218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1372.0, + 1186.0, + 1405.0, + 1186.0, + 1405.0, + 1216.0, + 1372.0, + 1216.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 854.0, + 340.0, + 854.0, + 340.0, + 899.0, + 294.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 854.0, + 1282.0, + 854.0, + 1282.0, + 899.0, + 708.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1328.0, + 854.0, + 1407.0, + 854.0, + 1407.0, + 899.0, + 1328.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 894.0, + 1114.0, + 894.0, + 1114.0, + 931.0, + 294.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1135.0, + 894.0, + 1243.0, + 894.0, + 1243.0, + 931.0, + 1135.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1001.0, + 384.0, + 1001.0, + 384.0, + 1053.0, + 290.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 432.0, + 1001.0, + 885.0, + 1001.0, + 885.0, + 1053.0, + 432.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 931.0, + 1001.0, + 1405.0, + 1001.0, + 1405.0, + 1053.0, + 931.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1040.0, + 907.0, + 1040.0, + 907.0, + 1080.0, + 295.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 514.0, + 702.0, + 514.0, + 702.0, + 558.0, + 293.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 728.0, + 514.0, + 1187.0, + 514.0, + 1187.0, + 558.0, + 728.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1242.0, + 514.0, + 1408.0, + 514.0, + 1408.0, + 558.0, + 1242.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 551.0, + 518.0, + 551.0, + 518.0, + 585.0, + 296.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 579.0, + 529.0, + 579.0, + 529.0, + 627.0, + 292.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 773.0, + 579.0, + 911.0, + 579.0, + 911.0, + 627.0, + 773.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 579.0, + 1250.0, + 579.0, + 1250.0, + 627.0, + 1032.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 579.0, + 1408.0, + 579.0, + 1408.0, + 627.0, + 1352.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 616.0, + 482.0, + 616.0, + 482.0, + 654.0, + 292.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 225.0, + 536.0, + 225.0, + 536.0, + 269.0, + 294.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 720.0, + 225.0, + 1169.0, + 225.0, + 1169.0, + 269.0, + 720.0, + 269.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 17, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1784, + 1404, + 1784, + 1404, + 1916, + 297, + 1916 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 1654, + 1405, + 1654, + 1405, + 1778, + 297, + 1778 + ], + "score": 0.975 + }, + { + "category_id": 3, + "poly": [ + 476, + 1018, + 1221, + 1018, + 1221, + 1439, + 476, + 1439 + ], + "score": 0.971 + }, + { + "category_id": 3, + "poly": [ + 913, + 246, + 1390, + 246, + 1390, + 710, + 913, + 710 + ], + "score": 0.967 + }, + { + "category_id": 3, + "poly": [ + 308, + 242, + 786, + 242, + 786, + 711, + 308, + 711 + ], + "score": 0.966 + }, + { + "category_id": 8, + "poly": [ + 666, + 1926, + 1035, + 1926, + 1035, + 1982, + 666, + 1982 + ], + "score": 0.942 + }, + { + "category_id": 4, + "poly": [ + 900, + 735, + 1402, + 735, + 1402, + 793, + 900, + 793 + ], + "score": 0.929 + }, + { + "category_id": 4, + "poly": [ + 298, + 1478, + 1401, + 1478, + 1401, + 1542, + 298, + 1542 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 296, + 1997, + 831, + 1997, + 831, + 2039, + 296, + 2039 + ], + "score": 0.928 + }, + { + "category_id": 0, + "poly": [ + 302, + 1597, + 803, + 1597, + 803, + 1629, + 302, + 1629 + ], + "score": 0.909 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1934, + 1400, + 1934, + 1400, + 1964, + 1352, + 1964 + ], + "score": 0.889 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 811, + 76, + 811, + 104, + 299, + 104 + ], + "score": 0.887 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.871 + }, + { + "category_id": 1, + "poly": [ + 295, + 817, + 1407, + 817, + 1407, + 972, + 295, + 972 + ], + "score": 0.837 + }, + { + "category_id": 1, + "poly": [ + 296, + 735, + 795, + 735, + 795, + 793, + 296, + 793 + ], + "score": 0.827 + }, + { + "category_id": 4, + "poly": [ + 1002, + 236, + 1341, + 236, + 1341, + 255, + 1002, + 255 + ], + "score": 0.385 + }, + { + "category_id": 4, + "poly": [ + 397, + 236, + 735, + 236, + 735, + 255, + 397, + 255 + ], + "score": 0.384 + }, + { + "category_id": 4, + "poly": [ + 295, + 817, + 1407, + 817, + 1407, + 972, + 295, + 972 + ], + "score": 0.221 + }, + { + "category_id": 4, + "poly": [ + 296, + 735, + 795, + 735, + 795, + 793, + 296, + 793 + ], + "score": 0.123 + }, + { + "category_id": 13, + "poly": [ + 442, + 1816, + 591, + 1816, + 591, + 1850, + 442, + 1850 + ], + "score": 0.93, + "latex": "x \\sim \\mathcal { N } ( 0 , \\Sigma )" + }, + { + "category_id": 14, + "poly": [ + 664, + 1925, + 1034, + 1925, + 1034, + 1984, + 664, + 1984 + ], + "score": 0.92, + "latex": "\\operatorname * { i n f } _ { \\lambda \\geq 0 } \\overline { { { R } } } ( \\hat { \\beta } _ { n + 1 , \\lambda } ) \\leq \\operatorname * { i n f } _ { \\lambda \\geq 0 } \\overline { { { R } } } ( \\hat { \\beta } _ { n , \\lambda } )" + }, + { + "category_id": 13, + "poly": [ + 482, + 1996, + 823, + 1996, + 823, + 2038, + 482, + 2038 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\hat { \\beta } _ { n , 0 } : = \\operatorname* { l i m } _ { \\lambda \\to 0 + } \\hat { \\beta } _ { n , \\lambda } = X ^ { \\dagger } y } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 944, + 1783, + 1071, + 1783, + 1071, + 1815, + 944, + 1815 + ], + "score": 0.92, + "latex": "\\Sigma \\in \\mathbb { R } ^ { d \\times d }" + }, + { + "category_id": 13, + "poly": [ + 652, + 1816, + 922, + 1816, + 922, + 1850, + 652, + 1850 + ], + "score": 0.91, + "latex": "y \\sim \\langle x , \\beta ^ { * } \\rangle + \\mathcal { N } ( 0 , \\sigma ^ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 299, + 1817, + 364, + 1817, + 364, + 1850, + 299, + 1850 + ], + "score": 0.9, + "latex": "( x , y )" + }, + { + "category_id": 13, + "poly": [ + 1289, + 849, + 1402, + 849, + 1402, + 878, + 1289, + 878 + ], + "score": 0.89, + "latex": "D = 5 0 0" + }, + { + "category_id": 13, + "poly": [ + 539, + 880, + 642, + 880, + 642, + 909, + 539, + 909 + ], + "score": 0.89, + "latex": "n = 5 0 0" + }, + { + "category_id": 13, + "poly": [ + 560, + 1786, + 640, + 1786, + 640, + 1815, + 560, + 1815 + ], + "score": 0.89, + "latex": "d \\in \\mathbb { N }" + }, + { + "category_id": 13, + "poly": [ + 1136, + 1885, + 1208, + 1885, + 1208, + 1912, + 1136, + 1912 + ], + "score": 0.88, + "latex": "n \\in \\mathbb { N }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1884, + 367, + 1884, + 367, + 1914, + 298, + 1914 + ], + "score": 0.88, + "latex": "\\lambda \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 728, + 1850, + 1179, + 1850, + 1179, + 1889, + 728, + 1889 + ], + "score": 0.88, + "latex": "\\begin{array} { r } { \\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\boldsymbol { \\beta } } \\| X { \\boldsymbol { \\beta } } - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| { \\boldsymbol { \\beta } } \\| _ { 2 } ^ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1208, + 1480, + 1236, + 1480, + 1236, + 1511, + 1208, + 1511 + ], + "score": 0.86, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 628, + 943, + 655, + 943, + 655, + 970, + 628, + 970 + ], + "score": 0.7, + "latex": "\\times" + }, + { + "category_id": 13, + "poly": [ + 938, + 1891, + 956, + 1891, + 956, + 1911, + 938, + 1911 + ], + "score": 0.61, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1326, + 279, + 1378, + 279, + 1378, + 292, + 1326, + 292 + ], + "score": 0.3, + "latex": "\\lambda = 2 ^ { - 1 0 } d" + }, + { + "category_id": 13, + "poly": [ + 1326, + 294, + 1375, + 294, + 1375, + 307, + 1326, + 307 + ], + "score": 0.3, + "latex": "\\lambda = 2 ^ { - 6 } d" + }, + { + "category_id": 15, + "poly": [ + 672.0, + 1017.0, + 1075.0, + 1017.0, + 1075.0, + 1042.0, + 672.0, + 1042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 1047.0, + 1190.0, + 1047.0, + 1190.0, + 1070.0, + 1062.0, + 1070.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 1065.0, + 1211.0, + 1065.0, + 1211.0, + 1091.0, + 1063.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 1077.0, + 529.0, + 1077.0, + 529.0, + 1101.0, + 498.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1085.0, + 1205.0, + 1085.0, + 1205.0, + 1109.0, + 1064.0, + 1109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1104.0, + 1205.0, + 1104.0, + 1205.0, + 1129.0, + 1064.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1123.0, + 1205.0, + 1123.0, + 1205.0, + 1149.0, + 1064.0, + 1149.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 1151.0, + 528.0, + 1151.0, + 528.0, + 1176.0, + 498.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1141.0, + 1196.0, + 1141.0, + 1196.0, + 1167.0, + 1064.0, + 1167.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 474.0, + 1170.0, + 503.0, + 1170.0, + 503.0, + 1270.0, + 474.0, + 1270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1224.0, + 528.0, + 1224.0, + 528.0, + 1248.0, + 499.0, + 1248.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 1297.0, + 529.0, + 1297.0, + 529.0, + 1324.0, + 497.0, + 1324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 1371.0, + 528.0, + 1371.0, + 528.0, + 1395.0, + 498.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1021.0, + 1379.0, + 1031.0, + 1379.0, + 1031.0, + 1388.0, + 1021.0, + 1388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1183.0, + 1380.0, + 1191.0, + 1380.0, + 1191.0, + 1389.0, + 1183.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 539.0, + 1399.0, + 556.0, + 1399.0, + 556.0, + 1419.0, + 539.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 1397.0, + 661.0, + 1397.0, + 661.0, + 1421.0, + 634.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 1397.0, + 760.0, + 1397.0, + 760.0, + 1421.0, + 733.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 834.0, + 1398.0, + 859.0, + 1398.0, + 859.0, + 1419.0, + 834.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 933.0, + 1397.0, + 961.0, + 1397.0, + 961.0, + 1420.0, + 933.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1035.0, + 1398.0, + 1059.0, + 1398.0, + 1059.0, + 1420.0, + 1035.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 1398.0, + 1158.0, + 1398.0, + 1158.0, + 1419.0, + 1134.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 772.0, + 1412.0, + 973.0, + 1412.0, + 973.0, + 1443.0, + 772.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 1102.5, + 578.0, + 1102.5, + 578.0, + 1113.5, + 565.0, + 1113.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1003.0, + 240.0, + 1341.0, + 240.0, + 1341.0, + 256.0, + 1003.0, + 256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 252.0, + 961.0, + 252.0, + 961.0, + 273.0, + 929.0, + 273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1318.0, + 258.0, + 1382.0, + 258.0, + 1382.0, + 279.0, + 1318.0, + 279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1321.0, + 272.0, + 1325.0, + 272.0, + 1325.0, + 296.0, + 1321.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1379.0, + 272.0, + 1384.0, + 272.0, + 1384.0, + 296.0, + 1379.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1320.0, + 285.0, + 1325.0, + 285.0, + 1325.0, + 314.0, + 1320.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1376.0, + 285.0, + 1381.0, + 285.0, + 1381.0, + 314.0, + 1376.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 310.0, + 959.0, + 310.0, + 959.0, + 332.0, + 929.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1320.0, + 303.0, + 1381.0, + 303.0, + 1381.0, + 344.0, + 1320.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1321.0, + 334.0, + 1376.0, + 334.0, + 1376.0, + 360.0, + 1321.0, + 360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1320.0, + 350.0, + 1375.0, + 350.0, + 1375.0, + 376.0, + 1320.0, + 376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 367.0, + 959.0, + 367.0, + 959.0, + 390.0, + 929.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 911.0, + 392.0, + 937.0, + 392.0, + 937.0, + 541.0, + 911.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 930.0, + 425.0, + 958.0, + 425.0, + 958.0, + 448.0, + 930.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 484.0, + 957.0, + 484.0, + 957.0, + 507.0, + 929.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 930.0, + 542.0, + 958.0, + 542.0, + 958.0, + 563.0, + 930.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 930.0, + 601.0, + 957.0, + 601.0, + 957.0, + 620.0, + 930.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 658.0, + 959.0, + 658.0, + 959.0, + 680.0, + 929.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 968.0, + 678.0, + 983.0, + 678.0, + 983.0, + 694.0, + 968.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 675.0, + 1072.0, + 675.0, + 1072.0, + 697.0, + 1039.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1119.0, + 675.0, + 1153.0, + 675.0, + 1153.0, + 696.0, + 1119.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1199.0, + 675.0, + 1232.0, + 675.0, + 1232.0, + 696.0, + 1199.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1279.0, + 675.0, + 1311.0, + 675.0, + 1311.0, + 697.0, + 1279.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1357.0, + 676.0, + 1393.0, + 676.0, + 1393.0, + 696.0, + 1357.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1073.0, + 687.0, + 1269.0, + 687.0, + 1269.0, + 715.0, + 1073.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 233.0, + 739.0, + 233.0, + 739.0, + 257.0, + 397.0, + 257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 263.0, + 354.0, + 263.0, + 354.0, + 286.0, + 324.0, + 286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 257.0, + 778.0, + 257.0, + 778.0, + 296.0, + 715.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 713.0, + 288.0, + 775.0, + 288.0, + 775.0, + 311.0, + 713.0, + 311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 304.0, + 774.0, + 304.0, + 774.0, + 327.0, + 716.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 317.0, + 356.0, + 317.0, + 356.0, + 343.0, + 323.0, + 343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 318.0, + 774.0, + 318.0, + 774.0, + 342.0, + 716.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 333.0, + 771.0, + 333.0, + 771.0, + 360.0, + 715.0, + 360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 349.0, + 770.0, + 349.0, + 770.0, + 377.0, + 715.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 374.0, + 353.0, + 374.0, + 353.0, + 396.0, + 324.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 391.0, + 334.0, + 391.0, + 334.0, + 543.0, + 305.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 432.0, + 352.0, + 432.0, + 352.0, + 451.0, + 325.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 485.0, + 352.0, + 485.0, + 352.0, + 507.0, + 324.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 540.0, + 353.0, + 540.0, + 353.0, + 562.0, + 324.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 596.0, + 353.0, + 596.0, + 353.0, + 619.0, + 324.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 651.0, + 352.0, + 651.0, + 352.0, + 673.0, + 324.0, + 673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 678.0, + 378.0, + 678.0, + 378.0, + 695.0, + 362.0, + 695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 434.0, + 673.0, + 468.0, + 673.0, + 468.0, + 699.0, + 434.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 514.0, + 675.0, + 547.0, + 675.0, + 547.0, + 697.0, + 514.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 671.0, + 627.0, + 671.0, + 627.0, + 699.0, + 593.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 673.0, + 675.0, + 706.0, + 675.0, + 706.0, + 697.0, + 673.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 751.0, + 676.0, + 787.0, + 676.0, + 787.0, + 697.0, + 751.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 687.0, + 622.0, + 687.0, + 622.0, + 717.0, + 512.0, + 717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 733.0, + 1404.0, + 733.0, + 1404.0, + 767.0, + 900.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 761.0, + 1222.0, + 761.0, + 1222.0, + 795.0, + 901.0, + 795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1474.0, + 1207.0, + 1474.0, + 1207.0, + 1514.0, + 293.0, + 1514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1237.0, + 1474.0, + 1405.0, + 1474.0, + 1405.0, + 1514.0, + 1237.0, + 1514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1509.0, + 476.0, + 1509.0, + 476.0, + 1546.0, + 294.0, + 1546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1597.0, + 807.0, + 1597.0, + 807.0, + 1633.0, + 295.0, + 1633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2086.0, + 870.0, + 2086.0, + 870.0, + 2125.0, + 832.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1001.0, + 234.0, + 1342.0, + 234.0, + 1342.0, + 259.0, + 1001.0, + 259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 234.0, + 736.0, + 234.0, + 736.0, + 259.0, + 396.0, + 259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 819.0, + 1405.0, + 819.0, + 1405.0, + 852.0, + 296.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 849.0, + 1288.0, + 849.0, + 1288.0, + 883.0, + 294.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 877.0, + 538.0, + 877.0, + 538.0, + 916.0, + 293.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 643.0, + 877.0, + 1405.0, + 877.0, + 1405.0, + 916.0, + 643.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 909.0, + 1405.0, + 909.0, + 1405.0, + 946.0, + 294.0, + 946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 938.0, + 627.0, + 938.0, + 627.0, + 978.0, + 293.0, + 978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 656.0, + 938.0, + 968.0, + 938.0, + 968.0, + 978.0, + 656.0, + 978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 733.0, + 798.0, + 733.0, + 798.0, + 767.0, + 295.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 761.0, + 432.0, + 761.0, + 432.0, + 797.0, + 294.0, + 797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1776.0, + 559.0, + 1776.0, + 559.0, + 1823.0, + 292.0, + 1823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 641.0, + 1776.0, + 943.0, + 1776.0, + 943.0, + 1823.0, + 641.0, + 1823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 1776.0, + 1407.0, + 1776.0, + 1407.0, + 1823.0, + 1072.0, + 1823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1815.0, + 298.0, + 1815.0, + 298.0, + 1851.0, + 295.0, + 1851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 365.0, + 1815.0, + 441.0, + 1815.0, + 441.0, + 1851.0, + 365.0, + 1851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 592.0, + 1815.0, + 651.0, + 1815.0, + 651.0, + 1851.0, + 592.0, + 1851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 1815.0, + 1406.0, + 1815.0, + 1406.0, + 1851.0, + 923.0, + 1851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1849.0, + 727.0, + 1849.0, + 727.0, + 1889.0, + 291.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1180.0, + 1849.0, + 1407.0, + 1849.0, + 1407.0, + 1889.0, + 1180.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1881.0, + 297.0, + 1881.0, + 297.0, + 1918.0, + 293.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 1881.0, + 937.0, + 1881.0, + 937.0, + 1918.0, + 368.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 957.0, + 1881.0, + 1135.0, + 1881.0, + 1135.0, + 1918.0, + 957.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1209.0, + 1881.0, + 1218.0, + 1881.0, + 1218.0, + 1918.0, + 1209.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1656.0, + 1403.0, + 1656.0, + 1403.0, + 1689.0, + 296.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1685.0, + 1406.0, + 1685.0, + 1406.0, + 1719.0, + 292.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1715.0, + 1406.0, + 1715.0, + 1406.0, + 1750.0, + 294.0, + 1750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1744.0, + 880.0, + 1744.0, + 880.0, + 1785.0, + 292.0, + 1785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1992.0, + 481.0, + 1992.0, + 481.0, + 2045.0, + 294.0, + 2045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 824.0, + 1992.0, + 833.0, + 1992.0, + 833.0, + 2045.0, + 824.0, + 2045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 819.0, + 1405.0, + 819.0, + 1405.0, + 852.0, + 296.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 849.0, + 1288.0, + 849.0, + 1288.0, + 883.0, + 294.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 877.0, + 538.0, + 877.0, + 538.0, + 916.0, + 293.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 643.0, + 877.0, + 1405.0, + 877.0, + 1405.0, + 916.0, + 643.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 909.0, + 1405.0, + 909.0, + 1405.0, + 946.0, + 294.0, + 946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 938.0, + 627.0, + 938.0, + 627.0, + 978.0, + 293.0, + 978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 656.0, + 938.0, + 968.0, + 938.0, + 968.0, + 978.0, + 656.0, + 978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 733.0, + 798.0, + 733.0, + 798.0, + 767.0, + 295.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 761.0, + 432.0, + 761.0, + 432.0, + 797.0, + 294.0, + 797.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 18, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1725, + 1403, + 1725, + 1403, + 1881, + 298, + 1881 + ], + "score": 0.974 + }, + { + "category_id": 3, + "poly": [ + 558, + 975, + 1142, + 975, + 1142, + 1558, + 558, + 1558 + ], + "score": 0.973 + }, + { + "category_id": 3, + "poly": [ + 557, + 237, + 1142, + 237, + 1142, + 819, + 557, + 819 + ], + "score": 0.972 + }, + { + "category_id": 4, + "poly": [ + 297, + 1595, + 1397, + 1595, + 1397, + 1658, + 297, + 1658 + ], + "score": 0.947 + }, + { + "category_id": 4, + "poly": [ + 294, + 855, + 1398, + 855, + 1398, + 929, + 294, + 929 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 288, + 2001, + 1321, + 2001, + 1321, + 2035, + 288, + 2035 + ], + "score": 0.904 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 812, + 76, + 812, + 104, + 299, + 104 + ], + "score": 0.894 + }, + { + "category_id": 0, + "poly": [ + 301, + 1933, + 829, + 1933, + 829, + 1966, + 301, + 1966 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 865, + 2088, + 865, + 2112, + 835, + 2112 + ], + "score": 0.857 + }, + { + "category_id": 13, + "poly": [ + 811, + 887, + 967, + 887, + 967, + 929, + 811, + 929 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\frac { 1 } { n } | | X \\hat { \\boldsymbol { \\beta } } - \\vec { y } | | _ { 2 } ^ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 365, + 1819, + 445, + 1819, + 445, + 1850, + 365, + 1850 + ], + "score": 0.91, + "latex": "Q = I" + }, + { + "category_id": 13, + "poly": [ + 451, + 1628, + 557, + 1628, + 557, + 1657, + 451, + 1657 + ], + "score": 0.9, + "latex": "D = 5 0 0" + }, + { + "category_id": 13, + "poly": [ + 1178, + 857, + 1262, + 857, + 1262, + 885, + 1178, + 885 + ], + "score": 0.89, + "latex": "d = 3 0" + }, + { + "category_id": 13, + "poly": [ + 1062, + 1009, + 1124, + 1009, + 1124, + 1026, + 1062, + 1026 + ], + "score": 0.58, + "latex": "\\lambda = 2 ^ { - 2 0 } d" + }, + { + "category_id": 13, + "poly": [ + 1062, + 1029, + 1124, + 1029, + 1124, + 1045, + 1062, + 1045 + ], + "score": 0.54, + "latex": "\\lambda = 2 ^ { - 1 0 } d" + }, + { + "category_id": 13, + "poly": [ + 1063, + 1127, + 1112, + 1127, + 1112, + 1142, + 1063, + 1142 + ], + "score": 0.46, + "latex": "\\lambda = 2 ^ { 2 } d" + }, + { + "category_id": 13, + "poly": [ + 1063, + 1048, + 1120, + 1048, + 1120, + 1064, + 1063, + 1064 + ], + "score": 0.43, + "latex": "\\lambda = 2 ^ { - 6 } d" + }, + { + "category_id": 13, + "poly": [ + 1062, + 1088, + 1119, + 1088, + 1119, + 1103, + 1062, + 1103 + ], + "score": 0.38, + "latex": "\\lambda = 2 ^ { - 2 } d" + }, + { + "category_id": 13, + "poly": [ + 1062, + 1068, + 1120, + 1068, + 1120, + 1084, + 1062, + 1084 + ], + "score": 0.37, + "latex": "\\lambda = 2 ^ { - 4 } d" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 987.0, + 623.0, + 987.0, + 623.0, + 1016.0, + 575.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 671.0, + 976.0, + 1084.0, + 976.0, + 1084.0, + 1004.0, + 671.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 1004.0, + 1061.0, + 1004.0, + 1061.0, + 1030.0, + 1052.0, + 1030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 1004.0, + 1131.0, + 1004.0, + 1131.0, + 1030.0, + 1125.0, + 1030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 1020.0, + 1061.0, + 1020.0, + 1061.0, + 1053.0, + 1053.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 1020.0, + 1133.0, + 1020.0, + 1133.0, + 1053.0, + 1125.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 1051.0, + 621.0, + 1051.0, + 621.0, + 1081.0, + 576.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 1041.0, + 1061.0, + 1041.0, + 1061.0, + 1091.0, + 1054.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1121.0, + 1041.0, + 1129.0, + 1041.0, + 1129.0, + 1091.0, + 1121.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1055.0, + 1079.0, + 1061.0, + 1079.0, + 1061.0, + 1110.0, + 1055.0, + 1110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 1079.0, + 1128.0, + 1079.0, + 1128.0, + 1110.0, + 1120.0, + 1110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 1099.0, + 1122.0, + 1099.0, + 1122.0, + 1130.0, + 1054.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 1116.0, + 622.0, + 1116.0, + 622.0, + 1146.0, + 575.0, + 1146.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 1116.0, + 1062.0, + 1116.0, + 1062.0, + 1151.0, + 1054.0, + 1151.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1113.0, + 1116.0, + 1122.0, + 1116.0, + 1122.0, + 1151.0, + 1113.0, + 1151.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 551.0, + 1168.0, + 589.0, + 1168.0, + 589.0, + 1351.0, + 551.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 1182.0, + 619.0, + 1182.0, + 619.0, + 1208.0, + 577.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 578.0, + 1246.0, + 620.0, + 1246.0, + 620.0, + 1273.0, + 578.0, + 1273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 1310.0, + 619.0, + 1310.0, + 619.0, + 1337.0, + 577.0, + 1337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 1374.0, + 621.0, + 1374.0, + 621.0, + 1403.0, + 575.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 1438.0, + 621.0, + 1438.0, + 621.0, + 1467.0, + 575.0, + 1467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 1502.0, + 621.0, + 1502.0, + 621.0, + 1532.0, + 576.0, + 1532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 631.0, + 1516.0, + 650.0, + 1516.0, + 650.0, + 1539.0, + 631.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1513.0, + 757.0, + 1513.0, + 757.0, + 1543.0, + 717.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 812.0, + 1512.0, + 854.0, + 1512.0, + 854.0, + 1542.0, + 812.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 1512.0, + 950.0, + 1512.0, + 950.0, + 1542.0, + 908.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1005.0, + 1512.0, + 1045.0, + 1512.0, + 1045.0, + 1542.0, + 1005.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1096.0, + 1513.0, + 1144.0, + 1513.0, + 1144.0, + 1542.0, + 1096.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 810.0, + 1527.0, + 944.0, + 1527.0, + 944.0, + 1565.0, + 810.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 236.0, + 1053.0, + 236.0, + 1053.0, + 264.0, + 696.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 265.0, + 1097.0, + 265.0, + 1097.0, + 290.0, + 1045.0, + 290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 284.0, + 612.0, + 284.0, + 612.0, + 312.0, + 577.0, + 312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 284.0, + 1134.0, + 284.0, + 1134.0, + 308.0, + 1046.0, + 308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 303.0, + 1134.0, + 303.0, + 1134.0, + 329.0, + 1046.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 321.0, + 1112.0, + 321.0, + 1112.0, + 347.0, + 1046.0, + 347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 340.0, + 1126.0, + 340.0, + 1126.0, + 367.0, + 1046.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 360.0, + 1126.0, + 360.0, + 1126.0, + 386.0, + 1047.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 376.0, + 613.0, + 376.0, + 613.0, + 402.0, + 576.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 426.0, + 586.0, + 426.0, + 586.0, + 611.0, + 553.0, + 611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 468.0, + 611.0, + 468.0, + 611.0, + 495.0, + 577.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 578.0, + 560.0, + 610.0, + 560.0, + 610.0, + 583.0, + 578.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 650.0, + 612.0, + 650.0, + 612.0, + 676.0, + 577.0, + 676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 578.0, + 742.0, + 611.0, + 742.0, + 611.0, + 765.0, + 578.0, + 765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 616.0, + 780.0, + 632.0, + 780.0, + 632.0, + 798.0, + 616.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 710.0, + 776.0, + 738.0, + 776.0, + 738.0, + 801.0, + 710.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 776.0, + 837.0, + 776.0, + 837.0, + 800.0, + 809.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 910.0, + 776.0, + 937.0, + 776.0, + 937.0, + 800.0, + 910.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 776.0, + 1037.0, + 776.0, + 1037.0, + 800.0, + 1009.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1108.0, + 776.0, + 1137.0, + 776.0, + 1137.0, + 800.0, + 1108.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 807.0, + 790.0, + 939.0, + 790.0, + 939.0, + 822.0, + 807.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1593.0, + 1401.0, + 1593.0, + 1401.0, + 1629.0, + 296.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1625.0, + 450.0, + 1625.0, + 450.0, + 1661.0, + 295.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 558.0, + 1625.0, + 660.0, + 1625.0, + 660.0, + 1661.0, + 558.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 854.0, + 1177.0, + 854.0, + 1177.0, + 892.0, + 295.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1263.0, + 854.0, + 1404.0, + 854.0, + 1404.0, + 892.0, + 1263.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 887.0, + 810.0, + 887.0, + 810.0, + 933.0, + 292.0, + 933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 968.0, + 887.0, + 979.0, + 887.0, + 979.0, + 933.0, + 968.0, + 933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 815.0, + 73.0, + 815.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1930.0, + 835.0, + 1930.0, + 835.0, + 1970.0, + 293.0, + 1970.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2123.0, + 829.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1727.0, + 1404.0, + 1727.0, + 1404.0, + 1760.0, + 296.0, + 1760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1752.0, + 1407.0, + 1752.0, + 1407.0, + 1796.0, + 292.0, + 1796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1788.0, + 1404.0, + 1788.0, + 1404.0, + 1822.0, + 296.0, + 1822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1818.0, + 364.0, + 1818.0, + 364.0, + 1855.0, + 294.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 446.0, + 1818.0, + 1407.0, + 1818.0, + 1407.0, + 1855.0, + 446.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1850.0, + 562.0, + 1850.0, + 562.0, + 1882.0, + 294.0, + 1882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1998.0, + 1326.0, + 1998.0, + 1326.0, + 2040.0, + 292.0, + 2040.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 19, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1734, + 1404, + 1734, + 1404, + 1859, + 297, + 1859 + ], + "score": 0.978 + }, + { + "category_id": 3, + "poly": [ + 557, + 236, + 1142, + 236, + 1142, + 820, + 557, + 820 + ], + "score": 0.973 + }, + { + "category_id": 8, + "poly": [ + 638, + 1579, + 1160, + 1579, + 1160, + 1655, + 638, + 1655 + ], + "score": 0.951 + }, + { + "category_id": 8, + "poly": [ + 632, + 1315, + 1067, + 1315, + 1067, + 1360, + 632, + 1360 + ], + "score": 0.944 + }, + { + "category_id": 8, + "poly": [ + 652, + 1195, + 1049, + 1195, + 1049, + 1250, + 652, + 1250 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 299, + 977, + 1402, + 977, + 1402, + 1042, + 299, + 1042 + ], + "score": 0.943 + }, + { + "category_id": 8, + "poly": [ + 675, + 1080, + 1025, + 1080, + 1025, + 1135, + 675, + 1135 + ], + "score": 0.942 + }, + { + "category_id": 4, + "poly": [ + 296, + 855, + 1397, + 855, + 1397, + 920, + 296, + 920 + ], + "score": 0.941 + }, + { + "category_id": 1, + "poly": [ + 297, + 1146, + 1150, + 1146, + 1150, + 1183, + 297, + 1183 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 296, + 1388, + 958, + 1388, + 958, + 1422, + 296, + 1422 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 297, + 1267, + 934, + 1267, + 934, + 1301, + 297, + 1301 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 296, + 1668, + 819, + 1668, + 819, + 1703, + 296, + 1703 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 295, + 1999, + 984, + 1999, + 984, + 2038, + 295, + 2038 + ], + "score": 0.923 + }, + { + "category_id": 8, + "poly": [ + 825, + 1472, + 968, + 1472, + 968, + 1518, + 825, + 1518 + ], + "score": 0.916 + }, + { + "category_id": 1, + "poly": [ + 297, + 1057, + 375, + 1057, + 375, + 1089, + 297, + 1089 + ], + "score": 0.908 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1479, + 1400, + 1479, + 1400, + 1511, + 1352, + 1511 + ], + "score": 0.906 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 813, + 75, + 813, + 105, + 299, + 105 + ], + "score": 0.901 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1323, + 1401, + 1323, + 1401, + 1354, + 1352, + 1354 + ], + "score": 0.892 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1600, + 1400, + 1600, + 1400, + 1632, + 1352, + 1632 + ], + "score": 0.89 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1949, + 1401, + 1949, + 1401, + 1980, + 1351, + 1980 + ], + "score": 0.887 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1884, + 1400, + 1884, + 1400, + 1915, + 1352, + 1915 + ], + "score": 0.883 + }, + { + "category_id": 1, + "poly": [ + 362, + 1539, + 385, + 1539, + 385, + 1568, + 362, + 1568 + ], + "score": 0.818 + }, + { + "category_id": 8, + "poly": [ + 616, + 1876, + 1076, + 1876, + 1076, + 1933, + 616, + 1933 + ], + "score": 0.817 + }, + { + "category_id": 8, + "poly": [ + 676, + 1943, + 986, + 1943, + 986, + 1983, + 676, + 1983 + ], + "score": 0.728 + }, + { + "category_id": 1, + "poly": [ + 363, + 1449, + 386, + 1449, + 386, + 1478, + 363, + 1478 + ], + "score": 0.707 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 863, + 2087, + 863, + 2113, + 834, + 2113 + ], + "score": 0.692 + }, + { + "category_id": 8, + "poly": [ + 615, + 1875, + 1073, + 1875, + 1073, + 1983, + 615, + 1983 + ], + "score": 0.239 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 863, + 2087, + 863, + 2113, + 834, + 2113 + ], + "score": 0.133 + }, + { + "category_id": 13, + "poly": [ + 372, + 2002, + 516, + 2002, + 516, + 2036, + 372, + 2036 + ], + "score": 0.93, + "latex": "x \\sim \\mathcal { N } ( 0 , I )" + }, + { + "category_id": 14, + "poly": [ + 639, + 1579, + 1159, + 1579, + 1159, + 1655, + 639, + 1655 + ], + "score": 0.93, + "latex": "( G _ { \\lambda } ^ { n } - G _ { \\lambda } ^ { n + 1 } ) - ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) \\frac { d G _ { \\lambda } ^ { n } / d \\lambda } { d H _ { \\lambda } ^ { n } / d \\lambda } \\succeq 0" + }, + { + "category_id": 14, + "poly": [ + 828, + 1473, + 972, + 1473, + 972, + 1515, + 828, + 1515 + ], + "score": 0.93, + "latex": "G _ { \\lambda } ^ { n } \\succeq G _ { \\lambda } ^ { n + 1 }" + }, + { + "category_id": 14, + "poly": [ + 615, + 1874, + 1080, + 1874, + 1080, + 1988, + 615, + 1988 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } { { \\hat { \\beta } _ { n , \\lambda } : = \\operatorname * { a r g m i n } _ { \\beta } \\| X \\beta - \\vec { y } \\| _ { 2 } ^ { 2 } + \\lambda \\| \\beta \\| _ { \\Sigma ^ { - 1 } } ^ { 2 } } } \\\\ & { = ( X ^ { T } X + \\lambda \\Sigma ^ { - 1 } ) ^ { - 1 } X ^ { T } y } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 650, + 1196, + 1049, + 1196, + 1049, + 1252, + 650, + 1252 + ], + "score": 0.93, + "latex": "H _ { \\lambda } ^ { n } : = \\mathbb { E } [ | | X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } | | _ { F } ^ { 2 } ]" + }, + { + "category_id": 14, + "poly": [ + 676, + 1081, + 1023, + 1081, + 1023, + 1137, + 676, + 1137 + ], + "score": 0.93, + "latex": "G _ { \\lambda } ^ { n } : = \\lambda ^ { 2 } \\underset { X } { \\mathbb { E } } [ ( X ^ { T } X + \\lambda Q ) ^ { - 2 } ]" + }, + { + "category_id": 13, + "poly": [ + 1223, + 976, + 1350, + 976, + 1350, + 1012, + 1223, + 1012 + ], + "score": 0.92, + "latex": "Q \\in \\mathbb { R } ^ { d \\times d }" + }, + { + "category_id": 14, + "poly": [ + 631, + 1315, + 1070, + 1315, + 1070, + 1358, + 631, + 1358 + ], + "score": 0.92, + "latex": "\\overline { { { R } } } ( \\hat { \\beta } _ { n , \\lambda } ) = ( \\beta ^ { * } ) ^ { T } G _ { \\lambda } ^ { n } \\beta ^ { * } + \\sigma ^ { 2 } H _ { \\lambda } ^ { n } + \\sigma ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 861, + 1148, + 951, + 1148, + 951, + 1183, + 861, + 1183 + ], + "score": 0.92, + "latex": "\\mathcal { N } ( 0 , 1 )" + }, + { + "category_id": 13, + "poly": [ + 372, + 1147, + 497, + 1147, + 497, + 1178, + 372, + 1178 + ], + "score": 0.92, + "latex": "\\ b { X } \\in \\mathbb { R } ^ { n \\times d }" + }, + { + "category_id": 13, + "poly": [ + 704, + 2002, + 974, + 2002, + 974, + 2036, + 704, + 2036 + ], + "score": 0.9, + "latex": "y \\sim \\langle x , \\beta ^ { * } \\rangle + \\mathcal { N } ( 0 , \\sigma ^ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 451, + 888, + 551, + 888, + 551, + 917, + 451, + 917 + ], + "score": 0.88, + "latex": "n = 5 0 0" + }, + { + "category_id": 13, + "poly": [ + 559, + 979, + 640, + 979, + 640, + 1009, + 559, + 1009 + ], + "score": 0.81, + "latex": "n \\in \\mathbb { N }" + }, + { + "category_id": 13, + "poly": [ + 652, + 980, + 731, + 980, + 731, + 1010, + 652, + 1010 + ], + "score": 0.63, + "latex": "d \\geq n" + }, + { + "category_id": 13, + "poly": [ + 796, + 1672, + 810, + 1672, + 810, + 1697, + 796, + 1697 + ], + "score": 0.59, + "latex": "^ { l }" + }, + { + "category_id": 13, + "poly": [ + 743, + 980, + 821, + 980, + 821, + 1010, + 743, + 1010 + ], + "score": 0.58, + "latex": "\\lambda > 0" + }, + { + "category_id": 13, + "poly": [ + 582, + 1275, + 602, + 1275, + 602, + 1296, + 582, + 1296 + ], + "score": 0.55, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1063, + 387, + 1112, + 387, + 1112, + 402, + 1063, + 402 + ], + "score": 0.43, + "latex": "\\lambda = 2 ^ { 2 } d" + }, + { + "category_id": 13, + "poly": [ + 1062, + 349, + 1119, + 349, + 1119, + 363, + 1062, + 363 + ], + "score": 0.3, + "latex": "\\lambda = 2 ^ { - 2 } d" + }, + { + "category_id": 13, + "poly": [ + 561, + 979, + 821, + 979, + 821, + 1011, + 561, + 1011 + ], + "score": 0.28, + "latex": "n \\in \\mathbb { N } , d \\geq n , \\lambda > 0" + }, + { + "category_id": 13, + "poly": [ + 1063, + 329, + 1119, + 329, + 1119, + 343, + 1063, + 343 + ], + "score": 0.27, + "latex": "\\lambda = 2 ^ { - 4 } d" + }, + { + "category_id": 15, + "poly": [ + 670.0, + 235.0, + 1083.0, + 235.0, + 1083.0, + 264.0, + 670.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 247.0, + 622.0, + 247.0, + 622.0, + 277.0, + 575.0, + 277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 264.0, + 1131.0, + 264.0, + 1131.0, + 290.0, + 1052.0, + 290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 280.0, + 1133.0, + 280.0, + 1133.0, + 313.0, + 1052.0, + 313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 311.0, + 622.0, + 311.0, + 622.0, + 341.0, + 576.0, + 341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 300.0, + 1062.0, + 300.0, + 1062.0, + 351.0, + 1054.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 300.0, + 1128.0, + 300.0, + 1128.0, + 351.0, + 1120.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 340.0, + 1061.0, + 340.0, + 1061.0, + 371.0, + 1054.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 340.0, + 1128.0, + 340.0, + 1128.0, + 371.0, + 1120.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 359.0, + 1122.0, + 359.0, + 1122.0, + 391.0, + 1054.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 376.0, + 623.0, + 376.0, + 623.0, + 405.0, + 576.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 377.0, + 1062.0, + 377.0, + 1062.0, + 409.0, + 1053.0, + 409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1113.0, + 377.0, + 1120.0, + 377.0, + 1120.0, + 409.0, + 1113.0, + 409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 428.0, + 589.0, + 428.0, + 589.0, + 609.0, + 553.0, + 609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 441.0, + 619.0, + 441.0, + 619.0, + 468.0, + 577.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 507.0, + 620.0, + 507.0, + 620.0, + 532.0, + 577.0, + 532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 522.0, + 646.0, + 522.0, + 646.0, + 537.0, + 638.0, + 537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 572.0, + 619.0, + 572.0, + 619.0, + 596.0, + 577.0, + 596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 636.0, + 621.0, + 636.0, + 621.0, + 661.0, + 577.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 698.0, + 620.0, + 698.0, + 620.0, + 728.0, + 576.0, + 728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 763.0, + 621.0, + 763.0, + 621.0, + 792.0, + 576.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 631.0, + 776.0, + 651.0, + 776.0, + 651.0, + 800.0, + 631.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 718.0, + 775.0, + 757.0, + 775.0, + 757.0, + 802.0, + 718.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 814.0, + 775.0, + 853.0, + 775.0, + 853.0, + 801.0, + 814.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 775.0, + 948.0, + 775.0, + 948.0, + 801.0, + 909.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1005.0, + 775.0, + 1043.0, + 775.0, + 1043.0, + 802.0, + 1005.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1097.0, + 775.0, + 1142.0, + 775.0, + 1142.0, + 801.0, + 1097.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 791.0, + 996.0, + 791.0, + 996.0, + 822.0, + 756.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 854.0, + 1402.0, + 854.0, + 1402.0, + 890.0, + 294.0, + 890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 886.0, + 450.0, + 886.0, + 450.0, + 921.0, + 295.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 552.0, + 886.0, + 654.0, + 886.0, + 654.0, + 921.0, + 552.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 815.0, + 73.0, + 815.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 2084.0, + 868.0, + 2084.0, + 868.0, + 2125.0, + 830.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 2084.0, + 868.0, + 2084.0, + 868.0, + 2125.0, + 830.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1734.0, + 1405.0, + 1734.0, + 1405.0, + 1772.0, + 294.0, + 1772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1770.0, + 1404.0, + 1770.0, + 1404.0, + 1802.0, + 295.0, + 1802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1796.0, + 1404.0, + 1796.0, + 1404.0, + 1835.0, + 292.0, + 1835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1831.0, + 643.0, + 1831.0, + 643.0, + 1862.0, + 293.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 971.0, + 558.0, + 971.0, + 558.0, + 1016.0, + 290.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 822.0, + 971.0, + 1222.0, + 971.0, + 1222.0, + 1016.0, + 822.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1351.0, + 971.0, + 1409.0, + 971.0, + 1409.0, + 1016.0, + 1351.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1008.0, + 482.0, + 1008.0, + 482.0, + 1046.0, + 294.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1141.0, + 371.0, + 1141.0, + 371.0, + 1189.0, + 294.0, + 1189.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 1141.0, + 860.0, + 1141.0, + 860.0, + 1189.0, + 498.0, + 1189.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 1141.0, + 1152.0, + 1141.0, + 1152.0, + 1189.0, + 952.0, + 1189.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1388.0, + 957.0, + 1388.0, + 957.0, + 1425.0, + 297.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1263.0, + 581.0, + 1263.0, + 581.0, + 1308.0, + 294.0, + 1308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 603.0, + 1263.0, + 937.0, + 1263.0, + 937.0, + 1308.0, + 603.0, + 1308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1663.0, + 795.0, + 1663.0, + 795.0, + 1709.0, + 293.0, + 1709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 1663.0, + 823.0, + 1663.0, + 823.0, + 1709.0, + 811.0, + 1709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1996.0, + 371.0, + 1996.0, + 371.0, + 2041.0, + 294.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 1996.0, + 703.0, + 1996.0, + 703.0, + 2041.0, + 517.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 1996.0, + 985.0, + 1996.0, + 985.0, + 2041.0, + 975.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1050.0, + 381.0, + 1050.0, + 381.0, + 1100.0, + 291.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 359.0, + 1537.0, + 389.0, + 1537.0, + 389.0, + 1577.0, + 359.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 1448.0, + 390.0, + 1448.0, + 390.0, + 1488.0, + 361.0, + 1488.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 20, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 295, + 280, + 1488, + 280, + 1488, + 694, + 295, + 694 + ], + "score": 0.972 + }, + { + "category_id": 8, + "poly": [ + 677, + 1726, + 1019, + 1726, + 1019, + 1812, + 677, + 1812 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 298, + 1444, + 1402, + 1444, + 1402, + 1517, + 298, + 1517 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 297, + 889, + 1402, + 889, + 1402, + 954, + 297, + 954 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 296, + 1846, + 1404, + 1846, + 1404, + 1914, + 296, + 1914 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 554, + 1537, + 1148, + 1537, + 1148, + 1615, + 554, + 1615 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 296, + 1064, + 1400, + 1064, + 1400, + 1131, + 296, + 1131 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 298, + 1148, + 1403, + 1148, + 1403, + 1215, + 298, + 1215 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 611, + 970, + 1090, + 970, + 1090, + 1028, + 611, + 1028 + ], + "score": 0.945 + }, + { + "category_id": 8, + "poly": [ + 777, + 769, + 922, + 769, + 922, + 825, + 777, + 825 + ], + "score": 0.939 + }, + { + "category_id": 8, + "poly": [ + 701, + 1930, + 999, + 1930, + 999, + 1979, + 701, + 1979 + ], + "score": 0.938 + }, + { + "category_id": 8, + "poly": [ + 847, + 1234, + 1089, + 1234, + 1089, + 1307, + 847, + 1307 + ], + "score": 0.937 + }, + { + "category_id": 1, + "poly": [ + 297, + 1644, + 1404, + 1644, + 1404, + 1714, + 297, + 1714 + ], + "score": 0.937 + }, + { + "category_id": 1, + "poly": [ + 295, + 227, + 1185, + 227, + 1185, + 264, + 295, + 264 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 296, + 724, + 545, + 724, + 545, + 756, + 296, + 756 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 299, + 842, + 667, + 842, + 667, + 875, + 299, + 875 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 296, + 1392, + 900, + 1392, + 900, + 1426, + 296, + 1426 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 298, + 1994, + 1141, + 1994, + 1141, + 2041, + 298, + 2041 + ], + "score": 0.923 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 814, + 73, + 814, + 106, + 298, + 106 + ], + "score": 0.919 + }, + { + "category_id": 8, + "poly": [ + 618, + 1310, + 1090, + 1310, + 1090, + 1379, + 618, + 1379 + ], + "score": 0.917 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1755, + 1400, + 1755, + 1400, + 1787, + 1351, + 1787 + ], + "score": 0.905 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1329, + 1401, + 1329, + 1401, + 1361, + 1351, + 1361 + ], + "score": 0.891 + }, + { + "category_id": 9, + "poly": [ + 1351, + 775, + 1401, + 775, + 1401, + 807, + 1351, + 807 + ], + "score": 0.887 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1257, + 1400, + 1257, + 1400, + 1289, + 1351, + 1289 + ], + "score": 0.886 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 866, + 2087, + 866, + 2113, + 834, + 2113 + ], + "score": 0.849 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1561, + 1400, + 1561, + 1400, + 1593, + 1351, + 1593 + ], + "score": 0.825 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1561, + 1400, + 1561, + 1400, + 1593, + 1351, + 1593 + ], + "score": 0.138 + }, + { + "category_id": 13, + "poly": [ + 1310, + 1442, + 1405, + 1442, + 1405, + 1482, + 1310, + 1482 + ], + "score": 0.95, + "latex": "\\hat { \\beta } _ { n , 0 } : =" + }, + { + "category_id": 14, + "poly": [ + 677, + 1723, + 1022, + 1723, + 1022, + 1811, + 677, + 1811 + ], + "score": 0.94, + "latex": "\\sigma ^ { 2 } \\leq - \\frac { ( \\beta ^ { * } ) ^ { T } ( \\frac { d G _ { \\lambda } ^ { n } } { d \\lambda } ) \\beta ^ { * } } { d H _ { \\lambda } ^ { n } / d \\lambda } \\Big \\vert _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } }" + }, + { + "category_id": 13, + "poly": [ + 398, + 1146, + 494, + 1146, + 494, + 1185, + 398, + 1185 + ], + "score": 0.93, + "latex": "\\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } )" + }, + { + "category_id": 13, + "poly": [ + 473, + 1644, + 577, + 1644, + 577, + 1688, + 473, + 1688 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\frac { d H _ { \\lambda } ^ { n } } { d \\lambda } \\leq 0 } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1065, + 1064, + 1167, + 1064, + 1167, + 1097, + 1065, + 1097 + ], + "score": 0.93, + "latex": "\\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } }" + }, + { + "category_id": 13, + "poly": [ + 1293, + 1149, + 1338, + 1149, + 1338, + 1182, + 1293, + 1182 + ], + "score": 0.93, + "latex": "\\lambda _ { n } ^ { \\mathrm { o p t } }" + }, + { + "category_id": 14, + "poly": [ + 617, + 1230, + 1091, + 1230, + 1091, + 1385, + 617, + 1385 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\frac { d \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) } { d \\lambda } \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } = 0 } \\\\ { \\implies ( \\beta ^ { * } ) ^ { T } \\frac { d G _ { \\lambda } ^ { n } } { d \\lambda } \\beta ^ { * } + \\sigma ^ { 2 } \\frac { d H _ { \\lambda } ^ { n } } { d \\lambda } \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } = 0 } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 995, + 1151, + 1128, + 1151, + 1128, + 1185, + 995, + 1185 + ], + "score": 0.93, + "latex": "\\lambda \\in ( 0 , \\infty )" + }, + { + "category_id": 13, + "poly": [ + 297, + 1480, + 458, + 1480, + 458, + 1519, + 297, + 1519 + ], + "score": 0.93, + "latex": "\\mathrm { l i m } _ { \\lambda \\to 0 + } \\hat { \\beta } _ { n , \\lambda }" + }, + { + "category_id": 13, + "poly": [ + 440, + 229, + 558, + 229, + 558, + 263, + 440, + 263 + ], + "score": 0.92, + "latex": "\\boldsymbol { Q } : = \\boldsymbol { \\Sigma } ^ { - 1 }" + }, + { + "category_id": 13, + "poly": [ + 993, + 1444, + 1093, + 1444, + 1093, + 1478, + 993, + 1478 + ], + "score": 0.92, + "latex": "\\lambda _ { n } ^ { \\mathrm { o p t } } = 0" + }, + { + "category_id": 14, + "poly": [ + 310, + 274, + 1428, + 274, + 1428, + 697, + 310, + 697 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\mathbb { E } [ \\left. \\hat { \\beta } _ { n , \\lambda } \\right. = \\underset { X , y } { \\mathbb { E } } [ \\left. \\hat { \\beta } _ { n , \\lambda } - \\beta ^ { * } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X , y } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } y - \\beta ^ { * } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X , \\eta = N ; 0 } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } ( X \\beta ^ { * } + \\eta ) - \\beta ^ { * } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X , \\eta = N ; 0 } { \\mathbb { E } } [ ( 0 , \\lambda ^ { 2 } Y ^ { T } \\eta _ { n } ^ { 2 } ) ] \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } ( X \\beta ^ { * } + \\eta ) - \\beta ^ { * } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } X \\beta ^ { * } - \\beta ^ { * } ) \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } \\right. _ { F } ^ { 2 } ] + \\sigma ^ { 2 } } \\\\ & { \\quad = \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } ( X ^ { T } X + \\lambda Q - \\lambda Q ) \\beta ^ { * } - \\beta ^ { * } ) \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } \\right. _ { F } ^ { 2 } ] } \\\\ & \\quad = \\lambda ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } \\right. _ { 2 } ^ { 2 } ] + \\sigma ^ { 2 } \\underset { X } { \\mathbb { E } } [ \\left. ( X ^ { T } X + \\lambda Q ) ^ { - 1 } X ^ { T } \\right. _ { F } ^ { 2 } ] + \\sigma \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 609, + 969, + 1089, + 969, + 1089, + 1027, + 609, + 1027 + ], + "score": 0.92, + "latex": "\\operatorname* { l i m } _ { \\lambda \\to \\infty } \\overline { { { R } } } ( \\hat { \\beta } _ { n , \\lambda } ) = \\overline { { { R } } } ( \\vec { 0 } ) = \\operatorname* { l i m } _ { \\lambda \\to \\infty } \\overline { { { R } } } ( \\hat { \\beta } _ { n + 1 , \\lambda } )" + }, + { + "category_id": 14, + "poly": [ + 553, + 1534, + 1148, + 1534, + 1148, + 1612, + 553, + 1612 + ], + "score": 0.92, + "latex": "\\frac { d \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda } ) } { d \\lambda } \\Big | _ { \\lambda = 0 } = ( \\beta ^ { * } ) ^ { T } \\frac { d G _ { \\lambda } ^ { n } } { d \\lambda } \\beta ^ { * } + \\sigma ^ { 2 } \\frac { d H _ { \\lambda } ^ { n } } { d \\lambda } \\Big | _ { \\lambda = 0 } \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 553, + 1881, + 639, + 1881, + 639, + 1914, + 553, + 1914 + ], + "score": 0.92, + "latex": "( n + 1 )" + }, + { + "category_id": 14, + "poly": [ + 774, + 767, + 923, + 767, + 923, + 826, + 774, + 826 + ], + "score": 0.92, + "latex": "\\operatorname* { i n f } _ { \\lambda \\geq 0 } { \\overline { { R } } } ( { \\hat { \\beta } } _ { n , \\lambda } )" + }, + { + "category_id": 13, + "poly": [ + 1011, + 1847, + 1057, + 1847, + 1057, + 1880, + 1011, + 1880 + ], + "score": 0.91, + "latex": "\\lambda _ { n } ^ { \\mathrm { o p t } }" + }, + { + "category_id": 14, + "poly": [ + 701, + 1929, + 998, + 1929, + 998, + 1977, + 701, + 1977 + ], + "score": 0.91, + "latex": "\\overline { { R } } ( \\widehat { \\beta } _ { n , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) \\geq \\overline { { R } } ( \\widehat { \\beta } _ { n + 1 , \\lambda _ { n } ^ { \\mathrm { o p t } } } )" + }, + { + "category_id": 13, + "poly": [ + 1119, + 893, + 1240, + 893, + 1240, + 921, + 1119, + 921 + ], + "score": 0.91, + "latex": "\\lambda \\to + \\infty" + }, + { + "category_id": 13, + "poly": [ + 337, + 1098, + 412, + 1098, + 412, + 1131, + 337, + 1131 + ], + "score": 0.91, + "latex": "( 0 , \\infty )" + }, + { + "category_id": 13, + "poly": [ + 794, + 1993, + 1132, + 1993, + 1132, + 2043, + 794, + 2043 + ], + "score": 0.9, + "latex": "\\overline { { R } } ( \\hat { \\beta } _ { n + 1 , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) \\geq \\overline { { R } } ( \\hat { \\beta } _ { n + 1 , \\lambda _ { n + 1 } ^ { \\mathrm { o p t } } } )" + }, + { + "category_id": 13, + "poly": [ + 893, + 1153, + 912, + 1153, + 912, + 1179, + 893, + 1179 + ], + "score": 0.81, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1036, + 238, + 1056, + 238, + 1056, + 258, + 1036, + 258 + ], + "score": 0.74, + "latex": "n" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 815.0, + 72.0, + 815.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2125.0, + 830.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1435.0, + 992.0, + 1435.0, + 992.0, + 1486.0, + 294.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 1435.0, + 1309.0, + 1435.0, + 1309.0, + 1486.0, + 1094.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 1480.0, + 662.0, + 1480.0, + 662.0, + 1522.0, + 459.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 885.0, + 1118.0, + 885.0, + 1118.0, + 929.0, + 295.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 885.0, + 1407.0, + 885.0, + 1407.0, + 929.0, + 1241.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 924.0, + 683.0, + 924.0, + 683.0, + 956.0, + 296.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1841.0, + 1010.0, + 1841.0, + 1010.0, + 1889.0, + 291.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 1841.0, + 1407.0, + 1841.0, + 1407.0, + 1889.0, + 1058.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1880.0, + 552.0, + 1880.0, + 552.0, + 1917.0, + 295.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 1880.0, + 839.0, + 1880.0, + 839.0, + 1917.0, + 640.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1057.0, + 1064.0, + 1057.0, + 1064.0, + 1105.0, + 292.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1168.0, + 1057.0, + 1409.0, + 1057.0, + 1409.0, + 1105.0, + 1168.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1094.0, + 336.0, + 1094.0, + 336.0, + 1135.0, + 291.0, + 1135.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 413.0, + 1094.0, + 428.0, + 1094.0, + 428.0, + 1135.0, + 413.0, + 1135.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1141.0, + 397.0, + 1141.0, + 397.0, + 1191.0, + 292.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 495.0, + 1141.0, + 892.0, + 1141.0, + 892.0, + 1191.0, + 495.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 913.0, + 1141.0, + 994.0, + 1141.0, + 994.0, + 1191.0, + 913.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1141.0, + 1292.0, + 1141.0, + 1292.0, + 1191.0, + 1129.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1339.0, + 1141.0, + 1404.0, + 1141.0, + 1404.0, + 1191.0, + 1339.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1182.0, + 889.0, + 1182.0, + 889.0, + 1218.0, + 296.0, + 1218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1638.0, + 472.0, + 1638.0, + 472.0, + 1692.0, + 292.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 578.0, + 1638.0, + 1404.0, + 1638.0, + 1404.0, + 1692.0, + 578.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1679.0, + 350.0, + 1679.0, + 350.0, + 1716.0, + 291.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 226.0, + 439.0, + 226.0, + 439.0, + 267.0, + 293.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 226.0, + 1035.0, + 226.0, + 1035.0, + 267.0, + 559.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1057.0, + 226.0, + 1188.0, + 226.0, + 1188.0, + 267.0, + 1057.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 720.0, + 546.0, + 720.0, + 546.0, + 759.0, + 296.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 838.0, + 669.0, + 838.0, + 669.0, + 879.0, + 295.0, + 879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1388.0, + 900.0, + 1388.0, + 900.0, + 1431.0, + 295.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1976.0, + 1151.0, + 1976.0, + 1151.0, + 2051.5, + 283.0, + 2051.5 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 21, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 295, + 225, + 1403, + 225, + 1403, + 296, + 295, + 296 + ], + "score": 0.946 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 814, + 73, + 814, + 106, + 298, + 106 + ], + "score": 0.92 + }, + { + "category_id": 1, + "poly": [ + 296, + 842, + 418, + 842, + 418, + 874, + 296, + 874 + ], + "score": 0.913 + }, + { + "category_id": 1, + "poly": [ + 296, + 426, + 971, + 426, + 971, + 469, + 296, + 469 + ], + "score": 0.912 + }, + { + "category_id": 8, + "poly": [ + 315, + 483, + 1401, + 483, + 1401, + 788, + 315, + 788 + ], + "score": 0.906 + }, + { + "category_id": 9, + "poly": [ + 1351, + 793, + 1401, + 793, + 1401, + 824, + 1351, + 824 + ], + "score": 0.886 + }, + { + "category_id": 9, + "poly": [ + 1351, + 496, + 1401, + 496, + 1401, + 528, + 1351, + 528 + ], + "score": 0.86 + }, + { + "category_id": 9, + "poly": [ + 1351, + 321, + 1401, + 321, + 1401, + 352, + 1351, + 352 + ], + "score": 0.857 + }, + { + "category_id": 9, + "poly": [ + 1351, + 376, + 1401, + 376, + 1401, + 407, + 1351, + 407 + ], + "score": 0.856 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 865, + 2088, + 865, + 2112, + 835, + 2112 + ], + "score": 0.842 + }, + { + "category_id": 2, + "poly": [ + 1373, + 889, + 1404, + 889, + 1404, + 920, + 1373, + 920 + ], + "score": 0.812 + }, + { + "category_id": 8, + "poly": [ + 404, + 312, + 1292, + 312, + 1292, + 408, + 404, + 408 + ], + "score": 0.809 + }, + { + "category_id": 9, + "poly": [ + 1352, + 690, + 1401, + 690, + 1401, + 719, + 1352, + 719 + ], + "score": 0.799 + }, + { + "category_id": 1, + "poly": [ + 927, + 760, + 1090, + 760, + 1090, + 785, + 927, + 785 + ], + "score": 0.308 + }, + { + "category_id": 8, + "poly": [ + 407, + 311, + 1295, + 311, + 1295, + 367, + 407, + 367 + ], + "score": 0.265 + }, + { + "category_id": 1, + "poly": [ + 562, + 793, + 612, + 793, + 612, + 825, + 562, + 825 + ], + "score": 0.231 + }, + { + "category_id": 8, + "poly": [ + 609, + 669, + 1329, + 669, + 1329, + 749, + 609, + 749 + ], + "score": 0.22 + }, + { + "category_id": 8, + "poly": [ + 927, + 760, + 1090, + 760, + 1090, + 785, + 927, + 785 + ], + "score": 0.181 + }, + { + "category_id": 9, + "poly": [ + 1348, + 628, + 1401, + 628, + 1401, + 660, + 1348, + 660 + ], + "score": 0.176 + }, + { + "category_id": 8, + "poly": [ + 562, + 793, + 612, + 793, + 612, + 825, + 562, + 825 + ], + "score": 0.162 + }, + { + "category_id": 8, + "poly": [ + 701, + 376, + 751, + 376, + 751, + 407, + 701, + 407 + ], + "score": 0.144 + }, + { + "category_id": 13, + "poly": [ + 656, + 227, + 927, + 227, + 927, + 268, + 656, + 268 + ], + "score": 0.94, + "latex": "H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 522, + 427, + 791, + 427, + 791, + 469, + 522, + 469 + ], + "score": 0.93, + "latex": "H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } \\leq 0" + }, + { + "category_id": 13, + "poly": [ + 1174, + 227, + 1366, + 227, + 1366, + 266, + 1174, + 266 + ], + "score": 0.93, + "latex": "G _ { \\lambda } ^ { n } - G _ { \\lambda } ^ { n + 1 } \\succeq 0" + }, + { + "category_id": 14, + "poly": [ + 404, + 306, + 1293, + 306, + 1293, + 414, + 404, + 414 + ], + "score": 0.91, + "latex": "\\begin{array} { r l r } { { \\overline { { R } } ( \\widehat { \\beta } _ { n , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) - \\overline { { R } } ( \\widehat { \\beta } _ { n + 1 , \\lambda _ { n } ^ { \\mathrm { o p t } } } ) = ( \\beta ^ { * } ) ^ { T } ( G _ { \\lambda } ^ { n } - G _ { \\lambda } ^ { n + 1 } ) \\beta ^ { * } + \\sigma ^ { 2 } ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o p t } } } } } \\\\ & { } & { \\geq 0 \\quad \\quad } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1196, + 627, + 1398, + 627, + 1398, + 663, + 1196, + 663 + ], + "score": 0.89, + "latex": "H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } \\leq 0 )" + }, + { + "category_id": 14, + "poly": [ + 317, + 485, + 1359, + 485, + 1359, + 836, + 317, + 836 + ], + "score": 0.85, + "latex": "\\begin{array} { r l } { \\overline { { R } } ( \\hat { \\beta } _ { n , \\lambda _ { n } ^ { \\smash { \\mathrm { o u t } } } } ) - \\overline { { R } } ( \\hat { \\beta } _ { n + 1 , \\lambda _ { n } ^ { \\smash { \\mathrm { o u t } } } } ) = ( \\beta ^ { * } ) ^ { T } ( G _ { \\lambda } ^ { m } - G _ { \\lambda } ^ { m + 1 } ) \\beta ^ { * } + \\sigma ^ { 2 } ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\smash { \\mathrm { o u t } } } } } & { \\qquad \\mathrm { ( } } \\\\ & { \\qquad \\geq ( \\beta ^ { * } ) ^ { T } ( G _ { \\lambda } ^ { m } - G _ { \\lambda } ^ { m + 1 } ) \\beta ^ { * } - ( \\beta ^ { * } ) ^ { T } ( \\frac { d G _ { \\lambda } ^ { n } } { d \\lambda } ) \\beta ^ { * } \\frac { ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) } { d H _ { \\lambda } ^ { \\lambda } / d \\lambda } \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\smash { \\mathrm { o u t } } } } } \\\\ & { \\qquad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad } \\\\ & { = ( \\beta ^ { * } ) ^ { T } \\underbrace { \\Bigg ( ( G _ { \\lambda } ^ { m } - G _ { \\lambda } ^ { n + 1 } ) - ( H _ { \\lambda } ^ { n } - H _ { \\lambda } ^ { n + 1 } ) \\frac { d G _ { \\lambda } ^ { m } / d \\lambda } { d H _ { \\lambda } ^ { n } / d \\lambda } \\Big ) \\Big | _ { \\lambda = \\lambda _ { n } ^ { \\mathrm { o u t } } } \\beta ^ { * } } _ { \\geq 0 \\mathrm { b y c o n j e c u r e 2 } } } \\\\ & { \\qquad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\geq 0 } \\end{array}" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 815.0, + 72.0, + 815.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 2084.0, + 869.0, + 2084.0, + 869.0, + 2122.0, + 830.0, + 2122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1379.0, + 895.0, + 1402.0, + 895.0, + 1402.0, + 918.0, + 1379.0, + 918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 216.0, + 655.0, + 216.0, + 655.0, + 279.0, + 288.0, + 279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 216.0, + 1173.0, + 216.0, + 1173.0, + 279.0, + 928.0, + 279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1367.0, + 216.0, + 1410.0, + 216.0, + 1410.0, + 279.0, + 1367.0, + 279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 259.0, + 537.0, + 259.0, + 537.0, + 297.0, + 294.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 841.0, + 421.0, + 841.0, + 421.0, + 874.0, + 293.0, + 874.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 418.0, + 521.0, + 418.0, + 521.0, + 478.0, + 291.0, + 478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 792.0, + 418.0, + 977.0, + 418.0, + 977.0, + 478.0, + 792.0, + 478.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 22, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/ByRWCqvT-/ByRWCqvT-.md b/parse/train/ByRWCqvT-/ByRWCqvT-.md new file mode 100644 index 0000000000000000000000000000000000000000..3217906cfb4e299ad2a7a9215d5c3f8bf404912d --- /dev/null +++ b/parse/train/ByRWCqvT-/ByRWCqvT-.md @@ -0,0 +1,384 @@ +# LEARNING TO CLUSTER IN ORDER TO TRANSFER ACROSS DOMAINS AND TASKS + +Yen-Chang Hsu, Zhaoyang Lv +Georgia Institute of Technology +Atlanta, GA 30332, USA +{yenchang.hsu, zhaoyang.lv}@gatech.edu + +Zsolt Kira Georgia Tech Research Institute Atlanta, GA 30318, USA zkira@gatech.edu + +# ABSTRACT + +This paper introduces a novel method to perform transfer learning across domains and tasks, formulating it as a problem of learning to cluster. The key insight is that, in addition to features, we can transfer similarity information and this is sufficient to learn a similarity function and clustering network to perform both domain adaptation and cross-task transfer learning. We begin by reducing categorical information to pairwise constraints, which only considers whether two instances belong to the same class or not (pairwise semantic similarity). This similarity is category-agnostic and can be learned from data in the source domain using a similarity network. We then present two novel approaches for performing transfer learning using this similarity function. First, for unsupervised domain adaptation, we design a new loss function to regularize classification with a constrained clustering loss, hence learning a clustering network with the transferred similarity metric generating the training inputs. Second, for cross-task learning (i.e., unsupervised clustering with unseen categories), we propose a framework to reconstruct and estimate the number of semantic clusters, again using the clustering network. Since the similarity network is noisy, the key is to use a robust clustering algorithm, and we show that our formulation is more robust than the alternative constrained and unconstrained clustering approaches. Using this method, we first show state of the art results for the challenging cross-task problem, applied on Omniglot and ImageNet. Our results show that we can reconstruct semantic clusters with high accuracy. We then evaluate the performance of cross-domain transfer using images from the Office-31 and SVHN-MNIST tasks and present top accuracy on both datasets. Our approach doesn’t explicitly deal with domain discrepancy. If we combine with a domain adaptation loss, it shows further improvement. + +# 1 INTRODUCTION + +Supervised learning has made significant strides in the past decade, with substantial advancements arising from the use of deep neural networks. However, a large part of this success has come from the existence of extensive labeled datasets. In many situations, it is not practical to obtain such data due to the amount of effort required or when the task or data distributions change dynamically. To deal with these situations, the fields of transfer learning and domain adaptation have explored how to transfer learned knowledge across tasks or domains. Many approaches have focused on cases where the distributions of the features and labels have changed, but the task is the same (e.g., classification across datasets with the same categories). Cross-task transfer learning strategies, on the other hand, have been widely adopted especially in the computer vision community where features learned by a deep neural network on a large classification task have been applied to a wide variety of other tasks (Donahue et al., 2014). + +Most of the prior cross-task transfer learning works, however, require labeled target data to learn classifiers for the new task. If labels of the target data are absent, there is little choice other than to apply unsupervised approaches such as clustering on the target data with pre-trained feature representations. In this paper, we focus on the question of what can be transferred (besides features) to support both cross-domain and cross-task transfer learning. We address it with a learned similarity function as the fundamental component of clustering. Clustering can then be realized using a neural network trained using the output of the similarity function, which can be successfully used to achieve both cross-task and cross-domain transfer. + +The key idea is to formulate the clustering objective to use a learnable (and transferable) term, which in our proposed work is a similarity prediction function. Our proposed objective function can be easily combined with deep neural networks and optimized end-to-end. The features and clustering are optimized jointly, hence taking advantage of such side information in a robust way. Using this method, we show that unsupervised learning can benefit from learning performed on a distinct task, and demonstrate the flexibility of further combining it with a classification loss and domain discrepancy loss. + +In summary, we make several contributions. First, we propose to use predictive pairwise similarity as the knowledge that is transferred and formulate a learnable objective function to utilize the pairwise information in a fashion similar to constrained clustering. We then provide the methodologies to deploy the objective function in both cross-task and cross-domain scenarios with deep neural networks. The experimental results for cross-task learning on Omniglot and ImageNet show that we can achieve state of the art clustering results with predicted similarities. On the standard domain adaptation benchmark Office-31 dataset, we demonstrate improvements over state-of-art even when not performing any explicit domain adaptation, and further improvements if we do. Finally, on another domain adaptation task, SVHN-to-MNIST, our approach using Omniglot as the auxiliary dataset achieves top performance with a large margin. + +# 2 RELATED WORK + +Transfer Learning: Transfer learning aims to leverage knowledge from the source domain to help learn in the target domain, while only focusing on the performance on the target domain. The type of transferred knowledge includes training instances, features, model parameters and relational knowledge (Pan & Yang, 2010). Pairwise similarity is the meta-knowledge we propose to transfer, which falls in between the last two types. The similarity prediction function is a neural network with learned parameters, while the output is the most simplified form of relational knowledge, i.e., only considering pairwise semantic similarity. + +Cross-task Transfer Learning: Features learned when trained for ImageNet classification (Russakovsky et al., 2015) have boosted the performance of a variety of vision tasks in a supervised setting. For example, new classification tasks (Donahue et al., 2014; Yosinski et al., 2014), object detection (Girshick et al., 2014), semantic segmentation (Long et al., 2015a), and image captioning (Vinyals et al., 2015). Translated Learning (Dai et al., 2009) has an unsupervised setting similar to ours, but it again focuses only on transferring features across tasks. Our work explores how learning could benefit from transferring pairwise similarity in an unsupervised setting. + +Cross-domain Transfer Learning: Also known as domain adaptation (Pan & Yang, 2010), there has recently been a large body of work dealing with domain shift between image datasets by minimizing domain discrepancy (Tzeng et al., 2014; Long et al., 2015b; Ganin et al., 2016; Sun et al., 2016; Long et al., 2016; Sener et al., 2016; Carlucci et al., 2017; Long et al., 2017; Zellinger et al., 2017; Bousmalis et al., 2017). We address the problem in a complementary way that transfers extra information from the auxiliary dataset and show a larger performance boost with further gains using an additional domain discrepancy loss. + +Constrained Clustering: Constrained clustering algorithms can be categorized by how they utilize constraints (e.g. pairwise information). The first set of work use the constraints to learn a distance metric. For example, DML (Xing et al., 2003), ITML (Davis et al., 2007), SKMS (Anand et al., 2014), SKKm (Anand et al., 2014; Amid et al., 2016), and SKLR (Amid et al., 2016). This group of approaches closely relates to metric learning and needs a clustering algorithm such as K-means in a separate stage to obtain cluster assignments. The second group of work use constraints to formulate the clustering loss. For example, CSP (Wang et al., 2014) and COSC (Rangapuram & Hein, 2012). The third group uses constraints for both metric learning and the clustering objective, such as MPCKMeans (Bilenko et al., 2004) and CECM (Antoine et al., 2012). The fourth group does not use constraints at all. A generic clustering algorithms such as K-means (MacQueen et al., 1967), LSC (Chen & Cai, 2011), and LPNMF (Cai et al., 2009) all belong to this category. There is a long list of associated works and they are summarized in survey papers, e.g. Davidson & Basu (2007) and Dinler & Tural (2016). Our proposed clustering strategy belongs to the third group. The constrained clustering methods above are applied to the semi-supervised setting where the groundtruth constraints are sparsely available. In our unsupervised setting, the ground-truth is unavailable but predicted constraints are densely available. We include all four groups of algorithms in our comparison and show the advantages of the third group. + +![](images/e45febb1495b4ec74c335fc4134b2e9707a9552a0aad1ab6b240e7e63479843e.jpg) +Figure 1: Overview of the transfer scheme with a learnable clustering objective (LCO). The LCO and pairwise similarity are the two key components of our approach and are described in section 4. The dashed rectangles and light gray arrows are only available in cross-domain transfer. Details are described in section 3. + +# 3 THE TRANSFER LEARNING TASKS + +To define the transfer learning problem addressed in this work, we follow the notations used by Pan & Yang (2010). The goal is to transfer knowledge from source data $\boldsymbol { S } = ( X _ { S } , Y _ { S } )$ , where $X _ { S }$ is the set of data instances and $Y _ { S }$ is the corresponding categorical labels, to a target data noted as $T = \left( X _ { T } , Y _ { T } \right)$ . The learning is unsupervised since $Y _ { T }$ is unknown. The scenario is divided into two cases. One is $\{ Y _ { T } \} \ne \{ { \bar { Y } } _ { S } \}$ , which means the set of categories are not the same and hence the transfer is across tasks. The second case is $\{ Y _ { T } \} = \{ Y _ { S } \}$ , but with a domain shift. In other words, the marginal probability distributions of the input data are different, i.e., $P ( X _ { T } ) \neq P ( X _ { S } )$ . The latter is a cross-domain learning problem also called transductive learning. The domain adaptation approaches which have gained significant attention recently belong to the second scenario. + +To align with common benchmarks for evaluating transfer learning performance, we further use the notion of an auxiliary dataset and split the source data into $S = { \bar { S } } ^ { \prime } \cup A$ . $S ^ { \prime } = ( X _ { S } ^ { \prime } , Y _ { S } ^ { \prime } )$ which is only present in the cross-domain transfer scheme and has $\{ Y _ { S } ^ { \prime } \} = \{ Y _ { T } \}$ . $A = ( X _ { A } , Y _ { A } )$ is the auxiliary dataset which has a large amount of labeled data and potentially categories as well, and may or may not contain the categories of $Y _ { T }$ . For the cross task scenario, only $A$ and unlabeled $T$ are included, while cross-domain transfer involves $A$ , $S ^ { \prime }$ , and $T$ . In the following sections we use the above notations and describe the two transfer learning tasks in detail. Figure 1 illustrates how our approach relates to both tasks. + +Transfer across tasks: If the target task has different categories, we cannot directly transfer the classifier from source to target, and there is no labeled target data to use for fine-tuning transferred features. Here we propose to first reduce the categorization problem to a surrogate same-task problem. We can directly apply transductive transfer learning (Pan & Yang, 2010) to the transformed task. The cluster structure in the target data is then reconstructed using the predictions in the transformed task. See figure 2 for an illustration. + +The source involves a labeled auxiliary dataset $A$ and an unlabeled target dataset $T$ . $Y _ { T }$ is the target that must be inferred. In this scenario the set of categories $\{ Y _ { A } \} \ne \{ Y _ { T } \}$ , and $Y _ { T }$ is unknown. We first transform the problem of categorization into a pairwise similarity prediction problem. In other words, we specify a transformation function $R$ such that $R ( A ) = ( X _ { A } ^ { R ^ { \prime } } , \bar { Y } ^ { R } )$ , and $\dot { X } _ { A } ^ { R } = \{ ( x _ { A , i } , x _ { A , j } ) \} _ { \forall i , j }$ contains all pairs of data, where $\{ Y ^ { R } \} = \{ d i s s i m i l a r , s i m i l a r \}$ . The transformation on the labeled auxiliary data is straightforward. It will be similar if two data instances are from the same category, and vice versa. We then use it to learn a pairwise similarity prediction function $G ( x _ { i } , x _ { j } ) = \mathbf { \bar { \Gamma } } y _ { i , j }$ + +![](images/2b04f9cd1aa8b76244e957c10c6c523af984b0b1e4ea8542e4f1f432440b0e65.jpg) +Figure 2: The concept for reconstructing clusters of unseen categories. The proposed approach follows the arrows in the counter-clockwise direction, which converts cross-task transfer learning to cross-domain transfer learning. The colors of dots represent data of different categories. The hollow circle and cross symbol represent similar and dissimilar data pairs. The $G$ function and the cluster reconstruction (via constrained clustering) are the two key components in the diagram. + +By applying $G$ on $T$ , we can obtain $G ( x _ { T , i } , x _ { T , j } ) = y _ { T , i , j }$ . The last step is to infer $Y _ { T }$ from $Y _ { T } ^ { R } = \{ y _ { T , i , j } \} _ { \forall i , j }$ , which can be solved using constrained clustering algorithms. Note that since the actual $Y _ { T }$ is unknown, the algorithm only infers the indices of categories, which could be in arbitrary order. The resulting clusters are expected to contain coherent semantic categories. + +Transfer across domains: The problem setting we consider here is the same as unsupervised domain adaptation. Following the standard evaluation procedure (Long et al., 2017; Ganin et al., 2016), the labeled datasets $A$ is ImageNet and $S ^ { \prime }$ is one domain in the Office-31 dataset. The unlabeled $T$ is another domain in Office-31. The goal is to enhance classification performance on $T$ by utilizing $A$ , $S ^ { \prime }$ , and $T$ together. + +# 4 THE LEARNABLE CLUSTERING OBJECTIVE (LCO) + +The key to our approach is the design of a learning objective that can use (noisy) predicted pairwise similarities, and is inspired from constrained clustering which involves using pairwise information in the loss function. The pairwise information is called must-link/cannot-link constraints or similar/dissimilar pairs (we use the latter). Note that the information is binarized to one and zero for similar and dissimilar pairs, accordingly. + +Although many constrained clustering algorithms have been developed, few of them are scalable with respect to the number of pairwise relationships. Further, none of them can be easily integrated into deep neural networks. Inspired by the work of Hsu & Kira (2016), we construct a contrastive loss for clustering on the probability outputs of a softmax classifier. However, each output node does not have to map to a fixed category but instead each output node represents a probabilistic assignment of a data point to a cluster. The assignment between output nodes and clusters are formed stochastically during the optimization and is guided by the pairwise similarity. If there is a similar pair, their output distribution should be similar, and vice-versa. + +Specifically, we use the pair-wise KL-divergence to evaluate the distance between $k$ cluster assignment distributions of two data instances, and use predicted similarity to construct the contrastive loss. Given a pair of data $x _ { p } , x _ { q }$ , their corresponding output distributions are defined as $\mathcal { P } = f ( x _ { p } )$ and $\mathcal { Q } = f ( x _ { q } )$ , while $f$ is the neural network. The cost of a similar pair is described as : + +$$ +\mathcal { L } ( \boldsymbol { x } _ { p } , \boldsymbol { x } _ { q } ) ^ { + } = \mathcal { D } _ { K L } ( \mathcal { P } ^ { \star } | | \boldsymbol { \mathcal { Q } } ) + \mathcal { D } _ { K L } ( \mathcal { Q } ^ { \star } | | \mathcal { P } ) +$$ + +$$ +\mathcal { D } _ { K L } ( \mathcal { P } ^ { \star } | | \mathcal { Q } ) = \sum _ { c = 1 } ^ { k } p _ { c } l o g ( \frac { p _ { c } } { q _ { c } } ) +$$ + +![](images/b7321399ab1bca7f870eb89cd648d445662c407854095766daa46df0319beb58.jpg) +Figure 3: The similarity prediction network (the $G$ function). + +The cost $\mathcal { L } ( x _ { p } , x _ { q } ) ^ { + }$ is symmetric w.r.t. $x _ { p } , x _ { q }$ , in which ${ \mathcal { P } } ^ { \star }$ and $\mathcal { Q } ^ { \star }$ are alternatively assumed to be constant. Each KL-divergence factor $\hat { \mathcal { D } } _ { K L } ^ { \star } ( \hat { \mathcal { P } } ^ { \star } | | \mathcal { Q } )$ becomes a unary function whose gradient is simply $\partial { \cal D } _ { K L } ( { \mathcal { P } } ^ { \star } | | { \mathcal { Q } } ) / \partial { \mathcal { Q } }$ . + +If $x _ { p } , x _ { q }$ comes from a pair which is dissimilar, their output distributions are expected to be different, which can be defined as a hinge-loss function: + +$$ +\mathcal { L } ( \boldsymbol { x } _ { p } , \boldsymbol { x } _ { q } ) ^ { - } = L _ { h } ( \mathcal { D } _ { K L } ( \mathcal { P } ^ { \star } | | \boldsymbol { \mathcal { Q } } ) , \boldsymbol { \sigma } ) + L _ { h } ( \mathcal { D } _ { K L } ( \mathcal { Q } ^ { \star } | | \mathcal { P } ) , \boldsymbol { \sigma } ) +$$ + +$$ +L _ { h } ( e , \sigma ) = m a x ( 0 , \sigma - e ) +$$ + +Given a pair of data with similarity prediction function $G ( x _ { p } , x _ { q } ) \in \{ 0 , 1 \}$ , which is introduced in section 3, the total loss can be defined as a contrastive loss (where we use integer 1 to represent a similar pair): + +$$ +\mathcal { L } ( x _ { p } , x _ { q } ) = G ( x _ { p } , x _ { q } ) \mathcal { L } ( x _ { p } , x _ { q } ) ^ { + } + ( 1 - G ( x _ { p } , x _ { q } ) ) \mathcal { L } ( x _ { p } , x _ { q } ) ^ { - } +$$ + +We refer to equation 5 as LCO. Function $G$ is the learnable part that utilizes prior knowledge and is trained with auxiliary dataset $A$ before optimizing LCO. Two particular characteristics of the clustering criterion are worth mentioning: (1) There is no need to define cluster centers. (2) There is no predefined metric applied on the feature representation. Instead, the divergence is calculated directly on the cluster assignment; therefore, both feature representation and clustering are jointly optimized using back-propagation through the deep neural networks. + +# 4.1 THE PAIRWISE SIMILARITY PREDICTION NETWORK + +Although there is no restriction of how $G$ should be constructed, we choose deep convolution neural networks due to their efficiency in vision tasks. We design a network architecture inspired from Zagoruyko & Komodakis (2015). While they use it to predict image patch similarity, we use it to predict image-level semantic similarity. However, the Siamese architecture used in Zagoruyko & Komodakis (2015) is not efficient in both training and inference, especially when pairwise information is dense. Therefore, instead of using Siamese architecture, we keep the single column backbone but add a pair-enumeration layer on top of the feature extraction network. The pair-enumeration layer enumerates all pairs of feature vectors within a mini-batch and concatenates the features. Suppose the input of the layer is $1 0 \times 5 1 2$ with the mini-batch size 10 and the feature dimension 512; then the output of the pair-enumeration layer will be $1 0 0 \times 1 0 2 4$ (self-pairs included). + +The architecture is illustrated in figure 3. We add one hidden fully connected layer on top of the enumeration layer and a binary classifier at the end. We use the standard cross-entropy loss and train it end-to-end. The supervision for training was obtained by converting the ground-truth category labels into binary similarity, i.e., if two samples are from the same class then their label will be similar, otherwise dissimilar. The inference is also end-to-end, and it outputs predictions among all similarity pairs in a mini-batch. The output probability $g \in [ 0 , 1 ]$ with 1 means more similar. We binarize $g$ at 0.5 to obtain discrete similarity predictions. In the following sections, we simplified the notation of the pairwise similarity prediction network as $G$ . Once $G$ is learned, it then works as a static function in our experiments. + +# 4.2 THE OBJECTIVE FUNCTION WITH DENSE SIMILARITY PREDICTION + +Since the pairwise prediction of a mini-batch can be densely obtained from $G$ , to efficiently utilize the pair-wise information without forwarding each data multiple times we also combine the pairenumeration layer described in section 4.1 with equation 5. In this case, the outputs of softmax are + +![](images/6ee14a32f3d38107f344e558ad27ba8aa4c6dd2a6632d85ddac1a4bb2284c5fa.jpg) +Figure 4: The constrained clustering network (CCN) for transfer learning across tasks. The input is unlabeled target data $T$ . The cluster assignment block contains two fully connected layers and has the number of output nodes equal to $k$ . The $f$ described in section 4 is the backbone network plus the cluster assignment block. To optimize LCO, the full pipeline in the diagram is used. After the optimization, it uses another forward propagation with only $f$ to obtain the final cluster assignment. + +![](images/480735bbbbbc31b0524612dd6b214d318a05c8bfdb6bc3ec5a4e395d164bbae6.jpg) +Figure 5: The network for transfer learning across domains. The input is the mix of $S ^ { \prime }$ and $T$ . The architecture is a direct extension of CCN. We use $\mathrm { C C N ^ { + } }$ to represent the mandatory parts (upper branch) which implements eq. (7). $\mathrm { C C N ^ { + + } }$ includes the domain adaptation method (optional branch). + +enumerated in pairs. Let $D$ be the set of all tuples $( p , q )$ , while $p$ and $q$ are the indices of a sample in a mini-batch. The dense clustering loss $\mathcal { L } _ { d }$ for a mini-batch is calculated by: + +$$ +\mathcal { L } _ { d } = \sum _ { \forall ( p , q ) \in D } \mathcal { L } ( x _ { p } , x _ { q } ) . +$$ + +We use $\mathcal { L } _ { d }$ standalone with deep neural networks to reconstruct semantic clusters and for transfer learning across tasks (figure 4). We call the architecture the constrained clustering network (CCN). + +# 4.3 COMBINING WITH OTHER OBJECTIVES + +In the cross-domain case, we additionally have labeled source data. This enables us to use LCO for $T$ while using classification loss for $S ^ { \prime }$ . The overall training procedure is similar to previous domain adaptation approaches in that both source and target data are mixed in a mini-batch, but different losses are applied. We denote the source domain images in a mini-batch $b$ as $X _ { b ^ { S } }$ and the target domain images $X _ { b ^ { T } }$ with its set of dense pairs $D _ { b ^ { T } }$ . The loss function $\mathcal { L } _ { c d }$ for cross-domain transfer in a mini-batch can then be formulated as: + +$$ +\mathcal { L } _ { c d } = \mathcal { L } _ { c l s } + \mathcal { L } _ { c l u s t e r } +$$ + +$$ +\mathcal { L } _ { c l s } = \frac { 1 } { | b ^ { S } | } \sum _ { \forall x _ { i } \in X _ { b } s } C r o s s E n t r o p y L o s s ( f ( x _ { i } ) ) . +$$ + +$$ +\mathcal { L } _ { c l u s t e r } = \frac { 1 } { | b ^ { T } | ^ { 2 } } \sum _ { \forall ( i , j ) \in D _ { b ^ { T } } } \mathcal { L } ( x _ { i } , x _ { j } ) . +$$ + +The $\mathcal { L } _ { c l u s t e r }$ and $\mathcal { L } _ { c l s }$ share the same outputs from network $f$ . Although $\mathcal { L } _ { c l u s t e r }$ does not force the mapping between clusters and categories, $\mathcal { L } _ { c l s }$ does. Therefore the learned classifier can be applied on target data directly and picks the maximum probability for the predicted class. Note that in our loss function, there is no term to explicitly match the feature distribution between source and target; it merely transfers more knowledge in the form of constraints to regularize the learning of the classifier. There is also no requirement for the architecture to utilize hidden layers. Therefore our approach has the large flexibility to be combined with other domain adaptation strategies. Figure 5 illustrates the architectures $\mathrm { C C N ^ { + } }$ and $\mathrm { C C N ^ { + + } }$ used in our cross-domain experiments. + +# 5 EXPERIMENTS + +This section contains evaluations with four image datasets and covers both cross-task and crossdomain schemes. The details are described below, and the differences between experimental settings are illustrated in appendix A. + +# 5.1 UNSUPERVISED CROSS-TASK TRANSFER LEARNING + +# 5.1.1 SETUP + +The Omniglot dataset (Lake et al., 2015) contains 1623 different handwritten characters and each of them has 20 images drawn by different people. The characters are from 50 different alphabets and were separated to 30 background sets $O m n i g l o t _ { b g }$ and 20 evaluation sets $O m n i g l o t _ { e v a l }$ by the author. We use the $O m n i g l o t _ { b g }$ as the auxiliary dataset $( A )$ and the $O m n i g l o t _ { e v a l }$ as the target data $( T )$ . The total number of characters in $O m n g l o t _ { b g }$ is 964, which can be regarded as the number of categories available to learn the semantic similarity. The goal is to cluster Omniglot $_ { e v a l }$ to reconstruct its semantic categories, without ever having any labels. + +The $G$ function has a backbone neural network with four $3 \mathrm { x } 3$ convolution layers followed by $2 \mathbf { x } 2$ max-pooling with stride 2. All hidden layers are followed by batch normalization (Ioffe & Szegedy, 2015) and rectified linear unit. To prepare the inputs for training, the images from $O m n i g l o t _ { b g }$ were resized to $3 2 \mathrm { x } 3 2$ and normalized to zero mean with unit standard deviation. Each mini-batch has a size of 100 and is sampled from a random 20 characters to make sure the amount of similar pairs is reasonable. After pair enumeration, there are 10000 pairs subject to the loss function, which is a two-class cross entropy loss. The ground-truth similarity is obtained by converting the categorical labels. The loss of $G$ is optimized by stochastic gradient descent and is the only part trained in a supervised manner in this section. + +The Constrained Clustering Network (CCN) is used to reconstruct the semantic clusters in the target dataset using outputs from $G$ . The network has four 3x3 convolution layers followed by $2 \mathbf { x } 2$ max-pooling with stride 2, one hidden fully-connected layer, and one cluster assignment layer which is also fully connected. The number of output nodes in the last layer is equal to the number of potential clusters in the target data. The output distribution is enumerated in pairs before sending to LCO. The network is randomly initialized, trained end-to-end, and optimized by stochastic gradient descent with randomly sampled 100 images per mini-batch. Note the $G$ function used by LCO is fixed during the optimization. The input data preparation is the same as above, except now the data is from $O m n i g l o t _ { e v a l }$ . Specifically, during the training, the same mini-batch is given to both $G$ and CCN. The dense pairwise similarity predictions from $G$ are sent to LCO and are then fully utilized. The only hyper-parameter in LCO is $\sigma$ , and we set it to 2 for all our experiments. + +Omniglot $e v a l$ contains 20 alphabets and each one can be used as a standalone dataset. The 20 target datasets contain a varied number (20 to 47) of characters. Therefore we can evaluate the reconstruction performance under a varied number of ground-truth clusters. We tested the situations when the number of character $( K )$ in an alphabet is known and unknown. When $K$ is known, we set the target number of clusters in the clustering algorithm equal to the true number of characters. If $K$ is unknown, the common practice is to set it to a large number so that the data from different categories will not be forced to be in the same cluster. In the experiment, we merely set $K$ to 100, which is much larger than the largest dataset (47). + +All constrained clustering algorithms can be used to reconstruct the semantic clusters for our problem. Since there are mis-predictions in $G$ , robustness to noise is the most important factor. Here we include all four types of constrained clustering algorithms introduced in section 2 as the baselines. We provide the full set of pairwise constraints to all algorithms including ours. In other words, given an alphabet of 20 characters, it contains 400 images and 160000 predicted similarities from $G$ (note that $G$ makes predictions for both orders of a pair and for self-pairs). The full pairwise similarities were presented to all algorithms in random order, while we empirically found it has no noticeable effect on results. We pick the baseline approaches based on code availability and scalability concerning the number of pairwise constraints. Therefore we have shown results for K-means (MacQueen et al., 1967), LPNMF (Cai et al., 2009), LSC (Chen & Cai, 2011), ITML (Davis et al., 2007), SKKm (Anand et al., 2014), SKLR (Amid et al., 2016), SKMS (Anand et al., 2014), CSP (Wang et al., 2014) , and MPCK-means (Bilenko et al., 2004) as our baselines. We use the default parameters for each algorithm provided by the original author except for $K$ , the number of clusters. We use the same normalized images used in CCN for all algorithms. + +Table 1: Unsupervised cross-task transfer from Omniglot $b g$ to $O m n i g l o t _ { e v a l }$ . The performance is averaged across 20 alphabets which have 20 to 47 letters. The ACC and NMI without brackets have the number of clusters equal to ground-truth. The "(100)" means the algorithms use $K = 1 0 0$ . The characteristics of how each algorithm utilizes the pairwise constraints are marked in the "Constraints in" column, where metric stands for the metric learning of feature representation. + +
MethodConstraints inACCACC (100)NMINMI (100)
MetricClustering
K-means21.7%18.9%0.3530.464
LPNMF22.2%16.3%0.3720.498
LSC23.6%18.0%0.3760.500
ITML056.7%47.2%0.6740.727
SKMS0=45.5%10.693
SKKm062.4%46.9%0.7700.781
SKLR066.9%46.8%0.7910.760
CSP062.5%65.4%0.8120.812
MPCK-means0081.9%53.9%0.8710.816
CCN (Ours)0082.4%78.1%0.8890.874
+ +The evaluation uses two clustering metrics. The first is normalized-mutual information (NMI) (Strehl & Ghosh, 2002) which is widely used for clustering. The second one is the clustering accuracy (ACC) (Yang et al., 2010). The ACC metric first finds the one-to-one matching between predicted clusters and ground-truth labels, and then calculates the classification accuracy based on the mapping. All data outside the matched clusters will be regarded as mis-predictions. To get high ACC, the algorithm has to generate coherent clusters where each cluster includes most of the data in a category; otherwise the score drops quickly. Therefore ACC provides better discrimination to evaluate whether the semantic clusters have been reconstructed well. + +# 5.1.2 RESULTS AND DISCUSSIONS + +We report the average performance over the 20 alphabets in table 1. Our approach achieved the top performance on both metrics. The CCN demonstrates strong robustness on the challenging scenario of unknown $K$ . It achieved $7 8 . 1 \%$ average accuracy. Compared with $8 2 . 4 \%$ when $K$ is known, CCN has a relatively small drop. Compared to the second best algorithm, CSP, which is $6 5 . 4 \%$ , CCN outperforms it with a large gap. The classical approach MPCK-means works surprisingly well when the number of clusters is known, but its performance dropped dramatically from $8 1 . 9 \%$ to $5 3 . 9 \%$ when $K = 1 0 0$ . In the performance breakdown for the 20 individual alphabets, CCN achieved $94 \%$ clustering accuracy on Old Church Slavonic Cyrillic, which has 45 characters (appendix table 5). Therefore the results show the feasibility of reconstructing semantic clusters using only noisy similarity predictions. + +When to use the semantic similarity? The experiments in table 1 show a clear trend that utilizing the pairwise constraints jointly for both metric learning and minimizing the clustering loss achieves the best performance, including both MPCK-means and CCN. In the case of unknown number of clusters, where we set $K = 1 0 0$ , the algorithms that use constraints to optimize clustering loss have better robustness, for example, CSP and CCN. The group that only use constraints for metric learning (ITML, SKMS, SKKm, and SKLR) significantly outperform the group that does not use it (K-means, LPNMF, LSC). However, their performance are still far behind CCN. Our results confirm the importance of jointly optimizing the metric and clustering. + +The robustness against noisy similarity prediction is the key factor to enable the cross-task transfer framework. To the best of our knowledge, table 1 is the first comprehensive robustness comparisons using predicted constraints learned from real data instead of converting from ground-truth labels. The accuracy of $G$ in our experiment is shown in appendix table 7 and demonstrates the reasonable performance of $G$ which is on par with Matching-Net (Vinyals et al., 2016). After binarizing the prediction at 0.5 probability, the similar pair precision, similar pair recall, dissimilar pair precision, and dissimilar pair recall among the 659 characters are (0.392, 0.927, 0.999, 0.995), accordingly. The binarized predictions are better than uniform random guess (0.002, 0.500, 0.998, 0.500), but are still noisy. Therefore it is very challenging for constrained clustering. The visualization of the robustness range of CCN are provided in appendix D, and shows that the robustness is related to the density of pairs involved in a mini-batch. We hypothesize that during the optimization, the gradients from wrongly predicted pairs are canceled out by each other or by the correctly predicted pairs. Therefore the overall gradient still moves the solution towards a better clustering result. + +How to predict $K ?$ Inferring the number of clusters $( N C )$ is a hard problem, but with the pairwise similarity information, it becomes feasible. For evaluation, we compute the difference between the number of dominant clusters $( N D C )$ and the true number of categories $( N C ^ { g t } )$ in a dataset. We use a naive definition for $N D C$ , which is the number of clusters that have a size larger than expected size when data is sampled uniformly. In other words, $\begin{array} { r } { N D C = \sum _ { i = 1 } ^ { K } \left[ C _ { i } > = \bar { E } [ C _ { i } ] \right] } \end{array}$ where $[ \cdot ]$ is an Iverson Bracket and $C _ { i }$ is the size of cluster $i$ . For example, $\bar { E } [ \bar { C } _ { i } ]$ will be 10 if the alphabet has 1000 images and $K = 1 0 0$ . Then the average difference $( A D i f )$ is calculated by $\begin{array} { r } { A D i f = \frac { 1 } { | D | } \sum _ { d \in D } { | N D C _ { d } - N C _ { d } ^ { g t } | } } \end{array}$ , where $d$ (i.e., alphabet) is a dataset in $D$ . A smaller $A D i f$ indicates a better estimate of $K$ . CCN achieves a score of 6.35 (appendix table 6). We compare this with the baseline approach SKMS (Anand et al., 2014), which does not require a given $K$ and supports a pipeline to estimate $K$ automatically (therefore we only put it into the column $K = 1 0 0$ in table 1.). SKMS gets 16.3. Furthermore, 10 out of 20 datasets from CCN’s prediction have a difference between $N D C _ { d }$ and $N C _ { d } ^ { g t }$ smaller or equal to 3, which shows the feasibility of estimating $K$ with predicted similarity. + +# 5.1.3 EXPERIMENTS USING THE IMAGENET DATASET + +To demonstrate the scalability of our approach, we applied the same scheme on the ImageNet dataset. The 1000-class dataset is separated into 882-class (ImageNet882) and 118-class (ImageNet118) subsets as the random split in Vinyals et al. (2016). We use ImageN et882 for $A$ and 30 classes $\mathrm { \sim } 3 9 \mathrm { k }$ images) are randomly sampled from $I m a g e N e t _ { 1 1 8 }$ for $T$ . The difference from section 5.1.1 is that here we use Resnet-18 for both $G$ and CCN, and the weights of the backbone are pre-trained with ImageN et882. Since the number of pairs is high and it is not feasible to feed them into other constrained clustering algorithms, we compare CCN with K-means, LSC(Chen & Cai, 2011), and LPNMF (Cai et al., 2009). We use the output from the average pooling layer of Resnet-18 as the input to these clustering algorithms. CCN gives the top performance with average ACC $7 3 . 8 \%$ when $K$ is known, and $6 5 . 2 \%$ when the number of clusters is unknown, which outperforms the second $( 3 4 . 5 \%$ by K-means) with a large margin. The full comparison is in appendix table 8. And the performance of $G$ is provided in appendix table 9. + +# 5.2 UNSUPERVISED CROSS-DOMAIN TRANSFER LEARNING + +# 5.2.1 SETUP + +Office-31 (Saenko et al., 2010) has images from 31 categories of office objects. The 4652 images are obtained from three domains: Amazon $( a )$ , DSLR $( d )$ , and Webcam $( w )$ . The dataset is the standard benchmark for evaluating domain adaptation performance in computer vision. We experiment with all six combinations (source $S ^ { \prime } \to \mathrm { t a r g e t } T$ ): $a w$ , $a \to d$ , $d \to a$ , $d \to w$ , $w a$ , $w \to d$ , and report the average accuracy based on five random experiments for each setting. + +The $G$ function learns the semantic similarity function from the auxiliary dataset $A$ , which is ImageNet with all 1000 categories. The backbone network of $G$ is Resnet-18 and has the weights initialized by ImageNet classification. The training process is the same as section 5.1.1 except the images are resized to 224. + +We follow the standard protocols using deep neural networks (Long et al., 2017; Ganin et al., 2016) for unsupervised domain adaptation. The backbone network of $\mathrm { C C N ^ { + } }$ is pre-trained with ImageNet. Appendix figure 7 illustrates the scheme. During the training, all source data and target data are used. Each mini-batch is constructed by 32 labeled samples from source and 96 unlabeled samples from target. Since the target dataset has no labels and could only be randomly sampled, it is crucial to have sufficient mini-batch size to ensure that similar pairs are sampled. The loss function used in our approach is equation (7) and is optimized by stochastic gradient descent. The $\mathrm { C C N ^ { + / + + } }$ and DANN (RevGrad) with ResNet backbone are implemented with Torch. We use the code from original author for JAN. Both DANN and JAN use a 256-dimension bottleneck feature layer. + +Table 2: Unsupervised cross-domain transfer (domain adaptation) on the Office-31 dataset. The backbone network used here is Resnet-18 (He et al., 2016) pre-trained with ImageNet. + +
A→WD→WW→DA→DD→AW→AAvg
Source-Only66.892.896.867.151.453.071.3
DANN (Ganin et al., 2016)73.297.099.069.358.057.875.7
JAN (Long et al., 2017)74.594.199.675.958.759.076.9
CCN+ (ours)76.797.398.271.261.060.577.5
CCN++ (with DANN)78.297.498.673.562.860.678.5
+ +# 5.2.2 RESULTS AND DISCUSSIONS + +The results are summarized in table 2. Our approach $\mathrm { ( C C N ^ { + } ) }$ demonstrates a strong performance boost for the unsupervised cross-domain transfer problem. It reaches $7 7 . 5 \%$ average accuracy which gained 6.2 points from the $7 1 . 3 \%$ source-only baseline. Although our approach merely transfers more information from the auxiliary dataset, it outperforms the strong approach DANN $( 7 5 . 7 \% )$ , and state-of-the-art JAN $( 7 6 . 9 \% )$ . When combining ours with DANN $\mathrm { ( C C N ^ { + + } ) }$ , the performance is further boosted. This indicates that LCO helps mitigate the transfer problem in a certain way that is orthogonal to minimizing the domain discrepancy. We observe the same trend when using a deeper backbone network, i.e., ResNet-34. In such a case the average accuracy achieved is $7 7 . 9 \%$ , $8 1 . 1 \%$ and $82 \%$ for source-only, $\mathrm { C C N ^ { + } }$ and $\mathrm { C C N ^ { + + } }$ , respectively, though we used exactly the same $G$ as before (with ResNet-18 backbone for $G$ ). This indicates that the information carried in the similarity predictions is not equivalent to transferring features with deeper networks. More discussions are in appendix C and the performance of $G$ is provided in appendix table 11 to show that although the prediction has low precision for similar pairs $( \sim 0 . 2 )$ , our approach still benefits from the dense similarity predictions. + +# 5.2.3 EXPERIMENTS USING SVHN-TO-MNIST + +We also evaluated the $\mathrm { C C N ^ { + } }$ on another widely compared scenario, which uses color Street View House Numbers images (SVHN) (Netzer et al., 2011) as $S ^ { \prime }$ , the gray-scale hand-written digits (MNIST) (LeCun, 1998) as $T$ . To learn $G$ , we use the $O m n g l o t _ { b g }$ as $A$ . We train all the networks in this section from scratch. Our experimental setting is similar to Sener et al. (2016). We achieve the top performance with $8 9 . 1 \%$ accuracy. The performance gain from source-only in our approach is $+ 3 7 . 1 \%$ , which wins by a large margin compared to the $+ 2 3 . 9 \%$ of LTR (Sener et al., 2016). The full comparison is presented in appendix table 12. + +# 6 CONCLUSION AND OUTLOOK + +In this paper, we demonstrated the usefulness of transferring information in the form of pairwise similarity predictions. Such information can be transferred as a function and utilized by a loss formulation inspired from constrained clustering, but implemented more robustly within a neural network that can jointly optimize both features and clustering outputs based on these noisy predictions. The experiments for both cross-task and cross-domain transfer learning show strong benefits of using the semantic similarity predictions resulting in new state of the art results across several datasets. This is true even without explicit domain adaptation for the cross-domain task, and if we add a domain discrepancy loss the benefits increase further. + +There are two key factors that determine the performance of the proposed framework. The first is the robustness of the constrained clustering and second is the performance of the similarity prediction function. We show robustness of CCN empirically, but we do not explore situations where learning the similarity function is harder. For example, such cases arise when there are a small number of categories in source or a large domain discrepancy between source and target. One idea to deal with such a situation is learning G with domain adaptation strategies. We leave these aspects for future work. + +# ACKNOWLEDGMENTS + +This work was supported by the National Science Foundation and National Robotics Initiative (grant # IIS-1426998). + +# REFERENCES + +Ehsan Amid, Aristides Gionis, and Antti Ukkonen. Semi-supervised kernel metric learning using relative comparisons. arXiv preprint arXiv:1612.00086, 2016. + +Saket Anand, Sushil Mittal, Oncel Tuzel, and Peter Meer. Semi-supervised kernel mean shift clustering. IEEE transactions on pattern analysis and machine intelligence, 36(6):1201–1215, 2014. + +Violaine Antoine, Benjamin Quost, M-H Masson, and Thierry Denoeux. Cecm: Constrained evidential c-means algorithm. Computational Statistics & Data Analysis, 56(4):894–914, 2012. + +Mikhail Bilenko, Sugato Basu, and Raymond J Mooney. Integrating constraints and metric learning in semi-supervised clustering. In Proceedings of the twenty-first international conference on Machine learning, pp. 11. ACM, 2004. + +Konstantinos Bousmalis, Nathan Silberman, David Dohan, Dumitru Erhan, and Dilip Krishnan. Unsupervised pixel-level domain adaptation with generative adversarial networks. In The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017. + +Deng Cai, Xiaofei He, Xuanhui Wang, Hujun Bao, and Jiawei Han. Locality preserving nonnegative matrix factorization. In IJCAI, volume 9, pp. 1010–1015, 2009. + +Fabio Maria Carlucci, Lorenzo Porzi, Barbara Caputo, Elisa Ricci, and Samuel Rota Bulò. Autodial: Automatic domain alignment layers. In International Conference on Computer Vision, 2017. + +Xinlei Chen and Deng Cai. Large scale spectral clustering with landmark-based representation. In AAAI, volume 5, pp. 14, 2011. + +Wenyuan Dai, Yuqiang Chen, Gui rong Xue, Qiang Yang, and Yong Yu. Translated learning: Transfer learning across different feature spaces. In Advances in Neural Information Processing Systems 21. 2009. + +Ian Davidson and Sugato Basu. A survey of clustering with instance level. Constraints, 1:2, 2007. + +Jason V Davis, Brian Kulis, Prateek Jain, Suvrit Sra, and Inderjit S Dhillon. Information-theoretic metric learning. In Proceedings of the 24th international conference on Machine learning, pp. 209–216. ACM, 2007. + +Derya Dinler and Mustafa Kemal Tural. A survey of constrained clustering. In Unsupervised Learning Algorithms, pp. 207–235. Springer, 2016. + +Jeff Donahue, Yangqing Jia, Oriol Vinyals, Judy Hoffman, Ning Zhang, Eric Tzeng, and Trevor Darrell. Decaf: A deep convolutional activation feature for generic visual recognition. In Icml, volume 32, pp. 647–655, 2014. + +Yaroslav Ganin, Evgeniya Ustinova, Hana Ajakan, Pascal Germain, Hugo Larochelle, François Laviolette, Mario Marchand, and Victor Lempitsky. Domain-adversarial training of neural networks. Journal of Machine Learning Research, 17(59):1–35, 2016. + +Ross Girshick, Jeff Donahue, Trevor Darrell, and Jitendra Malik. Rich feature hierarchies for accurate object detection and semantic segmentation. In Computer Vision and Pattern Recognition, 2014. + +Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 770–778, 2016. + +Yen-Chang Hsu and Zsolt Kira. Neural network-based clustering using pairwise constraints. ICLR workshop, 2016. + +Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by reducing internal covariate shift. In International Conference on Machine Learning, pp. 448–456, 2015. + +Gregory Koch, Richard Zemel, and Ruslan Salakhutdinov. Siamese neural networks for one-shot image recognition. In ICML Deep Learning Workshop, 2015. + +Brenden M. Lake, Ruslan Salakhutdinov, and Joshua B. Tenenbaum. Human-level concept learning through probabilistic program induction. Science, 350(6266):1332–1338, 2015. + +Yann LeCun. The mnist database of handwritten digits. 1998. + +Jonathan Long, Evan Shelhamer, and Trevor Darrell. Fully convolutional networks for semantic segmentation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3431–3440, 2015a. + +Mingsheng Long, Yue Cao, Jianmin Wang, and Michael I. Jordan. Learning transferable features with deep adaptation networks. In Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, 6-11 July 2015, pp. 97–105, 2015b. + +Mingsheng Long, Han Zhu, Jianmin Wang, and Michael I Jordan. Unsupervised domain adaptation with residual transfer networks. In Advances in Neural Information Processing Systems, 2016. + +Mingsheng Long, Han Zhu, Jianmin Wang, and Michael I. Jordan. Deep transfer learning with joint adaptation networks. In Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, pp. 2208–2217, 2017. + +James MacQueen et al. Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, volume 1, pp. 281–297. Oakland, CA, USA., 1967. + +Yuval Netzer, Tao Wang, Adam Coates, Alessandro Bissacco, Bo Wu, and Andrew Y Ng. Reading digits in natural images with unsupervised feature learning. 2011. + +Sinno Jialin Pan and Qiang Yang. A survey on transfer learning. IEEE Trans. on Knowl. and Data Eng., 22(10):1345–1359, October 2010. ISSN 1041-4347. doi: 10.1109/TKDE.2009.191. URL http://dx.doi.org/10.1109/TKDE.2009.191. + +Syama Sundar Rangapuram and Matthias Hein. Constrained 1-spectral clustering. In AISTATS, volume 30, pp. 90, 2012. + +Olga Russakovsky, Jia Deng, Hao Su, Jonathan Krause, Sanjeev Satheesh, Sean Ma, Zhiheng Huang, Andrej Karpathy, Aditya Khosla, Michael Bernstein, et al. Imagenet large scale visual recognition challenge. International Journal of Computer Vision, 115(3):211–252, 2015. + +Kate Saenko, Brian Kulis, Mario Fritz, and Trevor Darrell. Adapting Visual Category Models to New Domains, pp. 213–226. Springer Berlin Heidelberg, Berlin, Heidelberg, 2010. + +Kuniaki Saito, Yoshitaka Ushiku, and Tatsuya Harada. Asymmetric tri-training for unsupervised domain adaptation. In Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, pp. 2988–2997, 2017. + +Ozan Sener, Hyun Oh Song, Ashutosh Saxena, and Silvio Savarese. Learning transferrable representations for unsupervised domain adaptation. In Advances in Neural Information Processing Systems, pp. 2110–2118, 2016. + +Alexander Strehl and Joydeep Ghosh. Cluster ensembles—a knowledge reuse framework for combining multiple partitions. Journal of machine learning research, 3(Dec):583–617, 2002. + +Baochen Sun, Jiashi Feng, and Kate Saenko. Return of frustratingly easy domain adaptation. In AAAI, 2016. + +Eric Tzeng, Judy Hoffman, Ning Zhang, Kate Saenko, and Trevor Darrell. Deep domain confusion: Maximizing for domain invariance. arXiv preprint arXiv:1412.3474, 2014. + +Eric Tzeng, Judy Hoffman, Trevor Darrell, and Kate Saenko. Adversarial discriminative domain adaptation. In Computer Vision and Pattern Recognition (CVPR), 2017. + +Oriol Vinyals, Alexander Toshev, Samy Bengio, and Dumitru Erhan. Show and tell: A neural image caption generator. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 3156–3164, 2015. + +Oriol Vinyals, Charles Blundell, Timothy Lillicrap, Koray Kavukcuoglu, and Daan Wierstra. Matching networks for one shot learning. 2016. + +Xiang Wang, Buyue Qian, and Ian Davidson. On constrained spectral clustering and its applications. Data Mining and Knowledge Discovery, pp. 1–30, 2014. + +Eric P Xing, Michael I Jordan, Stuart J Russell, and Andrew Y Ng. Distance metric learning with application to clustering with side-information. In Advances in neural information processing systems, pp. 521–528, 2003. + +Yi Yang, Dong Xu, Feiping Nie, Shuicheng Yan, and Yueting Zhuang. Image clustering using local discriminant models and global integration. IEEE Transactions on Image Processing, 19(10): 2761–2773, 2010. + +Jason Yosinski, Jeff Clune, Yoshua Bengio, and Hod Lipson. How transferable are features in deep neural networks? 2014. + +Sergey Zagoruyko and Nikos Komodakis. Learning to compare image patches via convolutional neural networks. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4353–4361, 2015. + +Werner Zellinger, Thomas Grubinger, Edwin Lughofer, Thomas Natschläger, and Susanne SamingerPlatz. Central moment discrepancy (cmd) for domain-invariant representation learning. ICLR, 2017. + +# APPENDICES + +# A COMPARISON OF EXPERIMENTAL SETTINGS + +Table 3: The list of datasets involved in each experiment. $G$ learns the similarity function from dataset A. The $\mathbf { C C N } ^ { * }$ is optimized with dataset T or T∪S’, while $\mathbf { C C N } ^ { * }$ means CCN for cross-task transfer and $\mathrm { C C N ^ { + / + + } }$ for cross-domain transfer. The rows for network initialization indicate whether the network has weights initialized by training a classification task with the specified dataset. The weights are randomly initialized if not specified. + +
SchemeCross-Task TransferCross-Domain Transfer
Experiment SectionOmniglot 5.1.1ImageNet 5.1.3Office-31 5.2.1SVHN-MNIST 5.2.3
DatasetsAOmniglotbgImageNet882ImageNet1000Omniglotbg
S’Office-31 {a,d,w}SVHN
TOmniglotevalImageNet118Office-31 {a,d,w)MNIST
Network InitializationGImageNet882ImageNet10001
CCN*ImageNet882ImageNet10001
+ +Table 4: The list of loss functions used for training networks. The similarity prediction function (network) $G$ uses the cross-entropy (CE) loss with two classes (similar/dissimilar). The training of constrained clustering network $( \mathbf { C C N } ^ { * } )$ involves the combinations of the learnable clustering objective (LCO), cross-entropy, and domain adaptation loss (DA). + +
LCOCEDA
G√
CCN
CCN+广√
CCN++√√
+ +![](images/6077c2618b017816b79d4cf6b62b30b24d7ebf9ecfe529286747a494f9f155c8.jpg) +Figure 6: A diagram depicting the cross-task transfer experiment. Two experiments follow this flow: Omniglot $b g$ to $O m n i g l o t _ { e v a l }$ , and $I m a g e N e t _ { 8 8 2 }$ to ImageNet118. Both have exclusive classes between source and target domain. In the ImageNet experiment, the backbone network is initialized with the weights pre-trained with ImageN et882. + +![](images/62fef6aa1814051042be0542b4068cc2863de90390604a41a4bf68f744e5059c.jpg) +Figure 7: Comparison between domain adaptation approaches (a) Transferring semantic similarity from auxiliary data (our method), and (b) Minimizing the domain discrepancy. The diagram uses office-31 benchmark as the scenario of transferring. + +# B SUPPLEMENTARY FOR UNSUPERVISED CROSS TASK TRANSFER LEARNING + +Table 5: A breakdown of the results for each alphabet in Omnigloteval. The unsupervised cross task transfer experiment is described in section 5.1. This table shows the clustering accuracy with $K = 1 0 0$ to simulate the situation of unknown number of clusters. + +
AlphabetK-meansLPNMFLSCITMLSKMSSKKmSKLRCSPMPCK-meansCCN
Angelic24%26%27%48%78%40%38%72%50%82%
Atemayar_Qelisayer19%14%17%51%61%51%44%61%50%82%
Atlantean19%15%19%57%72%55%51%77%47%72%
Aurek_Besh23%18%21%45%49%44%45%76%71%90%
Avesta22%18%19%47%29%39%38%65%52%76%
Ge_ez19%17%17%56%58%47%42%72%55%82%
Glagolitic22%19%21%42%38%58%62%66%61%85%
Gurmukhi15%13%15%44%26%54%48%60%56%80%
Kannada18%14%16%48%37%46%53%60%48%62%
Keble20%14%18%44%60%46%44%75%68%90%
Malayalam18%15%16%36%24%49%52%50%54%72%
Manipuri17%15%16%49%40%53%54%66%62%85%
Mongolian18%18%19%50%40%37%48%75%57%86%
Old_Church_Slavonic_Cyrilic19%16%19%42%41%52%67%71%67%94%
Oriya15%13%14%46%40%54%45%57%52%67%
Sylheti14%13%14%49%32%35%37%59%43%64%
Syriac_Serto20%18%19%55%70%42%35%70%47%73%
Tengwar18%18%18%51%44%49%40%61%44%66%
Tibetan18%14%16%44%31%47%54%59%55%84%
ULOG20%18%18%41%41%40%41%56%38%70%
Average19%16%18%47%46%47%47%65%54%78%
+ +Table 6: Estimates for the number of characters across the 20 datasets in Omniglot $e v a l$ . The bold number means the prediction has error smaller or equal to 3. The $A D i f$ is defined in section 5.1.2. + +
AlphabetTrue #classSKMSCCN (K=100)
Angelic201626
Atemayar_Qelisayer261734
Atlantean262141
Aurek_Besh261428
Avesta26832
Ge_ez261832
Glagolitic451845
Gurmukhi451243
Kannada411944
Keble261628
Malayalam471247
Manipuri401741
Mongolian302836
Old_Church_Slavonic_Cyrillic452345
Oriya462249
Sylheti281150
Syriac_Serto231938
Tengwar251241
Tibetan421542
ULOG261540
ADif16.36.35
+ +Table 7: The performance of the similarity prediction function used in section 5.1. We leverage the N-way test which is commonly used in one-shot learning evaluation. The similarity is learned with Omniglot $b g$ and has N-way test with $O m n i g l o t _ { e v a l }$ and MNIST. The experimental settings follow Vinyals et al. (2016). The raw probability output (without binarization) from our $G$ is used to find the nearest exemplar in the N-way test. + +
MethodOmniglot-eval 5-wayMNIST 10-way
Siamese-Nets (Koch et al., 2015)0.96720-way 0.8800.703
Match-Net (Vinyals et al., 2016)0.9810.9380.720
Ours0.9790.9350.720
+ +Table 8: Unsupervised cross-task transfer learning on ImageNet. The values are the average of three random subsets in $I m a g e N e t _ { 1 1 8 }$ . Each subset has 30 classes. The "ACC" has $K = 3 0$ while the "ACC (100)" sets $K = 1 0 0$ . All methods use the features (outputs of average pooling) from Resnet-18 pre-trained with ImageNet882 classification. + +
MethodACCACC(100)NMINMI(100)
K-means71.9%34.5%0.7130.671
LSC73.3%33.5%0.7330.655
LPNMF43.0%21.8%0.5260.500
CCN (ours)73.8%65.2%0.7500.715
+ +Table 9: Performance of the similarity prediction function ( $G$ , trained with ImageN et882) applied to three subsets of $I m a g e N e t _ { 1 1 8 }$ . Each subset contains 30 random classes of $I m a g e N e t _ { 1 1 8 }$ . The predictions are binarized at 0.5 to calculate the precision and recall. Random\*: The expected performance when classes are uniformly distributed and make uniform random guess for similarity. It is an approximation since the number of images in each class is only roughly equal in ImageNet. We sampled 12M pairs for each set to collect the statistics. Sampling more pairs has no noticeable change to the values. + +
SetSimilar Precision Similar RecallDissimilar PrecisionDissimilar Recall
Random*0.0330.5000.9670.500
Set A0.8400.6640.9830.994
SetB0.8250.6310.9810.993
Set C0.7710.6710.9830.990
Average0.8120.6550.9820.992
+ +# C SUPPLEMENTARY FOR UNSUPERVISED CROSS DOMAIN TRANSFER LEARNING + +# C.1 MORE DISCUSSION FOR THE OFFICE-31 EXPERIMENTS + +Our experiment (table 10) shows that simply using deeper pre-trained networks produces a significant performance boost. Specifically, using Resnet-50 increases the performance 8.4 points from Alexnet, which surpasses the 6.2 points gained by using one of the state-of-the-art domain adaptation algorithms (JAN (Long et al., 2017)). If we regard pre-training with deeper networks as transferring more information, our approach is similar in this aspect since both transfer more information from the auxiliary dataset. In this case, memory limitations precluded the application of LCO to such models, and multi-GPU implementations for this problem is an area of future work. + +Table 10: The performance of unsupervised transfer across domains on Office-31 dataset. The backbone networks in the comparison have different numbers of convolutional layers. AlexNet has 5 layers and the ResNets have $1 8 { \sim } 5 0$ layers. SO is the abbreviation for source-only, which simply trains on $S ^ { \prime }$ and directly applies the classifier on $T$ . The first two rows are directly copied from Long et al. (2017). The features learned with deeper networks generalize better across domains. + +
A→W D→W W→D A→D D→A W→A
AlexNet SO61.695.499.063.851.149.8Avg 70.11
AlexNet (JAN-A)75.296.699.672.857.556.376.3+6.2
Resnet-18 SO66.892.896.867.151.453.071.3+1.2
Resnet-34 SO73.196.498.873.863.262.177.9+7.8
Resnet-50 SO74.396.898.879.561.260.678.5+8.4
+ +Table 11: Performance of the similarity prediction function ( $G$ , trained with ImageNet882) applied on three domains of the Office-31 dataset. In total, 1.4M pairs are examined to calculate the table. + +
DomainSimilar PrecisionSimilar RecallDissimilar PrecisionDissimilar Recall
Amazon0.1940.6960.9880.894
DSLR0.1960.8820.9950.858
Webcam0.2130.8650.9940.876
+ +Table 12: Unsupervised transferring across domains (S’: SVHN, T: MNIST A: Omniglotbg) without pre-trained backbone network weights. Our setup is similar to Sener et al. (2016) and Ganin et al. (2016) which therefore has a similar source-only performance. + +
MethodSVHN->MNISTGain
Ganin et al. (2016)Source-Only DANN54.9 73.91 +19.0
Sener et al. (2016)Source-Only LTR54.9 78.81 +23.9
Saito et al. (2017)Source-Only ATDA70.1 86.2- +16.1
Tzeng et al. (2017)Source-Only ADDA60.1 76.0- +15.9
OursSource-Only CCN+52.0 89.11 +37.1
+ +Table 13: Performance of the similarity prediction function ( $G$ , trained with Omniglotbg) applied on the MNIST dataset. In total, 5M pairs are sampled to calculate the table. + +
Similar PrecisionSimilar RecallDissimilar PrecisionDissimilar Recall
Random0.1000.5000.9000.500
MNIST0.7820.5090.9460.984
+ +# D ROBUSTNESS ANALYSIS OF CONSTRAINED CLUSTERING NETWORK + +# D.1 SETUP + +To quickly explore the large combination of factors that may affect the clustering, we use a small dataset (MNIST) and a small network which has two convolution layers followed by two fully connected layers. The MNIST dataset is a dataset of handwritten digits that contains 60k training and 10k testing images with size $2 8 \mathbf { x } 2 8$ . Only the training set is used in this section and the raw pixels, which were normalized to zero mean and unit standard deviation, were fed into networks directly. + +The networks were randomly initialized and the clustering training was run five times under each combination of factors; we show the best final results, as is usual in the random restart regime. The mini-batch size was set to 256, thus up to 65536 pairs were presented to the LCO per mini-batch if using full density $\mathrm { ( D } { = } 1 \mathrm { ) }$ ). There were 235 mini-batches in an epoch and the optimization proceeded for 15 epochs. The clustering loss was minimized by stochastic gradient descent with learning rate 0.1 and momentum 0.9. The predicted cluster was assigned at the end by forwarding samples through the clustering networks. The best result in the five runs was reported. + +To simulate different performance of the similarity prediction, the label of pairs were flipped according to the designated recall. For example, to simulate a $90 \%$ recall of similar pair, $10 \%$ of the ground truth similar pair in a mini-batch were flipped. The precision of similar/dissimilar pairs is a function of the recall of both type of pairs, thus controlling the recall is sufficient for the evaluation. The recalls for both similar and dissimilar pairs were gradually reduced from one to zero at intervals of 0.1. + +# D.2 DISCUSSION + +The resulting performance w.r.t different values of recall, density, and number of clusters is visualized in Figure 8. A bright color means high NMI score and is desired. The larger the bright region, the more robust the clustering is against the noise of similarity prediction. The ACC score shows almost the same trend and is thus not shown here. + +How does similarity prediction affect clustering? Looking at the top-left heat map in figure 8, which has $D = 1$ and 10 clusters, it can be observed that the NMI score is very robust to low similar pair recall, even lower than 0.5. For recall of dissimilar pairs, the effect of recall is divided at the 0.5 value: the clustering performance can be very robust to noise in dissimilar pairs if the recall is greater than 0.5; however, it can completely fail if recall is below 0.5. For similar pairs, the clustering works on a wide range of recalls when the recall of dissimilar pairs is high. + +In practical terms, robustness to the recall of similar pairs is desirable because it is much easier to predict dissimilar pairs than similar pairs in real scenarios. In a dataset with 10 categories e.g. Cifar-10, we can easily get $90 \%$ recall for dissimilar pairs with purely random guess if the number of classes is known, while the recall for similar pairs will be $10 \%$ . + +How does the density of the constraints affect clustering? We argue that the density of pairwise relationships is the key factor to improving the robustness of clustering. The density $D = 1$ means that every pair in a mini-batch is utilized by the clustering loss. For density $D = 0 . 1$ , it means only 1 out of 10 possible constraints is used. We could regard the higher density as better utilization of the pairwise information in a mini-batch, thus more learning instances contribute to the gradients at once. Consider a scenario where there is one sample associated with 5 true similar pairs and 3 false similar pairs. In such a case, the gradients introduced by the false similar pairs have a higher chance to be overridden by true similar pairs within the mini-batch, thus the loss can converge faster and is less affected by errors. In Figure 8, we could see when density decreases, the size of the bright region shrinks significantly. + +![](images/12cec765ecdee0ae03b658c3f3798b3d511e16695116130fd85ecccd06d459c9.jpg) +Figure 8: The clustering performance with different pairwise density and number of clusters. A bright color means that the NMI score is close to 1 while black corresponds to 0. The density is defined as a ratio compared to the total number of pair-wise combinations in a mini-batch. The number of clusters defines the final softmax output dimensionality. In each sub-figure, we show how the scores change w.r.t. the similar pair recall and dissimiliar pair recall. + +In our implementation, enumerating the full pairwise relationships introduces negligible overhead in computation time using GPU. Although there is overhead for memory consumption, it is limited because only the vector of predicted distributions has to be enumerated for calculating the clustering loss. + +The effect of varying the number of Clusters In the MNIST experiments, the number of categories is 10. We augment the softmax output number up to 100. The rows of figure 8 show that even when the number of output categories is significant larger than the number of true object categories, e.g. $1 0 0 > 1 0$ , the clustering performance NMI score only degrades slightly. \ No newline at end of file diff --git a/parse/train/ByRWCqvT-/ByRWCqvT-_content_list.json b/parse/train/ByRWCqvT-/ByRWCqvT-_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..04257fe34b037f33792c6bb937c4f8a87eecbca4 --- /dev/null +++ b/parse/train/ByRWCqvT-/ByRWCqvT-_content_list.json @@ -0,0 +1,2038 @@ +[ + { + "type": "text", + "text": "LEARNING TO CLUSTER IN ORDER TO TRANSFER ACROSS DOMAINS AND TASKS ", + "text_level": 1, + "bbox": [ + 174, + 101, + 820, + 146 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Yen-Chang Hsu, Zhaoyang Lv \nGeorgia Institute of Technology \nAtlanta, GA 30332, USA \n{yenchang.hsu, zhaoyang.lv}@gatech.edu ", + "bbox": [ + 184, + 170, + 557, + 227 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Zsolt Kira Georgia Tech Research Institute Atlanta, GA 30318, USA zkira@gatech.edu ", + "bbox": [ + 588, + 170, + 800, + 226 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 262, + 544, + 277 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "This paper introduces a novel method to perform transfer learning across domains and tasks, formulating it as a problem of learning to cluster. The key insight is that, in addition to features, we can transfer similarity information and this is sufficient to learn a similarity function and clustering network to perform both domain adaptation and cross-task transfer learning. We begin by reducing categorical information to pairwise constraints, which only considers whether two instances belong to the same class or not (pairwise semantic similarity). This similarity is category-agnostic and can be learned from data in the source domain using a similarity network. We then present two novel approaches for performing transfer learning using this similarity function. First, for unsupervised domain adaptation, we design a new loss function to regularize classification with a constrained clustering loss, hence learning a clustering network with the transferred similarity metric generating the training inputs. Second, for cross-task learning (i.e., unsupervised clustering with unseen categories), we propose a framework to reconstruct and estimate the number of semantic clusters, again using the clustering network. Since the similarity network is noisy, the key is to use a robust clustering algorithm, and we show that our formulation is more robust than the alternative constrained and unconstrained clustering approaches. Using this method, we first show state of the art results for the challenging cross-task problem, applied on Omniglot and ImageNet. Our results show that we can reconstruct semantic clusters with high accuracy. We then evaluate the performance of cross-domain transfer using images from the Office-31 and SVHN-MNIST tasks and present top accuracy on both datasets. Our approach doesn’t explicitly deal with domain discrepancy. If we combine with a domain adaptation loss, it shows further improvement. ", + "bbox": [ + 232, + 294, + 766, + 625 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 648, + 336, + 665 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Supervised learning has made significant strides in the past decade, with substantial advancements arising from the use of deep neural networks. However, a large part of this success has come from the existence of extensive labeled datasets. In many situations, it is not practical to obtain such data due to the amount of effort required or when the task or data distributions change dynamically. To deal with these situations, the fields of transfer learning and domain adaptation have explored how to transfer learned knowledge across tasks or domains. Many approaches have focused on cases where the distributions of the features and labels have changed, but the task is the same (e.g., classification across datasets with the same categories). Cross-task transfer learning strategies, on the other hand, have been widely adopted especially in the computer vision community where features learned by a deep neural network on a large classification task have been applied to a wide variety of other tasks (Donahue et al., 2014). ", + "bbox": [ + 174, + 680, + 825, + 833 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Most of the prior cross-task transfer learning works, however, require labeled target data to learn classifiers for the new task. If labels of the target data are absent, there is little choice other than to apply unsupervised approaches such as clustering on the target data with pre-trained feature representations. In this paper, we focus on the question of what can be transferred (besides features) to support both cross-domain and cross-task transfer learning. We address it with a learned similarity function as the fundamental component of clustering. Clustering can then be realized using a neural network trained using the output of the similarity function, which can be successfully used to achieve both cross-task and cross-domain transfer. ", + "bbox": [ + 174, + 840, + 825, + 924 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 103, + 823, + 132 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The key idea is to formulate the clustering objective to use a learnable (and transferable) term, which in our proposed work is a similarity prediction function. Our proposed objective function can be easily combined with deep neural networks and optimized end-to-end. The features and clustering are optimized jointly, hence taking advantage of such side information in a robust way. Using this method, we show that unsupervised learning can benefit from learning performed on a distinct task, and demonstrate the flexibility of further combining it with a classification loss and domain discrepancy loss. ", + "bbox": [ + 174, + 138, + 823, + 236 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In summary, we make several contributions. First, we propose to use predictive pairwise similarity as the knowledge that is transferred and formulate a learnable objective function to utilize the pairwise information in a fashion similar to constrained clustering. We then provide the methodologies to deploy the objective function in both cross-task and cross-domain scenarios with deep neural networks. The experimental results for cross-task learning on Omniglot and ImageNet show that we can achieve state of the art clustering results with predicted similarities. On the standard domain adaptation benchmark Office-31 dataset, we demonstrate improvements over state-of-art even when not performing any explicit domain adaptation, and further improvements if we do. Finally, on another domain adaptation task, SVHN-to-MNIST, our approach using Omniglot as the auxiliary dataset achieves top performance with a large margin. ", + "bbox": [ + 174, + 243, + 825, + 382 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 409, + 344, + 424 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Transfer Learning: Transfer learning aims to leverage knowledge from the source domain to help learn in the target domain, while only focusing on the performance on the target domain. The type of transferred knowledge includes training instances, features, model parameters and relational knowledge (Pan & Yang, 2010). Pairwise similarity is the meta-knowledge we propose to transfer, which falls in between the last two types. The similarity prediction function is a neural network with learned parameters, while the output is the most simplified form of relational knowledge, i.e., only considering pairwise semantic similarity. ", + "bbox": [ + 174, + 443, + 825, + 541 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Cross-task Transfer Learning: Features learned when trained for ImageNet classification (Russakovsky et al., 2015) have boosted the performance of a variety of vision tasks in a supervised setting. For example, new classification tasks (Donahue et al., 2014; Yosinski et al., 2014), object detection (Girshick et al., 2014), semantic segmentation (Long et al., 2015a), and image captioning (Vinyals et al., 2015). Translated Learning (Dai et al., 2009) has an unsupervised setting similar to ours, but it again focuses only on transferring features across tasks. Our work explores how learning could benefit from transferring pairwise similarity in an unsupervised setting. ", + "bbox": [ + 174, + 547, + 825, + 646 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Cross-domain Transfer Learning: Also known as domain adaptation (Pan & Yang, 2010), there has recently been a large body of work dealing with domain shift between image datasets by minimizing domain discrepancy (Tzeng et al., 2014; Long et al., 2015b; Ganin et al., 2016; Sun et al., 2016; Long et al., 2016; Sener et al., 2016; Carlucci et al., 2017; Long et al., 2017; Zellinger et al., 2017; Bousmalis et al., 2017). We address the problem in a complementary way that transfers extra information from the auxiliary dataset and show a larger performance boost with further gains using an additional domain discrepancy loss. ", + "bbox": [ + 174, + 652, + 825, + 750 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Constrained Clustering: Constrained clustering algorithms can be categorized by how they utilize constraints (e.g. pairwise information). The first set of work use the constraints to learn a distance metric. For example, DML (Xing et al., 2003), ITML (Davis et al., 2007), SKMS (Anand et al., 2014), SKKm (Anand et al., 2014; Amid et al., 2016), and SKLR (Amid et al., 2016). This group of approaches closely relates to metric learning and needs a clustering algorithm such as K-means in a separate stage to obtain cluster assignments. The second group of work use constraints to formulate the clustering loss. For example, CSP (Wang et al., 2014) and COSC (Rangapuram & Hein, 2012). The third group uses constraints for both metric learning and the clustering objective, such as MPCKMeans (Bilenko et al., 2004) and CECM (Antoine et al., 2012). The fourth group does not use constraints at all. A generic clustering algorithms such as K-means (MacQueen et al., 1967), LSC (Chen & Cai, 2011), and LPNMF (Cai et al., 2009) all belong to this category. There is a long list of associated works and they are summarized in survey papers, e.g. Davidson & Basu (2007) and Dinler & Tural (2016). Our proposed clustering strategy belongs to the third group. The constrained clustering methods above are applied to the semi-supervised setting where the groundtruth constraints are sparsely available. In our unsupervised setting, the ground-truth is unavailable but predicted constraints are densely available. We include all four groups of algorithms in our comparison and show the advantages of the third group. ", + "bbox": [ + 174, + 757, + 825, + 924 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/e45febb1495b4ec74c335fc4134b2e9707a9552a0aad1ab6b240e7e63479843e.jpg", + "image_caption": [ + "Figure 1: Overview of the transfer scheme with a learnable clustering objective (LCO). The LCO and pairwise similarity are the two key components of our approach and are described in section 4. The dashed rectangles and light gray arrows are only available in cross-domain transfer. Details are described in section 3. " + ], + "image_footnote": [], + "bbox": [ + 238, + 107, + 732, + 258 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 356, + 825, + 426 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 THE TRANSFER LEARNING TASKS ", + "text_level": 1, + "bbox": [ + 176, + 449, + 483, + 465 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To define the transfer learning problem addressed in this work, we follow the notations used by Pan & Yang (2010). The goal is to transfer knowledge from source data $\\boldsymbol { S } = ( X _ { S } , Y _ { S } )$ , where $X _ { S }$ is the set of data instances and $Y _ { S }$ is the corresponding categorical labels, to a target data noted as $T = \\left( X _ { T } , Y _ { T } \\right)$ . The learning is unsupervised since $Y _ { T }$ is unknown. The scenario is divided into two cases. One is $\\{ Y _ { T } \\} \\ne \\{ { \\bar { Y } } _ { S } \\}$ , which means the set of categories are not the same and hence the transfer is across tasks. The second case is $\\{ Y _ { T } \\} = \\{ Y _ { S } \\}$ , but with a domain shift. In other words, the marginal probability distributions of the input data are different, i.e., $P ( X _ { T } ) \\neq P ( X _ { S } )$ . The latter is a cross-domain learning problem also called transductive learning. The domain adaptation approaches which have gained significant attention recently belong to the second scenario. ", + "bbox": [ + 174, + 483, + 825, + 609 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To align with common benchmarks for evaluating transfer learning performance, we further use the notion of an auxiliary dataset and split the source data into $S = { \\bar { S } } ^ { \\prime } \\cup A$ . $S ^ { \\prime } = ( X _ { S } ^ { \\prime } , Y _ { S } ^ { \\prime } )$ which is only present in the cross-domain transfer scheme and has $\\{ Y _ { S } ^ { \\prime } \\} = \\{ Y _ { T } \\}$ . $A = ( X _ { A } , Y _ { A } )$ is the auxiliary dataset which has a large amount of labeled data and potentially categories as well, and may or may not contain the categories of $Y _ { T }$ . For the cross task scenario, only $A$ and unlabeled $T$ are included, while cross-domain transfer involves $A$ , $S ^ { \\prime }$ , and $T$ . In the following sections we use the above notations and describe the two transfer learning tasks in detail. Figure 1 illustrates how our approach relates to both tasks. ", + "bbox": [ + 173, + 616, + 825, + 727 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Transfer across tasks: If the target task has different categories, we cannot directly transfer the classifier from source to target, and there is no labeled target data to use for fine-tuning transferred features. Here we propose to first reduce the categorization problem to a surrogate same-task problem. We can directly apply transductive transfer learning (Pan & Yang, 2010) to the transformed task. The cluster structure in the target data is then reconstructed using the predictions in the transformed task. See figure 2 for an illustration. ", + "bbox": [ + 174, + 734, + 825, + 818 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The source involves a labeled auxiliary dataset $A$ and an unlabeled target dataset $T$ . $Y _ { T }$ is the target that must be inferred. In this scenario the set of categories $\\{ Y _ { A } \\} \\ne \\{ Y _ { T } \\}$ , and $Y _ { T }$ is unknown. We first transform the problem of categorization into a pairwise similarity prediction problem. In other words, we specify a transformation function $R$ such that $R ( A ) = ( X _ { A } ^ { R ^ { \\prime } } , \\bar { Y } ^ { R } )$ , and $\\dot { X } _ { A } ^ { R } = \\{ ( x _ { A , i } , x _ { A , j } ) \\} _ { \\forall i , j }$ contains all pairs of data, where $\\{ Y ^ { R } \\} = \\{ d i s s i m i l a r , s i m i l a r \\}$ . The transformation on the labeled auxiliary data is straightforward. It will be similar if two data instances are from the same category, and vice versa. We then use it to learn a pairwise similarity prediction function $G ( x _ { i } , x _ { j } ) = \\mathbf { \\bar { \\Gamma } } y _ { i , j }$ ", + "bbox": [ + 173, + 824, + 825, + 924 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/2b04f9cd1aa8b76244e957c10c6c523af984b0b1e4ea8542e4f1f432440b0e65.jpg", + "image_caption": [ + "Figure 2: The concept for reconstructing clusters of unseen categories. The proposed approach follows the arrows in the counter-clockwise direction, which converts cross-task transfer learning to cross-domain transfer learning. The colors of dots represent data of different categories. The hollow circle and cross symbol represent similar and dissimilar data pairs. The $G$ function and the cluster reconstruction (via constrained clustering) are the two key components in the diagram. " + ], + "image_footnote": [], + "bbox": [ + 294, + 101, + 694, + 292 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "By applying $G$ on $T$ , we can obtain $G ( x _ { T , i } , x _ { T , j } ) = y _ { T , i , j }$ . The last step is to infer $Y _ { T }$ from $Y _ { T } ^ { R } = \\{ y _ { T , i , j } \\} _ { \\forall i , j }$ , which can be solved using constrained clustering algorithms. Note that since the actual $Y _ { T }$ is unknown, the algorithm only infers the indices of categories, which could be in arbitrary order. The resulting clusters are expected to contain coherent semantic categories. ", + "bbox": [ + 174, + 402, + 825, + 460 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Transfer across domains: The problem setting we consider here is the same as unsupervised domain adaptation. Following the standard evaluation procedure (Long et al., 2017; Ganin et al., 2016), the labeled datasets $A$ is ImageNet and $S ^ { \\prime }$ is one domain in the Office-31 dataset. The unlabeled $T$ is another domain in Office-31. The goal is to enhance classification performance on $T$ by utilizing $A$ , $S ^ { \\prime }$ , and $T$ together. ", + "bbox": [ + 174, + 467, + 825, + 537 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "4 THE LEARNABLE CLUSTERING OBJECTIVE (LCO) ", + "text_level": 1, + "bbox": [ + 174, + 559, + 619, + 574 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The key to our approach is the design of a learning objective that can use (noisy) predicted pairwise similarities, and is inspired from constrained clustering which involves using pairwise information in the loss function. The pairwise information is called must-link/cannot-link constraints or similar/dissimilar pairs (we use the latter). Note that the information is binarized to one and zero for similar and dissimilar pairs, accordingly. ", + "bbox": [ + 174, + 589, + 825, + 660 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Although many constrained clustering algorithms have been developed, few of them are scalable with respect to the number of pairwise relationships. Further, none of them can be easily integrated into deep neural networks. Inspired by the work of Hsu & Kira (2016), we construct a contrastive loss for clustering on the probability outputs of a softmax classifier. However, each output node does not have to map to a fixed category but instead each output node represents a probabilistic assignment of a data point to a cluster. The assignment between output nodes and clusters are formed stochastically during the optimization and is guided by the pairwise similarity. If there is a similar pair, their output distribution should be similar, and vice-versa. ", + "bbox": [ + 173, + 666, + 825, + 779 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Specifically, we use the pair-wise KL-divergence to evaluate the distance between $k$ cluster assignment distributions of two data instances, and use predicted similarity to construct the contrastive loss. Given a pair of data $x _ { p } , x _ { q }$ , their corresponding output distributions are defined as $\\mathcal { P } = f ( x _ { p } )$ and $\\mathcal { Q } = f ( x _ { q } )$ , while $f$ is the neural network. The cost of a similar pair is described as : ", + "bbox": [ + 174, + 785, + 825, + 842 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/43126e3207a3614b82cb0757e647c76f3175b51f2528f5306705302aa203b6ea.jpg", + "text": "$$\n\\mathcal { L } ( \\boldsymbol { x } _ { p } , \\boldsymbol { x } _ { q } ) ^ { + } = \\mathcal { D } _ { K L } ( \\mathcal { P } ^ { \\star } | | \\boldsymbol { \\mathcal { Q } } ) + \\mathcal { D } _ { K L } ( \\mathcal { Q } ^ { \\star } | | \\mathcal { P } )\n$$", + "text_format": "latex", + "bbox": [ + 349, + 849, + 648, + 867 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/e92760371a7f6c535154e12438d4d96a95c16ec07580a674a153986b2223c479.jpg", + "text": "$$\n\\mathcal { D } _ { K L } ( \\mathcal { P } ^ { \\star } | | \\mathcal { Q } ) = \\sum _ { c = 1 } ^ { k } p _ { c } l o g ( \\frac { p _ { c } } { q _ { c } } )\n$$", + "text_format": "latex", + "bbox": [ + 393, + 886, + 604, + 928 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/b7321399ab1bca7f870eb89cd648d445662c407854095766daa46df0319beb58.jpg", + "image_caption": [ + "Figure 3: The similarity prediction network (the $G$ function). " + ], + "image_footnote": [], + "bbox": [ + 176, + 109, + 823, + 172 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The cost $\\mathcal { L } ( x _ { p } , x _ { q } ) ^ { + }$ is symmetric w.r.t. $x _ { p } , x _ { q }$ , in which ${ \\mathcal { P } } ^ { \\star }$ and $\\mathcal { Q } ^ { \\star }$ are alternatively assumed to be constant. Each KL-divergence factor $\\hat { \\mathcal { D } } _ { K L } ^ { \\star } ( \\hat { \\mathcal { P } } ^ { \\star } | | \\mathcal { Q } )$ becomes a unary function whose gradient is simply $\\partial { \\cal D } _ { K L } ( { \\mathcal { P } } ^ { \\star } | | { \\mathcal { Q } } ) / \\partial { \\mathcal { Q } }$ . ", + "bbox": [ + 174, + 227, + 826, + 270 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "If $x _ { p } , x _ { q }$ comes from a pair which is dissimilar, their output distributions are expected to be different, which can be defined as a hinge-loss function: ", + "bbox": [ + 169, + 276, + 825, + 304 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/51ccf19abcaebb370f91fd57f44f84142543d559f1a6e585eb5f7e9a8a2b8135.jpg", + "text": "$$\n\\mathcal { L } ( \\boldsymbol { x } _ { p } , \\boldsymbol { x } _ { q } ) ^ { - } = L _ { h } ( \\mathcal { D } _ { K L } ( \\mathcal { P } ^ { \\star } | | \\boldsymbol { \\mathcal { Q } } ) , \\boldsymbol { \\sigma } ) + L _ { h } ( \\mathcal { D } _ { K L } ( \\mathcal { Q } ^ { \\star } | | \\mathcal { P } ) , \\boldsymbol { \\sigma } )\n$$", + "text_format": "latex", + "bbox": [ + 299, + 310, + 699, + 329 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/932eafed8b20b7e34e4d9da7e6abb747c2e87c7130ec49c672fa75935d5f6b54.jpg", + "text": "$$\nL _ { h } ( e , \\sigma ) = m a x ( 0 , \\sigma - e )\n$$", + "text_format": "latex", + "bbox": [ + 408, + 348, + 589, + 364 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Given a pair of data with similarity prediction function $G ( x _ { p } , x _ { q } ) \\in \\{ 0 , 1 \\}$ , which is introduced in section 3, the total loss can be defined as a contrastive loss (where we use integer 1 to represent a similar pair): ", + "bbox": [ + 174, + 368, + 825, + 410 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/557947567cc8ebcd6b5062b9e15b936183c860874dd1e623234b5a2b028ebed7.jpg", + "text": "$$\n\\mathcal { L } ( x _ { p } , x _ { q } ) = G ( x _ { p } , x _ { q } ) \\mathcal { L } ( x _ { p } , x _ { q } ) ^ { + } + ( 1 - G ( x _ { p } , x _ { q } ) ) \\mathcal { L } ( x _ { p } , x _ { q } ) ^ { - }\n$$", + "text_format": "latex", + "bbox": [ + 281, + 416, + 715, + 435 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We refer to equation 5 as LCO. Function $G$ is the learnable part that utilizes prior knowledge and is trained with auxiliary dataset $A$ before optimizing LCO. Two particular characteristics of the clustering criterion are worth mentioning: (1) There is no need to define cluster centers. (2) There is no predefined metric applied on the feature representation. Instead, the divergence is calculated directly on the cluster assignment; therefore, both feature representation and clustering are jointly optimized using back-propagation through the deep neural networks. ", + "bbox": [ + 174, + 440, + 825, + 525 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4.1 THE PAIRWISE SIMILARITY PREDICTION NETWORK ", + "text_level": 1, + "bbox": [ + 173, + 541, + 571, + 556 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Although there is no restriction of how $G$ should be constructed, we choose deep convolution neural networks due to their efficiency in vision tasks. We design a network architecture inspired from Zagoruyko & Komodakis (2015). While they use it to predict image patch similarity, we use it to predict image-level semantic similarity. However, the Siamese architecture used in Zagoruyko & Komodakis (2015) is not efficient in both training and inference, especially when pairwise information is dense. Therefore, instead of using Siamese architecture, we keep the single column backbone but add a pair-enumeration layer on top of the feature extraction network. The pair-enumeration layer enumerates all pairs of feature vectors within a mini-batch and concatenates the features. Suppose the input of the layer is $1 0 \\times 5 1 2$ with the mini-batch size 10 and the feature dimension 512; then the output of the pair-enumeration layer will be $1 0 0 \\times 1 0 2 4$ (self-pairs included). ", + "bbox": [ + 174, + 568, + 825, + 707 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The architecture is illustrated in figure 3. We add one hidden fully connected layer on top of the enumeration layer and a binary classifier at the end. We use the standard cross-entropy loss and train it end-to-end. The supervision for training was obtained by converting the ground-truth category labels into binary similarity, i.e., if two samples are from the same class then their label will be similar, otherwise dissimilar. The inference is also end-to-end, and it outputs predictions among all similarity pairs in a mini-batch. The output probability $g \\in [ 0 , 1 ]$ with 1 means more similar. We binarize $g$ at 0.5 to obtain discrete similarity predictions. In the following sections, we simplified the notation of the pairwise similarity prediction network as $G$ . Once $G$ is learned, it then works as a static function in our experiments. ", + "bbox": [ + 174, + 713, + 825, + 838 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4.2 THE OBJECTIVE FUNCTION WITH DENSE SIMILARITY PREDICTION ", + "text_level": 1, + "bbox": [ + 176, + 857, + 669, + 869 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Since the pairwise prediction of a mini-batch can be densely obtained from $G$ , to efficiently utilize the pair-wise information without forwarding each data multiple times we also combine the pairenumeration layer described in section 4.1 with equation 5. In this case, the outputs of softmax are ", + "bbox": [ + 176, + 881, + 825, + 924 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/6ee14a32f3d38107f344e558ad27ba8aa4c6dd2a6632d85ddac1a4bb2284c5fa.jpg", + "image_caption": [ + "Figure 4: The constrained clustering network (CCN) for transfer learning across tasks. The input is unlabeled target data $T$ . The cluster assignment block contains two fully connected layers and has the number of output nodes equal to $k$ . The $f$ described in section 4 is the backbone network plus the cluster assignment block. To optimize LCO, the full pipeline in the diagram is used. After the optimization, it uses another forward propagation with only $f$ to obtain the final cluster assignment. " + ], + "image_footnote": [], + "bbox": [ + 178, + 102, + 820, + 185 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/480735bbbbbc31b0524612dd6b214d318a05c8bfdb6bc3ec5a4e395d164bbae6.jpg", + "image_caption": [ + "Figure 5: The network for transfer learning across domains. The input is the mix of $S ^ { \\prime }$ and $T$ . The architecture is a direct extension of CCN. We use $\\mathrm { C C N ^ { + } }$ to represent the mandatory parts (upper branch) which implements eq. (7). $\\mathrm { C C N ^ { + + } }$ includes the domain adaptation method (optional branch). " + ], + "image_footnote": [], + "bbox": [ + 184, + 281, + 820, + 390 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "enumerated in pairs. Let $D$ be the set of all tuples $( p , q )$ , while $p$ and $q$ are the indices of a sample in a mini-batch. The dense clustering loss $\\mathcal { L } _ { d }$ for a mini-batch is calculated by: ", + "bbox": [ + 174, + 472, + 823, + 501 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/2536ed3e74d2ee43afd3d960df5668474cec18206ed2d1958279712458d3e6d4.jpg", + "text": "$$\n\\mathcal { L } _ { d } = \\sum _ { \\forall ( p , q ) \\in D } \\mathcal { L } ( x _ { p } , x _ { q } ) .\n$$", + "text_format": "latex", + "bbox": [ + 413, + 503, + 584, + 540 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We use $\\mathcal { L } _ { d }$ standalone with deep neural networks to reconstruct semantic clusters and for transfer learning across tasks (figure 4). We call the architecture the constrained clustering network (CCN). ", + "bbox": [ + 174, + 542, + 825, + 571 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.3 COMBINING WITH OTHER OBJECTIVES ", + "text_level": 1, + "bbox": [ + 176, + 587, + 486, + 602 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In the cross-domain case, we additionally have labeled source data. This enables us to use LCO for $T$ while using classification loss for $S ^ { \\prime }$ . The overall training procedure is similar to previous domain adaptation approaches in that both source and target data are mixed in a mini-batch, but different losses are applied. We denote the source domain images in a mini-batch $b$ as $X _ { b ^ { S } }$ and the target domain images $X _ { b ^ { T } }$ with its set of dense pairs $D _ { b ^ { T } }$ . The loss function $\\mathcal { L } _ { c d }$ for cross-domain transfer in a mini-batch can then be formulated as: ", + "bbox": [ + 173, + 612, + 825, + 696 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/70260d3727ed67e5a59fd974700b2ab49d04ad5b5e5cdc3ecf8874b45be70bd8.jpg", + "text": "$$\n\\mathcal { L } _ { c d } = \\mathcal { L } _ { c l s } + \\mathcal { L } _ { c l u s t e r }\n$$", + "text_format": "latex", + "bbox": [ + 423, + 700, + 575, + 717 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/c8faa5cd2cfb258d9ee286453aeb92b063fa9022dc543a5611e434e7dbd32356.jpg", + "text": "$$\n\\mathcal { L } _ { c l s } = \\frac { 1 } { | b ^ { S } | } \\sum _ { \\forall x _ { i } \\in X _ { b } s } C r o s s E n t r o p y L o s s ( f ( x _ { i } ) ) .\n$$", + "text_format": "latex", + "bbox": [ + 330, + 729, + 666, + 768 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/56ffd6cf3c83633f9f743ca9c45f42e3446398e208b61a557a090c6441db0b55.jpg", + "text": "$$\n\\mathcal { L } _ { c l u s t e r } = \\frac { 1 } { | b ^ { T } | ^ { 2 } } \\sum _ { \\forall ( i , j ) \\in D _ { b ^ { T } } } \\mathcal { L } ( x _ { i } , x _ { j } ) .\n$$", + "text_format": "latex", + "bbox": [ + 370, + 771, + 625, + 810 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The $\\mathcal { L } _ { c l u s t e r }$ and $\\mathcal { L } _ { c l s }$ share the same outputs from network $f$ . Although $\\mathcal { L } _ { c l u s t e r }$ does not force the mapping between clusters and categories, $\\mathcal { L } _ { c l s }$ does. Therefore the learned classifier can be applied on target data directly and picks the maximum probability for the predicted class. Note that in our loss function, there is no term to explicitly match the feature distribution between source and target; it merely transfers more knowledge in the form of constraints to regularize the learning of the classifier. There is also no requirement for the architecture to utilize hidden layers. Therefore our approach has the large flexibility to be combined with other domain adaptation strategies. Figure 5 illustrates the architectures $\\mathrm { C C N ^ { + } }$ and $\\mathrm { C C N ^ { + + } }$ used in our cross-domain experiments. ", + "bbox": [ + 173, + 811, + 825, + 924 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "5 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 176, + 102, + 326, + 118 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "This section contains evaluations with four image datasets and covers both cross-task and crossdomain schemes. The details are described below, and the differences between experimental settings are illustrated in appendix A. ", + "bbox": [ + 174, + 133, + 825, + 175 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5.1 UNSUPERVISED CROSS-TASK TRANSFER LEARNING ", + "text_level": 1, + "bbox": [ + 173, + 193, + 576, + 207 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5.1.1 SETUP ", + "text_level": 1, + "bbox": [ + 174, + 218, + 274, + 232 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The Omniglot dataset (Lake et al., 2015) contains 1623 different handwritten characters and each of them has 20 images drawn by different people. The characters are from 50 different alphabets and were separated to 30 background sets $O m n i g l o t _ { b g }$ and 20 evaluation sets $O m n i g l o t _ { e v a l }$ by the author. We use the $O m n i g l o t _ { b g }$ as the auxiliary dataset $( A )$ and the $O m n i g l o t _ { e v a l }$ as the target data $( T )$ . The total number of characters in $O m n g l o t _ { b g }$ is 964, which can be regarded as the number of categories available to learn the semantic similarity. The goal is to cluster Omniglot $_ { e v a l }$ to reconstruct its semantic categories, without ever having any labels. ", + "bbox": [ + 174, + 242, + 825, + 340 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The $G$ function has a backbone neural network with four $3 \\mathrm { x } 3$ convolution layers followed by $2 \\mathbf { x } 2$ max-pooling with stride 2. All hidden layers are followed by batch normalization (Ioffe & Szegedy, 2015) and rectified linear unit. To prepare the inputs for training, the images from $O m n i g l o t _ { b g }$ were resized to $3 2 \\mathrm { x } 3 2$ and normalized to zero mean with unit standard deviation. Each mini-batch has a size of 100 and is sampled from a random 20 characters to make sure the amount of similar pairs is reasonable. After pair enumeration, there are 10000 pairs subject to the loss function, which is a two-class cross entropy loss. The ground-truth similarity is obtained by converting the categorical labels. The loss of $G$ is optimized by stochastic gradient descent and is the only part trained in a supervised manner in this section. ", + "bbox": [ + 174, + 347, + 825, + 472 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The Constrained Clustering Network (CCN) is used to reconstruct the semantic clusters in the target dataset using outputs from $G$ . The network has four 3x3 convolution layers followed by $2 \\mathbf { x } 2$ max-pooling with stride 2, one hidden fully-connected layer, and one cluster assignment layer which is also fully connected. The number of output nodes in the last layer is equal to the number of potential clusters in the target data. The output distribution is enumerated in pairs before sending to LCO. The network is randomly initialized, trained end-to-end, and optimized by stochastic gradient descent with randomly sampled 100 images per mini-batch. Note the $G$ function used by LCO is fixed during the optimization. The input data preparation is the same as above, except now the data is from $O m n i g l o t _ { e v a l }$ . Specifically, during the training, the same mini-batch is given to both $G$ and CCN. The dense pairwise similarity predictions from $G$ are sent to LCO and are then fully utilized. The only hyper-parameter in LCO is $\\sigma$ , and we set it to 2 for all our experiments. ", + "bbox": [ + 174, + 479, + 825, + 632 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Omniglot $e v a l$ contains 20 alphabets and each one can be used as a standalone dataset. The 20 target datasets contain a varied number (20 to 47) of characters. Therefore we can evaluate the reconstruction performance under a varied number of ground-truth clusters. We tested the situations when the number of character $( K )$ in an alphabet is known and unknown. When $K$ is known, we set the target number of clusters in the clustering algorithm equal to the true number of characters. If $K$ is unknown, the common practice is to set it to a large number so that the data from different categories will not be forced to be in the same cluster. In the experiment, we merely set $K$ to 100, which is much larger than the largest dataset (47). ", + "bbox": [ + 174, + 638, + 825, + 750 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "All constrained clustering algorithms can be used to reconstruct the semantic clusters for our problem. Since there are mis-predictions in $G$ , robustness to noise is the most important factor. Here we include all four types of constrained clustering algorithms introduced in section 2 as the baselines. We provide the full set of pairwise constraints to all algorithms including ours. In other words, given an alphabet of 20 characters, it contains 400 images and 160000 predicted similarities from $G$ (note that $G$ makes predictions for both orders of a pair and for self-pairs). The full pairwise similarities were presented to all algorithms in random order, while we empirically found it has no noticeable effect on results. We pick the baseline approaches based on code availability and scalability concerning the number of pairwise constraints. Therefore we have shown results for K-means (MacQueen et al., 1967), LPNMF (Cai et al., 2009), LSC (Chen & Cai, 2011), ITML (Davis et al., 2007), SKKm (Anand et al., 2014), SKLR (Amid et al., 2016), SKMS (Anand et al., 2014), CSP (Wang et al., 2014) , and MPCK-means (Bilenko et al., 2004) as our baselines. We use the default parameters for each algorithm provided by the original author except for $K$ , the number of clusters. We use the same normalized images used in CCN for all algorithms. ", + "bbox": [ + 174, + 757, + 825, + 924 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/2ae0c7337bcbc45fa8408cbf5514b9f871c789e8f5603902752e52690914bc95.jpg", + "table_caption": [ + "Table 1: Unsupervised cross-task transfer from Omniglot $b g$ to $O m n i g l o t _ { e v a l }$ . The performance is averaged across 20 alphabets which have 20 to 47 letters. The ACC and NMI without brackets have the number of clusters equal to ground-truth. The \"(100)\" means the algorithms use $K = 1 0 0$ . The characteristics of how each algorithm utilizes the pairwise constraints are marked in the \"Constraints in\" column, where metric stands for the metric learning of feature representation. " + ], + "table_footnote": [], + "table_body": "
MethodConstraints inACCACC (100)NMINMI (100)
MetricClustering
K-means21.7%18.9%0.3530.464
LPNMF22.2%16.3%0.3720.498
LSC23.6%18.0%0.3760.500
ITML056.7%47.2%0.6740.727
SKMS0=45.5%10.693
SKKm062.4%46.9%0.7700.781
SKLR066.9%46.8%0.7910.760
CSP062.5%65.4%0.8120.812
MPCK-means0081.9%53.9%0.8710.816
CCN (Ours)0082.4%78.1%0.8890.874
", + "bbox": [ + 214, + 183, + 784, + 371 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 176, + 398, + 823, + 426 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The evaluation uses two clustering metrics. The first is normalized-mutual information (NMI) (Strehl & Ghosh, 2002) which is widely used for clustering. The second one is the clustering accuracy (ACC) (Yang et al., 2010). The ACC metric first finds the one-to-one matching between predicted clusters and ground-truth labels, and then calculates the classification accuracy based on the mapping. All data outside the matched clusters will be regarded as mis-predictions. To get high ACC, the algorithm has to generate coherent clusters where each cluster includes most of the data in a category; otherwise the score drops quickly. Therefore ACC provides better discrimination to evaluate whether the semantic clusters have been reconstructed well. ", + "bbox": [ + 174, + 434, + 825, + 545 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "5.1.2 RESULTS AND DISCUSSIONS ", + "text_level": 1, + "bbox": [ + 176, + 564, + 424, + 579 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We report the average performance over the 20 alphabets in table 1. Our approach achieved the top performance on both metrics. The CCN demonstrates strong robustness on the challenging scenario of unknown $K$ . It achieved $7 8 . 1 \\%$ average accuracy. Compared with $8 2 . 4 \\%$ when $K$ is known, CCN has a relatively small drop. Compared to the second best algorithm, CSP, which is $6 5 . 4 \\%$ , CCN outperforms it with a large gap. The classical approach MPCK-means works surprisingly well when the number of clusters is known, but its performance dropped dramatically from $8 1 . 9 \\%$ to $5 3 . 9 \\%$ when $K = 1 0 0$ . In the performance breakdown for the 20 individual alphabets, CCN achieved $94 \\%$ clustering accuracy on Old Church Slavonic Cyrillic, which has 45 characters (appendix table 5). Therefore the results show the feasibility of reconstructing semantic clusters using only noisy similarity predictions. ", + "bbox": [ + 173, + 589, + 825, + 728 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "When to use the semantic similarity? The experiments in table 1 show a clear trend that utilizing the pairwise constraints jointly for both metric learning and minimizing the clustering loss achieves the best performance, including both MPCK-means and CCN. In the case of unknown number of clusters, where we set $K = 1 0 0$ , the algorithms that use constraints to optimize clustering loss have better robustness, for example, CSP and CCN. The group that only use constraints for metric learning (ITML, SKMS, SKKm, and SKLR) significantly outperform the group that does not use it (K-means, LPNMF, LSC). However, their performance are still far behind CCN. Our results confirm the importance of jointly optimizing the metric and clustering. ", + "bbox": [ + 173, + 734, + 825, + 848 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The robustness against noisy similarity prediction is the key factor to enable the cross-task transfer framework. To the best of our knowledge, table 1 is the first comprehensive robustness comparisons using predicted constraints learned from real data instead of converting from ground-truth labels. The accuracy of $G$ in our experiment is shown in appendix table 7 and demonstrates the reasonable performance of $G$ which is on par with Matching-Net (Vinyals et al., 2016). After binarizing the prediction at 0.5 probability, the similar pair precision, similar pair recall, dissimilar pair precision, and dissimilar pair recall among the 659 characters are (0.392, 0.927, 0.999, 0.995), accordingly. The binarized predictions are better than uniform random guess (0.002, 0.500, 0.998, 0.500), but are still noisy. Therefore it is very challenging for constrained clustering. The visualization of the robustness range of CCN are provided in appendix D, and shows that the robustness is related to the density of pairs involved in a mini-batch. We hypothesize that during the optimization, the gradients from wrongly predicted pairs are canceled out by each other or by the correctly predicted pairs. Therefore the overall gradient still moves the solution towards a better clustering result. ", + "bbox": [ + 174, + 854, + 825, + 924 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 214 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "How to predict $K ?$ Inferring the number of clusters $( N C )$ is a hard problem, but with the pairwise similarity information, it becomes feasible. For evaluation, we compute the difference between the number of dominant clusters $( N D C )$ and the true number of categories $( N C ^ { g t } )$ in a dataset. We use a naive definition for $N D C$ , which is the number of clusters that have a size larger than expected size when data is sampled uniformly. In other words, $\\begin{array} { r } { N D C = \\sum _ { i = 1 } ^ { K } \\left[ C _ { i } > = \\bar { E } [ C _ { i } ] \\right] } \\end{array}$ where $[ \\cdot ]$ is an Iverson Bracket and $C _ { i }$ is the size of cluster $i$ . For example, $\\bar { E } [ \\bar { C } _ { i } ]$ will be 10 if the alphabet has 1000 images and $K = 1 0 0$ . Then the average difference $( A D i f )$ is calculated by $\\begin{array} { r } { A D i f = \\frac { 1 } { | D | } \\sum _ { d \\in D } { | N D C _ { d } - N C _ { d } ^ { g t } | } } \\end{array}$ , where $d$ (i.e., alphabet) is a dataset in $D$ . A smaller $A D i f$ indicates a better estimate of $K$ . CCN achieves a score of 6.35 (appendix table 6). We compare this with the baseline approach SKMS (Anand et al., 2014), which does not require a given $K$ and supports a pipeline to estimate $K$ automatically (therefore we only put it into the column $K = 1 0 0$ in table 1.). SKMS gets 16.3. Furthermore, 10 out of 20 datasets from CCN’s prediction have a difference between $N D C _ { d }$ and $N C _ { d } ^ { g t }$ smaller or equal to 3, which shows the feasibility of estimating $K$ with predicted similarity. ", + "bbox": [ + 174, + 222, + 825, + 424 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5.1.3 EXPERIMENTS USING THE IMAGENET DATASET ", + "text_level": 1, + "bbox": [ + 174, + 440, + 555, + 454 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "To demonstrate the scalability of our approach, we applied the same scheme on the ImageNet dataset. The 1000-class dataset is separated into 882-class (ImageNet882) and 118-class (ImageNet118) subsets as the random split in Vinyals et al. (2016). We use ImageN et882 for $A$ and 30 classes $\\mathrm { \\sim } 3 9 \\mathrm { k }$ images) are randomly sampled from $I m a g e N e t _ { 1 1 8 }$ for $T$ . The difference from section 5.1.1 is that here we use Resnet-18 for both $G$ and CCN, and the weights of the backbone are pre-trained with ImageN et882. Since the number of pairs is high and it is not feasible to feed them into other constrained clustering algorithms, we compare CCN with K-means, LSC(Chen & Cai, 2011), and LPNMF (Cai et al., 2009). We use the output from the average pooling layer of Resnet-18 as the input to these clustering algorithms. CCN gives the top performance with average ACC $7 3 . 8 \\%$ when $K$ is known, and $6 5 . 2 \\%$ when the number of clusters is unknown, which outperforms the second $( 3 4 . 5 \\%$ by K-means) with a large margin. The full comparison is in appendix table 8. And the performance of $G$ is provided in appendix table 9. ", + "bbox": [ + 173, + 464, + 825, + 631 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5.2 UNSUPERVISED CROSS-DOMAIN TRANSFER LEARNING ", + "text_level": 1, + "bbox": [ + 174, + 650, + 599, + 664 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5.2.1 SETUP ", + "text_level": 1, + "bbox": [ + 174, + 675, + 274, + 690 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Office-31 (Saenko et al., 2010) has images from 31 categories of office objects. The 4652 images are obtained from three domains: Amazon $( a )$ , DSLR $( d )$ , and Webcam $( w )$ . The dataset is the standard benchmark for evaluating domain adaptation performance in computer vision. We experiment with all six combinations (source $S ^ { \\prime } \\to \\mathrm { t a r g e t } T$ ): $a w$ , $a \\to d$ , $d \\to a$ , $d \\to w$ , $w a$ , $w \\to d$ , and report the average accuracy based on five random experiments for each setting. ", + "bbox": [ + 174, + 700, + 825, + 770 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The $G$ function learns the semantic similarity function from the auxiliary dataset $A$ , which is ImageNet with all 1000 categories. The backbone network of $G$ is Resnet-18 and has the weights initialized by ImageNet classification. The training process is the same as section 5.1.1 except the images are resized to 224. ", + "bbox": [ + 174, + 776, + 823, + 833 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We follow the standard protocols using deep neural networks (Long et al., 2017; Ganin et al., 2016) for unsupervised domain adaptation. The backbone network of $\\mathrm { C C N ^ { + } }$ is pre-trained with ImageNet. Appendix figure 7 illustrates the scheme. During the training, all source data and target data are used. Each mini-batch is constructed by 32 labeled samples from source and 96 unlabeled samples from target. Since the target dataset has no labels and could only be randomly sampled, it is crucial to have sufficient mini-batch size to ensure that similar pairs are sampled. The loss function used in our approach is equation (7) and is optimized by stochastic gradient descent. The $\\mathrm { C C N ^ { + / + + } }$ and DANN (RevGrad) with ResNet backbone are implemented with Torch. We use the code from original author for JAN. Both DANN and JAN use a 256-dimension bottleneck feature layer. ", + "bbox": [ + 174, + 840, + 825, + 922 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/f5936f0f0feec0a34a07606096c3ce59fc69a3f0e85a74616b90a6b7ecc8c3b3.jpg", + "table_caption": [ + "Table 2: Unsupervised cross-domain transfer (domain adaptation) on the Office-31 dataset. The backbone network used here is Resnet-18 (He et al., 2016) pre-trained with ImageNet. " + ], + "table_footnote": [], + "table_body": "
A→WD→WW→DA→DD→AW→AAvg
Source-Only66.892.896.867.151.453.071.3
DANN (Ganin et al., 2016)73.297.099.069.358.057.875.7
JAN (Long et al., 2017)74.594.199.675.958.759.076.9
CCN+ (ours)76.797.398.271.261.060.577.5
CCN++ (with DANN)78.297.498.673.562.860.678.5
", + "bbox": [ + 173, + 150, + 825, + 257 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 282, + 825, + 324 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5.2.2 RESULTS AND DISCUSSIONS ", + "text_level": 1, + "bbox": [ + 176, + 340, + 426, + 354 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "The results are summarized in table 2. Our approach $\\mathrm { ( C C N ^ { + } ) }$ demonstrates a strong performance boost for the unsupervised cross-domain transfer problem. It reaches $7 7 . 5 \\%$ average accuracy which gained 6.2 points from the $7 1 . 3 \\%$ source-only baseline. Although our approach merely transfers more information from the auxiliary dataset, it outperforms the strong approach DANN $( 7 5 . 7 \\% )$ , and state-of-the-art JAN $( 7 6 . 9 \\% )$ . When combining ours with DANN $\\mathrm { ( C C N ^ { + + } ) }$ , the performance is further boosted. This indicates that LCO helps mitigate the transfer problem in a certain way that is orthogonal to minimizing the domain discrepancy. We observe the same trend when using a deeper backbone network, i.e., ResNet-34. In such a case the average accuracy achieved is $7 7 . 9 \\%$ , $8 1 . 1 \\%$ and $82 \\%$ for source-only, $\\mathrm { C C N ^ { + } }$ and $\\mathrm { C C N ^ { + + } }$ , respectively, though we used exactly the same $G$ as before (with ResNet-18 backbone for $G$ ). This indicates that the information carried in the similarity predictions is not equivalent to transferring features with deeper networks. More discussions are in appendix C and the performance of $G$ is provided in appendix table 11 to show that although the prediction has low precision for similar pairs $( \\sim 0 . 2 )$ , our approach still benefits from the dense similarity predictions. ", + "bbox": [ + 174, + 364, + 825, + 559 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5.2.3 EXPERIMENTS USING SVHN-TO-MNIST ", + "text_level": 1, + "bbox": [ + 174, + 574, + 514, + 589 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We also evaluated the $\\mathrm { C C N ^ { + } }$ on another widely compared scenario, which uses color Street View House Numbers images (SVHN) (Netzer et al., 2011) as $S ^ { \\prime }$ , the gray-scale hand-written digits (MNIST) (LeCun, 1998) as $T$ . To learn $G$ , we use the $O m n g l o t _ { b g }$ as $A$ . We train all the networks in this section from scratch. Our experimental setting is similar to Sener et al. (2016). We achieve the top performance with $8 9 . 1 \\%$ accuracy. The performance gain from source-only in our approach is $+ 3 7 . 1 \\%$ , which wins by a large margin compared to the $+ 2 3 . 9 \\%$ of LTR (Sener et al., 2016). The full comparison is presented in appendix table 12. ", + "bbox": [ + 173, + 599, + 825, + 696 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "6 CONCLUSION AND OUTLOOK ", + "text_level": 1, + "bbox": [ + 176, + 718, + 449, + 733 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "In this paper, we demonstrated the usefulness of transferring information in the form of pairwise similarity predictions. Such information can be transferred as a function and utilized by a loss formulation inspired from constrained clustering, but implemented more robustly within a neural network that can jointly optimize both features and clustering outputs based on these noisy predictions. The experiments for both cross-task and cross-domain transfer learning show strong benefits of using the semantic similarity predictions resulting in new state of the art results across several datasets. This is true even without explicit domain adaptation for the cross-domain task, and if we add a domain discrepancy loss the benefits increase further. ", + "bbox": [ + 174, + 750, + 825, + 861 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "There are two key factors that determine the performance of the proposed framework. The first is the robustness of the constrained clustering and second is the performance of the similarity prediction function. We show robustness of CCN empirically, but we do not explore situations where learning the similarity function is harder. For example, such cases arise when there are a small number of categories in source or a large domain discrepancy between source and target. One idea to deal with such a situation is learning G with domain adaptation strategies. We leave these aspects for future work. ", + "bbox": [ + 174, + 867, + 823, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 823, + 146 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "ACKNOWLEDGMENTS ", + "text_level": 1, + "bbox": [ + 176, + 162, + 326, + 176 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "This work was supported by the National Science Foundation and National Robotics Initiative (grant # IIS-1426998). ", + "bbox": [ + 174, + 186, + 823, + 214 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 174, + 237, + 287, + 252 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Ehsan Amid, Aristides Gionis, and Antti Ukkonen. Semi-supervised kernel metric learning using relative comparisons. arXiv preprint arXiv:1612.00086, 2016. ", + "bbox": [ + 173, + 261, + 823, + 290 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Saket Anand, Sushil Mittal, Oncel Tuzel, and Peter Meer. Semi-supervised kernel mean shift clustering. IEEE transactions on pattern analysis and machine intelligence, 36(6):1201–1215, 2014. ", + "bbox": [ + 173, + 299, + 826, + 342 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Violaine Antoine, Benjamin Quost, M-H Masson, and Thierry Denoeux. Cecm: Constrained evidential c-means algorithm. Computational Statistics & Data Analysis, 56(4):894–914, 2012. ", + "bbox": [ + 171, + 353, + 823, + 382 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Mikhail Bilenko, Sugato Basu, and Raymond J Mooney. Integrating constraints and metric learning in semi-supervised clustering. In Proceedings of the twenty-first international conference on Machine learning, pp. 11. ACM, 2004. ", + "bbox": [ + 176, + 392, + 823, + 435 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Konstantinos Bousmalis, Nathan Silberman, David Dohan, Dumitru Erhan, and Dilip Krishnan. Unsupervised pixel-level domain adaptation with generative adversarial networks. In The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017. ", + "bbox": [ + 173, + 444, + 826, + 488 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Deng Cai, Xiaofei He, Xuanhui Wang, Hujun Bao, and Jiawei Han. Locality preserving nonnegative matrix factorization. In IJCAI, volume 9, pp. 1010–1015, 2009. ", + "bbox": [ + 173, + 498, + 823, + 529 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Fabio Maria Carlucci, Lorenzo Porzi, Barbara Caputo, Elisa Ricci, and Samuel Rota Bulò. Autodial: Automatic domain alignment layers. In International Conference on Computer Vision, 2017. ", + "bbox": [ + 173, + 537, + 826, + 568 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Xinlei Chen and Deng Cai. Large scale spectral clustering with landmark-based representation. In AAAI, volume 5, pp. 14, 2011. ", + "bbox": [ + 171, + 577, + 823, + 607 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Wenyuan Dai, Yuqiang Chen, Gui rong Xue, Qiang Yang, and Yong Yu. Translated learning: Transfer learning across different feature spaces. In Advances in Neural Information Processing Systems 21. 2009. ", + "bbox": [ + 176, + 617, + 825, + 660 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Ian Davidson and Sugato Basu. A survey of clustering with instance level. Constraints, 1:2, 2007. ", + "bbox": [ + 171, + 670, + 815, + 686 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Jason V Davis, Brian Kulis, Prateek Jain, Suvrit Sra, and Inderjit S Dhillon. Information-theoretic metric learning. In Proceedings of the 24th international conference on Machine learning, pp. 209–216. ACM, 2007. ", + "bbox": [ + 173, + 695, + 826, + 738 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Derya Dinler and Mustafa Kemal Tural. A survey of constrained clustering. In Unsupervised Learning Algorithms, pp. 207–235. Springer, 2016. ", + "bbox": [ + 173, + 748, + 823, + 779 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Jeff Donahue, Yangqing Jia, Oriol Vinyals, Judy Hoffman, Ning Zhang, Eric Tzeng, and Trevor Darrell. Decaf: A deep convolutional activation feature for generic visual recognition. In Icml, volume 32, pp. 647–655, 2014. ", + "bbox": [ + 174, + 787, + 825, + 832 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Yaroslav Ganin, Evgeniya Ustinova, Hana Ajakan, Pascal Germain, Hugo Larochelle, François Laviolette, Mario Marchand, and Victor Lempitsky. Domain-adversarial training of neural networks. Journal of Machine Learning Research, 17(59):1–35, 2016. ", + "bbox": [ + 176, + 842, + 823, + 885 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Ross Girshick, Jeff Donahue, Trevor Darrell, and Jitendra Malik. Rich feature hierarchies for accurate object detection and semantic segmentation. In Computer Vision and Pattern Recognition, 2014. ", + "bbox": [ + 173, + 895, + 823, + 924 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 770–778, 2016. ", + "bbox": [ + 174, + 103, + 825, + 146 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Yen-Chang Hsu and Zsolt Kira. Neural network-based clustering using pairwise constraints. ICLR workshop, 2016. ", + "bbox": [ + 173, + 154, + 825, + 183 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by reducing internal covariate shift. In International Conference on Machine Learning, pp. 448–456, 2015. ", + "bbox": [ + 178, + 190, + 825, + 233 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Gregory Koch, Richard Zemel, and Ruslan Salakhutdinov. Siamese neural networks for one-shot image recognition. In ICML Deep Learning Workshop, 2015. ", + "bbox": [ + 173, + 242, + 825, + 271 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Brenden M. Lake, Ruslan Salakhutdinov, and Joshua B. Tenenbaum. Human-level concept learning through probabilistic program induction. Science, 350(6266):1332–1338, 2015. ", + "bbox": [ + 176, + 279, + 823, + 309 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Yann LeCun. The mnist database of handwritten digits. 1998. ", + "bbox": [ + 174, + 316, + 581, + 332 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Jonathan Long, Evan Shelhamer, and Trevor Darrell. Fully convolutional networks for semantic segmentation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3431–3440, 2015a. ", + "bbox": [ + 176, + 339, + 825, + 382 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Mingsheng Long, Yue Cao, Jianmin Wang, and Michael I. Jordan. Learning transferable features with deep adaptation networks. In Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, 6-11 July 2015, pp. 97–105, 2015b. ", + "bbox": [ + 176, + 390, + 823, + 434 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Mingsheng Long, Han Zhu, Jianmin Wang, and Michael I Jordan. Unsupervised domain adaptation with residual transfer networks. In Advances in Neural Information Processing Systems, 2016. ", + "bbox": [ + 173, + 440, + 823, + 470 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Mingsheng Long, Han Zhu, Jianmin Wang, and Michael I. Jordan. Deep transfer learning with joint adaptation networks. In Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, pp. 2208–2217, 2017. ", + "bbox": [ + 176, + 478, + 823, + 522 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "James MacQueen et al. Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, volume 1, pp. 281–297. Oakland, CA, USA., 1967. ", + "bbox": [ + 176, + 529, + 825, + 571 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Yuval Netzer, Tao Wang, Adam Coates, Alessandro Bissacco, Bo Wu, and Andrew Y Ng. Reading digits in natural images with unsupervised feature learning. 2011. ", + "bbox": [ + 171, + 579, + 825, + 609 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Sinno Jialin Pan and Qiang Yang. A survey on transfer learning. IEEE Trans. on Knowl. and Data Eng., 22(10):1345–1359, October 2010. ISSN 1041-4347. doi: 10.1109/TKDE.2009.191. URL http://dx.doi.org/10.1109/TKDE.2009.191. ", + "bbox": [ + 176, + 617, + 825, + 660 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Syama Sundar Rangapuram and Matthias Hein. Constrained 1-spectral clustering. In AISTATS, volume 30, pp. 90, 2012. ", + "bbox": [ + 169, + 667, + 825, + 696 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Olga Russakovsky, Jia Deng, Hao Su, Jonathan Krause, Sanjeev Satheesh, Sean Ma, Zhiheng Huang, Andrej Karpathy, Aditya Khosla, Michael Bernstein, et al. Imagenet large scale visual recognition challenge. International Journal of Computer Vision, 115(3):211–252, 2015. ", + "bbox": [ + 174, + 704, + 823, + 748 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Kate Saenko, Brian Kulis, Mario Fritz, and Trevor Darrell. Adapting Visual Category Models to New Domains, pp. 213–226. Springer Berlin Heidelberg, Berlin, Heidelberg, 2010. ", + "bbox": [ + 176, + 756, + 821, + 786 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Kuniaki Saito, Yoshitaka Ushiku, and Tatsuya Harada. Asymmetric tri-training for unsupervised domain adaptation. In Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, pp. 2988–2997, 2017. ", + "bbox": [ + 173, + 792, + 825, + 837 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ozan Sener, Hyun Oh Song, Ashutosh Saxena, and Silvio Savarese. Learning transferrable representations for unsupervised domain adaptation. In Advances in Neural Information Processing Systems, pp. 2110–2118, 2016. ", + "bbox": [ + 174, + 844, + 825, + 887 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Alexander Strehl and Joydeep Ghosh. Cluster ensembles—a knowledge reuse framework for combining multiple partitions. Journal of machine learning research, 3(Dec):583–617, 2002. ", + "bbox": [ + 174, + 895, + 823, + 924 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Baochen Sun, Jiashi Feng, and Kate Saenko. Return of frustratingly easy domain adaptation. In AAAI, 2016. ", + "bbox": [ + 171, + 103, + 825, + 132 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Eric Tzeng, Judy Hoffman, Ning Zhang, Kate Saenko, and Trevor Darrell. Deep domain confusion: Maximizing for domain invariance. arXiv preprint arXiv:1412.3474, 2014. ", + "bbox": [ + 174, + 140, + 823, + 170 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Eric Tzeng, Judy Hoffman, Trevor Darrell, and Kate Saenko. Adversarial discriminative domain adaptation. In Computer Vision and Pattern Recognition (CVPR), 2017. ", + "bbox": [ + 173, + 178, + 823, + 208 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Oriol Vinyals, Alexander Toshev, Samy Bengio, and Dumitru Erhan. Show and tell: A neural image caption generator. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 3156–3164, 2015. ", + "bbox": [ + 176, + 215, + 825, + 260 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Oriol Vinyals, Charles Blundell, Timothy Lillicrap, Koray Kavukcuoglu, and Daan Wierstra. Matching networks for one shot learning. 2016. ", + "bbox": [ + 171, + 267, + 825, + 297 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Xiang Wang, Buyue Qian, and Ian Davidson. On constrained spectral clustering and its applications. Data Mining and Knowledge Discovery, pp. 1–30, 2014. ", + "bbox": [ + 173, + 305, + 823, + 335 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Eric P Xing, Michael I Jordan, Stuart J Russell, and Andrew Y Ng. Distance metric learning with application to clustering with side-information. In Advances in neural information processing systems, pp. 521–528, 2003. ", + "bbox": [ + 174, + 343, + 823, + 386 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Yi Yang, Dong Xu, Feiping Nie, Shuicheng Yan, and Yueting Zhuang. Image clustering using local discriminant models and global integration. IEEE Transactions on Image Processing, 19(10): 2761–2773, 2010. ", + "bbox": [ + 173, + 395, + 823, + 438 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Jason Yosinski, Jeff Clune, Yoshua Bengio, and Hod Lipson. How transferable are features in deep neural networks? 2014. ", + "bbox": [ + 171, + 446, + 823, + 476 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Sergey Zagoruyko and Nikos Komodakis. Learning to compare image patches via convolutional neural networks. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4353–4361, 2015. ", + "bbox": [ + 174, + 484, + 826, + 527 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Werner Zellinger, Thomas Grubinger, Edwin Lughofer, Thomas Natschläger, and Susanne SamingerPlatz. Central moment discrepancy (cmd) for domain-invariant representation learning. ICLR, 2017. ", + "bbox": [ + 174, + 536, + 826, + 579 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "APPENDICES ", + "text_level": 1, + "bbox": [ + 176, + 102, + 282, + 118 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "A COMPARISON OF EXPERIMENTAL SETTINGS ", + "text_level": 1, + "bbox": [ + 176, + 136, + 573, + 151 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/669369c47c732375ec24da585d0c99869e157e4a7cf270d59df4477454679e65.jpg", + "table_caption": [ + "Table 3: The list of datasets involved in each experiment. $G$ learns the similarity function from dataset A. The $\\mathbf { C C N } ^ { * }$ is optimized with dataset T or T∪S’, while $\\mathbf { C C N } ^ { * }$ means CCN for cross-task transfer and $\\mathrm { C C N ^ { + / + + } }$ for cross-domain transfer. The rows for network initialization indicate whether the network has weights initialized by training a classification task with the specified dataset. The weights are randomly initialized if not specified. " + ], + "table_footnote": [], + "table_body": "
SchemeCross-Task TransferCross-Domain Transfer
Experiment SectionOmniglot 5.1.1ImageNet 5.1.3Office-31 5.2.1SVHN-MNIST 5.2.3
DatasetsAOmniglotbgImageNet882ImageNet1000Omniglotbg
S’Office-31 {a,d,w}SVHN
TOmniglotevalImageNet118Office-31 {a,d,w)MNIST
Network InitializationGImageNet882ImageNet10001
CCN*ImageNet882ImageNet10001
", + "bbox": [ + 194, + 252, + 803, + 411 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/2385e43b5137c9f8e365706d4a2896d3faaa824f5c9736b5ead9792edd2cfe5c.jpg", + "table_caption": [ + "Table 4: The list of loss functions used for training networks. The similarity prediction function (network) $G$ uses the cross-entropy (CE) loss with two classes (similar/dissimilar). The training of constrained clustering network $( \\mathbf { C C N } ^ { * } )$ involves the combinations of the learnable clustering objective (LCO), cross-entropy, and domain adaptation loss (DA). " + ], + "table_footnote": [], + "table_body": "
LCOCEDA
G√
CCN
CCN+广√
CCN++√√
", + "bbox": [ + 395, + 498, + 601, + 583 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/6077c2618b017816b79d4cf6b62b30b24d7ebf9ecfe529286747a494f9f155c8.jpg", + "image_caption": [ + "Figure 6: A diagram depicting the cross-task transfer experiment. Two experiments follow this flow: Omniglot $b g$ to $O m n i g l o t _ { e v a l }$ , and $I m a g e N e t _ { 8 8 2 }$ to ImageNet118. Both have exclusive classes between source and target domain. In the ImageNet experiment, the backbone network is initialized with the weights pre-trained with ImageN et882. " + ], + "image_footnote": [], + "bbox": [ + 181, + 101, + 826, + 236 + ], + "page_idx": 14 + }, + { + "type": "image", + "img_path": "images/62fef6aa1814051042be0542b4068cc2863de90390604a41a4bf68f744e5059c.jpg", + "image_caption": [ + "Figure 7: Comparison between domain adaptation approaches (a) Transferring semantic similarity from auxiliary data (our method), and (b) Minimizing the domain discrepancy. The diagram uses office-31 benchmark as the scenario of transferring. " + ], + "image_footnote": [], + "bbox": [ + 187, + 339, + 825, + 598 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "B SUPPLEMENTARY FOR UNSUPERVISED CROSS TASK TRANSFER LEARNING ", + "text_level": 1, + "bbox": [ + 171, + 102, + 821, + 118 + ], + "page_idx": 15 + }, + { + "type": "table", + "img_path": "images/edd5c8527438fb985fa3aae8e157b710127e887e112b22304a27c43541aa280a.jpg", + "table_caption": [ + "Table 5: A breakdown of the results for each alphabet in Omnigloteval. The unsupervised cross task transfer experiment is described in section 5.1. This table shows the clustering accuracy with $K = 1 0 0$ to simulate the situation of unknown number of clusters. " + ], + "table_footnote": [], + "table_body": "
AlphabetK-meansLPNMFLSCITMLSKMSSKKmSKLRCSPMPCK-meansCCN
Angelic24%26%27%48%78%40%38%72%50%82%
Atemayar_Qelisayer19%14%17%51%61%51%44%61%50%82%
Atlantean19%15%19%57%72%55%51%77%47%72%
Aurek_Besh23%18%21%45%49%44%45%76%71%90%
Avesta22%18%19%47%29%39%38%65%52%76%
Ge_ez19%17%17%56%58%47%42%72%55%82%
Glagolitic22%19%21%42%38%58%62%66%61%85%
Gurmukhi15%13%15%44%26%54%48%60%56%80%
Kannada18%14%16%48%37%46%53%60%48%62%
Keble20%14%18%44%60%46%44%75%68%90%
Malayalam18%15%16%36%24%49%52%50%54%72%
Manipuri17%15%16%49%40%53%54%66%62%85%
Mongolian18%18%19%50%40%37%48%75%57%86%
Old_Church_Slavonic_Cyrilic19%16%19%42%41%52%67%71%67%94%
Oriya15%13%14%46%40%54%45%57%52%67%
Sylheti14%13%14%49%32%35%37%59%43%64%
Syriac_Serto20%18%19%55%70%42%35%70%47%73%
Tengwar18%18%18%51%44%49%40%61%44%66%
Tibetan18%14%16%44%31%47%54%59%55%84%
ULOG20%18%18%41%41%40%41%56%38%70%
Average19%16%18%47%46%47%47%65%54%78%
", + "bbox": [ + 173, + 189, + 826, + 425 + ], + "page_idx": 15 + }, + { + "type": "table", + "img_path": "images/a3aa1654884a293f29e57c2b20dac4b2622b4b5a81d2fa80fab3a1c67ce91da7.jpg", + "table_caption": [ + "Table 6: Estimates for the number of characters across the 20 datasets in Omniglot $e v a l$ . The bold number means the prediction has error smaller or equal to 3. The $A D i f$ is defined in section 5.1.2. " + ], + "table_footnote": [], + "table_body": "
AlphabetTrue #classSKMSCCN (K=100)
Angelic201626
Atemayar_Qelisayer261734
Atlantean262141
Aurek_Besh261428
Avesta26832
Ge_ez261832
Glagolitic451845
Gurmukhi451243
Kannada411944
Keble261628
Malayalam471247
Manipuri401741
Mongolian302836
Old_Church_Slavonic_Cyrillic452345
Oriya462249
Sylheti281150
Syriac_Serto231938
Tengwar251241
Tibetan421542
ULOG261540
ADif16.36.35
", + "bbox": [ + 259, + 486, + 740, + 810 + ], + "page_idx": 15 + }, + { + "type": "table", + "img_path": "images/b3acd2713316e53455d67e85e1a9e12c7140f850c530ca53e0204f69f9c4d0f0.jpg", + "table_caption": [ + "Table 7: The performance of the similarity prediction function used in section 5.1. We leverage the N-way test which is commonly used in one-shot learning evaluation. The similarity is learned with Omniglot $b g$ and has N-way test with $O m n i g l o t _ { e v a l }$ and MNIST. The experimental settings follow Vinyals et al. (2016). The raw probability output (without binarization) from our $G$ is used to find the nearest exemplar in the N-way test. " + ], + "table_footnote": [], + "table_body": "
MethodOmniglot-eval 5-wayMNIST 10-way
Siamese-Nets (Koch et al., 2015)0.96720-way 0.8800.703
Match-Net (Vinyals et al., 2016)0.9810.9380.720
Ours0.9790.9350.720
", + "bbox": [ + 284, + 224, + 714, + 315 + ], + "page_idx": 16 + }, + { + "type": "table", + "img_path": "images/ed7b58dab6ef5fe60a2c9d95bf27a1b4443d28d6a8838d1fd037c05b989d02e4.jpg", + "table_caption": [ + "Table 8: Unsupervised cross-task transfer learning on ImageNet. The values are the average of three random subsets in $I m a g e N e t _ { 1 1 8 }$ . Each subset has 30 classes. The \"ACC\" has $K = 3 0$ while the \"ACC (100)\" sets $K = 1 0 0$ . All methods use the features (outputs of average pooling) from Resnet-18 pre-trained with ImageNet882 classification. " + ], + "table_footnote": [], + "table_body": "
MethodACCACC(100)NMINMI(100)
K-means71.9%34.5%0.7130.671
LSC73.3%33.5%0.7330.655
LPNMF43.0%21.8%0.5260.500
CCN (ours)73.8%65.2%0.7500.715
", + "bbox": [ + 300, + 476, + 696, + 566 + ], + "page_idx": 16 + }, + { + "type": "table", + "img_path": "images/2fd973ba9b8e5a822c55ca7487481ec288ef5988660c0a3a7768ad39ede6159e.jpg", + "table_caption": [ + "Table 9: Performance of the similarity prediction function ( $G$ , trained with ImageN et882) applied to three subsets of $I m a g e N e t _ { 1 1 8 }$ . Each subset contains 30 random classes of $I m a g e N e t _ { 1 1 8 }$ . The predictions are binarized at 0.5 to calculate the precision and recall. Random\\*: The expected performance when classes are uniformly distributed and make uniform random guess for similarity. It is an approximation since the number of images in each class is only roughly equal in ImageNet. We sampled 12M pairs for each set to collect the statistics. Sampling more pairs has no noticeable change to the values. " + ], + "table_footnote": [], + "table_body": "
SetSimilar Precision Similar RecallDissimilar PrecisionDissimilar Recall
Random*0.0330.5000.9670.500
Set A0.8400.6640.9830.994
SetB0.8250.6310.9810.993
Set C0.7710.6710.9830.990
Average0.8120.6550.9820.992
", + "bbox": [ + 189, + 767, + 808, + 880 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "C SUPPLEMENTARY FOR UNSUPERVISED CROSS DOMAIN TRANSFER LEARNING ", + "text_level": 1, + "bbox": [ + 176, + 102, + 761, + 136 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "C.1 MORE DISCUSSION FOR THE OFFICE-31 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 174, + 151, + 596, + 166 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Our experiment (table 10) shows that simply using deeper pre-trained networks produces a significant performance boost. Specifically, using Resnet-50 increases the performance 8.4 points from Alexnet, which surpasses the 6.2 points gained by using one of the state-of-the-art domain adaptation algorithms (JAN (Long et al., 2017)). If we regard pre-training with deeper networks as transferring more information, our approach is similar in this aspect since both transfer more information from the auxiliary dataset. In this case, memory limitations precluded the application of LCO to such models, and multi-GPU implementations for this problem is an area of future work. ", + "bbox": [ + 173, + 176, + 825, + 275 + ], + "page_idx": 17 + }, + { + "type": "table", + "img_path": "images/8b547758927a8194ad9bb2d90cb1ef3c9d64fc483b82dadb28405678cd15be07.jpg", + "table_caption": [ + "Table 10: The performance of unsupervised transfer across domains on Office-31 dataset. The backbone networks in the comparison have different numbers of convolutional layers. AlexNet has 5 layers and the ResNets have $1 8 { \\sim } 5 0$ layers. SO is the abbreviation for source-only, which simply trains on $S ^ { \\prime }$ and directly applies the classifier on $T$ . The first two rows are directly copied from Long et al. (2017). The features learned with deeper networks generalize better across domains. " + ], + "table_footnote": [], + "table_body": "
A→W D→W W→D A→D D→A W→A
AlexNet SO61.695.499.063.851.149.8Avg 70.11
AlexNet (JAN-A)75.296.699.672.857.556.376.3+6.2
Resnet-18 SO66.892.896.867.151.453.071.3+1.2
Resnet-34 SO73.196.498.873.863.262.177.9+7.8
Resnet-50 SO74.396.898.879.561.260.678.5+8.4
", + "bbox": [ + 178, + 369, + 820, + 468 + ], + "page_idx": 17 + }, + { + "type": "table", + "img_path": "images/6710c86e7661394e049d39d0714ba25355b67f32155cc9ea97e9c59e48599d1d.jpg", + "table_caption": [ + "Table 11: Performance of the similarity prediction function ( $G$ , trained with ImageNet882) applied on three domains of the Office-31 dataset. In total, 1.4M pairs are examined to calculate the table. " + ], + "table_footnote": [], + "table_body": "
DomainSimilar PrecisionSimilar RecallDissimilar PrecisionDissimilar Recall
Amazon0.1940.6960.9880.894
DSLR0.1960.8820.9950.858
Webcam0.2130.8650.9940.876
", + "bbox": [ + 191, + 529, + 805, + 598 + ], + "page_idx": 17 + }, + { + "type": "table", + "img_path": "images/25c5d5e868a3d729788c298939bb3733d14f6e33ffebc69fbaad1b8d49e8a041.jpg", + "table_caption": [ + "Table 12: Unsupervised transferring across domains (S’: SVHN, T: MNIST A: Omniglotbg) without pre-trained backbone network weights. Our setup is similar to Sener et al. (2016) and Ganin et al. (2016) which therefore has a similar source-only performance. " + ], + "table_footnote": [], + "table_body": "
MethodSVHN->MNISTGain
Ganin et al. (2016)Source-Only DANN54.9 73.91 +19.0
Sener et al. (2016)Source-Only LTR54.9 78.81 +23.9
Saito et al. (2017)Source-Only ATDA70.1 86.2- +16.1
Tzeng et al. (2017)Source-Only ADDA60.1 76.0- +15.9
OursSource-Only CCN+52.0 89.11 +37.1
", + "bbox": [ + 277, + 672, + 720, + 866 + ], + "page_idx": 17 + }, + { + "type": "table", + "img_path": "images/de85c2a20514b9e73a5603c61cc374d3b3140630ae5017bceac12a520b099289.jpg", + "table_caption": [ + "Table 13: Performance of the similarity prediction function ( $G$ , trained with Omniglotbg) applied on the MNIST dataset. In total, 5M pairs are sampled to calculate the table. " + ], + "table_footnote": [], + "table_body": "
Similar PrecisionSimilar RecallDissimilar PrecisionDissimilar Recall
Random0.1000.5000.9000.500
MNIST0.7820.5090.9460.984
", + "bbox": [ + 192, + 142, + 803, + 198 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "D ROBUSTNESS ANALYSIS OF CONSTRAINED CLUSTERING NETWORK ", + "text_level": 1, + "bbox": [ + 171, + 231, + 763, + 246 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "D.1 SETUP ", + "text_level": 1, + "bbox": [ + 174, + 261, + 264, + 275 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "To quickly explore the large combination of factors that may affect the clustering, we use a small dataset (MNIST) and a small network which has two convolution layers followed by two fully connected layers. The MNIST dataset is a dataset of handwritten digits that contains 60k training and 10k testing images with size $2 8 \\mathbf { x } 2 8$ . Only the training set is used in this section and the raw pixels, which were normalized to zero mean and unit standard deviation, were fed into networks directly. ", + "bbox": [ + 174, + 287, + 825, + 357 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "The networks were randomly initialized and the clustering training was run five times under each combination of factors; we show the best final results, as is usual in the random restart regime. The mini-batch size was set to 256, thus up to 65536 pairs were presented to the LCO per mini-batch if using full density $\\mathrm { ( D } { = } 1 \\mathrm { ) }$ ). There were 235 mini-batches in an epoch and the optimization proceeded for 15 epochs. The clustering loss was minimized by stochastic gradient descent with learning rate 0.1 and momentum 0.9. The predicted cluster was assigned at the end by forwarding samples through the clustering networks. The best result in the five runs was reported. ", + "bbox": [ + 174, + 363, + 825, + 462 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "To simulate different performance of the similarity prediction, the label of pairs were flipped according to the designated recall. For example, to simulate a $90 \\%$ recall of similar pair, $10 \\%$ of the ground truth similar pair in a mini-batch were flipped. The precision of similar/dissimilar pairs is a function of the recall of both type of pairs, thus controlling the recall is sufficient for the evaluation. The recalls for both similar and dissimilar pairs were gradually reduced from one to zero at intervals of 0.1. ", + "bbox": [ + 174, + 468, + 825, + 551 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "D.2 DISCUSSION ", + "text_level": 1, + "bbox": [ + 176, + 569, + 305, + 584 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "The resulting performance w.r.t different values of recall, density, and number of clusters is visualized in Figure 8. A bright color means high NMI score and is desired. The larger the bright region, the more robust the clustering is against the noise of similarity prediction. The ACC score shows almost the same trend and is thus not shown here. ", + "bbox": [ + 174, + 595, + 825, + 651 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "How does similarity prediction affect clustering? Looking at the top-left heat map in figure 8, which has $D = 1$ and 10 clusters, it can be observed that the NMI score is very robust to low similar pair recall, even lower than 0.5. For recall of dissimilar pairs, the effect of recall is divided at the 0.5 value: the clustering performance can be very robust to noise in dissimilar pairs if the recall is greater than 0.5; however, it can completely fail if recall is below 0.5. For similar pairs, the clustering works on a wide range of recalls when the recall of dissimilar pairs is high. ", + "bbox": [ + 174, + 659, + 825, + 742 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "In practical terms, robustness to the recall of similar pairs is desirable because it is much easier to predict dissimilar pairs than similar pairs in real scenarios. In a dataset with 10 categories e.g. Cifar-10, we can easily get $90 \\%$ recall for dissimilar pairs with purely random guess if the number of classes is known, while the recall for similar pairs will be $10 \\%$ . ", + "bbox": [ + 174, + 750, + 825, + 805 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "How does the density of the constraints affect clustering? We argue that the density of pairwise relationships is the key factor to improving the robustness of clustering. The density $D = 1$ means that every pair in a mini-batch is utilized by the clustering loss. For density $D = 0 . 1$ , it means only 1 out of 10 possible constraints is used. We could regard the higher density as better utilization of the pairwise information in a mini-batch, thus more learning instances contribute to the gradients at once. Consider a scenario where there is one sample associated with 5 true similar pairs and 3 false similar pairs. In such a case, the gradients introduced by the false similar pairs have a higher chance to be overridden by true similar pairs within the mini-batch, thus the loss can converge faster and is less affected by errors. In Figure 8, we could see when density decreases, the size of the bright region shrinks significantly. ", + "bbox": [ + 174, + 811, + 825, + 924 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/12cec765ecdee0ae03b658c3f3798b3d511e16695116130fd85ecccd06d459c9.jpg", + "image_caption": [ + "Figure 8: The clustering performance with different pairwise density and number of clusters. A bright color means that the NMI score is close to 1 while black corresponds to 0. The density is defined as a ratio compared to the total number of pair-wise combinations in a mini-batch. The number of clusters defines the final softmax output dimensionality. In each sub-figure, we show how the scores change w.r.t. the similar pair recall and dissimiliar pair recall. " + ], + "image_footnote": [], + "bbox": [ + 282, + 106, + 743, + 378 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "", + "bbox": [ + 176, + 494, + 821, + 522 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "In our implementation, enumerating the full pairwise relationships introduces negligible overhead in computation time using GPU. Although there is overhead for memory consumption, it is limited because only the vector of predicted distributions has to be enumerated for calculating the clustering loss. ", + "bbox": [ + 174, + 530, + 825, + 585 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "The effect of varying the number of Clusters In the MNIST experiments, the number of categories is 10. We augment the softmax output number up to 100. The rows of figure 8 show that even when the number of output categories is significant larger than the number of true object categories, e.g. $1 0 0 > 1 0$ , the clustering performance NMI score only degrades slightly. ", + "bbox": [ + 173, + 593, + 825, + 648 + ], + "page_idx": 19 + } +] \ No newline at end of file diff --git a/parse/train/ByRWCqvT-/ByRWCqvT-_middle.json b/parse/train/ByRWCqvT-/ByRWCqvT-_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..eec95a1de84f25d61e2c10fd63c32635db42cb8a --- /dev/null +++ b/parse/train/ByRWCqvT-/ByRWCqvT-_middle.json @@ -0,0 +1,50737 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 80, + 502, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 79, + 504, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 79, + 504, + 97 + ], + "score": 1.0, + "content": "LEARNING TO CLUSTER IN ORDER TO TRANSFER", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 101, + 327, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 101, + 327, + 117 + ], + "score": 1.0, + "content": "ACROSS DOMAINS AND TASKS", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 113, + 135, + 341, + 180 + ], + "lines": [ + { + "bbox": [ + 112, + 134, + 243, + 147 + ], + "spans": [ + { + "bbox": [ + 112, + 134, + 243, + 147 + ], + "score": 1.0, + "content": "Yen-Chang Hsu, Zhaoyang Lv", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 111, + 144, + 242, + 160 + ], + "spans": [ + { + "bbox": [ + 111, + 144, + 242, + 160 + ], + "score": 1.0, + "content": "Georgia Institute of Technology", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 112, + 157, + 216, + 168 + ], + "spans": [ + { + "bbox": [ + 112, + 157, + 216, + 168 + ], + "score": 1.0, + "content": "Atlanta, GA 30332, USA", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 113, + 168, + 342, + 180 + ], + "spans": [ + { + "bbox": [ + 113, + 168, + 342, + 180 + ], + "score": 1.0, + "content": "{yenchang.hsu, zhaoyang.lv}@gatech.edu", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.0 + }, + { + "type": "text", + "bbox": [ + 360, + 135, + 490, + 179 + ], + "lines": [ + { + "bbox": [ + 359, + 134, + 407, + 147 + ], + "spans": [ + { + "bbox": [ + 359, + 134, + 407, + 147 + ], + "score": 1.0, + "content": "Zsolt Kira", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 359, + 146, + 490, + 157 + ], + "spans": [ + { + "bbox": [ + 359, + 146, + 490, + 157 + ], + "score": 1.0, + "content": "Georgia Tech Research Institute", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 360, + 157, + 464, + 168 + ], + "spans": [ + { + "bbox": [ + 360, + 157, + 464, + 168 + ], + "score": 1.0, + "content": "Atlanta, GA 30318, USA", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 360, + 168, + 458, + 179 + ], + "spans": [ + { + "bbox": [ + 360, + 168, + 458, + 179 + ], + "score": 1.0, + "content": "zkira@gatech.edu", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6.0 + }, + { + "type": "title", + "bbox": [ + 278, + 208, + 333, + 220 + ], + "lines": [ + { + "bbox": [ + 276, + 208, + 335, + 221 + ], + "spans": [ + { + "bbox": [ + 276, + 208, + 335, + 221 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 142, + 233, + 469, + 495 + ], + "lines": [ + { + "bbox": [ + 142, + 232, + 469, + 244 + ], + "spans": [ + { + "bbox": [ + 142, + 232, + 469, + 244 + ], + "score": 1.0, + "content": "This paper introduces a novel method to perform transfer learning across domains", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 142, + 243, + 470, + 256 + ], + "spans": [ + { + "bbox": [ + 142, + 243, + 470, + 256 + ], + "score": 1.0, + "content": "and tasks, formulating it as a problem of learning to cluster. The key insight is", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 254, + 470, + 266 + ], + "spans": [ + { + "bbox": [ + 141, + 254, + 470, + 266 + ], + "score": 1.0, + "content": "that, in addition to features, we can transfer similarity information and this is suffi-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 265, + 469, + 278 + ], + "spans": [ + { + "bbox": [ + 141, + 265, + 469, + 278 + ], + "score": 1.0, + "content": "cient to learn a similarity function and clustering network to perform both domain", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 142, + 276, + 470, + 289 + ], + "spans": [ + { + "bbox": [ + 142, + 276, + 470, + 289 + ], + "score": 1.0, + "content": "adaptation and cross-task transfer learning. We begin by reducing categorical", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 288, + 469, + 299 + ], + "spans": [ + { + "bbox": [ + 141, + 288, + 469, + 299 + ], + "score": 1.0, + "content": "information to pairwise constraints, which only considers whether two instances", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 297, + 469, + 311 + ], + "spans": [ + { + "bbox": [ + 141, + 297, + 469, + 311 + ], + "score": 1.0, + "content": "belong to the same class or not (pairwise semantic similarity). This similarity", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 309, + 470, + 321 + ], + "spans": [ + { + "bbox": [ + 141, + 309, + 470, + 321 + ], + "score": 1.0, + "content": "is category-agnostic and can be learned from data in the source domain using a", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 142, + 321, + 469, + 331 + ], + "spans": [ + { + "bbox": [ + 142, + 321, + 469, + 331 + ], + "score": 1.0, + "content": "similarity network. We then present two novel approaches for performing transfer", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 331, + 470, + 343 + ], + "spans": [ + { + "bbox": [ + 141, + 331, + 470, + 343 + ], + "score": 1.0, + "content": "learning using this similarity function. First, for unsupervised domain adaptation,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 342, + 470, + 353 + ], + "spans": [ + { + "bbox": [ + 141, + 342, + 470, + 353 + ], + "score": 1.0, + "content": "we design a new loss function to regularize classification with a constrained cluster-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 141, + 352, + 470, + 365 + ], + "spans": [ + { + "bbox": [ + 141, + 352, + 470, + 365 + ], + "score": 1.0, + "content": "ing loss, hence learning a clustering network with the transferred similarity metric", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 364, + 470, + 376 + ], + "spans": [ + { + "bbox": [ + 141, + 364, + 470, + 376 + ], + "score": 1.0, + "content": "generating the training inputs. Second, for cross-task learning (i.e., unsupervised", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 375, + 469, + 387 + ], + "spans": [ + { + "bbox": [ + 141, + 375, + 469, + 387 + ], + "score": 1.0, + "content": "clustering with unseen categories), we propose a framework to reconstruct and", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 141, + 386, + 470, + 398 + ], + "spans": [ + { + "bbox": [ + 141, + 386, + 470, + 398 + ], + "score": 1.0, + "content": "estimate the number of semantic clusters, again using the clustering network. Since", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 397, + 470, + 409 + ], + "spans": [ + { + "bbox": [ + 141, + 397, + 470, + 409 + ], + "score": 1.0, + "content": "the similarity network is noisy, the key is to use a robust clustering algorithm, and", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 142, + 408, + 469, + 419 + ], + "spans": [ + { + "bbox": [ + 142, + 408, + 469, + 419 + ], + "score": 1.0, + "content": "we show that our formulation is more robust than the alternative constrained and", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 141, + 419, + 470, + 430 + ], + "spans": [ + { + "bbox": [ + 141, + 419, + 470, + 430 + ], + "score": 1.0, + "content": "unconstrained clustering approaches. Using this method, we first show state of", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 141, + 429, + 470, + 442 + ], + "spans": [ + { + "bbox": [ + 141, + 429, + 470, + 442 + ], + "score": 1.0, + "content": "the art results for the challenging cross-task problem, applied on Omniglot and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 441, + 469, + 452 + ], + "spans": [ + { + "bbox": [ + 141, + 441, + 469, + 452 + ], + "score": 1.0, + "content": "ImageNet. Our results show that we can reconstruct semantic clusters with high", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 141, + 451, + 470, + 464 + ], + "spans": [ + { + "bbox": [ + 141, + 451, + 470, + 464 + ], + "score": 1.0, + "content": "accuracy. We then evaluate the performance of cross-domain transfer using images", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 141, + 462, + 469, + 474 + ], + "spans": [ + { + "bbox": [ + 141, + 462, + 469, + 474 + ], + "score": 1.0, + "content": "from the Office-31 and SVHN-MNIST tasks and present top accuracy on both", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 141, + 473, + 469, + 486 + ], + "spans": [ + { + "bbox": [ + 141, + 473, + 469, + 486 + ], + "score": 1.0, + "content": "datasets. Our approach doesn’t explicitly deal with domain discrepancy. If we", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 142, + 484, + 425, + 496 + ], + "spans": [ + { + "bbox": [ + 142, + 484, + 425, + 496 + ], + "score": 1.0, + "content": "combine with a domain adaptation loss, it shows further improvement.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 22.5 + }, + { + "type": "title", + "bbox": [ + 108, + 514, + 206, + 527 + ], + "lines": [ + { + "bbox": [ + 105, + 513, + 208, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 208, + 530 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 107, + 539, + 505, + 660 + ], + "lines": [ + { + "bbox": [ + 106, + 540, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 540, + 505, + 552 + ], + "score": 1.0, + "content": "Supervised learning has made significant strides in the past decade, with substantial advancements", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 550, + 504, + 562 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 504, + 562 + ], + "score": 1.0, + "content": "arising from the use of deep neural networks. However, a large part of this success has come from", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "the existence of extensive labeled datasets. In many situations, it is not practical to obtain such data", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "due to the amount of effort required or when the task or data distributions change dynamically. To", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 582, + 506, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 506, + 596 + ], + "score": 1.0, + "content": "deal with these situations, the fields of transfer learning and domain adaptation have explored how to", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 594, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 506, + 606 + ], + "score": 1.0, + "content": "transfer learned knowledge across tasks or domains. Many approaches have focused on cases where", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "score": 1.0, + "content": "the distributions of the features and labels have changed, but the task is the same (e.g., classification", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 616, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 506, + 628 + ], + "score": 1.0, + "content": "across datasets with the same categories). Cross-task transfer learning strategies, on the other hand,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 626, + 506, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 640 + ], + "score": 1.0, + "content": "have been widely adopted especially in the computer vision community where features learned by a", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "score": 1.0, + "content": "deep neural network on a large classification task have been applied to a wide variety of other tasks", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 649, + 200, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 200, + 660 + ], + "score": 1.0, + "content": "(Donahue et al., 2014).", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 107, + 666, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "Most of the prior cross-task transfer learning works, however, require labeled target data to learn", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "classifiers for the new task. If labels of the target data are absent, there is little choice other than", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "to apply unsupervised approaches such as clustering on the target data with pre-trained feature", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "representations. In this paper, we focus on the question of what can be transferred (besides features)", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "to support both cross-domain and cross-task transfer learning. We address it with a learned similarity", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "function as the fundamental component of clustering. Clustering can then be realized using a neural", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 49.5 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 308, + 761 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 308, + 761 + ], + "score": 1.0, + "content": "1", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 80, + 502, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 79, + 504, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 79, + 504, + 97 + ], + "score": 1.0, + "content": "LEARNING TO CLUSTER IN ORDER TO TRANSFER", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 101, + 327, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 101, + 327, + 117 + ], + "score": 1.0, + "content": "ACROSS DOMAINS AND TASKS", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "list", + "bbox": [ + 113, + 135, + 341, + 180 + ], + "lines": [ + { + "bbox": [ + 112, + 134, + 243, + 147 + ], + "spans": [ + { + "bbox": [ + 112, + 134, + 243, + 147 + ], + "score": 1.0, + "content": "Yen-Chang Hsu, Zhaoyang Lv", + "type": "text" + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 111, + 144, + 242, + 160 + ], + "spans": [ + { + "bbox": [ + 111, + 144, + 242, + 160 + ], + "score": 1.0, + "content": "Georgia Institute of Technology", + "type": "text" + } + ], + "index": 4, + "is_list_start_line": true + }, + { + "bbox": [ + 112, + 157, + 216, + 168 + ], + "spans": [ + { + "bbox": [ + 112, + 157, + 216, + 168 + ], + "score": 1.0, + "content": "Atlanta, GA 30332, USA", + "type": "text" + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 168, + 342, + 180 + ], + "spans": [ + { + "bbox": [ + 113, + 168, + 342, + 180 + ], + "score": 1.0, + "content": "{yenchang.hsu, zhaoyang.lv}@gatech.edu", + "type": "text" + } + ], + "index": 8, + "is_list_start_line": true + } + ], + "index": 5.0, + "bbox_fs": [ + 111, + 134, + 342, + 180 + ] + }, + { + "type": "text", + "bbox": [ + 360, + 135, + 490, + 179 + ], + "lines": [ + { + "bbox": [ + 359, + 134, + 407, + 147 + ], + "spans": [ + { + "bbox": [ + 359, + 134, + 407, + 147 + ], + "score": 1.0, + "content": "Zsolt Kira", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 359, + 146, + 490, + 157 + ], + "spans": [ + { + "bbox": [ + 359, + 146, + 490, + 157 + ], + "score": 1.0, + "content": "Georgia Tech Research Institute", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 360, + 157, + 464, + 168 + ], + "spans": [ + { + "bbox": [ + 360, + 157, + 464, + 168 + ], + "score": 1.0, + "content": "Atlanta, GA 30318, USA", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 360, + 168, + 458, + 179 + ], + "spans": [ + { + "bbox": [ + 360, + 168, + 458, + 179 + ], + "score": 1.0, + "content": "zkira@gatech.edu", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6.0, + "bbox_fs": [ + 359, + 134, + 490, + 179 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 208, + 333, + 220 + ], + "lines": [ + { + "bbox": [ + 276, + 208, + 335, + 221 + ], + "spans": [ + { + "bbox": [ + 276, + 208, + 335, + 221 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 142, + 233, + 469, + 495 + ], + "lines": [ + { + "bbox": [ + 142, + 232, + 469, + 244 + ], + "spans": [ + { + "bbox": [ + 142, + 232, + 469, + 244 + ], + "score": 1.0, + "content": "This paper introduces a novel method to perform transfer learning across domains", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 142, + 243, + 470, + 256 + ], + "spans": [ + { + "bbox": [ + 142, + 243, + 470, + 256 + ], + "score": 1.0, + "content": "and tasks, formulating it as a problem of learning to cluster. The key insight is", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 254, + 470, + 266 + ], + "spans": [ + { + "bbox": [ + 141, + 254, + 470, + 266 + ], + "score": 1.0, + "content": "that, in addition to features, we can transfer similarity information and this is suffi-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 265, + 469, + 278 + ], + "spans": [ + { + "bbox": [ + 141, + 265, + 469, + 278 + ], + "score": 1.0, + "content": "cient to learn a similarity function and clustering network to perform both domain", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 142, + 276, + 470, + 289 + ], + "spans": [ + { + "bbox": [ + 142, + 276, + 470, + 289 + ], + "score": 1.0, + "content": "adaptation and cross-task transfer learning. We begin by reducing categorical", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 288, + 469, + 299 + ], + "spans": [ + { + "bbox": [ + 141, + 288, + 469, + 299 + ], + "score": 1.0, + "content": "information to pairwise constraints, which only considers whether two instances", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 297, + 469, + 311 + ], + "spans": [ + { + "bbox": [ + 141, + 297, + 469, + 311 + ], + "score": 1.0, + "content": "belong to the same class or not (pairwise semantic similarity). This similarity", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 309, + 470, + 321 + ], + "spans": [ + { + "bbox": [ + 141, + 309, + 470, + 321 + ], + "score": 1.0, + "content": "is category-agnostic and can be learned from data in the source domain using a", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 142, + 321, + 469, + 331 + ], + "spans": [ + { + "bbox": [ + 142, + 321, + 469, + 331 + ], + "score": 1.0, + "content": "similarity network. We then present two novel approaches for performing transfer", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 331, + 470, + 343 + ], + "spans": [ + { + "bbox": [ + 141, + 331, + 470, + 343 + ], + "score": 1.0, + "content": "learning using this similarity function. First, for unsupervised domain adaptation,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 342, + 470, + 353 + ], + "spans": [ + { + "bbox": [ + 141, + 342, + 470, + 353 + ], + "score": 1.0, + "content": "we design a new loss function to regularize classification with a constrained cluster-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 141, + 352, + 470, + 365 + ], + "spans": [ + { + "bbox": [ + 141, + 352, + 470, + 365 + ], + "score": 1.0, + "content": "ing loss, hence learning a clustering network with the transferred similarity metric", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 364, + 470, + 376 + ], + "spans": [ + { + "bbox": [ + 141, + 364, + 470, + 376 + ], + "score": 1.0, + "content": "generating the training inputs. Second, for cross-task learning (i.e., unsupervised", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 375, + 469, + 387 + ], + "spans": [ + { + "bbox": [ + 141, + 375, + 469, + 387 + ], + "score": 1.0, + "content": "clustering with unseen categories), we propose a framework to reconstruct and", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 141, + 386, + 470, + 398 + ], + "spans": [ + { + "bbox": [ + 141, + 386, + 470, + 398 + ], + "score": 1.0, + "content": "estimate the number of semantic clusters, again using the clustering network. Since", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 397, + 470, + 409 + ], + "spans": [ + { + "bbox": [ + 141, + 397, + 470, + 409 + ], + "score": 1.0, + "content": "the similarity network is noisy, the key is to use a robust clustering algorithm, and", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 142, + 408, + 469, + 419 + ], + "spans": [ + { + "bbox": [ + 142, + 408, + 469, + 419 + ], + "score": 1.0, + "content": "we show that our formulation is more robust than the alternative constrained and", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 141, + 419, + 470, + 430 + ], + "spans": [ + { + "bbox": [ + 141, + 419, + 470, + 430 + ], + "score": 1.0, + "content": "unconstrained clustering approaches. Using this method, we first show state of", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 141, + 429, + 470, + 442 + ], + "spans": [ + { + "bbox": [ + 141, + 429, + 470, + 442 + ], + "score": 1.0, + "content": "the art results for the challenging cross-task problem, applied on Omniglot and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 441, + 469, + 452 + ], + "spans": [ + { + "bbox": [ + 141, + 441, + 469, + 452 + ], + "score": 1.0, + "content": "ImageNet. Our results show that we can reconstruct semantic clusters with high", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 141, + 451, + 470, + 464 + ], + "spans": [ + { + "bbox": [ + 141, + 451, + 470, + 464 + ], + "score": 1.0, + "content": "accuracy. We then evaluate the performance of cross-domain transfer using images", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 141, + 462, + 469, + 474 + ], + "spans": [ + { + "bbox": [ + 141, + 462, + 469, + 474 + ], + "score": 1.0, + "content": "from the Office-31 and SVHN-MNIST tasks and present top accuracy on both", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 141, + 473, + 469, + 486 + ], + "spans": [ + { + "bbox": [ + 141, + 473, + 469, + 486 + ], + "score": 1.0, + "content": "datasets. Our approach doesn’t explicitly deal with domain discrepancy. If we", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 142, + 484, + 425, + 496 + ], + "spans": [ + { + "bbox": [ + 142, + 484, + 425, + 496 + ], + "score": 1.0, + "content": "combine with a domain adaptation loss, it shows further improvement.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 22.5, + "bbox_fs": [ + 141, + 232, + 470, + 496 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 514, + 206, + 527 + ], + "lines": [ + { + "bbox": [ + 105, + 513, + 208, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 208, + 530 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 107, + 539, + 505, + 660 + ], + "lines": [ + { + "bbox": [ + 106, + 540, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 540, + 505, + 552 + ], + "score": 1.0, + "content": "Supervised learning has made significant strides in the past decade, with substantial advancements", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 550, + 504, + 562 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 504, + 562 + ], + "score": 1.0, + "content": "arising from the use of deep neural networks. However, a large part of this success has come from", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "the existence of extensive labeled datasets. In many situations, it is not practical to obtain such data", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "due to the amount of effort required or when the task or data distributions change dynamically. To", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 582, + 506, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 506, + 596 + ], + "score": 1.0, + "content": "deal with these situations, the fields of transfer learning and domain adaptation have explored how to", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 594, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 506, + 606 + ], + "score": 1.0, + "content": "transfer learned knowledge across tasks or domains. Many approaches have focused on cases where", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "score": 1.0, + "content": "the distributions of the features and labels have changed, but the task is the same (e.g., classification", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 616, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 506, + 628 + ], + "score": 1.0, + "content": "across datasets with the same categories). Cross-task transfer learning strategies, on the other hand,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 626, + 506, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 640 + ], + "score": 1.0, + "content": "have been widely adopted especially in the computer vision community where features learned by a", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "score": 1.0, + "content": "deep neural network on a large classification task have been applied to a wide variety of other tasks", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 649, + 200, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 200, + 660 + ], + "score": 1.0, + "content": "(Donahue et al., 2014).", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 540, + 506, + 660 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 666, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "Most of the prior cross-task transfer learning works, however, require labeled target data to learn", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "classifiers for the new task. If labels of the target data are absent, there is little choice other than", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "to apply unsupervised approaches such as clustering on the target data with pre-trained feature", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "representations. In this paper, we focus on the question of what can be transferred (besides features)", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "to support both cross-domain and cross-task transfer learning. We address it with a learned similarity", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "function as the fundamental component of clustering. Clustering can then be realized using a neural", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "network trained using the output of the similarity function, which can be successfully used to achieve", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 276, + 105 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 276, + 105 + ], + "score": 1.0, + "content": "both cross-task and cross-domain transfer.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 49.5, + "bbox_fs": [ + 105, + 665, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "network trained using the output of the similarity function, which can be successfully used to achieve", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 276, + 105 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 276, + 105 + ], + "score": 1.0, + "content": "both cross-task and cross-domain transfer.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 110, + 504, + 187 + ], + "lines": [ + { + "bbox": [ + 105, + 110, + 506, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 506, + 123 + ], + "score": 1.0, + "content": "The key idea is to formulate the clustering objective to use a learnable (and transferable) term, which", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 122, + 506, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 506, + 134 + ], + "score": 1.0, + "content": "in our proposed work is a similarity prediction function. Our proposed objective function can be", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "score": 1.0, + "content": "easily combined with deep neural networks and optimized end-to-end. The features and clustering", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "score": 1.0, + "content": "are optimized jointly, hence taking advantage of such side information in a robust way. Using this", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 506, + 167 + ], + "score": 1.0, + "content": "method, we show that unsupervised learning can benefit from learning performed on a distinct", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 505, + 178 + ], + "score": 1.0, + "content": "task, and demonstrate the flexibility of further combining it with a classification loss and domain", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 176, + 177, + 189 + ], + "spans": [ + { + "bbox": [ + 106, + 176, + 177, + 189 + ], + "score": 1.0, + "content": "discrepancy loss.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 193, + 505, + 303 + ], + "lines": [ + { + "bbox": [ + 105, + 192, + 505, + 206 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 505, + 206 + ], + "score": 1.0, + "content": "In summary, we make several contributions. First, we propose to use predictive pairwise similarity as", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 204, + 505, + 217 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 505, + 217 + ], + "score": 1.0, + "content": "the knowledge that is transferred and formulate a learnable objective function to utilize the pairwise", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 214, + 506, + 228 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 506, + 228 + ], + "score": 1.0, + "content": "information in a fashion similar to constrained clustering. We then provide the methodologies", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 227, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 106, + 227, + 505, + 238 + ], + "score": 1.0, + "content": "to deploy the objective function in both cross-task and cross-domain scenarios with deep neural", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 237, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 505, + 249 + ], + "score": 1.0, + "content": "networks. The experimental results for cross-task learning on Omniglot and ImageNet show that we", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 248, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 106, + 248, + 505, + 260 + ], + "score": 1.0, + "content": "can achieve state of the art clustering results with predicted similarities. On the standard domain", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 259, + 505, + 271 + ], + "spans": [ + { + "bbox": [ + 106, + 259, + 505, + 271 + ], + "score": 1.0, + "content": "adaptation benchmark Office-31 dataset, we demonstrate improvements over state-of-art even when", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 270, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 505, + 282 + ], + "score": 1.0, + "content": "not performing any explicit domain adaptation, and further improvements if we do. Finally, on", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 280, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 505, + 294 + ], + "score": 1.0, + "content": "another domain adaptation task, SVHN-to-MNIST, our approach using Omniglot as the auxiliary", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 292, + 323, + 304 + ], + "spans": [ + { + "bbox": [ + 106, + 292, + 323, + 304 + ], + "score": 1.0, + "content": "dataset achieves top performance with a large margin.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 13.5 + }, + { + "type": "title", + "bbox": [ + 108, + 324, + 211, + 336 + ], + "lines": [ + { + "bbox": [ + 104, + 322, + 213, + 339 + ], + "spans": [ + { + "bbox": [ + 104, + 322, + 213, + 339 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 351, + 505, + 429 + ], + "lines": [ + { + "bbox": [ + 105, + 351, + 506, + 365 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 506, + 365 + ], + "score": 1.0, + "content": "Transfer Learning: Transfer learning aims to leverage knowledge from the source domain to help", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 363, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 505, + 375 + ], + "score": 1.0, + "content": "learn in the target domain, while only focusing on the performance on the target domain. The", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 374, + 504, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 504, + 387 + ], + "score": 1.0, + "content": "type of transferred knowledge includes training instances, features, model parameters and relational", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 386, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 386, + 505, + 397 + ], + "score": 1.0, + "content": "knowledge (Pan & Yang, 2010). Pairwise similarity is the meta-knowledge we propose to transfer,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 394, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 505, + 409 + ], + "score": 1.0, + "content": "which falls in between the last two types. The similarity prediction function is a neural network with", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 406, + 505, + 420 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 505, + 420 + ], + "score": 1.0, + "content": "learned parameters, while the output is the most simplified form of relational knowledge, i.e., only", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 417, + 272, + 431 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 272, + 431 + ], + "score": 1.0, + "content": "considering pairwise semantic similarity.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 434, + 505, + 512 + ], + "lines": [ + { + "bbox": [ + 107, + 435, + 506, + 446 + ], + "spans": [ + { + "bbox": [ + 107, + 435, + 506, + 446 + ], + "score": 1.0, + "content": "Cross-task Transfer Learning: Features learned when trained for ImageNet classification (Rus-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 446, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 446, + 505, + 459 + ], + "score": 1.0, + "content": "sakovsky et al., 2015) have boosted the performance of a variety of vision tasks in a supervised", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 457, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 469 + ], + "score": 1.0, + "content": "setting. For example, new classification tasks (Donahue et al., 2014; Yosinski et al., 2014), object", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 465, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 505, + 482 + ], + "score": 1.0, + "content": "detection (Girshick et al., 2014), semantic segmentation (Long et al., 2015a), and image captioning", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 478, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 505, + 491 + ], + "score": 1.0, + "content": "(Vinyals et al., 2015). Translated Learning (Dai et al., 2009) has an unsupervised setting similar to", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 488, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 505, + 504 + ], + "score": 1.0, + "content": "ours, but it again focuses only on transferring features across tasks. Our work explores how learning", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 500, + 417, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 417, + 514 + ], + "score": 1.0, + "content": "could benefit from transferring pairwise similarity in an unsupervised setting.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 107, + 517, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 106, + 517, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 106, + 517, + 505, + 530 + ], + "score": 1.0, + "content": "Cross-domain Transfer Learning: Also known as domain adaptation (Pan & Yang, 2010), there has", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 527, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 506, + 542 + ], + "score": 1.0, + "content": "recently been a large body of work dealing with domain shift between image datasets by minimizing", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 540, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 506, + 552 + ], + "score": 1.0, + "content": "domain discrepancy (Tzeng et al., 2014; Long et al., 2015b; Ganin et al., 2016; Sun et al., 2016;", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "Long et al., 2016; Sener et al., 2016; Carlucci et al., 2017; Long et al., 2017; Zellinger et al., 2017;", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 561, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 506, + 574 + ], + "score": 1.0, + "content": "Bousmalis et al., 2017). We address the problem in a complementary way that transfers extra", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "score": 1.0, + "content": "information from the auxiliary dataset and show a larger performance boost with further gains using", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 583, + 263, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 263, + 596 + ], + "score": 1.0, + "content": "an additional domain discrepancy loss.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 600, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 600, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 613 + ], + "score": 1.0, + "content": "Constrained Clustering: Constrained clustering algorithms can be categorized by how they utilize", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 611, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 506, + 623 + ], + "score": 1.0, + "content": "constraints (e.g. pairwise information). The first set of work use the constraints to learn a distance", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 622, + 506, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 506, + 634 + ], + "score": 1.0, + "content": "metric. For example, DML (Xing et al., 2003), ITML (Davis et al., 2007), SKMS (Anand et al.,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 631, + 506, + 647 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 506, + 647 + ], + "score": 1.0, + "content": "2014), SKKm (Anand et al., 2014; Amid et al., 2016), and SKLR (Amid et al., 2016). This group", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 644, + 506, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 506, + 656 + ], + "score": 1.0, + "content": "of approaches closely relates to metric learning and needs a clustering algorithm such as K-means", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 655, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 506, + 668 + ], + "score": 1.0, + "content": "in a separate stage to obtain cluster assignments. The second group of work use constraints to", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "formulate the clustering loss. For example, CSP (Wang et al., 2014) and COSC (Rangapuram &", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 676, + 507, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 507, + 690 + ], + "score": 1.0, + "content": "Hein, 2012). The third group uses constraints for both metric learning and the clustering objective,", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 104, + 685, + 506, + 702 + ], + "spans": [ + { + "bbox": [ + 104, + 685, + 506, + 702 + ], + "score": 1.0, + "content": "such as MPCKMeans (Bilenko et al., 2004) and CECM (Antoine et al., 2012). The fourth group", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "does not use constraints at all. A generic clustering algorithms such as K-means (MacQueen et al.,", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "1967), LSC (Chen & Cai, 2011), and LPNMF (Cai et al., 2009) all belong to this category. There", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "is a long list of associated works and they are summarized in survey papers, e.g. Davidson & Basu", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 46.5 + } + ], + "page_idx": 1, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "score": 1.0, + "content": "2", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 505, + 105 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 110, + 504, + 187 + ], + "lines": [ + { + "bbox": [ + 105, + 110, + 506, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 506, + 123 + ], + "score": 1.0, + "content": "The key idea is to formulate the clustering objective to use a learnable (and transferable) term, which", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 122, + 506, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 506, + 134 + ], + "score": 1.0, + "content": "in our proposed work is a similarity prediction function. Our proposed objective function can be", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "score": 1.0, + "content": "easily combined with deep neural networks and optimized end-to-end. The features and clustering", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "score": 1.0, + "content": "are optimized jointly, hence taking advantage of such side information in a robust way. Using this", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 506, + 167 + ], + "score": 1.0, + "content": "method, we show that unsupervised learning can benefit from learning performed on a distinct", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 505, + 178 + ], + "score": 1.0, + "content": "task, and demonstrate the flexibility of further combining it with a classification loss and domain", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 176, + 177, + 189 + ], + "spans": [ + { + "bbox": [ + 106, + 176, + 177, + 189 + ], + "score": 1.0, + "content": "discrepancy loss.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 110, + 506, + 189 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 193, + 505, + 303 + ], + "lines": [ + { + "bbox": [ + 105, + 192, + 505, + 206 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 505, + 206 + ], + "score": 1.0, + "content": "In summary, we make several contributions. First, we propose to use predictive pairwise similarity as", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 204, + 505, + 217 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 505, + 217 + ], + "score": 1.0, + "content": "the knowledge that is transferred and formulate a learnable objective function to utilize the pairwise", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 214, + 506, + 228 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 506, + 228 + ], + "score": 1.0, + "content": "information in a fashion similar to constrained clustering. We then provide the methodologies", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 227, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 106, + 227, + 505, + 238 + ], + "score": 1.0, + "content": "to deploy the objective function in both cross-task and cross-domain scenarios with deep neural", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 237, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 505, + 249 + ], + "score": 1.0, + "content": "networks. The experimental results for cross-task learning on Omniglot and ImageNet show that we", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 248, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 106, + 248, + 505, + 260 + ], + "score": 1.0, + "content": "can achieve state of the art clustering results with predicted similarities. On the standard domain", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 259, + 505, + 271 + ], + "spans": [ + { + "bbox": [ + 106, + 259, + 505, + 271 + ], + "score": 1.0, + "content": "adaptation benchmark Office-31 dataset, we demonstrate improvements over state-of-art even when", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 270, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 505, + 282 + ], + "score": 1.0, + "content": "not performing any explicit domain adaptation, and further improvements if we do. Finally, on", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 280, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 505, + 294 + ], + "score": 1.0, + "content": "another domain adaptation task, SVHN-to-MNIST, our approach using Omniglot as the auxiliary", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 292, + 323, + 304 + ], + "spans": [ + { + "bbox": [ + 106, + 292, + 323, + 304 + ], + "score": 1.0, + "content": "dataset achieves top performance with a large margin.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 192, + 506, + 304 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 324, + 211, + 336 + ], + "lines": [ + { + "bbox": [ + 104, + 322, + 213, + 339 + ], + "spans": [ + { + "bbox": [ + 104, + 322, + 213, + 339 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 351, + 505, + 429 + ], + "lines": [ + { + "bbox": [ + 105, + 351, + 506, + 365 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 506, + 365 + ], + "score": 1.0, + "content": "Transfer Learning: Transfer learning aims to leverage knowledge from the source domain to help", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 363, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 505, + 375 + ], + "score": 1.0, + "content": "learn in the target domain, while only focusing on the performance on the target domain. The", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 374, + 504, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 504, + 387 + ], + "score": 1.0, + "content": "type of transferred knowledge includes training instances, features, model parameters and relational", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 386, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 386, + 505, + 397 + ], + "score": 1.0, + "content": "knowledge (Pan & Yang, 2010). Pairwise similarity is the meta-knowledge we propose to transfer,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 394, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 505, + 409 + ], + "score": 1.0, + "content": "which falls in between the last two types. The similarity prediction function is a neural network with", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 406, + 505, + 420 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 505, + 420 + ], + "score": 1.0, + "content": "learned parameters, while the output is the most simplified form of relational knowledge, i.e., only", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 417, + 272, + 431 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 272, + 431 + ], + "score": 1.0, + "content": "considering pairwise semantic similarity.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 351, + 506, + 431 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 434, + 505, + 512 + ], + "lines": [ + { + "bbox": [ + 107, + 435, + 506, + 446 + ], + "spans": [ + { + "bbox": [ + 107, + 435, + 506, + 446 + ], + "score": 1.0, + "content": "Cross-task Transfer Learning: Features learned when trained for ImageNet classification (Rus-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 446, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 446, + 505, + 459 + ], + "score": 1.0, + "content": "sakovsky et al., 2015) have boosted the performance of a variety of vision tasks in a supervised", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 457, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 469 + ], + "score": 1.0, + "content": "setting. For example, new classification tasks (Donahue et al., 2014; Yosinski et al., 2014), object", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 465, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 505, + 482 + ], + "score": 1.0, + "content": "detection (Girshick et al., 2014), semantic segmentation (Long et al., 2015a), and image captioning", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 478, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 505, + 491 + ], + "score": 1.0, + "content": "(Vinyals et al., 2015). Translated Learning (Dai et al., 2009) has an unsupervised setting similar to", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 488, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 505, + 504 + ], + "score": 1.0, + "content": "ours, but it again focuses only on transferring features across tasks. Our work explores how learning", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 500, + 417, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 417, + 514 + ], + "score": 1.0, + "content": "could benefit from transferring pairwise similarity in an unsupervised setting.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 435, + 506, + 514 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 517, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 106, + 517, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 106, + 517, + 505, + 530 + ], + "score": 1.0, + "content": "Cross-domain Transfer Learning: Also known as domain adaptation (Pan & Yang, 2010), there has", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 527, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 506, + 542 + ], + "score": 1.0, + "content": "recently been a large body of work dealing with domain shift between image datasets by minimizing", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 540, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 506, + 552 + ], + "score": 1.0, + "content": "domain discrepancy (Tzeng et al., 2014; Long et al., 2015b; Ganin et al., 2016; Sun et al., 2016;", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "Long et al., 2016; Sener et al., 2016; Carlucci et al., 2017; Long et al., 2017; Zellinger et al., 2017;", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 561, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 506, + 574 + ], + "score": 1.0, + "content": "Bousmalis et al., 2017). We address the problem in a complementary way that transfers extra", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "score": 1.0, + "content": "information from the auxiliary dataset and show a larger performance boost with further gains using", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 583, + 263, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 263, + 596 + ], + "score": 1.0, + "content": "an additional domain discrepancy loss.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 517, + 506, + 596 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 600, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 600, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 613 + ], + "score": 1.0, + "content": "Constrained Clustering: Constrained clustering algorithms can be categorized by how they utilize", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 611, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 506, + 623 + ], + "score": 1.0, + "content": "constraints (e.g. pairwise information). The first set of work use the constraints to learn a distance", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 622, + 506, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 506, + 634 + ], + "score": 1.0, + "content": "metric. For example, DML (Xing et al., 2003), ITML (Davis et al., 2007), SKMS (Anand et al.,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 631, + 506, + 647 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 506, + 647 + ], + "score": 1.0, + "content": "2014), SKKm (Anand et al., 2014; Amid et al., 2016), and SKLR (Amid et al., 2016). This group", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 644, + 506, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 506, + 656 + ], + "score": 1.0, + "content": "of approaches closely relates to metric learning and needs a clustering algorithm such as K-means", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 655, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 506, + 668 + ], + "score": 1.0, + "content": "in a separate stage to obtain cluster assignments. The second group of work use constraints to", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "formulate the clustering loss. For example, CSP (Wang et al., 2014) and COSC (Rangapuram &", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 676, + 507, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 507, + 690 + ], + "score": 1.0, + "content": "Hein, 2012). The third group uses constraints for both metric learning and the clustering objective,", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 104, + 685, + 506, + 702 + ], + "spans": [ + { + "bbox": [ + 104, + 685, + 506, + 702 + ], + "score": 1.0, + "content": "such as MPCKMeans (Bilenko et al., 2004) and CECM (Antoine et al., 2012). The fourth group", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "does not use constraints at all. A generic clustering algorithms such as K-means (MacQueen et al.,", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "1967), LSC (Chen & Cai, 2011), and LPNMF (Cai et al., 2009) all belong to this category. There", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "is a long list of associated works and they are summarized in survey papers, e.g. Davidson & Basu", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 106, + 282, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 106, + 282, + 505, + 294 + ], + "score": 1.0, + "content": "(2007) and Dinler & Tural (2016). Our proposed clustering strategy belongs to the third group. The", + "type": "text", + "cross_page": true + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 294, + 506, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 294, + 506, + 306 + ], + "score": 1.0, + "content": "constrained clustering methods above are applied to the semi-supervised setting where the ground-", + "type": "text", + "cross_page": true + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 304, + 505, + 317 + ], + "spans": [ + { + "bbox": [ + 105, + 304, + 505, + 317 + ], + "score": 1.0, + "content": "truth constraints are sparsely available. In our unsupervised setting, the ground-truth is unavailable", + "type": "text", + "cross_page": true + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 314, + 506, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 314, + 506, + 329 + ], + "score": 1.0, + "content": "but predicted constraints are densely available. We include all four groups of algorithms in our", + "type": "text", + "cross_page": true + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 325, + 332, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 332, + 340 + ], + "score": 1.0, + "content": "comparison and show the advantages of the third group.", + "type": "text", + "cross_page": true + } + ], + "index": 11 + } + ], + "index": 46.5, + "bbox_fs": [ + 104, + 600, + 507, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 146, + 85, + 448, + 205 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 146, + 85, + 448, + 205 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 146, + 85, + 448, + 205 + ], + "spans": [ + { + "bbox": [ + 146, + 85, + 448, + 205 + ], + "score": 0.972, + "type": "image", + "image_path": "e45febb1495b4ec74c335fc4134b2e9707a9552a0aad1ab6b240e7e63479843e.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 146, + 85, + 448, + 125.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 146, + 125.0, + 448, + 165.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 146, + 165.0, + 448, + 205.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 216, + 506, + 261 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 217, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 106, + 217, + 505, + 228 + ], + "score": 1.0, + "content": "Figure 1: Overview of the transfer scheme with a learnable clustering objective (LCO). The LCO", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 227, + 507, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 507, + 240 + ], + "score": 1.0, + "content": "and pairwise similarity are the two key components of our approach and are described in section 4.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 238, + 506, + 252 + ], + "spans": [ + { + "bbox": [ + 104, + 238, + 506, + 252 + ], + "score": 1.0, + "content": "The dashed rectangles and light gray arrows are only available in cross-domain transfer. Details are", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 249, + 199, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 249, + 199, + 261 + ], + "score": 1.0, + "content": "described in section 3.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "text", + "bbox": [ + 107, + 282, + 505, + 338 + ], + "lines": [ + { + "bbox": [ + 106, + 282, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 106, + 282, + 505, + 294 + ], + "score": 1.0, + "content": "(2007) and Dinler & Tural (2016). Our proposed clustering strategy belongs to the third group. The", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 294, + 506, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 294, + 506, + 306 + ], + "score": 1.0, + "content": "constrained clustering methods above are applied to the semi-supervised setting where the ground-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 304, + 505, + 317 + ], + "spans": [ + { + "bbox": [ + 105, + 304, + 505, + 317 + ], + "score": 1.0, + "content": "truth constraints are sparsely available. In our unsupervised setting, the ground-truth is unavailable", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 314, + 506, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 314, + 506, + 329 + ], + "score": 1.0, + "content": "but predicted constraints are densely available. We include all four groups of algorithms in our", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 325, + 332, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 332, + 340 + ], + "score": 1.0, + "content": "comparison and show the advantages of the third group.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9 + }, + { + "type": "title", + "bbox": [ + 108, + 356, + 296, + 369 + ], + "lines": [ + { + "bbox": [ + 105, + 355, + 298, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 355, + 298, + 371 + ], + "score": 1.0, + "content": "3 THE TRANSFER LEARNING TASKS", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 383, + 505, + 483 + ], + "lines": [ + { + "bbox": [ + 106, + 383, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 383, + 505, + 396 + ], + "score": 1.0, + "content": "To define the transfer learning problem addressed in this work, we follow the notations used by Pan", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 394, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 395, + 387, + 407 + ], + "score": 1.0, + "content": "& Yang (2010). The goal is to transfer knowledge from source data", + "type": "text" + }, + { + "bbox": [ + 387, + 394, + 447, + 407 + ], + "score": 0.93, + "content": "\\boldsymbol { S } = ( X _ { S } , Y _ { S } )", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 395, + 479, + 407 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 479, + 395, + 494, + 406 + ], + "score": 0.88, + "content": "X _ { S }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 395, + 505, + 407 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 405, + 506, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 226, + 419 + ], + "score": 1.0, + "content": "the set of data instances and", + "type": "text" + }, + { + "bbox": [ + 226, + 406, + 239, + 416 + ], + "score": 0.88, + "content": "Y _ { S }", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 405, + 506, + 419 + ], + "score": 1.0, + "content": "is the corresponding categorical labels, to a target data noted as", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 416, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 106, + 416, + 168, + 429 + ], + "score": 0.92, + "content": "T = \\left( X _ { T } , Y _ { T } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 416, + 319, + 429 + ], + "score": 1.0, + "content": ". The learning is unsupervised since", + "type": "text" + }, + { + "bbox": [ + 319, + 417, + 333, + 428 + ], + "score": 0.88, + "content": "Y _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 416, + 505, + 429 + ], + "score": 1.0, + "content": "is unknown. The scenario is divided into", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 427, + 506, + 441 + ], + "spans": [ + { + "bbox": [ + 106, + 427, + 180, + 441 + ], + "score": 1.0, + "content": "two cases. One is", + "type": "text" + }, + { + "bbox": [ + 180, + 427, + 237, + 439 + ], + "score": 0.93, + "content": "\\{ Y _ { T } \\} \\ne \\{ { \\bar { Y } } _ { S } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 427, + 506, + 441 + ], + "score": 1.0, + "content": ", which means the set of categories are not the same and hence the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 437, + 506, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 437, + 281, + 452 + ], + "score": 1.0, + "content": "transfer is across tasks. The second case is", + "type": "text" + }, + { + "bbox": [ + 281, + 438, + 339, + 450 + ], + "score": 0.94, + "content": "\\{ Y _ { T } \\} = \\{ Y _ { S } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 437, + 506, + 452 + ], + "score": 1.0, + "content": ", but with a domain shift. In other words,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 448, + 505, + 462 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 406, + 462 + ], + "score": 1.0, + "content": "the marginal probability distributions of the input data are different, i.e.,", + "type": "text" + }, + { + "bbox": [ + 406, + 449, + 481, + 461 + ], + "score": 0.93, + "content": "P ( X _ { T } ) \\neq P ( X _ { S } )", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 448, + 505, + 462 + ], + "score": 1.0, + "content": ". The", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 460, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 505, + 473 + ], + "score": 1.0, + "content": "latter is a cross-domain learning problem also called transductive learning. The domain adaptation", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 471, + 469, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 469, + 485 + ], + "score": 1.0, + "content": "approaches which have gained significant attention recently belong to the second scenario.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 488, + 505, + 576 + ], + "lines": [ + { + "bbox": [ + 105, + 487, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 487, + 505, + 500 + ], + "score": 1.0, + "content": "To align with common benchmarks for evaluating transfer learning performance, we further use the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 498, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 353, + 513 + ], + "score": 1.0, + "content": "notion of an auxiliary dataset and split the source data into", + "type": "text" + }, + { + "bbox": [ + 353, + 499, + 406, + 509 + ], + "score": 0.89, + "content": "S = { \\bar { S } } ^ { \\prime } \\cup A", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 498, + 412, + 513 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 412, + 499, + 475, + 511 + ], + "score": 0.93, + "content": "S ^ { \\prime } = ( X _ { S } ^ { \\prime } , Y _ { S } ^ { \\prime } )", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 498, + 506, + 513 + ], + "score": 1.0, + "content": "which", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 510, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 105, + 510, + 353, + 523 + ], + "score": 1.0, + "content": "is only present in the cross-domain transfer scheme and has", + "type": "text" + }, + { + "bbox": [ + 353, + 510, + 412, + 522 + ], + "score": 0.91, + "content": "\\{ Y _ { S } ^ { \\prime } \\} = \\{ Y _ { T } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 510, + 417, + 523 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 417, + 511, + 479, + 522 + ], + "score": 0.92, + "content": "A = ( X _ { A } , Y _ { A } )", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 510, + 505, + 523 + ], + "score": 1.0, + "content": "is the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 521, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 521, + 505, + 533 + ], + "score": 1.0, + "content": "auxiliary dataset which has a large amount of labeled data and potentially categories as well, and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 531, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 268, + 545 + ], + "score": 1.0, + "content": "may or may not contain the categories of", + "type": "text" + }, + { + "bbox": [ + 268, + 532, + 281, + 543 + ], + "score": 0.88, + "content": "Y _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 531, + 414, + 545 + ], + "score": 1.0, + "content": ". For the cross task scenario, only", + "type": "text" + }, + { + "bbox": [ + 414, + 533, + 423, + 542 + ], + "score": 0.77, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 531, + 480, + 545 + ], + "score": 1.0, + "content": "and unlabeled", + "type": "text" + }, + { + "bbox": [ + 481, + 533, + 489, + 542 + ], + "score": 0.81, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 490, + 531, + 505, + 545 + ], + "score": 1.0, + "content": "are", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 543, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 299, + 555 + ], + "score": 1.0, + "content": "included, while cross-domain transfer involves", + "type": "text" + }, + { + "bbox": [ + 299, + 543, + 307, + 553 + ], + "score": 0.5, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 543, + 311, + 555 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 312, + 543, + 322, + 553 + ], + "score": 0.7, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 543, + 343, + 555 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 343, + 543, + 352, + 553 + ], + "score": 0.78, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 543, + 505, + 555 + ], + "score": 1.0, + "content": ". In the following sections we use the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 552, + 506, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 506, + 567 + ], + "score": 1.0, + "content": "above notations and describe the two transfer learning tasks in detail. Figure 1 illustrates how our", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 565, + 229, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 565, + 229, + 577 + ], + "score": 1.0, + "content": "approach relates to both tasks.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 107, + 582, + 505, + 648 + ], + "lines": [ + { + "bbox": [ + 106, + 581, + 505, + 594 + ], + "spans": [ + { + "bbox": [ + 106, + 581, + 505, + 594 + ], + "score": 1.0, + "content": "Transfer across tasks: If the target task has different categories, we cannot directly transfer the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 592, + 506, + 605 + ], + "spans": [ + { + "bbox": [ + 106, + 592, + 506, + 605 + ], + "score": 1.0, + "content": "classifier from source to target, and there is no labeled target data to use for fine-tuning transferred", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 603, + 506, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 603, + 506, + 616 + ], + "score": 1.0, + "content": "features. Here we propose to first reduce the categorization problem to a surrogate same-task problem.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 614, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 106, + 614, + 505, + 627 + ], + "score": 1.0, + "content": "We can directly apply transductive transfer learning (Pan & Yang, 2010) to the transformed task. The", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 625, + 507, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 625, + 507, + 639 + ], + "score": 1.0, + "content": "cluster structure in the target data is then reconstructed using the predictions in the transformed task.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 636, + 231, + 649 + ], + "spans": [ + { + "bbox": [ + 106, + 636, + 231, + 649 + ], + "score": 1.0, + "content": "See figure 2 for an illustration.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 106, + 653, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 652, + 505, + 666 + ], + "spans": [ + { + "bbox": [ + 105, + 652, + 294, + 666 + ], + "score": 1.0, + "content": "The source involves a labeled auxiliary dataset", + "type": "text" + }, + { + "bbox": [ + 294, + 654, + 303, + 663 + ], + "score": 0.76, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 652, + 429, + 666 + ], + "score": 1.0, + "content": "and an unlabeled target dataset", + "type": "text" + }, + { + "bbox": [ + 429, + 654, + 437, + 664 + ], + "score": 0.57, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 652, + 441, + 666 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 442, + 654, + 455, + 664 + ], + "score": 0.74, + "content": "Y _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 652, + 505, + 666 + ], + "score": 1.0, + "content": "is the target", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 664, + 506, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 331, + 677 + ], + "score": 1.0, + "content": "that must be inferred. In this scenario the set of categories", + "type": "text" + }, + { + "bbox": [ + 331, + 664, + 389, + 677 + ], + "score": 0.93, + "content": "\\{ Y _ { A } \\} \\ne \\{ Y _ { T } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 664, + 408, + 677 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 409, + 665, + 422, + 676 + ], + "score": 0.89, + "content": "Y _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 422, + 664, + 506, + 677 + ], + "score": 1.0, + "content": "is unknown. We first", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 675, + 506, + 688 + ], + "spans": [ + { + "bbox": [ + 106, + 675, + 506, + 688 + ], + "score": 1.0, + "content": "transform the problem of categorization into a pairwise similarity prediction problem. In other words,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 104, + 684, + 504, + 702 + ], + "spans": [ + { + "bbox": [ + 104, + 684, + 254, + 702 + ], + "score": 1.0, + "content": "we specify a transformation function", + "type": "text" + }, + { + "bbox": [ + 254, + 687, + 263, + 696 + ], + "score": 0.81, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 684, + 302, + 702 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 302, + 686, + 381, + 699 + ], + "score": 0.92, + "content": "R ( A ) = ( X _ { A } ^ { R ^ { \\prime } } , \\bar { Y } ^ { R } )", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 684, + 402, + 702 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 402, + 686, + 504, + 699 + ], + "score": 0.92, + "content": "\\dot { X } _ { A } ^ { R } = \\{ ( x _ { A , i } , x _ { A , j } ) \\} _ { \\forall i , j }", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 233, + 711 + ], + "score": 1.0, + "content": "contains all pairs of data, where", + "type": "text" + }, + { + "bbox": [ + 233, + 698, + 366, + 711 + ], + "score": 0.79, + "content": "\\{ Y ^ { R } \\} = \\{ d i s s i m i l a r , s i m i l a r \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 698, + 506, + 711 + ], + "score": 1.0, + "content": ". The transformation on the labeled", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "auxiliary data is straightforward. It will be similar if two data instances are from the same category,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 718, + 503, + 735 + ], + "spans": [ + { + "bbox": [ + 105, + 718, + 434, + 735 + ], + "score": 1.0, + "content": "and vice versa. We then use it to learn a pairwise similarity prediction function", + "type": "text" + }, + { + "bbox": [ + 434, + 720, + 503, + 733 + ], + "score": 0.93, + "content": "G ( x _ { i } , x _ { j } ) = \\mathbf { \\bar { \\Gamma } } y _ { i , j }", + "type": "inline_equation" + } + ], + "index": 42 + } + ], + "index": 39 + } + ], + "page_idx": 2, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 146, + 85, + 448, + 205 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 146, + 85, + 448, + 205 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 146, + 85, + 448, + 205 + ], + "spans": [ + { + "bbox": [ + 146, + 85, + 448, + 205 + ], + "score": 0.972, + "type": "image", + "image_path": "e45febb1495b4ec74c335fc4134b2e9707a9552a0aad1ab6b240e7e63479843e.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 146, + 85, + 448, + 125.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 146, + 125.0, + 448, + 165.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 146, + 165.0, + 448, + 205.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 216, + 506, + 261 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 217, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 106, + 217, + 505, + 228 + ], + "score": 1.0, + "content": "Figure 1: Overview of the transfer scheme with a learnable clustering objective (LCO). The LCO", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 227, + 507, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 507, + 240 + ], + "score": 1.0, + "content": "and pairwise similarity are the two key components of our approach and are described in section 4.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 238, + 506, + 252 + ], + "spans": [ + { + "bbox": [ + 104, + 238, + 506, + 252 + ], + "score": 1.0, + "content": "The dashed rectangles and light gray arrows are only available in cross-domain transfer. Details are", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 249, + 199, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 249, + 199, + 261 + ], + "score": 1.0, + "content": "described in section 3.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "text", + "bbox": [ + 107, + 282, + 505, + 338 + ], + "lines": [], + "index": 9, + "bbox_fs": [ + 105, + 282, + 506, + 340 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 108, + 356, + 296, + 369 + ], + "lines": [ + { + "bbox": [ + 105, + 355, + 298, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 355, + 298, + 371 + ], + "score": 1.0, + "content": "3 THE TRANSFER LEARNING TASKS", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 383, + 505, + 483 + ], + "lines": [ + { + "bbox": [ + 106, + 383, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 383, + 505, + 396 + ], + "score": 1.0, + "content": "To define the transfer learning problem addressed in this work, we follow the notations used by Pan", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 394, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 395, + 387, + 407 + ], + "score": 1.0, + "content": "& Yang (2010). The goal is to transfer knowledge from source data", + "type": "text" + }, + { + "bbox": [ + 387, + 394, + 447, + 407 + ], + "score": 0.93, + "content": "\\boldsymbol { S } = ( X _ { S } , Y _ { S } )", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 395, + 479, + 407 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 479, + 395, + 494, + 406 + ], + "score": 0.88, + "content": "X _ { S }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 395, + 505, + 407 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 405, + 506, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 226, + 419 + ], + "score": 1.0, + "content": "the set of data instances and", + "type": "text" + }, + { + "bbox": [ + 226, + 406, + 239, + 416 + ], + "score": 0.88, + "content": "Y _ { S }", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 405, + 506, + 419 + ], + "score": 1.0, + "content": "is the corresponding categorical labels, to a target data noted as", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 416, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 106, + 416, + 168, + 429 + ], + "score": 0.92, + "content": "T = \\left( X _ { T } , Y _ { T } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 416, + 319, + 429 + ], + "score": 1.0, + "content": ". The learning is unsupervised since", + "type": "text" + }, + { + "bbox": [ + 319, + 417, + 333, + 428 + ], + "score": 0.88, + "content": "Y _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 416, + 505, + 429 + ], + "score": 1.0, + "content": "is unknown. The scenario is divided into", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 427, + 506, + 441 + ], + "spans": [ + { + "bbox": [ + 106, + 427, + 180, + 441 + ], + "score": 1.0, + "content": "two cases. One is", + "type": "text" + }, + { + "bbox": [ + 180, + 427, + 237, + 439 + ], + "score": 0.93, + "content": "\\{ Y _ { T } \\} \\ne \\{ { \\bar { Y } } _ { S } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 427, + 506, + 441 + ], + "score": 1.0, + "content": ", which means the set of categories are not the same and hence the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 437, + 506, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 437, + 281, + 452 + ], + "score": 1.0, + "content": "transfer is across tasks. The second case is", + "type": "text" + }, + { + "bbox": [ + 281, + 438, + 339, + 450 + ], + "score": 0.94, + "content": "\\{ Y _ { T } \\} = \\{ Y _ { S } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 437, + 506, + 452 + ], + "score": 1.0, + "content": ", but with a domain shift. In other words,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 448, + 505, + 462 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 406, + 462 + ], + "score": 1.0, + "content": "the marginal probability distributions of the input data are different, i.e.,", + "type": "text" + }, + { + "bbox": [ + 406, + 449, + 481, + 461 + ], + "score": 0.93, + "content": "P ( X _ { T } ) \\neq P ( X _ { S } )", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 448, + 505, + 462 + ], + "score": 1.0, + "content": ". The", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 460, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 505, + 473 + ], + "score": 1.0, + "content": "latter is a cross-domain learning problem also called transductive learning. The domain adaptation", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 471, + 469, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 469, + 485 + ], + "score": 1.0, + "content": "approaches which have gained significant attention recently belong to the second scenario.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 383, + 506, + 485 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 488, + 505, + 576 + ], + "lines": [ + { + "bbox": [ + 105, + 487, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 487, + 505, + 500 + ], + "score": 1.0, + "content": "To align with common benchmarks for evaluating transfer learning performance, we further use the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 498, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 353, + 513 + ], + "score": 1.0, + "content": "notion of an auxiliary dataset and split the source data into", + "type": "text" + }, + { + "bbox": [ + 353, + 499, + 406, + 509 + ], + "score": 0.89, + "content": "S = { \\bar { S } } ^ { \\prime } \\cup A", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 498, + 412, + 513 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 412, + 499, + 475, + 511 + ], + "score": 0.93, + "content": "S ^ { \\prime } = ( X _ { S } ^ { \\prime } , Y _ { S } ^ { \\prime } )", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 498, + 506, + 513 + ], + "score": 1.0, + "content": "which", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 510, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 105, + 510, + 353, + 523 + ], + "score": 1.0, + "content": "is only present in the cross-domain transfer scheme and has", + "type": "text" + }, + { + "bbox": [ + 353, + 510, + 412, + 522 + ], + "score": 0.91, + "content": "\\{ Y _ { S } ^ { \\prime } \\} = \\{ Y _ { T } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 510, + 417, + 523 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 417, + 511, + 479, + 522 + ], + "score": 0.92, + "content": "A = ( X _ { A } , Y _ { A } )", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 510, + 505, + 523 + ], + "score": 1.0, + "content": "is the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 521, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 521, + 505, + 533 + ], + "score": 1.0, + "content": "auxiliary dataset which has a large amount of labeled data and potentially categories as well, and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 531, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 268, + 545 + ], + "score": 1.0, + "content": "may or may not contain the categories of", + "type": "text" + }, + { + "bbox": [ + 268, + 532, + 281, + 543 + ], + "score": 0.88, + "content": "Y _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 531, + 414, + 545 + ], + "score": 1.0, + "content": ". For the cross task scenario, only", + "type": "text" + }, + { + "bbox": [ + 414, + 533, + 423, + 542 + ], + "score": 0.77, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 531, + 480, + 545 + ], + "score": 1.0, + "content": "and unlabeled", + "type": "text" + }, + { + "bbox": [ + 481, + 533, + 489, + 542 + ], + "score": 0.81, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 490, + 531, + 505, + 545 + ], + "score": 1.0, + "content": "are", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 543, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 299, + 555 + ], + "score": 1.0, + "content": "included, while cross-domain transfer involves", + "type": "text" + }, + { + "bbox": [ + 299, + 543, + 307, + 553 + ], + "score": 0.5, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 543, + 311, + 555 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 312, + 543, + 322, + 553 + ], + "score": 0.7, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 543, + 343, + 555 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 343, + 543, + 352, + 553 + ], + "score": 0.78, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 543, + 505, + 555 + ], + "score": 1.0, + "content": ". In the following sections we use the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 552, + 506, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 506, + 567 + ], + "score": 1.0, + "content": "above notations and describe the two transfer learning tasks in detail. Figure 1 illustrates how our", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 565, + 229, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 565, + 229, + 577 + ], + "score": 1.0, + "content": "approach relates to both tasks.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 487, + 506, + 577 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 582, + 505, + 648 + ], + "lines": [ + { + "bbox": [ + 106, + 581, + 505, + 594 + ], + "spans": [ + { + "bbox": [ + 106, + 581, + 505, + 594 + ], + "score": 1.0, + "content": "Transfer across tasks: If the target task has different categories, we cannot directly transfer the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 592, + 506, + 605 + ], + "spans": [ + { + "bbox": [ + 106, + 592, + 506, + 605 + ], + "score": 1.0, + "content": "classifier from source to target, and there is no labeled target data to use for fine-tuning transferred", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 603, + 506, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 603, + 506, + 616 + ], + "score": 1.0, + "content": "features. Here we propose to first reduce the categorization problem to a surrogate same-task problem.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 614, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 106, + 614, + 505, + 627 + ], + "score": 1.0, + "content": "We can directly apply transductive transfer learning (Pan & Yang, 2010) to the transformed task. The", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 625, + 507, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 625, + 507, + 639 + ], + "score": 1.0, + "content": "cluster structure in the target data is then reconstructed using the predictions in the transformed task.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 636, + 231, + 649 + ], + "spans": [ + { + "bbox": [ + 106, + 636, + 231, + 649 + ], + "score": 1.0, + "content": "See figure 2 for an illustration.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 581, + 507, + 649 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 653, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 652, + 505, + 666 + ], + "spans": [ + { + "bbox": [ + 105, + 652, + 294, + 666 + ], + "score": 1.0, + "content": "The source involves a labeled auxiliary dataset", + "type": "text" + }, + { + "bbox": [ + 294, + 654, + 303, + 663 + ], + "score": 0.76, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 652, + 429, + 666 + ], + "score": 1.0, + "content": "and an unlabeled target dataset", + "type": "text" + }, + { + "bbox": [ + 429, + 654, + 437, + 664 + ], + "score": 0.57, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 652, + 441, + 666 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 442, + 654, + 455, + 664 + ], + "score": 0.74, + "content": "Y _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 652, + 505, + 666 + ], + "score": 1.0, + "content": "is the target", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 664, + 506, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 331, + 677 + ], + "score": 1.0, + "content": "that must be inferred. In this scenario the set of categories", + "type": "text" + }, + { + "bbox": [ + 331, + 664, + 389, + 677 + ], + "score": 0.93, + "content": "\\{ Y _ { A } \\} \\ne \\{ Y _ { T } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 664, + 408, + 677 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 409, + 665, + 422, + 676 + ], + "score": 0.89, + "content": "Y _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 422, + 664, + 506, + 677 + ], + "score": 1.0, + "content": "is unknown. We first", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 675, + 506, + 688 + ], + "spans": [ + { + "bbox": [ + 106, + 675, + 506, + 688 + ], + "score": 1.0, + "content": "transform the problem of categorization into a pairwise similarity prediction problem. In other words,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 104, + 684, + 504, + 702 + ], + "spans": [ + { + "bbox": [ + 104, + 684, + 254, + 702 + ], + "score": 1.0, + "content": "we specify a transformation function", + "type": "text" + }, + { + "bbox": [ + 254, + 687, + 263, + 696 + ], + "score": 0.81, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 684, + 302, + 702 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 302, + 686, + 381, + 699 + ], + "score": 0.92, + "content": "R ( A ) = ( X _ { A } ^ { R ^ { \\prime } } , \\bar { Y } ^ { R } )", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 684, + 402, + 702 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 402, + 686, + 504, + 699 + ], + "score": 0.92, + "content": "\\dot { X } _ { A } ^ { R } = \\{ ( x _ { A , i } , x _ { A , j } ) \\} _ { \\forall i , j }", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 233, + 711 + ], + "score": 1.0, + "content": "contains all pairs of data, where", + "type": "text" + }, + { + "bbox": [ + 233, + 698, + 366, + 711 + ], + "score": 0.79, + "content": "\\{ Y ^ { R } \\} = \\{ d i s s i m i l a r , s i m i l a r \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 698, + 506, + 711 + ], + "score": 1.0, + "content": ". The transformation on the labeled", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "auxiliary data is straightforward. It will be similar if two data instances are from the same category,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 718, + 503, + 735 + ], + "spans": [ + { + "bbox": [ + 105, + 718, + 434, + 735 + ], + "score": 1.0, + "content": "and vice versa. We then use it to learn a pairwise similarity prediction function", + "type": "text" + }, + { + "bbox": [ + 434, + 720, + 503, + 733 + ], + "score": 0.93, + "content": "G ( x _ { i } , x _ { j } ) = \\mathbf { \\bar { \\Gamma } } y _ { i , j }", + "type": "inline_equation" + } + ], + "index": 42 + } + ], + "index": 39, + "bbox_fs": [ + 104, + 652, + 506, + 735 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 180, + 80, + 425, + 232 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 180, + 80, + 425, + 232 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 180, + 80, + 425, + 232 + ], + "spans": [ + { + "bbox": [ + 180, + 80, + 425, + 232 + ], + "score": 0.961, + "type": "image", + "image_path": "2b04f9cd1aa8b76244e957c10c6c523af984b0b1e4ea8542e4f1f432440b0e65.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 180, + 80, + 425, + 130.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 180, + 130.66666666666666, + 425, + 181.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 180, + 181.33333333333331, + 425, + 231.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 243, + 505, + 299 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 244, + 504, + 255 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 504, + 255 + ], + "score": 1.0, + "content": "Figure 2: The concept for reconstructing clusters of unseen categories. The proposed approach", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 253, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 506, + 268 + ], + "score": 1.0, + "content": "follows the arrows in the counter-clockwise direction, which converts cross-task transfer learning to", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 266, + 505, + 278 + ], + "spans": [ + { + "bbox": [ + 106, + 266, + 505, + 278 + ], + "score": 1.0, + "content": "cross-domain transfer learning. The colors of dots represent data of different categories. The hollow", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 276, + 506, + 289 + ], + "spans": [ + { + "bbox": [ + 106, + 276, + 397, + 289 + ], + "score": 1.0, + "content": "circle and cross symbol represent similar and dissimilar data pairs. The", + "type": "text" + }, + { + "bbox": [ + 397, + 277, + 406, + 287 + ], + "score": 0.76, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 276, + 506, + 289 + ], + "score": 1.0, + "content": "function and the cluster", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 287, + 453, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 453, + 300 + ], + "score": 1.0, + "content": "reconstruction (via constrained clustering) are the two key components in the diagram.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 107, + 319, + 505, + 365 + ], + "lines": [ + { + "bbox": [ + 105, + 319, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 161, + 334 + ], + "score": 1.0, + "content": "By applying", + "type": "text" + }, + { + "bbox": [ + 161, + 320, + 171, + 330 + ], + "score": 0.81, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 319, + 186, + 334 + ], + "score": 1.0, + "content": "on", + "type": "text" + }, + { + "bbox": [ + 187, + 320, + 195, + 330 + ], + "score": 0.75, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 319, + 262, + 334 + ], + "score": 1.0, + "content": ", we can obtain", + "type": "text" + }, + { + "bbox": [ + 263, + 320, + 357, + 332 + ], + "score": 0.93, + "content": "G ( x _ { T , i } , x _ { T , j } ) = y _ { T , i , j }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 319, + 467, + 334 + ], + "score": 1.0, + "content": ". The last step is to infer", + "type": "text" + }, + { + "bbox": [ + 467, + 320, + 480, + 331 + ], + "score": 0.88, + "content": "Y _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 319, + 505, + 334 + ], + "score": 1.0, + "content": "from", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 330, + 506, + 346 + ], + "spans": [ + { + "bbox": [ + 107, + 331, + 181, + 344 + ], + "score": 0.91, + "content": "Y _ { T } ^ { R } = \\{ y _ { T , i , j } \\} _ { \\forall i , j }", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 330, + 506, + 346 + ], + "score": 1.0, + "content": ", which can be solved using constrained clustering algorithms. Note that since the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 342, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 132, + 356 + ], + "score": 1.0, + "content": "actual", + "type": "text" + }, + { + "bbox": [ + 132, + 344, + 145, + 354 + ], + "score": 0.86, + "content": "Y _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 342, + 505, + 356 + ], + "score": 1.0, + "content": "is unknown, the algorithm only infers the indices of categories, which could be in arbitrary", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 354, + 435, + 367 + ], + "spans": [ + { + "bbox": [ + 106, + 354, + 435, + 367 + ], + "score": 1.0, + "content": "order. The resulting clusters are expected to contain coherent semantic categories.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 107, + 370, + 505, + 426 + ], + "lines": [ + { + "bbox": [ + 106, + 370, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 106, + 370, + 505, + 383 + ], + "score": 1.0, + "content": "Transfer across domains: The problem setting we consider here is the same as unsupervised domain", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 382, + 504, + 393 + ], + "spans": [ + { + "bbox": [ + 106, + 382, + 504, + 393 + ], + "score": 1.0, + "content": "adaptation. Following the standard evaluation procedure (Long et al., 2017; Ganin et al., 2016), the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 392, + 505, + 404 + ], + "spans": [ + { + "bbox": [ + 106, + 392, + 173, + 404 + ], + "score": 1.0, + "content": "labeled datasets", + "type": "text" + }, + { + "bbox": [ + 173, + 393, + 182, + 403 + ], + "score": 0.77, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 392, + 253, + 404 + ], + "score": 1.0, + "content": "is ImageNet and", + "type": "text" + }, + { + "bbox": [ + 253, + 393, + 263, + 403 + ], + "score": 0.87, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 392, + 486, + 404 + ], + "score": 1.0, + "content": "is one domain in the Office-31 dataset. The unlabeled", + "type": "text" + }, + { + "bbox": [ + 486, + 393, + 495, + 403 + ], + "score": 0.84, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 392, + 505, + 404 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 403, + 506, + 416 + ], + "spans": [ + { + "bbox": [ + 106, + 403, + 436, + 416 + ], + "score": 1.0, + "content": "another domain in Office-31. The goal is to enhance classification performance on", + "type": "text" + }, + { + "bbox": [ + 436, + 404, + 444, + 414 + ], + "score": 0.81, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 403, + 494, + 416 + ], + "score": 1.0, + "content": "by utilizing", + "type": "text" + }, + { + "bbox": [ + 494, + 405, + 502, + 414 + ], + "score": 0.81, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 403, + 506, + 416 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 107, + 414, + 185, + 428 + ], + "spans": [ + { + "bbox": [ + 107, + 415, + 117, + 425 + ], + "score": 0.86, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 414, + 138, + 428 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 138, + 415, + 146, + 425 + ], + "score": 0.81, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 414, + 185, + 428 + ], + "score": 1.0, + "content": "together.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14 + }, + { + "type": "title", + "bbox": [ + 107, + 443, + 379, + 455 + ], + "lines": [ + { + "bbox": [ + 104, + 441, + 380, + 458 + ], + "spans": [ + { + "bbox": [ + 104, + 441, + 380, + 458 + ], + "score": 1.0, + "content": "4 THE LEARNABLE CLUSTERING OBJECTIVE (LCO)", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 467, + 505, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 466, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 505, + 480 + ], + "score": 1.0, + "content": "The key to our approach is the design of a learning objective that can use (noisy) predicted pairwise", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 479, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 505, + 491 + ], + "score": 1.0, + "content": "similarities, and is inspired from constrained clustering which involves using pairwise information", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 490, + 506, + 502 + ], + "spans": [ + { + "bbox": [ + 106, + 490, + 506, + 502 + ], + "score": 1.0, + "content": "in the loss function. The pairwise information is called must-link/cannot-link constraints or simi-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 501, + 505, + 512 + ], + "spans": [ + { + "bbox": [ + 106, + 501, + 505, + 512 + ], + "score": 1.0, + "content": "lar/dissimilar pairs (we use the latter). Note that the information is binarized to one and zero for", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 511, + 271, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 271, + 525 + ], + "score": 1.0, + "content": "similar and dissimilar pairs, accordingly.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 528, + 505, + 617 + ], + "lines": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "score": 1.0, + "content": "Although many constrained clustering algorithms have been developed, few of them are scalable with", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 540, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 505, + 551 + ], + "score": 1.0, + "content": "respect to the number of pairwise relationships. Further, none of them can be easily integrated into", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 551, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 505, + 563 + ], + "score": 1.0, + "content": "deep neural networks. Inspired by the work of Hsu & Kira (2016), we construct a contrastive loss", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 561, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 506, + 574 + ], + "score": 1.0, + "content": "for clustering on the probability outputs of a softmax classifier. However, each output node does not", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 573, + 506, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 506, + 585 + ], + "score": 1.0, + "content": "have to map to a fixed category but instead each output node represents a probabilistic assignment of", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 583, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 596 + ], + "score": 1.0, + "content": "a data point to a cluster. The assignment between output nodes and clusters are formed stochastically", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 595, + 506, + 607 + ], + "spans": [ + { + "bbox": [ + 106, + 595, + 506, + 607 + ], + "score": 1.0, + "content": "during the optimization and is guided by the pairwise similarity. If there is a similar pair, their output", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 605, + 290, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 290, + 617 + ], + "score": 1.0, + "content": "distribution should be similar, and vice-versa.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 107, + 622, + 505, + 667 + ], + "lines": [ + { + "bbox": [ + 106, + 622, + 506, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 423, + 634 + ], + "score": 1.0, + "content": "Specifically, we use the pair-wise KL-divergence to evaluate the distance between", + "type": "text" + }, + { + "bbox": [ + 423, + 623, + 430, + 632 + ], + "score": 0.8, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 622, + 506, + 634 + ], + "score": 1.0, + "content": "cluster assignment", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 633, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 506, + 645 + ], + "score": 1.0, + "content": "distributions of two data instances, and use predicted similarity to construct the contrastive loss.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 642, + 506, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 642, + 189, + 658 + ], + "score": 1.0, + "content": "Given a pair of data", + "type": "text" + }, + { + "bbox": [ + 189, + 645, + 215, + 656 + ], + "score": 0.89, + "content": "x _ { p } , x _ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 642, + 440, + 658 + ], + "score": 1.0, + "content": ", their corresponding output distributions are defined as", + "type": "text" + }, + { + "bbox": [ + 441, + 644, + 487, + 657 + ], + "score": 0.93, + "content": "\\mathcal { P } = f ( x _ { p } )", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 642, + 506, + 658 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 655, + 448, + 668 + ], + "spans": [ + { + "bbox": [ + 107, + 655, + 153, + 668 + ], + "score": 0.93, + "content": "\\mathcal { Q } = f ( x _ { q } )", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 655, + 181, + 668 + ], + "score": 1.0, + "content": ", while", + "type": "text" + }, + { + "bbox": [ + 181, + 656, + 189, + 667 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 655, + 448, + 668 + ], + "score": 1.0, + "content": "is the neural network. The cost of a similar pair is described as :", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32.5 + }, + { + "type": "interline_equation", + "bbox": [ + 214, + 673, + 397, + 687 + ], + "lines": [ + { + "bbox": [ + 214, + 673, + 397, + 687 + ], + "spans": [ + { + "bbox": [ + 214, + 673, + 397, + 687 + ], + "score": 0.93, + "content": "\\mathcal { L } ( \\boldsymbol { x } _ { p } , \\boldsymbol { x } _ { q } ) ^ { + } = \\mathcal { D } _ { K L } ( \\mathcal { P } ^ { \\star } | | \\boldsymbol { \\mathcal { Q } } ) + \\mathcal { D } _ { K L } ( \\mathcal { Q } ^ { \\star } | | \\mathcal { P } )", + "type": "interline_equation", + "image_path": "43126e3207a3614b82cb0757e647c76f3175b51f2528f5306705302aa203b6ea.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 214, + 673, + 397, + 687 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 241, + 702, + 370, + 735 + ], + "lines": [ + { + "bbox": [ + 241, + 702, + 370, + 735 + ], + "spans": [ + { + "bbox": [ + 241, + 702, + 370, + 735 + ], + "score": 0.95, + "content": "\\mathcal { D } _ { K L } ( \\mathcal { P } ^ { \\star } | | \\mathcal { Q } ) = \\sum _ { c = 1 } ^ { k } p _ { c } l o g ( \\frac { p _ { c } } { q _ { c } } )", + "type": "interline_equation", + "image_path": "e92760371a7f6c535154e12438d4d96a95c16ec07580a674a153986b2223c479.jpg" + } + ] + } + ], + "index": 36.5, + "virtual_lines": [ + { + "bbox": [ + 241, + 702, + 370, + 718.5 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 241, + 718.5, + 370, + 735.0 + ], + "spans": [], + "index": 37 + } + ] + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 759 + ], + "lines": [] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 180, + 80, + 425, + 232 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 180, + 80, + 425, + 232 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 180, + 80, + 425, + 232 + ], + "spans": [ + { + "bbox": [ + 180, + 80, + 425, + 232 + ], + "score": 0.961, + "type": "image", + "image_path": "2b04f9cd1aa8b76244e957c10c6c523af984b0b1e4ea8542e4f1f432440b0e65.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 180, + 80, + 425, + 130.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 180, + 130.66666666666666, + 425, + 181.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 180, + 181.33333333333331, + 425, + 231.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 243, + 505, + 299 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 244, + 504, + 255 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 504, + 255 + ], + "score": 1.0, + "content": "Figure 2: The concept for reconstructing clusters of unseen categories. The proposed approach", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 253, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 506, + 268 + ], + "score": 1.0, + "content": "follows the arrows in the counter-clockwise direction, which converts cross-task transfer learning to", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 266, + 505, + 278 + ], + "spans": [ + { + "bbox": [ + 106, + 266, + 505, + 278 + ], + "score": 1.0, + "content": "cross-domain transfer learning. The colors of dots represent data of different categories. The hollow", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 276, + 506, + 289 + ], + "spans": [ + { + "bbox": [ + 106, + 276, + 397, + 289 + ], + "score": 1.0, + "content": "circle and cross symbol represent similar and dissimilar data pairs. The", + "type": "text" + }, + { + "bbox": [ + 397, + 277, + 406, + 287 + ], + "score": 0.76, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 276, + 506, + 289 + ], + "score": 1.0, + "content": "function and the cluster", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 287, + 453, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 453, + 300 + ], + "score": 1.0, + "content": "reconstruction (via constrained clustering) are the two key components in the diagram.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 107, + 319, + 505, + 365 + ], + "lines": [ + { + "bbox": [ + 105, + 319, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 161, + 334 + ], + "score": 1.0, + "content": "By applying", + "type": "text" + }, + { + "bbox": [ + 161, + 320, + 171, + 330 + ], + "score": 0.81, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 319, + 186, + 334 + ], + "score": 1.0, + "content": "on", + "type": "text" + }, + { + "bbox": [ + 187, + 320, + 195, + 330 + ], + "score": 0.75, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 319, + 262, + 334 + ], + "score": 1.0, + "content": ", we can obtain", + "type": "text" + }, + { + "bbox": [ + 263, + 320, + 357, + 332 + ], + "score": 0.93, + "content": "G ( x _ { T , i } , x _ { T , j } ) = y _ { T , i , j }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 319, + 467, + 334 + ], + "score": 1.0, + "content": ". The last step is to infer", + "type": "text" + }, + { + "bbox": [ + 467, + 320, + 480, + 331 + ], + "score": 0.88, + "content": "Y _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 319, + 505, + 334 + ], + "score": 1.0, + "content": "from", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 330, + 506, + 346 + ], + "spans": [ + { + "bbox": [ + 107, + 331, + 181, + 344 + ], + "score": 0.91, + "content": "Y _ { T } ^ { R } = \\{ y _ { T , i , j } \\} _ { \\forall i , j }", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 330, + 506, + 346 + ], + "score": 1.0, + "content": ", which can be solved using constrained clustering algorithms. Note that since the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 342, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 132, + 356 + ], + "score": 1.0, + "content": "actual", + "type": "text" + }, + { + "bbox": [ + 132, + 344, + 145, + 354 + ], + "score": 0.86, + "content": "Y _ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 342, + 505, + 356 + ], + "score": 1.0, + "content": "is unknown, the algorithm only infers the indices of categories, which could be in arbitrary", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 354, + 435, + 367 + ], + "spans": [ + { + "bbox": [ + 106, + 354, + 435, + 367 + ], + "score": 1.0, + "content": "order. The resulting clusters are expected to contain coherent semantic categories.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 319, + 506, + 367 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 370, + 505, + 426 + ], + "lines": [ + { + "bbox": [ + 106, + 370, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 106, + 370, + 505, + 383 + ], + "score": 1.0, + "content": "Transfer across domains: The problem setting we consider here is the same as unsupervised domain", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 382, + 504, + 393 + ], + "spans": [ + { + "bbox": [ + 106, + 382, + 504, + 393 + ], + "score": 1.0, + "content": "adaptation. Following the standard evaluation procedure (Long et al., 2017; Ganin et al., 2016), the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 392, + 505, + 404 + ], + "spans": [ + { + "bbox": [ + 106, + 392, + 173, + 404 + ], + "score": 1.0, + "content": "labeled datasets", + "type": "text" + }, + { + "bbox": [ + 173, + 393, + 182, + 403 + ], + "score": 0.77, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 392, + 253, + 404 + ], + "score": 1.0, + "content": "is ImageNet and", + "type": "text" + }, + { + "bbox": [ + 253, + 393, + 263, + 403 + ], + "score": 0.87, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 392, + 486, + 404 + ], + "score": 1.0, + "content": "is one domain in the Office-31 dataset. The unlabeled", + "type": "text" + }, + { + "bbox": [ + 486, + 393, + 495, + 403 + ], + "score": 0.84, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 392, + 505, + 404 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 403, + 506, + 416 + ], + "spans": [ + { + "bbox": [ + 106, + 403, + 436, + 416 + ], + "score": 1.0, + "content": "another domain in Office-31. The goal is to enhance classification performance on", + "type": "text" + }, + { + "bbox": [ + 436, + 404, + 444, + 414 + ], + "score": 0.81, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 403, + 494, + 416 + ], + "score": 1.0, + "content": "by utilizing", + "type": "text" + }, + { + "bbox": [ + 494, + 405, + 502, + 414 + ], + "score": 0.81, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 403, + 506, + 416 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 107, + 414, + 185, + 428 + ], + "spans": [ + { + "bbox": [ + 107, + 415, + 117, + 425 + ], + "score": 0.86, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 414, + 138, + 428 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 138, + 415, + 146, + 425 + ], + "score": 0.81, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 414, + 185, + 428 + ], + "score": 1.0, + "content": "together.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14, + "bbox_fs": [ + 106, + 370, + 506, + 428 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 443, + 379, + 455 + ], + "lines": [ + { + "bbox": [ + 104, + 441, + 380, + 458 + ], + "spans": [ + { + "bbox": [ + 104, + 441, + 380, + 458 + ], + "score": 1.0, + "content": "4 THE LEARNABLE CLUSTERING OBJECTIVE (LCO)", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 467, + 505, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 466, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 505, + 480 + ], + "score": 1.0, + "content": "The key to our approach is the design of a learning objective that can use (noisy) predicted pairwise", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 479, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 505, + 491 + ], + "score": 1.0, + "content": "similarities, and is inspired from constrained clustering which involves using pairwise information", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 490, + 506, + 502 + ], + "spans": [ + { + "bbox": [ + 106, + 490, + 506, + 502 + ], + "score": 1.0, + "content": "in the loss function. The pairwise information is called must-link/cannot-link constraints or simi-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 501, + 505, + 512 + ], + "spans": [ + { + "bbox": [ + 106, + 501, + 505, + 512 + ], + "score": 1.0, + "content": "lar/dissimilar pairs (we use the latter). Note that the information is binarized to one and zero for", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 511, + 271, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 271, + 525 + ], + "score": 1.0, + "content": "similar and dissimilar pairs, accordingly.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 466, + 506, + 525 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 528, + 505, + 617 + ], + "lines": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "score": 1.0, + "content": "Although many constrained clustering algorithms have been developed, few of them are scalable with", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 540, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 505, + 551 + ], + "score": 1.0, + "content": "respect to the number of pairwise relationships. Further, none of them can be easily integrated into", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 551, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 505, + 563 + ], + "score": 1.0, + "content": "deep neural networks. Inspired by the work of Hsu & Kira (2016), we construct a contrastive loss", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 561, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 506, + 574 + ], + "score": 1.0, + "content": "for clustering on the probability outputs of a softmax classifier. However, each output node does not", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 573, + 506, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 506, + 585 + ], + "score": 1.0, + "content": "have to map to a fixed category but instead each output node represents a probabilistic assignment of", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 583, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 596 + ], + "score": 1.0, + "content": "a data point to a cluster. The assignment between output nodes and clusters are formed stochastically", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 595, + 506, + 607 + ], + "spans": [ + { + "bbox": [ + 106, + 595, + 506, + 607 + ], + "score": 1.0, + "content": "during the optimization and is guided by the pairwise similarity. If there is a similar pair, their output", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 605, + 290, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 290, + 617 + ], + "score": 1.0, + "content": "distribution should be similar, and vice-versa.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 529, + 506, + 617 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 622, + 505, + 667 + ], + "lines": [ + { + "bbox": [ + 106, + 622, + 506, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 423, + 634 + ], + "score": 1.0, + "content": "Specifically, we use the pair-wise KL-divergence to evaluate the distance between", + "type": "text" + }, + { + "bbox": [ + 423, + 623, + 430, + 632 + ], + "score": 0.8, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 622, + 506, + 634 + ], + "score": 1.0, + "content": "cluster assignment", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 633, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 506, + 645 + ], + "score": 1.0, + "content": "distributions of two data instances, and use predicted similarity to construct the contrastive loss.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 642, + 506, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 642, + 189, + 658 + ], + "score": 1.0, + "content": "Given a pair of data", + "type": "text" + }, + { + "bbox": [ + 189, + 645, + 215, + 656 + ], + "score": 0.89, + "content": "x _ { p } , x _ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 642, + 440, + 658 + ], + "score": 1.0, + "content": ", their corresponding output distributions are defined as", + "type": "text" + }, + { + "bbox": [ + 441, + 644, + 487, + 657 + ], + "score": 0.93, + "content": "\\mathcal { P } = f ( x _ { p } )", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 642, + 506, + 658 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 655, + 448, + 668 + ], + "spans": [ + { + "bbox": [ + 107, + 655, + 153, + 668 + ], + "score": 0.93, + "content": "\\mathcal { Q } = f ( x _ { q } )", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 655, + 181, + 668 + ], + "score": 1.0, + "content": ", while", + "type": "text" + }, + { + "bbox": [ + 181, + 656, + 189, + 667 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 655, + 448, + 668 + ], + "score": 1.0, + "content": "is the neural network. The cost of a similar pair is described as :", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 622, + 506, + 668 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 214, + 673, + 397, + 687 + ], + "lines": [ + { + "bbox": [ + 214, + 673, + 397, + 687 + ], + "spans": [ + { + "bbox": [ + 214, + 673, + 397, + 687 + ], + "score": 0.93, + "content": "\\mathcal { L } ( \\boldsymbol { x } _ { p } , \\boldsymbol { x } _ { q } ) ^ { + } = \\mathcal { D } _ { K L } ( \\mathcal { P } ^ { \\star } | | \\boldsymbol { \\mathcal { Q } } ) + \\mathcal { D } _ { K L } ( \\mathcal { Q } ^ { \\star } | | \\mathcal { P } )", + "type": "interline_equation", + "image_path": "43126e3207a3614b82cb0757e647c76f3175b51f2528f5306705302aa203b6ea.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 214, + 673, + 397, + 687 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 241, + 702, + 370, + 735 + ], + "lines": [ + { + "bbox": [ + 241, + 702, + 370, + 735 + ], + "spans": [ + { + "bbox": [ + 241, + 702, + 370, + 735 + ], + "score": 0.95, + "content": "\\mathcal { D } _ { K L } ( \\mathcal { P } ^ { \\star } | | \\mathcal { Q } ) = \\sum _ { c = 1 } ^ { k } p _ { c } l o g ( \\frac { p _ { c } } { q _ { c } } )", + "type": "interline_equation", + "image_path": "e92760371a7f6c535154e12438d4d96a95c16ec07580a674a153986b2223c479.jpg" + } + ] + } + ], + "index": 36.5, + "virtual_lines": [ + { + "bbox": [ + 241, + 702, + 370, + 718.5 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 241, + 718.5, + 370, + 735.0 + ], + "spans": [], + "index": 37 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 87, + 504, + 137 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 87, + 504, + 137 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 87, + 504, + 137 + ], + "spans": [ + { + "bbox": [ + 108, + 87, + 504, + 137 + ], + "score": 0.95, + "type": "image", + "image_path": "b7321399ab1bca7f870eb89cd648d445662c407854095766daa46df0319beb58.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 87, + 504, + 103.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 103.66666666666667, + 504, + 120.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 120.33333333333334, + 504, + 137.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 182, + 148, + 428, + 160 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 182, + 147, + 428, + 162 + ], + "spans": [ + { + "bbox": [ + 182, + 147, + 376, + 162 + ], + "score": 1.0, + "content": "Figure 3: The similarity prediction network (the", + "type": "text" + }, + { + "bbox": [ + 377, + 149, + 386, + 158 + ], + "score": 0.69, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 147, + 428, + 162 + ], + "score": 1.0, + "content": "function).", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "text", + "bbox": [ + 107, + 180, + 506, + 214 + ], + "lines": [ + { + "bbox": [ + 105, + 179, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 179, + 144, + 194 + ], + "score": 1.0, + "content": "The cost", + "type": "text" + }, + { + "bbox": [ + 144, + 180, + 191, + 192 + ], + "score": 0.93, + "content": "\\mathcal { L } ( x _ { p } , x _ { q } ) ^ { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 179, + 271, + 194 + ], + "score": 1.0, + "content": "is symmetric w.r.t.", + "type": "text" + }, + { + "bbox": [ + 272, + 183, + 298, + 192 + ], + "score": 0.87, + "content": "x _ { p } , x _ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 179, + 340, + 194 + ], + "score": 1.0, + "content": ", in which", + "type": "text" + }, + { + "bbox": [ + 340, + 181, + 354, + 191 + ], + "score": 0.88, + "content": "{ \\mathcal { P } } ^ { \\star }", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 179, + 373, + 194 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 373, + 181, + 387, + 191 + ], + "score": 0.88, + "content": "\\mathcal { Q } ^ { \\star }", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 179, + 506, + 194 + ], + "score": 1.0, + "content": "are alternatively assumed to", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 190, + 506, + 204 + ], + "spans": [ + { + "bbox": [ + 105, + 190, + 269, + 204 + ], + "score": 1.0, + "content": "be constant. Each KL-divergence factor", + "type": "text" + }, + { + "bbox": [ + 269, + 191, + 325, + 203 + ], + "score": 0.93, + "content": "\\hat { \\mathcal { D } } _ { K L } ^ { \\star } ( \\hat { \\mathcal { P } } ^ { \\star } | | \\mathcal { Q } )", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 190, + 506, + 204 + ], + "score": 1.0, + "content": "becomes a unary function whose gradient is", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 201, + 221, + 215 + ], + "spans": [ + { + "bbox": [ + 105, + 201, + 136, + 215 + ], + "score": 1.0, + "content": "simply", + "type": "text" + }, + { + "bbox": [ + 136, + 202, + 217, + 215 + ], + "score": 0.92, + "content": "\\partial { \\cal D } _ { K L } ( { \\mathcal { P } } ^ { \\star } | | { \\mathcal { Q } } ) / \\partial { \\mathcal { Q } }", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 201, + 221, + 215 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 104, + 219, + 505, + 241 + ], + "lines": [ + { + "bbox": [ + 105, + 219, + 506, + 232 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 115, + 232 + ], + "score": 1.0, + "content": "If", + "type": "text" + }, + { + "bbox": [ + 116, + 221, + 142, + 232 + ], + "score": 0.87, + "content": "x _ { p } , x _ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 219, + 506, + 232 + ], + "score": 1.0, + "content": "comes from a pair which is dissimilar, their output distributions are expected to be different,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 230, + 292, + 242 + ], + "spans": [ + { + "bbox": [ + 105, + 230, + 292, + 242 + ], + "score": 1.0, + "content": "which can be defined as a hinge-loss function:", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "interline_equation", + "bbox": [ + 183, + 246, + 428, + 261 + ], + "lines": [ + { + "bbox": [ + 183, + 246, + 428, + 261 + ], + "spans": [ + { + "bbox": [ + 183, + 246, + 428, + 261 + ], + "score": 0.87, + "content": "\\mathcal { L } ( \\boldsymbol { x } _ { p } , \\boldsymbol { x } _ { q } ) ^ { - } = L _ { h } ( \\mathcal { D } _ { K L } ( \\mathcal { P } ^ { \\star } | | \\boldsymbol { \\mathcal { Q } } ) , \\boldsymbol { \\sigma } ) + L _ { h } ( \\mathcal { D } _ { K L } ( \\mathcal { Q } ^ { \\star } | | \\mathcal { P } ) , \\boldsymbol { \\sigma } )", + "type": "interline_equation", + "image_path": "51ccf19abcaebb370f91fd57f44f84142543d559f1a6e585eb5f7e9a8a2b8135.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 183, + 246, + 428, + 261 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 250, + 276, + 361, + 289 + ], + "lines": [ + { + "bbox": [ + 250, + 276, + 361, + 289 + ], + "spans": [ + { + "bbox": [ + 250, + 276, + 361, + 289 + ], + "score": 0.92, + "content": "L _ { h } ( e , \\sigma ) = m a x ( 0 , \\sigma - e )", + "type": "interline_equation", + "image_path": "932eafed8b20b7e34e4d9da7e6abb747c2e87c7130ec49c672fa75935d5f6b54.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 250, + 276, + 361, + 289 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 292, + 505, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 291, + 506, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 330, + 306 + ], + "score": 1.0, + "content": "Given a pair of data with similarity prediction function", + "type": "text" + }, + { + "bbox": [ + 331, + 291, + 408, + 304 + ], + "score": 0.92, + "content": "G ( x _ { p } , x _ { q } ) \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 291, + 506, + 306 + ], + "score": 1.0, + "content": ", which is introduced in", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 302, + 506, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 506, + 315 + ], + "score": 1.0, + "content": "section 3, the total loss can be defined as a contrastive loss (where we use integer 1 to represent a", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 313, + 162, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 162, + 327 + ], + "score": 1.0, + "content": "similar pair):", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12 + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 330, + 438, + 345 + ], + "lines": [ + { + "bbox": [ + 172, + 330, + 438, + 345 + ], + "spans": [ + { + "bbox": [ + 172, + 330, + 438, + 345 + ], + "score": 0.89, + "content": "\\mathcal { L } ( x _ { p } , x _ { q } ) = G ( x _ { p } , x _ { q } ) \\mathcal { L } ( x _ { p } , x _ { q } ) ^ { + } + ( 1 - G ( x _ { p } , x _ { q } ) ) \\mathcal { L } ( x _ { p } , x _ { q } ) ^ { - }", + "type": "interline_equation", + "image_path": "557947567cc8ebcd6b5062b9e15b936183c860874dd1e623234b5a2b028ebed7.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 172, + 330, + 438, + 345 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 349, + 505, + 416 + ], + "lines": [ + { + "bbox": [ + 106, + 350, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 106, + 350, + 275, + 361 + ], + "score": 1.0, + "content": "We refer to equation 5 as LCO. Function", + "type": "text" + }, + { + "bbox": [ + 275, + 350, + 284, + 360 + ], + "score": 0.84, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 350, + 505, + 361 + ], + "score": 1.0, + "content": "is the learnable part that utilizes prior knowledge and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 361, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 240, + 372 + ], + "score": 1.0, + "content": "is trained with auxiliary dataset", + "type": "text" + }, + { + "bbox": [ + 240, + 361, + 249, + 370 + ], + "score": 0.77, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 361, + 505, + 372 + ], + "score": 1.0, + "content": "before optimizing LCO. Two particular characteristics of the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 371, + 506, + 384 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 506, + 384 + ], + "score": 1.0, + "content": "clustering criterion are worth mentioning: (1) There is no need to define cluster centers. (2) There", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 382, + 505, + 395 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 505, + 395 + ], + "score": 1.0, + "content": "is no predefined metric applied on the feature representation. Instead, the divergence is calculated", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 392, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 505, + 407 + ], + "score": 1.0, + "content": "directly on the cluster assignment; therefore, both feature representation and clustering are jointly", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 405, + 383, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 383, + 417 + ], + "score": 1.0, + "content": "optimized using back-propagation through the deep neural networks.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5 + }, + { + "type": "title", + "bbox": [ + 106, + 429, + 350, + 441 + ], + "lines": [ + { + "bbox": [ + 105, + 428, + 352, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 352, + 442 + ], + "score": 1.0, + "content": "4.1 THE PAIRWISE SIMILARITY PREDICTION NETWORK", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 107, + 450, + 505, + 560 + ], + "lines": [ + { + "bbox": [ + 106, + 450, + 505, + 462 + ], + "spans": [ + { + "bbox": [ + 106, + 450, + 262, + 462 + ], + "score": 1.0, + "content": "Although there is no restriction of how", + "type": "text" + }, + { + "bbox": [ + 262, + 451, + 271, + 460 + ], + "score": 0.79, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 450, + 505, + 462 + ], + "score": 1.0, + "content": "should be constructed, we choose deep convolution neural", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 461, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 505, + 473 + ], + "score": 1.0, + "content": "networks due to their efficiency in vision tasks. We design a network architecture inspired from", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 471, + 506, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 506, + 484 + ], + "score": 1.0, + "content": "Zagoruyko & Komodakis (2015). While they use it to predict image patch similarity, we use it to", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 483, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 506, + 495 + ], + "score": 1.0, + "content": "predict image-level semantic similarity. However, the Siamese architecture used in Zagoruyko &", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 493, + 506, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 493, + 506, + 506 + ], + "score": 1.0, + "content": "Komodakis (2015) is not efficient in both training and inference, especially when pairwise information", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 505, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 506, + 518 + ], + "score": 1.0, + "content": "is dense. Therefore, instead of using Siamese architecture, we keep the single column backbone but", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 515, + 506, + 528 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 506, + 528 + ], + "score": 1.0, + "content": "add a pair-enumeration layer on top of the feature extraction network. The pair-enumeration layer", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 527, + 506, + 539 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 506, + 539 + ], + "score": 1.0, + "content": "enumerates all pairs of feature vectors within a mini-batch and concatenates the features. Suppose", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 538, + 505, + 549 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 199, + 549 + ], + "score": 1.0, + "content": "the input of the layer is", + "type": "text" + }, + { + "bbox": [ + 199, + 538, + 238, + 548 + ], + "score": 0.91, + "content": "1 0 \\times 5 1 2", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 538, + 505, + 549 + ], + "score": 1.0, + "content": "with the mini-batch size 10 and the feature dimension 512; then the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 549, + 417, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 283, + 561 + ], + "score": 1.0, + "content": "output of the pair-enumeration layer will be", + "type": "text" + }, + { + "bbox": [ + 283, + 549, + 332, + 559 + ], + "score": 0.9, + "content": "1 0 0 \\times 1 0 2 4", + "type": "inline_equation" + }, + { + "bbox": [ + 332, + 549, + 417, + 561 + ], + "score": 1.0, + "content": "(self-pairs included).", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 107, + 565, + 505, + 664 + ], + "lines": [ + { + "bbox": [ + 106, + 566, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 566, + 505, + 578 + ], + "score": 1.0, + "content": "The architecture is illustrated in figure 3. We add one hidden fully connected layer on top of the", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 577, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 577, + 505, + 588 + ], + "score": 1.0, + "content": "enumeration layer and a binary classifier at the end. We use the standard cross-entropy loss and train", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 587, + 506, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 506, + 601 + ], + "score": 1.0, + "content": "it end-to-end. The supervision for training was obtained by converting the ground-truth category", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 598, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 505, + 611 + ], + "score": 1.0, + "content": "labels into binary similarity, i.e., if two samples are from the same class then their label will be", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 610, + 505, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 610, + 505, + 621 + ], + "score": 1.0, + "content": "similar, otherwise dissimilar. The inference is also end-to-end, and it outputs predictions among all", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 620, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 333, + 633 + ], + "score": 1.0, + "content": "similarity pairs in a mini-batch. The output probability", + "type": "text" + }, + { + "bbox": [ + 334, + 620, + 373, + 632 + ], + "score": 0.92, + "content": "g \\in [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 621, + 505, + 633 + ], + "score": 1.0, + "content": "with 1 means more similar. We", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 631, + 504, + 643 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 140, + 643 + ], + "score": 1.0, + "content": "binarize", + "type": "text" + }, + { + "bbox": [ + 141, + 633, + 147, + 643 + ], + "score": 0.79, + "content": "g", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 631, + 504, + 643 + ], + "score": 1.0, + "content": "at 0.5 to obtain discrete similarity predictions. In the following sections, we simplified the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 642, + 506, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 642, + 338, + 655 + ], + "score": 1.0, + "content": "notation of the pairwise similarity prediction network as", + "type": "text" + }, + { + "bbox": [ + 338, + 643, + 347, + 652 + ], + "score": 0.77, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 642, + 376, + 655 + ], + "score": 1.0, + "content": ". Once", + "type": "text" + }, + { + "bbox": [ + 376, + 643, + 385, + 652 + ], + "score": 0.81, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 642, + 506, + 655 + ], + "score": 1.0, + "content": "is learned, it then works as a", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 654, + 245, + 666 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 245, + 666 + ], + "score": 1.0, + "content": "static function in our experiments.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 36 + }, + { + "type": "title", + "bbox": [ + 108, + 679, + 410, + 689 + ], + "lines": [ + { + "bbox": [ + 106, + 678, + 411, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 411, + 690 + ], + "score": 1.0, + "content": "4.2 THE OBJECTIVE FUNCTION WITH DENSE SIMILARITY PREDICTION", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 108, + 698, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 409, + 711 + ], + "score": 1.0, + "content": "Since the pairwise prediction of a mini-batch can be densely obtained from", + "type": "text" + }, + { + "bbox": [ + 409, + 699, + 419, + 709 + ], + "score": 0.81, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 699, + 505, + 711 + ], + "score": 1.0, + "content": ", to efficiently utilize", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "the pair-wise information without forwarding each data multiple times we also combine the pair-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "enumeration layer described in section 4.1 with equation 5. In this case, the outputs of softmax are", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 87, + 504, + 137 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 87, + 504, + 137 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 87, + 504, + 137 + ], + "spans": [ + { + "bbox": [ + 108, + 87, + 504, + 137 + ], + "score": 0.95, + "type": "image", + "image_path": "b7321399ab1bca7f870eb89cd648d445662c407854095766daa46df0319beb58.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 87, + 504, + 103.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 103.66666666666667, + 504, + 120.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 120.33333333333334, + 504, + 137.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 182, + 148, + 428, + 160 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 182, + 147, + 428, + 162 + ], + "spans": [ + { + "bbox": [ + 182, + 147, + 376, + 162 + ], + "score": 1.0, + "content": "Figure 3: The similarity prediction network (the", + "type": "text" + }, + { + "bbox": [ + 377, + 149, + 386, + 158 + ], + "score": 0.69, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 147, + 428, + 162 + ], + "score": 1.0, + "content": "function).", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "text", + "bbox": [ + 107, + 180, + 506, + 214 + ], + "lines": [ + { + "bbox": [ + 105, + 179, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 179, + 144, + 194 + ], + "score": 1.0, + "content": "The cost", + "type": "text" + }, + { + "bbox": [ + 144, + 180, + 191, + 192 + ], + "score": 0.93, + "content": "\\mathcal { L } ( x _ { p } , x _ { q } ) ^ { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 179, + 271, + 194 + ], + "score": 1.0, + "content": "is symmetric w.r.t.", + "type": "text" + }, + { + "bbox": [ + 272, + 183, + 298, + 192 + ], + "score": 0.87, + "content": "x _ { p } , x _ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 179, + 340, + 194 + ], + "score": 1.0, + "content": ", in which", + "type": "text" + }, + { + "bbox": [ + 340, + 181, + 354, + 191 + ], + "score": 0.88, + "content": "{ \\mathcal { P } } ^ { \\star }", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 179, + 373, + 194 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 373, + 181, + 387, + 191 + ], + "score": 0.88, + "content": "\\mathcal { Q } ^ { \\star }", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 179, + 506, + 194 + ], + "score": 1.0, + "content": "are alternatively assumed to", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 190, + 506, + 204 + ], + "spans": [ + { + "bbox": [ + 105, + 190, + 269, + 204 + ], + "score": 1.0, + "content": "be constant. Each KL-divergence factor", + "type": "text" + }, + { + "bbox": [ + 269, + 191, + 325, + 203 + ], + "score": 0.93, + "content": "\\hat { \\mathcal { D } } _ { K L } ^ { \\star } ( \\hat { \\mathcal { P } } ^ { \\star } | | \\mathcal { Q } )", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 190, + 506, + 204 + ], + "score": 1.0, + "content": "becomes a unary function whose gradient is", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 201, + 221, + 215 + ], + "spans": [ + { + "bbox": [ + 105, + 201, + 136, + 215 + ], + "score": 1.0, + "content": "simply", + "type": "text" + }, + { + "bbox": [ + 136, + 202, + 217, + 215 + ], + "score": 0.92, + "content": "\\partial { \\cal D } _ { K L } ( { \\mathcal { P } } ^ { \\star } | | { \\mathcal { Q } } ) / \\partial { \\mathcal { Q } }", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 201, + 221, + 215 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 179, + 506, + 215 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 219, + 505, + 241 + ], + "lines": [ + { + "bbox": [ + 105, + 219, + 506, + 232 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 115, + 232 + ], + "score": 1.0, + "content": "If", + "type": "text" + }, + { + "bbox": [ + 116, + 221, + 142, + 232 + ], + "score": 0.87, + "content": "x _ { p } , x _ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 219, + 506, + 232 + ], + "score": 1.0, + "content": "comes from a pair which is dissimilar, their output distributions are expected to be different,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 230, + 292, + 242 + ], + "spans": [ + { + "bbox": [ + 105, + 230, + 292, + 242 + ], + "score": 1.0, + "content": "which can be defined as a hinge-loss function:", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 219, + 506, + 242 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 183, + 246, + 428, + 261 + ], + "lines": [ + { + "bbox": [ + 183, + 246, + 428, + 261 + ], + "spans": [ + { + "bbox": [ + 183, + 246, + 428, + 261 + ], + "score": 0.87, + "content": "\\mathcal { L } ( \\boldsymbol { x } _ { p } , \\boldsymbol { x } _ { q } ) ^ { - } = L _ { h } ( \\mathcal { D } _ { K L } ( \\mathcal { P } ^ { \\star } | | \\boldsymbol { \\mathcal { Q } } ) , \\boldsymbol { \\sigma } ) + L _ { h } ( \\mathcal { D } _ { K L } ( \\mathcal { Q } ^ { \\star } | | \\mathcal { P } ) , \\boldsymbol { \\sigma } )", + "type": "interline_equation", + "image_path": "51ccf19abcaebb370f91fd57f44f84142543d559f1a6e585eb5f7e9a8a2b8135.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 183, + 246, + 428, + 261 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 250, + 276, + 361, + 289 + ], + "lines": [ + { + "bbox": [ + 250, + 276, + 361, + 289 + ], + "spans": [ + { + "bbox": [ + 250, + 276, + 361, + 289 + ], + "score": 0.92, + "content": "L _ { h } ( e , \\sigma ) = m a x ( 0 , \\sigma - e )", + "type": "interline_equation", + "image_path": "932eafed8b20b7e34e4d9da7e6abb747c2e87c7130ec49c672fa75935d5f6b54.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 250, + 276, + 361, + 289 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 292, + 505, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 291, + 506, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 330, + 306 + ], + "score": 1.0, + "content": "Given a pair of data with similarity prediction function", + "type": "text" + }, + { + "bbox": [ + 331, + 291, + 408, + 304 + ], + "score": 0.92, + "content": "G ( x _ { p } , x _ { q } ) \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 291, + 506, + 306 + ], + "score": 1.0, + "content": ", which is introduced in", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 302, + 506, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 506, + 315 + ], + "score": 1.0, + "content": "section 3, the total loss can be defined as a contrastive loss (where we use integer 1 to represent a", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 313, + 162, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 162, + 327 + ], + "score": 1.0, + "content": "similar pair):", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 291, + 506, + 327 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 330, + 438, + 345 + ], + "lines": [ + { + "bbox": [ + 172, + 330, + 438, + 345 + ], + "spans": [ + { + "bbox": [ + 172, + 330, + 438, + 345 + ], + "score": 0.89, + "content": "\\mathcal { L } ( x _ { p } , x _ { q } ) = G ( x _ { p } , x _ { q } ) \\mathcal { L } ( x _ { p } , x _ { q } ) ^ { + } + ( 1 - G ( x _ { p } , x _ { q } ) ) \\mathcal { L } ( x _ { p } , x _ { q } ) ^ { - }", + "type": "interline_equation", + "image_path": "557947567cc8ebcd6b5062b9e15b936183c860874dd1e623234b5a2b028ebed7.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 172, + 330, + 438, + 345 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 349, + 505, + 416 + ], + "lines": [ + { + "bbox": [ + 106, + 350, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 106, + 350, + 275, + 361 + ], + "score": 1.0, + "content": "We refer to equation 5 as LCO. Function", + "type": "text" + }, + { + "bbox": [ + 275, + 350, + 284, + 360 + ], + "score": 0.84, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 350, + 505, + 361 + ], + "score": 1.0, + "content": "is the learnable part that utilizes prior knowledge and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 361, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 240, + 372 + ], + "score": 1.0, + "content": "is trained with auxiliary dataset", + "type": "text" + }, + { + "bbox": [ + 240, + 361, + 249, + 370 + ], + "score": 0.77, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 361, + 505, + 372 + ], + "score": 1.0, + "content": "before optimizing LCO. Two particular characteristics of the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 371, + 506, + 384 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 506, + 384 + ], + "score": 1.0, + "content": "clustering criterion are worth mentioning: (1) There is no need to define cluster centers. (2) There", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 382, + 505, + 395 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 505, + 395 + ], + "score": 1.0, + "content": "is no predefined metric applied on the feature representation. Instead, the divergence is calculated", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 392, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 505, + 407 + ], + "score": 1.0, + "content": "directly on the cluster assignment; therefore, both feature representation and clustering are jointly", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 405, + 383, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 383, + 417 + ], + "score": 1.0, + "content": "optimized using back-propagation through the deep neural networks.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 350, + 506, + 417 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 429, + 350, + 441 + ], + "lines": [ + { + "bbox": [ + 105, + 428, + 352, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 352, + 442 + ], + "score": 1.0, + "content": "4.1 THE PAIRWISE SIMILARITY PREDICTION NETWORK", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 107, + 450, + 505, + 560 + ], + "lines": [ + { + "bbox": [ + 106, + 450, + 505, + 462 + ], + "spans": [ + { + "bbox": [ + 106, + 450, + 262, + 462 + ], + "score": 1.0, + "content": "Although there is no restriction of how", + "type": "text" + }, + { + "bbox": [ + 262, + 451, + 271, + 460 + ], + "score": 0.79, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 450, + 505, + 462 + ], + "score": 1.0, + "content": "should be constructed, we choose deep convolution neural", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 461, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 505, + 473 + ], + "score": 1.0, + "content": "networks due to their efficiency in vision tasks. We design a network architecture inspired from", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 471, + 506, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 506, + 484 + ], + "score": 1.0, + "content": "Zagoruyko & Komodakis (2015). While they use it to predict image patch similarity, we use it to", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 483, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 506, + 495 + ], + "score": 1.0, + "content": "predict image-level semantic similarity. However, the Siamese architecture used in Zagoruyko &", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 493, + 506, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 493, + 506, + 506 + ], + "score": 1.0, + "content": "Komodakis (2015) is not efficient in both training and inference, especially when pairwise information", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 505, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 506, + 518 + ], + "score": 1.0, + "content": "is dense. Therefore, instead of using Siamese architecture, we keep the single column backbone but", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 515, + 506, + 528 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 506, + 528 + ], + "score": 1.0, + "content": "add a pair-enumeration layer on top of the feature extraction network. The pair-enumeration layer", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 527, + 506, + 539 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 506, + 539 + ], + "score": 1.0, + "content": "enumerates all pairs of feature vectors within a mini-batch and concatenates the features. Suppose", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 538, + 505, + 549 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 199, + 549 + ], + "score": 1.0, + "content": "the input of the layer is", + "type": "text" + }, + { + "bbox": [ + 199, + 538, + 238, + 548 + ], + "score": 0.91, + "content": "1 0 \\times 5 1 2", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 538, + 505, + 549 + ], + "score": 1.0, + "content": "with the mini-batch size 10 and the feature dimension 512; then the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 549, + 417, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 283, + 561 + ], + "score": 1.0, + "content": "output of the pair-enumeration layer will be", + "type": "text" + }, + { + "bbox": [ + 283, + 549, + 332, + 559 + ], + "score": 0.9, + "content": "1 0 0 \\times 1 0 2 4", + "type": "inline_equation" + }, + { + "bbox": [ + 332, + 549, + 417, + 561 + ], + "score": 1.0, + "content": "(self-pairs included).", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 450, + 506, + 561 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 565, + 505, + 664 + ], + "lines": [ + { + "bbox": [ + 106, + 566, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 566, + 505, + 578 + ], + "score": 1.0, + "content": "The architecture is illustrated in figure 3. We add one hidden fully connected layer on top of the", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 577, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 577, + 505, + 588 + ], + "score": 1.0, + "content": "enumeration layer and a binary classifier at the end. We use the standard cross-entropy loss and train", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 587, + 506, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 506, + 601 + ], + "score": 1.0, + "content": "it end-to-end. The supervision for training was obtained by converting the ground-truth category", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 598, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 505, + 611 + ], + "score": 1.0, + "content": "labels into binary similarity, i.e., if two samples are from the same class then their label will be", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 610, + 505, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 610, + 505, + 621 + ], + "score": 1.0, + "content": "similar, otherwise dissimilar. The inference is also end-to-end, and it outputs predictions among all", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 620, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 333, + 633 + ], + "score": 1.0, + "content": "similarity pairs in a mini-batch. The output probability", + "type": "text" + }, + { + "bbox": [ + 334, + 620, + 373, + 632 + ], + "score": 0.92, + "content": "g \\in [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 621, + 505, + 633 + ], + "score": 1.0, + "content": "with 1 means more similar. We", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 631, + 504, + 643 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 140, + 643 + ], + "score": 1.0, + "content": "binarize", + "type": "text" + }, + { + "bbox": [ + 141, + 633, + 147, + 643 + ], + "score": 0.79, + "content": "g", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 631, + 504, + 643 + ], + "score": 1.0, + "content": "at 0.5 to obtain discrete similarity predictions. In the following sections, we simplified the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 642, + 506, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 642, + 338, + 655 + ], + "score": 1.0, + "content": "notation of the pairwise similarity prediction network as", + "type": "text" + }, + { + "bbox": [ + 338, + 643, + 347, + 652 + ], + "score": 0.77, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 642, + 376, + 655 + ], + "score": 1.0, + "content": ". Once", + "type": "text" + }, + { + "bbox": [ + 376, + 643, + 385, + 652 + ], + "score": 0.81, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 642, + 506, + 655 + ], + "score": 1.0, + "content": "is learned, it then works as a", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 654, + 245, + 666 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 245, + 666 + ], + "score": 1.0, + "content": "static function in our experiments.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 566, + 506, + 666 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 679, + 410, + 689 + ], + "lines": [ + { + "bbox": [ + 106, + 678, + 411, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 411, + 690 + ], + "score": 1.0, + "content": "4.2 THE OBJECTIVE FUNCTION WITH DENSE SIMILARITY PREDICTION", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 108, + 698, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 409, + 711 + ], + "score": 1.0, + "content": "Since the pairwise prediction of a mini-batch can be densely obtained from", + "type": "text" + }, + { + "bbox": [ + 409, + 699, + 419, + 709 + ], + "score": 0.81, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 699, + 505, + 711 + ], + "score": 1.0, + "content": ", to efficiently utilize", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "the pair-wise information without forwarding each data multiple times we also combine the pair-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "enumeration layer described in section 4.1 with equation 5. In this case, the outputs of softmax are", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43, + "bbox_fs": [ + 105, + 699, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 81, + 502, + 147 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 81, + 502, + 147 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 81, + 502, + 147 + ], + "spans": [ + { + "bbox": [ + 109, + 81, + 502, + 147 + ], + "score": 0.954, + "type": "image", + "image_path": "6ee14a32f3d38107f344e558ad27ba8aa4c6dd2a6632d85ddac1a4bb2284c5fa.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 81, + 502, + 103.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 103.0, + 502, + 125.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 125.0, + 502, + 147.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 159, + 505, + 216 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 159, + 506, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 506, + 173 + ], + "score": 1.0, + "content": "Figure 4: The constrained clustering network (CCN) for transfer learning across tasks. The input is", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 171, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 192, + 183 + ], + "score": 1.0, + "content": "unlabeled target data", + "type": "text" + }, + { + "bbox": [ + 193, + 172, + 201, + 181 + ], + "score": 0.62, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 202, + 171, + 505, + 183 + ], + "score": 1.0, + "content": ". The cluster assignment block contains two fully connected layers and has", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 182, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 106, + 182, + 255, + 194 + ], + "score": 1.0, + "content": "the number of output nodes equal to", + "type": "text" + }, + { + "bbox": [ + 255, + 182, + 262, + 192 + ], + "score": 0.75, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 182, + 285, + 194 + ], + "score": 1.0, + "content": ". The", + "type": "text" + }, + { + "bbox": [ + 285, + 182, + 292, + 194 + ], + "score": 0.83, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 182, + 505, + 194 + ], + "score": 1.0, + "content": "described in section 4 is the backbone network plus", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 192, + 505, + 206 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 505, + 206 + ], + "score": 1.0, + "content": "the cluster assignment block. To optimize LCO, the full pipeline in the diagram is used. After the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 204, + 506, + 217 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 346, + 217 + ], + "score": 1.0, + "content": "optimization, it uses another forward propagation with only", + "type": "text" + }, + { + "bbox": [ + 347, + 204, + 354, + 215 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 204, + 506, + 217 + ], + "score": 1.0, + "content": "to obtain the final cluster assignment.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "image", + "bbox": [ + 113, + 223, + 502, + 309 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 113, + 223, + 502, + 309 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 113, + 223, + 502, + 309 + ], + "spans": [ + { + "bbox": [ + 113, + 223, + 502, + 309 + ], + "score": 0.965, + "type": "image", + "image_path": "480735bbbbbc31b0524612dd6b214d318a05c8bfdb6bc3ec5a4e395d164bbae6.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 113, + 223, + 502, + 251.66666666666666 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 113, + 251.66666666666666, + 502, + 280.3333333333333 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 113, + 280.3333333333333, + 502, + 309.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 322, + 505, + 357 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 322, + 506, + 335 + ], + "spans": [ + { + "bbox": [ + 106, + 322, + 445, + 335 + ], + "score": 1.0, + "content": "Figure 5: The network for transfer learning across domains. The input is the mix of", + "type": "text" + }, + { + "bbox": [ + 445, + 322, + 456, + 333 + ], + "score": 0.87, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 322, + 474, + 335 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 474, + 323, + 483, + 333 + ], + "score": 0.75, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 322, + 506, + 335 + ], + "score": 1.0, + "content": ". The", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 333, + 506, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 333, + 312, + 347 + ], + "score": 1.0, + "content": "architecture is a direct extension of CCN. We use", + "type": "text" + }, + { + "bbox": [ + 312, + 334, + 339, + 344 + ], + "score": 0.86, + "content": "\\mathrm { C C N ^ { + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 333, + 506, + 347 + ], + "score": 1.0, + "content": "to represent the mandatory parts (upper", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 345, + 506, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 345, + 245, + 357 + ], + "score": 1.0, + "content": "branch) which implements eq. (7).", + "type": "text" + }, + { + "bbox": [ + 246, + 345, + 276, + 355 + ], + "score": 0.86, + "content": "\\mathrm { C C N ^ { + + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 345, + 506, + 357 + ], + "score": 1.0, + "content": "includes the domain adaptation method (optional branch).", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 107, + 374, + 504, + 397 + ], + "lines": [ + { + "bbox": [ + 106, + 374, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 106, + 374, + 205, + 387 + ], + "score": 1.0, + "content": "enumerated in pairs. Let", + "type": "text" + }, + { + "bbox": [ + 205, + 375, + 215, + 384 + ], + "score": 0.79, + "content": "D", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 374, + 305, + 387 + ], + "score": 1.0, + "content": "be the set of all tuples", + "type": "text" + }, + { + "bbox": [ + 306, + 375, + 328, + 386 + ], + "score": 0.91, + "content": "( p , q )", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 374, + 356, + 387 + ], + "score": 1.0, + "content": ", while", + "type": "text" + }, + { + "bbox": [ + 356, + 377, + 363, + 386 + ], + "score": 0.81, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 374, + 380, + 387 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 380, + 376, + 387, + 386 + ], + "score": 0.8, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 374, + 505, + 387 + ], + "score": 1.0, + "content": "are the indices of a sample in", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 385, + 413, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 265, + 398 + ], + "score": 1.0, + "content": "a mini-batch. The dense clustering loss", + "type": "text" + }, + { + "bbox": [ + 265, + 386, + 278, + 396 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 385, + 413, + 398 + ], + "score": 1.0, + "content": "for a mini-batch is calculated by:", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "interline_equation", + "bbox": [ + 253, + 399, + 358, + 428 + ], + "lines": [ + { + "bbox": [ + 253, + 399, + 358, + 428 + ], + "spans": [ + { + "bbox": [ + 253, + 399, + 358, + 428 + ], + "score": 0.94, + "content": "\\mathcal { L } _ { d } = \\sum _ { \\forall ( p , q ) \\in D } \\mathcal { L } ( x _ { p } , x _ { q } ) .", + "type": "interline_equation", + "image_path": "2536ed3e74d2ee43afd3d960df5668474cec18206ed2d1958279712458d3e6d4.jpg" + } + ] + } + ], + "index": 16.5, + "virtual_lines": [ + { + "bbox": [ + 253, + 399, + 358, + 413.5 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 253, + 413.5, + 358, + 428.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 430, + 505, + 453 + ], + "lines": [ + { + "bbox": [ + 106, + 429, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 429, + 138, + 442 + ], + "score": 1.0, + "content": "We use", + "type": "text" + }, + { + "bbox": [ + 138, + 430, + 151, + 441 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 429, + 505, + 442 + ], + "score": 1.0, + "content": "standalone with deep neural networks to reconstruct semantic clusters and for transfer", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 441, + 503, + 454 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 503, + 454 + ], + "score": 1.0, + "content": "learning across tasks (figure 4). We call the architecture the constrained clustering network (CCN).", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "title", + "bbox": [ + 108, + 465, + 298, + 477 + ], + "lines": [ + { + "bbox": [ + 105, + 464, + 298, + 478 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 298, + 478 + ], + "score": 1.0, + "content": "4.3 COMBINING WITH OTHER OBJECTIVES", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 485, + 505, + 552 + ], + "lines": [ + { + "bbox": [ + 105, + 486, + 504, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 495, + 498 + ], + "score": 1.0, + "content": "In the cross-domain case, we additionally have labeled source data. This enables us to use LCO for", + "type": "text" + }, + { + "bbox": [ + 495, + 487, + 504, + 496 + ], + "score": 0.79, + "content": "T", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 244, + 509 + ], + "score": 1.0, + "content": "while using classification loss for", + "type": "text" + }, + { + "bbox": [ + 244, + 497, + 254, + 507 + ], + "score": 0.87, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 497, + 505, + 509 + ], + "score": 1.0, + "content": ". The overall training procedure is similar to previous domain", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 509, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 106, + 509, + 505, + 520 + ], + "score": 1.0, + "content": "adaptation approaches in that both source and target data are mixed in a mini-batch, but different", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 519, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 407, + 531 + ], + "score": 1.0, + "content": "losses are applied. We denote the source domain images in a mini-batch", + "type": "text" + }, + { + "bbox": [ + 408, + 519, + 414, + 529 + ], + "score": 0.75, + "content": "b", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 519, + 426, + 531 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 426, + 519, + 444, + 530 + ], + "score": 0.9, + "content": "X _ { b ^ { S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 519, + 505, + 531 + ], + "score": 1.0, + "content": "and the target", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 530, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 531, + 169, + 542 + ], + "score": 1.0, + "content": "domain images", + "type": "text" + }, + { + "bbox": [ + 169, + 530, + 187, + 541 + ], + "score": 0.9, + "content": "X _ { b ^ { T } }", + "type": "inline_equation" + }, + { + "bbox": [ + 188, + 531, + 291, + 542 + ], + "score": 1.0, + "content": "with its set of dense pairs", + "type": "text" + }, + { + "bbox": [ + 292, + 530, + 310, + 541 + ], + "score": 0.9, + "content": "D _ { b ^ { T } }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 531, + 385, + 542 + ], + "score": 1.0, + "content": ". The loss function", + "type": "text" + }, + { + "bbox": [ + 386, + 530, + 402, + 541 + ], + "score": 0.91, + "content": "\\mathcal { L } _ { c d }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 531, + 506, + 542 + ], + "score": 1.0, + "content": "for cross-domain transfer", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 541, + 277, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 541, + 277, + 552 + ], + "score": 1.0, + "content": "in a mini-batch can then be formulated as:", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 23.5 + }, + { + "type": "interline_equation", + "bbox": [ + 259, + 555, + 352, + 568 + ], + "lines": [ + { + "bbox": [ + 259, + 555, + 352, + 568 + ], + "spans": [ + { + "bbox": [ + 259, + 555, + 352, + 568 + ], + "score": 0.91, + "content": "\\mathcal { L } _ { c d } = \\mathcal { L } _ { c l s } + \\mathcal { L } _ { c l u s t e r }", + "type": "interline_equation", + "image_path": "70260d3727ed67e5a59fd974700b2ab49d04ad5b5e5cdc3ecf8874b45be70bd8.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 259, + 555, + 352, + 568 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 202, + 578, + 408, + 609 + ], + "lines": [ + { + "bbox": [ + 202, + 578, + 408, + 609 + ], + "spans": [ + { + "bbox": [ + 202, + 578, + 408, + 609 + ], + "score": 0.91, + "content": "\\mathcal { L } _ { c l s } = \\frac { 1 } { | b ^ { S } | } \\sum _ { \\forall x _ { i } \\in X _ { b } s } C r o s s E n t r o p y L o s s ( f ( x _ { i } ) ) .", + "type": "interline_equation", + "image_path": "c8faa5cd2cfb258d9ee286453aeb92b063fa9022dc543a5611e434e7dbd32356.jpg" + } + ] + } + ], + "index": 28.5, + "virtual_lines": [ + { + "bbox": [ + 202, + 578, + 408, + 593.5 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 202, + 593.5, + 408, + 609.0 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 227, + 611, + 383, + 642 + ], + "lines": [ + { + "bbox": [ + 227, + 611, + 383, + 642 + ], + "spans": [ + { + "bbox": [ + 227, + 611, + 383, + 642 + ], + "score": 0.92, + "content": "\\mathcal { L } _ { c l u s t e r } = \\frac { 1 } { | b ^ { T } | ^ { 2 } } \\sum _ { \\forall ( i , j ) \\in D _ { b ^ { T } } } \\mathcal { L } ( x _ { i } , x _ { j } ) .", + "type": "interline_equation", + "image_path": "56ffd6cf3c83633f9f743ca9c45f42e3446398e208b61a557a090c6441db0b55.jpg" + } + ] + } + ], + "index": 30.5, + "virtual_lines": [ + { + "bbox": [ + 227, + 611, + 383, + 626.5 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 227, + 626.5, + 383, + 642.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 643, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 104, + 642, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 104, + 642, + 124, + 657 + ], + "score": 1.0, + "content": "The", + "type": "text" + }, + { + "bbox": [ + 124, + 644, + 158, + 655 + ], + "score": 0.92, + "content": "\\mathcal { L } _ { c l u s t e r }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 642, + 176, + 657 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 176, + 644, + 194, + 655 + ], + "score": 0.93, + "content": "\\mathcal { L } _ { c l s }", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 642, + 345, + 657 + ], + "score": 1.0, + "content": "share the same outputs from network", + "type": "text" + }, + { + "bbox": [ + 345, + 644, + 352, + 655 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 642, + 396, + 657 + ], + "score": 1.0, + "content": ". Although", + "type": "text" + }, + { + "bbox": [ + 397, + 644, + 430, + 655 + ], + "score": 0.92, + "content": "\\mathcal { L } _ { c l u s t e r }", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 642, + 506, + 657 + ], + "score": 1.0, + "content": "does not force the", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 275, + 667 + ], + "score": 1.0, + "content": "mapping between clusters and categories,", + "type": "text" + }, + { + "bbox": [ + 275, + 655, + 293, + 666 + ], + "score": 0.91, + "content": "\\mathcal { L } _ { c l s }", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "does. Therefore the learned classifier can be applied", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "on target data directly and picks the maximum probability for the predicted class. Note that in our", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 678, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 505, + 689 + ], + "score": 1.0, + "content": "loss function, there is no term to explicitly match the feature distribution between source and target; it", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 688, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 506, + 700 + ], + "score": 1.0, + "content": "merely transfers more knowledge in the form of constraints to regularize the learning of the classifier.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 104, + 698, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 104, + 698, + 506, + 712 + ], + "score": 1.0, + "content": "There is also no requirement for the architecture to utilize hidden layers. Therefore our approach has", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "the large flexibility to be combined with other domain adaptation strategies. Figure 5 illustrates the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 720, + 392, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 159, + 733 + ], + "score": 1.0, + "content": "architectures", + "type": "text" + }, + { + "bbox": [ + 160, + 721, + 186, + 731 + ], + "score": 0.86, + "content": "\\mathrm { C C N ^ { + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 720, + 204, + 733 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 204, + 721, + 235, + 731 + ], + "score": 0.86, + "content": "\\mathrm { C C N ^ { + + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 720, + 392, + 733 + ], + "score": 1.0, + "content": "used in our cross-domain experiments.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 35.5 + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 310, + 761 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 310, + 761 + ], + "score": 1.0, + "content": "6", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 81, + 502, + 147 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 81, + 502, + 147 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 81, + 502, + 147 + ], + "spans": [ + { + "bbox": [ + 109, + 81, + 502, + 147 + ], + "score": 0.954, + "type": "image", + "image_path": "6ee14a32f3d38107f344e558ad27ba8aa4c6dd2a6632d85ddac1a4bb2284c5fa.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 81, + 502, + 103.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 103.0, + 502, + 125.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 125.0, + 502, + 147.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 159, + 505, + 216 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 159, + 506, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 506, + 173 + ], + "score": 1.0, + "content": "Figure 4: The constrained clustering network (CCN) for transfer learning across tasks. The input is", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 171, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 192, + 183 + ], + "score": 1.0, + "content": "unlabeled target data", + "type": "text" + }, + { + "bbox": [ + 193, + 172, + 201, + 181 + ], + "score": 0.62, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 202, + 171, + 505, + 183 + ], + "score": 1.0, + "content": ". The cluster assignment block contains two fully connected layers and has", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 182, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 106, + 182, + 255, + 194 + ], + "score": 1.0, + "content": "the number of output nodes equal to", + "type": "text" + }, + { + "bbox": [ + 255, + 182, + 262, + 192 + ], + "score": 0.75, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 182, + 285, + 194 + ], + "score": 1.0, + "content": ". The", + "type": "text" + }, + { + "bbox": [ + 285, + 182, + 292, + 194 + ], + "score": 0.83, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 182, + 505, + 194 + ], + "score": 1.0, + "content": "described in section 4 is the backbone network plus", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 192, + 505, + 206 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 505, + 206 + ], + "score": 1.0, + "content": "the cluster assignment block. To optimize LCO, the full pipeline in the diagram is used. After the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 204, + 506, + 217 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 346, + 217 + ], + "score": 1.0, + "content": "optimization, it uses another forward propagation with only", + "type": "text" + }, + { + "bbox": [ + 347, + 204, + 354, + 215 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 204, + 506, + 217 + ], + "score": 1.0, + "content": "to obtain the final cluster assignment.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "image", + "bbox": [ + 113, + 223, + 502, + 309 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 113, + 223, + 502, + 309 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 113, + 223, + 502, + 309 + ], + "spans": [ + { + "bbox": [ + 113, + 223, + 502, + 309 + ], + "score": 0.965, + "type": "image", + "image_path": "480735bbbbbc31b0524612dd6b214d318a05c8bfdb6bc3ec5a4e395d164bbae6.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 113, + 223, + 502, + 251.66666666666666 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 113, + 251.66666666666666, + 502, + 280.3333333333333 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 113, + 280.3333333333333, + 502, + 309.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 322, + 505, + 357 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 322, + 506, + 335 + ], + "spans": [ + { + "bbox": [ + 106, + 322, + 445, + 335 + ], + "score": 1.0, + "content": "Figure 5: The network for transfer learning across domains. The input is the mix of", + "type": "text" + }, + { + "bbox": [ + 445, + 322, + 456, + 333 + ], + "score": 0.87, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 322, + 474, + 335 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 474, + 323, + 483, + 333 + ], + "score": 0.75, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 322, + 506, + 335 + ], + "score": 1.0, + "content": ". The", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 333, + 506, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 333, + 312, + 347 + ], + "score": 1.0, + "content": "architecture is a direct extension of CCN. We use", + "type": "text" + }, + { + "bbox": [ + 312, + 334, + 339, + 344 + ], + "score": 0.86, + "content": "\\mathrm { C C N ^ { + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 333, + 506, + 347 + ], + "score": 1.0, + "content": "to represent the mandatory parts (upper", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 345, + 506, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 345, + 245, + 357 + ], + "score": 1.0, + "content": "branch) which implements eq. (7).", + "type": "text" + }, + { + "bbox": [ + 246, + 345, + 276, + 355 + ], + "score": 0.86, + "content": "\\mathrm { C C N ^ { + + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 345, + 506, + 357 + ], + "score": 1.0, + "content": "includes the domain adaptation method (optional branch).", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 107, + 374, + 504, + 397 + ], + "lines": [ + { + "bbox": [ + 106, + 374, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 106, + 374, + 205, + 387 + ], + "score": 1.0, + "content": "enumerated in pairs. Let", + "type": "text" + }, + { + "bbox": [ + 205, + 375, + 215, + 384 + ], + "score": 0.79, + "content": "D", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 374, + 305, + 387 + ], + "score": 1.0, + "content": "be the set of all tuples", + "type": "text" + }, + { + "bbox": [ + 306, + 375, + 328, + 386 + ], + "score": 0.91, + "content": "( p , q )", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 374, + 356, + 387 + ], + "score": 1.0, + "content": ", while", + "type": "text" + }, + { + "bbox": [ + 356, + 377, + 363, + 386 + ], + "score": 0.81, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 374, + 380, + 387 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 380, + 376, + 387, + 386 + ], + "score": 0.8, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 374, + 505, + 387 + ], + "score": 1.0, + "content": "are the indices of a sample in", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 385, + 413, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 265, + 398 + ], + "score": 1.0, + "content": "a mini-batch. The dense clustering loss", + "type": "text" + }, + { + "bbox": [ + 265, + 386, + 278, + 396 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 385, + 413, + 398 + ], + "score": 1.0, + "content": "for a mini-batch is calculated by:", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 374, + 505, + 398 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 253, + 399, + 358, + 428 + ], + "lines": [ + { + "bbox": [ + 253, + 399, + 358, + 428 + ], + "spans": [ + { + "bbox": [ + 253, + 399, + 358, + 428 + ], + "score": 0.94, + "content": "\\mathcal { L } _ { d } = \\sum _ { \\forall ( p , q ) \\in D } \\mathcal { L } ( x _ { p } , x _ { q } ) .", + "type": "interline_equation", + "image_path": "2536ed3e74d2ee43afd3d960df5668474cec18206ed2d1958279712458d3e6d4.jpg" + } + ] + } + ], + "index": 16.5, + "virtual_lines": [ + { + "bbox": [ + 253, + 399, + 358, + 413.5 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 253, + 413.5, + 358, + 428.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 430, + 505, + 453 + ], + "lines": [ + { + "bbox": [ + 106, + 429, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 429, + 138, + 442 + ], + "score": 1.0, + "content": "We use", + "type": "text" + }, + { + "bbox": [ + 138, + 430, + 151, + 441 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 429, + 505, + 442 + ], + "score": 1.0, + "content": "standalone with deep neural networks to reconstruct semantic clusters and for transfer", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 441, + 503, + 454 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 503, + 454 + ], + "score": 1.0, + "content": "learning across tasks (figure 4). We call the architecture the constrained clustering network (CCN).", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 429, + 505, + 454 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 465, + 298, + 477 + ], + "lines": [ + { + "bbox": [ + 105, + 464, + 298, + 478 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 298, + 478 + ], + "score": 1.0, + "content": "4.3 COMBINING WITH OTHER OBJECTIVES", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 485, + 505, + 552 + ], + "lines": [ + { + "bbox": [ + 105, + 486, + 504, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 495, + 498 + ], + "score": 1.0, + "content": "In the cross-domain case, we additionally have labeled source data. This enables us to use LCO for", + "type": "text" + }, + { + "bbox": [ + 495, + 487, + 504, + 496 + ], + "score": 0.79, + "content": "T", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 244, + 509 + ], + "score": 1.0, + "content": "while using classification loss for", + "type": "text" + }, + { + "bbox": [ + 244, + 497, + 254, + 507 + ], + "score": 0.87, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 497, + 505, + 509 + ], + "score": 1.0, + "content": ". The overall training procedure is similar to previous domain", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 509, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 106, + 509, + 505, + 520 + ], + "score": 1.0, + "content": "adaptation approaches in that both source and target data are mixed in a mini-batch, but different", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 519, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 407, + 531 + ], + "score": 1.0, + "content": "losses are applied. We denote the source domain images in a mini-batch", + "type": "text" + }, + { + "bbox": [ + 408, + 519, + 414, + 529 + ], + "score": 0.75, + "content": "b", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 519, + 426, + 531 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 426, + 519, + 444, + 530 + ], + "score": 0.9, + "content": "X _ { b ^ { S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 519, + 505, + 531 + ], + "score": 1.0, + "content": "and the target", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 530, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 531, + 169, + 542 + ], + "score": 1.0, + "content": "domain images", + "type": "text" + }, + { + "bbox": [ + 169, + 530, + 187, + 541 + ], + "score": 0.9, + "content": "X _ { b ^ { T } }", + "type": "inline_equation" + }, + { + "bbox": [ + 188, + 531, + 291, + 542 + ], + "score": 1.0, + "content": "with its set of dense pairs", + "type": "text" + }, + { + "bbox": [ + 292, + 530, + 310, + 541 + ], + "score": 0.9, + "content": "D _ { b ^ { T } }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 531, + 385, + 542 + ], + "score": 1.0, + "content": ". The loss function", + "type": "text" + }, + { + "bbox": [ + 386, + 530, + 402, + 541 + ], + "score": 0.91, + "content": "\\mathcal { L } _ { c d }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 531, + 506, + 542 + ], + "score": 1.0, + "content": "for cross-domain transfer", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 541, + 277, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 541, + 277, + 552 + ], + "score": 1.0, + "content": "in a mini-batch can then be formulated as:", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 486, + 506, + 552 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 259, + 555, + 352, + 568 + ], + "lines": [ + { + "bbox": [ + 259, + 555, + 352, + 568 + ], + "spans": [ + { + "bbox": [ + 259, + 555, + 352, + 568 + ], + "score": 0.91, + "content": "\\mathcal { L } _ { c d } = \\mathcal { L } _ { c l s } + \\mathcal { L } _ { c l u s t e r }", + "type": "interline_equation", + "image_path": "70260d3727ed67e5a59fd974700b2ab49d04ad5b5e5cdc3ecf8874b45be70bd8.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 259, + 555, + 352, + 568 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 202, + 578, + 408, + 609 + ], + "lines": [ + { + "bbox": [ + 202, + 578, + 408, + 609 + ], + "spans": [ + { + "bbox": [ + 202, + 578, + 408, + 609 + ], + "score": 0.91, + "content": "\\mathcal { L } _ { c l s } = \\frac { 1 } { | b ^ { S } | } \\sum _ { \\forall x _ { i } \\in X _ { b } s } C r o s s E n t r o p y L o s s ( f ( x _ { i } ) ) .", + "type": "interline_equation", + "image_path": "c8faa5cd2cfb258d9ee286453aeb92b063fa9022dc543a5611e434e7dbd32356.jpg" + } + ] + } + ], + "index": 28.5, + "virtual_lines": [ + { + "bbox": [ + 202, + 578, + 408, + 593.5 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 202, + 593.5, + 408, + 609.0 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 227, + 611, + 383, + 642 + ], + "lines": [ + { + "bbox": [ + 227, + 611, + 383, + 642 + ], + "spans": [ + { + "bbox": [ + 227, + 611, + 383, + 642 + ], + "score": 0.92, + "content": "\\mathcal { L } _ { c l u s t e r } = \\frac { 1 } { | b ^ { T } | ^ { 2 } } \\sum _ { \\forall ( i , j ) \\in D _ { b ^ { T } } } \\mathcal { L } ( x _ { i } , x _ { j } ) .", + "type": "interline_equation", + "image_path": "56ffd6cf3c83633f9f743ca9c45f42e3446398e208b61a557a090c6441db0b55.jpg" + } + ] + } + ], + "index": 30.5, + "virtual_lines": [ + { + "bbox": [ + 227, + 611, + 383, + 626.5 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 227, + 626.5, + 383, + 642.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 643, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 104, + 642, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 104, + 642, + 124, + 657 + ], + "score": 1.0, + "content": "The", + "type": "text" + }, + { + "bbox": [ + 124, + 644, + 158, + 655 + ], + "score": 0.92, + "content": "\\mathcal { L } _ { c l u s t e r }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 642, + 176, + 657 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 176, + 644, + 194, + 655 + ], + "score": 0.93, + "content": "\\mathcal { L } _ { c l s }", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 642, + 345, + 657 + ], + "score": 1.0, + "content": "share the same outputs from network", + "type": "text" + }, + { + "bbox": [ + 345, + 644, + 352, + 655 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 642, + 396, + 657 + ], + "score": 1.0, + "content": ". Although", + "type": "text" + }, + { + "bbox": [ + 397, + 644, + 430, + 655 + ], + "score": 0.92, + "content": "\\mathcal { L } _ { c l u s t e r }", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 642, + 506, + 657 + ], + "score": 1.0, + "content": "does not force the", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 275, + 667 + ], + "score": 1.0, + "content": "mapping between clusters and categories,", + "type": "text" + }, + { + "bbox": [ + 275, + 655, + 293, + 666 + ], + "score": 0.91, + "content": "\\mathcal { L } _ { c l s }", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "does. Therefore the learned classifier can be applied", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "on target data directly and picks the maximum probability for the predicted class. Note that in our", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 678, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 505, + 689 + ], + "score": 1.0, + "content": "loss function, there is no term to explicitly match the feature distribution between source and target; it", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 688, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 506, + 700 + ], + "score": 1.0, + "content": "merely transfers more knowledge in the form of constraints to regularize the learning of the classifier.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 104, + 698, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 104, + 698, + 506, + 712 + ], + "score": 1.0, + "content": "There is also no requirement for the architecture to utilize hidden layers. Therefore our approach has", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "the large flexibility to be combined with other domain adaptation strategies. Figure 5 illustrates the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 720, + 392, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 159, + 733 + ], + "score": 1.0, + "content": "architectures", + "type": "text" + }, + { + "bbox": [ + 160, + 721, + 186, + 731 + ], + "score": 0.86, + "content": "\\mathrm { C C N ^ { + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 720, + 204, + 733 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 204, + 721, + 235, + 731 + ], + "score": 0.86, + "content": "\\mathrm { C C N ^ { + + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 720, + 392, + 733 + ], + "score": 1.0, + "content": "used in our cross-domain experiments.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 35.5, + "bbox_fs": [ + 104, + 642, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 200, + 94 + ], + "lines": [ + { + "bbox": [ + 104, + 79, + 201, + 96 + ], + "spans": [ + { + "bbox": [ + 104, + 79, + 201, + 96 + ], + "score": 1.0, + "content": "5 EXPERIMENTS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 106, + 505, + 139 + ], + "lines": [ + { + "bbox": [ + 105, + 105, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 506, + 118 + ], + "score": 1.0, + "content": "This section contains evaluations with four image datasets and covers both cross-task and cross-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 117, + 505, + 130 + ], + "spans": [ + { + "bbox": [ + 105, + 117, + 505, + 130 + ], + "score": 1.0, + "content": "domain schemes. The details are described below, and the differences between experimental settings", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 128, + 225, + 140 + ], + "spans": [ + { + "bbox": [ + 106, + 128, + 225, + 140 + ], + "score": 1.0, + "content": "are illustrated in appendix A.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "title", + "bbox": [ + 106, + 153, + 353, + 164 + ], + "lines": [ + { + "bbox": [ + 106, + 152, + 354, + 165 + ], + "spans": [ + { + "bbox": [ + 106, + 152, + 354, + 165 + ], + "score": 1.0, + "content": "5.1 UNSUPERVISED CROSS-TASK TRANSFER LEARNING", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "title", + "bbox": [ + 107, + 173, + 168, + 184 + ], + "lines": [ + { + "bbox": [ + 105, + 172, + 169, + 186 + ], + "spans": [ + { + "bbox": [ + 105, + 172, + 169, + 186 + ], + "score": 1.0, + "content": "5.1.1 SETUP", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 192, + 505, + 270 + ], + "lines": [ + { + "bbox": [ + 105, + 192, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 505, + 205 + ], + "score": 1.0, + "content": "The Omniglot dataset (Lake et al., 2015) contains 1623 different handwritten characters and each", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 203, + 506, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 506, + 216 + ], + "score": 1.0, + "content": "of them has 20 images drawn by different people. The characters are from 50 different alphabets", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 215, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 105, + 215, + 274, + 227 + ], + "score": 1.0, + "content": "and were separated to 30 background sets", + "type": "text" + }, + { + "bbox": [ + 275, + 215, + 326, + 227 + ], + "score": 0.32, + "content": "O m n i g l o t _ { b g }", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 215, + 417, + 227 + ], + "score": 1.0, + "content": "and 20 evaluation sets", + "type": "text" + }, + { + "bbox": [ + 417, + 215, + 477, + 226 + ], + "score": 0.5, + "content": "O m n i g l o t _ { e v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 215, + 505, + 227 + ], + "score": 1.0, + "content": "by the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 225, + 506, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 182, + 239 + ], + "score": 1.0, + "content": "author. We use the", + "type": "text" + }, + { + "bbox": [ + 182, + 226, + 234, + 238 + ], + "score": 0.42, + "content": "O m n i g l o t _ { b g }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 225, + 328, + 239 + ], + "score": 1.0, + "content": "as the auxiliary dataset", + "type": "text" + }, + { + "bbox": [ + 328, + 226, + 343, + 236 + ], + "score": 0.65, + "content": "( A )", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 225, + 375, + 239 + ], + "score": 1.0, + "content": "and the", + "type": "text" + }, + { + "bbox": [ + 376, + 226, + 435, + 237 + ], + "score": 0.69, + "content": "O m n i g l o t _ { e v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 225, + 506, + 239 + ], + "score": 1.0, + "content": "as the target data", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 236, + 506, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 236, + 121, + 248 + ], + "score": 0.71, + "content": "( T )", + "type": "inline_equation" + }, + { + "bbox": [ + 122, + 236, + 266, + 249 + ], + "score": 1.0, + "content": ". The total number of characters in", + "type": "text" + }, + { + "bbox": [ + 266, + 236, + 318, + 249 + ], + "score": 0.77, + "content": "O m n g l o t _ { b g }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 236, + 506, + 249 + ], + "score": 1.0, + "content": "is 964, which can be regarded as the number", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 246, + 506, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 246, + 476, + 261 + ], + "score": 1.0, + "content": "of categories available to learn the semantic similarity. The goal is to cluster Omniglot", + "type": "text" + }, + { + "bbox": [ + 476, + 248, + 493, + 259 + ], + "score": 0.71, + "content": "_ { e v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 246, + 506, + 261 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 258, + 375, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 375, + 271 + ], + "score": 1.0, + "content": "reconstruct its semantic categories, without ever having any labels.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 107, + 275, + 505, + 374 + ], + "lines": [ + { + "bbox": [ + 106, + 275, + 504, + 287 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 125, + 287 + ], + "score": 1.0, + "content": "The", + "type": "text" + }, + { + "bbox": [ + 125, + 275, + 135, + 285 + ], + "score": 0.7, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 275, + 341, + 287 + ], + "score": 1.0, + "content": "function has a backbone neural network with four", + "type": "text" + }, + { + "bbox": [ + 342, + 276, + 358, + 286 + ], + "score": 0.45, + "content": "3 \\mathrm { x } 3", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 275, + 487, + 287 + ], + "score": 1.0, + "content": "convolution layers followed by", + "type": "text" + }, + { + "bbox": [ + 487, + 275, + 504, + 286 + ], + "score": 0.68, + "content": "2 \\mathbf { x } 2", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 286, + 506, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 506, + 299 + ], + "score": 1.0, + "content": "max-pooling with stride 2. All hidden layers are followed by batch normalization (Ioffe & Szegedy,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 296, + 506, + 310 + ], + "spans": [ + { + "bbox": [ + 106, + 296, + 430, + 310 + ], + "score": 1.0, + "content": "2015) and rectified linear unit. To prepare the inputs for training, the images from", + "type": "text" + }, + { + "bbox": [ + 430, + 297, + 482, + 309 + ], + "score": 0.5, + "content": "O m n i g l o t _ { b g }", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 296, + 506, + 310 + ], + "score": 1.0, + "content": "were", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 308, + 506, + 320 + ], + "spans": [ + { + "bbox": [ + 106, + 308, + 147, + 320 + ], + "score": 1.0, + "content": "resized to", + "type": "text" + }, + { + "bbox": [ + 148, + 308, + 174, + 318 + ], + "score": 0.68, + "content": "3 2 \\mathrm { x } 3 2", + "type": "inline_equation" + }, + { + "bbox": [ + 175, + 308, + 506, + 320 + ], + "score": 1.0, + "content": "and normalized to zero mean with unit standard deviation. Each mini-batch has a", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 319, + 505, + 331 + ], + "spans": [ + { + "bbox": [ + 106, + 319, + 505, + 331 + ], + "score": 1.0, + "content": "size of 100 and is sampled from a random 20 characters to make sure the amount of similar pairs", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 330, + 506, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 506, + 343 + ], + "score": 1.0, + "content": "is reasonable. After pair enumeration, there are 10000 pairs subject to the loss function, which is a", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 341, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 341, + 505, + 354 + ], + "score": 1.0, + "content": "two-class cross entropy loss. The ground-truth similarity is obtained by converting the categorical", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 351, + 506, + 365 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 185, + 365 + ], + "score": 1.0, + "content": "labels. The loss of", + "type": "text" + }, + { + "bbox": [ + 186, + 352, + 195, + 362 + ], + "score": 0.81, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 351, + 506, + 365 + ], + "score": 1.0, + "content": "is optimized by stochastic gradient descent and is the only part trained in a", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 364, + 243, + 375 + ], + "spans": [ + { + "bbox": [ + 106, + 364, + 243, + 375 + ], + "score": 1.0, + "content": "supervised manner in this section.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 380, + 505, + 501 + ], + "lines": [ + { + "bbox": [ + 106, + 380, + 504, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 504, + 392 + ], + "score": 1.0, + "content": "The Constrained Clustering Network (CCN) is used to reconstruct the semantic clusters in the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 391, + 504, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 391, + 240, + 403 + ], + "score": 1.0, + "content": "target dataset using outputs from", + "type": "text" + }, + { + "bbox": [ + 241, + 391, + 250, + 401 + ], + "score": 0.67, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 391, + 487, + 403 + ], + "score": 1.0, + "content": ". The network has four 3x3 convolution layers followed by", + "type": "text" + }, + { + "bbox": [ + 487, + 391, + 504, + 401 + ], + "score": 0.55, + "content": "2 \\mathbf { x } 2", + "type": "inline_equation" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 401, + 506, + 415 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 506, + 415 + ], + "score": 1.0, + "content": "max-pooling with stride 2, one hidden fully-connected layer, and one cluster assignment layer which", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 412, + 506, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 506, + 425 + ], + "score": 1.0, + "content": "is also fully connected. The number of output nodes in the last layer is equal to the number of", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 423, + 506, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 506, + 437 + ], + "score": 1.0, + "content": "potential clusters in the target data. The output distribution is enumerated in pairs before sending to", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 435, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 506, + 447 + ], + "score": 1.0, + "content": "LCO. The network is randomly initialized, trained end-to-end, and optimized by stochastic gradient", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 445, + 506, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 391, + 459 + ], + "score": 1.0, + "content": "descent with randomly sampled 100 images per mini-batch. Note the", + "type": "text" + }, + { + "bbox": [ + 392, + 446, + 401, + 456 + ], + "score": 0.79, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 445, + 506, + 459 + ], + "score": 1.0, + "content": "function used by LCO is", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 457, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 469 + ], + "score": 1.0, + "content": "fixed during the optimization. The input data preparation is the same as above, except now the data is", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 466, + 506, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 129, + 481 + ], + "score": 1.0, + "content": "from", + "type": "text" + }, + { + "bbox": [ + 129, + 468, + 188, + 479 + ], + "score": 0.72, + "content": "O m n i g l o t _ { e v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 188, + 466, + 477, + 481 + ], + "score": 1.0, + "content": ". Specifically, during the training, the same mini-batch is given to both", + "type": "text" + }, + { + "bbox": [ + 478, + 468, + 487, + 477 + ], + "score": 0.79, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 466, + 506, + 481 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 477, + 507, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 322, + 492 + ], + "score": 1.0, + "content": "CCN. The dense pairwise similarity predictions from", + "type": "text" + }, + { + "bbox": [ + 322, + 479, + 331, + 489 + ], + "score": 0.81, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 477, + 507, + 492 + ], + "score": 1.0, + "content": "are sent to LCO and are then fully utilized.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 489, + 431, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 254, + 502 + ], + "score": 1.0, + "content": "The only hyper-parameter in LCO is", + "type": "text" + }, + { + "bbox": [ + 254, + 492, + 261, + 499 + ], + "score": 0.75, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 489, + 431, + 502 + ], + "score": 1.0, + "content": ", and we set it to 2 for all our experiments.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 506, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 105, + 505, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 150, + 520 + ], + "score": 1.0, + "content": "Omniglot", + "type": "text" + }, + { + "bbox": [ + 150, + 507, + 166, + 518 + ], + "score": 0.62, + "content": "e v a l", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 505, + 506, + 520 + ], + "score": 1.0, + "content": "contains 20 alphabets and each one can be used as a standalone dataset. The 20", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 518, + 505, + 528 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 528 + ], + "score": 1.0, + "content": "target datasets contain a varied number (20 to 47) of characters. Therefore we can evaluate the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 528, + 505, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 505, + 540 + ], + "score": 1.0, + "content": "reconstruction performance under a varied number of ground-truth clusters. We tested the situations", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 231, + 552 + ], + "score": 1.0, + "content": "when the number of character", + "type": "text" + }, + { + "bbox": [ + 231, + 540, + 248, + 550 + ], + "score": 0.73, + "content": "( K )", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 539, + 437, + 552 + ], + "score": 1.0, + "content": "in an alphabet is known and unknown. When", + "type": "text" + }, + { + "bbox": [ + 437, + 540, + 447, + 549 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 539, + 506, + 552 + ], + "score": 1.0, + "content": "is known, we", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "set the target number of clusters in the clustering algorithm equal to the true number of characters.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 104, + 560, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 104, + 560, + 116, + 574 + ], + "score": 1.0, + "content": "If", + "type": "text" + }, + { + "bbox": [ + 116, + 562, + 126, + 571 + ], + "score": 0.81, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 560, + 506, + 574 + ], + "score": 1.0, + "content": "is unknown, the common practice is to set it to a large number so that the data from different", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 572, + 506, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 464, + 585 + ], + "score": 1.0, + "content": "categories will not be forced to be in the same cluster. In the experiment, we merely set", + "type": "text" + }, + { + "bbox": [ + 464, + 573, + 474, + 582 + ], + "score": 0.81, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 572, + 506, + 585 + ], + "score": 1.0, + "content": "to 100,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 583, + 307, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 307, + 595 + ], + "score": 1.0, + "content": "which is much larger than the largest dataset (47).", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 36.5 + }, + { + "type": "text", + "bbox": [ + 107, + 600, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 600, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 506, + 613 + ], + "score": 1.0, + "content": "All constrained clustering algorithms can be used to reconstruct the semantic clusters for our problem.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 611, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 239, + 623 + ], + "score": 1.0, + "content": "Since there are mis-predictions in", + "type": "text" + }, + { + "bbox": [ + 239, + 611, + 248, + 621 + ], + "score": 0.73, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 612, + 505, + 623 + ], + "score": 1.0, + "content": ", robustness to noise is the most important factor. Here we include", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 622, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 634 + ], + "score": 1.0, + "content": "all four types of constrained clustering algorithms introduced in section 2 as the baselines. We provide", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "score": 1.0, + "content": "the full set of pairwise constraints to all algorithms including ours. In other words, given an alphabet", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 417, + 656 + ], + "score": 1.0, + "content": "of 20 characters, it contains 400 images and 160000 predicted similarities from", + "type": "text" + }, + { + "bbox": [ + 418, + 644, + 427, + 654 + ], + "score": 0.78, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 644, + 467, + 656 + ], + "score": 1.0, + "content": "(note that", + "type": "text" + }, + { + "bbox": [ + 468, + 644, + 477, + 654 + ], + "score": 0.77, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "makes", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 655, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 506, + 667 + ], + "score": 1.0, + "content": "predictions for both orders of a pair and for self-pairs). The full pairwise similarities were presented", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "to all algorithms in random order, while we empirically found it has no noticeable effect on results.", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 677, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 506, + 689 + ], + "score": 1.0, + "content": "We pick the baseline approaches based on code availability and scalability concerning the number of", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 688, + 506, + 699 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 506, + 699 + ], + "score": 1.0, + "content": "pairwise constraints. Therefore we have shown results for K-means (MacQueen et al., 1967), LPNMF", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 698, + 507, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 507, + 712 + ], + "score": 1.0, + "content": "(Cai et al., 2009), LSC (Chen & Cai, 2011), ITML (Davis et al., 2007), SKKm (Anand et al., 2014),", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "SKLR (Amid et al., 2016), SKMS (Anand et al., 2014), CSP (Wang et al., 2014) , and MPCK-means", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "(Bilenko et al., 2004) as our baselines. We use the default parameters for each algorithm provided by", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 46.5 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "score": 1.0, + "content": "7", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 200, + 94 + ], + "lines": [ + { + "bbox": [ + 104, + 79, + 201, + 96 + ], + "spans": [ + { + "bbox": [ + 104, + 79, + 201, + 96 + ], + "score": 1.0, + "content": "5 EXPERIMENTS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 106, + 505, + 139 + ], + "lines": [ + { + "bbox": [ + 105, + 105, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 506, + 118 + ], + "score": 1.0, + "content": "This section contains evaluations with four image datasets and covers both cross-task and cross-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 117, + 505, + 130 + ], + "spans": [ + { + "bbox": [ + 105, + 117, + 505, + 130 + ], + "score": 1.0, + "content": "domain schemes. The details are described below, and the differences between experimental settings", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 128, + 225, + 140 + ], + "spans": [ + { + "bbox": [ + 106, + 128, + 225, + 140 + ], + "score": 1.0, + "content": "are illustrated in appendix A.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 105, + 506, + 140 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 153, + 353, + 164 + ], + "lines": [ + { + "bbox": [ + 106, + 152, + 354, + 165 + ], + "spans": [ + { + "bbox": [ + 106, + 152, + 354, + 165 + ], + "score": 1.0, + "content": "5.1 UNSUPERVISED CROSS-TASK TRANSFER LEARNING", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "title", + "bbox": [ + 107, + 173, + 168, + 184 + ], + "lines": [ + { + "bbox": [ + 105, + 172, + 169, + 186 + ], + "spans": [ + { + "bbox": [ + 105, + 172, + 169, + 186 + ], + "score": 1.0, + "content": "5.1.1 SETUP", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 192, + 505, + 270 + ], + "lines": [ + { + "bbox": [ + 105, + 192, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 505, + 205 + ], + "score": 1.0, + "content": "The Omniglot dataset (Lake et al., 2015) contains 1623 different handwritten characters and each", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 203, + 506, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 506, + 216 + ], + "score": 1.0, + "content": "of them has 20 images drawn by different people. The characters are from 50 different alphabets", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 215, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 105, + 215, + 274, + 227 + ], + "score": 1.0, + "content": "and were separated to 30 background sets", + "type": "text" + }, + { + "bbox": [ + 275, + 215, + 326, + 227 + ], + "score": 0.32, + "content": "O m n i g l o t _ { b g }", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 215, + 417, + 227 + ], + "score": 1.0, + "content": "and 20 evaluation sets", + "type": "text" + }, + { + "bbox": [ + 417, + 215, + 477, + 226 + ], + "score": 0.5, + "content": "O m n i g l o t _ { e v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 215, + 505, + 227 + ], + "score": 1.0, + "content": "by the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 225, + 506, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 182, + 239 + ], + "score": 1.0, + "content": "author. We use the", + "type": "text" + }, + { + "bbox": [ + 182, + 226, + 234, + 238 + ], + "score": 0.42, + "content": "O m n i g l o t _ { b g }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 225, + 328, + 239 + ], + "score": 1.0, + "content": "as the auxiliary dataset", + "type": "text" + }, + { + "bbox": [ + 328, + 226, + 343, + 236 + ], + "score": 0.65, + "content": "( A )", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 225, + 375, + 239 + ], + "score": 1.0, + "content": "and the", + "type": "text" + }, + { + "bbox": [ + 376, + 226, + 435, + 237 + ], + "score": 0.69, + "content": "O m n i g l o t _ { e v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 225, + 506, + 239 + ], + "score": 1.0, + "content": "as the target data", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 236, + 506, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 236, + 121, + 248 + ], + "score": 0.71, + "content": "( T )", + "type": "inline_equation" + }, + { + "bbox": [ + 122, + 236, + 266, + 249 + ], + "score": 1.0, + "content": ". The total number of characters in", + "type": "text" + }, + { + "bbox": [ + 266, + 236, + 318, + 249 + ], + "score": 0.77, + "content": "O m n g l o t _ { b g }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 236, + 506, + 249 + ], + "score": 1.0, + "content": "is 964, which can be regarded as the number", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 246, + 506, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 246, + 476, + 261 + ], + "score": 1.0, + "content": "of categories available to learn the semantic similarity. The goal is to cluster Omniglot", + "type": "text" + }, + { + "bbox": [ + 476, + 248, + 493, + 259 + ], + "score": 0.71, + "content": "_ { e v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 246, + 506, + 261 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 258, + 375, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 375, + 271 + ], + "score": 1.0, + "content": "reconstruct its semantic categories, without ever having any labels.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 192, + 506, + 271 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 275, + 505, + 374 + ], + "lines": [ + { + "bbox": [ + 106, + 275, + 504, + 287 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 125, + 287 + ], + "score": 1.0, + "content": "The", + "type": "text" + }, + { + "bbox": [ + 125, + 275, + 135, + 285 + ], + "score": 0.7, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 275, + 341, + 287 + ], + "score": 1.0, + "content": "function has a backbone neural network with four", + "type": "text" + }, + { + "bbox": [ + 342, + 276, + 358, + 286 + ], + "score": 0.45, + "content": "3 \\mathrm { x } 3", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 275, + 487, + 287 + ], + "score": 1.0, + "content": "convolution layers followed by", + "type": "text" + }, + { + "bbox": [ + 487, + 275, + 504, + 286 + ], + "score": 0.68, + "content": "2 \\mathbf { x } 2", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 286, + 506, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 506, + 299 + ], + "score": 1.0, + "content": "max-pooling with stride 2. All hidden layers are followed by batch normalization (Ioffe & Szegedy,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 296, + 506, + 310 + ], + "spans": [ + { + "bbox": [ + 106, + 296, + 430, + 310 + ], + "score": 1.0, + "content": "2015) and rectified linear unit. To prepare the inputs for training, the images from", + "type": "text" + }, + { + "bbox": [ + 430, + 297, + 482, + 309 + ], + "score": 0.5, + "content": "O m n i g l o t _ { b g }", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 296, + 506, + 310 + ], + "score": 1.0, + "content": "were", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 308, + 506, + 320 + ], + "spans": [ + { + "bbox": [ + 106, + 308, + 147, + 320 + ], + "score": 1.0, + "content": "resized to", + "type": "text" + }, + { + "bbox": [ + 148, + 308, + 174, + 318 + ], + "score": 0.68, + "content": "3 2 \\mathrm { x } 3 2", + "type": "inline_equation" + }, + { + "bbox": [ + 175, + 308, + 506, + 320 + ], + "score": 1.0, + "content": "and normalized to zero mean with unit standard deviation. Each mini-batch has a", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 319, + 505, + 331 + ], + "spans": [ + { + "bbox": [ + 106, + 319, + 505, + 331 + ], + "score": 1.0, + "content": "size of 100 and is sampled from a random 20 characters to make sure the amount of similar pairs", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 330, + 506, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 506, + 343 + ], + "score": 1.0, + "content": "is reasonable. After pair enumeration, there are 10000 pairs subject to the loss function, which is a", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 341, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 341, + 505, + 354 + ], + "score": 1.0, + "content": "two-class cross entropy loss. The ground-truth similarity is obtained by converting the categorical", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 351, + 506, + 365 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 185, + 365 + ], + "score": 1.0, + "content": "labels. The loss of", + "type": "text" + }, + { + "bbox": [ + 186, + 352, + 195, + 362 + ], + "score": 0.81, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 351, + 506, + 365 + ], + "score": 1.0, + "content": "is optimized by stochastic gradient descent and is the only part trained in a", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 364, + 243, + 375 + ], + "spans": [ + { + "bbox": [ + 106, + 364, + 243, + 375 + ], + "score": 1.0, + "content": "supervised manner in this section.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 275, + 506, + 375 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 380, + 505, + 501 + ], + "lines": [ + { + "bbox": [ + 106, + 380, + 504, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 504, + 392 + ], + "score": 1.0, + "content": "The Constrained Clustering Network (CCN) is used to reconstruct the semantic clusters in the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 391, + 504, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 391, + 240, + 403 + ], + "score": 1.0, + "content": "target dataset using outputs from", + "type": "text" + }, + { + "bbox": [ + 241, + 391, + 250, + 401 + ], + "score": 0.67, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 391, + 487, + 403 + ], + "score": 1.0, + "content": ". The network has four 3x3 convolution layers followed by", + "type": "text" + }, + { + "bbox": [ + 487, + 391, + 504, + 401 + ], + "score": 0.55, + "content": "2 \\mathbf { x } 2", + "type": "inline_equation" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 401, + 506, + 415 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 506, + 415 + ], + "score": 1.0, + "content": "max-pooling with stride 2, one hidden fully-connected layer, and one cluster assignment layer which", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 412, + 506, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 506, + 425 + ], + "score": 1.0, + "content": "is also fully connected. The number of output nodes in the last layer is equal to the number of", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 423, + 506, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 506, + 437 + ], + "score": 1.0, + "content": "potential clusters in the target data. The output distribution is enumerated in pairs before sending to", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 435, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 506, + 447 + ], + "score": 1.0, + "content": "LCO. The network is randomly initialized, trained end-to-end, and optimized by stochastic gradient", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 445, + 506, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 391, + 459 + ], + "score": 1.0, + "content": "descent with randomly sampled 100 images per mini-batch. Note the", + "type": "text" + }, + { + "bbox": [ + 392, + 446, + 401, + 456 + ], + "score": 0.79, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 445, + 506, + 459 + ], + "score": 1.0, + "content": "function used by LCO is", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 457, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 469 + ], + "score": 1.0, + "content": "fixed during the optimization. The input data preparation is the same as above, except now the data is", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 466, + 506, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 129, + 481 + ], + "score": 1.0, + "content": "from", + "type": "text" + }, + { + "bbox": [ + 129, + 468, + 188, + 479 + ], + "score": 0.72, + "content": "O m n i g l o t _ { e v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 188, + 466, + 477, + 481 + ], + "score": 1.0, + "content": ". Specifically, during the training, the same mini-batch is given to both", + "type": "text" + }, + { + "bbox": [ + 478, + 468, + 487, + 477 + ], + "score": 0.79, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 466, + 506, + 481 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 477, + 507, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 322, + 492 + ], + "score": 1.0, + "content": "CCN. The dense pairwise similarity predictions from", + "type": "text" + }, + { + "bbox": [ + 322, + 479, + 331, + 489 + ], + "score": 0.81, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 477, + 507, + 492 + ], + "score": 1.0, + "content": "are sent to LCO and are then fully utilized.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 489, + 431, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 254, + 502 + ], + "score": 1.0, + "content": "The only hyper-parameter in LCO is", + "type": "text" + }, + { + "bbox": [ + 254, + 492, + 261, + 499 + ], + "score": 0.75, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 489, + 431, + 502 + ], + "score": 1.0, + "content": ", and we set it to 2 for all our experiments.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 380, + 507, + 502 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 506, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 105, + 505, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 150, + 520 + ], + "score": 1.0, + "content": "Omniglot", + "type": "text" + }, + { + "bbox": [ + 150, + 507, + 166, + 518 + ], + "score": 0.62, + "content": "e v a l", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 505, + 506, + 520 + ], + "score": 1.0, + "content": "contains 20 alphabets and each one can be used as a standalone dataset. The 20", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 518, + 505, + 528 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 528 + ], + "score": 1.0, + "content": "target datasets contain a varied number (20 to 47) of characters. Therefore we can evaluate the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 528, + 505, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 505, + 540 + ], + "score": 1.0, + "content": "reconstruction performance under a varied number of ground-truth clusters. We tested the situations", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 231, + 552 + ], + "score": 1.0, + "content": "when the number of character", + "type": "text" + }, + { + "bbox": [ + 231, + 540, + 248, + 550 + ], + "score": 0.73, + "content": "( K )", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 539, + 437, + 552 + ], + "score": 1.0, + "content": "in an alphabet is known and unknown. When", + "type": "text" + }, + { + "bbox": [ + 437, + 540, + 447, + 549 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 539, + 506, + 552 + ], + "score": 1.0, + "content": "is known, we", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "set the target number of clusters in the clustering algorithm equal to the true number of characters.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 104, + 560, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 104, + 560, + 116, + 574 + ], + "score": 1.0, + "content": "If", + "type": "text" + }, + { + "bbox": [ + 116, + 562, + 126, + 571 + ], + "score": 0.81, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 560, + 506, + 574 + ], + "score": 1.0, + "content": "is unknown, the common practice is to set it to a large number so that the data from different", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 572, + 506, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 464, + 585 + ], + "score": 1.0, + "content": "categories will not be forced to be in the same cluster. In the experiment, we merely set", + "type": "text" + }, + { + "bbox": [ + 464, + 573, + 474, + 582 + ], + "score": 0.81, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 572, + 506, + 585 + ], + "score": 1.0, + "content": "to 100,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 583, + 307, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 307, + 595 + ], + "score": 1.0, + "content": "which is much larger than the largest dataset (47).", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 36.5, + "bbox_fs": [ + 104, + 505, + 506, + 595 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 600, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 600, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 506, + 613 + ], + "score": 1.0, + "content": "All constrained clustering algorithms can be used to reconstruct the semantic clusters for our problem.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 611, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 239, + 623 + ], + "score": 1.0, + "content": "Since there are mis-predictions in", + "type": "text" + }, + { + "bbox": [ + 239, + 611, + 248, + 621 + ], + "score": 0.73, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 612, + 505, + 623 + ], + "score": 1.0, + "content": ", robustness to noise is the most important factor. Here we include", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 622, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 634 + ], + "score": 1.0, + "content": "all four types of constrained clustering algorithms introduced in section 2 as the baselines. We provide", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "score": 1.0, + "content": "the full set of pairwise constraints to all algorithms including ours. In other words, given an alphabet", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 417, + 656 + ], + "score": 1.0, + "content": "of 20 characters, it contains 400 images and 160000 predicted similarities from", + "type": "text" + }, + { + "bbox": [ + 418, + 644, + 427, + 654 + ], + "score": 0.78, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 644, + 467, + 656 + ], + "score": 1.0, + "content": "(note that", + "type": "text" + }, + { + "bbox": [ + 468, + 644, + 477, + 654 + ], + "score": 0.77, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "makes", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 655, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 506, + 667 + ], + "score": 1.0, + "content": "predictions for both orders of a pair and for self-pairs). The full pairwise similarities were presented", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "to all algorithms in random order, while we empirically found it has no noticeable effect on results.", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 677, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 506, + 689 + ], + "score": 1.0, + "content": "We pick the baseline approaches based on code availability and scalability concerning the number of", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 688, + 506, + 699 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 506, + 699 + ], + "score": 1.0, + "content": "pairwise constraints. Therefore we have shown results for K-means (MacQueen et al., 1967), LPNMF", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 698, + 507, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 507, + 712 + ], + "score": 1.0, + "content": "(Cai et al., 2009), LSC (Chen & Cai, 2011), ITML (Davis et al., 2007), SKKm (Anand et al., 2014),", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "SKLR (Amid et al., 2016), SKMS (Anand et al., 2014), CSP (Wang et al., 2014) , and MPCK-means", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "(Bilenko et al., 2004) as our baselines. We use the default parameters for each algorithm provided by", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 106, + 315, + 506, + 329 + ], + "spans": [ + { + "bbox": [ + 106, + 315, + 223, + 329 + ], + "score": 1.0, + "content": "the original author except for", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 223, + 317, + 234, + 326 + ], + "score": 0.78, + "content": "K", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 234, + 315, + 506, + 329 + ], + "score": 1.0, + "content": ", the number of clusters. We use the same normalized images used in", + "type": "text", + "cross_page": true + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 327, + 204, + 340 + ], + "spans": [ + { + "bbox": [ + 106, + 327, + 204, + 340 + ], + "score": 1.0, + "content": "CCN for all algorithms.", + "type": "text", + "cross_page": true + } + ], + "index": 9 + } + ], + "index": 46.5, + "bbox_fs": [ + 105, + 600, + 507, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 131, + 145, + 480, + 294 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 88, + 505, + 144 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 88, + 505, + 102 + ], + "spans": [ + { + "bbox": [ + 105, + 88, + 340, + 102 + ], + "score": 1.0, + "content": "Table 1: Unsupervised cross-task transfer from Omniglot", + "type": "text" + }, + { + "bbox": [ + 340, + 91, + 349, + 101 + ], + "score": 0.39, + "content": "b g", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 88, + 361, + 102 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 361, + 90, + 420, + 101 + ], + "score": 0.25, + "content": "O m n i g l o t _ { e v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 88, + 505, + 102 + ], + "score": 1.0, + "content": ". The performance is", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 101, + 505, + 113 + ], + "spans": [ + { + "bbox": [ + 106, + 101, + 505, + 113 + ], + "score": 1.0, + "content": "averaged across 20 alphabets which have 20 to 47 letters. The ACC and NMI without brackets have", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 111, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 444, + 123 + ], + "score": 1.0, + "content": "the number of clusters equal to ground-truth. The \"(100)\" means the algorithms use", + "type": "text" + }, + { + "bbox": [ + 444, + 111, + 483, + 122 + ], + "score": 0.9, + "content": "K = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 111, + 505, + 123 + ], + "score": 1.0, + "content": ". The", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 122, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 505, + 136 + ], + "score": 1.0, + "content": "characteristics of how each algorithm utilizes the pairwise constraints are marked in the \"Constraints", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 133, + 431, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 133, + 431, + 146 + ], + "score": 1.0, + "content": "in\" column, where metric stands for the metric learning of feature representation.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "table_body", + "bbox": [ + 131, + 145, + 480, + 294 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 131, + 145, + 480, + 294 + ], + "spans": [ + { + "bbox": [ + 131, + 145, + 480, + 294 + ], + "score": 0.985, + "html": "
MethodConstraints inACCACC (100)NMINMI (100)
MetricClustering
K-means21.7%18.9%0.3530.464
LPNMF22.2%16.3%0.3720.498
LSC23.6%18.0%0.3760.500
ITML056.7%47.2%0.6740.727
SKMS0=45.5%10.693
SKKm062.4%46.9%0.7700.781
SKLR066.9%46.8%0.7910.760
CSP062.5%65.4%0.8120.812
MPCK-means0081.9%53.9%0.8710.816
CCN (Ours)0082.4%78.1%0.8890.874
", + "type": "table", + "image_path": "2ae0c7337bcbc45fa8408cbf5514b9f871c789e8f5603902752e52690914bc95.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 131, + 145, + 480, + 194.66666666666666 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 131, + 194.66666666666666, + 480, + 244.33333333333331 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 131, + 244.33333333333331, + 480, + 294.0 + ], + "spans": [], + "index": 7 + } + ] + } + ], + "index": 4.0 + }, + { + "type": "text", + "bbox": [ + 108, + 316, + 504, + 338 + ], + "lines": [ + { + "bbox": [ + 106, + 315, + 506, + 329 + ], + "spans": [ + { + "bbox": [ + 106, + 315, + 223, + 329 + ], + "score": 1.0, + "content": "the original author except for", + "type": "text" + }, + { + "bbox": [ + 223, + 317, + 234, + 326 + ], + "score": 0.78, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 315, + 506, + 329 + ], + "score": 1.0, + "content": ", the number of clusters. We use the same normalized images used in", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 327, + 204, + 340 + ], + "spans": [ + { + "bbox": [ + 106, + 327, + 204, + 340 + ], + "score": 1.0, + "content": "CCN for all algorithms.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 107, + 344, + 505, + 432 + ], + "lines": [ + { + "bbox": [ + 106, + 344, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 106, + 344, + 505, + 356 + ], + "score": 1.0, + "content": "The evaluation uses two clustering metrics. The first is normalized-mutual information (NMI) (Strehl", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 354, + 505, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 505, + 368 + ], + "score": 1.0, + "content": "& Ghosh, 2002) which is widely used for clustering. The second one is the clustering accuracy", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 366, + 505, + 379 + ], + "spans": [ + { + "bbox": [ + 105, + 366, + 505, + 379 + ], + "score": 1.0, + "content": "(ACC) (Yang et al., 2010). The ACC metric first finds the one-to-one matching between predicted", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 375, + 507, + 390 + ], + "spans": [ + { + "bbox": [ + 104, + 375, + 507, + 390 + ], + "score": 1.0, + "content": "clusters and ground-truth labels, and then calculates the classification accuracy based on the mapping.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 388, + 505, + 401 + ], + "spans": [ + { + "bbox": [ + 106, + 388, + 505, + 401 + ], + "score": 1.0, + "content": "All data outside the matched clusters will be regarded as mis-predictions. To get high ACC, the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 398, + 507, + 413 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 507, + 413 + ], + "score": 1.0, + "content": "algorithm has to generate coherent clusters where each cluster includes most of the data in a category;", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 411, + 506, + 422 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 506, + 422 + ], + "score": 1.0, + "content": "otherwise the score drops quickly. Therefore ACC provides better discrimination to evaluate whether", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 421, + 312, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 421, + 312, + 432 + ], + "score": 1.0, + "content": "the semantic clusters have been reconstructed well.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 13.5 + }, + { + "type": "title", + "bbox": [ + 108, + 447, + 260, + 459 + ], + "lines": [ + { + "bbox": [ + 106, + 447, + 262, + 460 + ], + "spans": [ + { + "bbox": [ + 106, + 447, + 262, + 460 + ], + "score": 1.0, + "content": "5.1.2 RESULTS AND DISCUSSIONS", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 106, + 467, + 505, + 577 + ], + "lines": [ + { + "bbox": [ + 105, + 466, + 506, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 506, + 481 + ], + "score": 1.0, + "content": "We report the average performance over the 20 alphabets in table 1. Our approach achieved the top", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 478, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 478, + 505, + 491 + ], + "score": 1.0, + "content": "performance on both metrics. The CCN demonstrates strong robustness on the challenging scenario", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 104, + 488, + 507, + 503 + ], + "spans": [ + { + "bbox": [ + 104, + 488, + 158, + 503 + ], + "score": 1.0, + "content": "of unknown", + "type": "text" + }, + { + "bbox": [ + 159, + 490, + 169, + 500 + ], + "score": 0.76, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 488, + 223, + 503 + ], + "score": 1.0, + "content": ". It achieved", + "type": "text" + }, + { + "bbox": [ + 224, + 489, + 252, + 500 + ], + "score": 0.88, + "content": "7 8 . 1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 488, + 397, + 503 + ], + "score": 1.0, + "content": "average accuracy. Compared with", + "type": "text" + }, + { + "bbox": [ + 397, + 489, + 425, + 500 + ], + "score": 0.87, + "content": "8 2 . 4 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 488, + 451, + 503 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 452, + 490, + 462, + 500 + ], + "score": 0.79, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 488, + 507, + 503 + ], + "score": 1.0, + "content": "is known,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 500, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 474, + 513 + ], + "score": 1.0, + "content": "CCN has a relatively small drop. Compared to the second best algorithm, CSP, which is", + "type": "text" + }, + { + "bbox": [ + 475, + 500, + 502, + 511 + ], + "score": 0.87, + "content": "6 5 . 4 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 500, + 506, + 513 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 510, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 510, + 506, + 525 + ], + "score": 1.0, + "content": "CCN outperforms it with a large gap. The classical approach MPCK-means works surprisingly well", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 522, + 506, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 465, + 535 + ], + "score": 1.0, + "content": "when the number of clusters is known, but its performance dropped dramatically from", + "type": "text" + }, + { + "bbox": [ + 465, + 523, + 493, + 533 + ], + "score": 0.86, + "content": "8 1 . 9 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 522, + 506, + 535 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 532, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 106, + 533, + 133, + 544 + ], + "score": 0.86, + "content": "5 3 . 9 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 532, + 157, + 545 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 158, + 533, + 196, + 544 + ], + "score": 0.93, + "content": "K = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 532, + 506, + 545 + ], + "score": 1.0, + "content": ". In the performance breakdown for the 20 individual alphabets, CCN achieved", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 543, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 106, + 545, + 126, + 555 + ], + "score": 0.86, + "content": "94 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 543, + 505, + 557 + ], + "score": 1.0, + "content": "clustering accuracy on Old Church Slavonic Cyrillic, which has 45 characters (appendix table", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 554, + 506, + 569 + ], + "spans": [ + { + "bbox": [ + 104, + 554, + 506, + 569 + ], + "score": 1.0, + "content": "5). Therefore the results show the feasibility of reconstructing semantic clusters using only noisy", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 566, + 197, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 197, + 579 + ], + "score": 1.0, + "content": "similarity predictions.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 106, + 582, + 505, + 672 + ], + "lines": [ + { + "bbox": [ + 105, + 582, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 505, + 596 + ], + "score": 1.0, + "content": "When to use the semantic similarity? The experiments in table 1 show a clear trend that utilizing", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 594, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 506, + 606 + ], + "score": 1.0, + "content": "the pairwise constraints jointly for both metric learning and minimizing the clustering loss achieves", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "score": 1.0, + "content": "the best performance, including both MPCK-means and CCN. In the case of unknown number of", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 616, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 201, + 628 + ], + "score": 1.0, + "content": "clusters, where we set", + "type": "text" + }, + { + "bbox": [ + 201, + 616, + 243, + 626 + ], + "score": 0.91, + "content": "K = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 616, + 505, + 628 + ], + "score": 1.0, + "content": ", the algorithms that use constraints to optimize clustering loss", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "have better robustness, for example, CSP and CCN. The group that only use constraints for metric", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 104, + 637, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 104, + 637, + 506, + 651 + ], + "score": 1.0, + "content": "learning (ITML, SKMS, SKKm, and SKLR) significantly outperform the group that does not use it", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "score": 1.0, + "content": "(K-means, LPNMF, LSC). However, their performance are still far behind CCN. Our results confirm", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 660, + 357, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 357, + 673 + ], + "score": 1.0, + "content": "the importance of jointly optimizing the metric and clustering.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 107, + 677, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "The robustness against noisy similarity prediction is the key factor to enable the cross-task transfer", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 686, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 505, + 700 + ], + "score": 1.0, + "content": "framework. To the best of our knowledge, table 1 is the first comprehensive robustness comparisons", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "using predicted constraints learned from real data instead of converting from ground-truth labels.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 173, + 722 + ], + "score": 1.0, + "content": "The accuracy of", + "type": "text" + }, + { + "bbox": [ + 173, + 710, + 182, + 720 + ], + "score": 0.84, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "in our experiment is shown in appendix table 7 and demonstrates the reasonable", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 172, + 734 + ], + "score": 1.0, + "content": "performance of", + "type": "text" + }, + { + "bbox": [ + 172, + 721, + 181, + 730 + ], + "score": 0.82, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "which is on par with Matching-Net (Vinyals et al., 2016). After binarizing the", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 39 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 300, + 750, + 309, + 761 + ], + "spans": [ + { + "bbox": [ + 300, + 750, + 309, + 761 + ], + "score": 1.0, + "content": "8", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 131, + 145, + 480, + 294 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 88, + 505, + 144 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 88, + 505, + 102 + ], + "spans": [ + { + "bbox": [ + 105, + 88, + 340, + 102 + ], + "score": 1.0, + "content": "Table 1: Unsupervised cross-task transfer from Omniglot", + "type": "text" + }, + { + "bbox": [ + 340, + 91, + 349, + 101 + ], + "score": 0.39, + "content": "b g", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 88, + 361, + 102 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 361, + 90, + 420, + 101 + ], + "score": 0.25, + "content": "O m n i g l o t _ { e v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 88, + 505, + 102 + ], + "score": 1.0, + "content": ". The performance is", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 101, + 505, + 113 + ], + "spans": [ + { + "bbox": [ + 106, + 101, + 505, + 113 + ], + "score": 1.0, + "content": "averaged across 20 alphabets which have 20 to 47 letters. The ACC and NMI without brackets have", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 111, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 444, + 123 + ], + "score": 1.0, + "content": "the number of clusters equal to ground-truth. The \"(100)\" means the algorithms use", + "type": "text" + }, + { + "bbox": [ + 444, + 111, + 483, + 122 + ], + "score": 0.9, + "content": "K = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 111, + 505, + 123 + ], + "score": 1.0, + "content": ". The", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 122, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 505, + 136 + ], + "score": 1.0, + "content": "characteristics of how each algorithm utilizes the pairwise constraints are marked in the \"Constraints", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 133, + 431, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 133, + 431, + 146 + ], + "score": 1.0, + "content": "in\" column, where metric stands for the metric learning of feature representation.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "table_body", + "bbox": [ + 131, + 145, + 480, + 294 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 131, + 145, + 480, + 294 + ], + "spans": [ + { + "bbox": [ + 131, + 145, + 480, + 294 + ], + "score": 0.985, + "html": "
MethodConstraints inACCACC (100)NMINMI (100)
MetricClustering
K-means21.7%18.9%0.3530.464
LPNMF22.2%16.3%0.3720.498
LSC23.6%18.0%0.3760.500
ITML056.7%47.2%0.6740.727
SKMS0=45.5%10.693
SKKm062.4%46.9%0.7700.781
SKLR066.9%46.8%0.7910.760
CSP062.5%65.4%0.8120.812
MPCK-means0081.9%53.9%0.8710.816
CCN (Ours)0082.4%78.1%0.8890.874
", + "type": "table", + "image_path": "2ae0c7337bcbc45fa8408cbf5514b9f871c789e8f5603902752e52690914bc95.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 131, + 145, + 480, + 194.66666666666666 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 131, + 194.66666666666666, + 480, + 244.33333333333331 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 131, + 244.33333333333331, + 480, + 294.0 + ], + "spans": [], + "index": 7 + } + ] + } + ], + "index": 4.0 + }, + { + "type": "text", + "bbox": [ + 108, + 316, + 504, + 338 + ], + "lines": [], + "index": 8.5, + "bbox_fs": [ + 106, + 315, + 506, + 340 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 344, + 505, + 432 + ], + "lines": [ + { + "bbox": [ + 106, + 344, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 106, + 344, + 505, + 356 + ], + "score": 1.0, + "content": "The evaluation uses two clustering metrics. The first is normalized-mutual information (NMI) (Strehl", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 354, + 505, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 505, + 368 + ], + "score": 1.0, + "content": "& Ghosh, 2002) which is widely used for clustering. The second one is the clustering accuracy", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 366, + 505, + 379 + ], + "spans": [ + { + "bbox": [ + 105, + 366, + 505, + 379 + ], + "score": 1.0, + "content": "(ACC) (Yang et al., 2010). The ACC metric first finds the one-to-one matching between predicted", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 375, + 507, + 390 + ], + "spans": [ + { + "bbox": [ + 104, + 375, + 507, + 390 + ], + "score": 1.0, + "content": "clusters and ground-truth labels, and then calculates the classification accuracy based on the mapping.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 388, + 505, + 401 + ], + "spans": [ + { + "bbox": [ + 106, + 388, + 505, + 401 + ], + "score": 1.0, + "content": "All data outside the matched clusters will be regarded as mis-predictions. To get high ACC, the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 398, + 507, + 413 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 507, + 413 + ], + "score": 1.0, + "content": "algorithm has to generate coherent clusters where each cluster includes most of the data in a category;", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 411, + 506, + 422 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 506, + 422 + ], + "score": 1.0, + "content": "otherwise the score drops quickly. Therefore ACC provides better discrimination to evaluate whether", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 421, + 312, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 421, + 312, + 432 + ], + "score": 1.0, + "content": "the semantic clusters have been reconstructed well.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 13.5, + "bbox_fs": [ + 104, + 344, + 507, + 432 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 447, + 260, + 459 + ], + "lines": [ + { + "bbox": [ + 106, + 447, + 262, + 460 + ], + "spans": [ + { + "bbox": [ + 106, + 447, + 262, + 460 + ], + "score": 1.0, + "content": "5.1.2 RESULTS AND DISCUSSIONS", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 106, + 467, + 505, + 577 + ], + "lines": [ + { + "bbox": [ + 105, + 466, + 506, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 506, + 481 + ], + "score": 1.0, + "content": "We report the average performance over the 20 alphabets in table 1. Our approach achieved the top", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 478, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 478, + 505, + 491 + ], + "score": 1.0, + "content": "performance on both metrics. The CCN demonstrates strong robustness on the challenging scenario", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 104, + 488, + 507, + 503 + ], + "spans": [ + { + "bbox": [ + 104, + 488, + 158, + 503 + ], + "score": 1.0, + "content": "of unknown", + "type": "text" + }, + { + "bbox": [ + 159, + 490, + 169, + 500 + ], + "score": 0.76, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 488, + 223, + 503 + ], + "score": 1.0, + "content": ". It achieved", + "type": "text" + }, + { + "bbox": [ + 224, + 489, + 252, + 500 + ], + "score": 0.88, + "content": "7 8 . 1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 488, + 397, + 503 + ], + "score": 1.0, + "content": "average accuracy. Compared with", + "type": "text" + }, + { + "bbox": [ + 397, + 489, + 425, + 500 + ], + "score": 0.87, + "content": "8 2 . 4 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 488, + 451, + 503 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 452, + 490, + 462, + 500 + ], + "score": 0.79, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 488, + 507, + 503 + ], + "score": 1.0, + "content": "is known,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 500, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 474, + 513 + ], + "score": 1.0, + "content": "CCN has a relatively small drop. Compared to the second best algorithm, CSP, which is", + "type": "text" + }, + { + "bbox": [ + 475, + 500, + 502, + 511 + ], + "score": 0.87, + "content": "6 5 . 4 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 500, + 506, + 513 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 510, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 510, + 506, + 525 + ], + "score": 1.0, + "content": "CCN outperforms it with a large gap. The classical approach MPCK-means works surprisingly well", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 522, + 506, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 465, + 535 + ], + "score": 1.0, + "content": "when the number of clusters is known, but its performance dropped dramatically from", + "type": "text" + }, + { + "bbox": [ + 465, + 523, + 493, + 533 + ], + "score": 0.86, + "content": "8 1 . 9 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 522, + 506, + 535 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 532, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 106, + 533, + 133, + 544 + ], + "score": 0.86, + "content": "5 3 . 9 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 532, + 157, + 545 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 158, + 533, + 196, + 544 + ], + "score": 0.93, + "content": "K = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 532, + 506, + 545 + ], + "score": 1.0, + "content": ". In the performance breakdown for the 20 individual alphabets, CCN achieved", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 543, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 106, + 545, + 126, + 555 + ], + "score": 0.86, + "content": "94 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 543, + 505, + 557 + ], + "score": 1.0, + "content": "clustering accuracy on Old Church Slavonic Cyrillic, which has 45 characters (appendix table", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 554, + 506, + 569 + ], + "spans": [ + { + "bbox": [ + 104, + 554, + 506, + 569 + ], + "score": 1.0, + "content": "5). Therefore the results show the feasibility of reconstructing semantic clusters using only noisy", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 566, + 197, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 197, + 579 + ], + "score": 1.0, + "content": "similarity predictions.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 23.5, + "bbox_fs": [ + 104, + 466, + 507, + 579 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 582, + 505, + 672 + ], + "lines": [ + { + "bbox": [ + 105, + 582, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 505, + 596 + ], + "score": 1.0, + "content": "When to use the semantic similarity? The experiments in table 1 show a clear trend that utilizing", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 594, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 506, + 606 + ], + "score": 1.0, + "content": "the pairwise constraints jointly for both metric learning and minimizing the clustering loss achieves", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "score": 1.0, + "content": "the best performance, including both MPCK-means and CCN. In the case of unknown number of", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 616, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 201, + 628 + ], + "score": 1.0, + "content": "clusters, where we set", + "type": "text" + }, + { + "bbox": [ + 201, + 616, + 243, + 626 + ], + "score": 0.91, + "content": "K = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 616, + 505, + 628 + ], + "score": 1.0, + "content": ", the algorithms that use constraints to optimize clustering loss", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "have better robustness, for example, CSP and CCN. The group that only use constraints for metric", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 104, + 637, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 104, + 637, + 506, + 651 + ], + "score": 1.0, + "content": "learning (ITML, SKMS, SKKm, and SKLR) significantly outperform the group that does not use it", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "score": 1.0, + "content": "(K-means, LPNMF, LSC). However, their performance are still far behind CCN. Our results confirm", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 660, + 357, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 357, + 673 + ], + "score": 1.0, + "content": "the importance of jointly optimizing the metric and clustering.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 32.5, + "bbox_fs": [ + 104, + 582, + 506, + 673 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 677, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "The robustness against noisy similarity prediction is the key factor to enable the cross-task transfer", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 686, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 505, + 700 + ], + "score": 1.0, + "content": "framework. To the best of our knowledge, table 1 is the first comprehensive robustness comparisons", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "using predicted constraints learned from real data instead of converting from ground-truth labels.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 173, + 722 + ], + "score": 1.0, + "content": "The accuracy of", + "type": "text" + }, + { + "bbox": [ + 173, + 710, + 182, + 720 + ], + "score": 0.84, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "in our experiment is shown in appendix table 7 and demonstrates the reasonable", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 172, + 734 + ], + "score": 1.0, + "content": "performance of", + "type": "text" + }, + { + "bbox": [ + 172, + 721, + 181, + 730 + ], + "score": 0.82, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "which is on par with Matching-Net (Vinyals et al., 2016). After binarizing the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 104, + 82, + 507, + 96 + ], + "spans": [ + { + "bbox": [ + 104, + 82, + 507, + 96 + ], + "score": 1.0, + "content": "prediction at 0.5 probability, the similar pair precision, similar pair recall, dissimilar pair precision,", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "score": 1.0, + "content": "and dissimilar pair recall among the 659 characters are (0.392, 0.927, 0.999, 0.995), accordingly. The", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "score": 1.0, + "content": "binarized predictions are better than uniform random guess (0.002, 0.500, 0.998, 0.500), but are still", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "noisy. Therefore it is very challenging for constrained clustering. The visualization of the robustness", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 140 + ], + "score": 1.0, + "content": "range of CCN are provided in appendix D, and shows that the robustness is related to the density", + "type": "text", + "cross_page": true + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 506, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 506, + 150 + ], + "score": 1.0, + "content": "of pairs involved in a mini-batch. We hypothesize that during the optimization, the gradients from", + "type": "text", + "cross_page": true + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 149, + 505, + 161 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 505, + 161 + ], + "score": 1.0, + "content": "wrongly predicted pairs are canceled out by each other or by the correctly predicted pairs. Therefore", + "type": "text", + "cross_page": true + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 159, + 416, + 171 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 416, + 171 + ], + "score": 1.0, + "content": "the overall gradient still moves the solution towards a better clustering result.", + "type": "text", + "cross_page": true + } + ], + "index": 7 + } + ], + "index": 39, + "bbox_fs": [ + 105, + 676, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 170 + ], + "lines": [ + { + "bbox": [ + 104, + 82, + 507, + 96 + ], + "spans": [ + { + "bbox": [ + 104, + 82, + 507, + 96 + ], + "score": 1.0, + "content": "prediction at 0.5 probability, the similar pair precision, similar pair recall, dissimilar pair precision,", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "score": 1.0, + "content": "and dissimilar pair recall among the 659 characters are (0.392, 0.927, 0.999, 0.995), accordingly. The", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "score": 1.0, + "content": "binarized predictions are better than uniform random guess (0.002, 0.500, 0.998, 0.500), but are still", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "noisy. Therefore it is very challenging for constrained clustering. The visualization of the robustness", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 140 + ], + "score": 1.0, + "content": "range of CCN are provided in appendix D, and shows that the robustness is related to the density", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 506, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 506, + 150 + ], + "score": 1.0, + "content": "of pairs involved in a mini-batch. We hypothesize that during the optimization, the gradients from", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 149, + 505, + 161 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 505, + 161 + ], + "score": 1.0, + "content": "wrongly predicted pairs are canceled out by each other or by the correctly predicted pairs. Therefore", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 159, + 416, + 171 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 416, + 171 + ], + "score": 1.0, + "content": "the overall gradient still moves the solution towards a better clustering result.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 107, + 176, + 505, + 336 + ], + "lines": [ + { + "bbox": [ + 106, + 176, + 505, + 188 + ], + "spans": [ + { + "bbox": [ + 106, + 176, + 172, + 188 + ], + "score": 1.0, + "content": "How to predict", + "type": "text" + }, + { + "bbox": [ + 172, + 176, + 188, + 186 + ], + "score": 0.71, + "content": "K ?", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 176, + 320, + 188 + ], + "score": 1.0, + "content": "Inferring the number of clusters", + "type": "text" + }, + { + "bbox": [ + 320, + 176, + 343, + 187 + ], + "score": 0.48, + "content": "( N C )", + "type": "inline_equation" + }, + { + "bbox": [ + 344, + 176, + 505, + 188 + ], + "score": 1.0, + "content": "is a hard problem, but with the pairwise", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 188, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 106, + 188, + 505, + 199 + ], + "score": 1.0, + "content": "similarity information, it becomes feasible. For evaluation, we compute the difference between", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 197, + 506, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 244, + 211 + ], + "score": 1.0, + "content": "the number of dominant clusters", + "type": "text" + }, + { + "bbox": [ + 244, + 198, + 276, + 209 + ], + "score": 0.7, + "content": "( N D C )", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 197, + 421, + 211 + ], + "score": 1.0, + "content": "and the true number of categories", + "type": "text" + }, + { + "bbox": [ + 421, + 198, + 453, + 209 + ], + "score": 0.89, + "content": "( N C ^ { g t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 197, + 506, + 211 + ], + "score": 1.0, + "content": "in a dataset.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 228, + 222 + ], + "score": 1.0, + "content": "We use a naive definition for", + "type": "text" + }, + { + "bbox": [ + 228, + 209, + 254, + 220 + ], + "score": 0.74, + "content": "N D C", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 209, + 505, + 222 + ], + "score": 1.0, + "content": ", which is the number of clusters that have a size larger than", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 103, + 216, + 502, + 237 + ], + "spans": [ + { + "bbox": [ + 103, + 216, + 372, + 237 + ], + "score": 1.0, + "content": "expected size when data is sampled uniformly. In other words,", + "type": "text" + }, + { + "bbox": [ + 373, + 220, + 502, + 234 + ], + "score": 0.87, + "content": "\\begin{array} { r } { N D C = \\sum _ { i = 1 } ^ { K } \\left[ C _ { i } > = \\bar { E } [ C _ { i } ] \\right] } \\end{array}", + "type": "inline_equation" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 232, + 506, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 134, + 246 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 135, + 233, + 144, + 245 + ], + "score": 0.71, + "content": "[ \\cdot ]", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 232, + 254, + 246 + ], + "score": 1.0, + "content": "is an Iverson Bracket and", + "type": "text" + }, + { + "bbox": [ + 255, + 233, + 266, + 244 + ], + "score": 0.87, + "content": "C _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 232, + 355, + 246 + ], + "score": 1.0, + "content": "is the size of cluster", + "type": "text" + }, + { + "bbox": [ + 355, + 234, + 360, + 243 + ], + "score": 0.59, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 232, + 424, + 246 + ], + "score": 1.0, + "content": ". For example,", + "type": "text" + }, + { + "bbox": [ + 424, + 234, + 449, + 245 + ], + "score": 0.89, + "content": "\\bar { E } [ \\bar { C } _ { i } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 232, + 506, + 246 + ], + "score": 1.0, + "content": "will be 10 if", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 243, + 506, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 243, + 246, + 257 + ], + "score": 1.0, + "content": "the alphabet has 1000 images and", + "type": "text" + }, + { + "bbox": [ + 246, + 244, + 285, + 254 + ], + "score": 0.9, + "content": "K = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 243, + 405, + 257 + ], + "score": 1.0, + "content": ". Then the average difference", + "type": "text" + }, + { + "bbox": [ + 406, + 244, + 438, + 255 + ], + "score": 0.89, + "content": "( A D i f )", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 243, + 506, + 257 + ], + "score": 1.0, + "content": "is calculated by", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 253, + 504, + 272 + ], + "spans": [ + { + "bbox": [ + 106, + 255, + 263, + 271 + ], + "score": 0.91, + "content": "\\begin{array} { r } { A D i f = \\frac { 1 } { | D | } \\sum _ { d \\in D } { | N D C _ { d } - N C _ { d } ^ { g t } | } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 253, + 294, + 272 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 294, + 256, + 301, + 266 + ], + "score": 0.72, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 253, + 420, + 272 + ], + "score": 1.0, + "content": "(i.e., alphabet) is a dataset in", + "type": "text" + }, + { + "bbox": [ + 420, + 257, + 430, + 266 + ], + "score": 0.78, + "content": "D", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 253, + 477, + 272 + ], + "score": 1.0, + "content": ". A smaller", + "type": "text" + }, + { + "bbox": [ + 477, + 256, + 504, + 268 + ], + "score": 0.84, + "content": "A D i f", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 227, + 281 + ], + "score": 1.0, + "content": "indicates a better estimate of", + "type": "text" + }, + { + "bbox": [ + 228, + 270, + 238, + 279 + ], + "score": 0.79, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 268, + 505, + 281 + ], + "score": 1.0, + "content": ". CCN achieves a score of 6.35 (appendix table 6). We compare", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 280, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 106, + 280, + 476, + 293 + ], + "score": 1.0, + "content": "this with the baseline approach SKMS (Anand et al., 2014), which does not require a given", + "type": "text" + }, + { + "bbox": [ + 477, + 281, + 487, + 290 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 280, + 505, + 293 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 291, + 504, + 303 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 231, + 303 + ], + "score": 1.0, + "content": "supports a pipeline to estimate", + "type": "text" + }, + { + "bbox": [ + 231, + 291, + 241, + 301 + ], + "score": 0.82, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 291, + 465, + 303 + ], + "score": 1.0, + "content": "automatically (therefore we only put it into the column", + "type": "text" + }, + { + "bbox": [ + 465, + 291, + 504, + 302 + ], + "score": 0.89, + "content": "K = 1 0 0", + "type": "inline_equation" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 302, + 506, + 315 + ], + "spans": [ + { + "bbox": [ + 106, + 302, + 506, + 315 + ], + "score": 1.0, + "content": "in table 1.). SKMS gets 16.3. Furthermore, 10 out of 20 datasets from CCN’s prediction have a", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 101, + 311, + 506, + 331 + ], + "spans": [ + { + "bbox": [ + 101, + 311, + 183, + 331 + ], + "score": 1.0, + "content": "difference between", + "type": "text" + }, + { + "bbox": [ + 183, + 314, + 214, + 325 + ], + "score": 0.91, + "content": "N D C _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 311, + 231, + 331 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 231, + 313, + 257, + 327 + ], + "score": 0.92, + "content": "N C _ { d } ^ { g t }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 311, + 506, + 331 + ], + "score": 1.0, + "content": "smaller or equal to 3, which shows the feasibility of estimating", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 107, + 324, + 221, + 338 + ], + "spans": [ + { + "bbox": [ + 107, + 326, + 117, + 335 + ], + "score": 0.79, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 324, + 221, + 338 + ], + "score": 1.0, + "content": "with predicted similarity.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 14.5 + }, + { + "type": "title", + "bbox": [ + 107, + 349, + 340, + 360 + ], + "lines": [ + { + "bbox": [ + 105, + 348, + 342, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 348, + 342, + 362 + ], + "score": 1.0, + "content": "5.1.3 EXPERIMENTS USING THE IMAGENET DATASET", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 106, + 368, + 505, + 500 + ], + "lines": [ + { + "bbox": [ + 104, + 368, + 507, + 382 + ], + "spans": [ + { + "bbox": [ + 104, + 368, + 507, + 382 + ], + "score": 1.0, + "content": "To demonstrate the scalability of our approach, we applied the same scheme on the ImageNet dataset.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 379, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 506, + 393 + ], + "score": 1.0, + "content": "The 1000-class dataset is separated into 882-class (ImageNet882) and 118-class (ImageNet118)", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 391, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 106, + 391, + 433, + 403 + ], + "score": 1.0, + "content": "subsets as the random split in Vinyals et al. (2016). We use ImageN et882 for", + "type": "text" + }, + { + "bbox": [ + 433, + 391, + 442, + 401 + ], + "score": 0.7, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 391, + 505, + 403 + ], + "score": 1.0, + "content": "and 30 classes", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 402, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 109, + 414 + ], + "score": 0.0, + "content": "", + "type": "text" + }, + { + "bbox": [ + 109, + 402, + 134, + 412 + ], + "score": 0.82, + "content": "\\mathrm { \\sim } 3 9 \\mathrm { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 402, + 282, + 414 + ], + "score": 1.0, + "content": "images) are randomly sampled from", + "type": "text" + }, + { + "bbox": [ + 282, + 402, + 342, + 413 + ], + "score": 0.7, + "content": "I m a g e N e t _ { 1 1 8 }", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 402, + 357, + 414 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 357, + 402, + 366, + 412 + ], + "score": 0.61, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 402, + 505, + 414 + ], + "score": 1.0, + "content": ". The difference from section 5.1.1", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 413, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 413, + 260, + 425 + ], + "score": 1.0, + "content": "is that here we use Resnet-18 for both", + "type": "text" + }, + { + "bbox": [ + 260, + 413, + 269, + 423 + ], + "score": 0.78, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 413, + 505, + 425 + ], + "score": 1.0, + "content": "and CCN, and the weights of the backbone are pre-trained", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 423, + 506, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 506, + 436 + ], + "score": 1.0, + "content": "with ImageN et882. Since the number of pairs is high and it is not feasible to feed them into other", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 435, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 505, + 447 + ], + "score": 1.0, + "content": "constrained clustering algorithms, we compare CCN with K-means, LSC(Chen & Cai, 2011), and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 445, + 506, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 506, + 458 + ], + "score": 1.0, + "content": "LPNMF (Cai et al., 2009). We use the output from the average pooling layer of Resnet-18 as the input", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 457, + 506, + 468 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 432, + 468 + ], + "score": 1.0, + "content": "to these clustering algorithms. CCN gives the top performance with average ACC", + "type": "text" + }, + { + "bbox": [ + 432, + 457, + 459, + 467 + ], + "score": 0.85, + "content": "7 3 . 8 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 457, + 484, + 468 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 484, + 457, + 495, + 466 + ], + "score": 0.82, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 457, + 506, + 468 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 155, + 480 + ], + "score": 1.0, + "content": "known, and", + "type": "text" + }, + { + "bbox": [ + 155, + 468, + 183, + 478 + ], + "score": 0.86, + "content": "6 5 . 2 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 468, + 475, + 480 + ], + "score": 1.0, + "content": "when the number of clusters is unknown, which outperforms the second", + "type": "text" + }, + { + "bbox": [ + 475, + 468, + 505, + 478 + ], + "score": 0.84, + "content": "( 3 4 . 5 \\%", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 478, + 506, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 506, + 492 + ], + "score": 1.0, + "content": "by K-means) with a large margin. The full comparison is in appendix table 8. And the performance", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 489, + 256, + 502 + ], + "spans": [ + { + "bbox": [ + 106, + 489, + 117, + 502 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 118, + 490, + 126, + 499 + ], + "score": 0.83, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 489, + 256, + 502 + ], + "score": 1.0, + "content": "is provided in appendix table 9.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 28.5 + }, + { + "type": "title", + "bbox": [ + 107, + 515, + 367, + 526 + ], + "lines": [ + { + "bbox": [ + 105, + 514, + 369, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 369, + 527 + ], + "score": 1.0, + "content": "5.2 UNSUPERVISED CROSS-DOMAIN TRANSFER LEARNING", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "title", + "bbox": [ + 107, + 535, + 168, + 547 + ], + "lines": [ + { + "bbox": [ + 105, + 534, + 170, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 170, + 549 + ], + "score": 1.0, + "content": "5.2.1 SETUP", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 107, + 555, + 505, + 610 + ], + "lines": [ + { + "bbox": [ + 106, + 555, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 505, + 567 + ], + "score": 1.0, + "content": "Office-31 (Saenko et al., 2010) has images from 31 categories of office objects. The 4652 images are", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 565, + 504, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 565, + 263, + 577 + ], + "score": 1.0, + "content": "obtained from three domains: Amazon", + "type": "text" + }, + { + "bbox": [ + 263, + 567, + 276, + 577 + ], + "score": 0.55, + "content": "( a )", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 565, + 307, + 577 + ], + "score": 1.0, + "content": ", DSLR", + "type": "text" + }, + { + "bbox": [ + 308, + 567, + 320, + 577 + ], + "score": 0.69, + "content": "( d )", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 565, + 378, + 577 + ], + "score": 1.0, + "content": ", and Webcam", + "type": "text" + }, + { + "bbox": [ + 378, + 567, + 393, + 577 + ], + "score": 0.66, + "content": "( w )", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 565, + 504, + 577 + ], + "score": 1.0, + "content": ". The dataset is the standard", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 576, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 505, + 590 + ], + "score": 1.0, + "content": "benchmark for evaluating domain adaptation performance in computer vision. We experiment with", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 586, + 506, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 223, + 601 + ], + "score": 1.0, + "content": "all six combinations (source", + "type": "text" + }, + { + "bbox": [ + 224, + 588, + 283, + 599 + ], + "score": 0.63, + "content": "S ^ { \\prime } \\to \\mathrm { t a r g e t } T", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 586, + 290, + 601 + ], + "score": 1.0, + "content": "):", + "type": "text" + }, + { + "bbox": [ + 291, + 589, + 320, + 599 + ], + "score": 0.83, + "content": "a w", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 586, + 324, + 601 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 324, + 588, + 352, + 599 + ], + "score": 0.83, + "content": "a \\to d", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 586, + 356, + 601 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 356, + 588, + 383, + 599 + ], + "score": 0.82, + "content": "d \\to a", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 586, + 387, + 601 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 387, + 588, + 416, + 599 + ], + "score": 0.83, + "content": "d \\to w", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 586, + 420, + 601 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 421, + 589, + 450, + 599 + ], + "score": 0.76, + "content": "w a", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 586, + 454, + 601 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 455, + 588, + 484, + 598 + ], + "score": 0.85, + "content": "w \\to d", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 586, + 506, + 601 + ], + "score": 1.0, + "content": ", and", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 598, + 423, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 423, + 613 + ], + "score": 1.0, + "content": "report the average accuracy based on five random experiments for each setting.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 107, + 615, + 504, + 660 + ], + "lines": [ + { + "bbox": [ + 106, + 616, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 126, + 628 + ], + "score": 1.0, + "content": "The", + "type": "text" + }, + { + "bbox": [ + 127, + 616, + 136, + 626 + ], + "score": 0.7, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 136, + 616, + 453, + 628 + ], + "score": 1.0, + "content": "function learns the semantic similarity function from the auxiliary dataset", + "type": "text" + }, + { + "bbox": [ + 453, + 617, + 462, + 626 + ], + "score": 0.69, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 616, + 506, + 628 + ], + "score": 1.0, + "content": ", which is", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 359, + 639 + ], + "score": 1.0, + "content": "ImageNet with all 1000 categories. The backbone network of", + "type": "text" + }, + { + "bbox": [ + 359, + 627, + 368, + 637 + ], + "score": 0.82, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "is Resnet-18 and has the weights", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "score": 1.0, + "content": "initialized by ImageNet classification. The training process is the same as section 5.1.1 except the", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 649, + 213, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 213, + 660 + ], + "score": 1.0, + "content": "images are resized to 224.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43.5 + }, + { + "type": "text", + "bbox": [ + 107, + 666, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 665, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 506, + 678 + ], + "score": 1.0, + "content": "We follow the standard protocols using deep neural networks (Long et al., 2017; Ganin et al., 2016)", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 677, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 360, + 689 + ], + "score": 1.0, + "content": "for unsupervised domain adaptation. The backbone network of", + "type": "text" + }, + { + "bbox": [ + 360, + 677, + 386, + 687 + ], + "score": 0.83, + "content": "\\mathrm { C C N ^ { + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 677, + 506, + 689 + ], + "score": 1.0, + "content": "is pre-trained with ImageNet.", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 687, + 507, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 507, + 700 + ], + "score": 1.0, + "content": "Appendix figure 7 illustrates the scheme. During the training, all source data and target data are used.", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "Each mini-batch is constructed by 32 labeled samples from source and 96 unlabeled samples from", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "target. Since the target dataset has no labels and could only be randomly sampled, it is crucial to", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "have sufficient mini-batch size to ensure that similar pairs are sampled. The loss function used in our", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 48.5 + } + ], + "page_idx": 8, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "9", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 170 + ], + "lines": [], + "index": 3.5, + "bbox_fs": [ + 104, + 82, + 507, + 171 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 176, + 505, + 336 + ], + "lines": [ + { + "bbox": [ + 106, + 176, + 505, + 188 + ], + "spans": [ + { + "bbox": [ + 106, + 176, + 172, + 188 + ], + "score": 1.0, + "content": "How to predict", + "type": "text" + }, + { + "bbox": [ + 172, + 176, + 188, + 186 + ], + "score": 0.71, + "content": "K ?", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 176, + 320, + 188 + ], + "score": 1.0, + "content": "Inferring the number of clusters", + "type": "text" + }, + { + "bbox": [ + 320, + 176, + 343, + 187 + ], + "score": 0.48, + "content": "( N C )", + "type": "inline_equation" + }, + { + "bbox": [ + 344, + 176, + 505, + 188 + ], + "score": 1.0, + "content": "is a hard problem, but with the pairwise", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 188, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 106, + 188, + 505, + 199 + ], + "score": 1.0, + "content": "similarity information, it becomes feasible. For evaluation, we compute the difference between", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 197, + 506, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 244, + 211 + ], + "score": 1.0, + "content": "the number of dominant clusters", + "type": "text" + }, + { + "bbox": [ + 244, + 198, + 276, + 209 + ], + "score": 0.7, + "content": "( N D C )", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 197, + 421, + 211 + ], + "score": 1.0, + "content": "and the true number of categories", + "type": "text" + }, + { + "bbox": [ + 421, + 198, + 453, + 209 + ], + "score": 0.89, + "content": "( N C ^ { g t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 197, + 506, + 211 + ], + "score": 1.0, + "content": "in a dataset.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 228, + 222 + ], + "score": 1.0, + "content": "We use a naive definition for", + "type": "text" + }, + { + "bbox": [ + 228, + 209, + 254, + 220 + ], + "score": 0.74, + "content": "N D C", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 209, + 505, + 222 + ], + "score": 1.0, + "content": ", which is the number of clusters that have a size larger than", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 103, + 216, + 502, + 237 + ], + "spans": [ + { + "bbox": [ + 103, + 216, + 372, + 237 + ], + "score": 1.0, + "content": "expected size when data is sampled uniformly. In other words,", + "type": "text" + }, + { + "bbox": [ + 373, + 220, + 502, + 234 + ], + "score": 0.87, + "content": "\\begin{array} { r } { N D C = \\sum _ { i = 1 } ^ { K } \\left[ C _ { i } > = \\bar { E } [ C _ { i } ] \\right] } \\end{array}", + "type": "inline_equation" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 232, + 506, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 134, + 246 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 135, + 233, + 144, + 245 + ], + "score": 0.71, + "content": "[ \\cdot ]", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 232, + 254, + 246 + ], + "score": 1.0, + "content": "is an Iverson Bracket and", + "type": "text" + }, + { + "bbox": [ + 255, + 233, + 266, + 244 + ], + "score": 0.87, + "content": "C _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 232, + 355, + 246 + ], + "score": 1.0, + "content": "is the size of cluster", + "type": "text" + }, + { + "bbox": [ + 355, + 234, + 360, + 243 + ], + "score": 0.59, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 232, + 424, + 246 + ], + "score": 1.0, + "content": ". For example,", + "type": "text" + }, + { + "bbox": [ + 424, + 234, + 449, + 245 + ], + "score": 0.89, + "content": "\\bar { E } [ \\bar { C } _ { i } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 232, + 506, + 246 + ], + "score": 1.0, + "content": "will be 10 if", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 243, + 506, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 243, + 246, + 257 + ], + "score": 1.0, + "content": "the alphabet has 1000 images and", + "type": "text" + }, + { + "bbox": [ + 246, + 244, + 285, + 254 + ], + "score": 0.9, + "content": "K = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 243, + 405, + 257 + ], + "score": 1.0, + "content": ". Then the average difference", + "type": "text" + }, + { + "bbox": [ + 406, + 244, + 438, + 255 + ], + "score": 0.89, + "content": "( A D i f )", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 243, + 506, + 257 + ], + "score": 1.0, + "content": "is calculated by", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 253, + 504, + 272 + ], + "spans": [ + { + "bbox": [ + 106, + 255, + 263, + 271 + ], + "score": 0.91, + "content": "\\begin{array} { r } { A D i f = \\frac { 1 } { | D | } \\sum _ { d \\in D } { | N D C _ { d } - N C _ { d } ^ { g t } | } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 253, + 294, + 272 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 294, + 256, + 301, + 266 + ], + "score": 0.72, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 253, + 420, + 272 + ], + "score": 1.0, + "content": "(i.e., alphabet) is a dataset in", + "type": "text" + }, + { + "bbox": [ + 420, + 257, + 430, + 266 + ], + "score": 0.78, + "content": "D", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 253, + 477, + 272 + ], + "score": 1.0, + "content": ". A smaller", + "type": "text" + }, + { + "bbox": [ + 477, + 256, + 504, + 268 + ], + "score": 0.84, + "content": "A D i f", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 227, + 281 + ], + "score": 1.0, + "content": "indicates a better estimate of", + "type": "text" + }, + { + "bbox": [ + 228, + 270, + 238, + 279 + ], + "score": 0.79, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 268, + 505, + 281 + ], + "score": 1.0, + "content": ". CCN achieves a score of 6.35 (appendix table 6). We compare", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 280, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 106, + 280, + 476, + 293 + ], + "score": 1.0, + "content": "this with the baseline approach SKMS (Anand et al., 2014), which does not require a given", + "type": "text" + }, + { + "bbox": [ + 477, + 281, + 487, + 290 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 280, + 505, + 293 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 291, + 504, + 303 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 231, + 303 + ], + "score": 1.0, + "content": "supports a pipeline to estimate", + "type": "text" + }, + { + "bbox": [ + 231, + 291, + 241, + 301 + ], + "score": 0.82, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 291, + 465, + 303 + ], + "score": 1.0, + "content": "automatically (therefore we only put it into the column", + "type": "text" + }, + { + "bbox": [ + 465, + 291, + 504, + 302 + ], + "score": 0.89, + "content": "K = 1 0 0", + "type": "inline_equation" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 302, + 506, + 315 + ], + "spans": [ + { + "bbox": [ + 106, + 302, + 506, + 315 + ], + "score": 1.0, + "content": "in table 1.). SKMS gets 16.3. Furthermore, 10 out of 20 datasets from CCN’s prediction have a", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 101, + 311, + 506, + 331 + ], + "spans": [ + { + "bbox": [ + 101, + 311, + 183, + 331 + ], + "score": 1.0, + "content": "difference between", + "type": "text" + }, + { + "bbox": [ + 183, + 314, + 214, + 325 + ], + "score": 0.91, + "content": "N D C _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 311, + 231, + 331 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 231, + 313, + 257, + 327 + ], + "score": 0.92, + "content": "N C _ { d } ^ { g t }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 311, + 506, + 331 + ], + "score": 1.0, + "content": "smaller or equal to 3, which shows the feasibility of estimating", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 107, + 324, + 221, + 338 + ], + "spans": [ + { + "bbox": [ + 107, + 326, + 117, + 335 + ], + "score": 0.79, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 324, + 221, + 338 + ], + "score": 1.0, + "content": "with predicted similarity.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 14.5, + "bbox_fs": [ + 101, + 176, + 506, + 338 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 349, + 340, + 360 + ], + "lines": [ + { + "bbox": [ + 105, + 348, + 342, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 348, + 342, + 362 + ], + "score": 1.0, + "content": "5.1.3 EXPERIMENTS USING THE IMAGENET DATASET", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 106, + 368, + 505, + 500 + ], + "lines": [ + { + "bbox": [ + 104, + 368, + 507, + 382 + ], + "spans": [ + { + "bbox": [ + 104, + 368, + 507, + 382 + ], + "score": 1.0, + "content": "To demonstrate the scalability of our approach, we applied the same scheme on the ImageNet dataset.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 379, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 506, + 393 + ], + "score": 1.0, + "content": "The 1000-class dataset is separated into 882-class (ImageNet882) and 118-class (ImageNet118)", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 391, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 106, + 391, + 433, + 403 + ], + "score": 1.0, + "content": "subsets as the random split in Vinyals et al. (2016). We use ImageN et882 for", + "type": "text" + }, + { + "bbox": [ + 433, + 391, + 442, + 401 + ], + "score": 0.7, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 391, + 505, + 403 + ], + "score": 1.0, + "content": "and 30 classes", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 402, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 109, + 414 + ], + "score": 0.0, + "content": "", + "type": "text" + }, + { + "bbox": [ + 109, + 402, + 134, + 412 + ], + "score": 0.82, + "content": "\\mathrm { \\sim } 3 9 \\mathrm { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 402, + 282, + 414 + ], + "score": 1.0, + "content": "images) are randomly sampled from", + "type": "text" + }, + { + "bbox": [ + 282, + 402, + 342, + 413 + ], + "score": 0.7, + "content": "I m a g e N e t _ { 1 1 8 }", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 402, + 357, + 414 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 357, + 402, + 366, + 412 + ], + "score": 0.61, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 402, + 505, + 414 + ], + "score": 1.0, + "content": ". The difference from section 5.1.1", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 413, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 413, + 260, + 425 + ], + "score": 1.0, + "content": "is that here we use Resnet-18 for both", + "type": "text" + }, + { + "bbox": [ + 260, + 413, + 269, + 423 + ], + "score": 0.78, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 413, + 505, + 425 + ], + "score": 1.0, + "content": "and CCN, and the weights of the backbone are pre-trained", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 423, + 506, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 506, + 436 + ], + "score": 1.0, + "content": "with ImageN et882. Since the number of pairs is high and it is not feasible to feed them into other", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 435, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 505, + 447 + ], + "score": 1.0, + "content": "constrained clustering algorithms, we compare CCN with K-means, LSC(Chen & Cai, 2011), and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 445, + 506, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 506, + 458 + ], + "score": 1.0, + "content": "LPNMF (Cai et al., 2009). We use the output from the average pooling layer of Resnet-18 as the input", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 457, + 506, + 468 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 432, + 468 + ], + "score": 1.0, + "content": "to these clustering algorithms. CCN gives the top performance with average ACC", + "type": "text" + }, + { + "bbox": [ + 432, + 457, + 459, + 467 + ], + "score": 0.85, + "content": "7 3 . 8 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 457, + 484, + 468 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 484, + 457, + 495, + 466 + ], + "score": 0.82, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 457, + 506, + 468 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 155, + 480 + ], + "score": 1.0, + "content": "known, and", + "type": "text" + }, + { + "bbox": [ + 155, + 468, + 183, + 478 + ], + "score": 0.86, + "content": "6 5 . 2 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 468, + 475, + 480 + ], + "score": 1.0, + "content": "when the number of clusters is unknown, which outperforms the second", + "type": "text" + }, + { + "bbox": [ + 475, + 468, + 505, + 478 + ], + "score": 0.84, + "content": "( 3 4 . 5 \\%", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 478, + 506, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 506, + 492 + ], + "score": 1.0, + "content": "by K-means) with a large margin. The full comparison is in appendix table 8. And the performance", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 489, + 256, + 502 + ], + "spans": [ + { + "bbox": [ + 106, + 489, + 117, + 502 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 118, + 490, + 126, + 499 + ], + "score": 0.83, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 489, + 256, + 502 + ], + "score": 1.0, + "content": "is provided in appendix table 9.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 28.5, + "bbox_fs": [ + 104, + 368, + 507, + 502 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 515, + 367, + 526 + ], + "lines": [ + { + "bbox": [ + 105, + 514, + 369, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 369, + 527 + ], + "score": 1.0, + "content": "5.2 UNSUPERVISED CROSS-DOMAIN TRANSFER LEARNING", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "title", + "bbox": [ + 107, + 535, + 168, + 547 + ], + "lines": [ + { + "bbox": [ + 105, + 534, + 170, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 170, + 549 + ], + "score": 1.0, + "content": "5.2.1 SETUP", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 107, + 555, + 505, + 610 + ], + "lines": [ + { + "bbox": [ + 106, + 555, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 505, + 567 + ], + "score": 1.0, + "content": "Office-31 (Saenko et al., 2010) has images from 31 categories of office objects. The 4652 images are", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 565, + 504, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 565, + 263, + 577 + ], + "score": 1.0, + "content": "obtained from three domains: Amazon", + "type": "text" + }, + { + "bbox": [ + 263, + 567, + 276, + 577 + ], + "score": 0.55, + "content": "( a )", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 565, + 307, + 577 + ], + "score": 1.0, + "content": ", DSLR", + "type": "text" + }, + { + "bbox": [ + 308, + 567, + 320, + 577 + ], + "score": 0.69, + "content": "( d )", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 565, + 378, + 577 + ], + "score": 1.0, + "content": ", and Webcam", + "type": "text" + }, + { + "bbox": [ + 378, + 567, + 393, + 577 + ], + "score": 0.66, + "content": "( w )", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 565, + 504, + 577 + ], + "score": 1.0, + "content": ". The dataset is the standard", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 576, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 505, + 590 + ], + "score": 1.0, + "content": "benchmark for evaluating domain adaptation performance in computer vision. We experiment with", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 586, + 506, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 223, + 601 + ], + "score": 1.0, + "content": "all six combinations (source", + "type": "text" + }, + { + "bbox": [ + 224, + 588, + 283, + 599 + ], + "score": 0.63, + "content": "S ^ { \\prime } \\to \\mathrm { t a r g e t } T", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 586, + 290, + 601 + ], + "score": 1.0, + "content": "):", + "type": "text" + }, + { + "bbox": [ + 291, + 589, + 320, + 599 + ], + "score": 0.83, + "content": "a w", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 586, + 324, + 601 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 324, + 588, + 352, + 599 + ], + "score": 0.83, + "content": "a \\to d", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 586, + 356, + 601 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 356, + 588, + 383, + 599 + ], + "score": 0.82, + "content": "d \\to a", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 586, + 387, + 601 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 387, + 588, + 416, + 599 + ], + "score": 0.83, + "content": "d \\to w", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 586, + 420, + 601 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 421, + 589, + 450, + 599 + ], + "score": 0.76, + "content": "w a", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 586, + 454, + 601 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 455, + 588, + 484, + 598 + ], + "score": 0.85, + "content": "w \\to d", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 586, + 506, + 601 + ], + "score": 1.0, + "content": ", and", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 598, + 423, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 423, + 613 + ], + "score": 1.0, + "content": "report the average accuracy based on five random experiments for each setting.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 39, + "bbox_fs": [ + 105, + 555, + 506, + 613 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 615, + 504, + 660 + ], + "lines": [ + { + "bbox": [ + 106, + 616, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 126, + 628 + ], + "score": 1.0, + "content": "The", + "type": "text" + }, + { + "bbox": [ + 127, + 616, + 136, + 626 + ], + "score": 0.7, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 136, + 616, + 453, + 628 + ], + "score": 1.0, + "content": "function learns the semantic similarity function from the auxiliary dataset", + "type": "text" + }, + { + "bbox": [ + 453, + 617, + 462, + 626 + ], + "score": 0.69, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 616, + 506, + 628 + ], + "score": 1.0, + "content": ", which is", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 359, + 639 + ], + "score": 1.0, + "content": "ImageNet with all 1000 categories. The backbone network of", + "type": "text" + }, + { + "bbox": [ + 359, + 627, + 368, + 637 + ], + "score": 0.82, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "is Resnet-18 and has the weights", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "score": 1.0, + "content": "initialized by ImageNet classification. The training process is the same as section 5.1.1 except the", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 649, + 213, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 213, + 660 + ], + "score": 1.0, + "content": "images are resized to 224.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43.5, + "bbox_fs": [ + 105, + 616, + 506, + 660 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 666, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 665, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 506, + 678 + ], + "score": 1.0, + "content": "We follow the standard protocols using deep neural networks (Long et al., 2017; Ganin et al., 2016)", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 677, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 360, + 689 + ], + "score": 1.0, + "content": "for unsupervised domain adaptation. The backbone network of", + "type": "text" + }, + { + "bbox": [ + 360, + 677, + 386, + 687 + ], + "score": 0.83, + "content": "\\mathrm { C C N ^ { + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 677, + 506, + 689 + ], + "score": 1.0, + "content": "is pre-trained with ImageNet.", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 687, + 507, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 507, + 700 + ], + "score": 1.0, + "content": "Appendix figure 7 illustrates the scheme. During the training, all source data and target data are used.", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "Each mini-batch is constructed by 32 labeled samples from source and 96 unlabeled samples from", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "target. Since the target dataset has no labels and could only be randomly sampled, it is crucial to", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "have sufficient mini-batch size to ensure that similar pairs are sampled. The loss function used in our", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 223, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 224, + 419, + 236 + ], + "score": 1.0, + "content": "approach is equation (7) and is optimized by stochastic gradient descent. The", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 419, + 223, + 456, + 235 + ], + "score": 0.88, + "content": "\\mathrm { C C N ^ { + / + + } }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 456, + 224, + 505, + 236 + ], + "score": 1.0, + "content": "and DANN", + "type": "text", + "cross_page": true + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 235, + 505, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 505, + 248 + ], + "score": 1.0, + "content": "(RevGrad) with ResNet backbone are implemented with Torch. We use the code from original author", + "type": "text", + "cross_page": true + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 245, + 417, + 259 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 417, + 259 + ], + "score": 1.0, + "content": "for JAN. Both DANN and JAN use a 256-dimension bottleneck feature layer.", + "type": "text", + "cross_page": true + } + ], + "index": 7 + } + ], + "index": 48.5, + "bbox_fs": [ + 105, + 665, + 507, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 106, + 119, + 505, + 204 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 89, + 504, + 112 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 89, + 505, + 102 + ], + "spans": [ + { + "bbox": [ + 106, + 89, + 505, + 102 + ], + "score": 1.0, + "content": "Table 2: Unsupervised cross-domain transfer (domain adaptation) on the Office-31 dataset. The", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 101, + 452, + 112 + ], + "spans": [ + { + "bbox": [ + 106, + 101, + 452, + 112 + ], + "score": 1.0, + "content": "backbone network used here is Resnet-18 (He et al., 2016) pre-trained with ImageNet.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "table_body", + "bbox": [ + 106, + 119, + 505, + 204 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 119, + 505, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 119, + 505, + 204 + ], + "score": 0.982, + "html": "
A→WD→WW→DA→DD→AW→AAvg
Source-Only66.892.896.867.151.453.071.3
DANN (Ganin et al., 2016)73.297.099.069.358.057.875.7
JAN (Long et al., 2017)74.594.199.675.958.759.076.9
CCN+ (ours)76.797.398.271.261.060.577.5
CCN++ (with DANN)78.297.498.673.562.860.678.5
", + "type": "table", + "image_path": "f5936f0f0feec0a34a07606096c3ce59fc69a3f0e85a74616b90a6b7ecc8c3b3.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 106, + 119, + 505, + 147.33333333333334 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 106, + 147.33333333333334, + 505, + 175.66666666666669 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 106, + 175.66666666666669, + 505, + 204.00000000000003 + ], + "spans": [], + "index": 4 + } + ] + } + ], + "index": 1.75 + }, + { + "type": "text", + "bbox": [ + 107, + 224, + 505, + 257 + ], + "lines": [ + { + "bbox": [ + 105, + 223, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 224, + 419, + 236 + ], + "score": 1.0, + "content": "approach is equation (7) and is optimized by stochastic gradient descent. The", + "type": "text" + }, + { + "bbox": [ + 419, + 223, + 456, + 235 + ], + "score": 0.88, + "content": "\\mathrm { C C N ^ { + / + + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 224, + 505, + 236 + ], + "score": 1.0, + "content": "and DANN", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 235, + 505, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 505, + 248 + ], + "score": 1.0, + "content": "(RevGrad) with ResNet backbone are implemented with Torch. We use the code from original author", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 245, + 417, + 259 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 417, + 259 + ], + "score": 1.0, + "content": "for JAN. Both DANN and JAN use a 256-dimension bottleneck feature layer.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "title", + "bbox": [ + 108, + 270, + 261, + 281 + ], + "lines": [ + { + "bbox": [ + 106, + 270, + 262, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 262, + 282 + ], + "score": 1.0, + "content": "5.2.2 RESULTS AND DISCUSSIONS", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 289, + 505, + 443 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 325, + 302 + ], + "score": 1.0, + "content": "The results are summarized in table 2. Our approach", + "type": "text" + }, + { + "bbox": [ + 326, + 290, + 357, + 300 + ], + "score": 0.78, + "content": "\\mathrm { ( C C N ^ { + } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 289, + 505, + 302 + ], + "score": 1.0, + "content": "demonstrates a strong performance", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 300, + 505, + 313 + ], + "spans": [ + { + "bbox": [ + 106, + 300, + 380, + 313 + ], + "score": 1.0, + "content": "boost for the unsupervised cross-domain transfer problem. It reaches", + "type": "text" + }, + { + "bbox": [ + 380, + 300, + 407, + 311 + ], + "score": 0.87, + "content": "7 7 . 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 300, + 505, + 313 + ], + "score": 1.0, + "content": "average accuracy which", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 311, + 506, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 217, + 325 + ], + "score": 1.0, + "content": "gained 6.2 points from the", + "type": "text" + }, + { + "bbox": [ + 218, + 311, + 246, + 322 + ], + "score": 0.88, + "content": "7 1 . 3 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 311, + 506, + 325 + ], + "score": 1.0, + "content": "source-only baseline. Although our approach merely transfers", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 322, + 506, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 469, + 336 + ], + "score": 1.0, + "content": "more information from the auxiliary dataset, it outperforms the strong approach DANN", + "type": "text" + }, + { + "bbox": [ + 469, + 322, + 502, + 334 + ], + "score": 0.85, + "content": "( 7 5 . 7 \\% )", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 322, + 506, + 336 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 334, + 506, + 346 + ], + "spans": [ + { + "bbox": [ + 106, + 334, + 207, + 346 + ], + "score": 1.0, + "content": "and state-of-the-art JAN", + "type": "text" + }, + { + "bbox": [ + 207, + 334, + 239, + 344 + ], + "score": 0.87, + "content": "( 7 6 . 9 \\% )", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 334, + 388, + 346 + ], + "score": 1.0, + "content": ". When combining ours with DANN", + "type": "text" + }, + { + "bbox": [ + 388, + 334, + 423, + 344 + ], + "score": 0.82, + "content": "\\mathrm { ( C C N ^ { + + } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 334, + 506, + 346 + ], + "score": 1.0, + "content": ", the performance is", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 344, + 506, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 506, + 357 + ], + "score": 1.0, + "content": "further boosted. This indicates that LCO helps mitigate the transfer problem in a certain way that is", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 355, + 506, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 355, + 506, + 368 + ], + "score": 1.0, + "content": "orthogonal to minimizing the domain discrepancy. We observe the same trend when using a deeper", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 366, + 505, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 366, + 446, + 379 + ], + "score": 1.0, + "content": "backbone network, i.e., ResNet-34. In such a case the average accuracy achieved is", + "type": "text" + }, + { + "bbox": [ + 446, + 366, + 473, + 377 + ], + "score": 0.85, + "content": "7 7 . 9 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 366, + 477, + 379 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 477, + 366, + 505, + 377 + ], + "score": 0.84, + "content": "8 1 . 1 \\%", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 376, + 506, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 123, + 390 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 377, + 144, + 388 + ], + "score": 0.87, + "content": "82 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 376, + 212, + 390 + ], + "score": 1.0, + "content": "for source-only,", + "type": "text" + }, + { + "bbox": [ + 212, + 377, + 239, + 388 + ], + "score": 0.85, + "content": "\\mathrm { C C N ^ { + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 376, + 258, + 390 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 258, + 377, + 288, + 388 + ], + "score": 0.88, + "content": "\\mathrm { C C N ^ { + + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 376, + 483, + 390 + ], + "score": 1.0, + "content": ", respectively, though we used exactly the same", + "type": "text" + }, + { + "bbox": [ + 484, + 378, + 493, + 388 + ], + "score": 0.81, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 376, + 506, + 390 + ], + "score": 1.0, + "content": "as", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 387, + 505, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 256, + 401 + ], + "score": 1.0, + "content": "before (with ResNet-18 backbone for", + "type": "text" + }, + { + "bbox": [ + 256, + 389, + 265, + 398 + ], + "score": 0.77, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 387, + 505, + 401 + ], + "score": 1.0, + "content": "). This indicates that the information carried in the similarity", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 399, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 505, + 412 + ], + "score": 1.0, + "content": "predictions is not equivalent to transferring features with deeper networks. More discussions are in", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 410, + 506, + 423 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 254, + 423 + ], + "score": 1.0, + "content": "appendix C and the performance of", + "type": "text" + }, + { + "bbox": [ + 254, + 411, + 263, + 420 + ], + "score": 0.83, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 410, + 506, + 423 + ], + "score": 1.0, + "content": "is provided in appendix table 11 to show that although the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 421, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 106, + 421, + 295, + 434 + ], + "score": 1.0, + "content": "prediction has low precision for similar pairs", + "type": "text" + }, + { + "bbox": [ + 295, + 421, + 326, + 432 + ], + "score": 0.83, + "content": "( \\sim 0 . 2 )", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 421, + 505, + 434 + ], + "score": 1.0, + "content": ", our approach still benefits from the dense", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 432, + 196, + 445 + ], + "spans": [ + { + "bbox": [ + 105, + 432, + 196, + 445 + ], + "score": 1.0, + "content": "similarity predictions.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 15.5 + }, + { + "type": "title", + "bbox": [ + 107, + 455, + 315, + 467 + ], + "lines": [ + { + "bbox": [ + 105, + 455, + 316, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 316, + 469 + ], + "score": 1.0, + "content": "5.2.3 EXPERIMENTS USING SVHN-TO-MNIST", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 106, + 475, + 505, + 552 + ], + "lines": [ + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 197, + 487 + ], + "score": 1.0, + "content": "We also evaluated the", + "type": "text" + }, + { + "bbox": [ + 197, + 475, + 224, + 486 + ], + "score": 0.87, + "content": "\\mathrm { C C N ^ { + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 475, + 505, + 487 + ], + "score": 1.0, + "content": "on another widely compared scenario, which uses color Street View", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 486, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 347, + 498 + ], + "score": 1.0, + "content": "House Numbers images (SVHN) (Netzer et al., 2011) as", + "type": "text" + }, + { + "bbox": [ + 347, + 486, + 358, + 496 + ], + "score": 0.85, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 486, + 505, + 498 + ], + "score": 1.0, + "content": ", the gray-scale hand-written digits", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 497, + 504, + 510 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 219, + 510 + ], + "score": 1.0, + "content": "(MNIST) (LeCun, 1998) as", + "type": "text" + }, + { + "bbox": [ + 219, + 498, + 227, + 507 + ], + "score": 0.75, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 497, + 267, + 510 + ], + "score": 1.0, + "content": ". To learn", + "type": "text" + }, + { + "bbox": [ + 267, + 497, + 276, + 507 + ], + "score": 0.74, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 497, + 325, + 510 + ], + "score": 1.0, + "content": ", we use the", + "type": "text" + }, + { + "bbox": [ + 325, + 497, + 377, + 510 + ], + "score": 0.49, + "content": "O m n g l o t _ { b g }", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 497, + 389, + 510 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 389, + 497, + 398, + 507 + ], + "score": 0.63, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 497, + 504, + 510 + ], + "score": 1.0, + "content": ". We train all the networks", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 508, + 504, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 504, + 521 + ], + "score": 1.0, + "content": "in this section from scratch. Our experimental setting is similar to Sener et al. (2016). We achieve the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 519, + 506, + 532 + ], + "spans": [ + { + "bbox": [ + 104, + 519, + 196, + 532 + ], + "score": 1.0, + "content": "top performance with", + "type": "text" + }, + { + "bbox": [ + 196, + 519, + 224, + 530 + ], + "score": 0.87, + "content": "8 9 . 1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 224, + 519, + 506, + 532 + ], + "score": 1.0, + "content": "accuracy. The performance gain from source-only in our approach is", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 530, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 137, + 541 + ], + "score": 0.9, + "content": "+ 3 7 . 1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 530, + 325, + 542 + ], + "score": 1.0, + "content": ", which wins by a large margin compared to the", + "type": "text" + }, + { + "bbox": [ + 326, + 530, + 358, + 541 + ], + "score": 0.9, + "content": "+ 2 3 . 9 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 530, + 505, + 542 + ], + "score": 1.0, + "content": "of LTR (Sener et al., 2016). The full", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 542, + 291, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 291, + 554 + ], + "score": 1.0, + "content": "comparison is presented in appendix table 12.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 27 + }, + { + "type": "title", + "bbox": [ + 108, + 569, + 275, + 581 + ], + "lines": [ + { + "bbox": [ + 105, + 567, + 277, + 584 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 277, + 584 + ], + "score": 1.0, + "content": "6 CONCLUSION AND OUTLOOK", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 594, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "In this paper, we demonstrated the usefulness of transferring information in the form of pairwise", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 605, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 505, + 617 + ], + "score": 1.0, + "content": "similarity predictions. Such information can be transferred as a function and utilized by a loss", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 616, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 505, + 628 + ], + "score": 1.0, + "content": "formulation inspired from constrained clustering, but implemented more robustly within a neural", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 627, + 506, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 506, + 640 + ], + "score": 1.0, + "content": "network that can jointly optimize both features and clustering outputs based on these noisy predictions.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "score": 1.0, + "content": "The experiments for both cross-task and cross-domain transfer learning show strong benefits of using", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "score": 1.0, + "content": "the semantic similarity predictions resulting in new state of the art results across several datasets. This", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "score": 1.0, + "content": "is true even without explicit domain adaptation for the cross-domain task, and if we add a domain", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 671, + 289, + 683 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 289, + 683 + ], + "score": 1.0, + "content": "discrepancy loss the benefits increase further.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 35.5 + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "There are two key factors that determine the performance of the proposed framework. The first is the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "robustness of the constrained clustering and second is the performance of the similarity prediction", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "function. We show robustness of CCN empirically, but we do not explore situations where learning", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 721, + 506, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 506, + 732 + ], + "score": 1.0, + "content": "the similarity function is harder. For example, such cases arise when there are a small number of", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 41.5 + } + ], + "page_idx": 9, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "10", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 106, + 119, + 505, + 204 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 89, + 504, + 112 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 89, + 505, + 102 + ], + "spans": [ + { + "bbox": [ + 106, + 89, + 505, + 102 + ], + "score": 1.0, + "content": "Table 2: Unsupervised cross-domain transfer (domain adaptation) on the Office-31 dataset. The", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 101, + 452, + 112 + ], + "spans": [ + { + "bbox": [ + 106, + 101, + 452, + 112 + ], + "score": 1.0, + "content": "backbone network used here is Resnet-18 (He et al., 2016) pre-trained with ImageNet.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "table_body", + "bbox": [ + 106, + 119, + 505, + 204 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 119, + 505, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 119, + 505, + 204 + ], + "score": 0.982, + "html": "
A→WD→WW→DA→DD→AW→AAvg
Source-Only66.892.896.867.151.453.071.3
DANN (Ganin et al., 2016)73.297.099.069.358.057.875.7
JAN (Long et al., 2017)74.594.199.675.958.759.076.9
CCN+ (ours)76.797.398.271.261.060.577.5
CCN++ (with DANN)78.297.498.673.562.860.678.5
", + "type": "table", + "image_path": "f5936f0f0feec0a34a07606096c3ce59fc69a3f0e85a74616b90a6b7ecc8c3b3.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 106, + 119, + 505, + 147.33333333333334 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 106, + 147.33333333333334, + 505, + 175.66666666666669 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 106, + 175.66666666666669, + 505, + 204.00000000000003 + ], + "spans": [], + "index": 4 + } + ] + } + ], + "index": 1.75 + }, + { + "type": "text", + "bbox": [ + 107, + 224, + 505, + 257 + ], + "lines": [], + "index": 6, + "bbox_fs": [ + 105, + 223, + 505, + 259 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 108, + 270, + 261, + 281 + ], + "lines": [ + { + "bbox": [ + 106, + 270, + 262, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 262, + 282 + ], + "score": 1.0, + "content": "5.2.2 RESULTS AND DISCUSSIONS", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 289, + 505, + 443 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 325, + 302 + ], + "score": 1.0, + "content": "The results are summarized in table 2. Our approach", + "type": "text" + }, + { + "bbox": [ + 326, + 290, + 357, + 300 + ], + "score": 0.78, + "content": "\\mathrm { ( C C N ^ { + } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 289, + 505, + 302 + ], + "score": 1.0, + "content": "demonstrates a strong performance", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 300, + 505, + 313 + ], + "spans": [ + { + "bbox": [ + 106, + 300, + 380, + 313 + ], + "score": 1.0, + "content": "boost for the unsupervised cross-domain transfer problem. It reaches", + "type": "text" + }, + { + "bbox": [ + 380, + 300, + 407, + 311 + ], + "score": 0.87, + "content": "7 7 . 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 300, + 505, + 313 + ], + "score": 1.0, + "content": "average accuracy which", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 311, + 506, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 217, + 325 + ], + "score": 1.0, + "content": "gained 6.2 points from the", + "type": "text" + }, + { + "bbox": [ + 218, + 311, + 246, + 322 + ], + "score": 0.88, + "content": "7 1 . 3 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 311, + 506, + 325 + ], + "score": 1.0, + "content": "source-only baseline. Although our approach merely transfers", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 322, + 506, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 469, + 336 + ], + "score": 1.0, + "content": "more information from the auxiliary dataset, it outperforms the strong approach DANN", + "type": "text" + }, + { + "bbox": [ + 469, + 322, + 502, + 334 + ], + "score": 0.85, + "content": "( 7 5 . 7 \\% )", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 322, + 506, + 336 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 334, + 506, + 346 + ], + "spans": [ + { + "bbox": [ + 106, + 334, + 207, + 346 + ], + "score": 1.0, + "content": "and state-of-the-art JAN", + "type": "text" + }, + { + "bbox": [ + 207, + 334, + 239, + 344 + ], + "score": 0.87, + "content": "( 7 6 . 9 \\% )", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 334, + 388, + 346 + ], + "score": 1.0, + "content": ". When combining ours with DANN", + "type": "text" + }, + { + "bbox": [ + 388, + 334, + 423, + 344 + ], + "score": 0.82, + "content": "\\mathrm { ( C C N ^ { + + } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 334, + 506, + 346 + ], + "score": 1.0, + "content": ", the performance is", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 344, + 506, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 506, + 357 + ], + "score": 1.0, + "content": "further boosted. This indicates that LCO helps mitigate the transfer problem in a certain way that is", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 355, + 506, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 355, + 506, + 368 + ], + "score": 1.0, + "content": "orthogonal to minimizing the domain discrepancy. We observe the same trend when using a deeper", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 366, + 505, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 366, + 446, + 379 + ], + "score": 1.0, + "content": "backbone network, i.e., ResNet-34. In such a case the average accuracy achieved is", + "type": "text" + }, + { + "bbox": [ + 446, + 366, + 473, + 377 + ], + "score": 0.85, + "content": "7 7 . 9 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 366, + 477, + 379 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 477, + 366, + 505, + 377 + ], + "score": 0.84, + "content": "8 1 . 1 \\%", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 376, + 506, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 123, + 390 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 377, + 144, + 388 + ], + "score": 0.87, + "content": "82 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 376, + 212, + 390 + ], + "score": 1.0, + "content": "for source-only,", + "type": "text" + }, + { + "bbox": [ + 212, + 377, + 239, + 388 + ], + "score": 0.85, + "content": "\\mathrm { C C N ^ { + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 376, + 258, + 390 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 258, + 377, + 288, + 388 + ], + "score": 0.88, + "content": "\\mathrm { C C N ^ { + + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 376, + 483, + 390 + ], + "score": 1.0, + "content": ", respectively, though we used exactly the same", + "type": "text" + }, + { + "bbox": [ + 484, + 378, + 493, + 388 + ], + "score": 0.81, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 376, + 506, + 390 + ], + "score": 1.0, + "content": "as", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 387, + 505, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 256, + 401 + ], + "score": 1.0, + "content": "before (with ResNet-18 backbone for", + "type": "text" + }, + { + "bbox": [ + 256, + 389, + 265, + 398 + ], + "score": 0.77, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 387, + 505, + 401 + ], + "score": 1.0, + "content": "). This indicates that the information carried in the similarity", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 399, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 505, + 412 + ], + "score": 1.0, + "content": "predictions is not equivalent to transferring features with deeper networks. More discussions are in", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 410, + 506, + 423 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 254, + 423 + ], + "score": 1.0, + "content": "appendix C and the performance of", + "type": "text" + }, + { + "bbox": [ + 254, + 411, + 263, + 420 + ], + "score": 0.83, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 410, + 506, + 423 + ], + "score": 1.0, + "content": "is provided in appendix table 11 to show that although the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 421, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 106, + 421, + 295, + 434 + ], + "score": 1.0, + "content": "prediction has low precision for similar pairs", + "type": "text" + }, + { + "bbox": [ + 295, + 421, + 326, + 432 + ], + "score": 0.83, + "content": "( \\sim 0 . 2 )", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 421, + 505, + 434 + ], + "score": 1.0, + "content": ", our approach still benefits from the dense", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 432, + 196, + 445 + ], + "spans": [ + { + "bbox": [ + 105, + 432, + 196, + 445 + ], + "score": 1.0, + "content": "similarity predictions.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 289, + 506, + 445 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 455, + 315, + 467 + ], + "lines": [ + { + "bbox": [ + 105, + 455, + 316, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 316, + 469 + ], + "score": 1.0, + "content": "5.2.3 EXPERIMENTS USING SVHN-TO-MNIST", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 106, + 475, + 505, + 552 + ], + "lines": [ + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 197, + 487 + ], + "score": 1.0, + "content": "We also evaluated the", + "type": "text" + }, + { + "bbox": [ + 197, + 475, + 224, + 486 + ], + "score": 0.87, + "content": "\\mathrm { C C N ^ { + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 475, + 505, + 487 + ], + "score": 1.0, + "content": "on another widely compared scenario, which uses color Street View", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 486, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 347, + 498 + ], + "score": 1.0, + "content": "House Numbers images (SVHN) (Netzer et al., 2011) as", + "type": "text" + }, + { + "bbox": [ + 347, + 486, + 358, + 496 + ], + "score": 0.85, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 486, + 505, + 498 + ], + "score": 1.0, + "content": ", the gray-scale hand-written digits", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 497, + 504, + 510 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 219, + 510 + ], + "score": 1.0, + "content": "(MNIST) (LeCun, 1998) as", + "type": "text" + }, + { + "bbox": [ + 219, + 498, + 227, + 507 + ], + "score": 0.75, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 497, + 267, + 510 + ], + "score": 1.0, + "content": ". To learn", + "type": "text" + }, + { + "bbox": [ + 267, + 497, + 276, + 507 + ], + "score": 0.74, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 497, + 325, + 510 + ], + "score": 1.0, + "content": ", we use the", + "type": "text" + }, + { + "bbox": [ + 325, + 497, + 377, + 510 + ], + "score": 0.49, + "content": "O m n g l o t _ { b g }", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 497, + 389, + 510 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 389, + 497, + 398, + 507 + ], + "score": 0.63, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 497, + 504, + 510 + ], + "score": 1.0, + "content": ". We train all the networks", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 508, + 504, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 504, + 521 + ], + "score": 1.0, + "content": "in this section from scratch. Our experimental setting is similar to Sener et al. (2016). We achieve the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 519, + 506, + 532 + ], + "spans": [ + { + "bbox": [ + 104, + 519, + 196, + 532 + ], + "score": 1.0, + "content": "top performance with", + "type": "text" + }, + { + "bbox": [ + 196, + 519, + 224, + 530 + ], + "score": 0.87, + "content": "8 9 . 1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 224, + 519, + 506, + 532 + ], + "score": 1.0, + "content": "accuracy. The performance gain from source-only in our approach is", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 530, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 137, + 541 + ], + "score": 0.9, + "content": "+ 3 7 . 1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 530, + 325, + 542 + ], + "score": 1.0, + "content": ", which wins by a large margin compared to the", + "type": "text" + }, + { + "bbox": [ + 326, + 530, + 358, + 541 + ], + "score": 0.9, + "content": "+ 2 3 . 9 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 530, + 505, + 542 + ], + "score": 1.0, + "content": "of LTR (Sener et al., 2016). The full", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 542, + 291, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 291, + 554 + ], + "score": 1.0, + "content": "comparison is presented in appendix table 12.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 27, + "bbox_fs": [ + 104, + 475, + 506, + 554 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 569, + 275, + 581 + ], + "lines": [ + { + "bbox": [ + 105, + 567, + 277, + 584 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 277, + 584 + ], + "score": 1.0, + "content": "6 CONCLUSION AND OUTLOOK", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 594, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "In this paper, we demonstrated the usefulness of transferring information in the form of pairwise", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 605, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 505, + 617 + ], + "score": 1.0, + "content": "similarity predictions. Such information can be transferred as a function and utilized by a loss", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 616, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 505, + 628 + ], + "score": 1.0, + "content": "formulation inspired from constrained clustering, but implemented more robustly within a neural", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 627, + 506, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 506, + 640 + ], + "score": 1.0, + "content": "network that can jointly optimize both features and clustering outputs based on these noisy predictions.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "score": 1.0, + "content": "The experiments for both cross-task and cross-domain transfer learning show strong benefits of using", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "score": 1.0, + "content": "the semantic similarity predictions resulting in new state of the art results across several datasets. This", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "score": 1.0, + "content": "is true even without explicit domain adaptation for the cross-domain task, and if we add a domain", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 671, + 289, + 683 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 289, + 683 + ], + "score": 1.0, + "content": "discrepancy loss the benefits increase further.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 594, + 506, + 683 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "There are two key factors that determine the performance of the proposed framework. The first is the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "robustness of the constrained clustering and second is the performance of the similarity prediction", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "function. We show robustness of CCN empirically, but we do not explore situations where learning", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 721, + 506, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 506, + 732 + ], + "score": 1.0, + "content": "the similarity function is harder. For example, such cases arise when there are a small number of", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "categories in source or a large domain discrepancy between source and target. One idea to deal with", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "such a situation is learning G with domain adaptation strategies. We leave these aspects for future", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 132, + 116 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 132, + 116 + ], + "score": 1.0, + "content": "work.", + "type": "text", + "cross_page": true + } + ], + "index": 2 + } + ], + "index": 41.5, + "bbox_fs": [ + 105, + 688, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "categories in source or a large domain discrepancy between source and target. One idea to deal with", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "such a situation is learning G with domain adaptation strategies. We leave these aspects for future", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 132, + 116 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 132, + 116 + ], + "score": 1.0, + "content": "work.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "title", + "bbox": [ + 108, + 129, + 200, + 140 + ], + "lines": [ + { + "bbox": [ + 107, + 130, + 200, + 140 + ], + "spans": [ + { + "bbox": [ + 107, + 130, + 200, + 140 + ], + "score": 1.0, + "content": "ACKNOWLEDGMENTS", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 148, + 504, + 170 + ], + "lines": [ + { + "bbox": [ + 105, + 147, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 147, + 505, + 162 + ], + "score": 1.0, + "content": "This work was supported by the National Science Foundation and National Robotics Initiative (grant", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 159, + 173, + 171 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 173, + 171 + ], + "score": 1.0, + "content": "# IIS-1426998).", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "title", + "bbox": [ + 107, + 188, + 176, + 200 + ], + "lines": [ + { + "bbox": [ + 106, + 189, + 176, + 201 + ], + "spans": [ + { + "bbox": [ + 106, + 189, + 176, + 201 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 207, + 504, + 230 + ], + "lines": [ + { + "bbox": [ + 105, + 205, + 506, + 221 + ], + "spans": [ + { + "bbox": [ + 105, + 205, + 506, + 221 + ], + "score": 1.0, + "content": "Ehsan Amid, Aristides Gionis, and Antti Ukkonen. Semi-supervised kernel metric learning using", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 218, + 367, + 230 + ], + "spans": [ + { + "bbox": [ + 116, + 218, + 367, + 230 + ], + "score": 1.0, + "content": "relative comparisons. arXiv preprint arXiv:1612.00086, 2016.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 106, + 237, + 506, + 271 + ], + "lines": [ + { + "bbox": [ + 106, + 238, + 505, + 250 + ], + "spans": [ + { + "bbox": [ + 106, + 238, + 505, + 250 + ], + "score": 1.0, + "content": "Saket Anand, Sushil Mittal, Oncel Tuzel, and Peter Meer. Semi-supervised kernel mean shift", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 248, + 507, + 262 + ], + "spans": [ + { + "bbox": [ + 115, + 248, + 507, + 262 + ], + "score": 1.0, + "content": "clustering. IEEE transactions on pattern analysis and machine intelligence, 36(6):1201–1215,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 258, + 143, + 273 + ], + "spans": [ + { + "bbox": [ + 115, + 258, + 143, + 273 + ], + "score": 1.0, + "content": "2014.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 105, + 280, + 504, + 303 + ], + "lines": [ + { + "bbox": [ + 106, + 279, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 106, + 279, + 505, + 293 + ], + "score": 1.0, + "content": "Violaine Antoine, Benjamin Quost, M-H Masson, and Thierry Denoeux. Cecm: Constrained", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 291, + 500, + 304 + ], + "spans": [ + { + "bbox": [ + 115, + 291, + 500, + 304 + ], + "score": 1.0, + "content": "evidential c-means algorithm. Computational Statistics & Data Analysis, 56(4):894–914, 2012.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 108, + 311, + 504, + 345 + ], + "lines": [ + { + "bbox": [ + 105, + 311, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 505, + 324 + ], + "score": 1.0, + "content": "Mikhail Bilenko, Sugato Basu, and Raymond J Mooney. Integrating constraints and metric learning in", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 116, + 322, + 505, + 335 + ], + "spans": [ + { + "bbox": [ + 116, + 322, + 505, + 335 + ], + "score": 1.0, + "content": "semi-supervised clustering. In Proceedings of the twenty-first international conference on Machine", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 333, + 240, + 345 + ], + "spans": [ + { + "bbox": [ + 115, + 333, + 240, + 345 + ], + "score": 1.0, + "content": "learning, pp. 11. ACM, 2004.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 352, + 506, + 387 + ], + "lines": [ + { + "bbox": [ + 105, + 352, + 506, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 506, + 367 + ], + "score": 1.0, + "content": "Konstantinos Bousmalis, Nathan Silberman, David Dohan, Dumitru Erhan, and Dilip Krishnan.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 117, + 365, + 505, + 377 + ], + "spans": [ + { + "bbox": [ + 117, + 365, + 505, + 377 + ], + "score": 1.0, + "content": "Unsupervised pixel-level domain adaptation with generative adversarial networks. In The IEEE", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 375, + 408, + 389 + ], + "spans": [ + { + "bbox": [ + 116, + 375, + 408, + 389 + ], + "score": 1.0, + "content": "Conference on Computer Vision and Pattern Recognition (CVPR), 2017.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 106, + 395, + 504, + 419 + ], + "lines": [ + { + "bbox": [ + 106, + 396, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 106, + 396, + 505, + 409 + ], + "score": 1.0, + "content": "Deng Cai, Xiaofei He, Xuanhui Wang, Hujun Bao, and Jiawei Han. Locality preserving nonnegative", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 407, + 372, + 419 + ], + "spans": [ + { + "bbox": [ + 116, + 407, + 372, + 419 + ], + "score": 1.0, + "content": "matrix factorization. In IJCAI, volume 9, pp. 1010–1015, 2009.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 106, + 426, + 506, + 450 + ], + "lines": [ + { + "bbox": [ + 106, + 427, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 106, + 427, + 506, + 439 + ], + "score": 1.0, + "content": "Fabio Maria Carlucci, Lorenzo Porzi, Barbara Caputo, Elisa Ricci, and Samuel Rota Bulò. Autodial:", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 438, + 489, + 450 + ], + "spans": [ + { + "bbox": [ + 115, + 438, + 489, + 450 + ], + "score": 1.0, + "content": "Automatic domain alignment layers. In International Conference on Computer Vision, 2017.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 105, + 457, + 504, + 481 + ], + "lines": [ + { + "bbox": [ + 105, + 457, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 471 + ], + "score": 1.0, + "content": "Xinlei Chen and Deng Cai. Large scale spectral clustering with landmark-based representation. In", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 469, + 243, + 482 + ], + "spans": [ + { + "bbox": [ + 115, + 469, + 243, + 482 + ], + "score": 1.0, + "content": "AAAI, volume 5, pp. 14, 2011.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 108, + 489, + 505, + 523 + ], + "lines": [ + { + "bbox": [ + 106, + 489, + 506, + 503 + ], + "spans": [ + { + "bbox": [ + 106, + 489, + 506, + 503 + ], + "score": 1.0, + "content": "Wenyuan Dai, Yuqiang Chen, Gui rong Xue, Qiang Yang, and Yong Yu. Translated learning: Transfer", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 500, + 507, + 513 + ], + "spans": [ + { + "bbox": [ + 116, + 500, + 507, + 513 + ], + "score": 1.0, + "content": "learning across different feature spaces. In Advances in Neural Information Processing Systems 21.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 114, + 510, + 143, + 523 + ], + "spans": [ + { + "bbox": [ + 114, + 510, + 143, + 523 + ], + "score": 1.0, + "content": "2009.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 105, + 531, + 499, + 544 + ], + "lines": [ + { + "bbox": [ + 106, + 531, + 501, + 545 + ], + "spans": [ + { + "bbox": [ + 106, + 531, + 501, + 545 + ], + "score": 1.0, + "content": "Ian Davidson and Sugato Basu. A survey of clustering with instance level. Constraints, 1:2, 2007.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 106, + 551, + 506, + 585 + ], + "lines": [ + { + "bbox": [ + 106, + 551, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 505, + 564 + ], + "score": 1.0, + "content": "Jason V Davis, Brian Kulis, Prateek Jain, Suvrit Sra, and Inderjit S Dhillon. Information-theoretic", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 114, + 561, + 507, + 577 + ], + "spans": [ + { + "bbox": [ + 114, + 561, + 507, + 577 + ], + "score": 1.0, + "content": "metric learning. In Proceedings of the 24th international conference on Machine learning, pp.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 573, + 209, + 585 + ], + "spans": [ + { + "bbox": [ + 116, + 573, + 209, + 585 + ], + "score": 1.0, + "content": "209–216. ACM, 2007.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 106, + 593, + 504, + 617 + ], + "lines": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "Derya Dinler and Mustafa Kemal Tural. A survey of constrained clustering. In Unsupervised", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 605, + 323, + 617 + ], + "spans": [ + { + "bbox": [ + 115, + 605, + 323, + 617 + ], + "score": 1.0, + "content": "Learning Algorithms, pp. 207–235. Springer, 2016.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 107, + 624, + 505, + 659 + ], + "lines": [ + { + "bbox": [ + 105, + 624, + 506, + 638 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 506, + 638 + ], + "score": 1.0, + "content": "Jeff Donahue, Yangqing Jia, Oriol Vinyals, Judy Hoffman, Ning Zhang, Eric Tzeng, and Trevor", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 635, + 507, + 649 + ], + "spans": [ + { + "bbox": [ + 115, + 635, + 507, + 649 + ], + "score": 1.0, + "content": "Darrell. Decaf: A deep convolutional activation feature for generic visual recognition. In Icml,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 647, + 244, + 659 + ], + "spans": [ + { + "bbox": [ + 116, + 647, + 244, + 659 + ], + "score": 1.0, + "content": "volume 32, pp. 647–655, 2014.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 108, + 667, + 504, + 701 + ], + "lines": [ + { + "bbox": [ + 106, + 666, + 506, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 506, + 681 + ], + "score": 1.0, + "content": "Yaroslav Ganin, Evgeniya Ustinova, Hana Ajakan, Pascal Germain, Hugo Larochelle, François", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 678, + 506, + 691 + ], + "spans": [ + { + "bbox": [ + 115, + 678, + 506, + 691 + ], + "score": 1.0, + "content": "Laviolette, Mario Marchand, and Victor Lempitsky. Domain-adversarial training of neural networks.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 689, + 356, + 702 + ], + "spans": [ + { + "bbox": [ + 115, + 689, + 356, + 702 + ], + "score": 1.0, + "content": "Journal of Machine Learning Research, 17(59):1–35, 2016.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "Ross Girshick, Jeff Donahue, Trevor Darrell, and Jitendra Malik. Rich feature hierarchies for accurate", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 720, + 503, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 503, + 732 + ], + "score": 1.0, + "content": "object detection and semantic segmentation. In Computer Vision and Pattern Recognition, 2014.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5 + } + ], + "page_idx": 10, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 116 + ], + "lines": [], + "index": 1, + "bbox_fs": [ + 105, + 82, + 505, + 116 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 108, + 129, + 200, + 140 + ], + "lines": [ + { + "bbox": [ + 107, + 130, + 200, + 140 + ], + "spans": [ + { + "bbox": [ + 107, + 130, + 200, + 140 + ], + "score": 1.0, + "content": "ACKNOWLEDGMENTS", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 148, + 504, + 170 + ], + "lines": [ + { + "bbox": [ + 105, + 147, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 147, + 505, + 162 + ], + "score": 1.0, + "content": "This work was supported by the National Science Foundation and National Robotics Initiative (grant", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 159, + 173, + 171 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 173, + 171 + ], + "score": 1.0, + "content": "# IIS-1426998).", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 147, + 505, + 171 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 188, + 176, + 200 + ], + "lines": [ + { + "bbox": [ + 106, + 189, + 176, + 201 + ], + "spans": [ + { + "bbox": [ + 106, + 189, + 176, + 201 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 207, + 504, + 230 + ], + "lines": [ + { + "bbox": [ + 105, + 205, + 506, + 221 + ], + "spans": [ + { + "bbox": [ + 105, + 205, + 506, + 221 + ], + "score": 1.0, + "content": "Ehsan Amid, Aristides Gionis, and Antti Ukkonen. Semi-supervised kernel metric learning using", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 218, + 367, + 230 + ], + "spans": [ + { + "bbox": [ + 116, + 218, + 367, + 230 + ], + "score": 1.0, + "content": "relative comparisons. arXiv preprint arXiv:1612.00086, 2016.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 205, + 506, + 230 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 237, + 506, + 271 + ], + "lines": [ + { + "bbox": [ + 106, + 238, + 505, + 250 + ], + "spans": [ + { + "bbox": [ + 106, + 238, + 505, + 250 + ], + "score": 1.0, + "content": "Saket Anand, Sushil Mittal, Oncel Tuzel, and Peter Meer. Semi-supervised kernel mean shift", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 248, + 507, + 262 + ], + "spans": [ + { + "bbox": [ + 115, + 248, + 507, + 262 + ], + "score": 1.0, + "content": "clustering. IEEE transactions on pattern analysis and machine intelligence, 36(6):1201–1215,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 258, + 143, + 273 + ], + "spans": [ + { + "bbox": [ + 115, + 258, + 143, + 273 + ], + "score": 1.0, + "content": "2014.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10, + "bbox_fs": [ + 106, + 238, + 507, + 273 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 280, + 504, + 303 + ], + "lines": [ + { + "bbox": [ + 106, + 279, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 106, + 279, + 505, + 293 + ], + "score": 1.0, + "content": "Violaine Antoine, Benjamin Quost, M-H Masson, and Thierry Denoeux. Cecm: Constrained", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 291, + 500, + 304 + ], + "spans": [ + { + "bbox": [ + 115, + 291, + 500, + 304 + ], + "score": 1.0, + "content": "evidential c-means algorithm. Computational Statistics & Data Analysis, 56(4):894–914, 2012.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 106, + 279, + 505, + 304 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 311, + 504, + 345 + ], + "lines": [ + { + "bbox": [ + 105, + 311, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 505, + 324 + ], + "score": 1.0, + "content": "Mikhail Bilenko, Sugato Basu, and Raymond J Mooney. Integrating constraints and metric learning in", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 116, + 322, + 505, + 335 + ], + "spans": [ + { + "bbox": [ + 116, + 322, + 505, + 335 + ], + "score": 1.0, + "content": "semi-supervised clustering. In Proceedings of the twenty-first international conference on Machine", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 333, + 240, + 345 + ], + "spans": [ + { + "bbox": [ + 115, + 333, + 240, + 345 + ], + "score": 1.0, + "content": "learning, pp. 11. ACM, 2004.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 311, + 505, + 345 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 352, + 506, + 387 + ], + "lines": [ + { + "bbox": [ + 105, + 352, + 506, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 506, + 367 + ], + "score": 1.0, + "content": "Konstantinos Bousmalis, Nathan Silberman, David Dohan, Dumitru Erhan, and Dilip Krishnan.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 117, + 365, + 505, + 377 + ], + "spans": [ + { + "bbox": [ + 117, + 365, + 505, + 377 + ], + "score": 1.0, + "content": "Unsupervised pixel-level domain adaptation with generative adversarial networks. In The IEEE", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 375, + 408, + 389 + ], + "spans": [ + { + "bbox": [ + 116, + 375, + 408, + 389 + ], + "score": 1.0, + "content": "Conference on Computer Vision and Pattern Recognition (CVPR), 2017.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 352, + 506, + 389 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 395, + 504, + 419 + ], + "lines": [ + { + "bbox": [ + 106, + 396, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 106, + 396, + 505, + 409 + ], + "score": 1.0, + "content": "Deng Cai, Xiaofei He, Xuanhui Wang, Hujun Bao, and Jiawei Han. Locality preserving nonnegative", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 407, + 372, + 419 + ], + "spans": [ + { + "bbox": [ + 116, + 407, + 372, + 419 + ], + "score": 1.0, + "content": "matrix factorization. In IJCAI, volume 9, pp. 1010–1015, 2009.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5, + "bbox_fs": [ + 106, + 396, + 505, + 419 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 426, + 506, + 450 + ], + "lines": [ + { + "bbox": [ + 106, + 427, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 106, + 427, + 506, + 439 + ], + "score": 1.0, + "content": "Fabio Maria Carlucci, Lorenzo Porzi, Barbara Caputo, Elisa Ricci, and Samuel Rota Bulò. Autodial:", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 438, + 489, + 450 + ], + "spans": [ + { + "bbox": [ + 115, + 438, + 489, + 450 + ], + "score": 1.0, + "content": "Automatic domain alignment layers. In International Conference on Computer Vision, 2017.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5, + "bbox_fs": [ + 106, + 427, + 506, + 450 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 457, + 504, + 481 + ], + "lines": [ + { + "bbox": [ + 105, + 457, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 471 + ], + "score": 1.0, + "content": "Xinlei Chen and Deng Cai. Large scale spectral clustering with landmark-based representation. In", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 469, + 243, + 482 + ], + "spans": [ + { + "bbox": [ + 115, + 469, + 243, + 482 + ], + "score": 1.0, + "content": "AAAI, volume 5, pp. 14, 2011.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 457, + 505, + 482 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 489, + 505, + 523 + ], + "lines": [ + { + "bbox": [ + 106, + 489, + 506, + 503 + ], + "spans": [ + { + "bbox": [ + 106, + 489, + 506, + 503 + ], + "score": 1.0, + "content": "Wenyuan Dai, Yuqiang Chen, Gui rong Xue, Qiang Yang, and Yong Yu. Translated learning: Transfer", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 500, + 507, + 513 + ], + "spans": [ + { + "bbox": [ + 116, + 500, + 507, + 513 + ], + "score": 1.0, + "content": "learning across different feature spaces. In Advances in Neural Information Processing Systems 21.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 114, + 510, + 143, + 523 + ], + "spans": [ + { + "bbox": [ + 114, + 510, + 143, + 523 + ], + "score": 1.0, + "content": "2009.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 106, + 489, + 507, + 523 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 531, + 499, + 544 + ], + "lines": [ + { + "bbox": [ + 106, + 531, + 501, + 545 + ], + "spans": [ + { + "bbox": [ + 106, + 531, + 501, + 545 + ], + "score": 1.0, + "content": "Ian Davidson and Sugato Basu. A survey of clustering with instance level. Constraints, 1:2, 2007.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29, + "bbox_fs": [ + 106, + 531, + 501, + 545 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 551, + 506, + 585 + ], + "lines": [ + { + "bbox": [ + 106, + 551, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 505, + 564 + ], + "score": 1.0, + "content": "Jason V Davis, Brian Kulis, Prateek Jain, Suvrit Sra, and Inderjit S Dhillon. Information-theoretic", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 114, + 561, + 507, + 577 + ], + "spans": [ + { + "bbox": [ + 114, + 561, + 507, + 577 + ], + "score": 1.0, + "content": "metric learning. In Proceedings of the 24th international conference on Machine learning, pp.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 573, + 209, + 585 + ], + "spans": [ + { + "bbox": [ + 116, + 573, + 209, + 585 + ], + "score": 1.0, + "content": "209–216. ACM, 2007.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 106, + 551, + 507, + 585 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 593, + 504, + 617 + ], + "lines": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "Derya Dinler and Mustafa Kemal Tural. A survey of constrained clustering. In Unsupervised", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 605, + 323, + 617 + ], + "spans": [ + { + "bbox": [ + 115, + 605, + 323, + 617 + ], + "score": 1.0, + "content": "Learning Algorithms, pp. 207–235. Springer, 2016.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5, + "bbox_fs": [ + 106, + 594, + 505, + 617 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 624, + 505, + 659 + ], + "lines": [ + { + "bbox": [ + 105, + 624, + 506, + 638 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 506, + 638 + ], + "score": 1.0, + "content": "Jeff Donahue, Yangqing Jia, Oriol Vinyals, Judy Hoffman, Ning Zhang, Eric Tzeng, and Trevor", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 635, + 507, + 649 + ], + "spans": [ + { + "bbox": [ + 115, + 635, + 507, + 649 + ], + "score": 1.0, + "content": "Darrell. Decaf: A deep convolutional activation feature for generic visual recognition. In Icml,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 647, + 244, + 659 + ], + "spans": [ + { + "bbox": [ + 116, + 647, + 244, + 659 + ], + "score": 1.0, + "content": "volume 32, pp. 647–655, 2014.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 624, + 507, + 659 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 667, + 504, + 701 + ], + "lines": [ + { + "bbox": [ + 106, + 666, + 506, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 506, + 681 + ], + "score": 1.0, + "content": "Yaroslav Ganin, Evgeniya Ustinova, Hana Ajakan, Pascal Germain, Hugo Larochelle, François", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 678, + 506, + 691 + ], + "spans": [ + { + "bbox": [ + 115, + 678, + 506, + 691 + ], + "score": 1.0, + "content": "Laviolette, Mario Marchand, and Victor Lempitsky. Domain-adversarial training of neural networks.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 689, + 356, + 702 + ], + "spans": [ + { + "bbox": [ + 115, + 689, + 356, + 702 + ], + "score": 1.0, + "content": "Journal of Machine Learning Research, 17(59):1–35, 2016.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39, + "bbox_fs": [ + 106, + 666, + 506, + 702 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "Ross Girshick, Jeff Donahue, Trevor Darrell, and Jitendra Malik. Rich feature hierarchies for accurate", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 720, + 503, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 503, + 732 + ], + "score": 1.0, + "content": "object detection and semantic segmentation. In Computer Vision and Pattern Recognition, 2014.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5, + "bbox_fs": [ + 105, + 708, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 97 + ], + "score": 1.0, + "content": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 506, + 106 + ], + "score": 1.0, + "content": "recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 114, + 104, + 196, + 116 + ], + "spans": [ + { + "bbox": [ + 114, + 104, + 196, + 116 + ], + "score": 1.0, + "content": "pp. 770–778, 2016.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 122, + 505, + 145 + ], + "lines": [ + { + "bbox": [ + 106, + 122, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 106, + 122, + 505, + 136 + ], + "score": 1.0, + "content": "Yen-Chang Hsu and Zsolt Kira. Neural network-based clustering using pairwise constraints. ICLR", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 133, + 185, + 146 + ], + "spans": [ + { + "bbox": [ + 115, + 133, + 185, + 146 + ], + "score": 1.0, + "content": "workshop, 2016.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 109, + 151, + 505, + 185 + ], + "lines": [ + { + "bbox": [ + 106, + 151, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 106, + 151, + 505, + 165 + ], + "score": 1.0, + "content": "Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 114, + 163, + 506, + 176 + ], + "spans": [ + { + "bbox": [ + 114, + 163, + 506, + 176 + ], + "score": 1.0, + "content": "reducing internal covariate shift. In International Conference on Machine Learning, pp. 448–456,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 172, + 143, + 187 + ], + "spans": [ + { + "bbox": [ + 115, + 172, + 143, + 187 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 192, + 505, + 215 + ], + "lines": [ + { + "bbox": [ + 106, + 192, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 505, + 205 + ], + "score": 1.0, + "content": "Gregory Koch, Richard Zemel, and Ruslan Salakhutdinov. Siamese neural networks for one-shot", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 204, + 364, + 216 + ], + "spans": [ + { + "bbox": [ + 115, + 204, + 364, + 216 + ], + "score": 1.0, + "content": "image recognition. In ICML Deep Learning Workshop, 2015.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 108, + 221, + 504, + 245 + ], + "lines": [ + { + "bbox": [ + 105, + 219, + 506, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 506, + 236 + ], + "score": 1.0, + "content": "Brenden M. Lake, Ruslan Salakhutdinov, and Joshua B. Tenenbaum. Human-level concept learning", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 233, + 437, + 245 + ], + "spans": [ + { + "bbox": [ + 116, + 233, + 437, + 245 + ], + "score": 1.0, + "content": "through probabilistic program induction. Science, 350(6266):1332–1338, 2015.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 107, + 251, + 356, + 263 + ], + "lines": [ + { + "bbox": [ + 106, + 250, + 356, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 250, + 356, + 264 + ], + "score": 1.0, + "content": "Yann LeCun. The mnist database of handwritten digits. 1998.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 108, + 269, + 505, + 303 + ], + "lines": [ + { + "bbox": [ + 105, + 270, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 505, + 282 + ], + "score": 1.0, + "content": "Jonathan Long, Evan Shelhamer, and Trevor Darrell. Fully convolutional networks for semantic", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 114, + 280, + 507, + 294 + ], + "spans": [ + { + "bbox": [ + 114, + 280, + 507, + 294 + ], + "score": 1.0, + "content": "segmentation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 114, + 291, + 211, + 303 + ], + "spans": [ + { + "bbox": [ + 114, + 291, + 211, + 303 + ], + "score": 1.0, + "content": "pp. 3431–3440, 2015a.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 108, + 309, + 504, + 344 + ], + "lines": [ + { + "bbox": [ + 105, + 309, + 506, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 506, + 324 + ], + "score": 1.0, + "content": "Mingsheng Long, Yue Cao, Jianmin Wang, and Michael I. Jordan. Learning transferable features", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 320, + 506, + 334 + ], + "spans": [ + { + "bbox": [ + 115, + 320, + 506, + 334 + ], + "score": 1.0, + "content": "with deep adaptation networks. In Proceedings of the 32nd International Conference on Machine", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 332, + 408, + 344 + ], + "spans": [ + { + "bbox": [ + 115, + 332, + 408, + 344 + ], + "score": 1.0, + "content": "Learning, ICML 2015, Lille, France, 6-11 July 2015, pp. 97–105, 2015b.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 349, + 504, + 373 + ], + "lines": [ + { + "bbox": [ + 105, + 349, + 505, + 363 + ], + "spans": [ + { + "bbox": [ + 105, + 349, + 505, + 363 + ], + "score": 1.0, + "content": "Mingsheng Long, Han Zhu, Jianmin Wang, and Michael I Jordan. Unsupervised domain adaptation", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 361, + 495, + 373 + ], + "spans": [ + { + "bbox": [ + 116, + 361, + 495, + 373 + ], + "score": 1.0, + "content": "with residual transfer networks. In Advances in Neural Information Processing Systems, 2016.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 108, + 379, + 504, + 414 + ], + "lines": [ + { + "bbox": [ + 106, + 379, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 506, + 393 + ], + "score": 1.0, + "content": "Mingsheng Long, Han Zhu, Jianmin Wang, and Michael I. Jordan. Deep transfer learning with joint", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 389, + 506, + 405 + ], + "spans": [ + { + "bbox": [ + 115, + 389, + 506, + 405 + ], + "score": 1.0, + "content": "adaptation networks. In Proceedings of the 34th International Conference on Machine Learning,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 401, + 431, + 414 + ], + "spans": [ + { + "bbox": [ + 116, + 401, + 431, + 414 + ], + "score": 1.0, + "content": "ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, pp. 2208–2217, 2017.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 108, + 419, + 505, + 453 + ], + "lines": [ + { + "bbox": [ + 106, + 419, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 505, + 432 + ], + "score": 1.0, + "content": "James MacQueen et al. Some methods for classification and analysis of multivariate observations. In", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 431, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 115, + 431, + 506, + 443 + ], + "score": 1.0, + "content": "Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, volume 1,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 442, + 281, + 453 + ], + "spans": [ + { + "bbox": [ + 115, + 442, + 281, + 453 + ], + "score": 1.0, + "content": "pp. 281–297. Oakland, CA, USA., 1967.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 105, + 459, + 505, + 483 + ], + "lines": [ + { + "bbox": [ + 105, + 457, + 506, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 506, + 474 + ], + "score": 1.0, + "content": "Yuval Netzer, Tao Wang, Adam Coates, Alessandro Bissacco, Bo Wu, and Andrew Y Ng. Reading", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 471, + 382, + 483 + ], + "spans": [ + { + "bbox": [ + 116, + 471, + 382, + 483 + ], + "score": 1.0, + "content": "digits in natural images with unsupervised feature learning. 2011.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 108, + 489, + 505, + 523 + ], + "lines": [ + { + "bbox": [ + 106, + 489, + 506, + 503 + ], + "spans": [ + { + "bbox": [ + 106, + 489, + 506, + 503 + ], + "score": 1.0, + "content": "Sinno Jialin Pan and Qiang Yang. A survey on transfer learning. IEEE Trans. on Knowl. and Data", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 500, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 115, + 500, + 506, + 513 + ], + "score": 1.0, + "content": "Eng., 22(10):1345–1359, October 2010. ISSN 1041-4347. doi: 10.1109/TKDE.2009.191. URL", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 511, + 355, + 525 + ], + "spans": [ + { + "bbox": [ + 116, + 511, + 355, + 525 + ], + "score": 1.0, + "content": "http://dx.doi.org/10.1109/TKDE.2009.191.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 104, + 529, + 505, + 552 + ], + "lines": [ + { + "bbox": [ + 105, + 528, + 506, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 506, + 543 + ], + "score": 1.0, + "content": "Syama Sundar Rangapuram and Matthias Hein. Constrained 1-spectral clustering. In AISTATS,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 541, + 221, + 552 + ], + "spans": [ + { + "bbox": [ + 115, + 541, + 221, + 552 + ], + "score": 1.0, + "content": "volume 30, pp. 90, 2012.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 107, + 558, + 504, + 593 + ], + "lines": [ + { + "bbox": [ + 105, + 558, + 506, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 558, + 506, + 573 + ], + "score": 1.0, + "content": "Olga Russakovsky, Jia Deng, Hao Su, Jonathan Krause, Sanjeev Satheesh, Sean Ma, Zhiheng Huang,", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 570, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 115, + 570, + 505, + 583 + ], + "score": 1.0, + "content": "Andrej Karpathy, Aditya Khosla, Michael Bernstein, et al. Imagenet large scale visual recognition", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 581, + 426, + 595 + ], + "spans": [ + { + "bbox": [ + 116, + 581, + 426, + 595 + ], + "score": 1.0, + "content": "challenge. International Journal of Computer Vision, 115(3):211–252, 2015.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 108, + 599, + 503, + 623 + ], + "lines": [ + { + "bbox": [ + 106, + 599, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 599, + 505, + 612 + ], + "score": 1.0, + "content": "Kate Saenko, Brian Kulis, Mario Fritz, and Trevor Darrell. Adapting Visual Category Models to New", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 610, + 430, + 623 + ], + "spans": [ + { + "bbox": [ + 116, + 610, + 430, + 623 + ], + "score": 1.0, + "content": "Domains, pp. 213–226. Springer Berlin Heidelberg, Berlin, Heidelberg, 2010.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 106, + 628, + 505, + 663 + ], + "lines": [ + { + "bbox": [ + 105, + 628, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 505, + 642 + ], + "score": 1.0, + "content": "Kuniaki Saito, Yoshitaka Ushiku, and Tatsuya Harada. Asymmetric tri-training for unsupervised", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 640, + 506, + 653 + ], + "spans": [ + { + "bbox": [ + 115, + 640, + 506, + 653 + ], + "score": 1.0, + "content": "domain adaptation. In Proceedings of the 34th International Conference on Machine Learning,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 651, + 432, + 663 + ], + "spans": [ + { + "bbox": [ + 116, + 651, + 432, + 663 + ], + "score": 1.0, + "content": "ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, pp. 2988–2997, 2017.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 107, + 669, + 505, + 703 + ], + "lines": [ + { + "bbox": [ + 106, + 668, + 506, + 683 + ], + "spans": [ + { + "bbox": [ + 106, + 668, + 506, + 683 + ], + "score": 1.0, + "content": "Ozan Sener, Hyun Oh Song, Ashutosh Saxena, and Silvio Savarese. Learning transferrable repre-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 679, + 505, + 694 + ], + "spans": [ + { + "bbox": [ + 115, + 679, + 505, + 694 + ], + "score": 1.0, + "content": "sentations for unsupervised domain adaptation. In Advances in Neural Information Processing", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 691, + 242, + 704 + ], + "spans": [ + { + "bbox": [ + 116, + 691, + 242, + 704 + ], + "score": 1.0, + "content": "Systems, pp. 2110–2118, 2016.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "Alexander Strehl and Joydeep Ghosh. Cluster ensembles—a knowledge reuse framework for combin-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 115, + 721, + 460, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 721, + 460, + 732 + ], + "score": 1.0, + "content": "ing multiple partitions. Journal of machine learning research, 3(Dec):583–617, 2002.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45.5 + } + ], + "page_idx": 11, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "12", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 97 + ], + "score": 1.0, + "content": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 506, + 106 + ], + "score": 1.0, + "content": "recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 114, + 104, + 196, + 116 + ], + "spans": [ + { + "bbox": [ + 114, + 104, + 196, + 116 + ], + "score": 1.0, + "content": "pp. 770–778, 2016.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 81, + 506, + 116 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 122, + 505, + 145 + ], + "lines": [ + { + "bbox": [ + 106, + 122, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 106, + 122, + 505, + 136 + ], + "score": 1.0, + "content": "Yen-Chang Hsu and Zsolt Kira. Neural network-based clustering using pairwise constraints. ICLR", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 133, + 185, + 146 + ], + "spans": [ + { + "bbox": [ + 115, + 133, + 185, + 146 + ], + "score": 1.0, + "content": "workshop, 2016.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 106, + 122, + 505, + 146 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 151, + 505, + 185 + ], + "lines": [ + { + "bbox": [ + 106, + 151, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 106, + 151, + 505, + 165 + ], + "score": 1.0, + "content": "Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 114, + 163, + 506, + 176 + ], + "spans": [ + { + "bbox": [ + 114, + 163, + 506, + 176 + ], + "score": 1.0, + "content": "reducing internal covariate shift. In International Conference on Machine Learning, pp. 448–456,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 172, + 143, + 187 + ], + "spans": [ + { + "bbox": [ + 115, + 172, + 143, + 187 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 151, + 506, + 187 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 192, + 505, + 215 + ], + "lines": [ + { + "bbox": [ + 106, + 192, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 505, + 205 + ], + "score": 1.0, + "content": "Gregory Koch, Richard Zemel, and Ruslan Salakhutdinov. Siamese neural networks for one-shot", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 204, + 364, + 216 + ], + "spans": [ + { + "bbox": [ + 115, + 204, + 364, + 216 + ], + "score": 1.0, + "content": "image recognition. In ICML Deep Learning Workshop, 2015.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 106, + 192, + 505, + 216 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 221, + 504, + 245 + ], + "lines": [ + { + "bbox": [ + 105, + 219, + 506, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 506, + 236 + ], + "score": 1.0, + "content": "Brenden M. Lake, Ruslan Salakhutdinov, and Joshua B. Tenenbaum. Human-level concept learning", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 233, + 437, + 245 + ], + "spans": [ + { + "bbox": [ + 116, + 233, + 437, + 245 + ], + "score": 1.0, + "content": "through probabilistic program induction. Science, 350(6266):1332–1338, 2015.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 219, + 506, + 245 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 251, + 356, + 263 + ], + "lines": [ + { + "bbox": [ + 106, + 250, + 356, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 250, + 356, + 264 + ], + "score": 1.0, + "content": "Yann LeCun. The mnist database of handwritten digits. 1998.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 106, + 250, + 356, + 264 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 269, + 505, + 303 + ], + "lines": [ + { + "bbox": [ + 105, + 270, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 505, + 282 + ], + "score": 1.0, + "content": "Jonathan Long, Evan Shelhamer, and Trevor Darrell. Fully convolutional networks for semantic", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 114, + 280, + 507, + 294 + ], + "spans": [ + { + "bbox": [ + 114, + 280, + 507, + 294 + ], + "score": 1.0, + "content": "segmentation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 114, + 291, + 211, + 303 + ], + "spans": [ + { + "bbox": [ + 114, + 291, + 211, + 303 + ], + "score": 1.0, + "content": "pp. 3431–3440, 2015a.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 270, + 507, + 303 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 309, + 504, + 344 + ], + "lines": [ + { + "bbox": [ + 105, + 309, + 506, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 506, + 324 + ], + "score": 1.0, + "content": "Mingsheng Long, Yue Cao, Jianmin Wang, and Michael I. Jordan. Learning transferable features", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 320, + 506, + 334 + ], + "spans": [ + { + "bbox": [ + 115, + 320, + 506, + 334 + ], + "score": 1.0, + "content": "with deep adaptation networks. In Proceedings of the 32nd International Conference on Machine", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 332, + 408, + 344 + ], + "spans": [ + { + "bbox": [ + 115, + 332, + 408, + 344 + ], + "score": 1.0, + "content": "Learning, ICML 2015, Lille, France, 6-11 July 2015, pp. 97–105, 2015b.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 309, + 506, + 344 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 349, + 504, + 373 + ], + "lines": [ + { + "bbox": [ + 105, + 349, + 505, + 363 + ], + "spans": [ + { + "bbox": [ + 105, + 349, + 505, + 363 + ], + "score": 1.0, + "content": "Mingsheng Long, Han Zhu, Jianmin Wang, and Michael I Jordan. Unsupervised domain adaptation", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 361, + 495, + 373 + ], + "spans": [ + { + "bbox": [ + 116, + 361, + 495, + 373 + ], + "score": 1.0, + "content": "with residual transfer networks. In Advances in Neural Information Processing Systems, 2016.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 349, + 505, + 373 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 379, + 504, + 414 + ], + "lines": [ + { + "bbox": [ + 106, + 379, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 506, + 393 + ], + "score": 1.0, + "content": "Mingsheng Long, Han Zhu, Jianmin Wang, and Michael I. Jordan. Deep transfer learning with joint", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 389, + 506, + 405 + ], + "spans": [ + { + "bbox": [ + 115, + 389, + 506, + 405 + ], + "score": 1.0, + "content": "adaptation networks. In Proceedings of the 34th International Conference on Machine Learning,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 401, + 431, + 414 + ], + "spans": [ + { + "bbox": [ + 116, + 401, + 431, + 414 + ], + "score": 1.0, + "content": "ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, pp. 2208–2217, 2017.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 106, + 379, + 506, + 414 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 419, + 505, + 453 + ], + "lines": [ + { + "bbox": [ + 106, + 419, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 505, + 432 + ], + "score": 1.0, + "content": "James MacQueen et al. Some methods for classification and analysis of multivariate observations. In", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 431, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 115, + 431, + 506, + 443 + ], + "score": 1.0, + "content": "Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, volume 1,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 442, + 281, + 453 + ], + "spans": [ + { + "bbox": [ + 115, + 442, + 281, + 453 + ], + "score": 1.0, + "content": "pp. 281–297. Oakland, CA, USA., 1967.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 106, + 419, + 506, + 453 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 459, + 505, + 483 + ], + "lines": [ + { + "bbox": [ + 105, + 457, + 506, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 506, + 474 + ], + "score": 1.0, + "content": "Yuval Netzer, Tao Wang, Adam Coates, Alessandro Bissacco, Bo Wu, and Andrew Y Ng. Reading", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 471, + 382, + 483 + ], + "spans": [ + { + "bbox": [ + 116, + 471, + 382, + 483 + ], + "score": 1.0, + "content": "digits in natural images with unsupervised feature learning. 2011.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 457, + 506, + 483 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 489, + 505, + 523 + ], + "lines": [ + { + "bbox": [ + 106, + 489, + 506, + 503 + ], + "spans": [ + { + "bbox": [ + 106, + 489, + 506, + 503 + ], + "score": 1.0, + "content": "Sinno Jialin Pan and Qiang Yang. A survey on transfer learning. IEEE Trans. on Knowl. and Data", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 500, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 115, + 500, + 506, + 513 + ], + "score": 1.0, + "content": "Eng., 22(10):1345–1359, October 2010. ISSN 1041-4347. doi: 10.1109/TKDE.2009.191. URL", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 511, + 355, + 525 + ], + "spans": [ + { + "bbox": [ + 116, + 511, + 355, + 525 + ], + "score": 1.0, + "content": "http://dx.doi.org/10.1109/TKDE.2009.191.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30, + "bbox_fs": [ + 106, + 489, + 506, + 525 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 529, + 505, + 552 + ], + "lines": [ + { + "bbox": [ + 105, + 528, + 506, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 506, + 543 + ], + "score": 1.0, + "content": "Syama Sundar Rangapuram and Matthias Hein. Constrained 1-spectral clustering. In AISTATS,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 541, + 221, + 552 + ], + "spans": [ + { + "bbox": [ + 115, + 541, + 221, + 552 + ], + "score": 1.0, + "content": "volume 30, pp. 90, 2012.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 528, + 506, + 552 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 558, + 504, + 593 + ], + "lines": [ + { + "bbox": [ + 105, + 558, + 506, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 558, + 506, + 573 + ], + "score": 1.0, + "content": "Olga Russakovsky, Jia Deng, Hao Su, Jonathan Krause, Sanjeev Satheesh, Sean Ma, Zhiheng Huang,", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 570, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 115, + 570, + 505, + 583 + ], + "score": 1.0, + "content": "Andrej Karpathy, Aditya Khosla, Michael Bernstein, et al. Imagenet large scale visual recognition", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 581, + 426, + 595 + ], + "spans": [ + { + "bbox": [ + 116, + 581, + 426, + 595 + ], + "score": 1.0, + "content": "challenge. International Journal of Computer Vision, 115(3):211–252, 2015.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 558, + 506, + 595 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 599, + 503, + 623 + ], + "lines": [ + { + "bbox": [ + 106, + 599, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 599, + 505, + 612 + ], + "score": 1.0, + "content": "Kate Saenko, Brian Kulis, Mario Fritz, and Trevor Darrell. Adapting Visual Category Models to New", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 610, + 430, + 623 + ], + "spans": [ + { + "bbox": [ + 116, + 610, + 430, + 623 + ], + "score": 1.0, + "content": "Domains, pp. 213–226. Springer Berlin Heidelberg, Berlin, Heidelberg, 2010.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5, + "bbox_fs": [ + 106, + 599, + 505, + 623 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 628, + 505, + 663 + ], + "lines": [ + { + "bbox": [ + 105, + 628, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 505, + 642 + ], + "score": 1.0, + "content": "Kuniaki Saito, Yoshitaka Ushiku, and Tatsuya Harada. Asymmetric tri-training for unsupervised", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 640, + 506, + 653 + ], + "spans": [ + { + "bbox": [ + 115, + 640, + 506, + 653 + ], + "score": 1.0, + "content": "domain adaptation. In Proceedings of the 34th International Conference on Machine Learning,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 651, + 432, + 663 + ], + "spans": [ + { + "bbox": [ + 116, + 651, + 432, + 663 + ], + "score": 1.0, + "content": "ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, pp. 2988–2997, 2017.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 628, + 506, + 663 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 669, + 505, + 703 + ], + "lines": [ + { + "bbox": [ + 106, + 668, + 506, + 683 + ], + "spans": [ + { + "bbox": [ + 106, + 668, + 506, + 683 + ], + "score": 1.0, + "content": "Ozan Sener, Hyun Oh Song, Ashutosh Saxena, and Silvio Savarese. Learning transferrable repre-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 679, + 505, + 694 + ], + "spans": [ + { + "bbox": [ + 115, + 679, + 505, + 694 + ], + "score": 1.0, + "content": "sentations for unsupervised domain adaptation. In Advances in Neural Information Processing", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 691, + 242, + 704 + ], + "spans": [ + { + "bbox": [ + 116, + 691, + 242, + 704 + ], + "score": 1.0, + "content": "Systems, pp. 2110–2118, 2016.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43, + "bbox_fs": [ + 106, + 668, + 506, + 704 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "Alexander Strehl and Joydeep Ghosh. Cluster ensembles—a knowledge reuse framework for combin-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 115, + 721, + 460, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 721, + 460, + 732 + ], + "score": 1.0, + "content": "ing multiple partitions. Journal of machine learning research, 3(Dec):583–617, 2002.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45.5, + "bbox_fs": [ + 106, + 709, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Baochen Sun, Jiashi Feng, and Kate Saenko. Return of frustratingly easy domain adaptation. In", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 114, + 93, + 168, + 105 + ], + "spans": [ + { + "bbox": [ + 114, + 93, + 168, + 105 + ], + "score": 1.0, + "content": "AAAI, 2016.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 111, + 504, + 135 + ], + "lines": [ + { + "bbox": [ + 106, + 112, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 112, + 505, + 125 + ], + "score": 1.0, + "content": "Eric Tzeng, Judy Hoffman, Ning Zhang, Kate Saenko, and Trevor Darrell. Deep domain confusion:", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 123, + 418, + 136 + ], + "spans": [ + { + "bbox": [ + 115, + 123, + 418, + 136 + ], + "score": 1.0, + "content": "Maximizing for domain invariance. arXiv preprint arXiv:1412.3474, 2014.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 106, + 141, + 504, + 165 + ], + "lines": [ + { + "bbox": [ + 106, + 142, + 505, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 142, + 505, + 155 + ], + "score": 1.0, + "content": "Eric Tzeng, Judy Hoffman, Trevor Darrell, and Kate Saenko. Adversarial discriminative domain", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 153, + 406, + 165 + ], + "spans": [ + { + "bbox": [ + 116, + 153, + 406, + 165 + ], + "score": 1.0, + "content": "adaptation. In Computer Vision and Pattern Recognition (CVPR), 2017.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 108, + 171, + 505, + 206 + ], + "lines": [ + { + "bbox": [ + 107, + 172, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 107, + 172, + 505, + 184 + ], + "score": 1.0, + "content": "Oriol Vinyals, Alexander Toshev, Samy Bengio, and Dumitru Erhan. Show and tell: A neural", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 184, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 115, + 184, + 505, + 196 + ], + "score": 1.0, + "content": "image caption generator. In Proceedings of the IEEE conference on computer vision and pattern", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 195, + 257, + 206 + ], + "spans": [ + { + "bbox": [ + 115, + 195, + 257, + 206 + ], + "score": 1.0, + "content": "recognition, pp. 3156–3164, 2015.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 105, + 212, + 505, + 236 + ], + "lines": [ + { + "bbox": [ + 105, + 212, + 507, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 212, + 507, + 226 + ], + "score": 1.0, + "content": "Oriol Vinyals, Charles Blundell, Timothy Lillicrap, Koray Kavukcuoglu, and Daan Wierstra. Match-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 224, + 284, + 236 + ], + "spans": [ + { + "bbox": [ + 115, + 224, + 284, + 236 + ], + "score": 1.0, + "content": "ing networks for one shot learning. 2016.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 106, + 242, + 504, + 266 + ], + "lines": [ + { + "bbox": [ + 106, + 243, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 243, + 505, + 256 + ], + "score": 1.0, + "content": "Xiang Wang, Buyue Qian, and Ian Davidson. On constrained spectral clustering and its applications.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 254, + 345, + 266 + ], + "spans": [ + { + "bbox": [ + 115, + 254, + 345, + 266 + ], + "score": 1.0, + "content": "Data Mining and Knowledge Discovery, pp. 1–30, 2014.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 107, + 272, + 504, + 306 + ], + "lines": [ + { + "bbox": [ + 105, + 272, + 505, + 286 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 505, + 286 + ], + "score": 1.0, + "content": "Eric P Xing, Michael I Jordan, Stuart J Russell, and Andrew Y Ng. Distance metric learning with", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 283, + 506, + 298 + ], + "spans": [ + { + "bbox": [ + 115, + 283, + 506, + 298 + ], + "score": 1.0, + "content": "application to clustering with side-information. In Advances in neural information processing", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 295, + 231, + 307 + ], + "spans": [ + { + "bbox": [ + 115, + 295, + 231, + 307 + ], + "score": 1.0, + "content": "systems, pp. 521–528, 2003.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 106, + 313, + 504, + 347 + ], + "lines": [ + { + "bbox": [ + 106, + 313, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 505, + 326 + ], + "score": 1.0, + "content": "Yi Yang, Dong Xu, Feiping Nie, Shuicheng Yan, and Yueting Zhuang. Image clustering using local", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 324, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 115, + 324, + 506, + 338 + ], + "score": 1.0, + "content": "discriminant models and global integration. IEEE Transactions on Image Processing, 19(10):", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 336, + 191, + 347 + ], + "spans": [ + { + "bbox": [ + 116, + 336, + 191, + 347 + ], + "score": 1.0, + "content": "2761–2773, 2010.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 105, + 354, + 504, + 377 + ], + "lines": [ + { + "bbox": [ + 105, + 352, + 505, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 505, + 368 + ], + "score": 1.0, + "content": "Jason Yosinski, Jeff Clune, Yoshua Bengio, and Hod Lipson. How transferable are features in deep", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 366, + 214, + 376 + ], + "spans": [ + { + "bbox": [ + 115, + 366, + 214, + 376 + ], + "score": 1.0, + "content": "neural networks? 2014.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 107, + 384, + 506, + 418 + ], + "lines": [ + { + "bbox": [ + 106, + 384, + 506, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 384, + 506, + 397 + ], + "score": 1.0, + "content": "Sergey Zagoruyko and Nikos Komodakis. Learning to compare image patches via convolutional neu-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 396, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 115, + 396, + 506, + 408 + ], + "score": 1.0, + "content": "ral networks. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 406, + 207, + 418 + ], + "spans": [ + { + "bbox": [ + 115, + 406, + 207, + 418 + ], + "score": 1.0, + "content": "pp. 4353–4361, 2015.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 425, + 506, + 459 + ], + "lines": [ + { + "bbox": [ + 105, + 424, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 506, + 439 + ], + "score": 1.0, + "content": "Werner Zellinger, Thomas Grubinger, Edwin Lughofer, Thomas Natschläger, and Susanne Saminger-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 435, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 115, + 435, + 506, + 448 + ], + "score": 1.0, + "content": "Platz. Central moment discrepancy (cmd) for domain-invariant representation learning. ICLR,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 114, + 446, + 143, + 459 + ], + "spans": [ + { + "bbox": [ + 114, + 446, + 143, + 459 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + } + ], + "page_idx": 12, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Baochen Sun, Jiashi Feng, and Kate Saenko. Return of frustratingly easy domain adaptation. In", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 114, + 93, + 168, + 105 + ], + "spans": [ + { + "bbox": [ + 114, + 93, + 168, + 105 + ], + "score": 1.0, + "content": "AAAI, 2016.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 106, + 82, + 505, + 105 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 111, + 504, + 135 + ], + "lines": [ + { + "bbox": [ + 106, + 112, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 112, + 505, + 125 + ], + "score": 1.0, + "content": "Eric Tzeng, Judy Hoffman, Ning Zhang, Kate Saenko, and Trevor Darrell. Deep domain confusion:", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 123, + 418, + 136 + ], + "spans": [ + { + "bbox": [ + 115, + 123, + 418, + 136 + ], + "score": 1.0, + "content": "Maximizing for domain invariance. arXiv preprint arXiv:1412.3474, 2014.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 106, + 112, + 505, + 136 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 141, + 504, + 165 + ], + "lines": [ + { + "bbox": [ + 106, + 142, + 505, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 142, + 505, + 155 + ], + "score": 1.0, + "content": "Eric Tzeng, Judy Hoffman, Trevor Darrell, and Kate Saenko. Adversarial discriminative domain", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 153, + 406, + 165 + ], + "spans": [ + { + "bbox": [ + 116, + 153, + 406, + 165 + ], + "score": 1.0, + "content": "adaptation. In Computer Vision and Pattern Recognition (CVPR), 2017.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 106, + 142, + 505, + 165 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 171, + 505, + 206 + ], + "lines": [ + { + "bbox": [ + 107, + 172, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 107, + 172, + 505, + 184 + ], + "score": 1.0, + "content": "Oriol Vinyals, Alexander Toshev, Samy Bengio, and Dumitru Erhan. Show and tell: A neural", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 184, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 115, + 184, + 505, + 196 + ], + "score": 1.0, + "content": "image caption generator. In Proceedings of the IEEE conference on computer vision and pattern", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 195, + 257, + 206 + ], + "spans": [ + { + "bbox": [ + 115, + 195, + 257, + 206 + ], + "score": 1.0, + "content": "recognition, pp. 3156–3164, 2015.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7, + "bbox_fs": [ + 107, + 172, + 505, + 206 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 212, + 505, + 236 + ], + "lines": [ + { + "bbox": [ + 105, + 212, + 507, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 212, + 507, + 226 + ], + "score": 1.0, + "content": "Oriol Vinyals, Charles Blundell, Timothy Lillicrap, Koray Kavukcuoglu, and Daan Wierstra. Match-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 224, + 284, + 236 + ], + "spans": [ + { + "bbox": [ + 115, + 224, + 284, + 236 + ], + "score": 1.0, + "content": "ing networks for one shot learning. 2016.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 212, + 507, + 236 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 242, + 504, + 266 + ], + "lines": [ + { + "bbox": [ + 106, + 243, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 243, + 505, + 256 + ], + "score": 1.0, + "content": "Xiang Wang, Buyue Qian, and Ian Davidson. On constrained spectral clustering and its applications.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 254, + 345, + 266 + ], + "spans": [ + { + "bbox": [ + 115, + 254, + 345, + 266 + ], + "score": 1.0, + "content": "Data Mining and Knowledge Discovery, pp. 1–30, 2014.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 106, + 243, + 505, + 266 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 272, + 504, + 306 + ], + "lines": [ + { + "bbox": [ + 105, + 272, + 505, + 286 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 505, + 286 + ], + "score": 1.0, + "content": "Eric P Xing, Michael I Jordan, Stuart J Russell, and Andrew Y Ng. Distance metric learning with", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 283, + 506, + 298 + ], + "spans": [ + { + "bbox": [ + 115, + 283, + 506, + 298 + ], + "score": 1.0, + "content": "application to clustering with side-information. In Advances in neural information processing", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 295, + 231, + 307 + ], + "spans": [ + { + "bbox": [ + 115, + 295, + 231, + 307 + ], + "score": 1.0, + "content": "systems, pp. 521–528, 2003.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 272, + 506, + 307 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 313, + 504, + 347 + ], + "lines": [ + { + "bbox": [ + 106, + 313, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 505, + 326 + ], + "score": 1.0, + "content": "Yi Yang, Dong Xu, Feiping Nie, Shuicheng Yan, and Yueting Zhuang. Image clustering using local", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 324, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 115, + 324, + 506, + 338 + ], + "score": 1.0, + "content": "discriminant models and global integration. IEEE Transactions on Image Processing, 19(10):", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 336, + 191, + 347 + ], + "spans": [ + { + "bbox": [ + 116, + 336, + 191, + 347 + ], + "score": 1.0, + "content": "2761–2773, 2010.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17, + "bbox_fs": [ + 106, + 313, + 506, + 347 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 354, + 504, + 377 + ], + "lines": [ + { + "bbox": [ + 105, + 352, + 505, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 505, + 368 + ], + "score": 1.0, + "content": "Jason Yosinski, Jeff Clune, Yoshua Bengio, and Hod Lipson. How transferable are features in deep", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 366, + 214, + 376 + ], + "spans": [ + { + "bbox": [ + 115, + 366, + 214, + 376 + ], + "score": 1.0, + "content": "neural networks? 2014.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 352, + 505, + 376 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 384, + 506, + 418 + ], + "lines": [ + { + "bbox": [ + 106, + 384, + 506, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 384, + 506, + 397 + ], + "score": 1.0, + "content": "Sergey Zagoruyko and Nikos Komodakis. Learning to compare image patches via convolutional neu-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 396, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 115, + 396, + 506, + 408 + ], + "score": 1.0, + "content": "ral networks. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 406, + 207, + 418 + ], + "spans": [ + { + "bbox": [ + 115, + 406, + 207, + 418 + ], + "score": 1.0, + "content": "pp. 4353–4361, 2015.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 106, + 384, + 506, + 418 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 425, + 506, + 459 + ], + "lines": [ + { + "bbox": [ + 105, + 424, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 506, + 439 + ], + "score": 1.0, + "content": "Werner Zellinger, Thomas Grubinger, Edwin Lughofer, Thomas Natschläger, and Susanne Saminger-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 435, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 115, + 435, + 506, + 448 + ], + "score": 1.0, + "content": "Platz. Central moment discrepancy (cmd) for domain-invariant representation learning. ICLR,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 114, + 446, + 143, + 459 + ], + "spans": [ + { + "bbox": [ + 114, + 446, + 143, + 459 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 424, + 506, + 459 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 173, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 174, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 174, + 96 + ], + "score": 1.0, + "content": "APPENDICES", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "title", + "bbox": [ + 108, + 108, + 351, + 120 + ], + "lines": [ + { + "bbox": [ + 105, + 107, + 352, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 107, + 352, + 123 + ], + "score": 1.0, + "content": "A COMPARISON OF EXPERIMENTAL SETTINGS", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "table", + "bbox": [ + 119, + 200, + 492, + 326 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 144, + 505, + 200 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 145, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 145, + 349, + 156 + ], + "score": 1.0, + "content": "Table 3: The list of datasets involved in each experiment.", + "type": "text" + }, + { + "bbox": [ + 349, + 145, + 359, + 155 + ], + "score": 0.7, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 145, + 505, + 156 + ], + "score": 1.0, + "content": "learns the similarity function from", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 155, + 505, + 168 + ], + "spans": [ + { + "bbox": [ + 106, + 155, + 167, + 168 + ], + "score": 1.0, + "content": "dataset A. The", + "type": "text" + }, + { + "bbox": [ + 167, + 155, + 193, + 165 + ], + "score": 0.87, + "content": "\\mathbf { C C N } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 155, + 369, + 168 + ], + "score": 1.0, + "content": "is optimized with dataset T or T∪S’, while", + "type": "text" + }, + { + "bbox": [ + 369, + 155, + 395, + 166 + ], + "score": 0.76, + "content": "\\mathbf { C C N } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 396, + 155, + 505, + 168 + ], + "score": 1.0, + "content": "means CCN for cross-task", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 165, + 506, + 180 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 155, + 180 + ], + "score": 1.0, + "content": "transfer and", + "type": "text" + }, + { + "bbox": [ + 156, + 167, + 191, + 177 + ], + "score": 0.88, + "content": "\\mathrm { C C N ^ { + / + + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 165, + 506, + 180 + ], + "score": 1.0, + "content": "for cross-domain transfer. The rows for network initialization indicate whether", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 177, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 177, + 505, + 190 + ], + "score": 1.0, + "content": "the network has weights initialized by training a classification task with the specified dataset. The", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 189, + 301, + 200 + ], + "spans": [ + { + "bbox": [ + 106, + 189, + 301, + 200 + ], + "score": 1.0, + "content": "weights are randomly initialized if not specified.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4 + }, + { + "type": "table_body", + "bbox": [ + 119, + 200, + 492, + 326 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 119, + 200, + 492, + 326 + ], + "spans": [ + { + "bbox": [ + 119, + 200, + 492, + 326 + ], + "score": 0.983, + "html": "
SchemeCross-Task TransferCross-Domain Transfer
Experiment SectionOmniglot 5.1.1ImageNet 5.1.3Office-31 5.2.1SVHN-MNIST 5.2.3
DatasetsAOmniglotbgImageNet882ImageNet1000Omniglotbg
S’Office-31 {a,d,w}SVHN
TOmniglotevalImageNet118Office-31 {a,d,w)MNIST
Network InitializationGImageNet882ImageNet10001
CCN*ImageNet882ImageNet10001
", + "type": "table", + "image_path": "669369c47c732375ec24da585d0c99869e157e4a7cf270d59df4477454679e65.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 119, + 200, + 492, + 242.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 119, + 242.0, + 492, + 284.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 119, + 284.0, + 492, + 326.0 + ], + "spans": [], + "index": 9 + } + ] + } + ], + "index": 6.0 + }, + { + "type": "table", + "bbox": [ + 242, + 395, + 368, + 462 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 350, + 505, + 394 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 350, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 350, + 505, + 362 + ], + "score": 1.0, + "content": "Table 4: The list of loss functions used for training networks. The similarity prediction function", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 360, + 505, + 374 + ], + "spans": [ + { + "bbox": [ + 105, + 360, + 149, + 374 + ], + "score": 1.0, + "content": "(network)", + "type": "text" + }, + { + "bbox": [ + 149, + 362, + 159, + 371 + ], + "score": 0.75, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 360, + 505, + 374 + ], + "score": 1.0, + "content": "uses the cross-entropy (CE) loss with two classes (similar/dissimilar). The training", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 372, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 249, + 385 + ], + "score": 1.0, + "content": "of constrained clustering network", + "type": "text" + }, + { + "bbox": [ + 249, + 372, + 281, + 383 + ], + "score": 0.81, + "content": "( \\mathbf { C C N } ^ { * } )", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 372, + 505, + 385 + ], + "score": 1.0, + "content": "involves the combinations of the learnable clustering", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 383, + 372, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 383, + 372, + 396 + ], + "score": 1.0, + "content": "objective (LCO), cross-entropy, and domain adaptation loss (DA).", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11.5 + }, + { + "type": "table_body", + "bbox": [ + 242, + 395, + 368, + 462 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 242, + 395, + 368, + 462 + ], + "spans": [ + { + "bbox": [ + 242, + 395, + 368, + 462 + ], + "score": 0.971, + "html": "
LCOCEDA
G√
CCN
CCN+广√
CCN++√√
", + "type": "table", + "image_path": "2385e43b5137c9f8e365706d4a2896d3faaa824f5c9736b5ead9792edd2cfe5c.jpg" + } + ] + } + ], + "index": 14.5, + "virtual_lines": [ + { + "bbox": [ + 242, + 395, + 368, + 428.5 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 242, + 428.5, + 368, + 462.0 + ], + "spans": [], + "index": 15 + } + ] + } + ], + "index": 13.0 + } + ], + "page_idx": 13, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "14", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 173, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 174, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 174, + 96 + ], + "score": 1.0, + "content": "APPENDICES", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "title", + "bbox": [ + 108, + 108, + 351, + 120 + ], + "lines": [ + { + "bbox": [ + 105, + 107, + 352, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 107, + 352, + 123 + ], + "score": 1.0, + "content": "A COMPARISON OF EXPERIMENTAL SETTINGS", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "table", + "bbox": [ + 119, + 200, + 492, + 326 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 144, + 505, + 200 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 145, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 145, + 349, + 156 + ], + "score": 1.0, + "content": "Table 3: The list of datasets involved in each experiment.", + "type": "text" + }, + { + "bbox": [ + 349, + 145, + 359, + 155 + ], + "score": 0.7, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 145, + 505, + 156 + ], + "score": 1.0, + "content": "learns the similarity function from", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 155, + 505, + 168 + ], + "spans": [ + { + "bbox": [ + 106, + 155, + 167, + 168 + ], + "score": 1.0, + "content": "dataset A. The", + "type": "text" + }, + { + "bbox": [ + 167, + 155, + 193, + 165 + ], + "score": 0.87, + "content": "\\mathbf { C C N } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 155, + 369, + 168 + ], + "score": 1.0, + "content": "is optimized with dataset T or T∪S’, while", + "type": "text" + }, + { + "bbox": [ + 369, + 155, + 395, + 166 + ], + "score": 0.76, + "content": "\\mathbf { C C N } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 396, + 155, + 505, + 168 + ], + "score": 1.0, + "content": "means CCN for cross-task", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 165, + 506, + 180 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 155, + 180 + ], + "score": 1.0, + "content": "transfer and", + "type": "text" + }, + { + "bbox": [ + 156, + 167, + 191, + 177 + ], + "score": 0.88, + "content": "\\mathrm { C C N ^ { + / + + } }", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 165, + 506, + 180 + ], + "score": 1.0, + "content": "for cross-domain transfer. The rows for network initialization indicate whether", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 177, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 177, + 505, + 190 + ], + "score": 1.0, + "content": "the network has weights initialized by training a classification task with the specified dataset. The", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 189, + 301, + 200 + ], + "spans": [ + { + "bbox": [ + 106, + 189, + 301, + 200 + ], + "score": 1.0, + "content": "weights are randomly initialized if not specified.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4 + }, + { + "type": "table_body", + "bbox": [ + 119, + 200, + 492, + 326 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 119, + 200, + 492, + 326 + ], + "spans": [ + { + "bbox": [ + 119, + 200, + 492, + 326 + ], + "score": 0.983, + "html": "
SchemeCross-Task TransferCross-Domain Transfer
Experiment SectionOmniglot 5.1.1ImageNet 5.1.3Office-31 5.2.1SVHN-MNIST 5.2.3
DatasetsAOmniglotbgImageNet882ImageNet1000Omniglotbg
S’Office-31 {a,d,w}SVHN
TOmniglotevalImageNet118Office-31 {a,d,w)MNIST
Network InitializationGImageNet882ImageNet10001
CCN*ImageNet882ImageNet10001
", + "type": "table", + "image_path": "669369c47c732375ec24da585d0c99869e157e4a7cf270d59df4477454679e65.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 119, + 200, + 492, + 242.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 119, + 242.0, + 492, + 284.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 119, + 284.0, + 492, + 326.0 + ], + "spans": [], + "index": 9 + } + ] + } + ], + "index": 6.0 + }, + { + "type": "table", + "bbox": [ + 242, + 395, + 368, + 462 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 350, + 505, + 394 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 350, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 350, + 505, + 362 + ], + "score": 1.0, + "content": "Table 4: The list of loss functions used for training networks. The similarity prediction function", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 360, + 505, + 374 + ], + "spans": [ + { + "bbox": [ + 105, + 360, + 149, + 374 + ], + "score": 1.0, + "content": "(network)", + "type": "text" + }, + { + "bbox": [ + 149, + 362, + 159, + 371 + ], + "score": 0.75, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 360, + 505, + 374 + ], + "score": 1.0, + "content": "uses the cross-entropy (CE) loss with two classes (similar/dissimilar). The training", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 372, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 249, + 385 + ], + "score": 1.0, + "content": "of constrained clustering network", + "type": "text" + }, + { + "bbox": [ + 249, + 372, + 281, + 383 + ], + "score": 0.81, + "content": "( \\mathbf { C C N } ^ { * } )", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 372, + 505, + 385 + ], + "score": 1.0, + "content": "involves the combinations of the learnable clustering", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 383, + 372, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 383, + 372, + 396 + ], + "score": 1.0, + "content": "objective (LCO), cross-entropy, and domain adaptation loss (DA).", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11.5 + }, + { + "type": "table_body", + "bbox": [ + 242, + 395, + 368, + 462 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 242, + 395, + 368, + 462 + ], + "spans": [ + { + "bbox": [ + 242, + 395, + 368, + 462 + ], + "score": 0.971, + "html": "
LCOCEDA
G√
CCN
CCN+广√
CCN++√√
", + "type": "table", + "image_path": "2385e43b5137c9f8e365706d4a2896d3faaa824f5c9736b5ead9792edd2cfe5c.jpg" + } + ] + } + ], + "index": 14.5, + "virtual_lines": [ + { + "bbox": [ + 242, + 395, + 368, + 428.5 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 242, + 428.5, + 368, + 462.0 + ], + "spans": [], + "index": 15 + } + ] + } + ], + "index": 13.0 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 111, + 80, + 506, + 187 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 111, + 80, + 506, + 187 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 111, + 80, + 506, + 187 + ], + "spans": [ + { + "bbox": [ + 111, + 80, + 506, + 187 + ], + "score": 0.967, + "type": "image", + "image_path": "6077c2618b017816b79d4cf6b62b30b24d7ebf9ecfe529286747a494f9f155c8.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 111, + 80, + 506, + 115.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 111, + 115.66666666666666, + 506, + 151.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 111, + 151.33333333333331, + 506, + 186.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 200, + 506, + 245 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 201, + 506, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 201, + 506, + 213 + ], + "score": 1.0, + "content": "Figure 6: A diagram depicting the cross-task transfer experiment. Two experiments follow this flow:", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 210, + 506, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 149, + 226 + ], + "score": 1.0, + "content": "Omniglot", + "type": "text" + }, + { + "bbox": [ + 150, + 213, + 159, + 224 + ], + "score": 0.41, + "content": "b g", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 210, + 171, + 226 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 171, + 212, + 230, + 223 + ], + "score": 0.26, + "content": "O m n i g l o t _ { e v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 210, + 252, + 226 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 252, + 212, + 312, + 223 + ], + "score": 0.32, + "content": "I m a g e N e t _ { 8 8 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 210, + 506, + 226 + ], + "score": 1.0, + "content": "to ImageNet118. Both have exclusive classes", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 223, + 505, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 505, + 235 + ], + "score": 1.0, + "content": "between source and target domain. In the ImageNet experiment, the backbone network is initialized", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 232, + 304, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 304, + 248 + ], + "score": 1.0, + "content": "with the weights pre-trained with ImageN et882.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "image", + "bbox": [ + 115, + 269, + 505, + 474 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 115, + 269, + 505, + 474 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 115, + 269, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 115, + 269, + 505, + 474 + ], + "score": 0.97, + "type": "image", + "image_path": "62fef6aa1814051042be0542b4068cc2863de90390604a41a4bf68f744e5059c.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 115, + 269, + 505, + 337.3333333333333 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 115, + 337.3333333333333, + 505, + 405.66666666666663 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 115, + 405.66666666666663, + 505, + 473.99999999999994 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 490, + 506, + 524 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 490, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 490, + 505, + 504 + ], + "score": 1.0, + "content": "Figure 7: Comparison between domain adaptation approaches (a) Transferring semantic similarity", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 500, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 506, + 515 + ], + "score": 1.0, + "content": "from auxiliary data (our method), and (b) Minimizing the domain discrepancy. The diagram uses", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 511, + 315, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 315, + 526 + ], + "score": 1.0, + "content": "office-31 benchmark as the scenario of transferring.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + } + ], + "index": 9.5 + } + ], + "page_idx": 14, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 111, + 80, + 506, + 187 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 111, + 80, + 506, + 187 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 111, + 80, + 506, + 187 + ], + "spans": [ + { + "bbox": [ + 111, + 80, + 506, + 187 + ], + "score": 0.967, + "type": "image", + "image_path": "6077c2618b017816b79d4cf6b62b30b24d7ebf9ecfe529286747a494f9f155c8.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 111, + 80, + 506, + 115.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 111, + 115.66666666666666, + 506, + 151.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 111, + 151.33333333333331, + 506, + 186.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 200, + 506, + 245 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 201, + 506, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 201, + 506, + 213 + ], + "score": 1.0, + "content": "Figure 6: A diagram depicting the cross-task transfer experiment. Two experiments follow this flow:", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 210, + 506, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 149, + 226 + ], + "score": 1.0, + "content": "Omniglot", + "type": "text" + }, + { + "bbox": [ + 150, + 213, + 159, + 224 + ], + "score": 0.41, + "content": "b g", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 210, + 171, + 226 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 171, + 212, + 230, + 223 + ], + "score": 0.26, + "content": "O m n i g l o t _ { e v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 210, + 252, + 226 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 252, + 212, + 312, + 223 + ], + "score": 0.32, + "content": "I m a g e N e t _ { 8 8 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 210, + 506, + 226 + ], + "score": 1.0, + "content": "to ImageNet118. Both have exclusive classes", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 223, + 505, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 505, + 235 + ], + "score": 1.0, + "content": "between source and target domain. In the ImageNet experiment, the backbone network is initialized", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 232, + 304, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 304, + 248 + ], + "score": 1.0, + "content": "with the weights pre-trained with ImageN et882.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "image", + "bbox": [ + 115, + 269, + 505, + 474 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 115, + 269, + 505, + 474 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 115, + 269, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 115, + 269, + 505, + 474 + ], + "score": 0.97, + "type": "image", + "image_path": "62fef6aa1814051042be0542b4068cc2863de90390604a41a4bf68f744e5059c.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 115, + 269, + 505, + 337.3333333333333 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 115, + 337.3333333333333, + 505, + 405.66666666666663 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 115, + 405.66666666666663, + 505, + 473.99999999999994 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 490, + 506, + 524 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 490, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 490, + 505, + 504 + ], + "score": 1.0, + "content": "Figure 7: Comparison between domain adaptation approaches (a) Transferring semantic similarity", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 500, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 506, + 515 + ], + "score": 1.0, + "content": "from auxiliary data (our method), and (b) Minimizing the domain discrepancy. The diagram uses", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 511, + 315, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 315, + 526 + ], + "score": 1.0, + "content": "office-31 benchmark as the scenario of transferring.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + } + ], + "index": 9.5 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 105, + 81, + 503, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 79, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 79, + 505, + 96 + ], + "score": 1.0, + "content": "B SUPPLEMENTARY FOR UNSUPERVISED CROSS TASK TRANSFER LEARNING", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table", + "bbox": [ + 106, + 150, + 506, + 337 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 118, + 506, + 150 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 104, + 117, + 506, + 131 + ], + "spans": [ + { + "bbox": [ + 104, + 117, + 506, + 131 + ], + "score": 1.0, + "content": "Table 5: A breakdown of the results for each alphabet in Omnigloteval. The unsupervised cross", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 128, + 505, + 142 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 505, + 142 + ], + "score": 1.0, + "content": "task transfer experiment is described in section 5.1. This table shows the clustering accuracy with", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 140, + 374, + 151 + ], + "spans": [ + { + "bbox": [ + 107, + 140, + 145, + 151 + ], + "score": 0.88, + "content": "K = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 140, + 374, + 151 + ], + "score": 1.0, + "content": "to simulate the situation of unknown number of clusters.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "table_body", + "bbox": [ + 106, + 150, + 506, + 337 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 150, + 506, + 337 + ], + "spans": [ + { + "bbox": [ + 106, + 150, + 506, + 337 + ], + "score": 0.983, + "html": "
AlphabetK-meansLPNMFLSCITMLSKMSSKKmSKLRCSPMPCK-meansCCN
Angelic24%26%27%48%78%40%38%72%50%82%
Atemayar_Qelisayer19%14%17%51%61%51%44%61%50%82%
Atlantean19%15%19%57%72%55%51%77%47%72%
Aurek_Besh23%18%21%45%49%44%45%76%71%90%
Avesta22%18%19%47%29%39%38%65%52%76%
Ge_ez19%17%17%56%58%47%42%72%55%82%
Glagolitic22%19%21%42%38%58%62%66%61%85%
Gurmukhi15%13%15%44%26%54%48%60%56%80%
Kannada18%14%16%48%37%46%53%60%48%62%
Keble20%14%18%44%60%46%44%75%68%90%
Malayalam18%15%16%36%24%49%52%50%54%72%
Manipuri17%15%16%49%40%53%54%66%62%85%
Mongolian18%18%19%50%40%37%48%75%57%86%
Old_Church_Slavonic_Cyrilic19%16%19%42%41%52%67%71%67%94%
Oriya15%13%14%46%40%54%45%57%52%67%
Sylheti14%13%14%49%32%35%37%59%43%64%
Syriac_Serto20%18%19%55%70%42%35%70%47%73%
Tengwar18%18%18%51%44%49%40%61%44%66%
Tibetan18%14%16%44%31%47%54%59%55%84%
ULOG20%18%18%41%41%40%41%56%38%70%
Average19%16%18%47%46%47%47%65%54%78%
", + "type": "table", + "image_path": "edd5c8527438fb985fa3aae8e157b710127e887e112b22304a27c43541aa280a.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 106, + 150, + 506, + 212.33333333333334 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 106, + 212.33333333333334, + 506, + 274.6666666666667 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 106, + 274.6666666666667, + 506, + 337.0 + ], + "spans": [], + "index": 6 + } + ] + } + ], + "index": 3.5 + }, + { + "type": "table", + "bbox": [ + 159, + 385, + 453, + 642 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 362, + 503, + 384 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 361, + 505, + 374 + ], + "spans": [ + { + "bbox": [ + 106, + 361, + 445, + 374 + ], + "score": 1.0, + "content": "Table 6: Estimates for the number of characters across the 20 datasets in Omniglot", + "type": "text" + }, + { + "bbox": [ + 446, + 363, + 461, + 373 + ], + "score": 0.69, + "content": "e v a l", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 361, + 505, + 374 + ], + "score": 1.0, + "content": ". The bold", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 373, + 502, + 385 + ], + "spans": [ + { + "bbox": [ + 106, + 373, + 368, + 385 + ], + "score": 1.0, + "content": "number means the prediction has error smaller or equal to 3. The", + "type": "text" + }, + { + "bbox": [ + 368, + 373, + 395, + 385 + ], + "score": 0.78, + "content": "A D i f", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 373, + 502, + 385 + ], + "score": 1.0, + "content": "is defined in section 5.1.2.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "table_body", + "bbox": [ + 159, + 385, + 453, + 642 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 159, + 385, + 453, + 642 + ], + "spans": [ + { + "bbox": [ + 159, + 385, + 453, + 642 + ], + "score": 0.983, + "html": "
AlphabetTrue #classSKMSCCN (K=100)
Angelic201626
Atemayar_Qelisayer261734
Atlantean262141
Aurek_Besh261428
Avesta26832
Ge_ez261832
Glagolitic451845
Gurmukhi451243
Kannada411944
Keble261628
Malayalam471247
Manipuri401741
Mongolian302836
Old_Church_Slavonic_Cyrillic452345
Oriya462249
Sylheti281150
Syriac_Serto231938
Tengwar251241
Tibetan421542
ULOG261540
ADif16.36.35
", + "type": "table", + "image_path": "a3aa1654884a293f29e57c2b20dac4b2622b4b5a81d2fa80fab3a1c67ce91da7.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 159, + 385, + 453, + 398.5263157894737 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 159, + 398.5263157894737, + 453, + 412.0526315789474 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 159, + 412.0526315789474, + 453, + 425.5789473684211 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 159, + 425.5789473684211, + 453, + 439.1052631578948 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 159, + 439.1052631578948, + 453, + 452.6315789473685 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 159, + 452.6315789473685, + 453, + 466.1578947368422 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 159, + 466.1578947368422, + 453, + 479.6842105263159 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 159, + 479.6842105263159, + 453, + 493.2105263157896 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 159, + 493.2105263157896, + 453, + 506.7368421052633 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 159, + 506.7368421052633, + 453, + 520.263157894737 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 159, + 520.263157894737, + 453, + 533.7894736842106 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 159, + 533.7894736842106, + 453, + 547.3157894736843 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 159, + 547.3157894736843, + 453, + 560.8421052631579 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 159, + 560.8421052631579, + 453, + 574.3684210526316 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 159, + 574.3684210526316, + 453, + 587.8947368421052 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 159, + 587.8947368421052, + 453, + 601.4210526315788 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 159, + 601.4210526315788, + 453, + 614.9473684210525 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 159, + 614.9473684210525, + 453, + 628.4736842105261 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 159, + 628.4736842105261, + 453, + 641.9999999999998 + ], + "spans": [], + "index": 27 + } + ] + } + ], + "index": 12.75 + } + ], + "page_idx": 15, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "16", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 105, + 81, + 503, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 79, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 79, + 505, + 96 + ], + "score": 1.0, + "content": "B SUPPLEMENTARY FOR UNSUPERVISED CROSS TASK TRANSFER LEARNING", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table", + "bbox": [ + 106, + 150, + 506, + 337 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 118, + 506, + 150 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 104, + 117, + 506, + 131 + ], + "spans": [ + { + "bbox": [ + 104, + 117, + 506, + 131 + ], + "score": 1.0, + "content": "Table 5: A breakdown of the results for each alphabet in Omnigloteval. The unsupervised cross", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 128, + 505, + 142 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 505, + 142 + ], + "score": 1.0, + "content": "task transfer experiment is described in section 5.1. This table shows the clustering accuracy with", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 140, + 374, + 151 + ], + "spans": [ + { + "bbox": [ + 107, + 140, + 145, + 151 + ], + "score": 0.88, + "content": "K = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 140, + 374, + 151 + ], + "score": 1.0, + "content": "to simulate the situation of unknown number of clusters.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "table_body", + "bbox": [ + 106, + 150, + 506, + 337 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 150, + 506, + 337 + ], + "spans": [ + { + "bbox": [ + 106, + 150, + 506, + 337 + ], + "score": 0.983, + "html": "
AlphabetK-meansLPNMFLSCITMLSKMSSKKmSKLRCSPMPCK-meansCCN
Angelic24%26%27%48%78%40%38%72%50%82%
Atemayar_Qelisayer19%14%17%51%61%51%44%61%50%82%
Atlantean19%15%19%57%72%55%51%77%47%72%
Aurek_Besh23%18%21%45%49%44%45%76%71%90%
Avesta22%18%19%47%29%39%38%65%52%76%
Ge_ez19%17%17%56%58%47%42%72%55%82%
Glagolitic22%19%21%42%38%58%62%66%61%85%
Gurmukhi15%13%15%44%26%54%48%60%56%80%
Kannada18%14%16%48%37%46%53%60%48%62%
Keble20%14%18%44%60%46%44%75%68%90%
Malayalam18%15%16%36%24%49%52%50%54%72%
Manipuri17%15%16%49%40%53%54%66%62%85%
Mongolian18%18%19%50%40%37%48%75%57%86%
Old_Church_Slavonic_Cyrilic19%16%19%42%41%52%67%71%67%94%
Oriya15%13%14%46%40%54%45%57%52%67%
Sylheti14%13%14%49%32%35%37%59%43%64%
Syriac_Serto20%18%19%55%70%42%35%70%47%73%
Tengwar18%18%18%51%44%49%40%61%44%66%
Tibetan18%14%16%44%31%47%54%59%55%84%
ULOG20%18%18%41%41%40%41%56%38%70%
Average19%16%18%47%46%47%47%65%54%78%
", + "type": "table", + "image_path": "edd5c8527438fb985fa3aae8e157b710127e887e112b22304a27c43541aa280a.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 106, + 150, + 506, + 212.33333333333334 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 106, + 212.33333333333334, + 506, + 274.6666666666667 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 106, + 274.6666666666667, + 506, + 337.0 + ], + "spans": [], + "index": 6 + } + ] + } + ], + "index": 3.5 + }, + { + "type": "table", + "bbox": [ + 159, + 385, + 453, + 642 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 362, + 503, + 384 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 361, + 505, + 374 + ], + "spans": [ + { + "bbox": [ + 106, + 361, + 445, + 374 + ], + "score": 1.0, + "content": "Table 6: Estimates for the number of characters across the 20 datasets in Omniglot", + "type": "text" + }, + { + "bbox": [ + 446, + 363, + 461, + 373 + ], + "score": 0.69, + "content": "e v a l", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 361, + 505, + 374 + ], + "score": 1.0, + "content": ". The bold", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 373, + 502, + 385 + ], + "spans": [ + { + "bbox": [ + 106, + 373, + 368, + 385 + ], + "score": 1.0, + "content": "number means the prediction has error smaller or equal to 3. The", + "type": "text" + }, + { + "bbox": [ + 368, + 373, + 395, + 385 + ], + "score": 0.78, + "content": "A D i f", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 373, + 502, + 385 + ], + "score": 1.0, + "content": "is defined in section 5.1.2.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "table_body", + "bbox": [ + 159, + 385, + 453, + 642 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 159, + 385, + 453, + 642 + ], + "spans": [ + { + "bbox": [ + 159, + 385, + 453, + 642 + ], + "score": 0.983, + "html": "
AlphabetTrue #classSKMSCCN (K=100)
Angelic201626
Atemayar_Qelisayer261734
Atlantean262141
Aurek_Besh261428
Avesta26832
Ge_ez261832
Glagolitic451845
Gurmukhi451243
Kannada411944
Keble261628
Malayalam471247
Manipuri401741
Mongolian302836
Old_Church_Slavonic_Cyrillic452345
Oriya462249
Sylheti281150
Syriac_Serto231938
Tengwar251241
Tibetan421542
ULOG261540
ADif16.36.35
", + "type": "table", + "image_path": "a3aa1654884a293f29e57c2b20dac4b2622b4b5a81d2fa80fab3a1c67ce91da7.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 159, + 385, + 453, + 398.5263157894737 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 159, + 398.5263157894737, + 453, + 412.0526315789474 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 159, + 412.0526315789474, + 453, + 425.5789473684211 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 159, + 425.5789473684211, + 453, + 439.1052631578948 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 159, + 439.1052631578948, + 453, + 452.6315789473685 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 159, + 452.6315789473685, + 453, + 466.1578947368422 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 159, + 466.1578947368422, + 453, + 479.6842105263159 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 159, + 479.6842105263159, + 453, + 493.2105263157896 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 159, + 493.2105263157896, + 453, + 506.7368421052633 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 159, + 506.7368421052633, + 453, + 520.263157894737 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 159, + 520.263157894737, + 453, + 533.7894736842106 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 159, + 533.7894736842106, + 453, + 547.3157894736843 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 159, + 547.3157894736843, + 453, + 560.8421052631579 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 159, + 560.8421052631579, + 453, + 574.3684210526316 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 159, + 574.3684210526316, + 453, + 587.8947368421052 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 159, + 587.8947368421052, + 453, + 601.4210526315788 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 159, + 601.4210526315788, + 453, + 614.9473684210525 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 159, + 614.9473684210525, + 453, + 628.4736842105261 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 159, + 628.4736842105261, + 453, + 641.9999999999998 + ], + "spans": [], + "index": 27 + } + ] + } + ], + "index": 12.75 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 174, + 178, + 437, + 250 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 122, + 504, + 177 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 123, + 505, + 135 + ], + "spans": [ + { + "bbox": [ + 106, + 123, + 505, + 135 + ], + "score": 1.0, + "content": "Table 7: The performance of the similarity prediction function used in section 5.1. We leverage the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "score": 1.0, + "content": "N-way test which is commonly used in one-shot learning evaluation. The similarity is learned with", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 143, + 506, + 159 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 149, + 159 + ], + "score": 1.0, + "content": "Omniglot", + "type": "text" + }, + { + "bbox": [ + 150, + 146, + 159, + 157 + ], + "score": 0.46, + "content": "b g", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 143, + 258, + 159 + ], + "score": 1.0, + "content": "and has N-way test with", + "type": "text" + }, + { + "bbox": [ + 259, + 145, + 318, + 156 + ], + "score": 0.57, + "content": "O m n i g l o t _ { e v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 143, + 506, + 159 + ], + "score": 1.0, + "content": "and MNIST. The experimental settings follow", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 155, + 506, + 168 + ], + "spans": [ + { + "bbox": [ + 106, + 155, + 423, + 168 + ], + "score": 1.0, + "content": "Vinyals et al. (2016). The raw probability output (without binarization) from our", + "type": "text" + }, + { + "bbox": [ + 424, + 156, + 432, + 165 + ], + "score": 0.82, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 155, + 506, + 168 + ], + "score": 1.0, + "content": "is used to find the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 167, + 249, + 179 + ], + "spans": [ + { + "bbox": [ + 106, + 167, + 249, + 179 + ], + "score": 1.0, + "content": "nearest exemplar in the N-way test.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "table_body", + "bbox": [ + 174, + 178, + 437, + 250 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 174, + 178, + 437, + 250 + ], + "spans": [ + { + "bbox": [ + 174, + 178, + 437, + 250 + ], + "score": 0.979, + "html": "
MethodOmniglot-eval 5-wayMNIST 10-way
Siamese-Nets (Koch et al., 2015)0.96720-way 0.8800.703
Match-Net (Vinyals et al., 2016)0.9810.9380.720
Ours0.9790.9350.720
", + "type": "table", + "image_path": "b3acd2713316e53455d67e85e1a9e12c7140f850c530ca53e0204f69f9c4d0f0.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 174, + 178, + 437, + 202.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 174, + 202.0, + 437, + 226.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 174, + 226.0, + 437, + 250.0 + ], + "spans": [], + "index": 7 + } + ] + } + ], + "index": 4.0 + }, + { + "type": "table", + "bbox": [ + 184, + 377, + 426, + 449 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 108, + 332, + 505, + 376 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 332, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 332, + 506, + 344 + ], + "score": 1.0, + "content": "Table 8: Unsupervised cross-task transfer learning on ImageNet. The values are the average of", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 344, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 106, + 344, + 204, + 356 + ], + "score": 1.0, + "content": "three random subsets in", + "type": "text" + }, + { + "bbox": [ + 205, + 344, + 264, + 354 + ], + "score": 0.34, + "content": "I m a g e N e t _ { 1 1 8 }", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 344, + 445, + 356 + ], + "score": 1.0, + "content": ". Each subset has 30 classes. The \"ACC\" has", + "type": "text" + }, + { + "bbox": [ + 446, + 344, + 479, + 354 + ], + "score": 0.89, + "content": "K = 3 0", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 344, + 505, + 356 + ], + "score": 1.0, + "content": "while", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 354, + 505, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 196, + 367 + ], + "score": 1.0, + "content": "the \"ACC (100)\" sets", + "type": "text" + }, + { + "bbox": [ + 197, + 354, + 237, + 365 + ], + "score": 0.9, + "content": "K = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 354, + 505, + 367 + ], + "score": 1.0, + "content": ". All methods use the features (outputs of average pooling) from", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 365, + 334, + 379 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 334, + 379 + ], + "score": 1.0, + "content": "Resnet-18 pre-trained with ImageNet882 classification.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5 + }, + { + "type": "table_body", + "bbox": [ + 184, + 377, + 426, + 449 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 184, + 377, + 426, + 449 + ], + "spans": [ + { + "bbox": [ + 184, + 377, + 426, + 449 + ], + "score": 0.977, + "html": "
MethodACCACC(100)NMINMI(100)
K-means71.9%34.5%0.7130.671
LSC73.3%33.5%0.7330.655
LPNMF43.0%21.8%0.5260.500
CCN (ours)73.8%65.2%0.7500.715
", + "type": "table", + "image_path": "ed7b58dab6ef5fe60a2c9d95bf27a1b4443d28d6a8838d1fd037c05b989d02e4.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 184, + 377, + 426, + 391.4 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 184, + 391.4, + 426, + 405.79999999999995 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 184, + 405.79999999999995, + 426, + 420.19999999999993 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 184, + 420.19999999999993, + 426, + 434.5999999999999 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 184, + 434.5999999999999, + 426, + 448.9999999999999 + ], + "spans": [], + "index": 16 + } + ] + } + ], + "index": 11.75 + }, + { + "type": "table", + "bbox": [ + 116, + 608, + 495, + 697 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 531, + 506, + 608 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 105, + 531, + 506, + 544 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 345, + 544 + ], + "score": 1.0, + "content": "Table 9: Performance of the similarity prediction function (", + "type": "text" + }, + { + "bbox": [ + 345, + 532, + 354, + 542 + ], + "score": 0.66, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 531, + 506, + 544 + ], + "score": 1.0, + "content": ", trained with ImageN et882) applied", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 542, + 506, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 182, + 555 + ], + "score": 1.0, + "content": "to three subsets of", + "type": "text" + }, + { + "bbox": [ + 183, + 542, + 242, + 554 + ], + "score": 0.68, + "content": "I m a g e N e t _ { 1 1 8 }", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 542, + 423, + 555 + ], + "score": 1.0, + "content": ". Each subset contains 30 random classes of", + "type": "text" + }, + { + "bbox": [ + 423, + 543, + 482, + 554 + ], + "score": 0.43, + "content": "I m a g e N e t _ { 1 1 8 }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 542, + 506, + 555 + ], + "score": 1.0, + "content": ". The", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 553, + 506, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 553, + 506, + 565 + ], + "score": 1.0, + "content": "predictions are binarized at 0.5 to calculate the precision and recall. Random*: The expected", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 564, + 506, + 577 + ], + "spans": [ + { + "bbox": [ + 104, + 564, + 506, + 577 + ], + "score": 1.0, + "content": "performance when classes are uniformly distributed and make uniform random guess for similarity.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 576, + 506, + 587 + ], + "spans": [ + { + "bbox": [ + 106, + 576, + 506, + 587 + ], + "score": 1.0, + "content": "It is an approximation since the number of images in each class is only roughly equal in ImageNet.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 586, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 586, + 505, + 599 + ], + "score": 1.0, + "content": "We sampled 12M pairs for each set to collect the statistics. Sampling more pairs has no noticeable", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 597, + 193, + 609 + ], + "spans": [ + { + "bbox": [ + 106, + 597, + 193, + 609 + ], + "score": 1.0, + "content": "change to the values.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20 + }, + { + "type": "table_body", + "bbox": [ + 116, + 608, + 495, + 697 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 116, + 608, + 495, + 697 + ], + "spans": [ + { + "bbox": [ + 116, + 608, + 495, + 697 + ], + "score": 0.981, + "html": "
SetSimilar Precision Similar RecallDissimilar PrecisionDissimilar Recall
Random*0.0330.5000.9670.500
Set A0.8400.6640.9830.994
SetB0.8250.6310.9810.993
Set C0.7710.6710.9830.990
Average0.8120.6550.9820.992
", + "type": "table", + "image_path": "2fd973ba9b8e5a822c55ca7487481ec288ef5988660c0a3a7768ad39ede6159e.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 116, + 608, + 495, + 637.6666666666666 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 116, + 637.6666666666666, + 495, + 667.3333333333333 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 116, + 667.3333333333333, + 495, + 696.9999999999999 + ], + "spans": [], + "index": 26 + } + ] + } + ], + "index": 22.5 + } + ], + "page_idx": 16, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 174, + 178, + 437, + 250 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 122, + 504, + 177 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 123, + 505, + 135 + ], + "spans": [ + { + "bbox": [ + 106, + 123, + 505, + 135 + ], + "score": 1.0, + "content": "Table 7: The performance of the similarity prediction function used in section 5.1. We leverage the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "score": 1.0, + "content": "N-way test which is commonly used in one-shot learning evaluation. The similarity is learned with", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 143, + 506, + 159 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 149, + 159 + ], + "score": 1.0, + "content": "Omniglot", + "type": "text" + }, + { + "bbox": [ + 150, + 146, + 159, + 157 + ], + "score": 0.46, + "content": "b g", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 143, + 258, + 159 + ], + "score": 1.0, + "content": "and has N-way test with", + "type": "text" + }, + { + "bbox": [ + 259, + 145, + 318, + 156 + ], + "score": 0.57, + "content": "O m n i g l o t _ { e v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 143, + 506, + 159 + ], + "score": 1.0, + "content": "and MNIST. The experimental settings follow", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 155, + 506, + 168 + ], + "spans": [ + { + "bbox": [ + 106, + 155, + 423, + 168 + ], + "score": 1.0, + "content": "Vinyals et al. (2016). The raw probability output (without binarization) from our", + "type": "text" + }, + { + "bbox": [ + 424, + 156, + 432, + 165 + ], + "score": 0.82, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 155, + 506, + 168 + ], + "score": 1.0, + "content": "is used to find the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 167, + 249, + 179 + ], + "spans": [ + { + "bbox": [ + 106, + 167, + 249, + 179 + ], + "score": 1.0, + "content": "nearest exemplar in the N-way test.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "table_body", + "bbox": [ + 174, + 178, + 437, + 250 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 174, + 178, + 437, + 250 + ], + "spans": [ + { + "bbox": [ + 174, + 178, + 437, + 250 + ], + "score": 0.979, + "html": "
MethodOmniglot-eval 5-wayMNIST 10-way
Siamese-Nets (Koch et al., 2015)0.96720-way 0.8800.703
Match-Net (Vinyals et al., 2016)0.9810.9380.720
Ours0.9790.9350.720
", + "type": "table", + "image_path": "b3acd2713316e53455d67e85e1a9e12c7140f850c530ca53e0204f69f9c4d0f0.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 174, + 178, + 437, + 202.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 174, + 202.0, + 437, + 226.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 174, + 226.0, + 437, + 250.0 + ], + "spans": [], + "index": 7 + } + ] + } + ], + "index": 4.0 + }, + { + "type": "table", + "bbox": [ + 184, + 377, + 426, + 449 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 108, + 332, + 505, + 376 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 332, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 332, + 506, + 344 + ], + "score": 1.0, + "content": "Table 8: Unsupervised cross-task transfer learning on ImageNet. The values are the average of", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 344, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 106, + 344, + 204, + 356 + ], + "score": 1.0, + "content": "three random subsets in", + "type": "text" + }, + { + "bbox": [ + 205, + 344, + 264, + 354 + ], + "score": 0.34, + "content": "I m a g e N e t _ { 1 1 8 }", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 344, + 445, + 356 + ], + "score": 1.0, + "content": ". Each subset has 30 classes. The \"ACC\" has", + "type": "text" + }, + { + "bbox": [ + 446, + 344, + 479, + 354 + ], + "score": 0.89, + "content": "K = 3 0", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 344, + 505, + 356 + ], + "score": 1.0, + "content": "while", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 354, + 505, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 196, + 367 + ], + "score": 1.0, + "content": "the \"ACC (100)\" sets", + "type": "text" + }, + { + "bbox": [ + 197, + 354, + 237, + 365 + ], + "score": 0.9, + "content": "K = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 354, + 505, + 367 + ], + "score": 1.0, + "content": ". All methods use the features (outputs of average pooling) from", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 365, + 334, + 379 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 334, + 379 + ], + "score": 1.0, + "content": "Resnet-18 pre-trained with ImageNet882 classification.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5 + }, + { + "type": "table_body", + "bbox": [ + 184, + 377, + 426, + 449 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 184, + 377, + 426, + 449 + ], + "spans": [ + { + "bbox": [ + 184, + 377, + 426, + 449 + ], + "score": 0.977, + "html": "
MethodACCACC(100)NMINMI(100)
K-means71.9%34.5%0.7130.671
LSC73.3%33.5%0.7330.655
LPNMF43.0%21.8%0.5260.500
CCN (ours)73.8%65.2%0.7500.715
", + "type": "table", + "image_path": "ed7b58dab6ef5fe60a2c9d95bf27a1b4443d28d6a8838d1fd037c05b989d02e4.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 184, + 377, + 426, + 391.4 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 184, + 391.4, + 426, + 405.79999999999995 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 184, + 405.79999999999995, + 426, + 420.19999999999993 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 184, + 420.19999999999993, + 426, + 434.5999999999999 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 184, + 434.5999999999999, + 426, + 448.9999999999999 + ], + "spans": [], + "index": 16 + } + ] + } + ], + "index": 11.75 + }, + { + "type": "table", + "bbox": [ + 116, + 608, + 495, + 697 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 531, + 506, + 608 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 105, + 531, + 506, + 544 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 345, + 544 + ], + "score": 1.0, + "content": "Table 9: Performance of the similarity prediction function (", + "type": "text" + }, + { + "bbox": [ + 345, + 532, + 354, + 542 + ], + "score": 0.66, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 531, + 506, + 544 + ], + "score": 1.0, + "content": ", trained with ImageN et882) applied", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 542, + 506, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 182, + 555 + ], + "score": 1.0, + "content": "to three subsets of", + "type": "text" + }, + { + "bbox": [ + 183, + 542, + 242, + 554 + ], + "score": 0.68, + "content": "I m a g e N e t _ { 1 1 8 }", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 542, + 423, + 555 + ], + "score": 1.0, + "content": ". Each subset contains 30 random classes of", + "type": "text" + }, + { + "bbox": [ + 423, + 543, + 482, + 554 + ], + "score": 0.43, + "content": "I m a g e N e t _ { 1 1 8 }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 542, + 506, + 555 + ], + "score": 1.0, + "content": ". The", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 553, + 506, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 553, + 506, + 565 + ], + "score": 1.0, + "content": "predictions are binarized at 0.5 to calculate the precision and recall. Random*: The expected", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 564, + 506, + 577 + ], + "spans": [ + { + "bbox": [ + 104, + 564, + 506, + 577 + ], + "score": 1.0, + "content": "performance when classes are uniformly distributed and make uniform random guess for similarity.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 576, + 506, + 587 + ], + "spans": [ + { + "bbox": [ + 106, + 576, + 506, + 587 + ], + "score": 1.0, + "content": "It is an approximation since the number of images in each class is only roughly equal in ImageNet.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 586, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 586, + 505, + 599 + ], + "score": 1.0, + "content": "We sampled 12M pairs for each set to collect the statistics. Sampling more pairs has no noticeable", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 597, + 193, + 609 + ], + "spans": [ + { + "bbox": [ + 106, + 597, + 193, + 609 + ], + "score": 1.0, + "content": "change to the values.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20 + }, + { + "type": "table_body", + "bbox": [ + 116, + 608, + 495, + 697 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 116, + 608, + 495, + 697 + ], + "spans": [ + { + "bbox": [ + 116, + 608, + 495, + 697 + ], + "score": 0.981, + "html": "
SetSimilar Precision Similar RecallDissimilar PrecisionDissimilar Recall
Random*0.0330.5000.9670.500
Set A0.8400.6640.9830.994
SetB0.8250.6310.9810.993
Set C0.7710.6710.9830.990
Average0.8120.6550.9820.992
", + "type": "table", + "image_path": "2fd973ba9b8e5a822c55ca7487481ec288ef5988660c0a3a7768ad39ede6159e.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 116, + 608, + 495, + 637.6666666666666 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 116, + 637.6666666666666, + 495, + 667.3333333333333 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 116, + 667.3333333333333, + 495, + 696.9999999999999 + ], + "spans": [], + "index": 26 + } + ] + } + ], + "index": 22.5 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 466, + 108 + ], + "lines": [ + { + "bbox": [ + 105, + 79, + 468, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 79, + 468, + 95 + ], + "score": 1.0, + "content": "C SUPPLEMENTARY FOR UNSUPERVISED CROSS DOMAIN TRANSFER", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 126, + 96, + 185, + 108 + ], + "spans": [ + { + "bbox": [ + 126, + 96, + 185, + 108 + ], + "score": 1.0, + "content": "LEARNING", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "title", + "bbox": [ + 107, + 120, + 365, + 132 + ], + "lines": [ + { + "bbox": [ + 106, + 120, + 366, + 133 + ], + "spans": [ + { + "bbox": [ + 106, + 120, + 366, + 133 + ], + "score": 1.0, + "content": "C.1 MORE DISCUSSION FOR THE OFFICE-31 EXPERIMENTS", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 106, + 140, + 505, + 218 + ], + "lines": [ + { + "bbox": [ + 106, + 140, + 506, + 154 + ], + "spans": [ + { + "bbox": [ + 106, + 140, + 506, + 154 + ], + "score": 1.0, + "content": "Our experiment (table 10) shows that simply using deeper pre-trained networks produces a significant", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 151, + 506, + 165 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 506, + 165 + ], + "score": 1.0, + "content": "performance boost. Specifically, using Resnet-50 increases the performance 8.4 points from Alexnet,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 162, + 506, + 176 + ], + "spans": [ + { + "bbox": [ + 105, + 162, + 506, + 176 + ], + "score": 1.0, + "content": "which surpasses the 6.2 points gained by using one of the state-of-the-art domain adaptation algorithms", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 173, + 506, + 187 + ], + "spans": [ + { + "bbox": [ + 105, + 173, + 506, + 187 + ], + "score": 1.0, + "content": "(JAN (Long et al., 2017)). If we regard pre-training with deeper networks as transferring more", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 184, + 505, + 197 + ], + "spans": [ + { + "bbox": [ + 105, + 184, + 505, + 197 + ], + "score": 1.0, + "content": "information, our approach is similar in this aspect since both transfer more information from the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 196, + 506, + 208 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 506, + 208 + ], + "score": 1.0, + "content": "auxiliary dataset. In this case, memory limitations precluded the application of LCO to such models,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 207, + 409, + 219 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 409, + 219 + ], + "score": 1.0, + "content": "and multi-GPU implementations for this problem is an area of future work.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6 + }, + { + "type": "table", + "bbox": [ + 109, + 293, + 502, + 371 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 237, + 505, + 292 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 237, + 506, + 250 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 506, + 250 + ], + "score": 1.0, + "content": "Table 10: The performance of unsupervised transfer across domains on Office-31 dataset. The", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 247, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 106, + 247, + 505, + 260 + ], + "score": 1.0, + "content": "backbone networks in the comparison have different numbers of convolutional layers. AlexNet has", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 258, + 505, + 273 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 230, + 273 + ], + "score": 1.0, + "content": "5 layers and the ResNets have", + "type": "text" + }, + { + "bbox": [ + 230, + 259, + 259, + 270 + ], + "score": 0.85, + "content": "1 8 { \\sim } 5 0", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 258, + 505, + 273 + ], + "score": 1.0, + "content": "layers. SO is the abbreviation for source-only, which simply", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 268, + 506, + 285 + ], + "spans": [ + { + "bbox": [ + 104, + 268, + 143, + 285 + ], + "score": 1.0, + "content": "trains on", + "type": "text" + }, + { + "bbox": [ + 143, + 270, + 154, + 280 + ], + "score": 0.86, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 268, + 298, + 285 + ], + "score": 1.0, + "content": "and directly applies the classifier on", + "type": "text" + }, + { + "bbox": [ + 298, + 271, + 307, + 280 + ], + "score": 0.6, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 268, + 506, + 285 + ], + "score": 1.0, + "content": ". The first two rows are directly copied from Long", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 281, + 467, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 467, + 294 + ], + "score": 1.0, + "content": "et al. (2017). The features learned with deeper networks generalize better across domains.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12 + }, + { + "type": "table_body", + "bbox": [ + 109, + 293, + 502, + 371 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 293, + 502, + 371 + ], + "spans": [ + { + "bbox": [ + 109, + 293, + 502, + 371 + ], + "score": 0.979, + "html": "
A→W D→W W→D A→D D→A W→A
AlexNet SO61.695.499.063.851.149.8Avg 70.11
AlexNet (JAN-A)75.296.699.672.857.556.376.3+6.2
Resnet-18 SO66.892.896.867.151.453.071.3+1.2
Resnet-34 SO73.196.498.873.863.262.177.9+7.8
Resnet-50 SO74.396.898.879.561.260.678.5+8.4
", + "type": "table", + "image_path": "8b547758927a8194ad9bb2d90cb1ef3c9d64fc483b82dadb28405678cd15be07.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 109, + 293, + 502, + 319.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 109, + 319.0, + 502, + 345.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 109, + 345.0, + 502, + 371.0 + ], + "spans": [], + "index": 17 + } + ] + } + ], + "index": 14.0 + }, + { + "type": "table", + "bbox": [ + 117, + 419, + 493, + 474 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 395, + 502, + 418 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 395, + 504, + 408 + ], + "spans": [ + { + "bbox": [ + 106, + 395, + 346, + 408 + ], + "score": 1.0, + "content": "Table 11: Performance of the similarity prediction function (", + "type": "text" + }, + { + "bbox": [ + 347, + 396, + 355, + 406 + ], + "score": 0.61, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 395, + 504, + 408 + ], + "score": 1.0, + "content": ", trained with ImageNet882) applied", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 407, + 498, + 419 + ], + "spans": [ + { + "bbox": [ + 106, + 407, + 498, + 419 + ], + "score": 1.0, + "content": "on three domains of the Office-31 dataset. In total, 1.4M pairs are examined to calculate the table.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "table_body", + "bbox": [ + 117, + 419, + 493, + 474 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 117, + 419, + 493, + 474 + ], + "spans": [ + { + "bbox": [ + 117, + 419, + 493, + 474 + ], + "score": 0.973, + "html": "
DomainSimilar PrecisionSimilar RecallDissimilar PrecisionDissimilar Recall
Amazon0.1940.6960.9880.894
DSLR0.1960.8820.9950.858
Webcam0.2130.8650.9940.876
", + "type": "table", + "image_path": "6710c86e7661394e049d39d0714ba25355b67f32155cc9ea97e9c59e48599d1d.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 117, + 419, + 493, + 437.3333333333333 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 117, + 437.3333333333333, + 493, + 455.66666666666663 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 117, + 455.66666666666663, + 493, + 473.99999999999994 + ], + "spans": [], + "index": 22 + } + ] + } + ], + "index": 19.75 + }, + { + "type": "table", + "bbox": [ + 170, + 533, + 441, + 686 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 499, + 503, + 533 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 105, + 498, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 505, + 513 + ], + "score": 1.0, + "content": "Table 12: Unsupervised transferring across domains (S’: SVHN, T: MNIST A: Omniglotbg) without", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 511, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 523 + ], + "score": 1.0, + "content": "pre-trained backbone network weights. Our setup is similar to Sener et al. (2016) and Ganin et al.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 521, + 359, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 521, + 359, + 534 + ], + "score": 1.0, + "content": "(2016) which therefore has a similar source-only performance.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24 + }, + { + "type": "table_body", + "bbox": [ + 170, + 533, + 441, + 686 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 170, + 533, + 441, + 686 + ], + "spans": [ + { + "bbox": [ + 170, + 533, + 441, + 686 + ], + "score": 0.982, + "html": "
MethodSVHN->MNISTGain
Ganin et al. (2016)Source-Only DANN54.9 73.91 +19.0
Sener et al. (2016)Source-Only LTR54.9 78.81 +23.9
Saito et al. (2017)Source-Only ATDA70.1 86.2- +16.1
Tzeng et al. (2017)Source-Only ADDA60.1 76.0- +15.9
OursSource-Only CCN+52.0 89.11 +37.1
", + "type": "table", + "image_path": "25c5d5e868a3d729788c298939bb3733d14f6e33ffebc69fbaad1b8d49e8a041.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 170, + 533, + 441, + 584.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 170, + 584.0, + 441, + 635.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 170, + 635.0, + 441, + 686.0 + ], + "spans": [], + "index": 28 + } + ] + } + ], + "index": 25.5 + } + ], + "page_idx": 17, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 763 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 763 + ], + "score": 1.0, + "content": "18", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 466, + 108 + ], + "lines": [ + { + "bbox": [ + 105, + 79, + 468, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 79, + 468, + 95 + ], + "score": 1.0, + "content": "C SUPPLEMENTARY FOR UNSUPERVISED CROSS DOMAIN TRANSFER", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 126, + 96, + 185, + 108 + ], + "spans": [ + { + "bbox": [ + 126, + 96, + 185, + 108 + ], + "score": 1.0, + "content": "LEARNING", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "title", + "bbox": [ + 107, + 120, + 365, + 132 + ], + "lines": [ + { + "bbox": [ + 106, + 120, + 366, + 133 + ], + "spans": [ + { + "bbox": [ + 106, + 120, + 366, + 133 + ], + "score": 1.0, + "content": "C.1 MORE DISCUSSION FOR THE OFFICE-31 EXPERIMENTS", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 106, + 140, + 505, + 218 + ], + "lines": [ + { + "bbox": [ + 106, + 140, + 506, + 154 + ], + "spans": [ + { + "bbox": [ + 106, + 140, + 506, + 154 + ], + "score": 1.0, + "content": "Our experiment (table 10) shows that simply using deeper pre-trained networks produces a significant", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 151, + 506, + 165 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 506, + 165 + ], + "score": 1.0, + "content": "performance boost. Specifically, using Resnet-50 increases the performance 8.4 points from Alexnet,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 162, + 506, + 176 + ], + "spans": [ + { + "bbox": [ + 105, + 162, + 506, + 176 + ], + "score": 1.0, + "content": "which surpasses the 6.2 points gained by using one of the state-of-the-art domain adaptation algorithms", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 173, + 506, + 187 + ], + "spans": [ + { + "bbox": [ + 105, + 173, + 506, + 187 + ], + "score": 1.0, + "content": "(JAN (Long et al., 2017)). If we regard pre-training with deeper networks as transferring more", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 184, + 505, + 197 + ], + "spans": [ + { + "bbox": [ + 105, + 184, + 505, + 197 + ], + "score": 1.0, + "content": "information, our approach is similar in this aspect since both transfer more information from the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 196, + 506, + 208 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 506, + 208 + ], + "score": 1.0, + "content": "auxiliary dataset. In this case, memory limitations precluded the application of LCO to such models,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 207, + 409, + 219 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 409, + 219 + ], + "score": 1.0, + "content": "and multi-GPU implementations for this problem is an area of future work.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6, + "bbox_fs": [ + 105, + 140, + 506, + 219 + ] + }, + { + "type": "table", + "bbox": [ + 109, + 293, + 502, + 371 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 237, + 505, + 292 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 237, + 506, + 250 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 506, + 250 + ], + "score": 1.0, + "content": "Table 10: The performance of unsupervised transfer across domains on Office-31 dataset. The", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 247, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 106, + 247, + 505, + 260 + ], + "score": 1.0, + "content": "backbone networks in the comparison have different numbers of convolutional layers. AlexNet has", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 258, + 505, + 273 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 230, + 273 + ], + "score": 1.0, + "content": "5 layers and the ResNets have", + "type": "text" + }, + { + "bbox": [ + 230, + 259, + 259, + 270 + ], + "score": 0.85, + "content": "1 8 { \\sim } 5 0", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 258, + 505, + 273 + ], + "score": 1.0, + "content": "layers. SO is the abbreviation for source-only, which simply", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 268, + 506, + 285 + ], + "spans": [ + { + "bbox": [ + 104, + 268, + 143, + 285 + ], + "score": 1.0, + "content": "trains on", + "type": "text" + }, + { + "bbox": [ + 143, + 270, + 154, + 280 + ], + "score": 0.86, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 268, + 298, + 285 + ], + "score": 1.0, + "content": "and directly applies the classifier on", + "type": "text" + }, + { + "bbox": [ + 298, + 271, + 307, + 280 + ], + "score": 0.6, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 268, + 506, + 285 + ], + "score": 1.0, + "content": ". The first two rows are directly copied from Long", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 281, + 467, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 467, + 294 + ], + "score": 1.0, + "content": "et al. (2017). The features learned with deeper networks generalize better across domains.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12 + }, + { + "type": "table_body", + "bbox": [ + 109, + 293, + 502, + 371 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 293, + 502, + 371 + ], + "spans": [ + { + "bbox": [ + 109, + 293, + 502, + 371 + ], + "score": 0.979, + "html": "
A→W D→W W→D A→D D→A W→A
AlexNet SO61.695.499.063.851.149.8Avg 70.11
AlexNet (JAN-A)75.296.699.672.857.556.376.3+6.2
Resnet-18 SO66.892.896.867.151.453.071.3+1.2
Resnet-34 SO73.196.498.873.863.262.177.9+7.8
Resnet-50 SO74.396.898.879.561.260.678.5+8.4
", + "type": "table", + "image_path": "8b547758927a8194ad9bb2d90cb1ef3c9d64fc483b82dadb28405678cd15be07.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 109, + 293, + 502, + 319.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 109, + 319.0, + 502, + 345.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 109, + 345.0, + 502, + 371.0 + ], + "spans": [], + "index": 17 + } + ] + } + ], + "index": 14.0 + }, + { + "type": "table", + "bbox": [ + 117, + 419, + 493, + 474 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 395, + 502, + 418 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 395, + 504, + 408 + ], + "spans": [ + { + "bbox": [ + 106, + 395, + 346, + 408 + ], + "score": 1.0, + "content": "Table 11: Performance of the similarity prediction function (", + "type": "text" + }, + { + "bbox": [ + 347, + 396, + 355, + 406 + ], + "score": 0.61, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 395, + 504, + 408 + ], + "score": 1.0, + "content": ", trained with ImageNet882) applied", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 407, + 498, + 419 + ], + "spans": [ + { + "bbox": [ + 106, + 407, + 498, + 419 + ], + "score": 1.0, + "content": "on three domains of the Office-31 dataset. In total, 1.4M pairs are examined to calculate the table.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "table_body", + "bbox": [ + 117, + 419, + 493, + 474 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 117, + 419, + 493, + 474 + ], + "spans": [ + { + "bbox": [ + 117, + 419, + 493, + 474 + ], + "score": 0.973, + "html": "
DomainSimilar PrecisionSimilar RecallDissimilar PrecisionDissimilar Recall
Amazon0.1940.6960.9880.894
DSLR0.1960.8820.9950.858
Webcam0.2130.8650.9940.876
", + "type": "table", + "image_path": "6710c86e7661394e049d39d0714ba25355b67f32155cc9ea97e9c59e48599d1d.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 117, + 419, + 493, + 437.3333333333333 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 117, + 437.3333333333333, + 493, + 455.66666666666663 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 117, + 455.66666666666663, + 493, + 473.99999999999994 + ], + "spans": [], + "index": 22 + } + ] + } + ], + "index": 19.75 + }, + { + "type": "table", + "bbox": [ + 170, + 533, + 441, + 686 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 499, + 503, + 533 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 105, + 498, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 505, + 513 + ], + "score": 1.0, + "content": "Table 12: Unsupervised transferring across domains (S’: SVHN, T: MNIST A: Omniglotbg) without", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 511, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 523 + ], + "score": 1.0, + "content": "pre-trained backbone network weights. Our setup is similar to Sener et al. (2016) and Ganin et al.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 521, + 359, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 521, + 359, + 534 + ], + "score": 1.0, + "content": "(2016) which therefore has a similar source-only performance.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24 + }, + { + "type": "table_body", + "bbox": [ + 170, + 533, + 441, + 686 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 170, + 533, + 441, + 686 + ], + "spans": [ + { + "bbox": [ + 170, + 533, + 441, + 686 + ], + "score": 0.982, + "html": "
MethodSVHN->MNISTGain
Ganin et al. (2016)Source-Only DANN54.9 73.91 +19.0
Sener et al. (2016)Source-Only LTR54.9 78.81 +23.9
Saito et al. (2017)Source-Only ATDA70.1 86.2- +16.1
Tzeng et al. (2017)Source-Only ADDA60.1 76.0- +15.9
OursSource-Only CCN+52.0 89.11 +37.1
", + "type": "table", + "image_path": "25c5d5e868a3d729788c298939bb3733d14f6e33ffebc69fbaad1b8d49e8a041.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 170, + 533, + 441, + 584.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 170, + 584.0, + 441, + 635.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 170, + 635.0, + 441, + 686.0 + ], + "spans": [], + "index": 28 + } + ] + } + ], + "index": 25.5 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 118, + 113, + 492, + 157 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 89, + 502, + 111 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 88, + 504, + 102 + ], + "spans": [ + { + "bbox": [ + 105, + 88, + 343, + 102 + ], + "score": 1.0, + "content": "Table 13: Performance of the similarity prediction function (", + "type": "text" + }, + { + "bbox": [ + 343, + 90, + 352, + 100 + ], + "score": 0.6, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 88, + 504, + 102 + ], + "score": 1.0, + "content": ", trained with Omniglotbg) applied on", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 100, + 397, + 113 + ], + "spans": [ + { + "bbox": [ + 106, + 100, + 397, + 113 + ], + "score": 1.0, + "content": "the MNIST dataset. In total, 5M pairs are sampled to calculate the table.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "table_body", + "bbox": [ + 118, + 113, + 492, + 157 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 118, + 113, + 492, + 157 + ], + "spans": [ + { + "bbox": [ + 118, + 113, + 492, + 157 + ], + "score": 0.974, + "html": "
Similar PrecisionSimilar RecallDissimilar PrecisionDissimilar Recall
Random0.1000.5000.9000.500
MNIST0.7820.5090.9460.984
", + "type": "table", + "image_path": "de85c2a20514b9e73a5603c61cc374d3b3140630ae5017bceac12a520b099289.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 118, + 113, + 492, + 127.66666666666667 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 118, + 127.66666666666667, + 492, + 142.33333333333334 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 118, + 142.33333333333334, + 492, + 157.0 + ], + "spans": [], + "index": 4 + } + ] + } + ], + "index": 1.75 + }, + { + "type": "title", + "bbox": [ + 105, + 183, + 467, + 195 + ], + "lines": [ + { + "bbox": [ + 104, + 182, + 469, + 197 + ], + "spans": [ + { + "bbox": [ + 104, + 182, + 469, + 197 + ], + "score": 1.0, + "content": "D ROBUSTNESS ANALYSIS OF CONSTRAINED CLUSTERING NETWORK", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "title", + "bbox": [ + 107, + 207, + 162, + 218 + ], + "lines": [ + { + "bbox": [ + 106, + 206, + 163, + 220 + ], + "spans": [ + { + "bbox": [ + 106, + 206, + 163, + 220 + ], + "score": 1.0, + "content": "D.1 SETUP", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 107, + 228, + 505, + 283 + ], + "lines": [ + { + "bbox": [ + 106, + 228, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 106, + 228, + 505, + 240 + ], + "score": 1.0, + "content": "To quickly explore the large combination of factors that may affect the clustering, we use a small", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 238, + 505, + 252 + ], + "spans": [ + { + "bbox": [ + 105, + 238, + 505, + 252 + ], + "score": 1.0, + "content": "dataset (MNIST) and a small network which has two convolution layers followed by two fully", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 250, + 505, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 505, + 263 + ], + "score": 1.0, + "content": "connected layers. The MNIST dataset is a dataset of handwritten digits that contains 60k training and", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 261, + 506, + 274 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 222, + 274 + ], + "score": 1.0, + "content": "10k testing images with size", + "type": "text" + }, + { + "bbox": [ + 222, + 261, + 249, + 272 + ], + "score": 0.74, + "content": "2 8 \\mathbf { x } 2 8", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 261, + 506, + 274 + ], + "score": 1.0, + "content": ". Only the training set is used in this section and the raw pixels,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 271, + 498, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 271, + 498, + 285 + ], + "score": 1.0, + "content": "which were normalized to zero mean and unit standard deviation, were fed into networks directly.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 107, + 288, + 505, + 366 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 505, + 301 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 505, + 301 + ], + "score": 1.0, + "content": "The networks were randomly initialized and the clustering training was run five times under each", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 299, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 505, + 312 + ], + "score": 1.0, + "content": "combination of factors; we show the best final results, as is usual in the random restart regime. The", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 311, + 506, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 506, + 323 + ], + "score": 1.0, + "content": "mini-batch size was set to 256, thus up to 65536 pairs were presented to the LCO per mini-batch if", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 322, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 179, + 334 + ], + "score": 1.0, + "content": "using full density", + "type": "text" + }, + { + "bbox": [ + 179, + 322, + 202, + 333 + ], + "score": 0.77, + "content": "\\mathrm { ( D } { = } 1 \\mathrm { ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 202, + 322, + 505, + 334 + ], + "score": 1.0, + "content": "). There were 235 mini-batches in an epoch and the optimization proceeded", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 332, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 332, + 505, + 345 + ], + "score": 1.0, + "content": "for 15 epochs. The clustering loss was minimized by stochastic gradient descent with learning rate", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 343, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 104, + 343, + 505, + 357 + ], + "score": 1.0, + "content": "0.1 and momentum 0.9. The predicted cluster was assigned at the end by forwarding samples through", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 355, + 384, + 367 + ], + "spans": [ + { + "bbox": [ + 106, + 355, + 384, + 367 + ], + "score": 1.0, + "content": "the clustering networks. The best result in the five runs was reported.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 107, + 371, + 505, + 437 + ], + "lines": [ + { + "bbox": [ + 105, + 370, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 505, + 385 + ], + "score": 1.0, + "content": "To simulate different performance of the similarity prediction, the label of pairs were flipped according", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 382, + 505, + 395 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 317, + 395 + ], + "score": 1.0, + "content": "to the designated recall. For example, to simulate a", + "type": "text" + }, + { + "bbox": [ + 317, + 383, + 338, + 393 + ], + "score": 0.88, + "content": "90 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 382, + 426, + 395 + ], + "score": 1.0, + "content": "recall of similar pair,", + "type": "text" + }, + { + "bbox": [ + 426, + 383, + 446, + 393 + ], + "score": 0.86, + "content": "10 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 382, + 505, + 395 + ], + "score": 1.0, + "content": "of the ground", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 394, + 504, + 405 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 504, + 405 + ], + "score": 1.0, + "content": "truth similar pair in a mini-batch were flipped. The precision of similar/dissimilar pairs is a function", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 404, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 404, + 505, + 417 + ], + "score": 1.0, + "content": "of the recall of both type of pairs, thus controlling the recall is sufficient for the evaluation. The", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 414, + 506, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 506, + 428 + ], + "score": 1.0, + "content": "recalls for both similar and dissimilar pairs were gradually reduced from one to zero at intervals of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 426, + 126, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 126, + 438 + ], + "score": 1.0, + "content": "0.1.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21.5 + }, + { + "type": "title", + "bbox": [ + 108, + 451, + 187, + 463 + ], + "lines": [ + { + "bbox": [ + 105, + 450, + 189, + 465 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 189, + 465 + ], + "score": 1.0, + "content": "D.2 DISCUSSION", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 472, + 505, + 516 + ], + "lines": [ + { + "bbox": [ + 106, + 473, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 106, + 473, + 505, + 484 + ], + "score": 1.0, + "content": "The resulting performance w.r.t different values of recall, density, and number of clusters is visualized", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 483, + 504, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 504, + 495 + ], + "score": 1.0, + "content": "in Figure 8. A bright color means high NMI score and is desired. The larger the bright region, the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 495, + 506, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 506, + 507 + ], + "score": 1.0, + "content": "more robust the clustering is against the noise of similarity prediction. The ACC score shows almost", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 505, + 279, + 518 + ], + "spans": [ + { + "bbox": [ + 106, + 505, + 279, + 518 + ], + "score": 1.0, + "content": "the same trend and is thus not shown here.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 107, + 522, + 505, + 588 + ], + "lines": [ + { + "bbox": [ + 105, + 522, + 507, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 507, + 535 + ], + "score": 1.0, + "content": "How does similarity prediction affect clustering? Looking at the top-left heat map in figure 8,", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 533, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 106, + 533, + 148, + 545 + ], + "score": 1.0, + "content": "which has", + "type": "text" + }, + { + "bbox": [ + 149, + 533, + 177, + 543 + ], + "score": 0.9, + "content": "D = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 533, + 506, + 545 + ], + "score": 1.0, + "content": "and 10 clusters, it can be observed that the NMI score is very robust to low similar", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 543, + 506, + 557 + ], + "spans": [ + { + "bbox": [ + 104, + 543, + 506, + 557 + ], + "score": 1.0, + "content": "pair recall, even lower than 0.5. For recall of dissimilar pairs, the effect of recall is divided at the 0.5", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 555, + 506, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 506, + 568 + ], + "score": 1.0, + "content": "value: the clustering performance can be very robust to noise in dissimilar pairs if the recall is greater", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 565, + 504, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 504, + 578 + ], + "score": 1.0, + "content": "than 0.5; however, it can completely fail if recall is below 0.5. For similar pairs, the clustering works", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 578, + 380, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 380, + 589 + ], + "score": 1.0, + "content": "on a wide range of recalls when the recall of dissimilar pairs is high.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 107, + 594, + 505, + 638 + ], + "lines": [ + { + "bbox": [ + 105, + 594, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 506, + 606 + ], + "score": 1.0, + "content": "In practical terms, robustness to the recall of similar pairs is desirable because it is much easier", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 604, + 507, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 507, + 618 + ], + "score": 1.0, + "content": "to predict dissimilar pairs than similar pairs in real scenarios. In a dataset with 10 categories e.g.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 615, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 213, + 628 + ], + "score": 1.0, + "content": "Cifar-10, we can easily get", + "type": "text" + }, + { + "bbox": [ + 214, + 616, + 233, + 627 + ], + "score": 0.86, + "content": "90 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 615, + 506, + 628 + ], + "score": 1.0, + "content": "recall for dissimilar pairs with purely random guess if the number of", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 627, + 361, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 338, + 639 + ], + "score": 1.0, + "content": "classes is known, while the recall for similar pairs will be", + "type": "text" + }, + { + "bbox": [ + 338, + 627, + 357, + 637 + ], + "score": 0.87, + "content": "10 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 627, + 361, + 639 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 107, + 643, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 643, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 643, + 505, + 657 + ], + "score": 1.0, + "content": "How does the density of the constraints affect clustering? We argue that the density of pairwise", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 447, + 667 + ], + "score": 1.0, + "content": "relationships is the key factor to improving the robustness of clustering. The density", + "type": "text" + }, + { + "bbox": [ + 448, + 655, + 475, + 665 + ], + "score": 0.9, + "content": "D = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "means", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 666, + 504, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 667, + 403, + 677 + ], + "score": 1.0, + "content": "that every pair in a mini-batch is utilized by the clustering loss. For density", + "type": "text" + }, + { + "bbox": [ + 403, + 666, + 439, + 676 + ], + "score": 0.91, + "content": "D = 0 . 1", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 667, + 504, + 677 + ], + "score": 1.0, + "content": ", it means only 1", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "out of 10 possible constraints is used. We could regard the higher density as better utilization of the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 687, + 507, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 507, + 701 + ], + "score": 1.0, + "content": "pairwise information in a mini-batch, thus more learning instances contribute to the gradients at once.", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "score": 1.0, + "content": "Consider a scenario where there is one sample associated with 5 true similar pairs and 3 false similar", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "pairs. In such a case, the gradients introduced by the false similar pairs have a higher chance to be", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "overridden by true similar pairs within the mini-batch, thus the loss can converge faster and is less", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 43.5 + } + ], + "page_idx": 18, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "19", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 118, + 113, + 492, + 157 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 89, + 502, + 111 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 88, + 504, + 102 + ], + "spans": [ + { + "bbox": [ + 105, + 88, + 343, + 102 + ], + "score": 1.0, + "content": "Table 13: Performance of the similarity prediction function (", + "type": "text" + }, + { + "bbox": [ + 343, + 90, + 352, + 100 + ], + "score": 0.6, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 88, + 504, + 102 + ], + "score": 1.0, + "content": ", trained with Omniglotbg) applied on", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 100, + 397, + 113 + ], + "spans": [ + { + "bbox": [ + 106, + 100, + 397, + 113 + ], + "score": 1.0, + "content": "the MNIST dataset. In total, 5M pairs are sampled to calculate the table.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "table_body", + "bbox": [ + 118, + 113, + 492, + 157 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 118, + 113, + 492, + 157 + ], + "spans": [ + { + "bbox": [ + 118, + 113, + 492, + 157 + ], + "score": 0.974, + "html": "
Similar PrecisionSimilar RecallDissimilar PrecisionDissimilar Recall
Random0.1000.5000.9000.500
MNIST0.7820.5090.9460.984
", + "type": "table", + "image_path": "de85c2a20514b9e73a5603c61cc374d3b3140630ae5017bceac12a520b099289.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 118, + 113, + 492, + 127.66666666666667 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 118, + 127.66666666666667, + 492, + 142.33333333333334 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 118, + 142.33333333333334, + 492, + 157.0 + ], + "spans": [], + "index": 4 + } + ] + } + ], + "index": 1.75 + }, + { + "type": "title", + "bbox": [ + 105, + 183, + 467, + 195 + ], + "lines": [ + { + "bbox": [ + 104, + 182, + 469, + 197 + ], + "spans": [ + { + "bbox": [ + 104, + 182, + 469, + 197 + ], + "score": 1.0, + "content": "D ROBUSTNESS ANALYSIS OF CONSTRAINED CLUSTERING NETWORK", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "title", + "bbox": [ + 107, + 207, + 162, + 218 + ], + "lines": [ + { + "bbox": [ + 106, + 206, + 163, + 220 + ], + "spans": [ + { + "bbox": [ + 106, + 206, + 163, + 220 + ], + "score": 1.0, + "content": "D.1 SETUP", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 107, + 228, + 505, + 283 + ], + "lines": [ + { + "bbox": [ + 106, + 228, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 106, + 228, + 505, + 240 + ], + "score": 1.0, + "content": "To quickly explore the large combination of factors that may affect the clustering, we use a small", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 238, + 505, + 252 + ], + "spans": [ + { + "bbox": [ + 105, + 238, + 505, + 252 + ], + "score": 1.0, + "content": "dataset (MNIST) and a small network which has two convolution layers followed by two fully", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 250, + 505, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 505, + 263 + ], + "score": 1.0, + "content": "connected layers. The MNIST dataset is a dataset of handwritten digits that contains 60k training and", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 261, + 506, + 274 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 222, + 274 + ], + "score": 1.0, + "content": "10k testing images with size", + "type": "text" + }, + { + "bbox": [ + 222, + 261, + 249, + 272 + ], + "score": 0.74, + "content": "2 8 \\mathbf { x } 2 8", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 261, + 506, + 274 + ], + "score": 1.0, + "content": ". Only the training set is used in this section and the raw pixels,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 271, + 498, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 271, + 498, + 285 + ], + "score": 1.0, + "content": "which were normalized to zero mean and unit standard deviation, were fed into networks directly.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 228, + 506, + 285 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 288, + 505, + 366 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 505, + 301 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 505, + 301 + ], + "score": 1.0, + "content": "The networks were randomly initialized and the clustering training was run five times under each", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 299, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 505, + 312 + ], + "score": 1.0, + "content": "combination of factors; we show the best final results, as is usual in the random restart regime. The", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 311, + 506, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 506, + 323 + ], + "score": 1.0, + "content": "mini-batch size was set to 256, thus up to 65536 pairs were presented to the LCO per mini-batch if", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 322, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 179, + 334 + ], + "score": 1.0, + "content": "using full density", + "type": "text" + }, + { + "bbox": [ + 179, + 322, + 202, + 333 + ], + "score": 0.77, + "content": "\\mathrm { ( D } { = } 1 \\mathrm { ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 202, + 322, + 505, + 334 + ], + "score": 1.0, + "content": "). There were 235 mini-batches in an epoch and the optimization proceeded", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 332, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 332, + 505, + 345 + ], + "score": 1.0, + "content": "for 15 epochs. The clustering loss was minimized by stochastic gradient descent with learning rate", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 343, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 104, + 343, + 505, + 357 + ], + "score": 1.0, + "content": "0.1 and momentum 0.9. The predicted cluster was assigned at the end by forwarding samples through", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 355, + 384, + 367 + ], + "spans": [ + { + "bbox": [ + 106, + 355, + 384, + 367 + ], + "score": 1.0, + "content": "the clustering networks. The best result in the five runs was reported.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 15, + "bbox_fs": [ + 104, + 289, + 506, + 367 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 371, + 505, + 437 + ], + "lines": [ + { + "bbox": [ + 105, + 370, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 505, + 385 + ], + "score": 1.0, + "content": "To simulate different performance of the similarity prediction, the label of pairs were flipped according", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 382, + 505, + 395 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 317, + 395 + ], + "score": 1.0, + "content": "to the designated recall. For example, to simulate a", + "type": "text" + }, + { + "bbox": [ + 317, + 383, + 338, + 393 + ], + "score": 0.88, + "content": "90 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 382, + 426, + 395 + ], + "score": 1.0, + "content": "recall of similar pair,", + "type": "text" + }, + { + "bbox": [ + 426, + 383, + 446, + 393 + ], + "score": 0.86, + "content": "10 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 382, + 505, + 395 + ], + "score": 1.0, + "content": "of the ground", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 394, + 504, + 405 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 504, + 405 + ], + "score": 1.0, + "content": "truth similar pair in a mini-batch were flipped. The precision of similar/dissimilar pairs is a function", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 404, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 404, + 505, + 417 + ], + "score": 1.0, + "content": "of the recall of both type of pairs, thus controlling the recall is sufficient for the evaluation. The", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 414, + 506, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 506, + 428 + ], + "score": 1.0, + "content": "recalls for both similar and dissimilar pairs were gradually reduced from one to zero at intervals of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 426, + 126, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 126, + 438 + ], + "score": 1.0, + "content": "0.1.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 370, + 506, + 438 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 451, + 187, + 463 + ], + "lines": [ + { + "bbox": [ + 105, + 450, + 189, + 465 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 189, + 465 + ], + "score": 1.0, + "content": "D.2 DISCUSSION", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 472, + 505, + 516 + ], + "lines": [ + { + "bbox": [ + 106, + 473, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 106, + 473, + 505, + 484 + ], + "score": 1.0, + "content": "The resulting performance w.r.t different values of recall, density, and number of clusters is visualized", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 483, + 504, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 504, + 495 + ], + "score": 1.0, + "content": "in Figure 8. A bright color means high NMI score and is desired. The larger the bright region, the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 495, + 506, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 506, + 507 + ], + "score": 1.0, + "content": "more robust the clustering is against the noise of similarity prediction. The ACC score shows almost", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 505, + 279, + 518 + ], + "spans": [ + { + "bbox": [ + 106, + 505, + 279, + 518 + ], + "score": 1.0, + "content": "the same trend and is thus not shown here.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 473, + 506, + 518 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 522, + 505, + 588 + ], + "lines": [ + { + "bbox": [ + 105, + 522, + 507, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 507, + 535 + ], + "score": 1.0, + "content": "How does similarity prediction affect clustering? Looking at the top-left heat map in figure 8,", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 533, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 106, + 533, + 148, + 545 + ], + "score": 1.0, + "content": "which has", + "type": "text" + }, + { + "bbox": [ + 149, + 533, + 177, + 543 + ], + "score": 0.9, + "content": "D = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 533, + 506, + 545 + ], + "score": 1.0, + "content": "and 10 clusters, it can be observed that the NMI score is very robust to low similar", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 543, + 506, + 557 + ], + "spans": [ + { + "bbox": [ + 104, + 543, + 506, + 557 + ], + "score": 1.0, + "content": "pair recall, even lower than 0.5. For recall of dissimilar pairs, the effect of recall is divided at the 0.5", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 555, + 506, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 506, + 568 + ], + "score": 1.0, + "content": "value: the clustering performance can be very robust to noise in dissimilar pairs if the recall is greater", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 565, + 504, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 504, + 578 + ], + "score": 1.0, + "content": "than 0.5; however, it can completely fail if recall is below 0.5. For similar pairs, the clustering works", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 578, + 380, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 380, + 589 + ], + "score": 1.0, + "content": "on a wide range of recalls when the recall of dissimilar pairs is high.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32.5, + "bbox_fs": [ + 104, + 522, + 507, + 589 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 594, + 505, + 638 + ], + "lines": [ + { + "bbox": [ + 105, + 594, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 506, + 606 + ], + "score": 1.0, + "content": "In practical terms, robustness to the recall of similar pairs is desirable because it is much easier", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 604, + 507, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 507, + 618 + ], + "score": 1.0, + "content": "to predict dissimilar pairs than similar pairs in real scenarios. In a dataset with 10 categories e.g.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 615, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 213, + 628 + ], + "score": 1.0, + "content": "Cifar-10, we can easily get", + "type": "text" + }, + { + "bbox": [ + 214, + 616, + 233, + 627 + ], + "score": 0.86, + "content": "90 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 615, + 506, + 628 + ], + "score": 1.0, + "content": "recall for dissimilar pairs with purely random guess if the number of", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 627, + 361, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 338, + 639 + ], + "score": 1.0, + "content": "classes is known, while the recall for similar pairs will be", + "type": "text" + }, + { + "bbox": [ + 338, + 627, + 357, + 637 + ], + "score": 0.87, + "content": "10 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 627, + 361, + 639 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 594, + 507, + 639 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 643, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 643, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 643, + 505, + 657 + ], + "score": 1.0, + "content": "How does the density of the constraints affect clustering? We argue that the density of pairwise", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 447, + 667 + ], + "score": 1.0, + "content": "relationships is the key factor to improving the robustness of clustering. The density", + "type": "text" + }, + { + "bbox": [ + 448, + 655, + 475, + 665 + ], + "score": 0.9, + "content": "D = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "means", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 666, + 504, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 667, + 403, + 677 + ], + "score": 1.0, + "content": "that every pair in a mini-batch is utilized by the clustering loss. For density", + "type": "text" + }, + { + "bbox": [ + 403, + 666, + 439, + 676 + ], + "score": 0.91, + "content": "D = 0 . 1", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 667, + 504, + 677 + ], + "score": 1.0, + "content": ", it means only 1", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "out of 10 possible constraints is used. We could regard the higher density as better utilization of the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 687, + 507, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 507, + 701 + ], + "score": 1.0, + "content": "pairwise information in a mini-batch, thus more learning instances contribute to the gradients at once.", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "score": 1.0, + "content": "Consider a scenario where there is one sample associated with 5 true similar pairs and 3 false similar", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "pairs. In such a case, the gradients introduced by the false similar pairs have a higher chance to be", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "overridden by true similar pairs within the mini-batch, thus the loss can converge faster and is less", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 390, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 505, + 405 + ], + "score": 1.0, + "content": "affected by errors. In Figure 8, we could see when density decreases, the size of the bright region", + "type": "text", + "cross_page": true + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 402, + 191, + 416 + ], + "spans": [ + { + "bbox": [ + 106, + 402, + 191, + 416 + ], + "score": 1.0, + "content": "shrinks significantly.", + "type": "text", + "cross_page": true + } + ], + "index": 24 + } + ], + "index": 43.5, + "bbox_fs": [ + 105, + 643, + 507, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 173, + 84, + 455, + 300 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 173, + 84, + 455, + 300 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 173, + 84, + 455, + 300 + ], + "spans": [ + { + "bbox": [ + 173, + 84, + 455, + 300 + ], + "score": 0.975, + "type": "image", + "image_path": "12cec765ecdee0ae03b658c3f3798b3d511e16695116130fd85ecccd06d459c9.jpg" + } + ] + } + ], + "index": 8.5, + "virtual_lines": [ + { + "bbox": [ + 173, + 84, + 455, + 96.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 173, + 96.0, + 455, + 108.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 173, + 108.0, + 455, + 120.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 173, + 120.0, + 455, + 132.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 173, + 132.0, + 455, + 144.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 173, + 144.0, + 455, + 156.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 173, + 156.0, + 455, + 168.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 173, + 168.0, + 455, + 180.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 173, + 180.0, + 455, + 192.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 173, + 192.0, + 455, + 204.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 173, + 204.0, + 455, + 216.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 173, + 216.0, + 455, + 228.0 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 173, + 228.0, + 455, + 240.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 173, + 240.0, + 455, + 252.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 173, + 252.0, + 455, + 264.0 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 173, + 264.0, + 455, + 276.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 173, + 276.0, + 455, + 288.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 173, + 288.0, + 455, + 300.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 316, + 506, + 372 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 316, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 106, + 316, + 505, + 328 + ], + "score": 1.0, + "content": "Figure 8: The clustering performance with different pairwise density and number of clusters. A bright", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 107, + 328, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 107, + 328, + 505, + 338 + ], + "score": 1.0, + "content": "color means that the NMI score is close to 1 while black corresponds to 0. The density is defined", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 338, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 105, + 338, + 505, + 350 + ], + "score": 1.0, + "content": "as a ratio compared to the total number of pair-wise combinations in a mini-batch. The number of", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 349, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 106, + 349, + 505, + 361 + ], + "score": 1.0, + "content": "clusters defines the final softmax output dimensionality. In each sub-figure, we show how the scores", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 360, + 353, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 360, + 353, + 372 + ], + "score": 1.0, + "content": "change w.r.t. the similar pair recall and dissimiliar pair recall.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20 + } + ], + "index": 14.25 + }, + { + "type": "text", + "bbox": [ + 108, + 392, + 503, + 414 + ], + "lines": [ + { + "bbox": [ + 105, + 390, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 505, + 405 + ], + "score": 1.0, + "content": "affected by errors. In Figure 8, we could see when density decreases, the size of the bright region", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 402, + 191, + 416 + ], + "spans": [ + { + "bbox": [ + 106, + 402, + 191, + 416 + ], + "score": 1.0, + "content": "shrinks significantly.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 107, + 420, + 505, + 464 + ], + "lines": [ + { + "bbox": [ + 105, + 420, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 505, + 433 + ], + "score": 1.0, + "content": "In our implementation, enumerating the full pairwise relationships introduces negligible overhead", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 431, + 505, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 505, + 443 + ], + "score": 1.0, + "content": "in computation time using GPU. Although there is overhead for memory consumption, it is limited", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 441, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 505, + 455 + ], + "score": 1.0, + "content": "because only the vector of predicted distributions has to be enumerated for calculating the clustering", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 452, + 128, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 128, + 466 + ], + "score": 1.0, + "content": "loss.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 106, + 470, + 505, + 514 + ], + "lines": [ + { + "bbox": [ + 106, + 470, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 106, + 470, + 505, + 482 + ], + "score": 1.0, + "content": "The effect of varying the number of Clusters In the MNIST experiments, the number of categories", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 480, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 505, + 492 + ], + "score": 1.0, + "content": "is 10. We augment the softmax output number up to 100. The rows of figure 8 show that even when", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 490, + 507, + 506 + ], + "spans": [ + { + "bbox": [ + 104, + 490, + 507, + 506 + ], + "score": 1.0, + "content": "the number of output categories is significant larger than the number of true object categories, e.g.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 502, + 396, + 516 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 145, + 513 + ], + "score": 0.88, + "content": "1 0 0 > 1 0", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 502, + 396, + 516 + ], + "score": 1.0, + "content": ", the clustering performance NMI score only degrades slightly.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5 + } + ], + "page_idx": 19, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 15 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 173, + 84, + 455, + 300 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 173, + 84, + 455, + 300 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 173, + 84, + 455, + 300 + ], + "spans": [ + { + "bbox": [ + 173, + 84, + 455, + 300 + ], + "score": 0.975, + "type": "image", + "image_path": "12cec765ecdee0ae03b658c3f3798b3d511e16695116130fd85ecccd06d459c9.jpg" + } + ] + } + ], + "index": 8.5, + "virtual_lines": [ + { + "bbox": [ + 173, + 84, + 455, + 96.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 173, + 96.0, + 455, + 108.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 173, + 108.0, + 455, + 120.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 173, + 120.0, + 455, + 132.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 173, + 132.0, + 455, + 144.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 173, + 144.0, + 455, + 156.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 173, + 156.0, + 455, + 168.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 173, + 168.0, + 455, + 180.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 173, + 180.0, + 455, + 192.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 173, + 192.0, + 455, + 204.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 173, + 204.0, + 455, + 216.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 173, + 216.0, + 455, + 228.0 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 173, + 228.0, + 455, + 240.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 173, + 240.0, + 455, + 252.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 173, + 252.0, + 455, + 264.0 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 173, + 264.0, + 455, + 276.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 173, + 276.0, + 455, + 288.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 173, + 288.0, + 455, + 300.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 316, + 506, + 372 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 316, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 106, + 316, + 505, + 328 + ], + "score": 1.0, + "content": "Figure 8: The clustering performance with different pairwise density and number of clusters. A bright", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 107, + 328, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 107, + 328, + 505, + 338 + ], + "score": 1.0, + "content": "color means that the NMI score is close to 1 while black corresponds to 0. The density is defined", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 338, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 105, + 338, + 505, + 350 + ], + "score": 1.0, + "content": "as a ratio compared to the total number of pair-wise combinations in a mini-batch. The number of", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 349, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 106, + 349, + 505, + 361 + ], + "score": 1.0, + "content": "clusters defines the final softmax output dimensionality. In each sub-figure, we show how the scores", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 360, + 353, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 360, + 353, + 372 + ], + "score": 1.0, + "content": "change w.r.t. the similar pair recall and dissimiliar pair recall.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20 + } + ], + "index": 14.25 + }, + { + "type": "text", + "bbox": [ + 108, + 392, + 503, + 414 + ], + "lines": [], + "index": 23.5, + "bbox_fs": [ + 105, + 390, + 505, + 416 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 420, + 505, + 464 + ], + "lines": [ + { + "bbox": [ + 105, + 420, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 505, + 433 + ], + "score": 1.0, + "content": "In our implementation, enumerating the full pairwise relationships introduces negligible overhead", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 431, + 505, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 505, + 443 + ], + "score": 1.0, + "content": "in computation time using GPU. Although there is overhead for memory consumption, it is limited", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 441, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 505, + 455 + ], + "score": 1.0, + "content": "because only the vector of predicted distributions has to be enumerated for calculating the clustering", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 452, + 128, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 128, + 466 + ], + "score": 1.0, + "content": "loss.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 420, + 505, + 466 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 470, + 505, + 514 + ], + "lines": [ + { + "bbox": [ + 106, + 470, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 106, + 470, + 505, + 482 + ], + "score": 1.0, + "content": "The effect of varying the number of Clusters In the MNIST experiments, the number of categories", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 480, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 505, + 492 + ], + "score": 1.0, + "content": "is 10. We augment the softmax output number up to 100. The rows of figure 8 show that even when", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 490, + 507, + 506 + ], + "spans": [ + { + "bbox": [ + 104, + 490, + 507, + 506 + ], + "score": 1.0, + "content": "the number of output categories is significant larger than the number of true object categories, e.g.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 502, + 396, + 516 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 145, + 513 + ], + "score": 0.88, + "content": "1 0 0 > 1 0", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 502, + 396, + 516 + ], + "score": 1.0, + "content": ", the clustering performance NMI score only degrades slightly.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5, + "bbox_fs": [ + 104, + 470, + 507, + 516 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/ByRWCqvT-/ByRWCqvT-_model.json b/parse/train/ByRWCqvT-/ByRWCqvT-_model.json new file mode 100644 index 0000000000000000000000000000000000000000..83bf6f433b5a7de718ec239533ab106dd0f98ff4 --- /dev/null +++ b/parse/train/ByRWCqvT-/ByRWCqvT-_model.json @@ -0,0 +1,25472 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 397, + 648, + 1303, + 648, + 1303, + 1377, + 397, + 1377 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1499, + 1404, + 1499, + 1404, + 1834, + 298, + 1834 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1850, + 1403, + 1850, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.978 + }, + { + "category_id": 0, + "poly": [ + 298, + 224, + 1395, + 224, + 1395, + 323, + 298, + 323 + ], + "score": 0.959 + }, + { + "category_id": 1, + "poly": [ + 315, + 375, + 948, + 375, + 948, + 500, + 315, + 500 + ], + "score": 0.932 + }, + { + "category_id": 0, + "poly": [ + 301, + 1430, + 573, + 1430, + 573, + 1465, + 301, + 1465 + ], + "score": 0.893 + }, + { + "category_id": 1, + "poly": [ + 1001, + 376, + 1362, + 376, + 1362, + 499, + 1001, + 499 + ], + "score": 0.878 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 815, + 75, + 815, + 104, + 299, + 104 + ], + "score": 0.874 + }, + { + "category_id": 0, + "poly": [ + 773, + 580, + 926, + 580, + 926, + 612, + 773, + 612 + ], + "score": 0.872 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 856, + 2088, + 856, + 2112, + 841, + 2112 + ], + "score": 0.725 + }, + { + "category_id": 0, + "poly": [ + 1002, + 377, + 1128, + 377, + 1128, + 406, + 1002, + 406 + ], + "score": 0.169 + }, + { + "category_id": 15, + "poly": [ + 294.0, + 221.0, + 1401.0, + 221.0, + 1401.0, + 271.0, + 294.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 283.0, + 911.0, + 283.0, + 911.0, + 326.0, + 295.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1427.0, + 578.0, + 1427.0, + 578.0, + 1474.0, + 294.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 817.0, + 72.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 578.0, + 932.0, + 578.0, + 932.0, + 616.0, + 769.0, + 616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2088.0, + 857.0, + 2088.0, + 857.0, + 2116.0, + 840.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 999.0, + 374.0, + 1133.0, + 374.0, + 1133.0, + 411.0, + 999.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 646.0, + 1304.0, + 646.0, + 1304.0, + 680.0, + 395.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 677.0, + 1306.0, + 677.0, + 1306.0, + 712.0, + 395.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 707.0, + 1307.0, + 707.0, + 1307.0, + 739.0, + 393.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 738.0, + 1305.0, + 738.0, + 1305.0, + 773.0, + 394.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 768.0, + 1306.0, + 768.0, + 1306.0, + 803.0, + 395.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 800.0, + 1305.0, + 800.0, + 1305.0, + 832.0, + 394.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 827.0, + 1305.0, + 827.0, + 1305.0, + 864.0, + 392.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 859.0, + 1306.0, + 859.0, + 1306.0, + 893.0, + 392.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 892.0, + 1305.0, + 892.0, + 1305.0, + 921.0, + 395.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 920.0, + 1307.0, + 920.0, + 1307.0, + 954.0, + 393.0, + 954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 951.0, + 1307.0, + 951.0, + 1307.0, + 983.0, + 394.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 980.0, + 1306.0, + 980.0, + 1306.0, + 1016.0, + 393.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1012.0, + 1307.0, + 1012.0, + 1307.0, + 1047.0, + 392.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1043.0, + 1305.0, + 1043.0, + 1305.0, + 1075.0, + 393.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1073.0, + 1307.0, + 1073.0, + 1307.0, + 1108.0, + 394.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1103.0, + 1306.0, + 1103.0, + 1306.0, + 1138.0, + 394.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1135.0, + 1305.0, + 1135.0, + 1305.0, + 1164.0, + 395.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1165.0, + 1307.0, + 1165.0, + 1307.0, + 1196.0, + 393.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1194.0, + 1306.0, + 1194.0, + 1306.0, + 1229.0, + 393.0, + 1229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1226.0, + 1304.0, + 1226.0, + 1304.0, + 1258.0, + 394.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1253.0, + 1306.0, + 1253.0, + 1306.0, + 1291.0, + 392.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1284.0, + 1304.0, + 1284.0, + 1304.0, + 1319.0, + 393.0, + 1319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1314.0, + 1305.0, + 1314.0, + 1305.0, + 1351.0, + 393.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1345.0, + 1182.0, + 1345.0, + 1182.0, + 1379.0, + 395.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1500.0, + 1405.0, + 1500.0, + 1405.0, + 1534.0, + 296.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1528.0, + 1402.0, + 1528.0, + 1402.0, + 1563.0, + 296.0, + 1563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1560.0, + 1405.0, + 1560.0, + 1405.0, + 1595.0, + 294.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1589.0, + 1404.0, + 1589.0, + 1404.0, + 1626.0, + 293.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1617.0, + 1406.0, + 1617.0, + 1406.0, + 1657.0, + 293.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1650.0, + 1406.0, + 1650.0, + 1406.0, + 1686.0, + 293.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1679.0, + 1406.0, + 1679.0, + 1406.0, + 1717.0, + 293.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1712.0, + 1408.0, + 1712.0, + 1408.0, + 1747.0, + 293.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1741.0, + 1406.0, + 1741.0, + 1406.0, + 1778.0, + 293.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1774.0, + 1405.0, + 1774.0, + 1405.0, + 1809.0, + 294.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1805.0, + 557.0, + 1805.0, + 557.0, + 1836.0, + 296.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1849.0, + 1405.0, + 1849.0, + 1405.0, + 1885.0, + 294.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1882.0, + 1404.0, + 1882.0, + 1404.0, + 1914.0, + 296.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1912.0, + 1404.0, + 1912.0, + 1404.0, + 1947.0, + 294.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1942.0, + 1407.0, + 1942.0, + 1407.0, + 1977.0, + 292.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1971.0, + 1405.0, + 1971.0, + 1405.0, + 2008.0, + 292.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2000.0, + 1405.0, + 2000.0, + 1405.0, + 2038.0, + 293.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 374.0, + 677.0, + 374.0, + 677.0, + 411.0, + 312.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 401.0, + 674.0, + 401.0, + 674.0, + 445.0, + 310.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 437.0, + 602.0, + 437.0, + 602.0, + 469.0, + 313.0, + 469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 468.0, + 950.0, + 468.0, + 950.0, + 502.0, + 315.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 372.0, + 1133.0, + 372.0, + 1133.0, + 410.0, + 997.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 999.0, + 406.0, + 1362.0, + 406.0, + 1362.0, + 438.0, + 999.0, + 438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1000.0, + 437.0, + 1289.0, + 437.0, + 1289.0, + 468.0, + 1000.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1001.0, + 467.0, + 1273.0, + 467.0, + 1273.0, + 499.0, + 1001.0, + 499.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1668, + 1405, + 1668, + 1405, + 2034, + 298, + 2034 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 537, + 1404, + 537, + 1404, + 843, + 298, + 843 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 308, + 1402, + 308, + 1402, + 521, + 298, + 521 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 977, + 1404, + 977, + 1404, + 1193, + 298, + 1193 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1207, + 1404, + 1207, + 1404, + 1424, + 298, + 1424 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1438, + 1404, + 1438, + 1404, + 1652, + 298, + 1652 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 296, + 229, + 1400, + 229, + 1400, + 292, + 296, + 292 + ], + "score": 0.951 + }, + { + "category_id": 0, + "poly": [ + 301, + 900, + 587, + 900, + 587, + 936, + 301, + 936 + ], + "score": 0.902 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.897 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2112, + 841, + 2112 + ], + "score": 0.693 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.222 + }, + { + "category_id": 15, + "poly": [ + 291.0, + 897.0, + 594.0, + 897.0, + 594.0, + 944.0, + 291.0, + 944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2121.0, + 839.0, + 2121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2120.0, + 838.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1669.0, + 1405.0, + 1669.0, + 1405.0, + 1703.0, + 297.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1699.0, + 1406.0, + 1699.0, + 1406.0, + 1732.0, + 293.0, + 1732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1728.0, + 1407.0, + 1728.0, + 1407.0, + 1762.0, + 295.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1755.0, + 1406.0, + 1755.0, + 1406.0, + 1798.0, + 292.0, + 1798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1790.0, + 1406.0, + 1790.0, + 1406.0, + 1824.0, + 295.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1822.0, + 1407.0, + 1822.0, + 1407.0, + 1856.0, + 293.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1851.0, + 1407.0, + 1851.0, + 1407.0, + 1885.0, + 293.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1880.0, + 1409.0, + 1880.0, + 1409.0, + 1917.0, + 293.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1904.0, + 1407.0, + 1904.0, + 1407.0, + 1952.0, + 291.0, + 1952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1943.0, + 1408.0, + 1943.0, + 1408.0, + 1977.0, + 295.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1971.0, + 1405.0, + 1971.0, + 1405.0, + 2008.0, + 293.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2001.0, + 1403.0, + 2001.0, + 1403.0, + 2038.0, + 293.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 535.0, + 1405.0, + 535.0, + 1405.0, + 573.0, + 293.0, + 573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 567.0, + 1405.0, + 567.0, + 1405.0, + 604.0, + 293.0, + 604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 597.0, + 1406.0, + 597.0, + 1406.0, + 634.0, + 293.0, + 634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 632.0, + 1405.0, + 632.0, + 1405.0, + 663.0, + 296.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 661.0, + 1405.0, + 661.0, + 1405.0, + 693.0, + 294.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 691.0, + 1405.0, + 691.0, + 1405.0, + 723.0, + 296.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 722.0, + 1404.0, + 722.0, + 1404.0, + 753.0, + 296.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 751.0, + 1405.0, + 751.0, + 1405.0, + 785.0, + 293.0, + 785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 780.0, + 1404.0, + 780.0, + 1404.0, + 817.0, + 293.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 812.0, + 898.0, + 812.0, + 898.0, + 846.0, + 295.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 308.0, + 1406.0, + 308.0, + 1406.0, + 342.0, + 294.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 340.0, + 1406.0, + 340.0, + 1406.0, + 374.0, + 294.0, + 374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 367.0, + 1406.0, + 367.0, + 1406.0, + 406.0, + 292.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 401.0, + 1404.0, + 401.0, + 1404.0, + 435.0, + 294.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 430.0, + 1406.0, + 430.0, + 1406.0, + 465.0, + 294.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 461.0, + 1404.0, + 461.0, + 1404.0, + 495.0, + 294.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 489.0, + 494.0, + 489.0, + 494.0, + 527.0, + 295.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 975.0, + 1406.0, + 975.0, + 1406.0, + 1016.0, + 293.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1010.0, + 1404.0, + 1010.0, + 1404.0, + 1043.0, + 292.0, + 1043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1041.0, + 1402.0, + 1041.0, + 1402.0, + 1075.0, + 294.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1073.0, + 1405.0, + 1073.0, + 1405.0, + 1104.0, + 296.0, + 1104.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1097.0, + 1405.0, + 1097.0, + 1405.0, + 1137.0, + 293.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1128.0, + 1405.0, + 1128.0, + 1405.0, + 1169.0, + 292.0, + 1169.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1161.0, + 757.0, + 1161.0, + 757.0, + 1199.0, + 293.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1210.0, + 1406.0, + 1210.0, + 1406.0, + 1241.0, + 298.0, + 1241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1240.0, + 1405.0, + 1240.0, + 1405.0, + 1275.0, + 296.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1270.0, + 1404.0, + 1270.0, + 1404.0, + 1304.0, + 294.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1294.0, + 1405.0, + 1294.0, + 1405.0, + 1339.0, + 292.0, + 1339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1330.0, + 1405.0, + 1330.0, + 1405.0, + 1365.0, + 294.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1356.0, + 1405.0, + 1356.0, + 1405.0, + 1400.0, + 292.0, + 1400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1389.0, + 1159.0, + 1389.0, + 1159.0, + 1429.0, + 292.0, + 1429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1438.0, + 1404.0, + 1438.0, + 1404.0, + 1473.0, + 297.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1464.0, + 1406.0, + 1464.0, + 1406.0, + 1507.0, + 292.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1500.0, + 1408.0, + 1500.0, + 1408.0, + 1534.0, + 294.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1530.0, + 1408.0, + 1530.0, + 1408.0, + 1565.0, + 294.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1561.0, + 1406.0, + 1561.0, + 1406.0, + 1595.0, + 294.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1588.0, + 1404.0, + 1588.0, + 1404.0, + 1627.0, + 293.0, + 1627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1620.0, + 733.0, + 1620.0, + 733.0, + 1657.0, + 293.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 226.0, + 1405.0, + 226.0, + 1405.0, + 267.0, + 292.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 262.0, + 768.0, + 262.0, + 768.0, + 294.0, + 296.0, + 294.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1064, + 1405, + 1064, + 1405, + 1343, + 298, + 1343 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1356, + 1404, + 1356, + 1404, + 1601, + 297, + 1601 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1617, + 1405, + 1617, + 1405, + 1801, + 298, + 1801 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 1815, + 1405, + 1815, + 1405, + 2035, + 297, + 2035 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 784, + 1404, + 784, + 1404, + 940, + 298, + 940 + ], + "score": 0.976 + }, + { + "category_id": 3, + "poly": [ + 408, + 238, + 1247, + 238, + 1247, + 571, + 408, + 571 + ], + "score": 0.972 + }, + { + "category_id": 4, + "poly": [ + 296, + 602, + 1407, + 602, + 1407, + 725, + 296, + 725 + ], + "score": 0.963 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 814, + 76, + 814, + 104, + 299, + 104 + ], + "score": 0.886 + }, + { + "category_id": 0, + "poly": [ + 301, + 991, + 823, + 991, + 823, + 1026, + 301, + 1026 + ], + "score": 0.864 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.629 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.356 + }, + { + "category_id": 13, + "poly": [ + 783, + 1218, + 943, + 1218, + 943, + 1252, + 783, + 1252 + ], + "score": 0.94, + "latex": "\\{ Y _ { T } \\} = \\{ Y _ { S } \\}" + }, + { + "category_id": 13, + "poly": [ + 1076, + 1097, + 1242, + 1097, + 1242, + 1131, + 1076, + 1131 + ], + "score": 0.93, + "latex": "\\boldsymbol { S } = ( X _ { S } , Y _ { S } )" + }, + { + "category_id": 13, + "poly": [ + 1146, + 1387, + 1322, + 1387, + 1322, + 1420, + 1146, + 1420 + ], + "score": 0.93, + "latex": "S ^ { \\prime } = ( X _ { S } ^ { \\prime } , Y _ { S } ^ { \\prime } )" + }, + { + "category_id": 13, + "poly": [ + 501, + 1188, + 660, + 1188, + 660, + 1222, + 501, + 1222 + ], + "score": 0.93, + "latex": "\\{ Y _ { T } \\} \\ne \\{ { \\bar { Y } } _ { S } \\}" + }, + { + "category_id": 13, + "poly": [ + 921, + 1847, + 1082, + 1847, + 1082, + 1881, + 921, + 1881 + ], + "score": 0.93, + "latex": "\\{ Y _ { A } \\} \\ne \\{ Y _ { T } \\}" + }, + { + "category_id": 13, + "poly": [ + 1208, + 2002, + 1398, + 2002, + 1398, + 2038, + 1208, + 2038 + ], + "score": 0.93, + "latex": "G ( x _ { i } , x _ { j } ) = \\mathbf { \\bar { \\Gamma } } y _ { i , j }" + }, + { + "category_id": 13, + "poly": [ + 1129, + 1249, + 1338, + 1249, + 1338, + 1283, + 1129, + 1283 + ], + "score": 0.93, + "latex": "P ( X _ { T } ) \\neq P ( X _ { S } )" + }, + { + "category_id": 13, + "poly": [ + 297, + 1158, + 468, + 1158, + 468, + 1192, + 297, + 1192 + ], + "score": 0.92, + "latex": "T = \\left( X _ { T } , Y _ { T } \\right)" + }, + { + "category_id": 13, + "poly": [ + 841, + 1907, + 1061, + 1907, + 1061, + 1942, + 841, + 1942 + ], + "score": 0.92, + "latex": "R ( A ) = ( X _ { A } ^ { R ^ { \\prime } } , \\bar { Y } ^ { R } )" + }, + { + "category_id": 13, + "poly": [ + 1118, + 1906, + 1400, + 1906, + 1400, + 1943, + 1118, + 1943 + ], + "score": 0.92, + "latex": "\\dot { X } _ { A } ^ { R } = \\{ ( x _ { A , i } , x _ { A , j } ) \\} _ { \\forall i , j }" + }, + { + "category_id": 13, + "poly": [ + 1160, + 1420, + 1331, + 1420, + 1331, + 1451, + 1160, + 1451 + ], + "score": 0.92, + "latex": "A = ( X _ { A } , Y _ { A } )" + }, + { + "category_id": 13, + "poly": [ + 983, + 1418, + 1145, + 1418, + 1145, + 1452, + 983, + 1452 + ], + "score": 0.91, + "latex": "\\{ Y _ { S } ^ { \\prime } \\} = \\{ Y _ { T } \\}" + }, + { + "category_id": 13, + "poly": [ + 982, + 1387, + 1128, + 1387, + 1128, + 1416, + 982, + 1416 + ], + "score": 0.89, + "latex": "S = { \\bar { S } } ^ { \\prime } \\cup A" + }, + { + "category_id": 13, + "poly": [ + 1137, + 1848, + 1173, + 1848, + 1173, + 1878, + 1137, + 1878 + ], + "score": 0.89, + "latex": "Y _ { T }" + }, + { + "category_id": 13, + "poly": [ + 629, + 1128, + 664, + 1128, + 664, + 1158, + 629, + 1158 + ], + "score": 0.88, + "latex": "Y _ { S }" + }, + { + "category_id": 13, + "poly": [ + 1332, + 1098, + 1374, + 1098, + 1374, + 1128, + 1332, + 1128 + ], + "score": 0.88, + "latex": "X _ { S }" + }, + { + "category_id": 13, + "poly": [ + 888, + 1160, + 925, + 1160, + 925, + 1189, + 888, + 1189 + ], + "score": 0.88, + "latex": "Y _ { T }" + }, + { + "category_id": 13, + "poly": [ + 747, + 1480, + 783, + 1480, + 783, + 1510, + 747, + 1510 + ], + "score": 0.88, + "latex": "Y _ { T }" + }, + { + "category_id": 13, + "poly": [ + 1337, + 1481, + 1361, + 1481, + 1361, + 1507, + 1337, + 1507 + ], + "score": 0.81, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 708, + 1911, + 731, + 1911, + 731, + 1936, + 708, + 1936 + ], + "score": 0.81, + "latex": "R" + }, + { + "category_id": 13, + "poly": [ + 649, + 1941, + 1017, + 1941, + 1017, + 1976, + 649, + 1976 + ], + "score": 0.79, + "latex": "\\{ Y ^ { R } \\} = \\{ d i s s i m i l a r , s i m i l a r \\}" + }, + { + "category_id": 13, + "poly": [ + 955, + 1511, + 979, + 1511, + 979, + 1537, + 955, + 1537 + ], + "score": 0.78, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1152, + 1481, + 1176, + 1481, + 1176, + 1507, + 1152, + 1507 + ], + "score": 0.77, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 819, + 1818, + 843, + 1818, + 843, + 1844, + 819, + 1844 + ], + "score": 0.76, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 1228, + 1817, + 1265, + 1817, + 1265, + 1847, + 1228, + 1847 + ], + "score": 0.74, + "latex": "Y _ { T }" + }, + { + "category_id": 13, + "poly": [ + 867, + 1510, + 896, + 1510, + 896, + 1538, + 867, + 1538 + ], + "score": 0.7, + "latex": "S ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 1193, + 1818, + 1216, + 1818, + 1216, + 1845, + 1193, + 1845 + ], + "score": 0.57, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 832, + 1511, + 855, + 1511, + 855, + 1538, + 832, + 1538 + ], + "score": 0.5, + "latex": "A" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 233.0, + 728.0, + 233.0, + 728.0, + 266.0, + 664.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 441.0, + 271.0, + 556.0, + 271.0, + 556.0, + 305.0, + 441.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 645.0, + 269.0, + 772.0, + 269.0, + 772.0, + 305.0, + 645.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 273.0, + 943.0, + 273.0, + 943.0, + 304.0, + 828.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1130.0, + 279.0, + 1208.0, + 279.0, + 1208.0, + 312.0, + 1130.0, + 312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 295.0, + 564.0, + 295.0, + 564.0, + 323.0, + 435.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 651.0, + 294.0, + 766.0, + 294.0, + 766.0, + 325.0, + 651.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 295.0, + 944.0, + 295.0, + 944.0, + 323.0, + 828.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 321.0, + 487.0, + 321.0, + 487.0, + 349.0, + 454.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 668.0, + 330.0, + 694.0, + 330.0, + 694.0, + 347.0, + 668.0, + 347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 751.0, + 319.0, + 782.0, + 319.0, + 782.0, + 346.0, + 751.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 316.0, + 952.0, + 316.0, + 952.0, + 359.0, + 881.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1123.0, + 316.0, + 1220.0, + 316.0, + 1220.0, + 347.0, + 1123.0, + 347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 349.0, + 754.0, + 349.0, + 754.0, + 361.0, + 739.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 339.0, + 1228.0, + 339.0, + 1228.0, + 371.0, + 1116.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 698.0, + 421.0, + 896.0, + 421.0, + 896.0, + 448.0, + 698.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 387.0, + 1159.0, + 387.0, + 1159.0, + 450.0, + 1115.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1162.0, + 366.0, + 1234.0, + 366.0, + 1234.0, + 457.0, + 1162.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1189.0, + 438.0, + 1227.0, + 438.0, + 1227.0, + 474.0, + 1189.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 457.0, + 721.0, + 457.0, + 721.0, + 484.0, + 697.0, + 484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 455.0, + 983.0, + 455.0, + 983.0, + 491.0, + 891.0, + 491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.0, + 527.0, + 597.0, + 527.0, + 597.0, + 558.0, + 431.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 491.0, + 760.0, + 491.0, + 760.0, + 564.0, + 658.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 500.0, + 948.0, + 500.0, + 948.0, + 554.0, + 819.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 497.0, + 1246.0, + 497.0, + 1246.0, + 550.0, + 1094.0, + 550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 444.0, + 341.5, + 462.0, + 341.5, + 462.0, + 370.0, + 444.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 320.0, + 674.0, + 320.0, + 674.0, + 345.0, + 646.0, + 345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 343.0, + 956.0, + 343.0, + 956.0, + 398.0, + 877.0, + 398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 603.0, + 1405.0, + 603.0, + 1405.0, + 636.0, + 295.0, + 636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 632.0, + 1410.0, + 632.0, + 1410.0, + 667.0, + 293.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 662.0, + 1408.0, + 662.0, + 1408.0, + 700.0, + 291.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 694.0, + 554.0, + 694.0, + 554.0, + 726.0, + 295.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 818.0, + 73.0, + 818.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 988.0, + 829.0, + 988.0, + 829.0, + 1032.0, + 292.0, + 1032.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 860.0, + 2085.0, + 860.0, + 2116.0, + 839.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1065.0, + 1405.0, + 1065.0, + 1405.0, + 1102.0, + 295.0, + 1102.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1098.0, + 1075.0, + 1098.0, + 1075.0, + 1131.0, + 295.0, + 1131.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1243.0, + 1098.0, + 1331.0, + 1098.0, + 1331.0, + 1131.0, + 1243.0, + 1131.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1375.0, + 1098.0, + 1405.0, + 1098.0, + 1405.0, + 1131.0, + 1375.0, + 1131.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1127.0, + 628.0, + 1127.0, + 628.0, + 1164.0, + 293.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 665.0, + 1127.0, + 1406.0, + 1127.0, + 1406.0, + 1164.0, + 665.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1157.0, + 296.0, + 1157.0, + 296.0, + 1194.0, + 293.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1157.0, + 887.0, + 1157.0, + 887.0, + 1194.0, + 469.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 1157.0, + 1403.0, + 1157.0, + 1403.0, + 1194.0, + 926.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1188.0, + 500.0, + 1188.0, + 500.0, + 1225.0, + 295.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 1188.0, + 1406.0, + 1188.0, + 1406.0, + 1225.0, + 661.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1214.0, + 782.0, + 1214.0, + 782.0, + 1256.0, + 293.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 944.0, + 1214.0, + 1407.0, + 1214.0, + 1407.0, + 1256.0, + 944.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1247.0, + 1128.0, + 1247.0, + 1128.0, + 1284.0, + 295.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1339.0, + 1247.0, + 1403.0, + 1247.0, + 1403.0, + 1284.0, + 1339.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1279.0, + 1405.0, + 1279.0, + 1405.0, + 1315.0, + 293.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1309.0, + 1305.0, + 1309.0, + 1305.0, + 1348.0, + 293.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1355.0, + 1404.0, + 1355.0, + 1404.0, + 1391.0, + 294.0, + 1391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1384.0, + 981.0, + 1384.0, + 981.0, + 1425.0, + 292.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1384.0, + 1145.0, + 1384.0, + 1145.0, + 1425.0, + 1129.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1323.0, + 1384.0, + 1407.0, + 1384.0, + 1407.0, + 1425.0, + 1323.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1417.0, + 982.0, + 1417.0, + 982.0, + 1455.0, + 292.0, + 1455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1146.0, + 1417.0, + 1159.0, + 1417.0, + 1159.0, + 1455.0, + 1146.0, + 1455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1332.0, + 1417.0, + 1405.0, + 1417.0, + 1405.0, + 1455.0, + 1332.0, + 1455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1449.0, + 1405.0, + 1449.0, + 1405.0, + 1482.0, + 295.0, + 1482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1477.0, + 746.0, + 1477.0, + 746.0, + 1514.0, + 294.0, + 1514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 1477.0, + 1151.0, + 1477.0, + 1151.0, + 1514.0, + 784.0, + 1514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1177.0, + 1477.0, + 1336.0, + 1477.0, + 1336.0, + 1514.0, + 1177.0, + 1514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1362.0, + 1477.0, + 1404.0, + 1477.0, + 1404.0, + 1514.0, + 1362.0, + 1514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1510.0, + 831.0, + 1510.0, + 831.0, + 1543.0, + 295.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 856.0, + 1510.0, + 866.0, + 1510.0, + 866.0, + 1543.0, + 856.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 897.0, + 1510.0, + 954.0, + 1510.0, + 954.0, + 1543.0, + 897.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 1510.0, + 1404.0, + 1510.0, + 1404.0, + 1543.0, + 980.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1536.0, + 1408.0, + 1536.0, + 1408.0, + 1576.0, + 292.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1572.0, + 638.0, + 1572.0, + 638.0, + 1603.0, + 295.0, + 1603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1615.0, + 1405.0, + 1615.0, + 1405.0, + 1652.0, + 295.0, + 1652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1647.0, + 1406.0, + 1647.0, + 1406.0, + 1682.0, + 295.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1676.0, + 1408.0, + 1676.0, + 1408.0, + 1713.0, + 292.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1708.0, + 1405.0, + 1708.0, + 1405.0, + 1743.0, + 295.0, + 1743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1737.0, + 1410.0, + 1737.0, + 1410.0, + 1776.0, + 293.0, + 1776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1769.0, + 643.0, + 1769.0, + 643.0, + 1804.0, + 295.0, + 1804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1812.0, + 818.0, + 1812.0, + 818.0, + 1851.0, + 292.0, + 1851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 844.0, + 1812.0, + 1192.0, + 1812.0, + 1192.0, + 1851.0, + 844.0, + 1851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1812.0, + 1227.0, + 1812.0, + 1227.0, + 1851.0, + 1217.0, + 1851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1266.0, + 1812.0, + 1405.0, + 1812.0, + 1405.0, + 1851.0, + 1266.0, + 1851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1845.0, + 920.0, + 1845.0, + 920.0, + 1883.0, + 294.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 1845.0, + 1136.0, + 1845.0, + 1136.0, + 1883.0, + 1083.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.0, + 1845.0, + 1406.0, + 1845.0, + 1406.0, + 1883.0, + 1174.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1877.0, + 1406.0, + 1877.0, + 1406.0, + 1913.0, + 295.0, + 1913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1900.0, + 707.0, + 1900.0, + 707.0, + 1950.0, + 290.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 732.0, + 1900.0, + 840.0, + 1900.0, + 840.0, + 1950.0, + 732.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 1900.0, + 1117.0, + 1900.0, + 1117.0, + 1950.0, + 1062.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1900.0, + 1407.0, + 1900.0, + 1407.0, + 1950.0, + 1401.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1939.0, + 648.0, + 1939.0, + 648.0, + 1977.0, + 294.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1018.0, + 1939.0, + 1407.0, + 1939.0, + 1407.0, + 1977.0, + 1018.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1970.0, + 1408.0, + 1970.0, + 1408.0, + 2009.0, + 294.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1997.0, + 1207.0, + 1997.0, + 1207.0, + 2043.0, + 292.0, + 2043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 1997.0, + 1411.0, + 1997.0, + 1411.0, + 2043.0, + 1399.0, + 2043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 786.0, + 1404.0, + 786.0, + 1404.0, + 819.0, + 296.0, + 819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 817.0, + 1406.0, + 817.0, + 1406.0, + 850.0, + 294.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 846.0, + 1404.0, + 846.0, + 1404.0, + 883.0, + 293.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 873.0, + 1406.0, + 873.0, + 1406.0, + 914.0, + 293.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 905.0, + 924.0, + 905.0, + 924.0, + 946.0, + 293.0, + 946.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1468, + 1405, + 1468, + 1405, + 1714, + 297, + 1714 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1299, + 1405, + 1299, + 1405, + 1455, + 298, + 1455 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 1729, + 1404, + 1729, + 1404, + 1853, + 299, + 1853 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1030, + 1405, + 1030, + 1405, + 1185, + 298, + 1185 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 887, + 1404, + 887, + 1404, + 1016, + 298, + 1016 + ], + "score": 0.974 + }, + { + "category_id": 4, + "poly": [ + 295, + 676, + 1404, + 676, + 1404, + 832, + 295, + 832 + ], + "score": 0.961 + }, + { + "category_id": 3, + "poly": [ + 500, + 224, + 1183, + 224, + 1183, + 646, + 500, + 646 + ], + "score": 0.961 + }, + { + "category_id": 8, + "poly": [ + 673, + 1956, + 1028, + 1956, + 1028, + 2042, + 673, + 2042 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 598, + 1871, + 1101, + 1871, + 1101, + 1911, + 598, + 1911 + ], + "score": 0.935 + }, + { + "category_id": 0, + "poly": [ + 298, + 1231, + 1053, + 1231, + 1053, + 1266, + 298, + 1266 + ], + "score": 0.909 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 814, + 76, + 814, + 104, + 299, + 104 + ], + "score": 0.884 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1877, + 1400, + 1877, + 1400, + 1906, + 1366, + 1906 + ], + "score": 0.872 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1983, + 1400, + 1983, + 1400, + 2012, + 1366, + 2012 + ], + "score": 0.869 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 857, + 2089, + 857, + 2111, + 840, + 2111 + ], + "score": 0.797 + }, + { + "category_id": 14, + "poly": [ + 672, + 1950, + 1028, + 1950, + 1028, + 2043, + 672, + 2043 + ], + "score": 0.95, + "latex": "\\mathcal { D } _ { K L } ( \\mathcal { P } ^ { \\star } | | \\mathcal { Q } ) = \\sum _ { c = 1 } ^ { k } p _ { c } l o g ( \\frac { p _ { c } } { q _ { c } } )" + }, + { + "category_id": 14, + "poly": [ + 595, + 1871, + 1105, + 1871, + 1105, + 1911, + 595, + 1911 + ], + "score": 0.93, + "latex": "\\mathcal { L } ( \\boldsymbol { x } _ { p } , \\boldsymbol { x } _ { q } ) ^ { + } = \\mathcal { D } _ { K L } ( \\mathcal { P } ^ { \\star } | | \\boldsymbol { \\mathcal { Q } } ) + \\mathcal { D } _ { K L } ( \\mathcal { Q } ^ { \\star } | | \\mathcal { P } )" + }, + { + "category_id": 13, + "poly": [ + 1225, + 1790, + 1353, + 1790, + 1353, + 1825, + 1225, + 1825 + ], + "score": 0.93, + "latex": "\\mathcal { P } = f ( x _ { p } )" + }, + { + "category_id": 13, + "poly": [ + 299, + 1821, + 425, + 1821, + 425, + 1856, + 299, + 1856 + ], + "score": 0.93, + "latex": "\\mathcal { Q } = f ( x _ { q } )" + }, + { + "category_id": 13, + "poly": [ + 731, + 889, + 994, + 889, + 994, + 924, + 731, + 924 + ], + "score": 0.93, + "latex": "G ( x _ { T , i } , x _ { T , j } ) = y _ { T , i , j }" + }, + { + "category_id": 13, + "poly": [ + 298, + 921, + 505, + 921, + 505, + 957, + 298, + 957 + ], + "score": 0.91, + "latex": "Y _ { T } ^ { R } = \\{ y _ { T , i , j } \\} _ { \\forall i , j }" + }, + { + "category_id": 13, + "poly": [ + 526, + 1794, + 598, + 1794, + 598, + 1824, + 526, + 1824 + ], + "score": 0.89, + "latex": "x _ { p } , x _ { q }" + }, + { + "category_id": 13, + "poly": [ + 1299, + 890, + 1336, + 890, + 1336, + 921, + 1299, + 921 + ], + "score": 0.88, + "latex": "Y _ { T }" + }, + { + "category_id": 13, + "poly": [ + 704, + 1092, + 732, + 1092, + 732, + 1120, + 704, + 1120 + ], + "score": 0.87, + "latex": "S ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 369, + 957, + 405, + 957, + 405, + 985, + 369, + 985 + ], + "score": 0.86, + "latex": "Y _ { T }" + }, + { + "category_id": 13, + "poly": [ + 505, + 1824, + 525, + 1824, + 525, + 1854, + 505, + 1854 + ], + "score": 0.86, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 298, + 1154, + 326, + 1154, + 326, + 1181, + 298, + 1181 + ], + "score": 0.86, + "latex": "S ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 1351, + 1094, + 1375, + 1094, + 1375, + 1120, + 1351, + 1120 + ], + "score": 0.84, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1213, + 1124, + 1236, + 1124, + 1236, + 1150, + 1213, + 1150 + ], + "score": 0.81, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 385, + 1155, + 408, + 1155, + 408, + 1181, + 385, + 1181 + ], + "score": 0.81, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 449, + 891, + 475, + 891, + 475, + 918, + 449, + 918 + ], + "score": 0.81, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 1374, + 1125, + 1396, + 1125, + 1396, + 1150, + 1374, + 1150 + ], + "score": 0.81, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 1177, + 1731, + 1196, + 1731, + 1196, + 1757, + 1177, + 1757 + ], + "score": 0.8, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 483, + 1093, + 507, + 1093, + 507, + 1120, + 483, + 1120 + ], + "score": 0.77, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 1104, + 770, + 1130, + 770, + 1130, + 798, + 1104, + 798 + ], + "score": 0.76, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 520, + 891, + 542, + 891, + 542, + 917, + 520, + 917 + ], + "score": 0.75, + "latex": "T" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 678.0, + 1402.0, + 678.0, + 1402.0, + 711.0, + 295.0, + 711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 705.0, + 1406.0, + 705.0, + 1406.0, + 745.0, + 293.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 739.0, + 1405.0, + 739.0, + 1405.0, + 773.0, + 295.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 767.0, + 1103.0, + 767.0, + 1103.0, + 805.0, + 295.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 767.0, + 1406.0, + 767.0, + 1406.0, + 805.0, + 1131.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 799.0, + 1261.0, + 799.0, + 1261.0, + 835.0, + 293.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 533.0, + 236.0, + 671.0, + 236.0, + 671.0, + 283.0, + 533.0, + 283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 731.0, + 225.0, + 919.0, + 225.0, + 919.0, + 259.0, + 731.0, + 259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 972.0, + 238.0, + 1130.0, + 238.0, + 1130.0, + 280.0, + 972.0, + 280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 745.0, + 318.0, + 885.0, + 318.0, + 885.0, + 345.0, + 745.0, + 345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 745.0, + 341.0, + 861.0, + 341.0, + 861.0, + 364.0, + 745.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 404.0, + 653.0, + 404.0, + 653.0, + 438.0, + 529.0, + 438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 996.0, + 405.0, + 1102.0, + 405.0, + 1102.0, + 436.0, + 996.0, + 436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 612.0, + 448.0, + 663.0, + 448.0, + 663.0, + 477.0, + 612.0, + 477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 446.0, + 1129.0, + 446.0, + 1129.0, + 477.0, + 1062.0, + 477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 471.0, + 739.0, + 471.0, + 739.0, + 497.0, + 615.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 469.0, + 1187.0, + 469.0, + 1187.0, + 498.0, + 1062.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 642.0, + 499.0, + 712.0, + 499.0, + 712.0, + 540.0, + 642.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1019.0, + 512.0, + 1047.0, + 512.0, + 1047.0, + 544.0, + 1019.0, + 544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 497.0, + 1163.0, + 497.0, + 1163.0, + 537.0, + 1094.0, + 537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 741.0, + 535.0, + 883.0, + 535.0, + 883.0, + 564.0, + 741.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 518.0, + 568.0, + 549.0, + 568.0, + 549.0, + 597.0, + 518.0, + 597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 559.0, + 833.0, + 559.0, + 833.0, + 583.0, + 743.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 584.0, + 1022.0, + 584.0, + 1022.0, + 589.0, + 1017.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 587.0, + 572.0, + 587.0, + 572.0, + 617.0, + 529.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 617.0, + 700.0, + 617.0, + 700.0, + 646.0, + 499.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 615.0, + 1155.0, + 615.0, + 1155.0, + 647.0, + 954.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 526.75, + 526.0, + 611.75, + 526.0, + 611.75, + 570.0, + 526.75, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1227.0, + 1057.0, + 1227.0, + 1057.0, + 1274.0, + 291.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 818.0, + 73.0, + 818.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1470.0, + 1403.0, + 1470.0, + 1403.0, + 1503.0, + 295.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1500.0, + 1403.0, + 1500.0, + 1403.0, + 1533.0, + 294.0, + 1533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1531.0, + 1405.0, + 1531.0, + 1405.0, + 1565.0, + 295.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1559.0, + 1407.0, + 1559.0, + 1407.0, + 1597.0, + 292.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1592.0, + 1407.0, + 1592.0, + 1407.0, + 1626.0, + 294.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1621.0, + 1405.0, + 1621.0, + 1405.0, + 1656.0, + 292.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1653.0, + 1406.0, + 1653.0, + 1406.0, + 1687.0, + 295.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1682.0, + 807.0, + 1682.0, + 807.0, + 1716.0, + 295.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1297.0, + 1405.0, + 1297.0, + 1405.0, + 1336.0, + 293.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1332.0, + 1405.0, + 1332.0, + 1405.0, + 1365.0, + 296.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1362.0, + 1407.0, + 1362.0, + 1407.0, + 1396.0, + 295.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1394.0, + 1405.0, + 1394.0, + 1405.0, + 1424.0, + 296.0, + 1424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1420.0, + 755.0, + 1420.0, + 755.0, + 1460.0, + 293.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1730.0, + 1176.0, + 1730.0, + 1176.0, + 1763.0, + 295.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1197.0, + 1730.0, + 1406.0, + 1730.0, + 1406.0, + 1763.0, + 1197.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1759.0, + 1408.0, + 1759.0, + 1408.0, + 1793.0, + 294.0, + 1793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1786.0, + 525.0, + 1786.0, + 525.0, + 1829.0, + 292.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1786.0, + 1224.0, + 1786.0, + 1224.0, + 1829.0, + 599.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 1786.0, + 1408.0, + 1786.0, + 1408.0, + 1829.0, + 1354.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 1821.0, + 504.0, + 1821.0, + 504.0, + 1857.0, + 426.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 526.0, + 1821.0, + 1247.0, + 1821.0, + 1247.0, + 1857.0, + 526.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1029.0, + 1403.0, + 1029.0, + 1403.0, + 1065.0, + 295.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1062.0, + 1402.0, + 1062.0, + 1402.0, + 1092.0, + 297.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1090.0, + 482.0, + 1090.0, + 482.0, + 1123.0, + 296.0, + 1123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 508.0, + 1090.0, + 703.0, + 1090.0, + 703.0, + 1123.0, + 508.0, + 1123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 1090.0, + 1350.0, + 1090.0, + 1350.0, + 1123.0, + 733.0, + 1123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1376.0, + 1090.0, + 1405.0, + 1090.0, + 1405.0, + 1123.0, + 1376.0, + 1123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1121.0, + 1212.0, + 1121.0, + 1212.0, + 1158.0, + 295.0, + 1158.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1237.0, + 1121.0, + 1373.0, + 1121.0, + 1373.0, + 1158.0, + 1237.0, + 1158.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1397.0, + 1121.0, + 1408.0, + 1121.0, + 1408.0, + 1158.0, + 1397.0, + 1158.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1150.0, + 384.0, + 1150.0, + 384.0, + 1191.0, + 327.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 409.0, + 1150.0, + 515.0, + 1150.0, + 515.0, + 1191.0, + 409.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 887.0, + 448.0, + 887.0, + 448.0, + 928.0, + 293.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 476.0, + 887.0, + 519.0, + 887.0, + 519.0, + 928.0, + 476.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 543.0, + 887.0, + 730.0, + 887.0, + 730.0, + 928.0, + 543.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 995.0, + 887.0, + 1298.0, + 887.0, + 1298.0, + 928.0, + 995.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1337.0, + 887.0, + 1405.0, + 887.0, + 1405.0, + 928.0, + 1337.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 917.0, + 297.0, + 917.0, + 297.0, + 962.0, + 292.0, + 962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 506.0, + 917.0, + 1408.0, + 917.0, + 1408.0, + 962.0, + 506.0, + 962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 951.0, + 368.0, + 951.0, + 368.0, + 990.0, + 292.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 951.0, + 1405.0, + 951.0, + 1405.0, + 990.0, + 406.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 984.0, + 1210.0, + 984.0, + 1210.0, + 1020.0, + 295.0, + 1020.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1250, + 1404, + 1250, + 1404, + 1556, + 298, + 1556 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 971, + 1404, + 971, + 1404, + 1156, + 298, + 1156 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1571, + 1404, + 1571, + 1404, + 1847, + 298, + 1847 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 300, + 1941, + 1403, + 1941, + 1403, + 2034, + 300, + 2034 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 299, + 812, + 1403, + 812, + 1403, + 904, + 299, + 904 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 501, + 1406, + 501, + 1406, + 596, + 298, + 596 + ], + "score": 0.97 + }, + { + "category_id": 3, + "poly": [ + 300, + 244, + 1400, + 244, + 1400, + 382, + 300, + 382 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 291, + 609, + 1403, + 609, + 1403, + 672, + 291, + 672 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 698, + 768, + 1003, + 768, + 1003, + 805, + 698, + 805 + ], + "score": 0.938 + }, + { + "category_id": 8, + "poly": [ + 509, + 686, + 1189, + 686, + 1189, + 726, + 509, + 726 + ], + "score": 0.931 + }, + { + "category_id": 8, + "poly": [ + 478, + 919, + 1216, + 919, + 1216, + 960, + 478, + 960 + ], + "score": 0.93 + }, + { + "category_id": 4, + "poly": [ + 506, + 413, + 1189, + 413, + 1189, + 447, + 506, + 447 + ], + "score": 0.928 + }, + { + "category_id": 0, + "poly": [ + 302, + 1887, + 1141, + 1887, + 1141, + 1916, + 302, + 1916 + ], + "score": 0.907 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 814, + 76, + 814, + 104, + 299, + 104 + ], + "score": 0.887 + }, + { + "category_id": 9, + "poly": [ + 1366, + 772, + 1400, + 772, + 1400, + 801, + 1366, + 801 + ], + "score": 0.884 + }, + { + "category_id": 9, + "poly": [ + 1366, + 924, + 1399, + 924, + 1399, + 953, + 1366, + 953 + ], + "score": 0.879 + }, + { + "category_id": 0, + "poly": [ + 295, + 1193, + 973, + 1193, + 973, + 1225, + 295, + 1225 + ], + "score": 0.877 + }, + { + "category_id": 9, + "poly": [ + 1366, + 692, + 1400, + 692, + 1400, + 721, + 1366, + 721 + ], + "score": 0.867 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.707 + }, + { + "category_id": 5, + "poly": [ + 1183, + 271, + 1399, + 271, + 1399, + 361, + 1183, + 361 + ], + "score": 0.093, + "html": "
>ID123
110.70.1
20.710.2
30.10.20.9
" + }, + { + "category_id": 13, + "poly": [ + 402, + 501, + 532, + 501, + 532, + 536, + 402, + 536 + ], + "score": 0.93, + "latex": "\\mathcal { L } ( x _ { p } , x _ { q } ) ^ { + }" + }, + { + "category_id": 13, + "poly": [ + 749, + 533, + 903, + 533, + 903, + 566, + 749, + 566 + ], + "score": 0.93, + "latex": "\\hat { \\mathcal { D } } _ { K L } ^ { \\star } ( \\hat { \\mathcal { P } } ^ { \\star } | | \\mathcal { Q } )" + }, + { + "category_id": 13, + "poly": [ + 920, + 811, + 1136, + 811, + 1136, + 847, + 920, + 847 + ], + "score": 0.92, + "latex": "G ( x _ { p } , x _ { q } ) \\in \\{ 0 , 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 380, + 563, + 604, + 563, + 604, + 598, + 380, + 598 + ], + "score": 0.92, + "latex": "\\partial { \\cal D } _ { K L } ( { \\mathcal { P } } ^ { \\star } | | { \\mathcal { Q } } ) / \\partial { \\mathcal { Q } }" + }, + { + "category_id": 13, + "poly": [ + 928, + 1724, + 1037, + 1724, + 1037, + 1757, + 928, + 1757 + ], + "score": 0.92, + "latex": "g \\in [ 0 , 1 ]" + }, + { + "category_id": 14, + "poly": [ + 696, + 768, + 1003, + 768, + 1003, + 805, + 696, + 805 + ], + "score": 0.92, + "latex": "L _ { h } ( e , \\sigma ) = m a x ( 0 , \\sigma - e )" + }, + { + "category_id": 13, + "poly": [ + 555, + 1495, + 662, + 1495, + 662, + 1524, + 555, + 1524 + ], + "score": 0.91, + "latex": "1 0 \\times 5 1 2" + }, + { + "category_id": 13, + "poly": [ + 788, + 1525, + 923, + 1525, + 923, + 1554, + 788, + 1554 + ], + "score": 0.9, + "latex": "1 0 0 \\times 1 0 2 4" + }, + { + "category_id": 14, + "poly": [ + 480, + 918, + 1219, + 918, + 1219, + 959, + 480, + 959 + ], + "score": 0.89, + "latex": "\\mathcal { L } ( x _ { p } , x _ { q } ) = G ( x _ { p } , x _ { q } ) \\mathcal { L } ( x _ { p } , x _ { q } ) ^ { + } + ( 1 - G ( x _ { p } , x _ { q } ) ) \\mathcal { L } ( x _ { p } , x _ { q } ) ^ { - }" + }, + { + "category_id": 13, + "poly": [ + 1038, + 503, + 1076, + 503, + 1076, + 533, + 1038, + 533 + ], + "score": 0.88, + "latex": "\\mathcal { Q } ^ { \\star }" + }, + { + "category_id": 13, + "poly": [ + 946, + 504, + 985, + 504, + 985, + 531, + 946, + 531 + ], + "score": 0.88, + "latex": "{ \\mathcal { P } } ^ { \\star }" + }, + { + "category_id": 14, + "poly": [ + 511, + 685, + 1189, + 685, + 1189, + 727, + 511, + 727 + ], + "score": 0.87, + "latex": "\\mathcal { L } ( \\boldsymbol { x } _ { p } , \\boldsymbol { x } _ { q } ) ^ { - } = L _ { h } ( \\mathcal { D } _ { K L } ( \\mathcal { P } ^ { \\star } | | \\boldsymbol { \\mathcal { Q } } ) , \\boldsymbol { \\sigma } ) + L _ { h } ( \\mathcal { D } _ { K L } ( \\mathcal { Q } ^ { \\star } | | \\mathcal { P } ) , \\boldsymbol { \\sigma } )" + }, + { + "category_id": 13, + "poly": [ + 323, + 616, + 395, + 616, + 395, + 645, + 323, + 645 + ], + "score": 0.87, + "latex": "x _ { p } , x _ { q }" + }, + { + "category_id": 13, + "poly": [ + 756, + 509, + 829, + 509, + 829, + 535, + 756, + 535 + ], + "score": 0.87, + "latex": "x _ { p } , x _ { q }" + }, + { + "category_id": 13, + "poly": [ + 766, + 974, + 791, + 974, + 791, + 1000, + 766, + 1000 + ], + "score": 0.84, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 1046, + 1787, + 1071, + 1787, + 1071, + 1813, + 1046, + 1813 + ], + "score": 0.81, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 1138, + 1944, + 1164, + 1944, + 1164, + 1971, + 1138, + 1971 + ], + "score": 0.81, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 392, + 1759, + 410, + 1759, + 410, + 1787, + 392, + 1787 + ], + "score": 0.79, + "latex": "g" + }, + { + "category_id": 13, + "poly": [ + 730, + 1253, + 755, + 1253, + 755, + 1279, + 730, + 1279 + ], + "score": 0.79, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 669, + 1004, + 693, + 1004, + 693, + 1030, + 669, + 1030 + ], + "score": 0.77, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 941, + 1787, + 966, + 1787, + 966, + 1813, + 941, + 1813 + ], + "score": 0.77, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 1048, + 415, + 1073, + 415, + 1073, + 441, + 1048, + 441 + ], + "score": 0.69, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 394, + 353, + 414, + 353, + 414, + 367, + 394, + 367 + ], + "score": 0.26, + "latex": "= N" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 262.0, + 394.0, + 262.0, + 394.0, + 318.0, + 334.0, + 318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 414.0, + 289.0, + 426.0, + 289.0, + 426.0, + 301.0, + 414.0, + 301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 441.0, + 280.0, + 525.0, + 280.0, + 525.0, + 327.0, + 441.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 536.0, + 287.0, + 552.0, + 287.0, + 552.0, + 303.0, + 536.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 262.0, + 650.0, + 262.0, + 650.0, + 319.0, + 565.0, + 319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 662.0, + 288.0, + 679.0, + 288.0, + 679.0, + 302.0, + 662.0, + 302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 693.0, + 292.0, + 830.0, + 292.0, + 830.0, + 318.0, + 693.0, + 318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 845.0, + 283.0, + 866.0, + 283.0, + 866.0, + 325.0, + 845.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 250.0, + 975.0, + 250.0, + 975.0, + 317.0, + 888.0, + 317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1005.0, + 289.0, + 1015.0, + 289.0, + 1015.0, + 299.0, + 1005.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1035.0, + 256.0, + 1155.0, + 256.0, + 1155.0, + 320.0, + 1035.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1181.0, + 287.0, + 1195.0, + 287.0, + 1195.0, + 313.0, + 1181.0, + 313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1211.0, + 271.0, + 1239.0, + 271.0, + 1239.0, + 314.0, + 1211.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 245.0, + 1386.0, + 245.0, + 1386.0, + 315.0, + 1241.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 320.0, + 396.0, + 320.0, + 396.0, + 349.0, + 333.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 322.0, + 649.0, + 322.0, + 649.0, + 346.0, + 566.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 887.0, + 314.0, + 975.0, + 314.0, + 975.0, + 342.0, + 887.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 319.0, + 1054.0, + 319.0, + 1054.0, + 337.0, + 1038.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1066.0, + 315.0, + 1171.0, + 315.0, + 1171.0, + 339.0, + 1066.0, + 339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1215.0, + 314.0, + 1236.0, + 314.0, + 1236.0, + 337.0, + 1215.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1259.0, + 314.0, + 1290.0, + 314.0, + 1290.0, + 338.0, + 1259.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1313.0, + 315.0, + 1333.0, + 315.0, + 1333.0, + 335.0, + 1313.0, + 335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1355.0, + 314.0, + 1389.0, + 314.0, + 1389.0, + 338.0, + 1355.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 348.0, + 393.0, + 348.0, + 393.0, + 371.0, + 295.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 415.0, + 348.0, + 426.0, + 348.0, + 426.0, + 371.0, + 415.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 348.0, + 661.0, + 348.0, + 661.0, + 372.0, + 606.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 345.0, + 1000.0, + 345.0, + 1000.0, + 384.0, + 924.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 337.0, + 1054.0, + 337.0, + 1054.0, + 353.0, + 1038.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1215.0, + 337.0, + 1236.0, + 337.0, + 1236.0, + 358.0, + 1215.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1259.0, + 337.0, + 1289.0, + 337.0, + 1289.0, + 359.0, + 1259.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 337.0, + 1339.0, + 337.0, + 1339.0, + 359.0, + 1306.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1356.0, + 337.0, + 1399.0, + 337.0, + 1399.0, + 382.0, + 1356.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 411.0, + 1047.0, + 411.0, + 1047.0, + 451.0, + 507.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1074.0, + 411.0, + 1191.0, + 411.0, + 1191.0, + 451.0, + 1074.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1884.0, + 1144.0, + 1884.0, + 1144.0, + 1919.0, + 296.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 818.0, + 73.0, + 818.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1191.0, + 979.0, + 1191.0, + 979.0, + 1229.0, + 294.0, + 1229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 861.0, + 2085.0, + 861.0, + 2120.0, + 839.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1252.0, + 729.0, + 1252.0, + 729.0, + 1284.0, + 296.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 1252.0, + 1405.0, + 1252.0, + 1405.0, + 1284.0, + 756.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1282.0, + 1404.0, + 1282.0, + 1404.0, + 1314.0, + 294.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1309.0, + 1406.0, + 1309.0, + 1406.0, + 1347.0, + 293.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1343.0, + 1406.0, + 1343.0, + 1406.0, + 1375.0, + 293.0, + 1375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1370.0, + 1406.0, + 1370.0, + 1406.0, + 1408.0, + 293.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1403.0, + 1406.0, + 1403.0, + 1406.0, + 1439.0, + 294.0, + 1439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1432.0, + 1406.0, + 1432.0, + 1406.0, + 1469.0, + 293.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1464.0, + 1406.0, + 1464.0, + 1406.0, + 1499.0, + 293.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1496.0, + 554.0, + 1496.0, + 554.0, + 1527.0, + 296.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 663.0, + 1496.0, + 1404.0, + 1496.0, + 1404.0, + 1527.0, + 663.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1525.0, + 787.0, + 1525.0, + 787.0, + 1560.0, + 294.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 1525.0, + 1161.0, + 1525.0, + 1161.0, + 1560.0, + 924.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 973.0, + 765.0, + 973.0, + 765.0, + 1005.0, + 296.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 792.0, + 973.0, + 1404.0, + 973.0, + 1404.0, + 1005.0, + 792.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1004.0, + 668.0, + 1004.0, + 668.0, + 1036.0, + 294.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 694.0, + 1004.0, + 1405.0, + 1004.0, + 1405.0, + 1036.0, + 694.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1033.0, + 1406.0, + 1033.0, + 1406.0, + 1069.0, + 294.0, + 1069.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1063.0, + 1405.0, + 1063.0, + 1405.0, + 1099.0, + 294.0, + 1099.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1090.0, + 1405.0, + 1090.0, + 1405.0, + 1132.0, + 293.0, + 1132.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1125.0, + 1066.0, + 1125.0, + 1066.0, + 1159.0, + 294.0, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1573.0, + 1404.0, + 1573.0, + 1404.0, + 1606.0, + 297.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1603.0, + 1405.0, + 1603.0, + 1405.0, + 1636.0, + 296.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1631.0, + 1406.0, + 1631.0, + 1406.0, + 1670.0, + 292.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1662.0, + 1404.0, + 1662.0, + 1404.0, + 1699.0, + 293.0, + 1699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1695.0, + 1405.0, + 1695.0, + 1405.0, + 1727.0, + 294.0, + 1727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1725.0, + 927.0, + 1725.0, + 927.0, + 1761.0, + 294.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 1725.0, + 1405.0, + 1725.0, + 1405.0, + 1761.0, + 1038.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1755.0, + 391.0, + 1755.0, + 391.0, + 1787.0, + 296.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 411.0, + 1755.0, + 1402.0, + 1755.0, + 1402.0, + 1787.0, + 411.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1785.0, + 940.0, + 1785.0, + 940.0, + 1821.0, + 293.0, + 1821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 967.0, + 1785.0, + 1045.0, + 1785.0, + 1045.0, + 1821.0, + 967.0, + 1821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 1785.0, + 1406.0, + 1785.0, + 1406.0, + 1821.0, + 1072.0, + 1821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1817.0, + 683.0, + 1817.0, + 683.0, + 1850.0, + 296.0, + 1850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1942.0, + 1137.0, + 1942.0, + 1137.0, + 1975.0, + 296.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1165.0, + 1942.0, + 1404.0, + 1942.0, + 1404.0, + 1975.0, + 1165.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1972.0, + 1407.0, + 1972.0, + 1407.0, + 2006.0, + 295.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2001.0, + 1405.0, + 2001.0, + 1405.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 809.0, + 919.0, + 809.0, + 919.0, + 850.0, + 293.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1137.0, + 809.0, + 1407.0, + 809.0, + 1407.0, + 850.0, + 1137.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 841.0, + 1407.0, + 841.0, + 1407.0, + 877.0, + 294.0, + 877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 871.0, + 450.0, + 871.0, + 450.0, + 910.0, + 293.0, + 910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 499.0, + 401.0, + 499.0, + 401.0, + 540.0, + 293.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 533.0, + 499.0, + 755.0, + 499.0, + 755.0, + 540.0, + 533.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 499.0, + 945.0, + 499.0, + 945.0, + 540.0, + 830.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 986.0, + 499.0, + 1037.0, + 499.0, + 1037.0, + 540.0, + 986.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 499.0, + 1407.0, + 499.0, + 1407.0, + 540.0, + 1077.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 529.0, + 748.0, + 529.0, + 748.0, + 569.0, + 293.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 529.0, + 1406.0, + 529.0, + 1406.0, + 569.0, + 904.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 561.0, + 379.0, + 561.0, + 379.0, + 598.0, + 294.0, + 598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 561.0, + 614.0, + 561.0, + 614.0, + 598.0, + 605.0, + 598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 610.0, + 322.0, + 610.0, + 322.0, + 646.0, + 294.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 610.0, + 1406.0, + 610.0, + 1406.0, + 646.0, + 396.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 639.0, + 813.0, + 639.0, + 813.0, + 674.0, + 294.0, + 674.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1788, + 1405, + 1788, + 1405, + 2035, + 296, + 2035 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 296, + 1349, + 1405, + 1349, + 1405, + 1534, + 296, + 1534 + ], + "score": 0.983 + }, + { + "category_id": 3, + "poly": [ + 315, + 622, + 1397, + 622, + 1397, + 860, + 315, + 860 + ], + "score": 0.965 + }, + { + "category_id": 8, + "poly": [ + 706, + 1112, + 992, + 1112, + 992, + 1188, + 706, + 1188 + ], + "score": 0.96 + }, + { + "category_id": 1, + "poly": [ + 298, + 1196, + 1404, + 1196, + 1404, + 1259, + 298, + 1259 + ], + "score": 0.958 + }, + { + "category_id": 3, + "poly": [ + 304, + 225, + 1397, + 225, + 1397, + 410, + 304, + 410 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 298, + 1039, + 1401, + 1039, + 1401, + 1103, + 298, + 1103 + ], + "score": 0.951 + }, + { + "category_id": 8, + "poly": [ + 633, + 1701, + 1065, + 1701, + 1065, + 1784, + 633, + 1784 + ], + "score": 0.949 + }, + { + "category_id": 8, + "poly": [ + 564, + 1609, + 1133, + 1609, + 1133, + 1692, + 564, + 1692 + ], + "score": 0.938 + }, + { + "category_id": 8, + "poly": [ + 721, + 1544, + 977, + 1544, + 977, + 1580, + 721, + 1580 + ], + "score": 0.919 + }, + { + "category_id": 4, + "poly": [ + 297, + 896, + 1405, + 896, + 1405, + 992, + 297, + 992 + ], + "score": 0.918 + }, + { + "category_id": 0, + "poly": [ + 300, + 1293, + 828, + 1293, + 828, + 1325, + 300, + 1325 + ], + "score": 0.916 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 815, + 76, + 815, + 104, + 299, + 104 + ], + "score": 0.896 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1122, + 1400, + 1122, + 1400, + 1151, + 1366, + 1151 + ], + "score": 0.878 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1719, + 1400, + 1719, + 1400, + 1748, + 1366, + 1748 + ], + "score": 0.878 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1547, + 1400, + 1547, + 1400, + 1576, + 1366, + 1576 + ], + "score": 0.871 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1628, + 1400, + 1628, + 1400, + 1657, + 1366, + 1657 + ], + "score": 0.867 + }, + { + "category_id": 4, + "poly": [ + 295, + 443, + 1405, + 443, + 1405, + 600, + 295, + 600 + ], + "score": 0.808 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2112, + 840, + 2112 + ], + "score": 0.807 + }, + { + "category_id": 1, + "poly": [ + 295, + 443, + 1405, + 443, + 1405, + 600, + 295, + 600 + ], + "score": 0.179 + }, + { + "category_id": 14, + "poly": [ + 704, + 1109, + 995, + 1109, + 995, + 1191, + 704, + 1191 + ], + "score": 0.94, + "latex": "\\mathcal { L } _ { d } = \\sum _ { \\forall ( p , q ) \\in D } \\mathcal { L } ( x _ { p } , x _ { q } ) ." + }, + { + "category_id": 13, + "poly": [ + 491, + 1790, + 541, + 1790, + 541, + 1821, + 491, + 1821 + ], + "score": 0.93, + "latex": "\\mathcal { L } _ { c l s }" + }, + { + "category_id": 13, + "poly": [ + 1103, + 1790, + 1197, + 1790, + 1197, + 1820, + 1103, + 1820 + ], + "score": 0.92, + "latex": "\\mathcal { L } _ { c l u s t e r }" + }, + { + "category_id": 13, + "poly": [ + 346, + 1790, + 440, + 1790, + 440, + 1821, + 346, + 1821 + ], + "score": 0.92, + "latex": "\\mathcal { L } _ { c l u s t e r }" + }, + { + "category_id": 14, + "poly": [ + 632, + 1699, + 1066, + 1699, + 1066, + 1786, + 632, + 1786 + ], + "score": 0.92, + "latex": "\\mathcal { L } _ { c l u s t e r } = \\frac { 1 } { | b ^ { T } | ^ { 2 } } \\sum _ { \\forall ( i , j ) \\in D _ { b ^ { T } } } \\mathcal { L } ( x _ { i } , x _ { j } ) ." + }, + { + "category_id": 14, + "poly": [ + 562, + 1606, + 1136, + 1606, + 1136, + 1694, + 562, + 1694 + ], + "score": 0.91, + "latex": "\\mathcal { L } _ { c l s } = \\frac { 1 } { | b ^ { S } | } \\sum _ { \\forall x _ { i } \\in X _ { b } s } C r o s s E n t r o p y L o s s ( f ( x _ { i } ) ) ." + }, + { + "category_id": 13, + "poly": [ + 850, + 1042, + 912, + 1042, + 912, + 1074, + 850, + 1074 + ], + "score": 0.91, + "latex": "( p , q )" + }, + { + "category_id": 13, + "poly": [ + 765, + 1821, + 816, + 1821, + 816, + 1852, + 765, + 1852 + ], + "score": 0.91, + "latex": "\\mathcal { L } _ { c l s }" + }, + { + "category_id": 13, + "poly": [ + 1073, + 1474, + 1118, + 1474, + 1118, + 1504, + 1073, + 1504 + ], + "score": 0.91, + "latex": "\\mathcal { L } _ { c d }" + }, + { + "category_id": 14, + "poly": [ + 720, + 1543, + 978, + 1543, + 978, + 1579, + 720, + 1579 + ], + "score": 0.91, + "latex": "\\mathcal { L } _ { c d } = \\mathcal { L } _ { c l s } + \\mathcal { L } _ { c l u s t e r }" + }, + { + "category_id": 13, + "poly": [ + 1186, + 1443, + 1236, + 1443, + 1236, + 1474, + 1186, + 1474 + ], + "score": 0.9, + "latex": "X _ { b ^ { S } }" + }, + { + "category_id": 13, + "poly": [ + 812, + 1474, + 862, + 1474, + 862, + 1505, + 812, + 1505 + ], + "score": 0.9, + "latex": "D _ { b ^ { T } }" + }, + { + "category_id": 13, + "poly": [ + 471, + 1474, + 522, + 1474, + 522, + 1505, + 471, + 1505 + ], + "score": 0.9, + "latex": "X _ { b ^ { T } }" + }, + { + "category_id": 13, + "poly": [ + 738, + 1073, + 773, + 1073, + 773, + 1102, + 738, + 1102 + ], + "score": 0.89, + "latex": "\\mathcal { L } _ { d }" + }, + { + "category_id": 13, + "poly": [ + 385, + 1197, + 421, + 1197, + 421, + 1226, + 385, + 1226 + ], + "score": 0.89, + "latex": "\\mathcal { L } _ { d }" + }, + { + "category_id": 13, + "poly": [ + 1238, + 897, + 1267, + 897, + 1267, + 926, + 1238, + 926 + ], + "score": 0.87, + "latex": "S ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 679, + 1382, + 707, + 1382, + 707, + 1409, + 679, + 1409 + ], + "score": 0.87, + "latex": "S ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 569, + 2003, + 653, + 2003, + 653, + 2032, + 569, + 2032 + ], + "score": 0.86, + "latex": "\\mathrm { C C N ^ { + + } }" + }, + { + "category_id": 13, + "poly": [ + 445, + 2003, + 518, + 2003, + 518, + 2032, + 445, + 2032 + ], + "score": 0.86, + "latex": "\\mathrm { C C N ^ { + } }" + }, + { + "category_id": 13, + "poly": [ + 684, + 959, + 767, + 959, + 767, + 988, + 684, + 988 + ], + "score": 0.86, + "latex": "\\mathrm { C C N ^ { + + } }" + }, + { + "category_id": 13, + "poly": [ + 869, + 929, + 944, + 929, + 944, + 957, + 869, + 957 + ], + "score": 0.86, + "latex": "\\mathrm { C C N ^ { + } }" + }, + { + "category_id": 13, + "poly": [ + 960, + 1790, + 980, + 1790, + 980, + 1822, + 960, + 1822 + ], + "score": 0.85, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 964, + 569, + 984, + 569, + 984, + 599, + 964, + 599 + ], + "score": 0.84, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 793, + 508, + 813, + 508, + 813, + 539, + 793, + 539 + ], + "score": 0.83, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 990, + 1048, + 1009, + 1048, + 1009, + 1073, + 990, + 1073 + ], + "score": 0.81, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 1058, + 1047, + 1075, + 1047, + 1075, + 1073, + 1058, + 1073 + ], + "score": 0.8, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 572, + 1043, + 599, + 1043, + 599, + 1069, + 572, + 1069 + ], + "score": 0.79, + "latex": "D" + }, + { + "category_id": 13, + "poly": [ + 1377, + 1353, + 1401, + 1353, + 1401, + 1379, + 1377, + 1379 + ], + "score": 0.79, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 711, + 508, + 730, + 508, + 730, + 534, + 711, + 534 + ], + "score": 0.75, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 1134, + 1444, + 1150, + 1444, + 1150, + 1471, + 1134, + 1471 + ], + "score": 0.75, + "latex": "b" + }, + { + "category_id": 13, + "poly": [ + 1318, + 898, + 1342, + 898, + 1342, + 925, + 1318, + 925 + ], + "score": 0.75, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 537, + 478, + 561, + 478, + 561, + 504, + 537, + 504 + ], + "score": 0.62, + "latex": "T" + }, + { + "category_id": 15, + "poly": [ + 1086.0, + 622.0, + 1277.0, + 622.0, + 1277.0, + 645.0, + 1086.0, + 645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 638.0, + 1062.0, + 638.0, + 1062.0, + 651.0, + 1046.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 638.0, + 1236.0, + 638.0, + 1236.0, + 664.0, + 1126.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 709.0, + 680.0, + 807.0, + 680.0, + 807.0, + 702.0, + 709.0, + 702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 682.0, + 931.0, + 682.0, + 931.0, + 710.0, + 861.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 938.0, + 664.0, + 983.0, + 664.0, + 983.0, + 719.0, + 938.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1006.0, + 699.0, + 1019.0, + 699.0, + 1019.0, + 708.0, + 1006.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1119.0, + 677.0, + 1260.0, + 677.0, + 1260.0, + 707.0, + 1119.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1319.0, + 662.0, + 1367.0, + 662.0, + 1367.0, + 707.0, + 1319.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 709.0, + 396.0, + 709.0, + 396.0, + 737.0, + 333.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 709.0, + 649.0, + 709.0, + 649.0, + 736.0, + 565.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 753.0, + 713.0, + 821.0, + 713.0, + 821.0, + 734.0, + 753.0, + 734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 720.0, + 899.0, + 720.0, + 899.0, + 729.0, + 890.0, + 729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 959.0, + 706.0, + 1022.0, + 706.0, + 1022.0, + 726.0, + 959.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 737.0, + 396.0, + 737.0, + 396.0, + 796.0, + 333.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 416.0, + 736.0, + 425.0, + 736.0, + 425.0, + 746.0, + 416.0, + 746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 727.0, + 526.0, + 727.0, + 526.0, + 776.0, + 439.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 537.0, + 736.0, + 553.0, + 736.0, + 553.0, + 749.0, + 537.0, + 749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 739.0, + 650.0, + 739.0, + 650.0, + 794.0, + 565.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 755.0, + 729.0, + 822.0, + 729.0, + 822.0, + 777.0, + 755.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 740.0, + 932.0, + 740.0, + 932.0, + 768.0, + 862.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 959.0, + 741.0, + 1025.0, + 741.0, + 1025.0, + 784.0, + 959.0, + 784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 743.0, + 1079.0, + 743.0, + 1079.0, + 766.0, + 1051.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 748.0, + 1280.0, + 748.0, + 1280.0, + 780.0, + 1120.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 340.0, + 796.0, + 392.0, + 796.0, + 392.0, + 821.0, + 340.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 719.0, + 810.0, + 796.0, + 810.0, + 796.0, + 837.0, + 719.0, + 837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 818.0, + 1011.0, + 818.0, + 1011.0, + 845.0, + 870.0, + 845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1085.0, + 818.0, + 1095.0, + 818.0, + 1095.0, + 827.0, + 1085.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 816.0, + 1280.0, + 816.0, + 1280.0, + 849.0, + 1120.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 831.0, + 686.0, + 831.0, + 686.0, + 858.0, + 601.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 695.0, + 828.0, + 819.0, + 828.0, + 819.0, + 857.0, + 695.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 822.0, + 1079.0, + 822.0, + 1079.0, + 843.0, + 1046.0, + 843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 225.0, + 1277.0, + 225.0, + 1277.0, + 250.0, + 1083.0, + 250.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 241.0, + 1233.0, + 241.0, + 1233.0, + 266.0, + 1126.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1310.0, + 264.0, + 1319.0, + 264.0, + 1319.0, + 276.0, + 1310.0, + 276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 296.0, + 393.0, + 296.0, + 393.0, + 321.0, + 334.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 564.0, + 292.0, + 648.0, + 292.0, + 648.0, + 324.0, + 564.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.0, + 288.0, + 825.0, + 288.0, + 825.0, + 315.0, + 691.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 292.0, + 930.0, + 292.0, + 930.0, + 321.0, + 862.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 939.0, + 279.0, + 985.0, + 279.0, + 985.0, + 335.0, + 939.0, + 335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1271.0, + 299.0, + 1357.0, + 299.0, + 1357.0, + 328.0, + 1271.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 323.0, + 396.0, + 323.0, + 396.0, + 382.0, + 332.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.0, + 312.0, + 524.0, + 312.0, + 524.0, + 361.0, + 440.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 539.0, + 319.0, + 552.0, + 319.0, + 552.0, + 335.0, + 539.0, + 335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 323.0, + 650.0, + 323.0, + 650.0, + 380.0, + 565.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 695.0, + 316.0, + 716.0, + 316.0, + 716.0, + 349.0, + 695.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 321.0, + 824.0, + 321.0, + 824.0, + 364.0, + 750.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 317.0, + 933.0, + 317.0, + 933.0, + 377.0, + 839.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 937.0, + 331.0, + 962.0, + 331.0, + 962.0, + 390.0, + 937.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 966.0, + 349.0, + 1026.0, + 349.0, + 1026.0, + 377.0, + 966.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 317.0, + 1042.0, + 317.0, + 1042.0, + 330.0, + 1032.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 319.0, + 1197.0, + 319.0, + 1197.0, + 347.0, + 1058.0, + 347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 318.0, + 1379.0, + 318.0, + 1379.0, + 368.0, + 1251.0, + 368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 700.0, + 371.0, + 709.0, + 371.0, + 709.0, + 384.0, + 700.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 752.0, + 367.0, + 822.0, + 367.0, + 822.0, + 389.0, + 752.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 960.0, + 370.0, + 1022.0, + 370.0, + 1022.0, + 390.0, + 960.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 379.0, + 429.0, + 379.0, + 429.0, + 407.0, + 297.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 381.0, + 662.0, + 381.0, + 662.0, + 407.0, + 606.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 387.0, + 1215.0, + 387.0, + 1215.0, + 413.0, + 1150.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1000.25, + 302.0, + 1021.25, + 302.0, + 1021.25, + 321.5, + 1000.25, + 321.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 411.0, + 318.0, + 429.0, + 318.0, + 429.0, + 336.0, + 411.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 962.0, + 315.0, + 1020.0, + 315.0, + 1020.0, + 334.0, + 962.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 895.0, + 1237.0, + 895.0, + 1237.0, + 933.0, + 295.0, + 933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 895.0, + 1317.0, + 895.0, + 1317.0, + 933.0, + 1268.0, + 933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 895.0, + 1406.0, + 895.0, + 1406.0, + 933.0, + 1343.0, + 933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 927.0, + 868.0, + 927.0, + 868.0, + 964.0, + 294.0, + 964.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 927.0, + 1407.0, + 927.0, + 1407.0, + 964.0, + 945.0, + 964.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 959.0, + 683.0, + 959.0, + 683.0, + 993.0, + 295.0, + 993.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 768.0, + 959.0, + 1407.0, + 959.0, + 1407.0, + 993.0, + 768.0, + 993.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1290.0, + 829.0, + 1290.0, + 829.0, + 1330.0, + 293.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 818.0, + 73.0, + 818.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 444.0, + 1406.0, + 444.0, + 1406.0, + 481.0, + 294.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 476.0, + 536.0, + 476.0, + 536.0, + 509.0, + 295.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 562.0, + 476.0, + 1403.0, + 476.0, + 1403.0, + 509.0, + 562.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 507.0, + 710.0, + 507.0, + 710.0, + 540.0, + 295.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 731.0, + 507.0, + 792.0, + 507.0, + 792.0, + 540.0, + 731.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 814.0, + 507.0, + 1405.0, + 507.0, + 1405.0, + 540.0, + 814.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 536.0, + 1405.0, + 536.0, + 1405.0, + 574.0, + 294.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 567.0, + 963.0, + 567.0, + 963.0, + 603.0, + 293.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 567.0, + 1407.0, + 567.0, + 1407.0, + 603.0, + 985.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2116.0, + 840.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1785.0, + 345.0, + 1785.0, + 345.0, + 1827.0, + 291.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 441.0, + 1785.0, + 490.0, + 1785.0, + 490.0, + 1827.0, + 441.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 1785.0, + 959.0, + 1785.0, + 959.0, + 1827.0, + 542.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 981.0, + 1785.0, + 1102.0, + 1785.0, + 1102.0, + 1827.0, + 981.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1198.0, + 1785.0, + 1407.0, + 1785.0, + 1407.0, + 1827.0, + 1198.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1820.0, + 764.0, + 1820.0, + 764.0, + 1854.0, + 294.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 817.0, + 1820.0, + 1405.0, + 1820.0, + 1405.0, + 1854.0, + 817.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1851.0, + 1406.0, + 1851.0, + 1406.0, + 1885.0, + 294.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1884.0, + 1405.0, + 1884.0, + 1405.0, + 1914.0, + 295.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1912.0, + 1407.0, + 1912.0, + 1407.0, + 1945.0, + 294.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1939.0, + 1406.0, + 1939.0, + 1406.0, + 1978.0, + 291.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1973.0, + 1403.0, + 1973.0, + 1403.0, + 2007.0, + 295.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2001.0, + 444.0, + 2001.0, + 444.0, + 2037.0, + 295.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 519.0, + 2001.0, + 568.0, + 2001.0, + 568.0, + 2037.0, + 519.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 654.0, + 2001.0, + 1090.0, + 2001.0, + 1090.0, + 2037.0, + 654.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1350.0, + 1376.0, + 1350.0, + 1376.0, + 1384.0, + 293.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1350.0, + 1405.0, + 1350.0, + 1405.0, + 1384.0, + 1402.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1383.0, + 678.0, + 1383.0, + 678.0, + 1415.0, + 295.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 1383.0, + 1405.0, + 1383.0, + 1405.0, + 1415.0, + 708.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1414.0, + 1405.0, + 1414.0, + 1405.0, + 1445.0, + 296.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1444.0, + 1133.0, + 1444.0, + 1133.0, + 1476.0, + 295.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 1444.0, + 1185.0, + 1444.0, + 1185.0, + 1476.0, + 1151.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1237.0, + 1444.0, + 1403.0, + 1444.0, + 1403.0, + 1476.0, + 1237.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1475.0, + 470.0, + 1475.0, + 470.0, + 1506.0, + 296.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 523.0, + 1475.0, + 811.0, + 1475.0, + 811.0, + 1506.0, + 523.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 1475.0, + 1072.0, + 1475.0, + 1072.0, + 1506.0, + 863.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1119.0, + 1475.0, + 1406.0, + 1475.0, + 1406.0, + 1506.0, + 1119.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1504.0, + 770.0, + 1504.0, + 770.0, + 1536.0, + 295.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1194.0, + 384.0, + 1194.0, + 384.0, + 1230.0, + 296.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 1194.0, + 1405.0, + 1194.0, + 1405.0, + 1230.0, + 422.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1226.0, + 1399.0, + 1226.0, + 1399.0, + 1262.0, + 294.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1040.0, + 571.0, + 1040.0, + 571.0, + 1076.0, + 296.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 1040.0, + 849.0, + 1040.0, + 849.0, + 1076.0, + 600.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 913.0, + 1040.0, + 989.0, + 1040.0, + 989.0, + 1076.0, + 913.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1010.0, + 1040.0, + 1057.0, + 1040.0, + 1057.0, + 1076.0, + 1010.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.0, + 1040.0, + 1405.0, + 1040.0, + 1405.0, + 1076.0, + 1076.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1071.0, + 737.0, + 1071.0, + 737.0, + 1107.0, + 293.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 774.0, + 1071.0, + 1149.0, + 1071.0, + 1149.0, + 1107.0, + 774.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 444.0, + 1406.0, + 444.0, + 1406.0, + 481.0, + 294.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 476.0, + 536.0, + 476.0, + 536.0, + 509.0, + 295.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 562.0, + 476.0, + 1403.0, + 476.0, + 1403.0, + 509.0, + 562.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 507.0, + 710.0, + 507.0, + 710.0, + 540.0, + 295.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 731.0, + 507.0, + 792.0, + 507.0, + 792.0, + 540.0, + 731.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 814.0, + 507.0, + 1405.0, + 507.0, + 1405.0, + 540.0, + 814.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 536.0, + 1405.0, + 536.0, + 1405.0, + 574.0, + 294.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 567.0, + 963.0, + 567.0, + 963.0, + 603.0, + 293.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 567.0, + 1407.0, + 567.0, + 1407.0, + 603.0, + 985.0, + 603.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1668, + 1405, + 1668, + 1405, + 2034, + 298, + 2034 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 765, + 1404, + 765, + 1404, + 1040, + 298, + 1040 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1056, + 1404, + 1056, + 1404, + 1392, + 298, + 1392 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1406, + 1405, + 1406, + 1405, + 1652, + 298, + 1652 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 535, + 1404, + 535, + 1404, + 750, + 298, + 750 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 295, + 1404, + 295, + 1404, + 388, + 299, + 388 + ], + "score": 0.969 + }, + { + "category_id": 0, + "poly": [ + 300, + 226, + 558, + 226, + 558, + 262, + 300, + 262 + ], + "score": 0.904 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.891 + }, + { + "category_id": 0, + "poly": [ + 299, + 481, + 468, + 481, + 468, + 513, + 299, + 513 + ], + "score": 0.889 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 857, + 2088, + 857, + 2111, + 841, + 2111 + ], + "score": 0.741 + }, + { + "category_id": 0, + "poly": [ + 297, + 425, + 983, + 425, + 983, + 457, + 297, + 457 + ], + "score": 0.493 + }, + { + "category_id": 1, + "poly": [ + 297, + 425, + 983, + 425, + 983, + 457, + 297, + 457 + ], + "score": 0.437 + }, + { + "category_id": 13, + "poly": [ + 517, + 980, + 542, + 980, + 542, + 1006, + 517, + 1006 + ], + "score": 0.81, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 1290, + 1592, + 1319, + 1592, + 1319, + 1618, + 1290, + 1618 + ], + "score": 0.81, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 896, + 1332, + 921, + 1332, + 921, + 1359, + 896, + 1359 + ], + "score": 0.81, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 324, + 1562, + 352, + 1562, + 352, + 1588, + 324, + 1588 + ], + "score": 0.81, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 1215, + 1500, + 1244, + 1500, + 1244, + 1527, + 1215, + 1527 + ], + "score": 0.8, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 1089, + 1240, + 1114, + 1240, + 1114, + 1268, + 1089, + 1268 + ], + "score": 0.79, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 1328, + 1301, + 1353, + 1301, + 1353, + 1327, + 1328, + 1327 + ], + "score": 0.79, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 1162, + 1790, + 1187, + 1790, + 1187, + 1818, + 1162, + 1818 + ], + "score": 0.78, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 1300, + 1791, + 1325, + 1791, + 1325, + 1818, + 1300, + 1818 + ], + "score": 0.77, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 741, + 658, + 885, + 658, + 885, + 692, + 741, + 692 + ], + "score": 0.77, + "latex": "O m n g l o t _ { b g }" + }, + { + "category_id": 13, + "poly": [ + 708, + 1367, + 727, + 1367, + 727, + 1388, + 708, + 1388 + ], + "score": 0.75, + "latex": "\\sigma" + }, + { + "category_id": 13, + "poly": [ + 665, + 1699, + 690, + 1699, + 690, + 1727, + 665, + 1727 + ], + "score": 0.73, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 644, + 1500, + 690, + 1500, + 690, + 1530, + 644, + 1530 + ], + "score": 0.73, + "latex": "( K )" + }, + { + "category_id": 13, + "poly": [ + 360, + 1301, + 523, + 1301, + 523, + 1332, + 360, + 1332 + ], + "score": 0.72, + "latex": "O m n i g l o t _ { e v a l }" + }, + { + "category_id": 13, + "poly": [ + 297, + 658, + 338, + 658, + 338, + 689, + 297, + 689 + ], + "score": 0.71, + "latex": "( T )" + }, + { + "category_id": 13, + "poly": [ + 1324, + 690, + 1370, + 690, + 1370, + 720, + 1324, + 720 + ], + "score": 0.71, + "latex": "_ { e v a l }" + }, + { + "category_id": 13, + "poly": [ + 349, + 766, + 375, + 766, + 375, + 794, + 349, + 794 + ], + "score": 0.7, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 1045, + 629, + 1210, + 629, + 1210, + 659, + 1045, + 659 + ], + "score": 0.69, + "latex": "O m n i g l o t _ { e v a l }" + }, + { + "category_id": 13, + "poly": [ + 1354, + 765, + 1402, + 765, + 1402, + 795, + 1354, + 795 + ], + "score": 0.68, + "latex": "2 \\mathbf { x } 2" + }, + { + "category_id": 13, + "poly": [ + 412, + 858, + 486, + 858, + 486, + 886, + 412, + 886 + ], + "score": 0.68, + "latex": "3 2 \\mathrm { x } 3 2" + }, + { + "category_id": 13, + "poly": [ + 670, + 1088, + 695, + 1088, + 695, + 1115, + 670, + 1115 + ], + "score": 0.67, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 913, + 629, + 954, + 629, + 954, + 658, + 913, + 658 + ], + "score": 0.65, + "latex": "( A )" + }, + { + "category_id": 13, + "poly": [ + 418, + 1410, + 462, + 1410, + 462, + 1439, + 418, + 1439 + ], + "score": 0.62, + "latex": "e v a l" + }, + { + "category_id": 13, + "poly": [ + 1355, + 1087, + 1402, + 1087, + 1402, + 1116, + 1355, + 1116 + ], + "score": 0.55, + "latex": "2 \\mathbf { x } 2" + }, + { + "category_id": 13, + "poly": [ + 1196, + 827, + 1340, + 827, + 1340, + 861, + 1196, + 861 + ], + "score": 0.5, + "latex": "O m n i g l o t _ { b g }" + }, + { + "category_id": 13, + "poly": [ + 1161, + 598, + 1326, + 598, + 1326, + 629, + 1161, + 629 + ], + "score": 0.5, + "latex": "O m n i g l o t _ { e v a l }" + }, + { + "category_id": 13, + "poly": [ + 950, + 767, + 996, + 767, + 996, + 795, + 950, + 795 + ], + "score": 0.45, + "latex": "3 \\mathrm { x } 3" + }, + { + "category_id": 13, + "poly": [ + 508, + 629, + 652, + 629, + 652, + 662, + 508, + 662 + ], + "score": 0.42, + "latex": "O m n i g l o t _ { b g }" + }, + { + "category_id": 13, + "poly": [ + 764, + 598, + 907, + 598, + 907, + 631, + 764, + 631 + ], + "score": 0.32, + "latex": "O m n i g l o t _ { b g }" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 222.0, + 561.0, + 222.0, + 561.0, + 267.0, + 291.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 478.0, + 472.0, + 478.0, + 472.0, + 518.0, + 293.0, + 518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2118.0, + 839.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 423.0, + 986.0, + 423.0, + 986.0, + 459.0, + 295.0, + 459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1669.0, + 1408.0, + 1669.0, + 1408.0, + 1703.0, + 295.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1701.0, + 664.0, + 1701.0, + 664.0, + 1731.0, + 297.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.0, + 1701.0, + 1403.0, + 1701.0, + 1403.0, + 1731.0, + 691.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1728.0, + 1405.0, + 1728.0, + 1405.0, + 1762.0, + 295.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1760.0, + 1405.0, + 1760.0, + 1405.0, + 1794.0, + 295.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1789.0, + 1161.0, + 1789.0, + 1161.0, + 1823.0, + 295.0, + 1823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1188.0, + 1789.0, + 1299.0, + 1789.0, + 1299.0, + 1823.0, + 1188.0, + 1823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1326.0, + 1789.0, + 1405.0, + 1789.0, + 1405.0, + 1823.0, + 1326.0, + 1823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1821.0, + 1406.0, + 1821.0, + 1406.0, + 1855.0, + 295.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1851.0, + 1408.0, + 1851.0, + 1408.0, + 1884.0, + 292.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1881.0, + 1406.0, + 1881.0, + 1406.0, + 1915.0, + 295.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1912.0, + 1406.0, + 1912.0, + 1406.0, + 1944.0, + 292.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1941.0, + 1410.0, + 1941.0, + 1410.0, + 1978.0, + 293.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1970.0, + 1408.0, + 1970.0, + 1408.0, + 2009.0, + 292.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2000.0, + 1403.0, + 2000.0, + 1403.0, + 2038.0, + 293.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 766.0, + 348.0, + 766.0, + 348.0, + 798.0, + 296.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 376.0, + 766.0, + 949.0, + 766.0, + 949.0, + 798.0, + 376.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 766.0, + 1353.0, + 766.0, + 1353.0, + 798.0, + 997.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 796.0, + 1406.0, + 796.0, + 1406.0, + 832.0, + 293.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 824.0, + 1195.0, + 824.0, + 1195.0, + 863.0, + 295.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1341.0, + 824.0, + 1406.0, + 824.0, + 1406.0, + 863.0, + 1341.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 858.0, + 411.0, + 858.0, + 411.0, + 891.0, + 296.0, + 891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 487.0, + 858.0, + 1406.0, + 858.0, + 1406.0, + 891.0, + 487.0, + 891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 888.0, + 1405.0, + 888.0, + 1405.0, + 921.0, + 296.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 918.0, + 1406.0, + 918.0, + 1406.0, + 953.0, + 292.0, + 953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 948.0, + 1405.0, + 948.0, + 1405.0, + 985.0, + 294.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 975.0, + 516.0, + 975.0, + 516.0, + 1015.0, + 292.0, + 1015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 543.0, + 975.0, + 1406.0, + 975.0, + 1406.0, + 1015.0, + 543.0, + 1015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1012.0, + 676.0, + 1012.0, + 676.0, + 1044.0, + 296.0, + 1044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1058.0, + 1402.0, + 1058.0, + 1402.0, + 1089.0, + 296.0, + 1089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1087.0, + 669.0, + 1087.0, + 669.0, + 1121.0, + 294.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 1087.0, + 1354.0, + 1087.0, + 1354.0, + 1121.0, + 696.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1116.0, + 1406.0, + 1116.0, + 1406.0, + 1153.0, + 292.0, + 1153.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1146.0, + 1407.0, + 1146.0, + 1407.0, + 1183.0, + 292.0, + 1183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1177.0, + 1408.0, + 1177.0, + 1408.0, + 1215.0, + 292.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1209.0, + 1406.0, + 1209.0, + 1406.0, + 1244.0, + 294.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1238.0, + 1088.0, + 1238.0, + 1088.0, + 1275.0, + 293.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 1238.0, + 1406.0, + 1238.0, + 1406.0, + 1275.0, + 1115.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1270.0, + 1405.0, + 1270.0, + 1405.0, + 1305.0, + 294.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1295.0, + 359.0, + 1295.0, + 359.0, + 1338.0, + 292.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 524.0, + 1295.0, + 1327.0, + 1295.0, + 1327.0, + 1338.0, + 524.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 1295.0, + 1406.0, + 1295.0, + 1406.0, + 1338.0, + 1354.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1327.0, + 895.0, + 1327.0, + 895.0, + 1368.0, + 292.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 922.0, + 1327.0, + 1409.0, + 1327.0, + 1409.0, + 1368.0, + 922.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1359.0, + 707.0, + 1359.0, + 707.0, + 1396.0, + 293.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 728.0, + 1359.0, + 1199.0, + 1359.0, + 1199.0, + 1396.0, + 728.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1404.0, + 417.0, + 1404.0, + 417.0, + 1445.0, + 293.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 1404.0, + 1407.0, + 1404.0, + 1407.0, + 1445.0, + 463.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1440.0, + 1403.0, + 1440.0, + 1403.0, + 1469.0, + 294.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1469.0, + 1405.0, + 1469.0, + 1405.0, + 1501.0, + 292.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1499.0, + 643.0, + 1499.0, + 643.0, + 1534.0, + 293.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.0, + 1499.0, + 1214.0, + 1499.0, + 1214.0, + 1534.0, + 691.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1245.0, + 1499.0, + 1406.0, + 1499.0, + 1406.0, + 1534.0, + 1245.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1530.0, + 1408.0, + 1530.0, + 1408.0, + 1564.0, + 295.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1558.0, + 323.0, + 1558.0, + 323.0, + 1596.0, + 291.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1558.0, + 1407.0, + 1558.0, + 1407.0, + 1596.0, + 353.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1591.0, + 1289.0, + 1591.0, + 1289.0, + 1625.0, + 295.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1320.0, + 1591.0, + 1408.0, + 1591.0, + 1408.0, + 1625.0, + 1320.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1622.0, + 855.0, + 1622.0, + 855.0, + 1655.0, + 295.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 535.0, + 1405.0, + 535.0, + 1405.0, + 570.0, + 294.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 566.0, + 1406.0, + 566.0, + 1406.0, + 601.0, + 294.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 598.0, + 763.0, + 598.0, + 763.0, + 633.0, + 294.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 598.0, + 1160.0, + 598.0, + 1160.0, + 633.0, + 908.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1327.0, + 598.0, + 1404.0, + 598.0, + 1404.0, + 633.0, + 1327.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 627.0, + 507.0, + 627.0, + 507.0, + 665.0, + 292.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 653.0, + 627.0, + 912.0, + 627.0, + 912.0, + 665.0, + 653.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 627.0, + 1044.0, + 627.0, + 1044.0, + 665.0, + 955.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1211.0, + 627.0, + 1406.0, + 627.0, + 1406.0, + 665.0, + 1211.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 656.0, + 296.0, + 656.0, + 296.0, + 694.0, + 293.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 339.0, + 656.0, + 740.0, + 656.0, + 740.0, + 694.0, + 339.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 656.0, + 1408.0, + 656.0, + 1408.0, + 694.0, + 886.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 686.0, + 1323.0, + 686.0, + 1323.0, + 726.0, + 292.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1371.0, + 686.0, + 1406.0, + 686.0, + 1406.0, + 726.0, + 1371.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 718.0, + 1044.0, + 718.0, + 1044.0, + 754.0, + 292.0, + 754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 293.0, + 1408.0, + 293.0, + 1408.0, + 329.0, + 294.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 325.0, + 1404.0, + 325.0, + 1404.0, + 362.0, + 294.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 356.0, + 626.0, + 356.0, + 626.0, + 391.0, + 295.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 423.0, + 986.0, + 423.0, + 986.0, + 459.0, + 295.0, + 459.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 365, + 404, + 1335, + 404, + 1335, + 817, + 365, + 817 + ], + "score": 0.985, + "html": "
MethodConstraints inACCACC (100)NMINMI (100)
MetricClustering
K-means21.7%18.9%0.3530.464
LPNMF22.2%16.3%0.3720.498
LSC23.6%18.0%0.3760.500
ITML056.7%47.2%0.6740.727
SKMS0=45.5%10.693
SKKm062.4%46.9%0.7700.781
SKLR066.9%46.8%0.7910.760
CSP062.5%65.4%0.8120.812
MPCK-means0081.9%53.9%0.8710.816
CCN (Ours)0082.4%78.1%0.8890.874
" + }, + { + "category_id": 1, + "poly": [ + 297, + 1298, + 1405, + 1298, + 1405, + 1605, + 297, + 1605 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 956, + 1405, + 956, + 1405, + 1202, + 298, + 1202 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1619, + 1404, + 1619, + 1404, + 1867, + 297, + 1867 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 299, + 1881, + 1403, + 1881, + 1403, + 2035, + 299, + 2035 + ], + "score": 0.976 + }, + { + "category_id": 6, + "poly": [ + 298, + 247, + 1403, + 247, + 1403, + 402, + 298, + 402 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 301, + 879, + 1401, + 879, + 1401, + 941, + 301, + 941 + ], + "score": 0.957 + }, + { + "category_id": 0, + "poly": [ + 301, + 1242, + 724, + 1242, + 724, + 1275, + 301, + 1275 + ], + "score": 0.898 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.897 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2112, + 840, + 2112 + ], + "score": 0.791 + }, + { + "category_id": 13, + "poly": [ + 439, + 1483, + 546, + 1483, + 546, + 1512, + 439, + 1512 + ], + "score": 0.93, + "latex": "K = 1 0 0" + }, + { + "category_id": 13, + "poly": [ + 561, + 1713, + 677, + 1713, + 677, + 1741, + 561, + 1741 + ], + "score": 0.91, + "latex": "K = 1 0 0" + }, + { + "category_id": 13, + "poly": [ + 1235, + 311, + 1342, + 311, + 1342, + 339, + 1235, + 339 + ], + "score": 0.9, + "latex": "K = 1 0 0" + }, + { + "category_id": 13, + "poly": [ + 623, + 1361, + 700, + 1361, + 700, + 1390, + 623, + 1390 + ], + "score": 0.88, + "latex": "7 8 . 1 \\%" + }, + { + "category_id": 13, + "poly": [ + 1320, + 1391, + 1397, + 1391, + 1397, + 1421, + 1320, + 1421 + ], + "score": 0.87, + "latex": "6 5 . 4 \\%" + }, + { + "category_id": 13, + "poly": [ + 1105, + 1361, + 1181, + 1361, + 1181, + 1390, + 1105, + 1390 + ], + "score": 0.87, + "latex": "8 2 . 4 \\%" + }, + { + "category_id": 13, + "poly": [ + 297, + 1483, + 371, + 1483, + 371, + 1512, + 297, + 1512 + ], + "score": 0.86, + "latex": "5 3 . 9 \\%" + }, + { + "category_id": 13, + "poly": [ + 1294, + 1453, + 1371, + 1453, + 1371, + 1482, + 1294, + 1482 + ], + "score": 0.86, + "latex": "8 1 . 9 \\%" + }, + { + "category_id": 13, + "poly": [ + 297, + 1514, + 352, + 1514, + 352, + 1543, + 297, + 1543 + ], + "score": 0.86, + "latex": "94 \\%" + }, + { + "category_id": 13, + "poly": [ + 483, + 1974, + 506, + 1974, + 506, + 2000, + 483, + 2000 + ], + "score": 0.84, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 480, + 2005, + 504, + 2005, + 504, + 2030, + 480, + 2030 + ], + "score": 0.82, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 1256, + 1362, + 1285, + 1362, + 1285, + 1389, + 1256, + 1389 + ], + "score": 0.79, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 621, + 881, + 650, + 881, + 650, + 907, + 621, + 907 + ], + "score": 0.78, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 442, + 1362, + 471, + 1362, + 471, + 1389, + 442, + 1389 + ], + "score": 0.76, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 947, + 253, + 971, + 253, + 971, + 283, + 947, + 283 + ], + "score": 0.39, + "latex": "b g" + }, + { + "category_id": 13, + "poly": [ + 1124, + 253, + 1167, + 253, + 1167, + 281, + 1124, + 281 + ], + "score": 0.34, + "latex": "e v a l" + }, + { + "category_id": 13, + "poly": [ + 1005, + 250, + 1167, + 250, + 1167, + 281, + 1005, + 281 + ], + "score": 0.25, + "latex": "O m n i g l o t _ { e v a l }" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 246.0, + 946.0, + 246.0, + 946.0, + 285.0, + 293.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 972.0, + 246.0, + 1004.0, + 246.0, + 1004.0, + 285.0, + 972.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1168.0, + 246.0, + 1405.0, + 246.0, + 1405.0, + 285.0, + 1168.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 281.0, + 1404.0, + 281.0, + 1404.0, + 314.0, + 296.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 309.0, + 1234.0, + 309.0, + 1234.0, + 344.0, + 294.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 309.0, + 1404.0, + 309.0, + 1404.0, + 344.0, + 1343.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 340.0, + 1405.0, + 340.0, + 1405.0, + 378.0, + 294.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 370.0, + 1199.0, + 370.0, + 1199.0, + 406.0, + 293.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1242.0, + 729.0, + 1242.0, + 729.0, + 1278.0, + 295.0, + 1278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 2085.0, + 859.0, + 2085.0, + 859.0, + 2116.0, + 836.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1295.0, + 1406.0, + 1295.0, + 1406.0, + 1338.0, + 292.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1329.0, + 1405.0, + 1329.0, + 1405.0, + 1365.0, + 295.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1356.0, + 441.0, + 1356.0, + 441.0, + 1398.0, + 291.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 1356.0, + 622.0, + 1356.0, + 622.0, + 1398.0, + 472.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 1356.0, + 1104.0, + 1356.0, + 1104.0, + 1398.0, + 701.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1182.0, + 1356.0, + 1255.0, + 1356.0, + 1255.0, + 1398.0, + 1182.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1286.0, + 1356.0, + 1410.0, + 1356.0, + 1410.0, + 1398.0, + 1286.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1389.0, + 1319.0, + 1389.0, + 1319.0, + 1426.0, + 294.0, + 1426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1398.0, + 1389.0, + 1408.0, + 1389.0, + 1408.0, + 1426.0, + 1398.0, + 1426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1418.0, + 1407.0, + 1418.0, + 1407.0, + 1459.0, + 292.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1450.0, + 1293.0, + 1450.0, + 1293.0, + 1488.0, + 292.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1372.0, + 1450.0, + 1406.0, + 1450.0, + 1406.0, + 1488.0, + 1372.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1479.0, + 296.0, + 1479.0, + 296.0, + 1516.0, + 292.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1479.0, + 438.0, + 1479.0, + 438.0, + 1516.0, + 372.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 547.0, + 1479.0, + 1406.0, + 1479.0, + 1406.0, + 1516.0, + 547.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1511.0, + 296.0, + 1511.0, + 296.0, + 1548.0, + 292.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1511.0, + 1405.0, + 1511.0, + 1405.0, + 1548.0, + 353.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1540.0, + 1406.0, + 1540.0, + 1406.0, + 1583.0, + 291.0, + 1583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1574.0, + 548.0, + 1574.0, + 548.0, + 1609.0, + 294.0, + 1609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 958.0, + 1405.0, + 958.0, + 1405.0, + 991.0, + 295.0, + 991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 985.0, + 1405.0, + 985.0, + 1405.0, + 1024.0, + 292.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1019.0, + 1405.0, + 1019.0, + 1405.0, + 1053.0, + 293.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1044.0, + 1409.0, + 1044.0, + 1409.0, + 1086.0, + 291.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1080.0, + 1405.0, + 1080.0, + 1405.0, + 1114.0, + 295.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1107.0, + 1409.0, + 1107.0, + 1409.0, + 1148.0, + 292.0, + 1148.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1143.0, + 1406.0, + 1143.0, + 1406.0, + 1173.0, + 296.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1172.0, + 869.0, + 1172.0, + 869.0, + 1202.0, + 296.0, + 1202.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1617.0, + 1405.0, + 1617.0, + 1405.0, + 1657.0, + 292.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1652.0, + 1406.0, + 1652.0, + 1406.0, + 1686.0, + 295.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1680.0, + 1407.0, + 1680.0, + 1407.0, + 1718.0, + 294.0, + 1718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1713.0, + 560.0, + 1713.0, + 560.0, + 1747.0, + 295.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 1713.0, + 1405.0, + 1713.0, + 1405.0, + 1747.0, + 678.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1743.0, + 1405.0, + 1743.0, + 1405.0, + 1777.0, + 295.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1771.0, + 1406.0, + 1771.0, + 1406.0, + 1809.0, + 291.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1802.0, + 1406.0, + 1802.0, + 1406.0, + 1840.0, + 294.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1834.0, + 993.0, + 1834.0, + 993.0, + 1871.0, + 294.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1879.0, + 1404.0, + 1879.0, + 1404.0, + 1916.0, + 295.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1908.0, + 1405.0, + 1908.0, + 1405.0, + 1947.0, + 294.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 1408.0, + 1942.0, + 1408.0, + 1979.0, + 294.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1971.0, + 482.0, + 1971.0, + 482.0, + 2008.0, + 294.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 1971.0, + 1407.0, + 1971.0, + 1407.0, + 2008.0, + 507.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2002.0, + 479.0, + 2002.0, + 479.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 505.0, + 2002.0, + 1405.0, + 2002.0, + 1405.0, + 2039.0, + 505.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 876.0, + 620.0, + 876.0, + 620.0, + 915.0, + 295.0, + 915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 651.0, + 876.0, + 1406.0, + 876.0, + 1406.0, + 915.0, + 651.0, + 915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 910.0, + 567.0, + 910.0, + 567.0, + 945.0, + 296.0, + 945.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 489, + 1405, + 489, + 1405, + 936, + 298, + 936 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1404, + 229, + 1404, + 474, + 298, + 474 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1850, + 1404, + 1850, + 1404, + 2033, + 298, + 2033 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1543, + 1403, + 1543, + 1403, + 1696, + 298, + 1696 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1711, + 1402, + 1711, + 1402, + 1834, + 299, + 1834 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 297, + 1024, + 1405, + 1024, + 1405, + 1391, + 297, + 1391 + ], + "score": 0.962 + }, + { + "category_id": 0, + "poly": [ + 298, + 970, + 947, + 970, + 947, + 1002, + 298, + 1002 + ], + "score": 0.913 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.894 + }, + { + "category_id": 0, + "poly": [ + 299, + 1488, + 469, + 1488, + 469, + 1520, + 299, + 1520 + ], + "score": 0.892 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.791 + }, + { + "category_id": 0, + "poly": [ + 299, + 1431, + 1021, + 1431, + 1021, + 1462, + 299, + 1462 + ], + "score": 0.632 + }, + { + "category_id": 1, + "poly": [ + 299, + 1431, + 1021, + 1431, + 1021, + 1462, + 299, + 1462 + ], + "score": 0.271 + }, + { + "category_id": 13, + "poly": [ + 644, + 870, + 715, + 870, + 715, + 909, + 644, + 909 + ], + "score": 0.92, + "latex": "N C _ { d } ^ { g t }" + }, + { + "category_id": 13, + "poly": [ + 297, + 709, + 731, + 709, + 731, + 753, + 297, + 753 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { A D i f = \\frac { 1 } { | D | } \\sum _ { d \\in D } { | N D C _ { d } - N C _ { d } ^ { g t } | } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 510, + 874, + 595, + 874, + 595, + 905, + 510, + 905 + ], + "score": 0.91, + "latex": "N D C _ { d }" + }, + { + "category_id": 13, + "poly": [ + 685, + 680, + 792, + 680, + 792, + 707, + 685, + 707 + ], + "score": 0.9, + "latex": "K = 1 0 0" + }, + { + "category_id": 13, + "poly": [ + 1179, + 650, + 1249, + 650, + 1249, + 681, + 1179, + 681 + ], + "score": 0.89, + "latex": "\\bar { E } [ \\bar { C } _ { i } ]" + }, + { + "category_id": 13, + "poly": [ + 1171, + 551, + 1260, + 551, + 1260, + 583, + 1171, + 583 + ], + "score": 0.89, + "latex": "( N C ^ { g t } )" + }, + { + "category_id": 13, + "poly": [ + 1294, + 810, + 1402, + 810, + 1402, + 839, + 1294, + 839 + ], + "score": 0.89, + "latex": "K = 1 0 0" + }, + { + "category_id": 13, + "poly": [ + 1128, + 680, + 1218, + 680, + 1218, + 711, + 1128, + 711 + ], + "score": 0.89, + "latex": "( A D i f )" + }, + { + "category_id": 13, + "poly": [ + 1037, + 612, + 1397, + 612, + 1397, + 652, + 1037, + 652 + ], + "score": 0.87, + "latex": "\\begin{array} { r } { N D C = \\sum _ { i = 1 } ^ { K } \\left[ C _ { i } > = \\bar { E } [ C _ { i } ] \\right] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 709, + 649, + 741, + 649, + 741, + 679, + 709, + 679 + ], + "score": 0.87, + "latex": "C _ { i }" + }, + { + "category_id": 13, + "poly": [ + 433, + 1300, + 509, + 1300, + 509, + 1329, + 433, + 1329 + ], + "score": 0.86, + "latex": "6 5 . 2 \\%" + }, + { + "category_id": 13, + "poly": [ + 1264, + 1636, + 1346, + 1636, + 1346, + 1663, + 1264, + 1663 + ], + "score": 0.85, + "latex": "w \\to d" + }, + { + "category_id": 13, + "poly": [ + 1202, + 1270, + 1277, + 1270, + 1277, + 1299, + 1202, + 1299 + ], + "score": 0.85, + "latex": "7 3 . 8 \\%" + }, + { + "category_id": 13, + "poly": [ + 1321, + 1300, + 1403, + 1300, + 1403, + 1330, + 1321, + 1330 + ], + "score": 0.84, + "latex": "( 3 4 . 5 \\%" + }, + { + "category_id": 13, + "poly": [ + 1327, + 712, + 1401, + 712, + 1401, + 745, + 1327, + 745 + ], + "score": 0.84, + "latex": "A D i f" + }, + { + "category_id": 13, + "poly": [ + 1001, + 1882, + 1073, + 1882, + 1073, + 1910, + 1001, + 1910 + ], + "score": 0.83, + "latex": "\\mathrm { C C N ^ { + } }" + }, + { + "category_id": 13, + "poly": [ + 809, + 1638, + 890, + 1638, + 890, + 1664, + 809, + 1664 + ], + "score": 0.83, + "latex": "a w" + }, + { + "category_id": 13, + "poly": [ + 1077, + 1636, + 1158, + 1636, + 1158, + 1664, + 1077, + 1664 + ], + "score": 0.83, + "latex": "d \\to w" + }, + { + "category_id": 13, + "poly": [ + 902, + 1636, + 978, + 1636, + 978, + 1664, + 902, + 1664 + ], + "score": 0.83, + "latex": "a \\to d" + }, + { + "category_id": 13, + "poly": [ + 328, + 1362, + 352, + 1362, + 352, + 1388, + 328, + 1388 + ], + "score": 0.83, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 990, + 1636, + 1065, + 1636, + 1065, + 1664, + 990, + 1664 + ], + "score": 0.82, + "latex": "d \\to a" + }, + { + "category_id": 13, + "poly": [ + 999, + 1744, + 1024, + 1744, + 1024, + 1770, + 999, + 1770 + ], + "score": 0.82, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 643, + 811, + 672, + 811, + 672, + 837, + 643, + 837 + ], + "score": 0.82, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 305, + 1118, + 373, + 1118, + 373, + 1147, + 305, + 1147 + ], + "score": 0.82, + "latex": "\\mathrm { \\sim } 3 9 \\mathrm { k }" + }, + { + "category_id": 13, + "poly": [ + 1347, + 1271, + 1375, + 1271, + 1375, + 1297, + 1347, + 1297 + ], + "score": 0.82, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 1325, + 781, + 1354, + 781, + 1354, + 807, + 1325, + 807 + ], + "score": 0.8, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 298, + 906, + 326, + 906, + 326, + 932, + 298, + 932 + ], + "score": 0.79, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 634, + 751, + 662, + 751, + 662, + 776, + 634, + 776 + ], + "score": 0.79, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 1169, + 714, + 1196, + 714, + 1196, + 740, + 1169, + 740 + ], + "score": 0.78, + "latex": "D" + }, + { + "category_id": 13, + "poly": [ + 724, + 1149, + 749, + 1149, + 749, + 1176, + 724, + 1176 + ], + "score": 0.78, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 1170, + 1638, + 1252, + 1638, + 1252, + 1664, + 1170, + 1664 + ], + "score": 0.76, + "latex": "w a" + }, + { + "category_id": 13, + "poly": [ + 635, + 583, + 708, + 583, + 708, + 612, + 635, + 612 + ], + "score": 0.74, + "latex": "N D C" + }, + { + "category_id": 13, + "poly": [ + 818, + 713, + 837, + 713, + 837, + 741, + 818, + 741 + ], + "score": 0.72, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 480, + 491, + 524, + 491, + 524, + 519, + 480, + 519 + ], + "score": 0.71, + "latex": "K ?" + }, + { + "category_id": 13, + "poly": [ + 375, + 648, + 401, + 648, + 401, + 682, + 375, + 682 + ], + "score": 0.71, + "latex": "[ \\cdot ]" + }, + { + "category_id": 13, + "poly": [ + 785, + 1119, + 951, + 1119, + 951, + 1149, + 785, + 1149 + ], + "score": 0.7, + "latex": "I m a g e N e t _ { 1 1 8 }" + }, + { + "category_id": 13, + "poly": [ + 680, + 552, + 769, + 552, + 769, + 582, + 680, + 582 + ], + "score": 0.7, + "latex": "( N D C )" + }, + { + "category_id": 13, + "poly": [ + 1204, + 1088, + 1228, + 1088, + 1228, + 1114, + 1204, + 1114 + ], + "score": 0.7, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 353, + 1713, + 379, + 1713, + 379, + 1741, + 353, + 1741 + ], + "score": 0.7, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 1260, + 1714, + 1284, + 1714, + 1284, + 1740, + 1260, + 1740 + ], + "score": 0.69, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 856, + 1575, + 890, + 1575, + 890, + 1605, + 856, + 1605 + ], + "score": 0.69, + "latex": "( d )" + }, + { + "category_id": 13, + "poly": [ + 1052, + 1576, + 1092, + 1576, + 1092, + 1605, + 1052, + 1605 + ], + "score": 0.66, + "latex": "( w )" + }, + { + "category_id": 13, + "poly": [ + 623, + 1635, + 788, + 1635, + 788, + 1666, + 623, + 1666 + ], + "score": 0.63, + "latex": "S ^ { \\prime } \\to \\mathrm { t a r g e t } T" + }, + { + "category_id": 13, + "poly": [ + 993, + 1119, + 1017, + 1119, + 1017, + 1145, + 993, + 1145 + ], + "score": 0.61, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 988, + 651, + 1001, + 651, + 1001, + 676, + 988, + 676 + ], + "score": 0.59, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 732, + 1575, + 767, + 1575, + 767, + 1605, + 732, + 1605 + ], + "score": 0.55, + "latex": "( a )" + }, + { + "category_id": 13, + "poly": [ + 890, + 491, + 955, + 491, + 955, + 522, + 890, + 522 + ], + "score": 0.48, + "latex": "( N C )" + }, + { + "category_id": 13, + "poly": [ + 762, + 1636, + 786, + 1636, + 786, + 1663, + 762, + 1663 + ], + "score": 0.35, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 623, + 1635, + 690, + 1635, + 690, + 1663, + 623, + 1663 + ], + "score": 0.26, + "latex": "S ^ { \\prime } " + }, + { + "category_id": 15, + "poly": [ + 294.0, + 968.0, + 952.0, + 968.0, + 952.0, + 1006.0, + 294.0, + 1006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1485.0, + 473.0, + 1485.0, + 473.0, + 1525.0, + 293.0, + 1525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2087.0, + 860.0, + 2087.0, + 860.0, + 2117.0, + 839.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1429.0, + 1025.0, + 1429.0, + 1025.0, + 1465.0, + 294.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 490.0, + 479.0, + 490.0, + 479.0, + 524.0, + 296.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 525.0, + 490.0, + 889.0, + 490.0, + 889.0, + 524.0, + 525.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 490.0, + 1405.0, + 490.0, + 1405.0, + 524.0, + 956.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 523.0, + 1403.0, + 523.0, + 1403.0, + 554.0, + 297.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 549.0, + 679.0, + 549.0, + 679.0, + 587.0, + 293.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 549.0, + 1170.0, + 549.0, + 1170.0, + 587.0, + 770.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 549.0, + 1407.0, + 549.0, + 1407.0, + 587.0, + 1261.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 581.0, + 634.0, + 581.0, + 634.0, + 617.0, + 293.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 709.0, + 581.0, + 1405.0, + 581.0, + 1405.0, + 617.0, + 709.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 601.0, + 1036.0, + 601.0, + 1036.0, + 659.0, + 287.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1398.0, + 601.0, + 1412.0, + 601.0, + 1412.0, + 659.0, + 1398.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 647.0, + 374.0, + 647.0, + 374.0, + 684.0, + 293.0, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 647.0, + 708.0, + 647.0, + 708.0, + 684.0, + 402.0, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 742.0, + 647.0, + 987.0, + 647.0, + 987.0, + 684.0, + 742.0, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1002.0, + 647.0, + 1178.0, + 647.0, + 1178.0, + 684.0, + 1002.0, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1250.0, + 647.0, + 1408.0, + 647.0, + 1408.0, + 684.0, + 1250.0, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 675.0, + 684.0, + 675.0, + 684.0, + 715.0, + 292.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 793.0, + 675.0, + 1127.0, + 675.0, + 1127.0, + 715.0, + 793.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1219.0, + 675.0, + 1406.0, + 675.0, + 1406.0, + 715.0, + 1219.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 704.0, + 296.0, + 704.0, + 296.0, + 756.0, + 287.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 732.0, + 704.0, + 817.0, + 704.0, + 817.0, + 756.0, + 732.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 704.0, + 1168.0, + 704.0, + 1168.0, + 756.0, + 838.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1197.0, + 704.0, + 1326.0, + 704.0, + 1326.0, + 756.0, + 1197.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 704.0, + 1411.0, + 704.0, + 1411.0, + 756.0, + 1402.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 747.0, + 633.0, + 747.0, + 633.0, + 783.0, + 293.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 663.0, + 747.0, + 1405.0, + 747.0, + 1405.0, + 783.0, + 663.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 780.0, + 1324.0, + 780.0, + 1324.0, + 814.0, + 295.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1355.0, + 780.0, + 1405.0, + 780.0, + 1405.0, + 814.0, + 1355.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 809.0, + 642.0, + 809.0, + 642.0, + 844.0, + 292.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 673.0, + 809.0, + 1293.0, + 809.0, + 1293.0, + 844.0, + 673.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 809.0, + 1407.0, + 809.0, + 1407.0, + 844.0, + 1403.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 841.0, + 1407.0, + 841.0, + 1407.0, + 875.0, + 295.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 864.0, + 509.0, + 864.0, + 509.0, + 922.0, + 283.0, + 922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 864.0, + 643.0, + 864.0, + 643.0, + 922.0, + 596.0, + 922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 864.0, + 1406.0, + 864.0, + 1406.0, + 922.0, + 716.0, + 922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 902.0, + 614.0, + 902.0, + 614.0, + 941.0, + 327.0, + 941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 228.0, + 1409.0, + 228.0, + 1409.0, + 268.0, + 291.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 260.0, + 1405.0, + 260.0, + 1405.0, + 298.0, + 293.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 290.0, + 1405.0, + 290.0, + 1405.0, + 328.0, + 294.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 320.0, + 1406.0, + 320.0, + 1406.0, + 357.0, + 293.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 351.0, + 1405.0, + 351.0, + 1405.0, + 389.0, + 293.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 381.0, + 1406.0, + 381.0, + 1406.0, + 419.0, + 293.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 415.0, + 1404.0, + 415.0, + 1404.0, + 449.0, + 294.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 444.0, + 1156.0, + 444.0, + 1156.0, + 477.0, + 294.0, + 477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1849.0, + 1406.0, + 1849.0, + 1406.0, + 1885.0, + 294.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1882.0, + 1000.0, + 1882.0, + 1000.0, + 1914.0, + 294.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1074.0, + 1882.0, + 1408.0, + 1882.0, + 1408.0, + 1914.0, + 1074.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1911.0, + 1409.0, + 1911.0, + 1409.0, + 1945.0, + 293.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1941.0, + 1405.0, + 1941.0, + 1405.0, + 1976.0, + 293.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1974.0, + 1405.0, + 1974.0, + 1405.0, + 2006.0, + 296.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2002.0, + 1406.0, + 2002.0, + 1406.0, + 2038.0, + 294.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1542.0, + 1404.0, + 1542.0, + 1404.0, + 1577.0, + 296.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1572.0, + 731.0, + 1572.0, + 731.0, + 1605.0, + 296.0, + 1605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 768.0, + 1572.0, + 855.0, + 1572.0, + 855.0, + 1605.0, + 768.0, + 1605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 1572.0, + 1051.0, + 1572.0, + 1051.0, + 1605.0, + 891.0, + 1605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1093.0, + 1572.0, + 1402.0, + 1572.0, + 1402.0, + 1605.0, + 1093.0, + 1605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1602.0, + 1404.0, + 1602.0, + 1404.0, + 1639.0, + 294.0, + 1639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1630.0, + 622.0, + 1630.0, + 622.0, + 1672.0, + 292.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 789.0, + 1630.0, + 808.0, + 1630.0, + 808.0, + 1672.0, + 789.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 1630.0, + 901.0, + 1630.0, + 901.0, + 1672.0, + 891.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 979.0, + 1630.0, + 989.0, + 1630.0, + 989.0, + 1672.0, + 979.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1066.0, + 1630.0, + 1076.0, + 1630.0, + 1076.0, + 1672.0, + 1066.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 1630.0, + 1169.0, + 1630.0, + 1169.0, + 1672.0, + 1159.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1253.0, + 1630.0, + 1263.0, + 1630.0, + 1263.0, + 1672.0, + 1253.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1347.0, + 1630.0, + 1407.0, + 1630.0, + 1407.0, + 1672.0, + 1347.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1663.0, + 1177.0, + 1663.0, + 1177.0, + 1705.0, + 292.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1712.0, + 352.0, + 1712.0, + 352.0, + 1745.0, + 295.0, + 1745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 1712.0, + 1259.0, + 1712.0, + 1259.0, + 1745.0, + 380.0, + 1745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1285.0, + 1712.0, + 1406.0, + 1712.0, + 1406.0, + 1745.0, + 1285.0, + 1745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1742.0, + 998.0, + 1742.0, + 998.0, + 1775.0, + 295.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1025.0, + 1742.0, + 1404.0, + 1742.0, + 1404.0, + 1775.0, + 1025.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1771.0, + 1406.0, + 1771.0, + 1406.0, + 1809.0, + 293.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1805.0, + 592.0, + 1805.0, + 592.0, + 1836.0, + 294.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1023.0, + 1410.0, + 1023.0, + 1410.0, + 1062.0, + 291.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1053.0, + 1408.0, + 1053.0, + 1408.0, + 1093.0, + 292.0, + 1093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1087.0, + 1203.0, + 1087.0, + 1203.0, + 1121.0, + 295.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1229.0, + 1087.0, + 1405.0, + 1087.0, + 1405.0, + 1121.0, + 1229.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1118.0, + 304.0, + 1118.0, + 304.0, + 1152.0, + 294.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 374.0, + 1118.0, + 784.0, + 1118.0, + 784.0, + 1152.0, + 374.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 1118.0, + 992.0, + 1118.0, + 992.0, + 1152.0, + 952.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1018.0, + 1118.0, + 1405.0, + 1118.0, + 1405.0, + 1152.0, + 1018.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1148.0, + 723.0, + 1148.0, + 723.0, + 1182.0, + 294.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 1148.0, + 1405.0, + 1148.0, + 1405.0, + 1182.0, + 750.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1177.0, + 1406.0, + 1177.0, + 1406.0, + 1212.0, + 294.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1209.0, + 1405.0, + 1209.0, + 1405.0, + 1243.0, + 294.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1238.0, + 1406.0, + 1238.0, + 1406.0, + 1274.0, + 292.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1270.0, + 1201.0, + 1270.0, + 1201.0, + 1302.0, + 292.0, + 1302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1278.0, + 1270.0, + 1346.0, + 1270.0, + 1346.0, + 1302.0, + 1278.0, + 1302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1376.0, + 1270.0, + 1406.0, + 1270.0, + 1406.0, + 1302.0, + 1376.0, + 1302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1300.0, + 432.0, + 1300.0, + 432.0, + 1334.0, + 294.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 1300.0, + 1320.0, + 1300.0, + 1320.0, + 1334.0, + 510.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1330.0, + 1406.0, + 1330.0, + 1406.0, + 1368.0, + 294.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1361.0, + 327.0, + 1361.0, + 327.0, + 1395.0, + 295.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1361.0, + 713.0, + 1361.0, + 713.0, + 1395.0, + 353.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1429.0, + 1025.0, + 1429.0, + 1025.0, + 1465.0, + 294.0, + 1465.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 805, + 1405, + 805, + 1405, + 1233, + 298, + 1233 + ], + "score": 0.984 + }, + { + "category_id": 5, + "poly": [ + 297, + 331, + 1403, + 331, + 1403, + 568, + 297, + 568 + ], + "score": 0.982, + "html": "
A→WD→WW→DA→DD→AW→AAvg
Source-Only66.892.896.867.151.453.071.3
DANN (Ganin et al., 2016)73.297.099.069.358.057.875.7
JAN (Long et al., 2017)74.594.199.675.958.759.076.9
CCN+ (ours)76.797.398.271.261.060.577.5
CCN++ (with DANN)78.297.498.673.562.860.678.5
" + }, + { + "category_id": 1, + "poly": [ + 298, + 1650, + 1405, + 1650, + 1405, + 1896, + 298, + 1896 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1320, + 1404, + 1320, + 1404, + 1536, + 297, + 1536 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 299, + 1911, + 1402, + 1911, + 1402, + 2034, + 299, + 2034 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 299, + 624, + 1404, + 624, + 1404, + 716, + 299, + 716 + ], + "score": 0.97 + }, + { + "category_id": 6, + "poly": [ + 297, + 249, + 1400, + 249, + 1400, + 312, + 297, + 312 + ], + "score": 0.941 + }, + { + "category_id": 0, + "poly": [ + 298, + 1266, + 876, + 1266, + 876, + 1298, + 298, + 1298 + ], + "score": 0.918 + }, + { + "category_id": 0, + "poly": [ + 301, + 750, + 725, + 750, + 725, + 783, + 301, + 783 + ], + "score": 0.902 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.898 + }, + { + "category_id": 0, + "poly": [ + 301, + 1581, + 765, + 1581, + 765, + 1616, + 301, + 1616 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2112, + 836, + 2112 + ], + "score": 0.848 + }, + { + "category_id": 13, + "poly": [ + 906, + 1474, + 996, + 1474, + 996, + 1503, + 906, + 1503 + ], + "score": 0.9, + "latex": "+ 2 3 . 9 \\%" + }, + { + "category_id": 13, + "poly": [ + 293, + 1474, + 382, + 1474, + 382, + 1504, + 293, + 1504 + ], + "score": 0.9, + "latex": "+ 3 7 . 1 \\%" + }, + { + "category_id": 13, + "poly": [ + 1166, + 622, + 1267, + 622, + 1267, + 653, + 1166, + 653 + ], + "score": 0.88, + "latex": "\\mathrm { C C N ^ { + / + + } }" + }, + { + "category_id": 13, + "poly": [ + 606, + 866, + 684, + 866, + 684, + 896, + 606, + 896 + ], + "score": 0.88, + "latex": "7 1 . 3 \\%" + }, + { + "category_id": 13, + "poly": [ + 718, + 1049, + 802, + 1049, + 802, + 1078, + 718, + 1078 + ], + "score": 0.88, + "latex": "\\mathrm { C C N ^ { + + } }" + }, + { + "category_id": 13, + "poly": [ + 1057, + 836, + 1132, + 836, + 1132, + 865, + 1057, + 865 + ], + "score": 0.87, + "latex": "7 7 . 5 \\%" + }, + { + "category_id": 13, + "poly": [ + 345, + 1049, + 401, + 1049, + 401, + 1079, + 345, + 1079 + ], + "score": 0.87, + "latex": "82 \\%" + }, + { + "category_id": 13, + "poly": [ + 547, + 1444, + 623, + 1444, + 623, + 1473, + 547, + 1473 + ], + "score": 0.87, + "latex": "8 9 . 1 \\%" + }, + { + "category_id": 13, + "poly": [ + 549, + 1322, + 624, + 1322, + 624, + 1350, + 549, + 1350 + ], + "score": 0.87, + "latex": "\\mathrm { C C N ^ { + } }" + }, + { + "category_id": 13, + "poly": [ + 576, + 928, + 666, + 928, + 666, + 958, + 576, + 958 + ], + "score": 0.87, + "latex": "( 7 6 . 9 \\% )" + }, + { + "category_id": 13, + "poly": [ + 1304, + 897, + 1396, + 897, + 1396, + 928, + 1304, + 928 + ], + "score": 0.85, + "latex": "( 7 5 . 7 \\% )" + }, + { + "category_id": 13, + "poly": [ + 966, + 1352, + 995, + 1352, + 995, + 1380, + 966, + 1380 + ], + "score": 0.85, + "latex": "S ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 591, + 1049, + 666, + 1049, + 666, + 1079, + 591, + 1079 + ], + "score": 0.85, + "latex": "\\mathrm { C C N ^ { + } }" + }, + { + "category_id": 13, + "poly": [ + 1240, + 1019, + 1316, + 1019, + 1316, + 1048, + 1240, + 1048 + ], + "score": 0.85, + "latex": "7 7 . 9 \\%" + }, + { + "category_id": 13, + "poly": [ + 1327, + 1019, + 1403, + 1019, + 1403, + 1048, + 1327, + 1048 + ], + "score": 0.84, + "latex": "8 1 . 1 \\%" + }, + { + "category_id": 13, + "poly": [ + 821, + 1171, + 908, + 1171, + 908, + 1202, + 821, + 1202 + ], + "score": 0.83, + "latex": "( \\sim 0 . 2 )" + }, + { + "category_id": 13, + "poly": [ + 708, + 1142, + 733, + 1142, + 733, + 1168, + 708, + 1168 + ], + "score": 0.83, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 1080, + 928, + 1175, + 928, + 1175, + 958, + 1080, + 958 + ], + "score": 0.82, + "latex": "\\mathrm { ( C C N ^ { + + } ) }" + }, + { + "category_id": 13, + "poly": [ + 1345, + 1051, + 1370, + 1051, + 1370, + 1078, + 1345, + 1078 + ], + "score": 0.81, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 906, + 806, + 993, + 806, + 993, + 836, + 906, + 836 + ], + "score": 0.78, + "latex": "\\mathrm { ( C C N ^ { + } ) }" + }, + { + "category_id": 13, + "poly": [ + 713, + 1081, + 738, + 1081, + 738, + 1108, + 713, + 1108 + ], + "score": 0.77, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 610, + 1384, + 633, + 1384, + 633, + 1410, + 610, + 1410 + ], + "score": 0.75, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 744, + 1383, + 768, + 1383, + 768, + 1410, + 744, + 1410 + ], + "score": 0.74, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 1082, + 1383, + 1106, + 1383, + 1106, + 1410, + 1082, + 1410 + ], + "score": 0.63, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 904, + 1383, + 1048, + 1383, + 1048, + 1417, + 904, + 1417 + ], + "score": 0.49, + "latex": "O m n g l o t _ { b g }" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 249.0, + 1404.0, + 249.0, + 1404.0, + 284.0, + 295.0, + 284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 281.0, + 1257.0, + 281.0, + 1257.0, + 312.0, + 296.0, + 312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1265.0, + 880.0, + 1265.0, + 880.0, + 1303.0, + 294.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 750.0, + 729.0, + 750.0, + 729.0, + 786.0, + 295.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1576.0, + 772.0, + 1576.0, + 772.0, + 1623.0, + 292.0, + 1623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2084.0, + 868.0, + 2084.0, + 868.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 803.0, + 905.0, + 803.0, + 905.0, + 841.0, + 293.0, + 841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 994.0, + 803.0, + 1405.0, + 803.0, + 1405.0, + 841.0, + 994.0, + 841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 835.0, + 1056.0, + 835.0, + 1056.0, + 871.0, + 295.0, + 871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 835.0, + 1405.0, + 835.0, + 1405.0, + 871.0, + 1133.0, + 871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 864.0, + 605.0, + 864.0, + 605.0, + 903.0, + 292.0, + 903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 864.0, + 1407.0, + 864.0, + 1407.0, + 903.0, + 685.0, + 903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 896.0, + 1303.0, + 896.0, + 1303.0, + 935.0, + 292.0, + 935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1397.0, + 896.0, + 1408.0, + 896.0, + 1408.0, + 935.0, + 1397.0, + 935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 928.0, + 575.0, + 928.0, + 575.0, + 963.0, + 295.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 928.0, + 1079.0, + 928.0, + 1079.0, + 963.0, + 667.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 928.0, + 1407.0, + 928.0, + 1407.0, + 963.0, + 1176.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 956.0, + 1406.0, + 956.0, + 1406.0, + 992.0, + 293.0, + 992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 987.0, + 1407.0, + 987.0, + 1407.0, + 1024.0, + 293.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1018.0, + 1239.0, + 1018.0, + 1239.0, + 1053.0, + 295.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1317.0, + 1018.0, + 1326.0, + 1018.0, + 1326.0, + 1053.0, + 1317.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1404.0, + 1018.0, + 1407.0, + 1018.0, + 1407.0, + 1053.0, + 1404.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1047.0, + 344.0, + 1047.0, + 344.0, + 1086.0, + 293.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 1047.0, + 590.0, + 1047.0, + 590.0, + 1086.0, + 402.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 1047.0, + 717.0, + 1047.0, + 717.0, + 1086.0, + 667.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 803.0, + 1047.0, + 1344.0, + 1047.0, + 1344.0, + 1086.0, + 803.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1371.0, + 1047.0, + 1407.0, + 1047.0, + 1407.0, + 1086.0, + 1371.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1077.0, + 712.0, + 1077.0, + 712.0, + 1115.0, + 293.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 1077.0, + 1405.0, + 1077.0, + 1405.0, + 1115.0, + 739.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1110.0, + 1405.0, + 1110.0, + 1405.0, + 1145.0, + 293.0, + 1145.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1140.0, + 707.0, + 1140.0, + 707.0, + 1176.0, + 292.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 1140.0, + 1406.0, + 1140.0, + 1406.0, + 1176.0, + 734.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1171.0, + 820.0, + 1171.0, + 820.0, + 1207.0, + 295.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 1171.0, + 1405.0, + 1171.0, + 1405.0, + 1207.0, + 909.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1202.0, + 547.0, + 1202.0, + 547.0, + 1237.0, + 293.0, + 1237.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1652.0, + 1405.0, + 1652.0, + 1405.0, + 1685.0, + 295.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1682.0, + 1405.0, + 1682.0, + 1405.0, + 1715.0, + 295.0, + 1715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1713.0, + 1405.0, + 1713.0, + 1405.0, + 1747.0, + 295.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1742.0, + 1407.0, + 1742.0, + 1407.0, + 1778.0, + 292.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1771.0, + 1406.0, + 1771.0, + 1406.0, + 1811.0, + 292.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1804.0, + 1405.0, + 1804.0, + 1405.0, + 1838.0, + 295.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1834.0, + 1403.0, + 1834.0, + 1403.0, + 1868.0, + 295.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1864.0, + 805.0, + 1864.0, + 805.0, + 1898.0, + 296.0, + 1898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1321.0, + 548.0, + 1321.0, + 548.0, + 1355.0, + 295.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 1321.0, + 1405.0, + 1321.0, + 1405.0, + 1355.0, + 625.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1351.0, + 965.0, + 1351.0, + 965.0, + 1386.0, + 294.0, + 1386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 996.0, + 1351.0, + 1404.0, + 1351.0, + 1404.0, + 1386.0, + 996.0, + 1386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1382.0, + 609.0, + 1382.0, + 609.0, + 1417.0, + 295.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 1382.0, + 743.0, + 1382.0, + 743.0, + 1417.0, + 634.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 1382.0, + 903.0, + 1382.0, + 903.0, + 1417.0, + 769.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 1382.0, + 1081.0, + 1382.0, + 1081.0, + 1417.0, + 1049.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1107.0, + 1382.0, + 1402.0, + 1382.0, + 1402.0, + 1417.0, + 1107.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1413.0, + 1402.0, + 1413.0, + 1402.0, + 1448.0, + 294.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1443.0, + 546.0, + 1443.0, + 546.0, + 1479.0, + 291.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 624.0, + 1443.0, + 1406.0, + 1443.0, + 1406.0, + 1479.0, + 624.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 1474.0, + 905.0, + 1474.0, + 905.0, + 1508.0, + 383.0, + 1508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 1474.0, + 1405.0, + 1474.0, + 1405.0, + 1508.0, + 997.0, + 1508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1506.0, + 810.0, + 1506.0, + 810.0, + 1539.0, + 293.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1912.0, + 1404.0, + 1912.0, + 1404.0, + 1945.0, + 295.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 1403.0, + 1942.0, + 1403.0, + 1975.0, + 294.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1971.0, + 1406.0, + 1971.0, + 1406.0, + 2007.0, + 294.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2003.0, + 1406.0, + 2003.0, + 1406.0, + 2035.0, + 294.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 623.0, + 1165.0, + 623.0, + 1165.0, + 658.0, + 293.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 623.0, + 1405.0, + 623.0, + 1405.0, + 658.0, + 1268.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 653.0, + 1405.0, + 653.0, + 1405.0, + 689.0, + 294.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 682.0, + 1159.0, + 682.0, + 1159.0, + 722.0, + 292.0, + 722.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 230, + 1402, + 230, + 1402, + 323, + 299, + 323 + ], + "score": 0.948 + }, + { + "category_id": 1, + "poly": [ + 299, + 413, + 1400, + 413, + 1400, + 474, + 299, + 474 + ], + "score": 0.925 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.889 + }, + { + "category_id": 1, + "poly": [ + 296, + 575, + 1402, + 575, + 1402, + 639, + 296, + 639 + ], + "score": 0.874 + }, + { + "category_id": 1, + "poly": [ + 300, + 1359, + 1403, + 1359, + 1403, + 1453, + 300, + 1453 + ], + "score": 0.852 + }, + { + "category_id": 1, + "poly": [ + 293, + 1476, + 1388, + 1476, + 1388, + 1512, + 293, + 1512 + ], + "score": 0.814 + }, + { + "category_id": 0, + "poly": [ + 299, + 523, + 489, + 523, + 489, + 558, + 299, + 558 + ], + "score": 0.81 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 861, + 2088, + 861, + 2113, + 835, + 2113 + ], + "score": 0.808 + }, + { + "category_id": 1, + "poly": [ + 299, + 1736, + 1403, + 1736, + 1403, + 1831, + 299, + 1831 + ], + "score": 0.791 + }, + { + "category_id": 1, + "poly": [ + 296, + 1649, + 1402, + 1649, + 1402, + 1716, + 296, + 1716 + ], + "score": 0.791 + }, + { + "category_id": 1, + "poly": [ + 294, + 778, + 1401, + 778, + 1401, + 844, + 294, + 844 + ], + "score": 0.774 + }, + { + "category_id": 1, + "poly": [ + 297, + 1099, + 1401, + 1099, + 1401, + 1165, + 297, + 1165 + ], + "score": 0.77 + }, + { + "category_id": 1, + "poly": [ + 293, + 1272, + 1402, + 1272, + 1402, + 1337, + 293, + 1337 + ], + "score": 0.765 + }, + { + "category_id": 1, + "poly": [ + 297, + 661, + 1407, + 661, + 1407, + 754, + 297, + 754 + ], + "score": 0.764 + }, + { + "category_id": 1, + "poly": [ + 297, + 1185, + 1406, + 1185, + 1406, + 1252, + 297, + 1252 + ], + "score": 0.754 + }, + { + "category_id": 1, + "poly": [ + 302, + 864, + 1401, + 864, + 1401, + 960, + 302, + 960 + ], + "score": 0.743 + }, + { + "category_id": 1, + "poly": [ + 297, + 1532, + 1406, + 1532, + 1406, + 1627, + 297, + 1627 + ], + "score": 0.719 + }, + { + "category_id": 1, + "poly": [ + 297, + 1971, + 1400, + 1971, + 1400, + 2034, + 297, + 2034 + ], + "score": 0.687 + }, + { + "category_id": 1, + "poly": [ + 300, + 1854, + 1402, + 1854, + 1402, + 1949, + 300, + 1949 + ], + "score": 0.662 + }, + { + "category_id": 0, + "poly": [ + 300, + 360, + 558, + 360, + 558, + 390, + 300, + 390 + ], + "score": 0.64 + }, + { + "category_id": 1, + "poly": [ + 297, + 980, + 1407, + 980, + 1407, + 1077, + 297, + 1077 + ], + "score": 0.612 + }, + { + "category_id": 1, + "poly": [ + 300, + 360, + 558, + 360, + 558, + 390, + 300, + 390 + ], + "score": 0.257 + }, + { + "category_id": 1, + "poly": [ + 299, + 523, + 489, + 523, + 489, + 558, + 299, + 558 + ], + "score": 0.092 + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 526.0, + 490.0, + 526.0, + 490.0, + 559.0, + 297.0, + 559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 867.0, + 2085.0, + 867.0, + 2125.0, + 831.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 362.0, + 558.0, + 362.0, + 558.0, + 391.0, + 299.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 229.0, + 1404.0, + 229.0, + 1404.0, + 264.0, + 294.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 261.0, + 1404.0, + 261.0, + 1404.0, + 295.0, + 294.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 291.0, + 368.0, + 291.0, + 368.0, + 324.0, + 293.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 410.0, + 1405.0, + 410.0, + 1405.0, + 450.0, + 293.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 443.0, + 483.0, + 443.0, + 483.0, + 476.0, + 294.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 570.0, + 1406.0, + 570.0, + 1406.0, + 616.0, + 293.0, + 616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 607.0, + 1021.0, + 607.0, + 1021.0, + 639.0, + 323.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1360.0, + 1407.0, + 1360.0, + 1407.0, + 1398.0, + 296.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1391.0, + 1409.0, + 1391.0, + 1409.0, + 1425.0, + 323.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1418.0, + 398.0, + 1418.0, + 398.0, + 1455.0, + 319.0, + 1455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1476.0, + 1392.0, + 1476.0, + 1392.0, + 1515.0, + 295.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1736.0, + 1407.0, + 1736.0, + 1407.0, + 1774.0, + 293.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1765.0, + 1409.0, + 1765.0, + 1409.0, + 1805.0, + 321.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1799.0, + 678.0, + 1799.0, + 678.0, + 1833.0, + 324.0, + 1833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1650.0, + 1404.0, + 1650.0, + 1404.0, + 1686.0, + 295.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1681.0, + 898.0, + 1681.0, + 898.0, + 1716.0, + 320.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 777.0, + 1404.0, + 777.0, + 1404.0, + 815.0, + 296.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 810.0, + 1389.0, + 810.0, + 1389.0, + 845.0, + 322.0, + 845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1101.0, + 1403.0, + 1101.0, + 1403.0, + 1137.0, + 296.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1132.0, + 1036.0, + 1132.0, + 1036.0, + 1164.0, + 324.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1271.0, + 1405.0, + 1271.0, + 1405.0, + 1311.0, + 293.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1303.0, + 675.0, + 1303.0, + 675.0, + 1339.0, + 320.0, + 1339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 663.0, + 1404.0, + 663.0, + 1404.0, + 697.0, + 296.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 691.0, + 1409.0, + 691.0, + 1409.0, + 729.0, + 320.0, + 729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 718.0, + 399.0, + 718.0, + 399.0, + 759.0, + 320.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1187.0, + 1407.0, + 1187.0, + 1407.0, + 1220.0, + 296.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1217.0, + 1359.0, + 1217.0, + 1359.0, + 1252.0, + 321.0, + 1252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 864.0, + 1405.0, + 864.0, + 1405.0, + 901.0, + 294.0, + 901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 897.0, + 1405.0, + 897.0, + 1405.0, + 932.0, + 323.0, + 932.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 927.0, + 668.0, + 927.0, + 668.0, + 961.0, + 322.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1533.0, + 1404.0, + 1533.0, + 1404.0, + 1567.0, + 295.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1561.0, + 1411.0, + 1561.0, + 1411.0, + 1603.0, + 319.0, + 1603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1593.0, + 581.0, + 1593.0, + 581.0, + 1627.0, + 323.0, + 1627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1969.0, + 1404.0, + 1969.0, + 1404.0, + 2006.0, + 293.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 2000.0, + 1399.0, + 2000.0, + 1399.0, + 2036.0, + 323.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1852.0, + 1406.0, + 1852.0, + 1406.0, + 1892.0, + 295.0, + 1892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1884.0, + 1407.0, + 1884.0, + 1407.0, + 1922.0, + 321.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1915.0, + 990.0, + 1915.0, + 990.0, + 1951.0, + 320.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 979.0, + 1408.0, + 979.0, + 1408.0, + 1020.0, + 294.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1015.0, + 1405.0, + 1015.0, + 1405.0, + 1049.0, + 325.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1043.0, + 1134.0, + 1043.0, + 1134.0, + 1081.0, + 324.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 362.0, + 558.0, + 362.0, + 558.0, + 391.0, + 299.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 526.0, + 490.0, + 526.0, + 490.0, + 559.0, + 297.0, + 559.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 229, + 1403, + 229, + 1403, + 323, + 298, + 323 + ], + "score": 0.888 + }, + { + "category_id": 1, + "poly": [ + 300, + 749, + 1405, + 749, + 1405, + 843, + 300, + 843 + ], + "score": 0.886 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.886 + }, + { + "category_id": 1, + "poly": [ + 303, + 422, + 1403, + 422, + 1403, + 515, + 303, + 515 + ], + "score": 0.879 + }, + { + "category_id": 1, + "poly": [ + 296, + 340, + 1403, + 340, + 1403, + 405, + 296, + 405 + ], + "score": 0.876 + }, + { + "category_id": 1, + "poly": [ + 300, + 616, + 1402, + 616, + 1402, + 681, + 300, + 681 + ], + "score": 0.864 + }, + { + "category_id": 1, + "poly": [ + 297, + 535, + 1404, + 535, + 1404, + 599, + 297, + 599 + ], + "score": 0.856 + }, + { + "category_id": 1, + "poly": [ + 298, + 698, + 989, + 698, + 989, + 732, + 298, + 732 + ], + "score": 0.845 + }, + { + "category_id": 1, + "poly": [ + 300, + 1165, + 1403, + 1165, + 1403, + 1261, + 300, + 1261 + ], + "score": 0.837 + }, + { + "category_id": 1, + "poly": [ + 301, + 860, + 1402, + 860, + 1402, + 957, + 301, + 957 + ], + "score": 0.837 + }, + { + "category_id": 1, + "poly": [ + 300, + 1360, + 1403, + 1360, + 1403, + 1455, + 300, + 1455 + ], + "score": 0.828 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 864, + 2088, + 864, + 2113, + 835, + 2113 + ], + "score": 0.827 + }, + { + "category_id": 1, + "poly": [ + 299, + 1552, + 1402, + 1552, + 1402, + 1648, + 299, + 1648 + ], + "score": 0.822 + }, + { + "category_id": 1, + "poly": [ + 290, + 1471, + 1404, + 1471, + 1404, + 1535, + 290, + 1535 + ], + "score": 0.821 + }, + { + "category_id": 1, + "poly": [ + 302, + 1665, + 1399, + 1665, + 1399, + 1731, + 302, + 1731 + ], + "score": 0.817 + }, + { + "category_id": 1, + "poly": [ + 300, + 1053, + 1402, + 1053, + 1402, + 1150, + 300, + 1150 + ], + "score": 0.789 + }, + { + "category_id": 1, + "poly": [ + 294, + 1277, + 1403, + 1277, + 1403, + 1343, + 294, + 1343 + ], + "score": 0.781 + }, + { + "category_id": 1, + "poly": [ + 298, + 1971, + 1402, + 1971, + 1402, + 2035, + 298, + 2035 + ], + "score": 0.779 + }, + { + "category_id": 1, + "poly": [ + 295, + 972, + 1401, + 972, + 1401, + 1038, + 295, + 1038 + ], + "score": 0.772 + }, + { + "category_id": 1, + "poly": [ + 296, + 1747, + 1404, + 1747, + 1404, + 1843, + 296, + 1843 + ], + "score": 0.722 + }, + { + "category_id": 1, + "poly": [ + 298, + 1859, + 1403, + 1859, + 1403, + 1953, + 298, + 1953 + ], + "score": 0.672 + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 225.0, + 1405.0, + 225.0, + 1405.0, + 270.0, + 293.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 260.0, + 1408.0, + 260.0, + 1408.0, + 297.0, + 321.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 291.0, + 547.0, + 291.0, + 547.0, + 324.0, + 319.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 750.0, + 1404.0, + 750.0, + 1404.0, + 784.0, + 294.0, + 784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 780.0, + 1410.0, + 780.0, + 1410.0, + 817.0, + 319.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 811.0, + 587.0, + 811.0, + 587.0, + 844.0, + 319.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 421.0, + 1404.0, + 421.0, + 1404.0, + 461.0, + 297.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 453.0, + 1407.0, + 453.0, + 1407.0, + 489.0, + 319.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 479.0, + 399.0, + 479.0, + 399.0, + 520.0, + 320.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 339.0, + 1405.0, + 339.0, + 1405.0, + 378.0, + 296.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 371.0, + 516.0, + 371.0, + 516.0, + 407.0, + 321.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 611.0, + 1406.0, + 611.0, + 1406.0, + 656.0, + 293.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 649.0, + 1215.0, + 649.0, + 1215.0, + 682.0, + 323.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 535.0, + 1405.0, + 535.0, + 1405.0, + 571.0, + 297.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 567.0, + 1013.0, + 567.0, + 1013.0, + 600.0, + 322.0, + 600.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 695.0, + 990.0, + 695.0, + 990.0, + 736.0, + 295.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1166.0, + 1405.0, + 1166.0, + 1405.0, + 1201.0, + 295.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1198.0, + 1408.0, + 1198.0, + 1408.0, + 1233.0, + 321.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1228.0, + 783.0, + 1228.0, + 783.0, + 1261.0, + 320.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 859.0, + 1406.0, + 859.0, + 1406.0, + 900.0, + 294.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 890.0, + 1406.0, + 890.0, + 1406.0, + 929.0, + 320.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 923.0, + 1135.0, + 923.0, + 1135.0, + 958.0, + 322.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1360.0, + 1407.0, + 1360.0, + 1407.0, + 1398.0, + 295.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1389.0, + 1407.0, + 1389.0, + 1407.0, + 1425.0, + 321.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1421.0, + 988.0, + 1421.0, + 988.0, + 1459.0, + 323.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1550.0, + 1407.0, + 1550.0, + 1407.0, + 1594.0, + 294.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1584.0, + 1404.0, + 1584.0, + 1404.0, + 1621.0, + 322.0, + 1621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1615.0, + 1185.0, + 1615.0, + 1185.0, + 1653.0, + 323.0, + 1653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1468.0, + 1408.0, + 1468.0, + 1408.0, + 1509.0, + 293.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1503.0, + 615.0, + 1503.0, + 615.0, + 1536.0, + 322.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1666.0, + 1404.0, + 1666.0, + 1404.0, + 1702.0, + 296.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1697.0, + 1196.0, + 1697.0, + 1196.0, + 1733.0, + 323.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1053.0, + 1407.0, + 1053.0, + 1407.0, + 1092.0, + 295.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1083.0, + 1408.0, + 1083.0, + 1408.0, + 1125.0, + 320.0, + 1125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1116.0, + 1199.0, + 1116.0, + 1199.0, + 1151.0, + 323.0, + 1151.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1272.0, + 1406.0, + 1272.0, + 1406.0, + 1318.0, + 294.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1310.0, + 1063.0, + 1310.0, + 1063.0, + 1344.0, + 323.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1971.0, + 1407.0, + 1971.0, + 1407.0, + 2007.0, + 296.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 2003.0, + 1280.0, + 2003.0, + 1280.0, + 2036.0, + 322.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 971.0, + 1405.0, + 971.0, + 1405.0, + 1010.0, + 294.0, + 1010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1005.0, + 1376.0, + 1005.0, + 1376.0, + 1037.0, + 324.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1745.0, + 1405.0, + 1745.0, + 1405.0, + 1785.0, + 294.0, + 1785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1778.0, + 1407.0, + 1778.0, + 1407.0, + 1815.0, + 322.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1810.0, + 1200.0, + 1810.0, + 1200.0, + 1844.0, + 323.0, + 1844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1856.0, + 1408.0, + 1856.0, + 1408.0, + 1898.0, + 295.0, + 1898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1888.0, + 1404.0, + 1888.0, + 1404.0, + 1928.0, + 321.0, + 1928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1922.0, + 674.0, + 1922.0, + 674.0, + 1956.0, + 323.0, + 1956.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.887 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 863, + 2088, + 863, + 2112, + 835, + 2112 + ], + "score": 0.831 + }, + { + "category_id": 1, + "poly": [ + 294, + 984, + 1400, + 984, + 1400, + 1049, + 294, + 1049 + ], + "score": 0.695 + }, + { + "category_id": 1, + "poly": [ + 299, + 1181, + 1407, + 1181, + 1407, + 1275, + 299, + 1275 + ], + "score": 0.661 + }, + { + "category_id": 1, + "poly": [ + 294, + 228, + 1404, + 228, + 1404, + 294, + 294, + 294 + ], + "score": 0.648 + }, + { + "category_id": 1, + "poly": [ + 295, + 870, + 1402, + 870, + 1402, + 966, + 295, + 966 + ], + "score": 0.573 + }, + { + "category_id": 1, + "poly": [ + 296, + 674, + 1401, + 674, + 1401, + 740, + 296, + 740 + ], + "score": 0.542 + }, + { + "category_id": 1, + "poly": [ + 298, + 757, + 1402, + 757, + 1402, + 852, + 298, + 852 + ], + "score": 0.541 + }, + { + "category_id": 1, + "poly": [ + 298, + 311, + 1400, + 311, + 1400, + 377, + 298, + 377 + ], + "score": 0.521 + }, + { + "category_id": 1, + "poly": [ + 294, + 591, + 1405, + 591, + 1405, + 656, + 294, + 656 + ], + "score": 0.496 + }, + { + "category_id": 1, + "poly": [ + 298, + 1067, + 1406, + 1067, + 1406, + 1162, + 298, + 1162 + ], + "score": 0.481 + }, + { + "category_id": 1, + "poly": [ + 296, + 394, + 1401, + 394, + 1401, + 460, + 296, + 460 + ], + "score": 0.479 + }, + { + "category_id": 1, + "poly": [ + 302, + 477, + 1403, + 477, + 1403, + 573, + 302, + 573 + ], + "score": 0.466 + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2084.0, + 868.0, + 2084.0, + 868.0, + 2123.0, + 831.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 980.0, + 1405.0, + 980.0, + 1405.0, + 1024.0, + 293.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1017.0, + 597.0, + 1017.0, + 597.0, + 1046.0, + 322.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1178.0, + 1408.0, + 1178.0, + 1408.0, + 1220.0, + 294.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1211.0, + 1408.0, + 1211.0, + 1408.0, + 1247.0, + 321.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1240.0, + 399.0, + 1240.0, + 399.0, + 1277.0, + 319.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 229.0, + 1404.0, + 229.0, + 1404.0, + 265.0, + 296.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 260.0, + 467.0, + 260.0, + 467.0, + 293.0, + 318.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 870.0, + 1405.0, + 870.0, + 1405.0, + 908.0, + 295.0, + 908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 902.0, + 1407.0, + 902.0, + 1407.0, + 939.0, + 322.0, + 939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 934.0, + 533.0, + 934.0, + 533.0, + 965.0, + 323.0, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 676.0, + 1405.0, + 676.0, + 1405.0, + 712.0, + 295.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 706.0, + 959.0, + 706.0, + 959.0, + 741.0, + 321.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 756.0, + 1403.0, + 756.0, + 1403.0, + 795.0, + 294.0, + 795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 787.0, + 1406.0, + 787.0, + 1406.0, + 828.0, + 322.0, + 828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 822.0, + 644.0, + 822.0, + 644.0, + 853.0, + 322.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 313.0, + 1405.0, + 313.0, + 1405.0, + 349.0, + 296.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 343.0, + 1163.0, + 343.0, + 1163.0, + 379.0, + 322.0, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 590.0, + 1410.0, + 590.0, + 1410.0, + 630.0, + 294.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 624.0, + 791.0, + 624.0, + 791.0, + 657.0, + 321.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1067.0, + 1408.0, + 1067.0, + 1408.0, + 1105.0, + 295.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1100.0, + 1408.0, + 1100.0, + 1408.0, + 1134.0, + 322.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1130.0, + 575.0, + 1130.0, + 575.0, + 1162.0, + 321.0, + 1162.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 395.0, + 1405.0, + 395.0, + 1405.0, + 431.0, + 295.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 427.0, + 1128.0, + 427.0, + 1128.0, + 461.0, + 323.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 478.0, + 1404.0, + 478.0, + 1404.0, + 513.0, + 298.0, + 513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 512.0, + 1404.0, + 512.0, + 1404.0, + 545.0, + 322.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 542.0, + 715.0, + 542.0, + 715.0, + 574.0, + 322.0, + 574.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 333, + 557, + 1367, + 557, + 1367, + 906, + 333, + 906 + ], + "score": 0.983, + "html": "
SchemeCross-Task TransferCross-Domain Transfer
Experiment SectionOmniglot 5.1.1ImageNet 5.1.3Office-31 5.2.1SVHN-MNIST 5.2.3
DatasetsAOmniglotbgImageNet882ImageNet1000Omniglotbg
S’Office-31 {a,d,w}SVHN
TOmniglotevalImageNet118Office-31 {a,d,w)MNIST
Network InitializationGImageNet882ImageNet10001
CCN*ImageNet882ImageNet10001
" + }, + { + "category_id": 5, + "poly": [ + 674, + 1099, + 1024, + 1099, + 1024, + 1285, + 674, + 1285 + ], + "score": 0.971, + "html": "
LCOCEDA
G√
CCN
CCN+广√
CCN++√√
" + }, + { + "category_id": 6, + "poly": [ + 297, + 401, + 1404, + 401, + 1404, + 556, + 297, + 556 + ], + "score": 0.953 + }, + { + "category_id": 6, + "poly": [ + 296, + 973, + 1405, + 973, + 1405, + 1097, + 296, + 1097 + ], + "score": 0.911 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 815, + 75, + 815, + 105, + 299, + 105 + ], + "score": 0.898 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 864, + 2088, + 864, + 2112, + 835, + 2112 + ], + "score": 0.846 + }, + { + "category_id": 0, + "poly": [ + 300, + 302, + 975, + 302, + 975, + 336, + 300, + 336 + ], + "score": 0.832 + }, + { + "category_id": 0, + "poly": [ + 301, + 227, + 483, + 227, + 483, + 262, + 301, + 262 + ], + "score": 0.545 + }, + { + "category_id": 1, + "poly": [ + 301, + 227, + 483, + 227, + 483, + 262, + 301, + 262 + ], + "score": 0.348 + }, + { + "category_id": 13, + "poly": [ + 434, + 464, + 533, + 464, + 533, + 493, + 434, + 493 + ], + "score": 0.88, + "latex": "\\mathrm { C C N ^ { + / + + } }" + }, + { + "category_id": 13, + "poly": [ + 466, + 432, + 538, + 432, + 538, + 461, + 466, + 461 + ], + "score": 0.87, + "latex": "\\mathbf { C C N } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 693, + 1035, + 781, + 1035, + 781, + 1066, + 693, + 1066 + ], + "score": 0.81, + "latex": "( \\mathbf { C C N } ^ { * } )" + }, + { + "category_id": 13, + "poly": [ + 1027, + 432, + 1099, + 432, + 1099, + 463, + 1027, + 463 + ], + "score": 0.76, + "latex": "\\mathbf { C C N } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 416, + 1006, + 442, + 1006, + 442, + 1033, + 416, + 1033 + ], + "score": 0.75, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 972, + 404, + 998, + 404, + 998, + 432, + 972, + 432 + ], + "score": 0.7, + "latex": "G" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 403.0, + 971.0, + 403.0, + 971.0, + 436.0, + 295.0, + 436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 999.0, + 403.0, + 1404.0, + 403.0, + 1404.0, + 436.0, + 999.0, + 436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 432.0, + 465.0, + 432.0, + 465.0, + 467.0, + 295.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 539.0, + 432.0, + 1026.0, + 432.0, + 1026.0, + 467.0, + 539.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 432.0, + 1405.0, + 432.0, + 1405.0, + 467.0, + 1100.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 459.0, + 433.0, + 459.0, + 433.0, + 500.0, + 294.0, + 500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 534.0, + 459.0, + 1407.0, + 459.0, + 1407.0, + 500.0, + 534.0, + 500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 492.0, + 1404.0, + 492.0, + 1404.0, + 530.0, + 294.0, + 530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 525.0, + 838.0, + 525.0, + 838.0, + 558.0, + 295.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 973.0, + 1403.0, + 973.0, + 1403.0, + 1008.0, + 293.0, + 1008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1001.0, + 415.0, + 1001.0, + 415.0, + 1041.0, + 293.0, + 1041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 443.0, + 1001.0, + 1405.0, + 1001.0, + 1405.0, + 1041.0, + 443.0, + 1041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1034.0, + 692.0, + 1034.0, + 692.0, + 1072.0, + 293.0, + 1072.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 782.0, + 1034.0, + 1405.0, + 1034.0, + 1405.0, + 1072.0, + 782.0, + 1072.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1065.0, + 1034.0, + 1065.0, + 1034.0, + 1101.0, + 295.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 818.0, + 73.0, + 818.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2084.0, + 869.0, + 2084.0, + 869.0, + 2123.0, + 831.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 298.0, + 979.0, + 298.0, + 979.0, + 342.0, + 293.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 227.0, + 485.0, + 227.0, + 485.0, + 268.0, + 297.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 227.0, + 485.0, + 227.0, + 485.0, + 268.0, + 297.0, + 268.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 320, + 748, + 1405, + 748, + 1405, + 1317, + 320, + 1317 + ], + "score": 0.97 + }, + { + "category_id": 3, + "poly": [ + 310, + 223, + 1407, + 223, + 1407, + 520, + 310, + 520 + ], + "score": 0.967 + }, + { + "category_id": 4, + "poly": [ + 296, + 558, + 1407, + 558, + 1407, + 683, + 296, + 683 + ], + "score": 0.918 + }, + { + "category_id": 4, + "poly": [ + 295, + 1363, + 1406, + 1363, + 1406, + 1458, + 295, + 1458 + ], + "score": 0.903 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 814, + 76, + 814, + 104, + 299, + 104 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 863, + 2088, + 863, + 2113, + 835, + 2113 + ], + "score": 0.845 + }, + { + "category_id": 1, + "poly": [ + 295, + 1363, + 1406, + 1363, + 1406, + 1458, + 295, + 1458 + ], + "score": 0.106 + }, + { + "category_id": 13, + "poly": [ + 417, + 592, + 442, + 592, + 442, + 624, + 417, + 624 + ], + "score": 0.41, + "latex": "b g" + }, + { + "category_id": 13, + "poly": [ + 702, + 590, + 867, + 590, + 867, + 621, + 702, + 621 + ], + "score": 0.32, + "latex": "I m a g e N e t _ { 8 8 2 }" + }, + { + "category_id": 13, + "poly": [ + 477, + 591, + 640, + 591, + 640, + 621, + 477, + 621 + ], + "score": 0.26, + "latex": "O m n i g l o t _ { e v a l }" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 748.0, + 361.0, + 748.0, + 361.0, + 783.0, + 322.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 595.0, + 761.0, + 665.0, + 761.0, + 665.0, + 785.0, + 595.0, + 785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 779.0, + 686.0, + 779.0, + 686.0, + 806.0, + 576.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 572.0, + 793.0, + 690.0, + 793.0, + 690.0, + 831.0, + 572.0, + 831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 795.0, + 1393.0, + 795.0, + 1393.0, + 819.0, + 1246.0, + 819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 775.0, + 810.0, + 921.0, + 810.0, + 921.0, + 837.0, + 775.0, + 837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 811.0, + 1409.0, + 811.0, + 1409.0, + 842.0, + 1241.0, + 842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 775.0, + 832.0, + 900.0, + 832.0, + 900.0, + 855.0, + 775.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 828.0, + 1321.0, + 828.0, + 1321.0, + 862.0, + 1241.0, + 862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 595.0, + 850.0, + 667.0, + 850.0, + 667.0, + 879.0, + 595.0, + 879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 870.0, + 691.0, + 870.0, + 691.0, + 916.0, + 570.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1218.0, + 880.0, + 1266.0, + 880.0, + 1266.0, + 908.0, + 1218.0, + 908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 901.0, + 817.0, + 901.0, + 817.0, + 946.0, + 734.0, + 946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 901.0, + 981.0, + 901.0, + 981.0, + 944.0, + 865.0, + 944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 907.0, + 1112.0, + 907.0, + 1112.0, + 935.0, + 1033.0, + 935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 938.0, + 688.0, + 938.0, + 688.0, + 983.0, + 574.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1165.0, + 944.0, + 1319.0, + 944.0, + 1319.0, + 975.0, + 1165.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 587.0, + 976.0, + 672.0, + 976.0, + 672.0, + 1001.0, + 587.0, + 1001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1023.0, + 360.0, + 1023.0, + 360.0, + 1056.0, + 322.0, + 1056.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 595.0, + 1037.0, + 665.0, + 1037.0, + 665.0, + 1062.0, + 595.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 1055.0, + 686.0, + 1055.0, + 686.0, + 1082.0, + 576.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 572.0, + 1071.0, + 690.0, + 1071.0, + 690.0, + 1109.0, + 572.0, + 1109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 775.0, + 1088.0, + 921.0, + 1088.0, + 921.0, + 1115.0, + 775.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 775.0, + 1109.0, + 900.0, + 1109.0, + 900.0, + 1132.0, + 775.0, + 1132.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 1130.0, + 665.0, + 1130.0, + 665.0, + 1154.0, + 596.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1146.0, + 691.0, + 1146.0, + 691.0, + 1173.0, + 570.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 1168.0, + 671.0, + 1168.0, + 671.0, + 1192.0, + 591.0, + 1192.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 732.0, + 1172.0, + 818.0, + 1172.0, + 818.0, + 1222.0, + 732.0, + 1222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1176.0, + 981.0, + 1176.0, + 981.0, + 1220.0, + 865.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 1186.0, + 1108.0, + 1186.0, + 1108.0, + 1211.0, + 1033.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1165.0, + 1182.0, + 1319.0, + 1182.0, + 1319.0, + 1213.0, + 1165.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 1215.0, + 672.0, + 1215.0, + 672.0, + 1239.0, + 588.0, + 1239.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 1233.0, + 688.0, + 1233.0, + 688.0, + 1260.0, + 575.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 585.0, + 1249.0, + 676.0, + 1249.0, + 676.0, + 1281.0, + 585.0, + 1281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1003.0, + 1264.0, + 1013.0, + 1264.0, + 1013.0, + 1274.0, + 1003.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 1262.0, + 1200.0, + 1262.0, + 1200.0, + 1290.0, + 1033.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 1281.0, + 1193.0, + 1281.0, + 1193.0, + 1311.0, + 1037.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 944.5, + 1138.0, + 944.5, + 1138.0, + 970.5, + 1134.0, + 970.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 213.0, + 517.0, + 213.0, + 517.0, + 270.0, + 314.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 554.0, + 231.0, + 629.0, + 231.0, + 629.0, + 260.0, + 554.0, + 260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 260.0, + 516.0, + 260.0, + 516.0, + 321.0, + 314.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 533.0, + 252.0, + 648.0, + 252.0, + 648.0, + 311.0, + 533.0, + 311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1234.0, + 265.0, + 1410.0, + 265.0, + 1410.0, + 317.0, + 1234.0, + 317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1232.0, + 305.0, + 1316.0, + 305.0, + 1316.0, + 337.0, + 1232.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 698.0, + 376.0, + 788.0, + 376.0, + 788.0, + 409.0, + 698.0, + 409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 379.0, + 936.0, + 379.0, + 936.0, + 407.0, + 862.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1020.0, + 369.0, + 1092.0, + 369.0, + 1092.0, + 402.0, + 1020.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 355.0, + 1261.0, + 355.0, + 1261.0, + 390.0, + 1206.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 409.0, + 521.0, + 409.0, + 521.0, + 457.0, + 306.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 416.0, + 637.0, + 416.0, + 637.0, + 447.0, + 545.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 399.0, + 782.0, + 399.0, + 782.0, + 427.0, + 703.0, + 427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 837.0, + 400.0, + 959.0, + 400.0, + 959.0, + 426.0, + 837.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1014.0, + 393.0, + 1095.0, + 393.0, + 1095.0, + 434.0, + 1014.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 450.0, + 522.0, + 450.0, + 522.0, + 505.0, + 307.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 532.0, + 437.0, + 650.0, + 437.0, + 650.0, + 496.0, + 532.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 526.25, + 298.5, + 657.25, + 298.5, + 657.25, + 335.5, + 526.25, + 335.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 527.0, + 486.0, + 659.0, + 486.0, + 659.0, + 522.5, + 527.0, + 522.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 560.0, + 1408.0, + 560.0, + 1408.0, + 592.0, + 295.0, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 585.0, + 416.0, + 585.0, + 416.0, + 628.0, + 293.0, + 628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 443.0, + 585.0, + 476.0, + 585.0, + 476.0, + 628.0, + 443.0, + 628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 641.0, + 585.0, + 701.0, + 585.0, + 701.0, + 628.0, + 641.0, + 628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 585.0, + 1408.0, + 585.0, + 1408.0, + 628.0, + 868.0, + 628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 621.0, + 1405.0, + 621.0, + 1405.0, + 653.0, + 294.0, + 653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 647.0, + 847.0, + 647.0, + 847.0, + 689.0, + 293.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1363.0, + 1404.0, + 1363.0, + 1404.0, + 1401.0, + 294.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1391.0, + 1406.0, + 1391.0, + 1406.0, + 1431.0, + 293.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1421.0, + 876.0, + 1421.0, + 876.0, + 1463.0, + 294.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 818.0, + 73.0, + 818.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1363.0, + 1404.0, + 1363.0, + 1404.0, + 1401.0, + 294.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1391.0, + 1406.0, + 1391.0, + 1406.0, + 1431.0, + 293.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1421.0, + 876.0, + 1421.0, + 876.0, + 1463.0, + 294.0, + 1463.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 14, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 442, + 1070, + 1259, + 1070, + 1259, + 1786, + 442, + 1786 + ], + "score": 0.983, + "html": "
AlphabetTrue #classSKMSCCN (K=100)
Angelic201626
Atemayar_Qelisayer261734
Atlantean262141
Aurek_Besh261428
Avesta26832
Ge_ez261832
Glagolitic451845
Gurmukhi451243
Kannada411944
Keble261628
Malayalam471247
Manipuri401741
Mongolian302836
Old_Church_Slavonic_Cyrillic452345
Oriya462249
Sylheti281150
Syriac_Serto231938
Tengwar251241
Tibetan421542
ULOG261540
ADif16.36.35
" + }, + { + "category_id": 5, + "poly": [ + 296, + 417, + 1406, + 417, + 1406, + 937, + 296, + 937 + ], + "score": 0.983, + "html": "
AlphabetK-meansLPNMFLSCITMLSKMSSKKmSKLRCSPMPCK-meansCCN
Angelic24%26%27%48%78%40%38%72%50%82%
Atemayar_Qelisayer19%14%17%51%61%51%44%61%50%82%
Atlantean19%15%19%57%72%55%51%77%47%72%
Aurek_Besh23%18%21%45%49%44%45%76%71%90%
Avesta22%18%19%47%29%39%38%65%52%76%
Ge_ez19%17%17%56%58%47%42%72%55%82%
Glagolitic22%19%21%42%38%58%62%66%61%85%
Gurmukhi15%13%15%44%26%54%48%60%56%80%
Kannada18%14%16%48%37%46%53%60%48%62%
Keble20%14%18%44%60%46%44%75%68%90%
Malayalam18%15%16%36%24%49%52%50%54%72%
Manipuri17%15%16%49%40%53%54%66%62%85%
Mongolian18%18%19%50%40%37%48%75%57%86%
Old_Church_Slavonic_Cyrilic19%16%19%42%41%52%67%71%67%94%
Oriya15%13%14%46%40%54%45%57%52%67%
Sylheti14%13%14%49%32%35%37%59%43%64%
Syriac_Serto20%18%19%55%70%42%35%70%47%73%
Tengwar18%18%18%51%44%49%40%61%44%66%
Tibetan18%14%16%44%31%47%54%59%55%84%
ULOG20%18%18%41%41%40%41%56%38%70%
Average19%16%18%47%46%47%47%65%54%78%
" + }, + { + "category_id": 6, + "poly": [ + 296, + 329, + 1406, + 329, + 1406, + 418, + 296, + 418 + ], + "score": 0.967 + }, + { + "category_id": 6, + "poly": [ + 297, + 1006, + 1399, + 1006, + 1399, + 1068, + 297, + 1068 + ], + "score": 0.933 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2113, + 836, + 2113 + ], + "score": 0.854 + }, + { + "category_id": 0, + "poly": [ + 293, + 225, + 1399, + 225, + 1399, + 263, + 293, + 263 + ], + "score": 0.751 + }, + { + "category_id": 13, + "poly": [ + 298, + 391, + 405, + 391, + 405, + 420, + 298, + 420 + ], + "score": 0.88, + "latex": "K = 1 0 0" + }, + { + "category_id": 13, + "poly": [ + 1024, + 1038, + 1098, + 1038, + 1098, + 1070, + 1024, + 1070 + ], + "score": 0.78, + "latex": "A D i f" + }, + { + "category_id": 13, + "poly": [ + 1239, + 1009, + 1283, + 1009, + 1283, + 1038, + 1239, + 1038 + ], + "score": 0.69, + "latex": "e v a l" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 325.0, + 1406.0, + 325.0, + 1406.0, + 365.0, + 291.0, + 365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 358.0, + 1403.0, + 358.0, + 1403.0, + 395.0, + 294.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 390.0, + 1039.0, + 390.0, + 1039.0, + 422.0, + 406.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1005.0, + 1238.0, + 1005.0, + 1238.0, + 1041.0, + 295.0, + 1041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1284.0, + 1005.0, + 1404.0, + 1005.0, + 1404.0, + 1041.0, + 1284.0, + 1041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1037.0, + 1023.0, + 1037.0, + 1023.0, + 1071.0, + 295.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1099.0, + 1037.0, + 1396.0, + 1037.0, + 1396.0, + 1071.0, + 1099.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 222.0, + 1405.0, + 222.0, + 1405.0, + 267.0, + 292.0, + 267.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 15, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 323, + 1691, + 1375, + 1691, + 1375, + 1937, + 323, + 1937 + ], + "score": 0.981, + "html": "
SetSimilar Precision Similar RecallDissimilar PrecisionDissimilar Recall
Random*0.0330.5000.9670.500
Set A0.8400.6640.9830.994
SetB0.8250.6310.9810.993
Set C0.7710.6710.9830.990
Average0.8120.6550.9820.992
" + }, + { + "category_id": 5, + "poly": [ + 485, + 497, + 1215, + 497, + 1215, + 697, + 485, + 697 + ], + "score": 0.979, + "html": "
MethodOmniglot-eval 5-wayMNIST 10-way
Siamese-Nets (Koch et al., 2015)0.96720-way 0.8800.703
Match-Net (Vinyals et al., 2016)0.9810.9380.720
Ours0.9790.9350.720
" + }, + { + "category_id": 5, + "poly": [ + 513, + 1049, + 1185, + 1049, + 1185, + 1249, + 513, + 1249 + ], + "score": 0.977, + "html": "
MethodACCACC(100)NMINMI(100)
K-means71.9%34.5%0.7130.671
LSC73.3%33.5%0.7330.655
LPNMF43.0%21.8%0.5260.500
CCN (ours)73.8%65.2%0.7500.715
" + }, + { + "category_id": 6, + "poly": [ + 300, + 923, + 1405, + 923, + 1405, + 1047, + 300, + 1047 + ], + "score": 0.963 + }, + { + "category_id": 6, + "poly": [ + 297, + 1475, + 1406, + 1475, + 1406, + 1689, + 297, + 1689 + ], + "score": 0.962 + }, + { + "category_id": 6, + "poly": [ + 299, + 340, + 1402, + 340, + 1402, + 494, + 299, + 494 + ], + "score": 0.961 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.905 + }, + { + "category_id": 2, + "poly": [ + 835, + 2087, + 863, + 2087, + 863, + 2113, + 835, + 2113 + ], + "score": 0.86 + }, + { + "category_id": 13, + "poly": [ + 548, + 986, + 660, + 986, + 660, + 1014, + 548, + 1014 + ], + "score": 0.9, + "latex": "K = 1 0 0" + }, + { + "category_id": 13, + "poly": [ + 1239, + 956, + 1332, + 956, + 1332, + 984, + 1239, + 984 + ], + "score": 0.89, + "latex": "K = 3 0" + }, + { + "category_id": 13, + "poly": [ + 1178, + 435, + 1202, + 435, + 1202, + 461, + 1178, + 461 + ], + "score": 0.82, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 509, + 1508, + 674, + 1508, + 674, + 1539, + 509, + 1539 + ], + "score": 0.68, + "latex": "I m a g e N e t _ { 1 1 8 }" + }, + { + "category_id": 13, + "poly": [ + 960, + 1479, + 985, + 1479, + 985, + 1506, + 960, + 1506 + ], + "score": 0.66, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 720, + 404, + 885, + 404, + 885, + 435, + 720, + 435 + ], + "score": 0.57, + "latex": "O m n i g l o t _ { e v a l }" + }, + { + "category_id": 13, + "poly": [ + 417, + 407, + 442, + 407, + 442, + 438, + 417, + 438 + ], + "score": 0.46, + "latex": "b g" + }, + { + "category_id": 13, + "poly": [ + 1176, + 1509, + 1341, + 1509, + 1341, + 1539, + 1176, + 1539 + ], + "score": 0.43, + "latex": "I m a g e N e t _ { 1 1 8 }" + }, + { + "category_id": 13, + "poly": [ + 570, + 956, + 734, + 956, + 734, + 986, + 570, + 986 + ], + "score": 0.34, + "latex": "I m a g e N e t _ { 1 1 8 }" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 924.0, + 1406.0, + 924.0, + 1406.0, + 957.0, + 295.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 956.0, + 569.0, + 956.0, + 569.0, + 989.0, + 295.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 735.0, + 956.0, + 1238.0, + 956.0, + 1238.0, + 989.0, + 735.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 956.0, + 1404.0, + 956.0, + 1404.0, + 989.0, + 1333.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 985.0, + 547.0, + 985.0, + 547.0, + 1020.0, + 294.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 985.0, + 1404.0, + 985.0, + 1404.0, + 1020.0, + 661.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1014.0, + 928.0, + 1014.0, + 928.0, + 1053.0, + 293.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1475.0, + 959.0, + 1475.0, + 959.0, + 1513.0, + 292.0, + 1513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 986.0, + 1475.0, + 1406.0, + 1475.0, + 1406.0, + 1513.0, + 986.0, + 1513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1508.0, + 508.0, + 1508.0, + 508.0, + 1543.0, + 294.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 675.0, + 1508.0, + 1175.0, + 1508.0, + 1175.0, + 1543.0, + 675.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1342.0, + 1508.0, + 1406.0, + 1508.0, + 1406.0, + 1543.0, + 1342.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1537.0, + 1406.0, + 1537.0, + 1406.0, + 1571.0, + 294.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1567.0, + 1408.0, + 1567.0, + 1408.0, + 1604.0, + 291.0, + 1604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1600.0, + 1407.0, + 1600.0, + 1407.0, + 1631.0, + 295.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1630.0, + 1404.0, + 1630.0, + 1404.0, + 1664.0, + 295.0, + 1664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1659.0, + 537.0, + 1659.0, + 537.0, + 1694.0, + 295.0, + 1694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 342.0, + 1403.0, + 342.0, + 1403.0, + 375.0, + 295.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 369.0, + 1406.0, + 369.0, + 1406.0, + 408.0, + 293.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 398.0, + 416.0, + 398.0, + 416.0, + 442.0, + 292.0, + 442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 443.0, + 398.0, + 719.0, + 398.0, + 719.0, + 442.0, + 443.0, + 442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 398.0, + 1407.0, + 398.0, + 1407.0, + 442.0, + 886.0, + 442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 432.0, + 1177.0, + 432.0, + 1177.0, + 469.0, + 295.0, + 469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1203.0, + 432.0, + 1406.0, + 432.0, + 1406.0, + 469.0, + 1203.0, + 469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 466.0, + 694.0, + 466.0, + 694.0, + 499.0, + 295.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2125.0, + 831.0, + 2125.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 16, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 6, + "poly": [ + 297, + 659, + 1404, + 659, + 1404, + 813, + 297, + 813 + ], + "score": 0.983 + }, + { + "category_id": 5, + "poly": [ + 474, + 1483, + 1225, + 1483, + 1225, + 1906, + 474, + 1906 + ], + "score": 0.982, + "html": "
MethodSVHN->MNISTGain
Ganin et al. (2016)Source-Only DANN54.9 73.91 +19.0
Sener et al. (2016)Source-Only LTR54.9 78.81 +23.9
Saito et al. (2017)Source-Only ATDA70.1 86.2- +16.1
Tzeng et al. (2017)Source-Only ADDA60.1 76.0- +15.9
OursSource-Only CCN+52.0 89.11 +37.1
" + }, + { + "category_id": 5, + "poly": [ + 305, + 814, + 1396, + 814, + 1396, + 1031, + 305, + 1031 + ], + "score": 0.979, + "html": "
A→W D→W W→D A→D D→A W→A
AlexNet SO61.695.499.063.851.149.8Avg 70.11
AlexNet (JAN-A)75.296.699.672.857.556.376.3+6.2
Resnet-18 SO66.892.896.867.151.453.071.3+1.2
Resnet-34 SO73.196.498.873.863.262.177.9+7.8
Resnet-50 SO74.396.898.879.561.260.678.5+8.4
" + }, + { + "category_id": 1, + "poly": [ + 297, + 391, + 1405, + 391, + 1405, + 606, + 297, + 606 + ], + "score": 0.979 + }, + { + "category_id": 5, + "poly": [ + 327, + 1165, + 1371, + 1165, + 1371, + 1319, + 327, + 1319 + ], + "score": 0.973, + "html": "
DomainSimilar PrecisionSimilar RecallDissimilar PrecisionDissimilar Recall
Amazon0.1940.6960.9880.894
DSLR0.1960.8820.9950.858
Webcam0.2130.8650.9940.876
" + }, + { + "category_id": 6, + "poly": [ + 298, + 1388, + 1398, + 1388, + 1398, + 1481, + 298, + 1481 + ], + "score": 0.957 + }, + { + "category_id": 6, + "poly": [ + 299, + 1099, + 1396, + 1099, + 1396, + 1163, + 299, + 1163 + ], + "score": 0.949 + }, + { + "category_id": 0, + "poly": [ + 300, + 226, + 1296, + 226, + 1296, + 300, + 300, + 300 + ], + "score": 0.916 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 864, + 2088, + 864, + 2113, + 835, + 2113 + ], + "score": 0.862 + }, + { + "category_id": 0, + "poly": [ + 298, + 334, + 1014, + 334, + 1014, + 367, + 298, + 367 + ], + "score": 0.733 + }, + { + "category_id": 1, + "poly": [ + 298, + 334, + 1014, + 334, + 1014, + 367, + 298, + 367 + ], + "score": 0.187 + }, + { + "category_id": 13, + "poly": [ + 399, + 752, + 428, + 752, + 428, + 780, + 399, + 780 + ], + "score": 0.86, + "latex": "S ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 640, + 722, + 722, + 722, + 722, + 751, + 640, + 751 + ], + "score": 0.85, + "latex": "1 8 { \\sim } 5 0" + }, + { + "category_id": 13, + "poly": [ + 964, + 1102, + 988, + 1102, + 988, + 1129, + 964, + 1129 + ], + "score": 0.61, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 830, + 753, + 854, + 753, + 854, + 779, + 830, + 779 + ], + "score": 0.6, + "latex": "T" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 659.0, + 1406.0, + 659.0, + 1406.0, + 696.0, + 295.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 688.0, + 1404.0, + 688.0, + 1404.0, + 724.0, + 295.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 719.0, + 639.0, + 719.0, + 639.0, + 759.0, + 292.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 723.0, + 719.0, + 1404.0, + 719.0, + 1404.0, + 759.0, + 723.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 747.0, + 398.0, + 747.0, + 398.0, + 792.0, + 291.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 429.0, + 747.0, + 829.0, + 747.0, + 829.0, + 792.0, + 429.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 855.0, + 747.0, + 1406.0, + 747.0, + 1406.0, + 792.0, + 855.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 781.0, + 1298.0, + 781.0, + 1298.0, + 817.0, + 294.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1386.0, + 1404.0, + 1386.0, + 1404.0, + 1425.0, + 292.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1420.0, + 1403.0, + 1420.0, + 1403.0, + 1454.0, + 294.0, + 1454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1449.0, + 998.0, + 1449.0, + 998.0, + 1486.0, + 294.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1099.0, + 963.0, + 1099.0, + 963.0, + 1135.0, + 295.0, + 1135.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 989.0, + 1099.0, + 1402.0, + 1099.0, + 1402.0, + 1135.0, + 989.0, + 1135.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1132.0, + 1385.0, + 1132.0, + 1385.0, + 1164.0, + 296.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 222.0, + 1302.0, + 222.0, + 1302.0, + 265.0, + 292.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 267.0, + 515.0, + 267.0, + 515.0, + 302.0, + 352.0, + 302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2122.0, + 831.0, + 2122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 334.0, + 1017.0, + 334.0, + 1017.0, + 370.0, + 296.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 391.0, + 1406.0, + 391.0, + 1406.0, + 430.0, + 295.0, + 430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 422.0, + 1408.0, + 422.0, + 1408.0, + 459.0, + 292.0, + 459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 452.0, + 1406.0, + 452.0, + 1406.0, + 490.0, + 294.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 481.0, + 1407.0, + 481.0, + 1407.0, + 522.0, + 292.0, + 522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 512.0, + 1405.0, + 512.0, + 1405.0, + 548.0, + 292.0, + 548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 545.0, + 1408.0, + 545.0, + 1408.0, + 580.0, + 295.0, + 580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 575.0, + 1137.0, + 575.0, + 1137.0, + 609.0, + 295.0, + 609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 334.0, + 1017.0, + 334.0, + 1017.0, + 370.0, + 296.0, + 370.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 17, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 802, + 1403, + 802, + 1403, + 1018, + 298, + 1018 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1452, + 1404, + 1452, + 1404, + 1636, + 298, + 1636 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1033, + 1404, + 1033, + 1404, + 1214, + 298, + 1214 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 634, + 1404, + 634, + 1404, + 787, + 298, + 787 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1788, + 1404, + 1788, + 1404, + 2034, + 298, + 2034 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1651, + 1404, + 1651, + 1404, + 1774, + 298, + 1774 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1313, + 1403, + 1313, + 1403, + 1435, + 298, + 1435 + ], + "score": 0.974 + }, + { + "category_id": 5, + "poly": [ + 329, + 314, + 1368, + 314, + 1368, + 438, + 329, + 438 + ], + "score": 0.974, + "html": "
Similar PrecisionSimilar RecallDissimilar PrecisionDissimilar Recall
Random0.1000.5000.9000.500
MNIST0.7820.5090.9460.984
" + }, + { + "category_id": 6, + "poly": [ + 296, + 248, + 1395, + 248, + 1395, + 311, + 296, + 311 + ], + "score": 0.944 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.9 + }, + { + "category_id": 0, + "poly": [ + 300, + 1255, + 521, + 1255, + 521, + 1287, + 300, + 1287 + ], + "score": 0.891 + }, + { + "category_id": 0, + "poly": [ + 298, + 576, + 452, + 576, + 452, + 608, + 298, + 608 + ], + "score": 0.883 + }, + { + "category_id": 0, + "poly": [ + 293, + 509, + 1299, + 509, + 1299, + 542, + 293, + 542 + ], + "score": 0.883 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2112, + 836, + 2112 + ], + "score": 0.85 + }, + { + "category_id": 13, + "poly": [ + 1122, + 1851, + 1221, + 1851, + 1221, + 1880, + 1122, + 1880 + ], + "score": 0.91, + "latex": "D = 0 . 1" + }, + { + "category_id": 13, + "poly": [ + 414, + 1483, + 492, + 1483, + 492, + 1511, + 414, + 1511 + ], + "score": 0.9, + "latex": "D = 1" + }, + { + "category_id": 13, + "poly": [ + 1245, + 1821, + 1322, + 1821, + 1322, + 1849, + 1245, + 1849 + ], + "score": 0.9, + "latex": "D = 1" + }, + { + "category_id": 13, + "poly": [ + 882, + 1064, + 939, + 1064, + 939, + 1093, + 882, + 1093 + ], + "score": 0.88, + "latex": "90 \\%" + }, + { + "category_id": 13, + "poly": [ + 940, + 1743, + 992, + 1743, + 992, + 1771, + 940, + 1771 + ], + "score": 0.87, + "latex": "10 \\%" + }, + { + "category_id": 13, + "poly": [ + 595, + 1713, + 649, + 1713, + 649, + 1742, + 595, + 1742 + ], + "score": 0.86, + "latex": "90 \\%" + }, + { + "category_id": 13, + "poly": [ + 1186, + 1064, + 1241, + 1064, + 1241, + 1093, + 1186, + 1093 + ], + "score": 0.86, + "latex": "10 \\%" + }, + { + "category_id": 13, + "poly": [ + 499, + 896, + 562, + 896, + 562, + 925, + 499, + 925 + ], + "score": 0.77, + "latex": "\\mathrm { ( D } { = } 1 \\mathrm { ) }" + }, + { + "category_id": 13, + "poly": [ + 619, + 726, + 694, + 726, + 694, + 756, + 619, + 756 + ], + "score": 0.74, + "latex": "2 8 \\mathbf { x } 2 8" + }, + { + "category_id": 13, + "poly": [ + 955, + 251, + 980, + 251, + 980, + 278, + 955, + 278 + ], + "score": 0.6, + "latex": "G" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 246.0, + 954.0, + 246.0, + 954.0, + 285.0, + 293.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 981.0, + 246.0, + 1400.0, + 246.0, + 1400.0, + 285.0, + 981.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 280.0, + 1103.0, + 280.0, + 1103.0, + 315.0, + 296.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1251.0, + 526.0, + 1251.0, + 526.0, + 1293.0, + 293.0, + 1293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 574.0, + 454.0, + 574.0, + 454.0, + 612.0, + 295.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 506.0, + 1305.0, + 506.0, + 1305.0, + 549.0, + 290.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 804.0, + 1405.0, + 804.0, + 1405.0, + 838.0, + 294.0, + 838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 833.0, + 1404.0, + 833.0, + 1404.0, + 867.0, + 294.0, + 867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 864.0, + 1407.0, + 864.0, + 1407.0, + 899.0, + 294.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 895.0, + 498.0, + 895.0, + 498.0, + 930.0, + 294.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 563.0, + 895.0, + 1405.0, + 895.0, + 1405.0, + 930.0, + 563.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 924.0, + 1405.0, + 924.0, + 1405.0, + 961.0, + 292.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 953.0, + 1405.0, + 953.0, + 1405.0, + 994.0, + 291.0, + 994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 987.0, + 1068.0, + 987.0, + 1068.0, + 1021.0, + 296.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1451.0, + 1409.0, + 1451.0, + 1409.0, + 1487.0, + 294.0, + 1487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1483.0, + 413.0, + 1483.0, + 413.0, + 1515.0, + 296.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 493.0, + 1483.0, + 1406.0, + 1483.0, + 1406.0, + 1515.0, + 493.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1511.0, + 1406.0, + 1511.0, + 1406.0, + 1548.0, + 291.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1543.0, + 1406.0, + 1543.0, + 1406.0, + 1578.0, + 294.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1572.0, + 1402.0, + 1572.0, + 1402.0, + 1607.0, + 294.0, + 1607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1606.0, + 1058.0, + 1606.0, + 1058.0, + 1638.0, + 294.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1029.0, + 1405.0, + 1029.0, + 1405.0, + 1071.0, + 292.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1062.0, + 881.0, + 1062.0, + 881.0, + 1098.0, + 293.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 940.0, + 1062.0, + 1185.0, + 1062.0, + 1185.0, + 1098.0, + 940.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1242.0, + 1062.0, + 1405.0, + 1062.0, + 1405.0, + 1098.0, + 1242.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1096.0, + 1402.0, + 1096.0, + 1402.0, + 1127.0, + 296.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1123.0, + 1405.0, + 1123.0, + 1405.0, + 1159.0, + 294.0, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1152.0, + 1408.0, + 1152.0, + 1408.0, + 1191.0, + 292.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1184.0, + 350.0, + 1184.0, + 350.0, + 1219.0, + 292.0, + 1219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 635.0, + 1404.0, + 635.0, + 1404.0, + 668.0, + 297.0, + 668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 663.0, + 1404.0, + 663.0, + 1404.0, + 701.0, + 293.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 695.0, + 1405.0, + 695.0, + 1405.0, + 732.0, + 293.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 725.0, + 618.0, + 725.0, + 618.0, + 762.0, + 294.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 695.0, + 725.0, + 1408.0, + 725.0, + 1408.0, + 762.0, + 695.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 754.0, + 1384.0, + 754.0, + 1384.0, + 792.0, + 293.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1787.0, + 1404.0, + 1787.0, + 1404.0, + 1825.0, + 295.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1821.0, + 1244.0, + 1821.0, + 1244.0, + 1855.0, + 294.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1323.0, + 1821.0, + 1405.0, + 1821.0, + 1405.0, + 1855.0, + 1323.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1853.0, + 1121.0, + 1853.0, + 1121.0, + 1883.0, + 297.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1222.0, + 1853.0, + 1402.0, + 1853.0, + 1402.0, + 1883.0, + 1222.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1882.0, + 1404.0, + 1882.0, + 1404.0, + 1916.0, + 294.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1911.0, + 1409.0, + 1911.0, + 1409.0, + 1948.0, + 293.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1941.0, + 1406.0, + 1941.0, + 1406.0, + 1976.0, + 293.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1973.0, + 1404.0, + 1973.0, + 1404.0, + 2006.0, + 293.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2004.0, + 1404.0, + 2004.0, + 1404.0, + 2037.0, + 294.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1650.0, + 1408.0, + 1650.0, + 1408.0, + 1686.0, + 293.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1679.0, + 1409.0, + 1679.0, + 1409.0, + 1718.0, + 292.0, + 1718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1710.0, + 594.0, + 1710.0, + 594.0, + 1747.0, + 293.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 650.0, + 1710.0, + 1408.0, + 1710.0, + 1408.0, + 1747.0, + 650.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1743.0, + 939.0, + 1743.0, + 939.0, + 1775.0, + 296.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 993.0, + 1743.0, + 1004.0, + 1743.0, + 1004.0, + 1775.0, + 993.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1314.0, + 1405.0, + 1314.0, + 1405.0, + 1346.0, + 296.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1344.0, + 1402.0, + 1344.0, + 1402.0, + 1376.0, + 294.0, + 1376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1376.0, + 1407.0, + 1376.0, + 1407.0, + 1409.0, + 294.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1405.0, + 775.0, + 1405.0, + 775.0, + 1439.0, + 295.0, + 1439.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 18, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 481, + 236, + 1266, + 236, + 1266, + 834, + 481, + 834 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1167, + 1404, + 1167, + 1404, + 1289, + 298, + 1289 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 297, + 1306, + 1405, + 1306, + 1405, + 1430, + 297, + 1430 + ], + "score": 0.97 + }, + { + "category_id": 4, + "poly": [ + 296, + 878, + 1406, + 878, + 1406, + 1034, + 296, + 1034 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 300, + 1089, + 1398, + 1089, + 1398, + 1152, + 300, + 1152 + ], + "score": 0.908 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 814, + 76, + 814, + 104, + 299, + 104 + ], + "score": 0.89 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 865, + 2088, + 865, + 2112, + 835, + 2112 + ], + "score": 0.85 + }, + { + "category_id": 13, + "poly": [ + 296, + 1398, + 405, + 1398, + 405, + 1427, + 296, + 1427 + ], + "score": 0.88, + "latex": "1 0 0 > 1 0" + }, + { + "category_id": 13, + "poly": [ + 1189, + 530, + 1251, + 530, + 1251, + 555, + 1189, + 555 + ], + "score": 0.39, + "latex": "\\mathsf { K } = \\mathsf { 3 0 }" + }, + { + "category_id": 13, + "poly": [ + 1189, + 358, + 1251, + 358, + 1251, + 383, + 1189, + 383 + ], + "score": 0.35, + "latex": "\\mathsf { K } = \\mathsf { 1 0 }" + }, + { + "category_id": 13, + "poly": [ + 1067, + 781, + 1153, + 781, + 1153, + 805, + 1067, + 805 + ], + "score": 0.3, + "latex": "\\mathsf { D } = \\mathsf { 0 } . \\mathsf { 0 } \\mathsf { 0 } 1" + }, + { + "category_id": 13, + "poly": [ + 906, + 781, + 981, + 781, + 981, + 805, + 906, + 805 + ], + "score": 0.27, + "latex": "\\pmb { \\mathrm { D } } = \\pmb { 0 . 0 1 }" + }, + { + "category_id": 15, + "poly": [ + 511.0, + 239.0, + 697.0, + 239.0, + 697.0, + 263.0, + 511.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1168.0, + 249.0, + 1270.0, + 249.0, + 1270.0, + 275.0, + 1168.0, + 275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 480.0, + 278.0, + 506.0, + 278.0, + 506.0, + 439.0, + 480.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 660.0, + 283.0, + 671.0, + 283.0, + 671.0, + 296.0, + 660.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1173.0, + 272.0, + 1263.0, + 272.0, + 1263.0, + 297.0, + 1173.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 412.0, + 541.0, + 412.0, + 541.0, + 424.0, + 529.0, + 424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 939.0, + 490.0, + 1161.0, + 490.0, + 1161.0, + 632.0, + 939.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1010.0, + 548.0, + 1030.0, + 548.0, + 1030.0, + 555.0, + 1010.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 896.0, + 554.0, + 944.0, + 554.0, + 944.0, + 578.0, + 896.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1008.0, + 559.0, + 1032.0, + 559.0, + 1032.0, + 573.0, + 1008.0, + 573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 728.0, + 687.0, + 746.0, + 687.0, + 746.0, + 697.0, + 728.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 654.0, + 1028.0, + 654.0, + 1028.0, + 704.0, + 904.0, + 704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 704.0, + 767.0, + 704.0, + 767.0, + 718.0, + 743.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1190.0, + 703.0, + 1263.0, + 703.0, + 1263.0, + 728.0, + 1190.0, + 728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 782.0, + 629.0, + 782.0, + 629.0, + 805.0, + 575.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 778.0, + 809.0, + 778.0, + 809.0, + 807.0, + 739.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 812.0, + 1038.0, + 812.0, + 1038.0, + 833.0, + 682.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 880.0, + 1404.0, + 880.0, + 1404.0, + 913.0, + 296.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 912.0, + 1403.0, + 912.0, + 1403.0, + 941.0, + 298.0, + 941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 940.0, + 1404.0, + 940.0, + 1404.0, + 973.0, + 294.0, + 973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 972.0, + 1404.0, + 972.0, + 1404.0, + 1005.0, + 295.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1000.0, + 983.0, + 1000.0, + 983.0, + 1036.0, + 294.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 818.0, + 73.0, + 818.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2123.0, + 829.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1168.0, + 1405.0, + 1168.0, + 1405.0, + 1204.0, + 293.0, + 1204.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1199.0, + 1405.0, + 1199.0, + 1405.0, + 1231.0, + 294.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1227.0, + 1405.0, + 1227.0, + 1405.0, + 1265.0, + 292.0, + 1265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1257.0, + 358.0, + 1257.0, + 358.0, + 1295.0, + 293.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1307.0, + 1405.0, + 1307.0, + 1405.0, + 1340.0, + 295.0, + 1340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1336.0, + 1403.0, + 1336.0, + 1403.0, + 1369.0, + 294.0, + 1369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1363.0, + 1411.0, + 1363.0, + 1411.0, + 1408.0, + 291.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1396.0, + 295.0, + 1396.0, + 295.0, + 1435.0, + 292.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 1396.0, + 1101.0, + 1396.0, + 1101.0, + 1435.0, + 406.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1086.0, + 1403.0, + 1086.0, + 1403.0, + 1127.0, + 294.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1118.0, + 533.0, + 1118.0, + 533.0, + 1158.0, + 295.0, + 1158.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 19, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/BygzbyHFvB/BygzbyHFvB.md b/parse/train/BygzbyHFvB/BygzbyHFvB.md new file mode 100644 index 0000000000000000000000000000000000000000..3d7e93f393b188e1fdd55355d773325cc45722e3 --- /dev/null +++ b/parse/train/BygzbyHFvB/BygzbyHFvB.md @@ -0,0 +1,313 @@ +# FREELB: ENHANCED ADVERSARIAL TRAINING FOR NATURAL LANGUAGE UNDERSTANDING + +Chen $\mathbf { Z } \mathbf { h } \mathbf { u } ^ { \mathbf { 1 } }$ , Yu Cheng2, Zhe $\mathbf { G a n } ^ { 2 }$ , Siqi $\mathbf { S u n } ^ { 2 }$ , Tom Goldstein1, Jingjing Liu2 1University of Maryland, College Park 2Microsoft Dynamics 365 AI Research {chenzhu,tomg}@cs.umd.edu, {yu.cheng,zhe.gan,siqi.sun,jingjl}@microsoft.com + +# ABSTRACT + +Adversarial training, which minimizes the maximal risk for label-preserving input perturbations, has proved to be effective for improving the generalization of language models. In this work, we propose a novel adversarial training algorithm, FreeLB, that promotes higher invariance in the embedding space, by adding adversarial perturbations to word embeddings and minimizing the resultant adversarial risk inside different regions around input samples. To validate the effectiveness of the proposed approach, we apply it to Transformer-based models for natural language understanding and commonsense reasoning tasks. Experiments on the GLUE benchmark show that when applied only to the finetuning stage, it is able to improve the overall test scores of BERT-base model from 78.3 to 79.4, and RoBERTa-large model from 88.5 to 88.8. In addition, the proposed approach achieves state-of-the-art single-model test accuracies of $8 5 . 4 4 \%$ and $6 7 . 7 5 \%$ on ARC-Easy and ARC-Challenge. Experiments on CommonsenseQA benchmark further demonstrate that FreeLB can be generalized and boost the performance of RoBERTa-large model on other tasks as well. 1 + +# 1 INTRODUCTION + +Adversarial training is a method for creating robust neural networks. During adversarial training, mini-batches of training samples are contaminated with adversarial perturbations (alterations that are small and yet cause misclassification), and then used to update network parameters until the resulting model learns to resist such attacks. Adversarial training was originally proposed as a means to enhance the security of machine learning systems (Goodfellow et al., 2015), especially for safety-critical systems like self-driving cars (Xiao et al., 2018) and copyright detection (Saadatpanah et al., 2019). + +In this paper, we turn our focus away from the security benefits of adversarial training, and instead study its effects on generalization. While adversarial training boosts the robustness, it is widely accepted by computer vision researchers that it is at odds with generalization, with classification accuracy on non-corrupted images dropping as much as $1 0 \%$ on CIFAR-10, and $1 5 \%$ on Imagenet (Madry et al., 2018; Xie et al., 2019). Surprisingly, people observe the opposite result for language models (Miyato et al., 2017; Cheng et al., 2019), showing that adversarial training can improve both generalization and robustness. + +We will show that adversarial training significantly improves performance of state-of-the-art models for many language understanding tasks. In particular, we propose a novel adversarial training algorithm, called FreeLB (Free Large-Batch), which adds adversarial perturbations to word embeddings and minimizes the resultant adversarial loss around input samples. The method leverages recently proposed “free” training strategies (Shafahi et al., 2019; Zhang et al., 2019) to enrich the training data with diversified adversarial samples under different norm constraints at no extra cost than PGD-based (Projected Gradient Descent) adversarial training (Madry et al., 2018), which enables us to perform such diversified adversarial training on large-scale state-of-the-art models. We observe improved invariance in the embedding space for models trained with FreeLB, which is positively correlated with generalization. + +We perform comprehensive experiments to evaluate the performance of a variety of adversarial training algorithms on state-of-the-art language understanding models and tasks. In the comparisons with standard PGD (Madry et al., 2018), FreeAT (Shafahi et al., 2019) and YOPO (Zhang et al., 2019), FreeLB stands out to be the best for the datasets and models we evaluated. With FreeLB, we achieve state-of-the-art results on several important language understanding benchmarks. On the GLUE benchmark, FreeLB pushes the performance of the BERT-base model from 78.3 to 79.4. The overall score of the RoBERTa-large models on the GLUE benchmark is also lifted from 88.5 to 88.8, achieving best results on most of its sub-tasks. Experiments also show that FreeLB can boost the performance of RoBERTa-large on question answering tasks, such as the ARC and CommonsenseQA benchmarks. We also provide a comprehensive ablation study and analysis to demonstrate the effectiveness of our training process. + +# 2 RELATED WORK + +# 2.1 ADVERSARIAL TRAINING + +To improve the robustness of neural networks against adversarial examples, many defense strategies and models have been proposed, in which PGD-based adversarial training (Madry et al., 2018) is widely considered to be the most effective, since it largely avoids the the obfuscated gradient problem (Athalye et al., 2018). It formulates a class of adversarial training algorithms (Kurakin et al., 2017) into solving a minimax problem on the cross-entropy loss, which can be achieved reliably through multiple projected gradient ascent steps followed by a SGD (Stochastic Gradient Descent) step. + +Despite being verified by Athalye et al. (2018) to avoid obfuscated gradients, Qin et al. (2019) shows that PGD-based adversarial training still leads to highly convolved and non-linear loss surfaces when $K$ is small, which could be readily broken under stronger adversaries. Thus, to be effective, the cost of PGD-based adversarial training is much higher than conventional training. To mitigate this cost, Shafahi et al. (2019) proposed a “free” adversarial training algorithm that simultaneously updates both model parameters and adversarial perturbations on a single backward pass. Using a similar formulation, Zhang et al. (2019) effectively reduce the total number of full forward and backward propagations for obtaining adversarial examples by restricting most of its adversarial updates in the first layer. + +# 2.2 ADVERSARIAL EXAMPLES IN NATURAL LANGUAGES + +Adversarial examples have been explored primarily in the image domain, and received many attention in text domain recently. Previous works on text adversaries have focused on heuristics for creating adversarial examples in the black-box setting, or on specific tasks. Jia & Liang (2017) propose to add distracting sentences to the input document in order to induce mis-classification. Zhao et al. (2018) generate text adversaries by projecting the input data to a latent space using GANs, and searching for adversaries close to the original instance. Belinkov & Bisk (2018) manipulate every word in a sentence with synthetic or natural noise in machine translation systems. Iyyer et al. (2018) propose a neural paraphrase model based on back-translated data to produce paraphrases that have different sentence structures. Different from previous work, ours is not to produce actual adversarial examples, but only take the benefit of adversarial training for natural language understanding. + +We are not the first to observe that robust language models may perform better on clean test data. Miyato et al. (2017) extend adversarial and virtual adversarial training (Miyato et al., 2019) to the text domain to improve the performance on semi-supervised classification tasks. Ebrahimi et al. (2018) propose a character/word replacement for crafting attacks, and show employing adversarial examples in training renders the models more robust. Ribeiro et al. (2018) show that adversarial attacks can be used as a valuable tool for debugging NLP models. Cheng et al. (2019) also find that crafting adversarial examples can help neural machine translation significantly. Notably, these studies have focused on simple models or text generation tasks. Our work explores how to efficiently use the gradients obtained in adversarial training to boost the performance of state-of-the-art transformer-based models. + +# 3 ADVERSARIAL TRAINING FOR LANGUAGE UNDERSTANDING + +Pre-trained large-scale language models, such as BERT (Devlin et al., 2019), RoBERTa (Liu et al., 2019b), ALBERT (Lan et al., 2020) and T5 (Raffel et al., 2019), have proven to be highly effective for downstream tasks. We aim to further improve the generalization of these pre-trained language models on the downstream language understanding tasks by enhancing their robustness in the embedding space during finetuning on these tasks. We achieve this goal by creating “virtual” adversarial examples in the embedding space, and then perform parameter updates on these adversarial embeddings. Creating actual adversarial examples for language is difficult; even with state-of-theart language models as guidance (e.g., (Cheng et al., 2019)), it remains unclear how to construct label-preserving adversarial examples via word/character replacement without human evaluations, because the meaning of each word/character depends on the context (Ribeiro et al., 2018). Since we are only interested in the effects of adversarial training, rather than producing actual adversarial examples, we add norm-bounded adversarial perturbations to the embeddings of the input sentences using a gradient-based method. Note that our embedding-based adversary is strictly stronger than a more conventional text-based adversary, as our adversary can make manipulations on word embeddings that are not possible in the text domain. + +For models that incorporate various input representations, including word or subword embeddings, segment embeddings and position embeddings, our adversaries only modify the concatenated word or sub-word embeddings, leaving other components of the sentence representation unchanged. 2 Denote the sequence of one-hot representations of the input subwords as $\pmb { Z } = [ z _ { 1 } , z _ { 2 } , . . . , z _ { n } ]$ , the embedding matrix as $V$ , and the language model (encoder) as a function ${ \pmb y } = f _ { \pmb \theta } ( { \pmb X } )$ , where $\dot { \boldsymbol { X } } = \boldsymbol { V } \boldsymbol { Z }$ is the subword embeddings, $\textbf { { y } }$ is the output of the model (e.g., class probabilities for classification models), and $\pmb \theta$ denotes all the learnable parameters including the embedding matrix $V$ . We add adversarial perturbations $\delta$ to the embeddings such that the prediction becomes $\pmb { y } ^ { \prime } = f _ { \pmb { \theta } } ( \pmb { X } + \pmb { \delta } )$ . To preserve the semantics, we constrain the norm of $\pmb { \delta }$ to be small, and assume the model’s prediction should not change after the perturbation. This formulation is analogous to Miyato et al. (2017), with the difference that we do not require $\boldsymbol { X }$ to be normalized. + +# 3.1 PGD FOR ADVERSARIAL TRAINING + +Standard adversarial training seeks to find optimal parameters $\pmb { \theta } ^ { * }$ to minimize the maximum risk for any $\pmb { \delta }$ within a norm ball as: + +$$ +\operatorname* { m i n } _ { \theta } \mathbb { E } _ { ( Z , y ) \sim \mathcal { D } } \left[ \operatorname* { m a x } _ { \| \delta \| \leq \epsilon } L ( f _ { \theta } ( X + \delta ) , y ) \right] , +$$ + +where $\mathcal { D }$ is the data distribution, $y$ is the label, and $L$ is some loss function. We use the Frobenius norm to constrain $\delta$ . For neural networks, the outer “min” is non-convex, and the inner “max” is non-concave. Nonetheless, Madry et al. (2018) demonstrated that this saddle-point problem can be solved reliably with SGD for the outer minimization and PGD (a standard method for large-scale constrained optimization, see (Combettes & Pesquet, 2011) and (Goldstein et al., 2014)), for the inner maximization. In particular, for the constraint $\| \delta \| _ { F } \le \epsilon$ , with an additional assumption that the loss function is locally linear, PGD takes the following step (with step size $\alpha$ ) in each iteration: + +$$ +\delta _ { t + 1 } = \Pi _ { \| \pmb { \delta } \| _ { F } \leq \epsilon } \left( \pmb { \delta } _ { t } + \alpha g ( \pmb { \delta } _ { t } ) / \| g ( \pmb { \delta } _ { t } ) \| _ { F } \right) , +$$ + +where $g ( \delta _ { t } ) = \nabla _ { \delta } L ( f _ { \theta } ( X + \delta _ { t } ) , y )$ is the gradient of the loss with respect to $\delta$ , and $\Pi _ { \| \delta \| _ { F } \leq \epsilon }$ performs a projection onto the $\epsilon$ -ball. To achieve high-level robustness, multi-step adversarial examples are needed during training, which is computationally expensive. The $K$ -step PGD ( $K$ -PGD) requires $K$ forward-backward passes through the network, while the standard SGD update requires only one. As a result, the adversary generation step in adversarial training increases run-time by an order of magnitude—a catastrophic amount when training large state-of-the-art language models. + +# 3.2 LARGE-BATCH ADVERSARIAL TRAINING FOR FREE + +In the inner ascent steps of PGD, the gradients of the parameters can be obtained with almost no overhead when computing the gradients of the inputs. From this observation, FreeAT (Shafahi et al., + +# Algorithm 1 “Free” Large-Batch Adversarial Training (FreeLB- $K$ ) + +
ascent step size αRequire: Training samples X = {(Z,y)}, perturbation bound ε, learning rate T, ascent steps K,
1:Initialize 0
2: for epoch =1... Nep do
3:for minibatchB ℃Xdo
4:U(-∈,∈)
5:90↑0
6:
7:fort=1...K do
8:Accumulate gradient of parameters θ
9:gt←gt-1+kE(z,y)∈B[VθL(fe(X+δt-1),y)]
10:Update the perturbation δ via gradient ascend
11:gadu ←VsL(fθ(X+δt-1),y) δt ←II|δ|lr≤e(δt-1+α:gadu/llgadullF)
12:
13:end for
14:0←0-TgK
end for 15: end for
+ +2019) and YOPO (Zhang et al., 2019) have been proposed to accelerate adversarial training. They achieve comparable robustness and generalization as standard PGD-trained models using only the same or a slightly larger number of forward-backward passes as natural training (i.e., SGD on clean samples). FreeAT takes one descent step on the parameters together with each of the $K$ ascent steps on the perturbation. As a result, FreeAT may suffer from the “stale gradient” problem (Dutta et al., 2018), where in every step $t$ , $\delta _ { t }$ does not necessarily maximize the model with parameter $\theta _ { t }$ since its update is based on $\nabla _ { \delta } L \big ( f _ { \pmb { \theta } _ { t - 1 } } ( \pmb { X } + \delta _ { t - 1 } ) , y \big )$ , and vice versa, $\theta _ { t }$ does not necessarily minimize the adversarial risk with adversary $\delta _ { t }$ since its update is based on $\nabla _ { \pmb { \theta } } L \big ( f _ { \pmb { \theta } _ { t - 1 } } ( \pmb { X } + \delta _ { t - 1 } ) , y \big )$ . Such a problem may be more significant when the step size is large. + +Different from FreeAT, YOPO accumulates the gradient of the parameters from each of the ascent steps, and updates the parameters only once after the $K$ inner ascent steps. YOPO also advocates that after each back-propagation, one should take the gradient of the first hidden layer as a constant and perform several additional updates on the adversary using the product of this constant and the Jacobian of the first layer of the network to obtain strong adversaries. However, when the first hidden layer is a linear layer as in their implementation, such an operation is equivalent to taking a larger step size on the adversary. The analysis backing the extra update steps also assumes a twice continuously differentiable loss, which does not hold for ReLU-based neural networks they experimented with, and thus the reasons for the success of such an algorithm remains obscure. We give empirical comparisons between YOPO and our approach in Sec. 4.3. + +To obtain better solutions for the inner max and avoid fundamental limitations on the function class, we propose FreeLB, which performs multiple PGD iterations to craft adversarial examples, and simultaneously accumulates the “free” parameter gradients $\nabla _ { \boldsymbol { \theta } } L$ in each iteration. After that, it updates the model parameter $\pmb \theta$ all at once with the accumulated gradients. The overall procedure is shown in Algorithm 1, in which $X + \delta _ { t }$ is an approximation to the local maximum within the intersection of two balls $\mathcal { T } _ { t } = \mathcal { B } _ { X + \delta _ { 0 } } ( \alpha t ) \cap \mathcal { B } _ { X } ( \epsilon )$ . By taking a descent step along the averaged gradients at $X + \delta _ { 0 } , . . . , X + \delta _ { K - 1 }$ , we approximately optimize the following objective: + +$$ +\underset { \pmb { \theta } } { \operatorname* { m i n } } \mathbb { E } _ { ( Z , y ) \sim \mathcal { D } } \left[ \frac { 1 } { K } \sum _ { t = 0 } ^ { K - 1 } \underset { \delta _ { t } \in \mathcal { Z } _ { t } } { \operatorname* { m a x } } L \big ( f _ { \pmb { \theta } } \big ( \pmb { X } + \delta _ { t } \big ) , y \big ) \right] , +$$ + +which is equivalent to replacing the original batch $\boldsymbol { X }$ with a $K$ -times larger virtual batch, consisting of samples whose embeddings are $X + \delta _ { 0 } , . . . , X + \delta _ { K - 1 }$ . Compared with PGD-based adversarial training (Eq. 1), which minimizes the maximum risk at a single estimated point in the vicinity of each training sample, FreeLB minimizes the maximum risk at each ascent step at almost no overhead. + +Intuitively, FreeLB could be a learning method with lower generalization error than PGD. Sokolic et al. (2017) have proved that the generalization error of a learning method invariant to a set of√ $T$ transformations may be up to $\sqrt { T }$ smaller than a non-invariant learning method. According to their theory, FreeLB could have a more significant improvement over natural training, since FreeLB enforces the invariance to $K$ adversaries from a set of up to $K$ different norm constraints,3 while PGD only enforces invariance to a single norm constraint $\epsilon$ . + +Empirically, FreeLB does lead to higher robustness and invariance than PGD in the embedding space, in the sense that the maximum increase of loss in the vicinity of $\boldsymbol { X }$ for models trained with FreeLB is smaller than that with PGD. See Sec. 4.3 for details. In theory, such improved robustness can lead to better generalization (Xu & Mannor, 2012), which is consistent with our experiments. Qin et al. (2019) also demonstrated that PGD-based method leads to highly convolved and non-linear loss surfaces in the vicinity of input samples when $K$ is small, indicating a lack of robustness. + +# 3.3 WHEN ADVERSARIAL TRAINING MEETS DROPOUT + +Usually, adversarial training is not used together with dropout (Srivastava et al., 2014). However, for some language models like RoBERTa (Liu et al., 2019b), dropout is used during the finetuning stage. In practice, when dropout is turned on, each ascent step of Algorithm 1 is optimizing $\delta$ for a different network. Specifically, denote the dropout mask as $_ { m }$ with each entry $m _ { i } \sim \mathrm { B e r n o u l l i } ( p )$ . Similar to our analysis for FreeAT, the ascent step from $\delta _ { t - 1 }$ to $\delta _ { t }$ is based on $\nabla _ { \delta } L \big ( f _ { \theta ( m _ { t - 1 } ) } \big ( \boldsymbol { X } + \delta _ { t - 1 } \big ) , \boldsymbol { y } \big )$ , so $\delta _ { t }$ is sub-optimal for $L ( f _ { \theta ( m _ { t } ) } ( \boldsymbol { X } + \delta ) , y )$ . Here $\theta ( m )$ is the effective parameters under dropout mask $_ { m }$ . + +The more plausible solution is to use the same $_ { \mathbf { \nabla } } \mathbf { m }$ in each step. When applying dropout to any network, the objective for $\pmb \theta$ is to minimize the expectation of loss under different networks determined by the dropout masks, which is achieved by minimizing the Monte Carlo estimation of the expected loss. In our case, the objective becomes: + +$$ +\operatorname* { m i n } _ { \theta } \mathbb { E } _ { ( Z , y ) \sim \mathcal { D } , m \sim \mathcal { M } } \left[ \frac { 1 } { K } \sum _ { t = 0 } ^ { K - 1 } \operatorname* { m a x } _ { \delta _ { t } \in \mathcal { T } _ { t } } L \big ( f _ { \theta ( m ) } ( X + \delta _ { t } ) , y \big ) \right] , +$$ + +where the 1-sample Monte Carlo estimation should be $\begin{array} { r } { \frac { 1 } { K } \sum _ { t = 0 } ^ { K - 1 } \operatorname* { m a x } _ { \delta _ { t } \in \mathcal { T } _ { t } } L ( f _ { \theta ( m _ { 0 } ) } ( X + \delta _ { t } ) , y ) } \end{array}$ and can be minimized by using FreeLB with dropout mask $m _ { 0 }$ in each ascent step. This is similar to applying Variational Dropout to RNNs as used in Gal & Ghahramani (2016). + +# 4 EXPERIMENTS + +In this section, we provide comprehensive analysis on FreeLB through extensive experiments on three Natural Language Understanding benchmarks: GLUE (Wang et al., 2019), ARC (Clark et al., 2018) and CommonsenseQA (Talmor et al., 2019). We also compare the robustness and generalization of FreeLB with other adversarial training algorithms to demonstrate its strength. Additional experimental details are provided in the Appendix. + +# 4.1 DATASETS + +GLUE Benchmark. The GLUE benchmark is a collection of 9 natural language understanding tasks, namely Corpus of Linguistic Acceptability (CoLA; Warstadt et al. (2018)), Stanford Sentiment Treebank (SST; Socher et al. (2013)), Microsoft Research Paraphrase Corpus (MRPC; Dolan & Brockett (2005)), Semantic Textual Similarity Benchmark (STS; Agirre et al. (2007)), Quora Question Pairs (QQP; Iyer et al. (2017)), Multi-Genre NLI (MNLI; Williams et al. (2018)), Question NLI (QNLI; Rajpurkar et al. (2016)), Recognizing Textual Entailment (RTE; Dagan et al. (2006); Bar Haim et al. (2006); Giampiccolo et al. (2007); Bentivogli et al. (2009)) and Winograd NLI (WNLI; Levesque et al. (2011)). 8 of the tasks are formulated as classification problems and only STS-B is formulated as regression, but FreeLB applies to all of them. For BERT-base, we use the HuggingFace implementation4, and follow the single-task finetuning procedure as in Devlin et al. (2019). For RoBERTa, we use the fairseq implementation5. Same as Liu et al. (2019b), we also use single-task finetuning for all dev set results, and start with MNLI-finetuned models on RTE, MRPC and STS-B for the test submissions. + +Table 1: Results (median and variance) on the dev sets of GLUE based on the RoBERTa-large model, from 5 runs with the same hyperparameter but different random seeds. ReImp is our reimplementation of RoBERTalarge. The training process can be very unstable even with the vanilla version. Here, both PGD on STS-B and FreeAT on RTE demonstrates such instability, with one unconverged instance out of five. + +
MethodMNLI(Acc)QNLI(Acc)QQP(Acc)RTE(Acc)SST-2(Acc)MRPC(Acc)CoLA(Mcc)STS-B(Pearson)
Reported90.294.792.286.696.490.968.092.4
ReImp11-85.61 (1.7)96.56 (.3)90.69(.5)67.57 (1.3)92.20 (.2)
PGD90.53 (.2)94.87 (.2)92.49 (.07)87.41 (.9)96.44 (.1)90.93 (.2)69.67 (1.2)92.43 (7.)
FreeAT90.02 (.2)94.66 (.2)92.48(.08)86.69 (15.)96.10 (.2)90.69 (.4)68.80 (1.3)92.40 (.3)
FreeLB90.61 (.1)94.98 (.2)92.60 (.03)88.13 (1.2)96.79 (.2)91.42 (.7)71.12 (.9)92.67 (.08)
+ +Table 2: Results on GLUE from the evaluation server, as of Sep 25, 2019. Metrics are the same as the leaderboard. Number under each task’s name is the size of the training set. FreeLB-BERT is the single-model results of BERT-base finetuned with FreeLB, and FreeLB-RoB is the ensemble of 7 RoBERTa-Large models for each task. References: 1: (Devlin et al., 2019); 2: (Liu et al., 2019a); 3: (Yang et al., 2019); 4: (Liu et al., 2019b). + +
ModelScoreCoLA8.5kSST-267kMRPC3.7kSTS-B7kQQP364kMNLI-m/mm393kQNLI108kRTE2.5kWNLI634AX
BERT-base178.352.193.588.9/84.887.1/85.871.2/89.284.6/83.490.566.465.134.2
FreeLB-BERT79.454.593.688.1/83.587.7/86.772.7/89.685.7/84.691.870.165.136.9
MT-DNN287.668.496.592.7/90.391.1/90.773.7789.987.9/87.496.086.389.042.8
XLNet-Large88.467.896.893.0/90.791.6/91.174.2/90.390.2/89.898.686.390.447.5
RoBERTa488.567.896.792.3/89.892.2/91.974.3/90.290.8/90.298.988.289.048.7
FreeLB-RoB88.868.096.893.1/90.892.4/92.274.8/90.391.1/90.798.888.789.050.1
Human87.166.497.886.3/80.892.7/92.659.5/80.492.0/92.891.293.695.91
+ +ARC Benchmark. The ARC dataset (Clark et al., 2018) is a collection of multi-choice science questions from grade-school level exams. It is further divided into ARC-Challenge set with 2,590 question answer (QA) pairs and ARC-Easy set with 5,197 QA pairs. Questions in ARC-Challenge are more difficult and cannot be handled by simply using a retrieval and co-occurence based algorithm (Clark et al., 2018). A typical question is: + +Which property of a mineral can be determined just by looking at it? + +(A) luster [correct] $( B )$ mass $( C )$ weight $( D )$ hardness. + +CommonsenseQA Benchmark. The CommonsenseQA dataset (Talmor et al., 2019) consists of 12,102 natural language questions that require human commonsense reasoning ability to answer. A typical question is : + +Where can I stand on a river to see water falling without getting wet? + +(A) waterfall, (B) bridge [correct], (C) valley, $( D )$ stream, (E) bottom. + +Each question has five candidate answers from ConceptNet (Speer et al., 2017). To make the question more difficult to solve, most answers have the same relation in ConceptNet to the key concept in the question. As shown in the above example, most answers can be connected to “river” by “AtLocation” relation in ConceptNet. For a fair comparison with the reported results in papers and leaderboard6, we use the official random split 1.11. + +# 4.2 EXPERIMENTAL RESULTS + +GLUE We summarize results on the dev sets of GLUE in Table 1, comparing the proposed FreeLB against other adversatial training algorithms (PGD (Madry et al., 2018) and FreeAT (Shafahi et al., 2019)). We use the same step size $\alpha$ and number of steps $m$ for PGD, FreeAT and FreeLB. FreeLB is consistently better than the two baselines. Comparisons and detailed discussions about + +Table 3: Results on ARC and CommonsenseQA (CQA). ARC-Merge is the combination of ARC-Easy and ARC-Challenge, “MTL” stands for multi-task learning and “Ens” stands for ensemble. Results of XLNet $^ +$ RoBERTa $\left( \mathbf { M } \mathbf { T } \mathbf { L } { + } \mathbf { E } \mathbf { n } \mathbf { s } \right)$ and AristoRoBERTaV7 (MTL) are from the ARC leaderboards. Test (E) denotes the test set results with ensembles. For CQA, we report the highest dev and test accuracies among all models. The models with 78.81/72.19 dev/test accuracy (as in the table) have 71.84/78.64 test/dev accuracies respectively. + +
ARC-Easy ARC-Challenge ARC-Merge CQADev Test Dev Test Dev Test Dev Test Test (E)
TestDevTestDevTest DevTest
RoBERTa(Reported)------78.4372.172.5
RoBERTa (ReImp)84.3984.1364.5464.4477.8377.6277.56--
FreeLB-RoBERTa84.9184.8165.8965.3678.3778.3978.8172.273.1
AristoRoBERTaV7(MTL):85.02-66.47-78.89--:
XLNet +RoBERTa (MTL+Ens)---67.06--二二二
FreeLB-RoBERTa(MTL)84.9185.4470.2367.7579.8679.60---
+ +YOPO (Zhang et al., 2019) are provided in Sec. 4.3. We have also submitted our results to the evaluation server, results provided in Table 2. FreeLB lifts the performance of the BERT-base model from 78.3 to 79.4, and RoBERTa-large model from 88.5 to 88.8 on overall scores. + +ARC For ARC, a corpus of 14 million related science documents (from ARC Corpus, Wikipedia and other sources) is provided. For each QA pair, we first use a retrieval model to select top 10 related documents. Then, given these retrieved documents7, we use RoBERTa-large model to encode $\langle s \rangle$ Retrieved Documents $\langle / s \rangle$ Question $^ +$ Answer $\langle / s \rangle$ , where $\langle \mathbf { s } \rangle$ and $\langle / \mathrm { s } \rangle$ are special tokens for RoBERTa model8. We then apply a fully-connected layer to the representation of the [CLS] token to compute the final logit, and use standard cross-entropy loss for model training. + +Results are summarized in Table 3. Following Sun et al. (2018), we first finetune the RoBERTa model on the RACE dataset (Lai et al., 2017). The finetuned RoBERTa model achieves $8 5 . 7 0 \%$ and $8 5 . 2 4 \%$ accuracy on the development and test set of RACE, respectively. Based on this, we further finetune the model on both ARC-Easy and ARC-Challenge datasets with the same hyper-parameter searching strategy (for 5 epochs), which achieves $8 4 . 1 3 \% / 6 4 . 4 4 \%$ test accuracy on ARC-Easy/ARCChallenge. And by adding FreeLB finetuning, we can reach $8 4 . 8 1 \% / 6 5 . 3 6 \%$ , a significant boost on ARC benchmark, demonstrating the effectiveness of FreeLB. + +To further improve the results, we apply a multi-task learning (MTL) strategy using additional datasets. We first finetune the model on RACE (Lai et al., 2017), and then finetune on a joint dataset of ARC-Easy, ARC-Challenge, OpenbookQA (Mihaylov et al., 2018) and Regents Living Environment9. Based on this, we further finetune our model on ARC-Easy and ARC-Challenge with FreeLB. After finetuning, our single model achieves $6 7 . 7 5 \%$ test accuracy on ARC-Challenge and $8 5 . 4 4 \%$ on ARC-Easy, both outperforming the best submission on the official leaderboard10. + +CommonsenseQA Similar to the training strategy in Liu et al. (2019b), we construct five inputs for each question by concatenating the question and each answer separately, then encode each input with the representation of the [CLS] token. A final score is calculated by applying the representation of [CLS] to a fully-connected layer. Following the fairseq repository11, the input is formatted as: ${ \mathfrak { n } } ( s ) Q$ : Where can I stand on a river to see water falling without getting wet? $\langle / s \rangle A$ : waterfall $\langle \langle s \rangle ^ { \ast } \cdot \mathbf { \vec { \mathbf { \mu } } }$ , where $\cdot _ { Q }$ :’ and $^ { , } A$ :’ are the prefix for question and answer, respectively. + +Results are summarized in Table 3. We obtained a dev-set accuracy of $7 7 . 5 6 \%$ with the RoBERTalarge model. When using FreeLB finetuning, we achieved $7 8 . 8 1 \%$ , a $1 . 2 5 \%$ absolute gain. Compared with the results reported from fairseq repository, which obtains $7 8 . 4 3 \%$ accuracy on the devset, FreeLB still achieves better performance. Our submission to the CommonsenseQA leaderboard achieves $7 2 . 2 \%$ single-model test set accuracy, and the result of a 20-model ensemble is $7 3 . 1 \%$ , which achieves No.1 among all the submissions without making use of ConceptNet. + +Table 4: The median and standard deviation of the scores on the dev sets of RTE, CoLA and MRPC from the GLUE benchmark, computed from 5 runs with the same hyper-parameters except for the random seeds. We use FreeLB- $\mathbf { \nabla } m$ to denote FreeLB with $m$ ascent steps, and FreeLB- ${ . 3 ^ { * } }$ to denote the version without reusing the dropout mask. + +
MethodsVanillaFreeLB-3*FreeLB-3YOPO-3-2YOPO-3-3
RTE85.61 (1.67)87.14 (1.29)88.13 (1.21)87.05 (1.36)87.05 (0.20)
CoLA67.57 (1.30)69.31 (1.16)71.12 (0.90)70.40 (0.91)69.91 (1.16)
MRPC90.69 (0.54)90.93 (0.66)91.42 (0.72)90.44 (0.62)90.69 (0.37)
+ +
MethodsRTECoLAMRPC
M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-3)M-Inc (R)(10-3)N-Loss(10-3)
Vanilla5.15.34.56.15.75.210.210.21.9
PGD4.74.96.2128.2130.1436.15.75.75.4
FreeLB3.02.64.11.41.37.23.63.62.7
+ +Table 5: Median of the maximum increase in loss in the vicinity of the dev set samples for RoBERTa-Large model finetuned with different methods. Vanilla models are naturally trained RoBERTa’s. M-Inc: Max Inc, MInc (R): Max Inc (R). Nat Loss (N-Loss) is the loss value on clean samples. Notice we require all clean samples here to be correctly classified by all models, which results in 227, 850 and 355 samples for RTE, CoLA and MRPC, respectively. We also give the variance in the Appendix. + +# 4.3 ABLATION STUDY AND ANALYSIS + +In this sub-section, we first show the importance of reusing dropout mask, then conduct a thorough ablation study on FreeLB over the GLUE benchmark to analyze the robustness and generalization strength of different approaches. We observe that it is unnecessary to perform shallow-layer updates on the adversary as YOPO for our case, and FreeLB results in improved robustness and generalization compared with PGD. + +Importance of Reusing Mask Table 4 (columns 2 to 4) compares the results of FreeLB with and without reusing the same dropout mask in each ascent step, as proposed in Sec. 3.3. With reusing, FreeLB can achieve a larger improvement over the naturally trained models. Thus, we enable mask reusing for all experiments involving RoBERTa. + +Comparing the Robustness Table 5 provides the comparisons of the maximum increment of loss in the vicinity of each sample, defined as: + +$$ +\displaystyle \Delta L _ { \mathrm { m a x } } ( \boldsymbol { X } , \epsilon ) = \operatorname* { m a x } _ { \| \delta \| \leq \epsilon } L ( f _ { \boldsymbol { \theta } } ( \boldsymbol { X } + \delta ) , \boldsymbol { y } ) - L ( f _ { \boldsymbol { \theta } } ( \boldsymbol { X } ) , \boldsymbol { y } ) , +$$ + +which reflects the robustness and invariance of the model in the embedding space. In practice, we use PGD steps as in Eq. 2 to find the value of ${ \Delta } L _ { \mathrm { m a x } } ( \boldsymbol { X } , \boldsymbol { \epsilon } )$ . We found that when using a step size of $5 { \cdot } 1 0 ^ { - 3 }$ and $\epsilon = 0 . 0 1 \| X \| _ { F }$ , the PGD iterations converge to almost the same value, starting from 100 different random initializations of $\pmb { \delta }$ for the RoBERTa models, trained with or without FreeLB. This indicates that PGD reliably finds $\Delta L _ { \mathrm { m a x } }$ for these models. Therefore, we compute ${ \Delta } L _ { \mathrm { m a x } } ( X , \epsilon )$ for each $\boldsymbol { X }$ via a 2000-step PGD. + +Samples with small margins exist even for models with perfect accuracy, which could give a false sense of vulnerability of the model. To rule out the outlier effect and make ${ \Delta } L _ { \mathrm { m a x } } ( \boldsymbol { X } , \epsilon )$ comparable across different samples, we only consider samples that all the evaluated models can correctly classify, and search for an $\epsilon$ for each sample such that the reference model can correctly classify all samples within the $\epsilon$ ball.12 However, such choice of per-sample $\epsilon$ favors the reference model by design. To make fair comparisons, Table 5 provides the median of ${ \Delta } L _ { \mathrm { m a x } } ( \boldsymbol { X } , \epsilon )$ with per-sample $\epsilon$ from models trained by FreeLB (Max Inc) and PGD (Mac Inc (R)), respectively. + +Across all three datasets and different reference models, FreeLB has the smallest median increment even when starting from a larger natural loss than vanilla models. This demonstrates that FreeLB is more robust and invariant in most cases. Such results are also consistent with the models’ dev set performance (the performances for Vanilla/PGD/FreeLB models on RTE, CoLA and MRPC are 86.69/87.41/89.21, 69.91/70.84/71.40, 91.67/91.17/91.17, respectively). + +Comparing with YOPO The original implementation of YOPO (Zhang et al., 2019) chooses the first convolutional layer of the ResNets as $f _ { 0 }$ for updating the adversary in the “s-loop”. As a result, each step of the “s-loop” should be using exactly the same value to update the adversary,and YOPO$m { - } n$ degenerates into FreeLB with a $n$ -times large step size. To avoid that, we choose the layers up to the output of the first Transformer block as $f _ { 0 }$ when implementing YOPO. To make the total amount of update on the adversary equal, we take the hyper-parameters for FreeLB- $m$ and only change the step size $\alpha$ into $\alpha / n$ for YOPO- $m { \cdot } n$ . Table 4 shows that FreeLB performs consistently better than YOPO on all three datasets. Accidentally, we also give the results comparing with YOPO- $\mathbf { \nabla } m - n$ without changing the step size $\alpha$ for YOPO in Table 8. The gap between two approaches seem to shrink, which may be caused by using a larger total step size for the YOPO adversaries. We leave exhaustive hyperparameter search for both models as our future work. + +# 5 CONCLUSION + +In this work, we have developed an adversarial training approach, FreeLB, to improve natural language understanding. The proposed approach adds perturbations to continuous word embeddings using a gradient method, and minimizes the resultant adversarial risk in an efficient way. FreeLB is able to boost Transformer-based model (BERT and RoBERTa) on several datasets and achieve new state of the art on GLUE and ARC benchmarks. Empirical study demonstrates that our method results in both higher robustness in the embedding space than natural training and better generalization ability. Such observation is also consistent with recent findings in Computer Vision. However, adversarial training still takes significant overhead compared with vanilla SGD. How to accelerate this process while improving generalization is an interesting future direction. + +Acknowledgements: Goldstein and Zhu were supported in part by the DARPA GARD, DARPA QED for RML, and AFOSR MURI programs. + +# REFERENCES + +Eneko Agirre, Llu’is M‘arquez, and Richard Wicentowski (eds.). Proceedings of the Fourth International Workshop on Semantic Evaluations (SemEval-2007). Association for Computational Linguistics, 2007. + +Anish Athalye, Nicholas Carlini, and David Wagner. Obfuscated gradients give a false sense of security: Circumventing defenses to adversarial examples. In ICML, 2018. + +Roy Bar Haim, Ido Dagan, Bill Dolan, Lisa Ferro, Danilo Giampiccolo, Bernardo Magnini, and Idan Szpektor. The second PASCAL recognising textual entailment challenge. 2006. + +Yonatan Belinkov and Yonatan Bisk. Synthetic and natural noise both break neural machine translation. In ICLR, 2018. + +Luisa Bentivogli, Ido Dagan, Hoa Trang Dang, Danilo Giampiccolo, and Bernardo Magnini. The fifth PASCAL recognizing textual entailment challenge. 2009. + +Yong Cheng, Lu Jiang, and Wolfgang Macherey. Robust neural machine translation with doubly adversarial inputs. In ACL, 2019. + +Peter Clark, Isaac Cowhey, Oren Etzioni, Tushar Khot, Ashish Sabharwal, Carissa Schoenick, and Oyvind Tafjord. Think you have solved question answering? try arc, the ai2 reasoning challenge. arXiv preprint arXiv:1803.05457, 2018. + +Patrick L Combettes and Jean-Christophe Pesquet. Proximal splitting methods in signal processing. In Fixed-point algorithms for inverse problems in science and engineering. 2011. + +Ido Dagan, Oren Glickman, and Bernardo Magnini. The PASCAL recognising textual entailment challenge. In Machine learning challenges. evaluating predictive uncertainty, visual object classification, and recognising tectual entailment. Springer, 2006. + +Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. Bert: Pre-training of deep bidirectional transformers for language understanding. In NAACL, 2019. + +William B Dolan and Chris Brockett. Automatically constructing a corpus of sentential paraphrases. In Proceedings of the International Workshop on Paraphrasing, 2005. + +Sanghamitra Dutta, Gauri Joshi, Soumyadip Ghosh, Parijat Dube, and Priya Nagpurkar. Slow and stale gradients can win the race: Error-runtime trade-offs in distributed sgd. In AISTATS, pp. 803–812, 2018. + +Javid Ebrahimi, Anyi Rao, Daniel Lowd, and Dejing Dou. HotFlip: White-box adversarial examples for text classification. In ACL, 2018. + +Yarin Gal and Zoubin Ghahramani. A theoretically grounded application of dropout in recurrent neural networks. In NeurIPS, 2016. + +Danilo Giampiccolo, Bernardo Magnini, Ido Dagan, and Bill Dolan. The third PASCAL recognizing textual entailment challenge. In Proceedings of the ACL-PASCAL workshop on textual entailment and paraphrasing, 2007. + +Tom Goldstein, Christoph Studer, and Richard Baraniuk. A field guide to forward-backward splitting with a fasta implementation. arXiv preprint 1411.3406, 2014. + +Ian Goodfellow, Jonathon Shlens, and Christian Szegedy. Explaining and harnessing adversarial examples. In ICLR, 2015. + +Shankar Iyer, Nikhil Dandekar, and Kornl Csernai. First quora dataset release: Question pairs, 2017. URL https://www.quora.com/q/quoradata/ First-Quora-Dataset-Release-Question-Pairs. + +Mohit Iyyer, John Wieting, Kevin Gimpel, and Luke Zettlemoyer. Adversarial example generation with syntactically controlled paraphrase networks. In NAACL, 2018. + +Robin Jia and Percy Liang. Adversarial examples for evaluating reading comprehension systems. In EMNLP, 2017. + +Alexey Kurakin, Ian Goodfellow, and Samy Bengio. Adversarial machine learning at scale. In ICLR, 2017. + +Guokun Lai, Qizhe Xie, Hanxiao Liu, Yiming Yang, and Eduard Hovy. Race: Large-scale reading comprehension dataset from examinations. arXiv preprint arXiv:1704.04683, 2017. + +Zhenzhong Lan, Mingda Chen, Sebastian Goodman, Kevin Gimpel, Piyush Sharma, and Radu Soricut. Albert: A lite bert for self-supervised learning of language representations. ICLR, 2020. + +Hector J Levesque, Ernest Davis, and Leora Morgenstern. The Winograd schema challenge. In AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning, 2011. + +Xiaodong Liu, Pengcheng He, Weizhu Chen, and Jianfeng Gao. Multi-task deep neural networks for natural language understanding. In ACL, 2019a. + +Yinhan Liu, Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen, Omer Levy, Mike Lewis, Luke Zettlemoyer, and Veselin Stoyanov. Roberta: A robustly optimized bert pretraining approach. arXiv preprint arXiv:1907.11692, 2019b. + +Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu. Towards deep learning models resistant to adversarial attacks. In ICLR, 2018. + +Todor Mihaylov, Peter Clark, Tushar Khot, and Ashish Sabharwal. Can a suit of armor conduct electricity? a new dataset for open book question answering. arXiv preprint arXiv:1809.02789, 2018. + +Takeru Miyato, Andrew M Dai, and Ian Goodfellow. Adversarial training methods for semisupervised text classification. In ICLR, 2017. + +Takeru Miyato, Shin-ichi Maeda, Masanori Koyama, and Shin Ishii. Virtual adversarial training: A regularization method for supervised and semi-supervised learning. TPAMI, 2019. + +Chongli Qin, James Martens, Sven Gowal, Dilip Krishnan, Alhussein Fawzi, Soham De, Robert Stanforth, Pushmeet Kohli, et al. Adversarial robustness through local linearization. In NeurIPS, 2019. + +Colin Raffel, Noam Shazeer, Adam Roberts, Katherine Lee, Sharan Narang, Michael Matena, Yanqi Zhou, Wei Li, and Peter J Liu. Exploring the limits of transfer learning with a unified text-to-text transformer. arXiv preprint 1910.10683, 2019. + +Pranav Rajpurkar, Jian Zhang, Konstantin Lopyrev, and Percy Liang. SQuAD: $1 0 0 { , } 0 0 0 { + }$ questions for machine comprehension of text. In EMNLP, 2016. + +Marco Tulio Ribeiro, Sameer Singh, and Carlos Guestrin. Semantically equivalent adversarial rules for debugging NLP models. In ACL, 2018. + +Parsa Saadatpanah, Ali Shafahi, and Tom Goldstein. Adversarial attacks on copyright detection systems. arXiv preprint 1906.07153, 2019. + +Rico Sennrich, Barry Haddow, and Alexandra Birch. Neural machine translation of rare words with subword units. In ACL, 2016. + +A. Shafahi, M. Najibi, A. Ghiasi, Z. Xu, J. Dickerson, C. Studer, L. Davis, G. Taylor, and T. Goldstein. Adversarial Training for Free! In NeurIPS, 2019. + +Richard Socher, Alex Perelygin, Jean Wu, Jason Chuang, Christopher D Manning, Andrew Ng, and Christopher Potts. Recursive deep models for semantic compositionality over a sentiment treebank. In EMNLP, 2013. + +Jure Sokolic, Raja Giryes, Guillermo Sapiro, and Miguel Rodrigues. Generalization error of invariant classifiers. In AISTATS, 2017. + +Robert Speer, Joshua Chin, and Catherine Havasi. Conceptnet 5.5: An open multilingual graph of general knowledge. In AAAI, 2017. + +Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. Dropout: A simple way to prevent neural networks from overfitting. JMLR, 2014. + +Kai Sun, Dian Yu, Dong Yu, and Claire Cardie. Improving machine reading comprehension with general reading strategies. arXiv preprint arXiv:1810.13441, 2018. + +Alon Talmor, Jonathan Herzig, Nicholas Lourie, and Jonathan Berant. Commonsenseqa: A question answering challenge targeting commonsense knowledge. In NAACL, 2019. + +Alex Wang, Amanpreet Singh, Julian Michael, Felix Hill, Omer Levy, and Samuel R Bowman. Glue: A multi-task benchmark and analysis platform for natural language understanding. In ICLR, 2019. + +Alex Warstadt, Amanpreet Singh, and Samuel R. Bowman. Neural network acceptability judgments. arXiv preprint 1805.12471, 2018. + +Adina Williams, Nikita Nangia, and Samuel R. Bowman. A broad-coverage challenge corpus for sentence understanding through inference. In NAACL, 2018. + +Chaowei Xiao, Ruizhi Deng, Bo Li, Fisher Yu, Mingyan Liu, and Dawn Song. Characterizing adversarial examples based on spatial consistency information for semantic segmentation. In ECCV, 2018. + +Cihang Xie, Yuxin Wu, Laurens van der Maaten, Alan L. Yuille, and Kaiming He. Feature denoising for improving adversarial robustness. In CVPR, 2019. + +Huan Xu and Shie Mannor. Robustness and generalization. Machine learning, 2012. + +Zhilin Yang, Zihang Dai, Yiming Yang, Jaime Carbonell, Ruslan Salakhutdinov, and Quoc V Le. Xlnet: Generalized autoregressive pretraining for language understanding. In NeurIPS, 2019. + +Dinghuai Zhang, Tianyuan Zhang, Yiping Lu, Zhanxing Zhu, and Bin Dong. You only propagate once: Painless adversarial training using maximal principle. In NeurIPS, 2019. + +Zhengli Zhao, Dheeru Dua, and Sameer Singh. Generating natural adversarial examples. In ICLR, 2018. + +# A ADDITIONAL EXPERIMENTAL DETAILS + +# A.1 PROBLEM FORMULATIONS + +For tasks with ranking loss like ARC, CommonsenseQA, WNLI and QNLI, add the perturbation to the concatenation of the embeddings of all question/answer pairs. + +Additional tricks are required to achieve high performance on WNLI and QNLI for the GLUE benchmark. We use the same tricks as Liu et al. (2019b). For WNLI, we use the same WSC data provided by Liu et al. (2019b) for training. For testing, Liu et al. (2019b) also provided the test set with span annotations, but the order is different form the GLUE dataset. We re-order their test set by matching. For the QNLI, we follow Liu et al. (2019b) and formulate the problem as pairwise ranking problem, which is the same for CommonsenseQA. We find the matching pairs for both training set and testing set by matching the queries in the dev set. We predict “entailment” if the candidate has the higher score, and “not entailment” otherwise. + +# A.2 HYPER-PARAMETERS + +Table 6: Additional hyper-parameters on GLUE tasks. + +
MNLIQNLIQQPRTESST-2MRPCCoLASTS-B
E2E-11.5E-14.5E-11.5E-16E-14E-12E-13E-1
a1E-11E-11.5E-13E-21E-14E-22.5E-21E-1
m22232333
+ +As other adversarial training methods, introduces three additional hyper-parameters: step size $\alpha$ , maximum perturbation $\epsilon$ , number of steps $m$ . For all other hyper-parameters such as learning rate and number of iterations, we either search in the same interval as RoBERTa (on CommonsenseQA, ARC, and WNLI), or use exactly the same setting as RoBERTa (except for MRPC, where we find using a learning rate of $5 \times 1 0 ^ { - 6 }$ gives better results).13. We list the best combinations for $\alpha , \epsilon$ and $m$ for each of the GLUE tasks in Table 6. For WSC/WNLI, the best combination is $\epsilon = 1 e - 2 , \alpha =$ $5 e - 3 , m = 2$ . Notice even when $m \alpha < \epsilon$ , the maximum perturbation could still reach $\epsilon$ due to the random initialization. + +# B VARIANCE OF MAXIMUM INCREMENT OF LOSS + +
MethodsRTECoLAMRPC
M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-3)M-Inc (R)(10-3)N-Loss(10-3)
Vanilla5.1(15087)5.3(14346)4.5(920)6.1(13118)5.7(14122)5.2(447)10.2(929)10.2(955)1.9(76)
PGD4.7(10138)4.9(1828)6.2(752)128.2(1300)130.1(893)436.1(1276)5.7(321)5.7(155)5.4(54)
FreeLB3.0(1614)2.6(11114)4.1(595)1.4(1392)1.3(6231)7.2(615)3.6(167)3.6(601)2.7(54)
+ +Table 7: Median and Standard Deviation of the maximum increase in loss in the vicinity of the dev set samples for RoBERTa-Large model finetuned with different methods. Vanilla models are naturally trained RoBERTa’s. Nat Loss is the loss value on clean samples. Notice we require all clean samples here to be correctly classified by all models, which results in 227, 850 and 355 samples for RTE, CoLA and MRPC. + +Table 7 provides the complete results for the increment of loss in the interval, with median and standard deviation. + +# C ADDITIONAL RESULTS FOR ABLATION STUDIES + +Here we provide some additional results for comparison with YOPO as complementary results to Table 4. We will release the complete results for comparing with YOPO and without variational dropout on each of the GLUE tasks in our next revision. From the current results, there is no need + +
MethodsVanillaFreeLB-3YOPO-3-2YOPO-3-3
STS-B92.20 (.2)92.67 (.08)92.60 (.17)92.60 (0.20)
SST-296.56 (.3)96.79 (.2)96.44 (.2)96.33 (.1)
QNLI-94.98 (.2)94.96 (.1)-
QQP二92.60 (.03)92.55 (.05)*92.50 (.02)*
MNLI-90.61 (.1)90.59 (.2)90.45 (.2)
+ +Table 8: The median and standard deviation of the scores on the dev sets of STS-B, SST-2, QNLI, QQP and MNLI from the GLUE benchmark, each computed from 5 runs with the same hyper-parameters except for the random seeds (except for the results with YOPO on QQP, which are from 4 runs). Also note here we use a step size of $\alpha$ for the adversary of YOPO-m-n, so YOPO effectively uses a step size of $_ { n \alpha }$ . We use FreeLB- $\mathbf { \nabla } m$ to denote FreeLB with $m$ ascent steps, and YOPO-3- $\mathbf { \nabla } \cdot \mathbf { n }$ to denote YOPO with $_ n$ shallow-layer ascents. + +in using extra shallow-layer updates that YOPO advocates, since this consistently deteriorates the performance while introducing extra computations. \ No newline at end of file diff --git a/parse/train/BygzbyHFvB/BygzbyHFvB_content_list.json b/parse/train/BygzbyHFvB/BygzbyHFvB_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..1bc68a57b8443d99203e20ee8dfea75b42cb9f97 --- /dev/null +++ b/parse/train/BygzbyHFvB/BygzbyHFvB_content_list.json @@ -0,0 +1,1710 @@ +[ + { + "type": "text", + "text": "FREELB: ENHANCED ADVERSARIAL TRAINING FOR NATURAL LANGUAGE UNDERSTANDING ", + "text_level": 1, + "bbox": [ + 176, + 98, + 820, + 146 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Chen $\\mathbf { Z } \\mathbf { h } \\mathbf { u } ^ { \\mathbf { 1 } }$ , Yu Cheng2, Zhe $\\mathbf { G a n } ^ { 2 }$ , Siqi $\\mathbf { S u n } ^ { 2 }$ , Tom Goldstein1, Jingjing Liu2 1University of Maryland, College Park 2Microsoft Dynamics 365 AI Research {chenzhu,tomg}@cs.umd.edu, {yu.cheng,zhe.gan,siqi.sun,jingjl}@microsoft.com ", + "bbox": [ + 184, + 167, + 714, + 213 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 250, + 544, + 265 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Adversarial training, which minimizes the maximal risk for label-preserving input perturbations, has proved to be effective for improving the generalization of language models. In this work, we propose a novel adversarial training algorithm, FreeLB, that promotes higher invariance in the embedding space, by adding adversarial perturbations to word embeddings and minimizing the resultant adversarial risk inside different regions around input samples. To validate the effectiveness of the proposed approach, we apply it to Transformer-based models for natural language understanding and commonsense reasoning tasks. Experiments on the GLUE benchmark show that when applied only to the finetuning stage, it is able to improve the overall test scores of BERT-base model from 78.3 to 79.4, and RoBERTa-large model from 88.5 to 88.8. In addition, the proposed approach achieves state-of-the-art single-model test accuracies of $8 5 . 4 4 \\%$ and $6 7 . 7 5 \\%$ on ARC-Easy and ARC-Challenge. Experiments on CommonsenseQA benchmark further demonstrate that FreeLB can be generalized and boost the performance of RoBERTa-large model on other tasks as well. 1 ", + "bbox": [ + 233, + 282, + 764, + 489 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 518, + 334, + 534 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Adversarial training is a method for creating robust neural networks. During adversarial training, mini-batches of training samples are contaminated with adversarial perturbations (alterations that are small and yet cause misclassification), and then used to update network parameters until the resulting model learns to resist such attacks. Adversarial training was originally proposed as a means to enhance the security of machine learning systems (Goodfellow et al., 2015), especially for safety-critical systems like self-driving cars (Xiao et al., 2018) and copyright detection (Saadatpanah et al., 2019). ", + "bbox": [ + 174, + 550, + 825, + 647 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In this paper, we turn our focus away from the security benefits of adversarial training, and instead study its effects on generalization. While adversarial training boosts the robustness, it is widely accepted by computer vision researchers that it is at odds with generalization, with classification accuracy on non-corrupted images dropping as much as $1 0 \\%$ on CIFAR-10, and $1 5 \\%$ on Imagenet (Madry et al., 2018; Xie et al., 2019). Surprisingly, people observe the opposite result for language models (Miyato et al., 2017; Cheng et al., 2019), showing that adversarial training can improve both generalization and robustness. ", + "bbox": [ + 174, + 655, + 823, + 752 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "We will show that adversarial training significantly improves performance of state-of-the-art models for many language understanding tasks. In particular, we propose a novel adversarial training algorithm, called FreeLB (Free Large-Batch), which adds adversarial perturbations to word embeddings and minimizes the resultant adversarial loss around input samples. The method leverages recently proposed “free” training strategies (Shafahi et al., 2019; Zhang et al., 2019) to enrich the training data with diversified adversarial samples under different norm constraints at no extra cost than PGD-based (Projected Gradient Descent) adversarial training (Madry et al., 2018), which enables us to perform such diversified adversarial training on large-scale state-of-the-art models. We observe improved invariance in the embedding space for models trained with FreeLB, which is positively correlated with generalization. ", + "bbox": [ + 174, + 758, + 825, + 897 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "We perform comprehensive experiments to evaluate the performance of a variety of adversarial training algorithms on state-of-the-art language understanding models and tasks. In the comparisons with standard PGD (Madry et al., 2018), FreeAT (Shafahi et al., 2019) and YOPO (Zhang et al., 2019), FreeLB stands out to be the best for the datasets and models we evaluated. With FreeLB, we achieve state-of-the-art results on several important language understanding benchmarks. On the GLUE benchmark, FreeLB pushes the performance of the BERT-base model from 78.3 to 79.4. The overall score of the RoBERTa-large models on the GLUE benchmark is also lifted from 88.5 to 88.8, achieving best results on most of its sub-tasks. Experiments also show that FreeLB can boost the performance of RoBERTa-large on question answering tasks, such as the ARC and CommonsenseQA benchmarks. We also provide a comprehensive ablation study and analysis to demonstrate the effectiveness of our training process. ", + "bbox": [ + 174, + 103, + 825, + 256 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 291, + 343, + 308 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2.1 ADVERSARIAL TRAINING ", + "text_level": 1, + "bbox": [ + 176, + 328, + 393, + 342 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To improve the robustness of neural networks against adversarial examples, many defense strategies and models have been proposed, in which PGD-based adversarial training (Madry et al., 2018) is widely considered to be the most effective, since it largely avoids the the obfuscated gradient problem (Athalye et al., 2018). It formulates a class of adversarial training algorithms (Kurakin et al., 2017) into solving a minimax problem on the cross-entropy loss, which can be achieved reliably through multiple projected gradient ascent steps followed by a SGD (Stochastic Gradient Descent) step. ", + "bbox": [ + 174, + 353, + 825, + 450 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Despite being verified by Athalye et al. (2018) to avoid obfuscated gradients, Qin et al. (2019) shows that PGD-based adversarial training still leads to highly convolved and non-linear loss surfaces when $K$ is small, which could be readily broken under stronger adversaries. Thus, to be effective, the cost of PGD-based adversarial training is much higher than conventional training. To mitigate this cost, Shafahi et al. (2019) proposed a “free” adversarial training algorithm that simultaneously updates both model parameters and adversarial perturbations on a single backward pass. Using a similar formulation, Zhang et al. (2019) effectively reduce the total number of full forward and backward propagations for obtaining adversarial examples by restricting most of its adversarial updates in the first layer. ", + "bbox": [ + 174, + 457, + 825, + 583 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2.2 ADVERSARIAL EXAMPLES IN NATURAL LANGUAGES", + "text_level": 1, + "bbox": [ + 174, + 614, + 581, + 628 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Adversarial examples have been explored primarily in the image domain, and received many attention in text domain recently. Previous works on text adversaries have focused on heuristics for creating adversarial examples in the black-box setting, or on specific tasks. Jia & Liang (2017) propose to add distracting sentences to the input document in order to induce mis-classification. Zhao et al. (2018) generate text adversaries by projecting the input data to a latent space using GANs, and searching for adversaries close to the original instance. Belinkov & Bisk (2018) manipulate every word in a sentence with synthetic or natural noise in machine translation systems. Iyyer et al. (2018) propose a neural paraphrase model based on back-translated data to produce paraphrases that have different sentence structures. Different from previous work, ours is not to produce actual adversarial examples, but only take the benefit of adversarial training for natural language understanding. ", + "bbox": [ + 174, + 638, + 825, + 777 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We are not the first to observe that robust language models may perform better on clean test data. Miyato et al. (2017) extend adversarial and virtual adversarial training (Miyato et al., 2019) to the text domain to improve the performance on semi-supervised classification tasks. Ebrahimi et al. (2018) propose a character/word replacement for crafting attacks, and show employing adversarial examples in training renders the models more robust. Ribeiro et al. (2018) show that adversarial attacks can be used as a valuable tool for debugging NLP models. Cheng et al. (2019) also find that crafting adversarial examples can help neural machine translation significantly. Notably, these studies have focused on simple models or text generation tasks. Our work explores how to efficiently use the gradients obtained in adversarial training to boost the performance of state-of-the-art transformer-based models. ", + "bbox": [ + 174, + 785, + 825, + 922 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "3 ADVERSARIAL TRAINING FOR LANGUAGE UNDERSTANDING ", + "text_level": 1, + "bbox": [ + 174, + 102, + 709, + 118 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Pre-trained large-scale language models, such as BERT (Devlin et al., 2019), RoBERTa (Liu et al., 2019b), ALBERT (Lan et al., 2020) and T5 (Raffel et al., 2019), have proven to be highly effective for downstream tasks. We aim to further improve the generalization of these pre-trained language models on the downstream language understanding tasks by enhancing their robustness in the embedding space during finetuning on these tasks. We achieve this goal by creating “virtual” adversarial examples in the embedding space, and then perform parameter updates on these adversarial embeddings. Creating actual adversarial examples for language is difficult; even with state-of-theart language models as guidance (e.g., (Cheng et al., 2019)), it remains unclear how to construct label-preserving adversarial examples via word/character replacement without human evaluations, because the meaning of each word/character depends on the context (Ribeiro et al., 2018). Since we are only interested in the effects of adversarial training, rather than producing actual adversarial examples, we add norm-bounded adversarial perturbations to the embeddings of the input sentences using a gradient-based method. Note that our embedding-based adversary is strictly stronger than a more conventional text-based adversary, as our adversary can make manipulations on word embeddings that are not possible in the text domain. ", + "bbox": [ + 173, + 133, + 825, + 342 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "For models that incorporate various input representations, including word or subword embeddings, segment embeddings and position embeddings, our adversaries only modify the concatenated word or sub-word embeddings, leaving other components of the sentence representation unchanged. 2 Denote the sequence of one-hot representations of the input subwords as $\\pmb { Z } = [ z _ { 1 } , z _ { 2 } , . . . , z _ { n } ]$ , the embedding matrix as $V$ , and the language model (encoder) as a function ${ \\pmb y } = f _ { \\pmb \\theta } ( { \\pmb X } )$ , where $\\dot { \\boldsymbol { X } } = \\boldsymbol { V } \\boldsymbol { Z }$ is the subword embeddings, $\\textbf { { y } }$ is the output of the model (e.g., class probabilities for classification models), and $\\pmb \\theta$ denotes all the learnable parameters including the embedding matrix $V$ . We add adversarial perturbations $\\delta$ to the embeddings such that the prediction becomes $\\pmb { y } ^ { \\prime } = f _ { \\pmb { \\theta } } ( \\pmb { X } + \\pmb { \\delta } )$ . To preserve the semantics, we constrain the norm of $\\pmb { \\delta }$ to be small, and assume the model’s prediction should not change after the perturbation. This formulation is analogous to Miyato et al. (2017), with the difference that we do not require $\\boldsymbol { X }$ to be normalized. ", + "bbox": [ + 174, + 348, + 825, + 501 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.1 PGD FOR ADVERSARIAL TRAINING ", + "text_level": 1, + "bbox": [ + 176, + 517, + 464, + 531 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Standard adversarial training seeks to find optimal parameters $\\pmb { \\theta } ^ { * }$ to minimize the maximum risk for any $\\pmb { \\delta }$ within a norm ball as: ", + "bbox": [ + 176, + 540, + 823, + 569 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/17c85187abb9a6ea71a8c3e97ea4dd66fd478797846cf419f4a2d777a9491c4c.jpg", + "text": "$$\n\\operatorname* { m i n } _ { \\theta } \\mathbb { E } _ { ( Z , y ) \\sim \\mathcal { D } } \\left[ \\operatorname* { m a x } _ { \\| \\delta \\| \\leq \\epsilon } L ( f _ { \\theta } ( X + \\delta ) , y ) \\right] ,\n$$", + "text_format": "latex", + "bbox": [ + 359, + 573, + 638, + 608 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where $\\mathcal { D }$ is the data distribution, $y$ is the label, and $L$ is some loss function. We use the Frobenius norm to constrain $\\delta$ . For neural networks, the outer “min” is non-convex, and the inner “max” is non-concave. Nonetheless, Madry et al. (2018) demonstrated that this saddle-point problem can be solved reliably with SGD for the outer minimization and PGD (a standard method for large-scale constrained optimization, see (Combettes & Pesquet, 2011) and (Goldstein et al., 2014)), for the inner maximization. In particular, for the constraint $\\| \\delta \\| _ { F } \\le \\epsilon$ , with an additional assumption that the loss function is locally linear, PGD takes the following step (with step size $\\alpha$ ) in each iteration: ", + "bbox": [ + 174, + 611, + 825, + 709 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/be4aa28dea2f09e48329453f621909356a76b82a9114c7d9674cce7e2f1707f6.jpg", + "text": "$$\n\\delta _ { t + 1 } = \\Pi _ { \\| \\pmb { \\delta } \\| _ { F } \\leq \\epsilon } \\left( \\pmb { \\delta } _ { t } + \\alpha g ( \\pmb { \\delta } _ { t } ) / \\| g ( \\pmb { \\delta } _ { t } ) \\| _ { F } \\right) ,\n$$", + "text_format": "latex", + "bbox": [ + 354, + 713, + 642, + 732 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where $g ( \\delta _ { t } ) = \\nabla _ { \\delta } L ( f _ { \\theta } ( X + \\delta _ { t } ) , y )$ is the gradient of the loss with respect to $\\delta$ , and $\\Pi _ { \\| \\delta \\| _ { F } \\leq \\epsilon }$ performs a projection onto the $\\epsilon$ -ball. To achieve high-level robustness, multi-step adversarial examples are needed during training, which is computationally expensive. The $K$ -step PGD ( $K$ -PGD) requires $K$ forward-backward passes through the network, while the standard SGD update requires only one. As a result, the adversary generation step in adversarial training increases run-time by an order of magnitude—a catastrophic amount when training large state-of-the-art language models. ", + "bbox": [ + 173, + 736, + 825, + 821 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.2 LARGE-BATCH ADVERSARIAL TRAINING FOR FREE ", + "text_level": 1, + "bbox": [ + 173, + 837, + 575, + 852 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In the inner ascent steps of PGD, the gradients of the parameters can be obtained with almost no overhead when computing the gradients of the inputs. From this observation, FreeAT (Shafahi et al., ", + "bbox": [ + 176, + 859, + 821, + 888 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Algorithm 1 “Free” Large-Batch Adversarial Training (FreeLB- $K$ ) ", + "text_level": 1, + "bbox": [ + 173, + 103, + 619, + 118 + ], + "page_idx": 3 + }, + { + "type": "table", + "img_path": "images/faa4884339b2dc56b051cb475bba7c56913f2fcee10d81fc04db122bc7add815.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
ascent step size αRequire: Training samples X = {(Z,y)}, perturbation bound ε, learning rate T, ascent steps K,
1:Initialize 0
2: for epoch =1... Nep do
3:for minibatchB ℃Xdo
4:U(-∈,∈)
5:90↑0
6:
7:fort=1...K do
8:Accumulate gradient of parameters θ
9:gt←gt-1+kE(z,y)∈B[VθL(fe(X+δt-1),y)]
10:Update the perturbation δ via gradient ascend
11:gadu ←VsL(fθ(X+δt-1),y) δt ←II|δ|lr≤e(δt-1+α:gadu/llgadullF)
12:
13:end for
14:0←0-TgK
end for 15: end for
", + "bbox": [ + 174, + 123, + 823, + 363 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2019) and YOPO (Zhang et al., 2019) have been proposed to accelerate adversarial training. They achieve comparable robustness and generalization as standard PGD-trained models using only the same or a slightly larger number of forward-backward passes as natural training (i.e., SGD on clean samples). FreeAT takes one descent step on the parameters together with each of the $K$ ascent steps on the perturbation. As a result, FreeAT may suffer from the “stale gradient” problem (Dutta et al., 2018), where in every step $t$ , $\\delta _ { t }$ does not necessarily maximize the model with parameter $\\theta _ { t }$ since its update is based on $\\nabla _ { \\delta } L \\big ( f _ { \\pmb { \\theta } _ { t - 1 } } ( \\pmb { X } + \\delta _ { t - 1 } ) , y \\big )$ , and vice versa, $\\theta _ { t }$ does not necessarily minimize the adversarial risk with adversary $\\delta _ { t }$ since its update is based on $\\nabla _ { \\pmb { \\theta } } L \\big ( f _ { \\pmb { \\theta } _ { t - 1 } } ( \\pmb { X } + \\delta _ { t - 1 } ) , y \\big )$ . Such a problem may be more significant when the step size is large. ", + "bbox": [ + 173, + 388, + 825, + 515 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Different from FreeAT, YOPO accumulates the gradient of the parameters from each of the ascent steps, and updates the parameters only once after the $K$ inner ascent steps. YOPO also advocates that after each back-propagation, one should take the gradient of the first hidden layer as a constant and perform several additional updates on the adversary using the product of this constant and the Jacobian of the first layer of the network to obtain strong adversaries. However, when the first hidden layer is a linear layer as in their implementation, such an operation is equivalent to taking a larger step size on the adversary. The analysis backing the extra update steps also assumes a twice continuously differentiable loss, which does not hold for ReLU-based neural networks they experimented with, and thus the reasons for the success of such an algorithm remains obscure. We give empirical comparisons between YOPO and our approach in Sec. 4.3. ", + "bbox": [ + 173, + 521, + 825, + 661 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "To obtain better solutions for the inner max and avoid fundamental limitations on the function class, we propose FreeLB, which performs multiple PGD iterations to craft adversarial examples, and simultaneously accumulates the “free” parameter gradients $\\nabla _ { \\boldsymbol { \\theta } } L$ in each iteration. After that, it updates the model parameter $\\pmb \\theta$ all at once with the accumulated gradients. The overall procedure is shown in Algorithm 1, in which $X + \\delta _ { t }$ is an approximation to the local maximum within the intersection of two balls $\\mathcal { T } _ { t } = \\mathcal { B } _ { X + \\delta _ { 0 } } ( \\alpha t ) \\cap \\mathcal { B } _ { X } ( \\epsilon )$ . By taking a descent step along the averaged gradients at $X + \\delta _ { 0 } , . . . , X + \\delta _ { K - 1 }$ , we approximately optimize the following objective: ", + "bbox": [ + 174, + 666, + 825, + 765 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/ccae4d8ef9e13199ab20f9f8a5afaca5aac1d2c3bfff645daf32d9544c002c1d.jpg", + "text": "$$\n\\underset { \\pmb { \\theta } } { \\operatorname* { m i n } } \\mathbb { E } _ { ( Z , y ) \\sim \\mathcal { D } } \\left[ \\frac { 1 } { K } \\sum _ { t = 0 } ^ { K - 1 } \\underset { \\delta _ { t } \\in \\mathcal { Z } _ { t } } { \\operatorname* { m a x } } L \\big ( f _ { \\pmb { \\theta } } \\big ( \\pmb { X } + \\delta _ { t } \\big ) , y \\big ) \\right] ,\n$$", + "text_format": "latex", + "bbox": [ + 331, + 770, + 666, + 813 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "which is equivalent to replacing the original batch $\\boldsymbol { X }$ with a $K$ -times larger virtual batch, consisting of samples whose embeddings are $X + \\delta _ { 0 } , . . . , X + \\delta _ { K - 1 }$ . Compared with PGD-based adversarial training (Eq. 1), which minimizes the maximum risk at a single estimated point in the vicinity of each training sample, FreeLB minimizes the maximum risk at each ascent step at almost no overhead. ", + "bbox": [ + 174, + 816, + 825, + 875 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Intuitively, FreeLB could be a learning method with lower generalization error than PGD. Sokolic et al. (2017) have proved that the generalization error of a learning method invariant to a set of√ $T$ transformations may be up to $\\sqrt { T }$ smaller than a non-invariant learning method. According to their theory, FreeLB could have a more significant improvement over natural training, since FreeLB enforces the invariance to $K$ adversaries from a set of up to $K$ different norm constraints,3 while PGD only enforces invariance to a single norm constraint $\\epsilon$ . ", + "bbox": [ + 174, + 880, + 825, + 924 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 823, + 146 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Empirically, FreeLB does lead to higher robustness and invariance than PGD in the embedding space, in the sense that the maximum increase of loss in the vicinity of $\\boldsymbol { X }$ for models trained with FreeLB is smaller than that with PGD. See Sec. 4.3 for details. In theory, such improved robustness can lead to better generalization (Xu & Mannor, 2012), which is consistent with our experiments. Qin et al. (2019) also demonstrated that PGD-based method leads to highly convolved and non-linear loss surfaces in the vicinity of input samples when $K$ is small, indicating a lack of robustness. ", + "bbox": [ + 174, + 152, + 825, + 237 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.3 WHEN ADVERSARIAL TRAINING MEETS DROPOUT ", + "text_level": 1, + "bbox": [ + 174, + 255, + 570, + 270 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Usually, adversarial training is not used together with dropout (Srivastava et al., 2014). However, for some language models like RoBERTa (Liu et al., 2019b), dropout is used during the finetuning stage. In practice, when dropout is turned on, each ascent step of Algorithm 1 is optimizing $\\delta$ for a different network. Specifically, denote the dropout mask as $_ { m }$ with each entry $m _ { i } \\sim \\mathrm { B e r n o u l l i } ( p )$ . Similar to our analysis for FreeAT, the ascent step from $\\delta _ { t - 1 }$ to $\\delta _ { t }$ is based on $\\nabla _ { \\delta } L \\big ( f _ { \\theta ( m _ { t - 1 } ) } \\big ( \\boldsymbol { X } + \\delta _ { t - 1 } \\big ) , \\boldsymbol { y } \\big )$ , so $\\delta _ { t }$ is sub-optimal for $L ( f _ { \\theta ( m _ { t } ) } ( \\boldsymbol { X } + \\delta ) , y )$ . Here $\\theta ( m )$ is the effective parameters under dropout mask $_ { m }$ . ", + "bbox": [ + 174, + 277, + 825, + 377 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The more plausible solution is to use the same $_ { \\mathbf { \\nabla } } \\mathbf { m }$ in each step. When applying dropout to any network, the objective for $\\pmb \\theta$ is to minimize the expectation of loss under different networks determined by the dropout masks, which is achieved by minimizing the Monte Carlo estimation of the expected loss. In our case, the objective becomes: ", + "bbox": [ + 176, + 383, + 825, + 440 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/e662cc84309c58d4d57852d609bdc508f80860aaba1115045b618ae79744dc0a.jpg", + "text": "$$\n\\operatorname* { m i n } _ { \\theta } \\mathbb { E } _ { ( Z , y ) \\sim \\mathcal { D } , m \\sim \\mathcal { M } } \\left[ \\frac { 1 } { K } \\sum _ { t = 0 } ^ { K - 1 } \\operatorname* { m a x } _ { \\delta _ { t } \\in \\mathcal { T } _ { t } } L \\big ( f _ { \\theta ( m ) } ( X + \\delta _ { t } ) , y \\big ) \\right] ,\n$$", + "text_format": "latex", + "bbox": [ + 297, + 448, + 700, + 492 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where the 1-sample Monte Carlo estimation should be $\\begin{array} { r } { \\frac { 1 } { K } \\sum _ { t = 0 } ^ { K - 1 } \\operatorname* { m a x } _ { \\delta _ { t } \\in \\mathcal { T } _ { t } } L ( f _ { \\theta ( m _ { 0 } ) } ( X + \\delta _ { t } ) , y ) } \\end{array}$ and can be minimized by using FreeLB with dropout mask $m _ { 0 }$ in each ascent step. This is similar to applying Variational Dropout to RNNs as used in Gal & Ghahramani (2016). ", + "bbox": [ + 174, + 501, + 825, + 545 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 176, + 568, + 326, + 583 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this section, we provide comprehensive analysis on FreeLB through extensive experiments on three Natural Language Understanding benchmarks: GLUE (Wang et al., 2019), ARC (Clark et al., 2018) and CommonsenseQA (Talmor et al., 2019). We also compare the robustness and generalization of FreeLB with other adversarial training algorithms to demonstrate its strength. Additional experimental details are provided in the Appendix. ", + "bbox": [ + 174, + 599, + 825, + 670 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4.1 DATASETS ", + "text_level": 1, + "bbox": [ + 174, + 688, + 287, + 703 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "GLUE Benchmark. The GLUE benchmark is a collection of 9 natural language understanding tasks, namely Corpus of Linguistic Acceptability (CoLA; Warstadt et al. (2018)), Stanford Sentiment Treebank (SST; Socher et al. (2013)), Microsoft Research Paraphrase Corpus (MRPC; Dolan & Brockett (2005)), Semantic Textual Similarity Benchmark (STS; Agirre et al. (2007)), Quora Question Pairs (QQP; Iyer et al. (2017)), Multi-Genre NLI (MNLI; Williams et al. (2018)), Question NLI (QNLI; Rajpurkar et al. (2016)), Recognizing Textual Entailment (RTE; Dagan et al. (2006); Bar Haim et al. (2006); Giampiccolo et al. (2007); Bentivogli et al. (2009)) and Winograd NLI (WNLI; Levesque et al. (2011)). 8 of the tasks are formulated as classification problems and only STS-B is formulated as regression, but FreeLB applies to all of them. For BERT-base, we use the HuggingFace implementation4, and follow the single-task finetuning procedure as in Devlin et al. (2019). For RoBERTa, we use the fairseq implementation5. Same as Liu et al. (2019b), we also use single-task finetuning for all dev set results, and start with MNLI-finetuned models on RTE, MRPC and STS-B for the test submissions. ", + "bbox": [ + 173, + 714, + 825, + 868 + ], + "page_idx": 4 + }, + { + "type": "table", + "img_path": "images/e1f0b3873d4f551620e6abc0f84fd1bd6b832d5a4995eee5316a5213471483a2.jpg", + "table_caption": [ + "Table 1: Results (median and variance) on the dev sets of GLUE based on the RoBERTa-large model, from 5 runs with the same hyperparameter but different random seeds. ReImp is our reimplementation of RoBERTalarge. The training process can be very unstable even with the vanilla version. Here, both PGD on STS-B and FreeAT on RTE demonstrates such instability, with one unconverged instance out of five. " + ], + "table_footnote": [], + "table_body": "
MethodMNLI(Acc)QNLI(Acc)QQP(Acc)RTE(Acc)SST-2(Acc)MRPC(Acc)CoLA(Mcc)STS-B(Pearson)
Reported90.294.792.286.696.490.968.092.4
ReImp11-85.61 (1.7)96.56 (.3)90.69(.5)67.57 (1.3)92.20 (.2)
PGD90.53 (.2)94.87 (.2)92.49 (.07)87.41 (.9)96.44 (.1)90.93 (.2)69.67 (1.2)92.43 (7.)
FreeAT90.02 (.2)94.66 (.2)92.48(.08)86.69 (15.)96.10 (.2)90.69 (.4)68.80 (1.3)92.40 (.3)
FreeLB90.61 (.1)94.98 (.2)92.60 (.03)88.13 (1.2)96.79 (.2)91.42 (.7)71.12 (.9)92.67 (.08)
", + "bbox": [ + 192, + 101, + 800, + 198 + ], + "page_idx": 5 + }, + { + "type": "table", + "img_path": "images/1ffd483862d6f9e2fd41f54a7e4c5ac87fd33bba048718a29e5bb6a776b93922.jpg", + "table_caption": [ + "Table 2: Results on GLUE from the evaluation server, as of Sep 25, 2019. Metrics are the same as the leaderboard. Number under each task’s name is the size of the training set. FreeLB-BERT is the single-model results of BERT-base finetuned with FreeLB, and FreeLB-RoB is the ensemble of 7 RoBERTa-Large models for each task. References: 1: (Devlin et al., 2019); 2: (Liu et al., 2019a); 3: (Yang et al., 2019); 4: (Liu et al., 2019b). " + ], + "table_footnote": [], + "table_body": "
ModelScoreCoLA8.5kSST-267kMRPC3.7kSTS-B7kQQP364kMNLI-m/mm393kQNLI108kRTE2.5kWNLI634AX
BERT-base178.352.193.588.9/84.887.1/85.871.2/89.284.6/83.490.566.465.134.2
FreeLB-BERT79.454.593.688.1/83.587.7/86.772.7/89.685.7/84.691.870.165.136.9
MT-DNN287.668.496.592.7/90.391.1/90.773.7789.987.9/87.496.086.389.042.8
XLNet-Large88.467.896.893.0/90.791.6/91.174.2/90.390.2/89.898.686.390.447.5
RoBERTa488.567.896.792.3/89.892.2/91.974.3/90.290.8/90.298.988.289.048.7
FreeLB-RoB88.868.096.893.1/90.892.4/92.274.8/90.391.1/90.798.888.789.050.1
Human87.166.497.886.3/80.892.7/92.659.5/80.492.0/92.891.293.695.91
", + "bbox": [ + 176, + 263, + 825, + 392 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 484, + 821, + 512 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "ARC Benchmark. The ARC dataset (Clark et al., 2018) is a collection of multi-choice science questions from grade-school level exams. It is further divided into ARC-Challenge set with 2,590 question answer (QA) pairs and ARC-Easy set with 5,197 QA pairs. Questions in ARC-Challenge are more difficult and cannot be handled by simply using a retrieval and co-occurence based algorithm (Clark et al., 2018). A typical question is: ", + "bbox": [ + 174, + 518, + 825, + 589 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Which property of a mineral can be determined just by looking at it? ", + "bbox": [ + 176, + 597, + 624, + 611 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "(A) luster [correct] $( B )$ mass $( C )$ weight $( D )$ hardness. ", + "bbox": [ + 174, + 617, + 531, + 632 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "CommonsenseQA Benchmark. The CommonsenseQA dataset (Talmor et al., 2019) consists of 12,102 natural language questions that require human commonsense reasoning ability to answer. A typical question is : ", + "bbox": [ + 178, + 638, + 826, + 681 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Where can I stand on a river to see water falling without getting wet? ", + "bbox": [ + 178, + 688, + 633, + 703 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "(A) waterfall, (B) bridge [correct], (C) valley, $( D )$ stream, (E) bottom. ", + "bbox": [ + 176, + 709, + 629, + 724 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Each question has five candidate answers from ConceptNet (Speer et al., 2017). To make the question more difficult to solve, most answers have the same relation in ConceptNet to the key concept in the question. As shown in the above example, most answers can be connected to “river” by “AtLocation” relation in ConceptNet. For a fair comparison with the reported results in papers and leaderboard6, we use the official random split 1.11. ", + "bbox": [ + 174, + 731, + 825, + 801 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.2 EXPERIMENTAL RESULTS ", + "text_level": 1, + "bbox": [ + 174, + 818, + 392, + 832 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "GLUE We summarize results on the dev sets of GLUE in Table 1, comparing the proposed FreeLB against other adversatial training algorithms (PGD (Madry et al., 2018) and FreeAT (Shafahi et al., 2019)). We use the same step size $\\alpha$ and number of steps $m$ for PGD, FreeAT and FreeLB. FreeLB is consistently better than the two baselines. Comparisons and detailed discussions about ", + "bbox": [ + 174, + 843, + 823, + 900 + ], + "page_idx": 5 + }, + { + "type": "table", + "img_path": "images/e0294ede408252845a3f452283bba1eeb68e7d5fc0d948c4421b775c75aff2ef.jpg", + "table_caption": [ + "Table 3: Results on ARC and CommonsenseQA (CQA). ARC-Merge is the combination of ARC-Easy and ARC-Challenge, “MTL” stands for multi-task learning and “Ens” stands for ensemble. Results of XLNet $^ +$ RoBERTa $\\left( \\mathbf { M } \\mathbf { T } \\mathbf { L } { + } \\mathbf { E } \\mathbf { n } \\mathbf { s } \\right)$ and AristoRoBERTaV7 (MTL) are from the ARC leaderboards. Test (E) denotes the test set results with ensembles. For CQA, we report the highest dev and test accuracies among all models. The models with 78.81/72.19 dev/test accuracy (as in the table) have 71.84/78.64 test/dev accuracies respectively. " + ], + "table_footnote": [], + "table_body": "
ARC-Easy ARC-Challenge ARC-Merge CQADev Test Dev Test Dev Test Dev Test Test (E)
TestDevTestDevTest DevTest
RoBERTa(Reported)------78.4372.172.5
RoBERTa (ReImp)84.3984.1364.5464.4477.8377.6277.56--
FreeLB-RoBERTa84.9184.8165.8965.3678.3778.3978.8172.273.1
AristoRoBERTaV7(MTL):85.02-66.47-78.89--:
XLNet +RoBERTa (MTL+Ens)---67.06--二二二
FreeLB-RoBERTa(MTL)84.9185.4470.2367.7579.8679.60---
", + "bbox": [ + 173, + 101, + 825, + 205 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "YOPO (Zhang et al., 2019) are provided in Sec. 4.3. We have also submitted our results to the evaluation server, results provided in Table 2. FreeLB lifts the performance of the BERT-base model from 78.3 to 79.4, and RoBERTa-large model from 88.5 to 88.8 on overall scores. ", + "bbox": [ + 176, + 301, + 820, + 343 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "ARC For ARC, a corpus of 14 million related science documents (from ARC Corpus, Wikipedia and other sources) is provided. For each QA pair, we first use a retrieval model to select top 10 related documents. Then, given these retrieved documents7, we use RoBERTa-large model to encode $\\langle s \\rangle$ Retrieved Documents $\\langle / s \\rangle$ Question $^ +$ Answer $\\langle / s \\rangle$ , where $\\langle \\mathbf { s } \\rangle$ and $\\langle / \\mathrm { s } \\rangle$ are special tokens for RoBERTa model8. We then apply a fully-connected layer to the representation of the [CLS] token to compute the final logit, and use standard cross-entropy loss for model training. ", + "bbox": [ + 174, + 351, + 825, + 434 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Results are summarized in Table 3. Following Sun et al. (2018), we first finetune the RoBERTa model on the RACE dataset (Lai et al., 2017). The finetuned RoBERTa model achieves $8 5 . 7 0 \\%$ and $8 5 . 2 4 \\%$ accuracy on the development and test set of RACE, respectively. Based on this, we further finetune the model on both ARC-Easy and ARC-Challenge datasets with the same hyper-parameter searching strategy (for 5 epochs), which achieves $8 4 . 1 3 \\% / 6 4 . 4 4 \\%$ test accuracy on ARC-Easy/ARCChallenge. And by adding FreeLB finetuning, we can reach $8 4 . 8 1 \\% / 6 5 . 3 6 \\%$ , a significant boost on ARC benchmark, demonstrating the effectiveness of FreeLB. ", + "bbox": [ + 173, + 441, + 825, + 539 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To further improve the results, we apply a multi-task learning (MTL) strategy using additional datasets. We first finetune the model on RACE (Lai et al., 2017), and then finetune on a joint dataset of ARC-Easy, ARC-Challenge, OpenbookQA (Mihaylov et al., 2018) and Regents Living Environment9. Based on this, we further finetune our model on ARC-Easy and ARC-Challenge with FreeLB. After finetuning, our single model achieves $6 7 . 7 5 \\%$ test accuracy on ARC-Challenge and $8 5 . 4 4 \\%$ on ARC-Easy, both outperforming the best submission on the official leaderboard10. ", + "bbox": [ + 174, + 546, + 825, + 628 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "CommonsenseQA Similar to the training strategy in Liu et al. (2019b), we construct five inputs for each question by concatenating the question and each answer separately, then encode each input with the representation of the [CLS] token. A final score is calculated by applying the representation of [CLS] to a fully-connected layer. Following the fairseq repository11, the input is formatted as: ${ \\mathfrak { n } } ( s ) Q$ : Where can I stand on a river to see water falling without getting wet? $\\langle / s \\rangle A$ : waterfall $\\langle \\langle s \\rangle ^ { \\ast } \\cdot \\mathbf { \\vec { \\mathbf { \\mu } } }$ , where $\\cdot _ { Q }$ :’ and $^ { , } A$ :’ are the prefix for question and answer, respectively. ", + "bbox": [ + 174, + 636, + 825, + 719 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Results are summarized in Table 3. We obtained a dev-set accuracy of $7 7 . 5 6 \\%$ with the RoBERTalarge model. When using FreeLB finetuning, we achieved $7 8 . 8 1 \\%$ , a $1 . 2 5 \\%$ absolute gain. Compared with the results reported from fairseq repository, which obtains $7 8 . 4 3 \\%$ accuracy on the devset, FreeLB still achieves better performance. Our submission to the CommonsenseQA leaderboard achieves $7 2 . 2 \\%$ single-model test set accuracy, and the result of a 20-model ensemble is $7 3 . 1 \\%$ , which achieves No.1 among all the submissions without making use of ConceptNet. ", + "bbox": [ + 173, + 727, + 825, + 810 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/22299a0200d7157b9946af1d49851cd5bfb444546715f02cc8dfdb5fe86e9613.jpg", + "table_caption": [ + "Table 4: The median and standard deviation of the scores on the dev sets of RTE, CoLA and MRPC from the GLUE benchmark, computed from 5 runs with the same hyper-parameters except for the random seeds. We use FreeLB- $\\mathbf { \\nabla } m$ to denote FreeLB with $m$ ascent steps, and FreeLB- ${ . 3 ^ { * } }$ to denote the version without reusing the dropout mask. " + ], + "table_footnote": [], + "table_body": "
MethodsVanillaFreeLB-3*FreeLB-3YOPO-3-2YOPO-3-3
RTE85.61 (1.67)87.14 (1.29)88.13 (1.21)87.05 (1.36)87.05 (0.20)
CoLA67.57 (1.30)69.31 (1.16)71.12 (0.90)70.40 (0.91)69.91 (1.16)
MRPC90.69 (0.54)90.93 (0.66)91.42 (0.72)90.44 (0.62)90.69 (0.37)
", + "bbox": [ + 230, + 101, + 763, + 159 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/123f8ec948de592b6c31088d940779fcf701f6d633979bb44b4a997bb3feb667.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
MethodsRTECoLAMRPC
M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-3)M-Inc (R)(10-3)N-Loss(10-3)
Vanilla5.15.34.56.15.75.210.210.21.9
PGD4.74.96.2128.2130.1436.15.75.75.4
FreeLB3.02.64.11.41.37.23.63.62.7
", + "bbox": [ + 173, + 219, + 825, + 299 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Table 5: Median of the maximum increase in loss in the vicinity of the dev set samples for RoBERTa-Large model finetuned with different methods. Vanilla models are naturally trained RoBERTa’s. M-Inc: Max Inc, MInc (R): Max Inc (R). Nat Loss (N-Loss) is the loss value on clean samples. Notice we require all clean samples here to be correctly classified by all models, which results in 227, 850 and 355 samples for RTE, CoLA and MRPC, respectively. We also give the variance in the Appendix. ", + "bbox": [ + 173, + 304, + 825, + 368 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.3 ABLATION STUDY AND ANALYSIS ", + "text_level": 1, + "bbox": [ + 176, + 386, + 450, + 400 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In this sub-section, we first show the importance of reusing dropout mask, then conduct a thorough ablation study on FreeLB over the GLUE benchmark to analyze the robustness and generalization strength of different approaches. We observe that it is unnecessary to perform shallow-layer updates on the adversary as YOPO for our case, and FreeLB results in improved robustness and generalization compared with PGD. ", + "bbox": [ + 174, + 411, + 825, + 481 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Importance of Reusing Mask Table 4 (columns 2 to 4) compares the results of FreeLB with and without reusing the same dropout mask in each ascent step, as proposed in Sec. 3.3. With reusing, FreeLB can achieve a larger improvement over the naturally trained models. Thus, we enable mask reusing for all experiments involving RoBERTa. ", + "bbox": [ + 174, + 488, + 825, + 545 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Comparing the Robustness Table 5 provides the comparisons of the maximum increment of loss in the vicinity of each sample, defined as: ", + "bbox": [ + 173, + 551, + 823, + 579 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/cf1340b64e7dea43e7ba8813f0bad358c01a42d13b806c2cf4c77f077ec893d9.jpg", + "text": "$$\n\\displaystyle \\Delta L _ { \\mathrm { m a x } } ( \\boldsymbol { X } , \\epsilon ) = \\operatorname* { m a x } _ { \\| \\delta \\| \\leq \\epsilon } L ( f _ { \\boldsymbol { \\theta } } ( \\boldsymbol { X } + \\delta ) , \\boldsymbol { y } ) - L ( f _ { \\boldsymbol { \\theta } } ( \\boldsymbol { X } ) , \\boldsymbol { y } ) ,\n$$", + "text_format": "latex", + "bbox": [ + 308, + 582, + 689, + 608 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "which reflects the robustness and invariance of the model in the embedding space. In practice, we use PGD steps as in Eq. 2 to find the value of ${ \\Delta } L _ { \\mathrm { m a x } } ( \\boldsymbol { X } , \\boldsymbol { \\epsilon } )$ . We found that when using a step size of $5 { \\cdot } 1 0 ^ { - 3 }$ and $\\epsilon = 0 . 0 1 \\| X \\| _ { F }$ , the PGD iterations converge to almost the same value, starting from 100 different random initializations of $\\pmb { \\delta }$ for the RoBERTa models, trained with or without FreeLB. This indicates that PGD reliably finds $\\Delta L _ { \\mathrm { m a x } }$ for these models. Therefore, we compute ${ \\Delta } L _ { \\mathrm { m a x } } ( X , \\epsilon )$ for each $\\boldsymbol { X }$ via a 2000-step PGD. ", + "bbox": [ + 174, + 611, + 825, + 695 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Samples with small margins exist even for models with perfect accuracy, which could give a false sense of vulnerability of the model. To rule out the outlier effect and make ${ \\Delta } L _ { \\mathrm { m a x } } ( \\boldsymbol { X } , \\epsilon )$ comparable across different samples, we only consider samples that all the evaluated models can correctly classify, and search for an $\\epsilon$ for each sample such that the reference model can correctly classify all samples within the $\\epsilon$ ball.12 However, such choice of per-sample $\\epsilon$ favors the reference model by design. To make fair comparisons, Table 5 provides the median of ${ \\Delta } L _ { \\mathrm { m a x } } ( \\boldsymbol { X } , \\epsilon )$ with per-sample $\\epsilon$ from models trained by FreeLB (Max Inc) and PGD (Mac Inc (R)), respectively. ", + "bbox": [ + 173, + 702, + 825, + 800 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Across all three datasets and different reference models, FreeLB has the smallest median increment even when starting from a larger natural loss than vanilla models. This demonstrates that FreeLB is more robust and invariant in most cases. Such results are also consistent with the models’ dev set performance (the performances for Vanilla/PGD/FreeLB models on RTE, CoLA and MRPC are 86.69/87.41/89.21, 69.91/70.84/71.40, 91.67/91.17/91.17, respectively). ", + "bbox": [ + 174, + 806, + 825, + 876 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Comparing with YOPO The original implementation of YOPO (Zhang et al., 2019) chooses the first convolutional layer of the ResNets as $f _ { 0 }$ for updating the adversary in the “s-loop”. As a result, each step of the “s-loop” should be using exactly the same value to update the adversary,and YOPO$m { - } n$ degenerates into FreeLB with a $n$ -times large step size. To avoid that, we choose the layers up to the output of the first Transformer block as $f _ { 0 }$ when implementing YOPO. To make the total amount of update on the adversary equal, we take the hyper-parameters for FreeLB- $m$ and only change the step size $\\alpha$ into $\\alpha / n$ for YOPO- $m { \\cdot } n$ . Table 4 shows that FreeLB performs consistently better than YOPO on all three datasets. Accidentally, we also give the results comparing with YOPO- $\\mathbf { \\nabla } m - n$ without changing the step size $\\alpha$ for YOPO in Table 8. The gap between two approaches seem to shrink, which may be caused by using a larger total step size for the YOPO adversaries. We leave exhaustive hyperparameter search for both models as our future work. ", + "bbox": [ + 174, + 103, + 825, + 256 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 CONCLUSION ", + "text_level": 1, + "bbox": [ + 176, + 276, + 318, + 292 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In this work, we have developed an adversarial training approach, FreeLB, to improve natural language understanding. The proposed approach adds perturbations to continuous word embeddings using a gradient method, and minimizes the resultant adversarial risk in an efficient way. FreeLB is able to boost Transformer-based model (BERT and RoBERTa) on several datasets and achieve new state of the art on GLUE and ARC benchmarks. Empirical study demonstrates that our method results in both higher robustness in the embedding space than natural training and better generalization ability. Such observation is also consistent with recent findings in Computer Vision. However, adversarial training still takes significant overhead compared with vanilla SGD. How to accelerate this process while improving generalization is an interesting future direction. ", + "bbox": [ + 174, + 308, + 825, + 433 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Acknowledgements: Goldstein and Zhu were supported in part by the DARPA GARD, DARPA QED for RML, and AFOSR MURI programs. ", + "bbox": [ + 176, + 448, + 821, + 477 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 176, + 497, + 285, + 512 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Eneko Agirre, Llu’is M‘arquez, and Richard Wicentowski (eds.). Proceedings of the Fourth International Workshop on Semantic Evaluations (SemEval-2007). Association for Computational Linguistics, 2007. ", + "bbox": [ + 174, + 520, + 825, + 561 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Anish Athalye, Nicholas Carlini, and David Wagner. Obfuscated gradients give a false sense of security: Circumventing defenses to adversarial examples. In ICML, 2018. ", + "bbox": [ + 174, + 570, + 821, + 599 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Roy Bar Haim, Ido Dagan, Bill Dolan, Lisa Ferro, Danilo Giampiccolo, Bernardo Magnini, and Idan Szpektor. The second PASCAL recognising textual entailment challenge. 2006. ", + "bbox": [ + 173, + 607, + 821, + 637 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Yonatan Belinkov and Yonatan Bisk. Synthetic and natural noise both break neural machine translation. In ICLR, 2018. ", + "bbox": [ + 174, + 645, + 821, + 674 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Luisa Bentivogli, Ido Dagan, Hoa Trang Dang, Danilo Giampiccolo, and Bernardo Magnini. The fifth PASCAL recognizing textual entailment challenge. 2009. ", + "bbox": [ + 174, + 681, + 820, + 712 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Yong Cheng, Lu Jiang, and Wolfgang Macherey. Robust neural machine translation with doubly adversarial inputs. In ACL, 2019. ", + "bbox": [ + 169, + 719, + 821, + 747 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Peter Clark, Isaac Cowhey, Oren Etzioni, Tushar Khot, Ashish Sabharwal, Carissa Schoenick, and Oyvind Tafjord. Think you have solved question answering? try arc, the ai2 reasoning challenge. arXiv preprint arXiv:1803.05457, 2018. ", + "bbox": [ + 173, + 756, + 823, + 799 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Patrick L Combettes and Jean-Christophe Pesquet. Proximal splitting methods in signal processing. In Fixed-point algorithms for inverse problems in science and engineering. 2011. ", + "bbox": [ + 173, + 806, + 820, + 837 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Ido Dagan, Oren Glickman, and Bernardo Magnini. The PASCAL recognising textual entailment challenge. In Machine learning challenges. evaluating predictive uncertainty, visual object classification, and recognising tectual entailment. Springer, 2006. ", + "bbox": [ + 174, + 844, + 820, + 887 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. Bert: Pre-training of deep bidirectional transformers for language understanding. In NAACL, 2019. ", + "bbox": [ + 174, + 895, + 821, + 924 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "William B Dolan and Chris Brockett. Automatically constructing a corpus of sentential paraphrases. In Proceedings of the International Workshop on Paraphrasing, 2005. ", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Sanghamitra Dutta, Gauri Joshi, Soumyadip Ghosh, Parijat Dube, and Priya Nagpurkar. Slow and stale gradients can win the race: Error-runtime trade-offs in distributed sgd. In AISTATS, pp. 803–812, 2018. ", + "bbox": [ + 174, + 141, + 821, + 184 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Javid Ebrahimi, Anyi Rao, Daniel Lowd, and Dejing Dou. HotFlip: White-box adversarial examples for text classification. In ACL, 2018. ", + "bbox": [ + 173, + 193, + 823, + 222 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Yarin Gal and Zoubin Ghahramani. A theoretically grounded application of dropout in recurrent neural networks. In NeurIPS, 2016. ", + "bbox": [ + 171, + 231, + 823, + 261 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Danilo Giampiccolo, Bernardo Magnini, Ido Dagan, and Bill Dolan. The third PASCAL recognizing textual entailment challenge. In Proceedings of the ACL-PASCAL workshop on textual entailment and paraphrasing, 2007. ", + "bbox": [ + 173, + 268, + 826, + 313 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Tom Goldstein, Christoph Studer, and Richard Baraniuk. A field guide to forward-backward splitting with a fasta implementation. arXiv preprint 1411.3406, 2014. ", + "bbox": [ + 174, + 320, + 823, + 351 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ian Goodfellow, Jonathon Shlens, and Christian Szegedy. Explaining and harnessing adversarial examples. In ICLR, 2015. ", + "bbox": [ + 173, + 358, + 823, + 388 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Shankar Iyer, Nikhil Dandekar, and Kornl Csernai. First quora dataset release: Question pairs, 2017. URL https://www.quora.com/q/quoradata/ First-Quora-Dataset-Release-Question-Pairs. ", + "bbox": [ + 174, + 397, + 825, + 440 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Mohit Iyyer, John Wieting, Kevin Gimpel, and Luke Zettlemoyer. Adversarial example generation with syntactically controlled paraphrase networks. In NAACL, 2018. ", + "bbox": [ + 174, + 449, + 823, + 478 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Robin Jia and Percy Liang. Adversarial examples for evaluating reading comprehension systems. In EMNLP, 2017. ", + "bbox": [ + 173, + 487, + 823, + 516 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Alexey Kurakin, Ian Goodfellow, and Samy Bengio. Adversarial machine learning at scale. In ICLR, 2017. ", + "bbox": [ + 174, + 525, + 823, + 554 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Guokun Lai, Qizhe Xie, Hanxiao Liu, Yiming Yang, and Eduard Hovy. Race: Large-scale reading comprehension dataset from examinations. arXiv preprint arXiv:1704.04683, 2017. ", + "bbox": [ + 173, + 563, + 825, + 593 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Zhenzhong Lan, Mingda Chen, Sebastian Goodman, Kevin Gimpel, Piyush Sharma, and Radu Soricut. Albert: A lite bert for self-supervised learning of language representations. ICLR, 2020. ", + "bbox": [ + 174, + 601, + 825, + 631 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Hector J Levesque, Ernest Davis, and Leora Morgenstern. The Winograd schema challenge. In AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning, 2011. ", + "bbox": [ + 173, + 638, + 825, + 669 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Xiaodong Liu, Pengcheng He, Weizhu Chen, and Jianfeng Gao. Multi-task deep neural networks for natural language understanding. In ACL, 2019a. ", + "bbox": [ + 173, + 676, + 823, + 707 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Yinhan Liu, Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen, Omer Levy, Mike Lewis, Luke Zettlemoyer, and Veselin Stoyanov. Roberta: A robustly optimized bert pretraining approach. arXiv preprint arXiv:1907.11692, 2019b. ", + "bbox": [ + 178, + 714, + 823, + 758 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu. Towards deep learning models resistant to adversarial attacks. In ICLR, 2018. ", + "bbox": [ + 171, + 767, + 821, + 796 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Todor Mihaylov, Peter Clark, Tushar Khot, and Ashish Sabharwal. Can a suit of armor conduct electricity? a new dataset for open book question answering. arXiv preprint arXiv:1809.02789, 2018. ", + "bbox": [ + 176, + 805, + 823, + 848 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Takeru Miyato, Andrew M Dai, and Ian Goodfellow. Adversarial training methods for semisupervised text classification. In ICLR, 2017. ", + "bbox": [ + 174, + 857, + 820, + 886 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Takeru Miyato, Shin-ichi Maeda, Masanori Koyama, and Shin Ishii. Virtual adversarial training: A regularization method for supervised and semi-supervised learning. TPAMI, 2019. ", + "bbox": [ + 176, + 895, + 820, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Chongli Qin, James Martens, Sven Gowal, Dilip Krishnan, Alhussein Fawzi, Soham De, Robert Stanforth, Pushmeet Kohli, et al. Adversarial robustness through local linearization. In NeurIPS, 2019. ", + "bbox": [ + 176, + 103, + 823, + 145 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Colin Raffel, Noam Shazeer, Adam Roberts, Katherine Lee, Sharan Narang, Michael Matena, Yanqi Zhou, Wei Li, and Peter J Liu. Exploring the limits of transfer learning with a unified text-to-text transformer. arXiv preprint 1910.10683, 2019. ", + "bbox": [ + 176, + 156, + 821, + 199 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Pranav Rajpurkar, Jian Zhang, Konstantin Lopyrev, and Percy Liang. SQuAD: $1 0 0 { , } 0 0 0 { + }$ questions for machine comprehension of text. In EMNLP, 2016. ", + "bbox": [ + 173, + 208, + 821, + 238 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Marco Tulio Ribeiro, Sameer Singh, and Carlos Guestrin. Semantically equivalent adversarial rules for debugging NLP models. In ACL, 2018. ", + "bbox": [ + 173, + 247, + 823, + 276 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Parsa Saadatpanah, Ali Shafahi, and Tom Goldstein. Adversarial attacks on copyright detection systems. arXiv preprint 1906.07153, 2019. ", + "bbox": [ + 173, + 286, + 823, + 315 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Rico Sennrich, Barry Haddow, and Alexandra Birch. Neural machine translation of rare words with subword units. In ACL, 2016. ", + "bbox": [ + 173, + 324, + 823, + 354 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "A. Shafahi, M. Najibi, A. Ghiasi, Z. Xu, J. Dickerson, C. Studer, L. Davis, G. Taylor, and T. Goldstein. Adversarial Training for Free! In NeurIPS, 2019. ", + "bbox": [ + 168, + 363, + 823, + 392 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Richard Socher, Alex Perelygin, Jean Wu, Jason Chuang, Christopher D Manning, Andrew Ng, and Christopher Potts. Recursive deep models for semantic compositionality over a sentiment treebank. In EMNLP, 2013. ", + "bbox": [ + 173, + 401, + 821, + 445 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Jure Sokolic, Raja Giryes, Guillermo Sapiro, and Miguel Rodrigues. Generalization error of invariant classifiers. In AISTATS, 2017. ", + "bbox": [ + 169, + 454, + 823, + 484 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Robert Speer, Joshua Chin, and Catherine Havasi. Conceptnet 5.5: An open multilingual graph of general knowledge. In AAAI, 2017. ", + "bbox": [ + 169, + 493, + 823, + 522 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. Dropout: A simple way to prevent neural networks from overfitting. JMLR, 2014. ", + "bbox": [ + 174, + 531, + 821, + 563 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Kai Sun, Dian Yu, Dong Yu, and Claire Cardie. Improving machine reading comprehension with general reading strategies. arXiv preprint arXiv:1810.13441, 2018. ", + "bbox": [ + 173, + 570, + 821, + 601 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Alon Talmor, Jonathan Herzig, Nicholas Lourie, and Jonathan Berant. Commonsenseqa: A question answering challenge targeting commonsense knowledge. In NAACL, 2019. ", + "bbox": [ + 173, + 609, + 823, + 638 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Alex Wang, Amanpreet Singh, Julian Michael, Felix Hill, Omer Levy, and Samuel R Bowman. Glue: A multi-task benchmark and analysis platform for natural language understanding. In ICLR, 2019. ", + "bbox": [ + 173, + 648, + 825, + 691 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Alex Warstadt, Amanpreet Singh, and Samuel R. Bowman. Neural network acceptability judgments. arXiv preprint 1805.12471, 2018. ", + "bbox": [ + 171, + 702, + 823, + 731 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Adina Williams, Nikita Nangia, and Samuel R. Bowman. A broad-coverage challenge corpus for sentence understanding through inference. In NAACL, 2018. ", + "bbox": [ + 171, + 739, + 823, + 770 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Chaowei Xiao, Ruizhi Deng, Bo Li, Fisher Yu, Mingyan Liu, and Dawn Song. Characterizing adversarial examples based on spatial consistency information for semantic segmentation. In ECCV, 2018. ", + "bbox": [ + 176, + 779, + 823, + 821 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Cihang Xie, Yuxin Wu, Laurens van der Maaten, Alan L. Yuille, and Kaiming He. Feature denoising for improving adversarial robustness. In CVPR, 2019. ", + "bbox": [ + 173, + 832, + 823, + 859 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Huan Xu and Shie Mannor. Robustness and generalization. Machine learning, 2012. ", + "bbox": [ + 173, + 869, + 728, + 886 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Zhilin Yang, Zihang Dai, Yiming Yang, Jaime Carbonell, Ruslan Salakhutdinov, and Quoc V Le. Xlnet: Generalized autoregressive pretraining for language understanding. In NeurIPS, 2019. ", + "bbox": [ + 176, + 895, + 820, + 924 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Dinghuai Zhang, Tianyuan Zhang, Yiping Lu, Zhanxing Zhu, and Bin Dong. You only propagate once: Painless adversarial training using maximal principle. In NeurIPS, 2019. ", + "bbox": [ + 173, + 103, + 825, + 132 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Zhengli Zhao, Dheeru Dua, and Sameer Singh. Generating natural adversarial examples. In ICLR, 2018. ", + "bbox": [ + 174, + 141, + 823, + 170 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "A ADDITIONAL EXPERIMENTAL DETAILS ", + "text_level": 1, + "bbox": [ + 176, + 102, + 534, + 118 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "A.1 PROBLEM FORMULATIONS ", + "text_level": 1, + "bbox": [ + 176, + 133, + 403, + 147 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "For tasks with ranking loss like ARC, CommonsenseQA, WNLI and QNLI, add the perturbation to the concatenation of the embeddings of all question/answer pairs. ", + "bbox": [ + 174, + 160, + 823, + 188 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Additional tricks are required to achieve high performance on WNLI and QNLI for the GLUE benchmark. We use the same tricks as Liu et al. (2019b). For WNLI, we use the same WSC data provided by Liu et al. (2019b) for training. For testing, Liu et al. (2019b) also provided the test set with span annotations, but the order is different form the GLUE dataset. We re-order their test set by matching. For the QNLI, we follow Liu et al. (2019b) and formulate the problem as pairwise ranking problem, which is the same for CommonsenseQA. We find the matching pairs for both training set and testing set by matching the queries in the dev set. We predict “entailment” if the candidate has the higher score, and “not entailment” otherwise. ", + "bbox": [ + 173, + 194, + 825, + 306 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "A.2 HYPER-PARAMETERS ", + "text_level": 1, + "bbox": [ + 176, + 324, + 367, + 338 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/4a6af4a2ca697bb9e27081b61d517c61fbe771acb7ab6a114f22e5ee01062b9f.jpg", + "table_caption": [ + "Table 6: Additional hyper-parameters on GLUE tasks. " + ], + "table_footnote": [], + "table_body": "
MNLIQNLIQQPRTESST-2MRPCCoLASTS-B
E2E-11.5E-14.5E-11.5E-16E-14E-12E-13E-1
a1E-11E-11.5E-13E-21E-14E-22.5E-21E-1
m22232333
", + "bbox": [ + 223, + 354, + 774, + 416 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "As other adversarial training methods, introduces three additional hyper-parameters: step size $\\alpha$ , maximum perturbation $\\epsilon$ , number of steps $m$ . For all other hyper-parameters such as learning rate and number of iterations, we either search in the same interval as RoBERTa (on CommonsenseQA, ARC, and WNLI), or use exactly the same setting as RoBERTa (except for MRPC, where we find using a learning rate of $5 \\times 1 0 ^ { - 6 }$ gives better results).13. We list the best combinations for $\\alpha , \\epsilon$ and $m$ for each of the GLUE tasks in Table 6. For WSC/WNLI, the best combination is $\\epsilon = 1 e - 2 , \\alpha =$ $5 e - 3 , m = 2$ . Notice even when $m \\alpha < \\epsilon$ , the maximum perturbation could still reach $\\epsilon$ due to the random initialization. ", + "bbox": [ + 173, + 459, + 825, + 571 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "B VARIANCE OF MAXIMUM INCREMENT OF LOSS ", + "text_level": 1, + "bbox": [ + 173, + 592, + 604, + 608 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/dc24cb509b23de841340a676916c10c0a5f0d23eba704bba7d0ecdae595f6dc7.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
MethodsRTECoLAMRPC
M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-3)M-Inc (R)(10-3)N-Loss(10-3)
Vanilla5.1(15087)5.3(14346)4.5(920)6.1(13118)5.7(14122)5.2(447)10.2(929)10.2(955)1.9(76)
PGD4.7(10138)4.9(1828)6.2(752)128.2(1300)130.1(893)436.1(1276)5.7(321)5.7(155)5.4(54)
FreeLB3.0(1614)2.6(11114)4.1(595)1.4(1392)1.3(6231)7.2(615)3.6(167)3.6(601)2.7(54)
", + "bbox": [ + 173, + 627, + 825, + 695 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Table 7: Median and Standard Deviation of the maximum increase in loss in the vicinity of the dev set samples for RoBERTa-Large model finetuned with different methods. Vanilla models are naturally trained RoBERTa’s. Nat Loss is the loss value on clean samples. Notice we require all clean samples here to be correctly classified by all models, which results in 227, 850 and 355 samples for RTE, CoLA and MRPC. ", + "bbox": [ + 174, + 707, + 825, + 757 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Table 7 provides the complete results for the increment of loss in the interval, with median and standard deviation. ", + "bbox": [ + 176, + 776, + 823, + 804 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "C ADDITIONAL RESULTS FOR ABLATION STUDIES ", + "text_level": 1, + "bbox": [ + 174, + 825, + 609, + 842 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Here we provide some additional results for comparison with YOPO as complementary results to Table 4. We will release the complete results for comparing with YOPO and without variational dropout on each of the GLUE tasks in our next revision. From the current results, there is no need ", + "bbox": [ + 176, + 857, + 825, + 898 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/8c04a7228cc8d5061e850a97d495da84f386812487797d0894db7899fc19501f.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
MethodsVanillaFreeLB-3YOPO-3-2YOPO-3-3
STS-B92.20 (.2)92.67 (.08)92.60 (.17)92.60 (0.20)
SST-296.56 (.3)96.79 (.2)96.44 (.2)96.33 (.1)
QNLI-94.98 (.2)94.96 (.1)-
QQP二92.60 (.03)92.55 (.05)*92.50 (.02)*
MNLI-90.61 (.1)90.59 (.2)90.45 (.2)
", + "bbox": [ + 285, + 101, + 709, + 185 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Table 8: The median and standard deviation of the scores on the dev sets of STS-B, SST-2, QNLI, QQP and MNLI from the GLUE benchmark, each computed from 5 runs with the same hyper-parameters except for the random seeds (except for the results with YOPO on QQP, which are from 4 runs). Also note here we use a step size of $\\alpha$ for the adversary of YOPO-m-n, so YOPO effectively uses a step size of $_ { n \\alpha }$ . We use FreeLB- $\\mathbf { \\nabla } m$ to denote FreeLB with $m$ ascent steps, and YOPO-3- $\\mathbf { \\nabla } \\cdot \\mathbf { n }$ to denote YOPO with $_ n$ shallow-layer ascents. ", + "bbox": [ + 173, + 189, + 826, + 252 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "in using extra shallow-layer updates that YOPO advocates, since this consistently deteriorates the performance while introducing extra computations. ", + "bbox": [ + 173, + 272, + 823, + 301 + ], + "page_idx": 13 + } +] \ No newline at end of file diff --git a/parse/train/BygzbyHFvB/BygzbyHFvB_middle.json b/parse/train/BygzbyHFvB/BygzbyHFvB_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..4811bda55f8fc9e74111ed9649403c4cda86eb33 --- /dev/null +++ b/parse/train/BygzbyHFvB/BygzbyHFvB_middle.json @@ -0,0 +1,36109 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 78, + 502, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 78, + 505, + 98 + ], + "spans": [ + { + "bbox": [ + 105, + 78, + 505, + 98 + ], + "score": 1.0, + "content": "FREELB: ENHANCED ADVERSARIAL TRAINING FOR", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 98, + 405, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 98, + 405, + 118 + ], + "score": 1.0, + "content": "NATURAL LANGUAGE UNDERSTANDING", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 113, + 133, + 437, + 169 + ], + "lines": [ + { + "bbox": [ + 112, + 134, + 437, + 148 + ], + "spans": [ + { + "bbox": [ + 112, + 134, + 137, + 148 + ], + "score": 1.0, + "content": "Chen", + "type": "text" + }, + { + "bbox": [ + 137, + 135, + 160, + 146 + ], + "score": 0.27, + "content": "\\mathbf { Z } \\mathbf { h } \\mathbf { u } ^ { \\mathbf { 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 134, + 234, + 148 + ], + "score": 1.0, + "content": ", Yu Cheng2, Zhe", + "type": "text" + }, + { + "bbox": [ + 234, + 135, + 258, + 146 + ], + "score": 0.44, + "content": "\\mathbf { G a n } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 134, + 280, + 148 + ], + "score": 1.0, + "content": ", Siqi", + "type": "text" + }, + { + "bbox": [ + 281, + 135, + 302, + 146 + ], + "score": 0.79, + "content": "\\mathbf { S u n } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 134, + 437, + 148 + ], + "score": 1.0, + "content": ", Tom Goldstein1, Jingjing Liu2", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 112, + 146, + 437, + 159 + ], + "spans": [ + { + "bbox": [ + 112, + 146, + 437, + 159 + ], + "score": 1.0, + "content": "1University of Maryland, College Park 2Microsoft Dynamics 365 AI Research", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 113, + 159, + 426, + 171 + ], + "spans": [ + { + "bbox": [ + 113, + 159, + 426, + 171 + ], + "score": 1.0, + "content": "{chenzhu,tomg}@cs.umd.edu, {yu.cheng,zhe.gan,siqi.sun,jingjl}@microsoft.com", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "title", + "bbox": [ + 278, + 198, + 333, + 210 + ], + "lines": [ + { + "bbox": [ + 276, + 198, + 335, + 211 + ], + "spans": [ + { + "bbox": [ + 276, + 198, + 335, + 211 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 143, + 224, + 468, + 388 + ], + "lines": [ + { + "bbox": [ + 141, + 222, + 469, + 237 + ], + "spans": [ + { + "bbox": [ + 141, + 222, + 469, + 237 + ], + "score": 1.0, + "content": "Adversarial training, which minimizes the maximal risk for label-preserving in-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 140, + 235, + 470, + 248 + ], + "spans": [ + { + "bbox": [ + 140, + 235, + 470, + 248 + ], + "score": 1.0, + "content": "put perturbations, has proved to be effective for improving the generalization of", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 245, + 469, + 259 + ], + "spans": [ + { + "bbox": [ + 141, + 245, + 469, + 259 + ], + "score": 1.0, + "content": "language models. In this work, we propose a novel adversarial training algorithm,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 256, + 469, + 270 + ], + "spans": [ + { + "bbox": [ + 141, + 256, + 469, + 270 + ], + "score": 1.0, + "content": "FreeLB, that promotes higher invariance in the embedding space, by adding adver-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 268, + 469, + 279 + ], + "spans": [ + { + "bbox": [ + 141, + 268, + 469, + 279 + ], + "score": 1.0, + "content": "sarial perturbations to word embeddings and minimizing the resultant adversarial", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 279, + 470, + 291 + ], + "spans": [ + { + "bbox": [ + 141, + 279, + 470, + 291 + ], + "score": 1.0, + "content": "risk inside different regions around input samples. To validate the effectiveness", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 289, + 470, + 302 + ], + "spans": [ + { + "bbox": [ + 141, + 289, + 470, + 302 + ], + "score": 1.0, + "content": "of the proposed approach, we apply it to Transformer-based models for natural", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 300, + 470, + 313 + ], + "spans": [ + { + "bbox": [ + 141, + 300, + 470, + 313 + ], + "score": 1.0, + "content": "language understanding and commonsense reasoning tasks. Experiments on the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 311, + 470, + 324 + ], + "spans": [ + { + "bbox": [ + 141, + 311, + 470, + 324 + ], + "score": 1.0, + "content": "GLUE benchmark show that when applied only to the finetuning stage, it is able", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 322, + 469, + 334 + ], + "spans": [ + { + "bbox": [ + 141, + 322, + 469, + 334 + ], + "score": 1.0, + "content": "to improve the overall test scores of BERT-base model from 78.3 to 79.4, and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 334, + 469, + 345 + ], + "spans": [ + { + "bbox": [ + 141, + 334, + 469, + 345 + ], + "score": 1.0, + "content": "RoBERTa-large model from 88.5 to 88.8. In addition, the proposed approach", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 142, + 344, + 469, + 356 + ], + "spans": [ + { + "bbox": [ + 142, + 344, + 371, + 356 + ], + "score": 1.0, + "content": "achieves state-of-the-art single-model test accuracies of", + "type": "text" + }, + { + "bbox": [ + 371, + 344, + 403, + 355 + ], + "score": 0.88, + "content": "8 5 . 4 4 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 344, + 422, + 356 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 423, + 344, + 455, + 355 + ], + "score": 0.88, + "content": "6 7 . 7 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 344, + 469, + 356 + ], + "score": 1.0, + "content": "on", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 355, + 470, + 368 + ], + "spans": [ + { + "bbox": [ + 141, + 355, + 470, + 368 + ], + "score": 1.0, + "content": "ARC-Easy and ARC-Challenge. Experiments on CommonsenseQA benchmark", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 367, + 470, + 378 + ], + "spans": [ + { + "bbox": [ + 141, + 367, + 470, + 378 + ], + "score": 1.0, + "content": "further demonstrate that FreeLB can be generalized and boost the performance of", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 377, + 333, + 388 + ], + "spans": [ + { + "bbox": [ + 141, + 377, + 333, + 388 + ], + "score": 1.0, + "content": "RoBERTa-large model on other tasks as well. 1", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 13 + }, + { + "type": "title", + "bbox": [ + 108, + 411, + 205, + 423 + ], + "lines": [ + { + "bbox": [ + 105, + 410, + 208, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 208, + 426 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 107, + 436, + 505, + 513 + ], + "lines": [ + { + "bbox": [ + 105, + 435, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 505, + 450 + ], + "score": 1.0, + "content": "Adversarial training is a method for creating robust neural networks. During adversarial training,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 448, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 505, + 459 + ], + "score": 1.0, + "content": "mini-batches of training samples are contaminated with adversarial perturbations (alterations that", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 459, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 505, + 471 + ], + "score": 1.0, + "content": "are small and yet cause misclassification), and then used to update network parameters until the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 470, + 506, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 506, + 482 + ], + "score": 1.0, + "content": "resulting model learns to resist such attacks. Adversarial training was originally proposed as a", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "score": 1.0, + "content": "means to enhance the security of machine learning systems (Goodfellow et al., 2015), especially for", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 491, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 506, + 505 + ], + "score": 1.0, + "content": "safety-critical systems like self-driving cars (Xiao et al., 2018) and copyright detection (Saadatpanah", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 502, + 159, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 159, + 514 + ], + "score": 1.0, + "content": "et al., 2019).", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 519, + 504, + 596 + ], + "lines": [ + { + "bbox": [ + 105, + 519, + 506, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 506, + 531 + ], + "score": 1.0, + "content": "In this paper, we turn our focus away from the security benefits of adversarial training, and instead", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 531, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 531, + 505, + 542 + ], + "score": 1.0, + "content": "study its effects on generalization. While adversarial training boosts the robustness, it is widely", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 541, + 506, + 553 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 506, + 553 + ], + "score": 1.0, + "content": "accepted by computer vision researchers that it is at odds with generalization, with classification", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 552, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 343, + 564 + ], + "score": 1.0, + "content": "accuracy on non-corrupted images dropping as much as", + "type": "text" + }, + { + "bbox": [ + 344, + 552, + 363, + 563 + ], + "score": 0.88, + "content": "1 0 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 552, + 447, + 564 + ], + "score": 1.0, + "content": "on CIFAR-10, and", + "type": "text" + }, + { + "bbox": [ + 447, + 552, + 467, + 563 + ], + "score": 0.88, + "content": "1 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 552, + 505, + 564 + ], + "score": 1.0, + "content": "on Ima-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 563, + 506, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 506, + 575 + ], + "score": 1.0, + "content": "genet (Madry et al., 2018; Xie et al., 2019). Surprisingly, people observe the opposite result for", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 573, + 506, + 587 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 506, + 587 + ], + "score": 1.0, + "content": "language models (Miyato et al., 2017; Cheng et al., 2019), showing that adversarial training can", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 585, + 285, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 585, + 285, + 597 + ], + "score": 1.0, + "content": "improve both generalization and robustness.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 107, + 601, + 505, + 711 + ], + "lines": [ + { + "bbox": [ + 106, + 601, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 106, + 601, + 505, + 614 + ], + "score": 1.0, + "content": "We will show that adversarial training significantly improves performance of state-of-the-art models", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 612, + 504, + 625 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 504, + 625 + ], + "score": 1.0, + "content": "for many language understanding tasks. In particular, we propose a novel adversarial training algo-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 623, + 505, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 505, + 636 + ], + "score": 1.0, + "content": "rithm, called FreeLB (Free Large-Batch), which adds adversarial perturbations to word embeddings", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 635, + 504, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 635, + 504, + 646 + ], + "score": 1.0, + "content": "and minimizes the resultant adversarial loss around input samples. The method leverages recently", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 645, + 506, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 645, + 506, + 658 + ], + "score": 1.0, + "content": "proposed “free” training strategies (Shafahi et al., 2019; Zhang et al., 2019) to enrich the train-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 657, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 505, + 669 + ], + "score": 1.0, + "content": "ing data with diversified adversarial samples under different norm constraints at no extra cost than", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 667, + 506, + 680 + ], + "spans": [ + { + "bbox": [ + 105, + 667, + 506, + 680 + ], + "score": 1.0, + "content": "PGD-based (Projected Gradient Descent) adversarial training (Madry et al., 2018), which enables us", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 678, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 678, + 505, + 691 + ], + "score": 1.0, + "content": "to perform such diversified adversarial training on large-scale state-of-the-art models. We observe", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 689, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 505, + 702 + ], + "score": 1.0, + "content": "improved invariance in the embedding space for models trained with FreeLB, which is positively", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 701, + 230, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 701, + 230, + 712 + ], + "score": 1.0, + "content": "correlated with generalization.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 40.5 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 119, + 722, + 387, + 732 + ], + "lines": [ + { + "bbox": [ + 119, + 720, + 388, + 733 + ], + "spans": [ + { + "bbox": [ + 119, + 720, + 388, + 733 + ], + "score": 1.0, + "content": "1Code is available at https://github.com/zhuchen03/FreeLB.", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 27, + 294, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "1", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 78, + 502, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 78, + 505, + 98 + ], + "spans": [ + { + "bbox": [ + 105, + 78, + 505, + 98 + ], + "score": 1.0, + "content": "FREELB: ENHANCED ADVERSARIAL TRAINING FOR", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 98, + 405, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 98, + 405, + 118 + ], + "score": 1.0, + "content": "NATURAL LANGUAGE UNDERSTANDING", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 113, + 133, + 437, + 169 + ], + "lines": [ + { + "bbox": [ + 112, + 134, + 437, + 148 + ], + "spans": [ + { + "bbox": [ + 112, + 134, + 137, + 148 + ], + "score": 1.0, + "content": "Chen", + "type": "text" + }, + { + "bbox": [ + 137, + 135, + 160, + 146 + ], + "score": 0.27, + "content": "\\mathbf { Z } \\mathbf { h } \\mathbf { u } ^ { \\mathbf { 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 134, + 234, + 148 + ], + "score": 1.0, + "content": ", Yu Cheng2, Zhe", + "type": "text" + }, + { + "bbox": [ + 234, + 135, + 258, + 146 + ], + "score": 0.44, + "content": "\\mathbf { G a n } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 134, + 280, + 148 + ], + "score": 1.0, + "content": ", Siqi", + "type": "text" + }, + { + "bbox": [ + 281, + 135, + 302, + 146 + ], + "score": 0.79, + "content": "\\mathbf { S u n } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 134, + 437, + 148 + ], + "score": 1.0, + "content": ", Tom Goldstein1, Jingjing Liu2", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 112, + 146, + 437, + 159 + ], + "spans": [ + { + "bbox": [ + 112, + 146, + 437, + 159 + ], + "score": 1.0, + "content": "1University of Maryland, College Park 2Microsoft Dynamics 365 AI Research", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 113, + 159, + 426, + 171 + ], + "spans": [ + { + "bbox": [ + 113, + 159, + 426, + 171 + ], + "score": 1.0, + "content": "{chenzhu,tomg}@cs.umd.edu, {yu.cheng,zhe.gan,siqi.sun,jingjl}@microsoft.com", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3, + "bbox_fs": [ + 112, + 134, + 437, + 171 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 198, + 333, + 210 + ], + "lines": [ + { + "bbox": [ + 276, + 198, + 335, + 211 + ], + "spans": [ + { + "bbox": [ + 276, + 198, + 335, + 211 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 143, + 224, + 468, + 388 + ], + "lines": [ + { + "bbox": [ + 141, + 222, + 469, + 237 + ], + "spans": [ + { + "bbox": [ + 141, + 222, + 469, + 237 + ], + "score": 1.0, + "content": "Adversarial training, which minimizes the maximal risk for label-preserving in-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 140, + 235, + 470, + 248 + ], + "spans": [ + { + "bbox": [ + 140, + 235, + 470, + 248 + ], + "score": 1.0, + "content": "put perturbations, has proved to be effective for improving the generalization of", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 245, + 469, + 259 + ], + "spans": [ + { + "bbox": [ + 141, + 245, + 469, + 259 + ], + "score": 1.0, + "content": "language models. In this work, we propose a novel adversarial training algorithm,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 256, + 469, + 270 + ], + "spans": [ + { + "bbox": [ + 141, + 256, + 469, + 270 + ], + "score": 1.0, + "content": "FreeLB, that promotes higher invariance in the embedding space, by adding adver-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 268, + 469, + 279 + ], + "spans": [ + { + "bbox": [ + 141, + 268, + 469, + 279 + ], + "score": 1.0, + "content": "sarial perturbations to word embeddings and minimizing the resultant adversarial", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 279, + 470, + 291 + ], + "spans": [ + { + "bbox": [ + 141, + 279, + 470, + 291 + ], + "score": 1.0, + "content": "risk inside different regions around input samples. To validate the effectiveness", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 289, + 470, + 302 + ], + "spans": [ + { + "bbox": [ + 141, + 289, + 470, + 302 + ], + "score": 1.0, + "content": "of the proposed approach, we apply it to Transformer-based models for natural", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 300, + 470, + 313 + ], + "spans": [ + { + "bbox": [ + 141, + 300, + 470, + 313 + ], + "score": 1.0, + "content": "language understanding and commonsense reasoning tasks. Experiments on the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 311, + 470, + 324 + ], + "spans": [ + { + "bbox": [ + 141, + 311, + 470, + 324 + ], + "score": 1.0, + "content": "GLUE benchmark show that when applied only to the finetuning stage, it is able", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 322, + 469, + 334 + ], + "spans": [ + { + "bbox": [ + 141, + 322, + 469, + 334 + ], + "score": 1.0, + "content": "to improve the overall test scores of BERT-base model from 78.3 to 79.4, and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 334, + 469, + 345 + ], + "spans": [ + { + "bbox": [ + 141, + 334, + 469, + 345 + ], + "score": 1.0, + "content": "RoBERTa-large model from 88.5 to 88.8. In addition, the proposed approach", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 142, + 344, + 469, + 356 + ], + "spans": [ + { + "bbox": [ + 142, + 344, + 371, + 356 + ], + "score": 1.0, + "content": "achieves state-of-the-art single-model test accuracies of", + "type": "text" + }, + { + "bbox": [ + 371, + 344, + 403, + 355 + ], + "score": 0.88, + "content": "8 5 . 4 4 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 344, + 422, + 356 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 423, + 344, + 455, + 355 + ], + "score": 0.88, + "content": "6 7 . 7 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 344, + 469, + 356 + ], + "score": 1.0, + "content": "on", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 355, + 470, + 368 + ], + "spans": [ + { + "bbox": [ + 141, + 355, + 470, + 368 + ], + "score": 1.0, + "content": "ARC-Easy and ARC-Challenge. Experiments on CommonsenseQA benchmark", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 367, + 470, + 378 + ], + "spans": [ + { + "bbox": [ + 141, + 367, + 470, + 378 + ], + "score": 1.0, + "content": "further demonstrate that FreeLB can be generalized and boost the performance of", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 377, + 333, + 388 + ], + "spans": [ + { + "bbox": [ + 141, + 377, + 333, + 388 + ], + "score": 1.0, + "content": "RoBERTa-large model on other tasks as well. 1", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 13, + "bbox_fs": [ + 140, + 222, + 470, + 388 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 411, + 205, + 423 + ], + "lines": [ + { + "bbox": [ + 105, + 410, + 208, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 208, + 426 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 107, + 436, + 505, + 513 + ], + "lines": [ + { + "bbox": [ + 105, + 435, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 505, + 450 + ], + "score": 1.0, + "content": "Adversarial training is a method for creating robust neural networks. During adversarial training,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 448, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 505, + 459 + ], + "score": 1.0, + "content": "mini-batches of training samples are contaminated with adversarial perturbations (alterations that", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 459, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 505, + 471 + ], + "score": 1.0, + "content": "are small and yet cause misclassification), and then used to update network parameters until the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 470, + 506, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 506, + 482 + ], + "score": 1.0, + "content": "resulting model learns to resist such attacks. Adversarial training was originally proposed as a", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "score": 1.0, + "content": "means to enhance the security of machine learning systems (Goodfellow et al., 2015), especially for", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 491, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 506, + 505 + ], + "score": 1.0, + "content": "safety-critical systems like self-driving cars (Xiao et al., 2018) and copyright detection (Saadatpanah", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 502, + 159, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 159, + 514 + ], + "score": 1.0, + "content": "et al., 2019).", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 435, + 506, + 514 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 519, + 504, + 596 + ], + "lines": [ + { + "bbox": [ + 105, + 519, + 506, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 506, + 531 + ], + "score": 1.0, + "content": "In this paper, we turn our focus away from the security benefits of adversarial training, and instead", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 531, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 531, + 505, + 542 + ], + "score": 1.0, + "content": "study its effects on generalization. While adversarial training boosts the robustness, it is widely", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 541, + 506, + 553 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 506, + 553 + ], + "score": 1.0, + "content": "accepted by computer vision researchers that it is at odds with generalization, with classification", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 552, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 343, + 564 + ], + "score": 1.0, + "content": "accuracy on non-corrupted images dropping as much as", + "type": "text" + }, + { + "bbox": [ + 344, + 552, + 363, + 563 + ], + "score": 0.88, + "content": "1 0 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 552, + 447, + 564 + ], + "score": 1.0, + "content": "on CIFAR-10, and", + "type": "text" + }, + { + "bbox": [ + 447, + 552, + 467, + 563 + ], + "score": 0.88, + "content": "1 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 552, + 505, + 564 + ], + "score": 1.0, + "content": "on Ima-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 563, + 506, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 506, + 575 + ], + "score": 1.0, + "content": "genet (Madry et al., 2018; Xie et al., 2019). Surprisingly, people observe the opposite result for", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 573, + 506, + 587 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 506, + 587 + ], + "score": 1.0, + "content": "language models (Miyato et al., 2017; Cheng et al., 2019), showing that adversarial training can", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 585, + 285, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 585, + 285, + 597 + ], + "score": 1.0, + "content": "improve both generalization and robustness.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 519, + 506, + 597 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 601, + 505, + 711 + ], + "lines": [ + { + "bbox": [ + 106, + 601, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 106, + 601, + 505, + 614 + ], + "score": 1.0, + "content": "We will show that adversarial training significantly improves performance of state-of-the-art models", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 612, + 504, + 625 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 504, + 625 + ], + "score": 1.0, + "content": "for many language understanding tasks. In particular, we propose a novel adversarial training algo-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 623, + 505, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 505, + 636 + ], + "score": 1.0, + "content": "rithm, called FreeLB (Free Large-Batch), which adds adversarial perturbations to word embeddings", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 635, + 504, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 635, + 504, + 646 + ], + "score": 1.0, + "content": "and minimizes the resultant adversarial loss around input samples. The method leverages recently", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 645, + 506, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 645, + 506, + 658 + ], + "score": 1.0, + "content": "proposed “free” training strategies (Shafahi et al., 2019; Zhang et al., 2019) to enrich the train-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 657, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 505, + 669 + ], + "score": 1.0, + "content": "ing data with diversified adversarial samples under different norm constraints at no extra cost than", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 667, + 506, + 680 + ], + "spans": [ + { + "bbox": [ + 105, + 667, + 506, + 680 + ], + "score": 1.0, + "content": "PGD-based (Projected Gradient Descent) adversarial training (Madry et al., 2018), which enables us", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 678, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 678, + 505, + 691 + ], + "score": 1.0, + "content": "to perform such diversified adversarial training on large-scale state-of-the-art models. We observe", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 689, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 505, + 702 + ], + "score": 1.0, + "content": "improved invariance in the embedding space for models trained with FreeLB, which is positively", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 701, + 230, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 701, + 230, + 712 + ], + "score": 1.0, + "content": "correlated with generalization.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 40.5, + "bbox_fs": [ + 105, + 601, + 506, + 712 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 203 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "We perform comprehensive experiments to evaluate the performance of a variety of adversarial train-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "ing algorithms on state-of-the-art language understanding models and tasks. In the comparisons", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "with standard PGD (Madry et al., 2018), FreeAT (Shafahi et al., 2019) and YOPO (Zhang et al.,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 114, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 505, + 128 + ], + "score": 1.0, + "content": "2019), FreeLB stands out to be the best for the datasets and models we evaluated. With FreeLB,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 127, + 505, + 138 + ], + "spans": [ + { + "bbox": [ + 106, + 127, + 505, + 138 + ], + "score": 1.0, + "content": "we achieve state-of-the-art results on several important language understanding benchmarks. On", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 505, + 149 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 505, + 149 + ], + "score": 1.0, + "content": "the GLUE benchmark, FreeLB pushes the performance of the BERT-base model from 78.3 to 79.4.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 148, + 506, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 506, + 160 + ], + "score": 1.0, + "content": "The overall score of the RoBERTa-large models on the GLUE benchmark is also lifted from 88.5 to", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 159, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 506, + 172 + ], + "score": 1.0, + "content": "88.8, achieving best results on most of its sub-tasks. Experiments also show that FreeLB can boost", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 170, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 505, + 183 + ], + "score": 1.0, + "content": "the performance of RoBERTa-large on question answering tasks, such as the ARC and Common-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 181, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 505, + 194 + ], + "score": 1.0, + "content": "senseQA benchmarks. We also provide a comprehensive ablation study and analysis to demonstrate", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 192, + 270, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 270, + 204 + ], + "score": 1.0, + "content": "the effectiveness of our training process.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 5 + }, + { + "type": "title", + "bbox": [ + 108, + 231, + 210, + 244 + ], + "lines": [ + { + "bbox": [ + 105, + 230, + 213, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 230, + 213, + 246 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "title", + "bbox": [ + 108, + 260, + 241, + 271 + ], + "lines": [ + { + "bbox": [ + 106, + 260, + 242, + 273 + ], + "spans": [ + { + "bbox": [ + 106, + 260, + 242, + 273 + ], + "score": 1.0, + "content": "2.1 ADVERSARIAL TRAINING", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 280, + 505, + 357 + ], + "lines": [ + { + "bbox": [ + 105, + 279, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 505, + 293 + ], + "score": 1.0, + "content": "To improve the robustness of neural networks against adversarial examples, many defense strategies", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 290, + 505, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 505, + 304 + ], + "score": 1.0, + "content": "and models have been proposed, in which PGD-based adversarial training (Madry et al., 2018)", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 302, + 505, + 314 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 505, + 314 + ], + "score": 1.0, + "content": "is widely considered to be the most effective, since it largely avoids the the obfuscated gradient", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 312, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 104, + 312, + 505, + 326 + ], + "score": 1.0, + "content": "problem (Athalye et al., 2018). It formulates a class of adversarial training algorithms (Kurakin", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 324, + 505, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 505, + 336 + ], + "score": 1.0, + "content": "et al., 2017) into solving a minimax problem on the cross-entropy loss, which can be achieved", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 334, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 506, + 348 + ], + "score": 1.0, + "content": "reliably through multiple projected gradient ascent steps followed by a SGD (Stochastic Gradient", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 344, + 166, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 166, + 359 + ], + "score": 1.0, + "content": "Descent) step.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 362, + 505, + 462 + ], + "lines": [ + { + "bbox": [ + 106, + 363, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 106, + 363, + 505, + 375 + ], + "score": 1.0, + "content": "Despite being verified by Athalye et al. (2018) to avoid obfuscated gradients, Qin et al. (2019) shows", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 372, + 506, + 386 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 506, + 386 + ], + "score": 1.0, + "content": "that PGD-based adversarial training still leads to highly convolved and non-linear loss surfaces when", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 107, + 384, + 506, + 397 + ], + "spans": [ + { + "bbox": [ + 107, + 385, + 117, + 394 + ], + "score": 0.78, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 384, + 506, + 397 + ], + "score": 1.0, + "content": "is small, which could be readily broken under stronger adversaries. Thus, to be effective, the cost", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 394, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 506, + 408 + ], + "score": 1.0, + "content": "of PGD-based adversarial training is much higher than conventional training. To mitigate this cost,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 406, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 505, + 419 + ], + "score": 1.0, + "content": "Shafahi et al. (2019) proposed a “free” adversarial training algorithm that simultaneously updates", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 417, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 505, + 430 + ], + "score": 1.0, + "content": "both model parameters and adversarial perturbations on a single backward pass. Using a similar", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 428, + 505, + 440 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 505, + 440 + ], + "score": 1.0, + "content": "formulation, Zhang et al. (2019) effectively reduce the total number of full forward and backward", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 439, + 506, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 439, + 506, + 452 + ], + "score": 1.0, + "content": "propagations for obtaining adversarial examples by restricting most of its adversarial updates in the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 450, + 149, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 149, + 464 + ], + "score": 1.0, + "content": "first layer.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 24 + }, + { + "type": "title", + "bbox": [ + 107, + 487, + 356, + 498 + ], + "lines": [ + { + "bbox": [ + 106, + 486, + 357, + 499 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 357, + 499 + ], + "score": 1.0, + "content": "2.2 ADVERSARIAL EXAMPLES IN NATURAL LANGUAGES", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 107, + 506, + 505, + 616 + ], + "lines": [ + { + "bbox": [ + 105, + 505, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 505, + 519 + ], + "score": 1.0, + "content": "Adversarial examples have been explored primarily in the image domain, and received many at-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 518, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 529 + ], + "score": 1.0, + "content": "tention in text domain recently. Previous works on text adversaries have focused on heuristics for", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 527, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 506, + 542 + ], + "score": 1.0, + "content": "creating adversarial examples in the black-box setting, or on specific tasks. Jia & Liang (2017) pro-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 104, + 539, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 104, + 539, + 506, + 552 + ], + "score": 1.0, + "content": "pose to add distracting sentences to the input document in order to induce mis-classification. Zhao", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "et al. (2018) generate text adversaries by projecting the input data to a latent space using GANs, and", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 560, + 506, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 506, + 576 + ], + "score": 1.0, + "content": "searching for adversaries close to the original instance. Belinkov & Bisk (2018) manipulate every", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "word in a sentence with synthetic or natural noise in machine translation systems. Iyyer et al. (2018)", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 583, + 506, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 506, + 596 + ], + "score": 1.0, + "content": "propose a neural paraphrase model based on back-translated data to produce paraphrases that have", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "score": 1.0, + "content": "different sentence structures. Different from previous work, ours is not to produce actual adversarial", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 605, + 482, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 482, + 618 + ], + "score": 1.0, + "content": "examples, but only take the benefit of adversarial training for natural language understanding.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 107, + 622, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "score": 1.0, + "content": "We are not the first to observe that robust language models may perform better on clean test data.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 632, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 645 + ], + "score": 1.0, + "content": "Miyato et al. (2017) extend adversarial and virtual adversarial training (Miyato et al., 2019) to the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 643, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 505, + 656 + ], + "score": 1.0, + "content": "text domain to improve the performance on semi-supervised classification tasks. Ebrahimi et al.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "(2018) propose a character/word replacement for crafting attacks, and show employing adversarial", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 666, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 677 + ], + "score": 1.0, + "content": "examples in training renders the models more robust. Ribeiro et al. (2018) show that adversarial", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 677, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 690 + ], + "score": 1.0, + "content": "attacks can be used as a valuable tool for debugging NLP models. Cheng et al. (2019) also find", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "that crafting adversarial examples can help neural machine translation significantly. Notably, these", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "studies have focused on simple models or text generation tasks. Our work explores how to effi-", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "ciently use the gradients obtained in adversarial training to boost the performance of state-of-the-art", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 721, + 214, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 214, + 732 + ], + "score": 1.0, + "content": "transformer-based models.", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 44.5 + } + ], + "page_idx": 1, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 13, + "width": 9 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 203 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "We perform comprehensive experiments to evaluate the performance of a variety of adversarial train-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "ing algorithms on state-of-the-art language understanding models and tasks. In the comparisons", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "with standard PGD (Madry et al., 2018), FreeAT (Shafahi et al., 2019) and YOPO (Zhang et al.,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 114, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 505, + 128 + ], + "score": 1.0, + "content": "2019), FreeLB stands out to be the best for the datasets and models we evaluated. With FreeLB,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 127, + 505, + 138 + ], + "spans": [ + { + "bbox": [ + 106, + 127, + 505, + 138 + ], + "score": 1.0, + "content": "we achieve state-of-the-art results on several important language understanding benchmarks. On", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 505, + 149 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 505, + 149 + ], + "score": 1.0, + "content": "the GLUE benchmark, FreeLB pushes the performance of the BERT-base model from 78.3 to 79.4.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 148, + 506, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 506, + 160 + ], + "score": 1.0, + "content": "The overall score of the RoBERTa-large models on the GLUE benchmark is also lifted from 88.5 to", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 159, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 506, + 172 + ], + "score": 1.0, + "content": "88.8, achieving best results on most of its sub-tasks. Experiments also show that FreeLB can boost", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 170, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 505, + 183 + ], + "score": 1.0, + "content": "the performance of RoBERTa-large on question answering tasks, such as the ARC and Common-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 181, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 505, + 194 + ], + "score": 1.0, + "content": "senseQA benchmarks. We also provide a comprehensive ablation study and analysis to demonstrate", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 192, + 270, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 270, + 204 + ], + "score": 1.0, + "content": "the effectiveness of our training process.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 81, + 506, + 204 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 231, + 210, + 244 + ], + "lines": [ + { + "bbox": [ + 105, + 230, + 213, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 230, + 213, + 246 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "title", + "bbox": [ + 108, + 260, + 241, + 271 + ], + "lines": [ + { + "bbox": [ + 106, + 260, + 242, + 273 + ], + "spans": [ + { + "bbox": [ + 106, + 260, + 242, + 273 + ], + "score": 1.0, + "content": "2.1 ADVERSARIAL TRAINING", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 280, + 505, + 357 + ], + "lines": [ + { + "bbox": [ + 105, + 279, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 505, + 293 + ], + "score": 1.0, + "content": "To improve the robustness of neural networks against adversarial examples, many defense strategies", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 290, + 505, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 505, + 304 + ], + "score": 1.0, + "content": "and models have been proposed, in which PGD-based adversarial training (Madry et al., 2018)", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 302, + 505, + 314 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 505, + 314 + ], + "score": 1.0, + "content": "is widely considered to be the most effective, since it largely avoids the the obfuscated gradient", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 312, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 104, + 312, + 505, + 326 + ], + "score": 1.0, + "content": "problem (Athalye et al., 2018). It formulates a class of adversarial training algorithms (Kurakin", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 324, + 505, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 505, + 336 + ], + "score": 1.0, + "content": "et al., 2017) into solving a minimax problem on the cross-entropy loss, which can be achieved", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 334, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 506, + 348 + ], + "score": 1.0, + "content": "reliably through multiple projected gradient ascent steps followed by a SGD (Stochastic Gradient", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 344, + 166, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 166, + 359 + ], + "score": 1.0, + "content": "Descent) step.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 16, + "bbox_fs": [ + 104, + 279, + 506, + 359 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 362, + 505, + 462 + ], + "lines": [ + { + "bbox": [ + 106, + 363, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 106, + 363, + 505, + 375 + ], + "score": 1.0, + "content": "Despite being verified by Athalye et al. (2018) to avoid obfuscated gradients, Qin et al. (2019) shows", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 372, + 506, + 386 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 506, + 386 + ], + "score": 1.0, + "content": "that PGD-based adversarial training still leads to highly convolved and non-linear loss surfaces when", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 107, + 384, + 506, + 397 + ], + "spans": [ + { + "bbox": [ + 107, + 385, + 117, + 394 + ], + "score": 0.78, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 384, + 506, + 397 + ], + "score": 1.0, + "content": "is small, which could be readily broken under stronger adversaries. Thus, to be effective, the cost", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 394, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 506, + 408 + ], + "score": 1.0, + "content": "of PGD-based adversarial training is much higher than conventional training. To mitigate this cost,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 406, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 505, + 419 + ], + "score": 1.0, + "content": "Shafahi et al. (2019) proposed a “free” adversarial training algorithm that simultaneously updates", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 417, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 505, + 430 + ], + "score": 1.0, + "content": "both model parameters and adversarial perturbations on a single backward pass. Using a similar", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 428, + 505, + 440 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 505, + 440 + ], + "score": 1.0, + "content": "formulation, Zhang et al. (2019) effectively reduce the total number of full forward and backward", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 439, + 506, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 439, + 506, + 452 + ], + "score": 1.0, + "content": "propagations for obtaining adversarial examples by restricting most of its adversarial updates in the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 450, + 149, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 149, + 464 + ], + "score": 1.0, + "content": "first layer.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 363, + 506, + 464 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 487, + 356, + 498 + ], + "lines": [ + { + "bbox": [ + 106, + 486, + 357, + 499 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 357, + 499 + ], + "score": 1.0, + "content": "2.2 ADVERSARIAL EXAMPLES IN NATURAL LANGUAGES", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 107, + 506, + 505, + 616 + ], + "lines": [ + { + "bbox": [ + 105, + 505, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 505, + 519 + ], + "score": 1.0, + "content": "Adversarial examples have been explored primarily in the image domain, and received many at-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 518, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 529 + ], + "score": 1.0, + "content": "tention in text domain recently. Previous works on text adversaries have focused on heuristics for", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 527, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 506, + 542 + ], + "score": 1.0, + "content": "creating adversarial examples in the black-box setting, or on specific tasks. Jia & Liang (2017) pro-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 104, + 539, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 104, + 539, + 506, + 552 + ], + "score": 1.0, + "content": "pose to add distracting sentences to the input document in order to induce mis-classification. Zhao", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "et al. (2018) generate text adversaries by projecting the input data to a latent space using GANs, and", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 560, + 506, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 506, + 576 + ], + "score": 1.0, + "content": "searching for adversaries close to the original instance. Belinkov & Bisk (2018) manipulate every", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "word in a sentence with synthetic or natural noise in machine translation systems. Iyyer et al. (2018)", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 583, + 506, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 506, + 596 + ], + "score": 1.0, + "content": "propose a neural paraphrase model based on back-translated data to produce paraphrases that have", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "score": 1.0, + "content": "different sentence structures. Different from previous work, ours is not to produce actual adversarial", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 605, + 482, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 482, + 618 + ], + "score": 1.0, + "content": "examples, but only take the benefit of adversarial training for natural language understanding.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 34.5, + "bbox_fs": [ + 104, + 505, + 506, + 618 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 622, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "score": 1.0, + "content": "We are not the first to observe that robust language models may perform better on clean test data.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 632, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 645 + ], + "score": 1.0, + "content": "Miyato et al. (2017) extend adversarial and virtual adversarial training (Miyato et al., 2019) to the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 643, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 505, + 656 + ], + "score": 1.0, + "content": "text domain to improve the performance on semi-supervised classification tasks. Ebrahimi et al.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "(2018) propose a character/word replacement for crafting attacks, and show employing adversarial", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 666, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 677 + ], + "score": 1.0, + "content": "examples in training renders the models more robust. Ribeiro et al. (2018) show that adversarial", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 677, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 690 + ], + "score": 1.0, + "content": "attacks can be used as a valuable tool for debugging NLP models. Cheng et al. (2019) also find", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "that crafting adversarial examples can help neural machine translation significantly. Notably, these", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "studies have focused on simple models or text generation tasks. Our work explores how to effi-", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "ciently use the gradients obtained in adversarial training to boost the performance of state-of-the-art", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 721, + 214, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 214, + 732 + ], + "score": 1.0, + "content": "transformer-based models.", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 44.5, + "bbox_fs": [ + 105, + 621, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 81, + 434, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 437, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 437, + 95 + ], + "score": 1.0, + "content": "3 ADVERSARIAL TRAINING FOR LANGUAGE UNDERSTANDING", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 106, + 505, + 271 + ], + "lines": [ + { + "bbox": [ + 105, + 105, + 505, + 119 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 505, + 119 + ], + "score": 1.0, + "content": "Pre-trained large-scale language models, such as BERT (Devlin et al., 2019), RoBERTa (Liu et al.,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 116, + 505, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 116, + 505, + 129 + ], + "score": 1.0, + "content": "2019b), ALBERT (Lan et al., 2020) and T5 (Raffel et al., 2019), have proven to be highly effective", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 126, + 505, + 142 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 142 + ], + "score": 1.0, + "content": "for downstream tasks. We aim to further improve the generalization of these pre-trained language", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 139, + 505, + 151 + ], + "spans": [ + { + "bbox": [ + 106, + 139, + 505, + 151 + ], + "score": 1.0, + "content": "models on the downstream language understanding tasks by enhancing their robustness in the em-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 150, + 504, + 162 + ], + "spans": [ + { + "bbox": [ + 106, + 150, + 504, + 162 + ], + "score": 1.0, + "content": "bedding space during finetuning on these tasks. We achieve this goal by creating “virtual” adver-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 161, + 505, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 161, + 505, + 173 + ], + "score": 1.0, + "content": "sarial examples in the embedding space, and then perform parameter updates on these adversarial", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 172, + 504, + 184 + ], + "spans": [ + { + "bbox": [ + 106, + 172, + 504, + 184 + ], + "score": 1.0, + "content": "embeddings. Creating actual adversarial examples for language is difficult; even with state-of-the-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 182, + 506, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 506, + 196 + ], + "score": 1.0, + "content": "art language models as guidance (e.g., (Cheng et al., 2019)), it remains unclear how to construct", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 192, + 506, + 206 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 506, + 206 + ], + "score": 1.0, + "content": "label-preserving adversarial examples via word/character replacement without human evaluations,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 205, + 506, + 217 + ], + "spans": [ + { + "bbox": [ + 106, + 205, + 506, + 217 + ], + "score": 1.0, + "content": "because the meaning of each word/character depends on the context (Ribeiro et al., 2018). Since", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 216, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 106, + 216, + 505, + 228 + ], + "score": 1.0, + "content": "we are only interested in the effects of adversarial training, rather than producing actual adversarial", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 226, + 506, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 506, + 240 + ], + "score": 1.0, + "content": "examples, we add norm-bounded adversarial perturbations to the embeddings of the input sentences", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 237, + 505, + 250 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 505, + 250 + ], + "score": 1.0, + "content": "using a gradient-based method. Note that our embedding-based adversary is strictly stronger than a", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 249, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 505, + 261 + ], + "score": 1.0, + "content": "more conventional text-based adversary, as our adversary can make manipulations on word embed-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 260, + 290, + 271 + ], + "spans": [ + { + "bbox": [ + 106, + 260, + 290, + 271 + ], + "score": 1.0, + "content": "dings that are not possible in the text domain.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 276, + 505, + 397 + ], + "lines": [ + { + "bbox": [ + 105, + 275, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 290 + ], + "score": 1.0, + "content": "For models that incorporate various input representations, including word or subword embeddings,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 287, + 506, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 506, + 300 + ], + "score": 1.0, + "content": "segment embeddings and position embeddings, our adversaries only modify the concatenated word", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 298, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 505, + 311 + ], + "score": 1.0, + "content": "or sub-word embeddings, leaving other components of the sentence representation unchanged. 2 De-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 309, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 387, + 322 + ], + "score": 1.0, + "content": "note the sequence of one-hot representations of the input subwords as", + "type": "text" + }, + { + "bbox": [ + 388, + 309, + 469, + 321 + ], + "score": 0.9, + "content": "\\pmb { Z } = [ z _ { 1 } , z _ { 2 } , . . . , z _ { n } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 309, + 505, + 322 + ], + "score": 1.0, + "content": ", the em-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 319, + 504, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 180, + 333 + ], + "score": 1.0, + "content": "bedding matrix as", + "type": "text" + }, + { + "bbox": [ + 180, + 320, + 190, + 330 + ], + "score": 0.74, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 319, + 382, + 333 + ], + "score": 1.0, + "content": ", and the language model (encoder) as a function", + "type": "text" + }, + { + "bbox": [ + 383, + 321, + 431, + 332 + ], + "score": 0.95, + "content": "{ \\pmb y } = f _ { \\pmb \\theta } ( { \\pmb X } )", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 319, + 461, + 333 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 462, + 320, + 504, + 330 + ], + "score": 0.89, + "content": "\\dot { \\boldsymbol { X } } = \\boldsymbol { V } \\boldsymbol { Z }", + "type": "inline_equation" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 331, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 221, + 344 + ], + "score": 1.0, + "content": "is the subword embeddings,", + "type": "text" + }, + { + "bbox": [ + 222, + 333, + 230, + 342 + ], + "score": 0.77, + "content": "\\textbf { { y } }", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 331, + 506, + 344 + ], + "score": 1.0, + "content": "is the output of the model (e.g., class probabilities for classification", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 342, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 160, + 354 + ], + "score": 1.0, + "content": "models), and", + "type": "text" + }, + { + "bbox": [ + 160, + 342, + 168, + 352 + ], + "score": 0.71, + "content": "\\pmb \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 342, + 443, + 354 + ], + "score": 1.0, + "content": "denotes all the learnable parameters including the embedding matrix", + "type": "text" + }, + { + "bbox": [ + 443, + 342, + 453, + 352 + ], + "score": 0.66, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 342, + 505, + 354 + ], + "score": 1.0, + "content": ". We add ad-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 352, + 506, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 199, + 366 + ], + "score": 1.0, + "content": "versarial perturbations", + "type": "text" + }, + { + "bbox": [ + 199, + 353, + 205, + 363 + ], + "score": 0.69, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 206, + 352, + 417, + 366 + ], + "score": 1.0, + "content": "to the embeddings such that the prediction becomes", + "type": "text" + }, + { + "bbox": [ + 417, + 353, + 487, + 365 + ], + "score": 0.92, + "content": "\\pmb { y } ^ { \\prime } = f _ { \\pmb { \\theta } } ( \\pmb { X } + \\pmb { \\delta } )", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 352, + 506, + 366 + ], + "score": 1.0, + "content": ". To", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 364, + 505, + 377 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 306, + 377 + ], + "score": 1.0, + "content": "preserve the semantics, we constrain the norm of", + "type": "text" + }, + { + "bbox": [ + 306, + 365, + 313, + 374 + ], + "score": 0.75, + "content": "\\pmb { \\delta }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 364, + 505, + 377 + ], + "score": 1.0, + "content": "to be small, and assume the model’s prediction", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 375, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 106, + 375, + 505, + 388 + ], + "score": 1.0, + "content": "should not change after the perturbation. This formulation is analogous to Miyato et al. (2017), with", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 385, + 338, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 254, + 398 + ], + "score": 1.0, + "content": "the difference that we do not require", + "type": "text" + }, + { + "bbox": [ + 254, + 386, + 265, + 396 + ], + "score": 0.81, + "content": "\\boldsymbol { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 385, + 338, + 398 + ], + "score": 1.0, + "content": "to be normalized.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 21 + }, + { + "type": "title", + "bbox": [ + 108, + 410, + 284, + 421 + ], + "lines": [ + { + "bbox": [ + 106, + 410, + 285, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 285, + 423 + ], + "score": 1.0, + "content": "3.1 PGD FOR ADVERSARIAL TRAINING", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 108, + 428, + 504, + 451 + ], + "lines": [ + { + "bbox": [ + 105, + 426, + 506, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 354, + 441 + ], + "score": 1.0, + "content": "Standard adversarial training seeks to find optimal parameters", + "type": "text" + }, + { + "bbox": [ + 354, + 429, + 365, + 438 + ], + "score": 0.87, + "content": "\\pmb { \\theta } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 426, + 506, + 441 + ], + "score": 1.0, + "content": "to minimize the maximum risk for", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 439, + 221, + 452 + ], + "spans": [ + { + "bbox": [ + 106, + 439, + 123, + 452 + ], + "score": 1.0, + "content": "any", + "type": "text" + }, + { + "bbox": [ + 124, + 440, + 130, + 449 + ], + "score": 0.8, + "content": "\\pmb { \\delta }", + "type": "inline_equation" + }, + { + "bbox": [ + 130, + 439, + 221, + 452 + ], + "score": 1.0, + "content": "within a norm ball as:", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "interline_equation", + "bbox": [ + 220, + 454, + 391, + 482 + ], + "lines": [ + { + "bbox": [ + 220, + 454, + 391, + 482 + ], + "spans": [ + { + "bbox": [ + 220, + 454, + 391, + 482 + ], + "score": 0.94, + "content": "\\operatorname* { m i n } _ { \\theta } \\mathbb { E } _ { ( Z , y ) \\sim \\mathcal { D } } \\left[ \\operatorname* { m a x } _ { \\| \\delta \\| \\leq \\epsilon } L ( f _ { \\theta } ( X + \\delta ) , y ) \\right] ,", + "type": "interline_equation", + "image_path": "17c85187abb9a6ea71a8c3e97ea4dd66fd478797846cf419f4a2d777a9491c4c.jpg" + } + ] + } + ], + "index": 30.5, + "virtual_lines": [ + { + "bbox": [ + 220, + 454, + 391, + 468.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 220, + 468.0, + 391, + 482.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 484, + 505, + 562 + ], + "lines": [ + { + "bbox": [ + 106, + 486, + 504, + 497 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 133, + 497 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 486, + 143, + 495 + ], + "score": 0.82, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 486, + 239, + 497 + ], + "score": 1.0, + "content": "is the data distribution,", + "type": "text" + }, + { + "bbox": [ + 240, + 487, + 246, + 497 + ], + "score": 0.82, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 486, + 314, + 497 + ], + "score": 1.0, + "content": "is the label, and", + "type": "text" + }, + { + "bbox": [ + 315, + 486, + 322, + 495 + ], + "score": 0.82, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 486, + 504, + 497 + ], + "score": 1.0, + "content": "is some loss function. We use the Frobenius", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 496, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 181, + 507 + ], + "score": 1.0, + "content": "norm to constrain", + "type": "text" + }, + { + "bbox": [ + 181, + 496, + 188, + 506 + ], + "score": 0.72, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 496, + 505, + 507 + ], + "score": 1.0, + "content": ". For neural networks, the outer “min” is non-convex, and the inner “max” is", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 507, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 505, + 519 + ], + "score": 1.0, + "content": "non-concave. Nonetheless, Madry et al. (2018) demonstrated that this saddle-point problem can be", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 518, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 106, + 518, + 505, + 529 + ], + "score": 1.0, + "content": "solved reliably with SGD for the outer minimization and PGD (a standard method for large-scale", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 528, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 506, + 540 + ], + "score": 1.0, + "content": "constrained optimization, see (Combettes & Pesquet, 2011) and (Goldstein et al., 2014)), for the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 540, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 318, + 552 + ], + "score": 1.0, + "content": "inner maximization. In particular, for the constraint", + "type": "text" + }, + { + "bbox": [ + 318, + 540, + 360, + 552 + ], + "score": 0.93, + "content": "\\| \\delta \\| _ { F } \\le \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 540, + 506, + 552 + ], + "score": 1.0, + "content": ", with an additional assumption that", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 550, + 502, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 420, + 563 + ], + "score": 1.0, + "content": "the loss function is locally linear, PGD takes the following step (with step size", + "type": "text" + }, + { + "bbox": [ + 421, + 552, + 428, + 560 + ], + "score": 0.73, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 550, + 502, + 563 + ], + "score": 1.0, + "content": ") in each iteration:", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 35 + }, + { + "type": "interline_equation", + "bbox": [ + 217, + 565, + 393, + 580 + ], + "lines": [ + { + "bbox": [ + 217, + 565, + 393, + 580 + ], + "spans": [ + { + "bbox": [ + 217, + 565, + 393, + 580 + ], + "score": 0.93, + "content": "\\delta _ { t + 1 } = \\Pi _ { \\| \\pmb { \\delta } \\| _ { F } \\leq \\epsilon } \\left( \\pmb { \\delta } _ { t } + \\alpha g ( \\pmb { \\delta } _ { t } ) / \\| g ( \\pmb { \\delta } _ { t } ) \\| _ { F } \\right) ,", + "type": "interline_equation", + "image_path": "be4aa28dea2f09e48329453f621909356a76b82a9114c7d9674cce7e2f1707f6.jpg" + } + ] + } + ], + "index": 39, + "virtual_lines": [ + { + "bbox": [ + 217, + 565, + 393, + 580 + ], + "spans": [], + "index": 39 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 583, + 505, + 651 + ], + "lines": [ + { + "bbox": [ + 104, + 580, + 504, + 600 + ], + "spans": [ + { + "bbox": [ + 104, + 580, + 134, + 600 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 135, + 583, + 262, + 596 + ], + "score": 0.92, + "content": "g ( \\delta _ { t } ) = \\nabla _ { \\delta } L ( f _ { \\theta } ( X + \\delta _ { t } ) , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 580, + 437, + 600 + ], + "score": 1.0, + "content": "is the gradient of the loss with respect to", + "type": "text" + }, + { + "bbox": [ + 437, + 584, + 444, + 594 + ], + "score": 0.76, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 580, + 466, + 600 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 467, + 585, + 504, + 597 + ], + "score": 0.92, + "content": "\\Pi _ { \\| \\delta \\| _ { F } \\leq \\epsilon }", + "type": "inline_equation" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 232, + 608 + ], + "score": 1.0, + "content": "performs a projection onto the", + "type": "text" + }, + { + "bbox": [ + 233, + 597, + 238, + 605 + ], + "score": 0.72, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 595, + 505, + 608 + ], + "score": 1.0, + "content": "-ball. To achieve high-level robustness, multi-step adversarial ex-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 104, + 605, + 506, + 619 + ], + "spans": [ + { + "bbox": [ + 104, + 605, + 410, + 619 + ], + "score": 1.0, + "content": "amples are needed during training, which is computationally expensive. The", + "type": "text" + }, + { + "bbox": [ + 411, + 606, + 421, + 616 + ], + "score": 0.83, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 605, + 467, + 619 + ], + "score": 1.0, + "content": "-step PGD (", + "type": "text" + }, + { + "bbox": [ + 467, + 606, + 477, + 616 + ], + "score": 0.76, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 605, + 506, + 619 + ], + "score": 1.0, + "content": "-PGD)", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 617, + 505, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 141, + 630 + ], + "score": 1.0, + "content": "requires", + "type": "text" + }, + { + "bbox": [ + 141, + 618, + 152, + 627 + ], + "score": 0.81, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 617, + 505, + 630 + ], + "score": 1.0, + "content": "forward-backward passes through the network, while the standard SGD update requires", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 627, + 505, + 641 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 641 + ], + "score": 1.0, + "content": "only one. As a result, the adversary generation step in adversarial training increases run-time by an", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 639, + 496, + 652 + ], + "spans": [ + { + "bbox": [ + 106, + 639, + 496, + 652 + ], + "score": 1.0, + "content": "order of magnitude—a catastrophic amount when training large state-of-the-art language models.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 42.5 + }, + { + "type": "title", + "bbox": [ + 106, + 663, + 352, + 675 + ], + "lines": [ + { + "bbox": [ + 106, + 663, + 353, + 676 + ], + "spans": [ + { + "bbox": [ + 106, + 663, + 353, + 676 + ], + "score": 1.0, + "content": "3.2 LARGE-BATCH ADVERSARIAL TRAINING FOR FREE", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 46 + }, + { + "type": "text", + "bbox": [ + 108, + 681, + 503, + 704 + ], + "lines": [ + { + "bbox": [ + 106, + 681, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 106, + 681, + 505, + 693 + ], + "score": 1.0, + "content": "In the inner ascent steps of PGD, the gradients of the parameters can be obtained with almost no", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 692, + 505, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 692, + 505, + 705 + ], + "score": 1.0, + "content": "overhead when computing the gradients of the inputs. From this observation, FreeAT (Shafahi et al.,", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 47.5 + } + ], + "page_idx": 2, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 711, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 117, + 707, + 506, + 725 + ], + "spans": [ + { + "bbox": [ + 117, + 707, + 506, + 725 + ], + "score": 1.0, + "content": "2“Subword embeddings” refers to the embeddings of sub-word encodings such as the popular Byte Pair", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 721, + 253, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 253, + 733 + ], + "score": 1.0, + "content": "Encoding (BPE) (Sennrich et al., 2016).", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 27, + 294, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 81, + 434, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 437, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 437, + 95 + ], + "score": 1.0, + "content": "3 ADVERSARIAL TRAINING FOR LANGUAGE UNDERSTANDING", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 106, + 505, + 271 + ], + "lines": [ + { + "bbox": [ + 105, + 105, + 505, + 119 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 505, + 119 + ], + "score": 1.0, + "content": "Pre-trained large-scale language models, such as BERT (Devlin et al., 2019), RoBERTa (Liu et al.,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 116, + 505, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 116, + 505, + 129 + ], + "score": 1.0, + "content": "2019b), ALBERT (Lan et al., 2020) and T5 (Raffel et al., 2019), have proven to be highly effective", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 126, + 505, + 142 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 142 + ], + "score": 1.0, + "content": "for downstream tasks. We aim to further improve the generalization of these pre-trained language", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 139, + 505, + 151 + ], + "spans": [ + { + "bbox": [ + 106, + 139, + 505, + 151 + ], + "score": 1.0, + "content": "models on the downstream language understanding tasks by enhancing their robustness in the em-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 150, + 504, + 162 + ], + "spans": [ + { + "bbox": [ + 106, + 150, + 504, + 162 + ], + "score": 1.0, + "content": "bedding space during finetuning on these tasks. We achieve this goal by creating “virtual” adver-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 161, + 505, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 161, + 505, + 173 + ], + "score": 1.0, + "content": "sarial examples in the embedding space, and then perform parameter updates on these adversarial", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 172, + 504, + 184 + ], + "spans": [ + { + "bbox": [ + 106, + 172, + 504, + 184 + ], + "score": 1.0, + "content": "embeddings. Creating actual adversarial examples for language is difficult; even with state-of-the-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 182, + 506, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 506, + 196 + ], + "score": 1.0, + "content": "art language models as guidance (e.g., (Cheng et al., 2019)), it remains unclear how to construct", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 192, + 506, + 206 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 506, + 206 + ], + "score": 1.0, + "content": "label-preserving adversarial examples via word/character replacement without human evaluations,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 205, + 506, + 217 + ], + "spans": [ + { + "bbox": [ + 106, + 205, + 506, + 217 + ], + "score": 1.0, + "content": "because the meaning of each word/character depends on the context (Ribeiro et al., 2018). Since", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 216, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 106, + 216, + 505, + 228 + ], + "score": 1.0, + "content": "we are only interested in the effects of adversarial training, rather than producing actual adversarial", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 226, + 506, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 506, + 240 + ], + "score": 1.0, + "content": "examples, we add norm-bounded adversarial perturbations to the embeddings of the input sentences", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 237, + 505, + 250 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 505, + 250 + ], + "score": 1.0, + "content": "using a gradient-based method. Note that our embedding-based adversary is strictly stronger than a", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 249, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 505, + 261 + ], + "score": 1.0, + "content": "more conventional text-based adversary, as our adversary can make manipulations on word embed-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 260, + 290, + 271 + ], + "spans": [ + { + "bbox": [ + 106, + 260, + 290, + 271 + ], + "score": 1.0, + "content": "dings that are not possible in the text domain.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 105, + 506, + 271 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 276, + 505, + 397 + ], + "lines": [ + { + "bbox": [ + 105, + 275, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 290 + ], + "score": 1.0, + "content": "For models that incorporate various input representations, including word or subword embeddings,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 287, + 506, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 506, + 300 + ], + "score": 1.0, + "content": "segment embeddings and position embeddings, our adversaries only modify the concatenated word", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 298, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 505, + 311 + ], + "score": 1.0, + "content": "or sub-word embeddings, leaving other components of the sentence representation unchanged. 2 De-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 309, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 387, + 322 + ], + "score": 1.0, + "content": "note the sequence of one-hot representations of the input subwords as", + "type": "text" + }, + { + "bbox": [ + 388, + 309, + 469, + 321 + ], + "score": 0.9, + "content": "\\pmb { Z } = [ z _ { 1 } , z _ { 2 } , . . . , z _ { n } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 309, + 505, + 322 + ], + "score": 1.0, + "content": ", the em-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 319, + 504, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 180, + 333 + ], + "score": 1.0, + "content": "bedding matrix as", + "type": "text" + }, + { + "bbox": [ + 180, + 320, + 190, + 330 + ], + "score": 0.74, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 319, + 382, + 333 + ], + "score": 1.0, + "content": ", and the language model (encoder) as a function", + "type": "text" + }, + { + "bbox": [ + 383, + 321, + 431, + 332 + ], + "score": 0.95, + "content": "{ \\pmb y } = f _ { \\pmb \\theta } ( { \\pmb X } )", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 319, + 461, + 333 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 462, + 320, + 504, + 330 + ], + "score": 0.89, + "content": "\\dot { \\boldsymbol { X } } = \\boldsymbol { V } \\boldsymbol { Z }", + "type": "inline_equation" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 331, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 221, + 344 + ], + "score": 1.0, + "content": "is the subword embeddings,", + "type": "text" + }, + { + "bbox": [ + 222, + 333, + 230, + 342 + ], + "score": 0.77, + "content": "\\textbf { { y } }", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 331, + 506, + 344 + ], + "score": 1.0, + "content": "is the output of the model (e.g., class probabilities for classification", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 342, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 160, + 354 + ], + "score": 1.0, + "content": "models), and", + "type": "text" + }, + { + "bbox": [ + 160, + 342, + 168, + 352 + ], + "score": 0.71, + "content": "\\pmb \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 342, + 443, + 354 + ], + "score": 1.0, + "content": "denotes all the learnable parameters including the embedding matrix", + "type": "text" + }, + { + "bbox": [ + 443, + 342, + 453, + 352 + ], + "score": 0.66, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 342, + 505, + 354 + ], + "score": 1.0, + "content": ". We add ad-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 352, + 506, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 199, + 366 + ], + "score": 1.0, + "content": "versarial perturbations", + "type": "text" + }, + { + "bbox": [ + 199, + 353, + 205, + 363 + ], + "score": 0.69, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 206, + 352, + 417, + 366 + ], + "score": 1.0, + "content": "to the embeddings such that the prediction becomes", + "type": "text" + }, + { + "bbox": [ + 417, + 353, + 487, + 365 + ], + "score": 0.92, + "content": "\\pmb { y } ^ { \\prime } = f _ { \\pmb { \\theta } } ( \\pmb { X } + \\pmb { \\delta } )", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 352, + 506, + 366 + ], + "score": 1.0, + "content": ". To", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 364, + 505, + 377 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 306, + 377 + ], + "score": 1.0, + "content": "preserve the semantics, we constrain the norm of", + "type": "text" + }, + { + "bbox": [ + 306, + 365, + 313, + 374 + ], + "score": 0.75, + "content": "\\pmb { \\delta }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 364, + 505, + 377 + ], + "score": 1.0, + "content": "to be small, and assume the model’s prediction", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 375, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 106, + 375, + 505, + 388 + ], + "score": 1.0, + "content": "should not change after the perturbation. This formulation is analogous to Miyato et al. (2017), with", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 385, + 338, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 254, + 398 + ], + "score": 1.0, + "content": "the difference that we do not require", + "type": "text" + }, + { + "bbox": [ + 254, + 386, + 265, + 396 + ], + "score": 0.81, + "content": "\\boldsymbol { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 385, + 338, + 398 + ], + "score": 1.0, + "content": "to be normalized.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 275, + 506, + 398 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 410, + 284, + 421 + ], + "lines": [ + { + "bbox": [ + 106, + 410, + 285, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 285, + 423 + ], + "score": 1.0, + "content": "3.1 PGD FOR ADVERSARIAL TRAINING", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 108, + 428, + 504, + 451 + ], + "lines": [ + { + "bbox": [ + 105, + 426, + 506, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 354, + 441 + ], + "score": 1.0, + "content": "Standard adversarial training seeks to find optimal parameters", + "type": "text" + }, + { + "bbox": [ + 354, + 429, + 365, + 438 + ], + "score": 0.87, + "content": "\\pmb { \\theta } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 426, + 506, + 441 + ], + "score": 1.0, + "content": "to minimize the maximum risk for", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 439, + 221, + 452 + ], + "spans": [ + { + "bbox": [ + 106, + 439, + 123, + 452 + ], + "score": 1.0, + "content": "any", + "type": "text" + }, + { + "bbox": [ + 124, + 440, + 130, + 449 + ], + "score": 0.8, + "content": "\\pmb { \\delta }", + "type": "inline_equation" + }, + { + "bbox": [ + 130, + 439, + 221, + 452 + ], + "score": 1.0, + "content": "within a norm ball as:", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 426, + 506, + 452 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 220, + 454, + 391, + 482 + ], + "lines": [ + { + "bbox": [ + 220, + 454, + 391, + 482 + ], + "spans": [ + { + "bbox": [ + 220, + 454, + 391, + 482 + ], + "score": 0.94, + "content": "\\operatorname* { m i n } _ { \\theta } \\mathbb { E } _ { ( Z , y ) \\sim \\mathcal { D } } \\left[ \\operatorname* { m a x } _ { \\| \\delta \\| \\leq \\epsilon } L ( f _ { \\theta } ( X + \\delta ) , y ) \\right] ,", + "type": "interline_equation", + "image_path": "17c85187abb9a6ea71a8c3e97ea4dd66fd478797846cf419f4a2d777a9491c4c.jpg" + } + ] + } + ], + "index": 30.5, + "virtual_lines": [ + { + "bbox": [ + 220, + 454, + 391, + 468.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 220, + 468.0, + 391, + 482.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 484, + 505, + 562 + ], + "lines": [ + { + "bbox": [ + 106, + 486, + 504, + 497 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 133, + 497 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 486, + 143, + 495 + ], + "score": 0.82, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 486, + 239, + 497 + ], + "score": 1.0, + "content": "is the data distribution,", + "type": "text" + }, + { + "bbox": [ + 240, + 487, + 246, + 497 + ], + "score": 0.82, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 486, + 314, + 497 + ], + "score": 1.0, + "content": "is the label, and", + "type": "text" + }, + { + "bbox": [ + 315, + 486, + 322, + 495 + ], + "score": 0.82, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 486, + 504, + 497 + ], + "score": 1.0, + "content": "is some loss function. We use the Frobenius", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 496, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 181, + 507 + ], + "score": 1.0, + "content": "norm to constrain", + "type": "text" + }, + { + "bbox": [ + 181, + 496, + 188, + 506 + ], + "score": 0.72, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 496, + 505, + 507 + ], + "score": 1.0, + "content": ". For neural networks, the outer “min” is non-convex, and the inner “max” is", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 507, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 505, + 519 + ], + "score": 1.0, + "content": "non-concave. Nonetheless, Madry et al. (2018) demonstrated that this saddle-point problem can be", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 518, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 106, + 518, + 505, + 529 + ], + "score": 1.0, + "content": "solved reliably with SGD for the outer minimization and PGD (a standard method for large-scale", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 528, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 506, + 540 + ], + "score": 1.0, + "content": "constrained optimization, see (Combettes & Pesquet, 2011) and (Goldstein et al., 2014)), for the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 540, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 318, + 552 + ], + "score": 1.0, + "content": "inner maximization. In particular, for the constraint", + "type": "text" + }, + { + "bbox": [ + 318, + 540, + 360, + 552 + ], + "score": 0.93, + "content": "\\| \\delta \\| _ { F } \\le \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 540, + 506, + 552 + ], + "score": 1.0, + "content": ", with an additional assumption that", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 550, + 502, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 420, + 563 + ], + "score": 1.0, + "content": "the loss function is locally linear, PGD takes the following step (with step size", + "type": "text" + }, + { + "bbox": [ + 421, + 552, + 428, + 560 + ], + "score": 0.73, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 550, + 502, + 563 + ], + "score": 1.0, + "content": ") in each iteration:", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 486, + 506, + 563 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 217, + 565, + 393, + 580 + ], + "lines": [ + { + "bbox": [ + 217, + 565, + 393, + 580 + ], + "spans": [ + { + "bbox": [ + 217, + 565, + 393, + 580 + ], + "score": 0.93, + "content": "\\delta _ { t + 1 } = \\Pi _ { \\| \\pmb { \\delta } \\| _ { F } \\leq \\epsilon } \\left( \\pmb { \\delta } _ { t } + \\alpha g ( \\pmb { \\delta } _ { t } ) / \\| g ( \\pmb { \\delta } _ { t } ) \\| _ { F } \\right) ,", + "type": "interline_equation", + "image_path": "be4aa28dea2f09e48329453f621909356a76b82a9114c7d9674cce7e2f1707f6.jpg" + } + ] + } + ], + "index": 39, + "virtual_lines": [ + { + "bbox": [ + 217, + 565, + 393, + 580 + ], + "spans": [], + "index": 39 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 583, + 505, + 651 + ], + "lines": [ + { + "bbox": [ + 104, + 580, + 504, + 600 + ], + "spans": [ + { + "bbox": [ + 104, + 580, + 134, + 600 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 135, + 583, + 262, + 596 + ], + "score": 0.92, + "content": "g ( \\delta _ { t } ) = \\nabla _ { \\delta } L ( f _ { \\theta } ( X + \\delta _ { t } ) , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 580, + 437, + 600 + ], + "score": 1.0, + "content": "is the gradient of the loss with respect to", + "type": "text" + }, + { + "bbox": [ + 437, + 584, + 444, + 594 + ], + "score": 0.76, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 580, + 466, + 600 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 467, + 585, + 504, + 597 + ], + "score": 0.92, + "content": "\\Pi _ { \\| \\delta \\| _ { F } \\leq \\epsilon }", + "type": "inline_equation" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 232, + 608 + ], + "score": 1.0, + "content": "performs a projection onto the", + "type": "text" + }, + { + "bbox": [ + 233, + 597, + 238, + 605 + ], + "score": 0.72, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 595, + 505, + 608 + ], + "score": 1.0, + "content": "-ball. To achieve high-level robustness, multi-step adversarial ex-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 104, + 605, + 506, + 619 + ], + "spans": [ + { + "bbox": [ + 104, + 605, + 410, + 619 + ], + "score": 1.0, + "content": "amples are needed during training, which is computationally expensive. The", + "type": "text" + }, + { + "bbox": [ + 411, + 606, + 421, + 616 + ], + "score": 0.83, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 605, + 467, + 619 + ], + "score": 1.0, + "content": "-step PGD (", + "type": "text" + }, + { + "bbox": [ + 467, + 606, + 477, + 616 + ], + "score": 0.76, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 605, + 506, + 619 + ], + "score": 1.0, + "content": "-PGD)", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 617, + 505, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 141, + 630 + ], + "score": 1.0, + "content": "requires", + "type": "text" + }, + { + "bbox": [ + 141, + 618, + 152, + 627 + ], + "score": 0.81, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 617, + 505, + 630 + ], + "score": 1.0, + "content": "forward-backward passes through the network, while the standard SGD update requires", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 627, + 505, + 641 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 641 + ], + "score": 1.0, + "content": "only one. As a result, the adversary generation step in adversarial training increases run-time by an", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 639, + 496, + 652 + ], + "spans": [ + { + "bbox": [ + 106, + 639, + 496, + 652 + ], + "score": 1.0, + "content": "order of magnitude—a catastrophic amount when training large state-of-the-art language models.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 42.5, + "bbox_fs": [ + 104, + 580, + 506, + 652 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 663, + 352, + 675 + ], + "lines": [ + { + "bbox": [ + 106, + 663, + 353, + 676 + ], + "spans": [ + { + "bbox": [ + 106, + 663, + 353, + 676 + ], + "score": 1.0, + "content": "3.2 LARGE-BATCH ADVERSARIAL TRAINING FOR FREE", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 46 + }, + { + "type": "text", + "bbox": [ + 108, + 681, + 503, + 704 + ], + "lines": [ + { + "bbox": [ + 106, + 681, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 106, + 681, + 505, + 693 + ], + "score": 1.0, + "content": "In the inner ascent steps of PGD, the gradients of the parameters can be obtained with almost no", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 692, + 505, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 692, + 505, + 705 + ], + "score": 1.0, + "content": "overhead when computing the gradients of the inputs. From this observation, FreeAT (Shafahi et al.,", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 47.5, + "bbox_fs": [ + 105, + 681, + 505, + 705 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 106, + 82, + 379, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 379, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 364, + 96 + ], + "score": 1.0, + "content": "Algorithm 1 “Free” Large-Batch Adversarial Training (FreeLB-", + "type": "text" + }, + { + "bbox": [ + 365, + 83, + 375, + 92 + ], + "score": 0.46, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 81, + 379, + 96 + ], + "score": 1.0, + "content": ")", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table", + "bbox": [ + 107, + 98, + 504, + 288 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 107, + 98, + 504, + 288 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 98, + 504, + 288 + ], + "spans": [ + { + "bbox": [ + 107, + 98, + 504, + 288 + ], + "score": 0.368, + "html": "
ascent step size αRequire: Training samples X = {(Z,y)}, perturbation bound ε, learning rate T, ascent steps K,
1:Initialize 0
2: for epoch =1... Nep do
3:for minibatchB ℃Xdo
4:U(-∈,∈)
5:90↑0
6:
7:fort=1...K do
8:Accumulate gradient of parameters θ
9:gt←gt-1+kE(z,y)∈B[VθL(fe(X+δt-1),y)]
10:Update the perturbation δ via gradient ascend
11:gadu ←VsL(fθ(X+δt-1),y) δt ←II|δ|lr≤e(δt-1+α:gadu/llgadullF)
12:
13:end for
14:0←0-TgK
end for 15: end for
", + "type": "table", + "image_path": "faa4884339b2dc56b051cb475bba7c56913f2fcee10d81fc04db122bc7add815.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 107, + 98, + 504, + 161.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 161.33333333333334, + 504, + 224.66666666666669 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 107, + 224.66666666666669, + 504, + 288.0 + ], + "spans": [], + "index": 3 + } + ] + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 106, + 308, + 505, + 408 + ], + "lines": [ + { + "bbox": [ + 106, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 505, + 321 + ], + "score": 1.0, + "content": "2019) and YOPO (Zhang et al., 2019) have been proposed to accelerate adversarial training. They", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 320, + 505, + 332 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 505, + 332 + ], + "score": 1.0, + "content": "achieve comparable robustness and generalization as standard PGD-trained models using only the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 330, + 504, + 342 + ], + "spans": [ + { + "bbox": [ + 106, + 330, + 504, + 342 + ], + "score": 1.0, + "content": "same or a slightly larger number of forward-backward passes as natural training (i.e., SGD on clean", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 340, + 506, + 355 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 443, + 355 + ], + "score": 1.0, + "content": "samples). FreeAT takes one descent step on the parameters together with each of the", + "type": "text" + }, + { + "bbox": [ + 444, + 342, + 454, + 351 + ], + "score": 0.82, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 340, + 506, + 355 + ], + "score": 1.0, + "content": "ascent steps", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 352, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 505, + 366 + ], + "score": 1.0, + "content": "on the perturbation. As a result, FreeAT may suffer from the “stale gradient” problem (Dutta et al.,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 362, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 217, + 376 + ], + "score": 1.0, + "content": "2018), where in every step", + "type": "text" + }, + { + "bbox": [ + 217, + 364, + 222, + 373 + ], + "score": 0.63, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 362, + 225, + 376 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 226, + 364, + 236, + 374 + ], + "score": 0.8, + "content": "\\delta _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 362, + 470, + 376 + ], + "score": 1.0, + "content": "does not necessarily maximize the model with parameter", + "type": "text" + }, + { + "bbox": [ + 470, + 364, + 480, + 374 + ], + "score": 0.87, + "content": "\\theta _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 362, + 505, + 376 + ], + "score": 1.0, + "content": "since", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 374, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 194, + 387 + ], + "score": 1.0, + "content": "its update is based on", + "type": "text" + }, + { + "bbox": [ + 195, + 374, + 304, + 387 + ], + "score": 0.89, + "content": "\\nabla _ { \\delta } L \\big ( f _ { \\pmb { \\theta } _ { t - 1 } } ( \\pmb { X } + \\delta _ { t - 1 } ) , y \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 374, + 370, + 387 + ], + "score": 1.0, + "content": ", and vice versa,", + "type": "text" + }, + { + "bbox": [ + 370, + 375, + 380, + 385 + ], + "score": 0.85, + "content": "\\theta _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 374, + 505, + 387 + ], + "score": 1.0, + "content": "does not necessarily minimize", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 384, + 506, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 246, + 399 + ], + "score": 1.0, + "content": "the adversarial risk with adversary", + "type": "text" + }, + { + "bbox": [ + 246, + 386, + 256, + 396 + ], + "score": 0.84, + "content": "\\delta _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 384, + 368, + 399 + ], + "score": 1.0, + "content": "since its update is based on", + "type": "text" + }, + { + "bbox": [ + 369, + 385, + 478, + 398 + ], + "score": 0.93, + "content": "\\nabla _ { \\pmb { \\theta } } L \\big ( f _ { \\pmb { \\theta } _ { t - 1 } } ( \\pmb { X } + \\delta _ { t - 1 } ) , y \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 384, + 506, + 399 + ], + "score": 1.0, + "content": ". Such", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 395, + 356, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 356, + 411 + ], + "score": 1.0, + "content": "a problem may be more significant when the step size is large.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 106, + 413, + 505, + 524 + ], + "lines": [ + { + "bbox": [ + 105, + 412, + 506, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 506, + 426 + ], + "score": 1.0, + "content": "Different from FreeAT, YOPO accumulates the gradient of the parameters from each of the ascent", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 424, + 506, + 437 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 324, + 437 + ], + "score": 1.0, + "content": "steps, and updates the parameters only once after the", + "type": "text" + }, + { + "bbox": [ + 324, + 425, + 335, + 434 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 424, + 506, + 437 + ], + "score": 1.0, + "content": "inner ascent steps. YOPO also advocates", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 435, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 106, + 435, + 506, + 448 + ], + "score": 1.0, + "content": "that after each back-propagation, one should take the gradient of the first hidden layer as a constant", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 447, + 505, + 458 + ], + "spans": [ + { + "bbox": [ + 106, + 447, + 505, + 458 + ], + "score": 1.0, + "content": "and perform several additional updates on the adversary using the product of this constant and the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 456, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 456, + 505, + 469 + ], + "score": 1.0, + "content": "Jacobian of the first layer of the network to obtain strong adversaries. However, when the first", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 466, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 104, + 466, + 505, + 482 + ], + "score": 1.0, + "content": "hidden layer is a linear layer as in their implementation, such an operation is equivalent to taking", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 478, + 506, + 492 + ], + "spans": [ + { + "bbox": [ + 104, + 478, + 506, + 492 + ], + "score": 1.0, + "content": "a larger step size on the adversary. The analysis backing the extra update steps also assumes a", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 488, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 505, + 504 + ], + "score": 1.0, + "content": "twice continuously differentiable loss, which does not hold for ReLU-based neural networks they", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 501, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 506, + 513 + ], + "score": 1.0, + "content": "experimented with, and thus the reasons for the success of such an algorithm remains obscure. We", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 512, + 403, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 403, + 525 + ], + "score": 1.0, + "content": "give empirical comparisons between YOPO and our approach in Sec. 4.3.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 107, + 528, + 505, + 606 + ], + "lines": [ + { + "bbox": [ + 106, + 529, + 504, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 504, + 541 + ], + "score": 1.0, + "content": "To obtain better solutions for the inner max and avoid fundamental limitations on the function class,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 540, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 506, + 552 + ], + "score": 1.0, + "content": "we propose FreeLB, which performs multiple PGD iterations to craft adversarial examples, and", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 351, + 563 + ], + "score": 1.0, + "content": "simultaneously accumulates the “free” parameter gradients", + "type": "text" + }, + { + "bbox": [ + 351, + 551, + 373, + 562 + ], + "score": 0.9, + "content": "\\nabla _ { \\boldsymbol { \\theta } } L", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "in each iteration. After that, it", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 226, + 574 + ], + "score": 1.0, + "content": "updates the model parameter", + "type": "text" + }, + { + "bbox": [ + 226, + 562, + 234, + 572 + ], + "score": 0.71, + "content": "\\pmb \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "all at once with the accumulated gradients. The overall procedure", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 250, + 585 + ], + "score": 1.0, + "content": "is shown in Algorithm 1, in which", + "type": "text" + }, + { + "bbox": [ + 250, + 573, + 284, + 584 + ], + "score": 0.9, + "content": "X + \\delta _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "is an approximation to the local maximum within the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 583, + 506, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 207, + 597 + ], + "score": 1.0, + "content": "intersection of two balls", + "type": "text" + }, + { + "bbox": [ + 207, + 584, + 318, + 596 + ], + "score": 0.9, + "content": "\\mathcal { T } _ { t } = \\mathcal { B } _ { X + \\delta _ { 0 } } ( \\alpha t ) \\cap \\mathcal { B } _ { X } ( \\epsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 583, + 506, + 597 + ], + "score": 1.0, + "content": ". By taking a descent step along the averaged", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 595, + 463, + 607 + ], + "spans": [ + { + "bbox": [ + 106, + 595, + 155, + 607 + ], + "score": 1.0, + "content": "gradients at", + "type": "text" + }, + { + "bbox": [ + 156, + 595, + 251, + 606 + ], + "score": 0.91, + "content": "X + \\delta _ { 0 } , . . . , X + \\delta _ { K - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 595, + 463, + 607 + ], + "score": 1.0, + "content": ", we approximately optimize the following objective:", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26 + }, + { + "type": "interline_equation", + "bbox": [ + 203, + 610, + 408, + 644 + ], + "lines": [ + { + "bbox": [ + 203, + 610, + 408, + 644 + ], + "spans": [ + { + "bbox": [ + 203, + 610, + 408, + 644 + ], + "score": 0.94, + "content": "\\underset { \\pmb { \\theta } } { \\operatorname* { m i n } } \\mathbb { E } _ { ( Z , y ) \\sim \\mathcal { D } } \\left[ \\frac { 1 } { K } \\sum _ { t = 0 } ^ { K - 1 } \\underset { \\delta _ { t } \\in \\mathcal { Z } _ { t } } { \\operatorname* { m a x } } L \\big ( f _ { \\pmb { \\theta } } \\big ( \\pmb { X } + \\delta _ { t } \\big ) , y \\big ) \\right] ,", + "type": "interline_equation", + "image_path": "ccae4d8ef9e13199ab20f9f8a5afaca5aac1d2c3bfff645daf32d9544c002c1d.jpg" + } + ] + } + ], + "index": 30.5, + "virtual_lines": [ + { + "bbox": [ + 203, + 610, + 408, + 627.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 203, + 627.0, + 408, + 644.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 647, + 505, + 693 + ], + "lines": [ + { + "bbox": [ + 105, + 646, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 307, + 660 + ], + "score": 1.0, + "content": "which is equivalent to replacing the original batch", + "type": "text" + }, + { + "bbox": [ + 307, + 648, + 318, + 657 + ], + "score": 0.82, + "content": "\\boldsymbol { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 646, + 345, + 660 + ], + "score": 1.0, + "content": "with a", + "type": "text" + }, + { + "bbox": [ + 346, + 648, + 356, + 657 + ], + "score": 0.84, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 646, + 505, + 660 + ], + "score": 1.0, + "content": "-times larger virtual batch, consisting", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 658, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 658, + 245, + 671 + ], + "score": 1.0, + "content": "of samples whose embeddings are", + "type": "text" + }, + { + "bbox": [ + 246, + 659, + 342, + 670 + ], + "score": 0.91, + "content": "X + \\delta _ { 0 } , . . . , X + \\delta _ { K - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 658, + 505, + 671 + ], + "score": 1.0, + "content": ". Compared with PGD-based adversarial", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 670, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 106, + 670, + 505, + 682 + ], + "score": 1.0, + "content": "training (Eq. 1), which minimizes the maximum risk at a single estimated point in the vicinity of each", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 680, + 494, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 680, + 494, + 693 + ], + "score": 1.0, + "content": "training sample, FreeLB minimizes the maximum risk at each ascent step at almost no overhead.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 107, + 697, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 697, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 506, + 711 + ], + "score": 1.0, + "content": "Intuitively, FreeLB could be a learning method with lower generalization error than PGD. Sokolic", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 708, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 721 + ], + "score": 1.0, + "content": "et al. (2017) have proved that the generalization error of a learning method invariant to a set of√", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 719, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 115, + 730 + ], + "score": 0.76, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 719, + 240, + 734 + ], + "score": 1.0, + "content": "transformations may be up to", + "type": "text" + }, + { + "bbox": [ + 240, + 720, + 257, + 731 + ], + "score": 0.91, + "content": "\\sqrt { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 719, + 506, + 734 + ], + "score": 1.0, + "content": "smaller than a non-invariant learning method. According to", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37 + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 759 + ], + "lines": [] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 106, + 82, + 379, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 379, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 364, + 96 + ], + "score": 1.0, + "content": "Algorithm 1 “Free” Large-Batch Adversarial Training (FreeLB-", + "type": "text" + }, + { + "bbox": [ + 365, + 83, + 375, + 92 + ], + "score": 0.46, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 81, + 379, + 96 + ], + "score": 1.0, + "content": ")", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table", + "bbox": [ + 107, + 98, + 504, + 288 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 107, + 98, + 504, + 288 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 98, + 504, + 288 + ], + "spans": [ + { + "bbox": [ + 107, + 98, + 504, + 288 + ], + "score": 0.368, + "html": "
ascent step size αRequire: Training samples X = {(Z,y)}, perturbation bound ε, learning rate T, ascent steps K,
1:Initialize 0
2: for epoch =1... Nep do
3:for minibatchB ℃Xdo
4:U(-∈,∈)
5:90↑0
6:
7:fort=1...K do
8:Accumulate gradient of parameters θ
9:gt←gt-1+kE(z,y)∈B[VθL(fe(X+δt-1),y)]
10:Update the perturbation δ via gradient ascend
11:gadu ←VsL(fθ(X+δt-1),y) δt ←II|δ|lr≤e(δt-1+α:gadu/llgadullF)
12:
13:end for
14:0←0-TgK
end for 15: end for
", + "type": "table", + "image_path": "faa4884339b2dc56b051cb475bba7c56913f2fcee10d81fc04db122bc7add815.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 107, + 98, + 504, + 161.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 161.33333333333334, + 504, + 224.66666666666669 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 107, + 224.66666666666669, + 504, + 288.0 + ], + "spans": [], + "index": 3 + } + ] + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 106, + 308, + 505, + 408 + ], + "lines": [ + { + "bbox": [ + 106, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 505, + 321 + ], + "score": 1.0, + "content": "2019) and YOPO (Zhang et al., 2019) have been proposed to accelerate adversarial training. They", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 320, + 505, + 332 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 505, + 332 + ], + "score": 1.0, + "content": "achieve comparable robustness and generalization as standard PGD-trained models using only the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 330, + 504, + 342 + ], + "spans": [ + { + "bbox": [ + 106, + 330, + 504, + 342 + ], + "score": 1.0, + "content": "same or a slightly larger number of forward-backward passes as natural training (i.e., SGD on clean", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 340, + 506, + 355 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 443, + 355 + ], + "score": 1.0, + "content": "samples). FreeAT takes one descent step on the parameters together with each of the", + "type": "text" + }, + { + "bbox": [ + 444, + 342, + 454, + 351 + ], + "score": 0.82, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 340, + 506, + 355 + ], + "score": 1.0, + "content": "ascent steps", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 352, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 505, + 366 + ], + "score": 1.0, + "content": "on the perturbation. As a result, FreeAT may suffer from the “stale gradient” problem (Dutta et al.,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 362, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 217, + 376 + ], + "score": 1.0, + "content": "2018), where in every step", + "type": "text" + }, + { + "bbox": [ + 217, + 364, + 222, + 373 + ], + "score": 0.63, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 362, + 225, + 376 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 226, + 364, + 236, + 374 + ], + "score": 0.8, + "content": "\\delta _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 362, + 470, + 376 + ], + "score": 1.0, + "content": "does not necessarily maximize the model with parameter", + "type": "text" + }, + { + "bbox": [ + 470, + 364, + 480, + 374 + ], + "score": 0.87, + "content": "\\theta _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 362, + 505, + 376 + ], + "score": 1.0, + "content": "since", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 374, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 194, + 387 + ], + "score": 1.0, + "content": "its update is based on", + "type": "text" + }, + { + "bbox": [ + 195, + 374, + 304, + 387 + ], + "score": 0.89, + "content": "\\nabla _ { \\delta } L \\big ( f _ { \\pmb { \\theta } _ { t - 1 } } ( \\pmb { X } + \\delta _ { t - 1 } ) , y \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 374, + 370, + 387 + ], + "score": 1.0, + "content": ", and vice versa,", + "type": "text" + }, + { + "bbox": [ + 370, + 375, + 380, + 385 + ], + "score": 0.85, + "content": "\\theta _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 374, + 505, + 387 + ], + "score": 1.0, + "content": "does not necessarily minimize", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 384, + 506, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 246, + 399 + ], + "score": 1.0, + "content": "the adversarial risk with adversary", + "type": "text" + }, + { + "bbox": [ + 246, + 386, + 256, + 396 + ], + "score": 0.84, + "content": "\\delta _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 384, + 368, + 399 + ], + "score": 1.0, + "content": "since its update is based on", + "type": "text" + }, + { + "bbox": [ + 369, + 385, + 478, + 398 + ], + "score": 0.93, + "content": "\\nabla _ { \\pmb { \\theta } } L \\big ( f _ { \\pmb { \\theta } _ { t - 1 } } ( \\pmb { X } + \\delta _ { t - 1 } ) , y \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 384, + 506, + 399 + ], + "score": 1.0, + "content": ". Such", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 395, + 356, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 356, + 411 + ], + "score": 1.0, + "content": "a problem may be more significant when the step size is large.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 307, + 506, + 411 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 413, + 505, + 524 + ], + "lines": [ + { + "bbox": [ + 105, + 412, + 506, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 506, + 426 + ], + "score": 1.0, + "content": "Different from FreeAT, YOPO accumulates the gradient of the parameters from each of the ascent", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 424, + 506, + 437 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 324, + 437 + ], + "score": 1.0, + "content": "steps, and updates the parameters only once after the", + "type": "text" + }, + { + "bbox": [ + 324, + 425, + 335, + 434 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 424, + 506, + 437 + ], + "score": 1.0, + "content": "inner ascent steps. YOPO also advocates", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 435, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 106, + 435, + 506, + 448 + ], + "score": 1.0, + "content": "that after each back-propagation, one should take the gradient of the first hidden layer as a constant", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 447, + 505, + 458 + ], + "spans": [ + { + "bbox": [ + 106, + 447, + 505, + 458 + ], + "score": 1.0, + "content": "and perform several additional updates on the adversary using the product of this constant and the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 456, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 456, + 505, + 469 + ], + "score": 1.0, + "content": "Jacobian of the first layer of the network to obtain strong adversaries. However, when the first", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 466, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 104, + 466, + 505, + 482 + ], + "score": 1.0, + "content": "hidden layer is a linear layer as in their implementation, such an operation is equivalent to taking", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 478, + 506, + 492 + ], + "spans": [ + { + "bbox": [ + 104, + 478, + 506, + 492 + ], + "score": 1.0, + "content": "a larger step size on the adversary. The analysis backing the extra update steps also assumes a", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 488, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 505, + 504 + ], + "score": 1.0, + "content": "twice continuously differentiable loss, which does not hold for ReLU-based neural networks they", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 501, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 506, + 513 + ], + "score": 1.0, + "content": "experimented with, and thus the reasons for the success of such an algorithm remains obscure. We", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 512, + 403, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 403, + 525 + ], + "score": 1.0, + "content": "give empirical comparisons between YOPO and our approach in Sec. 4.3.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 17.5, + "bbox_fs": [ + 104, + 412, + 506, + 525 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 528, + 505, + 606 + ], + "lines": [ + { + "bbox": [ + 106, + 529, + 504, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 504, + 541 + ], + "score": 1.0, + "content": "To obtain better solutions for the inner max and avoid fundamental limitations on the function class,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 540, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 506, + 552 + ], + "score": 1.0, + "content": "we propose FreeLB, which performs multiple PGD iterations to craft adversarial examples, and", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 351, + 563 + ], + "score": 1.0, + "content": "simultaneously accumulates the “free” parameter gradients", + "type": "text" + }, + { + "bbox": [ + 351, + 551, + 373, + 562 + ], + "score": 0.9, + "content": "\\nabla _ { \\boldsymbol { \\theta } } L", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "in each iteration. After that, it", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 226, + 574 + ], + "score": 1.0, + "content": "updates the model parameter", + "type": "text" + }, + { + "bbox": [ + 226, + 562, + 234, + 572 + ], + "score": 0.71, + "content": "\\pmb \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "all at once with the accumulated gradients. The overall procedure", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 250, + 585 + ], + "score": 1.0, + "content": "is shown in Algorithm 1, in which", + "type": "text" + }, + { + "bbox": [ + 250, + 573, + 284, + 584 + ], + "score": 0.9, + "content": "X + \\delta _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "is an approximation to the local maximum within the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 583, + 506, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 207, + 597 + ], + "score": 1.0, + "content": "intersection of two balls", + "type": "text" + }, + { + "bbox": [ + 207, + 584, + 318, + 596 + ], + "score": 0.9, + "content": "\\mathcal { T } _ { t } = \\mathcal { B } _ { X + \\delta _ { 0 } } ( \\alpha t ) \\cap \\mathcal { B } _ { X } ( \\epsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 583, + 506, + 597 + ], + "score": 1.0, + "content": ". By taking a descent step along the averaged", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 595, + 463, + 607 + ], + "spans": [ + { + "bbox": [ + 106, + 595, + 155, + 607 + ], + "score": 1.0, + "content": "gradients at", + "type": "text" + }, + { + "bbox": [ + 156, + 595, + 251, + 606 + ], + "score": 0.91, + "content": "X + \\delta _ { 0 } , . . . , X + \\delta _ { K - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 595, + 463, + 607 + ], + "score": 1.0, + "content": ", we approximately optimize the following objective:", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 529, + 506, + 607 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 203, + 610, + 408, + 644 + ], + "lines": [ + { + "bbox": [ + 203, + 610, + 408, + 644 + ], + "spans": [ + { + "bbox": [ + 203, + 610, + 408, + 644 + ], + "score": 0.94, + "content": "\\underset { \\pmb { \\theta } } { \\operatorname* { m i n } } \\mathbb { E } _ { ( Z , y ) \\sim \\mathcal { D } } \\left[ \\frac { 1 } { K } \\sum _ { t = 0 } ^ { K - 1 } \\underset { \\delta _ { t } \\in \\mathcal { Z } _ { t } } { \\operatorname* { m a x } } L \\big ( f _ { \\pmb { \\theta } } \\big ( \\pmb { X } + \\delta _ { t } \\big ) , y \\big ) \\right] ,", + "type": "interline_equation", + "image_path": "ccae4d8ef9e13199ab20f9f8a5afaca5aac1d2c3bfff645daf32d9544c002c1d.jpg" + } + ] + } + ], + "index": 30.5, + "virtual_lines": [ + { + "bbox": [ + 203, + 610, + 408, + 627.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 203, + 627.0, + 408, + 644.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 647, + 505, + 693 + ], + "lines": [ + { + "bbox": [ + 105, + 646, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 307, + 660 + ], + "score": 1.0, + "content": "which is equivalent to replacing the original batch", + "type": "text" + }, + { + "bbox": [ + 307, + 648, + 318, + 657 + ], + "score": 0.82, + "content": "\\boldsymbol { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 646, + 345, + 660 + ], + "score": 1.0, + "content": "with a", + "type": "text" + }, + { + "bbox": [ + 346, + 648, + 356, + 657 + ], + "score": 0.84, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 646, + 505, + 660 + ], + "score": 1.0, + "content": "-times larger virtual batch, consisting", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 658, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 658, + 245, + 671 + ], + "score": 1.0, + "content": "of samples whose embeddings are", + "type": "text" + }, + { + "bbox": [ + 246, + 659, + 342, + 670 + ], + "score": 0.91, + "content": "X + \\delta _ { 0 } , . . . , X + \\delta _ { K - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 658, + 505, + 671 + ], + "score": 1.0, + "content": ". Compared with PGD-based adversarial", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 670, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 106, + 670, + 505, + 682 + ], + "score": 1.0, + "content": "training (Eq. 1), which minimizes the maximum risk at a single estimated point in the vicinity of each", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 680, + 494, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 680, + 494, + 693 + ], + "score": 1.0, + "content": "training sample, FreeLB minimizes the maximum risk at each ascent step at almost no overhead.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 646, + 505, + 693 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 697, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 697, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 506, + 711 + ], + "score": 1.0, + "content": "Intuitively, FreeLB could be a learning method with lower generalization error than PGD. Sokolic", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 708, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 721 + ], + "score": 1.0, + "content": "et al. (2017) have proved that the generalization error of a learning method invariant to a set of√", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 719, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 115, + 730 + ], + "score": 0.76, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 719, + 240, + 734 + ], + "score": 1.0, + "content": "transformations may be up to", + "type": "text" + }, + { + "bbox": [ + 240, + 720, + 257, + 731 + ], + "score": 0.91, + "content": "\\sqrt { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 719, + 506, + 734 + ], + "score": 1.0, + "content": "smaller than a non-invariant learning method. According to", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "their theory, FreeLB could have a more significant improvement over natural training, since FreeLB", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 213, + 106 + ], + "score": 1.0, + "content": "enforces the invariance to", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 214, + 94, + 225, + 104 + ], + "score": 0.77, + "content": "K", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 225, + 93, + 353, + 106 + ], + "score": 1.0, + "content": "adversaries from a set of up to", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 354, + 94, + 365, + 104 + ], + "score": 0.81, + "content": "K", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 365, + 93, + 506, + 106 + ], + "score": 1.0, + "content": "different norm constraints,3 while", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 347, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 337, + 117 + ], + "score": 1.0, + "content": "PGD only enforces invariance to a single norm constraint", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 338, + 107, + 343, + 114 + ], + "score": 0.54, + "content": "\\epsilon", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 343, + 105, + 347, + 117 + ], + "score": 1.0, + "content": ".", + "type": "text", + "cross_page": true + } + ], + "index": 2 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 697, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "their theory, FreeLB could have a more significant improvement over natural training, since FreeLB", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 213, + 106 + ], + "score": 1.0, + "content": "enforces the invariance to", + "type": "text" + }, + { + "bbox": [ + 214, + 94, + 225, + 104 + ], + "score": 0.77, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 93, + 353, + 106 + ], + "score": 1.0, + "content": "adversaries from a set of up to", + "type": "text" + }, + { + "bbox": [ + 354, + 94, + 365, + 104 + ], + "score": 0.81, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 93, + 506, + 106 + ], + "score": 1.0, + "content": "different norm constraints,3 while", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 347, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 337, + 117 + ], + "score": 1.0, + "content": "PGD only enforces invariance to a single norm constraint", + "type": "text" + }, + { + "bbox": [ + 338, + 107, + 343, + 114 + ], + "score": 0.54, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 105, + 347, + 117 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 107, + 121, + 505, + 188 + ], + "lines": [ + { + "bbox": [ + 105, + 120, + 505, + 135 + ], + "spans": [ + { + "bbox": [ + 105, + 120, + 505, + 135 + ], + "score": 1.0, + "content": "Empirically, FreeLB does lead to higher robustness and invariance than PGD in the embedding", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 395, + 144 + ], + "score": 1.0, + "content": "space, in the sense that the maximum increase of loss in the vicinity of", + "type": "text" + }, + { + "bbox": [ + 396, + 133, + 406, + 142 + ], + "score": 0.8, + "content": "\\boldsymbol { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 132, + 505, + 144 + ], + "score": 1.0, + "content": "for models trained with", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "score": 1.0, + "content": "FreeLB is smaller than that with PGD. See Sec. 4.3 for details. In theory, such improved robustness", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "score": 1.0, + "content": "can lead to better generalization (Xu & Mannor, 2012), which is consistent with our experiments.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 165, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 106, + 165, + 505, + 177 + ], + "score": 1.0, + "content": "Qin et al. (2019) also demonstrated that PGD-based method leads to highly convolved and non-linear", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 483, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 309, + 189 + ], + "score": 1.0, + "content": "loss surfaces in the vicinity of input samples when", + "type": "text" + }, + { + "bbox": [ + 310, + 177, + 320, + 186 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 176, + 483, + 189 + ], + "score": 1.0, + "content": "is small, indicating a lack of robustness.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5 + }, + { + "type": "title", + "bbox": [ + 107, + 202, + 349, + 214 + ], + "lines": [ + { + "bbox": [ + 105, + 202, + 350, + 215 + ], + "spans": [ + { + "bbox": [ + 105, + 202, + 350, + 215 + ], + "score": 1.0, + "content": "3.3 WHEN ADVERSARIAL TRAINING MEETS DROPOUT", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 107, + 220, + 505, + 299 + ], + "lines": [ + { + "bbox": [ + 106, + 221, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 505, + 233 + ], + "score": 1.0, + "content": "Usually, adversarial training is not used together with dropout (Srivastava et al., 2014). However, for", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 231, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 505, + 246 + ], + "score": 1.0, + "content": "some language models like RoBERTa (Liu et al., 2019b), dropout is used during the finetuning stage.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 243, + 504, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 243, + 441, + 255 + ], + "score": 1.0, + "content": "In practice, when dropout is turned on, each ascent step of Algorithm 1 is optimizing", + "type": "text" + }, + { + "bbox": [ + 441, + 243, + 447, + 253 + ], + "score": 0.69, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 243, + 504, + 255 + ], + "score": 1.0, + "content": "for a different", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 254, + 506, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 306, + 266 + ], + "score": 1.0, + "content": "network. Specifically, denote the dropout mask as", + "type": "text" + }, + { + "bbox": [ + 306, + 255, + 318, + 264 + ], + "score": 0.58, + "content": "_ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 254, + 381, + 266 + ], + "score": 1.0, + "content": "with each entry", + "type": "text" + }, + { + "bbox": [ + 382, + 254, + 459, + 265 + ], + "score": 0.81, + "content": "m _ { i } \\sim \\mathrm { B e r n o u l l i } ( p )", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 254, + 506, + 266 + ], + "score": 1.0, + "content": ". Similar to", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 263, + 506, + 279 + ], + "spans": [ + { + "bbox": [ + 104, + 263, + 288, + 279 + ], + "score": 1.0, + "content": "our analysis for FreeAT, the ascent step from", + "type": "text" + }, + { + "bbox": [ + 288, + 265, + 307, + 276 + ], + "score": 0.91, + "content": "\\delta _ { t - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 263, + 319, + 279 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 319, + 265, + 329, + 276 + ], + "score": 0.88, + "content": "\\delta _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 263, + 377, + 279 + ], + "score": 1.0, + "content": "is based on", + "type": "text" + }, + { + "bbox": [ + 378, + 265, + 501, + 278 + ], + "score": 0.91, + "content": "\\nabla _ { \\delta } L \\big ( f _ { \\theta ( m _ { t - 1 } ) } \\big ( \\boldsymbol { X } + \\delta _ { t - 1 } \\big ) , \\boldsymbol { y } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 263, + 506, + 279 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 276, + 506, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 117, + 290 + ], + "score": 1.0, + "content": "so", + "type": "text" + }, + { + "bbox": [ + 118, + 277, + 127, + 288 + ], + "score": 0.87, + "content": "\\delta _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 128, + 276, + 201, + 290 + ], + "score": 1.0, + "content": "is sub-optimal for", + "type": "text" + }, + { + "bbox": [ + 201, + 276, + 289, + 290 + ], + "score": 0.93, + "content": "L ( f _ { \\theta ( m _ { t } ) } ( \\boldsymbol { X } + \\delta ) , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 276, + 314, + 290 + ], + "score": 1.0, + "content": ". Here", + "type": "text" + }, + { + "bbox": [ + 315, + 277, + 339, + 289 + ], + "score": 0.92, + "content": "\\theta ( m )", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 276, + 506, + 290 + ], + "score": 1.0, + "content": "is the effective parameters under dropout", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 287, + 145, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 130, + 300 + ], + "score": 1.0, + "content": "mask", + "type": "text" + }, + { + "bbox": [ + 130, + 289, + 141, + 298 + ], + "score": 0.63, + "content": "_ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 287, + 145, + 300 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 108, + 304, + 505, + 349 + ], + "lines": [ + { + "bbox": [ + 105, + 303, + 505, + 317 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 295, + 317 + ], + "score": 1.0, + "content": "The more plausible solution is to use the same", + "type": "text" + }, + { + "bbox": [ + 295, + 307, + 307, + 315 + ], + "score": 0.68, + "content": "_ { \\mathbf { \\nabla } } \\mathbf { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 303, + 505, + 317 + ], + "score": 1.0, + "content": "in each step. When applying dropout to any net-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 316, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 106, + 316, + 199, + 327 + ], + "score": 1.0, + "content": "work, the objective for", + "type": "text" + }, + { + "bbox": [ + 199, + 316, + 206, + 326 + ], + "score": 0.78, + "content": "\\pmb \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 206, + 316, + 505, + 327 + ], + "score": 1.0, + "content": "is to minimize the expectation of loss under different networks determined", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 327, + 506, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 506, + 340 + ], + "score": 1.0, + "content": "by the dropout masks, which is achieved by minimizing the Monte Carlo estimation of the expected", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 337, + 270, + 350 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 270, + 350 + ], + "score": 1.0, + "content": "loss. In our case, the objective becomes:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18.5 + }, + { + "type": "interline_equation", + "bbox": [ + 182, + 355, + 429, + 390 + ], + "lines": [ + { + "bbox": [ + 182, + 355, + 429, + 390 + ], + "spans": [ + { + "bbox": [ + 182, + 355, + 429, + 390 + ], + "score": 0.94, + "content": "\\operatorname* { m i n } _ { \\theta } \\mathbb { E } _ { ( Z , y ) \\sim \\mathcal { D } , m \\sim \\mathcal { M } } \\left[ \\frac { 1 } { K } \\sum _ { t = 0 } ^ { K - 1 } \\operatorname* { m a x } _ { \\delta _ { t } \\in \\mathcal { T } _ { t } } L \\big ( f _ { \\theta ( m ) } ( X + \\delta _ { t } ) , y \\big ) \\right] ,", + "type": "interline_equation", + "image_path": "e662cc84309c58d4d57852d609bdc508f80860aaba1115045b618ae79744dc0a.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 182, + 355, + 429, + 366.6666666666667 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 182, + 366.6666666666667, + 429, + 378.33333333333337 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 182, + 378.33333333333337, + 429, + 390.00000000000006 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 397, + 505, + 432 + ], + "lines": [ + { + "bbox": [ + 103, + 396, + 504, + 416 + ], + "spans": [ + { + "bbox": [ + 103, + 396, + 328, + 416 + ], + "score": 1.0, + "content": "where the 1-sample Monte Carlo estimation should be", + "type": "text" + }, + { + "bbox": [ + 328, + 397, + 504, + 412 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\frac { 1 } { K } \\sum _ { t = 0 } ^ { K - 1 } \\operatorname* { m a x } _ { \\delta _ { t } \\in \\mathcal { T } _ { t } } L ( f _ { \\theta ( m _ { 0 } ) } ( X + \\delta _ { t } ) , y ) } \\end{array}", + "type": "inline_equation" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 409, + 506, + 422 + ], + "spans": [ + { + "bbox": [ + 106, + 409, + 346, + 422 + ], + "score": 1.0, + "content": "and can be minimized by using FreeLB with dropout mask", + "type": "text" + }, + { + "bbox": [ + 346, + 412, + 362, + 421 + ], + "score": 0.81, + "content": "m _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 409, + 506, + 422 + ], + "score": 1.0, + "content": "in each ascent step. This is similar", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 420, + 426, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 426, + 433 + ], + "score": 1.0, + "content": "to applying Variational Dropout to RNNs as used in Gal & Ghahramani (2016).", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "title", + "bbox": [ + 108, + 450, + 200, + 462 + ], + "lines": [ + { + "bbox": [ + 105, + 448, + 201, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 448, + 201, + 464 + ], + "score": 1.0, + "content": "4 EXPERIMENTS", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 475, + 505, + 531 + ], + "lines": [ + { + "bbox": [ + 105, + 475, + 506, + 488 + ], + "spans": [ + { + "bbox": [ + 105, + 475, + 506, + 488 + ], + "score": 1.0, + "content": "In this section, we provide comprehensive analysis on FreeLB through extensive experiments on", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 487, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 487, + 505, + 498 + ], + "score": 1.0, + "content": "three Natural Language Understanding benchmarks: GLUE (Wang et al., 2019), ARC (Clark et al.,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 496, + 505, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 505, + 510 + ], + "score": 1.0, + "content": "2018) and CommonsenseQA (Talmor et al., 2019). We also compare the robustness and general-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 508, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 505, + 522 + ], + "score": 1.0, + "content": "ization of FreeLB with other adversarial training algorithms to demonstrate its strength. Additional", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 519, + 311, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 311, + 532 + ], + "score": 1.0, + "content": "experimental details are provided in the Appendix.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30 + }, + { + "type": "title", + "bbox": [ + 107, + 545, + 176, + 557 + ], + "lines": [ + { + "bbox": [ + 105, + 544, + 177, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 177, + 559 + ], + "score": 1.0, + "content": "4.1 DATASETS", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 106, + 566, + 505, + 688 + ], + "lines": [ + { + "bbox": [ + 105, + 565, + 505, + 580 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 505, + 580 + ], + "score": 1.0, + "content": "GLUE Benchmark. The GLUE benchmark is a collection of 9 natural language understanding", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 578, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 505, + 590 + ], + "score": 1.0, + "content": "tasks, namely Corpus of Linguistic Acceptability (CoLA; Warstadt et al. (2018)), Stanford Senti-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 588, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 601 + ], + "score": 1.0, + "content": "ment Treebank (SST; Socher et al. (2013)), Microsoft Research Paraphrase Corpus (MRPC; Dolan", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 599, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 506, + 613 + ], + "score": 1.0, + "content": "& Brockett (2005)), Semantic Textual Similarity Benchmark (STS; Agirre et al. (2007)), Quora", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 610, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 506, + 623 + ], + "score": 1.0, + "content": "Question Pairs (QQP; Iyer et al. (2017)), Multi-Genre NLI (MNLI; Williams et al. (2018)), Question", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 104, + 620, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 104, + 620, + 506, + 635 + ], + "score": 1.0, + "content": "NLI (QNLI; Rajpurkar et al. (2016)), Recognizing Textual Entailment (RTE; Dagan et al. (2006);", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 632, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 506, + 646 + ], + "score": 1.0, + "content": "Bar Haim et al. (2006); Giampiccolo et al. (2007); Bentivogli et al. (2009)) and Winograd NLI", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "(WNLI; Levesque et al. (2011)). 8 of the tasks are formulated as classification problems and only", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "score": 1.0, + "content": "STS-B is formulated as regression, but FreeLB applies to all of them. For BERT-base, we use the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 665, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 506, + 678 + ], + "score": 1.0, + "content": "HuggingFace implementation4, and follow the single-task finetuning procedure as in Devlin et al.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "(2019). For RoBERTa, we use the fairseq implementation5. Same as Liu et al. (2019b), we also use", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 39 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 118, + 698, + 375, + 732 + ], + "lines": [ + { + "bbox": [ + 117, + 693, + 374, + 713 + ], + "spans": [ + { + "bbox": [ + 117, + 693, + 277, + 713 + ], + "score": 1.0, + "content": "3The cardinality of the set is approximately", + "type": "text" + }, + { + "bbox": [ + 277, + 697, + 374, + 711 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\operatorname* { m i n } \\{ K , \\lceil \\frac { \\epsilon - \\mathbb { E } [ \\| \\delta _ { 0 } \\| ] } { \\alpha } \\rceil + 1 \\} } \\end{array}", + "type": "inline_equation" + } + ] + }, + { + "bbox": [ + 118, + 709, + 316, + 722 + ], + "spans": [ + { + "bbox": [ + 118, + 709, + 316, + 722 + ], + "score": 1.0, + "content": "4https://github.com/huggingface/pytorch-transformers", + "type": "text" + } + ] + }, + { + "bbox": [ + 119, + 720, + 247, + 733 + ], + "spans": [ + { + "bbox": [ + 119, + 720, + 247, + 733 + ], + "score": 1.0, + "content": "5https://github.com/pytorch/fairseq", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 116 + ], + "lines": [], + "index": 1, + "bbox_fs": [ + 105, + 81, + 506, + 117 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 121, + 505, + 188 + ], + "lines": [ + { + "bbox": [ + 105, + 120, + 505, + 135 + ], + "spans": [ + { + "bbox": [ + 105, + 120, + 505, + 135 + ], + "score": 1.0, + "content": "Empirically, FreeLB does lead to higher robustness and invariance than PGD in the embedding", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 395, + 144 + ], + "score": 1.0, + "content": "space, in the sense that the maximum increase of loss in the vicinity of", + "type": "text" + }, + { + "bbox": [ + 396, + 133, + 406, + 142 + ], + "score": 0.8, + "content": "\\boldsymbol { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 132, + 505, + 144 + ], + "score": 1.0, + "content": "for models trained with", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "score": 1.0, + "content": "FreeLB is smaller than that with PGD. See Sec. 4.3 for details. In theory, such improved robustness", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "score": 1.0, + "content": "can lead to better generalization (Xu & Mannor, 2012), which is consistent with our experiments.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 165, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 106, + 165, + 505, + 177 + ], + "score": 1.0, + "content": "Qin et al. (2019) also demonstrated that PGD-based method leads to highly convolved and non-linear", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 483, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 309, + 189 + ], + "score": 1.0, + "content": "loss surfaces in the vicinity of input samples when", + "type": "text" + }, + { + "bbox": [ + 310, + 177, + 320, + 186 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 176, + 483, + 189 + ], + "score": 1.0, + "content": "is small, indicating a lack of robustness.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 120, + 505, + 189 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 202, + 349, + 214 + ], + "lines": [ + { + "bbox": [ + 105, + 202, + 350, + 215 + ], + "spans": [ + { + "bbox": [ + 105, + 202, + 350, + 215 + ], + "score": 1.0, + "content": "3.3 WHEN ADVERSARIAL TRAINING MEETS DROPOUT", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 107, + 220, + 505, + 299 + ], + "lines": [ + { + "bbox": [ + 106, + 221, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 505, + 233 + ], + "score": 1.0, + "content": "Usually, adversarial training is not used together with dropout (Srivastava et al., 2014). However, for", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 231, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 505, + 246 + ], + "score": 1.0, + "content": "some language models like RoBERTa (Liu et al., 2019b), dropout is used during the finetuning stage.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 243, + 504, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 243, + 441, + 255 + ], + "score": 1.0, + "content": "In practice, when dropout is turned on, each ascent step of Algorithm 1 is optimizing", + "type": "text" + }, + { + "bbox": [ + 441, + 243, + 447, + 253 + ], + "score": 0.69, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 243, + 504, + 255 + ], + "score": 1.0, + "content": "for a different", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 254, + 506, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 306, + 266 + ], + "score": 1.0, + "content": "network. Specifically, denote the dropout mask as", + "type": "text" + }, + { + "bbox": [ + 306, + 255, + 318, + 264 + ], + "score": 0.58, + "content": "_ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 254, + 381, + 266 + ], + "score": 1.0, + "content": "with each entry", + "type": "text" + }, + { + "bbox": [ + 382, + 254, + 459, + 265 + ], + "score": 0.81, + "content": "m _ { i } \\sim \\mathrm { B e r n o u l l i } ( p )", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 254, + 506, + 266 + ], + "score": 1.0, + "content": ". Similar to", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 263, + 506, + 279 + ], + "spans": [ + { + "bbox": [ + 104, + 263, + 288, + 279 + ], + "score": 1.0, + "content": "our analysis for FreeAT, the ascent step from", + "type": "text" + }, + { + "bbox": [ + 288, + 265, + 307, + 276 + ], + "score": 0.91, + "content": "\\delta _ { t - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 263, + 319, + 279 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 319, + 265, + 329, + 276 + ], + "score": 0.88, + "content": "\\delta _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 263, + 377, + 279 + ], + "score": 1.0, + "content": "is based on", + "type": "text" + }, + { + "bbox": [ + 378, + 265, + 501, + 278 + ], + "score": 0.91, + "content": "\\nabla _ { \\delta } L \\big ( f _ { \\theta ( m _ { t - 1 } ) } \\big ( \\boldsymbol { X } + \\delta _ { t - 1 } \\big ) , \\boldsymbol { y } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 263, + 506, + 279 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 276, + 506, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 117, + 290 + ], + "score": 1.0, + "content": "so", + "type": "text" + }, + { + "bbox": [ + 118, + 277, + 127, + 288 + ], + "score": 0.87, + "content": "\\delta _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 128, + 276, + 201, + 290 + ], + "score": 1.0, + "content": "is sub-optimal for", + "type": "text" + }, + { + "bbox": [ + 201, + 276, + 289, + 290 + ], + "score": 0.93, + "content": "L ( f _ { \\theta ( m _ { t } ) } ( \\boldsymbol { X } + \\delta ) , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 276, + 314, + 290 + ], + "score": 1.0, + "content": ". Here", + "type": "text" + }, + { + "bbox": [ + 315, + 277, + 339, + 289 + ], + "score": 0.92, + "content": "\\theta ( m )", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 276, + 506, + 290 + ], + "score": 1.0, + "content": "is the effective parameters under dropout", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 287, + 145, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 130, + 300 + ], + "score": 1.0, + "content": "mask", + "type": "text" + }, + { + "bbox": [ + 130, + 289, + 141, + 298 + ], + "score": 0.63, + "content": "_ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 287, + 145, + 300 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 13, + "bbox_fs": [ + 104, + 221, + 506, + 300 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 304, + 505, + 349 + ], + "lines": [ + { + "bbox": [ + 105, + 303, + 505, + 317 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 295, + 317 + ], + "score": 1.0, + "content": "The more plausible solution is to use the same", + "type": "text" + }, + { + "bbox": [ + 295, + 307, + 307, + 315 + ], + "score": 0.68, + "content": "_ { \\mathbf { \\nabla } } \\mathbf { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 303, + 505, + 317 + ], + "score": 1.0, + "content": "in each step. When applying dropout to any net-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 316, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 106, + 316, + 199, + 327 + ], + "score": 1.0, + "content": "work, the objective for", + "type": "text" + }, + { + "bbox": [ + 199, + 316, + 206, + 326 + ], + "score": 0.78, + "content": "\\pmb \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 206, + 316, + 505, + 327 + ], + "score": 1.0, + "content": "is to minimize the expectation of loss under different networks determined", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 327, + 506, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 506, + 340 + ], + "score": 1.0, + "content": "by the dropout masks, which is achieved by minimizing the Monte Carlo estimation of the expected", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 337, + 270, + 350 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 270, + 350 + ], + "score": 1.0, + "content": "loss. In our case, the objective becomes:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 303, + 506, + 350 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 182, + 355, + 429, + 390 + ], + "lines": [ + { + "bbox": [ + 182, + 355, + 429, + 390 + ], + "spans": [ + { + "bbox": [ + 182, + 355, + 429, + 390 + ], + "score": 0.94, + "content": "\\operatorname* { m i n } _ { \\theta } \\mathbb { E } _ { ( Z , y ) \\sim \\mathcal { D } , m \\sim \\mathcal { M } } \\left[ \\frac { 1 } { K } \\sum _ { t = 0 } ^ { K - 1 } \\operatorname* { m a x } _ { \\delta _ { t } \\in \\mathcal { T } _ { t } } L \\big ( f _ { \\theta ( m ) } ( X + \\delta _ { t } ) , y \\big ) \\right] ,", + "type": "interline_equation", + "image_path": "e662cc84309c58d4d57852d609bdc508f80860aaba1115045b618ae79744dc0a.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 182, + 355, + 429, + 366.6666666666667 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 182, + 366.6666666666667, + 429, + 378.33333333333337 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 182, + 378.33333333333337, + 429, + 390.00000000000006 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 397, + 505, + 432 + ], + "lines": [ + { + "bbox": [ + 103, + 396, + 504, + 416 + ], + "spans": [ + { + "bbox": [ + 103, + 396, + 328, + 416 + ], + "score": 1.0, + "content": "where the 1-sample Monte Carlo estimation should be", + "type": "text" + }, + { + "bbox": [ + 328, + 397, + 504, + 412 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\frac { 1 } { K } \\sum _ { t = 0 } ^ { K - 1 } \\operatorname* { m a x } _ { \\delta _ { t } \\in \\mathcal { T } _ { t } } L ( f _ { \\theta ( m _ { 0 } ) } ( X + \\delta _ { t } ) , y ) } \\end{array}", + "type": "inline_equation" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 409, + 506, + 422 + ], + "spans": [ + { + "bbox": [ + 106, + 409, + 346, + 422 + ], + "score": 1.0, + "content": "and can be minimized by using FreeLB with dropout mask", + "type": "text" + }, + { + "bbox": [ + 346, + 412, + 362, + 421 + ], + "score": 0.81, + "content": "m _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 409, + 506, + 422 + ], + "score": 1.0, + "content": "in each ascent step. This is similar", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 420, + 426, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 426, + 433 + ], + "score": 1.0, + "content": "to applying Variational Dropout to RNNs as used in Gal & Ghahramani (2016).", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 103, + 396, + 506, + 433 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 450, + 200, + 462 + ], + "lines": [ + { + "bbox": [ + 105, + 448, + 201, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 448, + 201, + 464 + ], + "score": 1.0, + "content": "4 EXPERIMENTS", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 475, + 505, + 531 + ], + "lines": [ + { + "bbox": [ + 105, + 475, + 506, + 488 + ], + "spans": [ + { + "bbox": [ + 105, + 475, + 506, + 488 + ], + "score": 1.0, + "content": "In this section, we provide comprehensive analysis on FreeLB through extensive experiments on", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 487, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 487, + 505, + 498 + ], + "score": 1.0, + "content": "three Natural Language Understanding benchmarks: GLUE (Wang et al., 2019), ARC (Clark et al.,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 496, + 505, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 505, + 510 + ], + "score": 1.0, + "content": "2018) and CommonsenseQA (Talmor et al., 2019). We also compare the robustness and general-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 508, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 505, + 522 + ], + "score": 1.0, + "content": "ization of FreeLB with other adversarial training algorithms to demonstrate its strength. Additional", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 519, + 311, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 311, + 532 + ], + "score": 1.0, + "content": "experimental details are provided in the Appendix.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 475, + 506, + 532 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 545, + 176, + 557 + ], + "lines": [ + { + "bbox": [ + 105, + 544, + 177, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 177, + 559 + ], + "score": 1.0, + "content": "4.1 DATASETS", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 106, + 566, + 505, + 688 + ], + "lines": [ + { + "bbox": [ + 105, + 565, + 505, + 580 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 505, + 580 + ], + "score": 1.0, + "content": "GLUE Benchmark. The GLUE benchmark is a collection of 9 natural language understanding", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 578, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 505, + 590 + ], + "score": 1.0, + "content": "tasks, namely Corpus of Linguistic Acceptability (CoLA; Warstadt et al. (2018)), Stanford Senti-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 588, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 601 + ], + "score": 1.0, + "content": "ment Treebank (SST; Socher et al. (2013)), Microsoft Research Paraphrase Corpus (MRPC; Dolan", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 599, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 506, + 613 + ], + "score": 1.0, + "content": "& Brockett (2005)), Semantic Textual Similarity Benchmark (STS; Agirre et al. (2007)), Quora", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 610, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 506, + 623 + ], + "score": 1.0, + "content": "Question Pairs (QQP; Iyer et al. (2017)), Multi-Genre NLI (MNLI; Williams et al. (2018)), Question", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 104, + 620, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 104, + 620, + 506, + 635 + ], + "score": 1.0, + "content": "NLI (QNLI; Rajpurkar et al. (2016)), Recognizing Textual Entailment (RTE; Dagan et al. (2006);", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 632, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 506, + 646 + ], + "score": 1.0, + "content": "Bar Haim et al. (2006); Giampiccolo et al. (2007); Bentivogli et al. (2009)) and Winograd NLI", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "(WNLI; Levesque et al. (2011)). 8 of the tasks are formulated as classification problems and only", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "score": 1.0, + "content": "STS-B is formulated as regression, but FreeLB applies to all of them. For BERT-base, we use the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 665, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 506, + 678 + ], + "score": 1.0, + "content": "HuggingFace implementation4, and follow the single-task finetuning procedure as in Devlin et al.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "(2019). For RoBERTa, we use the fairseq implementation5. Same as Liu et al. (2019b), we also use", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 383, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 105, + 383, + 505, + 396 + ], + "score": 1.0, + "content": "single-task finetuning for all dev set results, and start with MNLI-finetuned models on RTE, MRPC", + "type": "text", + "cross_page": true + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 395, + 252, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 395, + 252, + 407 + ], + "score": 1.0, + "content": "and STS-B for the test submissions.", + "type": "text", + "cross_page": true + } + ], + "index": 16 + } + ], + "index": 39, + "bbox_fs": [ + 104, + 565, + 506, + 689 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 118, + 80, + 490, + 157 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 118, + 80, + 490, + 157 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 118, + 80, + 490, + 157 + ], + "spans": [ + { + "bbox": [ + 118, + 80, + 490, + 157 + ], + "score": 0.979, + "html": "
MethodMNLI(Acc)QNLI(Acc)QQP(Acc)RTE(Acc)SST-2(Acc)MRPC(Acc)CoLA(Mcc)STS-B(Pearson)
Reported90.294.792.286.696.490.968.092.4
ReImp11-85.61 (1.7)96.56 (.3)90.69(.5)67.57 (1.3)92.20 (.2)
PGD90.53 (.2)94.87 (.2)92.49 (.07)87.41 (.9)96.44 (.1)90.93 (.2)69.67 (1.2)92.43 (7.)
FreeAT90.02 (.2)94.66 (.2)92.48(.08)86.69 (15.)96.10 (.2)90.69 (.4)68.80 (1.3)92.40 (.3)
FreeLB90.61 (.1)94.98 (.2)92.60 (.03)88.13 (1.2)96.79 (.2)91.42 (.7)71.12 (.9)92.67 (.08)
", + "type": "table", + "image_path": "e1f0b3873d4f551620e6abc0f84fd1bd6b832d5a4995eee5316a5213471483a2.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 118, + 80, + 490, + 105.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 118, + 105.66666666666667, + 490, + 131.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 118, + 131.33333333333334, + 490, + 157.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 106, + 160, + 505, + 200 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 159, + 505, + 172 + ], + "spans": [ + { + "bbox": [ + 106, + 159, + 505, + 172 + ], + "score": 1.0, + "content": "Table 1: Results (median and variance) on the dev sets of GLUE based on the RoBERTa-large model, from 5", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 170, + 505, + 181 + ], + "spans": [ + { + "bbox": [ + 106, + 170, + 505, + 181 + ], + "score": 1.0, + "content": "runs with the same hyperparameter but different random seeds. ReImp is our reimplementation of RoBERTa-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 180, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 505, + 191 + ], + "score": 1.0, + "content": "large. The training process can be very unstable even with the vanilla version. Here, both PGD on STS-B and", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 189, + 428, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 189, + 428, + 201 + ], + "score": 1.0, + "content": "FreeAT on RTE demonstrates such instability, with one unconverged instance out of five.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "table", + "bbox": [ + 108, + 209, + 505, + 311 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 108, + 209, + 505, + 311 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 108, + 209, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 108, + 209, + 505, + 311 + ], + "score": 0.981, + "html": "
ModelScoreCoLA8.5kSST-267kMRPC3.7kSTS-B7kQQP364kMNLI-m/mm393kQNLI108kRTE2.5kWNLI634AX
BERT-base178.352.193.588.9/84.887.1/85.871.2/89.284.6/83.490.566.465.134.2
FreeLB-BERT79.454.593.688.1/83.587.7/86.772.7/89.685.7/84.691.870.165.136.9
MT-DNN287.668.496.592.7/90.391.1/90.773.7789.987.9/87.496.086.389.042.8
XLNet-Large88.467.896.893.0/90.791.6/91.174.2/90.390.2/89.898.686.390.447.5
RoBERTa488.567.896.792.3/89.892.2/91.974.3/90.290.8/90.298.988.289.048.7
FreeLB-RoB88.868.096.893.1/90.892.4/92.274.8/90.391.1/90.798.888.789.050.1
Human87.166.497.886.3/80.892.7/92.659.5/80.492.0/92.891.293.695.91
", + "type": "table", + "image_path": "1ffd483862d6f9e2fd41f54a7e4c5ac87fd33bba048718a29e5bb6a776b93922.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 108, + 209, + 505, + 243.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 108, + 243.0, + 505, + 277.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 108, + 277.0, + 505, + 311.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 106, + 315, + 505, + 365 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 314, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 314, + 505, + 326 + ], + "score": 1.0, + "content": "Table 2: Results on GLUE from the evaluation server, as of Sep 25, 2019. Metrics are the same as the", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 325, + 505, + 336 + ], + "spans": [ + { + "bbox": [ + 106, + 325, + 505, + 336 + ], + "score": 1.0, + "content": "leaderboard. Number under each task’s name is the size of the training set. FreeLB-BERT is the single-model", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 335, + 505, + 346 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 505, + 346 + ], + "score": 1.0, + "content": "results of BERT-base finetuned with FreeLB, and FreeLB-RoB is the ensemble of 7 RoBERTa-Large models", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 343, + 506, + 357 + ], + "spans": [ + { + "bbox": [ + 104, + 343, + 506, + 357 + ], + "score": 1.0, + "content": "for each task. References: 1: (Devlin et al., 2019); 2: (Liu et al., 2019a); 3: (Yang et al., 2019); 4: (Liu et al.,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 354, + 137, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 137, + 366 + ], + "score": 1.0, + "content": "2019b).", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12 + } + ], + "index": 10.0 + }, + { + "type": "text", + "bbox": [ + 107, + 384, + 503, + 406 + ], + "lines": [ + { + "bbox": [ + 105, + 383, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 105, + 383, + 505, + 396 + ], + "score": 1.0, + "content": "single-task finetuning for all dev set results, and start with MNLI-finetuned models on RTE, MRPC", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 395, + 252, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 395, + 252, + 407 + ], + "score": 1.0, + "content": "and STS-B for the test submissions.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 107, + 411, + 505, + 467 + ], + "lines": [ + { + "bbox": [ + 106, + 412, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 412, + 505, + 424 + ], + "score": 1.0, + "content": "ARC Benchmark. The ARC dataset (Clark et al., 2018) is a collection of multi-choice science", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 423, + 505, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 505, + 436 + ], + "score": 1.0, + "content": "questions from grade-school level exams. It is further divided into ARC-Challenge set with 2,590", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 433, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 506, + 448 + ], + "score": 1.0, + "content": "question answer (QA) pairs and ARC-Easy set with 5,197 QA pairs. Questions in ARC-Challenge", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 445, + 504, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 504, + 459 + ], + "score": 1.0, + "content": "are more difficult and cannot be handled by simply using a retrieval and co-occurence based algo-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 455, + 299, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 299, + 469 + ], + "score": 1.0, + "content": "rithm (Clark et al., 2018). A typical question is:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 108, + 473, + 382, + 484 + ], + "lines": [ + { + "bbox": [ + 107, + 473, + 382, + 486 + ], + "spans": [ + { + "bbox": [ + 107, + 473, + 382, + 486 + ], + "score": 1.0, + "content": "Which property of a mineral can be determined just by looking at it?", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 489, + 325, + 501 + ], + "lines": [ + { + "bbox": [ + 106, + 489, + 325, + 503 + ], + "spans": [ + { + "bbox": [ + 106, + 489, + 186, + 503 + ], + "score": 1.0, + "content": "(A) luster [correct]", + "type": "text" + }, + { + "bbox": [ + 186, + 490, + 200, + 501 + ], + "score": 0.33, + "content": "( B )", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 489, + 223, + 503 + ], + "score": 1.0, + "content": "mass", + "type": "text" + }, + { + "bbox": [ + 224, + 490, + 238, + 501 + ], + "score": 0.3, + "content": "( C )", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 489, + 268, + 503 + ], + "score": 1.0, + "content": "weight", + "type": "text" + }, + { + "bbox": [ + 268, + 490, + 284, + 501 + ], + "score": 0.34, + "content": "( D )", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 489, + 325, + 503 + ], + "score": 1.0, + "content": "hardness.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 109, + 506, + 506, + 540 + ], + "lines": [ + { + "bbox": [ + 107, + 506, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 107, + 506, + 505, + 519 + ], + "score": 1.0, + "content": "CommonsenseQA Benchmark. The CommonsenseQA dataset (Talmor et al., 2019) consists of", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 516, + 506, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 506, + 531 + ], + "score": 1.0, + "content": "12,102 natural language questions that require human commonsense reasoning ability to answer. A", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 528, + 188, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 188, + 541 + ], + "score": 1.0, + "content": "typical question is :", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 109, + 545, + 388, + 557 + ], + "lines": [ + { + "bbox": [ + 109, + 545, + 389, + 559 + ], + "spans": [ + { + "bbox": [ + 109, + 545, + 389, + 559 + ], + "score": 1.0, + "content": "Where can I stand on a river to see water falling without getting wet?", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 108, + 562, + 385, + 574 + ], + "lines": [ + { + "bbox": [ + 105, + 561, + 387, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 291, + 576 + ], + "score": 1.0, + "content": "(A) waterfall, (B) bridge [correct], (C) valley,", + "type": "text" + }, + { + "bbox": [ + 291, + 563, + 306, + 573 + ], + "score": 0.35, + "content": "( D )", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 561, + 387, + 576 + ], + "score": 1.0, + "content": "stream, (E) bottom.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 579, + 505, + 635 + ], + "lines": [ + { + "bbox": [ + 105, + 578, + 506, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 506, + 592 + ], + "score": 1.0, + "content": "Each question has five candidate answers from ConceptNet (Speer et al., 2017). To make the ques-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 590, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 105, + 590, + 506, + 603 + ], + "score": 1.0, + "content": "tion more difficult to solve, most answers have the same relation in ConceptNet to the key concept", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 601, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 505, + 613 + ], + "score": 1.0, + "content": "in the question. As shown in the above example, most answers can be connected to “river” by “At-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 611, + 506, + 625 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 506, + 625 + ], + "score": 1.0, + "content": "Location” relation in ConceptNet. For a fair comparison with the reported results in papers and", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 622, + 313, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 313, + 636 + ], + "score": 1.0, + "content": "leaderboard6, we use the official random split 1.11.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31 + }, + { + "type": "title", + "bbox": [ + 107, + 648, + 240, + 659 + ], + "lines": [ + { + "bbox": [ + 106, + 648, + 241, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 648, + 241, + 660 + ], + "score": 1.0, + "content": "4.2 EXPERIMENTAL RESULTS", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 107, + 668, + 504, + 713 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 505, + 681 + ], + "score": 1.0, + "content": "GLUE We summarize results on the dev sets of GLUE in Table 1, comparing the proposed FreeLB", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 680, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 680, + 505, + 691 + ], + "score": 1.0, + "content": "against other adversatial training algorithms (PGD (Madry et al., 2018) and FreeAT (Shafahi et al.,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 690, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 690, + 260, + 703 + ], + "score": 1.0, + "content": "2019)). We use the same step size", + "type": "text" + }, + { + "bbox": [ + 260, + 693, + 268, + 700 + ], + "score": 0.76, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 690, + 361, + 703 + ], + "score": 1.0, + "content": "and number of steps", + "type": "text" + }, + { + "bbox": [ + 361, + 693, + 371, + 701 + ], + "score": 0.68, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 690, + 505, + 703 + ], + "score": 1.0, + "content": "for PGD, FreeAT and FreeLB.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 701, + 506, + 714 + ], + "spans": [ + { + "bbox": [ + 105, + 701, + 506, + 714 + ], + "score": 1.0, + "content": "FreeLB is consistently better than the two baselines. Comparisons and detailed discussions about", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36.5 + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 119, + 721, + 274, + 732 + ], + "lines": [ + { + "bbox": [ + 119, + 720, + 275, + 734 + ], + "spans": [ + { + "bbox": [ + 119, + 720, + 275, + 734 + ], + "score": 1.0, + "content": "6https://www.tau-nlp.org/csqa-leaderboard", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 310, + 762 + ], + "score": 1.0, + "content": "6", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 118, + 80, + 490, + 157 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 118, + 80, + 490, + 157 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 118, + 80, + 490, + 157 + ], + "spans": [ + { + "bbox": [ + 118, + 80, + 490, + 157 + ], + "score": 0.979, + "html": "
MethodMNLI(Acc)QNLI(Acc)QQP(Acc)RTE(Acc)SST-2(Acc)MRPC(Acc)CoLA(Mcc)STS-B(Pearson)
Reported90.294.792.286.696.490.968.092.4
ReImp11-85.61 (1.7)96.56 (.3)90.69(.5)67.57 (1.3)92.20 (.2)
PGD90.53 (.2)94.87 (.2)92.49 (.07)87.41 (.9)96.44 (.1)90.93 (.2)69.67 (1.2)92.43 (7.)
FreeAT90.02 (.2)94.66 (.2)92.48(.08)86.69 (15.)96.10 (.2)90.69 (.4)68.80 (1.3)92.40 (.3)
FreeLB90.61 (.1)94.98 (.2)92.60 (.03)88.13 (1.2)96.79 (.2)91.42 (.7)71.12 (.9)92.67 (.08)
", + "type": "table", + "image_path": "e1f0b3873d4f551620e6abc0f84fd1bd6b832d5a4995eee5316a5213471483a2.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 118, + 80, + 490, + 105.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 118, + 105.66666666666667, + 490, + 131.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 118, + 131.33333333333334, + 490, + 157.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 106, + 160, + 505, + 200 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 159, + 505, + 172 + ], + "spans": [ + { + "bbox": [ + 106, + 159, + 505, + 172 + ], + "score": 1.0, + "content": "Table 1: Results (median and variance) on the dev sets of GLUE based on the RoBERTa-large model, from 5", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 170, + 505, + 181 + ], + "spans": [ + { + "bbox": [ + 106, + 170, + 505, + 181 + ], + "score": 1.0, + "content": "runs with the same hyperparameter but different random seeds. ReImp is our reimplementation of RoBERTa-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 180, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 505, + 191 + ], + "score": 1.0, + "content": "large. The training process can be very unstable even with the vanilla version. Here, both PGD on STS-B and", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 189, + 428, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 189, + 428, + 201 + ], + "score": 1.0, + "content": "FreeAT on RTE demonstrates such instability, with one unconverged instance out of five.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "table", + "bbox": [ + 108, + 209, + 505, + 311 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 108, + 209, + 505, + 311 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 108, + 209, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 108, + 209, + 505, + 311 + ], + "score": 0.981, + "html": "
ModelScoreCoLA8.5kSST-267kMRPC3.7kSTS-B7kQQP364kMNLI-m/mm393kQNLI108kRTE2.5kWNLI634AX
BERT-base178.352.193.588.9/84.887.1/85.871.2/89.284.6/83.490.566.465.134.2
FreeLB-BERT79.454.593.688.1/83.587.7/86.772.7/89.685.7/84.691.870.165.136.9
MT-DNN287.668.496.592.7/90.391.1/90.773.7789.987.9/87.496.086.389.042.8
XLNet-Large88.467.896.893.0/90.791.6/91.174.2/90.390.2/89.898.686.390.447.5
RoBERTa488.567.896.792.3/89.892.2/91.974.3/90.290.8/90.298.988.289.048.7
FreeLB-RoB88.868.096.893.1/90.892.4/92.274.8/90.391.1/90.798.888.789.050.1
Human87.166.497.886.3/80.892.7/92.659.5/80.492.0/92.891.293.695.91
", + "type": "table", + "image_path": "1ffd483862d6f9e2fd41f54a7e4c5ac87fd33bba048718a29e5bb6a776b93922.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 108, + 209, + 505, + 243.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 108, + 243.0, + 505, + 277.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 108, + 277.0, + 505, + 311.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 106, + 315, + 505, + 365 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 314, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 314, + 505, + 326 + ], + "score": 1.0, + "content": "Table 2: Results on GLUE from the evaluation server, as of Sep 25, 2019. Metrics are the same as the", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 325, + 505, + 336 + ], + "spans": [ + { + "bbox": [ + 106, + 325, + 505, + 336 + ], + "score": 1.0, + "content": "leaderboard. Number under each task’s name is the size of the training set. FreeLB-BERT is the single-model", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 335, + 505, + 346 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 505, + 346 + ], + "score": 1.0, + "content": "results of BERT-base finetuned with FreeLB, and FreeLB-RoB is the ensemble of 7 RoBERTa-Large models", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 343, + 506, + 357 + ], + "spans": [ + { + "bbox": [ + 104, + 343, + 506, + 357 + ], + "score": 1.0, + "content": "for each task. References: 1: (Devlin et al., 2019); 2: (Liu et al., 2019a); 3: (Yang et al., 2019); 4: (Liu et al.,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 354, + 137, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 137, + 366 + ], + "score": 1.0, + "content": "2019b).", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12 + } + ], + "index": 10.0 + }, + { + "type": "text", + "bbox": [ + 107, + 384, + 503, + 406 + ], + "lines": [], + "index": 15.5, + "bbox_fs": [ + 105, + 383, + 505, + 407 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 411, + 505, + 467 + ], + "lines": [ + { + "bbox": [ + 106, + 412, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 412, + 505, + 424 + ], + "score": 1.0, + "content": "ARC Benchmark. The ARC dataset (Clark et al., 2018) is a collection of multi-choice science", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 423, + 505, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 505, + 436 + ], + "score": 1.0, + "content": "questions from grade-school level exams. It is further divided into ARC-Challenge set with 2,590", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 433, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 506, + 448 + ], + "score": 1.0, + "content": "question answer (QA) pairs and ARC-Easy set with 5,197 QA pairs. Questions in ARC-Challenge", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 445, + 504, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 504, + 459 + ], + "score": 1.0, + "content": "are more difficult and cannot be handled by simply using a retrieval and co-occurence based algo-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 455, + 299, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 299, + 469 + ], + "score": 1.0, + "content": "rithm (Clark et al., 2018). A typical question is:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19, + "bbox_fs": [ + 105, + 412, + 506, + 469 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 473, + 382, + 484 + ], + "lines": [ + { + "bbox": [ + 107, + 473, + 382, + 486 + ], + "spans": [ + { + "bbox": [ + 107, + 473, + 382, + 486 + ], + "score": 1.0, + "content": "Which property of a mineral can be determined just by looking at it?", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22, + "bbox_fs": [ + 107, + 473, + 382, + 486 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 489, + 325, + 501 + ], + "lines": [ + { + "bbox": [ + 106, + 489, + 325, + 503 + ], + "spans": [ + { + "bbox": [ + 106, + 489, + 186, + 503 + ], + "score": 1.0, + "content": "(A) luster [correct]", + "type": "text" + }, + { + "bbox": [ + 186, + 490, + 200, + 501 + ], + "score": 0.33, + "content": "( B )", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 489, + 223, + 503 + ], + "score": 1.0, + "content": "mass", + "type": "text" + }, + { + "bbox": [ + 224, + 490, + 238, + 501 + ], + "score": 0.3, + "content": "( C )", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 489, + 268, + 503 + ], + "score": 1.0, + "content": "weight", + "type": "text" + }, + { + "bbox": [ + 268, + 490, + 284, + 501 + ], + "score": 0.34, + "content": "( D )", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 489, + 325, + 503 + ], + "score": 1.0, + "content": "hardness.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23, + "bbox_fs": [ + 106, + 489, + 325, + 503 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 506, + 506, + 540 + ], + "lines": [ + { + "bbox": [ + 107, + 506, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 107, + 506, + 505, + 519 + ], + "score": 1.0, + "content": "CommonsenseQA Benchmark. The CommonsenseQA dataset (Talmor et al., 2019) consists of", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 516, + 506, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 506, + 531 + ], + "score": 1.0, + "content": "12,102 natural language questions that require human commonsense reasoning ability to answer. A", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 528, + 188, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 188, + 541 + ], + "score": 1.0, + "content": "typical question is :", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 506, + 506, + 541 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 545, + 388, + 557 + ], + "lines": [ + { + "bbox": [ + 109, + 545, + 389, + 559 + ], + "spans": [ + { + "bbox": [ + 109, + 545, + 389, + 559 + ], + "score": 1.0, + "content": "Where can I stand on a river to see water falling without getting wet?", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27, + "bbox_fs": [ + 109, + 545, + 389, + 559 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 562, + 385, + 574 + ], + "lines": [ + { + "bbox": [ + 105, + 561, + 387, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 291, + 576 + ], + "score": 1.0, + "content": "(A) waterfall, (B) bridge [correct], (C) valley,", + "type": "text" + }, + { + "bbox": [ + 291, + 563, + 306, + 573 + ], + "score": 0.35, + "content": "( D )", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 561, + 387, + 576 + ], + "score": 1.0, + "content": "stream, (E) bottom.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 561, + 387, + 576 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 579, + 505, + 635 + ], + "lines": [ + { + "bbox": [ + 105, + 578, + 506, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 506, + 592 + ], + "score": 1.0, + "content": "Each question has five candidate answers from ConceptNet (Speer et al., 2017). To make the ques-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 590, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 105, + 590, + 506, + 603 + ], + "score": 1.0, + "content": "tion more difficult to solve, most answers have the same relation in ConceptNet to the key concept", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 601, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 505, + 613 + ], + "score": 1.0, + "content": "in the question. As shown in the above example, most answers can be connected to “river” by “At-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 611, + 506, + 625 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 506, + 625 + ], + "score": 1.0, + "content": "Location” relation in ConceptNet. For a fair comparison with the reported results in papers and", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 622, + 313, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 313, + 636 + ], + "score": 1.0, + "content": "leaderboard6, we use the official random split 1.11.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 578, + 506, + 636 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 648, + 240, + 659 + ], + "lines": [ + { + "bbox": [ + 106, + 648, + 241, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 648, + 241, + 660 + ], + "score": 1.0, + "content": "4.2 EXPERIMENTAL RESULTS", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 107, + 668, + 504, + 713 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 505, + 681 + ], + "score": 1.0, + "content": "GLUE We summarize results on the dev sets of GLUE in Table 1, comparing the proposed FreeLB", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 680, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 680, + 505, + 691 + ], + "score": 1.0, + "content": "against other adversatial training algorithms (PGD (Madry et al., 2018) and FreeAT (Shafahi et al.,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 690, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 690, + 260, + 703 + ], + "score": 1.0, + "content": "2019)). We use the same step size", + "type": "text" + }, + { + "bbox": [ + 260, + 693, + 268, + 700 + ], + "score": 0.76, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 690, + 361, + 703 + ], + "score": 1.0, + "content": "and number of steps", + "type": "text" + }, + { + "bbox": [ + 361, + 693, + 371, + 701 + ], + "score": 0.68, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 690, + 505, + 703 + ], + "score": 1.0, + "content": "for PGD, FreeAT and FreeLB.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 701, + 506, + 714 + ], + "spans": [ + { + "bbox": [ + 105, + 701, + 506, + 714 + ], + "score": 1.0, + "content": "FreeLB is consistently better than the two baselines. Comparisons and detailed discussions about", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 668, + 506, + 714 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 106, + 80, + 505, + 163 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 80, + 505, + 163 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 80, + 505, + 163 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 505, + 163 + ], + "score": 0.981, + "html": "
ARC-Easy ARC-Challenge ARC-Merge CQADev Test Dev Test Dev Test Dev Test Test (E)
TestDevTestDevTest DevTest
RoBERTa(Reported)------78.4372.172.5
RoBERTa (ReImp)84.3984.1364.5464.4477.8377.6277.56--
FreeLB-RoBERTa84.9184.8165.8965.3678.3778.3978.8172.273.1
AristoRoBERTaV7(MTL):85.02-66.47-78.89--:
XLNet +RoBERTa (MTL+Ens)---67.06--二二二
FreeLB-RoBERTa(MTL)84.9185.4470.2367.7579.8679.60---
", + "type": "table", + "image_path": "e0294ede408252845a3f452283bba1eeb68e7d5fc0d948c4421b775c75aff2ef.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 106, + 80, + 505, + 107.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 106, + 107.66666666666667, + 505, + 135.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 106, + 135.33333333333334, + 505, + 163.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 106, + 166, + 505, + 217 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "score": 1.0, + "content": "Table 3: Results on ARC and CommonsenseQA (CQA). ARC-Merge is the combination of ARC-Easy and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 177, + 505, + 187 + ], + "spans": [ + { + "bbox": [ + 106, + 177, + 496, + 187 + ], + "score": 1.0, + "content": "ARC-Challenge, “MTL” stands for multi-task learning and “Ens” stands for ensemble. Results of XLNet", + "type": "text" + }, + { + "bbox": [ + 497, + 177, + 505, + 186 + ], + "score": 0.65, + "content": "^ +", + "type": "inline_equation" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 186, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 106, + 186, + 147, + 198 + ], + "score": 1.0, + "content": "RoBERTa", + "type": "text" + }, + { + "bbox": [ + 147, + 187, + 189, + 197 + ], + "score": 0.29, + "content": "\\left( \\mathbf { M } \\mathbf { T } \\mathbf { L } { + } \\mathbf { E } \\mathbf { n } \\mathbf { s } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 186, + 505, + 198 + ], + "score": 1.0, + "content": "and AristoRoBERTaV7 (MTL) are from the ARC leaderboards. Test (E) denotes the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 196, + 504, + 208 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 504, + 208 + ], + "score": 1.0, + "content": "test set results with ensembles. For CQA, we report the highest dev and test accuracies among all models. The", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 205, + 500, + 219 + ], + "spans": [ + { + "bbox": [ + 105, + 205, + 500, + 219 + ], + "score": 1.0, + "content": "models with 78.81/72.19 dev/test accuracy (as in the table) have 71.84/78.64 test/dev accuracies respectively.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 108, + 239, + 502, + 272 + ], + "lines": [ + { + "bbox": [ + 106, + 239, + 504, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 504, + 252 + ], + "score": 1.0, + "content": "YOPO (Zhang et al., 2019) are provided in Sec. 4.3. We have also submitted our results to the eval-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 250, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 106, + 250, + 505, + 262 + ], + "score": 1.0, + "content": "uation server, results provided in Table 2. FreeLB lifts the performance of the BERT-base model", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 262, + 436, + 273 + ], + "spans": [ + { + "bbox": [ + 106, + 262, + 436, + 273 + ], + "score": 1.0, + "content": "from 78.3 to 79.4, and RoBERTa-large model from 88.5 to 88.8 on overall scores.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 107, + 278, + 505, + 344 + ], + "lines": [ + { + "bbox": [ + 105, + 277, + 505, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 505, + 291 + ], + "score": 1.0, + "content": "ARC For ARC, a corpus of 14 million related science documents (from ARC Corpus, Wikipedia", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "score": 1.0, + "content": "and other sources) is provided. For each QA pair, we first use a retrieval model to select top 10", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 299, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 505, + 312 + ], + "score": 1.0, + "content": "related documents. Then, given these retrieved documents7, we use RoBERTa-large model to encode", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 107, + 311, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 107, + 311, + 119, + 323 + ], + "score": 0.86, + "content": "\\langle s \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 119, + 311, + 212, + 324 + ], + "score": 1.0, + "content": "Retrieved Documents", + "type": "text" + }, + { + "bbox": [ + 212, + 311, + 228, + 323 + ], + "score": 0.81, + "content": "\\langle / s \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 311, + 269, + 324 + ], + "score": 1.0, + "content": "Question", + "type": "text" + }, + { + "bbox": [ + 269, + 312, + 279, + 321 + ], + "score": 0.74, + "content": "^ +", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 311, + 314, + 324 + ], + "score": 1.0, + "content": "Answer", + "type": "text" + }, + { + "bbox": [ + 314, + 311, + 329, + 323 + ], + "score": 0.9, + "content": "\\langle / s \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 311, + 363, + 324 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 363, + 311, + 375, + 323 + ], + "score": 0.89, + "content": "\\langle \\mathbf { s } \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 311, + 396, + 324 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 396, + 311, + 412, + 323 + ], + "score": 0.9, + "content": "\\langle / \\mathrm { s } \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 311, + 505, + 324 + ], + "score": 1.0, + "content": "are special tokens for", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 320, + 506, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 320, + 506, + 335 + ], + "score": 1.0, + "content": "RoBERTa model8. We then apply a fully-connected layer to the representation of the [CLS] token", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 332, + 433, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 332, + 433, + 347 + ], + "score": 1.0, + "content": "to compute the final logit, and use standard cross-entropy loss for model training.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 350, + 505, + 427 + ], + "lines": [ + { + "bbox": [ + 106, + 351, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 106, + 351, + 505, + 361 + ], + "score": 1.0, + "content": "Results are summarized in Table 3. Following Sun et al. (2018), we first finetune the RoBERTa", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 361, + 505, + 373 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 455, + 373 + ], + "score": 1.0, + "content": "model on the RACE dataset (Lai et al., 2017). The finetuned RoBERTa model achieves", + "type": "text" + }, + { + "bbox": [ + 455, + 361, + 487, + 371 + ], + "score": 0.88, + "content": "8 5 . 7 0 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 361, + 505, + 373 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 371, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 106, + 372, + 138, + 383 + ], + "score": 0.88, + "content": "8 5 . 2 4 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 139, + 371, + 505, + 384 + ], + "score": 1.0, + "content": "accuracy on the development and test set of RACE, respectively. Based on this, we further", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 382, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 505, + 396 + ], + "score": 1.0, + "content": "finetune the model on both ARC-Easy and ARC-Challenge datasets with the same hyper-parameter", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 394, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 301, + 406 + ], + "score": 1.0, + "content": "searching strategy (for 5 epochs), which achieves", + "type": "text" + }, + { + "bbox": [ + 302, + 394, + 367, + 405 + ], + "score": 0.89, + "content": "8 4 . 1 3 \\% / 6 4 . 4 4 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 394, + 505, + 406 + ], + "score": 1.0, + "content": "test accuracy on ARC-Easy/ARC-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 405, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 348, + 417 + ], + "score": 1.0, + "content": "Challenge. And by adding FreeLB finetuning, we can reach", + "type": "text" + }, + { + "bbox": [ + 348, + 405, + 413, + 415 + ], + "score": 0.9, + "content": "8 4 . 8 1 \\% / 6 5 . 3 6 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 405, + 505, + 417 + ], + "score": 1.0, + "content": ", a significant boost on", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 416, + 353, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 416, + 353, + 428 + ], + "score": 1.0, + "content": "ARC benchmark, demonstrating the effectiveness of FreeLB.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 433, + 505, + 498 + ], + "lines": [ + { + "bbox": [ + 105, + 432, + 505, + 445 + ], + "spans": [ + { + "bbox": [ + 105, + 432, + 505, + 445 + ], + "score": 1.0, + "content": "To further improve the results, we apply a multi-task learning (MTL) strategy using additional", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 442, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 505, + 456 + ], + "score": 1.0, + "content": "datasets. We first finetune the model on RACE (Lai et al., 2017), and then finetune on a joint", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 452, + 506, + 468 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 506, + 468 + ], + "score": 1.0, + "content": "dataset of ARC-Easy, ARC-Challenge, OpenbookQA (Mihaylov et al., 2018) and Regents Living", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 465, + 505, + 478 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 505, + 478 + ], + "score": 1.0, + "content": "Environment9. Based on this, we further finetune our model on ARC-Easy and ARC-Challenge with", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 476, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 476, + 319, + 489 + ], + "score": 1.0, + "content": "FreeLB. After finetuning, our single model achieves", + "type": "text" + }, + { + "bbox": [ + 320, + 477, + 352, + 487 + ], + "score": 0.88, + "content": "6 7 . 7 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 476, + 505, + 489 + ], + "score": 1.0, + "content": "test accuracy on ARC-Challenge and", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 487, + 477, + 500 + ], + "spans": [ + { + "bbox": [ + 106, + 487, + 138, + 498 + ], + "score": 0.84, + "content": "8 5 . 4 4 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 139, + 487, + 477, + 500 + ], + "score": 1.0, + "content": "on ARC-Easy, both outperforming the best submission on the official leaderboard10.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 107, + 504, + 505, + 570 + ], + "lines": [ + { + "bbox": [ + 105, + 504, + 505, + 517 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 505, + 517 + ], + "score": 1.0, + "content": "CommonsenseQA Similar to the training strategy in Liu et al. (2019b), we construct five inputs", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 516, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 106, + 516, + 505, + 527 + ], + "score": 1.0, + "content": "for each question by concatenating the question and each answer separately, then encode each input", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 527, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 106, + 527, + 505, + 538 + ], + "score": 1.0, + "content": "with the representation of the [CLS] token. A final score is calculated by applying the representation", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 536, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 505, + 551 + ], + "score": 1.0, + "content": "of [CLS] to a fully-connected layer. Following the fairseq repository11, the input is formatted as:", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 547, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 549, + 133, + 560 + ], + "score": 0.59, + "content": "{ \\mathfrak { n } } ( s ) Q", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 547, + 415, + 563 + ], + "score": 1.0, + "content": ": Where can I stand on a river to see water falling without getting wet?", + "type": "text" + }, + { + "bbox": [ + 415, + 548, + 438, + 560 + ], + "score": 0.86, + "content": "\\langle / s \\rangle A", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 547, + 482, + 563 + ], + "score": 1.0, + "content": ": waterfall", + "type": "text" + }, + { + "bbox": [ + 482, + 548, + 501, + 560 + ], + "score": 0.86, + "content": "\\langle \\langle s \\rangle ^ { \\ast } \\cdot \\mathbf { \\vec { \\mathbf { \\mu } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 547, + 506, + 563 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 559, + 395, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 133, + 572 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 560, + 145, + 570 + ], + "score": 0.73, + "content": "\\cdot _ { Q }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 559, + 170, + 572 + ], + "score": 1.0, + "content": ":’ and", + "type": "text" + }, + { + "bbox": [ + 170, + 560, + 180, + 569 + ], + "score": 0.49, + "content": "^ { , } A", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 559, + 395, + 572 + ], + "score": 1.0, + "content": ":’ are the prefix for question and answer, respectively.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 106, + 576, + 505, + 642 + ], + "lines": [ + { + "bbox": [ + 106, + 576, + 505, + 587 + ], + "spans": [ + { + "bbox": [ + 106, + 576, + 390, + 587 + ], + "score": 1.0, + "content": "Results are summarized in Table 3. We obtained a dev-set accuracy of", + "type": "text" + }, + { + "bbox": [ + 390, + 576, + 423, + 587 + ], + "score": 0.88, + "content": "7 7 . 5 6 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 576, + 505, + 587 + ], + "score": 1.0, + "content": "with the RoBERTa-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 587, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 345, + 600 + ], + "score": 1.0, + "content": "large model. When using FreeLB finetuning, we achieved", + "type": "text" + }, + { + "bbox": [ + 346, + 587, + 378, + 598 + ], + "score": 0.88, + "content": "7 8 . 8 1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 587, + 390, + 600 + ], + "score": 1.0, + "content": ", a", + "type": "text" + }, + { + "bbox": [ + 390, + 588, + 417, + 597 + ], + "score": 0.87, + "content": "1 . 2 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 587, + 505, + 600 + ], + "score": 1.0, + "content": "absolute gain. Com-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 598, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 386, + 610 + ], + "score": 1.0, + "content": "pared with the results reported from fairseq repository, which obtains", + "type": "text" + }, + { + "bbox": [ + 386, + 599, + 418, + 609 + ], + "score": 0.88, + "content": "7 8 . 4 3 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 598, + 505, + 610 + ], + "score": 1.0, + "content": "accuracy on the dev-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 609, + 505, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 505, + 621 + ], + "score": 1.0, + "content": "set, FreeLB still achieves better performance. Our submission to the CommonsenseQA leaderboard", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 619, + 506, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 143, + 633 + ], + "score": 1.0, + "content": "achieves", + "type": "text" + }, + { + "bbox": [ + 144, + 620, + 171, + 631 + ], + "score": 0.86, + "content": "7 2 . 2 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 619, + 474, + 633 + ], + "score": 1.0, + "content": "single-model test set accuracy, and the result of a 20-model ensemble is", + "type": "text" + }, + { + "bbox": [ + 474, + 620, + 501, + 631 + ], + "score": 0.86, + "content": "7 3 . 1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 619, + 506, + 633 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 631, + 444, + 643 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 444, + 643 + ], + "score": 1.0, + "content": "which achieves No.1 among all the submissions without making use of ConceptNet.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 38.5 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 657, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 655, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 118, + 655, + 505, + 672 + ], + "score": 1.0, + "content": "7We thank AristoRoBERTa team for providing retrieved documents and additional Regents Living Environ-", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 668, + 159, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 668, + 159, + 678 + ], + "score": 1.0, + "content": "ments dataset.", + "type": "text" + } + ] + }, + { + "bbox": [ + 118, + 677, + 294, + 691 + ], + "spans": [ + { + "bbox": [ + 118, + 677, + 294, + 691 + ], + "score": 1.0, + "content": "8Equivalent to [CLS] and [SEP] token in BERT.", + "type": "text" + } + ] + }, + { + "bbox": [ + 117, + 687, + 301, + 703 + ], + "spans": [ + { + "bbox": [ + 117, + 687, + 301, + 703 + ], + "score": 1.0, + "content": "9https://www.nysedregents.org/livingenvironment", + "type": "text" + } + ] + }, + { + "bbox": [ + 114, + 697, + 478, + 714 + ], + "spans": [ + { + "bbox": [ + 114, + 697, + 478, + 714 + ], + "score": 1.0, + "content": "10https://leaderboard.allenai.org/arc/submissions/public and https://leaderboard.allenai.org/arc easy/", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 711, + 178, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 711, + 178, + 722 + ], + "score": 1.0, + "content": "submissions/public", + "type": "text" + } + ] + }, + { + "bbox": [ + 114, + 719, + 419, + 735 + ], + "spans": [ + { + "bbox": [ + 114, + 719, + 419, + 735 + ], + "score": 1.0, + "content": "11https://github.com/pytorch/fairseq/tree/master/examples/roberta/commonsense qa", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "score": 1.0, + "content": "7", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 106, + 80, + 505, + 163 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 80, + 505, + 163 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 80, + 505, + 163 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 505, + 163 + ], + "score": 0.981, + "html": "
ARC-Easy ARC-Challenge ARC-Merge CQADev Test Dev Test Dev Test Dev Test Test (E)
TestDevTestDevTest DevTest
RoBERTa(Reported)------78.4372.172.5
RoBERTa (ReImp)84.3984.1364.5464.4477.8377.6277.56--
FreeLB-RoBERTa84.9184.8165.8965.3678.3778.3978.8172.273.1
AristoRoBERTaV7(MTL):85.02-66.47-78.89--:
XLNet +RoBERTa (MTL+Ens)---67.06--二二二
FreeLB-RoBERTa(MTL)84.9185.4470.2367.7579.8679.60---
", + "type": "table", + "image_path": "e0294ede408252845a3f452283bba1eeb68e7d5fc0d948c4421b775c75aff2ef.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 106, + 80, + 505, + 107.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 106, + 107.66666666666667, + 505, + 135.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 106, + 135.33333333333334, + 505, + 163.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 106, + 166, + 505, + 217 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "score": 1.0, + "content": "Table 3: Results on ARC and CommonsenseQA (CQA). ARC-Merge is the combination of ARC-Easy and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 177, + 505, + 187 + ], + "spans": [ + { + "bbox": [ + 106, + 177, + 496, + 187 + ], + "score": 1.0, + "content": "ARC-Challenge, “MTL” stands for multi-task learning and “Ens” stands for ensemble. Results of XLNet", + "type": "text" + }, + { + "bbox": [ + 497, + 177, + 505, + 186 + ], + "score": 0.65, + "content": "^ +", + "type": "inline_equation" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 186, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 106, + 186, + 147, + 198 + ], + "score": 1.0, + "content": "RoBERTa", + "type": "text" + }, + { + "bbox": [ + 147, + 187, + 189, + 197 + ], + "score": 0.29, + "content": "\\left( \\mathbf { M } \\mathbf { T } \\mathbf { L } { + } \\mathbf { E } \\mathbf { n } \\mathbf { s } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 186, + 505, + 198 + ], + "score": 1.0, + "content": "and AristoRoBERTaV7 (MTL) are from the ARC leaderboards. Test (E) denotes the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 196, + 504, + 208 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 504, + 208 + ], + "score": 1.0, + "content": "test set results with ensembles. For CQA, we report the highest dev and test accuracies among all models. The", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 205, + 500, + 219 + ], + "spans": [ + { + "bbox": [ + 105, + 205, + 500, + 219 + ], + "score": 1.0, + "content": "models with 78.81/72.19 dev/test accuracy (as in the table) have 71.84/78.64 test/dev accuracies respectively.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 108, + 239, + 502, + 272 + ], + "lines": [ + { + "bbox": [ + 106, + 239, + 504, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 504, + 252 + ], + "score": 1.0, + "content": "YOPO (Zhang et al., 2019) are provided in Sec. 4.3. We have also submitted our results to the eval-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 250, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 106, + 250, + 505, + 262 + ], + "score": 1.0, + "content": "uation server, results provided in Table 2. FreeLB lifts the performance of the BERT-base model", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 262, + 436, + 273 + ], + "spans": [ + { + "bbox": [ + 106, + 262, + 436, + 273 + ], + "score": 1.0, + "content": "from 78.3 to 79.4, and RoBERTa-large model from 88.5 to 88.8 on overall scores.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9, + "bbox_fs": [ + 106, + 239, + 505, + 273 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 278, + 505, + 344 + ], + "lines": [ + { + "bbox": [ + 105, + 277, + 505, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 505, + 291 + ], + "score": 1.0, + "content": "ARC For ARC, a corpus of 14 million related science documents (from ARC Corpus, Wikipedia", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "score": 1.0, + "content": "and other sources) is provided. For each QA pair, we first use a retrieval model to select top 10", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 299, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 505, + 312 + ], + "score": 1.0, + "content": "related documents. Then, given these retrieved documents7, we use RoBERTa-large model to encode", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 107, + 311, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 107, + 311, + 119, + 323 + ], + "score": 0.86, + "content": "\\langle s \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 119, + 311, + 212, + 324 + ], + "score": 1.0, + "content": "Retrieved Documents", + "type": "text" + }, + { + "bbox": [ + 212, + 311, + 228, + 323 + ], + "score": 0.81, + "content": "\\langle / s \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 311, + 269, + 324 + ], + "score": 1.0, + "content": "Question", + "type": "text" + }, + { + "bbox": [ + 269, + 312, + 279, + 321 + ], + "score": 0.74, + "content": "^ +", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 311, + 314, + 324 + ], + "score": 1.0, + "content": "Answer", + "type": "text" + }, + { + "bbox": [ + 314, + 311, + 329, + 323 + ], + "score": 0.9, + "content": "\\langle / s \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 311, + 363, + 324 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 363, + 311, + 375, + 323 + ], + "score": 0.89, + "content": "\\langle \\mathbf { s } \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 311, + 396, + 324 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 396, + 311, + 412, + 323 + ], + "score": 0.9, + "content": "\\langle / \\mathrm { s } \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 311, + 505, + 324 + ], + "score": 1.0, + "content": "are special tokens for", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 320, + 506, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 320, + 506, + 335 + ], + "score": 1.0, + "content": "RoBERTa model8. We then apply a fully-connected layer to the representation of the [CLS] token", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 332, + 433, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 332, + 433, + 347 + ], + "score": 1.0, + "content": "to compute the final logit, and use standard cross-entropy loss for model training.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 277, + 506, + 347 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 350, + 505, + 427 + ], + "lines": [ + { + "bbox": [ + 106, + 351, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 106, + 351, + 505, + 361 + ], + "score": 1.0, + "content": "Results are summarized in Table 3. Following Sun et al. (2018), we first finetune the RoBERTa", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 361, + 505, + 373 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 455, + 373 + ], + "score": 1.0, + "content": "model on the RACE dataset (Lai et al., 2017). The finetuned RoBERTa model achieves", + "type": "text" + }, + { + "bbox": [ + 455, + 361, + 487, + 371 + ], + "score": 0.88, + "content": "8 5 . 7 0 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 361, + 505, + 373 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 371, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 106, + 372, + 138, + 383 + ], + "score": 0.88, + "content": "8 5 . 2 4 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 139, + 371, + 505, + 384 + ], + "score": 1.0, + "content": "accuracy on the development and test set of RACE, respectively. Based on this, we further", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 382, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 505, + 396 + ], + "score": 1.0, + "content": "finetune the model on both ARC-Easy and ARC-Challenge datasets with the same hyper-parameter", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 394, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 301, + 406 + ], + "score": 1.0, + "content": "searching strategy (for 5 epochs), which achieves", + "type": "text" + }, + { + "bbox": [ + 302, + 394, + 367, + 405 + ], + "score": 0.89, + "content": "8 4 . 1 3 \\% / 6 4 . 4 4 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 394, + 505, + 406 + ], + "score": 1.0, + "content": "test accuracy on ARC-Easy/ARC-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 405, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 348, + 417 + ], + "score": 1.0, + "content": "Challenge. And by adding FreeLB finetuning, we can reach", + "type": "text" + }, + { + "bbox": [ + 348, + 405, + 413, + 415 + ], + "score": 0.9, + "content": "8 4 . 8 1 \\% / 6 5 . 3 6 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 405, + 505, + 417 + ], + "score": 1.0, + "content": ", a significant boost on", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 416, + 353, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 416, + 353, + 428 + ], + "score": 1.0, + "content": "ARC benchmark, demonstrating the effectiveness of FreeLB.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 351, + 505, + 428 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 433, + 505, + 498 + ], + "lines": [ + { + "bbox": [ + 105, + 432, + 505, + 445 + ], + "spans": [ + { + "bbox": [ + 105, + 432, + 505, + 445 + ], + "score": 1.0, + "content": "To further improve the results, we apply a multi-task learning (MTL) strategy using additional", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 442, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 505, + 456 + ], + "score": 1.0, + "content": "datasets. We first finetune the model on RACE (Lai et al., 2017), and then finetune on a joint", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 452, + 506, + 468 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 506, + 468 + ], + "score": 1.0, + "content": "dataset of ARC-Easy, ARC-Challenge, OpenbookQA (Mihaylov et al., 2018) and Regents Living", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 465, + 505, + 478 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 505, + 478 + ], + "score": 1.0, + "content": "Environment9. Based on this, we further finetune our model on ARC-Easy and ARC-Challenge with", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 476, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 476, + 319, + 489 + ], + "score": 1.0, + "content": "FreeLB. After finetuning, our single model achieves", + "type": "text" + }, + { + "bbox": [ + 320, + 477, + 352, + 487 + ], + "score": 0.88, + "content": "6 7 . 7 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 476, + 505, + 489 + ], + "score": 1.0, + "content": "test accuracy on ARC-Challenge and", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 487, + 477, + 500 + ], + "spans": [ + { + "bbox": [ + 106, + 487, + 138, + 498 + ], + "score": 0.84, + "content": "8 5 . 4 4 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 139, + 487, + 477, + 500 + ], + "score": 1.0, + "content": "on ARC-Easy, both outperforming the best submission on the official leaderboard10.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 432, + 506, + 500 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 504, + 505, + 570 + ], + "lines": [ + { + "bbox": [ + 105, + 504, + 505, + 517 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 505, + 517 + ], + "score": 1.0, + "content": "CommonsenseQA Similar to the training strategy in Liu et al. (2019b), we construct five inputs", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 516, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 106, + 516, + 505, + 527 + ], + "score": 1.0, + "content": "for each question by concatenating the question and each answer separately, then encode each input", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 527, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 106, + 527, + 505, + 538 + ], + "score": 1.0, + "content": "with the representation of the [CLS] token. A final score is calculated by applying the representation", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 536, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 505, + 551 + ], + "score": 1.0, + "content": "of [CLS] to a fully-connected layer. Following the fairseq repository11, the input is formatted as:", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 547, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 549, + 133, + 560 + ], + "score": 0.59, + "content": "{ \\mathfrak { n } } ( s ) Q", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 547, + 415, + 563 + ], + "score": 1.0, + "content": ": Where can I stand on a river to see water falling without getting wet?", + "type": "text" + }, + { + "bbox": [ + 415, + 548, + 438, + 560 + ], + "score": 0.86, + "content": "\\langle / s \\rangle A", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 547, + 482, + 563 + ], + "score": 1.0, + "content": ": waterfall", + "type": "text" + }, + { + "bbox": [ + 482, + 548, + 501, + 560 + ], + "score": 0.86, + "content": "\\langle \\langle s \\rangle ^ { \\ast } \\cdot \\mathbf { \\vec { \\mathbf { \\mu } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 547, + 506, + 563 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 559, + 395, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 133, + 572 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 560, + 145, + 570 + ], + "score": 0.73, + "content": "\\cdot _ { Q }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 559, + 170, + 572 + ], + "score": 1.0, + "content": ":’ and", + "type": "text" + }, + { + "bbox": [ + 170, + 560, + 180, + 569 + ], + "score": 0.49, + "content": "^ { , } A", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 559, + 395, + 572 + ], + "score": 1.0, + "content": ":’ are the prefix for question and answer, respectively.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 504, + 506, + 572 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 576, + 505, + 642 + ], + "lines": [ + { + "bbox": [ + 106, + 576, + 505, + 587 + ], + "spans": [ + { + "bbox": [ + 106, + 576, + 390, + 587 + ], + "score": 1.0, + "content": "Results are summarized in Table 3. We obtained a dev-set accuracy of", + "type": "text" + }, + { + "bbox": [ + 390, + 576, + 423, + 587 + ], + "score": 0.88, + "content": "7 7 . 5 6 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 576, + 505, + 587 + ], + "score": 1.0, + "content": "with the RoBERTa-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 587, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 345, + 600 + ], + "score": 1.0, + "content": "large model. When using FreeLB finetuning, we achieved", + "type": "text" + }, + { + "bbox": [ + 346, + 587, + 378, + 598 + ], + "score": 0.88, + "content": "7 8 . 8 1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 587, + 390, + 600 + ], + "score": 1.0, + "content": ", a", + "type": "text" + }, + { + "bbox": [ + 390, + 588, + 417, + 597 + ], + "score": 0.87, + "content": "1 . 2 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 587, + 505, + 600 + ], + "score": 1.0, + "content": "absolute gain. Com-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 598, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 386, + 610 + ], + "score": 1.0, + "content": "pared with the results reported from fairseq repository, which obtains", + "type": "text" + }, + { + "bbox": [ + 386, + 599, + 418, + 609 + ], + "score": 0.88, + "content": "7 8 . 4 3 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 598, + 505, + 610 + ], + "score": 1.0, + "content": "accuracy on the dev-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 609, + 505, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 505, + 621 + ], + "score": 1.0, + "content": "set, FreeLB still achieves better performance. Our submission to the CommonsenseQA leaderboard", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 619, + 506, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 143, + 633 + ], + "score": 1.0, + "content": "achieves", + "type": "text" + }, + { + "bbox": [ + 144, + 620, + 171, + 631 + ], + "score": 0.86, + "content": "7 2 . 2 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 619, + 474, + 633 + ], + "score": 1.0, + "content": "single-model test set accuracy, and the result of a 20-model ensemble is", + "type": "text" + }, + { + "bbox": [ + 474, + 620, + 501, + 631 + ], + "score": 0.86, + "content": "7 3 . 1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 619, + 506, + 633 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 631, + 444, + 643 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 444, + 643 + ], + "score": 1.0, + "content": "which achieves No.1 among all the submissions without making use of ConceptNet.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 576, + 506, + 643 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 141, + 80, + 467, + 126 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 141, + 80, + 467, + 126 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 141, + 80, + 467, + 126 + ], + "spans": [ + { + "bbox": [ + 141, + 80, + 467, + 126 + ], + "score": 0.965, + "html": "
MethodsVanillaFreeLB-3*FreeLB-3YOPO-3-2YOPO-3-3
RTE85.61 (1.67)87.14 (1.29)88.13 (1.21)87.05 (1.36)87.05 (0.20)
CoLA67.57 (1.30)69.31 (1.16)71.12 (0.90)70.40 (0.91)69.91 (1.16)
MRPC90.69 (0.54)90.93 (0.66)91.42 (0.72)90.44 (0.62)90.69 (0.37)
", + "type": "table", + "image_path": "22299a0200d7157b9946af1d49851cd5bfb444546715f02cc8dfdb5fe86e9613.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 141, + 80, + 467, + 95.33333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 141, + 95.33333333333333, + 467, + 110.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 141, + 110.66666666666666, + 467, + 125.99999999999999 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 108, + 129, + 503, + 169 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 127, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 106, + 127, + 505, + 140 + ], + "score": 1.0, + "content": "Table 4: The median and standard deviation of the scores on the dev sets of RTE, CoLA and MRPC from the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 138, + 506, + 151 + ], + "spans": [ + { + "bbox": [ + 106, + 138, + 506, + 151 + ], + "score": 1.0, + "content": "GLUE benchmark, computed from 5 runs with the same hyper-parameters except for the random seeds. We", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 149, + 505, + 160 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 151, + 160 + ], + "score": 1.0, + "content": "use FreeLB-", + "type": "text" + }, + { + "bbox": [ + 151, + 150, + 160, + 158 + ], + "score": 0.79, + "content": "\\mathbf { \\nabla } m", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 149, + 243, + 160 + ], + "score": 1.0, + "content": "to denote FreeLB with", + "type": "text" + }, + { + "bbox": [ + 244, + 151, + 253, + 158 + ], + "score": 0.76, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 149, + 346, + 160 + ], + "score": 1.0, + "content": "ascent steps, and FreeLB-", + "type": "text" + }, + { + "bbox": [ + 346, + 149, + 356, + 158 + ], + "score": 0.84, + "content": "{ . 3 ^ { * } }", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 149, + 505, + 160 + ], + "score": 1.0, + "content": "to denote the version without reusing the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 158, + 160, + 171 + ], + "spans": [ + { + "bbox": [ + 106, + 158, + 160, + 171 + ], + "score": 1.0, + "content": "dropout mask.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "table", + "bbox": [ + 106, + 174, + 505, + 237 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 174, + 505, + 237 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 174, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 174, + 505, + 237 + ], + "score": 0.979, + "html": "
MethodsRTECoLAMRPC
M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-3)M-Inc (R)(10-3)N-Loss(10-3)
Vanilla5.15.34.56.15.75.210.210.21.9
PGD4.74.96.2128.2130.1436.15.75.75.4
FreeLB3.02.64.11.41.37.23.63.62.7
", + "type": "table", + "image_path": "123f8ec948de592b6c31088d940779fcf701f6d633979bb44b4a997bb3feb667.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 106, + 174, + 505, + 195.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 106, + 195.0, + 505, + 216.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 106, + 216.0, + 505, + 237.0 + ], + "spans": [], + "index": 9 + } + ] + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 106, + 241, + 505, + 292 + ], + "lines": [ + { + "bbox": [ + 105, + 240, + 506, + 254 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 506, + 254 + ], + "score": 1.0, + "content": "Table 5: Median of the maximum increase in loss in the vicinity of the dev set samples for RoBERTa-Large", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 252, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 505, + 262 + ], + "score": 1.0, + "content": "model finetuned with different methods. Vanilla models are naturally trained RoBERTa’s. M-Inc: Max Inc, M-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 261, + 505, + 273 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 505, + 273 + ], + "score": 1.0, + "content": "Inc (R): Max Inc (R). Nat Loss (N-Loss) is the loss value on clean samples. Notice we require all clean samples", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 272, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 505, + 282 + ], + "score": 1.0, + "content": "here to be correctly classified by all models, which results in 227, 850 and 355 samples for RTE, CoLA and", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 282, + 339, + 293 + ], + "spans": [ + { + "bbox": [ + 106, + 282, + 339, + 293 + ], + "score": 1.0, + "content": "MRPC, respectively. We also give the variance in the Appendix.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12 + }, + { + "type": "title", + "bbox": [ + 108, + 306, + 276, + 317 + ], + "lines": [ + { + "bbox": [ + 105, + 304, + 278, + 319 + ], + "spans": [ + { + "bbox": [ + 105, + 304, + 278, + 319 + ], + "score": 1.0, + "content": "4.3 ABLATION STUDY AND ANALYSIS", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 107, + 326, + 505, + 381 + ], + "lines": [ + { + "bbox": [ + 105, + 325, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 505, + 339 + ], + "score": 1.0, + "content": "In this sub-section, we first show the importance of reusing dropout mask, then conduct a thorough", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 337, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 505, + 350 + ], + "score": 1.0, + "content": "ablation study on FreeLB over the GLUE benchmark to analyze the robustness and generalization", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 348, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 105, + 348, + 505, + 361 + ], + "score": 1.0, + "content": "strength of different approaches. We observe that it is unnecessary to perform shallow-layer updates", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 359, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 359, + 505, + 372 + ], + "score": 1.0, + "content": "on the adversary as YOPO for our case, and FreeLB results in improved robustness and generaliza-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 369, + 210, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 210, + 383 + ], + "score": 1.0, + "content": "tion compared with PGD.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 387, + 505, + 432 + ], + "lines": [ + { + "bbox": [ + 106, + 387, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 106, + 387, + 505, + 399 + ], + "score": 1.0, + "content": "Importance of Reusing Mask Table 4 (columns 2 to 4) compares the results of FreeLB with and", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 397, + 506, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 397, + 506, + 411 + ], + "score": 1.0, + "content": "without reusing the same dropout mask in each ascent step, as proposed in Sec. 3.3. With reusing,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 408, + 506, + 422 + ], + "spans": [ + { + "bbox": [ + 105, + 408, + 506, + 422 + ], + "score": 1.0, + "content": "FreeLB can achieve a larger improvement over the naturally trained models. Thus, we enable mask", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 420, + 300, + 432 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 300, + 432 + ], + "score": 1.0, + "content": "reusing for all experiments involving RoBERTa.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 106, + 437, + 504, + 459 + ], + "lines": [ + { + "bbox": [ + 106, + 436, + 505, + 449 + ], + "spans": [ + { + "bbox": [ + 106, + 436, + 505, + 449 + ], + "score": 1.0, + "content": "Comparing the Robustness Table 5 provides the comparisons of the maximum increment of loss", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 448, + 274, + 460 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 274, + 460 + ], + "score": 1.0, + "content": "in the vicinity of each sample, defined as:", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 461, + 422, + 482 + ], + "lines": [ + { + "bbox": [ + 189, + 461, + 422, + 482 + ], + "spans": [ + { + "bbox": [ + 189, + 461, + 422, + 482 + ], + "score": 0.92, + "content": "\\displaystyle \\Delta L _ { \\mathrm { m a x } } ( \\boldsymbol { X } , \\epsilon ) = \\operatorname* { m a x } _ { \\| \\delta \\| \\leq \\epsilon } L ( f _ { \\boldsymbol { \\theta } } ( \\boldsymbol { X } + \\delta ) , \\boldsymbol { y } ) - L ( f _ { \\boldsymbol { \\theta } } ( \\boldsymbol { X } ) , \\boldsymbol { y } ) ,", + "type": "interline_equation", + "image_path": "cf1340b64e7dea43e7ba8813f0bad358c01a42d13b806c2cf4c77f077ec893d9.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 189, + 461, + 422, + 482 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 484, + 505, + 551 + ], + "lines": [ + { + "bbox": [ + 106, + 484, + 506, + 497 + ], + "spans": [ + { + "bbox": [ + 106, + 484, + 506, + 497 + ], + "score": 1.0, + "content": "which reflects the robustness and invariance of the model in the embedding space. In practice, we", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 495, + 506, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 285, + 508 + ], + "score": 1.0, + "content": "use PGD steps as in Eq. 2 to find the value of", + "type": "text" + }, + { + "bbox": [ + 285, + 495, + 342, + 507 + ], + "score": 0.94, + "content": "{ \\Delta } L _ { \\mathrm { m a x } } ( \\boldsymbol { X } , \\boldsymbol { \\epsilon } )", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 495, + 506, + 508 + ], + "score": 1.0, + "content": ". We found that when using a step size of", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 505, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 137, + 517 + ], + "score": 0.9, + "content": "5 { \\cdot } 1 0 ^ { - 3 }", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 505, + 155, + 520 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 155, + 506, + 216, + 519 + ], + "score": 0.92, + "content": "\\epsilon = 0 . 0 1 \\| X \\| _ { F }", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 505, + 506, + 520 + ], + "score": 1.0, + "content": ", the PGD iterations converge to almost the same value, starting from 100", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 517, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 106, + 517, + 243, + 529 + ], + "score": 1.0, + "content": "different random initializations of", + "type": "text" + }, + { + "bbox": [ + 244, + 518, + 250, + 527 + ], + "score": 0.82, + "content": "\\pmb { \\delta }", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 517, + 505, + 529 + ], + "score": 1.0, + "content": "for the RoBERTa models, trained with or without FreeLB. This", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 527, + 504, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 241, + 542 + ], + "score": 1.0, + "content": "indicates that PGD reliably finds", + "type": "text" + }, + { + "bbox": [ + 242, + 529, + 273, + 540 + ], + "score": 0.9, + "content": "\\Delta L _ { \\mathrm { m a x } }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 527, + 446, + 542 + ], + "score": 1.0, + "content": "for these models. Therefore, we compute", + "type": "text" + }, + { + "bbox": [ + 446, + 528, + 504, + 541 + ], + "score": 0.92, + "content": "{ \\Delta } L _ { \\mathrm { m a x } } ( X , \\epsilon )", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 539, + 242, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 141, + 552 + ], + "score": 1.0, + "content": "for each", + "type": "text" + }, + { + "bbox": [ + 142, + 540, + 153, + 549 + ], + "score": 0.75, + "content": "\\boldsymbol { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 539, + 242, + 552 + ], + "score": 1.0, + "content": "via a 2000-step PGD.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 106, + 556, + 505, + 634 + ], + "lines": [ + { + "bbox": [ + 105, + 556, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 505, + 568 + ], + "score": 1.0, + "content": "Samples with small margins exist even for models with perfect accuracy, which could give a false", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 567, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 413, + 581 + ], + "score": 1.0, + "content": "sense of vulnerability of the model. To rule out the outlier effect and make", + "type": "text" + }, + { + "bbox": [ + 414, + 567, + 471, + 579 + ], + "score": 0.93, + "content": "{ \\Delta } L _ { \\mathrm { m a x } } ( \\boldsymbol { X } , \\epsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 567, + 505, + 581 + ], + "score": 1.0, + "content": "compa-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 579, + 504, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 504, + 590 + ], + "score": 1.0, + "content": "rable across different samples, we only consider samples that all the evaluated models can correctly", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 589, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 589, + 212, + 601 + ], + "score": 1.0, + "content": "classify, and search for an", + "type": "text" + }, + { + "bbox": [ + 212, + 591, + 218, + 599 + ], + "score": 0.68, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 589, + 505, + 601 + ], + "score": 1.0, + "content": "for each sample such that the reference model can correctly classify all", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 104, + 598, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 104, + 598, + 185, + 614 + ], + "score": 1.0, + "content": "samples within the", + "type": "text" + }, + { + "bbox": [ + 186, + 602, + 192, + 610 + ], + "score": 0.57, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 598, + 373, + 614 + ], + "score": 1.0, + "content": "ball.12 However, such choice of per-sample", + "type": "text" + }, + { + "bbox": [ + 374, + 602, + 380, + 610 + ], + "score": 0.57, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 598, + 505, + 614 + ], + "score": 1.0, + "content": "favors the reference model by", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 611, + 504, + 624 + ], + "spans": [ + { + "bbox": [ + 106, + 611, + 372, + 624 + ], + "score": 1.0, + "content": "design. To make fair comparisons, Table 5 provides the median of", + "type": "text" + }, + { + "bbox": [ + 373, + 611, + 430, + 623 + ], + "score": 0.95, + "content": "{ \\Delta } L _ { \\mathrm { m a x } } ( \\boldsymbol { X } , \\epsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 611, + 498, + 624 + ], + "score": 1.0, + "content": "with per-sample", + "type": "text" + }, + { + "bbox": [ + 498, + 613, + 504, + 621 + ], + "score": 0.7, + "content": "\\epsilon", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 622, + 429, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 429, + 635 + ], + "score": 1.0, + "content": "from models trained by FreeLB (Max Inc) and PGD (Mac Inc (R)), respectively.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 639, + 505, + 694 + ], + "lines": [ + { + "bbox": [ + 106, + 639, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 106, + 639, + 505, + 651 + ], + "score": 1.0, + "content": "Across all three datasets and different reference models, FreeLB has the smallest median increment", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 650, + 504, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 504, + 662 + ], + "score": 1.0, + "content": "even when starting from a larger natural loss than vanilla models. This demonstrates that FreeLB", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 661, + 505, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 661, + 505, + 673 + ], + "score": 1.0, + "content": "is more robust and invariant in most cases. Such results are also consistent with the models’ dev", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 671, + 506, + 685 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 506, + 685 + ], + "score": 1.0, + "content": "set performance (the performances for Vanilla/PGD/FreeLB models on RTE, CoLA and MRPC are", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 681, + 396, + 696 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 396, + 696 + ], + "score": 1.0, + "content": "86.69/87.41/89.21, 69.91/70.84/71.40, 91.67/91.17/91.17, respectively).", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 701, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 115, + 699, + 506, + 714 + ], + "spans": [ + { + "bbox": [ + 115, + 699, + 481, + 714 + ], + "score": 1.0, + "content": "12For each sample, we start from a value slightly larger than the norm constraint during training for", + "type": "text" + }, + { + "bbox": [ + 481, + 704, + 486, + 711 + ], + "score": 0.51, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 699, + 506, + 714 + ], + "score": 1.0, + "content": ", and", + "type": "text" + } + ] + }, + { + "bbox": [ + 105, + 710, + 506, + 724 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 156, + 724 + ], + "score": 1.0, + "content": "then decrease", + "type": "text" + }, + { + "bbox": [ + 156, + 713, + 162, + 721 + ], + "score": 0.7, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 710, + 506, + 724 + ], + "score": 1.0, + "content": "linearly until the model trained with the reference model can correctly classify after a 2000-step", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 721, + 367, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 367, + 732 + ], + "score": 1.0, + "content": "PGD attack. The reference model is either trained with FreeLB or PGD.", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 300, + 750, + 309, + 761 + ], + "spans": [ + { + "bbox": [ + 300, + 750, + 309, + 761 + ], + "score": 1.0, + "content": "8", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 141, + 80, + 467, + 126 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 141, + 80, + 467, + 126 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 141, + 80, + 467, + 126 + ], + "spans": [ + { + "bbox": [ + 141, + 80, + 467, + 126 + ], + "score": 0.965, + "html": "
MethodsVanillaFreeLB-3*FreeLB-3YOPO-3-2YOPO-3-3
RTE85.61 (1.67)87.14 (1.29)88.13 (1.21)87.05 (1.36)87.05 (0.20)
CoLA67.57 (1.30)69.31 (1.16)71.12 (0.90)70.40 (0.91)69.91 (1.16)
MRPC90.69 (0.54)90.93 (0.66)91.42 (0.72)90.44 (0.62)90.69 (0.37)
", + "type": "table", + "image_path": "22299a0200d7157b9946af1d49851cd5bfb444546715f02cc8dfdb5fe86e9613.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 141, + 80, + 467, + 95.33333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 141, + 95.33333333333333, + 467, + 110.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 141, + 110.66666666666666, + 467, + 125.99999999999999 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 108, + 129, + 503, + 169 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 127, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 106, + 127, + 505, + 140 + ], + "score": 1.0, + "content": "Table 4: The median and standard deviation of the scores on the dev sets of RTE, CoLA and MRPC from the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 138, + 506, + 151 + ], + "spans": [ + { + "bbox": [ + 106, + 138, + 506, + 151 + ], + "score": 1.0, + "content": "GLUE benchmark, computed from 5 runs with the same hyper-parameters except for the random seeds. We", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 149, + 505, + 160 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 151, + 160 + ], + "score": 1.0, + "content": "use FreeLB-", + "type": "text" + }, + { + "bbox": [ + 151, + 150, + 160, + 158 + ], + "score": 0.79, + "content": "\\mathbf { \\nabla } m", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 149, + 243, + 160 + ], + "score": 1.0, + "content": "to denote FreeLB with", + "type": "text" + }, + { + "bbox": [ + 244, + 151, + 253, + 158 + ], + "score": 0.76, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 149, + 346, + 160 + ], + "score": 1.0, + "content": "ascent steps, and FreeLB-", + "type": "text" + }, + { + "bbox": [ + 346, + 149, + 356, + 158 + ], + "score": 0.84, + "content": "{ . 3 ^ { * } }", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 149, + 505, + 160 + ], + "score": 1.0, + "content": "to denote the version without reusing the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 158, + 160, + 171 + ], + "spans": [ + { + "bbox": [ + 106, + 158, + 160, + 171 + ], + "score": 1.0, + "content": "dropout mask.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "table", + "bbox": [ + 106, + 174, + 505, + 237 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 174, + 505, + 237 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 174, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 174, + 505, + 237 + ], + "score": 0.979, + "html": "
MethodsRTECoLAMRPC
M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-3)M-Inc (R)(10-3)N-Loss(10-3)
Vanilla5.15.34.56.15.75.210.210.21.9
PGD4.74.96.2128.2130.1436.15.75.75.4
FreeLB3.02.64.11.41.37.23.63.62.7
", + "type": "table", + "image_path": "123f8ec948de592b6c31088d940779fcf701f6d633979bb44b4a997bb3feb667.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 106, + 174, + 505, + 195.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 106, + 195.0, + 505, + 216.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 106, + 216.0, + 505, + 237.0 + ], + "spans": [], + "index": 9 + } + ] + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 106, + 241, + 505, + 292 + ], + "lines": [ + { + "bbox": [ + 105, + 240, + 506, + 254 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 506, + 254 + ], + "score": 1.0, + "content": "Table 5: Median of the maximum increase in loss in the vicinity of the dev set samples for RoBERTa-Large", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 252, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 505, + 262 + ], + "score": 1.0, + "content": "model finetuned with different methods. Vanilla models are naturally trained RoBERTa’s. M-Inc: Max Inc, M-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 261, + 505, + 273 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 505, + 273 + ], + "score": 1.0, + "content": "Inc (R): Max Inc (R). Nat Loss (N-Loss) is the loss value on clean samples. Notice we require all clean samples", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 272, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 505, + 282 + ], + "score": 1.0, + "content": "here to be correctly classified by all models, which results in 227, 850 and 355 samples for RTE, CoLA and", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 282, + 339, + 293 + ], + "spans": [ + { + "bbox": [ + 106, + 282, + 339, + 293 + ], + "score": 1.0, + "content": "MRPC, respectively. We also give the variance in the Appendix.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 240, + 506, + 293 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 306, + 276, + 317 + ], + "lines": [ + { + "bbox": [ + 105, + 304, + 278, + 319 + ], + "spans": [ + { + "bbox": [ + 105, + 304, + 278, + 319 + ], + "score": 1.0, + "content": "4.3 ABLATION STUDY AND ANALYSIS", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 107, + 326, + 505, + 381 + ], + "lines": [ + { + "bbox": [ + 105, + 325, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 505, + 339 + ], + "score": 1.0, + "content": "In this sub-section, we first show the importance of reusing dropout mask, then conduct a thorough", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 337, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 505, + 350 + ], + "score": 1.0, + "content": "ablation study on FreeLB over the GLUE benchmark to analyze the robustness and generalization", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 348, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 105, + 348, + 505, + 361 + ], + "score": 1.0, + "content": "strength of different approaches. We observe that it is unnecessary to perform shallow-layer updates", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 359, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 359, + 505, + 372 + ], + "score": 1.0, + "content": "on the adversary as YOPO for our case, and FreeLB results in improved robustness and generaliza-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 369, + 210, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 210, + 383 + ], + "score": 1.0, + "content": "tion compared with PGD.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 325, + 505, + 383 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 387, + 505, + 432 + ], + "lines": [ + { + "bbox": [ + 106, + 387, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 106, + 387, + 505, + 399 + ], + "score": 1.0, + "content": "Importance of Reusing Mask Table 4 (columns 2 to 4) compares the results of FreeLB with and", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 397, + 506, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 397, + 506, + 411 + ], + "score": 1.0, + "content": "without reusing the same dropout mask in each ascent step, as proposed in Sec. 3.3. With reusing,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 408, + 506, + 422 + ], + "spans": [ + { + "bbox": [ + 105, + 408, + 506, + 422 + ], + "score": 1.0, + "content": "FreeLB can achieve a larger improvement over the naturally trained models. Thus, we enable mask", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 420, + 300, + 432 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 300, + 432 + ], + "score": 1.0, + "content": "reusing for all experiments involving RoBERTa.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 387, + 506, + 432 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 437, + 504, + 459 + ], + "lines": [ + { + "bbox": [ + 106, + 436, + 505, + 449 + ], + "spans": [ + { + "bbox": [ + 106, + 436, + 505, + 449 + ], + "score": 1.0, + "content": "Comparing the Robustness Table 5 provides the comparisons of the maximum increment of loss", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 448, + 274, + 460 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 274, + 460 + ], + "score": 1.0, + "content": "in the vicinity of each sample, defined as:", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 106, + 436, + 505, + 460 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 461, + 422, + 482 + ], + "lines": [ + { + "bbox": [ + 189, + 461, + 422, + 482 + ], + "spans": [ + { + "bbox": [ + 189, + 461, + 422, + 482 + ], + "score": 0.92, + "content": "\\displaystyle \\Delta L _ { \\mathrm { m a x } } ( \\boldsymbol { X } , \\epsilon ) = \\operatorname* { m a x } _ { \\| \\delta \\| \\leq \\epsilon } L ( f _ { \\boldsymbol { \\theta } } ( \\boldsymbol { X } + \\delta ) , \\boldsymbol { y } ) - L ( f _ { \\boldsymbol { \\theta } } ( \\boldsymbol { X } ) , \\boldsymbol { y } ) ,", + "type": "interline_equation", + "image_path": "cf1340b64e7dea43e7ba8813f0bad358c01a42d13b806c2cf4c77f077ec893d9.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 189, + 461, + 422, + 482 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 484, + 505, + 551 + ], + "lines": [ + { + "bbox": [ + 106, + 484, + 506, + 497 + ], + "spans": [ + { + "bbox": [ + 106, + 484, + 506, + 497 + ], + "score": 1.0, + "content": "which reflects the robustness and invariance of the model in the embedding space. In practice, we", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 495, + 506, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 285, + 508 + ], + "score": 1.0, + "content": "use PGD steps as in Eq. 2 to find the value of", + "type": "text" + }, + { + "bbox": [ + 285, + 495, + 342, + 507 + ], + "score": 0.94, + "content": "{ \\Delta } L _ { \\mathrm { m a x } } ( \\boldsymbol { X } , \\boldsymbol { \\epsilon } )", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 495, + 506, + 508 + ], + "score": 1.0, + "content": ". We found that when using a step size of", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 505, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 137, + 517 + ], + "score": 0.9, + "content": "5 { \\cdot } 1 0 ^ { - 3 }", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 505, + 155, + 520 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 155, + 506, + 216, + 519 + ], + "score": 0.92, + "content": "\\epsilon = 0 . 0 1 \\| X \\| _ { F }", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 505, + 506, + 520 + ], + "score": 1.0, + "content": ", the PGD iterations converge to almost the same value, starting from 100", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 517, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 106, + 517, + 243, + 529 + ], + "score": 1.0, + "content": "different random initializations of", + "type": "text" + }, + { + "bbox": [ + 244, + 518, + 250, + 527 + ], + "score": 0.82, + "content": "\\pmb { \\delta }", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 517, + 505, + 529 + ], + "score": 1.0, + "content": "for the RoBERTa models, trained with or without FreeLB. This", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 527, + 504, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 241, + 542 + ], + "score": 1.0, + "content": "indicates that PGD reliably finds", + "type": "text" + }, + { + "bbox": [ + 242, + 529, + 273, + 540 + ], + "score": 0.9, + "content": "\\Delta L _ { \\mathrm { m a x } }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 527, + 446, + 542 + ], + "score": 1.0, + "content": "for these models. Therefore, we compute", + "type": "text" + }, + { + "bbox": [ + 446, + 528, + 504, + 541 + ], + "score": 0.92, + "content": "{ \\Delta } L _ { \\mathrm { m a x } } ( X , \\epsilon )", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 539, + 242, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 141, + 552 + ], + "score": 1.0, + "content": "for each", + "type": "text" + }, + { + "bbox": [ + 142, + 540, + 153, + 549 + ], + "score": 0.75, + "content": "\\boldsymbol { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 539, + 242, + 552 + ], + "score": 1.0, + "content": "via a 2000-step PGD.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 484, + 506, + 552 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 556, + 505, + 634 + ], + "lines": [ + { + "bbox": [ + 105, + 556, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 505, + 568 + ], + "score": 1.0, + "content": "Samples with small margins exist even for models with perfect accuracy, which could give a false", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 567, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 413, + 581 + ], + "score": 1.0, + "content": "sense of vulnerability of the model. To rule out the outlier effect and make", + "type": "text" + }, + { + "bbox": [ + 414, + 567, + 471, + 579 + ], + "score": 0.93, + "content": "{ \\Delta } L _ { \\mathrm { m a x } } ( \\boldsymbol { X } , \\epsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 567, + 505, + 581 + ], + "score": 1.0, + "content": "compa-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 579, + 504, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 504, + 590 + ], + "score": 1.0, + "content": "rable across different samples, we only consider samples that all the evaluated models can correctly", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 589, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 589, + 212, + 601 + ], + "score": 1.0, + "content": "classify, and search for an", + "type": "text" + }, + { + "bbox": [ + 212, + 591, + 218, + 599 + ], + "score": 0.68, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 589, + 505, + 601 + ], + "score": 1.0, + "content": "for each sample such that the reference model can correctly classify all", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 104, + 598, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 104, + 598, + 185, + 614 + ], + "score": 1.0, + "content": "samples within the", + "type": "text" + }, + { + "bbox": [ + 186, + 602, + 192, + 610 + ], + "score": 0.57, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 598, + 373, + 614 + ], + "score": 1.0, + "content": "ball.12 However, such choice of per-sample", + "type": "text" + }, + { + "bbox": [ + 374, + 602, + 380, + 610 + ], + "score": 0.57, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 598, + 505, + 614 + ], + "score": 1.0, + "content": "favors the reference model by", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 611, + 504, + 624 + ], + "spans": [ + { + "bbox": [ + 106, + 611, + 372, + 624 + ], + "score": 1.0, + "content": "design. To make fair comparisons, Table 5 provides the median of", + "type": "text" + }, + { + "bbox": [ + 373, + 611, + 430, + 623 + ], + "score": 0.95, + "content": "{ \\Delta } L _ { \\mathrm { m a x } } ( \\boldsymbol { X } , \\epsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 611, + 498, + 624 + ], + "score": 1.0, + "content": "with per-sample", + "type": "text" + }, + { + "bbox": [ + 498, + 613, + 504, + 621 + ], + "score": 0.7, + "content": "\\epsilon", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 622, + 429, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 429, + 635 + ], + "score": 1.0, + "content": "from models trained by FreeLB (Max Inc) and PGD (Mac Inc (R)), respectively.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37, + "bbox_fs": [ + 104, + 556, + 505, + 635 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 639, + 505, + 694 + ], + "lines": [ + { + "bbox": [ + 106, + 639, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 106, + 639, + 505, + 651 + ], + "score": 1.0, + "content": "Across all three datasets and different reference models, FreeLB has the smallest median increment", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 650, + 504, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 504, + 662 + ], + "score": 1.0, + "content": "even when starting from a larger natural loss than vanilla models. This demonstrates that FreeLB", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 661, + 505, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 661, + 505, + 673 + ], + "score": 1.0, + "content": "is more robust and invariant in most cases. Such results are also consistent with the models’ dev", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 671, + 506, + 685 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 506, + 685 + ], + "score": 1.0, + "content": "set performance (the performances for Vanilla/PGD/FreeLB models on RTE, CoLA and MRPC are", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 681, + 396, + 696 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 396, + 696 + ], + "score": 1.0, + "content": "86.69/87.41/89.21, 69.91/70.84/71.40, 91.67/91.17/91.17, respectively).", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43, + "bbox_fs": [ + 105, + 639, + 506, + 696 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 203 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "Comparing with YOPO The original implementation of YOPO (Zhang et al., 2019) chooses the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 275, + 107 + ], + "score": 1.0, + "content": "first convolutional layer of the ResNets as", + "type": "text" + }, + { + "bbox": [ + 275, + 94, + 285, + 105 + ], + "score": 0.88, + "content": "f _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 93, + 505, + 107 + ], + "score": 1.0, + "content": "for updating the adversary in the “s-loop”. As a result,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "score": 1.0, + "content": "each step of the “s-loop” should be using exactly the same value to update the adversary,and YOPO-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 106, + 117, + 126, + 126 + ], + "score": 0.27, + "content": "m { - } n", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 115, + 251, + 128 + ], + "score": 1.0, + "content": "degenerates into FreeLB with a", + "type": "text" + }, + { + "bbox": [ + 251, + 117, + 258, + 126 + ], + "score": 0.77, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "-times large step size. To avoid that, we choose the layers up to", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 506, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 277, + 139 + ], + "score": 1.0, + "content": "the output of the first Transformer block as", + "type": "text" + }, + { + "bbox": [ + 278, + 127, + 288, + 138 + ], + "score": 0.88, + "content": "f _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 127, + 506, + 139 + ], + "score": 1.0, + "content": "when implementing YOPO. To make the total amount", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 136, + 506, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 411, + 150 + ], + "score": 1.0, + "content": "of update on the adversary equal, we take the hyper-parameters for FreeLB-", + "type": "text" + }, + { + "bbox": [ + 411, + 138, + 421, + 147 + ], + "score": 0.75, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 136, + 506, + 150 + ], + "score": 1.0, + "content": "and only change the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 149, + 505, + 161 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 143, + 161 + ], + "score": 1.0, + "content": "step size", + "type": "text" + }, + { + "bbox": [ + 144, + 150, + 151, + 159 + ], + "score": 0.77, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 149, + 171, + 161 + ], + "score": 1.0, + "content": "into", + "type": "text" + }, + { + "bbox": [ + 171, + 149, + 190, + 160 + ], + "score": 0.91, + "content": "\\alpha / n", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 149, + 236, + 161 + ], + "score": 1.0, + "content": "for YOPO-", + "type": "text" + }, + { + "bbox": [ + 236, + 149, + 255, + 159 + ], + "score": 0.32, + "content": "m { \\cdot } n", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 149, + 505, + 161 + ], + "score": 1.0, + "content": ". Table 4 shows that FreeLB performs consistently better than", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 158, + 504, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 158, + 484, + 173 + ], + "score": 1.0, + "content": "YOPO on all three datasets. Accidentally, we also give the results comparing with YOPO-", + "type": "text" + }, + { + "bbox": [ + 484, + 160, + 504, + 170 + ], + "score": 0.25, + "content": "\\mathbf { \\nabla } m - n", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 171, + 506, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 231, + 183 + ], + "score": 1.0, + "content": "without changing the step size", + "type": "text" + }, + { + "bbox": [ + 232, + 172, + 240, + 180 + ], + "score": 0.76, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 171, + 506, + 183 + ], + "score": 1.0, + "content": "for YOPO in Table 8. The gap between two approaches seem to", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "score": 1.0, + "content": "shrink, which may be caused by using a larger total step size for the YOPO adversaries. We leave", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 192, + 387, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 387, + 204 + ], + "score": 1.0, + "content": "exhaustive hyperparameter search for both models as our future work.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 5 + }, + { + "type": "title", + "bbox": [ + 108, + 219, + 195, + 232 + ], + "lines": [ + { + "bbox": [ + 104, + 217, + 198, + 235 + ], + "spans": [ + { + "bbox": [ + 104, + 217, + 198, + 235 + ], + "score": 1.0, + "content": "5 CONCLUSION", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 244, + 505, + 343 + ], + "lines": [ + { + "bbox": [ + 105, + 244, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 505, + 256 + ], + "score": 1.0, + "content": "In this work, we have developed an adversarial training approach, FreeLB, to improve natural lan-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 255, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 506, + 268 + ], + "score": 1.0, + "content": "guage understanding. The proposed approach adds perturbations to continuous word embeddings", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 266, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 505, + 279 + ], + "score": 1.0, + "content": "using a gradient method, and minimizes the resultant adversarial risk in an efficient way. FreeLB", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 277, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 505, + 289 + ], + "score": 1.0, + "content": "is able to boost Transformer-based model (BERT and RoBERTa) on several datasets and achieve", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 288, + 505, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 505, + 300 + ], + "score": 1.0, + "content": "new state of the art on GLUE and ARC benchmarks. Empirical study demonstrates that our method", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 298, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 505, + 312 + ], + "score": 1.0, + "content": "results in both higher robustness in the embedding space than natural training and better generaliza-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 309, + 505, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 505, + 323 + ], + "score": 1.0, + "content": "tion ability. Such observation is also consistent with recent findings in Computer Vision. However,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 320, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 320, + 505, + 334 + ], + "score": 1.0, + "content": "adversarial training still takes significant overhead compared with vanilla SGD. How to accelerate", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 333, + 415, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 415, + 344 + ], + "score": 1.0, + "content": "this process while improving generalization is an interesting future direction.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 108, + 355, + 503, + 378 + ], + "lines": [ + { + "bbox": [ + 106, + 354, + 504, + 367 + ], + "spans": [ + { + "bbox": [ + 106, + 354, + 504, + 367 + ], + "score": 1.0, + "content": "Acknowledgements: Goldstein and Zhu were supported in part by the DARPA GARD, DARPA", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 365, + 293, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 365, + 293, + 379 + ], + "score": 1.0, + "content": "QED for RML, and AFOSR MURI programs.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "title", + "bbox": [ + 108, + 394, + 175, + 406 + ], + "lines": [ + { + "bbox": [ + 106, + 394, + 176, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 176, + 407 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 412, + 505, + 445 + ], + "lines": [ + { + "bbox": [ + 106, + 412, + 504, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 412, + 504, + 424 + ], + "score": 1.0, + "content": "Eneko Agirre, Llu’is M‘arquez, and Richard Wicentowski (eds.). Proceedings of the Fourth In-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 424, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 116, + 424, + 505, + 435 + ], + "score": 1.0, + "content": "ternational Workshop on Semantic Evaluations (SemEval-2007). Association for Computational", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 434, + 191, + 446 + ], + "spans": [ + { + "bbox": [ + 116, + 434, + 191, + 446 + ], + "score": 1.0, + "content": "Linguistics, 2007.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 452, + 503, + 475 + ], + "lines": [ + { + "bbox": [ + 106, + 451, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 106, + 451, + 505, + 464 + ], + "score": 1.0, + "content": "Anish Athalye, Nicholas Carlini, and David Wagner. Obfuscated gradients give a false sense of", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 464, + 418, + 476 + ], + "spans": [ + { + "bbox": [ + 116, + 464, + 418, + 476 + ], + "score": 1.0, + "content": "security: Circumventing defenses to adversarial examples. In ICML, 2018.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 106, + 481, + 503, + 505 + ], + "lines": [ + { + "bbox": [ + 106, + 482, + 505, + 494 + ], + "spans": [ + { + "bbox": [ + 106, + 482, + 505, + 494 + ], + "score": 1.0, + "content": "Roy Bar Haim, Ido Dagan, Bill Dolan, Lisa Ferro, Danilo Giampiccolo, Bernardo Magnini, and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 116, + 492, + 457, + 505 + ], + "spans": [ + { + "bbox": [ + 116, + 492, + 457, + 505 + ], + "score": 1.0, + "content": "Idan Szpektor. The second PASCAL recognising textual entailment challenge. 2006.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 107, + 511, + 503, + 534 + ], + "lines": [ + { + "bbox": [ + 106, + 511, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 106, + 511, + 505, + 524 + ], + "score": 1.0, + "content": "Yonatan Belinkov and Yonatan Bisk. Synthetic and natural noise both break neural machine trans-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 523, + 207, + 533 + ], + "spans": [ + { + "bbox": [ + 115, + 523, + 207, + 533 + ], + "score": 1.0, + "content": "lation. In ICLR, 2018.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 107, + 540, + 502, + 564 + ], + "lines": [ + { + "bbox": [ + 105, + 540, + 504, + 553 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 504, + 553 + ], + "score": 1.0, + "content": "Luisa Bentivogli, Ido Dagan, Hoa Trang Dang, Danilo Giampiccolo, and Bernardo Magnini. The", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 551, + 367, + 564 + ], + "spans": [ + { + "bbox": [ + 116, + 551, + 367, + 564 + ], + "score": 1.0, + "content": "fifth PASCAL recognizing textual entailment challenge. 2009.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 104, + 570, + 503, + 592 + ], + "lines": [ + { + "bbox": [ + 106, + 569, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 505, + 583 + ], + "score": 1.0, + "content": "Yong Cheng, Lu Jiang, and Wolfgang Macherey. Robust neural machine translation with doubly", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 581, + 252, + 592 + ], + "spans": [ + { + "bbox": [ + 116, + 581, + 252, + 592 + ], + "score": 1.0, + "content": "adversarial inputs. In ACL, 2019.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5 + }, + { + "type": "text", + "bbox": [ + 106, + 599, + 504, + 633 + ], + "lines": [ + { + "bbox": [ + 105, + 599, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 505, + 611 + ], + "score": 1.0, + "content": "Peter Clark, Isaac Cowhey, Oren Etzioni, Tushar Khot, Ashish Sabharwal, Carissa Schoenick, and", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 610, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 116, + 610, + 505, + 623 + ], + "score": 1.0, + "content": "Oyvind Tafjord. Think you have solved question answering? try arc, the ai2 reasoning challenge.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 621, + 279, + 633 + ], + "spans": [ + { + "bbox": [ + 115, + 621, + 279, + 633 + ], + "score": 1.0, + "content": "arXiv preprint arXiv:1803.05457, 2018.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 106, + 639, + 502, + 663 + ], + "lines": [ + { + "bbox": [ + 105, + 637, + 504, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 504, + 654 + ], + "score": 1.0, + "content": "Patrick L Combettes and Jean-Christophe Pesquet. Proximal splitting methods in signal processing.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 650, + 443, + 664 + ], + "spans": [ + { + "bbox": [ + 115, + 650, + 443, + 664 + ], + "score": 1.0, + "content": "In Fixed-point algorithms for inverse problems in science and engineering. 2011.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5 + }, + { + "type": "text", + "bbox": [ + 107, + 669, + 502, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 504, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 504, + 682 + ], + "score": 1.0, + "content": "Ido Dagan, Oren Glickman, and Bernardo Magnini. The PASCAL recognising textual entailment", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 679, + 504, + 693 + ], + "spans": [ + { + "bbox": [ + 115, + 679, + 504, + 693 + ], + "score": 1.0, + "content": "challenge. In Machine learning challenges. evaluating predictive uncertainty, visual object clas-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 691, + 365, + 704 + ], + "spans": [ + { + "bbox": [ + 116, + 691, + 365, + 704 + ], + "score": 1.0, + "content": "sification, and recognising tectual entailment. Springer, 2006.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 707, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 707, + 505, + 723 + ], + "score": 1.0, + "content": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. Bert: Pre-training of deep", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 116, + 720, + 408, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 408, + 733 + ], + "score": 1.0, + "content": "bidirectional transformers for language understanding. In NAACL, 2019.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45.5 + } + ], + "page_idx": 8, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "9", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 203 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "Comparing with YOPO The original implementation of YOPO (Zhang et al., 2019) chooses the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 275, + 107 + ], + "score": 1.0, + "content": "first convolutional layer of the ResNets as", + "type": "text" + }, + { + "bbox": [ + 275, + 94, + 285, + 105 + ], + "score": 0.88, + "content": "f _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 93, + 505, + 107 + ], + "score": 1.0, + "content": "for updating the adversary in the “s-loop”. As a result,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "score": 1.0, + "content": "each step of the “s-loop” should be using exactly the same value to update the adversary,and YOPO-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 106, + 117, + 126, + 126 + ], + "score": 0.27, + "content": "m { - } n", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 115, + 251, + 128 + ], + "score": 1.0, + "content": "degenerates into FreeLB with a", + "type": "text" + }, + { + "bbox": [ + 251, + 117, + 258, + 126 + ], + "score": 0.77, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "-times large step size. To avoid that, we choose the layers up to", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 506, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 277, + 139 + ], + "score": 1.0, + "content": "the output of the first Transformer block as", + "type": "text" + }, + { + "bbox": [ + 278, + 127, + 288, + 138 + ], + "score": 0.88, + "content": "f _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 127, + 506, + 139 + ], + "score": 1.0, + "content": "when implementing YOPO. To make the total amount", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 136, + 506, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 411, + 150 + ], + "score": 1.0, + "content": "of update on the adversary equal, we take the hyper-parameters for FreeLB-", + "type": "text" + }, + { + "bbox": [ + 411, + 138, + 421, + 147 + ], + "score": 0.75, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 136, + 506, + 150 + ], + "score": 1.0, + "content": "and only change the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 149, + 505, + 161 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 143, + 161 + ], + "score": 1.0, + "content": "step size", + "type": "text" + }, + { + "bbox": [ + 144, + 150, + 151, + 159 + ], + "score": 0.77, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 149, + 171, + 161 + ], + "score": 1.0, + "content": "into", + "type": "text" + }, + { + "bbox": [ + 171, + 149, + 190, + 160 + ], + "score": 0.91, + "content": "\\alpha / n", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 149, + 236, + 161 + ], + "score": 1.0, + "content": "for YOPO-", + "type": "text" + }, + { + "bbox": [ + 236, + 149, + 255, + 159 + ], + "score": 0.32, + "content": "m { \\cdot } n", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 149, + 505, + 161 + ], + "score": 1.0, + "content": ". Table 4 shows that FreeLB performs consistently better than", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 158, + 504, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 158, + 484, + 173 + ], + "score": 1.0, + "content": "YOPO on all three datasets. Accidentally, we also give the results comparing with YOPO-", + "type": "text" + }, + { + "bbox": [ + 484, + 160, + 504, + 170 + ], + "score": 0.25, + "content": "\\mathbf { \\nabla } m - n", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 171, + 506, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 231, + 183 + ], + "score": 1.0, + "content": "without changing the step size", + "type": "text" + }, + { + "bbox": [ + 232, + 172, + 240, + 180 + ], + "score": 0.76, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 171, + 506, + 183 + ], + "score": 1.0, + "content": "for YOPO in Table 8. The gap between two approaches seem to", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "score": 1.0, + "content": "shrink, which may be caused by using a larger total step size for the YOPO adversaries. We leave", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 192, + 387, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 387, + 204 + ], + "score": 1.0, + "content": "exhaustive hyperparameter search for both models as our future work.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 83, + 506, + 204 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 219, + 195, + 232 + ], + "lines": [ + { + "bbox": [ + 104, + 217, + 198, + 235 + ], + "spans": [ + { + "bbox": [ + 104, + 217, + 198, + 235 + ], + "score": 1.0, + "content": "5 CONCLUSION", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 244, + 505, + 343 + ], + "lines": [ + { + "bbox": [ + 105, + 244, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 505, + 256 + ], + "score": 1.0, + "content": "In this work, we have developed an adversarial training approach, FreeLB, to improve natural lan-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 255, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 506, + 268 + ], + "score": 1.0, + "content": "guage understanding. The proposed approach adds perturbations to continuous word embeddings", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 266, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 505, + 279 + ], + "score": 1.0, + "content": "using a gradient method, and minimizes the resultant adversarial risk in an efficient way. FreeLB", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 277, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 505, + 289 + ], + "score": 1.0, + "content": "is able to boost Transformer-based model (BERT and RoBERTa) on several datasets and achieve", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 288, + 505, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 505, + 300 + ], + "score": 1.0, + "content": "new state of the art on GLUE and ARC benchmarks. Empirical study demonstrates that our method", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 298, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 505, + 312 + ], + "score": 1.0, + "content": "results in both higher robustness in the embedding space than natural training and better generaliza-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 309, + 505, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 505, + 323 + ], + "score": 1.0, + "content": "tion ability. Such observation is also consistent with recent findings in Computer Vision. However,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 320, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 320, + 505, + 334 + ], + "score": 1.0, + "content": "adversarial training still takes significant overhead compared with vanilla SGD. How to accelerate", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 333, + 415, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 415, + 344 + ], + "score": 1.0, + "content": "this process while improving generalization is an interesting future direction.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 244, + 506, + 344 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 355, + 503, + 378 + ], + "lines": [ + { + "bbox": [ + 106, + 354, + 504, + 367 + ], + "spans": [ + { + "bbox": [ + 106, + 354, + 504, + 367 + ], + "score": 1.0, + "content": "Acknowledgements: Goldstein and Zhu were supported in part by the DARPA GARD, DARPA", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 365, + 293, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 365, + 293, + 379 + ], + "score": 1.0, + "content": "QED for RML, and AFOSR MURI programs.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 106, + 354, + 504, + 379 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 394, + 175, + 406 + ], + "lines": [ + { + "bbox": [ + 106, + 394, + 176, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 176, + 407 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 412, + 505, + 445 + ], + "lines": [ + { + "bbox": [ + 106, + 412, + 504, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 412, + 504, + 424 + ], + "score": 1.0, + "content": "Eneko Agirre, Llu’is M‘arquez, and Richard Wicentowski (eds.). Proceedings of the Fourth In-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 424, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 116, + 424, + 505, + 435 + ], + "score": 1.0, + "content": "ternational Workshop on Semantic Evaluations (SemEval-2007). Association for Computational", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 434, + 191, + 446 + ], + "spans": [ + { + "bbox": [ + 116, + 434, + 191, + 446 + ], + "score": 1.0, + "content": "Linguistics, 2007.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 106, + 412, + 505, + 446 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 452, + 503, + 475 + ], + "lines": [ + { + "bbox": [ + 106, + 451, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 106, + 451, + 505, + 464 + ], + "score": 1.0, + "content": "Anish Athalye, Nicholas Carlini, and David Wagner. Obfuscated gradients give a false sense of", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 464, + 418, + 476 + ], + "spans": [ + { + "bbox": [ + 116, + 464, + 418, + 476 + ], + "score": 1.0, + "content": "security: Circumventing defenses to adversarial examples. In ICML, 2018.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 106, + 451, + 505, + 476 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 481, + 503, + 505 + ], + "lines": [ + { + "bbox": [ + 106, + 482, + 505, + 494 + ], + "spans": [ + { + "bbox": [ + 106, + 482, + 505, + 494 + ], + "score": 1.0, + "content": "Roy Bar Haim, Ido Dagan, Bill Dolan, Lisa Ferro, Danilo Giampiccolo, Bernardo Magnini, and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 116, + 492, + 457, + 505 + ], + "spans": [ + { + "bbox": [ + 116, + 492, + 457, + 505 + ], + "score": 1.0, + "content": "Idan Szpektor. The second PASCAL recognising textual entailment challenge. 2006.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 106, + 482, + 505, + 505 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 511, + 503, + 534 + ], + "lines": [ + { + "bbox": [ + 106, + 511, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 106, + 511, + 505, + 524 + ], + "score": 1.0, + "content": "Yonatan Belinkov and Yonatan Bisk. Synthetic and natural noise both break neural machine trans-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 523, + 207, + 533 + ], + "spans": [ + { + "bbox": [ + 115, + 523, + 207, + 533 + ], + "score": 1.0, + "content": "lation. In ICLR, 2018.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 106, + 511, + 505, + 533 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 540, + 502, + 564 + ], + "lines": [ + { + "bbox": [ + 105, + 540, + 504, + 553 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 504, + 553 + ], + "score": 1.0, + "content": "Luisa Bentivogli, Ido Dagan, Hoa Trang Dang, Danilo Giampiccolo, and Bernardo Magnini. The", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 551, + 367, + 564 + ], + "spans": [ + { + "bbox": [ + 116, + 551, + 367, + 564 + ], + "score": 1.0, + "content": "fifth PASCAL recognizing textual entailment challenge. 2009.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 540, + 504, + 564 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 570, + 503, + 592 + ], + "lines": [ + { + "bbox": [ + 106, + 569, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 505, + 583 + ], + "score": 1.0, + "content": "Yong Cheng, Lu Jiang, and Wolfgang Macherey. Robust neural machine translation with doubly", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 581, + 252, + 592 + ], + "spans": [ + { + "bbox": [ + 116, + 581, + 252, + 592 + ], + "score": 1.0, + "content": "adversarial inputs. In ACL, 2019.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5, + "bbox_fs": [ + 106, + 569, + 505, + 592 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 599, + 504, + 633 + ], + "lines": [ + { + "bbox": [ + 105, + 599, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 505, + 611 + ], + "score": 1.0, + "content": "Peter Clark, Isaac Cowhey, Oren Etzioni, Tushar Khot, Ashish Sabharwal, Carissa Schoenick, and", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 610, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 116, + 610, + 505, + 623 + ], + "score": 1.0, + "content": "Oyvind Tafjord. Think you have solved question answering? try arc, the ai2 reasoning challenge.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 621, + 279, + 633 + ], + "spans": [ + { + "bbox": [ + 115, + 621, + 279, + 633 + ], + "score": 1.0, + "content": "arXiv preprint arXiv:1803.05457, 2018.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38, + "bbox_fs": [ + 105, + 599, + 505, + 633 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 639, + 502, + 663 + ], + "lines": [ + { + "bbox": [ + 105, + 637, + 504, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 504, + 654 + ], + "score": 1.0, + "content": "Patrick L Combettes and Jean-Christophe Pesquet. Proximal splitting methods in signal processing.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 650, + 443, + 664 + ], + "spans": [ + { + "bbox": [ + 115, + 650, + 443, + 664 + ], + "score": 1.0, + "content": "In Fixed-point algorithms for inverse problems in science and engineering. 2011.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5, + "bbox_fs": [ + 105, + 637, + 504, + 664 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 669, + 502, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 504, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 504, + 682 + ], + "score": 1.0, + "content": "Ido Dagan, Oren Glickman, and Bernardo Magnini. The PASCAL recognising textual entailment", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 679, + 504, + 693 + ], + "spans": [ + { + "bbox": [ + 115, + 679, + 504, + 693 + ], + "score": 1.0, + "content": "challenge. In Machine learning challenges. evaluating predictive uncertainty, visual object clas-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 691, + 365, + 704 + ], + "spans": [ + { + "bbox": [ + 116, + 691, + 365, + 704 + ], + "score": 1.0, + "content": "sification, and recognising tectual entailment. Springer, 2006.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43, + "bbox_fs": [ + 105, + 668, + 504, + 704 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 707, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 707, + 505, + 723 + ], + "score": 1.0, + "content": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. Bert: Pre-training of deep", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 116, + 720, + 408, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 408, + 733 + ], + "score": 1.0, + "content": "bidirectional transformers for language understanding. In NAACL, 2019.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45.5, + "bbox_fs": [ + 105, + 707, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 504, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 504, + 96 + ], + "score": 1.0, + "content": "William B Dolan and Chris Brockett. Automatically constructing a corpus of sentential paraphrases.", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 398, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 398, + 106 + ], + "score": 1.0, + "content": "In Proceedings of the International Workshop on Paraphrasing, 2005.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 112, + 503, + 146 + ], + "lines": [ + { + "bbox": [ + 106, + 113, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 113, + 505, + 125 + ], + "score": 1.0, + "content": "Sanghamitra Dutta, Gauri Joshi, Soumyadip Ghosh, Parijat Dube, and Priya Nagpurkar. Slow and", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 122, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 115, + 122, + 505, + 137 + ], + "score": 1.0, + "content": "stale gradients can win the race: Error-runtime trade-offs in distributed sgd. In AISTATS, pp.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 135, + 181, + 146 + ], + "spans": [ + { + "bbox": [ + 116, + 135, + 181, + 146 + ], + "score": 1.0, + "content": "803–812, 2018.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 106, + 153, + 504, + 176 + ], + "lines": [ + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "score": 1.0, + "content": "Javid Ebrahimi, Anyi Rao, Daniel Lowd, and Dejing Dou. HotFlip: White-box adversarial examples", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 164, + 264, + 176 + ], + "spans": [ + { + "bbox": [ + 116, + 164, + 264, + 176 + ], + "score": 1.0, + "content": "for text classification. In ACL, 2018.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 105, + 183, + 504, + 207 + ], + "lines": [ + { + "bbox": [ + 105, + 182, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 505, + 198 + ], + "score": 1.0, + "content": "Yarin Gal and Zoubin Ghahramani. A theoretically grounded application of dropout in recurrent", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 195, + 262, + 206 + ], + "spans": [ + { + "bbox": [ + 115, + 195, + 262, + 206 + ], + "score": 1.0, + "content": "neural networks. In NeurIPS, 2016.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 106, + 213, + 506, + 248 + ], + "lines": [ + { + "bbox": [ + 105, + 212, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 105, + 212, + 505, + 227 + ], + "score": 1.0, + "content": "Danilo Giampiccolo, Bernardo Magnini, Ido Dagan, and Bill Dolan. The third PASCAL recognizing", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 225, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 116, + 225, + 505, + 237 + ], + "score": 1.0, + "content": "textual entailment challenge. In Proceedings of the ACL-PASCAL workshop on textual entailment", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 236, + 218, + 248 + ], + "spans": [ + { + "bbox": [ + 115, + 236, + 218, + 248 + ], + "score": 1.0, + "content": "and paraphrasing, 2007.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 254, + 504, + 278 + ], + "lines": [ + { + "bbox": [ + 105, + 253, + 505, + 269 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 505, + 269 + ], + "score": 1.0, + "content": "Tom Goldstein, Christoph Studer, and Richard Baraniuk. A field guide to forward-backward splitting", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 266, + 366, + 278 + ], + "spans": [ + { + "bbox": [ + 116, + 266, + 366, + 278 + ], + "score": 1.0, + "content": "with a fasta implementation. arXiv preprint 1411.3406, 2014.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 106, + 284, + 504, + 308 + ], + "lines": [ + { + "bbox": [ + 105, + 284, + 505, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 505, + 298 + ], + "score": 1.0, + "content": "Ian Goodfellow, Jonathon Shlens, and Christian Szegedy. Explaining and harnessing adversarial", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 296, + 223, + 308 + ], + "spans": [ + { + "bbox": [ + 115, + 296, + 223, + 308 + ], + "score": 1.0, + "content": "examples. In ICLR, 2015.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 107, + 315, + 505, + 349 + ], + "lines": [ + { + "bbox": [ + 106, + 314, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 106, + 315, + 354, + 327 + ], + "score": 1.0, + "content": "Shankar Iyer, Nikhil Dandekar, and Kornl Csernai.", + "type": "text" + }, + { + "bbox": [ + 374, + 314, + 505, + 328 + ], + "score": 1.0, + "content": "First quora dataset release:", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 325, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 115, + 326, + 230, + 338 + ], + "score": 1.0, + "content": "Question pairs, 2017.", + "type": "text" + }, + { + "bbox": [ + 264, + 325, + 505, + 339 + ], + "score": 1.0, + "content": "URL https://www.quora.com/q/quoradata/", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 336, + 376, + 350 + ], + "spans": [ + { + "bbox": [ + 115, + 336, + 376, + 350 + ], + "score": 1.0, + "content": "First-Quora-Dataset-Release-Question-Pairs.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 356, + 504, + 379 + ], + "lines": [ + { + "bbox": [ + 105, + 356, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 505, + 369 + ], + "score": 1.0, + "content": "Mohit Iyyer, John Wieting, Kevin Gimpel, and Luke Zettlemoyer. Adversarial example generation", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 367, + 392, + 379 + ], + "spans": [ + { + "bbox": [ + 116, + 367, + 392, + 379 + ], + "score": 1.0, + "content": "with syntactically controlled paraphrase networks. In NAACL, 2018.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 106, + 386, + 504, + 409 + ], + "lines": [ + { + "bbox": [ + 105, + 385, + 504, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 504, + 399 + ], + "score": 1.0, + "content": "Robin Jia and Percy Liang. Adversarial examples for evaluating reading comprehension systems.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 397, + 190, + 409 + ], + "spans": [ + { + "bbox": [ + 116, + 397, + 190, + 409 + ], + "score": 1.0, + "content": "In EMNLP, 2017.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 107, + 416, + 504, + 439 + ], + "lines": [ + { + "bbox": [ + 105, + 415, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 505, + 429 + ], + "score": 1.0, + "content": "Alexey Kurakin, Ian Goodfellow, and Samy Bengio. Adversarial machine learning at scale. In ICLR,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 114, + 426, + 143, + 440 + ], + "spans": [ + { + "bbox": [ + 114, + 426, + 143, + 440 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 106, + 446, + 505, + 470 + ], + "lines": [ + { + "bbox": [ + 106, + 445, + 505, + 460 + ], + "spans": [ + { + "bbox": [ + 106, + 445, + 505, + 460 + ], + "score": 1.0, + "content": "Guokun Lai, Qizhe Xie, Hanxiao Liu, Yiming Yang, and Eduard Hovy. Race: Large-scale reading", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 457, + 453, + 469 + ], + "spans": [ + { + "bbox": [ + 115, + 457, + 453, + 469 + ], + "score": 1.0, + "content": "comprehension dataset from examinations. arXiv preprint arXiv:1704.04683, 2017.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 107, + 476, + 505, + 500 + ], + "lines": [ + { + "bbox": [ + 106, + 476, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 106, + 476, + 505, + 489 + ], + "score": 1.0, + "content": "Zhenzhong Lan, Mingda Chen, Sebastian Goodman, Kevin Gimpel, Piyush Sharma, and Radu Sori-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 487, + 487, + 501 + ], + "spans": [ + { + "bbox": [ + 116, + 487, + 487, + 501 + ], + "score": 1.0, + "content": "cut. Albert: A lite bert for self-supervised learning of language representations. ICLR, 2020.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 106, + 506, + 505, + 530 + ], + "lines": [ + { + "bbox": [ + 106, + 506, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 505, + 519 + ], + "score": 1.0, + "content": "Hector J Levesque, Ernest Davis, and Leora Morgenstern. The Winograd schema challenge. In", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 518, + 459, + 530 + ], + "spans": [ + { + "bbox": [ + 115, + 518, + 459, + 530 + ], + "score": 1.0, + "content": "AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning, 2011.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 106, + 536, + 504, + 560 + ], + "lines": [ + { + "bbox": [ + 106, + 536, + 504, + 549 + ], + "spans": [ + { + "bbox": [ + 106, + 536, + 504, + 549 + ], + "score": 1.0, + "content": "Xiaodong Liu, Pengcheng He, Weizhu Chen, and Jianfeng Gao. Multi-task deep neural networks", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 548, + 324, + 560 + ], + "spans": [ + { + "bbox": [ + 116, + 548, + 324, + 560 + ], + "score": 1.0, + "content": "for natural language understanding. In ACL, 2019a.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 109, + 566, + 504, + 601 + ], + "lines": [ + { + "bbox": [ + 106, + 566, + 506, + 580 + ], + "spans": [ + { + "bbox": [ + 106, + 566, + 506, + 580 + ], + "score": 1.0, + "content": "Yinhan Liu, Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen, Omer Levy, Mike", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 114, + 577, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 114, + 577, + 505, + 592 + ], + "score": 1.0, + "content": "Lewis, Luke Zettlemoyer, and Veselin Stoyanov. Roberta: A robustly optimized bert pretraining", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 590, + 326, + 601 + ], + "spans": [ + { + "bbox": [ + 116, + 590, + 326, + 601 + ], + "score": 1.0, + "content": "approach. arXiv preprint arXiv:1907.11692, 2019b.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 105, + 608, + 503, + 631 + ], + "lines": [ + { + "bbox": [ + 106, + 609, + 504, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 609, + 504, + 620 + ], + "score": 1.0, + "content": "Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 620, + 428, + 630 + ], + "spans": [ + { + "bbox": [ + 116, + 620, + 428, + 630 + ], + "score": 1.0, + "content": "Towards deep learning models resistant to adversarial attacks. In ICLR, 2018.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5 + }, + { + "type": "text", + "bbox": [ + 108, + 638, + 504, + 672 + ], + "lines": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "Todor Mihaylov, Peter Clark, Tushar Khot, and Ashish Sabharwal. Can a suit of armor conduct", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 649, + 505, + 663 + ], + "spans": [ + { + "bbox": [ + 115, + 649, + 505, + 663 + ], + "score": 1.0, + "content": "electricity? a new dataset for open book question answering. arXiv preprint arXiv:1809.02789,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 114, + 659, + 143, + 672 + ], + "spans": [ + { + "bbox": [ + 114, + 659, + 143, + 672 + ], + "score": 1.0, + "content": "2018.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 107, + 679, + 502, + 702 + ], + "lines": [ + { + "bbox": [ + 106, + 679, + 504, + 692 + ], + "spans": [ + { + "bbox": [ + 106, + 679, + 504, + 692 + ], + "score": 1.0, + "content": "Takeru Miyato, Andrew M Dai, and Ian Goodfellow. Adversarial training methods for semi-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 691, + 299, + 702 + ], + "spans": [ + { + "bbox": [ + 116, + 691, + 299, + 702 + ], + "score": 1.0, + "content": "supervised text classification. In ICLR, 2017.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5 + }, + { + "type": "text", + "bbox": [ + 108, + 709, + 502, + 732 + ], + "lines": [ + { + "bbox": [ + 107, + 709, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 107, + 709, + 504, + 722 + ], + "score": 1.0, + "content": "Takeru Miyato, Shin-ichi Maeda, Masanori Koyama, and Shin Ishii. Virtual adversarial training: A", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 721, + 447, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 721, + 447, + 732 + ], + "score": 1.0, + "content": "regularization method for supervised and semi-supervised learning. TPAMI, 2019.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43.5 + } + ], + "page_idx": 9, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 294, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "10", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 504, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 504, + 96 + ], + "score": 1.0, + "content": "William B Dolan and Chris Brockett. Automatically constructing a corpus of sentential paraphrases.", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 398, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 398, + 106 + ], + "score": 1.0, + "content": "In Proceedings of the International Workshop on Paraphrasing, 2005.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 106, + 81, + 504, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 112, + 503, + 146 + ], + "lines": [ + { + "bbox": [ + 106, + 113, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 113, + 505, + 125 + ], + "score": 1.0, + "content": "Sanghamitra Dutta, Gauri Joshi, Soumyadip Ghosh, Parijat Dube, and Priya Nagpurkar. Slow and", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 122, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 115, + 122, + 505, + 137 + ], + "score": 1.0, + "content": "stale gradients can win the race: Error-runtime trade-offs in distributed sgd. In AISTATS, pp.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 135, + 181, + 146 + ], + "spans": [ + { + "bbox": [ + 116, + 135, + 181, + 146 + ], + "score": 1.0, + "content": "803–812, 2018.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3, + "bbox_fs": [ + 106, + 113, + 505, + 146 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 153, + 504, + 176 + ], + "lines": [ + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "score": 1.0, + "content": "Javid Ebrahimi, Anyi Rao, Daniel Lowd, and Dejing Dou. HotFlip: White-box adversarial examples", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 164, + 264, + 176 + ], + "spans": [ + { + "bbox": [ + 116, + 164, + 264, + 176 + ], + "score": 1.0, + "content": "for text classification. In ACL, 2018.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 153, + 505, + 176 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 183, + 504, + 207 + ], + "lines": [ + { + "bbox": [ + 105, + 182, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 505, + 198 + ], + "score": 1.0, + "content": "Yarin Gal and Zoubin Ghahramani. A theoretically grounded application of dropout in recurrent", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 195, + 262, + 206 + ], + "spans": [ + { + "bbox": [ + 115, + 195, + 262, + 206 + ], + "score": 1.0, + "content": "neural networks. In NeurIPS, 2016.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 182, + 505, + 206 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 213, + 506, + 248 + ], + "lines": [ + { + "bbox": [ + 105, + 212, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 105, + 212, + 505, + 227 + ], + "score": 1.0, + "content": "Danilo Giampiccolo, Bernardo Magnini, Ido Dagan, and Bill Dolan. The third PASCAL recognizing", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 225, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 116, + 225, + 505, + 237 + ], + "score": 1.0, + "content": "textual entailment challenge. In Proceedings of the ACL-PASCAL workshop on textual entailment", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 236, + 218, + 248 + ], + "spans": [ + { + "bbox": [ + 115, + 236, + 218, + 248 + ], + "score": 1.0, + "content": "and paraphrasing, 2007.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 212, + 505, + 248 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 254, + 504, + 278 + ], + "lines": [ + { + "bbox": [ + 105, + 253, + 505, + 269 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 505, + 269 + ], + "score": 1.0, + "content": "Tom Goldstein, Christoph Studer, and Richard Baraniuk. A field guide to forward-backward splitting", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 266, + 366, + 278 + ], + "spans": [ + { + "bbox": [ + 116, + 266, + 366, + 278 + ], + "score": 1.0, + "content": "with a fasta implementation. arXiv preprint 1411.3406, 2014.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 253, + 505, + 278 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 284, + 504, + 308 + ], + "lines": [ + { + "bbox": [ + 105, + 284, + 505, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 505, + 298 + ], + "score": 1.0, + "content": "Ian Goodfellow, Jonathon Shlens, and Christian Szegedy. Explaining and harnessing adversarial", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 296, + 223, + 308 + ], + "spans": [ + { + "bbox": [ + 115, + 296, + 223, + 308 + ], + "score": 1.0, + "content": "examples. In ICLR, 2015.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 284, + 505, + 308 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 315, + 505, + 349 + ], + "lines": [ + { + "bbox": [ + 106, + 314, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 106, + 315, + 354, + 327 + ], + "score": 1.0, + "content": "Shankar Iyer, Nikhil Dandekar, and Kornl Csernai.", + "type": "text" + }, + { + "bbox": [ + 374, + 314, + 505, + 328 + ], + "score": 1.0, + "content": "First quora dataset release:", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 325, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 115, + 326, + 230, + 338 + ], + "score": 1.0, + "content": "Question pairs, 2017.", + "type": "text" + }, + { + "bbox": [ + 264, + 325, + 505, + 339 + ], + "score": 1.0, + "content": "URL https://www.quora.com/q/quoradata/", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 336, + 376, + 350 + ], + "spans": [ + { + "bbox": [ + 115, + 336, + 376, + 350 + ], + "score": 1.0, + "content": "First-Quora-Dataset-Release-Question-Pairs.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17, + "bbox_fs": [ + 106, + 314, + 505, + 350 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 356, + 504, + 379 + ], + "lines": [ + { + "bbox": [ + 105, + 356, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 505, + 369 + ], + "score": 1.0, + "content": "Mohit Iyyer, John Wieting, Kevin Gimpel, and Luke Zettlemoyer. Adversarial example generation", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 367, + 392, + 379 + ], + "spans": [ + { + "bbox": [ + 116, + 367, + 392, + 379 + ], + "score": 1.0, + "content": "with syntactically controlled paraphrase networks. In NAACL, 2018.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 356, + 505, + 379 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 386, + 504, + 409 + ], + "lines": [ + { + "bbox": [ + 105, + 385, + 504, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 504, + 399 + ], + "score": 1.0, + "content": "Robin Jia and Percy Liang. Adversarial examples for evaluating reading comprehension systems.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 397, + 190, + 409 + ], + "spans": [ + { + "bbox": [ + 116, + 397, + 190, + 409 + ], + "score": 1.0, + "content": "In EMNLP, 2017.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 385, + 504, + 409 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 416, + 504, + 439 + ], + "lines": [ + { + "bbox": [ + 105, + 415, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 505, + 429 + ], + "score": 1.0, + "content": "Alexey Kurakin, Ian Goodfellow, and Samy Bengio. Adversarial machine learning at scale. In ICLR,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 114, + 426, + 143, + 440 + ], + "spans": [ + { + "bbox": [ + 114, + 426, + 143, + 440 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 415, + 505, + 440 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 446, + 505, + 470 + ], + "lines": [ + { + "bbox": [ + 106, + 445, + 505, + 460 + ], + "spans": [ + { + "bbox": [ + 106, + 445, + 505, + 460 + ], + "score": 1.0, + "content": "Guokun Lai, Qizhe Xie, Hanxiao Liu, Yiming Yang, and Eduard Hovy. Race: Large-scale reading", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 457, + 453, + 469 + ], + "spans": [ + { + "bbox": [ + 115, + 457, + 453, + 469 + ], + "score": 1.0, + "content": "comprehension dataset from examinations. arXiv preprint arXiv:1704.04683, 2017.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 106, + 445, + 505, + 469 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 476, + 505, + 500 + ], + "lines": [ + { + "bbox": [ + 106, + 476, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 106, + 476, + 505, + 489 + ], + "score": 1.0, + "content": "Zhenzhong Lan, Mingda Chen, Sebastian Goodman, Kevin Gimpel, Piyush Sharma, and Radu Sori-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 487, + 487, + 501 + ], + "spans": [ + { + "bbox": [ + 116, + 487, + 487, + 501 + ], + "score": 1.0, + "content": "cut. Albert: A lite bert for self-supervised learning of language representations. ICLR, 2020.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 106, + 476, + 505, + 501 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 506, + 505, + 530 + ], + "lines": [ + { + "bbox": [ + 106, + 506, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 505, + 519 + ], + "score": 1.0, + "content": "Hector J Levesque, Ernest Davis, and Leora Morgenstern. The Winograd schema challenge. In", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 518, + 459, + 530 + ], + "spans": [ + { + "bbox": [ + 115, + 518, + 459, + 530 + ], + "score": 1.0, + "content": "AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning, 2011.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 106, + 506, + 505, + 530 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 536, + 504, + 560 + ], + "lines": [ + { + "bbox": [ + 106, + 536, + 504, + 549 + ], + "spans": [ + { + "bbox": [ + 106, + 536, + 504, + 549 + ], + "score": 1.0, + "content": "Xiaodong Liu, Pengcheng He, Weizhu Chen, and Jianfeng Gao. Multi-task deep neural networks", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 548, + 324, + 560 + ], + "spans": [ + { + "bbox": [ + 116, + 548, + 324, + 560 + ], + "score": 1.0, + "content": "for natural language understanding. In ACL, 2019a.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 106, + 536, + 504, + 560 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 566, + 504, + 601 + ], + "lines": [ + { + "bbox": [ + 106, + 566, + 506, + 580 + ], + "spans": [ + { + "bbox": [ + 106, + 566, + 506, + 580 + ], + "score": 1.0, + "content": "Yinhan Liu, Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen, Omer Levy, Mike", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 114, + 577, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 114, + 577, + 505, + 592 + ], + "score": 1.0, + "content": "Lewis, Luke Zettlemoyer, and Veselin Stoyanov. Roberta: A robustly optimized bert pretraining", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 590, + 326, + 601 + ], + "spans": [ + { + "bbox": [ + 116, + 590, + 326, + 601 + ], + "score": 1.0, + "content": "approach. arXiv preprint arXiv:1907.11692, 2019b.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34, + "bbox_fs": [ + 106, + 566, + 506, + 601 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 608, + 503, + 631 + ], + "lines": [ + { + "bbox": [ + 106, + 609, + 504, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 609, + 504, + 620 + ], + "score": 1.0, + "content": "Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 620, + 428, + 630 + ], + "spans": [ + { + "bbox": [ + 116, + 620, + 428, + 630 + ], + "score": 1.0, + "content": "Towards deep learning models resistant to adversarial attacks. In ICLR, 2018.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5, + "bbox_fs": [ + 106, + 609, + 504, + 630 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 638, + 504, + 672 + ], + "lines": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "Todor Mihaylov, Peter Clark, Tushar Khot, and Ashish Sabharwal. Can a suit of armor conduct", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 649, + 505, + 663 + ], + "spans": [ + { + "bbox": [ + 115, + 649, + 505, + 663 + ], + "score": 1.0, + "content": "electricity? a new dataset for open book question answering. arXiv preprint arXiv:1809.02789,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 114, + 659, + 143, + 672 + ], + "spans": [ + { + "bbox": [ + 114, + 659, + 143, + 672 + ], + "score": 1.0, + "content": "2018.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39, + "bbox_fs": [ + 106, + 638, + 505, + 672 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 679, + 502, + 702 + ], + "lines": [ + { + "bbox": [ + 106, + 679, + 504, + 692 + ], + "spans": [ + { + "bbox": [ + 106, + 679, + 504, + 692 + ], + "score": 1.0, + "content": "Takeru Miyato, Andrew M Dai, and Ian Goodfellow. Adversarial training methods for semi-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 691, + 299, + 702 + ], + "spans": [ + { + "bbox": [ + 116, + 691, + 299, + 702 + ], + "score": 1.0, + "content": "supervised text classification. In ICLR, 2017.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5, + "bbox_fs": [ + 106, + 679, + 504, + 702 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 709, + 502, + 732 + ], + "lines": [ + { + "bbox": [ + 107, + 709, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 107, + 709, + 504, + 722 + ], + "score": 1.0, + "content": "Takeru Miyato, Shin-ichi Maeda, Masanori Koyama, and Shin Ishii. Virtual adversarial training: A", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 721, + 447, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 721, + 447, + 732 + ], + "score": 1.0, + "content": "regularization method for supervised and semi-supervised learning. TPAMI, 2019.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43.5, + "bbox_fs": [ + 107, + 709, + 504, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 107, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 107, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Chongli Qin, James Martens, Sven Gowal, Dilip Krishnan, Alhussein Fawzi, Soham De, Robert", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 505, + 105 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 505, + 105 + ], + "score": 1.0, + "content": "Stanforth, Pushmeet Kohli, et al. Adversarial robustness through local linearization. In NeurIPS,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 103, + 143, + 117 + ], + "spans": [ + { + "bbox": [ + 115, + 103, + 143, + 117 + ], + "score": 1.0, + "content": "2019.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 108, + 124, + 503, + 158 + ], + "lines": [ + { + "bbox": [ + 105, + 122, + 505, + 138 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 505, + 138 + ], + "score": 1.0, + "content": "Colin Raffel, Noam Shazeer, Adam Roberts, Katherine Lee, Sharan Narang, Michael Matena, Yanqi", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 135, + 505, + 147 + ], + "spans": [ + { + "bbox": [ + 115, + 135, + 505, + 147 + ], + "score": 1.0, + "content": "Zhou, Wei Li, and Peter J Liu. Exploring the limits of transfer learning with a unified text-to-text", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 146, + 305, + 159 + ], + "spans": [ + { + "bbox": [ + 116, + 146, + 305, + 159 + ], + "score": 1.0, + "content": "transformer. arXiv preprint 1910.10683, 2019.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 165, + 503, + 189 + ], + "lines": [ + { + "bbox": [ + 105, + 165, + 505, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 424, + 179 + ], + "score": 1.0, + "content": "Pranav Rajpurkar, Jian Zhang, Konstantin Lopyrev, and Percy Liang. SQuAD:", + "type": "text" + }, + { + "bbox": [ + 425, + 166, + 464, + 177 + ], + "score": 0.48, + "content": "1 0 0 { , } 0 0 0 { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 165, + 505, + 179 + ], + "score": 1.0, + "content": "questions", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 176, + 335, + 189 + ], + "spans": [ + { + "bbox": [ + 115, + 176, + 335, + 189 + ], + "score": 1.0, + "content": "for machine comprehension of text. In EMNLP, 2016.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 106, + 196, + 504, + 219 + ], + "lines": [ + { + "bbox": [ + 105, + 196, + 504, + 209 + ], + "spans": [ + { + "bbox": [ + 105, + 196, + 504, + 209 + ], + "score": 1.0, + "content": "Marco Tulio Ribeiro, Sameer Singh, and Carlos Guestrin. Semantically equivalent adversarial rules", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 207, + 289, + 219 + ], + "spans": [ + { + "bbox": [ + 116, + 207, + 289, + 219 + ], + "score": 1.0, + "content": "for debugging NLP models. In ACL, 2018.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 106, + 227, + 504, + 250 + ], + "lines": [ + { + "bbox": [ + 105, + 226, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 505, + 240 + ], + "score": 1.0, + "content": "Parsa Saadatpanah, Ali Shafahi, and Tom Goldstein. Adversarial attacks on copyright detection", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 238, + 291, + 250 + ], + "spans": [ + { + "bbox": [ + 115, + 238, + 291, + 250 + ], + "score": 1.0, + "content": "systems. arXiv preprint 1906.07153, 2019.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 106, + 257, + 504, + 281 + ], + "lines": [ + { + "bbox": [ + 106, + 258, + 504, + 269 + ], + "spans": [ + { + "bbox": [ + 106, + 258, + 504, + 269 + ], + "score": 1.0, + "content": "Rico Sennrich, Barry Haddow, and Alexandra Birch. Neural machine translation of rare words with", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 269, + 237, + 280 + ], + "spans": [ + { + "bbox": [ + 116, + 269, + 237, + 280 + ], + "score": 1.0, + "content": "subword units. In ACL, 2016.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 103, + 288, + 504, + 311 + ], + "lines": [ + { + "bbox": [ + 105, + 288, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 505, + 302 + ], + "score": 1.0, + "content": "A. Shafahi, M. Najibi, A. Ghiasi, Z. Xu, J. Dickerson, C. Studer, L. Davis, G. Taylor, and T. Gold-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 299, + 342, + 312 + ], + "spans": [ + { + "bbox": [ + 115, + 299, + 342, + 312 + ], + "score": 1.0, + "content": "stein. Adversarial Training for Free! In NeurIPS, 2019.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 106, + 318, + 503, + 353 + ], + "lines": [ + { + "bbox": [ + 105, + 317, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 317, + 505, + 334 + ], + "score": 1.0, + "content": "Richard Socher, Alex Perelygin, Jean Wu, Jason Chuang, Christopher D Manning, Andrew Ng,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 330, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 115, + 330, + 505, + 343 + ], + "score": 1.0, + "content": "and Christopher Potts. Recursive deep models for semantic compositionality over a sentiment", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 342, + 230, + 353 + ], + "spans": [ + { + "bbox": [ + 116, + 342, + 230, + 353 + ], + "score": 1.0, + "content": "treebank. In EMNLP, 2013.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 104, + 360, + 504, + 384 + ], + "lines": [ + { + "bbox": [ + 105, + 360, + 505, + 373 + ], + "spans": [ + { + "bbox": [ + 105, + 360, + 505, + 373 + ], + "score": 1.0, + "content": "Jure Sokolic, Raja Giryes, Guillermo Sapiro, and Miguel Rodrigues. Generalization error of invari-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 372, + 253, + 383 + ], + "spans": [ + { + "bbox": [ + 115, + 372, + 253, + 383 + ], + "score": 1.0, + "content": "ant classifiers. In AISTATS, 2017.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 104, + 391, + 504, + 414 + ], + "lines": [ + { + "bbox": [ + 105, + 390, + 506, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 506, + 405 + ], + "score": 1.0, + "content": "Robert Speer, Joshua Chin, and Catherine Havasi. Conceptnet 5.5: An open multilingual graph of", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 403, + 261, + 414 + ], + "spans": [ + { + "bbox": [ + 115, + 403, + 261, + 414 + ], + "score": 1.0, + "content": "general knowledge. In AAAI, 2017.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 107, + 421, + 503, + 446 + ], + "lines": [ + { + "bbox": [ + 105, + 422, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 422, + 505, + 435 + ], + "score": 1.0, + "content": "Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 433, + 445, + 446 + ], + "spans": [ + { + "bbox": [ + 116, + 433, + 445, + 446 + ], + "score": 1.0, + "content": "Dropout: A simple way to prevent neural networks from overfitting. JMLR, 2014.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 106, + 452, + 503, + 476 + ], + "lines": [ + { + "bbox": [ + 105, + 451, + 505, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 451, + 505, + 466 + ], + "score": 1.0, + "content": "Kai Sun, Dian Yu, Dong Yu, and Claire Cardie. Improving machine reading comprehension with", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 464, + 387, + 477 + ], + "spans": [ + { + "bbox": [ + 115, + 464, + 387, + 477 + ], + "score": 1.0, + "content": "general reading strategies. arXiv preprint arXiv:1810.13441, 2018.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 106, + 483, + 504, + 506 + ], + "lines": [ + { + "bbox": [ + 106, + 483, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 505, + 497 + ], + "score": 1.0, + "content": "Alon Talmor, Jonathan Herzig, Nicholas Lourie, and Jonathan Berant. Commonsenseqa: A question", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 494, + 418, + 508 + ], + "spans": [ + { + "bbox": [ + 115, + 494, + 418, + 508 + ], + "score": 1.0, + "content": "answering challenge targeting commonsense knowledge. In NAACL, 2019.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 106, + 514, + 505, + 548 + ], + "lines": [ + { + "bbox": [ + 105, + 513, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 505, + 527 + ], + "score": 1.0, + "content": "Alex Wang, Amanpreet Singh, Julian Michael, Felix Hill, Omer Levy, and Samuel R Bowman.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 116, + 524, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 116, + 524, + 505, + 538 + ], + "score": 1.0, + "content": "Glue: A multi-task benchmark and analysis platform for natural language understanding. In", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 536, + 168, + 548 + ], + "spans": [ + { + "bbox": [ + 116, + 536, + 168, + 548 + ], + "score": 1.0, + "content": "ICLR, 2019.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 105, + 556, + 504, + 579 + ], + "lines": [ + { + "bbox": [ + 105, + 554, + 505, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 505, + 569 + ], + "score": 1.0, + "content": "Alex Warstadt, Amanpreet Singh, and Samuel R. Bowman. Neural network acceptability judgments.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 566, + 253, + 579 + ], + "spans": [ + { + "bbox": [ + 115, + 566, + 253, + 579 + ], + "score": 1.0, + "content": "arXiv preprint 1805.12471, 2018.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 105, + 586, + 504, + 610 + ], + "lines": [ + { + "bbox": [ + 105, + 586, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 505, + 600 + ], + "score": 1.0, + "content": "Adina Williams, Nikita Nangia, and Samuel R. Bowman. A broad-coverage challenge corpus for", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 598, + 360, + 610 + ], + "spans": [ + { + "bbox": [ + 115, + 598, + 360, + 610 + ], + "score": 1.0, + "content": "sentence understanding through inference. In NAACL, 2018.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 108, + 617, + 504, + 651 + ], + "lines": [ + { + "bbox": [ + 105, + 615, + 506, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 632 + ], + "score": 1.0, + "content": "Chaowei Xiao, Ruizhi Deng, Bo Li, Fisher Yu, Mingyan Liu, and Dawn Song. Characterizing", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 628, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 116, + 628, + 505, + 640 + ], + "score": 1.0, + "content": "adversarial examples based on spatial consistency information for semantic segmentation. In", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 639, + 172, + 651 + ], + "spans": [ + { + "bbox": [ + 116, + 639, + 172, + 651 + ], + "score": 1.0, + "content": "ECCV, 2018.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 106, + 659, + 504, + 681 + ], + "lines": [ + { + "bbox": [ + 105, + 656, + 506, + 674 + ], + "spans": [ + { + "bbox": [ + 105, + 656, + 506, + 674 + ], + "score": 1.0, + "content": "Cihang Xie, Yuxin Wu, Laurens van der Maaten, Alan L. Yuille, and Kaiming He. Feature denoising", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 669, + 334, + 682 + ], + "spans": [ + { + "bbox": [ + 116, + 669, + 334, + 682 + ], + "score": 1.0, + "content": "for improving adversarial robustness. In CVPR, 2019.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5 + }, + { + "type": "text", + "bbox": [ + 106, + 689, + 446, + 702 + ], + "lines": [ + { + "bbox": [ + 105, + 689, + 447, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 447, + 703 + ], + "score": 1.0, + "content": "Huan Xu and Shie Mannor. Robustness and generalization. Machine learning, 2012.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 108, + 709, + 502, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 504, + 722 + ], + "score": 1.0, + "content": "Zhilin Yang, Zihang Dai, Yiming Yang, Jaime Carbonell, Ruslan Salakhutdinov, and Quoc V Le.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 720, + 491, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 491, + 732 + ], + "score": 1.0, + "content": "Xlnet: Generalized autoregressive pretraining for language understanding. In NeurIPS, 2019.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5 + } + ], + "page_idx": 10, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 294, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 107, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 107, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Chongli Qin, James Martens, Sven Gowal, Dilip Krishnan, Alhussein Fawzi, Soham De, Robert", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 505, + 105 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 505, + 105 + ], + "score": 1.0, + "content": "Stanforth, Pushmeet Kohli, et al. Adversarial robustness through local linearization. In NeurIPS,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 103, + 143, + 117 + ], + "spans": [ + { + "bbox": [ + 115, + 103, + 143, + 117 + ], + "score": 1.0, + "content": "2019.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 107, + 82, + 505, + 117 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 124, + 503, + 158 + ], + "lines": [ + { + "bbox": [ + 105, + 122, + 505, + 138 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 505, + 138 + ], + "score": 1.0, + "content": "Colin Raffel, Noam Shazeer, Adam Roberts, Katherine Lee, Sharan Narang, Michael Matena, Yanqi", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 135, + 505, + 147 + ], + "spans": [ + { + "bbox": [ + 115, + 135, + 505, + 147 + ], + "score": 1.0, + "content": "Zhou, Wei Li, and Peter J Liu. Exploring the limits of transfer learning with a unified text-to-text", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 146, + 305, + 159 + ], + "spans": [ + { + "bbox": [ + 116, + 146, + 305, + 159 + ], + "score": 1.0, + "content": "transformer. arXiv preprint 1910.10683, 2019.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 122, + 505, + 159 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 165, + 503, + 189 + ], + "lines": [ + { + "bbox": [ + 105, + 165, + 505, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 424, + 179 + ], + "score": 1.0, + "content": "Pranav Rajpurkar, Jian Zhang, Konstantin Lopyrev, and Percy Liang. SQuAD:", + "type": "text" + }, + { + "bbox": [ + 425, + 166, + 464, + 177 + ], + "score": 0.48, + "content": "1 0 0 { , } 0 0 0 { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 165, + 505, + 179 + ], + "score": 1.0, + "content": "questions", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 176, + 335, + 189 + ], + "spans": [ + { + "bbox": [ + 115, + 176, + 335, + 189 + ], + "score": 1.0, + "content": "for machine comprehension of text. In EMNLP, 2016.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 105, + 165, + 505, + 189 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 196, + 504, + 219 + ], + "lines": [ + { + "bbox": [ + 105, + 196, + 504, + 209 + ], + "spans": [ + { + "bbox": [ + 105, + 196, + 504, + 209 + ], + "score": 1.0, + "content": "Marco Tulio Ribeiro, Sameer Singh, and Carlos Guestrin. Semantically equivalent adversarial rules", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 207, + 289, + 219 + ], + "spans": [ + { + "bbox": [ + 116, + 207, + 289, + 219 + ], + "score": 1.0, + "content": "for debugging NLP models. In ACL, 2018.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 196, + 504, + 219 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 227, + 504, + 250 + ], + "lines": [ + { + "bbox": [ + 105, + 226, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 505, + 240 + ], + "score": 1.0, + "content": "Parsa Saadatpanah, Ali Shafahi, and Tom Goldstein. Adversarial attacks on copyright detection", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 238, + 291, + 250 + ], + "spans": [ + { + "bbox": [ + 115, + 238, + 291, + 250 + ], + "score": 1.0, + "content": "systems. arXiv preprint 1906.07153, 2019.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 226, + 505, + 250 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 257, + 504, + 281 + ], + "lines": [ + { + "bbox": [ + 106, + 258, + 504, + 269 + ], + "spans": [ + { + "bbox": [ + 106, + 258, + 504, + 269 + ], + "score": 1.0, + "content": "Rico Sennrich, Barry Haddow, and Alexandra Birch. Neural machine translation of rare words with", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 269, + 237, + 280 + ], + "spans": [ + { + "bbox": [ + 116, + 269, + 237, + 280 + ], + "score": 1.0, + "content": "subword units. In ACL, 2016.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 106, + 258, + 504, + 280 + ] + }, + { + "type": "text", + "bbox": [ + 103, + 288, + 504, + 311 + ], + "lines": [ + { + "bbox": [ + 105, + 288, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 505, + 302 + ], + "score": 1.0, + "content": "A. Shafahi, M. Najibi, A. Ghiasi, Z. Xu, J. Dickerson, C. Studer, L. Davis, G. Taylor, and T. Gold-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 299, + 342, + 312 + ], + "spans": [ + { + "bbox": [ + 115, + 299, + 342, + 312 + ], + "score": 1.0, + "content": "stein. Adversarial Training for Free! In NeurIPS, 2019.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 288, + 505, + 312 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 318, + 503, + 353 + ], + "lines": [ + { + "bbox": [ + 105, + 317, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 317, + 505, + 334 + ], + "score": 1.0, + "content": "Richard Socher, Alex Perelygin, Jean Wu, Jason Chuang, Christopher D Manning, Andrew Ng,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 330, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 115, + 330, + 505, + 343 + ], + "score": 1.0, + "content": "and Christopher Potts. Recursive deep models for semantic compositionality over a sentiment", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 342, + 230, + 353 + ], + "spans": [ + { + "bbox": [ + 116, + 342, + 230, + 353 + ], + "score": 1.0, + "content": "treebank. In EMNLP, 2013.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 317, + 505, + 353 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 360, + 504, + 384 + ], + "lines": [ + { + "bbox": [ + 105, + 360, + 505, + 373 + ], + "spans": [ + { + "bbox": [ + 105, + 360, + 505, + 373 + ], + "score": 1.0, + "content": "Jure Sokolic, Raja Giryes, Guillermo Sapiro, and Miguel Rodrigues. Generalization error of invari-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 372, + 253, + 383 + ], + "spans": [ + { + "bbox": [ + 115, + 372, + 253, + 383 + ], + "score": 1.0, + "content": "ant classifiers. In AISTATS, 2017.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 360, + 505, + 383 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 391, + 504, + 414 + ], + "lines": [ + { + "bbox": [ + 105, + 390, + 506, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 506, + 405 + ], + "score": 1.0, + "content": "Robert Speer, Joshua Chin, and Catherine Havasi. Conceptnet 5.5: An open multilingual graph of", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 403, + 261, + 414 + ], + "spans": [ + { + "bbox": [ + 115, + 403, + 261, + 414 + ], + "score": 1.0, + "content": "general knowledge. In AAAI, 2017.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 390, + 506, + 414 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 421, + 503, + 446 + ], + "lines": [ + { + "bbox": [ + 105, + 422, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 422, + 505, + 435 + ], + "score": 1.0, + "content": "Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 433, + 445, + 446 + ], + "spans": [ + { + "bbox": [ + 116, + 433, + 445, + 446 + ], + "score": 1.0, + "content": "Dropout: A simple way to prevent neural networks from overfitting. JMLR, 2014.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 422, + 505, + 446 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 452, + 503, + 476 + ], + "lines": [ + { + "bbox": [ + 105, + 451, + 505, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 451, + 505, + 466 + ], + "score": 1.0, + "content": "Kai Sun, Dian Yu, Dong Yu, and Claire Cardie. Improving machine reading comprehension with", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 464, + 387, + 477 + ], + "spans": [ + { + "bbox": [ + 115, + 464, + 387, + 477 + ], + "score": 1.0, + "content": "general reading strategies. arXiv preprint arXiv:1810.13441, 2018.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 451, + 505, + 477 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 483, + 504, + 506 + ], + "lines": [ + { + "bbox": [ + 106, + 483, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 505, + 497 + ], + "score": 1.0, + "content": "Alon Talmor, Jonathan Herzig, Nicholas Lourie, and Jonathan Berant. Commonsenseqa: A question", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 494, + 418, + 508 + ], + "spans": [ + { + "bbox": [ + 115, + 494, + 418, + 508 + ], + "score": 1.0, + "content": "answering challenge targeting commonsense knowledge. In NAACL, 2019.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 106, + 483, + 505, + 508 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 514, + 505, + 548 + ], + "lines": [ + { + "bbox": [ + 105, + 513, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 505, + 527 + ], + "score": 1.0, + "content": "Alex Wang, Amanpreet Singh, Julian Michael, Felix Hill, Omer Levy, and Samuel R Bowman.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 116, + 524, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 116, + 524, + 505, + 538 + ], + "score": 1.0, + "content": "Glue: A multi-task benchmark and analysis platform for natural language understanding. In", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 536, + 168, + 548 + ], + "spans": [ + { + "bbox": [ + 116, + 536, + 168, + 548 + ], + "score": 1.0, + "content": "ICLR, 2019.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 513, + 505, + 548 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 556, + 504, + 579 + ], + "lines": [ + { + "bbox": [ + 105, + 554, + 505, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 505, + 569 + ], + "score": 1.0, + "content": "Alex Warstadt, Amanpreet Singh, and Samuel R. Bowman. Neural network acceptability judgments.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 566, + 253, + 579 + ], + "spans": [ + { + "bbox": [ + 115, + 566, + 253, + 579 + ], + "score": 1.0, + "content": "arXiv preprint 1805.12471, 2018.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 554, + 505, + 579 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 586, + 504, + 610 + ], + "lines": [ + { + "bbox": [ + 105, + 586, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 505, + 600 + ], + "score": 1.0, + "content": "Adina Williams, Nikita Nangia, and Samuel R. Bowman. A broad-coverage challenge corpus for", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 598, + 360, + 610 + ], + "spans": [ + { + "bbox": [ + 115, + 598, + 360, + 610 + ], + "score": 1.0, + "content": "sentence understanding through inference. In NAACL, 2018.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5, + "bbox_fs": [ + 105, + 586, + 505, + 610 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 617, + 504, + 651 + ], + "lines": [ + { + "bbox": [ + 105, + 615, + 506, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 632 + ], + "score": 1.0, + "content": "Chaowei Xiao, Ruizhi Deng, Bo Li, Fisher Yu, Mingyan Liu, and Dawn Song. Characterizing", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 628, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 116, + 628, + 505, + 640 + ], + "score": 1.0, + "content": "adversarial examples based on spatial consistency information for semantic segmentation. In", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 639, + 172, + 651 + ], + "spans": [ + { + "bbox": [ + 116, + 639, + 172, + 651 + ], + "score": 1.0, + "content": "ECCV, 2018.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 615, + 506, + 651 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 659, + 504, + 681 + ], + "lines": [ + { + "bbox": [ + 105, + 656, + 506, + 674 + ], + "spans": [ + { + "bbox": [ + 105, + 656, + 506, + 674 + ], + "score": 1.0, + "content": "Cihang Xie, Yuxin Wu, Laurens van der Maaten, Alan L. Yuille, and Kaiming He. Feature denoising", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 669, + 334, + 682 + ], + "spans": [ + { + "bbox": [ + 116, + 669, + 334, + 682 + ], + "score": 1.0, + "content": "for improving adversarial robustness. In CVPR, 2019.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 656, + 506, + 682 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 689, + 446, + 702 + ], + "lines": [ + { + "bbox": [ + 105, + 689, + 447, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 447, + 703 + ], + "score": 1.0, + "content": "Huan Xu and Shie Mannor. Robustness and generalization. Machine learning, 2012.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 689, + 447, + 703 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 709, + 502, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 504, + 722 + ], + "score": 1.0, + "content": "Zhilin Yang, Zihang Dai, Yiming Yang, Jaime Carbonell, Ruslan Salakhutdinov, and Quoc V Le.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 720, + 491, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 491, + 732 + ], + "score": 1.0, + "content": "Xlnet: Generalized autoregressive pretraining for language understanding. In NeurIPS, 2019.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5, + "bbox_fs": [ + 106, + 709, + 504, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Dinghuai Zhang, Tianyuan Zhang, Yiping Lu, Zhanxing Zhu, and Bin Dong. You only propagate", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 433, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 433, + 106 + ], + "score": 1.0, + "content": "once: Painless adversarial training using maximal principle. In NeurIPS, 2019.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 112, + 504, + 135 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 506, + 125 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 506, + 125 + ], + "score": 1.0, + "content": "Zhengli Zhao, Dheeru Dua, and Sameer Singh. Generating natural adversarial examples. In ICLR,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 114, + 122, + 143, + 136 + ], + "spans": [ + { + "bbox": [ + 114, + 122, + 143, + 136 + ], + "score": 1.0, + "content": "2018.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + } + ], + "page_idx": 11, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 294, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "12", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Dinghuai Zhang, Tianyuan Zhang, Yiping Lu, Zhanxing Zhu, and Bin Dong. You only propagate", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 433, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 433, + 106 + ], + "score": 1.0, + "content": "once: Painless adversarial training using maximal principle. In NeurIPS, 2019.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 505, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 112, + 504, + 135 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 506, + 125 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 506, + 125 + ], + "score": 1.0, + "content": "Zhengli Zhao, Dheeru Dua, and Sameer Singh. Generating natural adversarial examples. In ICLR,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 114, + 122, + 143, + 136 + ], + "spans": [ + { + "bbox": [ + 114, + 122, + 143, + 136 + ], + "score": 1.0, + "content": "2018.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 111, + 506, + 136 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 327, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 329, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 329, + 95 + ], + "score": 1.0, + "content": "A ADDITIONAL EXPERIMENTAL DETAILS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "title", + "bbox": [ + 108, + 106, + 247, + 117 + ], + "lines": [ + { + "bbox": [ + 106, + 105, + 248, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 248, + 119 + ], + "score": 1.0, + "content": "A.1 PROBLEM FORMULATIONS", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 107, + 127, + 504, + 149 + ], + "lines": [ + { + "bbox": [ + 105, + 126, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 140 + ], + "score": 1.0, + "content": "For tasks with ranking loss like ARC, CommonsenseQA, WNLI and QNLI, add the perturbation to", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 137, + 370, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 370, + 151 + ], + "score": 1.0, + "content": "the concatenation of the embeddings of all question/answer pairs.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 106, + 154, + 505, + 243 + ], + "lines": [ + { + "bbox": [ + 106, + 155, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 155, + 505, + 167 + ], + "score": 1.0, + "content": "Additional tricks are required to achieve high performance on WNLI and QNLI for the GLUE", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 167, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 106, + 167, + 505, + 177 + ], + "score": 1.0, + "content": "benchmark. We use the same tricks as Liu et al. (2019b). For WNLI, we use the same WSC data", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 177, + 506, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 177, + 506, + 190 + ], + "score": 1.0, + "content": "provided by Liu et al. (2019b) for training. For testing, Liu et al. (2019b) also provided the test set", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 187, + 505, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 201 + ], + "score": 1.0, + "content": "with span annotations, but the order is different form the GLUE dataset. We re-order their test set by", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 197, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 505, + 212 + ], + "score": 1.0, + "content": "matching. For the QNLI, we follow Liu et al. (2019b) and formulate the problem as pairwise ranking", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 209, + 506, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 506, + 222 + ], + "score": 1.0, + "content": "problem, which is the same for CommonsenseQA. We find the matching pairs for both training set", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 221, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 505, + 233 + ], + "score": 1.0, + "content": "and testing set by matching the queries in the dev set. We predict “entailment” if the candidate has", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 231, + 306, + 244 + ], + "spans": [ + { + "bbox": [ + 106, + 231, + 306, + 244 + ], + "score": 1.0, + "content": "the higher score, and “not entailment” otherwise.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 7.5 + }, + { + "type": "title", + "bbox": [ + 108, + 257, + 225, + 268 + ], + "lines": [ + { + "bbox": [ + 106, + 257, + 226, + 268 + ], + "spans": [ + { + "bbox": [ + 106, + 257, + 226, + 268 + ], + "score": 1.0, + "content": "A.2 HYPER-PARAMETERS", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "table", + "bbox": [ + 137, + 281, + 474, + 330 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 137, + 281, + 474, + 330 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 137, + 281, + 474, + 330 + ], + "spans": [ + { + "bbox": [ + 137, + 281, + 474, + 330 + ], + "score": 0.98, + "html": "
MNLIQNLIQQPRTESST-2MRPCCoLASTS-B
E2E-11.5E-14.5E-11.5E-16E-14E-12E-13E-1
a1E-11E-11.5E-13E-21E-14E-22.5E-21E-1
m22232333
", + "type": "table", + "image_path": "4a6af4a2ca697bb9e27081b61d517c61fbe771acb7ab6a114f22e5ee01062b9f.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 137, + 281, + 474, + 297.3333333333333 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 137, + 297.3333333333333, + 474, + 313.66666666666663 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 137, + 313.66666666666663, + 474, + 329.99999999999994 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 197, + 338, + 414, + 350 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 195, + 337, + 415, + 352 + ], + "spans": [ + { + "bbox": [ + 195, + 337, + 415, + 352 + ], + "score": 1.0, + "content": "Table 6: Additional hyper-parameters on GLUE tasks.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + } + ], + "index": 15.0 + }, + { + "type": "text", + "bbox": [ + 106, + 364, + 505, + 453 + ], + "lines": [ + { + "bbox": [ + 105, + 363, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 493, + 378 + ], + "score": 1.0, + "content": "As other adversarial training methods, introduces three additional hyper-parameters: step size", + "type": "text" + }, + { + "bbox": [ + 493, + 367, + 501, + 375 + ], + "score": 0.66, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 363, + 506, + 378 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 376, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 201, + 388 + ], + "score": 1.0, + "content": "maximum perturbation", + "type": "text" + }, + { + "bbox": [ + 201, + 379, + 207, + 386 + ], + "score": 0.4, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 376, + 278, + 388 + ], + "score": 1.0, + "content": ", number of steps", + "type": "text" + }, + { + "bbox": [ + 279, + 378, + 288, + 386 + ], + "score": 0.65, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 376, + 505, + 388 + ], + "score": 1.0, + "content": ". For all other hyper-parameters such as learning rate", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 387, + 505, + 398 + ], + "spans": [ + { + "bbox": [ + 106, + 387, + 505, + 398 + ], + "score": 1.0, + "content": "and number of iterations, we either search in the same interval as RoBERTa (on CommonsenseQA,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 398, + 506, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 506, + 409 + ], + "score": 1.0, + "content": "ARC, and WNLI), or use exactly the same setting as RoBERTa (except for MRPC, where we find", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 407, + 506, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 201, + 421 + ], + "score": 1.0, + "content": "using a learning rate of", + "type": "text" + }, + { + "bbox": [ + 202, + 408, + 241, + 419 + ], + "score": 0.92, + "content": "5 \\times 1 0 ^ { - 6 }", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 407, + 470, + 421 + ], + "score": 1.0, + "content": "gives better results).13. We list the best combinations for", + "type": "text" + }, + { + "bbox": [ + 471, + 410, + 487, + 420 + ], + "score": 0.76, + "content": "\\alpha , \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 407, + 506, + 421 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 107, + 419, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 107, + 421, + 117, + 429 + ], + "score": 0.67, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 419, + 437, + 432 + ], + "score": 1.0, + "content": "for each of the GLUE tasks in Table 6. For WSC/WNLI, the best combination is", + "type": "text" + }, + { + "bbox": [ + 437, + 420, + 505, + 431 + ], + "score": 0.89, + "content": "\\epsilon = 1 e - 2 , \\alpha =", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 107, + 430, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 107, + 431, + 166, + 442 + ], + "score": 0.82, + "content": "5 e - 3 , m = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 430, + 244, + 443 + ], + "score": 1.0, + "content": ". Notice even when", + "type": "text" + }, + { + "bbox": [ + 244, + 432, + 278, + 441 + ], + "score": 0.86, + "content": "m \\alpha < \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 430, + 456, + 443 + ], + "score": 1.0, + "content": ", the maximum perturbation could still reach", + "type": "text" + }, + { + "bbox": [ + 457, + 433, + 462, + 441 + ], + "score": 0.64, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 430, + 506, + 443 + ], + "score": 1.0, + "content": "due to the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 441, + 195, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 195, + 453 + ], + "score": 1.0, + "content": "random initialization.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 20.5 + }, + { + "type": "title", + "bbox": [ + 106, + 469, + 370, + 482 + ], + "lines": [ + { + "bbox": [ + 104, + 468, + 371, + 484 + ], + "spans": [ + { + "bbox": [ + 104, + 468, + 371, + 484 + ], + "score": 1.0, + "content": "B VARIANCE OF MAXIMUM INCREMENT OF LOSS", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "table", + "bbox": [ + 106, + 497, + 505, + 551 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 497, + 505, + 551 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 497, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 505, + 551 + ], + "score": 0.98, + "html": "
MethodsRTECoLAMRPC
M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-3)M-Inc (R)(10-3)N-Loss(10-3)
Vanilla5.1(15087)5.3(14346)4.5(920)6.1(13118)5.7(14122)5.2(447)10.2(929)10.2(955)1.9(76)
PGD4.7(10138)4.9(1828)6.2(752)128.2(1300)130.1(893)436.1(1276)5.7(321)5.7(155)5.4(54)
FreeLB3.0(1614)2.6(11114)4.1(595)1.4(1392)1.3(6231)7.2(615)3.6(167)3.6(601)2.7(54)
", + "type": "table", + "image_path": "dc24cb509b23de841340a676916c10c0a5f0d23eba704bba7d0ecdae595f6dc7.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 106, + 497, + 505, + 515.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 106, + 515.0, + 505, + 533.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 106, + 533.0, + 505, + 551.0 + ], + "spans": [], + "index": 28 + } + ] + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 560, + 505, + 600 + ], + "lines": [ + { + "bbox": [ + 106, + 559, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 106, + 559, + 505, + 572 + ], + "score": 1.0, + "content": "Table 7: Median and Standard Deviation of the maximum increase in loss in the vicinity of the dev set samples", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 569, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 505, + 581 + ], + "score": 1.0, + "content": "for RoBERTa-Large model finetuned with different methods. Vanilla models are naturally trained RoBERTa’s.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 579, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 579, + 505, + 591 + ], + "score": 1.0, + "content": "Nat Loss is the loss value on clean samples. Notice we require all clean samples here to be correctly classified", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 589, + 416, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 589, + 416, + 601 + ], + "score": 1.0, + "content": "by all models, which results in 227, 850 and 355 samples for RTE, CoLA and MRPC.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 108, + 615, + 504, + 637 + ], + "lines": [ + { + "bbox": [ + 106, + 614, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 614, + 506, + 628 + ], + "score": 1.0, + "content": "Table 7 provides the complete results for the increment of loss in the interval, with median and", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 626, + 184, + 638 + ], + "spans": [ + { + "bbox": [ + 106, + 626, + 184, + 638 + ], + "score": 1.0, + "content": "standard deviation.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5 + }, + { + "type": "title", + "bbox": [ + 107, + 654, + 373, + 667 + ], + "lines": [ + { + "bbox": [ + 105, + 652, + 374, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 652, + 374, + 668 + ], + "score": 1.0, + "content": "C ADDITIONAL RESULTS FOR ABLATION STUDIES", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 108, + 679, + 505, + 712 + ], + "lines": [ + { + "bbox": [ + 105, + 678, + 505, + 692 + ], + "spans": [ + { + "bbox": [ + 105, + 678, + 505, + 692 + ], + "score": 1.0, + "content": "Here we provide some additional results for comparison with YOPO as complementary results to", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 689, + 506, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 506, + 703 + ], + "score": 1.0, + "content": "Table 4. We will release the complete results for comparing with YOPO and without variational", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 701, + 505, + 713 + ], + "spans": [ + { + "bbox": [ + 106, + 701, + 505, + 713 + ], + "score": 1.0, + "content": "dropout on each of the GLUE tasks in our next revision. From the current results, there is no need", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37 + } + ], + "page_idx": 12, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 114, + 721, + 427, + 732 + ], + "lines": [ + { + "bbox": [ + 115, + 718, + 428, + 735 + ], + "spans": [ + { + "bbox": [ + 115, + 718, + 428, + 735 + ], + "score": 1.0, + "content": "13https://github.com/pytorch/fairseq/blob/master/examples/roberta/README.glue.md", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 108, + 27, + 294, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "13", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 327, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 329, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 329, + 95 + ], + "score": 1.0, + "content": "A ADDITIONAL EXPERIMENTAL DETAILS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "title", + "bbox": [ + 108, + 106, + 247, + 117 + ], + "lines": [ + { + "bbox": [ + 106, + 105, + 248, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 248, + 119 + ], + "score": 1.0, + "content": "A.1 PROBLEM FORMULATIONS", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 107, + 127, + 504, + 149 + ], + "lines": [ + { + "bbox": [ + 105, + 126, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 140 + ], + "score": 1.0, + "content": "For tasks with ranking loss like ARC, CommonsenseQA, WNLI and QNLI, add the perturbation to", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 137, + 370, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 370, + 151 + ], + "score": 1.0, + "content": "the concatenation of the embeddings of all question/answer pairs.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 126, + 505, + 151 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 154, + 505, + 243 + ], + "lines": [ + { + "bbox": [ + 106, + 155, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 155, + 505, + 167 + ], + "score": 1.0, + "content": "Additional tricks are required to achieve high performance on WNLI and QNLI for the GLUE", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 167, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 106, + 167, + 505, + 177 + ], + "score": 1.0, + "content": "benchmark. We use the same tricks as Liu et al. (2019b). For WNLI, we use the same WSC data", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 177, + 506, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 177, + 506, + 190 + ], + "score": 1.0, + "content": "provided by Liu et al. (2019b) for training. For testing, Liu et al. (2019b) also provided the test set", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 187, + 505, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 201 + ], + "score": 1.0, + "content": "with span annotations, but the order is different form the GLUE dataset. We re-order their test set by", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 197, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 505, + 212 + ], + "score": 1.0, + "content": "matching. For the QNLI, we follow Liu et al. (2019b) and formulate the problem as pairwise ranking", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 209, + 506, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 506, + 222 + ], + "score": 1.0, + "content": "problem, which is the same for CommonsenseQA. We find the matching pairs for both training set", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 221, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 505, + 233 + ], + "score": 1.0, + "content": "and testing set by matching the queries in the dev set. We predict “entailment” if the candidate has", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 231, + 306, + 244 + ], + "spans": [ + { + "bbox": [ + 106, + 231, + 306, + 244 + ], + "score": 1.0, + "content": "the higher score, and “not entailment” otherwise.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 155, + 506, + 244 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 257, + 225, + 268 + ], + "lines": [ + { + "bbox": [ + 106, + 257, + 226, + 268 + ], + "spans": [ + { + "bbox": [ + 106, + 257, + 226, + 268 + ], + "score": 1.0, + "content": "A.2 HYPER-PARAMETERS", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "table", + "bbox": [ + 137, + 281, + 474, + 330 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 137, + 281, + 474, + 330 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 137, + 281, + 474, + 330 + ], + "spans": [ + { + "bbox": [ + 137, + 281, + 474, + 330 + ], + "score": 0.98, + "html": "
MNLIQNLIQQPRTESST-2MRPCCoLASTS-B
E2E-11.5E-14.5E-11.5E-16E-14E-12E-13E-1
a1E-11E-11.5E-13E-21E-14E-22.5E-21E-1
m22232333
", + "type": "table", + "image_path": "4a6af4a2ca697bb9e27081b61d517c61fbe771acb7ab6a114f22e5ee01062b9f.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 137, + 281, + 474, + 297.3333333333333 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 137, + 297.3333333333333, + 474, + 313.66666666666663 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 137, + 313.66666666666663, + 474, + 329.99999999999994 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 197, + 338, + 414, + 350 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 195, + 337, + 415, + 352 + ], + "spans": [ + { + "bbox": [ + 195, + 337, + 415, + 352 + ], + "score": 1.0, + "content": "Table 6: Additional hyper-parameters on GLUE tasks.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + } + ], + "index": 15.0 + }, + { + "type": "text", + "bbox": [ + 106, + 364, + 505, + 453 + ], + "lines": [ + { + "bbox": [ + 105, + 363, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 493, + 378 + ], + "score": 1.0, + "content": "As other adversarial training methods, introduces three additional hyper-parameters: step size", + "type": "text" + }, + { + "bbox": [ + 493, + 367, + 501, + 375 + ], + "score": 0.66, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 363, + 506, + 378 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 376, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 201, + 388 + ], + "score": 1.0, + "content": "maximum perturbation", + "type": "text" + }, + { + "bbox": [ + 201, + 379, + 207, + 386 + ], + "score": 0.4, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 376, + 278, + 388 + ], + "score": 1.0, + "content": ", number of steps", + "type": "text" + }, + { + "bbox": [ + 279, + 378, + 288, + 386 + ], + "score": 0.65, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 376, + 505, + 388 + ], + "score": 1.0, + "content": ". For all other hyper-parameters such as learning rate", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 387, + 505, + 398 + ], + "spans": [ + { + "bbox": [ + 106, + 387, + 505, + 398 + ], + "score": 1.0, + "content": "and number of iterations, we either search in the same interval as RoBERTa (on CommonsenseQA,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 398, + 506, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 506, + 409 + ], + "score": 1.0, + "content": "ARC, and WNLI), or use exactly the same setting as RoBERTa (except for MRPC, where we find", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 407, + 506, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 201, + 421 + ], + "score": 1.0, + "content": "using a learning rate of", + "type": "text" + }, + { + "bbox": [ + 202, + 408, + 241, + 419 + ], + "score": 0.92, + "content": "5 \\times 1 0 ^ { - 6 }", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 407, + 470, + 421 + ], + "score": 1.0, + "content": "gives better results).13. We list the best combinations for", + "type": "text" + }, + { + "bbox": [ + 471, + 410, + 487, + 420 + ], + "score": 0.76, + "content": "\\alpha , \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 407, + 506, + 421 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 107, + 419, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 107, + 421, + 117, + 429 + ], + "score": 0.67, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 419, + 437, + 432 + ], + "score": 1.0, + "content": "for each of the GLUE tasks in Table 6. For WSC/WNLI, the best combination is", + "type": "text" + }, + { + "bbox": [ + 437, + 420, + 505, + 431 + ], + "score": 0.89, + "content": "\\epsilon = 1 e - 2 , \\alpha =", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 107, + 430, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 107, + 431, + 166, + 442 + ], + "score": 0.82, + "content": "5 e - 3 , m = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 430, + 244, + 443 + ], + "score": 1.0, + "content": ". Notice even when", + "type": "text" + }, + { + "bbox": [ + 244, + 432, + 278, + 441 + ], + "score": 0.86, + "content": "m \\alpha < \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 430, + 456, + 443 + ], + "score": 1.0, + "content": ", the maximum perturbation could still reach", + "type": "text" + }, + { + "bbox": [ + 457, + 433, + 462, + 441 + ], + "score": 0.64, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 430, + 506, + 443 + ], + "score": 1.0, + "content": "due to the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 441, + 195, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 195, + 453 + ], + "score": 1.0, + "content": "random initialization.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 363, + 506, + 453 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 469, + 370, + 482 + ], + "lines": [ + { + "bbox": [ + 104, + 468, + 371, + 484 + ], + "spans": [ + { + "bbox": [ + 104, + 468, + 371, + 484 + ], + "score": 1.0, + "content": "B VARIANCE OF MAXIMUM INCREMENT OF LOSS", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "table", + "bbox": [ + 106, + 497, + 505, + 551 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 497, + 505, + 551 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 497, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 505, + 551 + ], + "score": 0.98, + "html": "
MethodsRTECoLAMRPC
M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-3)M-Inc (R)(10-3)N-Loss(10-3)
Vanilla5.1(15087)5.3(14346)4.5(920)6.1(13118)5.7(14122)5.2(447)10.2(929)10.2(955)1.9(76)
PGD4.7(10138)4.9(1828)6.2(752)128.2(1300)130.1(893)436.1(1276)5.7(321)5.7(155)5.4(54)
FreeLB3.0(1614)2.6(11114)4.1(595)1.4(1392)1.3(6231)7.2(615)3.6(167)3.6(601)2.7(54)
", + "type": "table", + "image_path": "dc24cb509b23de841340a676916c10c0a5f0d23eba704bba7d0ecdae595f6dc7.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 106, + 497, + 505, + 515.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 106, + 515.0, + 505, + 533.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 106, + 533.0, + 505, + 551.0 + ], + "spans": [], + "index": 28 + } + ] + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 560, + 505, + 600 + ], + "lines": [ + { + "bbox": [ + 106, + 559, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 106, + 559, + 505, + 572 + ], + "score": 1.0, + "content": "Table 7: Median and Standard Deviation of the maximum increase in loss in the vicinity of the dev set samples", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 569, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 505, + 581 + ], + "score": 1.0, + "content": "for RoBERTa-Large model finetuned with different methods. Vanilla models are naturally trained RoBERTa’s.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 579, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 579, + 505, + 591 + ], + "score": 1.0, + "content": "Nat Loss is the loss value on clean samples. Notice we require all clean samples here to be correctly classified", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 589, + 416, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 589, + 416, + 601 + ], + "score": 1.0, + "content": "by all models, which results in 227, 850 and 355 samples for RTE, CoLA and MRPC.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 559, + 505, + 601 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 615, + 504, + 637 + ], + "lines": [ + { + "bbox": [ + 106, + 614, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 614, + 506, + 628 + ], + "score": 1.0, + "content": "Table 7 provides the complete results for the increment of loss in the interval, with median and", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 626, + 184, + 638 + ], + "spans": [ + { + "bbox": [ + 106, + 626, + 184, + 638 + ], + "score": 1.0, + "content": "standard deviation.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5, + "bbox_fs": [ + 106, + 614, + 506, + 638 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 654, + 373, + 667 + ], + "lines": [ + { + "bbox": [ + 105, + 652, + 374, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 652, + 374, + 668 + ], + "score": 1.0, + "content": "C ADDITIONAL RESULTS FOR ABLATION STUDIES", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 108, + 679, + 505, + 712 + ], + "lines": [ + { + "bbox": [ + 105, + 678, + 505, + 692 + ], + "spans": [ + { + "bbox": [ + 105, + 678, + 505, + 692 + ], + "score": 1.0, + "content": "Here we provide some additional results for comparison with YOPO as complementary results to", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 689, + 506, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 506, + 703 + ], + "score": 1.0, + "content": "Table 4. We will release the complete results for comparing with YOPO and without variational", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 701, + 505, + 713 + ], + "spans": [ + { + "bbox": [ + 106, + 701, + 505, + 713 + ], + "score": 1.0, + "content": "dropout on each of the GLUE tasks in our next revision. From the current results, there is no need", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 678, + 506, + 713 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 175, + 80, + 434, + 147 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 175, + 80, + 434, + 147 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 175, + 80, + 434, + 147 + ], + "spans": [ + { + "bbox": [ + 175, + 80, + 434, + 147 + ], + "score": 0.978, + "html": "
MethodsVanillaFreeLB-3YOPO-3-2YOPO-3-3
STS-B92.20 (.2)92.67 (.08)92.60 (.17)92.60 (0.20)
SST-296.56 (.3)96.79 (.2)96.44 (.2)96.33 (.1)
QNLI-94.98 (.2)94.96 (.1)-
QQP二92.60 (.03)92.55 (.05)*92.50 (.02)*
MNLI-90.61 (.1)90.59 (.2)90.45 (.2)
", + "type": "table", + "image_path": "8c04a7228cc8d5061e850a97d495da84f386812487797d0894db7899fc19501f.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 175, + 80, + 434, + 102.33333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 175, + 102.33333333333333, + 434, + 124.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 175, + 124.66666666666666, + 434, + 147.0 + ], + "spans": [], + "index": 2 + } + ] + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 150, + 506, + 200 + ], + "lines": [ + { + "bbox": [ + 106, + 149, + 505, + 161 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 505, + 161 + ], + "score": 1.0, + "content": "Table 8: The median and standard deviation of the scores on the dev sets of STS-B, SST-2, QNLI, QQP and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 160, + 505, + 171 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 505, + 171 + ], + "score": 1.0, + "content": "MNLI from the GLUE benchmark, each computed from 5 runs with the same hyper-parameters except for the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 168, + 506, + 182 + ], + "spans": [ + { + "bbox": [ + 104, + 168, + 506, + 182 + ], + "score": 1.0, + "content": "random seeds (except for the results with YOPO on QQP, which are from 4 runs). Also note here we use a step", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 180, + 506, + 191 + ], + "spans": [ + { + "bbox": [ + 106, + 180, + 133, + 191 + ], + "score": 1.0, + "content": "size of", + "type": "text" + }, + { + "bbox": [ + 133, + 181, + 140, + 189 + ], + "score": 0.77, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 180, + 408, + 191 + ], + "score": 1.0, + "content": "for the adversary of YOPO-m-n, so YOPO effectively uses a step size of", + "type": "text" + }, + { + "bbox": [ + 409, + 181, + 421, + 189 + ], + "score": 0.37, + "content": "_ { n \\alpha }", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 180, + 485, + 191 + ], + "score": 1.0, + "content": ". We use FreeLB-", + "type": "text" + }, + { + "bbox": [ + 485, + 181, + 494, + 189 + ], + "score": 0.75, + "content": "\\mathbf { \\nabla } m", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 180, + 506, + 191 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 190, + 464, + 201 + ], + "spans": [ + { + "bbox": [ + 106, + 190, + 180, + 201 + ], + "score": 1.0, + "content": "denote FreeLB with", + "type": "text" + }, + { + "bbox": [ + 181, + 191, + 190, + 199 + ], + "score": 0.77, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 190, + 288, + 201 + ], + "score": 1.0, + "content": "ascent steps, and YOPO-3-", + "type": "text" + }, + { + "bbox": [ + 288, + 191, + 295, + 199 + ], + "score": 0.74, + "content": "\\mathbf { \\nabla } \\cdot \\mathbf { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 190, + 375, + 201 + ], + "score": 1.0, + "content": "to denote YOPO with", + "type": "text" + }, + { + "bbox": [ + 375, + 192, + 382, + 199 + ], + "score": 0.75, + "content": "_ n", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 190, + 464, + 201 + ], + "score": 1.0, + "content": "shallow-layer ascents.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 106, + 216, + 504, + 239 + ], + "lines": [ + { + "bbox": [ + 105, + 216, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 105, + 216, + 505, + 228 + ], + "score": 1.0, + "content": "in using extra shallow-layer updates that YOPO advocates, since this consistently deteriorates the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 227, + 313, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 313, + 240 + ], + "score": 1.0, + "content": "performance while introducing extra computations.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + } + ], + "page_idx": 13, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 763 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 763 + ], + "score": 1.0, + "content": "14", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 175, + 80, + 434, + 147 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 175, + 80, + 434, + 147 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 175, + 80, + 434, + 147 + ], + "spans": [ + { + "bbox": [ + 175, + 80, + 434, + 147 + ], + "score": 0.978, + "html": "
MethodsVanillaFreeLB-3YOPO-3-2YOPO-3-3
STS-B92.20 (.2)92.67 (.08)92.60 (.17)92.60 (0.20)
SST-296.56 (.3)96.79 (.2)96.44 (.2)96.33 (.1)
QNLI-94.98 (.2)94.96 (.1)-
QQP二92.60 (.03)92.55 (.05)*92.50 (.02)*
MNLI-90.61 (.1)90.59 (.2)90.45 (.2)
", + "type": "table", + "image_path": "8c04a7228cc8d5061e850a97d495da84f386812487797d0894db7899fc19501f.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 175, + 80, + 434, + 102.33333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 175, + 102.33333333333333, + 434, + 124.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 175, + 124.66666666666666, + 434, + 147.0 + ], + "spans": [], + "index": 2 + } + ] + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 150, + 506, + 200 + ], + "lines": [ + { + "bbox": [ + 106, + 149, + 505, + 161 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 505, + 161 + ], + "score": 1.0, + "content": "Table 8: The median and standard deviation of the scores on the dev sets of STS-B, SST-2, QNLI, QQP and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 160, + 505, + 171 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 505, + 171 + ], + "score": 1.0, + "content": "MNLI from the GLUE benchmark, each computed from 5 runs with the same hyper-parameters except for the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 168, + 506, + 182 + ], + "spans": [ + { + "bbox": [ + 104, + 168, + 506, + 182 + ], + "score": 1.0, + "content": "random seeds (except for the results with YOPO on QQP, which are from 4 runs). Also note here we use a step", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 180, + 506, + 191 + ], + "spans": [ + { + "bbox": [ + 106, + 180, + 133, + 191 + ], + "score": 1.0, + "content": "size of", + "type": "text" + }, + { + "bbox": [ + 133, + 181, + 140, + 189 + ], + "score": 0.77, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 180, + 408, + 191 + ], + "score": 1.0, + "content": "for the adversary of YOPO-m-n, so YOPO effectively uses a step size of", + "type": "text" + }, + { + "bbox": [ + 409, + 181, + 421, + 189 + ], + "score": 0.37, + "content": "_ { n \\alpha }", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 180, + 485, + 191 + ], + "score": 1.0, + "content": ". We use FreeLB-", + "type": "text" + }, + { + "bbox": [ + 485, + 181, + 494, + 189 + ], + "score": 0.75, + "content": "\\mathbf { \\nabla } m", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 180, + 506, + 191 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 190, + 464, + 201 + ], + "spans": [ + { + "bbox": [ + 106, + 190, + 180, + 201 + ], + "score": 1.0, + "content": "denote FreeLB with", + "type": "text" + }, + { + "bbox": [ + 181, + 191, + 190, + 199 + ], + "score": 0.77, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 190, + 288, + 201 + ], + "score": 1.0, + "content": "ascent steps, and YOPO-3-", + "type": "text" + }, + { + "bbox": [ + 288, + 191, + 295, + 199 + ], + "score": 0.74, + "content": "\\mathbf { \\nabla } \\cdot \\mathbf { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 190, + 375, + 201 + ], + "score": 1.0, + "content": "to denote YOPO with", + "type": "text" + }, + { + "bbox": [ + 375, + 192, + 382, + 199 + ], + "score": 0.75, + "content": "_ n", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 190, + 464, + 201 + ], + "score": 1.0, + "content": "shallow-layer ascents.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5, + "bbox_fs": [ + 104, + 149, + 506, + 201 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 216, + 504, + 239 + ], + "lines": [ + { + "bbox": [ + 105, + 216, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 105, + 216, + 505, + 228 + ], + "score": 1.0, + "content": "in using extra shallow-layer updates that YOPO advocates, since this consistently deteriorates the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 227, + 313, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 313, + 240 + ], + "score": 1.0, + "content": "performance while introducing extra computations.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 216, + 505, + 240 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/BygzbyHFvB/BygzbyHFvB_model.json b/parse/train/BygzbyHFvB/BygzbyHFvB_model.json new file mode 100644 index 0000000000000000000000000000000000000000..ab6a1a80ad76897f4b52a37b4b550368b0428212 --- /dev/null +++ b/parse/train/BygzbyHFvB/BygzbyHFvB_model.json @@ -0,0 +1,17421 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 623, + 1302, + 623, + 1302, + 1079, + 398, + 1079 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1442, + 1402, + 1442, + 1402, + 1656, + 298, + 1656 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1672, + 1403, + 1672, + 1403, + 1977, + 298, + 1977 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1213, + 1403, + 1213, + 1403, + 1425, + 298, + 1425 + ], + "score": 0.976 + }, + { + "category_id": 0, + "poly": [ + 300, + 219, + 1395, + 219, + 1395, + 324, + 300, + 324 + ], + "score": 0.962 + }, + { + "category_id": 2, + "poly": [ + 332, + 2006, + 1076, + 2006, + 1076, + 2034, + 332, + 2034 + ], + "score": 0.914 + }, + { + "category_id": 1, + "poly": [ + 314, + 372, + 1214, + 372, + 1214, + 470, + 314, + 470 + ], + "score": 0.912 + }, + { + "category_id": 0, + "poly": [ + 302, + 1142, + 572, + 1142, + 572, + 1177, + 302, + 1177 + ], + "score": 0.884 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 817, + 75, + 817, + 104, + 299, + 104 + ], + "score": 0.882 + }, + { + "category_id": 0, + "poly": [ + 773, + 552, + 926, + 552, + 926, + 585, + 773, + 585 + ], + "score": 0.871 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 857, + 2089, + 857, + 2112, + 841, + 2112 + ], + "score": 0.692 + }, + { + "category_id": 13, + "poly": [ + 1175, + 958, + 1265, + 958, + 1265, + 987, + 1175, + 987 + ], + "score": 0.88, + "latex": "6 7 . 7 5 \\%" + }, + { + "category_id": 13, + "poly": [ + 1244, + 1534, + 1299, + 1534, + 1299, + 1565, + 1244, + 1565 + ], + "score": 0.88, + "latex": "1 5 \\%" + }, + { + "category_id": 13, + "poly": [ + 1032, + 958, + 1121, + 958, + 1121, + 987, + 1032, + 987 + ], + "score": 0.88, + "latex": "8 5 . 4 4 \\%" + }, + { + "category_id": 13, + "poly": [ + 956, + 1534, + 1011, + 1534, + 1011, + 1565, + 956, + 1565 + ], + "score": 0.88, + "latex": "1 0 \\%" + }, + { + "category_id": 13, + "poly": [ + 781, + 375, + 841, + 375, + 841, + 407, + 781, + 407 + ], + "score": 0.79, + "latex": "\\mathbf { S u n } ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 652, + 375, + 717, + 375, + 717, + 407, + 652, + 407 + ], + "score": 0.44, + "latex": "\\mathbf { G a n } ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 383, + 375, + 446, + 375, + 446, + 407, + 383, + 407 + ], + "score": 0.27, + "latex": "\\mathbf { Z } \\mathbf { h } \\mathbf { u } ^ { \\mathbf { 1 } }" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 218.0, + 1403.0, + 218.0, + 1403.0, + 273.0, + 292.0, + 273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 274.0, + 1125.0, + 274.0, + 1125.0, + 329.0, + 292.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 2001.0, + 1079.0, + 2001.0, + 1079.0, + 2037.0, + 333.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1139.0, + 579.0, + 1139.0, + 579.0, + 1186.0, + 293.0, + 1186.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 817.0, + 72.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 551.0, + 932.0, + 551.0, + 932.0, + 588.0, + 769.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2088.0, + 861.0, + 2088.0, + 861.0, + 2118.0, + 840.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 618.0, + 1304.0, + 618.0, + 1304.0, + 660.0, + 393.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 653.0, + 1307.0, + 653.0, + 1307.0, + 689.0, + 391.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 682.0, + 1305.0, + 682.0, + 1305.0, + 720.0, + 392.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 713.0, + 1304.0, + 713.0, + 1304.0, + 750.0, + 392.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 746.0, + 1305.0, + 746.0, + 1305.0, + 777.0, + 394.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 775.0, + 1307.0, + 775.0, + 1307.0, + 810.0, + 393.0, + 810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 805.0, + 1306.0, + 805.0, + 1306.0, + 840.0, + 394.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 836.0, + 1307.0, + 836.0, + 1307.0, + 870.0, + 393.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 864.0, + 1307.0, + 864.0, + 1307.0, + 901.0, + 393.0, + 901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 897.0, + 1305.0, + 897.0, + 1305.0, + 929.0, + 393.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 929.0, + 1305.0, + 929.0, + 1305.0, + 960.0, + 394.0, + 960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 958.0, + 1031.0, + 958.0, + 1031.0, + 990.0, + 395.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1122.0, + 958.0, + 1174.0, + 958.0, + 1174.0, + 990.0, + 1122.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1266.0, + 958.0, + 1305.0, + 958.0, + 1305.0, + 990.0, + 1266.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 987.0, + 1306.0, + 987.0, + 1306.0, + 1024.0, + 393.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1020.0, + 1306.0, + 1020.0, + 1306.0, + 1051.0, + 394.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1049.0, + 925.0, + 1049.0, + 925.0, + 1080.0, + 394.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1442.0, + 1406.0, + 1442.0, + 1406.0, + 1477.0, + 294.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1475.0, + 1403.0, + 1475.0, + 1403.0, + 1506.0, + 296.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1504.0, + 1406.0, + 1504.0, + 1406.0, + 1538.0, + 293.0, + 1538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1534.0, + 955.0, + 1534.0, + 955.0, + 1569.0, + 293.0, + 1569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 1534.0, + 1243.0, + 1534.0, + 1243.0, + 1569.0, + 1012.0, + 1569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1300.0, + 1534.0, + 1404.0, + 1534.0, + 1404.0, + 1569.0, + 1300.0, + 1569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1564.0, + 1406.0, + 1564.0, + 1406.0, + 1599.0, + 292.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1594.0, + 1407.0, + 1594.0, + 1407.0, + 1632.0, + 293.0, + 1632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1626.0, + 792.0, + 1626.0, + 792.0, + 1661.0, + 294.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1671.0, + 1405.0, + 1671.0, + 1405.0, + 1707.0, + 296.0, + 1707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1702.0, + 1402.0, + 1702.0, + 1402.0, + 1738.0, + 293.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1731.0, + 1403.0, + 1731.0, + 1403.0, + 1769.0, + 293.0, + 1769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1765.0, + 1400.0, + 1765.0, + 1400.0, + 1797.0, + 296.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1793.0, + 1406.0, + 1793.0, + 1406.0, + 1830.0, + 292.0, + 1830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1825.0, + 1405.0, + 1825.0, + 1405.0, + 1859.0, + 293.0, + 1859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1855.0, + 1407.0, + 1855.0, + 1407.0, + 1890.0, + 293.0, + 1890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1885.0, + 1405.0, + 1885.0, + 1405.0, + 1921.0, + 294.0, + 1921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1916.0, + 1403.0, + 1916.0, + 1403.0, + 1951.0, + 294.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1949.0, + 641.0, + 1949.0, + 641.0, + 1980.0, + 296.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1211.0, + 1405.0, + 1211.0, + 1405.0, + 1252.0, + 292.0, + 1252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1246.0, + 1404.0, + 1246.0, + 1404.0, + 1276.0, + 296.0, + 1276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1275.0, + 1405.0, + 1275.0, + 1405.0, + 1309.0, + 294.0, + 1309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1306.0, + 1407.0, + 1306.0, + 1407.0, + 1340.0, + 294.0, + 1340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1336.0, + 1405.0, + 1336.0, + 1405.0, + 1370.0, + 293.0, + 1370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1365.0, + 1407.0, + 1365.0, + 1407.0, + 1403.0, + 293.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1397.0, + 443.0, + 1397.0, + 443.0, + 1429.0, + 294.0, + 1429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 374.0, + 382.0, + 374.0, + 382.0, + 412.0, + 313.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 447.0, + 374.0, + 651.0, + 374.0, + 651.0, + 412.0, + 447.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 718.0, + 374.0, + 780.0, + 374.0, + 780.0, + 412.0, + 718.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 374.0, + 1215.0, + 374.0, + 1215.0, + 412.0, + 842.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 406.0, + 1216.0, + 406.0, + 1216.0, + 444.0, + 313.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 443.0, + 1184.0, + 443.0, + 1184.0, + 475.0, + 314.0, + 475.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1406, + 1403, + 1406, + 1403, + 1712, + 298, + 1712 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 230, + 1404, + 230, + 1404, + 565, + 298, + 565 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1728, + 1403, + 1728, + 1403, + 2033, + 298, + 2033 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1007, + 1404, + 1007, + 1404, + 1284, + 298, + 1284 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 778, + 1403, + 778, + 1403, + 992, + 298, + 992 + ], + "score": 0.979 + }, + { + "category_id": 0, + "poly": [ + 300, + 642, + 586, + 642, + 586, + 679, + 300, + 679 + ], + "score": 0.908 + }, + { + "category_id": 0, + "poly": [ + 300, + 724, + 671, + 724, + 671, + 755, + 300, + 755 + ], + "score": 0.898 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 816, + 76, + 816, + 104, + 300, + 104 + ], + "score": 0.889 + }, + { + "category_id": 0, + "poly": [ + 298, + 1353, + 991, + 1353, + 991, + 1384, + 298, + 1384 + ], + "score": 0.877 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2112, + 841, + 2112 + ], + "score": 0.7 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 859, + 2089, + 859, + 2112, + 841, + 2112 + ], + "score": 0.12 + }, + { + "category_id": 13, + "poly": [ + 298, + 1070, + 326, + 1070, + 326, + 1097, + 298, + 1097 + ], + "score": 0.78, + "latex": "K" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 640.0, + 593.0, + 640.0, + 593.0, + 684.0, + 292.0, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 723.0, + 673.0, + 723.0, + 673.0, + 759.0, + 295.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1352.0, + 994.0, + 1352.0, + 994.0, + 1388.0, + 295.0, + 1388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2121.0, + 839.0, + 2121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2121.0, + 838.0, + 2121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1405.0, + 1405.0, + 1405.0, + 1405.0, + 1444.0, + 293.0, + 1444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1440.0, + 1404.0, + 1440.0, + 1404.0, + 1471.0, + 294.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1465.0, + 1407.0, + 1465.0, + 1407.0, + 1507.0, + 292.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1499.0, + 1406.0, + 1499.0, + 1406.0, + 1535.0, + 291.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1530.0, + 1405.0, + 1530.0, + 1405.0, + 1565.0, + 293.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1556.0, + 1407.0, + 1556.0, + 1407.0, + 1600.0, + 292.0, + 1600.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1591.0, + 1405.0, + 1591.0, + 1405.0, + 1626.0, + 294.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1620.0, + 1407.0, + 1620.0, + 1407.0, + 1657.0, + 292.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1652.0, + 1404.0, + 1652.0, + 1404.0, + 1687.0, + 294.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1682.0, + 1339.0, + 1682.0, + 1339.0, + 1718.0, + 294.0, + 1718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 227.0, + 1403.0, + 227.0, + 1403.0, + 267.0, + 295.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 263.0, + 1405.0, + 263.0, + 1405.0, + 297.0, + 294.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 290.0, + 1404.0, + 290.0, + 1404.0, + 326.0, + 293.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 318.0, + 1404.0, + 318.0, + 1404.0, + 356.0, + 293.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 354.0, + 1404.0, + 354.0, + 1404.0, + 385.0, + 296.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 381.0, + 1405.0, + 381.0, + 1405.0, + 416.0, + 293.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 412.0, + 1406.0, + 412.0, + 1406.0, + 447.0, + 294.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 443.0, + 1406.0, + 443.0, + 1406.0, + 478.0, + 294.0, + 478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 474.0, + 1404.0, + 474.0, + 1404.0, + 509.0, + 294.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 504.0, + 1405.0, + 504.0, + 1405.0, + 540.0, + 293.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 535.0, + 751.0, + 535.0, + 751.0, + 569.0, + 295.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1726.0, + 1405.0, + 1726.0, + 1405.0, + 1763.0, + 294.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1758.0, + 1404.0, + 1758.0, + 1404.0, + 1793.0, + 294.0, + 1793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1788.0, + 1405.0, + 1788.0, + 1405.0, + 1824.0, + 293.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1822.0, + 1404.0, + 1822.0, + 1404.0, + 1854.0, + 296.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1851.0, + 1404.0, + 1851.0, + 1404.0, + 1883.0, + 294.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1882.0, + 1405.0, + 1882.0, + 1405.0, + 1917.0, + 293.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1911.0, + 1404.0, + 1911.0, + 1404.0, + 1946.0, + 294.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1944.0, + 1404.0, + 1944.0, + 1404.0, + 1975.0, + 296.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1974.0, + 1405.0, + 1974.0, + 1405.0, + 2006.0, + 296.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2003.0, + 597.0, + 2003.0, + 597.0, + 2035.0, + 296.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1009.0, + 1405.0, + 1009.0, + 1405.0, + 1042.0, + 296.0, + 1042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1036.0, + 1406.0, + 1036.0, + 1406.0, + 1074.0, + 293.0, + 1074.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1067.0, + 1406.0, + 1067.0, + 1406.0, + 1105.0, + 327.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1097.0, + 1406.0, + 1097.0, + 1406.0, + 1136.0, + 293.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1128.0, + 1405.0, + 1128.0, + 1405.0, + 1166.0, + 293.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1160.0, + 1405.0, + 1160.0, + 1405.0, + 1197.0, + 294.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1191.0, + 1404.0, + 1191.0, + 1404.0, + 1224.0, + 294.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1220.0, + 1406.0, + 1220.0, + 1406.0, + 1258.0, + 292.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1250.0, + 415.0, + 1250.0, + 415.0, + 1291.0, + 293.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 776.0, + 1405.0, + 776.0, + 1405.0, + 814.0, + 294.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 808.0, + 1404.0, + 808.0, + 1404.0, + 845.0, + 293.0, + 845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 840.0, + 1405.0, + 840.0, + 1405.0, + 874.0, + 293.0, + 874.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 869.0, + 1405.0, + 869.0, + 1405.0, + 906.0, + 291.0, + 906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 901.0, + 1405.0, + 901.0, + 1405.0, + 935.0, + 293.0, + 935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 930.0, + 1407.0, + 930.0, + 1407.0, + 968.0, + 292.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 958.0, + 462.0, + 958.0, + 462.0, + 999.0, + 294.0, + 999.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 295, + 1404, + 295, + 1404, + 753, + 297, + 753 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 767, + 1405, + 767, + 1405, + 1105, + 298, + 1105 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 1347, + 1404, + 1347, + 1404, + 1562, + 298, + 1562 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 1621, + 1403, + 1621, + 1403, + 1809, + 297, + 1809 + ], + "score": 0.98 + }, + { + "category_id": 8, + "poly": [ + 616, + 1263, + 1088, + 1263, + 1088, + 1339, + 616, + 1339 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 300, + 1189, + 1400, + 1189, + 1400, + 1253, + 300, + 1253 + ], + "score": 0.945 + }, + { + "category_id": 8, + "poly": [ + 606, + 1573, + 1092, + 1573, + 1092, + 1613, + 606, + 1613 + ], + "score": 0.941 + }, + { + "category_id": 1, + "poly": [ + 300, + 1893, + 1399, + 1893, + 1399, + 1957, + 300, + 1957 + ], + "score": 0.937 + }, + { + "category_id": 2, + "poly": [ + 299, + 1977, + 1404, + 1977, + 1404, + 2033, + 299, + 2033 + ], + "score": 0.93 + }, + { + "category_id": 0, + "poly": [ + 300, + 1140, + 790, + 1140, + 790, + 1172, + 300, + 1172 + ], + "score": 0.903 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1577, + 1399, + 1577, + 1399, + 1606, + 1366, + 1606 + ], + "score": 0.886 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1286, + 1399, + 1286, + 1399, + 1315, + 1366, + 1315 + ], + "score": 0.876 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 817, + 75, + 817, + 104, + 299, + 104 + ], + "score": 0.869 + }, + { + "category_id": 0, + "poly": [ + 297, + 1843, + 979, + 1843, + 979, + 1876, + 297, + 1876 + ], + "score": 0.867 + }, + { + "category_id": 0, + "poly": [ + 298, + 226, + 1208, + 226, + 1208, + 262, + 298, + 262 + ], + "score": 0.836 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.676 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.305 + }, + { + "category_id": 13, + "poly": [ + 1064, + 892, + 1198, + 892, + 1198, + 923, + 1064, + 923 + ], + "score": 0.95, + "latex": "{ \\pmb y } = f _ { \\pmb \\theta } ( { \\pmb X } )" + }, + { + "category_id": 14, + "poly": [ + 613, + 1262, + 1087, + 1262, + 1087, + 1339, + 613, + 1339 + ], + "score": 0.94, + "latex": "\\operatorname* { m i n } _ { \\theta } \\mathbb { E } _ { ( Z , y ) \\sim \\mathcal { D } } \\left[ \\operatorname* { m a x } _ { \\| \\delta \\| \\leq \\epsilon } L ( f _ { \\theta } ( X + \\delta ) , y ) \\right] ," + }, + { + "category_id": 14, + "poly": [ + 604, + 1572, + 1093, + 1572, + 1093, + 1613, + 604, + 1613 + ], + "score": 0.93, + "latex": "\\delta _ { t + 1 } = \\Pi _ { \\| \\pmb { \\delta } \\| _ { F } \\leq \\epsilon } \\left( \\pmb { \\delta } _ { t } + \\alpha g ( \\pmb { \\delta } _ { t } ) / \\| g ( \\pmb { \\delta } _ { t } ) \\| _ { F } \\right) ," + }, + { + "category_id": 13, + "poly": [ + 885, + 1500, + 1000, + 1500, + 1000, + 1534, + 885, + 1534 + ], + "score": 0.93, + "latex": "\\| \\delta \\| _ { F } \\le \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1298, + 1625, + 1401, + 1625, + 1401, + 1661, + 1298, + 1661 + ], + "score": 0.92, + "latex": "\\Pi _ { \\| \\delta \\| _ { F } \\leq \\epsilon }" + }, + { + "category_id": 13, + "poly": [ + 1160, + 981, + 1354, + 981, + 1354, + 1015, + 1160, + 1015 + ], + "score": 0.92, + "latex": "\\pmb { y } ^ { \\prime } = f _ { \\pmb { \\theta } } ( \\pmb { X } + \\pmb { \\delta } )" + }, + { + "category_id": 13, + "poly": [ + 375, + 1622, + 729, + 1622, + 729, + 1657, + 375, + 1657 + ], + "score": 0.92, + "latex": "g ( \\delta _ { t } ) = \\nabla _ { \\delta } L ( f _ { \\theta } ( X + \\delta _ { t } ) , y )" + }, + { + "category_id": 13, + "poly": [ + 1078, + 860, + 1303, + 860, + 1303, + 892, + 1078, + 892 + ], + "score": 0.9, + "latex": "\\pmb { Z } = [ z _ { 1 } , z _ { 2 } , . . . , z _ { n } ]" + }, + { + "category_id": 13, + "poly": [ + 1284, + 891, + 1402, + 891, + 1402, + 919, + 1284, + 919 + ], + "score": 0.89, + "latex": "\\dot { \\boldsymbol { X } } = \\boldsymbol { V } \\boldsymbol { Z }" + }, + { + "category_id": 13, + "poly": [ + 985, + 1192, + 1016, + 1192, + 1016, + 1218, + 985, + 1218 + ], + "score": 0.87, + "latex": "\\pmb { \\theta } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1142, + 1686, + 1170, + 1686, + 1170, + 1712, + 1142, + 1712 + ], + "score": 0.83, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 875, + 1350, + 897, + 1350, + 897, + 1376, + 875, + 1376 + ], + "score": 0.82, + "latex": "L" + }, + { + "category_id": 13, + "poly": [ + 373, + 1350, + 399, + 1350, + 399, + 1376, + 373, + 1376 + ], + "score": 0.82, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 667, + 1354, + 686, + 1354, + 686, + 1381, + 667, + 1381 + ], + "score": 0.82, + "latex": "y" + }, + { + "category_id": 13, + "poly": [ + 707, + 1074, + 737, + 1074, + 737, + 1101, + 707, + 1101 + ], + "score": 0.81, + "latex": "\\boldsymbol { X }" + }, + { + "category_id": 13, + "poly": [ + 394, + 1717, + 423, + 1717, + 423, + 1743, + 394, + 1743 + ], + "score": 0.81, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 345, + 1223, + 362, + 1223, + 362, + 1249, + 345, + 1249 + ], + "score": 0.8, + "latex": "\\pmb { \\delta }" + }, + { + "category_id": 13, + "poly": [ + 617, + 925, + 639, + 925, + 639, + 952, + 617, + 952 + ], + "score": 0.77, + "latex": "\\textbf { { y } }" + }, + { + "category_id": 13, + "poly": [ + 1216, + 1624, + 1234, + 1624, + 1234, + 1651, + 1216, + 1651 + ], + "score": 0.76, + "latex": "\\delta" + }, + { + "category_id": 13, + "poly": [ + 1299, + 1686, + 1326, + 1686, + 1326, + 1713, + 1299, + 1713 + ], + "score": 0.76, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 851, + 1014, + 870, + 1014, + 870, + 1040, + 851, + 1040 + ], + "score": 0.75, + "latex": "\\pmb { \\delta }" + }, + { + "category_id": 13, + "poly": [ + 501, + 891, + 529, + 891, + 529, + 918, + 501, + 918 + ], + "score": 0.74, + "latex": "V" + }, + { + "category_id": 13, + "poly": [ + 1170, + 1536, + 1190, + 1536, + 1190, + 1558, + 1170, + 1558 + ], + "score": 0.73, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 505, + 1380, + 524, + 1380, + 524, + 1406, + 505, + 1406 + ], + "score": 0.72, + "latex": "\\delta" + }, + { + "category_id": 13, + "poly": [ + 648, + 1661, + 662, + 1661, + 662, + 1682, + 648, + 1682 + ], + "score": 0.72, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 447, + 952, + 467, + 952, + 467, + 980, + 447, + 980 + ], + "score": 0.71, + "latex": "\\pmb \\theta" + }, + { + "category_id": 13, + "poly": [ + 554, + 983, + 572, + 983, + 572, + 1009, + 554, + 1009 + ], + "score": 0.69, + "latex": "\\delta" + }, + { + "category_id": 13, + "poly": [ + 1232, + 952, + 1260, + 952, + 1260, + 979, + 1232, + 979 + ], + "score": 0.66, + "latex": "V" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1966.0, + 1406.0, + 1966.0, + 1406.0, + 2016.0, + 326.0, + 2016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2003.0, + 705.0, + 2003.0, + 705.0, + 2037.0, + 295.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1140.0, + 794.0, + 1140.0, + 794.0, + 1176.0, + 295.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 817.0, + 72.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1843.0, + 981.0, + 1843.0, + 981.0, + 1878.0, + 295.0, + 1878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 225.0, + 1214.0, + 225.0, + 1214.0, + 265.0, + 293.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 294.0, + 1405.0, + 294.0, + 1405.0, + 332.0, + 294.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 323.0, + 1405.0, + 323.0, + 1405.0, + 361.0, + 294.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 351.0, + 1405.0, + 351.0, + 1405.0, + 396.0, + 292.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 387.0, + 1404.0, + 387.0, + 1404.0, + 422.0, + 295.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 419.0, + 1402.0, + 419.0, + 1402.0, + 451.0, + 296.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 448.0, + 1405.0, + 448.0, + 1405.0, + 483.0, + 294.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 480.0, + 1402.0, + 480.0, + 1402.0, + 512.0, + 296.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 508.0, + 1407.0, + 508.0, + 1407.0, + 546.0, + 294.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 536.0, + 1406.0, + 536.0, + 1406.0, + 574.0, + 294.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 570.0, + 1406.0, + 570.0, + 1406.0, + 605.0, + 295.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 600.0, + 1404.0, + 600.0, + 1404.0, + 635.0, + 295.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 629.0, + 1406.0, + 629.0, + 1406.0, + 668.0, + 292.0, + 668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 660.0, + 1405.0, + 660.0, + 1405.0, + 695.0, + 295.0, + 695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 692.0, + 1404.0, + 692.0, + 1404.0, + 726.0, + 292.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 723.0, + 806.0, + 723.0, + 806.0, + 754.0, + 297.0, + 754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 764.0, + 1405.0, + 764.0, + 1405.0, + 807.0, + 292.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 799.0, + 1406.0, + 799.0, + 1406.0, + 835.0, + 292.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 828.0, + 1405.0, + 828.0, + 1405.0, + 866.0, + 293.0, + 866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 861.0, + 1077.0, + 861.0, + 1077.0, + 896.0, + 293.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1304.0, + 861.0, + 1405.0, + 861.0, + 1405.0, + 896.0, + 1304.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 887.0, + 500.0, + 887.0, + 500.0, + 925.0, + 292.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 887.0, + 1063.0, + 887.0, + 1063.0, + 925.0, + 530.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1199.0, + 887.0, + 1283.0, + 887.0, + 1283.0, + 925.0, + 1199.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 887.0, + 1406.0, + 887.0, + 1406.0, + 925.0, + 1403.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 920.0, + 616.0, + 920.0, + 616.0, + 958.0, + 292.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 920.0, + 1407.0, + 920.0, + 1407.0, + 958.0, + 640.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 950.0, + 446.0, + 950.0, + 446.0, + 986.0, + 293.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 468.0, + 950.0, + 1231.0, + 950.0, + 1231.0, + 986.0, + 468.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 950.0, + 1403.0, + 950.0, + 1403.0, + 986.0, + 1261.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 980.0, + 553.0, + 980.0, + 553.0, + 1017.0, + 293.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 573.0, + 980.0, + 1159.0, + 980.0, + 1159.0, + 1017.0, + 573.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1355.0, + 980.0, + 1406.0, + 980.0, + 1406.0, + 1017.0, + 1355.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1012.0, + 850.0, + 1012.0, + 850.0, + 1048.0, + 292.0, + 1048.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 1012.0, + 1405.0, + 1012.0, + 1405.0, + 1048.0, + 871.0, + 1048.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1043.0, + 1405.0, + 1043.0, + 1405.0, + 1078.0, + 295.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1072.0, + 706.0, + 1072.0, + 706.0, + 1108.0, + 293.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 1072.0, + 941.0, + 1072.0, + 941.0, + 1108.0, + 738.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1350.0, + 372.0, + 1350.0, + 372.0, + 1381.0, + 297.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 400.0, + 1350.0, + 666.0, + 1350.0, + 666.0, + 1381.0, + 400.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1350.0, + 874.0, + 1350.0, + 874.0, + 1381.0, + 687.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 898.0, + 1350.0, + 1402.0, + 1350.0, + 1402.0, + 1381.0, + 898.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1378.0, + 504.0, + 1378.0, + 504.0, + 1409.0, + 294.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 525.0, + 1378.0, + 1404.0, + 1378.0, + 1404.0, + 1409.0, + 525.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1409.0, + 1405.0, + 1409.0, + 1405.0, + 1442.0, + 292.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1441.0, + 1404.0, + 1441.0, + 1404.0, + 1472.0, + 296.0, + 1472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1469.0, + 1406.0, + 1469.0, + 1406.0, + 1502.0, + 293.0, + 1502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1501.0, + 884.0, + 1501.0, + 884.0, + 1536.0, + 294.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1001.0, + 1501.0, + 1406.0, + 1501.0, + 1406.0, + 1536.0, + 1001.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1530.0, + 1169.0, + 1530.0, + 1169.0, + 1565.0, + 293.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1191.0, + 1530.0, + 1397.0, + 1530.0, + 1397.0, + 1565.0, + 1191.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1612.0, + 374.0, + 1612.0, + 374.0, + 1668.0, + 290.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 1612.0, + 1215.0, + 1612.0, + 1215.0, + 1668.0, + 730.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1235.0, + 1612.0, + 1297.0, + 1612.0, + 1297.0, + 1668.0, + 1235.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1612.0, + 1407.0, + 1612.0, + 1407.0, + 1668.0, + 1402.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1653.0, + 647.0, + 1653.0, + 647.0, + 1689.0, + 292.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 663.0, + 1653.0, + 1405.0, + 1653.0, + 1405.0, + 1689.0, + 663.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1682.0, + 1141.0, + 1682.0, + 1141.0, + 1720.0, + 291.0, + 1720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 1682.0, + 1298.0, + 1682.0, + 1298.0, + 1720.0, + 1171.0, + 1720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1327.0, + 1682.0, + 1406.0, + 1682.0, + 1406.0, + 1720.0, + 1327.0, + 1720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1715.0, + 393.0, + 1715.0, + 393.0, + 1751.0, + 293.0, + 1751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1715.0, + 1405.0, + 1715.0, + 1405.0, + 1751.0, + 424.0, + 1751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1743.0, + 1405.0, + 1743.0, + 1405.0, + 1782.0, + 294.0, + 1782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1777.0, + 1379.0, + 1777.0, + 1379.0, + 1813.0, + 295.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1186.0, + 984.0, + 1186.0, + 984.0, + 1225.0, + 294.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 1186.0, + 1407.0, + 1186.0, + 1407.0, + 1225.0, + 1017.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1221.0, + 344.0, + 1221.0, + 344.0, + 1257.0, + 296.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 363.0, + 1221.0, + 615.0, + 1221.0, + 615.0, + 1257.0, + 363.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1894.0, + 1404.0, + 1894.0, + 1404.0, + 1926.0, + 296.0, + 1926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1924.0, + 1404.0, + 1924.0, + 1404.0, + 1960.0, + 294.0, + 1960.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1148, + 1404, + 1148, + 1404, + 1456, + 297, + 1456 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 297, + 856, + 1405, + 856, + 1405, + 1135, + 297, + 1135 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1469, + 1405, + 1469, + 1405, + 1686, + 298, + 1686 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 299, + 1798, + 1404, + 1798, + 1404, + 1925, + 299, + 1925 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 1937, + 1403, + 1937, + 1403, + 2036, + 299, + 2036 + ], + "score": 0.971 + }, + { + "category_id": 8, + "poly": [ + 565, + 1696, + 1135, + 1696, + 1135, + 1791, + 565, + 1791 + ], + "score": 0.96 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1728, + 1400, + 1728, + 1400, + 1759, + 1366, + 1759 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 816, + 75, + 816, + 105, + 300, + 105 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.774 + }, + { + "category_id": 0, + "poly": [ + 296, + 228, + 1053, + 228, + 1053, + 262, + 296, + 262 + ], + "score": 0.557 + }, + { + "category_id": 5, + "poly": [ + 299, + 273, + 1401, + 273, + 1401, + 800, + 299, + 800 + ], + "score": 0.368, + "html": "
ascent step size αRequire: Training samples X = {(Z,y)}, perturbation bound ε, learning rate T, ascent steps K,
1:Initialize 0
2: for epoch =1... Nep do
3:for minibatchB ℃Xdo
4:U(-∈,∈)
5:90↑0
6:
7:fort=1...K do
8:Accumulate gradient of parameters θ
9:gt←gt-1+kE(z,y)∈B[VθL(fe(X+δt-1),y)]
10:Update the perturbation δ via gradient ascend
11:gadu ←VsL(fθ(X+δt-1),y) δt ←II|δ|lr≤e(δt-1+α:gadu/llgadullF)
12:
13:end for
14:0←0-TgK
end for 15: end for
" + }, + { + "category_id": 1, + "poly": [ + 299, + 273, + 1401, + 273, + 1401, + 800, + 299, + 800 + ], + "score": 0.344 + }, + { + "category_id": 6, + "poly": [ + 296, + 228, + 1053, + 228, + 1053, + 262, + 296, + 262 + ], + "score": 0.23 + }, + { + "category_id": 14, + "poly": [ + 564, + 1696, + 1135, + 1696, + 1135, + 1791, + 564, + 1791 + ], + "score": 0.94, + "latex": "\\underset { \\pmb { \\theta } } { \\operatorname* { m i n } } \\mathbb { E } _ { ( Z , y ) \\sim \\mathcal { D } } \\left[ \\frac { 1 } { K } \\sum _ { t = 0 } ^ { K - 1 } \\underset { \\delta _ { t } \\in \\mathcal { Z } _ { t } } { \\operatorname* { m a x } } L \\big ( f _ { \\pmb { \\theta } } \\big ( \\pmb { X } + \\delta _ { t } \\big ) , y \\big ) \\right] ," + }, + { + "category_id": 13, + "poly": [ + 615, + 273, + 784, + 273, + 784, + 309, + 615, + 309 + ], + "score": 0.93, + "latex": "X = \\{ ( Z , y ) \\}" + }, + { + "category_id": 13, + "poly": [ + 1025, + 1071, + 1329, + 1071, + 1329, + 1106, + 1025, + 1106 + ], + "score": 0.93, + "latex": "\\nabla _ { \\pmb { \\theta } } L \\big ( f _ { \\pmb { \\theta } _ { t - 1 } } ( \\pmb { X } + \\delta _ { t - 1 } ) , y \\big )" + }, + { + "category_id": 13, + "poly": [ + 434, + 1654, + 698, + 1654, + 698, + 1685, + 434, + 1685 + ], + "score": 0.91, + "latex": "X + \\delta _ { 0 } , . . . , X + \\delta _ { K - 1 }" + }, + { + "category_id": 13, + "poly": [ + 684, + 1831, + 950, + 1831, + 950, + 1863, + 684, + 1863 + ], + "score": 0.91, + "latex": "X + \\delta _ { 0 } , . . . , X + \\delta _ { K - 1 }" + }, + { + "category_id": 13, + "poly": [ + 669, + 2000, + 715, + 2000, + 715, + 2033, + 669, + 2033 + ], + "score": 0.91, + "latex": "\\sqrt { T }" + }, + { + "category_id": 13, + "poly": [ + 697, + 1592, + 789, + 1592, + 789, + 1623, + 697, + 1623 + ], + "score": 0.9, + "latex": "X + \\delta _ { t }" + }, + { + "category_id": 13, + "poly": [ + 577, + 1623, + 885, + 1623, + 885, + 1656, + 577, + 1656 + ], + "score": 0.9, + "latex": "\\mathcal { T } _ { t } = \\mathcal { B } _ { X + \\delta _ { 0 } } ( \\alpha t ) \\cap \\mathcal { B } _ { X } ( \\epsilon )" + }, + { + "category_id": 13, + "poly": [ + 977, + 1532, + 1037, + 1532, + 1037, + 1562, + 977, + 1562 + ], + "score": 0.9, + "latex": "\\nabla _ { \\boldsymbol { \\theta } } L" + }, + { + "category_id": 13, + "poly": [ + 542, + 1041, + 846, + 1041, + 846, + 1075, + 542, + 1075 + ], + "score": 0.89, + "latex": "\\nabla _ { \\delta } L \\big ( f _ { \\pmb { \\theta } _ { t - 1 } } ( \\pmb { X } + \\delta _ { t - 1 } ) , y \\big )" + }, + { + "category_id": 13, + "poly": [ + 1307, + 1012, + 1336, + 1012, + 1336, + 1041, + 1307, + 1041 + ], + "score": 0.87, + "latex": "\\theta _ { t }" + }, + { + "category_id": 13, + "poly": [ + 1030, + 1043, + 1058, + 1043, + 1058, + 1071, + 1030, + 1071 + ], + "score": 0.85, + "latex": "\\theta _ { t }" + }, + { + "category_id": 13, + "poly": [ + 962, + 1800, + 990, + 1800, + 990, + 1827, + 962, + 1827 + ], + "score": 0.84, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 545, + 397, + 633, + 397, + 633, + 423, + 545, + 423 + ], + "score": 0.84, + "latex": "B \\subset X" + }, + { + "category_id": 13, + "poly": [ + 685, + 1074, + 712, + 1074, + 712, + 1102, + 685, + 1102 + ], + "score": 0.84, + "latex": "\\delta _ { t }" + }, + { + "category_id": 13, + "poly": [ + 854, + 1800, + 884, + 1800, + 884, + 1827, + 854, + 1827 + ], + "score": 0.82, + "latex": "\\boldsymbol { X }" + }, + { + "category_id": 13, + "poly": [ + 1234, + 951, + 1263, + 951, + 1263, + 977, + 1234, + 977 + ], + "score": 0.82, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 901, + 1181, + 931, + 1181, + 931, + 1207, + 901, + 1207 + ], + "score": 0.8, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 628, + 1012, + 656, + 1012, + 656, + 1041, + 628, + 1041 + ], + "score": 0.8, + "latex": "\\delta _ { t }" + }, + { + "category_id": 13, + "poly": [ + 866, + 524, + 883, + 524, + 883, + 549, + 866, + 549 + ], + "score": 0.77, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 1365, + 276, + 1393, + 276, + 1393, + 303, + 1365, + 303 + ], + "score": 0.76, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 297, + 2003, + 321, + 2003, + 321, + 2030, + 297, + 2030 + ], + "score": 0.76, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 630, + 1563, + 650, + 1563, + 650, + 1589, + 630, + 1589 + ], + "score": 0.71, + "latex": "\\pmb \\theta" + }, + { + "category_id": 13, + "poly": [ + 1193, + 281, + 1212, + 281, + 1212, + 303, + 1193, + 303 + ], + "score": 0.71, + "latex": "\\tau" + }, + { + "category_id": 14, + "poly": [ + 522, + 550, + 1105, + 550, + 1105, + 590, + 522, + 590 + ], + "score": 0.7, + "latex": "\\begin{array} { r } { \\pmb { g } _ { t } \\pmb { g } _ { t - 1 } + \\frac { 1 } { K } \\mathbb { E } _ { ( \\pmb { Z } , \\pmb { y } ) \\in B } [ \\nabla _ { \\pmb { \\theta } } L ( f _ { \\pmb { \\theta } } ( \\pmb { X } + \\pmb { \\delta } _ { t - 1 } ) , \\pmb { y } ) ] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 739, + 588, + 755, + 588, + 755, + 611, + 739, + 611 + ], + "score": 0.69, + "latex": "\\delta" + }, + { + "category_id": 14, + "poly": [ + 519, + 613, + 1003, + 613, + 1003, + 683, + 519, + 683 + ], + "score": 0.65, + "latex": "\\begin{array} { r l } & { \\pmb { g _ { a d v } } \\nabla _ { \\pmb { \\delta } } L ( f _ { \\pmb { \\theta } } ( \\pmb { X } + \\pmb { \\delta _ { t - 1 } } ) , y ) } \\\\ & { \\pmb { \\delta _ { t } } \\Pi _ { \\| \\pmb { \\delta } \\| _ { F } \\leq \\epsilon } ( \\pmb { \\delta _ { t - 1 } } + \\alpha \\cdot \\pmb { g _ { a d v } } / \\| \\pmb { g _ { a d v } } \\| _ { F } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 522, + 311, + 544, + 311, + 544, + 332, + 522, + 332 + ], + "score": 0.65, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 604, + 1013, + 617, + 1013, + 617, + 1038, + 604, + 1038 + ], + "score": 0.63, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 543, + 366, + 592, + 366, + 592, + 397, + 543, + 397 + ], + "score": 0.61, + "latex": "N _ { e p }" + }, + { + "category_id": 14, + "poly": [ + 424, + 423, + 661, + 423, + 661, + 507, + 424, + 507 + ], + "score": 0.58, + "latex": "\\begin{array} { l } { \\delta _ { 0 } \\gets \\frac { 1 } { \\sqrt { N _ { \\delta } } } U ( - \\epsilon , \\epsilon ) } \\\\ { g _ { 0 } \\gets 0 } \\\\ { \\mathrm { \\bf \\Pi } _ { { \\bf f } _ { \\alpha = \\pi + } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1017, + 281, + 1033, + 281, + 1033, + 303, + 1017, + 303 + ], + "score": 0.57, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 450, + 337, + 471, + 337, + 471, + 363, + 450, + 363 + ], + "score": 0.5, + "latex": "\\pmb \\theta" + }, + { + "category_id": 13, + "poly": [ + 1014, + 231, + 1042, + 231, + 1042, + 258, + 1014, + 258 + ], + "score": 0.46, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 469, + 494, + 601, + 494, + 601, + 522, + 469, + 522 + ], + "score": 0.34, + "latex": "t = 1 \\ldots K" + }, + { + "category_id": 13, + "poly": [ + 456, + 366, + 593, + 366, + 593, + 397, + 456, + 397 + ], + "score": 0.29, + "latex": "= 1 \\dots N _ { e p }" + }, + { + "category_id": 13, + "poly": [ + 456, + 367, + 506, + 367, + 506, + 395, + 456, + 395 + ], + "score": 0.26, + "latex": "= 1" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 225.0, + 1013.0, + 225.0, + 1013.0, + 268.0, + 297.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 225.0, + 1055.0, + 225.0, + 1055.0, + 268.0, + 1043.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 225.0, + 1013.0, + 225.0, + 1013.0, + 268.0, + 297.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 225.0, + 1055.0, + 225.0, + 1055.0, + 268.0, + 1043.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1146.0, + 1406.0, + 1146.0, + 1406.0, + 1185.0, + 292.0, + 1185.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1180.0, + 900.0, + 1180.0, + 900.0, + 1215.0, + 295.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 1180.0, + 1406.0, + 1180.0, + 1406.0, + 1215.0, + 932.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1210.0, + 1406.0, + 1210.0, + 1406.0, + 1246.0, + 295.0, + 1246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1242.0, + 1405.0, + 1242.0, + 1405.0, + 1274.0, + 296.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1269.0, + 1405.0, + 1269.0, + 1405.0, + 1305.0, + 295.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1297.0, + 1405.0, + 1297.0, + 1405.0, + 1340.0, + 291.0, + 1340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1330.0, + 1407.0, + 1330.0, + 1407.0, + 1368.0, + 291.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1358.0, + 1404.0, + 1358.0, + 1404.0, + 1400.0, + 292.0, + 1400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1393.0, + 1406.0, + 1393.0, + 1406.0, + 1426.0, + 293.0, + 1426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1423.0, + 1120.0, + 1423.0, + 1120.0, + 1459.0, + 294.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 855.0, + 1403.0, + 855.0, + 1403.0, + 894.0, + 295.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 890.0, + 1403.0, + 890.0, + 1403.0, + 923.0, + 296.0, + 923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 919.0, + 1402.0, + 919.0, + 1402.0, + 952.0, + 295.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 945.0, + 1233.0, + 945.0, + 1233.0, + 988.0, + 292.0, + 988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1264.0, + 945.0, + 1406.0, + 945.0, + 1406.0, + 988.0, + 1264.0, + 988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 980.0, + 1405.0, + 980.0, + 1405.0, + 1017.0, + 294.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1007.0, + 603.0, + 1007.0, + 603.0, + 1047.0, + 294.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 1007.0, + 627.0, + 1007.0, + 627.0, + 1047.0, + 618.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 1007.0, + 1306.0, + 1007.0, + 1306.0, + 1047.0, + 657.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1337.0, + 1007.0, + 1405.0, + 1007.0, + 1405.0, + 1047.0, + 1337.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1040.0, + 541.0, + 1040.0, + 541.0, + 1077.0, + 294.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 1040.0, + 1029.0, + 1040.0, + 1029.0, + 1077.0, + 847.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 1040.0, + 1405.0, + 1040.0, + 1405.0, + 1077.0, + 1059.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1069.0, + 684.0, + 1069.0, + 684.0, + 1110.0, + 294.0, + 1110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 713.0, + 1069.0, + 1024.0, + 1069.0, + 1024.0, + 1110.0, + 713.0, + 1110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1330.0, + 1069.0, + 1406.0, + 1069.0, + 1406.0, + 1110.0, + 1330.0, + 1110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1099.0, + 991.0, + 1099.0, + 991.0, + 1142.0, + 292.0, + 1142.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1470.0, + 1402.0, + 1470.0, + 1402.0, + 1504.0, + 296.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1500.0, + 1406.0, + 1500.0, + 1406.0, + 1535.0, + 292.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1530.0, + 976.0, + 1530.0, + 976.0, + 1565.0, + 293.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 1530.0, + 1406.0, + 1530.0, + 1406.0, + 1565.0, + 1038.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1560.0, + 629.0, + 1560.0, + 629.0, + 1596.0, + 294.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 651.0, + 1560.0, + 1405.0, + 1560.0, + 1405.0, + 1596.0, + 651.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1591.0, + 696.0, + 1591.0, + 696.0, + 1626.0, + 293.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 1591.0, + 1405.0, + 1591.0, + 1405.0, + 1626.0, + 790.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1620.0, + 576.0, + 1620.0, + 576.0, + 1659.0, + 292.0, + 1659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 1620.0, + 1407.0, + 1620.0, + 1407.0, + 1659.0, + 886.0, + 1659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1653.0, + 433.0, + 1653.0, + 433.0, + 1688.0, + 296.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 1653.0, + 1288.0, + 1653.0, + 1288.0, + 1688.0, + 699.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1795.0, + 853.0, + 1795.0, + 853.0, + 1836.0, + 293.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 1795.0, + 961.0, + 1795.0, + 961.0, + 1836.0, + 885.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 1795.0, + 1405.0, + 1795.0, + 1405.0, + 1836.0, + 991.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1830.0, + 683.0, + 1830.0, + 683.0, + 1866.0, + 294.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 951.0, + 1830.0, + 1405.0, + 1830.0, + 1405.0, + 1866.0, + 951.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1862.0, + 1404.0, + 1862.0, + 1404.0, + 1895.0, + 295.0, + 1895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1891.0, + 1374.0, + 1891.0, + 1374.0, + 1925.0, + 293.0, + 1925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1937.0, + 1407.0, + 1937.0, + 1407.0, + 1975.0, + 294.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1969.0, + 1405.0, + 1969.0, + 1405.0, + 2004.0, + 294.0, + 2004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1999.0, + 296.0, + 1999.0, + 296.0, + 2040.0, + 292.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1999.0, + 668.0, + 1999.0, + 668.0, + 2040.0, + 322.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 1999.0, + 1407.0, + 1999.0, + 1407.0, + 2040.0, + 716.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 272.0, + 614.0, + 272.0, + 614.0, + 310.0, + 295.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 785.0, + 272.0, + 1016.0, + 272.0, + 1016.0, + 310.0, + 785.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1034.0, + 272.0, + 1192.0, + 272.0, + 1192.0, + 310.0, + 1034.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1213.0, + 272.0, + 1364.0, + 272.0, + 1364.0, + 310.0, + 1213.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 272.0, + 1405.0, + 272.0, + 1405.0, + 310.0, + 1394.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 342.0, + 306.0, + 521.0, + 306.0, + 521.0, + 338.0, + 342.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 335.0, + 449.0, + 335.0, + 449.0, + 365.0, + 306.0, + 365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 363.0, + 455.0, + 363.0, + 455.0, + 398.0, + 307.0, + 398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 363.0, + 633.0, + 363.0, + 633.0, + 398.0, + 594.0, + 398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 396.0, + 339.0, + 396.0, + 339.0, + 428.0, + 307.0, + 428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 393.0, + 544.0, + 393.0, + 544.0, + 428.0, + 382.0, + 428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 393.0, + 673.0, + 393.0, + 673.0, + 428.0, + 634.0, + 428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 425.0, + 340.0, + 425.0, + 340.0, + 461.0, + 305.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 462.0, + 339.0, + 462.0, + 339.0, + 495.0, + 308.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 494.0, + 339.0, + 494.0, + 339.0, + 524.0, + 307.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 491.0, + 468.0, + 491.0, + 468.0, + 523.0, + 426.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 602.0, + 491.0, + 640.0, + 491.0, + 640.0, + 523.0, + 602.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 523.0, + 339.0, + 523.0, + 339.0, + 555.0, + 308.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.0, + 521.0, + 865.0, + 521.0, + 865.0, + 555.0, + 466.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 884.0, + 521.0, + 887.0, + 521.0, + 887.0, + 555.0, + 884.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 554.0, + 339.0, + 554.0, + 339.0, + 585.0, + 308.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 549.0, + 521.0, + 549.0, + 521.0, + 592.0, + 517.0, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 549.0, + 1109.0, + 549.0, + 1109.0, + 592.0, + 1106.0, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 584.0, + 339.0, + 584.0, + 339.0, + 616.0, + 307.0, + 616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 581.0, + 738.0, + 581.0, + 738.0, + 619.0, + 467.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 581.0, + 983.0, + 581.0, + 983.0, + 619.0, + 756.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 614.0, + 339.0, + 614.0, + 339.0, + 647.0, + 297.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 644.0, + 340.0, + 644.0, + 340.0, + 677.0, + 297.0, + 677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 675.0, + 339.0, + 675.0, + 339.0, + 708.0, + 295.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 675.0, + 522.0, + 675.0, + 522.0, + 708.0, + 424.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 705.0, + 340.0, + 705.0, + 340.0, + 739.0, + 295.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 699.0, + 595.0, + 699.0, + 595.0, + 743.0, + 422.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 736.0, + 340.0, + 736.0, + 340.0, + 769.0, + 295.0, + 769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 735.0, + 479.0, + 735.0, + 479.0, + 768.0, + 382.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 764.0, + 438.0, + 764.0, + 438.0, + 800.0, + 295.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 338.0, + 780.0, + 350.0, + 780.0, + 350.0, + 789.0, + 338.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 425.0, + 558.0, + 425.0, + 558.0, + 469.0, + 423.0, + 469.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1574, + 1405, + 1574, + 1405, + 1912, + 297, + 1912 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 613, + 1404, + 613, + 1404, + 832, + 298, + 832 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1321, + 1404, + 1321, + 1404, + 1475, + 298, + 1475 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 337, + 1404, + 337, + 1404, + 523, + 298, + 523 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 300, + 846, + 1403, + 846, + 1403, + 970, + 300, + 970 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1104, + 1404, + 1104, + 1404, + 1202, + 298, + 1202 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1401, + 229, + 1401, + 323, + 298, + 323 + ], + "score": 0.963 + }, + { + "category_id": 2, + "poly": [ + 330, + 1940, + 1043, + 1940, + 1043, + 2034, + 330, + 2034 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 507, + 989, + 1193, + 989, + 1193, + 1084, + 507, + 1084 + ], + "score": 0.957 + }, + { + "category_id": 0, + "poly": [ + 300, + 1250, + 557, + 1250, + 557, + 1284, + 300, + 1284 + ], + "score": 0.908 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 816, + 75, + 816, + 104, + 300, + 104 + ], + "score": 0.891 + }, + { + "category_id": 0, + "poly": [ + 299, + 1516, + 489, + 1516, + 489, + 1548, + 299, + 1548 + ], + "score": 0.888 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1022, + 1400, + 1022, + 1400, + 1052, + 1366, + 1052 + ], + "score": 0.874 + }, + { + "category_id": 0, + "poly": [ + 298, + 563, + 970, + 563, + 970, + 596, + 298, + 596 + ], + "score": 0.776 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.759 + }, + { + "category_id": 1, + "poly": [ + 298, + 563, + 970, + 563, + 970, + 596, + 298, + 596 + ], + "score": 0.12 + }, + { + "category_id": 14, + "poly": [ + 508, + 988, + 1192, + 988, + 1192, + 1085, + 508, + 1085 + ], + "score": 0.94, + "latex": "\\operatorname* { m i n } _ { \\theta } \\mathbb { E } _ { ( Z , y ) \\sim \\mathcal { D } , m \\sim \\mathcal { M } } \\left[ \\frac { 1 } { K } \\sum _ { t = 0 } ^ { K - 1 } \\operatorname* { m a x } _ { \\delta _ { t } \\in \\mathcal { T } _ { t } } L \\big ( f _ { \\theta ( m ) } ( X + \\delta _ { t } ) , y \\big ) \\right] ," + }, + { + "category_id": 13, + "poly": [ + 561, + 769, + 803, + 769, + 803, + 806, + 561, + 806 + ], + "score": 0.93, + "latex": "L ( f _ { \\theta ( m _ { t } ) } ( \\boldsymbol { X } + \\delta ) , y )" + }, + { + "category_id": 13, + "poly": [ + 875, + 770, + 944, + 770, + 944, + 804, + 875, + 804 + ], + "score": 0.92, + "latex": "\\theta ( m )" + }, + { + "category_id": 13, + "poly": [ + 772, + 1938, + 1039, + 1938, + 1039, + 1977, + 772, + 1977 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\operatorname* { m i n } \\{ K , \\lceil \\frac { \\epsilon - \\mathbb { E } [ \\| \\delta _ { 0 } \\| ] } { \\alpha } \\rceil + 1 \\} } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 913, + 1103, + 1401, + 1103, + 1401, + 1145, + 913, + 1145 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\frac { 1 } { K } \\sum _ { t = 0 } ^ { K - 1 } \\operatorname* { m a x } _ { \\delta _ { t } \\in \\mathcal { T } _ { t } } L ( f _ { \\theta ( m _ { 0 } ) } ( X + \\delta _ { t } ) , y ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 801, + 737, + 855, + 737, + 855, + 768, + 801, + 768 + ], + "score": 0.91, + "latex": "\\delta _ { t - 1 }" + }, + { + "category_id": 13, + "poly": [ + 1050, + 737, + 1394, + 737, + 1394, + 773, + 1050, + 773 + ], + "score": 0.91, + "latex": "\\nabla _ { \\delta } L \\big ( f _ { \\theta ( m _ { t - 1 } ) } \\big ( \\boldsymbol { X } + \\delta _ { t - 1 } \\big ) , \\boldsymbol { y } \\big )" + }, + { + "category_id": 13, + "poly": [ + 888, + 737, + 915, + 737, + 915, + 767, + 888, + 767 + ], + "score": 0.88, + "latex": "\\delta _ { t }" + }, + { + "category_id": 13, + "poly": [ + 328, + 771, + 355, + 771, + 355, + 801, + 328, + 801 + ], + "score": 0.87, + "latex": "\\delta _ { t }" + }, + { + "category_id": 13, + "poly": [ + 1062, + 707, + 1276, + 707, + 1276, + 737, + 1062, + 737 + ], + "score": 0.81, + "latex": "m _ { i } \\sim \\mathrm { B e r n o u l l i } ( p )" + }, + { + "category_id": 13, + "poly": [ + 963, + 1147, + 1006, + 1147, + 1006, + 1170, + 963, + 1170 + ], + "score": 0.81, + "latex": "m _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 984, + 262, + 1014, + 262, + 1014, + 289, + 984, + 289 + ], + "score": 0.81, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 862, + 492, + 891, + 492, + 891, + 518, + 862, + 518 + ], + "score": 0.8, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 1100, + 370, + 1130, + 370, + 1130, + 396, + 1100, + 396 + ], + "score": 0.8, + "latex": "\\boldsymbol { X }" + }, + { + "category_id": 13, + "poly": [ + 554, + 880, + 573, + 880, + 573, + 906, + 554, + 906 + ], + "score": 0.78, + "latex": "\\pmb \\theta" + }, + { + "category_id": 13, + "poly": [ + 595, + 262, + 625, + 262, + 625, + 289, + 595, + 289 + ], + "score": 0.77, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 1226, + 676, + 1244, + 676, + 1244, + 704, + 1226, + 704 + ], + "score": 0.69, + "latex": "\\delta" + }, + { + "category_id": 13, + "poly": [ + 822, + 853, + 853, + 853, + 853, + 876, + 822, + 876 + ], + "score": 0.68, + "latex": "_ { \\mathbf { \\nabla } } \\mathbf { m }" + }, + { + "category_id": 13, + "poly": [ + 363, + 805, + 394, + 805, + 394, + 828, + 363, + 828 + ], + "score": 0.63, + "latex": "_ { m }" + }, + { + "category_id": 13, + "poly": [ + 852, + 711, + 884, + 711, + 884, + 734, + 852, + 734 + ], + "score": 0.58, + "latex": "_ { m }" + }, + { + "category_id": 13, + "poly": [ + 939, + 298, + 953, + 298, + 953, + 319, + 939, + 319 + ], + "score": 0.54, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1240, + 707, + 1275, + 707, + 1275, + 738, + 1240, + 738 + ], + "score": 0.31, + "latex": "( p )" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1927.0, + 771.0, + 1927.0, + 771.0, + 1983.0, + 325.0, + 1983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 1927.0, + 1053.0, + 1927.0, + 1053.0, + 1983.0, + 1040.0, + 1983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1970.0, + 878.0, + 1970.0, + 878.0, + 2007.0, + 330.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 2002.0, + 688.0, + 2002.0, + 688.0, + 2038.0, + 331.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1247.0, + 561.0, + 1247.0, + 561.0, + 1290.0, + 293.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 817.0, + 72.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1513.0, + 494.0, + 1513.0, + 494.0, + 1553.0, + 294.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 562.0, + 973.0, + 562.0, + 973.0, + 598.0, + 294.0, + 598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 861.0, + 2085.0, + 861.0, + 2120.0, + 839.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1570.0, + 1405.0, + 1570.0, + 1405.0, + 1612.0, + 294.0, + 1612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1606.0, + 1405.0, + 1606.0, + 1405.0, + 1641.0, + 295.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1636.0, + 1403.0, + 1636.0, + 1403.0, + 1671.0, + 294.0, + 1671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1666.0, + 1406.0, + 1666.0, + 1406.0, + 1703.0, + 294.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1697.0, + 1406.0, + 1697.0, + 1406.0, + 1732.0, + 296.0, + 1732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1724.0, + 1406.0, + 1724.0, + 1406.0, + 1764.0, + 291.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1757.0, + 1407.0, + 1757.0, + 1407.0, + 1795.0, + 292.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1789.0, + 1403.0, + 1789.0, + 1403.0, + 1824.0, + 295.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1819.0, + 1405.0, + 1819.0, + 1405.0, + 1854.0, + 294.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1848.0, + 1406.0, + 1848.0, + 1406.0, + 1886.0, + 294.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1879.0, + 1405.0, + 1879.0, + 1405.0, + 1916.0, + 295.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 614.0, + 1405.0, + 614.0, + 1405.0, + 649.0, + 296.0, + 649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 643.0, + 1405.0, + 643.0, + 1405.0, + 684.0, + 292.0, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 675.0, + 1225.0, + 675.0, + 1225.0, + 710.0, + 294.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1245.0, + 675.0, + 1402.0, + 675.0, + 1402.0, + 710.0, + 1245.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 706.0, + 851.0, + 706.0, + 851.0, + 741.0, + 294.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 706.0, + 1061.0, + 706.0, + 1061.0, + 741.0, + 885.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1277.0, + 706.0, + 1406.0, + 706.0, + 1406.0, + 741.0, + 1277.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 731.0, + 800.0, + 731.0, + 800.0, + 777.0, + 291.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 856.0, + 731.0, + 887.0, + 731.0, + 887.0, + 777.0, + 856.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 916.0, + 731.0, + 1049.0, + 731.0, + 1049.0, + 777.0, + 916.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 731.0, + 1406.0, + 731.0, + 1406.0, + 777.0, + 1395.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 767.0, + 327.0, + 767.0, + 327.0, + 808.0, + 292.0, + 808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 767.0, + 560.0, + 767.0, + 560.0, + 808.0, + 356.0, + 808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 767.0, + 874.0, + 767.0, + 874.0, + 808.0, + 804.0, + 808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 767.0, + 1406.0, + 767.0, + 1406.0, + 808.0, + 945.0, + 808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 798.0, + 362.0, + 798.0, + 362.0, + 835.0, + 294.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 798.0, + 405.0, + 798.0, + 405.0, + 835.0, + 395.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1321.0, + 1406.0, + 1321.0, + 1406.0, + 1358.0, + 294.0, + 1358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1353.0, + 1405.0, + 1353.0, + 1405.0, + 1386.0, + 296.0, + 1386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1379.0, + 1404.0, + 1379.0, + 1404.0, + 1418.0, + 293.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1413.0, + 1405.0, + 1413.0, + 1405.0, + 1450.0, + 294.0, + 1450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1443.0, + 865.0, + 1443.0, + 865.0, + 1479.0, + 293.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 334.0, + 1405.0, + 334.0, + 1405.0, + 375.0, + 293.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 369.0, + 1099.0, + 369.0, + 1099.0, + 401.0, + 292.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 369.0, + 1405.0, + 369.0, + 1405.0, + 401.0, + 1131.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 397.0, + 1405.0, + 397.0, + 1405.0, + 435.0, + 292.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 427.0, + 1404.0, + 427.0, + 1404.0, + 464.0, + 293.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 459.0, + 1405.0, + 459.0, + 1405.0, + 494.0, + 295.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 489.0, + 861.0, + 489.0, + 861.0, + 527.0, + 293.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 489.0, + 1343.0, + 489.0, + 1343.0, + 527.0, + 892.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 844.0, + 821.0, + 844.0, + 821.0, + 882.0, + 294.0, + 882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 854.0, + 844.0, + 1403.0, + 844.0, + 1403.0, + 882.0, + 854.0, + 882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 879.0, + 553.0, + 879.0, + 553.0, + 911.0, + 296.0, + 911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 879.0, + 1405.0, + 879.0, + 1405.0, + 911.0, + 574.0, + 911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 909.0, + 1407.0, + 909.0, + 1407.0, + 945.0, + 294.0, + 945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 938.0, + 750.0, + 938.0, + 750.0, + 973.0, + 293.0, + 973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1100.0, + 912.0, + 1100.0, + 912.0, + 1158.0, + 288.0, + 1158.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1100.0, + 1410.0, + 1100.0, + 1410.0, + 1158.0, + 1402.0, + 1158.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1137.0, + 962.0, + 1137.0, + 962.0, + 1174.0, + 295.0, + 1174.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 1137.0, + 1406.0, + 1137.0, + 1406.0, + 1174.0, + 1007.0, + 1174.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1168.0, + 1186.0, + 1168.0, + 1186.0, + 1205.0, + 293.0, + 1205.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 227.0, + 1405.0, + 227.0, + 1405.0, + 266.0, + 292.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 259.0, + 594.0, + 259.0, + 594.0, + 295.0, + 292.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 626.0, + 259.0, + 983.0, + 259.0, + 983.0, + 295.0, + 626.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1015.0, + 259.0, + 1406.0, + 259.0, + 1406.0, + 295.0, + 1015.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 292.0, + 938.0, + 292.0, + 938.0, + 325.0, + 294.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 292.0, + 965.0, + 292.0, + 965.0, + 325.0, + 954.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 562.0, + 973.0, + 562.0, + 973.0, + 598.0, + 294.0, + 598.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 302, + 581, + 1403, + 581, + 1403, + 865, + 302, + 865 + ], + "score": 0.981, + "html": "
ModelScoreCoLA8.5kSST-267kMRPC3.7kSTS-B7kQQP364kMNLI-m/mm393kQNLI108kRTE2.5kWNLI634AX
BERT-base178.352.193.588.9/84.887.1/85.871.2/89.284.6/83.490.566.465.134.2
FreeLB-BERT79.454.593.688.1/83.587.7/86.772.7/89.685.7/84.691.870.165.136.9
MT-DNN287.668.496.592.7/90.391.1/90.773.7789.987.9/87.496.086.389.042.8
XLNet-Large88.467.896.893.0/90.791.6/91.174.2/90.390.2/89.898.686.390.447.5
RoBERTa488.567.896.792.3/89.892.2/91.974.3/90.290.8/90.298.988.289.048.7
FreeLB-RoB88.868.096.893.1/90.892.4/92.274.8/90.391.1/90.798.888.789.050.1
Human87.166.497.886.3/80.892.7/92.659.5/80.492.0/92.891.293.695.91
" + }, + { + "category_id": 5, + "poly": [ + 330, + 223, + 1362, + 223, + 1362, + 437, + 330, + 437 + ], + "score": 0.979, + "html": "
MethodMNLI(Acc)QNLI(Acc)QQP(Acc)RTE(Acc)SST-2(Acc)MRPC(Acc)CoLA(Mcc)STS-B(Pearson)
Reported90.294.792.286.696.490.968.092.4
ReImp11-85.61 (1.7)96.56 (.3)90.69(.5)67.57 (1.3)92.20 (.2)
PGD90.53 (.2)94.87 (.2)92.49 (.07)87.41 (.9)96.44 (.1)90.93 (.2)69.67 (1.2)92.43 (7.)
FreeAT90.02 (.2)94.66 (.2)92.48(.08)86.69 (15.)96.10 (.2)90.69 (.4)68.80 (1.3)92.40 (.3)
FreeLB90.61 (.1)94.98 (.2)92.60 (.03)88.13 (1.2)96.79 (.2)91.42 (.7)71.12 (.9)92.67 (.08)
" + }, + { + "category_id": 1, + "poly": [ + 299, + 1609, + 1404, + 1609, + 1404, + 1764, + 299, + 1764 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 1858, + 1402, + 1858, + 1402, + 1982, + 298, + 1982 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 298, + 1144, + 1404, + 1144, + 1404, + 1299, + 298, + 1299 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 299, + 1067, + 1399, + 1067, + 1399, + 1129, + 299, + 1129 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 303, + 1407, + 1406, + 1407, + 1406, + 1501, + 303, + 1501 + ], + "score": 0.937 + }, + { + "category_id": 2, + "poly": [ + 333, + 2005, + 762, + 2005, + 762, + 2034, + 333, + 2034 + ], + "score": 0.913 + }, + { + "category_id": 1, + "poly": [ + 305, + 1516, + 1079, + 1516, + 1079, + 1548, + 305, + 1548 + ], + "score": 0.909 + }, + { + "category_id": 1, + "poly": [ + 301, + 1314, + 1062, + 1314, + 1062, + 1346, + 301, + 1346 + ], + "score": 0.904 + }, + { + "category_id": 0, + "poly": [ + 299, + 1800, + 668, + 1800, + 668, + 1832, + 299, + 1832 + ], + "score": 0.898 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.897 + }, + { + "category_id": 1, + "poly": [ + 298, + 1361, + 905, + 1361, + 905, + 1393, + 298, + 1393 + ], + "score": 0.879 + }, + { + "category_id": 1, + "poly": [ + 302, + 1562, + 1071, + 1562, + 1071, + 1596, + 302, + 1596 + ], + "score": 0.864 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 859, + 2089, + 859, + 2112, + 840, + 2112 + ], + "score": 0.775 + }, + { + "category_id": 6, + "poly": [ + 297, + 876, + 1405, + 876, + 1405, + 1015, + 297, + 1015 + ], + "score": 0.653 + }, + { + "category_id": 6, + "poly": [ + 297, + 445, + 1404, + 445, + 1404, + 558, + 297, + 558 + ], + "score": 0.614 + }, + { + "category_id": 1, + "poly": [ + 297, + 445, + 1404, + 445, + 1404, + 558, + 297, + 558 + ], + "score": 0.4 + }, + { + "category_id": 13, + "poly": [ + 724, + 1926, + 747, + 1926, + 747, + 1947, + 724, + 1947 + ], + "score": 0.76, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 1004, + 1926, + 1033, + 1926, + 1033, + 1948, + 1004, + 1948 + ], + "score": 0.68, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 810, + 1565, + 851, + 1565, + 851, + 1594, + 810, + 1594 + ], + "score": 0.35, + "latex": "( D )" + }, + { + "category_id": 13, + "poly": [ + 747, + 1363, + 789, + 1363, + 789, + 1393, + 747, + 1393 + ], + "score": 0.34, + "latex": "( D )" + }, + { + "category_id": 13, + "poly": [ + 519, + 1363, + 556, + 1363, + 556, + 1393, + 519, + 1393 + ], + "score": 0.33, + "latex": "( B )" + }, + { + "category_id": 13, + "poly": [ + 623, + 1363, + 663, + 1363, + 663, + 1393, + 623, + 1393 + ], + "score": 0.3, + "latex": "( C )" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 2000.0, + 764.0, + 2000.0, + 764.0, + 2039.0, + 332.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1800.0, + 671.0, + 1800.0, + 671.0, + 1836.0, + 295.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2087.0, + 862.0, + 2087.0, + 862.0, + 2118.0, + 840.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 873.0, + 1403.0, + 873.0, + 1403.0, + 907.0, + 295.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 903.0, + 1405.0, + 903.0, + 1405.0, + 934.0, + 295.0, + 934.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 931.0, + 1405.0, + 931.0, + 1405.0, + 962.0, + 294.0, + 962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 953.0, + 1407.0, + 953.0, + 1407.0, + 994.0, + 290.0, + 994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 984.0, + 383.0, + 984.0, + 383.0, + 1018.0, + 292.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 443.0, + 1405.0, + 443.0, + 1405.0, + 479.0, + 295.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 474.0, + 1404.0, + 474.0, + 1404.0, + 503.0, + 295.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 500.0, + 1405.0, + 500.0, + 1405.0, + 531.0, + 293.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 525.0, + 1189.0, + 525.0, + 1189.0, + 561.0, + 294.0, + 561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1607.0, + 1406.0, + 1607.0, + 1406.0, + 1647.0, + 293.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1639.0, + 1406.0, + 1639.0, + 1406.0, + 1677.0, + 293.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1672.0, + 1404.0, + 1672.0, + 1404.0, + 1705.0, + 294.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1698.0, + 1406.0, + 1698.0, + 1406.0, + 1738.0, + 292.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1729.0, + 870.0, + 1729.0, + 870.0, + 1768.0, + 293.0, + 1768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1856.0, + 1404.0, + 1856.0, + 1404.0, + 1893.0, + 293.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1890.0, + 1404.0, + 1890.0, + 1404.0, + 1922.0, + 293.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1919.0, + 723.0, + 1919.0, + 723.0, + 1955.0, + 293.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 748.0, + 1919.0, + 1003.0, + 1919.0, + 1003.0, + 1955.0, + 748.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1034.0, + 1919.0, + 1404.0, + 1919.0, + 1404.0, + 1955.0, + 1034.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1949.0, + 1406.0, + 1949.0, + 1406.0, + 1984.0, + 293.0, + 1984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1146.0, + 1405.0, + 1146.0, + 1405.0, + 1179.0, + 296.0, + 1179.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1175.0, + 1405.0, + 1175.0, + 1405.0, + 1212.0, + 292.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1204.0, + 1406.0, + 1204.0, + 1406.0, + 1245.0, + 293.0, + 1245.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1237.0, + 1402.0, + 1237.0, + 1402.0, + 1275.0, + 293.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1265.0, + 832.0, + 1265.0, + 832.0, + 1305.0, + 293.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1066.0, + 1404.0, + 1066.0, + 1404.0, + 1102.0, + 294.0, + 1102.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1099.0, + 701.0, + 1099.0, + 701.0, + 1131.0, + 296.0, + 1131.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1408.0, + 1405.0, + 1408.0, + 1405.0, + 1442.0, + 298.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1436.0, + 1406.0, + 1436.0, + 1406.0, + 1477.0, + 294.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1469.0, + 523.0, + 1469.0, + 523.0, + 1503.0, + 295.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 304.0, + 1514.0, + 1081.0, + 1514.0, + 1081.0, + 1554.0, + 304.0, + 1554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1314.0, + 1063.0, + 1314.0, + 1063.0, + 1350.0, + 298.0, + 1350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1359.0, + 518.0, + 1359.0, + 518.0, + 1399.0, + 295.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 557.0, + 1359.0, + 622.0, + 1359.0, + 622.0, + 1399.0, + 557.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 1359.0, + 746.0, + 1359.0, + 746.0, + 1399.0, + 664.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 1359.0, + 905.0, + 1359.0, + 905.0, + 1399.0, + 790.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1560.0, + 809.0, + 1560.0, + 809.0, + 1602.0, + 294.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 852.0, + 1560.0, + 1076.0, + 1560.0, + 1076.0, + 1602.0, + 852.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 443.0, + 1405.0, + 443.0, + 1405.0, + 479.0, + 295.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 474.0, + 1404.0, + 474.0, + 1404.0, + 503.0, + 295.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 500.0, + 1405.0, + 500.0, + 1405.0, + 531.0, + 293.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 525.0, + 1189.0, + 525.0, + 1189.0, + 561.0, + 294.0, + 561.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 296, + 223, + 1403, + 223, + 1403, + 453, + 296, + 453 + ], + "score": 0.981, + "html": "
ARC-Easy ARC-Challenge ARC-Merge CQADev Test Dev Test Dev Test Dev Test Test (E)
TestDevTestDevTest DevTest
RoBERTa(Reported)------78.4372.172.5
RoBERTa (ReImp)84.3984.1364.5464.4477.8377.6277.56--
FreeLB-RoBERTa84.9184.8165.8965.3678.3778.3978.8172.273.1
AristoRoBERTaV7(MTL):85.02-66.47-78.89--:
XLNet +RoBERTa (MTL+Ens)---67.06--二二二
FreeLB-RoBERTa(MTL)84.9185.4470.2367.7579.8679.60---
" + }, + { + "category_id": 1, + "poly": [ + 298, + 1402, + 1403, + 1402, + 1403, + 1586, + 298, + 1586 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 973, + 1403, + 973, + 1403, + 1188, + 297, + 1188 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1203, + 1403, + 1203, + 1403, + 1386, + 298, + 1386 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 774, + 1403, + 774, + 1403, + 958, + 298, + 958 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 297, + 1601, + 1403, + 1601, + 1403, + 1785, + 297, + 1785 + ], + "score": 0.969 + }, + { + "category_id": 2, + "poly": [ + 295, + 1826, + 1401, + 1826, + 1401, + 2035, + 295, + 2035 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 301, + 666, + 1397, + 666, + 1397, + 758, + 301, + 758 + ], + "score": 0.938 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 105, + 300, + 105 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2111, + 841, + 2111 + ], + "score": 0.664 + }, + { + "category_id": 6, + "poly": [ + 297, + 463, + 1404, + 463, + 1404, + 603, + 297, + 603 + ], + "score": 0.533 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2111, + 841, + 2111 + ], + "score": 0.263 + }, + { + "category_id": 13, + "poly": [ + 968, + 1126, + 1149, + 1126, + 1149, + 1155, + 968, + 1155 + ], + "score": 0.9, + "latex": "8 4 . 8 1 \\% / 6 5 . 3 6 \\%" + }, + { + "category_id": 13, + "poly": [ + 874, + 865, + 915, + 865, + 915, + 898, + 874, + 898 + ], + "score": 0.9, + "latex": "\\langle / s \\rangle" + }, + { + "category_id": 13, + "poly": [ + 1102, + 865, + 1145, + 865, + 1145, + 899, + 1102, + 899 + ], + "score": 0.9, + "latex": "\\langle / \\mathrm { s } \\rangle" + }, + { + "category_id": 13, + "poly": [ + 839, + 1096, + 1021, + 1096, + 1021, + 1125, + 839, + 1125 + ], + "score": 0.89, + "latex": "8 4 . 1 3 \\% / 6 4 . 4 4 \\%" + }, + { + "category_id": 13, + "poly": [ + 1010, + 865, + 1044, + 865, + 1044, + 899, + 1010, + 899 + ], + "score": 0.89, + "latex": "\\langle \\mathbf { s } \\rangle" + }, + { + "category_id": 13, + "poly": [ + 889, + 1325, + 979, + 1325, + 979, + 1354, + 889, + 1354 + ], + "score": 0.88, + "latex": "6 7 . 7 5 \\%" + }, + { + "category_id": 13, + "poly": [ + 1265, + 1004, + 1355, + 1004, + 1355, + 1033, + 1265, + 1033 + ], + "score": 0.88, + "latex": "8 5 . 7 0 \\%" + }, + { + "category_id": 13, + "poly": [ + 297, + 1034, + 386, + 1034, + 386, + 1064, + 297, + 1064 + ], + "score": 0.88, + "latex": "8 5 . 2 4 \\%" + }, + { + "category_id": 13, + "poly": [ + 1074, + 1664, + 1163, + 1664, + 1163, + 1692, + 1074, + 1692 + ], + "score": 0.88, + "latex": "7 8 . 4 3 \\%" + }, + { + "category_id": 13, + "poly": [ + 1086, + 1602, + 1175, + 1602, + 1175, + 1631, + 1086, + 1631 + ], + "score": 0.88, + "latex": "7 7 . 5 6 \\%" + }, + { + "category_id": 13, + "poly": [ + 962, + 1633, + 1051, + 1633, + 1051, + 1662, + 962, + 1662 + ], + "score": 0.88, + "latex": "7 8 . 8 1 \\%" + }, + { + "category_id": 13, + "poly": [ + 1085, + 1634, + 1160, + 1634, + 1160, + 1661, + 1085, + 1661 + ], + "score": 0.87, + "latex": "1 . 2 5 \\%" + }, + { + "category_id": 13, + "poly": [ + 400, + 1724, + 477, + 1724, + 477, + 1753, + 400, + 1753 + ], + "score": 0.86, + "latex": "7 2 . 2 \\%" + }, + { + "category_id": 13, + "poly": [ + 1318, + 1723, + 1393, + 1723, + 1393, + 1753, + 1318, + 1753 + ], + "score": 0.86, + "latex": "7 3 . 1 \\%" + }, + { + "category_id": 13, + "poly": [ + 1155, + 1524, + 1219, + 1524, + 1219, + 1558, + 1155, + 1558 + ], + "score": 0.86, + "latex": "\\langle / s \\rangle A" + }, + { + "category_id": 13, + "poly": [ + 1340, + 1524, + 1392, + 1524, + 1392, + 1558, + 1340, + 1558 + ], + "score": 0.86, + "latex": "\\langle \\langle s \\rangle ^ { \\ast } \\cdot \\mathbf { \\vec { \\mathbf { \\mu } } }" + }, + { + "category_id": 13, + "poly": [ + 298, + 865, + 332, + 865, + 332, + 898, + 298, + 898 + ], + "score": 0.86, + "latex": "\\langle s \\rangle" + }, + { + "category_id": 13, + "poly": [ + 297, + 1355, + 386, + 1355, + 386, + 1385, + 297, + 1385 + ], + "score": 0.84, + "latex": "8 5 . 4 4 \\%" + }, + { + "category_id": 13, + "poly": [ + 591, + 866, + 634, + 866, + 634, + 899, + 591, + 899 + ], + "score": 0.81, + "latex": "\\langle / s \\rangle" + }, + { + "category_id": 13, + "poly": [ + 749, + 869, + 775, + 869, + 775, + 894, + 749, + 894 + ], + "score": 0.74, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 373, + 1556, + 404, + 1556, + 404, + 1586, + 373, + 1586 + ], + "score": 0.73, + "latex": "\\cdot _ { Q }" + }, + { + "category_id": 13, + "poly": [ + 1381, + 494, + 1403, + 494, + 1403, + 517, + 1381, + 517 + ], + "score": 0.65, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 296, + 1525, + 372, + 1525, + 372, + 1558, + 296, + 1558 + ], + "score": 0.59, + "latex": "{ \\mathfrak { n } } ( s ) Q" + }, + { + "category_id": 13, + "poly": [ + 474, + 1556, + 502, + 1556, + 502, + 1582, + 474, + 1582 + ], + "score": 0.49, + "latex": "^ { , } A" + }, + { + "category_id": 13, + "poly": [ + 410, + 520, + 526, + 520, + 526, + 548, + 410, + 548 + ], + "score": 0.29, + "latex": "\\left( \\mathbf { M } \\mathbf { T } \\mathbf { L } { + } \\mathbf { E } \\mathbf { n } \\mathbf { s } \\right)" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1821.0, + 1403.0, + 1821.0, + 1403.0, + 1867.0, + 328.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1858.0, + 443.0, + 1858.0, + 443.0, + 1886.0, + 297.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1881.0, + 817.0, + 1881.0, + 817.0, + 1920.0, + 329.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1911.0, + 838.0, + 1911.0, + 838.0, + 1955.0, + 326.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1938.0, + 1329.0, + 1938.0, + 1329.0, + 1986.0, + 318.0, + 1986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1975.0, + 495.0, + 1975.0, + 495.0, + 2007.0, + 295.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1999.0, + 1165.0, + 1999.0, + 1165.0, + 2042.0, + 319.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 71.0, + 817.0, + 71.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2118.0, + 839.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 459.0, + 1406.0, + 459.0, + 1406.0, + 496.0, + 294.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 493.0, + 1380.0, + 493.0, + 1380.0, + 520.0, + 297.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 519.0, + 409.0, + 519.0, + 409.0, + 550.0, + 295.0, + 550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 527.0, + 519.0, + 1405.0, + 519.0, + 1405.0, + 550.0, + 527.0, + 550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 547.0, + 1402.0, + 547.0, + 1402.0, + 578.0, + 295.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 570.0, + 1391.0, + 570.0, + 1391.0, + 609.0, + 292.0, + 609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2119.0, + 840.0, + 2119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1400.0, + 1405.0, + 1400.0, + 1405.0, + 1437.0, + 294.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1434.0, + 1404.0, + 1434.0, + 1404.0, + 1466.0, + 296.0, + 1466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1465.0, + 1404.0, + 1465.0, + 1404.0, + 1497.0, + 296.0, + 1497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1491.0, + 1405.0, + 1491.0, + 1405.0, + 1531.0, + 293.0, + 1531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 373.0, + 1521.0, + 1154.0, + 1521.0, + 1154.0, + 1564.0, + 373.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1220.0, + 1521.0, + 1339.0, + 1521.0, + 1339.0, + 1564.0, + 1220.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1393.0, + 1521.0, + 1407.0, + 1521.0, + 1407.0, + 1564.0, + 1393.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1554.0, + 372.0, + 1554.0, + 372.0, + 1589.0, + 294.0, + 1589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 405.0, + 1554.0, + 473.0, + 1554.0, + 473.0, + 1589.0, + 405.0, + 1589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 503.0, + 1554.0, + 1098.0, + 1554.0, + 1098.0, + 1589.0, + 503.0, + 1589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 975.0, + 1405.0, + 975.0, + 1405.0, + 1005.0, + 296.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1003.0, + 1264.0, + 1003.0, + 1264.0, + 1037.0, + 293.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1356.0, + 1003.0, + 1405.0, + 1003.0, + 1405.0, + 1037.0, + 1356.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 387.0, + 1032.0, + 1405.0, + 1032.0, + 1405.0, + 1068.0, + 387.0, + 1068.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1063.0, + 1405.0, + 1063.0, + 1405.0, + 1100.0, + 294.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1095.0, + 838.0, + 1095.0, + 838.0, + 1130.0, + 295.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1022.0, + 1095.0, + 1404.0, + 1095.0, + 1404.0, + 1130.0, + 1022.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1126.0, + 967.0, + 1126.0, + 967.0, + 1160.0, + 295.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 1126.0, + 1405.0, + 1126.0, + 1405.0, + 1160.0, + 1150.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1157.0, + 982.0, + 1157.0, + 982.0, + 1191.0, + 295.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1202.0, + 1405.0, + 1202.0, + 1405.0, + 1238.0, + 294.0, + 1238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1230.0, + 1405.0, + 1230.0, + 1405.0, + 1269.0, + 293.0, + 1269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1258.0, + 1407.0, + 1258.0, + 1407.0, + 1302.0, + 292.0, + 1302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1292.0, + 1405.0, + 1292.0, + 1405.0, + 1329.0, + 293.0, + 1329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1324.0, + 888.0, + 1324.0, + 888.0, + 1359.0, + 293.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 1324.0, + 1405.0, + 1324.0, + 1405.0, + 1359.0, + 980.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1353.0, + 296.0, + 1353.0, + 296.0, + 1389.0, + 292.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 387.0, + 1353.0, + 1325.0, + 1353.0, + 1325.0, + 1389.0, + 387.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 771.0, + 1405.0, + 771.0, + 1405.0, + 809.0, + 293.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 804.0, + 1405.0, + 804.0, + 1405.0, + 839.0, + 294.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 833.0, + 1405.0, + 833.0, + 1405.0, + 869.0, + 293.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 865.0, + 590.0, + 865.0, + 590.0, + 900.0, + 333.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 865.0, + 748.0, + 865.0, + 748.0, + 900.0, + 635.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 776.0, + 865.0, + 873.0, + 865.0, + 873.0, + 900.0, + 776.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 916.0, + 865.0, + 1009.0, + 865.0, + 1009.0, + 900.0, + 916.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 865.0, + 1101.0, + 865.0, + 1101.0, + 900.0, + 1045.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1146.0, + 865.0, + 1404.0, + 865.0, + 1404.0, + 900.0, + 1146.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 891.0, + 1407.0, + 891.0, + 1407.0, + 932.0, + 292.0, + 932.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 923.0, + 1205.0, + 923.0, + 1205.0, + 965.0, + 292.0, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1602.0, + 1085.0, + 1602.0, + 1085.0, + 1633.0, + 296.0, + 1633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 1602.0, + 1404.0, + 1602.0, + 1404.0, + 1633.0, + 1176.0, + 1633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1631.0, + 961.0, + 1631.0, + 961.0, + 1668.0, + 292.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 1631.0, + 1084.0, + 1631.0, + 1084.0, + 1668.0, + 1052.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1161.0, + 1631.0, + 1404.0, + 1631.0, + 1404.0, + 1668.0, + 1161.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1663.0, + 1073.0, + 1663.0, + 1073.0, + 1697.0, + 292.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1164.0, + 1663.0, + 1405.0, + 1663.0, + 1405.0, + 1697.0, + 1164.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1692.0, + 1405.0, + 1692.0, + 1405.0, + 1726.0, + 292.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1721.0, + 399.0, + 1721.0, + 399.0, + 1760.0, + 293.0, + 1760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 478.0, + 1721.0, + 1317.0, + 1721.0, + 1317.0, + 1760.0, + 478.0, + 1760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1721.0, + 1408.0, + 1721.0, + 1408.0, + 1760.0, + 1394.0, + 1760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1753.0, + 1234.0, + 1753.0, + 1234.0, + 1788.0, + 295.0, + 1788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 666.0, + 1402.0, + 666.0, + 1402.0, + 700.0, + 297.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 696.0, + 1403.0, + 696.0, + 1403.0, + 730.0, + 295.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 728.0, + 1212.0, + 728.0, + 1212.0, + 761.0, + 296.0, + 761.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1346, + 1404, + 1346, + 1404, + 1531, + 298, + 1531 + ], + "score": 0.981 + }, + { + "category_id": 5, + "poly": [ + 296, + 484, + 1404, + 484, + 1404, + 661, + 296, + 661 + ], + "score": 0.979, + "html": "
MethodsRTECoLAMRPC
M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-3)M-Inc (R)(10-3)N-Loss(10-3)
Vanilla5.15.34.56.15.75.210.210.21.9
PGD4.74.96.2128.2130.1436.15.75.75.4
FreeLB3.02.64.11.41.37.23.63.62.7
" + }, + { + "category_id": 1, + "poly": [ + 297, + 1545, + 1403, + 1545, + 1403, + 1762, + 297, + 1762 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 908, + 1403, + 908, + 1403, + 1061, + 298, + 1061 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1075, + 1403, + 1075, + 1403, + 1200, + 298, + 1200 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1776, + 1404, + 1776, + 1404, + 1929, + 298, + 1929 + ], + "score": 0.969 + }, + { + "category_id": 5, + "poly": [ + 393, + 224, + 1299, + 224, + 1299, + 350, + 393, + 350 + ], + "score": 0.965, + "html": "
MethodsVanillaFreeLB-3*FreeLB-3YOPO-3-2YOPO-3-3
RTE85.61 (1.67)87.14 (1.29)88.13 (1.21)87.05 (1.36)87.05 (0.20)
CoLA67.57 (1.30)69.31 (1.16)71.12 (0.90)70.40 (0.91)69.91 (1.16)
MRPC90.69 (0.54)90.93 (0.66)91.42 (0.72)90.44 (0.62)90.69 (0.37)
" + }, + { + "category_id": 1, + "poly": [ + 297, + 1214, + 1400, + 1214, + 1400, + 1276, + 297, + 1276 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 524, + 1284, + 1174, + 1284, + 1174, + 1338, + 524, + 1338 + ], + "score": 0.946 + }, + { + "category_id": 2, + "poly": [ + 297, + 1949, + 1402, + 1949, + 1402, + 2033, + 297, + 2033 + ], + "score": 0.939 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.901 + }, + { + "category_id": 0, + "poly": [ + 301, + 851, + 769, + 851, + 769, + 882, + 301, + 882 + ], + "score": 0.895 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1289, + 1399, + 1289, + 1399, + 1318, + 1366, + 1318 + ], + "score": 0.887 + }, + { + "category_id": 1, + "poly": [ + 297, + 672, + 1405, + 672, + 1405, + 813, + 297, + 813 + ], + "score": 0.848 + }, + { + "category_id": 6, + "poly": [ + 301, + 359, + 1399, + 359, + 1399, + 471, + 301, + 471 + ], + "score": 0.826 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2112, + 840, + 2112 + ], + "score": 0.804 + }, + { + "category_id": 1, + "poly": [ + 301, + 359, + 1399, + 359, + 1399, + 471, + 301, + 471 + ], + "score": 0.226 + }, + { + "category_id": 13, + "poly": [ + 1037, + 1698, + 1196, + 1698, + 1196, + 1732, + 1037, + 1732 + ], + "score": 0.95, + "latex": "{ \\Delta } L _ { \\mathrm { m a x } } ( \\boldsymbol { X } , \\epsilon )" + }, + { + "category_id": 13, + "poly": [ + 794, + 1377, + 952, + 1377, + 952, + 1411, + 794, + 1411 + ], + "score": 0.94, + "latex": "{ \\Delta } L _ { \\mathrm { m a x } } ( \\boldsymbol { X } , \\boldsymbol { \\epsilon } )" + }, + { + "category_id": 13, + "poly": [ + 1150, + 1577, + 1309, + 1577, + 1309, + 1610, + 1150, + 1610 + ], + "score": 0.93, + "latex": "{ \\Delta } L _ { \\mathrm { m a x } } ( \\boldsymbol { X } , \\epsilon )" + }, + { + "category_id": 13, + "poly": [ + 1241, + 1469, + 1400, + 1469, + 1400, + 1503, + 1241, + 1503 + ], + "score": 0.92, + "latex": "{ \\Delta } L _ { \\mathrm { m a x } } ( X , \\epsilon )" + }, + { + "category_id": 13, + "poly": [ + 432, + 1408, + 602, + 1408, + 602, + 1442, + 432, + 1442 + ], + "score": 0.92, + "latex": "\\epsilon = 0 . 0 1 \\| X \\| _ { F }" + }, + { + "category_id": 14, + "poly": [ + 525, + 1283, + 1173, + 1283, + 1173, + 1340, + 525, + 1340 + ], + "score": 0.92, + "latex": "\\displaystyle \\Delta L _ { \\mathrm { m a x } } ( \\boldsymbol { X } , \\epsilon ) = \\operatorname* { m a x } _ { \\| \\delta \\| \\leq \\epsilon } L ( f _ { \\boldsymbol { \\theta } } ( \\boldsymbol { X } + \\delta ) , \\boldsymbol { y } ) - L ( f _ { \\boldsymbol { \\theta } } ( \\boldsymbol { X } ) , \\boldsymbol { y } ) ," + }, + { + "category_id": 13, + "poly": [ + 673, + 1470, + 760, + 1470, + 760, + 1500, + 673, + 1500 + ], + "score": 0.9, + "latex": "\\Delta L _ { \\mathrm { m a x } }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1407, + 382, + 1407, + 382, + 1438, + 297, + 1438 + ], + "score": 0.9, + "latex": "5 { \\cdot } 1 0 ^ { - 3 }" + }, + { + "category_id": 13, + "poly": [ + 963, + 416, + 990, + 416, + 990, + 441, + 963, + 441 + ], + "score": 0.84, + "latex": "{ . 3 ^ { * } }" + }, + { + "category_id": 13, + "poly": [ + 678, + 1440, + 696, + 1440, + 696, + 1466, + 678, + 1466 + ], + "score": 0.82, + "latex": "\\pmb { \\delta }" + }, + { + "category_id": 13, + "poly": [ + 870, + 540, + 939, + 540, + 939, + 569, + 870, + 569 + ], + "score": 0.81, + "latex": "( 1 0 ^ { - 4 } )" + }, + { + "category_id": 13, + "poly": [ + 542, + 540, + 611, + 540, + 611, + 569, + 542, + 569 + ], + "score": 0.79, + "latex": "( 1 0 ^ { - 4 } )" + }, + { + "category_id": 13, + "poly": [ + 421, + 419, + 447, + 419, + 447, + 441, + 421, + 441 + ], + "score": 0.79, + "latex": "\\mathbf { \\nabla } m" + }, + { + "category_id": 13, + "poly": [ + 1198, + 540, + 1267, + 540, + 1267, + 569, + 1198, + 569 + ], + "score": 0.77, + "latex": "( 1 0 ^ { - 3 } )" + }, + { + "category_id": 13, + "poly": [ + 678, + 420, + 704, + 420, + 704, + 441, + 678, + 441 + ], + "score": 0.76, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 395, + 1500, + 425, + 1500, + 425, + 1527, + 395, + 1527 + ], + "score": 0.75, + "latex": "\\boldsymbol { X }" + }, + { + "category_id": 13, + "poly": [ + 757, + 540, + 826, + 540, + 826, + 570, + 757, + 570 + ], + "score": 0.72, + "latex": "( 1 0 ^ { - 4 } )" + }, + { + "category_id": 13, + "poly": [ + 1386, + 1704, + 1402, + 1704, + 1402, + 1726, + 1386, + 1726 + ], + "score": 0.7, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 436, + 1983, + 452, + 1983, + 452, + 2003, + 436, + 2003 + ], + "score": 0.7, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1086, + 539, + 1155, + 539, + 1155, + 570, + 1086, + 570 + ], + "score": 0.7, + "latex": "( 1 0 ^ { - 3 } )" + }, + { + "category_id": 13, + "poly": [ + 428, + 539, + 498, + 539, + 498, + 569, + 428, + 569 + ], + "score": 0.69, + "latex": "( 1 0 ^ { - 4 } )" + }, + { + "category_id": 13, + "poly": [ + 657, + 540, + 726, + 540, + 726, + 569, + 657, + 569 + ], + "score": 0.69, + "latex": "( 1 0 ^ { - 4 } )" + }, + { + "category_id": 13, + "poly": [ + 591, + 1643, + 607, + 1643, + 607, + 1665, + 591, + 1665 + ], + "score": 0.68, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 985, + 540, + 1054, + 540, + 1054, + 569, + 985, + 569 + ], + "score": 0.61, + "latex": "( 1 0 ^ { - 4 } )" + }, + { + "category_id": 13, + "poly": [ + 1314, + 539, + 1382, + 539, + 1382, + 569, + 1314, + 569 + ], + "score": 0.6, + "latex": "( 1 0 ^ { - 3 } )" + }, + { + "category_id": 13, + "poly": [ + 1039, + 1674, + 1056, + 1674, + 1056, + 1696, + 1039, + 1696 + ], + "score": 0.57, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 517, + 1673, + 534, + 1673, + 534, + 1696, + 517, + 1696 + ], + "score": 0.57, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1338, + 1957, + 1351, + 1957, + 1351, + 1975, + 1338, + 1975 + ], + "score": 0.51, + "latex": "\\epsilon" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1943.0, + 1337.0, + 1943.0, + 1337.0, + 1984.0, + 321.0, + 1984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 1943.0, + 1407.0, + 1943.0, + 1407.0, + 1984.0, + 1352.0, + 1984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1974.0, + 435.0, + 1974.0, + 435.0, + 2013.0, + 292.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 1974.0, + 1407.0, + 1974.0, + 1407.0, + 2013.0, + 453.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2005.0, + 1020.0, + 2005.0, + 1020.0, + 2034.0, + 296.0, + 2034.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 846.0, + 773.0, + 846.0, + 773.0, + 887.0, + 294.0, + 887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 355.0, + 1405.0, + 355.0, + 1405.0, + 390.0, + 295.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 385.0, + 1407.0, + 385.0, + 1407.0, + 422.0, + 295.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 414.0, + 420.0, + 414.0, + 420.0, + 447.0, + 295.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 414.0, + 677.0, + 414.0, + 677.0, + 447.0, + 448.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 705.0, + 414.0, + 962.0, + 414.0, + 962.0, + 447.0, + 705.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 414.0, + 1404.0, + 414.0, + 1404.0, + 447.0, + 991.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 441.0, + 447.0, + 441.0, + 447.0, + 476.0, + 295.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 2085.0, + 859.0, + 2085.0, + 859.0, + 2116.0, + 836.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1346.0, + 1406.0, + 1346.0, + 1406.0, + 1383.0, + 295.0, + 1383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1376.0, + 793.0, + 1376.0, + 793.0, + 1412.0, + 293.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 953.0, + 1376.0, + 1406.0, + 1376.0, + 1406.0, + 1412.0, + 953.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1403.0, + 296.0, + 1403.0, + 296.0, + 1446.0, + 291.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 1403.0, + 431.0, + 1403.0, + 431.0, + 1446.0, + 383.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 603.0, + 1403.0, + 1408.0, + 1403.0, + 1408.0, + 1446.0, + 603.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1438.0, + 677.0, + 1438.0, + 677.0, + 1470.0, + 296.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 1438.0, + 1404.0, + 1438.0, + 1404.0, + 1470.0, + 697.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1465.0, + 672.0, + 1465.0, + 672.0, + 1507.0, + 292.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 1465.0, + 1240.0, + 1465.0, + 1240.0, + 1507.0, + 761.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1465.0, + 1405.0, + 1465.0, + 1405.0, + 1507.0, + 1401.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1498.0, + 394.0, + 1498.0, + 394.0, + 1534.0, + 294.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 1498.0, + 674.0, + 1498.0, + 674.0, + 1534.0, + 426.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1547.0, + 1405.0, + 1547.0, + 1405.0, + 1579.0, + 293.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1575.0, + 1149.0, + 1575.0, + 1149.0, + 1614.0, + 292.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1310.0, + 1575.0, + 1405.0, + 1575.0, + 1405.0, + 1614.0, + 1310.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1609.0, + 1401.0, + 1609.0, + 1401.0, + 1640.0, + 295.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1637.0, + 590.0, + 1637.0, + 590.0, + 1672.0, + 295.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 1637.0, + 1405.0, + 1637.0, + 1405.0, + 1672.0, + 608.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1662.0, + 516.0, + 1662.0, + 516.0, + 1707.0, + 290.0, + 1707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 535.0, + 1662.0, + 1038.0, + 1662.0, + 1038.0, + 1707.0, + 535.0, + 1707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1057.0, + 1662.0, + 1405.0, + 1662.0, + 1405.0, + 1707.0, + 1057.0, + 1707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1699.0, + 1036.0, + 1699.0, + 1036.0, + 1734.0, + 295.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1197.0, + 1699.0, + 1385.0, + 1699.0, + 1385.0, + 1734.0, + 1197.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1728.0, + 1194.0, + 1728.0, + 1194.0, + 1765.0, + 294.0, + 1765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 905.0, + 1405.0, + 905.0, + 1405.0, + 944.0, + 292.0, + 944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 937.0, + 1404.0, + 937.0, + 1404.0, + 973.0, + 294.0, + 973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 967.0, + 1404.0, + 967.0, + 1404.0, + 1004.0, + 294.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 998.0, + 1403.0, + 998.0, + 1403.0, + 1036.0, + 293.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1027.0, + 586.0, + 1027.0, + 586.0, + 1064.0, + 294.0, + 1064.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1077.0, + 1405.0, + 1077.0, + 1405.0, + 1109.0, + 296.0, + 1109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1105.0, + 1407.0, + 1105.0, + 1407.0, + 1143.0, + 293.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1135.0, + 1407.0, + 1135.0, + 1407.0, + 1174.0, + 292.0, + 1174.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1169.0, + 835.0, + 1169.0, + 835.0, + 1202.0, + 293.0, + 1202.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1776.0, + 1405.0, + 1776.0, + 1405.0, + 1809.0, + 296.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1806.0, + 1402.0, + 1806.0, + 1402.0, + 1839.0, + 293.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1838.0, + 1404.0, + 1838.0, + 1404.0, + 1871.0, + 294.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1866.0, + 1406.0, + 1866.0, + 1406.0, + 1903.0, + 294.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1892.0, + 1100.0, + 1892.0, + 1100.0, + 1934.0, + 293.0, + 1934.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1213.0, + 1404.0, + 1213.0, + 1404.0, + 1249.0, + 295.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1245.0, + 762.0, + 1245.0, + 762.0, + 1280.0, + 295.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 668.0, + 1406.0, + 668.0, + 1406.0, + 707.0, + 294.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 700.0, + 1403.0, + 700.0, + 1403.0, + 730.0, + 294.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 727.0, + 1403.0, + 727.0, + 1403.0, + 760.0, + 294.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 756.0, + 1405.0, + 756.0, + 1405.0, + 786.0, + 292.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 784.0, + 943.0, + 784.0, + 943.0, + 815.0, + 295.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 355.0, + 1405.0, + 355.0, + 1405.0, + 390.0, + 295.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 385.0, + 1407.0, + 385.0, + 1407.0, + 422.0, + 295.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 414.0, + 420.0, + 414.0, + 420.0, + 447.0, + 295.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 414.0, + 677.0, + 414.0, + 677.0, + 447.0, + 448.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 705.0, + 414.0, + 962.0, + 414.0, + 962.0, + 447.0, + 705.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 414.0, + 1404.0, + 414.0, + 1404.0, + 447.0, + 991.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 441.0, + 447.0, + 441.0, + 447.0, + 476.0, + 295.0, + 476.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 230, + 1404, + 230, + 1404, + 564, + 298, + 564 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 678, + 1403, + 678, + 1403, + 955, + 298, + 955 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 300, + 988, + 1398, + 988, + 1398, + 1050, + 300, + 1050 + ], + "score": 0.941 + }, + { + "category_id": 0, + "poly": [ + 300, + 610, + 544, + 610, + 544, + 646, + 300, + 646 + ], + "score": 0.889 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 816, + 76, + 816, + 104, + 300, + 104 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.772 + }, + { + "category_id": 0, + "poly": [ + 300, + 1096, + 488, + 1096, + 488, + 1129, + 300, + 1129 + ], + "score": 0.753 + }, + { + "category_id": 1, + "poly": [ + 298, + 1256, + 1398, + 1256, + 1398, + 1321, + 298, + 1321 + ], + "score": 0.712 + }, + { + "category_id": 1, + "poly": [ + 298, + 1421, + 1398, + 1421, + 1398, + 1484, + 298, + 1484 + ], + "score": 0.699 + }, + { + "category_id": 1, + "poly": [ + 291, + 1584, + 1399, + 1584, + 1399, + 1647, + 291, + 1647 + ], + "score": 0.699 + }, + { + "category_id": 1, + "poly": [ + 297, + 1338, + 1398, + 1338, + 1398, + 1403, + 297, + 1403 + ], + "score": 0.686 + }, + { + "category_id": 1, + "poly": [ + 298, + 1972, + 1398, + 1972, + 1398, + 2034, + 298, + 2034 + ], + "score": 0.686 + }, + { + "category_id": 1, + "poly": [ + 297, + 1665, + 1400, + 1665, + 1400, + 1759, + 297, + 1759 + ], + "score": 0.679 + }, + { + "category_id": 1, + "poly": [ + 298, + 1502, + 1397, + 1502, + 1397, + 1567, + 298, + 1567 + ], + "score": 0.67 + }, + { + "category_id": 1, + "poly": [ + 295, + 1777, + 1396, + 1777, + 1396, + 1842, + 295, + 1842 + ], + "score": 0.605 + }, + { + "category_id": 1, + "poly": [ + 298, + 1146, + 1405, + 1146, + 1405, + 1238, + 298, + 1238 + ], + "score": 0.592 + }, + { + "category_id": 1, + "poly": [ + 298, + 1859, + 1396, + 1859, + 1396, + 1954, + 298, + 1954 + ], + "score": 0.543 + }, + { + "category_id": 1, + "poly": [ + 300, + 1096, + 488, + 1096, + 488, + 1129, + 300, + 1129 + ], + "score": 0.13 + }, + { + "category_id": 13, + "poly": [ + 476, + 414, + 528, + 414, + 528, + 446, + 476, + 446 + ], + "score": 0.91, + "latex": "\\alpha / n" + }, + { + "category_id": 13, + "poly": [ + 773, + 353, + 802, + 353, + 802, + 385, + 773, + 385 + ], + "score": 0.88, + "latex": "f _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 765, + 262, + 794, + 262, + 794, + 294, + 765, + 294 + ], + "score": 0.88, + "latex": "f _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 400, + 418, + 422, + 418, + 422, + 442, + 400, + 442 + ], + "score": 0.77, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 699, + 326, + 719, + 326, + 719, + 350, + 699, + 350 + ], + "score": 0.77, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 645, + 480, + 668, + 480, + 668, + 502, + 645, + 502 + ], + "score": 0.76, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 1143, + 386, + 1170, + 386, + 1170, + 411, + 1143, + 411 + ], + "score": 0.75, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 657, + 416, + 709, + 416, + 709, + 442, + 657, + 442 + ], + "score": 0.32, + "latex": "m { \\cdot } n" + }, + { + "category_id": 13, + "poly": [ + 1381, + 450, + 1401, + 450, + 1401, + 471, + 1381, + 471 + ], + "score": 0.31, + "latex": "\\mathbf { \\nabla } \\cdot n" + }, + { + "category_id": 13, + "poly": [ + 297, + 326, + 352, + 326, + 352, + 351, + 297, + 351 + ], + "score": 0.27, + "latex": "m { - } n" + }, + { + "category_id": 13, + "poly": [ + 1347, + 447, + 1402, + 447, + 1402, + 473, + 1347, + 473 + ], + "score": 0.25, + "latex": "\\mathbf { \\nabla } m - n" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 604.0, + 550.0, + 604.0, + 550.0, + 655.0, + 290.0, + 655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2087.0, + 860.0, + 2087.0, + 860.0, + 2117.0, + 839.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1095.0, + 491.0, + 1095.0, + 491.0, + 1133.0, + 295.0, + 1133.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 231.0, + 1404.0, + 231.0, + 1404.0, + 265.0, + 297.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 260.0, + 764.0, + 260.0, + 764.0, + 298.0, + 293.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 795.0, + 260.0, + 1405.0, + 260.0, + 1405.0, + 298.0, + 795.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 290.0, + 1405.0, + 290.0, + 1405.0, + 328.0, + 293.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 322.0, + 296.0, + 322.0, + 296.0, + 356.0, + 293.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 322.0, + 698.0, + 322.0, + 698.0, + 356.0, + 353.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 720.0, + 322.0, + 1404.0, + 322.0, + 1404.0, + 356.0, + 720.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 353.0, + 772.0, + 353.0, + 772.0, + 387.0, + 294.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 803.0, + 353.0, + 1406.0, + 353.0, + 1406.0, + 387.0, + 803.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 380.0, + 1142.0, + 380.0, + 1142.0, + 419.0, + 292.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 380.0, + 1406.0, + 380.0, + 1406.0, + 419.0, + 1171.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 414.0, + 399.0, + 414.0, + 399.0, + 448.0, + 293.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 414.0, + 475.0, + 414.0, + 475.0, + 448.0, + 423.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 414.0, + 656.0, + 414.0, + 656.0, + 448.0, + 529.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 710.0, + 414.0, + 1404.0, + 414.0, + 1404.0, + 448.0, + 710.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 440.0, + 1346.0, + 440.0, + 1346.0, + 481.0, + 293.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 440.0, + 1408.0, + 440.0, + 1408.0, + 481.0, + 1403.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 475.0, + 644.0, + 475.0, + 644.0, + 509.0, + 294.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 669.0, + 475.0, + 1406.0, + 475.0, + 1406.0, + 509.0, + 669.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 503.0, + 1408.0, + 503.0, + 1408.0, + 541.0, + 293.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 536.0, + 1076.0, + 536.0, + 1076.0, + 567.0, + 296.0, + 567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 680.0, + 1404.0, + 680.0, + 1404.0, + 713.0, + 294.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 709.0, + 1407.0, + 709.0, + 1407.0, + 747.0, + 292.0, + 747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 741.0, + 1405.0, + 741.0, + 1405.0, + 775.0, + 293.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 771.0, + 1404.0, + 771.0, + 1404.0, + 803.0, + 294.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 802.0, + 1404.0, + 802.0, + 1404.0, + 835.0, + 293.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 830.0, + 1403.0, + 830.0, + 1403.0, + 868.0, + 293.0, + 868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 861.0, + 1405.0, + 861.0, + 1405.0, + 899.0, + 293.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 891.0, + 1405.0, + 891.0, + 1405.0, + 928.0, + 294.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 925.0, + 1153.0, + 925.0, + 1153.0, + 958.0, + 296.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 986.0, + 1402.0, + 986.0, + 1402.0, + 1022.0, + 296.0, + 1022.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1016.0, + 814.0, + 1016.0, + 814.0, + 1054.0, + 295.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1255.0, + 1403.0, + 1255.0, + 1403.0, + 1291.0, + 295.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1290.0, + 1162.0, + 1290.0, + 1162.0, + 1323.0, + 323.0, + 1323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1421.0, + 1403.0, + 1421.0, + 1403.0, + 1456.0, + 297.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1453.0, + 577.0, + 1453.0, + 577.0, + 1483.0, + 322.0, + 1483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1582.0, + 1404.0, + 1582.0, + 1404.0, + 1622.0, + 296.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1616.0, + 700.0, + 1616.0, + 700.0, + 1647.0, + 323.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1341.0, + 1403.0, + 1341.0, + 1403.0, + 1373.0, + 296.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1369.0, + 1272.0, + 1369.0, + 1272.0, + 1405.0, + 323.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1966.0, + 1404.0, + 1966.0, + 1404.0, + 2011.0, + 292.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 2002.0, + 1135.0, + 2002.0, + 1135.0, + 2037.0, + 323.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1665.0, + 1405.0, + 1665.0, + 1405.0, + 1699.0, + 293.0, + 1699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1696.0, + 1404.0, + 1696.0, + 1404.0, + 1733.0, + 323.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1727.0, + 776.0, + 1727.0, + 776.0, + 1760.0, + 322.0, + 1760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1502.0, + 1402.0, + 1502.0, + 1402.0, + 1538.0, + 294.0, + 1538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1532.0, + 1022.0, + 1532.0, + 1022.0, + 1568.0, + 324.0, + 1568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1772.0, + 1400.0, + 1772.0, + 1400.0, + 1817.0, + 293.0, + 1817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1807.0, + 1233.0, + 1807.0, + 1233.0, + 1846.0, + 320.0, + 1846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1146.0, + 1402.0, + 1146.0, + 1402.0, + 1180.0, + 295.0, + 1180.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1178.0, + 1403.0, + 1178.0, + 1403.0, + 1211.0, + 323.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1206.0, + 532.0, + 1206.0, + 532.0, + 1241.0, + 323.0, + 1241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1857.0, + 1402.0, + 1857.0, + 1402.0, + 1897.0, + 293.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1888.0, + 1401.0, + 1888.0, + 1401.0, + 1927.0, + 322.0, + 1927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1920.0, + 1014.0, + 1920.0, + 1014.0, + 1956.0, + 323.0, + 1956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1095.0, + 491.0, + 1095.0, + 491.0, + 1133.0, + 295.0, + 1133.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 300, + 75, + 817, + 75, + 817, + 105, + 300, + 105 + ], + "score": 0.889 + }, + { + "category_id": 1, + "poly": [ + 298, + 990, + 1401, + 990, + 1401, + 1054, + 298, + 1054 + ], + "score": 0.881 + }, + { + "category_id": 1, + "poly": [ + 295, + 426, + 1401, + 426, + 1401, + 490, + 295, + 490 + ], + "score": 0.868 + }, + { + "category_id": 1, + "poly": [ + 298, + 312, + 1399, + 312, + 1399, + 406, + 298, + 406 + ], + "score": 0.868 + }, + { + "category_id": 1, + "poly": [ + 293, + 229, + 1400, + 229, + 1400, + 294, + 293, + 294 + ], + "score": 0.863 + }, + { + "category_id": 1, + "poly": [ + 294, + 510, + 1400, + 510, + 1400, + 575, + 294, + 575 + ], + "score": 0.853 + }, + { + "category_id": 1, + "poly": [ + 297, + 1073, + 1400, + 1073, + 1400, + 1137, + 297, + 1137 + ], + "score": 0.853 + }, + { + "category_id": 1, + "poly": [ + 302, + 1972, + 1397, + 1972, + 1397, + 2034, + 302, + 2034 + ], + "score": 0.85 + }, + { + "category_id": 1, + "poly": [ + 297, + 791, + 1402, + 791, + 1402, + 856, + 297, + 856 + ], + "score": 0.844 + }, + { + "category_id": 1, + "poly": [ + 297, + 593, + 1406, + 593, + 1406, + 689, + 297, + 689 + ], + "score": 0.841 + }, + { + "category_id": 1, + "poly": [ + 298, + 876, + 1404, + 876, + 1404, + 970, + 298, + 970 + ], + "score": 0.835 + }, + { + "category_id": 1, + "poly": [ + 298, + 1323, + 1403, + 1323, + 1403, + 1390, + 298, + 1390 + ], + "score": 0.833 + }, + { + "category_id": 1, + "poly": [ + 299, + 1156, + 1401, + 1156, + 1401, + 1221, + 299, + 1221 + ], + "score": 0.832 + }, + { + "category_id": 1, + "poly": [ + 301, + 1773, + 1401, + 1773, + 1401, + 1867, + 301, + 1867 + ], + "score": 0.831 + }, + { + "category_id": 1, + "poly": [ + 297, + 1240, + 1403, + 1240, + 1403, + 1306, + 297, + 1306 + ], + "score": 0.83 + }, + { + "category_id": 1, + "poly": [ + 303, + 1574, + 1402, + 1574, + 1402, + 1670, + 303, + 1670 + ], + "score": 0.829 + }, + { + "category_id": 1, + "poly": [ + 298, + 1887, + 1396, + 1887, + 1396, + 1951, + 298, + 1951 + ], + "score": 0.828 + }, + { + "category_id": 1, + "poly": [ + 299, + 708, + 1400, + 708, + 1400, + 773, + 299, + 773 + ], + "score": 0.827 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.824 + }, + { + "category_id": 1, + "poly": [ + 296, + 1407, + 1403, + 1407, + 1403, + 1474, + 296, + 1474 + ], + "score": 0.82 + }, + { + "category_id": 1, + "poly": [ + 294, + 1689, + 1399, + 1689, + 1399, + 1754, + 294, + 1754 + ], + "score": 0.819 + }, + { + "category_id": 1, + "poly": [ + 295, + 1491, + 1401, + 1491, + 1401, + 1557, + 295, + 1557 + ], + "score": 0.81 + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 990.0, + 1403.0, + 990.0, + 1403.0, + 1026.0, + 294.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1021.0, + 1090.0, + 1021.0, + 1090.0, + 1055.0, + 323.0, + 1055.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 425.0, + 1405.0, + 425.0, + 1405.0, + 464.0, + 294.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 458.0, + 736.0, + 458.0, + 736.0, + 490.0, + 323.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 314.0, + 1404.0, + 314.0, + 1404.0, + 348.0, + 297.0, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 341.0, + 1404.0, + 341.0, + 1404.0, + 382.0, + 321.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 376.0, + 504.0, + 376.0, + 504.0, + 406.0, + 324.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 225.0, + 1402.0, + 225.0, + 1402.0, + 268.0, + 295.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 260.0, + 1106.0, + 260.0, + 1106.0, + 296.0, + 323.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 506.0, + 1405.0, + 506.0, + 1405.0, + 550.0, + 294.0, + 550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 543.0, + 728.0, + 543.0, + 728.0, + 573.0, + 322.0, + 573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1072.0, + 1402.0, + 1072.0, + 1402.0, + 1110.0, + 293.0, + 1110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1104.0, + 530.0, + 1104.0, + 530.0, + 1137.0, + 323.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1971.0, + 1402.0, + 1971.0, + 1402.0, + 2007.0, + 298.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 2003.0, + 1242.0, + 2003.0, + 1242.0, + 2036.0, + 322.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 790.0, + 1403.0, + 790.0, + 1403.0, + 829.0, + 293.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 824.0, + 621.0, + 824.0, + 621.0, + 856.0, + 322.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 590.0, + 1404.0, + 590.0, + 1404.0, + 632.0, + 294.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 625.0, + 1403.0, + 625.0, + 1403.0, + 659.0, + 324.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 656.0, + 608.0, + 656.0, + 608.0, + 691.0, + 322.0, + 691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 876.0, + 985.0, + 876.0, + 985.0, + 910.0, + 296.0, + 910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 874.0, + 1404.0, + 874.0, + 1404.0, + 912.0, + 1041.0, + 912.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 906.0, + 641.0, + 906.0, + 641.0, + 940.0, + 322.0, + 940.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 905.0, + 1403.0, + 905.0, + 1403.0, + 942.0, + 734.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 936.0, + 1046.0, + 936.0, + 1046.0, + 973.0, + 322.0, + 973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1324.0, + 1404.0, + 1324.0, + 1404.0, + 1360.0, + 296.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1355.0, + 1355.0, + 1355.0, + 1355.0, + 1392.0, + 323.0, + 1392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1154.0, + 1405.0, + 1154.0, + 1405.0, + 1194.0, + 294.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1185.0, + 399.0, + 1185.0, + 399.0, + 1223.0, + 319.0, + 1223.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1773.0, + 1404.0, + 1773.0, + 1404.0, + 1807.0, + 296.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1804.0, + 1405.0, + 1804.0, + 1405.0, + 1842.0, + 321.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1832.0, + 399.0, + 1832.0, + 399.0, + 1869.0, + 318.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1238.0, + 1405.0, + 1238.0, + 1405.0, + 1278.0, + 295.0, + 1278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1272.0, + 1261.0, + 1272.0, + 1261.0, + 1305.0, + 322.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1574.0, + 1406.0, + 1574.0, + 1406.0, + 1612.0, + 297.0, + 1612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1605.0, + 1405.0, + 1605.0, + 1405.0, + 1645.0, + 319.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1639.0, + 906.0, + 1639.0, + 906.0, + 1671.0, + 323.0, + 1671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1887.0, + 1401.0, + 1887.0, + 1401.0, + 1923.0, + 295.0, + 1923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1920.0, + 832.0, + 1920.0, + 832.0, + 1951.0, + 323.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 703.0, + 1405.0, + 703.0, + 1405.0, + 748.0, + 294.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 739.0, + 1017.0, + 739.0, + 1017.0, + 774.0, + 323.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1407.0, + 1403.0, + 1407.0, + 1403.0, + 1443.0, + 295.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1439.0, + 1277.0, + 1439.0, + 1277.0, + 1474.0, + 320.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1692.0, + 1401.0, + 1692.0, + 1401.0, + 1724.0, + 297.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1723.0, + 1190.0, + 1723.0, + 1190.0, + 1752.0, + 324.0, + 1752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1490.0, + 1402.0, + 1490.0, + 1402.0, + 1527.0, + 295.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1524.0, + 901.0, + 1524.0, + 901.0, + 1556.0, + 324.0, + 1556.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 299, + 75, + 817, + 75, + 817, + 105, + 299, + 105 + ], + "score": 0.88 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2113, + 836, + 2113 + ], + "score": 0.825 + }, + { + "category_id": 1, + "poly": [ + 300, + 228, + 1401, + 228, + 1401, + 322, + 300, + 322 + ], + "score": 0.724 + }, + { + "category_id": 1, + "poly": [ + 295, + 1343, + 1402, + 1343, + 1402, + 1408, + 295, + 1408 + ], + "score": 0.698 + }, + { + "category_id": 1, + "poly": [ + 293, + 1629, + 1402, + 1629, + 1402, + 1695, + 293, + 1695 + ], + "score": 0.672 + }, + { + "category_id": 1, + "poly": [ + 302, + 1971, + 1397, + 1971, + 1397, + 2035, + 302, + 2035 + ], + "score": 0.669 + }, + { + "category_id": 1, + "poly": [ + 293, + 1545, + 1401, + 1545, + 1401, + 1609, + 293, + 1609 + ], + "score": 0.664 + }, + { + "category_id": 1, + "poly": [ + 297, + 1257, + 1399, + 1257, + 1399, + 1324, + 297, + 1324 + ], + "score": 0.643 + }, + { + "category_id": 1, + "poly": [ + 296, + 1428, + 1403, + 1428, + 1403, + 1523, + 296, + 1523 + ], + "score": 0.633 + }, + { + "category_id": 1, + "poly": [ + 298, + 1172, + 1398, + 1172, + 1398, + 1239, + 298, + 1239 + ], + "score": 0.63 + }, + { + "category_id": 1, + "poly": [ + 296, + 1916, + 1241, + 1916, + 1241, + 1950, + 296, + 1950 + ], + "score": 0.628 + }, + { + "category_id": 1, + "poly": [ + 288, + 801, + 1402, + 801, + 1402, + 866, + 288, + 866 + ], + "score": 0.625 + }, + { + "category_id": 1, + "poly": [ + 290, + 1002, + 1401, + 1002, + 1401, + 1067, + 290, + 1067 + ], + "score": 0.622 + }, + { + "category_id": 1, + "poly": [ + 297, + 631, + 1401, + 631, + 1401, + 695, + 297, + 695 + ], + "score": 0.615 + }, + { + "category_id": 1, + "poly": [ + 296, + 715, + 1401, + 715, + 1401, + 781, + 296, + 781 + ], + "score": 0.604 + }, + { + "category_id": 1, + "poly": [ + 295, + 1831, + 1401, + 1831, + 1401, + 1894, + 295, + 1894 + ], + "score": 0.603 + }, + { + "category_id": 1, + "poly": [ + 289, + 1087, + 1401, + 1087, + 1401, + 1152, + 289, + 1152 + ], + "score": 0.602 + }, + { + "category_id": 1, + "poly": [ + 295, + 886, + 1399, + 886, + 1399, + 982, + 295, + 982 + ], + "score": 0.597 + }, + { + "category_id": 1, + "poly": [ + 295, + 546, + 1401, + 546, + 1401, + 610, + 295, + 610 + ], + "score": 0.581 + }, + { + "category_id": 1, + "poly": [ + 300, + 1714, + 1402, + 1714, + 1402, + 1810, + 300, + 1810 + ], + "score": 0.575 + }, + { + "category_id": 1, + "poly": [ + 296, + 460, + 1398, + 460, + 1398, + 525, + 296, + 525 + ], + "score": 0.53 + }, + { + "category_id": 1, + "poly": [ + 302, + 345, + 1398, + 345, + 1398, + 439, + 302, + 439 + ], + "score": 0.518 + }, + { + "category_id": 13, + "poly": [ + 1181, + 462, + 1290, + 462, + 1290, + 492, + 1181, + 492 + ], + "score": 0.48, + "latex": "1 0 0 { , } 0 0 0 { + }" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2125.0, + 832.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 230.0, + 1405.0, + 230.0, + 1405.0, + 264.0, + 298.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 259.0, + 1405.0, + 259.0, + 1405.0, + 294.0, + 321.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 288.0, + 399.0, + 288.0, + 399.0, + 326.0, + 320.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1342.0, + 1404.0, + 1342.0, + 1404.0, + 1382.0, + 295.0, + 1382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1374.0, + 1163.0, + 1374.0, + 1163.0, + 1412.0, + 322.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1628.0, + 1404.0, + 1628.0, + 1404.0, + 1667.0, + 293.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1662.0, + 1002.0, + 1662.0, + 1002.0, + 1696.0, + 322.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1970.0, + 1401.0, + 1970.0, + 1401.0, + 2006.0, + 297.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 2002.0, + 1364.0, + 2002.0, + 1364.0, + 2036.0, + 322.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1541.0, + 1404.0, + 1541.0, + 1404.0, + 1583.0, + 293.0, + 1583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1574.0, + 705.0, + 1574.0, + 705.0, + 1610.0, + 322.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1254.0, + 1404.0, + 1254.0, + 1404.0, + 1297.0, + 293.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1291.0, + 1076.0, + 1291.0, + 1076.0, + 1326.0, + 321.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1427.0, + 1403.0, + 1427.0, + 1403.0, + 1466.0, + 294.0, + 1466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1458.0, + 1403.0, + 1458.0, + 1403.0, + 1495.0, + 323.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1491.0, + 469.0, + 1491.0, + 469.0, + 1523.0, + 324.0, + 1523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1173.0, + 1403.0, + 1173.0, + 1403.0, + 1209.0, + 294.0, + 1209.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1204.0, + 1238.0, + 1204.0, + 1238.0, + 1239.0, + 323.0, + 1239.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1914.0, + 1244.0, + 1914.0, + 1244.0, + 1953.0, + 294.0, + 1953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 800.0, + 1405.0, + 800.0, + 1405.0, + 839.0, + 292.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 832.0, + 950.0, + 832.0, + 950.0, + 867.0, + 321.0, + 867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1002.0, + 1404.0, + 1002.0, + 1404.0, + 1038.0, + 293.0, + 1038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1035.0, + 704.0, + 1035.0, + 704.0, + 1065.0, + 322.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 628.0, + 1403.0, + 628.0, + 1403.0, + 668.0, + 293.0, + 668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 663.0, + 810.0, + 663.0, + 810.0, + 696.0, + 322.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 717.0, + 1402.0, + 717.0, + 1402.0, + 749.0, + 296.0, + 749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 748.0, + 660.0, + 748.0, + 660.0, + 780.0, + 324.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1824.0, + 1407.0, + 1824.0, + 1407.0, + 1873.0, + 293.0, + 1873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1861.0, + 930.0, + 1861.0, + 930.0, + 1896.0, + 323.0, + 1896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1086.0, + 1407.0, + 1086.0, + 1407.0, + 1126.0, + 293.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1121.0, + 725.0, + 1121.0, + 725.0, + 1152.0, + 321.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 881.0, + 1405.0, + 881.0, + 1405.0, + 928.0, + 292.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 917.0, + 1404.0, + 917.0, + 1404.0, + 954.0, + 322.0, + 954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 950.0, + 640.0, + 950.0, + 640.0, + 981.0, + 324.0, + 981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 545.0, + 1402.0, + 545.0, + 1402.0, + 581.0, + 294.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 575.0, + 805.0, + 575.0, + 805.0, + 611.0, + 323.0, + 611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1709.0, + 1406.0, + 1709.0, + 1406.0, + 1756.0, + 294.0, + 1756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1746.0, + 1404.0, + 1746.0, + 1404.0, + 1780.0, + 323.0, + 1780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1777.0, + 479.0, + 1777.0, + 479.0, + 1809.0, + 324.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 459.0, + 1180.0, + 459.0, + 1180.0, + 499.0, + 294.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1291.0, + 459.0, + 1404.0, + 459.0, + 1404.0, + 499.0, + 1291.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 491.0, + 932.0, + 491.0, + 932.0, + 526.0, + 321.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 341.0, + 1403.0, + 341.0, + 1403.0, + 384.0, + 293.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 375.0, + 1404.0, + 375.0, + 1404.0, + 411.0, + 322.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 408.0, + 849.0, + 408.0, + 849.0, + 442.0, + 324.0, + 442.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 229, + 1403, + 229, + 1403, + 294, + 296, + 294 + ], + "score": 0.88 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 817, + 75, + 817, + 105, + 299, + 105 + ], + "score": 0.86 + }, + { + "category_id": 1, + "poly": [ + 298, + 312, + 1402, + 312, + 1402, + 376, + 298, + 376 + ], + "score": 0.844 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.831 + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 225.0, + 1404.0, + 225.0, + 1404.0, + 268.0, + 294.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 260.0, + 1205.0, + 260.0, + 1205.0, + 295.0, + 321.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 309.0, + 1406.0, + 309.0, + 1406.0, + 349.0, + 293.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 340.0, + 398.0, + 340.0, + 398.0, + 379.0, + 319.0, + 379.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 381, + 781, + 1319, + 781, + 1319, + 919, + 381, + 919 + ], + "score": 0.98, + "html": "
MNLIQNLIQQPRTESST-2MRPCCoLASTS-B
E2E-11.5E-14.5E-11.5E-16E-14E-12E-13E-1
a1E-11E-11.5E-13E-21E-14E-22.5E-21E-1
m22232333
" + }, + { + "category_id": 5, + "poly": [ + 297, + 1383, + 1403, + 1383, + 1403, + 1531, + 297, + 1531 + ], + "score": 0.98, + "html": "
MethodsRTECoLAMRPC
M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-4)M-Inc (R)(10-4)N-Loss(10-4)M-Inc(10-3)M-Inc (R)(10-3)N-Loss(10-3)
Vanilla5.1(15087)5.3(14346)4.5(920)6.1(13118)5.7(14122)5.2(447)10.2(929)10.2(955)1.9(76)
PGD4.7(10138)4.9(1828)6.2(752)128.2(1300)130.1(893)436.1(1276)5.7(321)5.7(155)5.4(54)
FreeLB3.0(1614)2.6(11114)4.1(595)1.4(1392)1.3(6231)7.2(615)3.6(167)3.6(601)2.7(54)
" + }, + { + "category_id": 1, + "poly": [ + 297, + 430, + 1405, + 430, + 1405, + 676, + 297, + 676 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 1013, + 1405, + 1013, + 1405, + 1259, + 297, + 1259 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 300, + 1887, + 1403, + 1887, + 1403, + 1979, + 300, + 1979 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 1556, + 1404, + 1556, + 1404, + 1669, + 298, + 1669 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 299, + 354, + 1400, + 354, + 1400, + 416, + 299, + 416 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 301, + 1709, + 1400, + 1709, + 1400, + 1771, + 301, + 1771 + ], + "score": 0.943 + }, + { + "category_id": 0, + "poly": [ + 298, + 1817, + 1037, + 1817, + 1037, + 1853, + 298, + 1853 + ], + "score": 0.919 + }, + { + "category_id": 0, + "poly": [ + 301, + 226, + 911, + 226, + 911, + 262, + 301, + 262 + ], + "score": 0.903 + }, + { + "category_id": 2, + "poly": [ + 319, + 2005, + 1188, + 2005, + 1188, + 2034, + 319, + 2034 + ], + "score": 0.899 + }, + { + "category_id": 6, + "poly": [ + 548, + 941, + 1151, + 941, + 1151, + 974, + 548, + 974 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 817, + 75, + 817, + 104, + 300, + 104 + ], + "score": 0.864 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2112, + 836, + 2112 + ], + "score": 0.854 + }, + { + "category_id": 0, + "poly": [ + 296, + 1305, + 1028, + 1305, + 1028, + 1341, + 296, + 1341 + ], + "score": 0.771 + }, + { + "category_id": 0, + "poly": [ + 300, + 715, + 625, + 715, + 625, + 747, + 300, + 747 + ], + "score": 0.714 + }, + { + "category_id": 0, + "poly": [ + 301, + 296, + 687, + 296, + 687, + 327, + 301, + 327 + ], + "score": 0.687 + }, + { + "category_id": 1, + "poly": [ + 301, + 296, + 687, + 296, + 687, + 327, + 301, + 327 + ], + "score": 0.228 + }, + { + "category_id": 6, + "poly": [ + 300, + 715, + 625, + 715, + 625, + 747, + 300, + 747 + ], + "score": 0.095 + }, + { + "category_id": 13, + "poly": [ + 562, + 1134, + 670, + 1134, + 670, + 1166, + 562, + 1166 + ], + "score": 0.92, + "latex": "5 \\times 1 0 ^ { - 6 }" + }, + { + "category_id": 13, + "poly": [ + 1216, + 1168, + 1405, + 1168, + 1405, + 1198, + 1216, + 1198 + ], + "score": 0.89, + "latex": "\\epsilon = 1 e - 2 , \\alpha =" + }, + { + "category_id": 13, + "poly": [ + 680, + 1200, + 774, + 1200, + 774, + 1227, + 680, + 1227 + ], + "score": 0.86, + "latex": "m \\alpha < \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 298, + 1198, + 463, + 1198, + 463, + 1229, + 298, + 1229 + ], + "score": 0.82, + "latex": "5 e - 3 , m = 2" + }, + { + "category_id": 13, + "poly": [ + 1309, + 1141, + 1355, + 1141, + 1355, + 1167, + 1309, + 1167 + ], + "score": 0.76, + "latex": "\\alpha , \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 542, + 1433, + 601, + 1433, + 601, + 1456, + 542, + 1456 + ], + "score": 0.72, + "latex": "( 1 0 ^ { - 4 } )" + }, + { + "category_id": 13, + "poly": [ + 426, + 1433, + 485, + 1433, + 485, + 1456, + 426, + 1456 + ], + "score": 0.71, + "latex": "( 1 0 ^ { - 4 } )" + }, + { + "category_id": 13, + "poly": [ + 647, + 1433, + 709, + 1433, + 709, + 1456, + 647, + 1456 + ], + "score": 0.68, + "latex": "( 1 0 ^ { - 4 } )" + }, + { + "category_id": 13, + "poly": [ + 1003, + 1432, + 1064, + 1432, + 1064, + 1456, + 1003, + 1456 + ], + "score": 0.68, + "latex": "( 1 0 ^ { - 4 } )" + }, + { + "category_id": 13, + "poly": [ + 298, + 1171, + 325, + 1171, + 325, + 1194, + 298, + 1194 + ], + "score": 0.67, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 761, + 1433, + 819, + 1433, + 819, + 1456, + 761, + 1456 + ], + "score": 0.67, + "latex": "( 1 0 ^ { - 4 } )" + }, + { + "category_id": 13, + "poly": [ + 1229, + 1433, + 1289, + 1433, + 1289, + 1456, + 1229, + 1456 + ], + "score": 0.66, + "latex": "( 1 0 ^ { - 3 } )" + }, + { + "category_id": 13, + "poly": [ + 1372, + 1022, + 1394, + 1022, + 1394, + 1043, + 1372, + 1043 + ], + "score": 0.66, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 775, + 1051, + 802, + 1051, + 802, + 1074, + 775, + 1074 + ], + "score": 0.65, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 1270, + 1204, + 1286, + 1204, + 1286, + 1225, + 1270, + 1225 + ], + "score": 0.64, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1120, + 1432, + 1180, + 1432, + 1180, + 1456, + 1120, + 1456 + ], + "score": 0.62, + "latex": "( 1 0 ^ { - 3 } )" + }, + { + "category_id": 13, + "poly": [ + 882, + 1433, + 940, + 1433, + 940, + 1456, + 882, + 1456 + ], + "score": 0.62, + "latex": "( 1 0 ^ { - 4 } )" + }, + { + "category_id": 13, + "poly": [ + 399, + 896, + 424, + 896, + 424, + 909, + 399, + 909 + ], + "score": 0.46, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 399, + 864, + 418, + 864, + 418, + 877, + 399, + 877 + ], + "score": 0.45, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 1326, + 1431, + 1386, + 1431, + 1386, + 1456, + 1326, + 1456 + ], + "score": 0.43, + "latex": "( 1 0 ^ { - 3 } )" + }, + { + "category_id": 13, + "poly": [ + 561, + 1053, + 575, + 1053, + 575, + 1073, + 561, + 1073 + ], + "score": 0.4, + "latex": "\\epsilon" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1813.0, + 1041.0, + 1813.0, + 1041.0, + 1858.0, + 294.0, + 1858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 226.0, + 914.0, + 226.0, + 914.0, + 266.0, + 295.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1997.0, + 1191.0, + 1997.0, + 1191.0, + 2042.0, + 322.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 543.0, + 938.0, + 1154.0, + 938.0, + 1154.0, + 978.0, + 543.0, + 978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 817.0, + 72.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1300.0, + 1032.0, + 1300.0, + 1032.0, + 1345.0, + 291.0, + 1345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 716.0, + 629.0, + 716.0, + 629.0, + 747.0, + 297.0, + 747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 293.0, + 690.0, + 293.0, + 690.0, + 331.0, + 295.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 716.0, + 629.0, + 716.0, + 629.0, + 747.0, + 297.0, + 747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 432.0, + 1405.0, + 432.0, + 1405.0, + 465.0, + 295.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 464.0, + 1405.0, + 464.0, + 1405.0, + 494.0, + 296.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 492.0, + 1407.0, + 492.0, + 1407.0, + 528.0, + 292.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 521.0, + 1405.0, + 521.0, + 1405.0, + 559.0, + 292.0, + 559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 549.0, + 1405.0, + 549.0, + 1405.0, + 591.0, + 292.0, + 591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 583.0, + 1407.0, + 583.0, + 1407.0, + 619.0, + 292.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 615.0, + 1405.0, + 615.0, + 1405.0, + 649.0, + 295.0, + 649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 644.0, + 850.0, + 644.0, + 850.0, + 678.0, + 295.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1011.0, + 1371.0, + 1011.0, + 1371.0, + 1052.0, + 294.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 1011.0, + 1406.0, + 1011.0, + 1406.0, + 1052.0, + 1395.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1046.0, + 560.0, + 1046.0, + 560.0, + 1080.0, + 295.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 1046.0, + 774.0, + 1046.0, + 774.0, + 1080.0, + 576.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 803.0, + 1046.0, + 1405.0, + 1046.0, + 1405.0, + 1080.0, + 803.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1077.0, + 1403.0, + 1077.0, + 1403.0, + 1107.0, + 296.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1106.0, + 1406.0, + 1106.0, + 1406.0, + 1138.0, + 294.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1131.0, + 561.0, + 1131.0, + 561.0, + 1172.0, + 292.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 671.0, + 1131.0, + 1308.0, + 1131.0, + 1308.0, + 1172.0, + 671.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1356.0, + 1131.0, + 1408.0, + 1131.0, + 1408.0, + 1172.0, + 1356.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1166.0, + 1215.0, + 1166.0, + 1215.0, + 1200.0, + 326.0, + 1200.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1196.0, + 297.0, + 1196.0, + 297.0, + 1231.0, + 294.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 1196.0, + 679.0, + 1196.0, + 679.0, + 1231.0, + 464.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 775.0, + 1196.0, + 1269.0, + 1196.0, + 1269.0, + 1231.0, + 775.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1287.0, + 1196.0, + 1406.0, + 1196.0, + 1406.0, + 1231.0, + 1287.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1226.0, + 543.0, + 1226.0, + 543.0, + 1260.0, + 294.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1886.0, + 1405.0, + 1886.0, + 1405.0, + 1923.0, + 294.0, + 1923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1915.0, + 1407.0, + 1915.0, + 1407.0, + 1955.0, + 294.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1949.0, + 1405.0, + 1949.0, + 1405.0, + 1982.0, + 296.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1553.0, + 1404.0, + 1553.0, + 1404.0, + 1590.0, + 295.0, + 1590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1583.0, + 1404.0, + 1583.0, + 1404.0, + 1615.0, + 295.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1610.0, + 1405.0, + 1610.0, + 1405.0, + 1643.0, + 294.0, + 1643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1638.0, + 1158.0, + 1638.0, + 1158.0, + 1671.0, + 294.0, + 1671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 350.0, + 1404.0, + 350.0, + 1404.0, + 391.0, + 294.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 382.0, + 1028.0, + 382.0, + 1028.0, + 420.0, + 294.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1706.0, + 1406.0, + 1706.0, + 1406.0, + 1745.0, + 295.0, + 1745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1741.0, + 513.0, + 1741.0, + 513.0, + 1773.0, + 297.0, + 1773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 293.0, + 690.0, + 293.0, + 690.0, + 331.0, + 295.0, + 331.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 488, + 223, + 1207, + 223, + 1207, + 409, + 488, + 409 + ], + "score": 0.978, + "html": "
MethodsVanillaFreeLB-3YOPO-3-2YOPO-3-3
STS-B92.20 (.2)92.67 (.08)92.60 (.17)92.60 (0.20)
SST-296.56 (.3)96.79 (.2)96.44 (.2)96.33 (.1)
QNLI-94.98 (.2)94.96 (.1)-
QQP二92.60 (.03)92.55 (.05)*92.50 (.02)*
MNLI-90.61 (.1)90.59 (.2)90.45 (.2)
" + }, + { + "category_id": 1, + "poly": [ + 295, + 600, + 1402, + 600, + 1402, + 665, + 295, + 665 + ], + "score": 0.952 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 816, + 75, + 816, + 105, + 298, + 105 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.842 + }, + { + "category_id": 1, + "poly": [ + 296, + 417, + 1406, + 417, + 1406, + 558, + 296, + 558 + ], + "score": 0.612 + }, + { + "category_id": 7, + "poly": [ + 296, + 417, + 1406, + 417, + 1406, + 558, + 296, + 558 + ], + "score": 0.11 + }, + { + "category_id": 13, + "poly": [ + 371, + 505, + 391, + 505, + 391, + 526, + 371, + 526 + ], + "score": 0.77, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 503, + 533, + 529, + 533, + 529, + 554, + 503, + 554 + ], + "score": 0.77, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 1044, + 534, + 1063, + 534, + 1063, + 554, + 1044, + 554 + ], + "score": 0.75, + "latex": "_ n" + }, + { + "category_id": 13, + "poly": [ + 1349, + 504, + 1374, + 504, + 1374, + 526, + 1349, + 526 + ], + "score": 0.75, + "latex": "\\mathbf { \\nabla } m" + }, + { + "category_id": 13, + "poly": [ + 801, + 532, + 820, + 532, + 820, + 554, + 801, + 554 + ], + "score": 0.74, + "latex": "\\mathbf { \\nabla } \\cdot \\mathbf { n }" + }, + { + "category_id": 13, + "poly": [ + 1137, + 504, + 1171, + 504, + 1171, + 527, + 1137, + 527 + ], + "score": 0.37, + "latex": "_ { n \\alpha }" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2122.0, + 832.0, + 2122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 415.0, + 1404.0, + 415.0, + 1404.0, + 449.0, + 295.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 445.0, + 1403.0, + 445.0, + 1403.0, + 476.0, + 294.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 469.0, + 1406.0, + 469.0, + 1406.0, + 508.0, + 291.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 500.0, + 370.0, + 500.0, + 370.0, + 531.0, + 295.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 500.0, + 1136.0, + 500.0, + 1136.0, + 531.0, + 392.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1172.0, + 500.0, + 1348.0, + 500.0, + 1348.0, + 531.0, + 1172.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1375.0, + 500.0, + 1406.0, + 500.0, + 1406.0, + 531.0, + 1375.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 529.0, + 502.0, + 529.0, + 502.0, + 560.0, + 295.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 529.0, + 800.0, + 529.0, + 800.0, + 560.0, + 530.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 529.0, + 1043.0, + 529.0, + 1043.0, + 560.0, + 821.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 529.0, + 1291.0, + 529.0, + 1291.0, + 560.0, + 1064.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 600.0, + 1404.0, + 600.0, + 1404.0, + 636.0, + 294.0, + 636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 633.0, + 871.0, + 633.0, + 871.0, + 667.0, + 294.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 415.0, + 1404.0, + 415.0, + 1404.0, + 449.0, + 295.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 445.0, + 1403.0, + 445.0, + 1403.0, + 476.0, + 294.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 469.0, + 1406.0, + 469.0, + 1406.0, + 508.0, + 291.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 500.0, + 370.0, + 500.0, + 370.0, + 531.0, + 295.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 500.0, + 1136.0, + 500.0, + 1136.0, + 531.0, + 392.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1172.0, + 500.0, + 1348.0, + 500.0, + 1348.0, + 531.0, + 1172.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1375.0, + 500.0, + 1406.0, + 500.0, + 1406.0, + 531.0, + 1375.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 529.0, + 502.0, + 529.0, + 502.0, + 560.0, + 295.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 529.0, + 800.0, + 529.0, + 800.0, + 560.0, + 530.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 529.0, + 1043.0, + 529.0, + 1043.0, + 560.0, + 821.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 529.0, + 1291.0, + 529.0, + 1291.0, + 560.0, + 1064.0, + 560.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/ByldLrqlx/ByldLrqlx.md b/parse/train/ByldLrqlx/ByldLrqlx.md new file mode 100644 index 0000000000000000000000000000000000000000..11cd4fc9ff8e5b6a4b7b9e4e14837d603e7bbcd2 --- /dev/null +++ b/parse/train/ByldLrqlx/ByldLrqlx.md @@ -0,0 +1,496 @@ +# DEEPCODER: LEARNING TO WRITE PROGRAMS + +Matej Balog∗ Department of Engineering University of Cambridge + +Alexander L. Gaunt, Marc Brockschmidt, Sebastian Nowozin, Daniel Tarlow Microsoft Research + +# ABSTRACT + +We develop a first line of attack for solving programming competition-style problems from input-output examples using deep learning. The approach is to train a neural network to predict properties of the program that generated the outputs from the inputs. We use the neural network’s predictions to augment search techniques from the programming languages community, including enumerative search and an SMT-based solver. Empirically, we show that our approach leads to an order of magnitude speedup over the strong non-augmented baselines and a Recurrent Neural Network approach, and that we are able to solve problems of difficulty comparable to the simplest problems on programming competition websites. + +# 1 INTRODUCTION + +A dream of artificial intelligence is to build systems that can write computer programs. Recently, there has been much interest in program-like neural network models (Graves et al., 2014; Weston et al., 2015; Kurach et al., 2015; Joulin & Mikolov, 2015; Grefenstette et al., 2015; Sukhbaatar et al., 2015; Neelakantan et al., 2016; Kaiser & Sutskever, 2016; Reed & de Freitas, 2016; Zaremba et al., 2016; Graves et al., 2016), but none of these can write programs; that is, they do not generate human-readable source code. Only very recently, Riedel et al. (2016); Bunel et al. (2016); Gaunt et al. (2016) explored the use of gradient descent to induce source code from input-output examples via differentiable interpreters, and Ling et al. (2016) explored the generation of source code from unstructured text descriptions. However, Gaunt et al. (2016) showed that differentiable interpreterbased program induction is inferior to discrete search-based techniques used by the programming languages community. We are then left with the question of how to make progress on program induction using machine learning techniques. + +In this work, we propose two main ideas: (1) learn to induce programs; that is, use a corpus of program induction problems to learn strategies that generalize across problems, and (2) integrate neural network architectures with search-based techniques rather than replace them. + +In more detail, we can contrast our approach to existing work on differentiable interpreters. In differentiable interpreters, the idea is to define a differentiable mapping from source code and inputs to outputs. After observing inputs and outputs, gradient descent can be used to search for a program that matches the input-output examples. This approach leverages gradient-based optimization, which has proven powerful for training neural networks, but each synthesis problem is still solved independently—solving many synthesis problems does not help to solve the next problem. + +We argue that machine learning can provide significant value towards solving Inductive Program Synthesis (IPS) by re-casting the problem as a big data problem. We show that training a neural network on a large number of generated IPS problems to predict cues from the problem description can help a search-based technique. In this work, we focus on predicting an order on the program space and show how to use it to guide search-based techniques that are common in the programming languages community. This approach has three desirable properties: first, we transform a difficult search problem into a supervised learning problem; second, we soften the effect of failures of the neural network by searching over program space rather than relying on a single prediction; and third, the neural network’s predictions are used to guide existing program synthesis systems, allowing us to use and improve on the best solvers from the programming languages community. Empirically, we show orders-of-magnitude improvements over optimized standard search techniques and a Recurrent Neural Network-based approach to the problem. + +In summary, we define and instantiate a framework for using deep learning for program synthesis problems like ones appearing on programming competition websites. Our concrete contributions are: + +1. defining a programming language that is expressive enough to include real-world programming problems while being high-level enough to be predictable from input-output examples; 2. models for mapping sets of input-output examples to program properties; and 3. experiments that show an order of magnitude speedup over standard program synthesis techniques, which makes this approach feasible for solving problems of similar difficulty as the simplest problems that appear on programming competition websites. + +# 2 BACKGROUND ON INDUCTIVE PROGRAM SYNTHESIS + +We begin by providing background on Inductive Program Synthesis, including a brief overview of how it is typically formulated and solved in the programming languages community. + +The Inductive Program Synthesis (IPS) problem is the following: given input-output examples, produce a program that has behavior consistent with the examples. + +Building an IPS system requires solving two problems. First, the search problem: to find consistent programs we need to search over a suitable set of possible programs. We need to define the set (i.e., the program space) and search procedure. Second, the ranking problem: if there are multiple programs consistent with the input-output examples, which one do we return? Both of these problems are dependent on the specifics of the problem formulation. Thus, the first important decision in formulating an approach to program synthesis is the choice of a Domain Specific Language. + +Domain Specific Languages (DSLs). DSLs are programming languages that are suitable for a specialized domain but are more restrictive than full-featured programming languages. For example, one might disallow loops or other control flow, and only allow string data types and a small number of primitive operations like concatenation. Most of program synthesis research focuses on synthesizing programs in DSLs, because full-featured languages like $\mathrm { C } { + + }$ enlarge the search space and complicate synthesis. Restricted DSLs can also enable more efficient special-purpose search algorithms. For example, if a DSL only allows concatenations of substrings of an input string, a dynamic programming algorithm can efficiently search over all possible programs (Polozov & Gulwani, 2015). The choice of DSL also affects the difficulty of the ranking problem. For example, in a DSL without if statements, the same algorithm is applied to all inputs, reducing the number of programs consistent with any set of input-output examples, and thus the ranking problem becomes easier. Of course, the restrictiveness of the chosen DSL also determines which problems the system can solve at all. + +Search Techniques. There are many techniques for searching for programs consistent with inputoutput examples. Perhaps the simplest approach is to define a grammar and then enumerate all derivations of the grammar, checking each one for consistency with the examples. This approach can be combined with pruning based on types and other logical reasoning (Feser et al., 2015). While simple, these approaches can be implemented efficiently, and they can be surprisingly effective. + +In restricted domains such as the concatenation example discussed above, special-purpose algorithms can be used. FlashMeta (Polozov & Gulwani, 2015) describes a framework for DSLs which allow decomposition of the search problem, e.g., where the production of an output string from an input string can be reduced to finding a program for producing the first part of the output and concatenating it with a program for producing the latter part of the output string. + +Another class of systems is based on Satisfiability Modulo Theories (SMT) solving. SMT combines SAT-style search with theories like arithmetic and inequalities, with the benefit that theory-dependent subproblems can be handled by special-purpose solvers. For example, a special-purpose solver can easily find integers $x , y$ such that $x < y$ and $y < - 1 0 0$ hold, whereas an enumeration strategy may need to consider many values before satisfying the constraints. Many program synthesis engines based on SMT solvers exist, e.g., Sketch (Solar-Lezama, 2008) and Brahma (Gulwani et al., 2011). They convert the semantics of a DSL into a set of constraints between variables representing the program and the input-output values, and then call an SMT solver to find a satisfying setting of the program variables. This approach shines when special-purpose reasoning can be leveraged, but complex DSLs can lead to very large constraint problems where constructing and manipulating the constraints can be a lot slower than an enumerative approach. + +Finally, stochastic local search can be employed to search over program space, and there is a long history of applying genetic algorithms to this problem. One of the most successful recent examples is the STOKE super-optimization system (Schkufza et al., 2016), which uses stochastic local search to find assembly programs that have the same semantics as an input program but execute faster. + +Ranking. While we focus on the search problem in this work, we briefly mention the ranking problem here. A popular choice for ranking is to choose the shortest program consistent with inputoutput examples (Gulwani, 2016). A more sophisticated approach is employed by FlashFill (Singh & Gulwani, 2015). It works in a manner similar to max-margin structured prediction, where known ground truth programs are given, and the learning task is to assign scores to programs such that the ground truth programs score higher than other programs that satisfy the input-output specification. + +# 3 LEARNING INDUCTIVE PROGRAM SYNTHESIS (LIPS) + +In this section we outline the general approach that we follow in this work, which we call Learning Inductive Program Synthesis (LIPS). The details of our instantiation of LIPS appear in Sect. 4. The components of LIPS are (1) a DSL specification, (2) a data-generation procedure, (3) a machine learning model that maps from input-output examples to program attributes, and (4) a search procedure that searches program space in an order guided by the model from (3). The framework is related to the formulation of Menon et al. (2013); the relationship and key differences are discussed in Sect. 6. + +(1) DSL and Attributes. The choice of DSL is important in LIPS, just as it is in any program synthesis system. It should be expressive enough to capture the problems that we wish to solve, but restricted as much as possible to limit the difficulty of the search. In LIPS we additionally specify an attribute function $\mathcal { A }$ that maps programs $P$ of the DSL to finite attribute vectors $\mathbf { \boldsymbol { a } } \overset { \cdot } { = } \mathbf { \bar { A } } ( \mathbf { \boldsymbol { P } } )$ . (Attribute vectors of different programs need not have equal length.) Attributes serve as the link between the machine learning and the search component of LIPS: the machine learning model predicts a distribution $q ( \pmb { a } \mid \mathcal { E } )$ , where $\mathcal { E }$ is the set of input-output examples, and the search procedure aims to search over programs $P$ as ordered by $q ( { \bar { \mathcal { A } } } ( { \bar { P } } ) \mid \varepsilon )$ . Thus an attribute is useful if it is both predictable from input-output examples, and if conditioning on its value significantly reduces the effective size of the search space. + +Possible attributes are the (perhaps position-dependent) presence or absence of high-level functions (e.g., does the program contain or end in a call to SORT). Other possible attributes include control flow templates (e.g., the number of loops and conditionals). In the extreme case, one may set $\mathcal { A }$ to the identity function, in which case the attribute is equivalent to the program; however, in our experiments we find that performance is improved by choosing a more abstract attribute function. + +(2) Data Generation. Step 2 is to generate a dataset $( ( P ^ { ( n ) } , \pmb { a } ^ { ( n ) } , \pmb { \mathcal { E } } ^ { ( n ) } ) ) _ { n = 1 } ^ { N }$ of programs $P ^ { ( n ) }$ in the chosen DSL, their attributes $\mathbf { \pmb { a } } ^ { ( n ) }$ , and accompanying input-output examples ${ \mathcal { E } } ^ { ( n ) }$ . Different approaches are possible, ranging from enumerating valid programs in the DSL and pruning, to training a more sophisticated generative model of programs in the DSL. The key in the LIPS formulation is to ensure that it is feasible to generate a large dataset (ideally millions of programs). + +(3) Machine Learning Model. The machine learning problem is to learn a distribution of attributes given input-output examples, $q ( \pmb { a } \mid \mathcal { E } )$ . There is freedom to explore a large space of models, so long as the input component can encode $\mathcal { E }$ , and the output is a proper distribution over attributes (e.g., if attributes are a fixed-size binary vector, then a neural network with independent sigmoid outputs is appropriate; if attributes are variable size, then a recurrent neural network output could be used). Attributes are observed at training time, so training can use a maximum likelihood objective. + +(4) Search. The aim of the search component is to interface with an existing solver, using the predicted $q ( \pmb { a } \mid \mathcal { E } )$ to guide the search. We describe specific approaches in the next section. + +# 4 DEEPCODER + +Here we describe DeepCoder, our instantiation of LIPS including a choice of DSL, a data generation strategy, models for encoding input-output sets, and algorithms for searching over program space. + +# 4.1 DOMAIN SPECIFIC LANGUAGE AND ATTRIBUTES + +We consider binary attributes indicating the presence or absence of high-level functions in the target program. To make this effective, the chosen DSL needs to contain constructs that are not so low-level that they all appear in the vast majority of programs, but at the same time should be common enough so that predicting their occurrence from input-output examples can be learned successfully. + +Following this observation, our DSL is loosely inspired by query languages such as SQL or LINQ, where high-level functions are used in sequence to manipulate data. A program in our DSL is a sequence of function calls, where the result of each call initializes a fresh variable that is either a singleton integer or an integer array. Functions can be applied to any of the inputs or previously computed (intermediate) variables. The output of the program is the return value of the last function call, i.e., the last variable. See Fig. 1 for an example program of length $T = 4$ in our DSL. + +![](images/95255e32da9df33db9a517e94978033a462b93ebbbe24b571c4b80d5e2c7f8e6.jpg) +Figure 1: An example program in our DSL that takes a single integer array as its input. + +Overall, our DSL contains the first-order functions HEAD, LAST, TAKE, DROP, ACCESS, MINIMUM, MAXIMUM, REVERSE, SORT, SUM, and the higher-order functions MAP, FILTER, COUNT, ZIPWITH, SCANL1. Higher-order functions require suitable lambda functions for their behavior to be fully specified: for MAP our DSL provides lambdas $( + 1 )$ , $( - 1 )$ , $( \star 2 )$ , $( / 2 )$ ), $( \star \ ( - 1 ) \ )$ ), $( \star \star 2 )$ , $( \star 3 )$ , $( / 3 )$ , $( \star 4 )$ , $( / 4 )$ ; for FILTER and COUNT there are predicates $( > 0 )$ ), $( < 0 )$ , ( $\scriptstyle { \frac { 0 } { 0 } } 2 = = 0$ ), ( $\scriptstyle { \frac { 0 } { 0 } } 2 = = 1$ ) and for ZIPWITH and SCANL1 the DSL provides lambdas $( + ) , ( - ) , ( \star ) ,$ MIN, MAX. A description of the semantics of all functions is provided in Appendix F. + +Note that while the language only allows linear control flow, many of its functions do perform branching and looping internally (e.g., SORT, COUNT, ...). Examples of more sophisticated programs expressible in our DSL, which were inspired by the simplest problems appearing on programming competition websites, are shown in Appendix A. + +# 4.2 DATA GENERATION + +To generate a dataset, we enumerate programs in the DSL, heuristically pruning away those with easily detectable issues such as a redundant variable whose value does not affect the program output, or, more generally, existence of a shorter equivalent program (equivalence can be overapproximated by identical behavior on randomly or carefully chosen inputs). To generate valid inputs for a program, we enforce a constraint on the output value bounding integers to some predetermined range, and then propagate these constraints backward through the program to obtain a range of valid values for each input. If one of these ranges is empty, we discard the program. Otherwise, input-output pairs can be generated by picking inputs from the pre-computed valid ranges and executing the program to obtain the output values. The binary attribute vectors are easily computed from the program source codes. + +# 4.3 MACHINE LEARNING MODEL + +Observe how the input-output data in Fig. 1 is informative of the functions appearing in the program: the values in the output are all negative, divisible by 4, they are sorted in decreasing order, and they happen to be multiples of numbers appearing in the input. Our aim is to learn to recognize such patterns in the input-output examples, and to leverage them to predict the presence or absence of individual functions. We employ neural networks to model and learn the mapping from input-output examples to attributes. We can think of these networks as consisting of two parts: + +1. an encoder: a differentiable mapping from a set of $M$ input-output examples generated by a single program to a latent real-valued vector, and 2. a decoder: a differentiable mapping from the latent vector representing a set of $M$ inputoutput examples to predictions of the ground truth program’s attributes. + +For the encoder we use a simple feed-forward architecture. First, we represent the input and output types (singleton or array) by a one-hot-encoding, and we pad the inputs and outputs to a maximum length $L$ with a special NULL value. Second, each integer in the inputs and in the output is mapped to a learned embedding vector of size $E = 2 0$ . (The range of integers is restricted to a finite range and each embedding is parametrized individually.) Third, for each input-output example separately, we concatenate the embeddings of the input types, the inputs, the output type, and the output into a single (fixed-length) vector, and pass this vector through $H = 3$ hidden layers containing $K = 2 5 6$ sigmoid units each. The third hidden layer thus provides an encoding of each individual input-output example. Finally, for input-output examples in a set generated from the same program, we pool these representations together by simple arithmetic averaging. See Appendix C for more details. + +The advantage of this encoder lies in its simplicity, and we found it reasonably easy to train. A disadvantage is that it requires an upper bound $L$ on the length of arrays appearing in the input and output. We confirmed that the chosen encoder architecture is sensible in that it performs empirically at least as well as an RNN encoder, a natural baseline, which may however be more difficult to train. + +DeepCoder learns to predict presence or absence of individual functions of the DSL. We shall see this can already be exploited by various search techniques to large computational gains. We use a decoder that pre-multiplies the encoding of input-output examples by a learned $C \times K$ matrix, where $C = 3 4$ is the number of functions in our DSL (higher-order functions and lambdas are predicted independently), and treats the resulting $C$ numbers as log-unnormalized probabilities (logits) of each function appearing in the source code. Fig. 2 shows the predictions a trained neural network made from 5 input-output examples for the program shown in Fig. 1. + +![](images/c3c080b2a8813d24f061fe69fe44372e58ba574c230d52185f026a848a7215ca.jpg) +Figure 2: Neural network predicts the probability of each function appearing in the source code. + +# 4.4 SEARCH + +One of the central ideas of this work is to use a neural network to guide the search for a program consistent with a set of input-output examples instead of directly predicting the entire source code. This section briefly describes the search techniques and how they integrate the predicted attributes. + +Depth-first search (DFS). We use an optimized version of DFS to search over programs with a given maximum length $T$ (see Appendix D for details). When the search procedure extends a partial program by a new function, it has to try the functions in the DSL in some order. At this point DFS can opt to consider the functions as ordered by their predicted probabilities from the neural network. + +“Sort and add” enumeration. A stronger way of utilizing the predicted probabilities of functions in an enumerative search procedure is to use a Sort and add scheme, which maintains a set of active functions and performs DFS with the active function set only. Whenever the search fails, the next most probable function (or several) are added to the active set and the search restarts with this larger active set. Note that this scheme has the deficiency of potentially re-exploring some parts of the search space several times, which could be avoided by a more sophisticated search procedure. + +Sketch. Sketch (Solar-Lezama, 2008) is a successful SMT-based program synthesis tool from the programming languages research community. While its main use case is to synthesize programs by filling in “holes” in incomplete source code so as to match specified requirements, it is flexible enough for our use case as well. The function in each step and its arguments can be treated as the “holes”, and the requirement to be satisfied is consistency with the provided set of input-output examples. Sketch can utilize the neural network predictions in a Sort and add scheme as described above, as the possibilities for each function hole can be restricted to the current active set. + +$\lambda ^ { 2 }$ . $\lambda ^ { 2 }$ (Feser et al., 2015) is a program synthesis tool from the programming languages community that combines enumerative search with deduction to prune the search space. It is designed to infer small functional programs for data structure manipulation from input-output examples, by combining functions from a provided library. $\lambda ^ { 2 }$ can be used in our framework using a Sort and add scheme as described above by choosing the library of functions according to the neural network predictions. + +# 4.5 TRAINING LOSS FUNCTION + +We use the negative cross entropy loss to train the neural network described in Sect. 4.3, so that its predictions about each function can be interpreted as marginal probabilities. The LIPS framework dictates learning $q ( \pmb { a } \mid \mathcal { E } )$ , the joint distribution of all attributes $\textbf { \em a }$ given the input-output examples, and it is not clear a priori how much DeepCoder loses by ignoring correlations between functions. However, under the simplifying assumption that the runtime of searching for a program of length $T$ with $C$ functions made available to a search routine is proportional to $\check { C } ^ { T }$ , the following result for Sort and add procedures shows that their runtime can be optimized using marginal probabilities. + +Lemma 1. For any fixed program length $T$ , the expected total runtime of a Sort and add search scheme can be upper bounded by a quantity that is minimized by adding the functions in the order of decreasing true marginal probabilities. + +Proof. Predicting source code functions from input-output examples can be seen as a multi-label classification problem, where each set of input-output examples is associated with a set of relevant labels (functions appearing in the ground truth source code). Dembczynski et al. (2010) showed that in multi-label classification under a so-called Rank loss, it is Bayes optimal to rank the labels according to their marginal probabilities. If the runtime of search with $C$ functions is proportional to $C ^ { T }$ , the total runtime of a Sort and add procedure can be monotonically transformed so that it is upper bounded by this Rank loss. See Appendix E for more details. □ + +# 5 EXPERIMENTS + +In this section we report results from two categories of experiments. Our main experiments (Sect. 5.1) show that the LIPS framework can lead to significant performance gains in solving IPS by demonstrating such gains with DeepCoder. In Sect. 5.2 we illustrate the robustness of the method by demonstrating a strong kind of generalization ability across programs of different lengths. + +# 5.1 DEEPCODER COMPARED TO BASELINES + +We trained a neural network as described in Sect. 4.3 to predict used functions from input-output examples and constructed a test set of $P = 5 0 0$ programs, guaranteed to be semantically disjoint from all programs on which the neural network was trained (similarly to the equivalence check described in Sect. 4.2, we have ensured that all test programs behave differently from all programs used during training on at least one input). For each test program we generated $M = 5$ input-output examples involving integers of magnitudes up to 256, passed the examples to the trained neural network, and fed the obtained predictions to the search procedures from Sect. 4.4. We also considered a RNN-based decoder generating programs using beam search (see Sect. 5.3 for details). To evaluate DeepCoder, we then recorded the time the search procedures needed to find a program consistent with the $M$ input-output examples. As a baseline, we also ran all search procedures using a simple prior as function probabilities, computed from their global incidence in the program corpus. + +In the first, smaller-scale experiment (program search space size $\sim 2 \times 1 0 ^ { 6 }$ ) we trained the neural network on programs of length $T = 3$ , and the test programs were of the same length. Table 1 shows the per-task timeout required such that a solution could be found for given proportions of the test tasks (in time less than or equal to the timeout). For example, in a hypothetical test set with 4 tasks and runtimes of 3s, 2s, 1s, 4s, the timeout required to solve $50 \%$ of tasks would be 2s. More detailed experimental results are discussed in Appendix B. + +Table 1: Search speedups on programs of length $T = 3$ due to using neural network predictions. + +
Timeout needed to solveDFSEnumeration12SketchBeam
20%40%60%20%40%60%20%40%60%20%40%20%
Baseline41ms126ms314ms80ms:335ms861ms18.9s49.6s 84.2s>103s>103s>103s
DeepCoder2.7ms33ms110ms1.3ms6.1ms27ms0.23s0.52s 13.5s2.13s455s292s
Speedup15.2×3.9×2.9×62.2×54.6×31.5×80.4×94.6×6.2×>467×>2.2×>3.4×
+ +In the main experiment, we tackled a large-scale problem of searching for programs consistent with input-output examples generated from programs of length $T = 5$ (search space size on the order of $1 0 ^ { \overline { { 1 0 } } }$ ), supported by a neural network trained with programs of shorter length $T = 4$ . Here, we only consider $P = 1 0 0$ programs for reasons of computational efficiency, after having verified that this does not significantly affect the results in Table 1. The table in Fig. 3a shows significant speedups for DFS, Sort and add enumeration, and $\lambda ^ { 2 }$ with Sort and add enumeration, the search techniques capable of solving the search problem in reasonable time frames. Note that Sort and add enumeration without the neural network (using prior probabilities of functions) exceeded the $1 0 ^ { 4 }$ second timeout in two cases, so the relative speedups shown are crude lower bounds. + +![](images/a7cd9438bdca3d6b3e822af385015998ac105636d940628b2f68f443f81b05e3.jpg) +Figure 3: Search speedups on programs of length $T = 5$ and influence of length of training programs. + +We hypothesize that the substantially larger performance gains on Sort and add schemes as compared to gains on DFS can be explained by the fact that the choice of attribute function (predicting presence of functions anywhere in the program) and learning objective of the neural network are better matched to the Sort and add schemes. Indeed, a more appropriate attribute function for DFS would be one that is more informative of the functions appearing early in the program, since exploring an incorrect first function is costly with DFS. On the other hand, the discussion in Sect. 4.5 provides theoretical indication that ignoring the correlations between functions is not cataclysmic for Sort and add enumeration, since a Rank loss that upper bounds the Sort and add runtime can still be minimized. + +In Appendix G we analyse the performance of the neural networks used in these experiments, by investigating which attributes (program instructions) tend to be difficult to distinguish from each other. + +# 5.2 GENERALIZATION ACROSS PROGRAM LENGTHS + +To investigate the encoder’s generalization ability across programs of different lengths, we trained a network to predict used functions from input-output examples that were generated from programs of length $T _ { \mathrm { t r a i n } } \in \{ 1 , . . . , 4 \}$ . We then used each of these networks to predict functions on 5 test sets containing input-output examples generated from programs of lengths $T _ { \mathrm { t e s t } } \in \{ 1 , . . . , 5 \}$ , respectively. The test programs of a given length $T$ were semantically disjoint from all training programs of the same length $T$ and also from all training and test programs of shorter lengths $T ^ { \prime } < T$ . + +For each of the combinations of $T _ { \mathrm { t r a i n } }$ and $T _ { \mathrm { t e s t } }$ , Sort and add enumerative search was run both with and without using the neural network’s predictions (in the latter case using prior probabilities) until it solved $2 0 \%$ of the test set tasks. Fig. 3b shows the relative speedup of the solver having access to predictions from the trained neural networks. These results indicate that the neural networks are able to generalize beyond programs of the same length that they were trained on. This is partly due to the search procedure on top of their predictions, which has the opportunity to correct for the presence of functions that the neural network failed to predict. Note that a sequence-to-sequence model trained on programs of a fixed length could not be expected to exhibit this kind of generalization ability. + +# 5.3 ALTERNATIVE MODELS + +Encoder We evaluated replacing the feed-forward architecture encoder (Sect. 4.3) with an RNN, a natural baseline. Using a GRU-based RNN we were able to achieve results almost as good as using the feed-forward architecture, but found the RNN encoder more difficult to train. + +Decoder We also considered a purely neural network-based approach, where an RNN decoder is trained to predict the entire program token-by-token. We combined this with our feed-forward encoder by initializing the RNN using the pooled final layer of the encoder. We found it substantially more difficult to train an RNN decoder as compared to the independent binary classifiers employed above. Beam search was used to explore likely programs predicted by the RNN, but it only lead to a solution comparable with the other techniques when searching for programs of lengths $T \le 2$ , where the search space size is very small (on the order of $1 0 ^ { 3 }$ ). Note that using an RNN for both the encoder and decoder corresponds to a standard sequence-to-sequence model. However, we do do not rule out that a more sophisticated RNN decoder or training procedure could be possibly more successful. + +# 6 RELATED WORK + +Machine Learning for Inductive Program Synthesis. There is relatively little work on using machine learning for programming by example. The most closely related work is that of Menon et al. (2013), in which a hand-coded set of features of input-output examples are used as “clues.” When a clue appears in the input-output examples (e.g., the output is a permutation of the input), it reweights the probabilities of productions in a probabilistic context free grammar by a learned amount. This work shares the idea of learning to guide the search over program space conditional on input-output examples. One difference is in the domains. Menon et al. (2013) operate on short string manipulation programs, where it is arguably easier to hand-code features to recognize patterns in the input-output examples (e.g., if the outputs are always permutations or substrings of the input). Our work shows that there are strong cues in patterns in input-output examples in the domain of numbers and lists. However, the main difference is the scale. Menon et al. (2013) learns from a small (280 examples), manually-constructed dataset, which limits the capacity of the machine learning model that can be trained. Thus, it forces the machine learning component to be relatively simple. Indeed, Menon et al. (2013) use a log-linear model and rely on hand-constructed features. LIPS automatically generates training data, which yields datasets with millions of programs and enables high-capacity deep learning models to be brought to bear on the problem. + +Learning Representations of Program State. Piech et al. (2015) propose to learn joint embeddings of program states and programs to automatically extend teacher feedback to many similar programs in the MOOC setting. This work is similar in that it considers embedding program states, but the domain is different, and it otherwise specifically focuses on syntactic differences between semantically equivalent programs to provide stylistic feedback. Li et al. (2016) use graph neural networks (GNNs) to predict logical descriptions from program states, focusing on data structure shapes instead of numerical and list data. Such GNNs may be a suitable architecture to encode states appearing when extending our DSL to handle more complex data structures. + +Learning to Infer. Very recently, Alemi et al. (2016) used neural sequence models in tandem with an automated theorem prover. Similar to our Sort and Add strategy, a neural network component is trained to select premises that the theorem prover can use to prove a theorem. A recent extension (Loos et al., 2017) is similar to our DFS enumeration strategy and uses a neural network to guide the proof search at intermediate steps. The main differences are in the domains, and that they train on an existing corpus of theorems. More broadly, if we view a DSL as defining a model and search as a form of inference algorithm, then there is a large body of work on using discriminatively-trained models to aid inference in generative models. Examples include Dayan et al. (1995); Kingma & Welling (2014); Shotton et al. (2013); Stuhlmuller et al. (2013); Heess et al. (2013); Jampani et al. ¨ (2015). + +# 7 DISCUSSION AND FUTURE WORK + +We have presented a framework for improving IPS systems by using neural networks to translate cues in input-output examples to guidance over where to search in program space. Our empirical results show that for many programs, this technique improves the runtime of a wide range of IPS baselines by 1-3 orders. We have found several problems in real online programming challenges that can be solved with a program in our language, which validates the relevance of the class of problems that we have studied in this work. In sum, this suggests that we have made significant progress towards being able to solve programming competition problems, and the machine learning component plays an important role in making it tractable. + +There remain some limitations, however. First, the programs we can synthesize are only the simplest problems on programming competition websites and are simpler than most competition problems. Many problems require more complex algorithmic solutions like dynamic programming and search, which are currently beyond our reach. Our chosen DSL currently cannot express solutions to many problems. To do so, it would need to be extended by adding more primitives and allow for more flexibility in program constructs (such as allowing loops). Second, we currently use five input-output examples with relatively large integer values (up to 256 in magnitude), which are probably more informative than typical (smaller) examples. While we remain optimistic about LIPS’s applicability as the DSL becomes more complex and the input-output examples become less informative, it remains to be seen what the magnitude of these effects are as we move towards solving large subsets of programming competition problems. + +We foresee many extensions of DeepCoder. We are most interested in better data generation procedures by using generative models of source code, and to incorporate natural language problem descriptions to lessen the information burden required from input-output examples. In sum, DeepCoder represents a promising direction forward, and we are optimistic about the future prospects of using machine learning to synthesize programs. + +# ACKNOWLEDGMENTS + +The authors would like to express their gratitude to Rishabh Singh and Jack Feser for their valuable guidance and help on using the Sketch and $\lambda ^ { 2 }$ program synthesis systems. + +# REFERENCES + +Alex A. Alemi, Franc¸ois Chollet, Geoffrey Irving, Christian Szegedy, and Josef Urban. DeepMath - deep sequence models for premise selection. In Proocedings of the 29th Conference on Advances in Neural Information Processing Systems (NIPS), 2016. +Rudy R Bunel, Alban Desmaison, Pawan K Mudigonda, Pushmeet Kohli, and Philip Torr. Adaptive neural compilation. In Proceedings of the 29th Conference on Advances in Neural Information Processing Systems (NIPS), 2016. +Peter Dayan, Geoffrey E Hinton, Radford M Neal, and Richard S Zemel. The Helmholtz machine. Neural computation, 7(5):889–904, 1995. +Krzysztof Dembczynski, Willem Waegeman, Weiwei Cheng, and Eyke H ´ ullermeier. On label de- ¨ pendence and loss minimization in multi-label classification. Machine Learning, 88(1):5–45, 2012. +Krzysztof J. Dembczynski, Weiwei Cheng, and Eyke Hllermeier. Bayes optimal multilabel classification via probabilistic classifier chains. In Proceedings of the 27th International Conference on Machine Learning (ICML), 2010. +John K. Feser, Swarat Chaudhuri, and Isil Dillig. Synthesizing data structure transformations from input-output examples. In Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2015. +Alexander L. Gaunt, Marc Brockschmidt, Rishabh Singh, Nate Kushman, Pushmeet Kohli, Jonathan Taylor, and Daniel Tarlow. Terpret: A probabilistic programming language for program induction. CoRR, abs/1608.04428, 2016. URL http://arxiv.org/abs/1608.04428. + +Alex Graves, Greg Wayne, and Ivo Danihelka. Neural Turing machines. CoRR, abs/1410.5401, 2014. URL http://arxiv.org/abs/1410.5401. + +Alex Graves, Greg Wayne, Malcolm Reynolds, Tim Harley, Ivo Danihelka, Agnieszka GrabskaBarwinska, Sergio G ´ omez Colmenarejo, Edward Grefenstette, Tiago Ramalho, John Agapiou, ´ et al. Hybrid computing using a neural network with dynamic external memory. Nature, 2016. + +Edward Grefenstette, Karl Moritz Hermann, Mustafa Suleyman, and Phil Blunsom. Learning to transduce with unbounded memory. In Proceedings of the 28th Conference on Advances in Neural Information Processing Systems (NIPS), 2015. + +Sumit Gulwani. Programming by examples: Applications, algorithms, and ambiguity resolution. In Proceedings of the 8th International Joint Conference on Automated Reasoning (IJCAR), 2016. + +Sumit Gulwani, Susmit Jha, Ashish Tiwari, and Ramarathnam Venkatesan. Synthesis of loop-free programs. In Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2011. + +Nicolas Heess, Daniel Tarlow, and John Winn. Learning to pass expectation propagation messages. In Proceedings of the 26th Conference on Advances in Neural Information Processing Systems (NIPS), 2013. + +Varun Jampani, Sebastian Nowozin, Matthew Loper, and Peter V Gehler. The informed sampler: A discriminative approach to Bayesian inference in generative computer vision models. Computer Vision and Image Understanding, 136:32–44, 2015. + +Armand Joulin and Tomas Mikolov. Inferring algorithmic patterns with stack-augmented recurrent nets. In Proceedings of the 28th Conference on Advances in Neural Information Processing Systems (NIPS), 2015. + +Łukasz Kaiser and Ilya Sutskever. Neural GPUs learn algorithms. In Proceedings of the 4th International Conference on Learning Representations, 2016. + +Diederik P Kingma and Max Welling. Stochastic gradient VB and the variational auto-encoder. In Proceedings of the 2nd International Conference on Learning Representations (ICLR), 2014. + +Karol Kurach, Marcin Andrychowicz, and Ilya Sutskever. Neural random-access machines. In Proceedings of the 4th International Conference on Learning Representations 2016, 2015. + +Yujia Li, Daniel Tarlow, Marc Brockschmidt, and Richard S. Zemel. Gated graph sequence neural networks. In Proceedings of the 4th International Conference on Learning Representations (ICLR), 2016. + +Wang Ling, Edward Grefenstette, Karl Moritz Hermann, Toma´s Ko ˇ cisk ˇ y, Andrew Senior, Fumin ´ Wang, and Phil Blunsom. Latent predictor networks for code generation. In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics, 2016. + +Sarah M. Loos, Geoffrey Irving, Christian Szegedy, and Cezary Kaliszyk. Deep network guided proof search. CoRR, abs/1701.06972, 2017. URL http://arxiv.org/abs/1701.06972. + +Aditya Krishna Menon, Omer Tamuz, Sumit Gulwani, Butler W Lampson, and Adam Kalai. A machine learning framework for programming by example. In Proceedings of the International Conference on Machine Learning (ICML), 2013. + +Arvind Neelakantan, Quoc V. Le, and Ilya Sutskever. Neural programmer: Inducing latent programs with gradient descent. In Proceedings of the 4th International Conference on Learning Representations (ICLR), 2016. + +Chris Piech, Jonathan Huang, Andy Nguyen, Mike Phulsuksombati, Mehran Sahami, and Leonidas J. Guibas. Learning program embeddings to propagate feedback on student code. In Proceedings of the 32nd International Conference on Machine Learning (ICML), 2015. + +Oleksandr Polozov and Sumit Gulwani. FlashMeta: a framework for inductive program synthesis. In Proceedings of the International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 2015. + +Scott E. Reed and Nando de Freitas. Neural programmer-interpreters. In Proceedings of the 4th International Conference on Learning Representations (ICLR), 2016. + +Sebastian Riedel, Matko Bosnjak, and Tim Rocktaschel. Programming with a differentiable forth ¨ interpreter. CoRR, abs/1605.06640, 2016. URL http://arxiv.org/abs/1605.06640. + +Eric Schkufza, Rahul Sharma, and Alex Aiken. Stochastic program optimization. Commununications of the ACM, 59(2):114–122, 2016. + +Jamie Shotton, Toby Sharp, Alex Kipman, Andrew Fitzgibbon, Mark Finocchio, Andrew Blake, Mat Cook, and Richard Moore. Real-time human pose recognition in parts from single depth images. Communications of the ACM, 56(1):116–124, 2013. + +Rishabh Singh and Sumit Gulwani. Predicting a correct program in programming by example. In Proceedings of the 27th Conference on Computer Aided Verification (CAV), 2015. + +Armando Solar-Lezama. Program Synthesis By Sketching. PhD thesis, EECS Dept., UC Berkeley, 2008. + +Andreas Stuhlmuller, Jessica Taylor, and Noah D. Goodman. Learning stochastic inverses. In ¨ Proceedings of the 26th Conference on Advances in Neural Information Processing Systems (NIPS), 2013. + +Sainbayar Sukhbaatar, Arthur Szlam, Jason Weston, and Rob Fergus. End-to-end memory networks. In Proceedings of the 28th Conference on Advances in Neural Information Processing Systems (NIPS), 2015. + +Jason Weston, Sumit Chopra, and Antoine Bordes. Memory networks. In Proceedings of the 3rd International Conference on Learning Representations (ICLR), 2015. + +Wojciech Zaremba, Tomas Mikolov, Armand Joulin, and Rob Fergus. Learning simple algorithms from examples. In Proceedings of the 33nd International Conference on Machine Learning (ICML), 2016. + +# A EXAMPLE PROGRAMS + +This section shows example programs in our Domain Specific Language (DSL), together with inputoutput examples and short descriptions. These programs have been inspired by simple tasks appearing on real programming competition websites, and are meant to illustrate the expressive power of our DSL. + +# Program 0: + +$\mathrm { k } $ int b ← [int] c ← SORT b d ← TAKE k c e ← SUM d + +Input-output example: +Input: +2, [3 5 4 7 5] +Output: +[7] + +Description: + +A new shop near you is selling $n$ paintings. You have $k \ < \ n$ friends and you would like to buy each of your friends a painting from the shop. Return the minimal amount of money you will need to spend. + +# Program 1: + +$\bar { w } $ [int] +t ← [int] +c ← MAP (\*3) w +d ← ZIPWITH (+) c t +e ← MAXIMUM d +Input-output example: +Input: +[6 2 4 7 9], +[5 3 6 1 0] +Output: +27 + +Description: + +In soccer leagues, match winners are awarded 3 points, losers 0 points, and both teams get 1 point in the case of a tie. Compute the number of points awarded to the winner of a league given two arrays $w , t$ of the same length, where $w [ i ]$ (resp. $t [ i ] ,$ ) is the number of times team $i$ won (resp. tied). + +# Program 2: + +a ← [int] +b ← [int] +c ← ZIPWITH (-) b a $\mathsf { d } \gets \mathbf { C o u v r } \mathsf { T }$ $( > 0 )$ ) c + +# Input-output example: + +Input: +[6 2 4 7 9], +[5 3 2 1 0] +Output: +4 + +Description: + +Alice and Bob are comparing their results in a recent exam. Given their marks per question as two arrays $a$ and $b$ , count on how many questions Alice got more points than Bob. + +# Program 3: + +h ← [int] +b ← SCANL1 MIN h +c ← ZIPWITH (-) h b $\mathrm { ~ d ~ } $ FILTER $( > 0 )$ ) c +$\mathrm { ~ e ~ } { \gets } \mathbf { S } \mathbf { U } \mathbf { M } \mathrm { ~ d ~ }$ +Input-output example: +Input: +[8 5 7 2 5] +Output: +5 + +Description: + +Perditia is very peculiar about her garden and wants that the trees standing in a row are all of non-increasing heights. Given the tree heights in centimeters in order of the row as an array h, compute how many centimeters she needs to trim the trees in total. + +# Program 4: + +x ← [int] +y ← [int] +$\mathbf { \boldsymbol { \mathrm { c } } } \gets \mathbf { \boldsymbol { S } } \mathbf { \boldsymbol { O } } \mathbf { R } \mathbf { \boldsymbol { T } } \ \mathbf { \boldsymbol { x } }$ +d ← SORT y +e ← REVERSE d +f ← ZIPWITH (\*) d e +$\mathsf { g } \gets \mathsf { S U M } \mathrm { ~ f ~ }$ +Input-output example: +Input: +[7 3 8 2 5], +[2 8 9 1 3] +Output: +79 + +Description: + +Xavier and Yasmine are laying sticks to form non-overlapping rectangles on the ground. They both have fixed sets of pairs of sticks of certain lengths (represented as arrays x and y of numbers). Xavier only lays sticks parallel to the x axis, and Yasmine lays sticks only parallel to y axis. Compute the area their rectangles will cover at least. + +Program 5: +$\ a \gets$ [int] +$\ u \text b \gets$ REVERSE a +$\subset $ ZIPWITH MIN a b +Input-output example: +Input: +[3 7 5 2 8] +Output: +[3 2 5 2 3] + +# Description: + +A sequence called Billy is looking into the mirror, wondering how much weight it could lose by replacing any of its elements by their mirror images. Given a description of Billy as an array $b$ of length $n$ , return an array $c$ of minimal sum where each element $c [ i ]$ is either $b [ i ]$ or its mirror image $b [ n - i - 1 ]$ . + +
Program 6: IO example: t←[int] Input: p←[int] [4 8 11 2], C←MAP(-1)t [2341] d←MAP(-1)p Output: e ←ZIPWITH(+)c d 1 f←MINIMUMeDescription: Umberto has a large collection of ties and match- ing pocket squares—too large, his wife says—and he needs to sell one pair. Given their values as arrays t and p,assuming that he sells the cheapest pair, and selling costs 2,how much will he lose from the sale?
Program 7: IO example: s←[int] Input: p←[int] [4723], C ← SCANL1(+)p [2131] d ←ZIPWITH(*)S C Output: e←SUMd 62Description: Zack always promised his n friends to buy them candy, but never did. Now he won the lottery and counts how often and how much candy he promised to his friends,obtaining arrays p (num- ber of promises) and s (number of promised sweets). He announces that to repay them,he will buy s[1]+s[2]+...+s[n] pieces of candy for the firstp[1]days,thens[2]+s[3]+...+s[n]for p[2] days,and so on,until he has fulfilled all promises. How much candy will he buy in total?
Program 8: IO example: s←[int] Input: b ←REVERSE S [12457] C ←ZIPWITH(-)b s Output: d ←FILTER(>O)C 9 e←SuMdDescription: Vivian loves rearranging things.Most of all,when she sees a row of heaps, she wants to make sure that each heap has more items than the one to its left. She is also obsessed with efficiency, so always moves the least possible number of items.Her dad really dislikes if she changes the size of heaps,so she only moves single items between them,making sure that the set of sizes of the heaps is the same as at the start; they are only in a different order. When you come in, you see heaps of sizes (of course,sizes strictly monotonically increasing)s[O],s[1],... s[n].What is the maximal number of items that Vivian could have moved?
+ +![](images/6d29878119ef08e20bad2e228bb9a4b1140e7a88251e4c13cbe46fb4f2478484.jpg) +Fig. 4 shows the predictions made by a neural network trained on programs of length $T = 4$ that were ensured to be semantically disjoint from all 9 example programs shown in this section. For each task, the neural network was provided with 5 input-output examples. +Figure 4: Predictions of a neural network on the 9 example programs described in this section. Numbers in squares would ideally be close to 1 (function is present in the ground truth source code), whereas all other numbers should ideally be close to 0 (function is not needed). + +# B EXPERIMENTAL RESULTS + +Results presented in Sect. 5.1 showcased the computational speedups obtained from the LIPS framework (using DeepCoder), as opposed to solving each program synthesis problem with only the information about global incidence of functions in source code available. For completeness, here we show plots of raw computation times of each search procedure to solve a given number of problems. + +Fig. 5 shows the computation times of DFS, of Enumerative search with a Sort and add scheme, of the $\lambda ^ { 2 }$ and Sketch solvers with a Sort and add scheme, and of Beam search, when searching for a program consistent with input-output examples generated from $P = 5 0 0$ different test programs of length $T = 3$ . As discussed in Sect. 5.1, these test programs were ensured to be semantically disjoint from all programs used to train the neural networks, as well as from all programs of shorter length (as discussed in Sect. 4.2). + +![](images/69617f5d9c5e8b7b5a7be3c5b88b0456a2865590e84e41413e9067abe2f41f17.jpg) +Figure 5: Number of test problems solved versus computation time. + +The “steps” in the results for Beam search are due to our search strategy, which doubles the size of the considered beam until reaching the timeout (of 1000 seconds) and thus steps occur whenever the search for a beam of size $2 ^ { k }$ is finished. For $\dot { \lambda ^ { 2 } }$ , we observed that no solution for a given set of allowed functions was ever found after about 5 seconds (on the benchmark machines), but that $\lambda ^ { 2 }$ continued to search. Hence, we introduced a hard timeout after 6 seconds for all but the last iterations of our Sort and add scheme. + +Fig. 6 shows the computation times of DFS, Enumerative search with a Sort and add scheme, and $\lambda ^ { 2 }$ with a Sort and add scheme when searching for programs consistent with input-output examples generated from $P = 1 0 0$ different test programs of length $T = 5$ . The neural network was trained on programs of length $T = 4$ . + +![](images/8d83b6177f99db604465ccbe078168c96645752256eb9f14da14c4754aa158fd.jpg) +Figure 6: Number of test problems solved versus computation time. + +# C THE NEURAL NETWORK + +As briefly described in Sect. 4.3, we used the following simple feed-forward architecture encoder: + +• For each input-output example in the set generated from a single ground truth program: + +– Pad arrays appearing in the inputs and in the output to a maximum length $L = 2 0$ with a special NULL value. +– Represent the type (singleton integer or integer array) of each input and of the output using a one-hot-encoding vector. Embed each integer in the valid integer range $( - 2 5 6$ to 255) using a learned embedding into $E = 2 0$ dimensional space. Also learn an embedding for the padding NULL value. + +– Concatenate the representations of the input types, the embeddings of integers in the inputs, the representation of the output type, and the embeddings of integers in the output into a single (fixed-length) vector. – Pass this vector through $H = 3$ hidden layers containing $K = 2 5 6$ sigmoid units each. + +• Pool the last hidden layer encodings of each input-output example together by simple arithmetic averaging. + +Fig. 7 shows a schematic drawing of this encoder architecture, together with the decoder that performs independent binary classification for each function in the DSL, indicating whether or not it appears in the ground truth source code. + +![](images/1b4ae4043ae84d4ac119b02713a27cb85173d4a2d0a85116dc32199039ab2623.jpg) +Figure 7: Schematic representation of our feed-forward encoder, and the decoder. + +While DeepCoder learns to embed integers into a $E = 2 0$ dimensional space, we built the system up gradually, starting with a $E = 2$ dimensional space and only training on programs of length $T = 1$ . Such a small scale setting allowed easier investigation of the workings of the neural network, and indeed Fig. 8 below shows a learned embedding of integers in $\mathbb { R } ^ { 2 }$ . The figure demonstrates that the network has learnt the concepts of number magnitude, sign (positive or negative) and evenness, presumably due to FILTER $( > 0 )$ , FILTER $( < 0 )$ , FILTER ( $\scriptstyle { \frac { 0 } { 0 } } 2 = = 0$ ) and FILTER ( $\scriptstyle { \frac { 0 } { 0 } } 2 = = 1$ ) all being among the programs on which the network was trained. + +# D DEPTH-FIRST SEARCH + +We use an optimized $\mathrm { C } { + } { + }$ implementation of depth-first search (DFS) to search over programs with a given maximum length $T$ . In depth-first search, we start by choosing the first function (and its arguments) of a potential solution program, and then recursively consider all ways of filling in the rest of the program (up to length $T$ ), before moving on to a next choice of first instruction (if a solution has not yet been found). + +A program is considered a solution if it is consistent with all $M = 5$ provided input-output examples. Note that this requires evaluating all candidate programs on the $M$ inputs and checking the results for equality with the provided $M$ respective outputs. Our implementation of DFS exploits the sequential structure of programs in our DSL by caching the results of evaluating all prefixes of the currently considered program on the example inputs, thus allowing efficient reuse of computation between candidate programs with common prefixes. + +This allows us to explore the search space at roughly the speed of $\sim 3 \times 1 0 ^ { 6 }$ programs per second. + +![](images/94148f752106bd924a4f80c9c825128a3efe588caf08184e8765377bb5e169db.jpg) +Figure 8: A learned embedding of integers $\{ - 2 5 6 , - 2 5 5 , \ldots , - 1 , 0 , 1 , \ldots , 2 5 5 \}$ in $\mathbb { R } ^ { 2 }$ . The color intensity corresponds to the magnitude of the embedded integer. + +When the search procedure extends a partial program by a new function, it has to try the functions in the DSL in some order. At this point DFS can opt to consider the functions as ordered by their predicted probabilities from the neural network. The probability of a function consisting of a higherorder function and a lambda is taken to be the minimum of the probabilities of the two constituent functions. + +# E TRAINING LOSS FUNCTION + +In Sect. 4.5 we outlined a justification for using marginal probabilities of individual functions as a sensible intermediate representation to provide a solver employing a Sort and add scheme (we considered Enumerative search and the Sketch solver with this scheme). Here we provide a more detailed discussion. + +Predicting program components from input-output examples can be cast as a multilabel classification problem, where each instance (set of input-output examples) is associated with a set of relevant labels (functions appearing in the code that generated the examples). We denote the number of labels (functions) by $C$ , and note that throughout this work $C = 3 4$ . + +When the task is to predict a subset of labels $\mathbf { y } \in \{ 0 , 1 \} ^ { C }$ , different loss functions can be employed to measure the prediction error of a classifier $\mathbf { h } ( \mathbf { x } )$ or ranking function $\mathbf { f } \left( \mathbf { x } \right)$ . Dembczynski et al. (2010) discuss the following three loss functions: + +• Hamming loss counts the number of labels that are predicted incorrectly by a classifier h: + +$$ +L _ { H } ( \mathbf { y } , \mathbf { h } ( \mathbf { x } ) ) = \sum _ { c = 1 } ^ { C } \mathbb { 1 } _ { \{ y _ { c } \neq h _ { c } ( \mathbf { x } ) \} } +$$ + +• Rank loss counts the number of label pairs violating the condition that relevant labels are ranked higher than irrelevant ones by a scoring function f: + +$$ +L _ { r } ( \mathbf { y } , \mathbf { f } ( \mathbf { x } ) ) = \sum _ { ( i , j ) : y _ { i } = 1 , y _ { j } = 0 } ^ { C } \mathbb { 1 } _ { \{ f _ { i } < f _ { j } \} } +$$ + +• Subset Zero-One loss indicates whether all labels have been correctly predicted by $\mathbf { h }$ : + +$$ +L _ { s } ( \mathbf { y } , \mathbf { h } ( \mathbf { x } ) ) = \mathbb { 1 } _ { \{ \mathbf { y } \neq \mathbf { h } ( \mathbf { x } ) \} } +$$ + +Dembczynski et al. (2010) proved that Bayes optimal decisions under the Hamming and Rank loss functions, i.e., decisions minimizing the expected loss under these loss functions, can be computed from marginal probabilities $p _ { c } ( y _ { c } | \mathbf { x } )$ . This suggests that: + +• Multilabel classification under these two loss functions may not benefit from considering dependencies between the labels. +• ”Instead of minimizing the Rank loss directly, one can simply use any approach for single label prediction that properly estimates the marginal probabilities.” (Dembczynski et al., ´ 2012) + +Training the neural network with the negative cross entropy loss function as the training objective is precisely a method for properly estimating the marginal probabilities of labels (functions appearing in source code). It is thus a sensible step in preparation for making predictions under a Rank loss. + +It remains to discuss the relationship between the Rank loss and the actual quantity we care about, which is the total runtime of a Sort and add search procedure. Recall the simplifying assumption that the runtime of searching for a program of length $T$ with $C$ functions made available to the search is proportional to $C ^ { T }$ , and consider a Sort and add search for a program of length $T$ , where the size of the active set is increased by 1 whenever the search fails. Starting with an active set of size 1, the total time until a solution is found can be upper bounded by + +$$ +1 ^ { T } + 2 ^ { T } + \cdot \cdot \cdot + C _ { A } ^ { T } \leq C _ { A } ^ { T + 1 } \leq C C _ { A } ^ { T } +$$ + +where $C _ { A }$ is the size of the active set when the search finally succeeds (i.e., when the active set finally contains all necessary functions for a solution to exist). Hence the total runtime of a Sort and add search can be upper bounded by a quantity that is proportional to $C _ { A } ^ { T }$ . + +Now fix a valid program solution $P$ that requires $C _ { P }$ functions, and let $\mathbf { y } _ { P } \in \{ 0 , 1 \} ^ { C }$ be the indicator vector of functions used by $P$ . Let $D : = C _ { A } - C _ { P }$ be the number of redundant operations added into the active set until all operations from $P$ have been added. + +Example 1. Suppose the labels, as sorted by decreasing predicted marginal probabilities $\mathbf { f } \left( \mathbf { x } \right)$ , are as follows: + +$$ +\begin{array} { r l r l r } { 1 \mathrm { ~ 1 ~ 1 ~ 1 ~ } } & { { } } & { 1 } & \qquad 1 \mathrm ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 0 ~ 0 ~ 0 ~ 0 ~ 0 0 \end{array} +$$ + +Then the solution $P$ contains $C _ { P } = 6$ functions, but the active set needs to grow to size $C _ { A } = 1 1$ to include all of them, adding $D = 5$ redundant functions along the way. Note that the rank loss of the predictions $\mathbf { f } \left( \mathbf { x } \right)$ is $L _ { r } ( \mathbf { y } _ { P } , \mathbf { f } ( \mathbf { x } ) ) = 2 + 5 = 7$ , as it double counts the two redundant functions which are scored higher than two relevant labels. + +Noting that in general $L _ { r } ( \mathbf { y } _ { P } , \mathbf { f } ( \mathbf { x } ) ) \ge D$ , the previous upper bound on the runtime of Sort and add can be further upper bounded as follows: + +$$ +C _ { A } ^ { T } = ( C _ { P } + D ) ^ { T } \leq \mathrm { c o n s t } + \mathrm { c o n s t } \times D ^ { T } \leq \mathrm { c o n s t } + \mathrm { c o n s t } \times L _ { r } ( \mathbf { y } _ { P } , \mathbf { f } ( \mathbf { x } ) ) ^ { T } +$$ + +Hence we see that for a constant value of $T$ , this upper bound can be minimized by optimizing the Rank loss of the predictions $\mathbf { f } \left( \mathbf { x } \right)$ . Note also that $\bar { L _ { r } } ( { \bf y } _ { P } , { \bf f } ( { \bf x } ) ) = 0$ would imply $D = 0$ , in which case $C _ { A } = C _ { P }$ . + +# F DOMAIN SPECIFIC LANGUAGE OF DEEPCODER + +Here we provide a description of the semantics of our DSL from Sect. 4.1, both in English and as a Python implementation. Throughout, NULL is a special value that can be set e.g. to an integer outside the working integer range. + +First-order functions: + +• HEAD :: [int] -> int lambda xs: xs[0] if len $( \mathbf { \nabla } _ { \mathbf { X } } \mathbf { S } \mathbf { \nabla } ) > 0$ else Null Given an array, returns its first element (or NULL if the array is empty). +• LAST :: [int] $- >$ int lambda xs: xs[-1] if len $( \mathbf { \nabla } _ { \mathbf { X } } \mathbf { s } ) > 0$ else Null Given an array, returns its last element (or NULL if the array is empty). +• TAKE :: int $- >$ [int] -> int lambda n, xs: xs[:n] Given an integer n and array xs, returns the array truncated after the $\boldsymbol { \mathrm { n } }$ -th element. (If the length of xs was no larger than n in the first place, it is returned without modification.) +• DROP :: int $- >$ [int] $- >$ int lambda n, xs: xs[n:] Given an integer n and array $_ { \textrm { x S } }$ , returns the array with the first n elements dropped. (If the length of xs was no larger than n in the first place, an empty array is returned.) +• ACCESS :: int $- >$ [int] $- >$ int lambda n, xs: xs[n] if $\mathrm { n } > = 0$ and len $( \mathsf { x s } ) > \mathsf { n }$ else Null Given an integer n and array $_ { \textrm { x S } }$ , returns the $( \mathrm { n } { + } 1 )$ -st element of $_ { \textrm { x S } }$ . (If the length of xs was less than or equal to $\boldsymbol { \mathrm { n } }$ , the value NULL is returned instead.) +• MINIMUM :: [int] $- >$ int lambda xs: min(xs) if len $( \mathbf { \nabla } _ { \mathbf { X } } \mathbf { S } ) > 0$ else Null Given an array, returns its minimum (or NULL if the array is empty). +• MAXIMUM :: [int] $- >$ int lambda xs: max(xs) if len $( \mathbf { \nabla } _ { \mathbf { X } } \mathbf { S } ) > 0$ else Null Given an array, returns its maximum (or NULL if the array is empty). REVERSE :: [int] $- >$ [int] lambda xs: list(reversed(xs)) Given an array, returns its elements in reversed order. +• SORT :: [int] -> [int] lambda xs: sorted(xs) Given an array, return its elements in non-decreasing order. SUM :: [int] $- >$ int lambda xs: sum(xs) Given an array, returns the sum of its elements. (The sum of an empty array is 0.) + +Higher-order functions: + +• MAP :: (int -> int) -> [int] -> [int] lambda f, xs: [f(x) for x in xs] Given a lambda function f mapping from integers to integers, and an array xs, returns the array resulting from applying f to each element of xs. +• FILTER :: (int $- >$ bool) $- >$ [int] -> [int] lambda f, xs: [x for x in xs if f(x)] Given a predicate f mapping from integers to truth values, and an array xs, returns the elements of xs satisfying the predicate in their original order. +• COUNT :: (int $- >$ bool) $- >$ [int] $- >$ int lambda f, xs: len([x for x in xs if f(x)]) Given a predicate f mapping from integers to truth values, and an array xs, returns the number of elements in xs satisfying the predicate. +• ZIPWITH :: (int $- >$ int $- >$ int) $- >$ [int] -> [int] -> [int] lambda f, xs, ys: [f(x, y) for (x, y) in zip(xs, ys)] Given a lambda function f mapping integer pairs to integers, and two arrays xs and ys, returns the array resulting from applying f to corresponding elements of xs and ys. The length of the returned array is the minimum of the lengths of $_ { \textrm { x S } }$ and ys. SCANL1 :: (int $- >$ int $- >$ int) $- >$ [int] -> [int] Given a lambda function f mapping integer pairs to integers, and an array $_ { \textrm { x S } }$ , returns an array ys of the same length as xs and with its content defined by the recurrence $\begin{array} { r l } { \mathrm { y s } \left[ 0 \right] } & { { } = } \end{array}$ $\mathbf { x } \mathbf { s } \left[ 0 \right] , \mathbf { y } \mathbf { s } \left[ \mathrm { n } \right] \mathbf { \Psi } = \mathbf { \Psi } \mathbf { f } \left( \mathbf { y } \mathbf { s } \left[ \mathrm { n - 1 } \right] \right.$ , $\mathtt { x s } [ \mathtt { n } ]$ ) for $n \geq 1$ . + +The INT INT lambdas $\left( + 1 \right) , \left( - 1 \right) , \left( \star 2 \right) , \left( / 2 \right) , \left( \star \left( - 1 \right) \right) , \left( \star \star 2 \right) , \left( \star 3 \right) , \left( / 3 \right) , \left( \star 4 \right) , \left( / 4 \right) , \left( \star 3 \right) , \left( \star 4 \right) .$ ) provided by our DSL map integers to integers in a self-explanatory manner. The $\mathrm { I N T } { } \mathrm { B O O L }$ lambdas $( > 0 )$ , $( < 0 )$ , ( $\scriptstyle { \frac { 0 } { 0 } } 2 = = 0$ ), ( $\scriptstyle { \frac { 0 } { 0 } } 2 = = 1$ ) respectively test positivity, negativity, evenness and oddness of the input integer value. Finally, the $\mathrm { I N T } { } \mathrm { I N T } { } \mathrm { I N T }$ lambdas $( + ) , ( - ) , ( \star )$ , MIN, MAX apply a function to a pair of integers and produce a single integer. + +As an example, consider the function SCANL1 MAX, consisting of the higher-order function SCANL1 and the $\mathrm { I N T } { } \mathrm { I N T } { } \mathrm { I N T }$ lambda MAX. Given an integer array a of length $L$ , this function computes the running maximum of the array a. Specifically, it returns an array $\mathrm { b }$ of the same length $L$ whose $i$ -th element is the maximum of the first $i$ elements in $\exists$ . + +![](images/da5620eb6e4f0a76e4439147498cbeb617797fc9a1d092bb07c51b51e15fdcb8.jpg) +Figure 9: Conditional confusion matrix for the neural network and test set of $P = 5 0 0$ programs of length $T = 3$ that were used to obtain the results presented in Table 1. Each cell contains the average false positive probability (in larger font) and the number of test programs from which this average was computed (smaller font, in brackets). The color intensity of each cell’s shading coresponds to the magnitude of the average false positive probability. + +# G ANALYSIS OF TRAINED NEURAL NETWORKS + +We analyzed the performance of trained neural networks by investigating which program instructions tend to get confused by the networks. To this end, we looked at a generalization of confusion matrices to the multilabel classification setting: for each attribute in a ground truth program (rows) measure how likely each other attribute (columns) is predicted as a false positive. More formally, in this matrix the $( i , j )$ -entry is the average predicted probability of attribute $j$ among test programs that do possess attribute $i$ and do not possess attribute $j$ . Intuitively, the $i$ -th row of this matrix shows how the presence of attribute $i$ confuses the network into incorrectly predicting each other attribute $j$ . + +Figure 9 shows this conditional confusion matrix for the neural network and $P = 5 0 0$ program test set configuration used to obtain Table 1. We re-ordered the confusion matrix to try to expose block structure in the false positive probabilities, revealing groups of instructions that tend to be difficult to distinguish. Figure 10 show the conditional confusion matrix for the neural network used to obtain the table in Fig. 3a. While the results are somewhat noisy, we observe a few general tendencies: + +• There is increased confusion amongst instructions that select out a single element from an array: HEAD, LAST, ACCESS, MINIMUM, MAXIMUM. +• Some common attributes get predicted more often regardless of the ground truth program: FILTER, $( > 0 )$ ), $( < 0 )$ , ( $\scriptstyle { \frac { \circ } { \circ } } 2 = = 1$ ), ( $\scriptstyle { \frac { 0 } { \circ } } 2 = = 0$ ), MIN, MAX, (+), (-), ZIPWITH. +There are some groups of lambdas that are more difficult for the network to distinguish within: $( + )$ vs $( - ) ~ ; ~ ( + 1 )$ vs $( - 1 ) \ ; \ ( \ / 2 )$ vs (/3) vs (/4). +• When a program uses $( \star \star 2 )$ , the network often thinks it’s using $( \star )$ , presumably because both can lead to large values in the output. + +![](images/a2f6e1ddd3c6cc3aed7aca84775a0568e1abe730347297f96f96da4cfd262c8d.jpg) + +Figure 10: Conditional confusion matrix for the neural network and test set of $P = 5 0 0$ programs of length $T = 5$ . The presentation is the same as in Figure 9. \ No newline at end of file diff --git a/parse/train/ByldLrqlx/ByldLrqlx_middle.json b/parse/train/ByldLrqlx/ByldLrqlx_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..e00781e5fdb2eb7f037bb2dd12196471fb029b6e --- /dev/null +++ b/parse/train/ByldLrqlx/ByldLrqlx_middle.json @@ -0,0 +1,57126 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 78, + 458, + 96 + ], + "lines": [ + { + "bbox": [ + 105, + 77, + 460, + 99 + ], + "spans": [ + { + "bbox": [ + 105, + 77, + 460, + 99 + ], + "score": 1.0, + "content": "DEEPCODER: LEARNING TO WRITE PROGRAMS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 113, + 115, + 223, + 149 + ], + "lines": [ + { + "bbox": [ + 111, + 114, + 171, + 129 + ], + "spans": [ + { + "bbox": [ + 111, + 114, + 171, + 129 + ], + "score": 1.0, + "content": "Matej Balog∗", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 111, + 125, + 225, + 140 + ], + "spans": [ + { + "bbox": [ + 111, + 125, + 225, + 140 + ], + "score": 1.0, + "content": "Department of Engineering", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 111, + 135, + 214, + 151 + ], + "spans": [ + { + "bbox": [ + 111, + 135, + 214, + 151 + ], + "score": 1.0, + "content": "University of Cambridge", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 276, + 115, + 456, + 148 + ], + "lines": [ + { + "bbox": [ + 275, + 114, + 457, + 127 + ], + "spans": [ + { + "bbox": [ + 275, + 114, + 457, + 127 + ], + "score": 1.0, + "content": "Alexander L. Gaunt, Marc Brockschmidt,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 275, + 125, + 424, + 139 + ], + "spans": [ + { + "bbox": [ + 275, + 125, + 424, + 139 + ], + "score": 1.0, + "content": "Sebastian Nowozin, Daniel Tarlow", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 276, + 138, + 357, + 148 + ], + "spans": [ + { + "bbox": [ + 276, + 138, + 357, + 148 + ], + "score": 1.0, + "content": "Microsoft Research", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4 + }, + { + "type": "title", + "bbox": [ + 278, + 178, + 333, + 190 + ], + "lines": [ + { + "bbox": [ + 276, + 177, + 335, + 191 + ], + "spans": [ + { + "bbox": [ + 276, + 177, + 335, + 191 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 143, + 202, + 469, + 302 + ], + "lines": [ + { + "bbox": [ + 142, + 202, + 470, + 215 + ], + "spans": [ + { + "bbox": [ + 142, + 202, + 470, + 215 + ], + "score": 1.0, + "content": "We develop a first line of attack for solving programming competition-style prob-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 213, + 470, + 226 + ], + "spans": [ + { + "bbox": [ + 141, + 213, + 470, + 226 + ], + "score": 1.0, + "content": "lems from input-output examples using deep learning. The approach is to train a", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 224, + 469, + 236 + ], + "spans": [ + { + "bbox": [ + 141, + 224, + 469, + 236 + ], + "score": 1.0, + "content": "neural network to predict properties of the program that generated the outputs from", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 234, + 470, + 248 + ], + "spans": [ + { + "bbox": [ + 141, + 234, + 470, + 248 + ], + "score": 1.0, + "content": "the inputs. We use the neural network’s predictions to augment search techniques", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 245, + 470, + 259 + ], + "spans": [ + { + "bbox": [ + 141, + 245, + 470, + 259 + ], + "score": 1.0, + "content": "from the programming languages community, including enumerative search and", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 257, + 470, + 270 + ], + "spans": [ + { + "bbox": [ + 141, + 257, + 470, + 270 + ], + "score": 1.0, + "content": "an SMT-based solver. Empirically, we show that our approach leads to an order", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 142, + 268, + 469, + 280 + ], + "spans": [ + { + "bbox": [ + 142, + 268, + 469, + 280 + ], + "score": 1.0, + "content": "of magnitude speedup over the strong non-augmented baselines and a Recurrent", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 278, + 469, + 292 + ], + "spans": [ + { + "bbox": [ + 141, + 278, + 469, + 292 + ], + "score": 1.0, + "content": "Neural Network approach, and that we are able to solve problems of difficulty", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 290, + 450, + 303 + ], + "spans": [ + { + "bbox": [ + 141, + 290, + 450, + 303 + ], + "score": 1.0, + "content": "comparable to the simplest problems on programming competition websites.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 12 + }, + { + "type": "title", + "bbox": [ + 108, + 321, + 206, + 334 + ], + "lines": [ + { + "bbox": [ + 105, + 320, + 208, + 337 + ], + "spans": [ + { + "bbox": [ + 105, + 320, + 208, + 337 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 346, + 505, + 478 + ], + "lines": [ + { + "bbox": [ + 105, + 346, + 506, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 506, + 359 + ], + "score": 1.0, + "content": "A dream of artificial intelligence is to build systems that can write computer programs. Recently,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 106, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "there has been much interest in program-like neural network models (Graves et al., 2014; Weston", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 369, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 505, + 381 + ], + "score": 1.0, + "content": "et al., 2015; Kurach et al., 2015; Joulin & Mikolov, 2015; Grefenstette et al., 2015; Sukhbaatar", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 379, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 505, + 392 + ], + "score": 1.0, + "content": "et al., 2015; Neelakantan et al., 2016; Kaiser & Sutskever, 2016; Reed & de Freitas, 2016; Zaremba", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "score": 1.0, + "content": "et al., 2016; Graves et al., 2016), but none of these can write programs; that is, they do not generate", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 401, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 505, + 414 + ], + "score": 1.0, + "content": "human-readable source code. Only very recently, Riedel et al. (2016); Bunel et al. (2016); Gaunt", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "score": 1.0, + "content": "et al. (2016) explored the use of gradient descent to induce source code from input-output examples", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 424, + 505, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 505, + 436 + ], + "score": 1.0, + "content": "via differentiable interpreters, and Ling et al. (2016) explored the generation of source code from", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 434, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 106, + 434, + 506, + 447 + ], + "score": 1.0, + "content": "unstructured text descriptions. However, Gaunt et al. (2016) showed that differentiable interpreter-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 444, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 505, + 459 + ], + "score": 1.0, + "content": "based program induction is inferior to discrete search-based techniques used by the programming", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 456, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 505, + 469 + ], + "score": 1.0, + "content": "languages community. We are then left with the question of how to make progress on program", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 467, + 289, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 467, + 289, + 479 + ], + "score": 1.0, + "content": "induction using machine learning techniques.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 107, + 484, + 505, + 517 + ], + "lines": [ + { + "bbox": [ + 105, + 483, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 497 + ], + "score": 1.0, + "content": "In this work, we propose two main ideas: (1) learn to induce programs; that is, use a corpus of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 495, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 505, + 508 + ], + "score": 1.0, + "content": "program induction problems to learn strategies that generalize across problems, and (2) integrate", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 506, + 443, + 518 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 443, + 518 + ], + "score": 1.0, + "content": "neural network architectures with search-based techniques rather than replace them.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 523, + 505, + 589 + ], + "lines": [ + { + "bbox": [ + 105, + 522, + 507, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 507, + 535 + ], + "score": 1.0, + "content": "In more detail, we can contrast our approach to existing work on differentiable interpreters. In dif-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 533, + 506, + 547 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 506, + 547 + ], + "score": 1.0, + "content": "ferentiable interpreters, the idea is to define a differentiable mapping from source code and inputs", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 545, + 507, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 507, + 558 + ], + "score": 1.0, + "content": "to outputs. After observing inputs and outputs, gradient descent can be used to search for a pro-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 556, + 506, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 506, + 568 + ], + "score": 1.0, + "content": "gram that matches the input-output examples. This approach leverages gradient-based optimization,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 567, + 506, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 506, + 579 + ], + "score": 1.0, + "content": "which has proven powerful for training neural networks, but each synthesis problem is still solved", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 578, + 469, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 469, + 590 + ], + "score": 1.0, + "content": "independently—solving many synthesis problems does not help to solve the next problem.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 35.5 + }, + { + "type": "text", + "bbox": [ + 107, + 594, + 505, + 705 + ], + "lines": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "score": 1.0, + "content": "We argue that machine learning can provide significant value towards solving Inductive Program", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "Synthesis (IPS) by re-casting the problem as a big data problem. We show that training a neural", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 617, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 505, + 628 + ], + "score": 1.0, + "content": "network on a large number of generated IPS problems to predict cues from the problem description", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 627, + 505, + 641 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 641 + ], + "score": 1.0, + "content": "can help a search-based technique. In this work, we focus on predicting an order on the program", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 639, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 505, + 651 + ], + "score": 1.0, + "content": "space and show how to use it to guide search-based techniques that are common in the programming", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 650, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 506, + 662 + ], + "score": 1.0, + "content": "languages community. This approach has three desirable properties: first, we transform a difficult", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 660, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 506, + 673 + ], + "score": 1.0, + "content": "search problem into a supervised learning problem; second, we soften the effect of failures of the", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 671, + 506, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 506, + 684 + ], + "score": 1.0, + "content": "neural network by searching over program space rather than relying on a single prediction; and third,", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 682, + 506, + 696 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 506, + 696 + ], + "score": 1.0, + "content": "the neural network’s predictions are used to guide existing program synthesis systems, allowing us to", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 693, + 505, + 707 + ], + "spans": [ + { + "bbox": [ + 105, + 693, + 505, + 707 + ], + "score": 1.0, + "content": "use and improve on the best solvers from the programming languages community. Empirically, we", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 43.5 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 712, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 118, + 710, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 118, + 710, + 505, + 723 + ], + "score": 1.0, + "content": "∗Also affiliated with Max-Planck Institute for Intelligent Systems, Tubingen, Germany. Work done while ¨", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 721, + 265, + 731 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 265, + 731 + ], + "score": 1.0, + "content": "author was an intern at Microsoft Research.", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "1", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 78, + 458, + 96 + ], + "lines": [ + { + "bbox": [ + 105, + 77, + 460, + 99 + ], + "spans": [ + { + "bbox": [ + 105, + 77, + 460, + 99 + ], + "score": 1.0, + "content": "DEEPCODER: LEARNING TO WRITE PROGRAMS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 113, + 115, + 223, + 149 + ], + "lines": [ + { + "bbox": [ + 111, + 114, + 171, + 129 + ], + "spans": [ + { + "bbox": [ + 111, + 114, + 171, + 129 + ], + "score": 1.0, + "content": "Matej Balog∗", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 111, + 125, + 225, + 140 + ], + "spans": [ + { + "bbox": [ + 111, + 125, + 225, + 140 + ], + "score": 1.0, + "content": "Department of Engineering", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 111, + 135, + 214, + 151 + ], + "spans": [ + { + "bbox": [ + 111, + 135, + 214, + 151 + ], + "score": 1.0, + "content": "University of Cambridge", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3, + "bbox_fs": [ + 111, + 114, + 225, + 151 + ] + }, + { + "type": "text", + "bbox": [ + 276, + 115, + 456, + 148 + ], + "lines": [ + { + "bbox": [ + 275, + 114, + 457, + 127 + ], + "spans": [ + { + "bbox": [ + 275, + 114, + 457, + 127 + ], + "score": 1.0, + "content": "Alexander L. Gaunt, Marc Brockschmidt,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 275, + 125, + 424, + 139 + ], + "spans": [ + { + "bbox": [ + 275, + 125, + 424, + 139 + ], + "score": 1.0, + "content": "Sebastian Nowozin, Daniel Tarlow", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 276, + 138, + 357, + 148 + ], + "spans": [ + { + "bbox": [ + 276, + 138, + 357, + 148 + ], + "score": 1.0, + "content": "Microsoft Research", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4, + "bbox_fs": [ + 275, + 114, + 457, + 148 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 178, + 333, + 190 + ], + "lines": [ + { + "bbox": [ + 276, + 177, + 335, + 191 + ], + "spans": [ + { + "bbox": [ + 276, + 177, + 335, + 191 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 143, + 202, + 469, + 302 + ], + "lines": [ + { + "bbox": [ + 142, + 202, + 470, + 215 + ], + "spans": [ + { + "bbox": [ + 142, + 202, + 470, + 215 + ], + "score": 1.0, + "content": "We develop a first line of attack for solving programming competition-style prob-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 213, + 470, + 226 + ], + "spans": [ + { + "bbox": [ + 141, + 213, + 470, + 226 + ], + "score": 1.0, + "content": "lems from input-output examples using deep learning. The approach is to train a", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 224, + 469, + 236 + ], + "spans": [ + { + "bbox": [ + 141, + 224, + 469, + 236 + ], + "score": 1.0, + "content": "neural network to predict properties of the program that generated the outputs from", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 234, + 470, + 248 + ], + "spans": [ + { + "bbox": [ + 141, + 234, + 470, + 248 + ], + "score": 1.0, + "content": "the inputs. We use the neural network’s predictions to augment search techniques", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 245, + 470, + 259 + ], + "spans": [ + { + "bbox": [ + 141, + 245, + 470, + 259 + ], + "score": 1.0, + "content": "from the programming languages community, including enumerative search and", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 257, + 470, + 270 + ], + "spans": [ + { + "bbox": [ + 141, + 257, + 470, + 270 + ], + "score": 1.0, + "content": "an SMT-based solver. Empirically, we show that our approach leads to an order", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 142, + 268, + 469, + 280 + ], + "spans": [ + { + "bbox": [ + 142, + 268, + 469, + 280 + ], + "score": 1.0, + "content": "of magnitude speedup over the strong non-augmented baselines and a Recurrent", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 278, + 469, + 292 + ], + "spans": [ + { + "bbox": [ + 141, + 278, + 469, + 292 + ], + "score": 1.0, + "content": "Neural Network approach, and that we are able to solve problems of difficulty", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 290, + 450, + 303 + ], + "spans": [ + { + "bbox": [ + 141, + 290, + 450, + 303 + ], + "score": 1.0, + "content": "comparable to the simplest problems on programming competition websites.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 12, + "bbox_fs": [ + 141, + 202, + 470, + 303 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 321, + 206, + 334 + ], + "lines": [ + { + "bbox": [ + 105, + 320, + 208, + 337 + ], + "spans": [ + { + "bbox": [ + 105, + 320, + 208, + 337 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 346, + 505, + 478 + ], + "lines": [ + { + "bbox": [ + 105, + 346, + 506, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 506, + 359 + ], + "score": 1.0, + "content": "A dream of artificial intelligence is to build systems that can write computer programs. Recently,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 106, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "there has been much interest in program-like neural network models (Graves et al., 2014; Weston", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 369, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 505, + 381 + ], + "score": 1.0, + "content": "et al., 2015; Kurach et al., 2015; Joulin & Mikolov, 2015; Grefenstette et al., 2015; Sukhbaatar", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 379, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 505, + 392 + ], + "score": 1.0, + "content": "et al., 2015; Neelakantan et al., 2016; Kaiser & Sutskever, 2016; Reed & de Freitas, 2016; Zaremba", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "score": 1.0, + "content": "et al., 2016; Graves et al., 2016), but none of these can write programs; that is, they do not generate", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 401, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 505, + 414 + ], + "score": 1.0, + "content": "human-readable source code. Only very recently, Riedel et al. (2016); Bunel et al. (2016); Gaunt", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "score": 1.0, + "content": "et al. (2016) explored the use of gradient descent to induce source code from input-output examples", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 424, + 505, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 505, + 436 + ], + "score": 1.0, + "content": "via differentiable interpreters, and Ling et al. (2016) explored the generation of source code from", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 434, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 106, + 434, + 506, + 447 + ], + "score": 1.0, + "content": "unstructured text descriptions. However, Gaunt et al. (2016) showed that differentiable interpreter-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 444, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 505, + 459 + ], + "score": 1.0, + "content": "based program induction is inferior to discrete search-based techniques used by the programming", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 456, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 505, + 469 + ], + "score": 1.0, + "content": "languages community. We are then left with the question of how to make progress on program", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 467, + 289, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 467, + 289, + 479 + ], + "score": 1.0, + "content": "induction using machine learning techniques.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 346, + 506, + 479 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 484, + 505, + 517 + ], + "lines": [ + { + "bbox": [ + 105, + 483, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 497 + ], + "score": 1.0, + "content": "In this work, we propose two main ideas: (1) learn to induce programs; that is, use a corpus of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 495, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 505, + 508 + ], + "score": 1.0, + "content": "program induction problems to learn strategies that generalize across problems, and (2) integrate", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 506, + 443, + 518 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 443, + 518 + ], + "score": 1.0, + "content": "neural network architectures with search-based techniques rather than replace them.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 483, + 505, + 518 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 523, + 505, + 589 + ], + "lines": [ + { + "bbox": [ + 105, + 522, + 507, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 507, + 535 + ], + "score": 1.0, + "content": "In more detail, we can contrast our approach to existing work on differentiable interpreters. In dif-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 533, + 506, + 547 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 506, + 547 + ], + "score": 1.0, + "content": "ferentiable interpreters, the idea is to define a differentiable mapping from source code and inputs", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 545, + 507, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 507, + 558 + ], + "score": 1.0, + "content": "to outputs. After observing inputs and outputs, gradient descent can be used to search for a pro-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 556, + 506, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 506, + 568 + ], + "score": 1.0, + "content": "gram that matches the input-output examples. This approach leverages gradient-based optimization,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 567, + 506, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 506, + 579 + ], + "score": 1.0, + "content": "which has proven powerful for training neural networks, but each synthesis problem is still solved", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 578, + 469, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 469, + 590 + ], + "score": 1.0, + "content": "independently—solving many synthesis problems does not help to solve the next problem.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 522, + 507, + 590 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 594, + 505, + 705 + ], + "lines": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "score": 1.0, + "content": "We argue that machine learning can provide significant value towards solving Inductive Program", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "Synthesis (IPS) by re-casting the problem as a big data problem. We show that training a neural", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 617, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 505, + 628 + ], + "score": 1.0, + "content": "network on a large number of generated IPS problems to predict cues from the problem description", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 627, + 505, + 641 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 641 + ], + "score": 1.0, + "content": "can help a search-based technique. In this work, we focus on predicting an order on the program", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 639, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 505, + 651 + ], + "score": 1.0, + "content": "space and show how to use it to guide search-based techniques that are common in the programming", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 650, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 506, + 662 + ], + "score": 1.0, + "content": "languages community. This approach has three desirable properties: first, we transform a difficult", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 660, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 506, + 673 + ], + "score": 1.0, + "content": "search problem into a supervised learning problem; second, we soften the effect of failures of the", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 671, + 506, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 506, + 684 + ], + "score": 1.0, + "content": "neural network by searching over program space rather than relying on a single prediction; and third,", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 682, + 506, + 696 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 506, + 696 + ], + "score": 1.0, + "content": "the neural network’s predictions are used to guide existing program synthesis systems, allowing us to", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 693, + 505, + 707 + ], + "spans": [ + { + "bbox": [ + 105, + 693, + 505, + 707 + ], + "score": 1.0, + "content": "use and improve on the best solvers from the programming languages community. Empirically, we", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "score": 1.0, + "content": "show orders-of-magnitude improvements over optimized standard search techniques and a Recurrent", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 301, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 301, + 106 + ], + "score": 1.0, + "content": "Neural Network-based approach to the problem.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 43.5, + "bbox_fs": [ + 105, + 595, + 506, + 707 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "score": 1.0, + "content": "show orders-of-magnitude improvements over optimized standard search techniques and a Recurrent", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 301, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 301, + 106 + ], + "score": 1.0, + "content": "Neural Network-based approach to the problem.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 110, + 505, + 133 + ], + "lines": [ + { + "bbox": [ + 105, + 110, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 505, + 123 + ], + "score": 1.0, + "content": "In summary, we define and instantiate a framework for using deep learning for program synthesis", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 121, + 506, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 506, + 134 + ], + "score": 1.0, + "content": "problems like ones appearing on programming competition websites. Our concrete contributions are:", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 130, + 141, + 505, + 215 + ], + "lines": [ + { + "bbox": [ + 129, + 141, + 506, + 155 + ], + "spans": [ + { + "bbox": [ + 129, + 141, + 506, + 155 + ], + "score": 1.0, + "content": "1. defining a programming language that is expressive enough to include real-world program-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 141, + 153, + 506, + 165 + ], + "spans": [ + { + "bbox": [ + 141, + 153, + 506, + 165 + ], + "score": 1.0, + "content": "ming problems while being high-level enough to be predictable from input-output examples;", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 127, + 165, + 454, + 181 + ], + "spans": [ + { + "bbox": [ + 127, + 165, + 454, + 181 + ], + "score": 1.0, + "content": "2. models for mapping sets of input-output examples to program properties; and", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 128, + 181, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 128, + 181, + 505, + 194 + ], + "score": 1.0, + "content": "3. experiments that show an order of magnitude speedup over standard program synthesis", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 193, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 141, + 193, + 505, + 205 + ], + "score": 1.0, + "content": "techniques, which makes this approach feasible for solving problems of similar difficulty as", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 204, + 437, + 216 + ], + "spans": [ + { + "bbox": [ + 141, + 204, + 437, + 216 + ], + "score": 1.0, + "content": "the simplest problems that appear on programming competition websites.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6.5 + }, + { + "type": "title", + "bbox": [ + 107, + 231, + 396, + 244 + ], + "lines": [ + { + "bbox": [ + 105, + 230, + 397, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 230, + 397, + 245 + ], + "score": 1.0, + "content": "2 BACKGROUND ON INDUCTIVE PROGRAM SYNTHESIS", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 109, + 255, + 504, + 278 + ], + "lines": [ + { + "bbox": [ + 107, + 255, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 107, + 255, + 505, + 268 + ], + "score": 1.0, + "content": "We begin by providing background on Inductive Program Synthesis, including a brief overview of", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 266, + 445, + 280 + ], + "spans": [ + { + "bbox": [ + 106, + 266, + 445, + 280 + ], + "score": 1.0, + "content": "how it is typically formulated and solved in the programming languages community.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 108, + 283, + 503, + 306 + ], + "lines": [ + { + "bbox": [ + 106, + 282, + 504, + 297 + ], + "spans": [ + { + "bbox": [ + 106, + 282, + 504, + 297 + ], + "score": 1.0, + "content": "The Inductive Program Synthesis (IPS) problem is the following: given input-output examples,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 293, + 375, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 293, + 375, + 307 + ], + "score": 1.0, + "content": "produce a program that has behavior consistent with the examples.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 107, + 311, + 505, + 378 + ], + "lines": [ + { + "bbox": [ + 105, + 311, + 506, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 506, + 324 + ], + "score": 1.0, + "content": "Building an IPS system requires solving two problems. First, the search problem: to find consistent", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 322, + 506, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 506, + 334 + ], + "score": 1.0, + "content": "programs we need to search over a suitable set of possible programs. We need to define the set", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 334, + 504, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 504, + 345 + ], + "score": 1.0, + "content": "(i.e., the program space) and search procedure. Second, the ranking problem: if there are multiple", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 344, + 506, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 506, + 357 + ], + "score": 1.0, + "content": "programs consistent with the input-output examples, which one do we return? Both of these problems", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 355, + 505, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 355, + 505, + 367 + ], + "score": 1.0, + "content": "are dependent on the specifics of the problem formulation. Thus, the first important decision in", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 365, + 475, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 475, + 380 + ], + "score": 1.0, + "content": "formulating an approach to program synthesis is the choice of a Domain Specific Language.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 107, + 389, + 506, + 521 + ], + "lines": [ + { + "bbox": [ + 105, + 388, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 506, + 403 + ], + "score": 1.0, + "content": "Domain Specific Languages (DSLs). DSLs are programming languages that are suitable for a", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 400, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 106, + 400, + 506, + 414 + ], + "score": 1.0, + "content": "specialized domain but are more restrictive than full-featured programming languages. For example,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 411, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 505, + 424 + ], + "score": 1.0, + "content": "one might disallow loops or other control flow, and only allow string data types and a small number of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 421, + 506, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 506, + 436 + ], + "score": 1.0, + "content": "primitive operations like concatenation. Most of program synthesis research focuses on synthesizing", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 433, + 506, + 446 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 326, + 446 + ], + "score": 1.0, + "content": "programs in DSLs, because full-featured languages like", + "type": "text" + }, + { + "bbox": [ + 326, + 434, + 346, + 444 + ], + "score": 0.86, + "content": "\\mathrm { C } { + + }", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 433, + 506, + 446 + ], + "score": 1.0, + "content": "enlarge the search space and complicate", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 444, + 506, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 506, + 457 + ], + "score": 1.0, + "content": "synthesis. Restricted DSLs can also enable more efficient special-purpose search algorithms. For", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 456, + 506, + 468 + ], + "spans": [ + { + "bbox": [ + 106, + 456, + 506, + 468 + ], + "score": 1.0, + "content": "example, if a DSL only allows concatenations of substrings of an input string, a dynamic program-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 466, + 506, + 478 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 506, + 478 + ], + "score": 1.0, + "content": "ming algorithm can efficiently search over all possible programs (Polozov & Gulwani, 2015). The", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 477, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 505, + 489 + ], + "score": 1.0, + "content": "choice of DSL also affects the difficulty of the ranking problem. For example, in a DSL without if", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 488, + 506, + 501 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 506, + 501 + ], + "score": 1.0, + "content": "statements, the same algorithm is applied to all inputs, reducing the number of programs consistent", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 500, + 505, + 512 + ], + "spans": [ + { + "bbox": [ + 106, + 500, + 505, + 512 + ], + "score": 1.0, + "content": "with any set of input-output examples, and thus the ranking problem becomes easier. Of course, the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 511, + 482, + 522 + ], + "spans": [ + { + "bbox": [ + 106, + 511, + 482, + 522 + ], + "score": 1.0, + "content": "restrictiveness of the chosen DSL also determines which problems the system can solve at all.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 107, + 533, + 505, + 588 + ], + "lines": [ + { + "bbox": [ + 105, + 532, + 506, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 506, + 546 + ], + "score": 1.0, + "content": "Search Techniques. There are many techniques for searching for programs consistent with input-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 544, + 506, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 506, + 558 + ], + "score": 1.0, + "content": "output examples. Perhaps the simplest approach is to define a grammar and then enumerate all", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 555, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 568 + ], + "score": 1.0, + "content": "derivations of the grammar, checking each one for consistency with the examples. This approach", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "score": 1.0, + "content": "can be combined with pruning based on types and other logical reasoning (Feser et al., 2015). While", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 577, + 489, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 489, + 591 + ], + "score": 1.0, + "content": "simple, these approaches can be implemented efficiently, and they can be surprisingly effective.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 107, + 594, + 505, + 649 + ], + "lines": [ + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "In restricted domains such as the concatenation example discussed above, special-purpose algorithms", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 605, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 505, + 617 + ], + "score": 1.0, + "content": "can be used. FlashMeta (Polozov & Gulwani, 2015) describes a framework for DSLs which allow", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "score": 1.0, + "content": "decomposition of the search problem, e.g., where the production of an output string from an input", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 626, + 506, + 641 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 641 + ], + "score": 1.0, + "content": "string can be reduced to finding a program for producing the first part of the output and concatenating", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 637, + 371, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 371, + 651 + ], + "score": 1.0, + "content": "it with a program for producing the latter part of the output string.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 107, + 654, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "Another class of systems is based on Satisfiability Modulo Theories (SMT) solving. SMT combines", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "SAT-style search with theories like arithmetic and inequalities, with the benefit that theory-dependent", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "subproblems can be handled by special-purpose solvers. For example, a special-purpose solver can", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 687, + 506, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 184, + 702 + ], + "score": 1.0, + "content": "easily find integers", + "type": "text" + }, + { + "bbox": [ + 184, + 690, + 202, + 699 + ], + "score": 0.26, + "content": "x , y", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 687, + 241, + 702 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 241, + 689, + 267, + 699 + ], + "score": 0.91, + "content": "x < y", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 687, + 285, + 702 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 285, + 688, + 328, + 699 + ], + "score": 0.9, + "content": "y < - 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 687, + 506, + 702 + ], + "score": 1.0, + "content": "hold, whereas an enumeration strategy may", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "need to consider many values before satisfying the constraints. Many program synthesis engines", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 709, + 507, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 507, + 723 + ], + "score": 1.0, + "content": "based on SMT solvers exist, e.g., Sketch (Solar-Lezama, 2008) and Brahma (Gulwani et al., 2011).", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "They convert the semantics of a DSL into a set of constraints between variables representing the", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 46 + } + ], + "page_idx": 1, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "score": 1.0, + "content": "2", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 506, + 106 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 110, + 505, + 133 + ], + "lines": [ + { + "bbox": [ + 105, + 110, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 505, + 123 + ], + "score": 1.0, + "content": "In summary, we define and instantiate a framework for using deep learning for program synthesis", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 121, + 506, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 506, + 134 + ], + "score": 1.0, + "content": "problems like ones appearing on programming competition websites. Our concrete contributions are:", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 110, + 506, + 134 + ] + }, + { + "type": "text", + "bbox": [ + 130, + 141, + 505, + 215 + ], + "lines": [ + { + "bbox": [ + 129, + 141, + 506, + 155 + ], + "spans": [ + { + "bbox": [ + 129, + 141, + 506, + 155 + ], + "score": 1.0, + "content": "1. defining a programming language that is expressive enough to include real-world program-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 141, + 153, + 506, + 165 + ], + "spans": [ + { + "bbox": [ + 141, + 153, + 506, + 165 + ], + "score": 1.0, + "content": "ming problems while being high-level enough to be predictable from input-output examples;", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 127, + 165, + 454, + 181 + ], + "spans": [ + { + "bbox": [ + 127, + 165, + 454, + 181 + ], + "score": 1.0, + "content": "2. models for mapping sets of input-output examples to program properties; and", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 128, + 181, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 128, + 181, + 505, + 194 + ], + "score": 1.0, + "content": "3. experiments that show an order of magnitude speedup over standard program synthesis", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 193, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 141, + 193, + 505, + 205 + ], + "score": 1.0, + "content": "techniques, which makes this approach feasible for solving problems of similar difficulty as", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 204, + 437, + 216 + ], + "spans": [ + { + "bbox": [ + 141, + 204, + 437, + 216 + ], + "score": 1.0, + "content": "the simplest problems that appear on programming competition websites.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6.5, + "bbox_fs": [ + 127, + 141, + 506, + 216 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 231, + 396, + 244 + ], + "lines": [ + { + "bbox": [ + 105, + 230, + 397, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 230, + 397, + 245 + ], + "score": 1.0, + "content": "2 BACKGROUND ON INDUCTIVE PROGRAM SYNTHESIS", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 109, + 255, + 504, + 278 + ], + "lines": [ + { + "bbox": [ + 107, + 255, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 107, + 255, + 505, + 268 + ], + "score": 1.0, + "content": "We begin by providing background on Inductive Program Synthesis, including a brief overview of", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 266, + 445, + 280 + ], + "spans": [ + { + "bbox": [ + 106, + 266, + 445, + 280 + ], + "score": 1.0, + "content": "how it is typically formulated and solved in the programming languages community.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 106, + 255, + 505, + 280 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 283, + 503, + 306 + ], + "lines": [ + { + "bbox": [ + 106, + 282, + 504, + 297 + ], + "spans": [ + { + "bbox": [ + 106, + 282, + 504, + 297 + ], + "score": 1.0, + "content": "The Inductive Program Synthesis (IPS) problem is the following: given input-output examples,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 293, + 375, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 293, + 375, + 307 + ], + "score": 1.0, + "content": "produce a program that has behavior consistent with the examples.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 282, + 504, + 307 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 311, + 505, + 378 + ], + "lines": [ + { + "bbox": [ + 105, + 311, + 506, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 506, + 324 + ], + "score": 1.0, + "content": "Building an IPS system requires solving two problems. First, the search problem: to find consistent", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 322, + 506, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 506, + 334 + ], + "score": 1.0, + "content": "programs we need to search over a suitable set of possible programs. We need to define the set", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 334, + 504, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 504, + 345 + ], + "score": 1.0, + "content": "(i.e., the program space) and search procedure. Second, the ranking problem: if there are multiple", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 344, + 506, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 506, + 357 + ], + "score": 1.0, + "content": "programs consistent with the input-output examples, which one do we return? Both of these problems", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 355, + 505, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 355, + 505, + 367 + ], + "score": 1.0, + "content": "are dependent on the specifics of the problem formulation. Thus, the first important decision in", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 365, + 475, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 475, + 380 + ], + "score": 1.0, + "content": "formulating an approach to program synthesis is the choice of a Domain Specific Language.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 311, + 506, + 380 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 389, + 506, + 521 + ], + "lines": [ + { + "bbox": [ + 105, + 388, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 506, + 403 + ], + "score": 1.0, + "content": "Domain Specific Languages (DSLs). DSLs are programming languages that are suitable for a", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 400, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 106, + 400, + 506, + 414 + ], + "score": 1.0, + "content": "specialized domain but are more restrictive than full-featured programming languages. For example,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 411, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 505, + 424 + ], + "score": 1.0, + "content": "one might disallow loops or other control flow, and only allow string data types and a small number of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 421, + 506, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 506, + 436 + ], + "score": 1.0, + "content": "primitive operations like concatenation. Most of program synthesis research focuses on synthesizing", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 433, + 506, + 446 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 326, + 446 + ], + "score": 1.0, + "content": "programs in DSLs, because full-featured languages like", + "type": "text" + }, + { + "bbox": [ + 326, + 434, + 346, + 444 + ], + "score": 0.86, + "content": "\\mathrm { C } { + + }", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 433, + 506, + 446 + ], + "score": 1.0, + "content": "enlarge the search space and complicate", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 444, + 506, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 506, + 457 + ], + "score": 1.0, + "content": "synthesis. Restricted DSLs can also enable more efficient special-purpose search algorithms. For", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 456, + 506, + 468 + ], + "spans": [ + { + "bbox": [ + 106, + 456, + 506, + 468 + ], + "score": 1.0, + "content": "example, if a DSL only allows concatenations of substrings of an input string, a dynamic program-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 466, + 506, + 478 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 506, + 478 + ], + "score": 1.0, + "content": "ming algorithm can efficiently search over all possible programs (Polozov & Gulwani, 2015). The", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 477, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 505, + 489 + ], + "score": 1.0, + "content": "choice of DSL also affects the difficulty of the ranking problem. For example, in a DSL without if", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 488, + 506, + 501 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 506, + 501 + ], + "score": 1.0, + "content": "statements, the same algorithm is applied to all inputs, reducing the number of programs consistent", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 500, + 505, + 512 + ], + "spans": [ + { + "bbox": [ + 106, + 500, + 505, + 512 + ], + "score": 1.0, + "content": "with any set of input-output examples, and thus the ranking problem becomes easier. Of course, the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 511, + 482, + 522 + ], + "spans": [ + { + "bbox": [ + 106, + 511, + 482, + 522 + ], + "score": 1.0, + "content": "restrictiveness of the chosen DSL also determines which problems the system can solve at all.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 388, + 506, + 522 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 533, + 505, + 588 + ], + "lines": [ + { + "bbox": [ + 105, + 532, + 506, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 506, + 546 + ], + "score": 1.0, + "content": "Search Techniques. There are many techniques for searching for programs consistent with input-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 544, + 506, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 506, + 558 + ], + "score": 1.0, + "content": "output examples. Perhaps the simplest approach is to define a grammar and then enumerate all", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 555, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 568 + ], + "score": 1.0, + "content": "derivations of the grammar, checking each one for consistency with the examples. This approach", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "score": 1.0, + "content": "can be combined with pruning based on types and other logical reasoning (Feser et al., 2015). While", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 577, + 489, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 489, + 591 + ], + "score": 1.0, + "content": "simple, these approaches can be implemented efficiently, and they can be surprisingly effective.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 532, + 506, + 591 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 594, + 505, + 649 + ], + "lines": [ + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "In restricted domains such as the concatenation example discussed above, special-purpose algorithms", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 605, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 505, + 617 + ], + "score": 1.0, + "content": "can be used. FlashMeta (Polozov & Gulwani, 2015) describes a framework for DSLs which allow", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "score": 1.0, + "content": "decomposition of the search problem, e.g., where the production of an output string from an input", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 626, + 506, + 641 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 641 + ], + "score": 1.0, + "content": "string can be reduced to finding a program for producing the first part of the output and concatenating", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 637, + 371, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 371, + 651 + ], + "score": 1.0, + "content": "it with a program for producing the latter part of the output string.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 594, + 506, + 651 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 654, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "Another class of systems is based on Satisfiability Modulo Theories (SMT) solving. SMT combines", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "SAT-style search with theories like arithmetic and inequalities, with the benefit that theory-dependent", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "subproblems can be handled by special-purpose solvers. For example, a special-purpose solver can", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 687, + 506, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 184, + 702 + ], + "score": 1.0, + "content": "easily find integers", + "type": "text" + }, + { + "bbox": [ + 184, + 690, + 202, + 699 + ], + "score": 0.26, + "content": "x , y", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 687, + 241, + 702 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 241, + 689, + 267, + 699 + ], + "score": 0.91, + "content": "x < y", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 687, + 285, + 702 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 285, + 688, + 328, + 699 + ], + "score": 0.9, + "content": "y < - 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 687, + 506, + 702 + ], + "score": 1.0, + "content": "hold, whereas an enumeration strategy may", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "need to consider many values before satisfying the constraints. Many program synthesis engines", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 709, + 507, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 507, + 723 + ], + "score": 1.0, + "content": "based on SMT solvers exist, e.g., Sketch (Solar-Lezama, 2008) and Brahma (Gulwani et al., 2011).", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "They convert the semantics of a DSL into a set of constraints between variables representing the", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "program and the input-output values, and then call an SMT solver to find a satisfying setting of", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "the program variables. This approach shines when special-purpose reasoning can be leveraged, but", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 505, + 118 + ], + "score": 1.0, + "content": "complex DSLs can lead to very large constraint problems where constructing and manipulating the", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 116, + 353, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 116, + 353, + 128 + ], + "score": 1.0, + "content": "constraints can be a lot slower than an enumerative approach.", + "type": "text", + "cross_page": true + } + ], + "index": 3 + } + ], + "index": 46, + "bbox_fs": [ + 105, + 655, + 507, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 126 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "program and the input-output values, and then call an SMT solver to find a satisfying setting of", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "the program variables. This approach shines when special-purpose reasoning can be leveraged, but", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 505, + 118 + ], + "score": 1.0, + "content": "complex DSLs can lead to very large constraint problems where constructing and manipulating the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 116, + 353, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 116, + 353, + 128 + ], + "score": 1.0, + "content": "constraints can be a lot slower than an enumerative approach.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "text", + "bbox": [ + 106, + 132, + 505, + 177 + ], + "lines": [ + { + "bbox": [ + 105, + 131, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 131, + 506, + 145 + ], + "score": 1.0, + "content": "Finally, stochastic local search can be employed to search over program space, and there is a long", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "score": 1.0, + "content": "history of applying genetic algorithms to this problem. One of the most successful recent examples", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 505, + 167 + ], + "score": 1.0, + "content": "is the STOKE super-optimization system (Schkufza et al., 2016), which uses stochastic local search", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 488, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 488, + 178 + ], + "score": 1.0, + "content": "to find assembly programs that have the same semantics as an input program but execute faster.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 107, + 189, + 505, + 255 + ], + "lines": [ + { + "bbox": [ + 106, + 188, + 506, + 203 + ], + "spans": [ + { + "bbox": [ + 106, + 188, + 506, + 203 + ], + "score": 1.0, + "content": "Ranking. While we focus on the search problem in this work, we briefly mention the ranking", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 200, + 506, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 200, + 506, + 213 + ], + "score": 1.0, + "content": "problem here. A popular choice for ranking is to choose the shortest program consistent with input-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 211, + 505, + 224 + ], + "spans": [ + { + "bbox": [ + 105, + 211, + 505, + 224 + ], + "score": 1.0, + "content": "output examples (Gulwani, 2016). A more sophisticated approach is employed by FlashFill (Singh", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 221, + 505, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 505, + 235 + ], + "score": 1.0, + "content": "& Gulwani, 2015). It works in a manner similar to max-margin structured prediction, where known", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 233, + 506, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 233, + 506, + 246 + ], + "score": 1.0, + "content": "ground truth programs are given, and the learning task is to assign scores to programs such that the", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 244, + 501, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 501, + 257 + ], + "score": 1.0, + "content": "ground truth programs score higher than other programs that satisfy the input-output specification.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10.5 + }, + { + "type": "title", + "bbox": [ + 108, + 272, + 398, + 285 + ], + "lines": [ + { + "bbox": [ + 104, + 271, + 399, + 288 + ], + "spans": [ + { + "bbox": [ + 104, + 271, + 399, + 288 + ], + "score": 1.0, + "content": "3 LEARNING INDUCTIVE PROGRAM SYNTHESIS (LIPS)", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 297, + 505, + 364 + ], + "lines": [ + { + "bbox": [ + 104, + 295, + 506, + 312 + ], + "spans": [ + { + "bbox": [ + 104, + 295, + 506, + 312 + ], + "score": 1.0, + "content": "In this section we outline the general approach that we follow in this work, which we call Learning", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 309, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 106, + 309, + 505, + 321 + ], + "score": 1.0, + "content": "Inductive Program Synthesis (LIPS). The details of our instantiation of LIPS appear in Sect. 4. The", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 318, + 506, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 506, + 333 + ], + "score": 1.0, + "content": "components of LIPS are (1) a DSL specification, (2) a data-generation procedure, (3) a machine learn-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 330, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 106, + 330, + 505, + 343 + ], + "score": 1.0, + "content": "ing model that maps from input-output examples to program attributes, and (4) a search procedure", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 341, + 506, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 341, + 506, + 354 + ], + "score": 1.0, + "content": "that searches program space in an order guided by the model from (3). The framework is related to", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 352, + 507, + 365 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 507, + 365 + ], + "score": 1.0, + "content": "the formulation of Menon et al. (2013); the relationship and key differences are discussed in Sect. 6.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 107, + 376, + 505, + 487 + ], + "lines": [ + { + "bbox": [ + 105, + 376, + 505, + 389 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 505, + 389 + ], + "score": 1.0, + "content": "(1) DSL and Attributes. The choice of DSL is important in LIPS, just as it is in any program", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 388, + 506, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 506, + 399 + ], + "score": 1.0, + "content": "synthesis system. It should be expressive enough to capture the problems that we wish to solve, but", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 398, + 506, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 506, + 411 + ], + "score": 1.0, + "content": "restricted as much as possible to limit the difficulty of the search. In LIPS we additionally specify", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 409, + 506, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 194, + 421 + ], + "score": 1.0, + "content": "an attribute function", + "type": "text" + }, + { + "bbox": [ + 194, + 410, + 203, + 420 + ], + "score": 0.7, + "content": "\\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 410, + 289, + 421 + ], + "score": 1.0, + "content": "that maps programs", + "type": "text" + }, + { + "bbox": [ + 289, + 410, + 299, + 419 + ], + "score": 0.82, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 410, + 456, + 421 + ], + "score": 1.0, + "content": "of the DSL to finite attribute vectors", + "type": "text" + }, + { + "bbox": [ + 456, + 409, + 503, + 421 + ], + "score": 0.92, + "content": "\\mathbf { \\boldsymbol { a } } \\overset { \\cdot } { = } \\mathbf { \\bar { A } } ( \\mathbf { \\boldsymbol { P } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 410, + 506, + 421 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 420, + 506, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 506, + 433 + ], + "score": 1.0, + "content": "(Attribute vectors of different programs need not have equal length.) Attributes serve as the link", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 431, + 506, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 506, + 444 + ], + "score": 1.0, + "content": "between the machine learning and the search component of LIPS: the machine learning model", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 442, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 194, + 455 + ], + "score": 1.0, + "content": "predicts a distribution", + "type": "text" + }, + { + "bbox": [ + 194, + 442, + 228, + 455 + ], + "score": 0.92, + "content": "q ( \\pmb { a } \\mid \\mathcal { E } )", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 442, + 258, + 455 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 258, + 443, + 266, + 452 + ], + "score": 0.8, + "content": "\\mathcal { E }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 442, + 505, + 455 + ], + "score": 1.0, + "content": "is the set of input-output examples, and the search procedure", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 453, + 505, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 453, + 227, + 466 + ], + "score": 1.0, + "content": "aims to search over programs", + "type": "text" + }, + { + "bbox": [ + 228, + 454, + 237, + 463 + ], + "score": 0.84, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 453, + 295, + 466 + ], + "score": 1.0, + "content": "as ordered by", + "type": "text" + }, + { + "bbox": [ + 295, + 453, + 347, + 465 + ], + "score": 0.92, + "content": "q ( { \\bar { \\mathcal { A } } } ( { \\bar { P } } ) \\mid \\varepsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 453, + 505, + 466 + ], + "score": 1.0, + "content": ". Thus an attribute is useful if it is both", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 464, + 505, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 505, + 477 + ], + "score": 1.0, + "content": "predictable from input-output examples, and if conditioning on its value significantly reduces the", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 475, + 241, + 488 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 241, + 488 + ], + "score": 1.0, + "content": "effective size of the search space.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 107, + 492, + 505, + 547 + ], + "lines": [ + { + "bbox": [ + 105, + 491, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 505, + 505 + ], + "score": 1.0, + "content": "Possible attributes are the (perhaps position-dependent) presence or absence of high-level functions", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 503, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 503, + 505, + 515 + ], + "score": 1.0, + "content": "(e.g., does the program contain or end in a call to SORT). Other possible attributes include control", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 514, + 504, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 495, + 527 + ], + "score": 1.0, + "content": "flow templates (e.g., the number of loops and conditionals). In the extreme case, one may set", + "type": "text" + }, + { + "bbox": [ + 495, + 515, + 504, + 524 + ], + "score": 0.74, + "content": "\\mathcal { A }", + "type": "inline_equation" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 524, + 506, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 506, + 538 + ], + "score": 1.0, + "content": "to the identity function, in which case the attribute is equivalent to the program; however, in our", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 536, + 497, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 497, + 549 + ], + "score": 1.0, + "content": "experiments we find that performance is improved by choosing a more abstract attribute function.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 560, + 505, + 618 + ], + "lines": [ + { + "bbox": [ + 104, + 556, + 507, + 578 + ], + "spans": [ + { + "bbox": [ + 104, + 556, + 327, + 578 + ], + "score": 1.0, + "content": "(2) Data Generation. Step 2 is to generate a dataset", + "type": "text" + }, + { + "bbox": [ + 327, + 560, + 421, + 574 + ], + "score": 0.91, + "content": "( ( P ^ { ( n ) } , \\pmb { a } ^ { ( n ) } , \\pmb { \\mathcal { E } } ^ { ( n ) } ) ) _ { n = 1 } ^ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 422, + 556, + 473, + 578 + ], + "score": 1.0, + "content": "of programs", + "type": "text" + }, + { + "bbox": [ + 473, + 560, + 493, + 571 + ], + "score": 0.89, + "content": "P ^ { ( n ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 556, + 507, + 578 + ], + "score": 1.0, + "content": "in", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 104, + 570, + 507, + 588 + ], + "spans": [ + { + "bbox": [ + 104, + 570, + 236, + 588 + ], + "score": 1.0, + "content": "the chosen DSL, their attributes", + "type": "text" + }, + { + "bbox": [ + 236, + 572, + 255, + 584 + ], + "score": 0.92, + "content": "\\mathbf { \\pmb { a } } ^ { ( n ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 570, + 429, + 588 + ], + "score": 1.0, + "content": ", and accompanying input-output examples", + "type": "text" + }, + { + "bbox": [ + 430, + 572, + 448, + 584 + ], + "score": 0.89, + "content": "{ \\mathcal { E } } ^ { ( n ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 570, + 507, + 588 + ], + "score": 1.0, + "content": ". Different ap-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 583, + 506, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 506, + 599 + ], + "score": 1.0, + "content": "proaches are possible, ranging from enumerating valid programs in the DSL and pruning, to training", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "score": 1.0, + "content": "a more sophisticated generative model of programs in the DSL. The key in the LIPS formulation is", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 605, + 444, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 444, + 619 + ], + "score": 1.0, + "content": "to ensure that it is feasible to generate a large dataset (ideally millions of programs).", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 107, + 630, + 505, + 697 + ], + "lines": [ + { + "bbox": [ + 105, + 630, + 507, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 507, + 644 + ], + "score": 1.0, + "content": "(3) Machine Learning Model. The machine learning problem is to learn a distribution of at-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 641, + 506, + 654 + ], + "spans": [ + { + "bbox": [ + 106, + 641, + 257, + 654 + ], + "score": 1.0, + "content": "tributes given input-output examples,", + "type": "text" + }, + { + "bbox": [ + 257, + 641, + 291, + 654 + ], + "score": 0.92, + "content": "q ( \\pmb { a } \\mid \\mathcal { E } )", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 641, + 506, + 654 + ], + "score": 1.0, + "content": ". There is freedom to explore a large space of models,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 653, + 505, + 664 + ], + "spans": [ + { + "bbox": [ + 106, + 653, + 281, + 664 + ], + "score": 1.0, + "content": "so long as the input component can encode", + "type": "text" + }, + { + "bbox": [ + 281, + 654, + 288, + 663 + ], + "score": 0.79, + "content": "\\mathcal { E }", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 653, + 505, + 664 + ], + "score": 1.0, + "content": ", and the output is a proper distribution over attributes", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 663, + 505, + 676 + ], + "spans": [ + { + "bbox": [ + 105, + 663, + 505, + 676 + ], + "score": 1.0, + "content": "(e.g., if attributes are a fixed-size binary vector, then a neural network with independent sigmoid", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 675, + 505, + 686 + ], + "spans": [ + { + "bbox": [ + 106, + 675, + 505, + 686 + ], + "score": 1.0, + "content": "outputs is appropriate; if attributes are variable size, then a recurrent neural network output could be", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 686, + 505, + 698 + ], + "spans": [ + { + "bbox": [ + 106, + 686, + 505, + 698 + ], + "score": 1.0, + "content": "used). Attributes are observed at training time, so training can use a maximum likelihood objective.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 43.5 + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "(4) Search. The aim of the search component is to interface with an existing solver, using the", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 720, + 471, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 146, + 733 + ], + "score": 1.0, + "content": "predicted", + "type": "text" + }, + { + "bbox": [ + 146, + 720, + 180, + 733 + ], + "score": 0.93, + "content": "q ( \\pmb { a } \\mid \\mathcal { E } )", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 720, + 471, + 733 + ], + "score": 1.0, + "content": "to guide the search. We describe specific approaches in the next section.", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 47.5 + } + ], + "page_idx": 2, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 126 + ], + "lines": [], + "index": 1.5, + "bbox_fs": [ + 105, + 82, + 506, + 128 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 132, + 505, + 177 + ], + "lines": [ + { + "bbox": [ + 105, + 131, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 131, + 506, + 145 + ], + "score": 1.0, + "content": "Finally, stochastic local search can be employed to search over program space, and there is a long", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "score": 1.0, + "content": "history of applying genetic algorithms to this problem. One of the most successful recent examples", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 505, + 167 + ], + "score": 1.0, + "content": "is the STOKE super-optimization system (Schkufza et al., 2016), which uses stochastic local search", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 488, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 488, + 178 + ], + "score": 1.0, + "content": "to find assembly programs that have the same semantics as an input program but execute faster.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 131, + 506, + 178 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 189, + 505, + 255 + ], + "lines": [ + { + "bbox": [ + 106, + 188, + 506, + 203 + ], + "spans": [ + { + "bbox": [ + 106, + 188, + 506, + 203 + ], + "score": 1.0, + "content": "Ranking. While we focus on the search problem in this work, we briefly mention the ranking", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 200, + 506, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 200, + 506, + 213 + ], + "score": 1.0, + "content": "problem here. A popular choice for ranking is to choose the shortest program consistent with input-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 211, + 505, + 224 + ], + "spans": [ + { + "bbox": [ + 105, + 211, + 505, + 224 + ], + "score": 1.0, + "content": "output examples (Gulwani, 2016). A more sophisticated approach is employed by FlashFill (Singh", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 221, + 505, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 505, + 235 + ], + "score": 1.0, + "content": "& Gulwani, 2015). It works in a manner similar to max-margin structured prediction, where known", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 233, + 506, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 233, + 506, + 246 + ], + "score": 1.0, + "content": "ground truth programs are given, and the learning task is to assign scores to programs such that the", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 244, + 501, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 501, + 257 + ], + "score": 1.0, + "content": "ground truth programs score higher than other programs that satisfy the input-output specification.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 188, + 506, + 257 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 272, + 398, + 285 + ], + "lines": [ + { + "bbox": [ + 104, + 271, + 399, + 288 + ], + "spans": [ + { + "bbox": [ + 104, + 271, + 399, + 288 + ], + "score": 1.0, + "content": "3 LEARNING INDUCTIVE PROGRAM SYNTHESIS (LIPS)", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 297, + 505, + 364 + ], + "lines": [ + { + "bbox": [ + 104, + 295, + 506, + 312 + ], + "spans": [ + { + "bbox": [ + 104, + 295, + 506, + 312 + ], + "score": 1.0, + "content": "In this section we outline the general approach that we follow in this work, which we call Learning", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 309, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 106, + 309, + 505, + 321 + ], + "score": 1.0, + "content": "Inductive Program Synthesis (LIPS). The details of our instantiation of LIPS appear in Sect. 4. The", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 318, + 506, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 506, + 333 + ], + "score": 1.0, + "content": "components of LIPS are (1) a DSL specification, (2) a data-generation procedure, (3) a machine learn-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 330, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 106, + 330, + 505, + 343 + ], + "score": 1.0, + "content": "ing model that maps from input-output examples to program attributes, and (4) a search procedure", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 341, + 506, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 341, + 506, + 354 + ], + "score": 1.0, + "content": "that searches program space in an order guided by the model from (3). The framework is related to", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 352, + 507, + 365 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 507, + 365 + ], + "score": 1.0, + "content": "the formulation of Menon et al. (2013); the relationship and key differences are discussed in Sect. 6.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5, + "bbox_fs": [ + 104, + 295, + 507, + 365 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 376, + 505, + 487 + ], + "lines": [ + { + "bbox": [ + 105, + 376, + 505, + 389 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 505, + 389 + ], + "score": 1.0, + "content": "(1) DSL and Attributes. The choice of DSL is important in LIPS, just as it is in any program", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 388, + 506, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 506, + 399 + ], + "score": 1.0, + "content": "synthesis system. It should be expressive enough to capture the problems that we wish to solve, but", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 398, + 506, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 506, + 411 + ], + "score": 1.0, + "content": "restricted as much as possible to limit the difficulty of the search. In LIPS we additionally specify", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 409, + 506, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 194, + 421 + ], + "score": 1.0, + "content": "an attribute function", + "type": "text" + }, + { + "bbox": [ + 194, + 410, + 203, + 420 + ], + "score": 0.7, + "content": "\\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 410, + 289, + 421 + ], + "score": 1.0, + "content": "that maps programs", + "type": "text" + }, + { + "bbox": [ + 289, + 410, + 299, + 419 + ], + "score": 0.82, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 410, + 456, + 421 + ], + "score": 1.0, + "content": "of the DSL to finite attribute vectors", + "type": "text" + }, + { + "bbox": [ + 456, + 409, + 503, + 421 + ], + "score": 0.92, + "content": "\\mathbf { \\boldsymbol { a } } \\overset { \\cdot } { = } \\mathbf { \\bar { A } } ( \\mathbf { \\boldsymbol { P } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 410, + 506, + 421 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 420, + 506, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 506, + 433 + ], + "score": 1.0, + "content": "(Attribute vectors of different programs need not have equal length.) Attributes serve as the link", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 431, + 506, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 506, + 444 + ], + "score": 1.0, + "content": "between the machine learning and the search component of LIPS: the machine learning model", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 442, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 194, + 455 + ], + "score": 1.0, + "content": "predicts a distribution", + "type": "text" + }, + { + "bbox": [ + 194, + 442, + 228, + 455 + ], + "score": 0.92, + "content": "q ( \\pmb { a } \\mid \\mathcal { E } )", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 442, + 258, + 455 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 258, + 443, + 266, + 452 + ], + "score": 0.8, + "content": "\\mathcal { E }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 442, + 505, + 455 + ], + "score": 1.0, + "content": "is the set of input-output examples, and the search procedure", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 453, + 505, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 453, + 227, + 466 + ], + "score": 1.0, + "content": "aims to search over programs", + "type": "text" + }, + { + "bbox": [ + 228, + 454, + 237, + 463 + ], + "score": 0.84, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 453, + 295, + 466 + ], + "score": 1.0, + "content": "as ordered by", + "type": "text" + }, + { + "bbox": [ + 295, + 453, + 347, + 465 + ], + "score": 0.92, + "content": "q ( { \\bar { \\mathcal { A } } } ( { \\bar { P } } ) \\mid \\varepsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 453, + 505, + 466 + ], + "score": 1.0, + "content": ". Thus an attribute is useful if it is both", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 464, + 505, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 505, + 477 + ], + "score": 1.0, + "content": "predictable from input-output examples, and if conditioning on its value significantly reduces the", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 475, + 241, + 488 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 241, + 488 + ], + "score": 1.0, + "content": "effective size of the search space.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 376, + 506, + 488 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 492, + 505, + 547 + ], + "lines": [ + { + "bbox": [ + 105, + 491, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 505, + 505 + ], + "score": 1.0, + "content": "Possible attributes are the (perhaps position-dependent) presence or absence of high-level functions", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 503, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 503, + 505, + 515 + ], + "score": 1.0, + "content": "(e.g., does the program contain or end in a call to SORT). Other possible attributes include control", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 514, + 504, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 495, + 527 + ], + "score": 1.0, + "content": "flow templates (e.g., the number of loops and conditionals). In the extreme case, one may set", + "type": "text" + }, + { + "bbox": [ + 495, + 515, + 504, + 524 + ], + "score": 0.74, + "content": "\\mathcal { A }", + "type": "inline_equation" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 524, + 506, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 506, + 538 + ], + "score": 1.0, + "content": "to the identity function, in which case the attribute is equivalent to the program; however, in our", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 536, + 497, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 497, + 549 + ], + "score": 1.0, + "content": "experiments we find that performance is improved by choosing a more abstract attribute function.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 33, + "bbox_fs": [ + 105, + 491, + 506, + 549 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 560, + 505, + 618 + ], + "lines": [ + { + "bbox": [ + 104, + 556, + 507, + 578 + ], + "spans": [ + { + "bbox": [ + 104, + 556, + 327, + 578 + ], + "score": 1.0, + "content": "(2) Data Generation. Step 2 is to generate a dataset", + "type": "text" + }, + { + "bbox": [ + 327, + 560, + 421, + 574 + ], + "score": 0.91, + "content": "( ( P ^ { ( n ) } , \\pmb { a } ^ { ( n ) } , \\pmb { \\mathcal { E } } ^ { ( n ) } ) ) _ { n = 1 } ^ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 422, + 556, + 473, + 578 + ], + "score": 1.0, + "content": "of programs", + "type": "text" + }, + { + "bbox": [ + 473, + 560, + 493, + 571 + ], + "score": 0.89, + "content": "P ^ { ( n ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 556, + 507, + 578 + ], + "score": 1.0, + "content": "in", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 104, + 570, + 507, + 588 + ], + "spans": [ + { + "bbox": [ + 104, + 570, + 236, + 588 + ], + "score": 1.0, + "content": "the chosen DSL, their attributes", + "type": "text" + }, + { + "bbox": [ + 236, + 572, + 255, + 584 + ], + "score": 0.92, + "content": "\\mathbf { \\pmb { a } } ^ { ( n ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 570, + 429, + 588 + ], + "score": 1.0, + "content": ", and accompanying input-output examples", + "type": "text" + }, + { + "bbox": [ + 430, + 572, + 448, + 584 + ], + "score": 0.89, + "content": "{ \\mathcal { E } } ^ { ( n ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 570, + 507, + 588 + ], + "score": 1.0, + "content": ". Different ap-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 583, + 506, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 506, + 599 + ], + "score": 1.0, + "content": "proaches are possible, ranging from enumerating valid programs in the DSL and pruning, to training", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "score": 1.0, + "content": "a more sophisticated generative model of programs in the DSL. The key in the LIPS formulation is", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 605, + 444, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 444, + 619 + ], + "score": 1.0, + "content": "to ensure that it is feasible to generate a large dataset (ideally millions of programs).", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38, + "bbox_fs": [ + 104, + 556, + 507, + 619 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 630, + 505, + 697 + ], + "lines": [ + { + "bbox": [ + 105, + 630, + 507, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 507, + 644 + ], + "score": 1.0, + "content": "(3) Machine Learning Model. The machine learning problem is to learn a distribution of at-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 641, + 506, + 654 + ], + "spans": [ + { + "bbox": [ + 106, + 641, + 257, + 654 + ], + "score": 1.0, + "content": "tributes given input-output examples,", + "type": "text" + }, + { + "bbox": [ + 257, + 641, + 291, + 654 + ], + "score": 0.92, + "content": "q ( \\pmb { a } \\mid \\mathcal { E } )", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 641, + 506, + 654 + ], + "score": 1.0, + "content": ". There is freedom to explore a large space of models,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 653, + 505, + 664 + ], + "spans": [ + { + "bbox": [ + 106, + 653, + 281, + 664 + ], + "score": 1.0, + "content": "so long as the input component can encode", + "type": "text" + }, + { + "bbox": [ + 281, + 654, + 288, + 663 + ], + "score": 0.79, + "content": "\\mathcal { E }", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 653, + 505, + 664 + ], + "score": 1.0, + "content": ", and the output is a proper distribution over attributes", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 663, + 505, + 676 + ], + "spans": [ + { + "bbox": [ + 105, + 663, + 505, + 676 + ], + "score": 1.0, + "content": "(e.g., if attributes are a fixed-size binary vector, then a neural network with independent sigmoid", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 675, + 505, + 686 + ], + "spans": [ + { + "bbox": [ + 106, + 675, + 505, + 686 + ], + "score": 1.0, + "content": "outputs is appropriate; if attributes are variable size, then a recurrent neural network output could be", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 686, + 505, + 698 + ], + "spans": [ + { + "bbox": [ + 106, + 686, + 505, + 698 + ], + "score": 1.0, + "content": "used). Attributes are observed at training time, so training can use a maximum likelihood objective.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 43.5, + "bbox_fs": [ + 105, + 630, + 507, + 698 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "(4) Search. The aim of the search component is to interface with an existing solver, using the", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 720, + 471, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 146, + 733 + ], + "score": 1.0, + "content": "predicted", + "type": "text" + }, + { + "bbox": [ + 146, + 720, + 180, + 733 + ], + "score": 0.93, + "content": "q ( \\pmb { a } \\mid \\mathcal { E } )", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 720, + 471, + 733 + ], + "score": 1.0, + "content": "to guide the search. We describe specific approaches in the next section.", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 47.5, + "bbox_fs": [ + 105, + 708, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 81, + 191, + 94 + ], + "lines": [ + { + "bbox": [ + 104, + 79, + 193, + 96 + ], + "spans": [ + { + "bbox": [ + 104, + 79, + 193, + 96 + ], + "score": 1.0, + "content": "4 DEEPCODER", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 108, + 106, + 506, + 129 + ], + "lines": [ + { + "bbox": [ + 106, + 106, + 504, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 106, + 504, + 119 + ], + "score": 1.0, + "content": "Here we describe DeepCoder, our instantiation of LIPS including a choice of DSL, a data generation", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 117, + 498, + 132 + ], + "spans": [ + { + "bbox": [ + 106, + 117, + 498, + 132 + ], + "score": 1.0, + "content": "strategy, models for encoding input-output sets, and algorithms for searching over program space.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5 + }, + { + "type": "title", + "bbox": [ + 106, + 143, + 339, + 155 + ], + "lines": [ + { + "bbox": [ + 106, + 143, + 340, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 143, + 340, + 156 + ], + "score": 1.0, + "content": "4.1 DOMAIN SPECIFIC LANGUAGE AND ATTRIBUTES", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 164, + 505, + 208 + ], + "lines": [ + { + "bbox": [ + 105, + 165, + 505, + 176 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 505, + 176 + ], + "score": 1.0, + "content": "We consider binary attributes indicating the presence or absence of high-level functions in the target", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 175, + 506, + 187 + ], + "spans": [ + { + "bbox": [ + 105, + 175, + 506, + 187 + ], + "score": 1.0, + "content": "program. To make this effective, the chosen DSL needs to contain constructs that are not so low-level", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 186, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 186, + 505, + 199 + ], + "score": 1.0, + "content": "that they all appear in the vast majority of programs, but at the same time should be common enough", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 198, + 471, + 209 + ], + "spans": [ + { + "bbox": [ + 106, + 198, + 471, + 209 + ], + "score": 1.0, + "content": "so that predicting their occurrence from input-output examples can be learned successfully.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 106, + 214, + 505, + 281 + ], + "lines": [ + { + "bbox": [ + 105, + 213, + 506, + 227 + ], + "spans": [ + { + "bbox": [ + 105, + 213, + 506, + 227 + ], + "score": 1.0, + "content": "Following this observation, our DSL is loosely inspired by query languages such as SQL or LINQ,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 225, + 506, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 506, + 237 + ], + "score": 1.0, + "content": "where high-level functions are used in sequence to manipulate data. A program in our DSL is a", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 236, + 506, + 249 + ], + "spans": [ + { + "bbox": [ + 105, + 236, + 506, + 249 + ], + "score": 1.0, + "content": "sequence of function calls, where the result of each call initializes a fresh variable that is either a", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 247, + 505, + 259 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 505, + 259 + ], + "score": 1.0, + "content": "singleton integer or an integer array. Functions can be applied to any of the inputs or previously", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 258, + 506, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 506, + 270 + ], + "score": 1.0, + "content": "computed (intermediate) variables. The output of the program is the return value of the last function", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 269, + 468, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 269, + 389, + 282 + ], + "score": 1.0, + "content": "call, i.e., the last variable. See Fig. 1 for an example program of length", + "type": "text" + }, + { + "bbox": [ + 390, + 269, + 417, + 279 + ], + "score": 0.89, + "content": "T = 4", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 269, + 468, + 282 + ], + "score": 1.0, + "content": "in our DSL.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10.5 + }, + { + "type": "image", + "bbox": [ + 107, + 291, + 515, + 352 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 291, + 515, + 352 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 291, + 515, + 352 + ], + "spans": [ + { + "bbox": [ + 107, + 291, + 515, + 352 + ], + "score": 0.693, + "type": "image", + "image_path": "95255e32da9df33db9a517e94978033a462b93ebbbe24b571c4b80d5e2c7f8e6.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 107, + 291, + 515, + 311.3333333333333 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 107, + 311.3333333333333, + 515, + 331.66666666666663 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 107, + 331.66666666666663, + 515, + 351.99999999999994 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 131, + 360, + 479, + 372 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 131, + 359, + 479, + 374 + ], + "spans": [ + { + "bbox": [ + 131, + 359, + 479, + 374 + ], + "score": 1.0, + "content": "Figure 1: An example program in our DSL that takes a single integer array as its input.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + } + ], + "index": 16.0 + }, + { + "type": "text", + "bbox": [ + 106, + 390, + 506, + 468 + ], + "lines": [ + { + "bbox": [ + 106, + 390, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 506, + 403 + ], + "score": 1.0, + "content": "Overall, our DSL contains the first-order functions HEAD, LAST, TAKE, DROP, ACCESS, MINIMUM,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 402, + 507, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 507, + 414 + ], + "score": 1.0, + "content": "MAXIMUM, REVERSE, SORT, SUM, and the higher-order functions MAP, FILTER, COUNT, ZIP-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 412, + 506, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 506, + 425 + ], + "score": 1.0, + "content": "WITH, SCANL1. Higher-order functions require suitable lambda functions for their behavior to be", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 424, + 507, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 313, + 436 + ], + "score": 1.0, + "content": "fully specified: for MAP our DSL provides lambdas", + "type": "text" + }, + { + "bbox": [ + 313, + 425, + 334, + 435 + ], + "score": 0.68, + "content": "( + 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 424, + 342, + 436 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 342, + 425, + 362, + 435 + ], + "score": 0.39, + "content": "( - 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 424, + 370, + 436 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 370, + 424, + 391, + 435 + ], + "score": 0.69, + "content": "( \\star 2 )", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 424, + 398, + 436 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 399, + 424, + 419, + 435 + ], + "score": 0.32, + "content": "( / 2 )", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 424, + 428, + 436 + ], + "score": 1.0, + "content": "),", + "type": "text" + }, + { + "bbox": [ + 428, + 424, + 465, + 435 + ], + "score": 0.34, + "content": "( \\star \\ ( - 1 ) \\ )", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 424, + 473, + 436 + ], + "score": 1.0, + "content": "),", + "type": "text" + }, + { + "bbox": [ + 474, + 424, + 501, + 435 + ], + "score": 0.63, + "content": "( \\star \\star 2 )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 424, + 507, + 436 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 108, + 434, + 507, + 448 + ], + "spans": [ + { + "bbox": [ + 108, + 436, + 129, + 446 + ], + "score": 0.8, + "content": "( \\star 3 )", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 434, + 137, + 448 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 137, + 435, + 158, + 446 + ], + "score": 0.37, + "content": "( / 3 )", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 434, + 166, + 448 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 166, + 435, + 187, + 446 + ], + "score": 0.83, + "content": "( \\star 4 )", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 434, + 195, + 448 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 195, + 435, + 216, + 446 + ], + "score": 0.3, + "content": "( / 4 )", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 434, + 405, + 448 + ], + "score": 1.0, + "content": "; for FILTER and COUNT there are predicates", + "type": "text" + }, + { + "bbox": [ + 405, + 436, + 424, + 446 + ], + "score": 0.74, + "content": "( > 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 434, + 432, + 448 + ], + "score": 1.0, + "content": "),", + "type": "text" + }, + { + "bbox": [ + 433, + 436, + 453, + 446 + ], + "score": 0.7, + "content": "( < 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 434, + 465, + 448 + ], + "score": 1.0, + "content": ", (", + "type": "text" + }, + { + "bbox": [ + 465, + 436, + 497, + 446 + ], + "score": 0.83, + "content": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 498, + 434, + 507, + 448 + ], + "score": 1.0, + "content": "),", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 446, + 507, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 446, + 111, + 459 + ], + "score": 1.0, + "content": "(", + "type": "text" + }, + { + "bbox": [ + 112, + 447, + 144, + 456 + ], + "score": 0.88, + "content": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 446, + 389, + 459 + ], + "score": 1.0, + "content": ") and for ZIPWITH and SCANL1 the DSL provides lambdas", + "type": "text" + }, + { + "bbox": [ + 390, + 447, + 453, + 457 + ], + "score": 0.42, + "content": "( + ) , ( - ) , ( \\star ) ,", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 446, + 507, + 459 + ], + "score": 1.0, + "content": "MIN, MAX.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 457, + 403, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 403, + 469 + ], + "score": 1.0, + "content": "A description of the semantics of all functions is provided in Appendix F.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 107, + 473, + 505, + 518 + ], + "lines": [ + { + "bbox": [ + 105, + 473, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 505, + 486 + ], + "score": 1.0, + "content": "Note that while the language only allows linear control flow, many of its functions do perform", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "score": 1.0, + "content": "branching and looping internally (e.g., SORT, COUNT, ...). Examples of more sophisticated programs", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 495, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 505, + 509 + ], + "score": 1.0, + "content": "expressible in our DSL, which were inspired by the simplest problems appearing on programming", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 507, + 303, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 303, + 519 + ], + "score": 1.0, + "content": "competition websites, are shown in Appendix A.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26.5 + }, + { + "type": "title", + "bbox": [ + 108, + 532, + 214, + 543 + ], + "lines": [ + { + "bbox": [ + 105, + 532, + 216, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 216, + 545 + ], + "score": 1.0, + "content": "4.2 DATA GENERATION", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 106, + 553, + 505, + 653 + ], + "lines": [ + { + "bbox": [ + 106, + 553, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 106, + 553, + 505, + 567 + ], + "score": 1.0, + "content": "To generate a dataset, we enumerate programs in the DSL, heuristically pruning away those with", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 563, + 506, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 506, + 578 + ], + "score": 1.0, + "content": "easily detectable issues such as a redundant variable whose value does not affect the program output,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 576, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 576, + 505, + 588 + ], + "score": 1.0, + "content": "or, more generally, existence of a shorter equivalent program (equivalence can be overapproximated", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 585, + 506, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 585, + 506, + 600 + ], + "score": 1.0, + "content": "by identical behavior on randomly or carefully chosen inputs). To generate valid inputs for a program,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 597, + 505, + 609 + ], + "spans": [ + { + "bbox": [ + 106, + 597, + 505, + 609 + ], + "score": 1.0, + "content": "we enforce a constraint on the output value bounding integers to some predetermined range, and then", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 608, + 505, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 505, + 621 + ], + "score": 1.0, + "content": "propagate these constraints backward through the program to obtain a range of valid values for each", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "score": 1.0, + "content": "input. If one of these ranges is empty, we discard the program. Otherwise, input-output pairs can be", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 630, + 505, + 643 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 505, + 643 + ], + "score": 1.0, + "content": "generated by picking inputs from the pre-computed valid ranges and executing the program to obtain", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 641, + 504, + 654 + ], + "spans": [ + { + "bbox": [ + 106, + 641, + 504, + 654 + ], + "score": 1.0, + "content": "the output values. The binary attribute vectors are easily computed from the program source codes.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 34 + }, + { + "type": "title", + "bbox": [ + 108, + 666, + 257, + 678 + ], + "lines": [ + { + "bbox": [ + 105, + 665, + 259, + 679 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 259, + 679 + ], + "score": 1.0, + "content": "4.3 MACHINE LEARNING MODEL", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 507, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 507, + 700 + ], + "score": 1.0, + "content": "Observe how the input-output data in Fig. 1 is informative of the functions appearing in the program:", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "the values in the output are all negative, divisible by 4, they are sorted in decreasing order, and they", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "happen to be multiples of numbers appearing in the input. Our aim is to learn to recognize such", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 721, + 506, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 506, + 732 + ], + "score": 1.0, + "content": "patterns in the input-output examples, and to leverage them to predict the presence or absence of", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 41.5 + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 759 + ], + "lines": [] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 81, + 191, + 94 + ], + "lines": [ + { + "bbox": [ + 104, + 79, + 193, + 96 + ], + "spans": [ + { + "bbox": [ + 104, + 79, + 193, + 96 + ], + "score": 1.0, + "content": "4 DEEPCODER", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 108, + 106, + 506, + 129 + ], + "lines": [ + { + "bbox": [ + 106, + 106, + 504, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 106, + 504, + 119 + ], + "score": 1.0, + "content": "Here we describe DeepCoder, our instantiation of LIPS including a choice of DSL, a data generation", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 117, + 498, + 132 + ], + "spans": [ + { + "bbox": [ + 106, + 117, + 498, + 132 + ], + "score": 1.0, + "content": "strategy, models for encoding input-output sets, and algorithms for searching over program space.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5, + "bbox_fs": [ + 106, + 106, + 504, + 132 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 143, + 339, + 155 + ], + "lines": [ + { + "bbox": [ + 106, + 143, + 340, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 143, + 340, + 156 + ], + "score": 1.0, + "content": "4.1 DOMAIN SPECIFIC LANGUAGE AND ATTRIBUTES", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 164, + 505, + 208 + ], + "lines": [ + { + "bbox": [ + 105, + 165, + 505, + 176 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 505, + 176 + ], + "score": 1.0, + "content": "We consider binary attributes indicating the presence or absence of high-level functions in the target", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 175, + 506, + 187 + ], + "spans": [ + { + "bbox": [ + 105, + 175, + 506, + 187 + ], + "score": 1.0, + "content": "program. To make this effective, the chosen DSL needs to contain constructs that are not so low-level", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 186, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 186, + 505, + 199 + ], + "score": 1.0, + "content": "that they all appear in the vast majority of programs, but at the same time should be common enough", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 198, + 471, + 209 + ], + "spans": [ + { + "bbox": [ + 106, + 198, + 471, + 209 + ], + "score": 1.0, + "content": "so that predicting their occurrence from input-output examples can be learned successfully.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 165, + 506, + 209 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 214, + 505, + 281 + ], + "lines": [ + { + "bbox": [ + 105, + 213, + 506, + 227 + ], + "spans": [ + { + "bbox": [ + 105, + 213, + 506, + 227 + ], + "score": 1.0, + "content": "Following this observation, our DSL is loosely inspired by query languages such as SQL or LINQ,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 225, + 506, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 506, + 237 + ], + "score": 1.0, + "content": "where high-level functions are used in sequence to manipulate data. A program in our DSL is a", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 236, + 506, + 249 + ], + "spans": [ + { + "bbox": [ + 105, + 236, + 506, + 249 + ], + "score": 1.0, + "content": "sequence of function calls, where the result of each call initializes a fresh variable that is either a", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 247, + 505, + 259 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 505, + 259 + ], + "score": 1.0, + "content": "singleton integer or an integer array. Functions can be applied to any of the inputs or previously", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 258, + 506, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 506, + 270 + ], + "score": 1.0, + "content": "computed (intermediate) variables. The output of the program is the return value of the last function", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 269, + 468, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 269, + 389, + 282 + ], + "score": 1.0, + "content": "call, i.e., the last variable. See Fig. 1 for an example program of length", + "type": "text" + }, + { + "bbox": [ + 390, + 269, + 417, + 279 + ], + "score": 0.89, + "content": "T = 4", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 269, + 468, + 282 + ], + "score": 1.0, + "content": "in our DSL.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 213, + 506, + 282 + ] + }, + { + "type": "image", + "bbox": [ + 107, + 291, + 515, + 352 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 291, + 515, + 352 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 291, + 515, + 352 + ], + "spans": [ + { + "bbox": [ + 107, + 291, + 515, + 352 + ], + "score": 0.693, + "type": "image", + "image_path": "95255e32da9df33db9a517e94978033a462b93ebbbe24b571c4b80d5e2c7f8e6.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 107, + 291, + 515, + 311.3333333333333 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 107, + 311.3333333333333, + 515, + 331.66666666666663 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 107, + 331.66666666666663, + 515, + 351.99999999999994 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 131, + 360, + 479, + 372 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 131, + 359, + 479, + 374 + ], + "spans": [ + { + "bbox": [ + 131, + 359, + 479, + 374 + ], + "score": 1.0, + "content": "Figure 1: An example program in our DSL that takes a single integer array as its input.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + } + ], + "index": 16.0 + }, + { + "type": "text", + "bbox": [ + 106, + 390, + 506, + 468 + ], + "lines": [ + { + "bbox": [ + 106, + 390, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 506, + 403 + ], + "score": 1.0, + "content": "Overall, our DSL contains the first-order functions HEAD, LAST, TAKE, DROP, ACCESS, MINIMUM,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 402, + 507, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 507, + 414 + ], + "score": 1.0, + "content": "MAXIMUM, REVERSE, SORT, SUM, and the higher-order functions MAP, FILTER, COUNT, ZIP-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 412, + 506, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 506, + 425 + ], + "score": 1.0, + "content": "WITH, SCANL1. Higher-order functions require suitable lambda functions for their behavior to be", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 424, + 507, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 313, + 436 + ], + "score": 1.0, + "content": "fully specified: for MAP our DSL provides lambdas", + "type": "text" + }, + { + "bbox": [ + 313, + 425, + 334, + 435 + ], + "score": 0.68, + "content": "( + 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 424, + 342, + 436 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 342, + 425, + 362, + 435 + ], + "score": 0.39, + "content": "( - 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 424, + 370, + 436 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 370, + 424, + 391, + 435 + ], + "score": 0.69, + "content": "( \\star 2 )", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 424, + 398, + 436 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 399, + 424, + 419, + 435 + ], + "score": 0.32, + "content": "( / 2 )", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 424, + 428, + 436 + ], + "score": 1.0, + "content": "),", + "type": "text" + }, + { + "bbox": [ + 428, + 424, + 465, + 435 + ], + "score": 0.34, + "content": "( \\star \\ ( - 1 ) \\ )", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 424, + 473, + 436 + ], + "score": 1.0, + "content": "),", + "type": "text" + }, + { + "bbox": [ + 474, + 424, + 501, + 435 + ], + "score": 0.63, + "content": "( \\star \\star 2 )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 424, + 507, + 436 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 108, + 434, + 507, + 448 + ], + "spans": [ + { + "bbox": [ + 108, + 436, + 129, + 446 + ], + "score": 0.8, + "content": "( \\star 3 )", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 434, + 137, + 448 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 137, + 435, + 158, + 446 + ], + "score": 0.37, + "content": "( / 3 )", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 434, + 166, + 448 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 166, + 435, + 187, + 446 + ], + "score": 0.83, + "content": "( \\star 4 )", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 434, + 195, + 448 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 195, + 435, + 216, + 446 + ], + "score": 0.3, + "content": "( / 4 )", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 434, + 405, + 448 + ], + "score": 1.0, + "content": "; for FILTER and COUNT there are predicates", + "type": "text" + }, + { + "bbox": [ + 405, + 436, + 424, + 446 + ], + "score": 0.74, + "content": "( > 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 434, + 432, + 448 + ], + "score": 1.0, + "content": "),", + "type": "text" + }, + { + "bbox": [ + 433, + 436, + 453, + 446 + ], + "score": 0.7, + "content": "( < 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 434, + 465, + 448 + ], + "score": 1.0, + "content": ", (", + "type": "text" + }, + { + "bbox": [ + 465, + 436, + 497, + 446 + ], + "score": 0.83, + "content": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 498, + 434, + 507, + 448 + ], + "score": 1.0, + "content": "),", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 446, + 507, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 446, + 111, + 459 + ], + "score": 1.0, + "content": "(", + "type": "text" + }, + { + "bbox": [ + 112, + 447, + 144, + 456 + ], + "score": 0.88, + "content": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 446, + 389, + 459 + ], + "score": 1.0, + "content": ") and for ZIPWITH and SCANL1 the DSL provides lambdas", + "type": "text" + }, + { + "bbox": [ + 390, + 447, + 453, + 457 + ], + "score": 0.42, + "content": "( + ) , ( - ) , ( \\star ) ,", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 446, + 507, + 459 + ], + "score": 1.0, + "content": "MIN, MAX.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 457, + 403, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 403, + 469 + ], + "score": 1.0, + "content": "A description of the semantics of all functions is provided in Appendix F.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 390, + 507, + 469 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 473, + 505, + 518 + ], + "lines": [ + { + "bbox": [ + 105, + 473, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 505, + 486 + ], + "score": 1.0, + "content": "Note that while the language only allows linear control flow, many of its functions do perform", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "score": 1.0, + "content": "branching and looping internally (e.g., SORT, COUNT, ...). Examples of more sophisticated programs", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 495, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 505, + 509 + ], + "score": 1.0, + "content": "expressible in our DSL, which were inspired by the simplest problems appearing on programming", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 507, + 303, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 303, + 519 + ], + "score": 1.0, + "content": "competition websites, are shown in Appendix A.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 473, + 505, + 519 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 532, + 214, + 543 + ], + "lines": [ + { + "bbox": [ + 105, + 532, + 216, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 216, + 545 + ], + "score": 1.0, + "content": "4.2 DATA GENERATION", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 106, + 553, + 505, + 653 + ], + "lines": [ + { + "bbox": [ + 106, + 553, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 106, + 553, + 505, + 567 + ], + "score": 1.0, + "content": "To generate a dataset, we enumerate programs in the DSL, heuristically pruning away those with", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 563, + 506, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 506, + 578 + ], + "score": 1.0, + "content": "easily detectable issues such as a redundant variable whose value does not affect the program output,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 576, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 576, + 505, + 588 + ], + "score": 1.0, + "content": "or, more generally, existence of a shorter equivalent program (equivalence can be overapproximated", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 585, + 506, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 585, + 506, + 600 + ], + "score": 1.0, + "content": "by identical behavior on randomly or carefully chosen inputs). To generate valid inputs for a program,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 597, + 505, + 609 + ], + "spans": [ + { + "bbox": [ + 106, + 597, + 505, + 609 + ], + "score": 1.0, + "content": "we enforce a constraint on the output value bounding integers to some predetermined range, and then", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 608, + 505, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 505, + 621 + ], + "score": 1.0, + "content": "propagate these constraints backward through the program to obtain a range of valid values for each", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "score": 1.0, + "content": "input. If one of these ranges is empty, we discard the program. Otherwise, input-output pairs can be", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 630, + 505, + 643 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 505, + 643 + ], + "score": 1.0, + "content": "generated by picking inputs from the pre-computed valid ranges and executing the program to obtain", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 641, + 504, + 654 + ], + "spans": [ + { + "bbox": [ + 106, + 641, + 504, + 654 + ], + "score": 1.0, + "content": "the output values. The binary attribute vectors are easily computed from the program source codes.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 553, + 506, + 654 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 666, + 257, + 678 + ], + "lines": [ + { + "bbox": [ + 105, + 665, + 259, + 679 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 259, + 679 + ], + "score": 1.0, + "content": "4.3 MACHINE LEARNING MODEL", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 507, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 507, + 700 + ], + "score": 1.0, + "content": "Observe how the input-output data in Fig. 1 is informative of the functions appearing in the program:", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "the values in the output are all negative, divisible by 4, they are sorted in decreasing order, and they", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "happen to be multiples of numbers appearing in the input. Our aim is to learn to recognize such", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 721, + 506, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 506, + 732 + ], + "score": 1.0, + "content": "patterns in the input-output examples, and to leverage them to predict the presence or absence of", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "individual functions. We employ neural networks to model and learn the mapping from input-output", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 432, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 432, + 106 + ], + "score": 1.0, + "content": "examples to attributes. We can think of these networks as consisting of two parts:", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 41.5, + "bbox_fs": [ + 105, + 687, + 507, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "individual functions. We employ neural networks to model and learn the mapping from input-output", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 432, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 432, + 106 + ], + "score": 1.0, + "content": "examples to attributes. We can think of these networks as consisting of two parts:", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 130, + 114, + 505, + 162 + ], + "lines": [ + { + "bbox": [ + 129, + 113, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 129, + 113, + 346, + 127 + ], + "score": 1.0, + "content": "1. an encoder: a differentiable mapping from a set of", + "type": "text" + }, + { + "bbox": [ + 346, + 114, + 358, + 124 + ], + "score": 0.78, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 113, + 505, + 127 + ], + "score": 1.0, + "content": "input-output examples generated by", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 141, + 125, + 347, + 136 + ], + "spans": [ + { + "bbox": [ + 141, + 125, + 347, + 136 + ], + "score": 1.0, + "content": "a single program to a latent real-valued vector, and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 128, + 138, + 507, + 153 + ], + "spans": [ + { + "bbox": [ + 128, + 138, + 466, + 153 + ], + "score": 1.0, + "content": "2. a decoder: a differentiable mapping from the latent vector representing a set of", + "type": "text" + }, + { + "bbox": [ + 467, + 140, + 479, + 149 + ], + "score": 0.8, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 138, + 507, + 153 + ], + "score": 1.0, + "content": "input-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 142, + 151, + 430, + 163 + ], + "spans": [ + { + "bbox": [ + 142, + 151, + 430, + 163 + ], + "score": 1.0, + "content": "output examples to predictions of the ground truth program’s attributes.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 107, + 170, + 505, + 281 + ], + "lines": [ + { + "bbox": [ + 105, + 169, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 169, + 505, + 183 + ], + "score": 1.0, + "content": "For the encoder we use a simple feed-forward architecture. First, we represent the input and output", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 182, + 506, + 195 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 506, + 195 + ], + "score": 1.0, + "content": "types (singleton or array) by a one-hot-encoding, and we pad the inputs and outputs to a maximum", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 192, + 506, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 134, + 205 + ], + "score": 1.0, + "content": "length", + "type": "text" + }, + { + "bbox": [ + 134, + 193, + 142, + 203 + ], + "score": 0.73, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 192, + 506, + 205 + ], + "score": 1.0, + "content": "with a special NULL value. Second, each integer in the inputs and in the output is mapped", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 203, + 505, + 217 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 261, + 217 + ], + "score": 1.0, + "content": "to a learned embedding vector of size", + "type": "text" + }, + { + "bbox": [ + 261, + 204, + 294, + 214 + ], + "score": 0.89, + "content": "E = 2 0", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 203, + 505, + 217 + ], + "score": 1.0, + "content": ". (The range of integers is restricted to a finite range", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 214, + 506, + 227 + ], + "spans": [ + { + "bbox": [ + 106, + 214, + 506, + 227 + ], + "score": 1.0, + "content": "and each embedding is parametrized individually.) Third, for each input-output example separately,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 226, + 506, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 506, + 239 + ], + "score": 1.0, + "content": "we concatenate the embeddings of the input types, the inputs, the output type, and the output into a", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 237, + 504, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 334, + 249 + ], + "score": 1.0, + "content": "single (fixed-length) vector, and pass this vector through", + "type": "text" + }, + { + "bbox": [ + 335, + 237, + 363, + 247 + ], + "score": 0.9, + "content": "H = 3", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 237, + 465, + 249 + ], + "score": 1.0, + "content": "hidden layers containing", + "type": "text" + }, + { + "bbox": [ + 466, + 237, + 504, + 247 + ], + "score": 0.87, + "content": "K = 2 5 6", + "type": "inline_equation" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 248, + 506, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 248, + 506, + 261 + ], + "score": 1.0, + "content": "sigmoid units each. The third hidden layer thus provides an encoding of each individual input-output", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 258, + 506, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 506, + 272 + ], + "score": 1.0, + "content": "example. Finally, for input-output examples in a set generated from the same program, we pool these", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 270, + 469, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 469, + 282 + ], + "score": 1.0, + "content": "representations together by simple arithmetic averaging. See Appendix C for more details.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 107, + 286, + 505, + 330 + ], + "lines": [ + { + "bbox": [ + 105, + 285, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 505, + 299 + ], + "score": 1.0, + "content": "The advantage of this encoder lies in its simplicity, and we found it reasonably easy to train. A", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 297, + 506, + 310 + ], + "spans": [ + { + "bbox": [ + 105, + 297, + 295, + 310 + ], + "score": 1.0, + "content": "disadvantage is that it requires an upper bound", + "type": "text" + }, + { + "bbox": [ + 296, + 298, + 304, + 307 + ], + "score": 0.78, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 297, + 506, + 310 + ], + "score": 1.0, + "content": "on the length of arrays appearing in the input and", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 309, + 504, + 320 + ], + "spans": [ + { + "bbox": [ + 106, + 309, + 504, + 320 + ], + "score": 1.0, + "content": "output. We confirmed that the chosen encoder architecture is sensible in that it performs empirically", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 319, + 507, + 331 + ], + "spans": [ + { + "bbox": [ + 106, + 319, + 507, + 331 + ], + "score": 1.0, + "content": "at least as well as an RNN encoder, a natural baseline, which may however be more difficult to train.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 106, + 335, + 505, + 414 + ], + "lines": [ + { + "bbox": [ + 105, + 335, + 506, + 349 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 506, + 349 + ], + "score": 1.0, + "content": "DeepCoder learns to predict presence or absence of individual functions of the DSL. We shall see", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 347, + 506, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 506, + 360 + ], + "score": 1.0, + "content": "this can already be exploited by various search techniques to large computational gains. We use a", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 357, + 506, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 418, + 371 + ], + "score": 1.0, + "content": "decoder that pre-multiplies the encoding of input-output examples by a learned", + "type": "text" + }, + { + "bbox": [ + 418, + 358, + 447, + 369 + ], + "score": 0.9, + "content": "C \\times K", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 357, + 506, + 371 + ], + "score": 1.0, + "content": "matrix, where", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 368, + 505, + 382 + ], + "spans": [ + { + "bbox": [ + 106, + 369, + 140, + 379 + ], + "score": 0.9, + "content": "C = 3 4", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 368, + 505, + 382 + ], + "score": 1.0, + "content": "is the number of functions in our DSL (higher-order functions and lambdas are predicted", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 379, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 262, + 392 + ], + "score": 1.0, + "content": "independently), and treats the resulting", + "type": "text" + }, + { + "bbox": [ + 262, + 380, + 271, + 390 + ], + "score": 0.81, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 379, + 505, + 392 + ], + "score": 1.0, + "content": "numbers as log-unnormalized probabilities (logits) of each", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 390, + 506, + 404 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 506, + 404 + ], + "score": 1.0, + "content": "function appearing in the source code. Fig. 2 shows the predictions a trained neural network made", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 402, + 359, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 402, + 359, + 415 + ], + "score": 1.0, + "content": "from 5 input-output examples for the program shown in Fig. 1.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 23 + }, + { + "type": "image", + "bbox": [ + 111, + 427, + 500, + 466 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 111, + 427, + 500, + 466 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 111, + 427, + 500, + 466 + ], + "spans": [ + { + "bbox": [ + 111, + 427, + 500, + 466 + ], + "score": 0.948, + "type": "image", + "image_path": "c3c080b2a8813d24f061fe69fe44372e58ba574c230d52185f026a848a7215ca.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 111, + 427, + 500, + 440.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 111, + 440.0, + 500, + 453.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 111, + 453.0, + 500, + 466.0 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 110, + 478, + 497, + 490 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 113, + 476, + 497, + 492 + ], + "spans": [ + { + "bbox": [ + 113, + 476, + 497, + 492 + ], + "score": 1.0, + "content": "Figure 2: Neural network predicts the probability of each function appearing in the source code.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + } + ], + "index": 29.0 + }, + { + "type": "title", + "bbox": [ + 107, + 509, + 167, + 520 + ], + "lines": [ + { + "bbox": [ + 105, + 509, + 169, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 169, + 521 + ], + "score": 1.0, + "content": "4.4 SEARCH", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 530, + 505, + 563 + ], + "lines": [ + { + "bbox": [ + 105, + 529, + 505, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 505, + 543 + ], + "score": 1.0, + "content": "One of the central ideas of this work is to use a neural network to guide the search for a program", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 541, + 506, + 553 + ], + "spans": [ + { + "bbox": [ + 106, + 541, + 506, + 553 + ], + "score": 1.0, + "content": "consistent with a set of input-output examples instead of directly predicting the entire source code.", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 551, + 503, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 503, + 565 + ], + "score": 1.0, + "content": "This section briefly describes the search techniques and how they integrate the predicted attributes.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 574, + 505, + 619 + ], + "lines": [ + { + "bbox": [ + 105, + 574, + 506, + 588 + ], + "spans": [ + { + "bbox": [ + 105, + 574, + 506, + 588 + ], + "score": 1.0, + "content": "Depth-first search (DFS). We use an optimized version of DFS to search over programs with a", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 586, + 506, + 598 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 200, + 598 + ], + "score": 1.0, + "content": "given maximum length", + "type": "text" + }, + { + "bbox": [ + 200, + 587, + 209, + 596 + ], + "score": 0.77, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 586, + 506, + 598 + ], + "score": 1.0, + "content": "(see Appendix D for details). When the search procedure extends a partial", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 597, + 505, + 609 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 505, + 609 + ], + "score": 1.0, + "content": "program by a new function, it has to try the functions in the DSL in some order. At this point DFS", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 609, + 506, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 506, + 620 + ], + "score": 1.0, + "content": "can opt to consider the functions as ordered by their predicted probabilities from the neural network.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36.5 + }, + { + "type": "text", + "bbox": [ + 107, + 631, + 505, + 698 + ], + "lines": [ + { + "bbox": [ + 106, + 630, + 505, + 644 + ], + "spans": [ + { + "bbox": [ + 106, + 630, + 505, + 644 + ], + "score": 1.0, + "content": "“Sort and add” enumeration. A stronger way of utilizing the predicted probabilities of functions", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 642, + 505, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 642, + 505, + 654 + ], + "score": 1.0, + "content": "in an enumerative search procedure is to use a Sort and add scheme, which maintains a set of active", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 654, + 505, + 665 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 505, + 665 + ], + "score": 1.0, + "content": "functions and performs DFS with the active function set only. Whenever the search fails, the next", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 664, + 506, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 506, + 677 + ], + "score": 1.0, + "content": "most probable function (or several) are added to the active set and the search restarts with this larger", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 675, + 505, + 688 + ], + "spans": [ + { + "bbox": [ + 105, + 675, + 505, + 688 + ], + "score": 1.0, + "content": "active set. Note that this scheme has the deficiency of potentially re-exploring some parts of the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 687, + 482, + 698 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 482, + 698 + ], + "score": 1.0, + "content": "search space several times, which could be avoided by a more sophisticated search procedure.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 41.5 + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "Sketch. Sketch (Solar-Lezama, 2008) is a successful SMT-based program synthesis tool from the", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "programming languages research community. While its main use case is to synthesize programs", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45.5 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 505, + 106 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 130, + 114, + 505, + 162 + ], + "lines": [ + { + "bbox": [ + 129, + 113, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 129, + 113, + 346, + 127 + ], + "score": 1.0, + "content": "1. an encoder: a differentiable mapping from a set of", + "type": "text" + }, + { + "bbox": [ + 346, + 114, + 358, + 124 + ], + "score": 0.78, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 113, + 505, + 127 + ], + "score": 1.0, + "content": "input-output examples generated by", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 141, + 125, + 347, + 136 + ], + "spans": [ + { + "bbox": [ + 141, + 125, + 347, + 136 + ], + "score": 1.0, + "content": "a single program to a latent real-valued vector, and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 128, + 138, + 507, + 153 + ], + "spans": [ + { + "bbox": [ + 128, + 138, + 466, + 153 + ], + "score": 1.0, + "content": "2. a decoder: a differentiable mapping from the latent vector representing a set of", + "type": "text" + }, + { + "bbox": [ + 467, + 140, + 479, + 149 + ], + "score": 0.8, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 138, + 507, + 153 + ], + "score": 1.0, + "content": "input-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 142, + 151, + 430, + 163 + ], + "spans": [ + { + "bbox": [ + 142, + 151, + 430, + 163 + ], + "score": 1.0, + "content": "output examples to predictions of the ground truth program’s attributes.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5, + "bbox_fs": [ + 128, + 113, + 507, + 163 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 170, + 505, + 281 + ], + "lines": [ + { + "bbox": [ + 105, + 169, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 169, + 505, + 183 + ], + "score": 1.0, + "content": "For the encoder we use a simple feed-forward architecture. First, we represent the input and output", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 182, + 506, + 195 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 506, + 195 + ], + "score": 1.0, + "content": "types (singleton or array) by a one-hot-encoding, and we pad the inputs and outputs to a maximum", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 192, + 506, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 134, + 205 + ], + "score": 1.0, + "content": "length", + "type": "text" + }, + { + "bbox": [ + 134, + 193, + 142, + 203 + ], + "score": 0.73, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 192, + 506, + 205 + ], + "score": 1.0, + "content": "with a special NULL value. Second, each integer in the inputs and in the output is mapped", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 203, + 505, + 217 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 261, + 217 + ], + "score": 1.0, + "content": "to a learned embedding vector of size", + "type": "text" + }, + { + "bbox": [ + 261, + 204, + 294, + 214 + ], + "score": 0.89, + "content": "E = 2 0", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 203, + 505, + 217 + ], + "score": 1.0, + "content": ". (The range of integers is restricted to a finite range", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 214, + 506, + 227 + ], + "spans": [ + { + "bbox": [ + 106, + 214, + 506, + 227 + ], + "score": 1.0, + "content": "and each embedding is parametrized individually.) Third, for each input-output example separately,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 226, + 506, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 506, + 239 + ], + "score": 1.0, + "content": "we concatenate the embeddings of the input types, the inputs, the output type, and the output into a", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 237, + 504, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 334, + 249 + ], + "score": 1.0, + "content": "single (fixed-length) vector, and pass this vector through", + "type": "text" + }, + { + "bbox": [ + 335, + 237, + 363, + 247 + ], + "score": 0.9, + "content": "H = 3", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 237, + 465, + 249 + ], + "score": 1.0, + "content": "hidden layers containing", + "type": "text" + }, + { + "bbox": [ + 466, + 237, + 504, + 247 + ], + "score": 0.87, + "content": "K = 2 5 6", + "type": "inline_equation" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 248, + 506, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 248, + 506, + 261 + ], + "score": 1.0, + "content": "sigmoid units each. The third hidden layer thus provides an encoding of each individual input-output", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 258, + 506, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 506, + 272 + ], + "score": 1.0, + "content": "example. Finally, for input-output examples in a set generated from the same program, we pool these", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 270, + 469, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 469, + 282 + ], + "score": 1.0, + "content": "representations together by simple arithmetic averaging. See Appendix C for more details.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 169, + 506, + 282 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 286, + 505, + 330 + ], + "lines": [ + { + "bbox": [ + 105, + 285, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 505, + 299 + ], + "score": 1.0, + "content": "The advantage of this encoder lies in its simplicity, and we found it reasonably easy to train. A", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 297, + 506, + 310 + ], + "spans": [ + { + "bbox": [ + 105, + 297, + 295, + 310 + ], + "score": 1.0, + "content": "disadvantage is that it requires an upper bound", + "type": "text" + }, + { + "bbox": [ + 296, + 298, + 304, + 307 + ], + "score": 0.78, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 297, + 506, + 310 + ], + "score": 1.0, + "content": "on the length of arrays appearing in the input and", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 309, + 504, + 320 + ], + "spans": [ + { + "bbox": [ + 106, + 309, + 504, + 320 + ], + "score": 1.0, + "content": "output. We confirmed that the chosen encoder architecture is sensible in that it performs empirically", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 319, + 507, + 331 + ], + "spans": [ + { + "bbox": [ + 106, + 319, + 507, + 331 + ], + "score": 1.0, + "content": "at least as well as an RNN encoder, a natural baseline, which may however be more difficult to train.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 285, + 507, + 331 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 335, + 505, + 414 + ], + "lines": [ + { + "bbox": [ + 105, + 335, + 506, + 349 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 506, + 349 + ], + "score": 1.0, + "content": "DeepCoder learns to predict presence or absence of individual functions of the DSL. We shall see", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 347, + 506, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 506, + 360 + ], + "score": 1.0, + "content": "this can already be exploited by various search techniques to large computational gains. We use a", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 357, + 506, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 418, + 371 + ], + "score": 1.0, + "content": "decoder that pre-multiplies the encoding of input-output examples by a learned", + "type": "text" + }, + { + "bbox": [ + 418, + 358, + 447, + 369 + ], + "score": 0.9, + "content": "C \\times K", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 357, + 506, + 371 + ], + "score": 1.0, + "content": "matrix, where", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 368, + 505, + 382 + ], + "spans": [ + { + "bbox": [ + 106, + 369, + 140, + 379 + ], + "score": 0.9, + "content": "C = 3 4", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 368, + 505, + 382 + ], + "score": 1.0, + "content": "is the number of functions in our DSL (higher-order functions and lambdas are predicted", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 379, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 262, + 392 + ], + "score": 1.0, + "content": "independently), and treats the resulting", + "type": "text" + }, + { + "bbox": [ + 262, + 380, + 271, + 390 + ], + "score": 0.81, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 379, + 505, + 392 + ], + "score": 1.0, + "content": "numbers as log-unnormalized probabilities (logits) of each", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 390, + 506, + 404 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 506, + 404 + ], + "score": 1.0, + "content": "function appearing in the source code. Fig. 2 shows the predictions a trained neural network made", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 402, + 359, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 402, + 359, + 415 + ], + "score": 1.0, + "content": "from 5 input-output examples for the program shown in Fig. 1.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 335, + 506, + 415 + ] + }, + { + "type": "image", + "bbox": [ + 111, + 427, + 500, + 466 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 111, + 427, + 500, + 466 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 111, + 427, + 500, + 466 + ], + "spans": [ + { + "bbox": [ + 111, + 427, + 500, + 466 + ], + "score": 0.948, + "type": "image", + "image_path": "c3c080b2a8813d24f061fe69fe44372e58ba574c230d52185f026a848a7215ca.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 111, + 427, + 500, + 440.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 111, + 440.0, + 500, + 453.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 111, + 453.0, + 500, + 466.0 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 110, + 478, + 497, + 490 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 113, + 476, + 497, + 492 + ], + "spans": [ + { + "bbox": [ + 113, + 476, + 497, + 492 + ], + "score": 1.0, + "content": "Figure 2: Neural network predicts the probability of each function appearing in the source code.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + } + ], + "index": 29.0 + }, + { + "type": "title", + "bbox": [ + 107, + 509, + 167, + 520 + ], + "lines": [ + { + "bbox": [ + 105, + 509, + 169, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 169, + 521 + ], + "score": 1.0, + "content": "4.4 SEARCH", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 530, + 505, + 563 + ], + "lines": [ + { + "bbox": [ + 105, + 529, + 505, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 505, + 543 + ], + "score": 1.0, + "content": "One of the central ideas of this work is to use a neural network to guide the search for a program", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 541, + 506, + 553 + ], + "spans": [ + { + "bbox": [ + 106, + 541, + 506, + 553 + ], + "score": 1.0, + "content": "consistent with a set of input-output examples instead of directly predicting the entire source code.", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 551, + 503, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 503, + 565 + ], + "score": 1.0, + "content": "This section briefly describes the search techniques and how they integrate the predicted attributes.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33, + "bbox_fs": [ + 105, + 529, + 506, + 565 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 574, + 505, + 619 + ], + "lines": [ + { + "bbox": [ + 105, + 574, + 506, + 588 + ], + "spans": [ + { + "bbox": [ + 105, + 574, + 506, + 588 + ], + "score": 1.0, + "content": "Depth-first search (DFS). We use an optimized version of DFS to search over programs with a", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 586, + 506, + 598 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 200, + 598 + ], + "score": 1.0, + "content": "given maximum length", + "type": "text" + }, + { + "bbox": [ + 200, + 587, + 209, + 596 + ], + "score": 0.77, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 586, + 506, + 598 + ], + "score": 1.0, + "content": "(see Appendix D for details). When the search procedure extends a partial", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 597, + 505, + 609 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 505, + 609 + ], + "score": 1.0, + "content": "program by a new function, it has to try the functions in the DSL in some order. At this point DFS", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 609, + 506, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 506, + 620 + ], + "score": 1.0, + "content": "can opt to consider the functions as ordered by their predicted probabilities from the neural network.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 574, + 506, + 620 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 631, + 505, + 698 + ], + "lines": [ + { + "bbox": [ + 106, + 630, + 505, + 644 + ], + "spans": [ + { + "bbox": [ + 106, + 630, + 505, + 644 + ], + "score": 1.0, + "content": "“Sort and add” enumeration. A stronger way of utilizing the predicted probabilities of functions", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 642, + 505, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 642, + 505, + 654 + ], + "score": 1.0, + "content": "in an enumerative search procedure is to use a Sort and add scheme, which maintains a set of active", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 654, + 505, + 665 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 505, + 665 + ], + "score": 1.0, + "content": "functions and performs DFS with the active function set only. Whenever the search fails, the next", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 664, + 506, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 506, + 677 + ], + "score": 1.0, + "content": "most probable function (or several) are added to the active set and the search restarts with this larger", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 675, + 505, + 688 + ], + "spans": [ + { + "bbox": [ + 105, + 675, + 505, + 688 + ], + "score": 1.0, + "content": "active set. Note that this scheme has the deficiency of potentially re-exploring some parts of the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 687, + 482, + 698 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 482, + 698 + ], + "score": 1.0, + "content": "search space several times, which could be avoided by a more sophisticated search procedure.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 41.5, + "bbox_fs": [ + 105, + 630, + 506, + 698 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "Sketch. Sketch (Solar-Lezama, 2008) is a successful SMT-based program synthesis tool from the", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "programming languages research community. While its main use case is to synthesize programs", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "by filling in “holes” in incomplete source code so as to match specified requirements, it is flexible", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "enough for our use case as well. The function in each step and its arguments can be treated as", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "the “holes”, and the requirement to be satisfied is consistency with the provided set of input-output", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 127 + ], + "score": 1.0, + "content": "examples. Sketch can utilize the neural network predictions in a Sort and add scheme as described", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 466, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 466, + 139 + ], + "score": 1.0, + "content": "above, as the possibilities for each function hole can be restricted to the current active set.", + "type": "text", + "cross_page": true + } + ], + "index": 4 + } + ], + "index": 45.5, + "bbox_fs": [ + 105, + 708, + 505, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 137 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "by filling in “holes” in incomplete source code so as to match specified requirements, it is flexible", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "enough for our use case as well. The function in each step and its arguments can be treated as", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "the “holes”, and the requirement to be satisfied is consistency with the provided set of input-output", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 127 + ], + "score": 1.0, + "content": "examples. Sketch can utilize the neural network predictions in a Sort and add scheme as described", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 466, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 466, + 139 + ], + "score": 1.0, + "content": "above, as the possibilities for each function hole can be restricted to the current active set.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 107, + 149, + 505, + 205 + ], + "lines": [ + { + "bbox": [ + 106, + 148, + 505, + 163 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 118, + 160 + ], + "score": 0.81, + "content": "\\lambda ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 119, + 148, + 131, + 163 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 132, + 149, + 144, + 160 + ], + "score": 0.85, + "content": "\\lambda ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 148, + 505, + 163 + ], + "score": 1.0, + "content": "(Feser et al., 2015) is a program synthesis tool from the programming languages community", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 161, + 505, + 173 + ], + "spans": [ + { + "bbox": [ + 106, + 161, + 505, + 173 + ], + "score": 1.0, + "content": "that combines enumerative search with deduction to prune the search space. It is designed to infer", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 170, + 505, + 186 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 505, + 186 + ], + "score": 1.0, + "content": "small functional programs for data structure manipulation from input-output examples, by combining", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 181, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 243, + 196 + ], + "score": 1.0, + "content": "functions from a provided library.", + "type": "text" + }, + { + "bbox": [ + 244, + 182, + 255, + 192 + ], + "score": 0.86, + "content": "\\lambda ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 181, + 505, + 196 + ], + "score": 1.0, + "content": "can be used in our framework using a Sort and add scheme as", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 193, + 496, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 193, + 496, + 207 + ], + "score": 1.0, + "content": "described above by choosing the library of functions according to the neural network predictions.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7 + }, + { + "type": "title", + "bbox": [ + 108, + 218, + 248, + 229 + ], + "lines": [ + { + "bbox": [ + 106, + 218, + 250, + 231 + ], + "spans": [ + { + "bbox": [ + 106, + 218, + 250, + 231 + ], + "score": 1.0, + "content": "4.5 TRAINING LOSS FUNCTION", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 106, + 239, + 505, + 316 + ], + "lines": [ + { + "bbox": [ + 106, + 239, + 505, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 505, + 252 + ], + "score": 1.0, + "content": "We use the negative cross entropy loss to train the neural network described in Sect. 4.3, so that its", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 249, + 506, + 262 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 506, + 262 + ], + "score": 1.0, + "content": "predictions about each function can be interpreted as marginal probabilities. The LIPS framework", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 261, + 506, + 274 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 175, + 274 + ], + "score": 1.0, + "content": "dictates learning", + "type": "text" + }, + { + "bbox": [ + 176, + 261, + 210, + 273 + ], + "score": 0.93, + "content": "q ( \\pmb { a } \\mid \\mathcal { E } )", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 261, + 362, + 274 + ], + "score": 1.0, + "content": ", the joint distribution of all attributes", + "type": "text" + }, + { + "bbox": [ + 363, + 263, + 370, + 271 + ], + "score": 0.7, + "content": "\\textbf { \\em a }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 261, + 506, + 274 + ], + "score": 1.0, + "content": "given the input-output examples,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 271, + 507, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 271, + 507, + 285 + ], + "score": 1.0, + "content": "and it is not clear a priori how much DeepCoder loses by ignoring correlations between functions.", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 283, + 504, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 283, + 495, + 295 + ], + "score": 1.0, + "content": "However, under the simplifying assumption that the runtime of searching for a program of length", + "type": "text" + }, + { + "bbox": [ + 495, + 284, + 504, + 293 + ], + "score": 0.76, + "content": "T", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 292, + 506, + 307 + ], + "spans": [ + { + "bbox": [ + 104, + 292, + 126, + 307 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 127, + 294, + 136, + 304 + ], + "score": 0.8, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 136, + 292, + 390, + 307 + ], + "score": 1.0, + "content": "functions made available to a search routine is proportional to", + "type": "text" + }, + { + "bbox": [ + 390, + 293, + 405, + 304 + ], + "score": 0.89, + "content": "\\check { C } ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 292, + 506, + 307 + ], + "score": 1.0, + "content": ", the following result for", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 304, + 492, + 317 + ], + "spans": [ + { + "bbox": [ + 105, + 304, + 492, + 317 + ], + "score": 1.0, + "content": "Sort and add procedures shows that their runtime can be optimized using marginal probabilities.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 319, + 503, + 352 + ], + "lines": [ + { + "bbox": [ + 105, + 318, + 505, + 332 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 279, + 332 + ], + "score": 1.0, + "content": "Lemma 1. For any fixed program length", + "type": "text" + }, + { + "bbox": [ + 279, + 320, + 287, + 329 + ], + "score": 0.48, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 318, + 505, + 332 + ], + "score": 1.0, + "content": ", the expected total runtime of a Sort and add search", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 330, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 505, + 343 + ], + "score": 1.0, + "content": "scheme can be upper bounded by a quantity that is minimized by adding the functions in the order of", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 342, + 265, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 342, + 265, + 354 + ], + "score": 1.0, + "content": "decreasing true marginal probabilities.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 365, + 505, + 442 + ], + "lines": [ + { + "bbox": [ + 105, + 365, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 506, + 378 + ], + "score": 1.0, + "content": "Proof. Predicting source code functions from input-output examples can be seen as a multi-label", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 376, + 506, + 389 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 506, + 389 + ], + "score": 1.0, + "content": "classification problem, where each set of input-output examples is associated with a set of relevant", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 387, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 505, + 399 + ], + "score": 1.0, + "content": "labels (functions appearing in the ground truth source code). Dembczynski et al. (2010) showed", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 399, + 505, + 410 + ], + "spans": [ + { + "bbox": [ + 106, + 399, + 505, + 410 + ], + "score": 1.0, + "content": "that in multi-label classification under a so-called Rank loss, it is Bayes optimal to rank the labels", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 409, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 409, + 392, + 421 + ], + "score": 1.0, + "content": "according to their marginal probabilities. If the runtime of search with", + "type": "text" + }, + { + "bbox": [ + 393, + 410, + 402, + 419 + ], + "score": 0.79, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 409, + 505, + 421 + ], + "score": 1.0, + "content": "functions is proportional", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 418, + 506, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 418, + 117, + 433 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 117, + 419, + 132, + 430 + ], + "score": 0.88, + "content": "C ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 418, + 506, + 433 + ], + "score": 1.0, + "content": ", the total runtime of a Sort and add procedure can be monotonically transformed so that it is", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 431, + 505, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 378, + 443 + ], + "score": 1.0, + "content": "upper bounded by this Rank loss. See Appendix E for more details.", + "type": "text" + }, + { + "bbox": [ + 495, + 432, + 505, + 441 + ], + "score": 0.999, + "content": "□", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 24 + }, + { + "type": "title", + "bbox": [ + 108, + 458, + 200, + 471 + ], + "lines": [ + { + "bbox": [ + 104, + 456, + 202, + 473 + ], + "spans": [ + { + "bbox": [ + 104, + 456, + 202, + 473 + ], + "score": 1.0, + "content": "5 EXPERIMENTS", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 483, + 505, + 527 + ], + "lines": [ + { + "bbox": [ + 105, + 483, + 507, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 507, + 496 + ], + "score": 1.0, + "content": "In this section we report results from two categories of experiments. Our main experiments (Sect. 5.1)", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 493, + 507, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 493, + 507, + 506 + ], + "score": 1.0, + "content": "show that the LIPS framework can lead to significant performance gains in solving IPS by demon-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 504, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 506, + 518 + ], + "score": 1.0, + "content": "strating such gains with DeepCoder. In Sect. 5.2 we illustrate the robustness of the method by", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 516, + 466, + 528 + ], + "spans": [ + { + "bbox": [ + 106, + 516, + 466, + 528 + ], + "score": 1.0, + "content": "demonstrating a strong kind of generalization ability across programs of different lengths.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5 + }, + { + "type": "title", + "bbox": [ + 108, + 540, + 302, + 551 + ], + "lines": [ + { + "bbox": [ + 106, + 540, + 303, + 553 + ], + "spans": [ + { + "bbox": [ + 106, + 540, + 303, + 553 + ], + "score": 1.0, + "content": "5.1 DEEPCODER COMPARED TO BASELINES", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 561, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 560, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 505, + 574 + ], + "score": 1.0, + "content": "We trained a neural network as described in Sect. 4.3 to predict used functions from input-output", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 254, + 585 + ], + "score": 1.0, + "content": "examples and constructed a test set of", + "type": "text" + }, + { + "bbox": [ + 255, + 572, + 291, + 583 + ], + "score": 0.89, + "content": "P = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "programs, guaranteed to be semantically disjoint from", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "all programs on which the neural network was trained (similarly to the equivalence check described", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 592, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 592, + 505, + 608 + ], + "score": 1.0, + "content": "in Sect. 4.2, we have ensured that all test programs behave differently from all programs used during", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 604, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 379, + 617 + ], + "score": 1.0, + "content": "training on at least one input). For each test program we generated", + "type": "text" + }, + { + "bbox": [ + 379, + 605, + 411, + 615 + ], + "score": 0.9, + "content": "M = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 604, + 505, + 617 + ], + "score": 1.0, + "content": "input-output examples", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 616, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 506, + 628 + ], + "score": 1.0, + "content": "involving integers of magnitudes up to 256, passed the examples to the trained neural network, and", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "fed the obtained predictions to the search procedures from Sect. 4.4. We also considered a RNN-based", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "score": 1.0, + "content": "decoder generating programs using beam search (see Sect. 5.3 for details). To evaluate DeepCoder,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 649, + 504, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 492, + 661 + ], + "score": 1.0, + "content": "we then recorded the time the search procedures needed to find a program consistent with the", + "type": "text" + }, + { + "bbox": [ + 492, + 649, + 504, + 659 + ], + "score": 0.66, + "content": "M", + "type": "inline_equation" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 660, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 505, + 672 + ], + "score": 1.0, + "content": "input-output examples. As a baseline, we also ran all search procedures using a simple prior as", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 671, + 442, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 442, + 684 + ], + "score": 1.0, + "content": "function probabilities, computed from their global incidence in the program corpus.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 108, + 687, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 368, + 700 + ], + "score": 1.0, + "content": "In the first, smaller-scale experiment (program search space size", + "type": "text" + }, + { + "bbox": [ + 369, + 687, + 413, + 698 + ], + "score": 0.91, + "content": "\\sim 2 \\times 1 0 ^ { 6 }", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 687, + 506, + 700 + ], + "score": 1.0, + "content": ") we trained the neural", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 231, + 711 + ], + "score": 1.0, + "content": "network on programs of length", + "type": "text" + }, + { + "bbox": [ + 231, + 701, + 257, + 709 + ], + "score": 0.88, + "content": "T = 3", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 699, + 505, + 711 + ], + "score": 1.0, + "content": ", and the test programs were of the same length. Table 1 shows", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "the per-task timeout required such that a solution could be found for given proportions of the test", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 720, + 505, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 505, + 732 + ], + "score": 1.0, + "content": "tasks (in time less than or equal to the timeout). For example, in a hypothetical test set with 4 tasks", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 46.5 + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "6", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 137 + ], + "lines": [], + "index": 2, + "bbox_fs": [ + 105, + 82, + 505, + 139 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 149, + 505, + 205 + ], + "lines": [ + { + "bbox": [ + 106, + 148, + 505, + 163 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 118, + 160 + ], + "score": 0.81, + "content": "\\lambda ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 119, + 148, + 131, + 163 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 132, + 149, + 144, + 160 + ], + "score": 0.85, + "content": "\\lambda ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 148, + 505, + 163 + ], + "score": 1.0, + "content": "(Feser et al., 2015) is a program synthesis tool from the programming languages community", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 161, + 505, + 173 + ], + "spans": [ + { + "bbox": [ + 106, + 161, + 505, + 173 + ], + "score": 1.0, + "content": "that combines enumerative search with deduction to prune the search space. It is designed to infer", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 170, + 505, + 186 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 505, + 186 + ], + "score": 1.0, + "content": "small functional programs for data structure manipulation from input-output examples, by combining", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 181, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 243, + 196 + ], + "score": 1.0, + "content": "functions from a provided library.", + "type": "text" + }, + { + "bbox": [ + 244, + 182, + 255, + 192 + ], + "score": 0.86, + "content": "\\lambda ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 181, + 505, + 196 + ], + "score": 1.0, + "content": "can be used in our framework using a Sort and add scheme as", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 193, + 496, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 193, + 496, + 207 + ], + "score": 1.0, + "content": "described above by choosing the library of functions according to the neural network predictions.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 148, + 505, + 207 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 218, + 248, + 229 + ], + "lines": [ + { + "bbox": [ + 106, + 218, + 250, + 231 + ], + "spans": [ + { + "bbox": [ + 106, + 218, + 250, + 231 + ], + "score": 1.0, + "content": "4.5 TRAINING LOSS FUNCTION", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 106, + 239, + 505, + 316 + ], + "lines": [ + { + "bbox": [ + 106, + 239, + 505, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 505, + 252 + ], + "score": 1.0, + "content": "We use the negative cross entropy loss to train the neural network described in Sect. 4.3, so that its", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 249, + 506, + 262 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 506, + 262 + ], + "score": 1.0, + "content": "predictions about each function can be interpreted as marginal probabilities. The LIPS framework", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 261, + 506, + 274 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 175, + 274 + ], + "score": 1.0, + "content": "dictates learning", + "type": "text" + }, + { + "bbox": [ + 176, + 261, + 210, + 273 + ], + "score": 0.93, + "content": "q ( \\pmb { a } \\mid \\mathcal { E } )", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 261, + 362, + 274 + ], + "score": 1.0, + "content": ", the joint distribution of all attributes", + "type": "text" + }, + { + "bbox": [ + 363, + 263, + 370, + 271 + ], + "score": 0.7, + "content": "\\textbf { \\em a }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 261, + 506, + 274 + ], + "score": 1.0, + "content": "given the input-output examples,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 271, + 507, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 271, + 507, + 285 + ], + "score": 1.0, + "content": "and it is not clear a priori how much DeepCoder loses by ignoring correlations between functions.", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 283, + 504, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 283, + 495, + 295 + ], + "score": 1.0, + "content": "However, under the simplifying assumption that the runtime of searching for a program of length", + "type": "text" + }, + { + "bbox": [ + 495, + 284, + 504, + 293 + ], + "score": 0.76, + "content": "T", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 292, + 506, + 307 + ], + "spans": [ + { + "bbox": [ + 104, + 292, + 126, + 307 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 127, + 294, + 136, + 304 + ], + "score": 0.8, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 136, + 292, + 390, + 307 + ], + "score": 1.0, + "content": "functions made available to a search routine is proportional to", + "type": "text" + }, + { + "bbox": [ + 390, + 293, + 405, + 304 + ], + "score": 0.89, + "content": "\\check { C } ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 292, + 506, + 307 + ], + "score": 1.0, + "content": ", the following result for", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 304, + 492, + 317 + ], + "spans": [ + { + "bbox": [ + 105, + 304, + 492, + 317 + ], + "score": 1.0, + "content": "Sort and add procedures shows that their runtime can be optimized using marginal probabilities.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14, + "bbox_fs": [ + 104, + 239, + 507, + 317 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 319, + 503, + 352 + ], + "lines": [ + { + "bbox": [ + 105, + 318, + 505, + 332 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 279, + 332 + ], + "score": 1.0, + "content": "Lemma 1. For any fixed program length", + "type": "text" + }, + { + "bbox": [ + 279, + 320, + 287, + 329 + ], + "score": 0.48, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 318, + 505, + 332 + ], + "score": 1.0, + "content": ", the expected total runtime of a Sort and add search", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 330, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 505, + 343 + ], + "score": 1.0, + "content": "scheme can be upper bounded by a quantity that is minimized by adding the functions in the order of", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 342, + 265, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 342, + 265, + 354 + ], + "score": 1.0, + "content": "decreasing true marginal probabilities.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 105, + 318, + 505, + 354 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 365, + 505, + 442 + ], + "lines": [ + { + "bbox": [ + 105, + 365, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 506, + 378 + ], + "score": 1.0, + "content": "Proof. Predicting source code functions from input-output examples can be seen as a multi-label", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 376, + 506, + 389 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 506, + 389 + ], + "score": 1.0, + "content": "classification problem, where each set of input-output examples is associated with a set of relevant", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 387, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 505, + 399 + ], + "score": 1.0, + "content": "labels (functions appearing in the ground truth source code). Dembczynski et al. (2010) showed", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 399, + 505, + 410 + ], + "spans": [ + { + "bbox": [ + 106, + 399, + 505, + 410 + ], + "score": 1.0, + "content": "that in multi-label classification under a so-called Rank loss, it is Bayes optimal to rank the labels", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 409, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 409, + 392, + 421 + ], + "score": 1.0, + "content": "according to their marginal probabilities. If the runtime of search with", + "type": "text" + }, + { + "bbox": [ + 393, + 410, + 402, + 419 + ], + "score": 0.79, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 409, + 505, + 421 + ], + "score": 1.0, + "content": "functions is proportional", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 418, + 506, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 418, + 117, + 433 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 117, + 419, + 132, + 430 + ], + "score": 0.88, + "content": "C ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 418, + 506, + 433 + ], + "score": 1.0, + "content": ", the total runtime of a Sort and add procedure can be monotonically transformed so that it is", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 431, + 505, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 378, + 443 + ], + "score": 1.0, + "content": "upper bounded by this Rank loss. See Appendix E for more details.", + "type": "text" + }, + { + "bbox": [ + 495, + 432, + 505, + 441 + ], + "score": 0.999, + "content": "□", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 365, + 506, + 443 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 458, + 200, + 471 + ], + "lines": [ + { + "bbox": [ + 104, + 456, + 202, + 473 + ], + "spans": [ + { + "bbox": [ + 104, + 456, + 202, + 473 + ], + "score": 1.0, + "content": "5 EXPERIMENTS", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 483, + 505, + 527 + ], + "lines": [ + { + "bbox": [ + 105, + 483, + 507, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 507, + 496 + ], + "score": 1.0, + "content": "In this section we report results from two categories of experiments. Our main experiments (Sect. 5.1)", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 493, + 507, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 493, + 507, + 506 + ], + "score": 1.0, + "content": "show that the LIPS framework can lead to significant performance gains in solving IPS by demon-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 504, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 506, + 518 + ], + "score": 1.0, + "content": "strating such gains with DeepCoder. In Sect. 5.2 we illustrate the robustness of the method by", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 516, + 466, + 528 + ], + "spans": [ + { + "bbox": [ + 106, + 516, + 466, + 528 + ], + "score": 1.0, + "content": "demonstrating a strong kind of generalization ability across programs of different lengths.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 483, + 507, + 528 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 540, + 302, + 551 + ], + "lines": [ + { + "bbox": [ + 106, + 540, + 303, + 553 + ], + "spans": [ + { + "bbox": [ + 106, + 540, + 303, + 553 + ], + "score": 1.0, + "content": "5.1 DEEPCODER COMPARED TO BASELINES", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 561, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 560, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 505, + 574 + ], + "score": 1.0, + "content": "We trained a neural network as described in Sect. 4.3 to predict used functions from input-output", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 254, + 585 + ], + "score": 1.0, + "content": "examples and constructed a test set of", + "type": "text" + }, + { + "bbox": [ + 255, + 572, + 291, + 583 + ], + "score": 0.89, + "content": "P = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "programs, guaranteed to be semantically disjoint from", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "all programs on which the neural network was trained (similarly to the equivalence check described", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 592, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 592, + 505, + 608 + ], + "score": 1.0, + "content": "in Sect. 4.2, we have ensured that all test programs behave differently from all programs used during", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 604, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 379, + 617 + ], + "score": 1.0, + "content": "training on at least one input). For each test program we generated", + "type": "text" + }, + { + "bbox": [ + 379, + 605, + 411, + 615 + ], + "score": 0.9, + "content": "M = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 604, + 505, + 617 + ], + "score": 1.0, + "content": "input-output examples", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 616, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 506, + 628 + ], + "score": 1.0, + "content": "involving integers of magnitudes up to 256, passed the examples to the trained neural network, and", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "fed the obtained predictions to the search procedures from Sect. 4.4. We also considered a RNN-based", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "score": 1.0, + "content": "decoder generating programs using beam search (see Sect. 5.3 for details). To evaluate DeepCoder,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 649, + 504, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 492, + 661 + ], + "score": 1.0, + "content": "we then recorded the time the search procedures needed to find a program consistent with the", + "type": "text" + }, + { + "bbox": [ + 492, + 649, + 504, + 659 + ], + "score": 0.66, + "content": "M", + "type": "inline_equation" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 660, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 505, + 672 + ], + "score": 1.0, + "content": "input-output examples. As a baseline, we also ran all search procedures using a simple prior as", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 671, + 442, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 442, + 684 + ], + "score": 1.0, + "content": "function probabilities, computed from their global incidence in the program corpus.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 39, + "bbox_fs": [ + 105, + 560, + 506, + 684 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 687, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 368, + 700 + ], + "score": 1.0, + "content": "In the first, smaller-scale experiment (program search space size", + "type": "text" + }, + { + "bbox": [ + 369, + 687, + 413, + 698 + ], + "score": 0.91, + "content": "\\sim 2 \\times 1 0 ^ { 6 }", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 687, + 506, + 700 + ], + "score": 1.0, + "content": ") we trained the neural", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 231, + 711 + ], + "score": 1.0, + "content": "network on programs of length", + "type": "text" + }, + { + "bbox": [ + 231, + 701, + 257, + 709 + ], + "score": 0.88, + "content": "T = 3", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 699, + 505, + 711 + ], + "score": 1.0, + "content": ", and the test programs were of the same length. Table 1 shows", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "the per-task timeout required such that a solution could be found for given proportions of the test", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 720, + 505, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 505, + 732 + ], + "score": 1.0, + "content": "tasks (in time less than or equal to the timeout). For example, in a hypothetical test set with 4 tasks", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 179, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 106, + 179, + 342, + 191 + ], + "score": 1.0, + "content": "and runtimes of 3s, 2s, 1s, 4s, the timeout required to solve", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 342, + 180, + 361, + 190 + ], + "score": 0.87, + "content": "50 \\%", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 362, + 179, + 505, + 191 + ], + "score": 1.0, + "content": "of tasks would be 2s. More detailed", + "type": "text", + "cross_page": true + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 190, + 308, + 202 + ], + "spans": [ + { + "bbox": [ + 106, + 190, + 308, + 202 + ], + "score": 1.0, + "content": "experimental results are discussed in Appendix B.", + "type": "text", + "cross_page": true + } + ], + "index": 5 + } + ], + "index": 46.5, + "bbox_fs": [ + 105, + 687, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 106, + 101, + 503, + 160 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 109, + 80, + 496, + 92 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 113, + 79, + 497, + 93 + ], + "spans": [ + { + "bbox": [ + 113, + 79, + 307, + 93 + ], + "score": 1.0, + "content": "Table 1: Search speedups on programs of length", + "type": "text" + }, + { + "bbox": [ + 307, + 81, + 334, + 91 + ], + "score": 0.89, + "content": "T = 3", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 79, + 497, + 93 + ], + "score": 1.0, + "content": "due to using neural network predictions.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table_body", + "bbox": [ + 106, + 101, + 503, + 160 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 101, + 503, + 160 + ], + "spans": [ + { + "bbox": [ + 106, + 101, + 503, + 160 + ], + "score": 0.968, + "html": "
Timeout needed to solveDFSEnumeration12SketchBeam
20%40%60%20%40%60%20%40%60%20%40%20%
Baseline41ms126ms314ms80ms:335ms861ms18.9s49.6s 84.2s>103s>103s>103s
DeepCoder2.7ms33ms110ms1.3ms6.1ms27ms0.23s0.52s 13.5s2.13s455s292s
Speedup15.2×3.9×2.9×62.2×54.6×31.5×80.4×94.6×6.2×>467×>2.2×>3.4×
", + "type": "table", + "image_path": "2b097877aeee4ab1671c81b735bc0ae0412b264777fb72d65ca97b67fdb09e11.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 106, + 101, + 503, + 120.66666666666667 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 106, + 120.66666666666667, + 503, + 140.33333333333334 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 106, + 140.33333333333334, + 503, + 160.0 + ], + "spans": [], + "index": 3 + } + ] + } + ], + "index": 1.0 + }, + { + "type": "text", + "bbox": [ + 108, + 179, + 504, + 201 + ], + "lines": [ + { + "bbox": [ + 106, + 179, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 106, + 179, + 342, + 191 + ], + "score": 1.0, + "content": "and runtimes of 3s, 2s, 1s, 4s, the timeout required to solve", + "type": "text" + }, + { + "bbox": [ + 342, + 180, + 361, + 190 + ], + "score": 0.87, + "content": "50 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 179, + 505, + 191 + ], + "score": 1.0, + "content": "of tasks would be 2s. More detailed", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 190, + 308, + 202 + ], + "spans": [ + { + "bbox": [ + 106, + 190, + 308, + 202 + ], + "score": 1.0, + "content": "experimental results are discussed in Appendix B.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 106, + 207, + 505, + 306 + ], + "lines": [ + { + "bbox": [ + 105, + 207, + 505, + 219 + ], + "spans": [ + { + "bbox": [ + 105, + 207, + 505, + 219 + ], + "score": 1.0, + "content": "In the main experiment, we tackled a large-scale problem of searching for programs consistent with", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 218, + 506, + 230 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 340, + 230 + ], + "score": 1.0, + "content": "input-output examples generated from programs of length", + "type": "text" + }, + { + "bbox": [ + 341, + 218, + 368, + 228 + ], + "score": 0.9, + "content": "T = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 218, + 506, + 230 + ], + "score": 1.0, + "content": "(search space size on the order of", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 227, + 506, + 243 + ], + "spans": [ + { + "bbox": [ + 106, + 228, + 126, + 240 + ], + "score": 0.85, + "content": "1 0 ^ { \\overline { { 1 0 } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 126, + 227, + 416, + 243 + ], + "score": 1.0, + "content": "), supported by a neural network trained with programs of shorter length", + "type": "text" + }, + { + "bbox": [ + 416, + 229, + 443, + 239 + ], + "score": 0.89, + "content": "T = 4", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 227, + 506, + 243 + ], + "score": 1.0, + "content": ". Here, we only", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 239, + 505, + 253 + ], + "spans": [ + { + "bbox": [ + 105, + 239, + 143, + 253 + ], + "score": 1.0, + "content": "consider", + "type": "text" + }, + { + "bbox": [ + 144, + 240, + 182, + 251 + ], + "score": 0.89, + "content": "P = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 239, + 505, + 253 + ], + "score": 1.0, + "content": "programs for reasons of computational efficiency, after having verified that this", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 251, + 505, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 251, + 505, + 264 + ], + "score": 1.0, + "content": "does not significantly affect the results in Table 1. The table in Fig. 3a shows significant speedups", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 261, + 505, + 275 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 272, + 275 + ], + "score": 1.0, + "content": "for DFS, Sort and add enumeration, and", + "type": "text" + }, + { + "bbox": [ + 272, + 262, + 284, + 272 + ], + "score": 0.86, + "content": "\\lambda ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 261, + 505, + 275 + ], + "score": 1.0, + "content": "with Sort and add enumeration, the search techniques", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 273, + 506, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 506, + 285 + ], + "score": 1.0, + "content": "capable of solving the search problem in reasonable time frames. Note that Sort and add enumeration", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 283, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 283, + 425, + 297 + ], + "score": 1.0, + "content": "without the neural network (using prior probabilities of functions) exceeded the", + "type": "text" + }, + { + "bbox": [ + 425, + 283, + 441, + 294 + ], + "score": 0.89, + "content": "1 0 ^ { 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 283, + 506, + 297 + ], + "score": 1.0, + "content": "second timeout", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 295, + 383, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 383, + 307 + ], + "score": 1.0, + "content": "in two cases, so the relative speedups shown are crude lower bounds.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 105, + 313, + 498, + 412 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 105, + 313, + 498, + 412 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 313, + 498, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 498, + 412 + ], + "score": 0.802, + "type": "image", + "image_path": "a7cd9438bdca3d6b3e822af385015998ac105636d940628b2f68f443f81b05e3.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 105, + 313, + 498, + 346.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 105, + 346.0, + 498, + 379.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 105, + 379.0, + 498, + 412.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 420, + 503, + 432 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 418, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 418, + 300, + 434 + ], + "score": 1.0, + "content": "Figure 3: Search speedups on programs of length", + "type": "text" + }, + { + "bbox": [ + 300, + 420, + 327, + 430 + ], + "score": 0.9, + "content": "T = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 418, + 505, + 434 + ], + "score": 1.0, + "content": "and influence of length of training programs.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + } + ], + "index": 17.0 + }, + { + "type": "text", + "bbox": [ + 106, + 443, + 505, + 532 + ], + "lines": [ + { + "bbox": [ + 105, + 444, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 505, + 457 + ], + "score": 1.0, + "content": "We hypothesize that the substantially larger performance gains on Sort and add schemes as compared", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 455, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 106, + 455, + 505, + 467 + ], + "score": 1.0, + "content": "to gains on DFS can be explained by the fact that the choice of attribute function (predicting presence", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 466, + 505, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 505, + 478 + ], + "score": 1.0, + "content": "of functions anywhere in the program) and learning objective of the neural network are better matched", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 477, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 505, + 489 + ], + "score": 1.0, + "content": "to the Sort and add schemes. Indeed, a more appropriate attribute function for DFS would be one", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 487, + 506, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 487, + 506, + 500 + ], + "score": 1.0, + "content": "that is more informative of the functions appearing early in the program, since exploring an incorrect", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 499, + 505, + 510 + ], + "spans": [ + { + "bbox": [ + 106, + 499, + 505, + 510 + ], + "score": 1.0, + "content": "first function is costly with DFS. On the other hand, the discussion in Sect. 4.5 provides theoretical", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 510, + 506, + 522 + ], + "spans": [ + { + "bbox": [ + 106, + 510, + 506, + 522 + ], + "score": 1.0, + "content": "indication that ignoring the correlations between functions is not cataclysmic for Sort and add", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 521, + 502, + 533 + ], + "spans": [ + { + "bbox": [ + 105, + 521, + 502, + 533 + ], + "score": 1.0, + "content": "enumeration, since a Rank loss that upper bounds the Sort and add runtime can still be minimized.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 108, + 537, + 504, + 571 + ], + "lines": [ + { + "bbox": [ + 105, + 536, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 505, + 551 + ], + "score": 1.0, + "content": "In Appendix G we analyse the performance of the neural networks used in these experiments, by", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 549, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 106, + 549, + 505, + 561 + ], + "score": 1.0, + "content": "investigating which attributes (program instructions) tend to be difficult to distinguish from each", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 559, + 132, + 572 + ], + "spans": [ + { + "bbox": [ + 106, + 559, + 132, + 572 + ], + "score": 1.0, + "content": "other.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28 + }, + { + "type": "title", + "bbox": [ + 107, + 585, + 332, + 595 + ], + "lines": [ + { + "bbox": [ + 105, + 584, + 333, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 584, + 333, + 597 + ], + "score": 1.0, + "content": "5.2 GENERALIZATION ACROSS PROGRAM LENGTHS", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 106, + 604, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "To investigate the encoder’s generalization ability across programs of different lengths, we trained", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 615, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 104, + 615, + 505, + 629 + ], + "score": 1.0, + "content": "a network to predict used functions from input-output examples that were generated from programs", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 627, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 145, + 640 + ], + "score": 1.0, + "content": "of length", + "type": "text" + }, + { + "bbox": [ + 145, + 627, + 219, + 639 + ], + "score": 0.94, + "content": "T _ { \\mathrm { t r a i n } } \\in \\{ 1 , . . . , 4 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 627, + 505, + 640 + ], + "score": 1.0, + "content": ". We then used each of these networks to predict functions on 5 test sets", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 638, + 506, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 639, + 381, + 650 + ], + "score": 1.0, + "content": "containing input-output examples generated from programs of lengths", + "type": "text" + }, + { + "bbox": [ + 381, + 638, + 452, + 650 + ], + "score": 0.93, + "content": "T _ { \\mathrm { t e s t } } \\in \\{ 1 , . . . , 5 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 639, + 506, + 650 + ], + "score": 1.0, + "content": ", respectively.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 649, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 252, + 662 + ], + "score": 1.0, + "content": "The test programs of a given length", + "type": "text" + }, + { + "bbox": [ + 252, + 649, + 261, + 659 + ], + "score": 0.82, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 649, + 506, + 662 + ], + "score": 1.0, + "content": "were semantically disjoint from all training programs of the", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 660, + 452, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 156, + 672 + ], + "score": 1.0, + "content": "same length", + "type": "text" + }, + { + "bbox": [ + 157, + 660, + 165, + 670 + ], + "score": 0.8, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 660, + 415, + 672 + ], + "score": 1.0, + "content": "and also from all training and test programs of shorter lengths", + "type": "text" + }, + { + "bbox": [ + 415, + 660, + 447, + 670 + ], + "score": 0.91, + "content": "T ^ { \\prime } < T", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 660, + 452, + 672 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 107, + 676, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 237, + 690 + ], + "score": 1.0, + "content": "For each of the combinations of", + "type": "text" + }, + { + "bbox": [ + 237, + 678, + 257, + 688 + ], + "score": 0.9, + "content": "T _ { \\mathrm { t r a i n } }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 676, + 275, + 690 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 275, + 677, + 292, + 688 + ], + "score": 0.86, + "content": "T _ { \\mathrm { t e s t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 676, + 505, + 690 + ], + "score": 1.0, + "content": ", Sort and add enumerative search was run both with", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "and without using the neural network’s predictions (in the latter case using prior probabilities) until", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 698, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 143, + 712 + ], + "score": 1.0, + "content": "it solved", + "type": "text" + }, + { + "bbox": [ + 143, + 699, + 163, + 709 + ], + "score": 0.88, + "content": "2 0 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 698, + 506, + 712 + ], + "score": 1.0, + "content": "of the test set tasks. Fig. 3b shows the relative speedup of the solver having access to", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "predictions from the trained neural networks. These results indicate that the neural networks are able", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "to generalize beyond programs of the same length that they were trained on. This is partly due to the", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 39 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "score": 1.0, + "content": "7", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 106, + 101, + 503, + 160 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 109, + 80, + 496, + 92 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 113, + 79, + 497, + 93 + ], + "spans": [ + { + "bbox": [ + 113, + 79, + 307, + 93 + ], + "score": 1.0, + "content": "Table 1: Search speedups on programs of length", + "type": "text" + }, + { + "bbox": [ + 307, + 81, + 334, + 91 + ], + "score": 0.89, + "content": "T = 3", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 79, + 497, + 93 + ], + "score": 1.0, + "content": "due to using neural network predictions.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table_body", + "bbox": [ + 106, + 101, + 503, + 160 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 101, + 503, + 160 + ], + "spans": [ + { + "bbox": [ + 106, + 101, + 503, + 160 + ], + "score": 0.968, + "html": "
Timeout needed to solveDFSEnumeration12SketchBeam
20%40%60%20%40%60%20%40%60%20%40%20%
Baseline41ms126ms314ms80ms:335ms861ms18.9s49.6s 84.2s>103s>103s>103s
DeepCoder2.7ms33ms110ms1.3ms6.1ms27ms0.23s0.52s 13.5s2.13s455s292s
Speedup15.2×3.9×2.9×62.2×54.6×31.5×80.4×94.6×6.2×>467×>2.2×>3.4×
", + "type": "table", + "image_path": "2b097877aeee4ab1671c81b735bc0ae0412b264777fb72d65ca97b67fdb09e11.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 106, + 101, + 503, + 120.66666666666667 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 106, + 120.66666666666667, + 503, + 140.33333333333334 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 106, + 140.33333333333334, + 503, + 160.0 + ], + "spans": [], + "index": 3 + } + ] + } + ], + "index": 1.0 + }, + { + "type": "text", + "bbox": [ + 108, + 179, + 504, + 201 + ], + "lines": [], + "index": 4.5, + "bbox_fs": [ + 106, + 179, + 505, + 202 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 207, + 505, + 306 + ], + "lines": [ + { + "bbox": [ + 105, + 207, + 505, + 219 + ], + "spans": [ + { + "bbox": [ + 105, + 207, + 505, + 219 + ], + "score": 1.0, + "content": "In the main experiment, we tackled a large-scale problem of searching for programs consistent with", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 218, + 506, + 230 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 340, + 230 + ], + "score": 1.0, + "content": "input-output examples generated from programs of length", + "type": "text" + }, + { + "bbox": [ + 341, + 218, + 368, + 228 + ], + "score": 0.9, + "content": "T = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 218, + 506, + 230 + ], + "score": 1.0, + "content": "(search space size on the order of", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 227, + 506, + 243 + ], + "spans": [ + { + "bbox": [ + 106, + 228, + 126, + 240 + ], + "score": 0.85, + "content": "1 0 ^ { \\overline { { 1 0 } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 126, + 227, + 416, + 243 + ], + "score": 1.0, + "content": "), supported by a neural network trained with programs of shorter length", + "type": "text" + }, + { + "bbox": [ + 416, + 229, + 443, + 239 + ], + "score": 0.89, + "content": "T = 4", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 227, + 506, + 243 + ], + "score": 1.0, + "content": ". Here, we only", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 239, + 505, + 253 + ], + "spans": [ + { + "bbox": [ + 105, + 239, + 143, + 253 + ], + "score": 1.0, + "content": "consider", + "type": "text" + }, + { + "bbox": [ + 144, + 240, + 182, + 251 + ], + "score": 0.89, + "content": "P = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 239, + 505, + 253 + ], + "score": 1.0, + "content": "programs for reasons of computational efficiency, after having verified that this", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 251, + 505, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 251, + 505, + 264 + ], + "score": 1.0, + "content": "does not significantly affect the results in Table 1. The table in Fig. 3a shows significant speedups", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 261, + 505, + 275 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 272, + 275 + ], + "score": 1.0, + "content": "for DFS, Sort and add enumeration, and", + "type": "text" + }, + { + "bbox": [ + 272, + 262, + 284, + 272 + ], + "score": 0.86, + "content": "\\lambda ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 261, + 505, + 275 + ], + "score": 1.0, + "content": "with Sort and add enumeration, the search techniques", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 273, + 506, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 506, + 285 + ], + "score": 1.0, + "content": "capable of solving the search problem in reasonable time frames. Note that Sort and add enumeration", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 283, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 283, + 425, + 297 + ], + "score": 1.0, + "content": "without the neural network (using prior probabilities of functions) exceeded the", + "type": "text" + }, + { + "bbox": [ + 425, + 283, + 441, + 294 + ], + "score": 0.89, + "content": "1 0 ^ { 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 283, + 506, + 297 + ], + "score": 1.0, + "content": "second timeout", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 295, + 383, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 383, + 307 + ], + "score": 1.0, + "content": "in two cases, so the relative speedups shown are crude lower bounds.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 207, + 506, + 307 + ] + }, + { + "type": "image", + "bbox": [ + 105, + 313, + 498, + 412 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 105, + 313, + 498, + 412 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 313, + 498, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 498, + 412 + ], + "score": 0.802, + "type": "image", + "image_path": "a7cd9438bdca3d6b3e822af385015998ac105636d940628b2f68f443f81b05e3.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 105, + 313, + 498, + 346.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 105, + 346.0, + 498, + 379.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 105, + 379.0, + 498, + 412.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 420, + 503, + 432 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 418, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 418, + 300, + 434 + ], + "score": 1.0, + "content": "Figure 3: Search speedups on programs of length", + "type": "text" + }, + { + "bbox": [ + 300, + 420, + 327, + 430 + ], + "score": 0.9, + "content": "T = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 418, + 505, + 434 + ], + "score": 1.0, + "content": "and influence of length of training programs.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + } + ], + "index": 17.0 + }, + { + "type": "text", + "bbox": [ + 106, + 443, + 505, + 532 + ], + "lines": [ + { + "bbox": [ + 105, + 444, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 505, + 457 + ], + "score": 1.0, + "content": "We hypothesize that the substantially larger performance gains on Sort and add schemes as compared", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 455, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 106, + 455, + 505, + 467 + ], + "score": 1.0, + "content": "to gains on DFS can be explained by the fact that the choice of attribute function (predicting presence", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 466, + 505, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 505, + 478 + ], + "score": 1.0, + "content": "of functions anywhere in the program) and learning objective of the neural network are better matched", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 477, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 505, + 489 + ], + "score": 1.0, + "content": "to the Sort and add schemes. Indeed, a more appropriate attribute function for DFS would be one", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 487, + 506, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 487, + 506, + 500 + ], + "score": 1.0, + "content": "that is more informative of the functions appearing early in the program, since exploring an incorrect", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 499, + 505, + 510 + ], + "spans": [ + { + "bbox": [ + 106, + 499, + 505, + 510 + ], + "score": 1.0, + "content": "first function is costly with DFS. On the other hand, the discussion in Sect. 4.5 provides theoretical", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 510, + 506, + 522 + ], + "spans": [ + { + "bbox": [ + 106, + 510, + 506, + 522 + ], + "score": 1.0, + "content": "indication that ignoring the correlations between functions is not cataclysmic for Sort and add", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 521, + 502, + 533 + ], + "spans": [ + { + "bbox": [ + 105, + 521, + 502, + 533 + ], + "score": 1.0, + "content": "enumeration, since a Rank loss that upper bounds the Sort and add runtime can still be minimized.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 444, + 506, + 533 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 537, + 504, + 571 + ], + "lines": [ + { + "bbox": [ + 105, + 536, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 505, + 551 + ], + "score": 1.0, + "content": "In Appendix G we analyse the performance of the neural networks used in these experiments, by", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 549, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 106, + 549, + 505, + 561 + ], + "score": 1.0, + "content": "investigating which attributes (program instructions) tend to be difficult to distinguish from each", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 559, + 132, + 572 + ], + "spans": [ + { + "bbox": [ + 106, + 559, + 132, + 572 + ], + "score": 1.0, + "content": "other.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 536, + 505, + 572 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 585, + 332, + 595 + ], + "lines": [ + { + "bbox": [ + 105, + 584, + 333, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 584, + 333, + 597 + ], + "score": 1.0, + "content": "5.2 GENERALIZATION ACROSS PROGRAM LENGTHS", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 106, + 604, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "To investigate the encoder’s generalization ability across programs of different lengths, we trained", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 615, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 104, + 615, + 505, + 629 + ], + "score": 1.0, + "content": "a network to predict used functions from input-output examples that were generated from programs", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 627, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 145, + 640 + ], + "score": 1.0, + "content": "of length", + "type": "text" + }, + { + "bbox": [ + 145, + 627, + 219, + 639 + ], + "score": 0.94, + "content": "T _ { \\mathrm { t r a i n } } \\in \\{ 1 , . . . , 4 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 627, + 505, + 640 + ], + "score": 1.0, + "content": ". We then used each of these networks to predict functions on 5 test sets", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 638, + 506, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 639, + 381, + 650 + ], + "score": 1.0, + "content": "containing input-output examples generated from programs of lengths", + "type": "text" + }, + { + "bbox": [ + 381, + 638, + 452, + 650 + ], + "score": 0.93, + "content": "T _ { \\mathrm { t e s t } } \\in \\{ 1 , . . . , 5 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 639, + 506, + 650 + ], + "score": 1.0, + "content": ", respectively.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 649, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 252, + 662 + ], + "score": 1.0, + "content": "The test programs of a given length", + "type": "text" + }, + { + "bbox": [ + 252, + 649, + 261, + 659 + ], + "score": 0.82, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 649, + 506, + 662 + ], + "score": 1.0, + "content": "were semantically disjoint from all training programs of the", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 660, + 452, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 156, + 672 + ], + "score": 1.0, + "content": "same length", + "type": "text" + }, + { + "bbox": [ + 157, + 660, + 165, + 670 + ], + "score": 0.8, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 660, + 415, + 672 + ], + "score": 1.0, + "content": "and also from all training and test programs of shorter lengths", + "type": "text" + }, + { + "bbox": [ + 415, + 660, + 447, + 670 + ], + "score": 0.91, + "content": "T ^ { \\prime } < T", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 660, + 452, + 672 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33.5, + "bbox_fs": [ + 104, + 605, + 506, + 672 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 676, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 237, + 690 + ], + "score": 1.0, + "content": "For each of the combinations of", + "type": "text" + }, + { + "bbox": [ + 237, + 678, + 257, + 688 + ], + "score": 0.9, + "content": "T _ { \\mathrm { t r a i n } }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 676, + 275, + 690 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 275, + 677, + 292, + 688 + ], + "score": 0.86, + "content": "T _ { \\mathrm { t e s t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 676, + 505, + 690 + ], + "score": 1.0, + "content": ", Sort and add enumerative search was run both with", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "and without using the neural network’s predictions (in the latter case using prior probabilities) until", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 698, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 143, + 712 + ], + "score": 1.0, + "content": "it solved", + "type": "text" + }, + { + "bbox": [ + 143, + 699, + 163, + 709 + ], + "score": 0.88, + "content": "2 0 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 698, + 506, + 712 + ], + "score": 1.0, + "content": "of the test set tasks. Fig. 3b shows the relative speedup of the solver having access to", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "predictions from the trained neural networks. These results indicate that the neural networks are able", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "to generalize beyond programs of the same length that they were trained on. This is partly due to the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 81, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 506, + 95 + ], + "score": 1.0, + "content": "search procedure on top of their predictions, which has the opportunity to correct for the presence of", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 506, + 107 + ], + "score": 1.0, + "content": "functions that the neural network failed to predict. Note that a sequence-to-sequence model trained", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 493, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 493, + 118 + ], + "score": 1.0, + "content": "on programs of a fixed length could not be expected to exhibit this kind of generalization ability.", + "type": "text", + "cross_page": true + } + ], + "index": 2 + } + ], + "index": 39, + "bbox_fs": [ + 105, + 676, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 506, + 95 + ], + "score": 1.0, + "content": "search procedure on top of their predictions, which has the opportunity to correct for the presence of", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 506, + 107 + ], + "score": 1.0, + "content": "functions that the neural network failed to predict. Note that a sequence-to-sequence model trained", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 493, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 493, + 118 + ], + "score": 1.0, + "content": "on programs of a fixed length could not be expected to exhibit this kind of generalization ability.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "title", + "bbox": [ + 107, + 129, + 230, + 140 + ], + "lines": [ + { + "bbox": [ + 106, + 128, + 231, + 141 + ], + "spans": [ + { + "bbox": [ + 106, + 128, + 231, + 141 + ], + "score": 1.0, + "content": "5.3 ALTERNATIVE MODELS", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 149, + 505, + 182 + ], + "lines": [ + { + "bbox": [ + 105, + 149, + 506, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 506, + 162 + ], + "score": 1.0, + "content": "Encoder We evaluated replacing the feed-forward architecture encoder (Sect. 4.3) with an RNN, a", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 159, + 505, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 505, + 174 + ], + "score": 1.0, + "content": "natural baseline. Using a GRU-based RNN we were able to achieve results almost as good as using", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 172, + 430, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 172, + 430, + 183 + ], + "score": 1.0, + "content": "the feed-forward architecture, but found the RNN encoder more difficult to train.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 195, + 505, + 294 + ], + "lines": [ + { + "bbox": [ + 105, + 194, + 506, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 506, + 208 + ], + "score": 1.0, + "content": "Decoder We also considered a purely neural network-based approach, where an RNN decoder", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 206, + 505, + 217 + ], + "spans": [ + { + "bbox": [ + 105, + 206, + 505, + 217 + ], + "score": 1.0, + "content": "is trained to predict the entire program token-by-token. We combined this with our feed-forward", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 216, + 504, + 229 + ], + "spans": [ + { + "bbox": [ + 105, + 216, + 504, + 229 + ], + "score": 1.0, + "content": "encoder by initializing the RNN using the pooled final layer of the encoder. We found it substantially", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 227, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 505, + 240 + ], + "score": 1.0, + "content": "more difficult to train an RNN decoder as compared to the independent binary classifiers employed", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 239, + 506, + 251 + ], + "spans": [ + { + "bbox": [ + 105, + 239, + 506, + 251 + ], + "score": 1.0, + "content": "above. Beam search was used to explore likely programs predicted by the RNN, but it only lead to a", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 249, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 448, + 262 + ], + "score": 1.0, + "content": "solution comparable with the other techniques when searching for programs of lengths", + "type": "text" + }, + { + "bbox": [ + 448, + 250, + 475, + 261 + ], + "score": 0.9, + "content": "T \\le 2", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 249, + 505, + 262 + ], + "score": 1.0, + "content": ", where", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 259, + 505, + 274 + ], + "spans": [ + { + "bbox": [ + 105, + 259, + 305, + 274 + ], + "score": 1.0, + "content": "the search space size is very small (on the order of", + "type": "text" + }, + { + "bbox": [ + 305, + 260, + 320, + 271 + ], + "score": 0.86, + "content": "1 0 ^ { 3 }", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 259, + 505, + 274 + ], + "score": 1.0, + "content": "). Note that using an RNN for both the encoder", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 271, + 506, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 271, + 506, + 284 + ], + "score": 1.0, + "content": "and decoder corresponds to a standard sequence-to-sequence model. However, we do do not rule out", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 282, + 493, + 296 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 493, + 296 + ], + "score": 1.0, + "content": "that a more sophisticated RNN decoder or training procedure could be possibly more successful.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 11 + }, + { + "type": "title", + "bbox": [ + 108, + 309, + 211, + 322 + ], + "lines": [ + { + "bbox": [ + 105, + 308, + 213, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 213, + 324 + ], + "score": 1.0, + "content": "6 RELATED WORK", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 334, + 505, + 510 + ], + "lines": [ + { + "bbox": [ + 105, + 333, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 333, + 506, + 348 + ], + "score": 1.0, + "content": "Machine Learning for Inductive Program Synthesis. There is relatively little work on using", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 346, + 506, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 506, + 358 + ], + "score": 1.0, + "content": "machine learning for programming by example. The most closely related work is that of Menon", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 356, + 506, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 506, + 368 + ], + "score": 1.0, + "content": "et al. (2013), in which a hand-coded set of features of input-output examples are used as “clues.”", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 367, + 506, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 506, + 380 + ], + "score": 1.0, + "content": "When a clue appears in the input-output examples (e.g., the output is a permutation of the input),", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 378, + 506, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 506, + 390 + ], + "score": 1.0, + "content": "it reweights the probabilities of productions in a probabilistic context free grammar by a learned", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 389, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 506, + 403 + ], + "score": 1.0, + "content": "amount. This work shares the idea of learning to guide the search over program space conditional on", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 400, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 400, + 506, + 414 + ], + "score": 1.0, + "content": "input-output examples. One difference is in the domains. Menon et al. (2013) operate on short string", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 411, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 505, + 424 + ], + "score": 1.0, + "content": "manipulation programs, where it is arguably easier to hand-code features to recognize patterns in the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 422, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 422, + 505, + 435 + ], + "score": 1.0, + "content": "input-output examples (e.g., if the outputs are always permutations or substrings of the input). Our", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 433, + 505, + 445 + ], + "spans": [ + { + "bbox": [ + 106, + 433, + 505, + 445 + ], + "score": 1.0, + "content": "work shows that there are strong cues in patterns in input-output examples in the domain of numbers", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 443, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 106, + 443, + 505, + 456 + ], + "score": 1.0, + "content": "and lists. However, the main difference is the scale. Menon et al. (2013) learns from a small (280", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 455, + 506, + 468 + ], + "spans": [ + { + "bbox": [ + 106, + 455, + 506, + 468 + ], + "score": 1.0, + "content": "examples), manually-constructed dataset, which limits the capacity of the machine learning model", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 466, + 506, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 506, + 478 + ], + "score": 1.0, + "content": "that can be trained. Thus, it forces the machine learning component to be relatively simple. Indeed,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 477, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 505, + 489 + ], + "score": 1.0, + "content": "Menon et al. (2013) use a log-linear model and rely on hand-constructed features. LIPS automatically", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 488, + 505, + 501 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 505, + 501 + ], + "score": 1.0, + "content": "generates training data, which yields datasets with millions of programs and enables high-capacity", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 499, + 345, + 512 + ], + "spans": [ + { + "bbox": [ + 106, + 499, + 345, + 512 + ], + "score": 1.0, + "content": "deep learning models to be brought to bear on the problem.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 107, + 522, + 505, + 610 + ], + "lines": [ + { + "bbox": [ + 105, + 522, + 507, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 507, + 535 + ], + "score": 1.0, + "content": "Learning Representations of Program State. Piech et al. (2015) propose to learn joint embed-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 533, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 506, + 545 + ], + "score": 1.0, + "content": "dings of program states and programs to automatically extend teacher feedback to many similar", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 544, + 507, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 507, + 558 + ], + "score": 1.0, + "content": "programs in the MOOC setting. This work is similar in that it considers embedding program states,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 555, + 506, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 506, + 567 + ], + "score": 1.0, + "content": "but the domain is different, and it otherwise specifically focuses on syntactic differences between", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 565, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 505, + 578 + ], + "score": 1.0, + "content": "semantically equivalent programs to provide stylistic feedback. Li et al. (2016) use graph neural", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "networks (GNNs) to predict logical descriptions from program states, focusing on data structure", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 588, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 505, + 599 + ], + "score": 1.0, + "content": "shapes instead of numerical and list data. Such GNNs may be a suitable architecture to encode states", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 599, + 413, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 413, + 612 + ], + "score": 1.0, + "content": "appearing when extending our DSL to handle more complex data structures.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 36.5 + }, + { + "type": "text", + "bbox": [ + 107, + 622, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 621, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 505, + 634 + ], + "score": 1.0, + "content": "Learning to Infer. Very recently, Alemi et al. (2016) used neural sequence models in tandem with", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 632, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 645 + ], + "score": 1.0, + "content": "an automated theorem prover. Similar to our Sort and Add strategy, a neural network component", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 644, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 506, + 657 + ], + "score": 1.0, + "content": "is trained to select premises that the theorem prover can use to prove a theorem. A recent exten-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "score": 1.0, + "content": "sion (Loos et al., 2017) is similar to our DFS enumeration strategy and uses a neural network to guide", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 666, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 677 + ], + "score": 1.0, + "content": "the proof search at intermediate steps. The main differences are in the domains, and that they train", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "on an existing corpus of theorems. More broadly, if we view a DSL as defining a model and search", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "as a form of inference algorithm, then there is a large body of work on using discriminatively-trained", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "score": 1.0, + "content": "models to aid inference in generative models. Examples include Dayan et al. (1995); Kingma &", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 709, + 507, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 507, + 722 + ], + "score": 1.0, + "content": "Welling (2014); Shotton et al. (2013); Stuhlmuller et al. (2013); Heess et al. (2013); Jampani et al. ¨", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 720, + 139, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 139, + 733 + ], + "score": 1.0, + "content": "(2015).", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 45.5 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 761 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 761 + ], + "score": 1.0, + "content": "8", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 116 + ], + "lines": [], + "index": 1, + "bbox_fs": [ + 105, + 81, + 506, + 118 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 107, + 129, + 230, + 140 + ], + "lines": [ + { + "bbox": [ + 106, + 128, + 231, + 141 + ], + "spans": [ + { + "bbox": [ + 106, + 128, + 231, + 141 + ], + "score": 1.0, + "content": "5.3 ALTERNATIVE MODELS", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 149, + 505, + 182 + ], + "lines": [ + { + "bbox": [ + 105, + 149, + 506, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 506, + 162 + ], + "score": 1.0, + "content": "Encoder We evaluated replacing the feed-forward architecture encoder (Sect. 4.3) with an RNN, a", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 159, + 505, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 505, + 174 + ], + "score": 1.0, + "content": "natural baseline. Using a GRU-based RNN we were able to achieve results almost as good as using", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 172, + 430, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 172, + 430, + 183 + ], + "score": 1.0, + "content": "the feed-forward architecture, but found the RNN encoder more difficult to train.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 149, + 506, + 183 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 195, + 505, + 294 + ], + "lines": [ + { + "bbox": [ + 105, + 194, + 506, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 506, + 208 + ], + "score": 1.0, + "content": "Decoder We also considered a purely neural network-based approach, where an RNN decoder", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 206, + 505, + 217 + ], + "spans": [ + { + "bbox": [ + 105, + 206, + 505, + 217 + ], + "score": 1.0, + "content": "is trained to predict the entire program token-by-token. We combined this with our feed-forward", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 216, + 504, + 229 + ], + "spans": [ + { + "bbox": [ + 105, + 216, + 504, + 229 + ], + "score": 1.0, + "content": "encoder by initializing the RNN using the pooled final layer of the encoder. We found it substantially", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 227, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 505, + 240 + ], + "score": 1.0, + "content": "more difficult to train an RNN decoder as compared to the independent binary classifiers employed", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 239, + 506, + 251 + ], + "spans": [ + { + "bbox": [ + 105, + 239, + 506, + 251 + ], + "score": 1.0, + "content": "above. Beam search was used to explore likely programs predicted by the RNN, but it only lead to a", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 249, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 448, + 262 + ], + "score": 1.0, + "content": "solution comparable with the other techniques when searching for programs of lengths", + "type": "text" + }, + { + "bbox": [ + 448, + 250, + 475, + 261 + ], + "score": 0.9, + "content": "T \\le 2", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 249, + 505, + 262 + ], + "score": 1.0, + "content": ", where", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 259, + 505, + 274 + ], + "spans": [ + { + "bbox": [ + 105, + 259, + 305, + 274 + ], + "score": 1.0, + "content": "the search space size is very small (on the order of", + "type": "text" + }, + { + "bbox": [ + 305, + 260, + 320, + 271 + ], + "score": 0.86, + "content": "1 0 ^ { 3 }", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 259, + 505, + 274 + ], + "score": 1.0, + "content": "). Note that using an RNN for both the encoder", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 271, + 506, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 271, + 506, + 284 + ], + "score": 1.0, + "content": "and decoder corresponds to a standard sequence-to-sequence model. However, we do do not rule out", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 282, + 493, + 296 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 493, + 296 + ], + "score": 1.0, + "content": "that a more sophisticated RNN decoder or training procedure could be possibly more successful.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 194, + 506, + 296 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 309, + 211, + 322 + ], + "lines": [ + { + "bbox": [ + 105, + 308, + 213, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 213, + 324 + ], + "score": 1.0, + "content": "6 RELATED WORK", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 334, + 505, + 510 + ], + "lines": [ + { + "bbox": [ + 105, + 333, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 333, + 506, + 348 + ], + "score": 1.0, + "content": "Machine Learning for Inductive Program Synthesis. There is relatively little work on using", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 346, + 506, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 506, + 358 + ], + "score": 1.0, + "content": "machine learning for programming by example. The most closely related work is that of Menon", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 356, + 506, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 506, + 368 + ], + "score": 1.0, + "content": "et al. (2013), in which a hand-coded set of features of input-output examples are used as “clues.”", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 367, + 506, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 506, + 380 + ], + "score": 1.0, + "content": "When a clue appears in the input-output examples (e.g., the output is a permutation of the input),", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 378, + 506, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 506, + 390 + ], + "score": 1.0, + "content": "it reweights the probabilities of productions in a probabilistic context free grammar by a learned", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 389, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 506, + 403 + ], + "score": 1.0, + "content": "amount. This work shares the idea of learning to guide the search over program space conditional on", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 400, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 400, + 506, + 414 + ], + "score": 1.0, + "content": "input-output examples. One difference is in the domains. Menon et al. (2013) operate on short string", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 411, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 505, + 424 + ], + "score": 1.0, + "content": "manipulation programs, where it is arguably easier to hand-code features to recognize patterns in the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 422, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 422, + 505, + 435 + ], + "score": 1.0, + "content": "input-output examples (e.g., if the outputs are always permutations or substrings of the input). Our", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 433, + 505, + 445 + ], + "spans": [ + { + "bbox": [ + 106, + 433, + 505, + 445 + ], + "score": 1.0, + "content": "work shows that there are strong cues in patterns in input-output examples in the domain of numbers", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 443, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 106, + 443, + 505, + 456 + ], + "score": 1.0, + "content": "and lists. However, the main difference is the scale. Menon et al. (2013) learns from a small (280", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 455, + 506, + 468 + ], + "spans": [ + { + "bbox": [ + 106, + 455, + 506, + 468 + ], + "score": 1.0, + "content": "examples), manually-constructed dataset, which limits the capacity of the machine learning model", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 466, + 506, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 506, + 478 + ], + "score": 1.0, + "content": "that can be trained. Thus, it forces the machine learning component to be relatively simple. Indeed,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 477, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 505, + 489 + ], + "score": 1.0, + "content": "Menon et al. (2013) use a log-linear model and rely on hand-constructed features. LIPS automatically", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 488, + 505, + 501 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 505, + 501 + ], + "score": 1.0, + "content": "generates training data, which yields datasets with millions of programs and enables high-capacity", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 499, + 345, + 512 + ], + "spans": [ + { + "bbox": [ + 106, + 499, + 345, + 512 + ], + "score": 1.0, + "content": "deep learning models to be brought to bear on the problem.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 333, + 506, + 512 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 522, + 505, + 610 + ], + "lines": [ + { + "bbox": [ + 105, + 522, + 507, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 507, + 535 + ], + "score": 1.0, + "content": "Learning Representations of Program State. Piech et al. (2015) propose to learn joint embed-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 533, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 506, + 545 + ], + "score": 1.0, + "content": "dings of program states and programs to automatically extend teacher feedback to many similar", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 544, + 507, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 507, + 558 + ], + "score": 1.0, + "content": "programs in the MOOC setting. This work is similar in that it considers embedding program states,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 555, + 506, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 506, + 567 + ], + "score": 1.0, + "content": "but the domain is different, and it otherwise specifically focuses on syntactic differences between", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 565, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 505, + 578 + ], + "score": 1.0, + "content": "semantically equivalent programs to provide stylistic feedback. Li et al. (2016) use graph neural", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "networks (GNNs) to predict logical descriptions from program states, focusing on data structure", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 588, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 505, + 599 + ], + "score": 1.0, + "content": "shapes instead of numerical and list data. Such GNNs may be a suitable architecture to encode states", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 599, + 413, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 413, + 612 + ], + "score": 1.0, + "content": "appearing when extending our DSL to handle more complex data structures.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 522, + 507, + 612 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 622, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 621, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 505, + 634 + ], + "score": 1.0, + "content": "Learning to Infer. Very recently, Alemi et al. (2016) used neural sequence models in tandem with", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 632, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 645 + ], + "score": 1.0, + "content": "an automated theorem prover. Similar to our Sort and Add strategy, a neural network component", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 644, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 506, + 657 + ], + "score": 1.0, + "content": "is trained to select premises that the theorem prover can use to prove a theorem. A recent exten-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "score": 1.0, + "content": "sion (Loos et al., 2017) is similar to our DFS enumeration strategy and uses a neural network to guide", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 666, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 677 + ], + "score": 1.0, + "content": "the proof search at intermediate steps. The main differences are in the domains, and that they train", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "on an existing corpus of theorems. More broadly, if we view a DSL as defining a model and search", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "as a form of inference algorithm, then there is a large body of work on using discriminatively-trained", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "score": 1.0, + "content": "models to aid inference in generative models. Examples include Dayan et al. (1995); Kingma &", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 709, + 507, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 507, + 722 + ], + "score": 1.0, + "content": "Welling (2014); Shotton et al. (2013); Stuhlmuller et al. (2013); Heess et al. (2013); Jampani et al. ¨", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 720, + 139, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 139, + 733 + ], + "score": 1.0, + "content": "(2015).", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 45.5, + "bbox_fs": [ + 105, + 621, + 507, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 296, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 79, + 299, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 79, + 299, + 96 + ], + "score": 1.0, + "content": "7 DISCUSSION AND FUTURE WORK", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 106, + 505, + 194 + ], + "lines": [ + { + "bbox": [ + 105, + 105, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 505, + 118 + ], + "score": 1.0, + "content": "We have presented a framework for improving IPS systems by using neural networks to translate cues", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 117, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 117, + 505, + 128 + ], + "score": 1.0, + "content": "in input-output examples to guidance over where to search in program space. Our empirical results", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 128, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 505, + 140 + ], + "score": 1.0, + "content": "show that for many programs, this technique improves the runtime of a wide range of IPS baselines", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 138, + 505, + 152 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 505, + 152 + ], + "score": 1.0, + "content": "by 1-3 orders. We have found several problems in real online programming challenges that can be", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 150, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 505, + 162 + ], + "score": 1.0, + "content": "solved with a program in our language, which validates the relevance of the class of problems that", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 161, + 505, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 161, + 505, + 173 + ], + "score": 1.0, + "content": "we have studied in this work. In sum, this suggests that we have made significant progress towards", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 171, + 505, + 185 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 505, + 185 + ], + "score": 1.0, + "content": "being able to solve programming competition problems, and the machine learning component plays", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 183, + 267, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 183, + 267, + 194 + ], + "score": 1.0, + "content": "an important role in making it tractable.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 107, + 199, + 505, + 320 + ], + "lines": [ + { + "bbox": [ + 105, + 199, + 506, + 213 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 506, + 213 + ], + "score": 1.0, + "content": "There remain some limitations, however. First, the programs we can synthesize are only the simplest", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 210, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 506, + 223 + ], + "score": 1.0, + "content": "problems on programming competition websites and are simpler than most competition problems.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 221, + 506, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 506, + 235 + ], + "score": 1.0, + "content": "Many problems require more complex algorithmic solutions like dynamic programming and search,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 232, + 505, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 505, + 245 + ], + "score": 1.0, + "content": "which are currently beyond our reach. Our chosen DSL currently cannot express solutions to many", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 244, + 506, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 506, + 256 + ], + "score": 1.0, + "content": "problems. To do so, it would need to be extended by adding more primitives and allow for more", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 254, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 505, + 267 + ], + "score": 1.0, + "content": "flexibility in program constructs (such as allowing loops). Second, we currently use five input-output", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 264, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 505, + 279 + ], + "score": 1.0, + "content": "examples with relatively large integer values (up to 256 in magnitude), which are probably more", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 276, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 505, + 289 + ], + "score": 1.0, + "content": "informative than typical (smaller) examples. While we remain optimistic about LIPS’s applicability as", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 287, + 505, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 505, + 300 + ], + "score": 1.0, + "content": "the DSL becomes more complex and the input-output examples become less informative, it remains", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 298, + 506, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 298, + 506, + 311 + ], + "score": 1.0, + "content": "to be seen what the magnitude of these effects are as we move towards solving large subsets of", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 310, + 255, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 310, + 255, + 321 + ], + "score": 1.0, + "content": "programming competition problems.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 326, + 505, + 381 + ], + "lines": [ + { + "bbox": [ + 105, + 325, + 507, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 507, + 339 + ], + "score": 1.0, + "content": "We foresee many extensions of DeepCoder. We are most interested in better data generation pro-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 337, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 106, + 337, + 505, + 350 + ], + "score": 1.0, + "content": "cedures by using generative models of source code, and to incorporate natural language problem", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 347, + 507, + 361 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 507, + 361 + ], + "score": 1.0, + "content": "descriptions to lessen the information burden required from input-output examples. In sum, Deep-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 359, + 506, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 359, + 506, + 372 + ], + "score": 1.0, + "content": "Coder represents a promising direction forward, and we are optimistic about the future prospects of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 370, + 299, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 299, + 383 + ], + "score": 1.0, + "content": "using machine learning to synthesize programs.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22 + }, + { + "type": "title", + "bbox": [ + 108, + 394, + 200, + 404 + ], + "lines": [ + { + "bbox": [ + 107, + 394, + 200, + 405 + ], + "spans": [ + { + "bbox": [ + 107, + 394, + 200, + 405 + ], + "score": 1.0, + "content": "ACKNOWLEDGMENTS", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 412, + 504, + 435 + ], + "lines": [ + { + "bbox": [ + 105, + 411, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 505, + 424 + ], + "score": 1.0, + "content": "The authors would like to express their gratitude to Rishabh Singh and Jack Feser for their valuable", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 423, + 404, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 279, + 437 + ], + "score": 1.0, + "content": "guidance and help on using the Sketch and", + "type": "text" + }, + { + "bbox": [ + 279, + 423, + 290, + 434 + ], + "score": 0.85, + "content": "\\lambda ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 423, + 404, + 437 + ], + "score": 1.0, + "content": "program synthesis systems.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "title", + "bbox": [ + 108, + 451, + 175, + 463 + ], + "lines": [ + { + "bbox": [ + 106, + 451, + 176, + 464 + ], + "spans": [ + { + "bbox": [ + 106, + 451, + 176, + 464 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 105, + 468, + 507, + 733 + ], + "lines": [ + { + "bbox": [ + 106, + 469, + 506, + 482 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 506, + 482 + ], + "score": 1.0, + "content": "Alex A. Alemi, Franc¸ois Chollet, Geoffrey Irving, Christian Szegedy, and Josef Urban. DeepMath -", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 116, + 481, + 504, + 492 + ], + "spans": [ + { + "bbox": [ + 116, + 481, + 504, + 492 + ], + "score": 1.0, + "content": "deep sequence models for premise selection. In Proocedings of the 29th Conference on Advances", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 492, + 344, + 503 + ], + "spans": [ + { + "bbox": [ + 116, + 492, + 344, + 503 + ], + "score": 1.0, + "content": "in Neural Information Processing Systems (NIPS), 2016.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 508, + 506, + 523 + ], + "spans": [ + { + "bbox": [ + 104, + 508, + 506, + 523 + ], + "score": 1.0, + "content": "Rudy R Bunel, Alban Desmaison, Pawan K Mudigonda, Pushmeet Kohli, and Philip Torr. Adaptive", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 519, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 115, + 519, + 506, + 534 + ], + "score": 1.0, + "content": "neural compilation. In Proceedings of the 29th Conference on Advances in Neural Information", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 532, + 253, + 543 + ], + "spans": [ + { + "bbox": [ + 116, + 532, + 253, + 543 + ], + "score": 1.0, + "content": "Processing Systems (NIPS), 2016.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 550, + 506, + 562 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 506, + 562 + ], + "score": 1.0, + "content": "Peter Dayan, Geoffrey E Hinton, Radford M Neal, and Richard S Zemel. The Helmholtz machine.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 561, + 285, + 573 + ], + "spans": [ + { + "bbox": [ + 115, + 561, + 285, + 573 + ], + "score": 1.0, + "content": "Neural computation, 7(5):889–904, 1995.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 578, + 506, + 591 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 506, + 591 + ], + "score": 1.0, + "content": "Krzysztof Dembczynski, Willem Waegeman, Weiwei Cheng, and Eyke H ´ ullermeier. On label de- ¨", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 589, + 506, + 602 + ], + "spans": [ + { + "bbox": [ + 116, + 589, + 506, + 602 + ], + "score": 1.0, + "content": "pendence and loss minimization in multi-label classification. Machine Learning, 88(1):5–45,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 116, + 600, + 142, + 613 + ], + "spans": [ + { + "bbox": [ + 116, + 600, + 142, + 613 + ], + "score": 1.0, + "content": "2012.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 618, + 506, + 631 + ], + "spans": [ + { + "bbox": [ + 106, + 618, + 506, + 631 + ], + "score": 1.0, + "content": "Krzysztof J. Dembczynski, Weiwei Cheng, and Eyke Hllermeier. Bayes optimal multilabel classifi-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 629, + 506, + 643 + ], + "spans": [ + { + "bbox": [ + 115, + 629, + 506, + 643 + ], + "score": 1.0, + "content": "cation via probabilistic classifier chains. In Proceedings of the 27th International Conference on", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 640, + 252, + 653 + ], + "spans": [ + { + "bbox": [ + 115, + 640, + 252, + 653 + ], + "score": 1.0, + "content": "Machine Learning (ICML), 2010.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 659, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 505, + 671 + ], + "score": 1.0, + "content": "John K. Feser, Swarat Chaudhuri, and Isil Dillig. Synthesizing data structure transformations from", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 114, + 669, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 114, + 669, + 505, + 684 + ], + "score": 1.0, + "content": "input-output examples. In Proceedings of the 36th ACM SIGPLAN Conference on Programming", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 681, + 330, + 693 + ], + "spans": [ + { + "bbox": [ + 115, + 681, + 330, + 693 + ], + "score": 1.0, + "content": "Language Design and Implementation (PLDI), 2015.", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "Alexander L. Gaunt, Marc Brockschmidt, Rishabh Singh, Nate Kushman, Pushmeet Kohli, Jonathan", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 115, + 709, + 507, + 723 + ], + "spans": [ + { + "bbox": [ + 115, + 709, + 507, + 723 + ], + "score": 1.0, + "content": "Taylor, and Daniel Tarlow. Terpret: A probabilistic programming language for program induction.", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 116, + 720, + 452, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 452, + 733 + ], + "score": 1.0, + "content": "CoRR, abs/1608.04428, 2016. URL http://arxiv.org/abs/1608.04428.", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 38.5 + } + ], + "page_idx": 8, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "9", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 296, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 79, + 299, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 79, + 299, + 96 + ], + "score": 1.0, + "content": "7 DISCUSSION AND FUTURE WORK", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 106, + 505, + 194 + ], + "lines": [ + { + "bbox": [ + 105, + 105, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 505, + 118 + ], + "score": 1.0, + "content": "We have presented a framework for improving IPS systems by using neural networks to translate cues", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 117, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 117, + 505, + 128 + ], + "score": 1.0, + "content": "in input-output examples to guidance over where to search in program space. Our empirical results", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 128, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 505, + 140 + ], + "score": 1.0, + "content": "show that for many programs, this technique improves the runtime of a wide range of IPS baselines", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 138, + 505, + 152 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 505, + 152 + ], + "score": 1.0, + "content": "by 1-3 orders. We have found several problems in real online programming challenges that can be", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 150, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 505, + 162 + ], + "score": 1.0, + "content": "solved with a program in our language, which validates the relevance of the class of problems that", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 161, + 505, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 161, + 505, + 173 + ], + "score": 1.0, + "content": "we have studied in this work. In sum, this suggests that we have made significant progress towards", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 171, + 505, + 185 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 505, + 185 + ], + "score": 1.0, + "content": "being able to solve programming competition problems, and the machine learning component plays", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 183, + 267, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 183, + 267, + 194 + ], + "score": 1.0, + "content": "an important role in making it tractable.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 105, + 505, + 194 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 199, + 505, + 320 + ], + "lines": [ + { + "bbox": [ + 105, + 199, + 506, + 213 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 506, + 213 + ], + "score": 1.0, + "content": "There remain some limitations, however. First, the programs we can synthesize are only the simplest", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 210, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 506, + 223 + ], + "score": 1.0, + "content": "problems on programming competition websites and are simpler than most competition problems.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 221, + 506, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 506, + 235 + ], + "score": 1.0, + "content": "Many problems require more complex algorithmic solutions like dynamic programming and search,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 232, + 505, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 505, + 245 + ], + "score": 1.0, + "content": "which are currently beyond our reach. Our chosen DSL currently cannot express solutions to many", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 244, + 506, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 506, + 256 + ], + "score": 1.0, + "content": "problems. To do so, it would need to be extended by adding more primitives and allow for more", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 254, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 505, + 267 + ], + "score": 1.0, + "content": "flexibility in program constructs (such as allowing loops). Second, we currently use five input-output", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 264, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 505, + 279 + ], + "score": 1.0, + "content": "examples with relatively large integer values (up to 256 in magnitude), which are probably more", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 276, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 505, + 289 + ], + "score": 1.0, + "content": "informative than typical (smaller) examples. While we remain optimistic about LIPS’s applicability as", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 287, + 505, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 505, + 300 + ], + "score": 1.0, + "content": "the DSL becomes more complex and the input-output examples become less informative, it remains", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 298, + 506, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 298, + 506, + 311 + ], + "score": 1.0, + "content": "to be seen what the magnitude of these effects are as we move towards solving large subsets of", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 310, + 255, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 310, + 255, + 321 + ], + "score": 1.0, + "content": "programming competition problems.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 199, + 506, + 321 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 326, + 505, + 381 + ], + "lines": [ + { + "bbox": [ + 105, + 325, + 507, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 507, + 339 + ], + "score": 1.0, + "content": "We foresee many extensions of DeepCoder. We are most interested in better data generation pro-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 337, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 106, + 337, + 505, + 350 + ], + "score": 1.0, + "content": "cedures by using generative models of source code, and to incorporate natural language problem", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 347, + 507, + 361 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 507, + 361 + ], + "score": 1.0, + "content": "descriptions to lessen the information burden required from input-output examples. In sum, Deep-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 359, + 506, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 359, + 506, + 372 + ], + "score": 1.0, + "content": "Coder represents a promising direction forward, and we are optimistic about the future prospects of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 370, + 299, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 299, + 383 + ], + "score": 1.0, + "content": "using machine learning to synthesize programs.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 325, + 507, + 383 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 394, + 200, + 404 + ], + "lines": [ + { + "bbox": [ + 107, + 394, + 200, + 405 + ], + "spans": [ + { + "bbox": [ + 107, + 394, + 200, + 405 + ], + "score": 1.0, + "content": "ACKNOWLEDGMENTS", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 412, + 504, + 435 + ], + "lines": [ + { + "bbox": [ + 105, + 411, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 505, + 424 + ], + "score": 1.0, + "content": "The authors would like to express their gratitude to Rishabh Singh and Jack Feser for their valuable", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 423, + 404, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 279, + 437 + ], + "score": 1.0, + "content": "guidance and help on using the Sketch and", + "type": "text" + }, + { + "bbox": [ + 279, + 423, + 290, + 434 + ], + "score": 0.85, + "content": "\\lambda ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 423, + 404, + 437 + ], + "score": 1.0, + "content": "program synthesis systems.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 411, + 505, + 437 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 451, + 175, + 463 + ], + "lines": [ + { + "bbox": [ + 106, + 451, + 176, + 464 + ], + "spans": [ + { + "bbox": [ + 106, + 451, + 176, + 464 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "list", + "bbox": [ + 105, + 468, + 507, + 733 + ], + "lines": [ + { + "bbox": [ + 106, + 469, + 506, + 482 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 506, + 482 + ], + "score": 1.0, + "content": "Alex A. Alemi, Franc¸ois Chollet, Geoffrey Irving, Christian Szegedy, and Josef Urban. DeepMath -", + "type": "text" + } + ], + "index": 29, + "is_list_start_line": true + }, + { + "bbox": [ + 116, + 481, + 504, + 492 + ], + "spans": [ + { + "bbox": [ + 116, + 481, + 504, + 492 + ], + "score": 1.0, + "content": "deep sequence models for premise selection. In Proocedings of the 29th Conference on Advances", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 492, + 344, + 503 + ], + "spans": [ + { + "bbox": [ + 116, + 492, + 344, + 503 + ], + "score": 1.0, + "content": "in Neural Information Processing Systems (NIPS), 2016.", + "type": "text" + } + ], + "index": 31, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 508, + 506, + 523 + ], + "spans": [ + { + "bbox": [ + 104, + 508, + 506, + 523 + ], + "score": 1.0, + "content": "Rudy R Bunel, Alban Desmaison, Pawan K Mudigonda, Pushmeet Kohli, and Philip Torr. Adaptive", + "type": "text" + } + ], + "index": 32, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 519, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 115, + 519, + 506, + 534 + ], + "score": 1.0, + "content": "neural compilation. In Proceedings of the 29th Conference on Advances in Neural Information", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 532, + 253, + 543 + ], + "spans": [ + { + "bbox": [ + 116, + 532, + 253, + 543 + ], + "score": 1.0, + "content": "Processing Systems (NIPS), 2016.", + "type": "text" + } + ], + "index": 34, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 550, + 506, + 562 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 506, + 562 + ], + "score": 1.0, + "content": "Peter Dayan, Geoffrey E Hinton, Radford M Neal, and Richard S Zemel. The Helmholtz machine.", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 561, + 285, + 573 + ], + "spans": [ + { + "bbox": [ + 115, + 561, + 285, + 573 + ], + "score": 1.0, + "content": "Neural computation, 7(5):889–904, 1995.", + "type": "text" + } + ], + "index": 36, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 578, + 506, + 591 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 506, + 591 + ], + "score": 1.0, + "content": "Krzysztof Dembczynski, Willem Waegeman, Weiwei Cheng, and Eyke H ´ ullermeier. On label de- ¨", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 116, + 589, + 506, + 602 + ], + "spans": [ + { + "bbox": [ + 116, + 589, + 506, + 602 + ], + "score": 1.0, + "content": "pendence and loss minimization in multi-label classification. Machine Learning, 88(1):5–45,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 116, + 600, + 142, + 613 + ], + "spans": [ + { + "bbox": [ + 116, + 600, + 142, + 613 + ], + "score": 1.0, + "content": "2012.", + "type": "text" + } + ], + "index": 39, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 618, + 506, + 631 + ], + "spans": [ + { + "bbox": [ + 106, + 618, + 506, + 631 + ], + "score": 1.0, + "content": "Krzysztof J. Dembczynski, Weiwei Cheng, and Eyke Hllermeier. Bayes optimal multilabel classifi-", + "type": "text" + } + ], + "index": 40, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 629, + 506, + 643 + ], + "spans": [ + { + "bbox": [ + 115, + 629, + 506, + 643 + ], + "score": 1.0, + "content": "cation via probabilistic classifier chains. In Proceedings of the 27th International Conference on", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 640, + 252, + 653 + ], + "spans": [ + { + "bbox": [ + 115, + 640, + 252, + 653 + ], + "score": 1.0, + "content": "Machine Learning (ICML), 2010.", + "type": "text" + } + ], + "index": 42, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 659, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 505, + 671 + ], + "score": 1.0, + "content": "John K. Feser, Swarat Chaudhuri, and Isil Dillig. Synthesizing data structure transformations from", + "type": "text" + } + ], + "index": 43, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 669, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 114, + 669, + 505, + 684 + ], + "score": 1.0, + "content": "input-output examples. In Proceedings of the 36th ACM SIGPLAN Conference on Programming", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 681, + 330, + 693 + ], + "spans": [ + { + "bbox": [ + 115, + 681, + 330, + 693 + ], + "score": 1.0, + "content": "Language Design and Implementation (PLDI), 2015.", + "type": "text" + } + ], + "index": 45, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "Alexander L. Gaunt, Marc Brockschmidt, Rishabh Singh, Nate Kushman, Pushmeet Kohli, Jonathan", + "type": "text" + } + ], + "index": 46, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 709, + 507, + 723 + ], + "spans": [ + { + "bbox": [ + 115, + 709, + 507, + 723 + ], + "score": 1.0, + "content": "Taylor, and Daniel Tarlow. Terpret: A probabilistic programming language for program induction.", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 116, + 720, + 452, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 452, + 733 + ], + "score": 1.0, + "content": "CoRR, abs/1608.04428, 2016. URL http://arxiv.org/abs/1608.04428.", + "type": "text" + } + ], + "index": 48, + "is_list_end_line": true + } + ], + "index": 38.5, + "bbox_fs": [ + 104, + 469, + 507, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 506, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 506, + 94 + ], + "score": 1.0, + "content": "Alex Graves, Greg Wayne, and Ivo Danihelka. Neural Turing machines. CoRR, abs/1410.5401, 2014.", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 117, + 93, + 323, + 106 + ], + "spans": [ + { + "bbox": [ + 117, + 93, + 323, + 106 + ], + "score": 1.0, + "content": "URL http://arxiv.org/abs/1410.5401.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 108, + 111, + 505, + 145 + ], + "lines": [ + { + "bbox": [ + 106, + 111, + 507, + 124 + ], + "spans": [ + { + "bbox": [ + 106, + 111, + 507, + 124 + ], + "score": 1.0, + "content": "Alex Graves, Greg Wayne, Malcolm Reynolds, Tim Harley, Ivo Danihelka, Agnieszka Grabska-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 122, + 507, + 136 + ], + "spans": [ + { + "bbox": [ + 115, + 122, + 507, + 136 + ], + "score": 1.0, + "content": "Barwinska, Sergio G ´ omez Colmenarejo, Edward Grefenstette, Tiago Ramalho, John Agapiou, ´", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 134, + 496, + 146 + ], + "spans": [ + { + "bbox": [ + 115, + 134, + 496, + 146 + ], + "score": 1.0, + "content": "et al. Hybrid computing using a neural network with dynamic external memory. Nature, 2016.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 108, + 151, + 504, + 185 + ], + "lines": [ + { + "bbox": [ + 105, + 150, + 506, + 165 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 506, + 165 + ], + "score": 1.0, + "content": "Edward Grefenstette, Karl Moritz Hermann, Mustafa Suleyman, and Phil Blunsom. Learning to", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 163, + 506, + 175 + ], + "spans": [ + { + "bbox": [ + 116, + 163, + 506, + 175 + ], + "score": 1.0, + "content": "transduce with unbounded memory. In Proceedings of the 28th Conference on Advances in Neural", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 173, + 304, + 187 + ], + "spans": [ + { + "bbox": [ + 116, + 173, + 304, + 187 + ], + "score": 1.0, + "content": "Information Processing Systems (NIPS), 2015.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 105, + 191, + 504, + 215 + ], + "lines": [ + { + "bbox": [ + 106, + 191, + 505, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 191, + 505, + 204 + ], + "score": 1.0, + "content": "Sumit Gulwani. Programming by examples: Applications, algorithms, and ambiguity resolution. In", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 203, + 499, + 216 + ], + "spans": [ + { + "bbox": [ + 115, + 203, + 499, + 216 + ], + "score": 1.0, + "content": "Proceedings of the 8th International Joint Conference on Automated Reasoning (IJCAR), 2016.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 108, + 220, + 505, + 255 + ], + "lines": [ + { + "bbox": [ + 106, + 220, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 220, + 505, + 234 + ], + "score": 1.0, + "content": "Sumit Gulwani, Susmit Jha, Ashish Tiwari, and Ramarathnam Venkatesan. Synthesis of loop-free", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 231, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 115, + 231, + 505, + 246 + ], + "score": 1.0, + "content": "programs. In Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 243, + 288, + 255 + ], + "spans": [ + { + "bbox": [ + 116, + 243, + 288, + 255 + ], + "score": 1.0, + "content": "Design and Implementation (PLDI), 2011.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 260, + 505, + 294 + ], + "lines": [ + { + "bbox": [ + 105, + 260, + 506, + 275 + ], + "spans": [ + { + "bbox": [ + 105, + 260, + 506, + 275 + ], + "score": 1.0, + "content": "Nicolas Heess, Daniel Tarlow, and John Winn. Learning to pass expectation propagation messages.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 271, + 505, + 286 + ], + "spans": [ + { + "bbox": [ + 115, + 271, + 505, + 286 + ], + "score": 1.0, + "content": "In Proceedings of the 26th Conference on Advances in Neural Information Processing Systems", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 283, + 174, + 296 + ], + "spans": [ + { + "bbox": [ + 115, + 283, + 174, + 296 + ], + "score": 1.0, + "content": "(NIPS), 2013.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 300, + 504, + 335 + ], + "lines": [ + { + "bbox": [ + 106, + 301, + 506, + 313 + ], + "spans": [ + { + "bbox": [ + 106, + 301, + 506, + 313 + ], + "score": 1.0, + "content": "Varun Jampani, Sebastian Nowozin, Matthew Loper, and Peter V Gehler. The informed sampler: A", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 312, + 506, + 325 + ], + "spans": [ + { + "bbox": [ + 116, + 312, + 506, + 325 + ], + "score": 1.0, + "content": "discriminative approach to Bayesian inference in generative computer vision models. Computer", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 117, + 324, + 324, + 335 + ], + "spans": [ + { + "bbox": [ + 117, + 324, + 324, + 335 + ], + "score": 1.0, + "content": "Vision and Image Understanding, 136:32–44, 2015.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 340, + 504, + 375 + ], + "lines": [ + { + "bbox": [ + 105, + 340, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 505, + 354 + ], + "score": 1.0, + "content": "Armand Joulin and Tomas Mikolov. Inferring algorithmic patterns with stack-augmented recurrent", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 114, + 352, + 506, + 366 + ], + "spans": [ + { + "bbox": [ + 114, + 352, + 506, + 366 + ], + "score": 1.0, + "content": "nets. In Proceedings of the 28th Conference on Advances in Neural Information Processing", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 363, + 208, + 375 + ], + "spans": [ + { + "bbox": [ + 115, + 363, + 208, + 375 + ], + "score": 1.0, + "content": "Systems (NIPS), 2015.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 105, + 381, + 505, + 404 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 506, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 506, + 394 + ], + "score": 1.0, + "content": "Łukasz Kaiser and Ilya Sutskever. Neural GPUs learn algorithms. In Proceedings of the 4th Interna-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 392, + 335, + 405 + ], + "spans": [ + { + "bbox": [ + 115, + 392, + 335, + 405 + ], + "score": 1.0, + "content": "tional Conference on Learning Representations, 2016.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 106, + 410, + 505, + 433 + ], + "lines": [ + { + "bbox": [ + 106, + 410, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 505, + 423 + ], + "score": 1.0, + "content": "Diederik P Kingma and Max Welling. Stochastic gradient VB and the variational auto-encoder. In", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 422, + 489, + 434 + ], + "spans": [ + { + "bbox": [ + 116, + 422, + 489, + 434 + ], + "score": 1.0, + "content": "Proceedings of the 2nd International Conference on Learning Representations (ICLR), 2014.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 106, + 439, + 504, + 463 + ], + "lines": [ + { + "bbox": [ + 106, + 439, + 506, + 452 + ], + "spans": [ + { + "bbox": [ + 106, + 439, + 506, + 452 + ], + "score": 1.0, + "content": "Karol Kurach, Marcin Andrychowicz, and Ilya Sutskever. Neural random-access machines. In", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 450, + 479, + 463 + ], + "spans": [ + { + "bbox": [ + 115, + 450, + 479, + 463 + ], + "score": 1.0, + "content": "Proceedings of the 4th International Conference on Learning Representations 2016, 2015.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 108, + 468, + 505, + 502 + ], + "lines": [ + { + "bbox": [ + 106, + 469, + 505, + 481 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 505, + 481 + ], + "score": 1.0, + "content": "Yujia Li, Daniel Tarlow, Marc Brockschmidt, and Richard S. Zemel. Gated graph sequence neural", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 479, + 506, + 493 + ], + "spans": [ + { + "bbox": [ + 115, + 479, + 506, + 493 + ], + "score": 1.0, + "content": "networks. In Proceedings of the 4th International Conference on Learning Representations (ICLR),", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 490, + 142, + 502 + ], + "spans": [ + { + "bbox": [ + 115, + 490, + 142, + 502 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 108, + 508, + 504, + 543 + ], + "lines": [ + { + "bbox": [ + 106, + 509, + 505, + 521 + ], + "spans": [ + { + "bbox": [ + 106, + 509, + 505, + 521 + ], + "score": 1.0, + "content": "Wang Ling, Edward Grefenstette, Karl Moritz Hermann, Toma´s Ko ˇ cisk ˇ y, Andrew Senior, Fumin ´", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 519, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 115, + 519, + 505, + 533 + ], + "score": 1.0, + "content": "Wang, and Phil Blunsom. Latent predictor networks for code generation. In Proceedings of the", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 531, + 427, + 544 + ], + "spans": [ + { + "bbox": [ + 115, + 531, + 427, + 544 + ], + "score": 1.0, + "content": "54th Annual Meeting of the Association for Computational Linguistics, 2016.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 105, + 548, + 505, + 572 + ], + "lines": [ + { + "bbox": [ + 106, + 549, + 506, + 561 + ], + "spans": [ + { + "bbox": [ + 106, + 549, + 506, + 561 + ], + "score": 1.0, + "content": "Sarah M. Loos, Geoffrey Irving, Christian Szegedy, and Cezary Kaliszyk. Deep network guided", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 559, + 508, + 573 + ], + "spans": [ + { + "bbox": [ + 115, + 559, + 508, + 573 + ], + "score": 1.0, + "content": "proof search. CoRR, abs/1701.06972, 2017. URL http://arxiv.org/abs/1701.06972.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 108, + 577, + 506, + 612 + ], + "lines": [ + { + "bbox": [ + 106, + 578, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 505, + 590 + ], + "score": 1.0, + "content": "Aditya Krishna Menon, Omer Tamuz, Sumit Gulwani, Butler W Lampson, and Adam Kalai. A", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 589, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 115, + 589, + 506, + 603 + ], + "score": 1.0, + "content": "machine learning framework for programming by example. In Proceedings of the International", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 599, + 314, + 613 + ], + "spans": [ + { + "bbox": [ + 116, + 599, + 314, + 613 + ], + "score": 1.0, + "content": "Conference on Machine Learning (ICML), 2013.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 618, + 504, + 652 + ], + "lines": [ + { + "bbox": [ + 105, + 617, + 506, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 506, + 632 + ], + "score": 1.0, + "content": "Arvind Neelakantan, Quoc V. Le, and Ilya Sutskever. Neural programmer: Inducing latent pro-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 629, + 506, + 643 + ], + "spans": [ + { + "bbox": [ + 116, + 629, + 506, + 643 + ], + "score": 1.0, + "content": "grams with gradient descent. In Proceedings of the 4th International Conference on Learning", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 640, + 240, + 653 + ], + "spans": [ + { + "bbox": [ + 115, + 640, + 240, + 653 + ], + "score": 1.0, + "content": "Representations (ICLR), 2016.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 108, + 658, + 505, + 692 + ], + "lines": [ + { + "bbox": [ + 106, + 658, + 507, + 671 + ], + "spans": [ + { + "bbox": [ + 106, + 658, + 507, + 671 + ], + "score": 1.0, + "content": "Chris Piech, Jonathan Huang, Andy Nguyen, Mike Phulsuksombati, Mehran Sahami, and Leonidas J.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 669, + 506, + 683 + ], + "spans": [ + { + "bbox": [ + 115, + 669, + 506, + 683 + ], + "score": 1.0, + "content": "Guibas. Learning program embeddings to propagate feedback on student code. In Proceedings of", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 681, + 406, + 693 + ], + "spans": [ + { + "bbox": [ + 116, + 681, + 406, + 693 + ], + "score": 1.0, + "content": "the 32nd International Conference on Machine Learning (ICML), 2015.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 506, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 697, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 506, + 712 + ], + "score": 1.0, + "content": "Oleksandr Polozov and Sumit Gulwani. FlashMeta: a framework for inductive program synthe-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 115, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 115, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "sis. In Proceedings of the International Conference on Object-Oriented Programming, Systems,", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 116, + 721, + 308, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 308, + 733 + ], + "score": 1.0, + "content": "Languages, and Applications (OOPSLA), 2015.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46 + } + ], + "page_idx": 9, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "10", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 506, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 506, + 94 + ], + "score": 1.0, + "content": "Alex Graves, Greg Wayne, and Ivo Danihelka. Neural Turing machines. CoRR, abs/1410.5401, 2014.", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 117, + 93, + 323, + 106 + ], + "spans": [ + { + "bbox": [ + 117, + 93, + 323, + 106 + ], + "score": 1.0, + "content": "URL http://arxiv.org/abs/1410.5401.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 106, + 83, + 506, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 111, + 505, + 145 + ], + "lines": [ + { + "bbox": [ + 106, + 111, + 507, + 124 + ], + "spans": [ + { + "bbox": [ + 106, + 111, + 507, + 124 + ], + "score": 1.0, + "content": "Alex Graves, Greg Wayne, Malcolm Reynolds, Tim Harley, Ivo Danihelka, Agnieszka Grabska-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 122, + 507, + 136 + ], + "spans": [ + { + "bbox": [ + 115, + 122, + 507, + 136 + ], + "score": 1.0, + "content": "Barwinska, Sergio G ´ omez Colmenarejo, Edward Grefenstette, Tiago Ramalho, John Agapiou, ´", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 134, + 496, + 146 + ], + "spans": [ + { + "bbox": [ + 115, + 134, + 496, + 146 + ], + "score": 1.0, + "content": "et al. Hybrid computing using a neural network with dynamic external memory. Nature, 2016.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3, + "bbox_fs": [ + 106, + 111, + 507, + 146 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 151, + 504, + 185 + ], + "lines": [ + { + "bbox": [ + 105, + 150, + 506, + 165 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 506, + 165 + ], + "score": 1.0, + "content": "Edward Grefenstette, Karl Moritz Hermann, Mustafa Suleyman, and Phil Blunsom. Learning to", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 163, + 506, + 175 + ], + "spans": [ + { + "bbox": [ + 116, + 163, + 506, + 175 + ], + "score": 1.0, + "content": "transduce with unbounded memory. In Proceedings of the 28th Conference on Advances in Neural", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 173, + 304, + 187 + ], + "spans": [ + { + "bbox": [ + 116, + 173, + 304, + 187 + ], + "score": 1.0, + "content": "Information Processing Systems (NIPS), 2015.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 105, + 150, + 506, + 187 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 191, + 504, + 215 + ], + "lines": [ + { + "bbox": [ + 106, + 191, + 505, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 191, + 505, + 204 + ], + "score": 1.0, + "content": "Sumit Gulwani. Programming by examples: Applications, algorithms, and ambiguity resolution. In", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 203, + 499, + 216 + ], + "spans": [ + { + "bbox": [ + 115, + 203, + 499, + 216 + ], + "score": 1.0, + "content": "Proceedings of the 8th International Joint Conference on Automated Reasoning (IJCAR), 2016.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 106, + 191, + 505, + 216 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 220, + 505, + 255 + ], + "lines": [ + { + "bbox": [ + 106, + 220, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 220, + 505, + 234 + ], + "score": 1.0, + "content": "Sumit Gulwani, Susmit Jha, Ashish Tiwari, and Ramarathnam Venkatesan. Synthesis of loop-free", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 231, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 115, + 231, + 505, + 246 + ], + "score": 1.0, + "content": "programs. In Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 243, + 288, + 255 + ], + "spans": [ + { + "bbox": [ + 116, + 243, + 288, + 255 + ], + "score": 1.0, + "content": "Design and Implementation (PLDI), 2011.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11, + "bbox_fs": [ + 106, + 220, + 505, + 255 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 260, + 505, + 294 + ], + "lines": [ + { + "bbox": [ + 105, + 260, + 506, + 275 + ], + "spans": [ + { + "bbox": [ + 105, + 260, + 506, + 275 + ], + "score": 1.0, + "content": "Nicolas Heess, Daniel Tarlow, and John Winn. Learning to pass expectation propagation messages.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 271, + 505, + 286 + ], + "spans": [ + { + "bbox": [ + 115, + 271, + 505, + 286 + ], + "score": 1.0, + "content": "In Proceedings of the 26th Conference on Advances in Neural Information Processing Systems", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 283, + 174, + 296 + ], + "spans": [ + { + "bbox": [ + 115, + 283, + 174, + 296 + ], + "score": 1.0, + "content": "(NIPS), 2013.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 260, + 506, + 296 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 300, + 504, + 335 + ], + "lines": [ + { + "bbox": [ + 106, + 301, + 506, + 313 + ], + "spans": [ + { + "bbox": [ + 106, + 301, + 506, + 313 + ], + "score": 1.0, + "content": "Varun Jampani, Sebastian Nowozin, Matthew Loper, and Peter V Gehler. The informed sampler: A", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 312, + 506, + 325 + ], + "spans": [ + { + "bbox": [ + 116, + 312, + 506, + 325 + ], + "score": 1.0, + "content": "discriminative approach to Bayesian inference in generative computer vision models. Computer", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 117, + 324, + 324, + 335 + ], + "spans": [ + { + "bbox": [ + 117, + 324, + 324, + 335 + ], + "score": 1.0, + "content": "Vision and Image Understanding, 136:32–44, 2015.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17, + "bbox_fs": [ + 106, + 301, + 506, + 335 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 340, + 504, + 375 + ], + "lines": [ + { + "bbox": [ + 105, + 340, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 505, + 354 + ], + "score": 1.0, + "content": "Armand Joulin and Tomas Mikolov. Inferring algorithmic patterns with stack-augmented recurrent", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 114, + 352, + 506, + 366 + ], + "spans": [ + { + "bbox": [ + 114, + 352, + 506, + 366 + ], + "score": 1.0, + "content": "nets. In Proceedings of the 28th Conference on Advances in Neural Information Processing", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 363, + 208, + 375 + ], + "spans": [ + { + "bbox": [ + 115, + 363, + 208, + 375 + ], + "score": 1.0, + "content": "Systems (NIPS), 2015.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 340, + 506, + 375 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 381, + 505, + 404 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 506, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 506, + 394 + ], + "score": 1.0, + "content": "Łukasz Kaiser and Ilya Sutskever. Neural GPUs learn algorithms. In Proceedings of the 4th Interna-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 392, + 335, + 405 + ], + "spans": [ + { + "bbox": [ + 115, + 392, + 335, + 405 + ], + "score": 1.0, + "content": "tional Conference on Learning Representations, 2016.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 381, + 506, + 405 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 410, + 505, + 433 + ], + "lines": [ + { + "bbox": [ + 106, + 410, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 505, + 423 + ], + "score": 1.0, + "content": "Diederik P Kingma and Max Welling. Stochastic gradient VB and the variational auto-encoder. In", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 422, + 489, + 434 + ], + "spans": [ + { + "bbox": [ + 116, + 422, + 489, + 434 + ], + "score": 1.0, + "content": "Proceedings of the 2nd International Conference on Learning Representations (ICLR), 2014.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 106, + 410, + 505, + 434 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 439, + 504, + 463 + ], + "lines": [ + { + "bbox": [ + 106, + 439, + 506, + 452 + ], + "spans": [ + { + "bbox": [ + 106, + 439, + 506, + 452 + ], + "score": 1.0, + "content": "Karol Kurach, Marcin Andrychowicz, and Ilya Sutskever. Neural random-access machines. In", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 450, + 479, + 463 + ], + "spans": [ + { + "bbox": [ + 115, + 450, + 479, + 463 + ], + "score": 1.0, + "content": "Proceedings of the 4th International Conference on Learning Representations 2016, 2015.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 106, + 439, + 506, + 463 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 468, + 505, + 502 + ], + "lines": [ + { + "bbox": [ + 106, + 469, + 505, + 481 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 505, + 481 + ], + "score": 1.0, + "content": "Yujia Li, Daniel Tarlow, Marc Brockschmidt, and Richard S. Zemel. Gated graph sequence neural", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 479, + 506, + 493 + ], + "spans": [ + { + "bbox": [ + 115, + 479, + 506, + 493 + ], + "score": 1.0, + "content": "networks. In Proceedings of the 4th International Conference on Learning Representations (ICLR),", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 490, + 142, + 502 + ], + "spans": [ + { + "bbox": [ + 115, + 490, + 142, + 502 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29, + "bbox_fs": [ + 106, + 469, + 506, + 502 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 508, + 504, + 543 + ], + "lines": [ + { + "bbox": [ + 106, + 509, + 505, + 521 + ], + "spans": [ + { + "bbox": [ + 106, + 509, + 505, + 521 + ], + "score": 1.0, + "content": "Wang Ling, Edward Grefenstette, Karl Moritz Hermann, Toma´s Ko ˇ cisk ˇ y, Andrew Senior, Fumin ´", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 519, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 115, + 519, + 505, + 533 + ], + "score": 1.0, + "content": "Wang, and Phil Blunsom. Latent predictor networks for code generation. In Proceedings of the", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 531, + 427, + 544 + ], + "spans": [ + { + "bbox": [ + 115, + 531, + 427, + 544 + ], + "score": 1.0, + "content": "54th Annual Meeting of the Association for Computational Linguistics, 2016.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32, + "bbox_fs": [ + 106, + 509, + 505, + 544 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 548, + 505, + 572 + ], + "lines": [ + { + "bbox": [ + 106, + 549, + 506, + 561 + ], + "spans": [ + { + "bbox": [ + 106, + 549, + 506, + 561 + ], + "score": 1.0, + "content": "Sarah M. Loos, Geoffrey Irving, Christian Szegedy, and Cezary Kaliszyk. Deep network guided", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 559, + 508, + 573 + ], + "spans": [ + { + "bbox": [ + 115, + 559, + 508, + 573 + ], + "score": 1.0, + "content": "proof search. CoRR, abs/1701.06972, 2017. URL http://arxiv.org/abs/1701.06972.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5, + "bbox_fs": [ + 106, + 549, + 508, + 573 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 577, + 506, + 612 + ], + "lines": [ + { + "bbox": [ + 106, + 578, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 505, + 590 + ], + "score": 1.0, + "content": "Aditya Krishna Menon, Omer Tamuz, Sumit Gulwani, Butler W Lampson, and Adam Kalai. A", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 589, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 115, + 589, + 506, + 603 + ], + "score": 1.0, + "content": "machine learning framework for programming by example. In Proceedings of the International", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 599, + 314, + 613 + ], + "spans": [ + { + "bbox": [ + 116, + 599, + 314, + 613 + ], + "score": 1.0, + "content": "Conference on Machine Learning (ICML), 2013.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37, + "bbox_fs": [ + 106, + 578, + 506, + 613 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 618, + 504, + 652 + ], + "lines": [ + { + "bbox": [ + 105, + 617, + 506, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 506, + 632 + ], + "score": 1.0, + "content": "Arvind Neelakantan, Quoc V. Le, and Ilya Sutskever. Neural programmer: Inducing latent pro-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 629, + 506, + 643 + ], + "spans": [ + { + "bbox": [ + 116, + 629, + 506, + 643 + ], + "score": 1.0, + "content": "grams with gradient descent. In Proceedings of the 4th International Conference on Learning", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 640, + 240, + 653 + ], + "spans": [ + { + "bbox": [ + 115, + 640, + 240, + 653 + ], + "score": 1.0, + "content": "Representations (ICLR), 2016.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 617, + 506, + 653 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 658, + 505, + 692 + ], + "lines": [ + { + "bbox": [ + 106, + 658, + 507, + 671 + ], + "spans": [ + { + "bbox": [ + 106, + 658, + 507, + 671 + ], + "score": 1.0, + "content": "Chris Piech, Jonathan Huang, Andy Nguyen, Mike Phulsuksombati, Mehran Sahami, and Leonidas J.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 669, + 506, + 683 + ], + "spans": [ + { + "bbox": [ + 115, + 669, + 506, + 683 + ], + "score": 1.0, + "content": "Guibas. Learning program embeddings to propagate feedback on student code. In Proceedings of", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 681, + 406, + 693 + ], + "spans": [ + { + "bbox": [ + 116, + 681, + 406, + 693 + ], + "score": 1.0, + "content": "the 32nd International Conference on Machine Learning (ICML), 2015.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43, + "bbox_fs": [ + 106, + 658, + 507, + 693 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 506, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 697, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 506, + 712 + ], + "score": 1.0, + "content": "Oleksandr Polozov and Sumit Gulwani. FlashMeta: a framework for inductive program synthe-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 115, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 115, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "sis. In Proceedings of the International Conference on Object-Oriented Programming, Systems,", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 116, + 721, + 308, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 308, + 733 + ], + "score": 1.0, + "content": "Languages, and Applications (OOPSLA), 2015.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46, + "bbox_fs": [ + 105, + 697, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Scott E. Reed and Nando de Freitas. Neural programmer-interpreters. In Proceedings of the 4th", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 396, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 396, + 106 + ], + "score": 1.0, + "content": "International Conference on Learning Representations (ICLR), 2016.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 112, + 504, + 136 + ], + "lines": [ + { + "bbox": [ + 106, + 113, + 504, + 124 + ], + "spans": [ + { + "bbox": [ + 106, + 113, + 504, + 124 + ], + "score": 1.0, + "content": "Sebastian Riedel, Matko Bosnjak, and Tim Rocktaschel. Programming with a differentiable forth ¨", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 123, + 500, + 136 + ], + "spans": [ + { + "bbox": [ + 116, + 123, + 500, + 136 + ], + "score": 1.0, + "content": "interpreter. CoRR, abs/1605.06640, 2016. URL http://arxiv.org/abs/1605.06640.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 105, + 141, + 504, + 165 + ], + "lines": [ + { + "bbox": [ + 105, + 141, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 141, + 506, + 156 + ], + "score": 1.0, + "content": "Eric Schkufza, Rahul Sharma, and Alex Aiken. Stochastic program optimization. Commununications", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 153, + 256, + 165 + ], + "spans": [ + { + "bbox": [ + 116, + 153, + 256, + 165 + ], + "score": 1.0, + "content": "of the ACM, 59(2):114–122, 2016.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 108, + 171, + 504, + 206 + ], + "lines": [ + { + "bbox": [ + 105, + 171, + 506, + 185 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 506, + 185 + ], + "score": 1.0, + "content": "Jamie Shotton, Toby Sharp, Alex Kipman, Andrew Fitzgibbon, Mark Finocchio, Andrew Blake, Mat", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 182, + 506, + 197 + ], + "spans": [ + { + "bbox": [ + 115, + 182, + 506, + 197 + ], + "score": 1.0, + "content": "Cook, and Richard Moore. Real-time human pose recognition in parts from single depth images.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 193, + 326, + 206 + ], + "spans": [ + { + "bbox": [ + 116, + 193, + 326, + 206 + ], + "score": 1.0, + "content": "Communications of the ACM, 56(1):116–124, 2013.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 104, + 212, + 505, + 236 + ], + "lines": [ + { + "bbox": [ + 105, + 213, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 213, + 505, + 226 + ], + "score": 1.0, + "content": "Rishabh Singh and Sumit Gulwani. Predicting a correct program in programming by example. In", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 223, + 445, + 236 + ], + "spans": [ + { + "bbox": [ + 115, + 223, + 445, + 236 + ], + "score": 1.0, + "content": "Proceedings of the 27th Conference on Computer Aided Verification (CAV), 2015.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 105, + 242, + 505, + 265 + ], + "lines": [ + { + "bbox": [ + 104, + 240, + 507, + 257 + ], + "spans": [ + { + "bbox": [ + 104, + 240, + 507, + 257 + ], + "score": 1.0, + "content": "Armando Solar-Lezama. Program Synthesis By Sketching. PhD thesis, EECS Dept., UC Berkeley,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 114, + 252, + 144, + 266 + ], + "spans": [ + { + "bbox": [ + 114, + 252, + 144, + 266 + ], + "score": 1.0, + "content": "2008.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 107, + 272, + 505, + 306 + ], + "lines": [ + { + "bbox": [ + 106, + 273, + 506, + 285 + ], + "spans": [ + { + "bbox": [ + 106, + 273, + 506, + 285 + ], + "score": 1.0, + "content": "Andreas Stuhlmuller, Jessica Taylor, and Noah D. Goodman. Learning stochastic inverses. In ¨ Pro-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 283, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 115, + 283, + 506, + 297 + ], + "score": 1.0, + "content": "ceedings of the 26th Conference on Advances in Neural Information Processing Systems (NIPS),", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 293, + 143, + 307 + ], + "spans": [ + { + "bbox": [ + 115, + 293, + 143, + 307 + ], + "score": 1.0, + "content": "2013.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 106, + 313, + 505, + 347 + ], + "lines": [ + { + "bbox": [ + 106, + 313, + 506, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 506, + 326 + ], + "score": 1.0, + "content": "Sainbayar Sukhbaatar, Arthur Szlam, Jason Weston, and Rob Fergus. End-to-end memory networks.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 324, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 115, + 324, + 506, + 338 + ], + "score": 1.0, + "content": "In Proceedings of the 28th Conference on Advances in Neural Information Processing Systems", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 335, + 174, + 348 + ], + "spans": [ + { + "bbox": [ + 115, + 335, + 174, + 348 + ], + "score": 1.0, + "content": "(NIPS), 2015.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 105, + 354, + 504, + 378 + ], + "lines": [ + { + "bbox": [ + 106, + 354, + 506, + 367 + ], + "spans": [ + { + "bbox": [ + 106, + 354, + 506, + 367 + ], + "score": 1.0, + "content": "Jason Weston, Sumit Chopra, and Antoine Bordes. Memory networks. In Proceedings of the 3rd", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 365, + 396, + 378 + ], + "spans": [ + { + "bbox": [ + 115, + 365, + 396, + 378 + ], + "score": 1.0, + "content": "International Conference on Learning Representations (ICLR), 2015.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 107, + 384, + 505, + 418 + ], + "lines": [ + { + "bbox": [ + 105, + 383, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 383, + 505, + 397 + ], + "score": 1.0, + "content": "Wojciech Zaremba, Tomas Mikolov, Armand Joulin, and Rob Fergus. Learning simple algorithms", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 114, + 394, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 114, + 394, + 505, + 409 + ], + "score": 1.0, + "content": "from examples. In Proceedings of the 33nd International Conference on Machine Learning", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 406, + 176, + 419 + ], + "spans": [ + { + "bbox": [ + 115, + 406, + 176, + 419 + ], + "score": 1.0, + "content": "(ICML), 2016.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + } + ], + "page_idx": 10, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Scott E. Reed and Nando de Freitas. Neural programmer-interpreters. In Proceedings of the 4th", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 396, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 396, + 106 + ], + "score": 1.0, + "content": "International Conference on Learning Representations (ICLR), 2016.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 106, + 82, + 505, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 112, + 504, + 136 + ], + "lines": [ + { + "bbox": [ + 106, + 113, + 504, + 124 + ], + "spans": [ + { + "bbox": [ + 106, + 113, + 504, + 124 + ], + "score": 1.0, + "content": "Sebastian Riedel, Matko Bosnjak, and Tim Rocktaschel. Programming with a differentiable forth ¨", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 123, + 500, + 136 + ], + "spans": [ + { + "bbox": [ + 116, + 123, + 500, + 136 + ], + "score": 1.0, + "content": "interpreter. CoRR, abs/1605.06640, 2016. URL http://arxiv.org/abs/1605.06640.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 106, + 113, + 504, + 136 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 141, + 504, + 165 + ], + "lines": [ + { + "bbox": [ + 105, + 141, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 141, + 506, + 156 + ], + "score": 1.0, + "content": "Eric Schkufza, Rahul Sharma, and Alex Aiken. Stochastic program optimization. Commununications", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 153, + 256, + 165 + ], + "spans": [ + { + "bbox": [ + 116, + 153, + 256, + 165 + ], + "score": 1.0, + "content": "of the ACM, 59(2):114–122, 2016.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 141, + 506, + 165 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 171, + 504, + 206 + ], + "lines": [ + { + "bbox": [ + 105, + 171, + 506, + 185 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 506, + 185 + ], + "score": 1.0, + "content": "Jamie Shotton, Toby Sharp, Alex Kipman, Andrew Fitzgibbon, Mark Finocchio, Andrew Blake, Mat", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 182, + 506, + 197 + ], + "spans": [ + { + "bbox": [ + 115, + 182, + 506, + 197 + ], + "score": 1.0, + "content": "Cook, and Richard Moore. Real-time human pose recognition in parts from single depth images.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 193, + 326, + 206 + ], + "spans": [ + { + "bbox": [ + 116, + 193, + 326, + 206 + ], + "score": 1.0, + "content": "Communications of the ACM, 56(1):116–124, 2013.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 171, + 506, + 206 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 212, + 505, + 236 + ], + "lines": [ + { + "bbox": [ + 105, + 213, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 213, + 505, + 226 + ], + "score": 1.0, + "content": "Rishabh Singh and Sumit Gulwani. Predicting a correct program in programming by example. In", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 223, + 445, + 236 + ], + "spans": [ + { + "bbox": [ + 115, + 223, + 445, + 236 + ], + "score": 1.0, + "content": "Proceedings of the 27th Conference on Computer Aided Verification (CAV), 2015.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 213, + 505, + 236 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 242, + 505, + 265 + ], + "lines": [ + { + "bbox": [ + 104, + 240, + 507, + 257 + ], + "spans": [ + { + "bbox": [ + 104, + 240, + 507, + 257 + ], + "score": 1.0, + "content": "Armando Solar-Lezama. Program Synthesis By Sketching. PhD thesis, EECS Dept., UC Berkeley,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 114, + 252, + 144, + 266 + ], + "spans": [ + { + "bbox": [ + 114, + 252, + 144, + 266 + ], + "score": 1.0, + "content": "2008.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 104, + 240, + 507, + 266 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 272, + 505, + 306 + ], + "lines": [ + { + "bbox": [ + 106, + 273, + 506, + 285 + ], + "spans": [ + { + "bbox": [ + 106, + 273, + 506, + 285 + ], + "score": 1.0, + "content": "Andreas Stuhlmuller, Jessica Taylor, and Noah D. Goodman. Learning stochastic inverses. In ¨ Pro-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 283, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 115, + 283, + 506, + 297 + ], + "score": 1.0, + "content": "ceedings of the 26th Conference on Advances in Neural Information Processing Systems (NIPS),", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 293, + 143, + 307 + ], + "spans": [ + { + "bbox": [ + 115, + 293, + 143, + 307 + ], + "score": 1.0, + "content": "2013.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14, + "bbox_fs": [ + 106, + 273, + 506, + 307 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 313, + 505, + 347 + ], + "lines": [ + { + "bbox": [ + 106, + 313, + 506, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 506, + 326 + ], + "score": 1.0, + "content": "Sainbayar Sukhbaatar, Arthur Szlam, Jason Weston, and Rob Fergus. End-to-end memory networks.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 324, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 115, + 324, + 506, + 338 + ], + "score": 1.0, + "content": "In Proceedings of the 28th Conference on Advances in Neural Information Processing Systems", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 335, + 174, + 348 + ], + "spans": [ + { + "bbox": [ + 115, + 335, + 174, + 348 + ], + "score": 1.0, + "content": "(NIPS), 2015.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17, + "bbox_fs": [ + 106, + 313, + 506, + 348 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 354, + 504, + 378 + ], + "lines": [ + { + "bbox": [ + 106, + 354, + 506, + 367 + ], + "spans": [ + { + "bbox": [ + 106, + 354, + 506, + 367 + ], + "score": 1.0, + "content": "Jason Weston, Sumit Chopra, and Antoine Bordes. Memory networks. In Proceedings of the 3rd", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 365, + 396, + 378 + ], + "spans": [ + { + "bbox": [ + 115, + 365, + 396, + 378 + ], + "score": 1.0, + "content": "International Conference on Learning Representations (ICLR), 2015.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 106, + 354, + 506, + 378 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 384, + 505, + 418 + ], + "lines": [ + { + "bbox": [ + 105, + 383, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 383, + 505, + 397 + ], + "score": 1.0, + "content": "Wojciech Zaremba, Tomas Mikolov, Armand Joulin, and Rob Fergus. Learning simple algorithms", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 114, + 394, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 114, + 394, + 505, + 409 + ], + "score": 1.0, + "content": "from examples. In Proceedings of the 33nd International Conference on Machine Learning", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 406, + 176, + 419 + ], + "spans": [ + { + "bbox": [ + 115, + 406, + 176, + 419 + ], + "score": 1.0, + "content": "(ICML), 2016.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 383, + 505, + 419 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 241, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 79, + 242, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 79, + 242, + 96 + ], + "score": 1.0, + "content": "A EXAMPLE PROGRAMS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 128, + 506, + 172 + ], + "lines": [ + { + "bbox": [ + 105, + 128, + 506, + 142 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 506, + 142 + ], + "score": 1.0, + "content": "This section shows example programs in our Domain Specific Language (DSL), together with input-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 139, + 506, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 139, + 506, + 153 + ], + "score": 1.0, + "content": "output examples and short descriptions. These programs have been inspired by simple tasks appearing", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 151, + 506, + 164 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 506, + 164 + ], + "score": 1.0, + "content": "on real programming competition websites, and are meant to illustrate the expressive power of our", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 160, + 132, + 174 + ], + "spans": [ + { + "bbox": [ + 104, + 160, + 132, + 174 + ], + "score": 1.0, + "content": "DSL.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 112, + 187, + 163, + 196 + ], + "lines": [ + { + "bbox": [ + 111, + 185, + 164, + 199 + ], + "spans": [ + { + "bbox": [ + 111, + 185, + 164, + 199 + ], + "score": 1.0, + "content": "Program 0:", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 112, + 199, + 176, + 251 + ], + "lines": [ + { + "bbox": [ + 112, + 197, + 154, + 208 + ], + "spans": [ + { + "bbox": [ + 112, + 198, + 133, + 207 + ], + "score": 0.48, + "content": "\\mathrm { k } ", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 197, + 154, + 208 + ], + "score": 1.0, + "content": "int", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 110, + 207, + 165, + 220 + ], + "spans": [ + { + "bbox": [ + 110, + 207, + 165, + 220 + ], + "score": 1.0, + "content": "b ← [int]", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 110, + 218, + 168, + 230 + ], + "spans": [ + { + "bbox": [ + 110, + 218, + 168, + 230 + ], + "score": 1.0, + "content": "c ← SORT b", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 111, + 229, + 177, + 241 + ], + "spans": [ + { + "bbox": [ + 111, + 229, + 177, + 241 + ], + "score": 1.0, + "content": "d ← TAKE k c", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 111, + 240, + 165, + 252 + ], + "spans": [ + { + "bbox": [ + 111, + 240, + 165, + 252 + ], + "score": 1.0, + "content": "e ← SUM d", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 219, + 186, + 316, + 245 + ], + "lines": [ + { + "bbox": [ + 218, + 185, + 318, + 199 + ], + "spans": [ + { + "bbox": [ + 218, + 185, + 318, + 199 + ], + "score": 1.0, + "content": "Input-output example:", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 218, + 197, + 246, + 210 + ], + "spans": [ + { + "bbox": [ + 218, + 197, + 246, + 210 + ], + "score": 1.0, + "content": "Input:", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 217, + 206, + 305, + 222 + ], + "spans": [ + { + "bbox": [ + 217, + 206, + 305, + 222 + ], + "score": 1.0, + "content": "2, [3 5 4 7 5]", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 217, + 217, + 253, + 232 + ], + "spans": [ + { + "bbox": [ + 217, + 217, + 253, + 232 + ], + "score": 1.0, + "content": "Output:", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 218, + 228, + 240, + 243 + ], + "spans": [ + { + "bbox": [ + 218, + 228, + 240, + 243 + ], + "score": 1.0, + "content": "[7]", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 326, + 186, + 377, + 196 + ], + "lines": [ + { + "bbox": [ + 325, + 185, + 378, + 197 + ], + "spans": [ + { + "bbox": [ + 325, + 185, + 378, + 197 + ], + "score": 1.0, + "content": "Description:", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 326, + 196, + 504, + 251 + ], + "lines": [ + { + "bbox": [ + 325, + 194, + 505, + 209 + ], + "spans": [ + { + "bbox": [ + 325, + 194, + 454, + 209 + ], + "score": 1.0, + "content": "A new shop near you is selling", + "type": "text" + }, + { + "bbox": [ + 454, + 198, + 462, + 206 + ], + "score": 0.67, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 194, + 505, + 209 + ], + "score": 1.0, + "content": "paintings.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 325, + 206, + 504, + 218 + ], + "spans": [ + { + "bbox": [ + 325, + 206, + 369, + 218 + ], + "score": 1.0, + "content": "You have", + "type": "text" + }, + { + "bbox": [ + 369, + 207, + 402, + 217 + ], + "score": 0.91, + "content": "k \\ < \\ n", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 206, + 504, + 218 + ], + "score": 1.0, + "content": "friends and you would", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 325, + 216, + 504, + 231 + ], + "spans": [ + { + "bbox": [ + 325, + 216, + 504, + 231 + ], + "score": 1.0, + "content": "like to buy each of your friends a painting", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 326, + 228, + 503, + 240 + ], + "spans": [ + { + "bbox": [ + 326, + 228, + 503, + 240 + ], + "score": 1.0, + "content": "from the shop. Return the minimal amount", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 326, + 240, + 461, + 252 + ], + "spans": [ + { + "bbox": [ + 326, + 240, + 461, + 252 + ], + "score": 1.0, + "content": "of money you will need to spend.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19 + }, + { + "type": "title", + "bbox": [ + 112, + 272, + 162, + 281 + ], + "lines": [ + { + "bbox": [ + 111, + 270, + 164, + 284 + ], + "spans": [ + { + "bbox": [ + 111, + 270, + 164, + 284 + ], + "score": 1.0, + "content": "Program 1:", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 111, + 283, + 211, + 336 + ], + "lines": [ + { + "bbox": [ + 112, + 282, + 164, + 292 + ], + "spans": [ + { + "bbox": [ + 112, + 283, + 133, + 292 + ], + "score": 0.36, + "content": "\\bar { w } ", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 282, + 164, + 292 + ], + "score": 1.0, + "content": "[int]", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 111, + 292, + 165, + 304 + ], + "spans": [ + { + "bbox": [ + 111, + 292, + 165, + 304 + ], + "score": 1.0, + "content": "t ← [int]", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 111, + 303, + 192, + 315 + ], + "spans": [ + { + "bbox": [ + 111, + 303, + 192, + 315 + ], + "score": 1.0, + "content": "c ← MAP (*3) w", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 111, + 314, + 213, + 326 + ], + "spans": [ + { + "bbox": [ + 111, + 314, + 213, + 326 + ], + "score": 1.0, + "content": "d ← ZIPWITH (+) c t", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 111, + 325, + 192, + 336 + ], + "spans": [ + { + "bbox": [ + 111, + 325, + 192, + 336 + ], + "score": 1.0, + "content": "e ← MAXIMUM d", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 219, + 270, + 317, + 336 + ], + "lines": [ + { + "bbox": [ + 219, + 269, + 318, + 285 + ], + "spans": [ + { + "bbox": [ + 219, + 269, + 318, + 285 + ], + "score": 1.0, + "content": "Input-output example:", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 218, + 281, + 247, + 294 + ], + "spans": [ + { + "bbox": [ + 218, + 281, + 247, + 294 + ], + "score": 1.0, + "content": "Input:", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 218, + 292, + 291, + 305 + ], + "spans": [ + { + "bbox": [ + 218, + 292, + 291, + 305 + ], + "score": 1.0, + "content": "[6 2 4 7 9],", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 219, + 302, + 288, + 316 + ], + "spans": [ + { + "bbox": [ + 219, + 302, + 288, + 316 + ], + "score": 1.0, + "content": "[5 3 6 1 0]", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 218, + 314, + 253, + 327 + ], + "spans": [ + { + "bbox": [ + 218, + 314, + 253, + 327 + ], + "score": 1.0, + "content": "Output:", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 218, + 324, + 235, + 338 + ], + "spans": [ + { + "bbox": [ + 218, + 324, + 235, + 338 + ], + "score": 1.0, + "content": "27", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 326, + 265, + 377, + 275 + ], + "lines": [ + { + "bbox": [ + 325, + 262, + 378, + 277 + ], + "spans": [ + { + "bbox": [ + 325, + 262, + 378, + 277 + ], + "score": 1.0, + "content": "Description:", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 326, + 275, + 504, + 352 + ], + "lines": [ + { + "bbox": [ + 325, + 275, + 503, + 287 + ], + "spans": [ + { + "bbox": [ + 325, + 275, + 503, + 287 + ], + "score": 1.0, + "content": "In soccer leagues, match winners are", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 325, + 285, + 503, + 297 + ], + "spans": [ + { + "bbox": [ + 325, + 285, + 503, + 297 + ], + "score": 1.0, + "content": "awarded 3 points, losers 0 points, and both", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 325, + 297, + 504, + 308 + ], + "spans": [ + { + "bbox": [ + 325, + 297, + 504, + 308 + ], + "score": 1.0, + "content": "teams get 1 point in the case of a tie. Com-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 324, + 307, + 504, + 320 + ], + "spans": [ + { + "bbox": [ + 324, + 307, + 504, + 320 + ], + "score": 1.0, + "content": "pute the number of points awarded to the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 325, + 318, + 504, + 330 + ], + "spans": [ + { + "bbox": [ + 325, + 318, + 473, + 330 + ], + "score": 1.0, + "content": "winner of a league given two arrays", + "type": "text" + }, + { + "bbox": [ + 474, + 320, + 491, + 330 + ], + "score": 0.88, + "content": "w , t", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 318, + 504, + 330 + ], + "score": 1.0, + "content": "of", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 326, + 330, + 503, + 342 + ], + "spans": [ + { + "bbox": [ + 326, + 330, + 418, + 342 + ], + "score": 1.0, + "content": "the same length, where", + "type": "text" + }, + { + "bbox": [ + 419, + 330, + 436, + 342 + ], + "score": 0.83, + "content": "w [ i ]", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 330, + 461, + 342 + ], + "score": 1.0, + "content": "(resp.", + "type": "text" + }, + { + "bbox": [ + 461, + 330, + 476, + 342 + ], + "score": 0.8, + "content": "t [ i ] ,", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 330, + 503, + 342 + ], + "score": 1.0, + "content": ") is the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 325, + 340, + 489, + 353 + ], + "spans": [ + { + "bbox": [ + 325, + 340, + 415, + 353 + ], + "score": 1.0, + "content": "number of times team", + "type": "text" + }, + { + "bbox": [ + 416, + 342, + 421, + 351 + ], + "score": 0.64, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 340, + 489, + 353 + ], + "score": 1.0, + "content": "won (resp. tied).", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 38 + }, + { + "type": "title", + "bbox": [ + 113, + 366, + 162, + 376 + ], + "lines": [ + { + "bbox": [ + 111, + 365, + 164, + 378 + ], + "spans": [ + { + "bbox": [ + 111, + 365, + 164, + 378 + ], + "score": 1.0, + "content": "Program 2:", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 42 + }, + { + "type": "text", + "bbox": [ + 111, + 378, + 212, + 421 + ], + "lines": [ + { + "bbox": [ + 111, + 376, + 165, + 388 + ], + "spans": [ + { + "bbox": [ + 111, + 376, + 165, + 388 + ], + "score": 1.0, + "content": "a ← [int]", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 110, + 388, + 165, + 399 + ], + "spans": [ + { + "bbox": [ + 110, + 388, + 165, + 399 + ], + "score": 1.0, + "content": "b ← [int]", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 110, + 398, + 213, + 410 + ], + "spans": [ + { + "bbox": [ + 110, + 398, + 213, + 410 + ], + "score": 1.0, + "content": "c ← ZIPWITH (-) b a", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 113, + 408, + 203, + 422 + ], + "spans": [ + { + "bbox": [ + 113, + 410, + 166, + 420 + ], + "score": 0.31, + "content": "\\mathsf { d } \\gets \\mathbf { C o u v r } \\mathsf { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 410, + 188, + 420 + ], + "score": 0.35, + "content": "( > 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 408, + 203, + 422 + ], + "score": 1.0, + "content": ") c", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 44.5 + }, + { + "type": "title", + "bbox": [ + 219, + 366, + 317, + 376 + ], + "lines": [ + { + "bbox": [ + 219, + 365, + 318, + 380 + ], + "spans": [ + { + "bbox": [ + 219, + 365, + 318, + 380 + ], + "score": 1.0, + "content": "Input-output example:", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 47 + }, + { + "type": "text", + "bbox": [ + 219, + 378, + 289, + 430 + ], + "lines": [ + { + "bbox": [ + 217, + 375, + 248, + 389 + ], + "spans": [ + { + "bbox": [ + 217, + 375, + 248, + 389 + ], + "score": 1.0, + "content": "Input:", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 218, + 386, + 291, + 400 + ], + "spans": [ + { + "bbox": [ + 218, + 386, + 291, + 400 + ], + "score": 1.0, + "content": "[6 2 4 7 9],", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 218, + 397, + 289, + 411 + ], + "spans": [ + { + "bbox": [ + 218, + 397, + 289, + 411 + ], + "score": 1.0, + "content": "[5 3 2 1 0]", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 217, + 407, + 254, + 423 + ], + "spans": [ + { + "bbox": [ + 217, + 407, + 254, + 423 + ], + "score": 1.0, + "content": "Output:", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 217, + 420, + 229, + 432 + ], + "spans": [ + { + "bbox": [ + 217, + 420, + 229, + 432 + ], + "score": 1.0, + "content": "4", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 50 + }, + { + "type": "text", + "bbox": [ + 326, + 366, + 376, + 376 + ], + "lines": [ + { + "bbox": [ + 325, + 363, + 379, + 378 + ], + "spans": [ + { + "bbox": [ + 325, + 363, + 379, + 378 + ], + "score": 1.0, + "content": "Description:", + "type": "text" + } + ], + "index": 53 + } + ], + "index": 53 + }, + { + "type": "text", + "bbox": [ + 326, + 377, + 504, + 430 + ], + "lines": [ + { + "bbox": [ + 325, + 376, + 502, + 387 + ], + "spans": [ + { + "bbox": [ + 325, + 376, + 502, + 387 + ], + "score": 1.0, + "content": "Alice and Bob are comparing their results in", + "type": "text" + } + ], + "index": 54 + }, + { + "bbox": [ + 324, + 385, + 504, + 400 + ], + "spans": [ + { + "bbox": [ + 324, + 385, + 504, + 400 + ], + "score": 1.0, + "content": "a recent exam. Given their marks per ques-", + "type": "text" + } + ], + "index": 55 + }, + { + "bbox": [ + 326, + 399, + 502, + 410 + ], + "spans": [ + { + "bbox": [ + 326, + 399, + 406, + 410 + ], + "score": 1.0, + "content": "tion as two arrays", + "type": "text" + }, + { + "bbox": [ + 406, + 401, + 413, + 408 + ], + "score": 0.63, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 399, + 433, + 410 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 433, + 399, + 439, + 408 + ], + "score": 0.6, + "content": "b", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 399, + 502, + 410 + ], + "score": 1.0, + "content": ", count on how", + "type": "text" + } + ], + "index": 56 + }, + { + "bbox": [ + 325, + 409, + 502, + 421 + ], + "spans": [ + { + "bbox": [ + 325, + 409, + 502, + 421 + ], + "score": 1.0, + "content": "many questions Alice got more points than", + "type": "text" + } + ], + "index": 57 + }, + { + "bbox": [ + 325, + 419, + 349, + 432 + ], + "spans": [ + { + "bbox": [ + 325, + 419, + 349, + 432 + ], + "score": 1.0, + "content": "Bob.", + "type": "text" + } + ], + "index": 58 + } + ], + "index": 56 + }, + { + "type": "title", + "bbox": [ + 113, + 444, + 162, + 453 + ], + "lines": [ + { + "bbox": [ + 111, + 442, + 164, + 456 + ], + "spans": [ + { + "bbox": [ + 111, + 442, + 164, + 456 + ], + "score": 1.0, + "content": "Program 3:", + "type": "text" + } + ], + "index": 59 + } + ], + "index": 59 + }, + { + "type": "text", + "bbox": [ + 112, + 455, + 211, + 509 + ], + "lines": [ + { + "bbox": [ + 110, + 452, + 165, + 465 + ], + "spans": [ + { + "bbox": [ + 110, + 452, + 165, + 465 + ], + "score": 1.0, + "content": "h ← [int]", + "type": "text" + } + ], + "index": 60 + }, + { + "bbox": [ + 111, + 464, + 201, + 475 + ], + "spans": [ + { + "bbox": [ + 111, + 464, + 201, + 475 + ], + "score": 1.0, + "content": "b ← SCANL1 MIN h", + "type": "text" + } + ], + "index": 61 + }, + { + "bbox": [ + 110, + 475, + 213, + 487 + ], + "spans": [ + { + "bbox": [ + 110, + 475, + 213, + 487 + ], + "score": 1.0, + "content": "c ← ZIPWITH (-) h b", + "type": "text" + } + ], + "index": 62 + }, + { + "bbox": [ + 113, + 486, + 202, + 499 + ], + "spans": [ + { + "bbox": [ + 113, + 488, + 133, + 497 + ], + "score": 0.27, + "content": "\\mathrm { ~ d ~ } ", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 486, + 169, + 499 + ], + "score": 1.0, + "content": "FILTER", + "type": "text" + }, + { + "bbox": [ + 169, + 488, + 187, + 498 + ], + "score": 0.31, + "content": "( > 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 486, + 202, + 499 + ], + "score": 1.0, + "content": ") c", + "type": "text" + } + ], + "index": 63 + }, + { + "bbox": [ + 113, + 498, + 164, + 508 + ], + "spans": [ + { + "bbox": [ + 113, + 498, + 164, + 508 + ], + "score": 0.54, + "content": "\\mathrm { ~ e ~ } { \\gets } \\mathbf { S } \\mathbf { U } \\mathbf { M } \\mathrm { ~ d ~ }", + "type": "inline_equation" + } + ], + "index": 64 + } + ], + "index": 62 + }, + { + "type": "text", + "bbox": [ + 219, + 444, + 318, + 501 + ], + "lines": [ + { + "bbox": [ + 218, + 442, + 318, + 457 + ], + "spans": [ + { + "bbox": [ + 218, + 442, + 318, + 457 + ], + "score": 1.0, + "content": "Input-output example:", + "type": "text" + } + ], + "index": 65 + }, + { + "bbox": [ + 218, + 453, + 246, + 466 + ], + "spans": [ + { + "bbox": [ + 218, + 453, + 246, + 466 + ], + "score": 1.0, + "content": "Input:", + "type": "text" + } + ], + "index": 66 + }, + { + "bbox": [ + 218, + 464, + 287, + 478 + ], + "spans": [ + { + "bbox": [ + 218, + 464, + 287, + 478 + ], + "score": 1.0, + "content": "[8 5 7 2 5]", + "type": "text" + } + ], + "index": 67 + }, + { + "bbox": [ + 217, + 474, + 253, + 489 + ], + "spans": [ + { + "bbox": [ + 217, + 474, + 253, + 489 + ], + "score": 1.0, + "content": "Output:", + "type": "text" + } + ], + "index": 68 + }, + { + "bbox": [ + 218, + 486, + 228, + 498 + ], + "spans": [ + { + "bbox": [ + 218, + 486, + 228, + 498 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ], + "index": 69 + } + ], + "index": 67 + }, + { + "type": "text", + "bbox": [ + 325, + 443, + 376, + 453 + ], + "lines": [ + { + "bbox": [ + 325, + 442, + 378, + 455 + ], + "spans": [ + { + "bbox": [ + 325, + 442, + 378, + 455 + ], + "score": 1.0, + "content": "Description:", + "type": "text" + } + ], + "index": 70 + } + ], + "index": 70 + }, + { + "type": "text", + "bbox": [ + 326, + 455, + 503, + 519 + ], + "lines": [ + { + "bbox": [ + 325, + 453, + 503, + 466 + ], + "spans": [ + { + "bbox": [ + 325, + 453, + 503, + 466 + ], + "score": 1.0, + "content": "Perditia is very peculiar about her garden", + "type": "text" + } + ], + "index": 71 + }, + { + "bbox": [ + 325, + 464, + 503, + 476 + ], + "spans": [ + { + "bbox": [ + 325, + 464, + 503, + 476 + ], + "score": 1.0, + "content": "and wants that the trees standing in a row are", + "type": "text" + } + ], + "index": 72 + }, + { + "bbox": [ + 325, + 475, + 503, + 487 + ], + "spans": [ + { + "bbox": [ + 325, + 475, + 503, + 487 + ], + "score": 1.0, + "content": "all of non-increasing heights. Given the tree", + "type": "text" + } + ], + "index": 73 + }, + { + "bbox": [ + 325, + 486, + 504, + 498 + ], + "spans": [ + { + "bbox": [ + 325, + 486, + 504, + 498 + ], + "score": 1.0, + "content": "heights in centimeters in order of the row as", + "type": "text" + } + ], + "index": 74 + }, + { + "bbox": [ + 326, + 498, + 503, + 509 + ], + "spans": [ + { + "bbox": [ + 326, + 498, + 503, + 509 + ], + "score": 1.0, + "content": "an array h, compute how many centimeters", + "type": "text" + } + ], + "index": 75 + }, + { + "bbox": [ + 326, + 509, + 465, + 519 + ], + "spans": [ + { + "bbox": [ + 326, + 509, + 465, + 519 + ], + "score": 1.0, + "content": "she needs to trim the trees in total.", + "type": "text" + } + ], + "index": 76 + } + ], + "index": 73.5 + }, + { + "type": "title", + "bbox": [ + 113, + 538, + 162, + 548 + ], + "lines": [ + { + "bbox": [ + 111, + 536, + 164, + 550 + ], + "spans": [ + { + "bbox": [ + 111, + 536, + 164, + 550 + ], + "score": 1.0, + "content": "Program 4:", + "type": "text" + } + ], + "index": 77 + } + ], + "index": 77 + }, + { + "type": "text", + "bbox": [ + 111, + 549, + 211, + 625 + ], + "lines": [ + { + "bbox": [ + 110, + 548, + 164, + 559 + ], + "spans": [ + { + "bbox": [ + 110, + 548, + 164, + 559 + ], + "score": 1.0, + "content": "x ← [int]", + "type": "text" + } + ], + "index": 78 + }, + { + "bbox": [ + 110, + 559, + 165, + 570 + ], + "spans": [ + { + "bbox": [ + 110, + 559, + 165, + 570 + ], + "score": 1.0, + "content": "y ← [int]", + "type": "text" + } + ], + "index": 79 + }, + { + "bbox": [ + 112, + 571, + 167, + 581 + ], + "spans": [ + { + "bbox": [ + 112, + 571, + 167, + 581 + ], + "score": 0.26, + "content": "\\mathbf { \\boldsymbol { \\mathrm { c } } } \\gets \\mathbf { \\boldsymbol { S } } \\mathbf { \\boldsymbol { O } } \\mathbf { R } \\mathbf { \\boldsymbol { T } } \\ \\mathbf { \\boldsymbol { x } }", + "type": "inline_equation" + } + ], + "index": 80 + }, + { + "bbox": [ + 110, + 579, + 168, + 594 + ], + "spans": [ + { + "bbox": [ + 110, + 579, + 168, + 594 + ], + "score": 1.0, + "content": "d ← SORT y", + "type": "text" + } + ], + "index": 81 + }, + { + "bbox": [ + 111, + 592, + 185, + 603 + ], + "spans": [ + { + "bbox": [ + 111, + 592, + 185, + 603 + ], + "score": 1.0, + "content": "e ← REVERSE d", + "type": "text" + } + ], + "index": 82 + }, + { + "bbox": [ + 111, + 601, + 213, + 614 + ], + "spans": [ + { + "bbox": [ + 111, + 601, + 213, + 614 + ], + "score": 1.0, + "content": "f ← ZIPWITH (*) d e", + "type": "text" + } + ], + "index": 83 + }, + { + "bbox": [ + 113, + 614, + 164, + 625 + ], + "spans": [ + { + "bbox": [ + 113, + 614, + 161, + 625 + ], + "score": 0.49, + "content": "\\mathsf { g } \\gets \\mathsf { S U M } \\mathrm { ~ f ~ }", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 614, + 164, + 624 + ], + "score": 0.0, + "content": "", + "type": "text" + } + ], + "index": 84 + } + ], + "index": 81 + }, + { + "type": "text", + "bbox": [ + 219, + 538, + 317, + 603 + ], + "lines": [ + { + "bbox": [ + 218, + 536, + 318, + 552 + ], + "spans": [ + { + "bbox": [ + 218, + 536, + 318, + 552 + ], + "score": 1.0, + "content": "Input-output example:", + "type": "text" + } + ], + "index": 85 + }, + { + "bbox": [ + 218, + 549, + 247, + 560 + ], + "spans": [ + { + "bbox": [ + 218, + 549, + 247, + 560 + ], + "score": 1.0, + "content": "Input:", + "type": "text" + } + ], + "index": 86 + }, + { + "bbox": [ + 218, + 559, + 291, + 572 + ], + "spans": [ + { + "bbox": [ + 218, + 559, + 291, + 572 + ], + "score": 1.0, + "content": "[7 3 8 2 5],", + "type": "text" + } + ], + "index": 87 + }, + { + "bbox": [ + 218, + 569, + 288, + 583 + ], + "spans": [ + { + "bbox": [ + 218, + 569, + 288, + 583 + ], + "score": 1.0, + "content": "[2 8 9 1 3]", + "type": "text" + } + ], + "index": 88 + }, + { + "bbox": [ + 217, + 581, + 254, + 595 + ], + "spans": [ + { + "bbox": [ + 217, + 581, + 254, + 595 + ], + "score": 1.0, + "content": "Output:", + "type": "text" + } + ], + "index": 89 + }, + { + "bbox": [ + 217, + 591, + 236, + 605 + ], + "spans": [ + { + "bbox": [ + 217, + 591, + 236, + 605 + ], + "score": 1.0, + "content": "79", + "type": "text" + } + ], + "index": 90 + } + ], + "index": 87.5 + }, + { + "type": "text", + "bbox": [ + 326, + 532, + 377, + 542 + ], + "lines": [ + { + "bbox": [ + 325, + 529, + 378, + 544 + ], + "spans": [ + { + "bbox": [ + 325, + 529, + 378, + 544 + ], + "score": 1.0, + "content": "Description:", + "type": "text" + } + ], + "index": 91 + } + ], + "index": 91 + }, + { + "type": "text", + "bbox": [ + 325, + 542, + 504, + 630 + ], + "lines": [ + { + "bbox": [ + 325, + 542, + 502, + 554 + ], + "spans": [ + { + "bbox": [ + 325, + 542, + 502, + 554 + ], + "score": 1.0, + "content": "Xavier and Yasmine are laying sticks to form", + "type": "text" + } + ], + "index": 92 + }, + { + "bbox": [ + 325, + 553, + 504, + 565 + ], + "spans": [ + { + "bbox": [ + 325, + 553, + 504, + 565 + ], + "score": 1.0, + "content": "non-overlapping rectangles on the ground.", + "type": "text" + } + ], + "index": 93 + }, + { + "bbox": [ + 325, + 563, + 503, + 576 + ], + "spans": [ + { + "bbox": [ + 325, + 563, + 503, + 576 + ], + "score": 1.0, + "content": "They both have fixed sets of pairs of sticks", + "type": "text" + } + ], + "index": 94 + }, + { + "bbox": [ + 325, + 574, + 504, + 587 + ], + "spans": [ + { + "bbox": [ + 325, + 574, + 504, + 587 + ], + "score": 1.0, + "content": "of certain lengths (represented as arrays x", + "type": "text" + } + ], + "index": 95 + }, + { + "bbox": [ + 325, + 586, + 503, + 597 + ], + "spans": [ + { + "bbox": [ + 325, + 586, + 503, + 597 + ], + "score": 1.0, + "content": "and y of numbers). Xavier only lays sticks", + "type": "text" + } + ], + "index": 96 + }, + { + "bbox": [ + 325, + 596, + 503, + 608 + ], + "spans": [ + { + "bbox": [ + 325, + 596, + 503, + 608 + ], + "score": 1.0, + "content": "parallel to the x axis, and Yasmine lays sticks", + "type": "text" + } + ], + "index": 97 + }, + { + "bbox": [ + 326, + 608, + 503, + 620 + ], + "spans": [ + { + "bbox": [ + 326, + 608, + 503, + 620 + ], + "score": 1.0, + "content": "only parallel to y axis. Compute the area", + "type": "text" + } + ], + "index": 98 + }, + { + "bbox": [ + 326, + 619, + 465, + 630 + ], + "spans": [ + { + "bbox": [ + 326, + 619, + 465, + 630 + ], + "score": 1.0, + "content": "their rectangles will cover at least.", + "type": "text" + } + ], + "index": 99 + } + ], + "index": 95.5 + }, + { + "type": "text", + "bbox": [ + 111, + 661, + 212, + 705 + ], + "lines": [ + { + "bbox": [ + 111, + 660, + 164, + 674 + ], + "spans": [ + { + "bbox": [ + 111, + 660, + 164, + 674 + ], + "score": 1.0, + "content": "Program 5:", + "type": "text" + } + ], + "index": 100 + }, + { + "bbox": [ + 112, + 672, + 164, + 684 + ], + "spans": [ + { + "bbox": [ + 112, + 673, + 134, + 682 + ], + "score": 0.55, + "content": "\\ a \\gets", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 672, + 164, + 684 + ], + "score": 1.0, + "content": "[int]", + "type": "text" + } + ], + "index": 101 + }, + { + "bbox": [ + 112, + 682, + 185, + 694 + ], + "spans": [ + { + "bbox": [ + 112, + 684, + 133, + 693 + ], + "score": 0.35, + "content": "\\ u \\text b \\gets", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 682, + 185, + 694 + ], + "score": 1.0, + "content": "REVERSE a", + "type": "text" + } + ], + "index": 102 + }, + { + "bbox": [ + 113, + 693, + 213, + 704 + ], + "spans": [ + { + "bbox": [ + 113, + 695, + 133, + 704 + ], + "score": 0.35, + "content": "\\subset ", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 693, + 213, + 704 + ], + "score": 1.0, + "content": "ZIPWITH MIN a b", + "type": "text" + } + ], + "index": 103 + } + ], + "index": 101.5 + }, + { + "type": "text", + "bbox": [ + 219, + 660, + 317, + 716 + ], + "lines": [ + { + "bbox": [ + 218, + 659, + 318, + 673 + ], + "spans": [ + { + "bbox": [ + 218, + 659, + 318, + 673 + ], + "score": 1.0, + "content": "Input-output example:", + "type": "text" + } + ], + "index": 104 + }, + { + "bbox": [ + 218, + 671, + 246, + 683 + ], + "spans": [ + { + "bbox": [ + 218, + 671, + 246, + 683 + ], + "score": 1.0, + "content": "Input:", + "type": "text" + } + ], + "index": 105 + }, + { + "bbox": [ + 218, + 681, + 287, + 695 + ], + "spans": [ + { + "bbox": [ + 218, + 681, + 287, + 695 + ], + "score": 1.0, + "content": "[3 7 5 2 8]", + "type": "text" + } + ], + "index": 106 + }, + { + "bbox": [ + 218, + 692, + 253, + 706 + ], + "spans": [ + { + "bbox": [ + 218, + 692, + 253, + 706 + ], + "score": 1.0, + "content": "Output:", + "type": "text" + } + ], + "index": 107 + }, + { + "bbox": [ + 218, + 703, + 287, + 716 + ], + "spans": [ + { + "bbox": [ + 218, + 703, + 287, + 716 + ], + "score": 1.0, + "content": "[3 2 5 2 3]", + "type": "text" + } + ], + "index": 108 + } + ], + "index": 106 + }, + { + "type": "title", + "bbox": [ + 326, + 644, + 377, + 654 + ], + "lines": [ + { + "bbox": [ + 325, + 641, + 378, + 656 + ], + "spans": [ + { + "bbox": [ + 325, + 641, + 378, + 656 + ], + "score": 1.0, + "content": "Description:", + "type": "text" + } + ], + "index": 109 + } + ], + "index": 109 + }, + { + "type": "text", + "bbox": [ + 326, + 654, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 326, + 654, + 503, + 666 + ], + "spans": [ + { + "bbox": [ + 326, + 654, + 503, + 666 + ], + "score": 1.0, + "content": "A sequence called Billy is looking into the", + "type": "text" + } + ], + "index": 110 + }, + { + "bbox": [ + 326, + 666, + 503, + 676 + ], + "spans": [ + { + "bbox": [ + 326, + 666, + 503, + 676 + ], + "score": 1.0, + "content": "mirror, wondering how much weight it could", + "type": "text" + } + ], + "index": 111 + }, + { + "bbox": [ + 325, + 676, + 504, + 688 + ], + "spans": [ + { + "bbox": [ + 325, + 676, + 504, + 688 + ], + "score": 1.0, + "content": "lose by replacing any of its elements by their", + "type": "text" + } + ], + "index": 112 + }, + { + "bbox": [ + 326, + 687, + 503, + 699 + ], + "spans": [ + { + "bbox": [ + 326, + 687, + 503, + 699 + ], + "score": 1.0, + "content": "mirror images. Given a description of Billy", + "type": "text" + } + ], + "index": 113 + }, + { + "bbox": [ + 325, + 698, + 502, + 711 + ], + "spans": [ + { + "bbox": [ + 325, + 698, + 374, + 711 + ], + "score": 1.0, + "content": "as an array", + "type": "text" + }, + { + "bbox": [ + 374, + 698, + 380, + 708 + ], + "score": 0.6, + "content": "b", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 698, + 421, + 711 + ], + "score": 1.0, + "content": "of length", + "type": "text" + }, + { + "bbox": [ + 421, + 700, + 428, + 708 + ], + "score": 0.69, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 698, + 496, + 711 + ], + "score": 1.0, + "content": ", return an array", + "type": "text" + }, + { + "bbox": [ + 496, + 700, + 502, + 708 + ], + "score": 0.56, + "content": "c", + "type": "inline_equation" + } + ], + "index": 114 + }, + { + "bbox": [ + 326, + 708, + 502, + 721 + ], + "spans": [ + { + "bbox": [ + 326, + 708, + 477, + 721 + ], + "score": 1.0, + "content": "of minimal sum where each element", + "type": "text" + }, + { + "bbox": [ + 478, + 709, + 492, + 720 + ], + "score": 0.88, + "content": "c [ i ]", + "type": "inline_equation" + }, + { + "bbox": [ + 492, + 708, + 502, + 721 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 115 + }, + { + "bbox": [ + 326, + 719, + 498, + 733 + ], + "spans": [ + { + "bbox": [ + 326, + 719, + 351, + 733 + ], + "score": 1.0, + "content": "either", + "type": "text" + }, + { + "bbox": [ + 352, + 720, + 366, + 732 + ], + "score": 0.72, + "content": "b [ i ]", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 719, + 444, + 733 + ], + "score": 1.0, + "content": "or its mirror image", + "type": "text" + }, + { + "bbox": [ + 445, + 720, + 494, + 732 + ], + "score": 0.89, + "content": "b [ n - i - 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 719, + 498, + 733 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 116 + } + ], + "index": 113 + } + ], + "page_idx": 11, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "12", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 241, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 79, + 242, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 79, + 242, + 96 + ], + "score": 1.0, + "content": "A EXAMPLE PROGRAMS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 128, + 506, + 172 + ], + "lines": [ + { + "bbox": [ + 105, + 128, + 506, + 142 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 506, + 142 + ], + "score": 1.0, + "content": "This section shows example programs in our Domain Specific Language (DSL), together with input-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 139, + 506, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 139, + 506, + 153 + ], + "score": 1.0, + "content": "output examples and short descriptions. These programs have been inspired by simple tasks appearing", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 151, + 506, + 164 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 506, + 164 + ], + "score": 1.0, + "content": "on real programming competition websites, and are meant to illustrate the expressive power of our", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 160, + 132, + 174 + ], + "spans": [ + { + "bbox": [ + 104, + 160, + 132, + 174 + ], + "score": 1.0, + "content": "DSL.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2.5, + "bbox_fs": [ + 104, + 128, + 506, + 174 + ] + }, + { + "type": "title", + "bbox": [ + 112, + 187, + 163, + 196 + ], + "lines": [ + { + "bbox": [ + 111, + 185, + 164, + 199 + ], + "spans": [ + { + "bbox": [ + 111, + 185, + 164, + 199 + ], + "score": 1.0, + "content": "Program 0:", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 112, + 199, + 176, + 251 + ], + "lines": [ + { + "bbox": [ + 112, + 197, + 154, + 208 + ], + "spans": [ + { + "bbox": [ + 112, + 198, + 133, + 207 + ], + "score": 0.48, + "content": "\\mathrm { k } ", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 197, + 154, + 208 + ], + "score": 1.0, + "content": "int", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 110, + 207, + 165, + 220 + ], + "spans": [ + { + "bbox": [ + 110, + 207, + 165, + 220 + ], + "score": 1.0, + "content": "b ← [int]", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 110, + 218, + 168, + 230 + ], + "spans": [ + { + "bbox": [ + 110, + 218, + 168, + 230 + ], + "score": 1.0, + "content": "c ← SORT b", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 111, + 229, + 177, + 241 + ], + "spans": [ + { + "bbox": [ + 111, + 229, + 177, + 241 + ], + "score": 1.0, + "content": "d ← TAKE k c", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 111, + 240, + 165, + 252 + ], + "spans": [ + { + "bbox": [ + 111, + 240, + 165, + 252 + ], + "score": 1.0, + "content": "e ← SUM d", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8, + "bbox_fs": [ + 110, + 197, + 177, + 252 + ] + }, + { + "type": "list", + "bbox": [ + 219, + 186, + 316, + 245 + ], + "lines": [ + { + "bbox": [ + 218, + 185, + 318, + 199 + ], + "spans": [ + { + "bbox": [ + 218, + 185, + 318, + 199 + ], + "score": 1.0, + "content": "Input-output example:", + "type": "text" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 197, + 246, + 210 + ], + "spans": [ + { + "bbox": [ + 218, + 197, + 246, + 210 + ], + "score": 1.0, + "content": "Input:", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 217, + 206, + 305, + 222 + ], + "spans": [ + { + "bbox": [ + 217, + 206, + 305, + 222 + ], + "score": 1.0, + "content": "2, [3 5 4 7 5]", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 217, + 217, + 253, + 232 + ], + "spans": [ + { + "bbox": [ + 217, + 217, + 253, + 232 + ], + "score": 1.0, + "content": "Output:", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 228, + 240, + 243 + ], + "spans": [ + { + "bbox": [ + 218, + 228, + 240, + 243 + ], + "score": 1.0, + "content": "[7]", + "type": "text" + } + ], + "index": 15, + "is_list_start_line": true + } + ], + "index": 13, + "bbox_fs": [ + 217, + 185, + 318, + 243 + ] + }, + { + "type": "text", + "bbox": [ + 326, + 186, + 377, + 196 + ], + "lines": [ + { + "bbox": [ + 325, + 185, + 378, + 197 + ], + "spans": [ + { + "bbox": [ + 325, + 185, + 378, + 197 + ], + "score": 1.0, + "content": "Description:", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 325, + 185, + 378, + 197 + ] + }, + { + "type": "text", + "bbox": [ + 326, + 196, + 504, + 251 + ], + "lines": [ + { + "bbox": [ + 325, + 194, + 505, + 209 + ], + "spans": [ + { + "bbox": [ + 325, + 194, + 454, + 209 + ], + "score": 1.0, + "content": "A new shop near you is selling", + "type": "text" + }, + { + "bbox": [ + 454, + 198, + 462, + 206 + ], + "score": 0.67, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 194, + 505, + 209 + ], + "score": 1.0, + "content": "paintings.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 325, + 206, + 504, + 218 + ], + "spans": [ + { + "bbox": [ + 325, + 206, + 369, + 218 + ], + "score": 1.0, + "content": "You have", + "type": "text" + }, + { + "bbox": [ + 369, + 207, + 402, + 217 + ], + "score": 0.91, + "content": "k \\ < \\ n", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 206, + 504, + 218 + ], + "score": 1.0, + "content": "friends and you would", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 325, + 216, + 504, + 231 + ], + "spans": [ + { + "bbox": [ + 325, + 216, + 504, + 231 + ], + "score": 1.0, + "content": "like to buy each of your friends a painting", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 326, + 228, + 503, + 240 + ], + "spans": [ + { + "bbox": [ + 326, + 228, + 503, + 240 + ], + "score": 1.0, + "content": "from the shop. Return the minimal amount", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 326, + 240, + 461, + 252 + ], + "spans": [ + { + "bbox": [ + 326, + 240, + 461, + 252 + ], + "score": 1.0, + "content": "of money you will need to spend.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19, + "bbox_fs": [ + 325, + 194, + 505, + 252 + ] + }, + { + "type": "title", + "bbox": [ + 112, + 272, + 162, + 281 + ], + "lines": [ + { + "bbox": [ + 111, + 270, + 164, + 284 + ], + "spans": [ + { + "bbox": [ + 111, + 270, + 164, + 284 + ], + "score": 1.0, + "content": "Program 1:", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "list", + "bbox": [ + 111, + 283, + 211, + 336 + ], + "lines": [ + { + "bbox": [ + 112, + 282, + 164, + 292 + ], + "spans": [ + { + "bbox": [ + 112, + 283, + 133, + 292 + ], + "score": 0.36, + "content": "\\bar { w } ", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 282, + 164, + 292 + ], + "score": 1.0, + "content": "[int]", + "type": "text" + } + ], + "index": 23, + "is_list_start_line": true + }, + { + "bbox": [ + 111, + 292, + 165, + 304 + ], + "spans": [ + { + "bbox": [ + 111, + 292, + 165, + 304 + ], + "score": 1.0, + "content": "t ← [int]", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 111, + 303, + 192, + 315 + ], + "spans": [ + { + "bbox": [ + 111, + 303, + 192, + 315 + ], + "score": 1.0, + "content": "c ← MAP (*3) w", + "type": "text" + } + ], + "index": 25, + "is_list_start_line": true + }, + { + "bbox": [ + 111, + 314, + 213, + 326 + ], + "spans": [ + { + "bbox": [ + 111, + 314, + 213, + 326 + ], + "score": 1.0, + "content": "d ← ZIPWITH (+) c t", + "type": "text" + } + ], + "index": 26, + "is_list_start_line": true + }, + { + "bbox": [ + 111, + 325, + 192, + 336 + ], + "spans": [ + { + "bbox": [ + 111, + 325, + 192, + 336 + ], + "score": 1.0, + "content": "e ← MAXIMUM d", + "type": "text" + } + ], + "index": 27, + "is_list_start_line": true + }, + { + "bbox": [ + 219, + 269, + 318, + 285 + ], + "spans": [ + { + "bbox": [ + 219, + 269, + 318, + 285 + ], + "score": 1.0, + "content": "Input-output example:", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 281, + 247, + 294 + ], + "spans": [ + { + "bbox": [ + 218, + 281, + 247, + 294 + ], + "score": 1.0, + "content": "Input:", + "type": "text" + } + ], + "index": 29, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 292, + 291, + 305 + ], + "spans": [ + { + "bbox": [ + 218, + 292, + 291, + 305 + ], + "score": 1.0, + "content": "[6 2 4 7 9],", + "type": "text" + } + ], + "index": 30, + "is_list_start_line": true + }, + { + "bbox": [ + 219, + 302, + 288, + 316 + ], + "spans": [ + { + "bbox": [ + 219, + 302, + 288, + 316 + ], + "score": 1.0, + "content": "[5 3 6 1 0]", + "type": "text" + } + ], + "index": 31, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 314, + 253, + 327 + ], + "spans": [ + { + "bbox": [ + 218, + 314, + 253, + 327 + ], + "score": 1.0, + "content": "Output:", + "type": "text" + } + ], + "index": 32, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 324, + 235, + 338 + ], + "spans": [ + { + "bbox": [ + 218, + 324, + 235, + 338 + ], + "score": 1.0, + "content": "27", + "type": "text" + } + ], + "index": 33, + "is_list_start_line": true + } + ], + "index": 25, + "bbox_fs": [ + 111, + 282, + 213, + 336 + ] + }, + { + "type": "list", + "bbox": [ + 219, + 270, + 317, + 336 + ], + "lines": [], + "index": 30.5, + "bbox_fs": [ + 218, + 269, + 318, + 338 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 326, + 265, + 377, + 275 + ], + "lines": [ + { + "bbox": [ + 325, + 262, + 378, + 277 + ], + "spans": [ + { + "bbox": [ + 325, + 262, + 378, + 277 + ], + "score": 1.0, + "content": "Description:", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34, + "bbox_fs": [ + 325, + 262, + 378, + 277 + ] + }, + { + "type": "text", + "bbox": [ + 326, + 275, + 504, + 352 + ], + "lines": [ + { + "bbox": [ + 325, + 275, + 503, + 287 + ], + "spans": [ + { + "bbox": [ + 325, + 275, + 503, + 287 + ], + "score": 1.0, + "content": "In soccer leagues, match winners are", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 325, + 285, + 503, + 297 + ], + "spans": [ + { + "bbox": [ + 325, + 285, + 503, + 297 + ], + "score": 1.0, + "content": "awarded 3 points, losers 0 points, and both", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 325, + 297, + 504, + 308 + ], + "spans": [ + { + "bbox": [ + 325, + 297, + 504, + 308 + ], + "score": 1.0, + "content": "teams get 1 point in the case of a tie. Com-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 324, + 307, + 504, + 320 + ], + "spans": [ + { + "bbox": [ + 324, + 307, + 504, + 320 + ], + "score": 1.0, + "content": "pute the number of points awarded to the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 325, + 318, + 504, + 330 + ], + "spans": [ + { + "bbox": [ + 325, + 318, + 473, + 330 + ], + "score": 1.0, + "content": "winner of a league given two arrays", + "type": "text" + }, + { + "bbox": [ + 474, + 320, + 491, + 330 + ], + "score": 0.88, + "content": "w , t", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 318, + 504, + 330 + ], + "score": 1.0, + "content": "of", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 326, + 330, + 503, + 342 + ], + "spans": [ + { + "bbox": [ + 326, + 330, + 418, + 342 + ], + "score": 1.0, + "content": "the same length, where", + "type": "text" + }, + { + "bbox": [ + 419, + 330, + 436, + 342 + ], + "score": 0.83, + "content": "w [ i ]", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 330, + 461, + 342 + ], + "score": 1.0, + "content": "(resp.", + "type": "text" + }, + { + "bbox": [ + 461, + 330, + 476, + 342 + ], + "score": 0.8, + "content": "t [ i ] ,", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 330, + 503, + 342 + ], + "score": 1.0, + "content": ") is the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 325, + 340, + 489, + 353 + ], + "spans": [ + { + "bbox": [ + 325, + 340, + 415, + 353 + ], + "score": 1.0, + "content": "number of times team", + "type": "text" + }, + { + "bbox": [ + 416, + 342, + 421, + 351 + ], + "score": 0.64, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 340, + 489, + 353 + ], + "score": 1.0, + "content": "won (resp. tied).", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 38, + "bbox_fs": [ + 324, + 275, + 504, + 353 + ] + }, + { + "type": "title", + "bbox": [ + 113, + 366, + 162, + 376 + ], + "lines": [ + { + "bbox": [ + 111, + 365, + 164, + 378 + ], + "spans": [ + { + "bbox": [ + 111, + 365, + 164, + 378 + ], + "score": 1.0, + "content": "Program 2:", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 42 + }, + { + "type": "list", + "bbox": [ + 111, + 378, + 212, + 421 + ], + "lines": [ + { + "bbox": [ + 111, + 376, + 165, + 388 + ], + "spans": [ + { + "bbox": [ + 111, + 376, + 165, + 388 + ], + "score": 1.0, + "content": "a ← [int]", + "type": "text" + } + ], + "index": 43, + "is_list_end_line": true + }, + { + "bbox": [ + 110, + 388, + 165, + 399 + ], + "spans": [ + { + "bbox": [ + 110, + 388, + 165, + 399 + ], + "score": 1.0, + "content": "b ← [int]", + "type": "text" + } + ], + "index": 44, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 110, + 398, + 213, + 410 + ], + "spans": [ + { + "bbox": [ + 110, + 398, + 213, + 410 + ], + "score": 1.0, + "content": "c ← ZIPWITH (-) b a", + "type": "text" + } + ], + "index": 45, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 408, + 203, + 422 + ], + "spans": [ + { + "bbox": [ + 113, + 410, + 166, + 420 + ], + "score": 0.31, + "content": "\\mathsf { d } \\gets \\mathbf { C o u v r } \\mathsf { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 410, + 188, + 420 + ], + "score": 0.35, + "content": "( > 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 408, + 203, + 422 + ], + "score": 1.0, + "content": ") c", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 44.5, + "bbox_fs": [ + 110, + 376, + 213, + 422 + ] + }, + { + "type": "title", + "bbox": [ + 219, + 366, + 317, + 376 + ], + "lines": [ + { + "bbox": [ + 219, + 365, + 318, + 380 + ], + "spans": [ + { + "bbox": [ + 219, + 365, + 318, + 380 + ], + "score": 1.0, + "content": "Input-output example:", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 47 + }, + { + "type": "list", + "bbox": [ + 219, + 378, + 289, + 430 + ], + "lines": [ + { + "bbox": [ + 217, + 375, + 248, + 389 + ], + "spans": [ + { + "bbox": [ + 217, + 375, + 248, + 389 + ], + "score": 1.0, + "content": "Input:", + "type": "text" + } + ], + "index": 48, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 386, + 291, + 400 + ], + "spans": [ + { + "bbox": [ + 218, + 386, + 291, + 400 + ], + "score": 1.0, + "content": "[6 2 4 7 9],", + "type": "text" + } + ], + "index": 49, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 397, + 289, + 411 + ], + "spans": [ + { + "bbox": [ + 218, + 397, + 289, + 411 + ], + "score": 1.0, + "content": "[5 3 2 1 0]", + "type": "text" + } + ], + "index": 50, + "is_list_start_line": true + }, + { + "bbox": [ + 217, + 407, + 254, + 423 + ], + "spans": [ + { + "bbox": [ + 217, + 407, + 254, + 423 + ], + "score": 1.0, + "content": "Output:", + "type": "text" + } + ], + "index": 51, + "is_list_start_line": true + }, + { + "bbox": [ + 217, + 420, + 229, + 432 + ], + "spans": [ + { + "bbox": [ + 217, + 420, + 229, + 432 + ], + "score": 1.0, + "content": "4", + "type": "text" + } + ], + "index": 52, + "is_list_start_line": true + } + ], + "index": 50, + "bbox_fs": [ + 217, + 375, + 291, + 432 + ] + }, + { + "type": "text", + "bbox": [ + 326, + 366, + 376, + 376 + ], + "lines": [ + { + "bbox": [ + 325, + 363, + 379, + 378 + ], + "spans": [ + { + "bbox": [ + 325, + 363, + 379, + 378 + ], + "score": 1.0, + "content": "Description:", + "type": "text" + } + ], + "index": 53 + } + ], + "index": 53, + "bbox_fs": [ + 325, + 363, + 379, + 378 + ] + }, + { + "type": "text", + "bbox": [ + 326, + 377, + 504, + 430 + ], + "lines": [ + { + "bbox": [ + 325, + 376, + 502, + 387 + ], + "spans": [ + { + "bbox": [ + 325, + 376, + 502, + 387 + ], + "score": 1.0, + "content": "Alice and Bob are comparing their results in", + "type": "text" + } + ], + "index": 54 + }, + { + "bbox": [ + 324, + 385, + 504, + 400 + ], + "spans": [ + { + "bbox": [ + 324, + 385, + 504, + 400 + ], + "score": 1.0, + "content": "a recent exam. Given their marks per ques-", + "type": "text" + } + ], + "index": 55 + }, + { + "bbox": [ + 326, + 399, + 502, + 410 + ], + "spans": [ + { + "bbox": [ + 326, + 399, + 406, + 410 + ], + "score": 1.0, + "content": "tion as two arrays", + "type": "text" + }, + { + "bbox": [ + 406, + 401, + 413, + 408 + ], + "score": 0.63, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 399, + 433, + 410 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 433, + 399, + 439, + 408 + ], + "score": 0.6, + "content": "b", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 399, + 502, + 410 + ], + "score": 1.0, + "content": ", count on how", + "type": "text" + } + ], + "index": 56 + }, + { + "bbox": [ + 325, + 409, + 502, + 421 + ], + "spans": [ + { + "bbox": [ + 325, + 409, + 502, + 421 + ], + "score": 1.0, + "content": "many questions Alice got more points than", + "type": "text" + } + ], + "index": 57 + }, + { + "bbox": [ + 325, + 419, + 349, + 432 + ], + "spans": [ + { + "bbox": [ + 325, + 419, + 349, + 432 + ], + "score": 1.0, + "content": "Bob.", + "type": "text" + } + ], + "index": 58 + } + ], + "index": 56, + "bbox_fs": [ + 324, + 376, + 504, + 432 + ] + }, + { + "type": "title", + "bbox": [ + 113, + 444, + 162, + 453 + ], + "lines": [ + { + "bbox": [ + 111, + 442, + 164, + 456 + ], + "spans": [ + { + "bbox": [ + 111, + 442, + 164, + 456 + ], + "score": 1.0, + "content": "Program 3:", + "type": "text" + } + ], + "index": 59 + } + ], + "index": 59 + }, + { + "type": "list", + "bbox": [ + 112, + 455, + 211, + 509 + ], + "lines": [ + { + "bbox": [ + 110, + 452, + 165, + 465 + ], + "spans": [ + { + "bbox": [ + 110, + 452, + 165, + 465 + ], + "score": 1.0, + "content": "h ← [int]", + "type": "text" + } + ], + "index": 60, + "is_list_end_line": true + }, + { + "bbox": [ + 111, + 464, + 201, + 475 + ], + "spans": [ + { + "bbox": [ + 111, + 464, + 201, + 475 + ], + "score": 1.0, + "content": "b ← SCANL1 MIN h", + "type": "text" + } + ], + "index": 61, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 110, + 475, + 213, + 487 + ], + "spans": [ + { + "bbox": [ + 110, + 475, + 213, + 487 + ], + "score": 1.0, + "content": "c ← ZIPWITH (-) h b", + "type": "text" + } + ], + "index": 62, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 486, + 202, + 499 + ], + "spans": [ + { + "bbox": [ + 113, + 488, + 133, + 497 + ], + "score": 0.27, + "content": "\\mathrm { ~ d ~ } ", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 486, + 169, + 499 + ], + "score": 1.0, + "content": "FILTER", + "type": "text" + }, + { + "bbox": [ + 169, + 488, + 187, + 498 + ], + "score": 0.31, + "content": "( > 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 486, + 202, + 499 + ], + "score": 1.0, + "content": ") c", + "type": "text" + } + ], + "index": 63, + "is_list_end_line": true + }, + { + "bbox": [ + 113, + 498, + 164, + 508 + ], + "spans": [ + { + "bbox": [ + 113, + 498, + 164, + 508 + ], + "score": 0.54, + "content": "\\mathrm { ~ e ~ } { \\gets } \\mathbf { S } \\mathbf { U } \\mathbf { M } \\mathrm { ~ d ~ }", + "type": "inline_equation" + } + ], + "index": 64, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 218, + 442, + 318, + 457 + ], + "spans": [ + { + "bbox": [ + 218, + 442, + 318, + 457 + ], + "score": 1.0, + "content": "Input-output example:", + "type": "text" + } + ], + "index": 65, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 453, + 246, + 466 + ], + "spans": [ + { + "bbox": [ + 218, + 453, + 246, + 466 + ], + "score": 1.0, + "content": "Input:", + "type": "text" + } + ], + "index": 66, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 464, + 287, + 478 + ], + "spans": [ + { + "bbox": [ + 218, + 464, + 287, + 478 + ], + "score": 1.0, + "content": "[8 5 7 2 5]", + "type": "text" + } + ], + "index": 67, + "is_list_start_line": true + }, + { + "bbox": [ + 217, + 474, + 253, + 489 + ], + "spans": [ + { + "bbox": [ + 217, + 474, + 253, + 489 + ], + "score": 1.0, + "content": "Output:", + "type": "text" + } + ], + "index": 68, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 486, + 228, + 498 + ], + "spans": [ + { + "bbox": [ + 218, + 486, + 228, + 498 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ], + "index": 69, + "is_list_start_line": true + } + ], + "index": 62, + "bbox_fs": [ + 110, + 452, + 213, + 508 + ] + }, + { + "type": "list", + "bbox": [ + 219, + 444, + 318, + 501 + ], + "lines": [], + "index": 67, + "bbox_fs": [ + 217, + 442, + 318, + 498 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 325, + 443, + 376, + 453 + ], + "lines": [ + { + "bbox": [ + 325, + 442, + 378, + 455 + ], + "spans": [ + { + "bbox": [ + 325, + 442, + 378, + 455 + ], + "score": 1.0, + "content": "Description:", + "type": "text" + } + ], + "index": 70 + } + ], + "index": 70, + "bbox_fs": [ + 325, + 442, + 378, + 455 + ] + }, + { + "type": "text", + "bbox": [ + 326, + 455, + 503, + 519 + ], + "lines": [ + { + "bbox": [ + 325, + 453, + 503, + 466 + ], + "spans": [ + { + "bbox": [ + 325, + 453, + 503, + 466 + ], + "score": 1.0, + "content": "Perditia is very peculiar about her garden", + "type": "text" + } + ], + "index": 71 + }, + { + "bbox": [ + 325, + 464, + 503, + 476 + ], + "spans": [ + { + "bbox": [ + 325, + 464, + 503, + 476 + ], + "score": 1.0, + "content": "and wants that the trees standing in a row are", + "type": "text" + } + ], + "index": 72 + }, + { + "bbox": [ + 325, + 475, + 503, + 487 + ], + "spans": [ + { + "bbox": [ + 325, + 475, + 503, + 487 + ], + "score": 1.0, + "content": "all of non-increasing heights. Given the tree", + "type": "text" + } + ], + "index": 73 + }, + { + "bbox": [ + 325, + 486, + 504, + 498 + ], + "spans": [ + { + "bbox": [ + 325, + 486, + 504, + 498 + ], + "score": 1.0, + "content": "heights in centimeters in order of the row as", + "type": "text" + } + ], + "index": 74 + }, + { + "bbox": [ + 326, + 498, + 503, + 509 + ], + "spans": [ + { + "bbox": [ + 326, + 498, + 503, + 509 + ], + "score": 1.0, + "content": "an array h, compute how many centimeters", + "type": "text" + } + ], + "index": 75 + }, + { + "bbox": [ + 326, + 509, + 465, + 519 + ], + "spans": [ + { + "bbox": [ + 326, + 509, + 465, + 519 + ], + "score": 1.0, + "content": "she needs to trim the trees in total.", + "type": "text" + } + ], + "index": 76 + } + ], + "index": 73.5, + "bbox_fs": [ + 325, + 453, + 504, + 519 + ] + }, + { + "type": "title", + "bbox": [ + 113, + 538, + 162, + 548 + ], + "lines": [ + { + "bbox": [ + 111, + 536, + 164, + 550 + ], + "spans": [ + { + "bbox": [ + 111, + 536, + 164, + 550 + ], + "score": 1.0, + "content": "Program 4:", + "type": "text" + } + ], + "index": 77 + } + ], + "index": 77 + }, + { + "type": "list", + "bbox": [ + 111, + 549, + 211, + 625 + ], + "lines": [ + { + "bbox": [ + 110, + 548, + 164, + 559 + ], + "spans": [ + { + "bbox": [ + 110, + 548, + 164, + 559 + ], + "score": 1.0, + "content": "x ← [int]", + "type": "text" + } + ], + "index": 78, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 559, + 165, + 570 + ], + "spans": [ + { + "bbox": [ + 110, + 559, + 165, + 570 + ], + "score": 1.0, + "content": "y ← [int]", + "type": "text" + } + ], + "index": 79, + "is_list_start_line": true + }, + { + "bbox": [ + 112, + 571, + 167, + 581 + ], + "spans": [ + { + "bbox": [ + 112, + 571, + 167, + 581 + ], + "score": 0.26, + "content": "\\mathbf { \\boldsymbol { \\mathrm { c } } } \\gets \\mathbf { \\boldsymbol { S } } \\mathbf { \\boldsymbol { O } } \\mathbf { R } \\mathbf { \\boldsymbol { T } } \\ \\mathbf { \\boldsymbol { x } }", + "type": "inline_equation" + } + ], + "index": 80, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 579, + 168, + 594 + ], + "spans": [ + { + "bbox": [ + 110, + 579, + 168, + 594 + ], + "score": 1.0, + "content": "d ← SORT y", + "type": "text" + } + ], + "index": 81, + "is_list_start_line": true + }, + { + "bbox": [ + 111, + 592, + 185, + 603 + ], + "spans": [ + { + "bbox": [ + 111, + 592, + 185, + 603 + ], + "score": 1.0, + "content": "e ← REVERSE d", + "type": "text" + } + ], + "index": 82, + "is_list_start_line": true + }, + { + "bbox": [ + 111, + 601, + 213, + 614 + ], + "spans": [ + { + "bbox": [ + 111, + 601, + 213, + 614 + ], + "score": 1.0, + "content": "f ← ZIPWITH (*) d e", + "type": "text" + } + ], + "index": 83, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 614, + 164, + 625 + ], + "spans": [ + { + "bbox": [ + 113, + 614, + 161, + 625 + ], + "score": 0.49, + "content": "\\mathsf { g } \\gets \\mathsf { S U M } \\mathrm { ~ f ~ }", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 614, + 164, + 624 + ], + "score": 0.0, + "content": "", + "type": "text" + } + ], + "index": 84, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 536, + 318, + 552 + ], + "spans": [ + { + "bbox": [ + 218, + 536, + 318, + 552 + ], + "score": 1.0, + "content": "Input-output example:", + "type": "text" + } + ], + "index": 85, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 549, + 247, + 560 + ], + "spans": [ + { + "bbox": [ + 218, + 549, + 247, + 560 + ], + "score": 1.0, + "content": "Input:", + "type": "text" + } + ], + "index": 86, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 559, + 291, + 572 + ], + "spans": [ + { + "bbox": [ + 218, + 559, + 291, + 572 + ], + "score": 1.0, + "content": "[7 3 8 2 5],", + "type": "text" + } + ], + "index": 87, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 569, + 288, + 583 + ], + "spans": [ + { + "bbox": [ + 218, + 569, + 288, + 583 + ], + "score": 1.0, + "content": "[2 8 9 1 3]", + "type": "text" + } + ], + "index": 88, + "is_list_start_line": true + }, + { + "bbox": [ + 217, + 581, + 254, + 595 + ], + "spans": [ + { + "bbox": [ + 217, + 581, + 254, + 595 + ], + "score": 1.0, + "content": "Output:", + "type": "text" + } + ], + "index": 89, + "is_list_start_line": true + }, + { + "bbox": [ + 217, + 591, + 236, + 605 + ], + "spans": [ + { + "bbox": [ + 217, + 591, + 236, + 605 + ], + "score": 1.0, + "content": "79", + "type": "text" + } + ], + "index": 90, + "is_list_start_line": true + } + ], + "index": 81, + "bbox_fs": [ + 110, + 548, + 213, + 625 + ] + }, + { + "type": "list", + "bbox": [ + 219, + 538, + 317, + 603 + ], + "lines": [], + "index": 87.5, + "bbox_fs": [ + 217, + 536, + 318, + 605 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 326, + 532, + 377, + 542 + ], + "lines": [ + { + "bbox": [ + 325, + 529, + 378, + 544 + ], + "spans": [ + { + "bbox": [ + 325, + 529, + 378, + 544 + ], + "score": 1.0, + "content": "Description:", + "type": "text" + } + ], + "index": 91 + } + ], + "index": 91, + "bbox_fs": [ + 325, + 529, + 378, + 544 + ] + }, + { + "type": "text", + "bbox": [ + 325, + 542, + 504, + 630 + ], + "lines": [ + { + "bbox": [ + 325, + 542, + 502, + 554 + ], + "spans": [ + { + "bbox": [ + 325, + 542, + 502, + 554 + ], + "score": 1.0, + "content": "Xavier and Yasmine are laying sticks to form", + "type": "text" + } + ], + "index": 92 + }, + { + "bbox": [ + 325, + 553, + 504, + 565 + ], + "spans": [ + { + "bbox": [ + 325, + 553, + 504, + 565 + ], + "score": 1.0, + "content": "non-overlapping rectangles on the ground.", + "type": "text" + } + ], + "index": 93 + }, + { + "bbox": [ + 325, + 563, + 503, + 576 + ], + "spans": [ + { + "bbox": [ + 325, + 563, + 503, + 576 + ], + "score": 1.0, + "content": "They both have fixed sets of pairs of sticks", + "type": "text" + } + ], + "index": 94 + }, + { + "bbox": [ + 325, + 574, + 504, + 587 + ], + "spans": [ + { + "bbox": [ + 325, + 574, + 504, + 587 + ], + "score": 1.0, + "content": "of certain lengths (represented as arrays x", + "type": "text" + } + ], + "index": 95 + }, + { + "bbox": [ + 325, + 586, + 503, + 597 + ], + "spans": [ + { + "bbox": [ + 325, + 586, + 503, + 597 + ], + "score": 1.0, + "content": "and y of numbers). Xavier only lays sticks", + "type": "text" + } + ], + "index": 96 + }, + { + "bbox": [ + 325, + 596, + 503, + 608 + ], + "spans": [ + { + "bbox": [ + 325, + 596, + 503, + 608 + ], + "score": 1.0, + "content": "parallel to the x axis, and Yasmine lays sticks", + "type": "text" + } + ], + "index": 97 + }, + { + "bbox": [ + 326, + 608, + 503, + 620 + ], + "spans": [ + { + "bbox": [ + 326, + 608, + 503, + 620 + ], + "score": 1.0, + "content": "only parallel to y axis. Compute the area", + "type": "text" + } + ], + "index": 98 + }, + { + "bbox": [ + 326, + 619, + 465, + 630 + ], + "spans": [ + { + "bbox": [ + 326, + 619, + 465, + 630 + ], + "score": 1.0, + "content": "their rectangles will cover at least.", + "type": "text" + } + ], + "index": 99 + } + ], + "index": 95.5, + "bbox_fs": [ + 325, + 542, + 504, + 630 + ] + }, + { + "type": "list", + "bbox": [ + 111, + 661, + 212, + 705 + ], + "lines": [ + { + "bbox": [ + 111, + 660, + 164, + 674 + ], + "spans": [ + { + "bbox": [ + 111, + 660, + 164, + 674 + ], + "score": 1.0, + "content": "Program 5:", + "type": "text" + } + ], + "index": 100, + "is_list_start_line": true + }, + { + "bbox": [ + 112, + 672, + 164, + 684 + ], + "spans": [ + { + "bbox": [ + 112, + 673, + 134, + 682 + ], + "score": 0.55, + "content": "\\ a \\gets", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 672, + 164, + 684 + ], + "score": 1.0, + "content": "[int]", + "type": "text" + } + ], + "index": 101, + "is_list_start_line": true + }, + { + "bbox": [ + 112, + 682, + 185, + 694 + ], + "spans": [ + { + "bbox": [ + 112, + 684, + 133, + 693 + ], + "score": 0.35, + "content": "\\ u \\text b \\gets", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 682, + 185, + 694 + ], + "score": 1.0, + "content": "REVERSE a", + "type": "text" + } + ], + "index": 102, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 693, + 213, + 704 + ], + "spans": [ + { + "bbox": [ + 113, + 695, + 133, + 704 + ], + "score": 0.35, + "content": "\\subset ", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 693, + 213, + 704 + ], + "score": 1.0, + "content": "ZIPWITH MIN a b", + "type": "text" + } + ], + "index": 103, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 659, + 318, + 673 + ], + "spans": [ + { + "bbox": [ + 218, + 659, + 318, + 673 + ], + "score": 1.0, + "content": "Input-output example:", + "type": "text" + } + ], + "index": 104, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 671, + 246, + 683 + ], + "spans": [ + { + "bbox": [ + 218, + 671, + 246, + 683 + ], + "score": 1.0, + "content": "Input:", + "type": "text" + } + ], + "index": 105, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 681, + 287, + 695 + ], + "spans": [ + { + "bbox": [ + 218, + 681, + 287, + 695 + ], + "score": 1.0, + "content": "[3 7 5 2 8]", + "type": "text" + } + ], + "index": 106, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 692, + 253, + 706 + ], + "spans": [ + { + "bbox": [ + 218, + 692, + 253, + 706 + ], + "score": 1.0, + "content": "Output:", + "type": "text" + } + ], + "index": 107, + "is_list_start_line": true + }, + { + "bbox": [ + 218, + 703, + 287, + 716 + ], + "spans": [ + { + "bbox": [ + 218, + 703, + 287, + 716 + ], + "score": 1.0, + "content": "[3 2 5 2 3]", + "type": "text" + } + ], + "index": 108, + "is_list_start_line": true + } + ], + "index": 101.5, + "bbox_fs": [ + 111, + 660, + 213, + 704 + ] + }, + { + "type": "list", + "bbox": [ + 219, + 660, + 317, + 716 + ], + "lines": [], + "index": 106, + "bbox_fs": [ + 218, + 659, + 318, + 716 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 326, + 644, + 377, + 654 + ], + "lines": [ + { + "bbox": [ + 325, + 641, + 378, + 656 + ], + "spans": [ + { + "bbox": [ + 325, + 641, + 378, + 656 + ], + "score": 1.0, + "content": "Description:", + "type": "text" + } + ], + "index": 109 + } + ], + "index": 109 + }, + { + "type": "text", + "bbox": [ + 326, + 654, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 326, + 654, + 503, + 666 + ], + "spans": [ + { + "bbox": [ + 326, + 654, + 503, + 666 + ], + "score": 1.0, + "content": "A sequence called Billy is looking into the", + "type": "text" + } + ], + "index": 110 + }, + { + "bbox": [ + 326, + 666, + 503, + 676 + ], + "spans": [ + { + "bbox": [ + 326, + 666, + 503, + 676 + ], + "score": 1.0, + "content": "mirror, wondering how much weight it could", + "type": "text" + } + ], + "index": 111 + }, + { + "bbox": [ + 325, + 676, + 504, + 688 + ], + "spans": [ + { + "bbox": [ + 325, + 676, + 504, + 688 + ], + "score": 1.0, + "content": "lose by replacing any of its elements by their", + "type": "text" + } + ], + "index": 112 + }, + { + "bbox": [ + 326, + 687, + 503, + 699 + ], + "spans": [ + { + "bbox": [ + 326, + 687, + 503, + 699 + ], + "score": 1.0, + "content": "mirror images. Given a description of Billy", + "type": "text" + } + ], + "index": 113 + }, + { + "bbox": [ + 325, + 698, + 502, + 711 + ], + "spans": [ + { + "bbox": [ + 325, + 698, + 374, + 711 + ], + "score": 1.0, + "content": "as an array", + "type": "text" + }, + { + "bbox": [ + 374, + 698, + 380, + 708 + ], + "score": 0.6, + "content": "b", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 698, + 421, + 711 + ], + "score": 1.0, + "content": "of length", + "type": "text" + }, + { + "bbox": [ + 421, + 700, + 428, + 708 + ], + "score": 0.69, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 698, + 496, + 711 + ], + "score": 1.0, + "content": ", return an array", + "type": "text" + }, + { + "bbox": [ + 496, + 700, + 502, + 708 + ], + "score": 0.56, + "content": "c", + "type": "inline_equation" + } + ], + "index": 114 + }, + { + "bbox": [ + 326, + 708, + 502, + 721 + ], + "spans": [ + { + "bbox": [ + 326, + 708, + 477, + 721 + ], + "score": 1.0, + "content": "of minimal sum where each element", + "type": "text" + }, + { + "bbox": [ + 478, + 709, + 492, + 720 + ], + "score": 0.88, + "content": "c [ i ]", + "type": "inline_equation" + }, + { + "bbox": [ + 492, + 708, + 502, + 721 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 115 + }, + { + "bbox": [ + 326, + 719, + 498, + 733 + ], + "spans": [ + { + "bbox": [ + 326, + 719, + 351, + 733 + ], + "score": 1.0, + "content": "either", + "type": "text" + }, + { + "bbox": [ + 352, + 720, + 366, + 732 + ], + "score": 0.72, + "content": "b [ i ]", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 719, + 444, + 733 + ], + "score": 1.0, + "content": "or its mirror image", + "type": "text" + }, + { + "bbox": [ + 445, + 720, + 494, + 732 + ], + "score": 0.89, + "content": "b [ n - i - 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 719, + 498, + 733 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 116 + } + ], + "index": 113, + "bbox_fs": [ + 325, + 654, + 504, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 107, + 42, + 507, + 463 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 107, + 42, + 507, + 463 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 42, + 507, + 463 + ], + "spans": [ + { + "bbox": [ + 107, + 42, + 507, + 463 + ], + "score": 0.721, + "html": "
Program 6: IO example: t←[int] Input: p←[int] [4 8 11 2], C←MAP(-1)t [2341] d←MAP(-1)p Output: e ←ZIPWITH(+)c d 1 f←MINIMUMeDescription: Umberto has a large collection of ties and match- ing pocket squares—too large, his wife says—and he needs to sell one pair. Given their values as arrays t and p,assuming that he sells the cheapest pair, and selling costs 2,how much will he lose from the sale?
Program 7: IO example: s←[int] Input: p←[int] [4723], C ← SCANL1(+)p [2131] d ←ZIPWITH(*)S C Output: e←SUMd 62Description: Zack always promised his n friends to buy them candy, but never did. Now he won the lottery and counts how often and how much candy he promised to his friends,obtaining arrays p (num- ber of promises) and s (number of promised sweets). He announces that to repay them,he will buy s[1]+s[2]+...+s[n] pieces of candy for the firstp[1]days,thens[2]+s[3]+...+s[n]for p[2] days,and so on,until he has fulfilled all promises. How much candy will he buy in total?
Program 8: IO example: s←[int] Input: b ←REVERSE S [12457] C ←ZIPWITH(-)b s Output: d ←FILTER(>O)C 9 e←SuMdDescription: Vivian loves rearranging things.Most of all,when she sees a row of heaps, she wants to make sure that each heap has more items than the one to its left. She is also obsessed with efficiency, so always moves the least possible number of items.Her dad really dislikes if she changes the size of heaps,so she only moves single items between them,making sure that the set of sizes of the heaps is the same as at the start; they are only in a different order. When you come in, you see heaps of sizes (of course,sizes strictly monotonically increasing)s[O],s[1],... s[n].What is the maximal number of items that Vivian could have moved?
", + "type": "table", + "image_path": "c0b9fa01cfad5a4a38406952d046a34d3bfd424df86c9c92982450ad23a4740b.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 42, + 507, + 182.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 182.33333333333334, + 507, + 322.6666666666667 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 322.6666666666667, + 507, + 463.0 + ], + "spans": [], + "index": 2 + } + ] + } + ], + "index": 1 + }, + { + "type": "image", + "bbox": [ + 109, + 520, + 501, + 620 + ], + "blocks": [ + { + "type": "image_caption", + "bbox": [ + 106, + 474, + 506, + 508 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 474, + 506, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 474, + 457, + 487 + ], + "score": 1.0, + "content": "Fig. 4 shows the predictions made by a neural network trained on programs of length", + "type": "text" + }, + { + "bbox": [ + 457, + 475, + 486, + 485 + ], + "score": 0.9, + "content": "T = 4", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 474, + 506, + 487 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 486, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 505, + 498 + ], + "score": 1.0, + "content": "were ensured to be semantically disjoint from all 9 example programs shown in this section. For each", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 496, + 382, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 382, + 509 + ], + "score": 1.0, + "content": "task, the neural network was provided with 5 input-output examples.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + }, + { + "type": "image_body", + "bbox": [ + 109, + 520, + 501, + 620 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 520, + 501, + 620 + ], + "spans": [ + { + "bbox": [ + 109, + 520, + 501, + 620 + ], + "score": 0.952, + "type": "image", + "image_path": "6d29878119ef08e20bad2e228bb9a4b1140e7a88251e4c13cbe46fb4f2478484.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 109, + 520, + 501, + 553.3333333333334 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 109, + 553.3333333333334, + 501, + 586.6666666666667 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 109, + 586.6666666666667, + 501, + 620.0000000000001 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 630, + 506, + 664 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 629, + 506, + 643 + ], + "spans": [ + { + "bbox": [ + 105, + 629, + 506, + 643 + ], + "score": 1.0, + "content": "Figure 4: Predictions of a neural network on the 9 example programs described in this section.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 640, + 506, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 640, + 506, + 654 + ], + "score": 1.0, + "content": "Numbers in squares would ideally be close to 1 (function is present in the ground truth source code),", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 651, + 424, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 424, + 664 + ], + "score": 1.0, + "content": "whereas all other numbers should ideally be close to 0 (function is not needed).", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + } + ], + "index": 7 + }, + { + "type": "title", + "bbox": [ + 108, + 685, + 259, + 698 + ], + "lines": [ + { + "bbox": [ + 105, + 684, + 260, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 684, + 260, + 700 + ], + "score": 1.0, + "content": "B EXPERIMENTAL RESULTS", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "Results presented in Sect. 5.1 showcased the computational speedups obtained from the LIPS frame-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 720, + 504, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 504, + 733 + ], + "score": 1.0, + "content": "work (using DeepCoder), as opposed to solving each program synthesis problem with only the", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + } + ], + "page_idx": 12, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 107, + 42, + 507, + 463 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 107, + 42, + 507, + 463 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 42, + 507, + 463 + ], + "spans": [ + { + "bbox": [ + 107, + 42, + 507, + 463 + ], + "score": 0.721, + "html": "
Program 6: IO example: t←[int] Input: p←[int] [4 8 11 2], C←MAP(-1)t [2341] d←MAP(-1)p Output: e ←ZIPWITH(+)c d 1 f←MINIMUMeDescription: Umberto has a large collection of ties and match- ing pocket squares—too large, his wife says—and he needs to sell one pair. Given their values as arrays t and p,assuming that he sells the cheapest pair, and selling costs 2,how much will he lose from the sale?
Program 7: IO example: s←[int] Input: p←[int] [4723], C ← SCANL1(+)p [2131] d ←ZIPWITH(*)S C Output: e←SUMd 62Description: Zack always promised his n friends to buy them candy, but never did. Now he won the lottery and counts how often and how much candy he promised to his friends,obtaining arrays p (num- ber of promises) and s (number of promised sweets). He announces that to repay them,he will buy s[1]+s[2]+...+s[n] pieces of candy for the firstp[1]days,thens[2]+s[3]+...+s[n]for p[2] days,and so on,until he has fulfilled all promises. How much candy will he buy in total?
Program 8: IO example: s←[int] Input: b ←REVERSE S [12457] C ←ZIPWITH(-)b s Output: d ←FILTER(>O)C 9 e←SuMdDescription: Vivian loves rearranging things.Most of all,when she sees a row of heaps, she wants to make sure that each heap has more items than the one to its left. She is also obsessed with efficiency, so always moves the least possible number of items.Her dad really dislikes if she changes the size of heaps,so she only moves single items between them,making sure that the set of sizes of the heaps is the same as at the start; they are only in a different order. When you come in, you see heaps of sizes (of course,sizes strictly monotonically increasing)s[O],s[1],... s[n].What is the maximal number of items that Vivian could have moved?
", + "type": "table", + "image_path": "c0b9fa01cfad5a4a38406952d046a34d3bfd424df86c9c92982450ad23a4740b.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 42, + 507, + 182.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 182.33333333333334, + 507, + 322.6666666666667 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 322.6666666666667, + 507, + 463.0 + ], + "spans": [], + "index": 2 + } + ] + } + ], + "index": 1 + }, + { + "type": "image", + "bbox": [ + 109, + 520, + 501, + 620 + ], + "blocks": [ + { + "type": "image_caption", + "bbox": [ + 106, + 474, + 506, + 508 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 474, + 506, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 474, + 457, + 487 + ], + "score": 1.0, + "content": "Fig. 4 shows the predictions made by a neural network trained on programs of length", + "type": "text" + }, + { + "bbox": [ + 457, + 475, + 486, + 485 + ], + "score": 0.9, + "content": "T = 4", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 474, + 506, + 487 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 486, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 505, + 498 + ], + "score": 1.0, + "content": "were ensured to be semantically disjoint from all 9 example programs shown in this section. For each", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 496, + 382, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 382, + 509 + ], + "score": 1.0, + "content": "task, the neural network was provided with 5 input-output examples.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + }, + { + "type": "image_body", + "bbox": [ + 109, + 520, + 501, + 620 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 520, + 501, + 620 + ], + "spans": [ + { + "bbox": [ + 109, + 520, + 501, + 620 + ], + "score": 0.952, + "type": "image", + "image_path": "6d29878119ef08e20bad2e228bb9a4b1140e7a88251e4c13cbe46fb4f2478484.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 109, + 520, + 501, + 553.3333333333334 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 109, + 553.3333333333334, + 501, + 586.6666666666667 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 109, + 586.6666666666667, + 501, + 620.0000000000001 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 630, + 506, + 664 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 629, + 506, + 643 + ], + "spans": [ + { + "bbox": [ + 105, + 629, + 506, + 643 + ], + "score": 1.0, + "content": "Figure 4: Predictions of a neural network on the 9 example programs described in this section.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 640, + 506, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 640, + 506, + 654 + ], + "score": 1.0, + "content": "Numbers in squares would ideally be close to 1 (function is present in the ground truth source code),", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 651, + 424, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 424, + 664 + ], + "score": 1.0, + "content": "whereas all other numbers should ideally be close to 0 (function is not needed).", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + } + ], + "index": 7 + }, + { + "type": "title", + "bbox": [ + 108, + 685, + 259, + 698 + ], + "lines": [ + { + "bbox": [ + 105, + 684, + 260, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 684, + 260, + 700 + ], + "score": 1.0, + "content": "B EXPERIMENTAL RESULTS", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "Results presented in Sect. 5.1 showcased the computational speedups obtained from the LIPS frame-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 720, + 504, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 504, + 733 + ], + "score": 1.0, + "content": "work (using DeepCoder), as opposed to solving each program synthesis problem with only the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "information about global incidence of functions in source code available. For completeness, here we", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 507, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 507, + 106 + ], + "score": 1.0, + "content": "show plots of raw computation times of each search procedure to solve a given number of problems.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 709, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "information about global incidence of functions in source code available. For completeness, here we", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 507, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 507, + 106 + ], + "score": 1.0, + "content": "show plots of raw computation times of each search procedure to solve a given number of problems.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 110, + 505, + 177 + ], + "lines": [ + { + "bbox": [ + 106, + 111, + 506, + 122 + ], + "spans": [ + { + "bbox": [ + 106, + 111, + 506, + 122 + ], + "score": 1.0, + "content": "Fig. 5 shows the computation times of DFS, of Enumerative search with a Sort and add scheme, of", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 120, + 506, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 120, + 121, + 134 + ], + "score": 1.0, + "content": "the", + "type": "text" + }, + { + "bbox": [ + 122, + 121, + 133, + 132 + ], + "score": 0.86, + "content": "\\lambda ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 120, + 506, + 134 + ], + "score": 1.0, + "content": "and Sketch solvers with a Sort and add scheme, and of Beam search, when searching for a", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 362, + 145 + ], + "score": 1.0, + "content": "program consistent with input-output examples generated from", + "type": "text" + }, + { + "bbox": [ + 362, + 132, + 399, + 142 + ], + "score": 0.89, + "content": "P = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 132, + 506, + 145 + ], + "score": 1.0, + "content": "different test programs of", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 142, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 133, + 156 + ], + "score": 1.0, + "content": "length", + "type": "text" + }, + { + "bbox": [ + 133, + 144, + 160, + 154 + ], + "score": 0.91, + "content": "T = 3", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 142, + 506, + 156 + ], + "score": 1.0, + "content": ". As discussed in Sect. 5.1, these test programs were ensured to be semantically disjoint", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "score": 1.0, + "content": "from all programs used to train the neural networks, as well as from all programs of shorter length", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 214, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 214, + 177 + ], + "score": 1.0, + "content": "(as discussed in Sect. 4.2).", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 4.5 + }, + { + "type": "image", + "bbox": [ + 110, + 191, + 497, + 291 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 110, + 191, + 497, + 291 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 191, + 497, + 291 + ], + "spans": [ + { + "bbox": [ + 110, + 191, + 497, + 291 + ], + "score": 0.962, + "type": "image", + "image_path": "69617f5d9c5e8b7b5a7be3c5b88b0456a2865590e84e41413e9067abe2f41f17.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 110, + 191, + 497, + 224.33333333333334 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 110, + 224.33333333333334, + 497, + 257.6666666666667 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 110, + 257.6666666666667, + 497, + 291.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 169, + 306, + 441, + 317 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 168, + 304, + 442, + 320 + ], + "spans": [ + { + "bbox": [ + 168, + 304, + 442, + 320 + ], + "score": 1.0, + "content": "Figure 5: Number of test problems solved versus computation time.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + } + ], + "index": 10.0 + }, + { + "type": "text", + "bbox": [ + 106, + 332, + 506, + 398 + ], + "lines": [ + { + "bbox": [ + 106, + 332, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 332, + 506, + 344 + ], + "score": 1.0, + "content": "The “steps” in the results for Beam search are due to our search strategy, which doubles the size of", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 342, + 506, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 506, + 356 + ], + "score": 1.0, + "content": "the considered beam until reaching the timeout (of 1000 seconds) and thus steps occur whenever", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 353, + 506, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 225, + 366 + ], + "score": 1.0, + "content": "the search for a beam of size", + "type": "text" + }, + { + "bbox": [ + 225, + 353, + 236, + 364 + ], + "score": 0.86, + "content": "2 ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 353, + 300, + 366 + ], + "score": 1.0, + "content": "is finished. For", + "type": "text" + }, + { + "bbox": [ + 300, + 353, + 312, + 364 + ], + "score": 0.86, + "content": "\\dot { \\lambda ^ { 2 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 353, + 506, + 366 + ], + "score": 1.0, + "content": ", we observed that no solution for a given set of", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 364, + 504, + 377 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 492, + 377 + ], + "score": 1.0, + "content": "allowed functions was ever found after about 5 seconds (on the benchmark machines), but that", + "type": "text" + }, + { + "bbox": [ + 492, + 365, + 504, + 375 + ], + "score": 0.84, + "content": "\\lambda ^ { 2 }", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 376, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 505, + 387 + ], + "score": 1.0, + "content": "continued to search. Hence, we introduced a hard timeout after 6 seconds for all but the last iterations", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 387, + 222, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 222, + 399 + ], + "score": 1.0, + "content": "of our Sort and add scheme.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 106, + 403, + 505, + 448 + ], + "lines": [ + { + "bbox": [ + 106, + 405, + 504, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 504, + 415 + ], + "score": 1.0, + "content": "Fig. 6 shows the computation times of DFS, Enumerative search with a Sort and add scheme, and", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 413, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 414, + 118, + 425 + ], + "score": 0.85, + "content": "\\lambda ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 118, + 413, + 505, + 428 + ], + "score": 1.0, + "content": "with a Sort and add scheme when searching for programs consistent with input-output examples", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 425, + 506, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 170, + 438 + ], + "score": 1.0, + "content": "generated from", + "type": "text" + }, + { + "bbox": [ + 171, + 426, + 209, + 436 + ], + "score": 0.9, + "content": "P = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 425, + 343, + 438 + ], + "score": 1.0, + "content": "different test programs of length", + "type": "text" + }, + { + "bbox": [ + 343, + 426, + 371, + 436 + ], + "score": 0.9, + "content": "T = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 425, + 506, + 438 + ], + "score": 1.0, + "content": ". The neural network was trained", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 437, + 228, + 449 + ], + "spans": [ + { + "bbox": [ + 105, + 437, + 197, + 449 + ], + "score": 1.0, + "content": "on programs of length", + "type": "text" + }, + { + "bbox": [ + 197, + 437, + 224, + 447 + ], + "score": 0.9, + "content": "T = 4", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 437, + 228, + 449 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5 + }, + { + "type": "image", + "bbox": [ + 111, + 463, + 498, + 547 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 111, + 463, + 498, + 547 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 111, + 463, + 498, + 547 + ], + "spans": [ + { + "bbox": [ + 111, + 463, + 498, + 547 + ], + "score": 0.962, + "type": "image", + "image_path": "8d83b6177f99db604465ccbe078168c96645752256eb9f14da14c4754aa158fd.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 111, + 463, + 498, + 491.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 111, + 491.0, + 498, + 519.0 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 111, + 519.0, + 498, + 547.0 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 169, + 559, + 441, + 571 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 169, + 558, + 442, + 573 + ], + "spans": [ + { + "bbox": [ + 169, + 558, + 442, + 573 + ], + "score": 1.0, + "content": "Figure 6: Number of test problems solved versus computation time.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + } + ], + "index": 24.0 + }, + { + "type": "title", + "bbox": [ + 108, + 597, + 254, + 610 + ], + "lines": [ + { + "bbox": [ + 105, + 596, + 256, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 256, + 613 + ], + "score": 1.0, + "content": "C THE NEURAL NETWORK", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 109, + 624, + 497, + 636 + ], + "lines": [ + { + "bbox": [ + 108, + 624, + 498, + 636 + ], + "spans": [ + { + "bbox": [ + 108, + 624, + 498, + 636 + ], + "score": 1.0, + "content": "As briefly described in Sect. 4.3, we used the following simple feed-forward architecture encoder:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 126, + 645, + 493, + 658 + ], + "lines": [ + { + "bbox": [ + 131, + 644, + 493, + 660 + ], + "spans": [ + { + "bbox": [ + 131, + 644, + 493, + 660 + ], + "score": 1.0, + "content": "• For each input-output example in the set generated from a single ground truth program:", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 152, + 663, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 151, + 662, + 504, + 675 + ], + "spans": [ + { + "bbox": [ + 151, + 662, + 452, + 675 + ], + "score": 1.0, + "content": "– Pad arrays appearing in the inputs and in the output to a maximum length", + "type": "text" + }, + { + "bbox": [ + 453, + 663, + 484, + 673 + ], + "score": 0.89, + "content": "L = 2 0", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 662, + 504, + 675 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 161, + 674, + 253, + 686 + ], + "spans": [ + { + "bbox": [ + 161, + 674, + 253, + 686 + ], + "score": 1.0, + "content": "a special NULL value.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 151, + 687, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 151, + 687, + 506, + 701 + ], + "score": 1.0, + "content": "– Represent the type (singleton integer or integer array) of each input and of the output", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 161, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 161, + 699, + 479, + 711 + ], + "score": 1.0, + "content": "using a one-hot-encoding vector. Embed each integer in the valid integer range", + "type": "text" + }, + { + "bbox": [ + 479, + 699, + 505, + 710 + ], + "score": 0.6, + "content": "( - 2 5 6", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 161, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 161, + 710, + 328, + 722 + ], + "score": 1.0, + "content": "to 255) using a learned embedding into", + "type": "text" + }, + { + "bbox": [ + 328, + 710, + 364, + 720 + ], + "score": 0.89, + "content": "E = 2 0", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "dimensional space. Also learn an", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 162, + 721, + 326, + 733 + ], + "spans": [ + { + "bbox": [ + 162, + 721, + 326, + 733 + ], + "score": 1.0, + "content": "embedding for the padding NULL value.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 31.5 + } + ], + "page_idx": 13, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 507, + 106 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 110, + 505, + 177 + ], + "lines": [ + { + "bbox": [ + 106, + 111, + 506, + 122 + ], + "spans": [ + { + "bbox": [ + 106, + 111, + 506, + 122 + ], + "score": 1.0, + "content": "Fig. 5 shows the computation times of DFS, of Enumerative search with a Sort and add scheme, of", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 120, + 506, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 120, + 121, + 134 + ], + "score": 1.0, + "content": "the", + "type": "text" + }, + { + "bbox": [ + 122, + 121, + 133, + 132 + ], + "score": 0.86, + "content": "\\lambda ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 120, + 506, + 134 + ], + "score": 1.0, + "content": "and Sketch solvers with a Sort and add scheme, and of Beam search, when searching for a", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 362, + 145 + ], + "score": 1.0, + "content": "program consistent with input-output examples generated from", + "type": "text" + }, + { + "bbox": [ + 362, + 132, + 399, + 142 + ], + "score": 0.89, + "content": "P = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 132, + 506, + 145 + ], + "score": 1.0, + "content": "different test programs of", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 142, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 133, + 156 + ], + "score": 1.0, + "content": "length", + "type": "text" + }, + { + "bbox": [ + 133, + 144, + 160, + 154 + ], + "score": 0.91, + "content": "T = 3", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 142, + 506, + 156 + ], + "score": 1.0, + "content": ". As discussed in Sect. 5.1, these test programs were ensured to be semantically disjoint", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "score": 1.0, + "content": "from all programs used to train the neural networks, as well as from all programs of shorter length", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 214, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 214, + 177 + ], + "score": 1.0, + "content": "(as discussed in Sect. 4.2).", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 111, + 506, + 177 + ] + }, + { + "type": "image", + "bbox": [ + 110, + 191, + 497, + 291 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 110, + 191, + 497, + 291 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 191, + 497, + 291 + ], + "spans": [ + { + "bbox": [ + 110, + 191, + 497, + 291 + ], + "score": 0.962, + "type": "image", + "image_path": "69617f5d9c5e8b7b5a7be3c5b88b0456a2865590e84e41413e9067abe2f41f17.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 110, + 191, + 497, + 224.33333333333334 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 110, + 224.33333333333334, + 497, + 257.6666666666667 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 110, + 257.6666666666667, + 497, + 291.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 169, + 306, + 441, + 317 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 168, + 304, + 442, + 320 + ], + "spans": [ + { + "bbox": [ + 168, + 304, + 442, + 320 + ], + "score": 1.0, + "content": "Figure 5: Number of test problems solved versus computation time.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + } + ], + "index": 10.0 + }, + { + "type": "text", + "bbox": [ + 106, + 332, + 506, + 398 + ], + "lines": [ + { + "bbox": [ + 106, + 332, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 332, + 506, + 344 + ], + "score": 1.0, + "content": "The “steps” in the results for Beam search are due to our search strategy, which doubles the size of", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 342, + 506, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 506, + 356 + ], + "score": 1.0, + "content": "the considered beam until reaching the timeout (of 1000 seconds) and thus steps occur whenever", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 353, + 506, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 225, + 366 + ], + "score": 1.0, + "content": "the search for a beam of size", + "type": "text" + }, + { + "bbox": [ + 225, + 353, + 236, + 364 + ], + "score": 0.86, + "content": "2 ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 353, + 300, + 366 + ], + "score": 1.0, + "content": "is finished. For", + "type": "text" + }, + { + "bbox": [ + 300, + 353, + 312, + 364 + ], + "score": 0.86, + "content": "\\dot { \\lambda ^ { 2 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 353, + 506, + 366 + ], + "score": 1.0, + "content": ", we observed that no solution for a given set of", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 364, + 504, + 377 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 492, + 377 + ], + "score": 1.0, + "content": "allowed functions was ever found after about 5 seconds (on the benchmark machines), but that", + "type": "text" + }, + { + "bbox": [ + 492, + 365, + 504, + 375 + ], + "score": 0.84, + "content": "\\lambda ^ { 2 }", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 376, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 505, + 387 + ], + "score": 1.0, + "content": "continued to search. Hence, we introduced a hard timeout after 6 seconds for all but the last iterations", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 387, + 222, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 222, + 399 + ], + "score": 1.0, + "content": "of our Sort and add scheme.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 332, + 506, + 399 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 403, + 505, + 448 + ], + "lines": [ + { + "bbox": [ + 106, + 405, + 504, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 504, + 415 + ], + "score": 1.0, + "content": "Fig. 6 shows the computation times of DFS, Enumerative search with a Sort and add scheme, and", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 413, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 414, + 118, + 425 + ], + "score": 0.85, + "content": "\\lambda ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 118, + 413, + 505, + 428 + ], + "score": 1.0, + "content": "with a Sort and add scheme when searching for programs consistent with input-output examples", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 425, + 506, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 170, + 438 + ], + "score": 1.0, + "content": "generated from", + "type": "text" + }, + { + "bbox": [ + 171, + 426, + 209, + 436 + ], + "score": 0.9, + "content": "P = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 425, + 343, + 438 + ], + "score": 1.0, + "content": "different test programs of length", + "type": "text" + }, + { + "bbox": [ + 343, + 426, + 371, + 436 + ], + "score": 0.9, + "content": "T = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 425, + 506, + 438 + ], + "score": 1.0, + "content": ". The neural network was trained", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 437, + 228, + 449 + ], + "spans": [ + { + "bbox": [ + 105, + 437, + 197, + 449 + ], + "score": 1.0, + "content": "on programs of length", + "type": "text" + }, + { + "bbox": [ + 197, + 437, + 224, + 447 + ], + "score": 0.9, + "content": "T = 4", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 437, + 228, + 449 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 405, + 506, + 449 + ] + }, + { + "type": "image", + "bbox": [ + 111, + 463, + 498, + 547 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 111, + 463, + 498, + 547 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 111, + 463, + 498, + 547 + ], + "spans": [ + { + "bbox": [ + 111, + 463, + 498, + 547 + ], + "score": 0.962, + "type": "image", + "image_path": "8d83b6177f99db604465ccbe078168c96645752256eb9f14da14c4754aa158fd.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 111, + 463, + 498, + 491.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 111, + 491.0, + 498, + 519.0 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 111, + 519.0, + 498, + 547.0 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 169, + 559, + 441, + 571 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 169, + 558, + 442, + 573 + ], + "spans": [ + { + "bbox": [ + 169, + 558, + 442, + 573 + ], + "score": 1.0, + "content": "Figure 6: Number of test problems solved versus computation time.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + } + ], + "index": 24.0 + }, + { + "type": "title", + "bbox": [ + 108, + 597, + 254, + 610 + ], + "lines": [ + { + "bbox": [ + 105, + 596, + 256, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 256, + 613 + ], + "score": 1.0, + "content": "C THE NEURAL NETWORK", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 109, + 624, + 497, + 636 + ], + "lines": [ + { + "bbox": [ + 108, + 624, + 498, + 636 + ], + "spans": [ + { + "bbox": [ + 108, + 624, + 498, + 636 + ], + "score": 1.0, + "content": "As briefly described in Sect. 4.3, we used the following simple feed-forward architecture encoder:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27, + "bbox_fs": [ + 108, + 624, + 498, + 636 + ] + }, + { + "type": "text", + "bbox": [ + 126, + 645, + 493, + 658 + ], + "lines": [ + { + "bbox": [ + 131, + 644, + 493, + 660 + ], + "spans": [ + { + "bbox": [ + 131, + 644, + 493, + 660 + ], + "score": 1.0, + "content": "• For each input-output example in the set generated from a single ground truth program:", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 131, + 644, + 493, + 660 + ] + }, + { + "type": "list", + "bbox": [ + 152, + 663, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 151, + 662, + 504, + 675 + ], + "spans": [ + { + "bbox": [ + 151, + 662, + 452, + 675 + ], + "score": 1.0, + "content": "– Pad arrays appearing in the inputs and in the output to a maximum length", + "type": "text" + }, + { + "bbox": [ + 453, + 663, + 484, + 673 + ], + "score": 0.89, + "content": "L = 2 0", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 662, + 504, + 675 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 29, + "is_list_start_line": true + }, + { + "bbox": [ + 161, + 674, + 253, + 686 + ], + "spans": [ + { + "bbox": [ + 161, + 674, + 253, + 686 + ], + "score": 1.0, + "content": "a special NULL value.", + "type": "text" + } + ], + "index": 30, + "is_list_end_line": true + }, + { + "bbox": [ + 151, + 687, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 151, + 687, + 506, + 701 + ], + "score": 1.0, + "content": "– Represent the type (singleton integer or integer array) of each input and of the output", + "type": "text" + } + ], + "index": 31, + "is_list_start_line": true + }, + { + "bbox": [ + 161, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 161, + 699, + 479, + 711 + ], + "score": 1.0, + "content": "using a one-hot-encoding vector. Embed each integer in the valid integer range", + "type": "text" + }, + { + "bbox": [ + 479, + 699, + 505, + 710 + ], + "score": 0.6, + "content": "( - 2 5 6", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 161, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 161, + 710, + 328, + 722 + ], + "score": 1.0, + "content": "to 255) using a learned embedding into", + "type": "text" + }, + { + "bbox": [ + 328, + 710, + 364, + 720 + ], + "score": 0.89, + "content": "E = 2 0", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "dimensional space. Also learn an", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 162, + 721, + 326, + 733 + ], + "spans": [ + { + "bbox": [ + 162, + 721, + 326, + 733 + ], + "score": 1.0, + "content": "embedding for the padding NULL value.", + "type": "text" + } + ], + "index": 34, + "is_list_end_line": true + } + ], + "index": 31.5, + "bbox_fs": [ + 151, + 662, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 152, + 82, + 505, + 129 + ], + "lines": [ + { + "bbox": [ + 153, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 153, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "– Concatenate the representations of the input types, the embeddings of integers in the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 161, + 93, + 506, + 108 + ], + "spans": [ + { + "bbox": [ + 161, + 93, + 506, + 108 + ], + "score": 1.0, + "content": "inputs, the representation of the output type, and the embeddings of integers in the", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 162, + 104, + 327, + 118 + ], + "spans": [ + { + "bbox": [ + 162, + 104, + 327, + 118 + ], + "score": 1.0, + "content": "output into a single (fixed-length) vector.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 151, + 117, + 506, + 131 + ], + "spans": [ + { + "bbox": [ + 151, + 117, + 259, + 131 + ], + "score": 1.0, + "content": "– Pass this vector through", + "type": "text" + }, + { + "bbox": [ + 259, + 118, + 288, + 128 + ], + "score": 0.89, + "content": "H = 3", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 117, + 388, + 131 + ], + "score": 1.0, + "content": "hidden layers containing", + "type": "text" + }, + { + "bbox": [ + 388, + 118, + 427, + 128 + ], + "score": 0.88, + "content": "K = 2 5 6", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 117, + 506, + 131 + ], + "score": 1.0, + "content": "sigmoid units each.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "text", + "bbox": [ + 130, + 134, + 505, + 156 + ], + "lines": [ + { + "bbox": [ + 131, + 132, + 506, + 147 + ], + "spans": [ + { + "bbox": [ + 131, + 132, + 506, + 147 + ], + "score": 1.0, + "content": "• Pool the last hidden layer encodings of each input-output example together by simple arith-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 141, + 143, + 211, + 158 + ], + "spans": [ + { + "bbox": [ + 141, + 143, + 211, + 158 + ], + "score": 1.0, + "content": "metic averaging.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 106, + 166, + 506, + 200 + ], + "lines": [ + { + "bbox": [ + 105, + 165, + 506, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 179 + ], + "score": 1.0, + "content": "Fig. 7 shows a schematic drawing of this encoder architecture, together with the decoder that performs", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 176, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 505, + 190 + ], + "score": 1.0, + "content": "independent binary classification for each function in the DSL, indicating whether or not it appears", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 188, + 236, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 188, + 236, + 201 + ], + "score": 1.0, + "content": "in the ground truth source code.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 109, + 211, + 505, + 432 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 211, + 505, + 432 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 211, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 109, + 211, + 505, + 432 + ], + "score": 0.969, + "type": "image", + "image_path": "1b4ae4043ae84d4ac119b02713a27cb85173d4a2d0a85116dc32199039ab2623.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 109, + 211, + 505, + 284.6666666666667 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 109, + 284.6666666666667, + 505, + 358.33333333333337 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 109, + 358.33333333333337, + 505, + 432.00000000000006 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 141, + 443, + 468, + 455 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 141, + 442, + 469, + 456 + ], + "spans": [ + { + "bbox": [ + 141, + 442, + 469, + 456 + ], + "score": 1.0, + "content": "Figure 7: Schematic representation of our feed-forward encoder, and the decoder.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + } + ], + "index": 11.0 + }, + { + "type": "text", + "bbox": [ + 106, + 468, + 506, + 545 + ], + "lines": [ + { + "bbox": [ + 105, + 466, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 303, + 482 + ], + "score": 1.0, + "content": "While DeepCoder learns to embed integers into a", + "type": "text" + }, + { + "bbox": [ + 303, + 468, + 336, + 478 + ], + "score": 0.9, + "content": "E = 2 0", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 466, + 505, + 482 + ], + "score": 1.0, + "content": "dimensional space, we built the system up", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 479, + 507, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 208, + 492 + ], + "score": 1.0, + "content": "gradually, starting with a", + "type": "text" + }, + { + "bbox": [ + 209, + 479, + 236, + 489 + ], + "score": 0.91, + "content": "E = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 479, + 476, + 492 + ], + "score": 1.0, + "content": "dimensional space and only training on programs of length", + "type": "text" + }, + { + "bbox": [ + 477, + 479, + 503, + 489 + ], + "score": 0.9, + "content": "T = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 504, + 479, + 507, + 492 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 488, + 506, + 503 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 506, + 503 + ], + "score": 1.0, + "content": "Such a small scale setting allowed easier investigation of the workings of the neural network, and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 500, + 506, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 367, + 514 + ], + "score": 1.0, + "content": "indeed Fig. 8 below shows a learned embedding of integers in", + "type": "text" + }, + { + "bbox": [ + 367, + 500, + 380, + 511 + ], + "score": 0.86, + "content": "\\mathbb { R } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 500, + 506, + 514 + ], + "score": 1.0, + "content": ". The figure demonstrates that", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 511, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 506, + 525 + ], + "score": 1.0, + "content": "the network has learnt the concepts of number magnitude, sign (positive or negative) and evenness,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 522, + 506, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 214, + 536 + ], + "score": 1.0, + "content": "presumably due to FILTER", + "type": "text" + }, + { + "bbox": [ + 215, + 524, + 235, + 534 + ], + "score": 0.79, + "content": "( > 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 522, + 275, + 536 + ], + "score": 1.0, + "content": ", FILTER", + "type": "text" + }, + { + "bbox": [ + 275, + 524, + 296, + 534 + ], + "score": 0.73, + "content": "( < 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 522, + 339, + 536 + ], + "score": 1.0, + "content": ", FILTER (", + "type": "text" + }, + { + "bbox": [ + 339, + 524, + 370, + 533 + ], + "score": 0.87, + "content": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 522, + 430, + 536 + ], + "score": 1.0, + "content": ") and FILTER (", + "type": "text" + }, + { + "bbox": [ + 431, + 524, + 462, + 533 + ], + "score": 0.88, + "content": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 522, + 506, + 536 + ], + "score": 1.0, + "content": ") all being", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 534, + 331, + 546 + ], + "spans": [ + { + "bbox": [ + 106, + 534, + 331, + 546 + ], + "score": 1.0, + "content": "among the programs on which the network was trained.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 16 + }, + { + "type": "title", + "bbox": [ + 108, + 562, + 245, + 575 + ], + "lines": [ + { + "bbox": [ + 105, + 561, + 246, + 577 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 246, + 577 + ], + "score": 1.0, + "content": "D DEPTH-FIRST SEARCH", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 588, + 505, + 643 + ], + "lines": [ + { + "bbox": [ + 106, + 588, + 504, + 600 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 191, + 600 + ], + "score": 1.0, + "content": "We use an optimized", + "type": "text" + }, + { + "bbox": [ + 191, + 588, + 212, + 599 + ], + "score": 0.88, + "content": "\\mathrm { C } { + } { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 588, + 504, + 600 + ], + "score": 1.0, + "content": "implementation of depth-first search (DFS) to search over programs with", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 599, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 212, + 611 + ], + "score": 1.0, + "content": "a given maximum length", + "type": "text" + }, + { + "bbox": [ + 212, + 600, + 221, + 609 + ], + "score": 0.66, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 599, + 505, + 611 + ], + "score": 1.0, + "content": ". In depth-first search, we start by choosing the first function (and its", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 609, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 505, + 623 + ], + "score": 1.0, + "content": "arguments) of a potential solution program, and then recursively consider all ways of filling in the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 621, + 506, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 245, + 634 + ], + "score": 1.0, + "content": "rest of the program (up to length", + "type": "text" + }, + { + "bbox": [ + 246, + 622, + 255, + 631 + ], + "score": 0.7, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 621, + 506, + 634 + ], + "score": 1.0, + "content": "), before moving on to a next choice of first instruction (if a", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 632, + 239, + 644 + ], + "spans": [ + { + "bbox": [ + 106, + 632, + 239, + 644 + ], + "score": 1.0, + "content": "solution has not yet been found).", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 648, + 505, + 715 + ], + "lines": [ + { + "bbox": [ + 105, + 649, + 507, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 345, + 662 + ], + "score": 1.0, + "content": "A program is considered a solution if it is consistent with all", + "type": "text" + }, + { + "bbox": [ + 345, + 649, + 375, + 659 + ], + "score": 0.89, + "content": "M = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 649, + 507, + 662 + ], + "score": 1.0, + "content": "provided input-output examples.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 660, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 355, + 673 + ], + "score": 1.0, + "content": "Note that this requires evaluating all candidate programs on the", + "type": "text" + }, + { + "bbox": [ + 356, + 660, + 368, + 670 + ], + "score": 0.75, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 660, + 506, + 673 + ], + "score": 1.0, + "content": "inputs and checking the results for", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 670, + 506, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 212, + 684 + ], + "score": 1.0, + "content": "equality with the provided", + "type": "text" + }, + { + "bbox": [ + 213, + 671, + 225, + 681 + ], + "score": 0.77, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 670, + 506, + 684 + ], + "score": 1.0, + "content": "respective outputs. Our implementation of DFS exploits the sequential", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 681, + 505, + 694 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 505, + 694 + ], + "score": 1.0, + "content": "structure of programs in our DSL by caching the results of evaluating all prefixes of the currently", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 694, + 505, + 705 + ], + "spans": [ + { + "bbox": [ + 106, + 694, + 505, + 705 + ], + "score": 1.0, + "content": "considered program on the example inputs, thus allowing efficient reuse of computation between", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 704, + 281, + 716 + ], + "spans": [ + { + "bbox": [ + 105, + 704, + 281, + 716 + ], + "score": 1.0, + "content": "candidate programs with common prefixes.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 105, + 720, + 501, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 720, + 502, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 369, + 734 + ], + "score": 1.0, + "content": "This allows us to explore the search space at roughly the speed of", + "type": "text" + }, + { + "bbox": [ + 370, + 720, + 413, + 731 + ], + "score": 0.91, + "content": "\\sim 3 \\times 1 0 ^ { 6 }", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 720, + 502, + 734 + ], + "score": 1.0, + "content": "programs per second.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + } + ], + "page_idx": 14, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 152, + 82, + 505, + 129 + ], + "lines": [ + { + "bbox": [ + 153, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 153, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "– Concatenate the representations of the input types, the embeddings of integers in the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 161, + 93, + 506, + 108 + ], + "spans": [ + { + "bbox": [ + 161, + 93, + 506, + 108 + ], + "score": 1.0, + "content": "inputs, the representation of the output type, and the embeddings of integers in the", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 162, + 104, + 327, + 118 + ], + "spans": [ + { + "bbox": [ + 162, + 104, + 327, + 118 + ], + "score": 1.0, + "content": "output into a single (fixed-length) vector.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 151, + 117, + 506, + 131 + ], + "spans": [ + { + "bbox": [ + 151, + 117, + 259, + 131 + ], + "score": 1.0, + "content": "– Pass this vector through", + "type": "text" + }, + { + "bbox": [ + 259, + 118, + 288, + 128 + ], + "score": 0.89, + "content": "H = 3", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 117, + 388, + 131 + ], + "score": 1.0, + "content": "hidden layers containing", + "type": "text" + }, + { + "bbox": [ + 388, + 118, + 427, + 128 + ], + "score": 0.88, + "content": "K = 2 5 6", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 117, + 506, + 131 + ], + "score": 1.0, + "content": "sigmoid units each.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5, + "bbox_fs": [ + 151, + 81, + 506, + 131 + ] + }, + { + "type": "text", + "bbox": [ + 130, + 134, + 505, + 156 + ], + "lines": [ + { + "bbox": [ + 131, + 132, + 506, + 147 + ], + "spans": [ + { + "bbox": [ + 131, + 132, + 506, + 147 + ], + "score": 1.0, + "content": "• Pool the last hidden layer encodings of each input-output example together by simple arith-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 141, + 143, + 211, + 158 + ], + "spans": [ + { + "bbox": [ + 141, + 143, + 211, + 158 + ], + "score": 1.0, + "content": "metic averaging.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 131, + 132, + 506, + 158 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 166, + 506, + 200 + ], + "lines": [ + { + "bbox": [ + 105, + 165, + 506, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 179 + ], + "score": 1.0, + "content": "Fig. 7 shows a schematic drawing of this encoder architecture, together with the decoder that performs", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 176, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 505, + 190 + ], + "score": 1.0, + "content": "independent binary classification for each function in the DSL, indicating whether or not it appears", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 188, + 236, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 188, + 236, + 201 + ], + "score": 1.0, + "content": "in the ground truth source code.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 165, + 506, + 201 + ] + }, + { + "type": "image", + "bbox": [ + 109, + 211, + 505, + 432 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 211, + 505, + 432 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 211, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 109, + 211, + 505, + 432 + ], + "score": 0.969, + "type": "image", + "image_path": "1b4ae4043ae84d4ac119b02713a27cb85173d4a2d0a85116dc32199039ab2623.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 109, + 211, + 505, + 284.6666666666667 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 109, + 284.6666666666667, + 505, + 358.33333333333337 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 109, + 358.33333333333337, + 505, + 432.00000000000006 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 141, + 443, + 468, + 455 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 141, + 442, + 469, + 456 + ], + "spans": [ + { + "bbox": [ + 141, + 442, + 469, + 456 + ], + "score": 1.0, + "content": "Figure 7: Schematic representation of our feed-forward encoder, and the decoder.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + } + ], + "index": 11.0 + }, + { + "type": "text", + "bbox": [ + 106, + 468, + 506, + 545 + ], + "lines": [ + { + "bbox": [ + 105, + 466, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 303, + 482 + ], + "score": 1.0, + "content": "While DeepCoder learns to embed integers into a", + "type": "text" + }, + { + "bbox": [ + 303, + 468, + 336, + 478 + ], + "score": 0.9, + "content": "E = 2 0", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 466, + 505, + 482 + ], + "score": 1.0, + "content": "dimensional space, we built the system up", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 479, + 507, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 208, + 492 + ], + "score": 1.0, + "content": "gradually, starting with a", + "type": "text" + }, + { + "bbox": [ + 209, + 479, + 236, + 489 + ], + "score": 0.91, + "content": "E = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 479, + 476, + 492 + ], + "score": 1.0, + "content": "dimensional space and only training on programs of length", + "type": "text" + }, + { + "bbox": [ + 477, + 479, + 503, + 489 + ], + "score": 0.9, + "content": "T = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 504, + 479, + 507, + 492 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 488, + 506, + 503 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 506, + 503 + ], + "score": 1.0, + "content": "Such a small scale setting allowed easier investigation of the workings of the neural network, and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 500, + 506, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 367, + 514 + ], + "score": 1.0, + "content": "indeed Fig. 8 below shows a learned embedding of integers in", + "type": "text" + }, + { + "bbox": [ + 367, + 500, + 380, + 511 + ], + "score": 0.86, + "content": "\\mathbb { R } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 500, + 506, + 514 + ], + "score": 1.0, + "content": ". The figure demonstrates that", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 511, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 506, + 525 + ], + "score": 1.0, + "content": "the network has learnt the concepts of number magnitude, sign (positive or negative) and evenness,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 522, + 506, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 214, + 536 + ], + "score": 1.0, + "content": "presumably due to FILTER", + "type": "text" + }, + { + "bbox": [ + 215, + 524, + 235, + 534 + ], + "score": 0.79, + "content": "( > 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 522, + 275, + 536 + ], + "score": 1.0, + "content": ", FILTER", + "type": "text" + }, + { + "bbox": [ + 275, + 524, + 296, + 534 + ], + "score": 0.73, + "content": "( < 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 522, + 339, + 536 + ], + "score": 1.0, + "content": ", FILTER (", + "type": "text" + }, + { + "bbox": [ + 339, + 524, + 370, + 533 + ], + "score": 0.87, + "content": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 522, + 430, + 536 + ], + "score": 1.0, + "content": ") and FILTER (", + "type": "text" + }, + { + "bbox": [ + 431, + 524, + 462, + 533 + ], + "score": 0.88, + "content": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 522, + 506, + 536 + ], + "score": 1.0, + "content": ") all being", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 534, + 331, + 546 + ], + "spans": [ + { + "bbox": [ + 106, + 534, + 331, + 546 + ], + "score": 1.0, + "content": "among the programs on which the network was trained.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 466, + 507, + 546 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 562, + 245, + 575 + ], + "lines": [ + { + "bbox": [ + 105, + 561, + 246, + 577 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 246, + 577 + ], + "score": 1.0, + "content": "D DEPTH-FIRST SEARCH", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 588, + 505, + 643 + ], + "lines": [ + { + "bbox": [ + 106, + 588, + 504, + 600 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 191, + 600 + ], + "score": 1.0, + "content": "We use an optimized", + "type": "text" + }, + { + "bbox": [ + 191, + 588, + 212, + 599 + ], + "score": 0.88, + "content": "\\mathrm { C } { + } { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 588, + 504, + 600 + ], + "score": 1.0, + "content": "implementation of depth-first search (DFS) to search over programs with", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 599, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 212, + 611 + ], + "score": 1.0, + "content": "a given maximum length", + "type": "text" + }, + { + "bbox": [ + 212, + 600, + 221, + 609 + ], + "score": 0.66, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 599, + 505, + 611 + ], + "score": 1.0, + "content": ". In depth-first search, we start by choosing the first function (and its", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 609, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 505, + 623 + ], + "score": 1.0, + "content": "arguments) of a potential solution program, and then recursively consider all ways of filling in the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 621, + 506, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 245, + 634 + ], + "score": 1.0, + "content": "rest of the program (up to length", + "type": "text" + }, + { + "bbox": [ + 246, + 622, + 255, + 631 + ], + "score": 0.7, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 621, + 506, + 634 + ], + "score": 1.0, + "content": "), before moving on to a next choice of first instruction (if a", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 632, + 239, + 644 + ], + "spans": [ + { + "bbox": [ + 106, + 632, + 239, + 644 + ], + "score": 1.0, + "content": "solution has not yet been found).", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 588, + 506, + 644 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 648, + 505, + 715 + ], + "lines": [ + { + "bbox": [ + 105, + 649, + 507, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 345, + 662 + ], + "score": 1.0, + "content": "A program is considered a solution if it is consistent with all", + "type": "text" + }, + { + "bbox": [ + 345, + 649, + 375, + 659 + ], + "score": 0.89, + "content": "M = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 649, + 507, + 662 + ], + "score": 1.0, + "content": "provided input-output examples.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 660, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 355, + 673 + ], + "score": 1.0, + "content": "Note that this requires evaluating all candidate programs on the", + "type": "text" + }, + { + "bbox": [ + 356, + 660, + 368, + 670 + ], + "score": 0.75, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 660, + 506, + 673 + ], + "score": 1.0, + "content": "inputs and checking the results for", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 670, + 506, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 212, + 684 + ], + "score": 1.0, + "content": "equality with the provided", + "type": "text" + }, + { + "bbox": [ + 213, + 671, + 225, + 681 + ], + "score": 0.77, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 670, + 506, + 684 + ], + "score": 1.0, + "content": "respective outputs. Our implementation of DFS exploits the sequential", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 681, + 505, + 694 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 505, + 694 + ], + "score": 1.0, + "content": "structure of programs in our DSL by caching the results of evaluating all prefixes of the currently", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 694, + 505, + 705 + ], + "spans": [ + { + "bbox": [ + 106, + 694, + 505, + 705 + ], + "score": 1.0, + "content": "considered program on the example inputs, thus allowing efficient reuse of computation between", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 704, + 281, + 716 + ], + "spans": [ + { + "bbox": [ + 105, + 704, + 281, + 716 + ], + "score": 1.0, + "content": "candidate programs with common prefixes.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 649, + 507, + 716 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 720, + 501, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 720, + 502, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 369, + 734 + ], + "score": 1.0, + "content": "This allows us to explore the search space at roughly the speed of", + "type": "text" + }, + { + "bbox": [ + 370, + 720, + 413, + 731 + ], + "score": 0.91, + "content": "\\sim 3 \\times 1 0 ^ { 6 }", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 720, + 502, + 734 + ], + "score": 1.0, + "content": "programs per second.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 720, + 502, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 84, + 501, + 273 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 84, + 501, + 273 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 84, + 501, + 273 + ], + "spans": [ + { + "bbox": [ + 109, + 84, + 501, + 273 + ], + "score": 0.972, + "type": "image", + "image_path": "94148f752106bd924a4f80c9c825128a3efe588caf08184e8765377bb5e169db.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 84, + 501, + 147.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 147.0, + 501, + 210.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 210.0, + 501, + 273.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 286, + 503, + 309 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 285, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 282, + 299 + ], + "score": 1.0, + "content": "Figure 8: A learned embedding of integers", + "type": "text" + }, + { + "bbox": [ + 283, + 286, + 434, + 298 + ], + "score": 0.92, + "content": "\\{ - 2 5 6 , - 2 5 5 , \\ldots , - 1 , 0 , 1 , \\ldots , 2 5 5 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 285, + 446, + 299 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 446, + 286, + 459, + 297 + ], + "score": 0.86, + "content": "\\mathbb { R } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 285, + 505, + 299 + ], + "score": 1.0, + "content": ". The color", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 296, + 364, + 311 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 364, + 311 + ], + "score": 1.0, + "content": "intensity corresponds to the magnitude of the embedded integer.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "text", + "bbox": [ + 106, + 330, + 506, + 386 + ], + "lines": [ + { + "bbox": [ + 106, + 331, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 106, + 331, + 505, + 343 + ], + "score": 1.0, + "content": "When the search procedure extends a partial program by a new function, it has to try the functions", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 342, + 505, + 353 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 505, + 353 + ], + "score": 1.0, + "content": "in the DSL in some order. At this point DFS can opt to consider the functions as ordered by their", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 104, + 352, + 507, + 366 + ], + "spans": [ + { + "bbox": [ + 104, + 352, + 507, + 366 + ], + "score": 1.0, + "content": "predicted probabilities from the neural network. The probability of a function consisting of a higher-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 364, + 506, + 376 + ], + "spans": [ + { + "bbox": [ + 106, + 364, + 506, + 376 + ], + "score": 1.0, + "content": "order function and a lambda is taken to be the minimum of the probabilities of the two constituent", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 374, + 149, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 149, + 387 + ], + "score": 1.0, + "content": "functions.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7 + }, + { + "type": "title", + "bbox": [ + 108, + 402, + 267, + 415 + ], + "lines": [ + { + "bbox": [ + 105, + 401, + 269, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 269, + 417 + ], + "score": 1.0, + "content": "E TRAINING LOSS FUNCTION", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 428, + 505, + 472 + ], + "lines": [ + { + "bbox": [ + 105, + 428, + 506, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 506, + 441 + ], + "score": 1.0, + "content": "In Sect. 4.5 we outlined a justification for using marginal probabilities of individual functions as", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 439, + 505, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 439, + 505, + 451 + ], + "score": 1.0, + "content": "a sensible intermediate representation to provide a solver employing a Sort and add scheme (we", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 450, + 505, + 462 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 505, + 462 + ], + "score": 1.0, + "content": "considered Enumerative search and the Sketch solver with this scheme). Here we provide a more", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 461, + 187, + 472 + ], + "spans": [ + { + "bbox": [ + 106, + 461, + 187, + 472 + ], + "score": 1.0, + "content": "detailed discussion.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 107, + 478, + 505, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 478, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 505, + 489 + ], + "score": 1.0, + "content": "Predicting program components from input-output examples can be cast as a multilabel classification", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 489, + 506, + 501 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 506, + 501 + ], + "score": 1.0, + "content": "problem, where each instance (set of input-output examples) is associated with a set of relevant", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 499, + 505, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 505, + 512 + ], + "score": 1.0, + "content": "labels (functions appearing in the code that generated the examples). We denote the number of labels", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 511, + 354, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 165, + 524 + ], + "score": 1.0, + "content": "(functions) by", + "type": "text" + }, + { + "bbox": [ + 165, + 511, + 174, + 521 + ], + "score": 0.82, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 511, + 317, + 524 + ], + "score": 1.0, + "content": ", and note that throughout this work", + "type": "text" + }, + { + "bbox": [ + 318, + 511, + 350, + 521 + ], + "score": 0.9, + "content": "C = 3 4", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 511, + 354, + 524 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 108, + 527, + 505, + 561 + ], + "lines": [ + { + "bbox": [ + 105, + 526, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 526, + 286, + 541 + ], + "score": 1.0, + "content": "When the task is to predict a subset of labels", + "type": "text" + }, + { + "bbox": [ + 286, + 527, + 336, + 540 + ], + "score": 0.92, + "content": "\\mathbf { y } \\in \\{ 0 , 1 \\} ^ { C }", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 526, + 505, + 541 + ], + "score": 1.0, + "content": ", different loss functions can be employed", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 538, + 507, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 295, + 551 + ], + "score": 1.0, + "content": "to measure the prediction error of a classifier", + "type": "text" + }, + { + "bbox": [ + 295, + 540, + 316, + 550 + ], + "score": 0.88, + "content": "\\mathbf { h } ( \\mathbf { x } )", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 539, + 401, + 551 + ], + "score": 1.0, + "content": "or ranking function", + "type": "text" + }, + { + "bbox": [ + 401, + 538, + 420, + 550 + ], + "score": 0.76, + "content": "\\mathbf { f } \\left( \\mathbf { x } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 539, + 507, + 551 + ], + "score": 1.0, + "content": ". Dembczynski et al.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 550, + 305, + 562 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 305, + 562 + ], + "score": 1.0, + "content": "(2010) discuss the following three loss functions:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 132, + 570, + 501, + 582 + ], + "lines": [ + { + "bbox": [ + 131, + 569, + 501, + 583 + ], + "spans": [ + { + "bbox": [ + 131, + 569, + 501, + 583 + ], + "score": 1.0, + "content": "• Hamming loss counts the number of labels that are predicted incorrectly by a classifier h:", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "interline_equation", + "bbox": [ + 257, + 587, + 389, + 623 + ], + "lines": [ + { + "bbox": [ + 257, + 587, + 389, + 623 + ], + "spans": [ + { + "bbox": [ + 257, + 587, + 389, + 623 + ], + "score": 0.95, + "content": "L _ { H } ( \\mathbf { y } , \\mathbf { h } ( \\mathbf { x } ) ) = \\sum _ { c = 1 } ^ { C } \\mathbb { 1 } _ { \\{ y _ { c } \\neq h _ { c } ( \\mathbf { x } ) \\} }", + "type": "interline_equation", + "image_path": "fa6196f9fbf8394f13f6328262bfa423b74b8377f605daf309401f0b4973e80a.jpg" + } + ] + } + ], + "index": 23.5, + "virtual_lines": [ + { + "bbox": [ + 257, + 587, + 389, + 605.0 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 257, + 605.0, + 389, + 623.0 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 132, + 629, + 504, + 652 + ], + "lines": [ + { + "bbox": [ + 132, + 629, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 132, + 629, + 505, + 642 + ], + "score": 1.0, + "content": "• Rank loss counts the number of label pairs violating the condition that relevant labels are", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 640, + 377, + 653 + ], + "spans": [ + { + "bbox": [ + 141, + 640, + 377, + 653 + ], + "score": 1.0, + "content": "ranked higher than irrelevant ones by a scoring function f:", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "interline_equation", + "bbox": [ + 245, + 657, + 401, + 694 + ], + "lines": [ + { + "bbox": [ + 245, + 657, + 401, + 694 + ], + "spans": [ + { + "bbox": [ + 245, + 657, + 401, + 694 + ], + "score": 0.94, + "content": "L _ { r } ( \\mathbf { y } , \\mathbf { f } ( \\mathbf { x } ) ) = \\sum _ { ( i , j ) : y _ { i } = 1 , y _ { j } = 0 } ^ { C } \\mathbb { 1 } _ { \\{ f _ { i } < f _ { j } \\} }", + "type": "interline_equation", + "image_path": "6c4a10361237269ae5e855a79a9b0252c35e0fc76a09bc0388230ba2537710ec.jpg" + } + ] + } + ], + "index": 27.5, + "virtual_lines": [ + { + "bbox": [ + 245, + 657, + 401, + 675.5 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 245, + 675.5, + 401, + 694.0 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 132, + 702, + 483, + 714 + ], + "lines": [ + { + "bbox": [ + 131, + 700, + 484, + 716 + ], + "spans": [ + { + "bbox": [ + 131, + 700, + 472, + 716 + ], + "score": 1.0, + "content": "• Subset Zero-One loss indicates whether all labels have been correctly predicted by", + "type": "text" + }, + { + "bbox": [ + 473, + 703, + 480, + 712 + ], + "score": 0.44, + "content": "\\mathbf { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 700, + 484, + 716 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "interline_equation", + "bbox": [ + 270, + 719, + 376, + 734 + ], + "lines": [ + { + "bbox": [ + 270, + 719, + 376, + 734 + ], + "spans": [ + { + "bbox": [ + 270, + 719, + 376, + 734 + ], + "score": 0.91, + "content": "L _ { s } ( \\mathbf { y } , \\mathbf { h } ( \\mathbf { x } ) ) = \\mathbb { 1 } _ { \\{ \\mathbf { y } \\neq \\mathbf { h } ( \\mathbf { x } ) \\} }", + "type": "interline_equation", + "image_path": "63f6d63361921ea6ea8466912257b8b5227d5af74f176ac36e92a36e47107a3e.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 270, + 719, + 376, + 734 + ], + "spans": [], + "index": 30 + } + ] + } + ], + "page_idx": 15, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "16", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 84, + 501, + 273 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 84, + 501, + 273 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 84, + 501, + 273 + ], + "spans": [ + { + "bbox": [ + 109, + 84, + 501, + 273 + ], + "score": 0.972, + "type": "image", + "image_path": "94148f752106bd924a4f80c9c825128a3efe588caf08184e8765377bb5e169db.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 84, + 501, + 147.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 147.0, + 501, + 210.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 210.0, + 501, + 273.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 286, + 503, + 309 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 285, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 282, + 299 + ], + "score": 1.0, + "content": "Figure 8: A learned embedding of integers", + "type": "text" + }, + { + "bbox": [ + 283, + 286, + 434, + 298 + ], + "score": 0.92, + "content": "\\{ - 2 5 6 , - 2 5 5 , \\ldots , - 1 , 0 , 1 , \\ldots , 2 5 5 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 285, + 446, + 299 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 446, + 286, + 459, + 297 + ], + "score": 0.86, + "content": "\\mathbb { R } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 285, + 505, + 299 + ], + "score": 1.0, + "content": ". The color", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 296, + 364, + 311 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 364, + 311 + ], + "score": 1.0, + "content": "intensity corresponds to the magnitude of the embedded integer.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "text", + "bbox": [ + 106, + 330, + 506, + 386 + ], + "lines": [ + { + "bbox": [ + 106, + 331, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 106, + 331, + 505, + 343 + ], + "score": 1.0, + "content": "When the search procedure extends a partial program by a new function, it has to try the functions", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 342, + 505, + 353 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 505, + 353 + ], + "score": 1.0, + "content": "in the DSL in some order. At this point DFS can opt to consider the functions as ordered by their", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 104, + 352, + 507, + 366 + ], + "spans": [ + { + "bbox": [ + 104, + 352, + 507, + 366 + ], + "score": 1.0, + "content": "predicted probabilities from the neural network. The probability of a function consisting of a higher-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 364, + 506, + 376 + ], + "spans": [ + { + "bbox": [ + 106, + 364, + 506, + 376 + ], + "score": 1.0, + "content": "order function and a lambda is taken to be the minimum of the probabilities of the two constituent", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 374, + 149, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 149, + 387 + ], + "score": 1.0, + "content": "functions.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7, + "bbox_fs": [ + 104, + 331, + 507, + 387 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 402, + 267, + 415 + ], + "lines": [ + { + "bbox": [ + 105, + 401, + 269, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 269, + 417 + ], + "score": 1.0, + "content": "E TRAINING LOSS FUNCTION", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 428, + 505, + 472 + ], + "lines": [ + { + "bbox": [ + 105, + 428, + 506, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 506, + 441 + ], + "score": 1.0, + "content": "In Sect. 4.5 we outlined a justification for using marginal probabilities of individual functions as", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 439, + 505, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 439, + 505, + 451 + ], + "score": 1.0, + "content": "a sensible intermediate representation to provide a solver employing a Sort and add scheme (we", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 450, + 505, + 462 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 505, + 462 + ], + "score": 1.0, + "content": "considered Enumerative search and the Sketch solver with this scheme). Here we provide a more", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 461, + 187, + 472 + ], + "spans": [ + { + "bbox": [ + 106, + 461, + 187, + 472 + ], + "score": 1.0, + "content": "detailed discussion.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 428, + 506, + 472 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 478, + 505, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 478, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 505, + 489 + ], + "score": 1.0, + "content": "Predicting program components from input-output examples can be cast as a multilabel classification", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 489, + 506, + 501 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 506, + 501 + ], + "score": 1.0, + "content": "problem, where each instance (set of input-output examples) is associated with a set of relevant", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 499, + 505, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 505, + 512 + ], + "score": 1.0, + "content": "labels (functions appearing in the code that generated the examples). We denote the number of labels", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 511, + 354, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 165, + 524 + ], + "score": 1.0, + "content": "(functions) by", + "type": "text" + }, + { + "bbox": [ + 165, + 511, + 174, + 521 + ], + "score": 0.82, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 511, + 317, + 524 + ], + "score": 1.0, + "content": ", and note that throughout this work", + "type": "text" + }, + { + "bbox": [ + 318, + 511, + 350, + 521 + ], + "score": 0.9, + "content": "C = 3 4", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 511, + 354, + 524 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16.5, + "bbox_fs": [ + 105, + 478, + 506, + 524 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 527, + 505, + 561 + ], + "lines": [ + { + "bbox": [ + 105, + 526, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 526, + 286, + 541 + ], + "score": 1.0, + "content": "When the task is to predict a subset of labels", + "type": "text" + }, + { + "bbox": [ + 286, + 527, + 336, + 540 + ], + "score": 0.92, + "content": "\\mathbf { y } \\in \\{ 0 , 1 \\} ^ { C }", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 526, + 505, + 541 + ], + "score": 1.0, + "content": ", different loss functions can be employed", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 538, + 507, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 295, + 551 + ], + "score": 1.0, + "content": "to measure the prediction error of a classifier", + "type": "text" + }, + { + "bbox": [ + 295, + 540, + 316, + 550 + ], + "score": 0.88, + "content": "\\mathbf { h } ( \\mathbf { x } )", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 539, + 401, + 551 + ], + "score": 1.0, + "content": "or ranking function", + "type": "text" + }, + { + "bbox": [ + 401, + 538, + 420, + 550 + ], + "score": 0.76, + "content": "\\mathbf { f } \\left( \\mathbf { x } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 539, + 507, + 551 + ], + "score": 1.0, + "content": ". Dembczynski et al.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 550, + 305, + 562 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 305, + 562 + ], + "score": 1.0, + "content": "(2010) discuss the following three loss functions:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 526, + 507, + 562 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 570, + 501, + 582 + ], + "lines": [ + { + "bbox": [ + 131, + 569, + 501, + 583 + ], + "spans": [ + { + "bbox": [ + 131, + 569, + 501, + 583 + ], + "score": 1.0, + "content": "• Hamming loss counts the number of labels that are predicted incorrectly by a classifier h:", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22, + "bbox_fs": [ + 131, + 569, + 501, + 583 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 257, + 587, + 389, + 623 + ], + "lines": [ + { + "bbox": [ + 257, + 587, + 389, + 623 + ], + "spans": [ + { + "bbox": [ + 257, + 587, + 389, + 623 + ], + "score": 0.95, + "content": "L _ { H } ( \\mathbf { y } , \\mathbf { h } ( \\mathbf { x } ) ) = \\sum _ { c = 1 } ^ { C } \\mathbb { 1 } _ { \\{ y _ { c } \\neq h _ { c } ( \\mathbf { x } ) \\} }", + "type": "interline_equation", + "image_path": "fa6196f9fbf8394f13f6328262bfa423b74b8377f605daf309401f0b4973e80a.jpg" + } + ] + } + ], + "index": 23.5, + "virtual_lines": [ + { + "bbox": [ + 257, + 587, + 389, + 605.0 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 257, + 605.0, + 389, + 623.0 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 132, + 629, + 504, + 652 + ], + "lines": [ + { + "bbox": [ + 132, + 629, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 132, + 629, + 505, + 642 + ], + "score": 1.0, + "content": "• Rank loss counts the number of label pairs violating the condition that relevant labels are", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 640, + 377, + 653 + ], + "spans": [ + { + "bbox": [ + 141, + 640, + 377, + 653 + ], + "score": 1.0, + "content": "ranked higher than irrelevant ones by a scoring function f:", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 132, + 629, + 505, + 653 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 245, + 657, + 401, + 694 + ], + "lines": [ + { + "bbox": [ + 245, + 657, + 401, + 694 + ], + "spans": [ + { + "bbox": [ + 245, + 657, + 401, + 694 + ], + "score": 0.94, + "content": "L _ { r } ( \\mathbf { y } , \\mathbf { f } ( \\mathbf { x } ) ) = \\sum _ { ( i , j ) : y _ { i } = 1 , y _ { j } = 0 } ^ { C } \\mathbb { 1 } _ { \\{ f _ { i } < f _ { j } \\} }", + "type": "interline_equation", + "image_path": "6c4a10361237269ae5e855a79a9b0252c35e0fc76a09bc0388230ba2537710ec.jpg" + } + ] + } + ], + "index": 27.5, + "virtual_lines": [ + { + "bbox": [ + 245, + 657, + 401, + 675.5 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 245, + 675.5, + 401, + 694.0 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 132, + 702, + 483, + 714 + ], + "lines": [ + { + "bbox": [ + 131, + 700, + 484, + 716 + ], + "spans": [ + { + "bbox": [ + 131, + 700, + 472, + 716 + ], + "score": 1.0, + "content": "• Subset Zero-One loss indicates whether all labels have been correctly predicted by", + "type": "text" + }, + { + "bbox": [ + 473, + 703, + 480, + 712 + ], + "score": 0.44, + "content": "\\mathbf { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 700, + 484, + 716 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29, + "bbox_fs": [ + 131, + 700, + 484, + 716 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 270, + 719, + 376, + 734 + ], + "lines": [ + { + "bbox": [ + 270, + 719, + 376, + 734 + ], + "spans": [ + { + "bbox": [ + 270, + 719, + 376, + 734 + ], + "score": 0.91, + "content": "L _ { s } ( \\mathbf { y } , \\mathbf { h } ( \\mathbf { x } ) ) = \\mathbb { 1 } _ { \\{ \\mathbf { y } \\neq \\mathbf { h } ( \\mathbf { x } ) \\} }", + "type": "interline_equation", + "image_path": "63f6d63361921ea6ea8466912257b8b5227d5af74f176ac36e92a36e47107a3e.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 270, + 719, + 376, + 734 + ], + "spans": [], + "index": 30 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 117 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Dembczynski et al. (2010) proved that Bayes optimal decisions under the Hamming and Rank loss", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "functions, i.e., decisions minimizing the expected loss under these loss functions, can be computed", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 335, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 218, + 118 + ], + "score": 1.0, + "content": "from marginal probabilities", + "type": "text" + }, + { + "bbox": [ + 218, + 104, + 254, + 117 + ], + "score": 0.93, + "content": "p _ { c } ( y _ { c } | \\mathbf { x } )", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 104, + 335, + 118 + ], + "score": 1.0, + "content": ". This suggests that:", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 132, + 124, + 505, + 183 + ], + "lines": [ + { + "bbox": [ + 132, + 123, + 506, + 138 + ], + "spans": [ + { + "bbox": [ + 132, + 123, + 506, + 138 + ], + "score": 1.0, + "content": "• Multilabel classification under these two loss functions may not benefit from considering", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 142, + 136, + 277, + 148 + ], + "spans": [ + { + "bbox": [ + 142, + 136, + 277, + 148 + ], + "score": 1.0, + "content": "dependencies between the labels.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 136, + 149, + 506, + 163 + ], + "spans": [ + { + "bbox": [ + 136, + 149, + 506, + 163 + ], + "score": 1.0, + "content": "• ”Instead of minimizing the Rank loss directly, one can simply use any approach for single", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 140, + 160, + 506, + 174 + ], + "spans": [ + { + "bbox": [ + 140, + 160, + 506, + 174 + ], + "score": 1.0, + "content": "label prediction that properly estimates the marginal probabilities.” (Dembczynski et al., ´", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 140, + 170, + 170, + 186 + ], + "spans": [ + { + "bbox": [ + 140, + 170, + 170, + 186 + ], + "score": 1.0, + "content": "2012)", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 109, + 192, + 505, + 226 + ], + "lines": [ + { + "bbox": [ + 107, + 192, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 107, + 192, + 505, + 205 + ], + "score": 1.0, + "content": "Training the neural network with the negative cross entropy loss function as the training objective is", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 203, + 505, + 217 + ], + "spans": [ + { + "bbox": [ + 107, + 203, + 505, + 217 + ], + "score": 1.0, + "content": "precisely a method for properly estimating the marginal probabilities of labels (functions appearing", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 215, + 497, + 227 + ], + "spans": [ + { + "bbox": [ + 107, + 215, + 497, + 227 + ], + "score": 1.0, + "content": "in source code). It is thus a sensible step in preparation for making predictions under a Rank loss.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 106, + 231, + 505, + 297 + ], + "lines": [ + { + "bbox": [ + 105, + 230, + 506, + 244 + ], + "spans": [ + { + "bbox": [ + 105, + 230, + 506, + 244 + ], + "score": 1.0, + "content": "It remains to discuss the relationship between the Rank loss and the actual quantity we care about,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 241, + 506, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 241, + 506, + 255 + ], + "score": 1.0, + "content": "which is the total runtime of a Sort and add search procedure. Recall the simplifying assumption that", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 253, + 504, + 265 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 301, + 265 + ], + "score": 1.0, + "content": "the runtime of searching for a program of length", + "type": "text" + }, + { + "bbox": [ + 301, + 254, + 310, + 263 + ], + "score": 0.8, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 253, + 331, + 265 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 331, + 253, + 340, + 263 + ], + "score": 0.83, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 253, + 504, + 265 + ], + "score": 1.0, + "content": "functions made available to the search is", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 263, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 104, + 263, + 169, + 277 + ], + "score": 1.0, + "content": "proportional to", + "type": "text" + }, + { + "bbox": [ + 170, + 264, + 185, + 274 + ], + "score": 0.89, + "content": "C ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 263, + 432, + 277 + ], + "score": 1.0, + "content": ", and consider a Sort and add search for a program of length", + "type": "text" + }, + { + "bbox": [ + 432, + 264, + 441, + 274 + ], + "score": 0.8, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 263, + 506, + 277 + ], + "score": 1.0, + "content": ", where the size", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 275, + 505, + 287 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 505, + 287 + ], + "score": 1.0, + "content": "of the active set is increased by 1 whenever the search fails. Starting with an active set of size 1, the", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 286, + 346, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 346, + 299 + ], + "score": 1.0, + "content": "total time until a solution is found can be upper bounded by", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 13.5 + }, + { + "type": "interline_equation", + "bbox": [ + 225, + 301, + 385, + 316 + ], + "lines": [ + { + "bbox": [ + 225, + 301, + 385, + 316 + ], + "spans": [ + { + "bbox": [ + 225, + 301, + 385, + 316 + ], + "score": 0.93, + "content": "1 ^ { T } + 2 ^ { T } + \\cdot \\cdot \\cdot + C _ { A } ^ { T } \\leq C _ { A } ^ { T + 1 } \\leq C C _ { A } ^ { T }", + "type": "interline_equation", + "image_path": "385208351763d143575274950b7c6359d7104974069d4a34eedcf96bafee253d.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 225, + 301, + 385, + 316 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 319, + 504, + 354 + ], + "lines": [ + { + "bbox": [ + 106, + 319, + 505, + 332 + ], + "spans": [ + { + "bbox": [ + 106, + 319, + 132, + 332 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 132, + 320, + 147, + 331 + ], + "score": 0.9, + "content": "C _ { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 319, + 505, + 332 + ], + "score": 1.0, + "content": "is the size of the active set when the search finally succeeds (i.e., when the active set finally", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 331, + 506, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 506, + 342 + ], + "score": 1.0, + "content": "contains all necessary functions for a solution to exist). Hence the total runtime of a Sort and add", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 103, + 338, + 389, + 358 + ], + "spans": [ + { + "bbox": [ + 103, + 338, + 367, + 358 + ], + "score": 1.0, + "content": "search can be upper bounded by a quantity that is proportional to", + "type": "text" + }, + { + "bbox": [ + 368, + 341, + 383, + 354 + ], + "score": 0.91, + "content": "C _ { A } ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 338, + 389, + 358 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 108, + 359, + 503, + 393 + ], + "lines": [ + { + "bbox": [ + 105, + 359, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 359, + 237, + 372 + ], + "score": 1.0, + "content": "Now fix a valid program solution", + "type": "text" + }, + { + "bbox": [ + 238, + 360, + 247, + 370 + ], + "score": 0.84, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 359, + 298, + 372 + ], + "score": 1.0, + "content": "that requires", + "type": "text" + }, + { + "bbox": [ + 299, + 360, + 313, + 370 + ], + "score": 0.88, + "content": "C _ { P }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 359, + 383, + 372 + ], + "score": 1.0, + "content": "functions, and let", + "type": "text" + }, + { + "bbox": [ + 384, + 359, + 441, + 372 + ], + "score": 0.93, + "content": "\\mathbf { y } _ { P } \\in \\{ 0 , 1 \\} ^ { C }", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 359, + 505, + 372 + ], + "score": 1.0, + "content": "be the indicator", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 370, + 504, + 382 + ], + "spans": [ + { + "bbox": [ + 106, + 370, + 219, + 382 + ], + "score": 1.0, + "content": "vector of functions used by", + "type": "text" + }, + { + "bbox": [ + 220, + 371, + 228, + 380 + ], + "score": 0.8, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 229, + 370, + 249, + 382 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 249, + 371, + 316, + 381 + ], + "score": 0.92, + "content": "D : = C _ { A } - C _ { P }", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 370, + 504, + 382 + ], + "score": 1.0, + "content": "be the number of redundant operations added", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 381, + 358, + 393 + ], + "spans": [ + { + "bbox": [ + 106, + 381, + 277, + 393 + ], + "score": 1.0, + "content": "into the active set until all operations from", + "type": "text" + }, + { + "bbox": [ + 278, + 383, + 287, + 392 + ], + "score": 0.83, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 381, + 358, + 393 + ], + "score": 1.0, + "content": "have been added.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 106, + 396, + 504, + 416 + ], + "lines": [ + { + "bbox": [ + 105, + 393, + 506, + 410 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 466, + 410 + ], + "score": 1.0, + "content": "Example 1. Suppose the labels, as sorted by decreasing predicted marginal probabilities", + "type": "text" + }, + { + "bbox": [ + 467, + 396, + 486, + 408 + ], + "score": 0.87, + "content": "\\mathbf { f } \\left( \\mathbf { x } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 393, + 506, + 410 + ], + "score": 1.0, + "content": ", are", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 406, + 153, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 153, + 419 + ], + "score": 1.0, + "content": "as follows:", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "interline_equation", + "bbox": [ + 173, + 417, + 438, + 429 + ], + "lines": [ + { + "bbox": [ + 173, + 417, + 438, + 429 + ], + "spans": [ + { + "bbox": [ + 173, + 417, + 438, + 429 + ], + "score": 0.8, + "content": "\\begin{array} { r l r l r } { 1 \\mathrm { ~ 1 ~ 1 ~ 1 ~ } } & { { } } & { 1 } & \\qquad 1 \\mathrm ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 0 ~ 0 ~ 0 ~ 0 ~ 0 0 \\end{array}", + "type": "interline_equation", + "image_path": "b6763a465e09eaf5ed0f8ceb822ac7f8dfd443e282b7c5de3bb72a65706d7f1f.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 173, + 417, + 438, + 429 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 432, + 506, + 476 + ], + "lines": [ + { + "bbox": [ + 105, + 431, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 180, + 444 + ], + "score": 1.0, + "content": "Then the solution", + "type": "text" + }, + { + "bbox": [ + 180, + 432, + 189, + 442 + ], + "score": 0.82, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 431, + 227, + 444 + ], + "score": 1.0, + "content": "contains", + "type": "text" + }, + { + "bbox": [ + 227, + 432, + 262, + 443 + ], + "score": 0.9, + "content": "C _ { P } = 6", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 431, + 465, + 444 + ], + "score": 1.0, + "content": "functions, but the active set needs to grow to size", + "type": "text" + }, + { + "bbox": [ + 466, + 432, + 505, + 443 + ], + "score": 0.9, + "content": "C _ { A } = 1 1", + "type": "inline_equation" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 442, + 506, + 454 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 227, + 454 + ], + "score": 1.0, + "content": "to include all of them, adding", + "type": "text" + }, + { + "bbox": [ + 228, + 443, + 256, + 453 + ], + "score": 0.87, + "content": "D = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 442, + 506, + 454 + ], + "score": 1.0, + "content": "redundant functions along the way. Note that the rank loss of", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 453, + 506, + 466 + ], + "spans": [ + { + "bbox": [ + 106, + 453, + 168, + 466 + ], + "score": 1.0, + "content": "the predictions", + "type": "text" + }, + { + "bbox": [ + 169, + 453, + 188, + 465 + ], + "score": 0.86, + "content": "\\mathbf { f } \\left( \\mathbf { x } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 188, + 453, + 199, + 466 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 199, + 453, + 309, + 466 + ], + "score": 0.91, + "content": "L _ { r } ( \\mathbf { y } _ { P } , \\mathbf { f } ( \\mathbf { x } ) ) = 2 + 5 = 7", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 453, + 506, + 466 + ], + "score": 1.0, + "content": ", as it double counts the two redundant functions", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 465, + 303, + 477 + ], + "spans": [ + { + "bbox": [ + 106, + 465, + 303, + 477 + ], + "score": 1.0, + "content": "which are scored higher than two relevant labels.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 106, + 484, + 505, + 507 + ], + "lines": [ + { + "bbox": [ + 105, + 483, + 506, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 196, + 498 + ], + "score": 1.0, + "content": "Noting that in general", + "type": "text" + }, + { + "bbox": [ + 196, + 484, + 273, + 497 + ], + "score": 0.95, + "content": "L _ { r } ( \\mathbf { y } _ { P } , \\mathbf { f } ( \\mathbf { x } ) ) \\ge D", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 483, + 506, + 498 + ], + "score": 1.0, + "content": ", the previous upper bound on the runtime of Sort and add", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 495, + 272, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 272, + 509 + ], + "score": 1.0, + "content": "can be further upper bounded as follows:", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "interline_equation", + "bbox": [ + 149, + 510, + 462, + 526 + ], + "lines": [ + { + "bbox": [ + 149, + 510, + 462, + 526 + ], + "spans": [ + { + "bbox": [ + 149, + 510, + 462, + 526 + ], + "score": 0.88, + "content": "C _ { A } ^ { T } = ( C _ { P } + D ) ^ { T } \\leq \\mathrm { c o n s t } + \\mathrm { c o n s t } \\times D ^ { T } \\leq \\mathrm { c o n s t } + \\mathrm { c o n s t } \\times L _ { r } ( \\mathbf { y } _ { P } , \\mathbf { f } ( \\mathbf { x } ) ) ^ { T }", + "type": "interline_equation", + "image_path": "2ccda6d9ede732a7742ffa9a2afdab450031f1151b482106f9279b1f97de67ef.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 149, + 510, + 462, + 526 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 529, + 505, + 563 + ], + "lines": [ + { + "bbox": [ + 105, + 527, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 275, + 542 + ], + "score": 1.0, + "content": "Hence we see that for a constant value of", + "type": "text" + }, + { + "bbox": [ + 275, + 530, + 283, + 539 + ], + "score": 0.82, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 527, + 505, + 542 + ], + "score": 1.0, + "content": ", this upper bound can be minimized by optimizing the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 539, + 506, + 553 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 222, + 553 + ], + "score": 1.0, + "content": "Rank loss of the predictions", + "type": "text" + }, + { + "bbox": [ + 222, + 540, + 241, + 552 + ], + "score": 0.85, + "content": "\\mathbf { f } \\left( \\mathbf { x } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 539, + 305, + 553 + ], + "score": 1.0, + "content": ". Note also that", + "type": "text" + }, + { + "bbox": [ + 305, + 540, + 380, + 552 + ], + "score": 0.93, + "content": "\\bar { L _ { r } } ( { \\bf y } _ { P } , { \\bf f } ( { \\bf x } ) ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 539, + 435, + 553 + ], + "score": 1.0, + "content": "would imply", + "type": "text" + }, + { + "bbox": [ + 435, + 541, + 463, + 550 + ], + "score": 0.89, + "content": "D = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 539, + 506, + 553 + ], + "score": 1.0, + "content": ", in which", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 550, + 173, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 126, + 564 + ], + "score": 1.0, + "content": "case", + "type": "text" + }, + { + "bbox": [ + 126, + 551, + 168, + 563 + ], + "score": 0.91, + "content": "C _ { A } = C _ { P }", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 550, + 173, + 564 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35 + }, + { + "type": "title", + "bbox": [ + 107, + 578, + 367, + 591 + ], + "lines": [ + { + "bbox": [ + 105, + 578, + 368, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 368, + 592 + ], + "score": 1.0, + "content": "F DOMAIN SPECIFIC LANGUAGE OF DEEPCODER", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 602, + 505, + 637 + ], + "lines": [ + { + "bbox": [ + 105, + 602, + 506, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 602, + 506, + 616 + ], + "score": 1.0, + "content": "Here we provide a description of the semantics of our DSL from Sect. 4.1, both in English and as a", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 613, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 505, + 627 + ], + "score": 1.0, + "content": "Python implementation. Throughout, NULL is a special value that can be set e.g. to an integer outside", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 625, + 214, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 625, + 214, + 639 + ], + "score": 1.0, + "content": "the working integer range.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 107, + 642, + 192, + 653 + ], + "lines": [ + { + "bbox": [ + 105, + 641, + 194, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 194, + 654 + ], + "score": 1.0, + "content": "First-order functions:", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 132, + 662, + 429, + 732 + ], + "lines": [ + { + "bbox": [ + 132, + 662, + 266, + 674 + ], + "spans": [ + { + "bbox": [ + 132, + 662, + 266, + 674 + ], + "score": 1.0, + "content": "• HEAD :: [int] -> int", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 142, + 673, + 378, + 685 + ], + "spans": [ + { + "bbox": [ + 142, + 673, + 282, + 685 + ], + "score": 1.0, + "content": "lambda xs: xs[0] if len", + "type": "text" + }, + { + "bbox": [ + 283, + 674, + 317, + 684 + ], + "score": 0.53, + "content": "( \\mathbf { \\nabla } _ { \\mathbf { X } } \\mathbf { S } \\mathbf { \\nabla } ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 673, + 378, + 685 + ], + "score": 1.0, + "content": "else Null", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 141, + 682, + 429, + 697 + ], + "spans": [ + { + "bbox": [ + 141, + 682, + 429, + 697 + ], + "score": 1.0, + "content": "Given an array, returns its first element (or NULL if the array is empty).", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 135, + 699, + 263, + 710 + ], + "spans": [ + { + "bbox": [ + 135, + 699, + 225, + 710 + ], + "score": 1.0, + "content": "• LAST :: [int]", + "type": "text" + }, + { + "bbox": [ + 225, + 700, + 239, + 709 + ], + "score": 0.48, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 699, + 263, + 710 + ], + "score": 1.0, + "content": "int", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 142, + 709, + 384, + 722 + ], + "spans": [ + { + "bbox": [ + 142, + 709, + 288, + 722 + ], + "score": 1.0, + "content": "lambda xs: xs[-1] if len", + "type": "text" + }, + { + "bbox": [ + 288, + 711, + 323, + 721 + ], + "score": 0.59, + "content": "( \\mathbf { \\nabla } _ { \\mathbf { X } } \\mathbf { s } ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 709, + 384, + 722 + ], + "score": 1.0, + "content": "else Null", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 142, + 720, + 427, + 733 + ], + "spans": [ + { + "bbox": [ + 142, + 720, + 427, + 733 + ], + "score": 1.0, + "content": "Given an array, returns its last element (or NULL if the array is empty).", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44.5 + } + ], + "page_idx": 16, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 117 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Dembczynski et al. (2010) proved that Bayes optimal decisions under the Hamming and Rank loss", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "functions, i.e., decisions minimizing the expected loss under these loss functions, can be computed", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 335, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 218, + 118 + ], + "score": 1.0, + "content": "from marginal probabilities", + "type": "text" + }, + { + "bbox": [ + 218, + 104, + 254, + 117 + ], + "score": 0.93, + "content": "p _ { c } ( y _ { c } | \\mathbf { x } )", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 104, + 335, + 118 + ], + "score": 1.0, + "content": ". This suggests that:", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 82, + 505, + 118 + ] + }, + { + "type": "list", + "bbox": [ + 132, + 124, + 505, + 183 + ], + "lines": [ + { + "bbox": [ + 132, + 123, + 506, + 138 + ], + "spans": [ + { + "bbox": [ + 132, + 123, + 506, + 138 + ], + "score": 1.0, + "content": "• Multilabel classification under these two loss functions may not benefit from considering", + "type": "text" + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 142, + 136, + 277, + 148 + ], + "spans": [ + { + "bbox": [ + 142, + 136, + 277, + 148 + ], + "score": 1.0, + "content": "dependencies between the labels.", + "type": "text" + } + ], + "index": 4, + "is_list_end_line": true + }, + { + "bbox": [ + 136, + 149, + 506, + 163 + ], + "spans": [ + { + "bbox": [ + 136, + 149, + 506, + 163 + ], + "score": 1.0, + "content": "• ”Instead of minimizing the Rank loss directly, one can simply use any approach for single", + "type": "text" + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 140, + 160, + 506, + 174 + ], + "spans": [ + { + "bbox": [ + 140, + 160, + 506, + 174 + ], + "score": 1.0, + "content": "label prediction that properly estimates the marginal probabilities.” (Dembczynski et al., ´", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 140, + 170, + 170, + 186 + ], + "spans": [ + { + "bbox": [ + 140, + 170, + 170, + 186 + ], + "score": 1.0, + "content": "2012)", + "type": "text" + } + ], + "index": 7, + "is_list_end_line": true + } + ], + "index": 5, + "bbox_fs": [ + 132, + 123, + 506, + 186 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 192, + 505, + 226 + ], + "lines": [ + { + "bbox": [ + 107, + 192, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 107, + 192, + 505, + 205 + ], + "score": 1.0, + "content": "Training the neural network with the negative cross entropy loss function as the training objective is", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 203, + 505, + 217 + ], + "spans": [ + { + "bbox": [ + 107, + 203, + 505, + 217 + ], + "score": 1.0, + "content": "precisely a method for properly estimating the marginal probabilities of labels (functions appearing", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 215, + 497, + 227 + ], + "spans": [ + { + "bbox": [ + 107, + 215, + 497, + 227 + ], + "score": 1.0, + "content": "in source code). It is thus a sensible step in preparation for making predictions under a Rank loss.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9, + "bbox_fs": [ + 107, + 192, + 505, + 227 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 231, + 505, + 297 + ], + "lines": [ + { + "bbox": [ + 105, + 230, + 506, + 244 + ], + "spans": [ + { + "bbox": [ + 105, + 230, + 506, + 244 + ], + "score": 1.0, + "content": "It remains to discuss the relationship between the Rank loss and the actual quantity we care about,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 241, + 506, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 241, + 506, + 255 + ], + "score": 1.0, + "content": "which is the total runtime of a Sort and add search procedure. Recall the simplifying assumption that", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 253, + 504, + 265 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 301, + 265 + ], + "score": 1.0, + "content": "the runtime of searching for a program of length", + "type": "text" + }, + { + "bbox": [ + 301, + 254, + 310, + 263 + ], + "score": 0.8, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 253, + 331, + 265 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 331, + 253, + 340, + 263 + ], + "score": 0.83, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 253, + 504, + 265 + ], + "score": 1.0, + "content": "functions made available to the search is", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 263, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 104, + 263, + 169, + 277 + ], + "score": 1.0, + "content": "proportional to", + "type": "text" + }, + { + "bbox": [ + 170, + 264, + 185, + 274 + ], + "score": 0.89, + "content": "C ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 263, + 432, + 277 + ], + "score": 1.0, + "content": ", and consider a Sort and add search for a program of length", + "type": "text" + }, + { + "bbox": [ + 432, + 264, + 441, + 274 + ], + "score": 0.8, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 263, + 506, + 277 + ], + "score": 1.0, + "content": ", where the size", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 275, + 505, + 287 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 505, + 287 + ], + "score": 1.0, + "content": "of the active set is increased by 1 whenever the search fails. Starting with an active set of size 1, the", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 286, + 346, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 346, + 299 + ], + "score": 1.0, + "content": "total time until a solution is found can be upper bounded by", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 13.5, + "bbox_fs": [ + 104, + 230, + 506, + 299 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 225, + 301, + 385, + 316 + ], + "lines": [ + { + "bbox": [ + 225, + 301, + 385, + 316 + ], + "spans": [ + { + "bbox": [ + 225, + 301, + 385, + 316 + ], + "score": 0.93, + "content": "1 ^ { T } + 2 ^ { T } + \\cdot \\cdot \\cdot + C _ { A } ^ { T } \\leq C _ { A } ^ { T + 1 } \\leq C C _ { A } ^ { T }", + "type": "interline_equation", + "image_path": "385208351763d143575274950b7c6359d7104974069d4a34eedcf96bafee253d.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 225, + 301, + 385, + 316 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 319, + 504, + 354 + ], + "lines": [ + { + "bbox": [ + 106, + 319, + 505, + 332 + ], + "spans": [ + { + "bbox": [ + 106, + 319, + 132, + 332 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 132, + 320, + 147, + 331 + ], + "score": 0.9, + "content": "C _ { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 319, + 505, + 332 + ], + "score": 1.0, + "content": "is the size of the active set when the search finally succeeds (i.e., when the active set finally", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 331, + 506, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 506, + 342 + ], + "score": 1.0, + "content": "contains all necessary functions for a solution to exist). Hence the total runtime of a Sort and add", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 103, + 338, + 389, + 358 + ], + "spans": [ + { + "bbox": [ + 103, + 338, + 367, + 358 + ], + "score": 1.0, + "content": "search can be upper bounded by a quantity that is proportional to", + "type": "text" + }, + { + "bbox": [ + 368, + 341, + 383, + 354 + ], + "score": 0.91, + "content": "C _ { A } ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 338, + 389, + 358 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 103, + 319, + 506, + 358 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 359, + 503, + 393 + ], + "lines": [ + { + "bbox": [ + 105, + 359, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 359, + 237, + 372 + ], + "score": 1.0, + "content": "Now fix a valid program solution", + "type": "text" + }, + { + "bbox": [ + 238, + 360, + 247, + 370 + ], + "score": 0.84, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 359, + 298, + 372 + ], + "score": 1.0, + "content": "that requires", + "type": "text" + }, + { + "bbox": [ + 299, + 360, + 313, + 370 + ], + "score": 0.88, + "content": "C _ { P }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 359, + 383, + 372 + ], + "score": 1.0, + "content": "functions, and let", + "type": "text" + }, + { + "bbox": [ + 384, + 359, + 441, + 372 + ], + "score": 0.93, + "content": "\\mathbf { y } _ { P } \\in \\{ 0 , 1 \\} ^ { C }", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 359, + 505, + 372 + ], + "score": 1.0, + "content": "be the indicator", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 370, + 504, + 382 + ], + "spans": [ + { + "bbox": [ + 106, + 370, + 219, + 382 + ], + "score": 1.0, + "content": "vector of functions used by", + "type": "text" + }, + { + "bbox": [ + 220, + 371, + 228, + 380 + ], + "score": 0.8, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 229, + 370, + 249, + 382 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 249, + 371, + 316, + 381 + ], + "score": 0.92, + "content": "D : = C _ { A } - C _ { P }", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 370, + 504, + 382 + ], + "score": 1.0, + "content": "be the number of redundant operations added", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 381, + 358, + 393 + ], + "spans": [ + { + "bbox": [ + 106, + 381, + 277, + 393 + ], + "score": 1.0, + "content": "into the active set until all operations from", + "type": "text" + }, + { + "bbox": [ + 278, + 383, + 287, + 392 + ], + "score": 0.83, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 381, + 358, + 393 + ], + "score": 1.0, + "content": "have been added.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 359, + 505, + 393 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 396, + 504, + 416 + ], + "lines": [ + { + "bbox": [ + 105, + 393, + 506, + 410 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 466, + 410 + ], + "score": 1.0, + "content": "Example 1. Suppose the labels, as sorted by decreasing predicted marginal probabilities", + "type": "text" + }, + { + "bbox": [ + 467, + 396, + 486, + 408 + ], + "score": 0.87, + "content": "\\mathbf { f } \\left( \\mathbf { x } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 393, + 506, + 410 + ], + "score": 1.0, + "content": ", are", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 406, + 153, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 153, + 419 + ], + "score": 1.0, + "content": "as follows:", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 393, + 506, + 419 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 173, + 417, + 438, + 429 + ], + "lines": [ + { + "bbox": [ + 173, + 417, + 438, + 429 + ], + "spans": [ + { + "bbox": [ + 173, + 417, + 438, + 429 + ], + "score": 0.8, + "content": "\\begin{array} { r l r l r } { 1 \\mathrm { ~ 1 ~ 1 ~ 1 ~ } } & { { } } & { 1 } & \\qquad 1 \\mathrm ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 0 ~ 0 ~ 0 ~ 0 ~ 0 0 \\end{array}", + "type": "interline_equation", + "image_path": "b6763a465e09eaf5ed0f8ceb822ac7f8dfd443e282b7c5de3bb72a65706d7f1f.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 173, + 417, + 438, + 429 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 432, + 506, + 476 + ], + "lines": [ + { + "bbox": [ + 105, + 431, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 180, + 444 + ], + "score": 1.0, + "content": "Then the solution", + "type": "text" + }, + { + "bbox": [ + 180, + 432, + 189, + 442 + ], + "score": 0.82, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 431, + 227, + 444 + ], + "score": 1.0, + "content": "contains", + "type": "text" + }, + { + "bbox": [ + 227, + 432, + 262, + 443 + ], + "score": 0.9, + "content": "C _ { P } = 6", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 431, + 465, + 444 + ], + "score": 1.0, + "content": "functions, but the active set needs to grow to size", + "type": "text" + }, + { + "bbox": [ + 466, + 432, + 505, + 443 + ], + "score": 0.9, + "content": "C _ { A } = 1 1", + "type": "inline_equation" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 442, + 506, + 454 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 227, + 454 + ], + "score": 1.0, + "content": "to include all of them, adding", + "type": "text" + }, + { + "bbox": [ + 228, + 443, + 256, + 453 + ], + "score": 0.87, + "content": "D = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 442, + 506, + 454 + ], + "score": 1.0, + "content": "redundant functions along the way. Note that the rank loss of", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 453, + 506, + 466 + ], + "spans": [ + { + "bbox": [ + 106, + 453, + 168, + 466 + ], + "score": 1.0, + "content": "the predictions", + "type": "text" + }, + { + "bbox": [ + 169, + 453, + 188, + 465 + ], + "score": 0.86, + "content": "\\mathbf { f } \\left( \\mathbf { x } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 188, + 453, + 199, + 466 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 199, + 453, + 309, + 466 + ], + "score": 0.91, + "content": "L _ { r } ( \\mathbf { y } _ { P } , \\mathbf { f } ( \\mathbf { x } ) ) = 2 + 5 = 7", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 453, + 506, + 466 + ], + "score": 1.0, + "content": ", as it double counts the two redundant functions", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 465, + 303, + 477 + ], + "spans": [ + { + "bbox": [ + 106, + 465, + 303, + 477 + ], + "score": 1.0, + "content": "which are scored higher than two relevant labels.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 431, + 506, + 477 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 484, + 505, + 507 + ], + "lines": [ + { + "bbox": [ + 105, + 483, + 506, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 196, + 498 + ], + "score": 1.0, + "content": "Noting that in general", + "type": "text" + }, + { + "bbox": [ + 196, + 484, + 273, + 497 + ], + "score": 0.95, + "content": "L _ { r } ( \\mathbf { y } _ { P } , \\mathbf { f } ( \\mathbf { x } ) ) \\ge D", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 483, + 506, + 498 + ], + "score": 1.0, + "content": ", the previous upper bound on the runtime of Sort and add", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 495, + 272, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 272, + 509 + ], + "score": 1.0, + "content": "can be further upper bounded as follows:", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 105, + 483, + 506, + 509 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 149, + 510, + 462, + 526 + ], + "lines": [ + { + "bbox": [ + 149, + 510, + 462, + 526 + ], + "spans": [ + { + "bbox": [ + 149, + 510, + 462, + 526 + ], + "score": 0.88, + "content": "C _ { A } ^ { T } = ( C _ { P } + D ) ^ { T } \\leq \\mathrm { c o n s t } + \\mathrm { c o n s t } \\times D ^ { T } \\leq \\mathrm { c o n s t } + \\mathrm { c o n s t } \\times L _ { r } ( \\mathbf { y } _ { P } , \\mathbf { f } ( \\mathbf { x } ) ) ^ { T }", + "type": "interline_equation", + "image_path": "2ccda6d9ede732a7742ffa9a2afdab450031f1151b482106f9279b1f97de67ef.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 149, + 510, + 462, + 526 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 529, + 505, + 563 + ], + "lines": [ + { + "bbox": [ + 105, + 527, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 275, + 542 + ], + "score": 1.0, + "content": "Hence we see that for a constant value of", + "type": "text" + }, + { + "bbox": [ + 275, + 530, + 283, + 539 + ], + "score": 0.82, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 527, + 505, + 542 + ], + "score": 1.0, + "content": ", this upper bound can be minimized by optimizing the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 539, + 506, + 553 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 222, + 553 + ], + "score": 1.0, + "content": "Rank loss of the predictions", + "type": "text" + }, + { + "bbox": [ + 222, + 540, + 241, + 552 + ], + "score": 0.85, + "content": "\\mathbf { f } \\left( \\mathbf { x } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 539, + 305, + 553 + ], + "score": 1.0, + "content": ". Note also that", + "type": "text" + }, + { + "bbox": [ + 305, + 540, + 380, + 552 + ], + "score": 0.93, + "content": "\\bar { L _ { r } } ( { \\bf y } _ { P } , { \\bf f } ( { \\bf x } ) ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 539, + 435, + 553 + ], + "score": 1.0, + "content": "would imply", + "type": "text" + }, + { + "bbox": [ + 435, + 541, + 463, + 550 + ], + "score": 0.89, + "content": "D = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 539, + 506, + 553 + ], + "score": 1.0, + "content": ", in which", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 550, + 173, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 126, + 564 + ], + "score": 1.0, + "content": "case", + "type": "text" + }, + { + "bbox": [ + 126, + 551, + 168, + 563 + ], + "score": 0.91, + "content": "C _ { A } = C _ { P }", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 550, + 173, + 564 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 527, + 506, + 564 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 578, + 367, + 591 + ], + "lines": [ + { + "bbox": [ + 105, + 578, + 368, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 368, + 592 + ], + "score": 1.0, + "content": "F DOMAIN SPECIFIC LANGUAGE OF DEEPCODER", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 602, + 505, + 637 + ], + "lines": [ + { + "bbox": [ + 105, + 602, + 506, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 602, + 506, + 616 + ], + "score": 1.0, + "content": "Here we provide a description of the semantics of our DSL from Sect. 4.1, both in English and as a", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 613, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 505, + 627 + ], + "score": 1.0, + "content": "Python implementation. Throughout, NULL is a special value that can be set e.g. to an integer outside", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 625, + 214, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 625, + 214, + 639 + ], + "score": 1.0, + "content": "the working integer range.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39, + "bbox_fs": [ + 105, + 602, + 506, + 639 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 642, + 192, + 653 + ], + "lines": [ + { + "bbox": [ + 105, + 641, + 194, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 194, + 654 + ], + "score": 1.0, + "content": "First-order functions:", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 641, + 194, + 654 + ] + }, + { + "type": "list", + "bbox": [ + 132, + 662, + 429, + 732 + ], + "lines": [ + { + "bbox": [ + 132, + 662, + 266, + 674 + ], + "spans": [ + { + "bbox": [ + 132, + 662, + 266, + 674 + ], + "score": 1.0, + "content": "• HEAD :: [int] -> int", + "type": "text" + } + ], + "index": 42, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 673, + 378, + 685 + ], + "spans": [ + { + "bbox": [ + 142, + 673, + 282, + 685 + ], + "score": 1.0, + "content": "lambda xs: xs[0] if len", + "type": "text" + }, + { + "bbox": [ + 283, + 674, + 317, + 684 + ], + "score": 0.53, + "content": "( \\mathbf { \\nabla } _ { \\mathbf { X } } \\mathbf { S } \\mathbf { \\nabla } ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 673, + 378, + 685 + ], + "score": 1.0, + "content": "else Null", + "type": "text" + } + ], + "index": 43, + "is_list_end_line": true + }, + { + "bbox": [ + 141, + 682, + 429, + 697 + ], + "spans": [ + { + "bbox": [ + 141, + 682, + 429, + 697 + ], + "score": 1.0, + "content": "Given an array, returns its first element (or NULL if the array is empty).", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 135, + 699, + 263, + 710 + ], + "spans": [ + { + "bbox": [ + 135, + 699, + 225, + 710 + ], + "score": 1.0, + "content": "• LAST :: [int]", + "type": "text" + }, + { + "bbox": [ + 225, + 700, + 239, + 709 + ], + "score": 0.48, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 699, + 263, + 710 + ], + "score": 1.0, + "content": "int", + "type": "text" + } + ], + "index": 45, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 709, + 384, + 722 + ], + "spans": [ + { + "bbox": [ + 142, + 709, + 288, + 722 + ], + "score": 1.0, + "content": "lambda xs: xs[-1] if len", + "type": "text" + }, + { + "bbox": [ + 288, + 711, + 323, + 721 + ], + "score": 0.59, + "content": "( \\mathbf { \\nabla } _ { \\mathbf { X } } \\mathbf { s } ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 709, + 384, + 722 + ], + "score": 1.0, + "content": "else Null", + "type": "text" + } + ], + "index": 46, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 720, + 427, + 733 + ], + "spans": [ + { + "bbox": [ + 142, + 720, + 427, + 733 + ], + "score": 1.0, + "content": "Given an array, returns its last element (or NULL if the array is empty).", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 132, + 82, + 306, + 95 + ], + "spans": [ + { + "bbox": [ + 132, + 82, + 213, + 95 + ], + "score": 1.0, + "content": "• TAKE :: int", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 213, + 83, + 228, + 93 + ], + "score": 0.32, + "content": "- >", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 228, + 82, + 306, + 95 + ], + "score": 1.0, + "content": "[int] -> int", + "type": "text", + "cross_page": true + } + ], + "index": 0, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 93, + 263, + 107 + ], + "spans": [ + { + "bbox": [ + 142, + 93, + 263, + 107 + ], + "score": 1.0, + "content": "lambda n, xs: xs[:n]", + "type": "text", + "cross_page": true + } + ], + "index": 1, + "is_list_end_line": true + }, + { + "bbox": [ + 141, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 141, + 104, + 421, + 117 + ], + "score": 1.0, + "content": "Given an integer n and array xs, returns the array truncated after the", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 421, + 106, + 428, + 115 + ], + "score": 0.4, + "content": "\\boldsymbol { \\mathrm { n } }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 429, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "-th element. (If the", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 141, + 115, + 492, + 127 + ], + "spans": [ + { + "bbox": [ + 141, + 115, + 492, + 127 + ], + "score": 1.0, + "content": "length of xs was no larger than n in the first place, it is returned without modification.)", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 131, + 306, + 142 + ], + "spans": [ + { + "bbox": [ + 132, + 131, + 214, + 142 + ], + "score": 1.0, + "content": "• DROP :: int", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 214, + 132, + 229, + 141 + ], + "score": 0.43, + "content": "- >", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 229, + 131, + 267, + 142 + ], + "score": 1.0, + "content": "[int]", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 268, + 132, + 282, + 141 + ], + "score": 0.47, + "content": "- >", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 283, + 131, + 306, + 142 + ], + "score": 1.0, + "content": "int", + "type": "text", + "cross_page": true + } + ], + "index": 4, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 142, + 263, + 154 + ], + "spans": [ + { + "bbox": [ + 142, + 142, + 263, + 154 + ], + "score": 1.0, + "content": "lambda n, xs: xs[n:]", + "type": "text", + "cross_page": true + } + ], + "index": 5, + "is_list_end_line": true + }, + { + "bbox": [ + 141, + 152, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 141, + 152, + 258, + 165 + ], + "score": 1.0, + "content": "Given an integer n and array", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 258, + 155, + 271, + 163 + ], + "score": 0.36, + "content": "_ { \\textrm { x S } }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 271, + 152, + 505, + 165 + ], + "score": 1.0, + "content": ", returns the array with the first n elements dropped. (If the", + "type": "text", + "cross_page": true + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 163, + 461, + 176 + ], + "spans": [ + { + "bbox": [ + 141, + 163, + 461, + 176 + ], + "score": 1.0, + "content": "length of xs was no larger than n in the first place, an empty array is returned.)", + "type": "text", + "cross_page": true + } + ], + "index": 7, + "is_list_end_line": true + }, + { + "bbox": [ + 132, + 178, + 316, + 191 + ], + "spans": [ + { + "bbox": [ + 132, + 178, + 223, + 191 + ], + "score": 1.0, + "content": "• ACCESS :: int", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 224, + 180, + 239, + 190 + ], + "score": 0.52, + "content": "- >", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 239, + 178, + 277, + 191 + ], + "score": 1.0, + "content": "[int]", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 277, + 180, + 292, + 190 + ], + "score": 0.57, + "content": "- >", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 293, + 178, + 316, + 191 + ], + "score": 1.0, + "content": "int", + "type": "text", + "cross_page": true + } + ], + "index": 8, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 190, + 449, + 201 + ], + "spans": [ + { + "bbox": [ + 142, + 190, + 279, + 201 + ], + "score": 1.0, + "content": "lambda n, xs: xs[n] if", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 280, + 191, + 306, + 201 + ], + "score": 0.87, + "content": "\\mathrm { n } > = 0", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 306, + 190, + 354, + 201 + ], + "score": 1.0, + "content": "and len", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 355, + 191, + 389, + 201 + ], + "score": 0.71, + "content": "( \\mathsf { x s } ) > \\mathsf { n }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 389, + 190, + 449, + 201 + ], + "score": 1.0, + "content": "else Null", + "type": "text", + "cross_page": true + } + ], + "index": 9, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 201, + 505, + 213 + ], + "spans": [ + { + "bbox": [ + 142, + 201, + 261, + 213 + ], + "score": 1.0, + "content": "Given an integer n and array", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 262, + 203, + 275, + 212 + ], + "score": 0.53, + "content": "_ { \\textrm { x S } }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 275, + 201, + 325, + 213 + ], + "score": 1.0, + "content": ", returns the", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 325, + 202, + 349, + 212 + ], + "score": 0.8, + "content": "( \\mathrm { n } { + } 1 )", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 349, + 201, + 406, + 213 + ], + "score": 1.0, + "content": "-st element of", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 406, + 203, + 419, + 211 + ], + "score": 0.63, + "content": "_ { \\textrm { x S } }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 420, + 201, + 505, + 213 + ], + "score": 1.0, + "content": ". (If the length of xs", + "type": "text", + "cross_page": true + } + ], + "index": 10 + }, + { + "bbox": [ + 142, + 213, + 400, + 223 + ], + "spans": [ + { + "bbox": [ + 142, + 213, + 242, + 223 + ], + "score": 1.0, + "content": "was less than or equal to", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 242, + 214, + 249, + 222 + ], + "score": 0.27, + "content": "\\boldsymbol { \\mathrm { n } }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 249, + 213, + 400, + 223 + ], + "score": 1.0, + "content": ", the value NULL is returned instead.)", + "type": "text", + "cross_page": true + } + ], + "index": 11, + "is_list_end_line": true + }, + { + "bbox": [ + 136, + 227, + 284, + 239 + ], + "spans": [ + { + "bbox": [ + 136, + 227, + 245, + 239 + ], + "score": 1.0, + "content": "• MINIMUM :: [int]", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 245, + 228, + 260, + 238 + ], + "score": 0.72, + "content": "- >", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 260, + 227, + 284, + 239 + ], + "score": 1.0, + "content": "int", + "type": "text", + "cross_page": true + } + ], + "index": 12, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 141, + 238, + 389, + 250 + ], + "spans": [ + { + "bbox": [ + 141, + 238, + 295, + 250 + ], + "score": 1.0, + "content": "lambda xs: min(xs) if len", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 295, + 239, + 329, + 249 + ], + "score": 0.52, + "content": "( \\mathbf { \\nabla } _ { \\mathbf { X } } \\mathbf { S } ) > 0", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 330, + 238, + 389, + 250 + ], + "score": 1.0, + "content": "else Null", + "type": "text", + "cross_page": true + } + ], + "index": 13, + "is_list_end_line": true + }, + { + "bbox": [ + 141, + 248, + 418, + 262 + ], + "spans": [ + { + "bbox": [ + 141, + 248, + 418, + 262 + ], + "score": 1.0, + "content": "Given an array, returns its minimum (or NULL if the array is empty).", + "type": "text", + "cross_page": true + } + ], + "index": 14, + "is_list_end_line": true + }, + { + "bbox": [ + 132, + 264, + 286, + 276 + ], + "spans": [ + { + "bbox": [ + 132, + 264, + 248, + 276 + ], + "score": 1.0, + "content": "• MAXIMUM :: [int]", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 248, + 266, + 262, + 275 + ], + "score": 0.37, + "content": "- >", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 263, + 264, + 286, + 276 + ], + "score": 1.0, + "content": "int", + "type": "text", + "cross_page": true + } + ], + "index": 15, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 141, + 276, + 389, + 287 + ], + "spans": [ + { + "bbox": [ + 141, + 276, + 294, + 287 + ], + "score": 1.0, + "content": "lambda xs: max(xs) if len", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 295, + 276, + 329, + 286 + ], + "score": 0.56, + "content": "( \\mathbf { \\nabla } _ { \\mathbf { X } } \\mathbf { S } ) > 0", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 330, + 276, + 389, + 287 + ], + "score": 1.0, + "content": "else Null", + "type": "text", + "cross_page": true + } + ], + "index": 16, + "is_list_end_line": true + }, + { + "bbox": [ + 141, + 286, + 419, + 299 + ], + "spans": [ + { + "bbox": [ + 141, + 286, + 419, + 299 + ], + "score": 1.0, + "content": "Given an array, returns its maximum (or NULL if the array is empty).", + "type": "text", + "cross_page": true + } + ], + "index": 17, + "is_list_end_line": true + }, + { + "bbox": [ + 140, + 302, + 291, + 313 + ], + "spans": [ + { + "bbox": [ + 140, + 302, + 242, + 313 + ], + "score": 1.0, + "content": "REVERSE :: [int]", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 242, + 303, + 257, + 312 + ], + "score": 0.33, + "content": "- >", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 257, + 302, + 291, + 313 + ], + "score": 1.0, + "content": "[int]", + "type": "text", + "cross_page": true + } + ], + "index": 18, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 313, + 316, + 325 + ], + "spans": [ + { + "bbox": [ + 142, + 313, + 316, + 325 + ], + "score": 1.0, + "content": "lambda xs: list(reversed(xs))", + "type": "text", + "cross_page": true + } + ], + "index": 19, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 324, + 357, + 336 + ], + "spans": [ + { + "bbox": [ + 142, + 324, + 357, + 336 + ], + "score": 1.0, + "content": "Given an array, returns its elements in reversed order.", + "type": "text", + "cross_page": true + } + ], + "index": 20, + "is_list_end_line": true + }, + { + "bbox": [ + 132, + 339, + 275, + 352 + ], + "spans": [ + { + "bbox": [ + 132, + 339, + 275, + 352 + ], + "score": 1.0, + "content": "• SORT :: [int] -> [int]", + "type": "text", + "cross_page": true + } + ], + "index": 21, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 350, + 268, + 362 + ], + "spans": [ + { + "bbox": [ + 142, + 350, + 268, + 362 + ], + "score": 1.0, + "content": "lambda xs: sorted(xs)", + "type": "text", + "cross_page": true + } + ], + "index": 22, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 361, + 380, + 373 + ], + "spans": [ + { + "bbox": [ + 142, + 361, + 380, + 373 + ], + "score": 1.0, + "content": "Given an array, return its elements in non-decreasing order.", + "type": "text", + "cross_page": true + } + ], + "index": 23, + "is_list_end_line": true + }, + { + "bbox": [ + 140, + 376, + 260, + 389 + ], + "spans": [ + { + "bbox": [ + 140, + 376, + 221, + 389 + ], + "score": 1.0, + "content": "SUM :: [int]", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 221, + 378, + 236, + 387 + ], + "score": 0.3, + "content": "- >", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 237, + 376, + 260, + 389 + ], + "score": 1.0, + "content": "int", + "type": "text", + "cross_page": true + } + ], + "index": 24, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 388, + 250, + 399 + ], + "spans": [ + { + "bbox": [ + 142, + 388, + 250, + 399 + ], + "score": 1.0, + "content": "lambda xs: sum(xs)", + "type": "text", + "cross_page": true + } + ], + "index": 25, + "is_list_end_line": true + }, + { + "bbox": [ + 141, + 397, + 469, + 411 + ], + "spans": [ + { + "bbox": [ + 141, + 397, + 469, + 411 + ], + "score": 1.0, + "content": "Given an array, returns the sum of its elements. (The sum of an empty array is 0.)", + "type": "text", + "cross_page": true + } + ], + "index": 26, + "is_list_end_line": true + } + ], + "index": 44.5, + "bbox_fs": [ + 132, + 662, + 429, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 131, + 82, + 505, + 410 + ], + "lines": [ + { + "bbox": [ + 132, + 82, + 306, + 95 + ], + "spans": [ + { + "bbox": [ + 132, + 82, + 213, + 95 + ], + "score": 1.0, + "content": "• TAKE :: int", + "type": "text" + }, + { + "bbox": [ + 213, + 83, + 228, + 93 + ], + "score": 0.32, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 82, + 306, + 95 + ], + "score": 1.0, + "content": "[int] -> int", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 142, + 93, + 263, + 107 + ], + "spans": [ + { + "bbox": [ + 142, + 93, + 263, + 107 + ], + "score": 1.0, + "content": "lambda n, xs: xs[:n]", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 141, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 141, + 104, + 421, + 117 + ], + "score": 1.0, + "content": "Given an integer n and array xs, returns the array truncated after the", + "type": "text" + }, + { + "bbox": [ + 421, + 106, + 428, + 115 + ], + "score": 0.4, + "content": "\\boldsymbol { \\mathrm { n } }", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "-th element. (If the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 141, + 115, + 492, + 127 + ], + "spans": [ + { + "bbox": [ + 141, + 115, + 492, + 127 + ], + "score": 1.0, + "content": "length of xs was no larger than n in the first place, it is returned without modification.)", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 131, + 306, + 142 + ], + "spans": [ + { + "bbox": [ + 132, + 131, + 214, + 142 + ], + "score": 1.0, + "content": "• DROP :: int", + "type": "text" + }, + { + "bbox": [ + 214, + 132, + 229, + 141 + ], + "score": 0.43, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 229, + 131, + 267, + 142 + ], + "score": 1.0, + "content": "[int]", + "type": "text" + }, + { + "bbox": [ + 268, + 132, + 282, + 141 + ], + "score": 0.47, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 283, + 131, + 306, + 142 + ], + "score": 1.0, + "content": "int", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 142, + 142, + 263, + 154 + ], + "spans": [ + { + "bbox": [ + 142, + 142, + 263, + 154 + ], + "score": 1.0, + "content": "lambda n, xs: xs[n:]", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 152, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 141, + 152, + 258, + 165 + ], + "score": 1.0, + "content": "Given an integer n and array", + "type": "text" + }, + { + "bbox": [ + 258, + 155, + 271, + 163 + ], + "score": 0.36, + "content": "_ { \\textrm { x S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 152, + 505, + 165 + ], + "score": 1.0, + "content": ", returns the array with the first n elements dropped. (If the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 163, + 461, + 176 + ], + "spans": [ + { + "bbox": [ + 141, + 163, + 461, + 176 + ], + "score": 1.0, + "content": "length of xs was no larger than n in the first place, an empty array is returned.)", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 178, + 316, + 191 + ], + "spans": [ + { + "bbox": [ + 132, + 178, + 223, + 191 + ], + "score": 1.0, + "content": "• ACCESS :: int", + "type": "text" + }, + { + "bbox": [ + 224, + 180, + 239, + 190 + ], + "score": 0.52, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 178, + 277, + 191 + ], + "score": 1.0, + "content": "[int]", + "type": "text" + }, + { + "bbox": [ + 277, + 180, + 292, + 190 + ], + "score": 0.57, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 178, + 316, + 191 + ], + "score": 1.0, + "content": "int", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 142, + 190, + 449, + 201 + ], + "spans": [ + { + "bbox": [ + 142, + 190, + 279, + 201 + ], + "score": 1.0, + "content": "lambda n, xs: xs[n] if", + "type": "text" + }, + { + "bbox": [ + 280, + 191, + 306, + 201 + ], + "score": 0.87, + "content": "\\mathrm { n } > = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 190, + 354, + 201 + ], + "score": 1.0, + "content": "and len", + "type": "text" + }, + { + "bbox": [ + 355, + 191, + 389, + 201 + ], + "score": 0.71, + "content": "( \\mathsf { x s } ) > \\mathsf { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 190, + 449, + 201 + ], + "score": 1.0, + "content": "else Null", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 142, + 201, + 505, + 213 + ], + "spans": [ + { + "bbox": [ + 142, + 201, + 261, + 213 + ], + "score": 1.0, + "content": "Given an integer n and array", + "type": "text" + }, + { + "bbox": [ + 262, + 203, + 275, + 212 + ], + "score": 0.53, + "content": "_ { \\textrm { x S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 201, + 325, + 213 + ], + "score": 1.0, + "content": ", returns the", + "type": "text" + }, + { + "bbox": [ + 325, + 202, + 349, + 212 + ], + "score": 0.8, + "content": "( \\mathrm { n } { + } 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 201, + 406, + 213 + ], + "score": 1.0, + "content": "-st element of", + "type": "text" + }, + { + "bbox": [ + 406, + 203, + 419, + 211 + ], + "score": 0.63, + "content": "_ { \\textrm { x S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 201, + 505, + 213 + ], + "score": 1.0, + "content": ". (If the length of xs", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 142, + 213, + 400, + 223 + ], + "spans": [ + { + "bbox": [ + 142, + 213, + 242, + 223 + ], + "score": 1.0, + "content": "was less than or equal to", + "type": "text" + }, + { + "bbox": [ + 242, + 214, + 249, + 222 + ], + "score": 0.27, + "content": "\\boldsymbol { \\mathrm { n } }", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 213, + 400, + 223 + ], + "score": 1.0, + "content": ", the value NULL is returned instead.)", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 136, + 227, + 284, + 239 + ], + "spans": [ + { + "bbox": [ + 136, + 227, + 245, + 239 + ], + "score": 1.0, + "content": "• MINIMUM :: [int]", + "type": "text" + }, + { + "bbox": [ + 245, + 228, + 260, + 238 + ], + "score": 0.72, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 227, + 284, + 239 + ], + "score": 1.0, + "content": "int", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 238, + 389, + 250 + ], + "spans": [ + { + "bbox": [ + 141, + 238, + 295, + 250 + ], + "score": 1.0, + "content": "lambda xs: min(xs) if len", + "type": "text" + }, + { + "bbox": [ + 295, + 239, + 329, + 249 + ], + "score": 0.52, + "content": "( \\mathbf { \\nabla } _ { \\mathbf { X } } \\mathbf { S } ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 238, + 389, + 250 + ], + "score": 1.0, + "content": "else Null", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 248, + 418, + 262 + ], + "spans": [ + { + "bbox": [ + 141, + 248, + 418, + 262 + ], + "score": 1.0, + "content": "Given an array, returns its minimum (or NULL if the array is empty).", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 264, + 286, + 276 + ], + "spans": [ + { + "bbox": [ + 132, + 264, + 248, + 276 + ], + "score": 1.0, + "content": "• MAXIMUM :: [int]", + "type": "text" + }, + { + "bbox": [ + 248, + 266, + 262, + 275 + ], + "score": 0.37, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 264, + 286, + 276 + ], + "score": 1.0, + "content": "int", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 276, + 389, + 287 + ], + "spans": [ + { + "bbox": [ + 141, + 276, + 294, + 287 + ], + "score": 1.0, + "content": "lambda xs: max(xs) if len", + "type": "text" + }, + { + "bbox": [ + 295, + 276, + 329, + 286 + ], + "score": 0.56, + "content": "( \\mathbf { \\nabla } _ { \\mathbf { X } } \\mathbf { S } ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 276, + 389, + 287 + ], + "score": 1.0, + "content": "else Null", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 286, + 419, + 299 + ], + "spans": [ + { + "bbox": [ + 141, + 286, + 419, + 299 + ], + "score": 1.0, + "content": "Given an array, returns its maximum (or NULL if the array is empty).", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 140, + 302, + 291, + 313 + ], + "spans": [ + { + "bbox": [ + 140, + 302, + 242, + 313 + ], + "score": 1.0, + "content": "REVERSE :: [int]", + "type": "text" + }, + { + "bbox": [ + 242, + 303, + 257, + 312 + ], + "score": 0.33, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 302, + 291, + 313 + ], + "score": 1.0, + "content": "[int]", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 142, + 313, + 316, + 325 + ], + "spans": [ + { + "bbox": [ + 142, + 313, + 316, + 325 + ], + "score": 1.0, + "content": "lambda xs: list(reversed(xs))", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 142, + 324, + 357, + 336 + ], + "spans": [ + { + "bbox": [ + 142, + 324, + 357, + 336 + ], + "score": 1.0, + "content": "Given an array, returns its elements in reversed order.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 132, + 339, + 275, + 352 + ], + "spans": [ + { + "bbox": [ + 132, + 339, + 275, + 352 + ], + "score": 1.0, + "content": "• SORT :: [int] -> [int]", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 142, + 350, + 268, + 362 + ], + "spans": [ + { + "bbox": [ + 142, + 350, + 268, + 362 + ], + "score": 1.0, + "content": "lambda xs: sorted(xs)", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 142, + 361, + 380, + 373 + ], + "spans": [ + { + "bbox": [ + 142, + 361, + 380, + 373 + ], + "score": 1.0, + "content": "Given an array, return its elements in non-decreasing order.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 140, + 376, + 260, + 389 + ], + "spans": [ + { + "bbox": [ + 140, + 376, + 221, + 389 + ], + "score": 1.0, + "content": "SUM :: [int]", + "type": "text" + }, + { + "bbox": [ + 221, + 378, + 236, + 387 + ], + "score": 0.3, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 376, + 260, + 389 + ], + "score": 1.0, + "content": "int", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 142, + 388, + 250, + 399 + ], + "spans": [ + { + "bbox": [ + 142, + 388, + 250, + 399 + ], + "score": 1.0, + "content": "lambda xs: sum(xs)", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 397, + 469, + 411 + ], + "spans": [ + { + "bbox": [ + 141, + 397, + 469, + 411 + ], + "score": 1.0, + "content": "Given an array, returns the sum of its elements. (The sum of an empty array is 0.)", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 420, + 202, + 431 + ], + "lines": [ + { + "bbox": [ + 106, + 419, + 203, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 203, + 432 + ], + "score": 1.0, + "content": "Higher-order functions:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 132, + 440, + 506, + 690 + ], + "lines": [ + { + "bbox": [ + 132, + 440, + 367, + 452 + ], + "spans": [ + { + "bbox": [ + 132, + 440, + 367, + 452 + ], + "score": 1.0, + "content": "• MAP :: (int -> int) -> [int] -> [int]", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 142, + 452, + 334, + 463 + ], + "spans": [ + { + "bbox": [ + 142, + 452, + 334, + 463 + ], + "score": 1.0, + "content": "lambda f, xs: [f(x) for x in xs]", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 462, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 141, + 462, + 505, + 475 + ], + "score": 1.0, + "content": "Given a lambda function f mapping from integers to integers, and an array xs, returns the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 142, + 473, + 363, + 485 + ], + "spans": [ + { + "bbox": [ + 142, + 473, + 363, + 485 + ], + "score": 1.0, + "content": "array resulting from applying f to each element of xs.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 133, + 488, + 383, + 501 + ], + "spans": [ + { + "bbox": [ + 133, + 488, + 226, + 501 + ], + "score": 1.0, + "content": "• FILTER :: (int", + "type": "text" + }, + { + "bbox": [ + 226, + 490, + 240, + 499 + ], + "score": 0.41, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 488, + 279, + 501 + ], + "score": 1.0, + "content": "bool)", + "type": "text" + }, + { + "bbox": [ + 280, + 490, + 295, + 500 + ], + "score": 0.37, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 488, + 383, + 501 + ], + "score": 1.0, + "content": "[int] -> [int]", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 142, + 500, + 364, + 512 + ], + "spans": [ + { + "bbox": [ + 142, + 500, + 364, + 512 + ], + "score": 1.0, + "content": "lambda f, xs: [x for x in xs if f(x)]", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 142, + 510, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 142, + 510, + 505, + 523 + ], + "score": 1.0, + "content": "Given a predicate f mapping from integers to truth values, and an array xs, returns the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 141, + 521, + 390, + 534 + ], + "spans": [ + { + "bbox": [ + 141, + 521, + 390, + 534 + ], + "score": 1.0, + "content": "elements of xs satisfying the predicate in their original order.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 134, + 537, + 373, + 549 + ], + "spans": [ + { + "bbox": [ + 134, + 537, + 227, + 549 + ], + "score": 1.0, + "content": "• COUNT :: (int", + "type": "text" + }, + { + "bbox": [ + 227, + 538, + 241, + 547 + ], + "score": 0.48, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 537, + 280, + 549 + ], + "score": 1.0, + "content": "bool)", + "type": "text" + }, + { + "bbox": [ + 280, + 538, + 295, + 548 + ], + "score": 0.4, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 537, + 334, + 549 + ], + "score": 1.0, + "content": "[int]", + "type": "text" + }, + { + "bbox": [ + 334, + 538, + 349, + 548 + ], + "score": 0.28, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 537, + 373, + 549 + ], + "score": 1.0, + "content": "int", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 142, + 547, + 394, + 560 + ], + "spans": [ + { + "bbox": [ + 142, + 547, + 394, + 560 + ], + "score": 1.0, + "content": "lambda f, xs: len([x for x in xs if f(x)])", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 142, + 559, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 142, + 559, + 505, + 572 + ], + "score": 1.0, + "content": "Given a predicate f mapping from integers to truth values, and an array xs, returns the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 141, + 570, + 345, + 582 + ], + "spans": [ + { + "bbox": [ + 141, + 570, + 345, + 582 + ], + "score": 1.0, + "content": "number of elements in xs satisfying the predicate.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 132, + 585, + 481, + 597 + ], + "spans": [ + { + "bbox": [ + 132, + 585, + 235, + 597 + ], + "score": 1.0, + "content": "• ZIPWITH :: (int", + "type": "text" + }, + { + "bbox": [ + 235, + 587, + 250, + 596 + ], + "score": 0.58, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 585, + 276, + 597 + ], + "score": 1.0, + "content": "int", + "type": "text" + }, + { + "bbox": [ + 277, + 587, + 292, + 596 + ], + "score": 0.56, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 585, + 324, + 597 + ], + "score": 1.0, + "content": "int)", + "type": "text" + }, + { + "bbox": [ + 324, + 587, + 339, + 596 + ], + "score": 0.36, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 585, + 481, + 597 + ], + "score": 1.0, + "content": "[int] -> [int] -> [int]", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 141, + 596, + 460, + 609 + ], + "spans": [ + { + "bbox": [ + 141, + 596, + 460, + 609 + ], + "score": 1.0, + "content": "lambda f, xs, ys: [f(x, y) for (x, y) in zip(xs, ys)]", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 141, + 607, + 507, + 620 + ], + "spans": [ + { + "bbox": [ + 141, + 607, + 507, + 620 + ], + "score": 1.0, + "content": "Given a lambda function f mapping integer pairs to integers, and two arrays xs and ys,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 141, + 618, + 505, + 631 + ], + "spans": [ + { + "bbox": [ + 141, + 618, + 505, + 631 + ], + "score": 1.0, + "content": "returns the array resulting from applying f to corresponding elements of xs and ys. The", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 141, + 629, + 435, + 642 + ], + "spans": [ + { + "bbox": [ + 141, + 629, + 386, + 642 + ], + "score": 1.0, + "content": "length of the returned array is the minimum of the lengths of", + "type": "text" + }, + { + "bbox": [ + 387, + 631, + 399, + 640 + ], + "score": 0.32, + "content": "_ { \\textrm { x S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 629, + 435, + 642 + ], + "score": 1.0, + "content": "and ys.", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 139, + 643, + 424, + 657 + ], + "spans": [ + { + "bbox": [ + 139, + 643, + 231, + 657 + ], + "score": 1.0, + "content": "SCANL1 :: (int", + "type": "text" + }, + { + "bbox": [ + 231, + 646, + 245, + 655 + ], + "score": 0.64, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 643, + 272, + 657 + ], + "score": 1.0, + "content": "int", + "type": "text" + }, + { + "bbox": [ + 273, + 645, + 288, + 655 + ], + "score": 0.59, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 643, + 320, + 657 + ], + "score": 1.0, + "content": "int)", + "type": "text" + }, + { + "bbox": [ + 320, + 645, + 335, + 655 + ], + "score": 0.55, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 643, + 424, + 657 + ], + "score": 1.0, + "content": "[int] -> [int]", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 141, + 655, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 141, + 655, + 445, + 668 + ], + "score": 1.0, + "content": "Given a lambda function f mapping integer pairs to integers, and an array", + "type": "text" + }, + { + "bbox": [ + 445, + 658, + 458, + 666 + ], + "score": 0.33, + "content": "_ { \\textrm { x S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 655, + 505, + 668 + ], + "score": 1.0, + "content": ", returns an", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 141, + 666, + 504, + 679 + ], + "spans": [ + { + "bbox": [ + 141, + 666, + 460, + 679 + ], + "score": 1.0, + "content": "array ys of the same length as xs and with its content defined by the recurrence", + "type": "text" + }, + { + "bbox": [ + 461, + 667, + 504, + 678 + ], + "score": 0.83, + "content": "\\begin{array} { r l } { \\mathrm { y s } \\left[ 0 \\right] } & { { } = } \\end{array}", + "type": "inline_equation" + } + ], + "index": 47 + }, + { + "bbox": [ + 141, + 678, + 372, + 690 + ], + "spans": [ + { + "bbox": [ + 141, + 678, + 279, + 690 + ], + "score": 0.55, + "content": "\\mathbf { x } \\mathbf { s } \\left[ 0 \\right] , \\mathbf { y } \\mathbf { s } \\left[ \\mathrm { n } \\right] \\mathbf { \\Psi } = \\mathbf { \\Psi } \\mathbf { f } \\left( \\mathbf { y } \\mathbf { s } \\left[ \\mathrm { n - 1 } \\right] \\right.", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 678, + 290, + 690 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 290, + 678, + 323, + 689 + ], + "score": 0.36, + "content": "\\mathtt { x s } [ \\mathtt { n } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 678, + 343, + 690 + ], + "score": 1.0, + "content": ") for", + "type": "text" + }, + { + "bbox": [ + 343, + 678, + 368, + 689 + ], + "score": 0.89, + "content": "n \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 678, + 372, + 690 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 140, + 711 + ], + "score": 1.0, + "content": "The INT", + "type": "text" + }, + { + "bbox": [ + 140, + 700, + 150, + 709 + ], + "score": 0.59, + "content": "", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 698, + 203, + 711 + ], + "score": 1.0, + "content": "INT lambdas", + "type": "text" + }, + { + "bbox": [ + 203, + 699, + 497, + 710 + ], + "score": 0.43, + "content": "\\left( + 1 \\right) , \\left( - 1 \\right) , \\left( \\star 2 \\right) , \\left( / 2 \\right) , \\left( \\star \\left( - 1 \\right) \\right) , \\left( \\star \\star 2 \\right) , \\left( \\star 3 \\right) , \\left( / 3 \\right) , \\left( \\star 4 \\right) , \\left( / 4 \\right) , \\left( \\star 3 \\right) , \\left( \\star 4 \\right) .", + "type": "inline_equation" + }, + { + "bbox": [ + 497, + 698, + 505, + 711 + ], + "score": 1.0, + "content": ")", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 710, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 417, + 721 + ], + "score": 1.0, + "content": "provided by our DSL map integers to integers in a self-explanatory manner. The", + "type": "text" + }, + { + "bbox": [ + 418, + 711, + 469, + 720 + ], + "score": 0.68, + "content": "\\mathrm { I N T } { } \\mathrm { B O O L }", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 710, + 505, + 721 + ], + "score": 1.0, + "content": "lambdas", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 108, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 108, + 721, + 129, + 732 + ], + "score": 0.78, + "content": "( > 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 720, + 137, + 733 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 137, + 721, + 158, + 732 + ], + "score": 0.72, + "content": "( < 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 720, + 169, + 733 + ], + "score": 1.0, + "content": ", (", + "type": "text" + }, + { + "bbox": [ + 169, + 721, + 201, + 731 + ], + "score": 0.85, + "content": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 720, + 216, + 733 + ], + "score": 1.0, + "content": "), (", + "type": "text" + }, + { + "bbox": [ + 216, + 721, + 248, + 731 + ], + "score": 0.86, + "content": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 720, + 506, + 733 + ], + "score": 1.0, + "content": ") respectively test positivity, negativity, evenness and oddness of", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 50 + } + ], + "page_idx": 17, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 763 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 763 + ], + "score": 1.0, + "content": "18", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "list", + "bbox": [ + 131, + 82, + 505, + 410 + ], + "lines": [], + "index": 13, + "bbox_fs": [ + 132, + 82, + 505, + 411 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 420, + 202, + 431 + ], + "lines": [ + { + "bbox": [ + 106, + 419, + 203, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 203, + 432 + ], + "score": 1.0, + "content": "Higher-order functions:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27, + "bbox_fs": [ + 106, + 419, + 203, + 432 + ] + }, + { + "type": "list", + "bbox": [ + 132, + 440, + 506, + 690 + ], + "lines": [ + { + "bbox": [ + 132, + 440, + 367, + 452 + ], + "spans": [ + { + "bbox": [ + 132, + 440, + 367, + 452 + ], + "score": 1.0, + "content": "• MAP :: (int -> int) -> [int] -> [int]", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 452, + 334, + 463 + ], + "spans": [ + { + "bbox": [ + 142, + 452, + 334, + 463 + ], + "score": 1.0, + "content": "lambda f, xs: [f(x) for x in xs]", + "type": "text" + } + ], + "index": 29, + "is_list_end_line": true + }, + { + "bbox": [ + 141, + 462, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 141, + 462, + 505, + 475 + ], + "score": 1.0, + "content": "Given a lambda function f mapping from integers to integers, and an array xs, returns the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 142, + 473, + 363, + 485 + ], + "spans": [ + { + "bbox": [ + 142, + 473, + 363, + 485 + ], + "score": 1.0, + "content": "array resulting from applying f to each element of xs.", + "type": "text" + } + ], + "index": 31, + "is_list_end_line": true + }, + { + "bbox": [ + 133, + 488, + 383, + 501 + ], + "spans": [ + { + "bbox": [ + 133, + 488, + 226, + 501 + ], + "score": 1.0, + "content": "• FILTER :: (int", + "type": "text" + }, + { + "bbox": [ + 226, + 490, + 240, + 499 + ], + "score": 0.41, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 488, + 279, + 501 + ], + "score": 1.0, + "content": "bool)", + "type": "text" + }, + { + "bbox": [ + 280, + 490, + 295, + 500 + ], + "score": 0.37, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 488, + 383, + 501 + ], + "score": 1.0, + "content": "[int] -> [int]", + "type": "text" + } + ], + "index": 32, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 500, + 364, + 512 + ], + "spans": [ + { + "bbox": [ + 142, + 500, + 364, + 512 + ], + "score": 1.0, + "content": "lambda f, xs: [x for x in xs if f(x)]", + "type": "text" + } + ], + "index": 33, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 510, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 142, + 510, + 505, + 523 + ], + "score": 1.0, + "content": "Given a predicate f mapping from integers to truth values, and an array xs, returns the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 141, + 521, + 390, + 534 + ], + "spans": [ + { + "bbox": [ + 141, + 521, + 390, + 534 + ], + "score": 1.0, + "content": "elements of xs satisfying the predicate in their original order.", + "type": "text" + } + ], + "index": 35, + "is_list_end_line": true + }, + { + "bbox": [ + 134, + 537, + 373, + 549 + ], + "spans": [ + { + "bbox": [ + 134, + 537, + 227, + 549 + ], + "score": 1.0, + "content": "• COUNT :: (int", + "type": "text" + }, + { + "bbox": [ + 227, + 538, + 241, + 547 + ], + "score": 0.48, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 537, + 280, + 549 + ], + "score": 1.0, + "content": "bool)", + "type": "text" + }, + { + "bbox": [ + 280, + 538, + 295, + 548 + ], + "score": 0.4, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 537, + 334, + 549 + ], + "score": 1.0, + "content": "[int]", + "type": "text" + }, + { + "bbox": [ + 334, + 538, + 349, + 548 + ], + "score": 0.28, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 537, + 373, + 549 + ], + "score": 1.0, + "content": "int", + "type": "text" + } + ], + "index": 36, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 547, + 394, + 560 + ], + "spans": [ + { + "bbox": [ + 142, + 547, + 394, + 560 + ], + "score": 1.0, + "content": "lambda f, xs: len([x for x in xs if f(x)])", + "type": "text" + } + ], + "index": 37, + "is_list_end_line": true + }, + { + "bbox": [ + 142, + 559, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 142, + 559, + 505, + 572 + ], + "score": 1.0, + "content": "Given a predicate f mapping from integers to truth values, and an array xs, returns the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 141, + 570, + 345, + 582 + ], + "spans": [ + { + "bbox": [ + 141, + 570, + 345, + 582 + ], + "score": 1.0, + "content": "number of elements in xs satisfying the predicate.", + "type": "text" + } + ], + "index": 39, + "is_list_end_line": true + }, + { + "bbox": [ + 132, + 585, + 481, + 597 + ], + "spans": [ + { + "bbox": [ + 132, + 585, + 235, + 597 + ], + "score": 1.0, + "content": "• ZIPWITH :: (int", + "type": "text" + }, + { + "bbox": [ + 235, + 587, + 250, + 596 + ], + "score": 0.58, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 585, + 276, + 597 + ], + "score": 1.0, + "content": "int", + "type": "text" + }, + { + "bbox": [ + 277, + 587, + 292, + 596 + ], + "score": 0.56, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 585, + 324, + 597 + ], + "score": 1.0, + "content": "int)", + "type": "text" + }, + { + "bbox": [ + 324, + 587, + 339, + 596 + ], + "score": 0.36, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 585, + 481, + 597 + ], + "score": 1.0, + "content": "[int] -> [int] -> [int]", + "type": "text" + } + ], + "index": 40, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 141, + 596, + 460, + 609 + ], + "spans": [ + { + "bbox": [ + 141, + 596, + 460, + 609 + ], + "score": 1.0, + "content": "lambda f, xs, ys: [f(x, y) for (x, y) in zip(xs, ys)]", + "type": "text" + } + ], + "index": 41, + "is_list_end_line": true + }, + { + "bbox": [ + 141, + 607, + 507, + 620 + ], + "spans": [ + { + "bbox": [ + 141, + 607, + 507, + 620 + ], + "score": 1.0, + "content": "Given a lambda function f mapping integer pairs to integers, and two arrays xs and ys,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 141, + 618, + 505, + 631 + ], + "spans": [ + { + "bbox": [ + 141, + 618, + 505, + 631 + ], + "score": 1.0, + "content": "returns the array resulting from applying f to corresponding elements of xs and ys. The", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 141, + 629, + 435, + 642 + ], + "spans": [ + { + "bbox": [ + 141, + 629, + 386, + 642 + ], + "score": 1.0, + "content": "length of the returned array is the minimum of the lengths of", + "type": "text" + }, + { + "bbox": [ + 387, + 631, + 399, + 640 + ], + "score": 0.32, + "content": "_ { \\textrm { x S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 629, + 435, + 642 + ], + "score": 1.0, + "content": "and ys.", + "type": "text" + } + ], + "index": 44, + "is_list_end_line": true + }, + { + "bbox": [ + 139, + 643, + 424, + 657 + ], + "spans": [ + { + "bbox": [ + 139, + 643, + 231, + 657 + ], + "score": 1.0, + "content": "SCANL1 :: (int", + "type": "text" + }, + { + "bbox": [ + 231, + 646, + 245, + 655 + ], + "score": 0.64, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 643, + 272, + 657 + ], + "score": 1.0, + "content": "int", + "type": "text" + }, + { + "bbox": [ + 273, + 645, + 288, + 655 + ], + "score": 0.59, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 643, + 320, + 657 + ], + "score": 1.0, + "content": "int)", + "type": "text" + }, + { + "bbox": [ + 320, + 645, + 335, + 655 + ], + "score": 0.55, + "content": "- >", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 643, + 424, + 657 + ], + "score": 1.0, + "content": "[int] -> [int]", + "type": "text" + } + ], + "index": 45, + "is_list_end_line": true + }, + { + "bbox": [ + 141, + 655, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 141, + 655, + 445, + 668 + ], + "score": 1.0, + "content": "Given a lambda function f mapping integer pairs to integers, and an array", + "type": "text" + }, + { + "bbox": [ + 445, + 658, + 458, + 666 + ], + "score": 0.33, + "content": "_ { \\textrm { x S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 655, + 505, + 668 + ], + "score": 1.0, + "content": ", returns an", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 141, + 666, + 504, + 679 + ], + "spans": [ + { + "bbox": [ + 141, + 666, + 460, + 679 + ], + "score": 1.0, + "content": "array ys of the same length as xs and with its content defined by the recurrence", + "type": "text" + }, + { + "bbox": [ + 461, + 667, + 504, + 678 + ], + "score": 0.83, + "content": "\\begin{array} { r l } { \\mathrm { y s } \\left[ 0 \\right] } & { { } = } \\end{array}", + "type": "inline_equation" + } + ], + "index": 47 + }, + { + "bbox": [ + 141, + 678, + 372, + 690 + ], + "spans": [ + { + "bbox": [ + 141, + 678, + 279, + 690 + ], + "score": 0.55, + "content": "\\mathbf { x } \\mathbf { s } \\left[ 0 \\right] , \\mathbf { y } \\mathbf { s } \\left[ \\mathrm { n } \\right] \\mathbf { \\Psi } = \\mathbf { \\Psi } \\mathbf { f } \\left( \\mathbf { y } \\mathbf { s } \\left[ \\mathrm { n - 1 } \\right] \\right.", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 678, + 290, + 690 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 290, + 678, + 323, + 689 + ], + "score": 0.36, + "content": "\\mathtt { x s } [ \\mathtt { n } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 678, + 343, + 690 + ], + "score": 1.0, + "content": ") for", + "type": "text" + }, + { + "bbox": [ + 343, + 678, + 368, + 689 + ], + "score": 0.89, + "content": "n \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 678, + 372, + 690 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 48, + "is_list_end_line": true + } + ], + "index": 38, + "bbox_fs": [ + 132, + 440, + 507, + 690 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 140, + 711 + ], + "score": 1.0, + "content": "The INT", + "type": "text" + }, + { + "bbox": [ + 140, + 700, + 150, + 709 + ], + "score": 0.59, + "content": "", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 698, + 203, + 711 + ], + "score": 1.0, + "content": "INT lambdas", + "type": "text" + }, + { + "bbox": [ + 203, + 699, + 497, + 710 + ], + "score": 0.43, + "content": "\\left( + 1 \\right) , \\left( - 1 \\right) , \\left( \\star 2 \\right) , \\left( / 2 \\right) , \\left( \\star \\left( - 1 \\right) \\right) , \\left( \\star \\star 2 \\right) , \\left( \\star 3 \\right) , \\left( / 3 \\right) , \\left( \\star 4 \\right) , \\left( / 4 \\right) , \\left( \\star 3 \\right) , \\left( \\star 4 \\right) .", + "type": "inline_equation" + }, + { + "bbox": [ + 497, + 698, + 505, + 711 + ], + "score": 1.0, + "content": ")", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 710, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 417, + 721 + ], + "score": 1.0, + "content": "provided by our DSL map integers to integers in a self-explanatory manner. The", + "type": "text" + }, + { + "bbox": [ + 418, + 711, + 469, + 720 + ], + "score": 0.68, + "content": "\\mathrm { I N T } { } \\mathrm { B O O L }", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 710, + 505, + 721 + ], + "score": 1.0, + "content": "lambdas", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 108, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 108, + 721, + 129, + 732 + ], + "score": 0.78, + "content": "( > 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 720, + 137, + 733 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 137, + 721, + 158, + 732 + ], + "score": 0.72, + "content": "( < 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 720, + 169, + 733 + ], + "score": 1.0, + "content": ", (", + "type": "text" + }, + { + "bbox": [ + 169, + 721, + 201, + 731 + ], + "score": 0.85, + "content": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 720, + 216, + 733 + ], + "score": 1.0, + "content": "), (", + "type": "text" + }, + { + "bbox": [ + 216, + 721, + 248, + 731 + ], + "score": 0.86, + "content": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 720, + 506, + 733 + ], + "score": 1.0, + "content": ") respectively test positivity, negativity, evenness and oddness of", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 250, + 96 + ], + "score": 1.0, + "content": "the input integer value. Finally, the", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 250, + 83, + 316, + 93 + ], + "score": 0.41, + "content": "\\mathrm { I N T } { } \\mathrm { I N T } { } \\mathrm { I N T }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 316, + 81, + 357, + 96 + ], + "score": 1.0, + "content": "lambdas", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 358, + 83, + 419, + 94 + ], + "score": 0.44, + "content": "( + ) , ( - ) , ( \\star )", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 419, + 81, + 506, + 96 + ], + "score": 1.0, + "content": ", MIN, MAX apply a", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 338, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 338, + 107 + ], + "score": 1.0, + "content": "function to a pair of integers and produce a single integer.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 50, + "bbox_fs": [ + 106, + 698, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 250, + 96 + ], + "score": 1.0, + "content": "the input integer value. Finally, the", + "type": "text" + }, + { + "bbox": [ + 250, + 83, + 316, + 93 + ], + "score": 0.41, + "content": "\\mathrm { I N T } { } \\mathrm { I N T } { } \\mathrm { I N T }", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 81, + 357, + 96 + ], + "score": 1.0, + "content": "lambdas", + "type": "text" + }, + { + "bbox": [ + 358, + 83, + 419, + 94 + ], + "score": 0.44, + "content": "( + ) , ( - ) , ( \\star )", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 81, + 506, + 96 + ], + "score": 1.0, + "content": ", MIN, MAX apply a", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 338, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 338, + 107 + ], + "score": 1.0, + "content": "function to a pair of integers and produce a single integer.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 110, + 505, + 154 + ], + "lines": [ + { + "bbox": [ + 105, + 110, + 505, + 122 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 505, + 122 + ], + "score": 1.0, + "content": "As an example, consider the function SCANL1 MAX, consisting of the higher-order function SCANL1", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 138, + 134 + ], + "score": 1.0, + "content": "and the", + "type": "text" + }, + { + "bbox": [ + 138, + 122, + 204, + 132 + ], + "score": 0.54, + "content": "\\mathrm { I N T } { } \\mathrm { I N T } { } \\mathrm { I N T }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 121, + 401, + 134 + ], + "score": 1.0, + "content": "lambda MAX. Given an integer array a of length", + "type": "text" + }, + { + "bbox": [ + 401, + 122, + 409, + 131 + ], + "score": 0.71, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 121, + 505, + 134 + ], + "score": 1.0, + "content": ", this function computes", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 382, + 145 + ], + "score": 1.0, + "content": "the running maximum of the array a. Specifically, it returns an array", + "type": "text" + }, + { + "bbox": [ + 383, + 133, + 390, + 142 + ], + "score": 0.4, + "content": "\\mathrm { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 132, + 468, + 145 + ], + "score": 1.0, + "content": "of the same length", + "type": "text" + }, + { + "bbox": [ + 468, + 133, + 476, + 142 + ], + "score": 0.76, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 132, + 505, + 145 + ], + "score": 1.0, + "content": "whose", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 143, + 333, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 111, + 153 + ], + "score": 0.73, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 111, + 143, + 267, + 155 + ], + "score": 1.0, + "content": "-th element is the maximum of the first", + "type": "text" + }, + { + "bbox": [ + 268, + 144, + 273, + 153 + ], + "score": 0.58, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 143, + 321, + 155 + ], + "score": 1.0, + "content": "elements in", + "type": "text" + }, + { + "bbox": [ + 322, + 146, + 329, + 153 + ], + "score": 0.31, + "content": "\\exists", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 143, + 333, + 155 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5 + }, + { + "type": "image", + "bbox": [ + 108, + 165, + 501, + 560 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 165, + 501, + 560 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 165, + 501, + 560 + ], + "spans": [ + { + "bbox": [ + 108, + 165, + 501, + 560 + ], + "score": 0.93, + "type": "image", + "image_path": "da5620eb6e4f0a76e4439147498cbeb617797fc9a1d092bb07c51b51e15fdcb8.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 108, + 165, + 501, + 296.66666666666663 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 108, + 296.66666666666663, + 501, + 428.33333333333326 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 108, + 428.33333333333326, + 501, + 559.9999999999999 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 569, + 506, + 625 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 569, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 415, + 581 + ], + "score": 1.0, + "content": "Figure 9: Conditional confusion matrix for the neural network and test set of", + "type": "text" + }, + { + "bbox": [ + 416, + 570, + 453, + 580 + ], + "score": 0.89, + "content": "P = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 569, + 505, + 581 + ], + "score": 1.0, + "content": "programs of", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 579, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 579, + 133, + 595 + ], + "score": 1.0, + "content": "length", + "type": "text" + }, + { + "bbox": [ + 133, + 581, + 160, + 591 + ], + "score": 0.9, + "content": "T = 3", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 579, + 505, + 595 + ], + "score": 1.0, + "content": "that were used to obtain the results presented in Table 1. Each cell contains the average", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 590, + 506, + 605 + ], + "spans": [ + { + "bbox": [ + 105, + 590, + 506, + 605 + ], + "score": 1.0, + "content": "false positive probability (in larger font) and the number of test programs from which this average", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 602, + 506, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 602, + 506, + 615 + ], + "score": 1.0, + "content": "was computed (smaller font, in brackets). The color intensity of each cell’s shading coresponds to", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 613, + 326, + 627 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 326, + 627 + ], + "score": 1.0, + "content": "the magnitude of the average false positive probability.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11 + } + ], + "index": 9.0 + }, + { + "type": "title", + "bbox": [ + 107, + 652, + 353, + 664 + ], + "lines": [ + { + "bbox": [ + 106, + 650, + 354, + 666 + ], + "spans": [ + { + "bbox": [ + 106, + 650, + 354, + 666 + ], + "score": 1.0, + "content": "G ANALYSIS OF TRAINED NEURAL NETWORKS", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 676, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "We analyzed the performance of trained neural networks by investigating which program instructions", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "tend to get confused by the networks. To this end, we looked at a generalization of confusion matrices", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "to the multilabel classification setting: for each attribute in a ground truth program (rows) measure", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "how likely each other attribute (columns) is predicted as a false positive. More formally, in this", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 149, + 733 + ], + "score": 1.0, + "content": "matrix the", + "type": "text" + }, + { + "bbox": [ + 150, + 721, + 171, + 732 + ], + "score": 0.92, + "content": "( i , j )", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 721, + 383, + 733 + ], + "score": 1.0, + "content": "-entry is the average predicted probability of attribute", + "type": "text" + }, + { + "bbox": [ + 383, + 722, + 389, + 732 + ], + "score": 0.83, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "among test programs that do", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17 + } + ], + "page_idx": 18, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "19", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 506, + 107 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 110, + 505, + 154 + ], + "lines": [ + { + "bbox": [ + 105, + 110, + 505, + 122 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 505, + 122 + ], + "score": 1.0, + "content": "As an example, consider the function SCANL1 MAX, consisting of the higher-order function SCANL1", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 138, + 134 + ], + "score": 1.0, + "content": "and the", + "type": "text" + }, + { + "bbox": [ + 138, + 122, + 204, + 132 + ], + "score": 0.54, + "content": "\\mathrm { I N T } { } \\mathrm { I N T } { } \\mathrm { I N T }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 121, + 401, + 134 + ], + "score": 1.0, + "content": "lambda MAX. Given an integer array a of length", + "type": "text" + }, + { + "bbox": [ + 401, + 122, + 409, + 131 + ], + "score": 0.71, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 121, + 505, + 134 + ], + "score": 1.0, + "content": ", this function computes", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 382, + 145 + ], + "score": 1.0, + "content": "the running maximum of the array a. Specifically, it returns an array", + "type": "text" + }, + { + "bbox": [ + 383, + 133, + 390, + 142 + ], + "score": 0.4, + "content": "\\mathrm { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 132, + 468, + 145 + ], + "score": 1.0, + "content": "of the same length", + "type": "text" + }, + { + "bbox": [ + 468, + 133, + 476, + 142 + ], + "score": 0.76, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 132, + 505, + 145 + ], + "score": 1.0, + "content": "whose", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 143, + 333, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 111, + 153 + ], + "score": 0.73, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 111, + 143, + 267, + 155 + ], + "score": 1.0, + "content": "-th element is the maximum of the first", + "type": "text" + }, + { + "bbox": [ + 268, + 144, + 273, + 153 + ], + "score": 0.58, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 143, + 321, + 155 + ], + "score": 1.0, + "content": "elements in", + "type": "text" + }, + { + "bbox": [ + 322, + 146, + 329, + 153 + ], + "score": 0.31, + "content": "\\exists", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 143, + 333, + 155 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 110, + 505, + 155 + ] + }, + { + "type": "image", + "bbox": [ + 108, + 165, + 501, + 560 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 165, + 501, + 560 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 165, + 501, + 560 + ], + "spans": [ + { + "bbox": [ + 108, + 165, + 501, + 560 + ], + "score": 0.93, + "type": "image", + "image_path": "da5620eb6e4f0a76e4439147498cbeb617797fc9a1d092bb07c51b51e15fdcb8.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 108, + 165, + 501, + 296.66666666666663 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 108, + 296.66666666666663, + 501, + 428.33333333333326 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 108, + 428.33333333333326, + 501, + 559.9999999999999 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 569, + 506, + 625 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 569, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 415, + 581 + ], + "score": 1.0, + "content": "Figure 9: Conditional confusion matrix for the neural network and test set of", + "type": "text" + }, + { + "bbox": [ + 416, + 570, + 453, + 580 + ], + "score": 0.89, + "content": "P = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 569, + 505, + 581 + ], + "score": 1.0, + "content": "programs of", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 579, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 579, + 133, + 595 + ], + "score": 1.0, + "content": "length", + "type": "text" + }, + { + "bbox": [ + 133, + 581, + 160, + 591 + ], + "score": 0.9, + "content": "T = 3", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 579, + 505, + 595 + ], + "score": 1.0, + "content": "that were used to obtain the results presented in Table 1. Each cell contains the average", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 590, + 506, + 605 + ], + "spans": [ + { + "bbox": [ + 105, + 590, + 506, + 605 + ], + "score": 1.0, + "content": "false positive probability (in larger font) and the number of test programs from which this average", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 602, + 506, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 602, + 506, + 615 + ], + "score": 1.0, + "content": "was computed (smaller font, in brackets). The color intensity of each cell’s shading coresponds to", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 613, + 326, + 627 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 326, + 627 + ], + "score": 1.0, + "content": "the magnitude of the average false positive probability.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11 + } + ], + "index": 9.0 + }, + { + "type": "title", + "bbox": [ + 107, + 652, + 353, + 664 + ], + "lines": [ + { + "bbox": [ + 106, + 650, + 354, + 666 + ], + "spans": [ + { + "bbox": [ + 106, + 650, + 354, + 666 + ], + "score": 1.0, + "content": "G ANALYSIS OF TRAINED NEURAL NETWORKS", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 676, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "We analyzed the performance of trained neural networks by investigating which program instructions", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "tend to get confused by the networks. To this end, we looked at a generalization of confusion matrices", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "to the multilabel classification setting: for each attribute in a ground truth program (rows) measure", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "how likely each other attribute (columns) is predicted as a false positive. More formally, in this", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 149, + 733 + ], + "score": 1.0, + "content": "matrix the", + "type": "text" + }, + { + "bbox": [ + 150, + 721, + 171, + 732 + ], + "score": 0.92, + "content": "( i , j )", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 721, + 383, + 733 + ], + "score": 1.0, + "content": "-entry is the average predicted probability of attribute", + "type": "text" + }, + { + "bbox": [ + 383, + 722, + 389, + 732 + ], + "score": 0.83, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "among test programs that do", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 175, + 95 + ], + "score": 1.0, + "content": "possess attribute", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 175, + 83, + 180, + 92 + ], + "score": 0.65, + "content": "i", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 180, + 82, + 295, + 95 + ], + "score": 1.0, + "content": "and do not possess attribute", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 295, + 83, + 302, + 94 + ], + "score": 0.81, + "content": "j", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 302, + 82, + 366, + 95 + ], + "score": 1.0, + "content": ". Intuitively, the", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 366, + 83, + 371, + 92 + ], + "score": 0.7, + "content": "i", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 371, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "-th row of this matrix shows how", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 494, + 108 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 204, + 108 + ], + "score": 1.0, + "content": "the presence of attribute", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 205, + 95, + 210, + 104 + ], + "score": 0.67, + "content": "i", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 210, + 92, + 483, + 108 + ], + "score": 1.0, + "content": "confuses the network into incorrectly predicting each other attribute", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 483, + 95, + 489, + 105 + ], + "score": 0.81, + "content": "j", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 490, + 92, + 494, + 108 + ], + "score": 1.0, + "content": ".", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 677, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 175, + 95 + ], + "score": 1.0, + "content": "possess attribute", + "type": "text" + }, + { + "bbox": [ + 175, + 83, + 180, + 92 + ], + "score": 0.65, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 82, + 295, + 95 + ], + "score": 1.0, + "content": "and do not possess attribute", + "type": "text" + }, + { + "bbox": [ + 295, + 83, + 302, + 94 + ], + "score": 0.81, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 82, + 366, + 95 + ], + "score": 1.0, + "content": ". Intuitively, the", + "type": "text" + }, + { + "bbox": [ + 366, + 83, + 371, + 92 + ], + "score": 0.7, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "-th row of this matrix shows how", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 494, + 108 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 204, + 108 + ], + "score": 1.0, + "content": "the presence of attribute", + "type": "text" + }, + { + "bbox": [ + 205, + 95, + 210, + 104 + ], + "score": 0.67, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 92, + 483, + 108 + ], + "score": 1.0, + "content": "confuses the network into incorrectly predicting each other attribute", + "type": "text" + }, + { + "bbox": [ + 483, + 95, + 489, + 105 + ], + "score": 0.81, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 490, + 92, + 494, + 108 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 110, + 505, + 165 + ], + "lines": [ + { + "bbox": [ + 106, + 110, + 505, + 122 + ], + "spans": [ + { + "bbox": [ + 106, + 110, + 414, + 122 + ], + "score": 1.0, + "content": "Figure 9 shows this conditional confusion matrix for the neural network and", + "type": "text" + }, + { + "bbox": [ + 414, + 111, + 451, + 121 + ], + "score": 0.89, + "content": "P = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 110, + 505, + 122 + ], + "score": 1.0, + "content": "program test", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 122, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 106, + 122, + 505, + 133 + ], + "score": 1.0, + "content": "set configuration used to obtain Table 1. We re-ordered the confusion matrix to try to expose block", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "score": 1.0, + "content": "structure in the false positive probabilities, revealing groups of instructions that tend to be difficult to", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 144, + 505, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 505, + 155 + ], + "score": 1.0, + "content": "distinguish. Figure 10 show the conditional confusion matrix for the neural network used to obtain", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 490, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 490, + 167 + ], + "score": 1.0, + "content": "the table in Fig. 3a. While the results are somewhat noisy, we observe a few general tendencies:", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 132, + 174, + 505, + 276 + ], + "lines": [ + { + "bbox": [ + 132, + 174, + 504, + 187 + ], + "spans": [ + { + "bbox": [ + 132, + 174, + 504, + 187 + ], + "score": 1.0, + "content": "• There is increased confusion amongst instructions that select out a single element from an", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 186, + 365, + 198 + ], + "spans": [ + { + "bbox": [ + 141, + 186, + 365, + 198 + ], + "score": 1.0, + "content": "array: HEAD, LAST, ACCESS, MINIMUM, MAXIMUM.", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 133, + 200, + 505, + 213 + ], + "spans": [ + { + "bbox": [ + 133, + 200, + 505, + 213 + ], + "score": 1.0, + "content": "• Some common attributes get predicted more often regardless of the ground truth program:", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 212, + 470, + 224 + ], + "spans": [ + { + "bbox": [ + 141, + 212, + 180, + 224 + ], + "score": 1.0, + "content": "FILTER,", + "type": "text" + }, + { + "bbox": [ + 180, + 213, + 200, + 223 + ], + "score": 0.75, + "content": "( > 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 212, + 208, + 224 + ], + "score": 1.0, + "content": "),", + "type": "text" + }, + { + "bbox": [ + 209, + 213, + 230, + 223 + ], + "score": 0.75, + "content": "( < 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 212, + 240, + 224 + ], + "score": 1.0, + "content": ", (", + "type": "text" + }, + { + "bbox": [ + 240, + 213, + 274, + 223 + ], + "score": 0.82, + "content": "\\scriptstyle { \\frac { \\circ } { \\circ } } 2 = = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 274, + 212, + 287, + 224 + ], + "score": 1.0, + "content": "), (", + "type": "text" + }, + { + "bbox": [ + 287, + 213, + 320, + 223 + ], + "score": 0.84, + "content": "\\scriptstyle { \\frac { 0 } { \\circ } } 2 = = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 212, + 470, + 224 + ], + "score": 1.0, + "content": "), MIN, MAX, (+), (-), ZIPWITH.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 227, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 138, + 227, + 505, + 239 + ], + "score": 1.0, + "content": "There are some groups of lambdas that are more difficult for the network to distinguish", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 237, + 399, + 250 + ], + "spans": [ + { + "bbox": [ + 141, + 237, + 175, + 250 + ], + "score": 1.0, + "content": "within:", + "type": "text" + }, + { + "bbox": [ + 175, + 239, + 190, + 249 + ], + "score": 0.77, + "content": "( + )", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 237, + 207, + 250 + ], + "score": 1.0, + "content": "vs", + "type": "text" + }, + { + "bbox": [ + 207, + 239, + 251, + 249 + ], + "score": 0.84, + "content": "( - ) ~ ; ~ ( + 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 237, + 268, + 250 + ], + "score": 1.0, + "content": "vs", + "type": "text" + }, + { + "bbox": [ + 268, + 239, + 317, + 250 + ], + "score": 0.7, + "content": "( - 1 ) \\ ; \\ ( \\ / 2 )", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 237, + 399, + 250 + ], + "score": 1.0, + "content": "vs (/3) vs (/4).", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 253, + 505, + 265 + ], + "spans": [ + { + "bbox": [ + 132, + 253, + 232, + 265 + ], + "score": 1.0, + "content": "• When a program uses", + "type": "text" + }, + { + "bbox": [ + 232, + 254, + 259, + 264 + ], + "score": 0.89, + "content": "( \\star \\star 2 )", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 253, + 402, + 265 + ], + "score": 1.0, + "content": ", the network often thinks it’s using", + "type": "text" + }, + { + "bbox": [ + 403, + 254, + 418, + 264 + ], + "score": 0.63, + "content": "( \\star )", + "type": "inline_equation" + }, + { + "bbox": [ + 418, + 253, + 505, + 265 + ], + "score": 1.0, + "content": ", presumably because", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 264, + 313, + 276 + ], + "spans": [ + { + "bbox": [ + 141, + 264, + 313, + 276 + ], + "score": 1.0, + "content": "both can lead to large values in the output.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 10.5 + }, + { + "type": "image", + "bbox": [ + 109, + 292, + 501, + 685 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 292, + 501, + 685 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 292, + 501, + 685 + ], + "spans": [ + { + "bbox": [ + 109, + 292, + 501, + 685 + ], + "score": 0.913, + "type": "image", + "image_path": "a2f6e1ddd3c6cc3aed7aca84775a0568e1abe730347297f96f96da4cfd262c8d.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 109, + 292, + 501, + 423.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 109, + 423.0, + 501, + 554.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 109, + 554.0, + 501, + 685.0 + ], + "spans": [], + "index": 17 + } + ] + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 106, + 695, + 504, + 718 + ], + "lines": [ + { + "bbox": [ + 106, + 695, + 506, + 708 + ], + "spans": [ + { + "bbox": [ + 106, + 695, + 416, + 708 + ], + "score": 1.0, + "content": "Figure 10: Conditional confusion matrix for the neural network and test set of", + "type": "text" + }, + { + "bbox": [ + 416, + 696, + 453, + 706 + ], + "score": 0.89, + "content": "P = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 695, + 506, + 708 + ], + "score": 1.0, + "content": "programs of", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 705, + 340, + 718 + ], + "spans": [ + { + "bbox": [ + 106, + 705, + 133, + 718 + ], + "score": 1.0, + "content": "length", + "type": "text" + }, + { + "bbox": [ + 134, + 707, + 161, + 717 + ], + "score": 0.89, + "content": "T = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 705, + 340, + 718 + ], + "score": 1.0, + "content": ". The presentation is the same as in Figure 9.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + } + ], + "page_idx": 19, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 749, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 298, + 749, + 313, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 15 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 82, + 505, + 108 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 110, + 505, + 165 + ], + "lines": [ + { + "bbox": [ + 106, + 110, + 505, + 122 + ], + "spans": [ + { + "bbox": [ + 106, + 110, + 414, + 122 + ], + "score": 1.0, + "content": "Figure 9 shows this conditional confusion matrix for the neural network and", + "type": "text" + }, + { + "bbox": [ + 414, + 111, + 451, + 121 + ], + "score": 0.89, + "content": "P = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 110, + 505, + 122 + ], + "score": 1.0, + "content": "program test", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 122, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 106, + 122, + 505, + 133 + ], + "score": 1.0, + "content": "set configuration used to obtain Table 1. We re-ordered the confusion matrix to try to expose block", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "score": 1.0, + "content": "structure in the false positive probabilities, revealing groups of instructions that tend to be difficult to", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 144, + 505, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 505, + 155 + ], + "score": 1.0, + "content": "distinguish. Figure 10 show the conditional confusion matrix for the neural network used to obtain", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 490, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 490, + 167 + ], + "score": 1.0, + "content": "the table in Fig. 3a. While the results are somewhat noisy, we observe a few general tendencies:", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 110, + 506, + 167 + ] + }, + { + "type": "list", + "bbox": [ + 132, + 174, + 505, + 276 + ], + "lines": [ + { + "bbox": [ + 132, + 174, + 504, + 187 + ], + "spans": [ + { + "bbox": [ + 132, + 174, + 504, + 187 + ], + "score": 1.0, + "content": "• There is increased confusion amongst instructions that select out a single element from an", + "type": "text" + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 186, + 365, + 198 + ], + "spans": [ + { + "bbox": [ + 141, + 186, + 365, + 198 + ], + "score": 1.0, + "content": "array: HEAD, LAST, ACCESS, MINIMUM, MAXIMUM.", + "type": "text" + } + ], + "index": 8, + "is_list_end_line": true + }, + { + "bbox": [ + 133, + 200, + 505, + 213 + ], + "spans": [ + { + "bbox": [ + 133, + 200, + 505, + 213 + ], + "score": 1.0, + "content": "• Some common attributes get predicted more often regardless of the ground truth program:", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 212, + 470, + 224 + ], + "spans": [ + { + "bbox": [ + 141, + 212, + 180, + 224 + ], + "score": 1.0, + "content": "FILTER,", + "type": "text" + }, + { + "bbox": [ + 180, + 213, + 200, + 223 + ], + "score": 0.75, + "content": "( > 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 212, + 208, + 224 + ], + "score": 1.0, + "content": "),", + "type": "text" + }, + { + "bbox": [ + 209, + 213, + 230, + 223 + ], + "score": 0.75, + "content": "( < 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 212, + 240, + 224 + ], + "score": 1.0, + "content": ", (", + "type": "text" + }, + { + "bbox": [ + 240, + 213, + 274, + 223 + ], + "score": 0.82, + "content": "\\scriptstyle { \\frac { \\circ } { \\circ } } 2 = = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 274, + 212, + 287, + 224 + ], + "score": 1.0, + "content": "), (", + "type": "text" + }, + { + "bbox": [ + 287, + 213, + 320, + 223 + ], + "score": 0.84, + "content": "\\scriptstyle { \\frac { 0 } { \\circ } } 2 = = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 212, + 470, + 224 + ], + "score": 1.0, + "content": "), MIN, MAX, (+), (-), ZIPWITH.", + "type": "text" + } + ], + "index": 10, + "is_list_end_line": true + }, + { + "bbox": [ + 138, + 227, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 138, + 227, + 505, + 239 + ], + "score": 1.0, + "content": "There are some groups of lambdas that are more difficult for the network to distinguish", + "type": "text" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 237, + 399, + 250 + ], + "spans": [ + { + "bbox": [ + 141, + 237, + 175, + 250 + ], + "score": 1.0, + "content": "within:", + "type": "text" + }, + { + "bbox": [ + 175, + 239, + 190, + 249 + ], + "score": 0.77, + "content": "( + )", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 237, + 207, + 250 + ], + "score": 1.0, + "content": "vs", + "type": "text" + }, + { + "bbox": [ + 207, + 239, + 251, + 249 + ], + "score": 0.84, + "content": "( - ) ~ ; ~ ( + 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 237, + 268, + 250 + ], + "score": 1.0, + "content": "vs", + "type": "text" + }, + { + "bbox": [ + 268, + 239, + 317, + 250 + ], + "score": 0.7, + "content": "( - 1 ) \\ ; \\ ( \\ / 2 )", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 237, + 399, + 250 + ], + "score": 1.0, + "content": "vs (/3) vs (/4).", + "type": "text" + } + ], + "index": 12, + "is_list_end_line": true + }, + { + "bbox": [ + 132, + 253, + 505, + 265 + ], + "spans": [ + { + "bbox": [ + 132, + 253, + 232, + 265 + ], + "score": 1.0, + "content": "• When a program uses", + "type": "text" + }, + { + "bbox": [ + 232, + 254, + 259, + 264 + ], + "score": 0.89, + "content": "( \\star \\star 2 )", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 253, + 402, + 265 + ], + "score": 1.0, + "content": ", the network often thinks it’s using", + "type": "text" + }, + { + "bbox": [ + 403, + 254, + 418, + 264 + ], + "score": 0.63, + "content": "( \\star )", + "type": "inline_equation" + }, + { + "bbox": [ + 418, + 253, + 505, + 265 + ], + "score": 1.0, + "content": ", presumably because", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 264, + 313, + 276 + ], + "spans": [ + { + "bbox": [ + 141, + 264, + 313, + 276 + ], + "score": 1.0, + "content": "both can lead to large values in the output.", + "type": "text" + } + ], + "index": 14, + "is_list_end_line": true + } + ], + "index": 10.5, + "bbox_fs": [ + 132, + 174, + 505, + 276 + ] + }, + { + "type": "image", + "bbox": [ + 109, + 292, + 501, + 685 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 292, + 501, + 685 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 292, + 501, + 685 + ], + "spans": [ + { + "bbox": [ + 109, + 292, + 501, + 685 + ], + "score": 0.913, + "type": "image", + "image_path": "a2f6e1ddd3c6cc3aed7aca84775a0568e1abe730347297f96f96da4cfd262c8d.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 109, + 292, + 501, + 423.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 109, + 423.0, + 501, + 554.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 109, + 554.0, + 501, + 685.0 + ], + "spans": [], + "index": 17 + } + ] + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 106, + 695, + 504, + 718 + ], + "lines": [ + { + "bbox": [ + 106, + 695, + 506, + 708 + ], + "spans": [ + { + "bbox": [ + 106, + 695, + 416, + 708 + ], + "score": 1.0, + "content": "Figure 10: Conditional confusion matrix for the neural network and test set of", + "type": "text" + }, + { + "bbox": [ + 416, + 696, + 453, + 706 + ], + "score": 0.89, + "content": "P = 5 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 695, + 506, + 708 + ], + "score": 1.0, + "content": "programs of", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 705, + 340, + 718 + ], + "spans": [ + { + "bbox": [ + 106, + 705, + 133, + 718 + ], + "score": 1.0, + "content": "length", + "type": "text" + }, + { + "bbox": [ + 134, + 707, + 161, + 717 + ], + "score": 0.89, + "content": "T = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 705, + 340, + 718 + ], + "score": 1.0, + "content": ". The presentation is the same as in Figure 9.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 106, + 695, + 506, + 718 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/ByldLrqlx/ByldLrqlx_model.json b/parse/train/ByldLrqlx/ByldLrqlx_model.json new file mode 100644 index 0000000000000000000000000000000000000000..25ba4723abde1b9d0a2e51e15c3b1d5453ff0742 --- /dev/null +++ b/parse/train/ByldLrqlx/ByldLrqlx_model.json @@ -0,0 +1,47841 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 963, + 1405, + 963, + 1405, + 1329, + 298, + 1329 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 398, + 562, + 1303, + 562, + 1303, + 839, + 398, + 839 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1652, + 1404, + 1652, + 1404, + 1960, + 298, + 1960 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1453, + 1404, + 1453, + 1404, + 1637, + 299, + 1637 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1345, + 1404, + 1345, + 1404, + 1437, + 299, + 1437 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 768, + 320, + 1267, + 320, + 1267, + 413, + 768, + 413 + ], + "score": 0.941 + }, + { + "category_id": 0, + "poly": [ + 302, + 218, + 1273, + 218, + 1273, + 269, + 302, + 269 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 314, + 321, + 621, + 321, + 621, + 414, + 314, + 414 + ], + "score": 0.928 + }, + { + "category_id": 2, + "poly": [ + 296, + 1978, + 1401, + 1978, + 1401, + 2033, + 296, + 2033 + ], + "score": 0.923 + }, + { + "category_id": 0, + "poly": [ + 302, + 894, + 573, + 894, + 573, + 929, + 302, + 929 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 815, + 75, + 815, + 104, + 299, + 104 + ], + "score": 0.876 + }, + { + "category_id": 0, + "poly": [ + 773, + 495, + 926, + 495, + 926, + 528, + 773, + 528 + ], + "score": 0.842 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 856, + 2088, + 856, + 2112, + 840, + 2112 + ], + "score": 0.748 + }, + { + "category_id": 15, + "poly": [ + 294.0, + 215.0, + 1280.0, + 215.0, + 1280.0, + 277.0, + 294.0, + 277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1974.0, + 1405.0, + 1974.0, + 1405.0, + 2009.0, + 328.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2004.0, + 737.0, + 2004.0, + 737.0, + 2033.0, + 295.0, + 2033.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 891.0, + 579.0, + 891.0, + 579.0, + 938.0, + 294.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 817.0, + 72.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 494.0, + 932.0, + 494.0, + 932.0, + 531.0, + 769.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2087.0, + 859.0, + 2087.0, + 859.0, + 2117.0, + 839.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 962.0, + 1407.0, + 962.0, + 1407.0, + 999.0, + 292.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 994.0, + 1405.0, + 994.0, + 1405.0, + 1028.0, + 295.0, + 1028.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1025.0, + 1405.0, + 1025.0, + 1405.0, + 1059.0, + 293.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1055.0, + 1405.0, + 1055.0, + 1405.0, + 1089.0, + 293.0, + 1089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1084.0, + 1405.0, + 1084.0, + 1405.0, + 1121.0, + 292.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1116.0, + 1403.0, + 1116.0, + 1403.0, + 1150.0, + 293.0, + 1150.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1147.0, + 1405.0, + 1147.0, + 1405.0, + 1181.0, + 293.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1178.0, + 1405.0, + 1178.0, + 1405.0, + 1212.0, + 295.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1208.0, + 1408.0, + 1208.0, + 1408.0, + 1242.0, + 295.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1235.0, + 1405.0, + 1235.0, + 1405.0, + 1276.0, + 292.0, + 1276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1267.0, + 1403.0, + 1267.0, + 1403.0, + 1304.0, + 293.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1299.0, + 804.0, + 1299.0, + 804.0, + 1333.0, + 295.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 562.0, + 1308.0, + 562.0, + 1308.0, + 599.0, + 395.0, + 599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 593.0, + 1308.0, + 593.0, + 1308.0, + 630.0, + 393.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 624.0, + 1305.0, + 624.0, + 1305.0, + 658.0, + 394.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 652.0, + 1306.0, + 652.0, + 1306.0, + 691.0, + 392.0, + 691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 683.0, + 1307.0, + 683.0, + 1307.0, + 720.0, + 392.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 715.0, + 1307.0, + 715.0, + 1307.0, + 752.0, + 394.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 747.0, + 1305.0, + 747.0, + 1305.0, + 780.0, + 395.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 774.0, + 1305.0, + 774.0, + 1305.0, + 813.0, + 393.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 808.0, + 1251.0, + 808.0, + 1251.0, + 844.0, + 393.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1653.0, + 1405.0, + 1653.0, + 1405.0, + 1689.0, + 294.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1682.0, + 1404.0, + 1682.0, + 1404.0, + 1718.0, + 294.0, + 1718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1715.0, + 1404.0, + 1715.0, + 1404.0, + 1747.0, + 294.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1744.0, + 1404.0, + 1744.0, + 1404.0, + 1781.0, + 293.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1775.0, + 1405.0, + 1775.0, + 1405.0, + 1811.0, + 293.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1806.0, + 1406.0, + 1806.0, + 1406.0, + 1839.0, + 293.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1835.0, + 1406.0, + 1835.0, + 1406.0, + 1870.0, + 293.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1866.0, + 1407.0, + 1866.0, + 1407.0, + 1902.0, + 292.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1895.0, + 1406.0, + 1895.0, + 1406.0, + 1934.0, + 293.0, + 1934.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1927.0, + 1404.0, + 1927.0, + 1404.0, + 1964.0, + 293.0, + 1964.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1452.0, + 1409.0, + 1452.0, + 1409.0, + 1488.0, + 294.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1483.0, + 1406.0, + 1483.0, + 1406.0, + 1520.0, + 293.0, + 1520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1515.0, + 1409.0, + 1515.0, + 1409.0, + 1550.0, + 294.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1546.0, + 1408.0, + 1546.0, + 1408.0, + 1579.0, + 294.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1575.0, + 1406.0, + 1575.0, + 1406.0, + 1611.0, + 294.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1606.0, + 1305.0, + 1606.0, + 1305.0, + 1641.0, + 295.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1344.0, + 1405.0, + 1344.0, + 1405.0, + 1381.0, + 293.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1377.0, + 1405.0, + 1377.0, + 1405.0, + 1413.0, + 293.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1407.0, + 1233.0, + 1407.0, + 1233.0, + 1440.0, + 295.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 318.0, + 1270.0, + 318.0, + 1270.0, + 355.0, + 765.0, + 355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 764.0, + 348.0, + 1178.0, + 348.0, + 1178.0, + 387.0, + 764.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 767.0, + 384.0, + 992.0, + 384.0, + 992.0, + 413.0, + 767.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 317.0, + 477.0, + 317.0, + 477.0, + 359.0, + 309.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 348.0, + 625.0, + 348.0, + 625.0, + 390.0, + 309.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 377.0, + 597.0, + 377.0, + 597.0, + 421.0, + 311.0, + 421.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1081, + 1406, + 1081, + 1406, + 1448, + 298, + 1448 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 865, + 1404, + 865, + 1404, + 1050, + 298, + 1050 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1651, + 1403, + 1651, + 1403, + 1805, + 298, + 1805 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1819, + 1403, + 1819, + 1403, + 2033, + 298, + 2033 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1482, + 1404, + 1482, + 1404, + 1636, + 298, + 1636 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 362, + 393, + 1405, + 393, + 1405, + 599, + 362, + 599 + ], + "score": 0.958 + }, + { + "category_id": 1, + "poly": [ + 303, + 709, + 1400, + 709, + 1400, + 774, + 303, + 774 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 296, + 230, + 1403, + 230, + 1403, + 293, + 296, + 293 + ], + "score": 0.947 + }, + { + "category_id": 1, + "poly": [ + 301, + 787, + 1398, + 787, + 1398, + 850, + 301, + 850 + ], + "score": 0.942 + }, + { + "category_id": 1, + "poly": [ + 295, + 308, + 1403, + 308, + 1403, + 371, + 295, + 371 + ], + "score": 0.941 + }, + { + "category_id": 0, + "poly": [ + 299, + 642, + 1100, + 642, + 1100, + 678, + 299, + 678 + ], + "score": 0.928 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.903 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.72 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.097 + }, + { + "category_id": 13, + "poly": [ + 672, + 1915, + 744, + 1915, + 744, + 1944, + 672, + 1944 + ], + "score": 0.91, + "latex": "x < y" + }, + { + "category_id": 13, + "poly": [ + 793, + 1913, + 912, + 1913, + 912, + 1944, + 793, + 1944 + ], + "score": 0.9, + "latex": "y < - 1 0 0" + }, + { + "category_id": 13, + "poly": [ + 907, + 1206, + 962, + 1206, + 962, + 1234, + 907, + 1234 + ], + "score": 0.86, + "latex": "\\mathrm { C } { + + }" + }, + { + "category_id": 13, + "poly": [ + 543, + 1918, + 563, + 1918, + 563, + 1944, + 543, + 1944 + ], + "score": 0.54, + "latex": "y" + }, + { + "category_id": 13, + "poly": [ + 514, + 1918, + 533, + 1918, + 533, + 1940, + 514, + 1940 + ], + "score": 0.33, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 513, + 1917, + 563, + 1917, + 563, + 1944, + 513, + 1944 + ], + "score": 0.26, + "latex": "x , y" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 639.0, + 1105.0, + 639.0, + 1105.0, + 682.0, + 292.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2120.0, + 839.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2120.0, + 838.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1080.0, + 1407.0, + 1080.0, + 1407.0, + 1120.0, + 293.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1112.0, + 1407.0, + 1112.0, + 1407.0, + 1150.0, + 295.0, + 1150.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1144.0, + 1404.0, + 1144.0, + 1404.0, + 1178.0, + 295.0, + 1178.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1172.0, + 1406.0, + 1172.0, + 1406.0, + 1213.0, + 292.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1204.0, + 906.0, + 1204.0, + 906.0, + 1241.0, + 292.0, + 1241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 963.0, + 1204.0, + 1406.0, + 1204.0, + 1406.0, + 1241.0, + 963.0, + 1241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1235.0, + 1407.0, + 1235.0, + 1407.0, + 1271.0, + 292.0, + 1271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1267.0, + 1407.0, + 1267.0, + 1407.0, + 1301.0, + 295.0, + 1301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1296.0, + 1406.0, + 1296.0, + 1406.0, + 1330.0, + 293.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1327.0, + 1404.0, + 1327.0, + 1404.0, + 1361.0, + 295.0, + 1361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1356.0, + 1407.0, + 1356.0, + 1407.0, + 1392.0, + 292.0, + 1392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1389.0, + 1404.0, + 1389.0, + 1404.0, + 1423.0, + 295.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1420.0, + 1341.0, + 1420.0, + 1341.0, + 1451.0, + 295.0, + 1451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 865.0, + 1406.0, + 865.0, + 1406.0, + 900.0, + 294.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 896.0, + 1406.0, + 896.0, + 1406.0, + 929.0, + 292.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 928.0, + 1401.0, + 928.0, + 1401.0, + 960.0, + 294.0, + 960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 956.0, + 1406.0, + 956.0, + 1406.0, + 994.0, + 292.0, + 994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 987.0, + 1405.0, + 987.0, + 1405.0, + 1022.0, + 294.0, + 1022.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1015.0, + 1322.0, + 1015.0, + 1322.0, + 1058.0, + 292.0, + 1058.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1650.0, + 1404.0, + 1650.0, + 1404.0, + 1686.0, + 294.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1682.0, + 1404.0, + 1682.0, + 1404.0, + 1715.0, + 296.0, + 1715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1711.0, + 1407.0, + 1711.0, + 1407.0, + 1749.0, + 293.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1739.0, + 1407.0, + 1739.0, + 1407.0, + 1782.0, + 292.0, + 1782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1772.0, + 1033.0, + 1772.0, + 1033.0, + 1811.0, + 293.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1821.0, + 1404.0, + 1821.0, + 1404.0, + 1855.0, + 294.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1849.0, + 1405.0, + 1849.0, + 1405.0, + 1886.0, + 293.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1882.0, + 1405.0, + 1882.0, + 1405.0, + 1916.0, + 296.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1909.0, + 512.0, + 1909.0, + 512.0, + 1951.0, + 292.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 564.0, + 1909.0, + 671.0, + 1909.0, + 671.0, + 1951.0, + 564.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 745.0, + 1909.0, + 792.0, + 1909.0, + 792.0, + 1951.0, + 745.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 913.0, + 1909.0, + 1407.0, + 1909.0, + 1407.0, + 1951.0, + 913.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1942.0, + 1407.0, + 1942.0, + 1407.0, + 1979.0, + 293.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1971.0, + 1409.0, + 1971.0, + 1409.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2000.0, + 1405.0, + 2000.0, + 1405.0, + 2039.0, + 293.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1480.0, + 1408.0, + 1480.0, + 1408.0, + 1518.0, + 293.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1513.0, + 1406.0, + 1513.0, + 1406.0, + 1550.0, + 294.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1542.0, + 1404.0, + 1542.0, + 1404.0, + 1579.0, + 294.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1574.0, + 1405.0, + 1574.0, + 1405.0, + 1611.0, + 294.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1603.0, + 1360.0, + 1603.0, + 1360.0, + 1644.0, + 293.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 360.0, + 392.0, + 1407.0, + 392.0, + 1407.0, + 431.0, + 360.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 427.0, + 1406.0, + 427.0, + 1406.0, + 460.0, + 394.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 460.0, + 1263.0, + 460.0, + 1263.0, + 504.0, + 355.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 504.0, + 1405.0, + 504.0, + 1405.0, + 541.0, + 358.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 538.0, + 1405.0, + 538.0, + 1405.0, + 571.0, + 394.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 567.0, + 1215.0, + 567.0, + 1215.0, + 602.0, + 394.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 709.0, + 1405.0, + 709.0, + 1405.0, + 745.0, + 298.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 739.0, + 1237.0, + 739.0, + 1237.0, + 779.0, + 295.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 1406.0, + 227.0, + 1406.0, + 268.0, + 294.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 259.0, + 837.0, + 259.0, + 837.0, + 296.0, + 295.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 784.0, + 1401.0, + 784.0, + 1401.0, + 826.0, + 295.0, + 826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 816.0, + 1043.0, + 816.0, + 1043.0, + 855.0, + 293.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 306.0, + 1405.0, + 306.0, + 1405.0, + 343.0, + 294.0, + 343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 338.0, + 1408.0, + 338.0, + 1408.0, + 374.0, + 294.0, + 374.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1045, + 1404, + 1045, + 1404, + 1353, + 298, + 1353 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 526, + 1405, + 526, + 1405, + 711, + 298, + 711 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 827, + 1405, + 827, + 1405, + 1012, + 298, + 1012 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1557, + 1405, + 1557, + 1405, + 1717, + 298, + 1717 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1752, + 1405, + 1752, + 1405, + 1937, + 298, + 1937 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1368, + 1404, + 1368, + 1404, + 1522, + 298, + 1522 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 368, + 1403, + 368, + 1403, + 492, + 297, + 492 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1403, + 229, + 1403, + 352, + 298, + 352 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 296, + 1972, + 1399, + 1972, + 1399, + 2034, + 296, + 2034 + ], + "score": 0.945 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 814, + 76, + 814, + 104, + 300, + 104 + ], + "score": 0.896 + }, + { + "category_id": 0, + "poly": [ + 300, + 756, + 1108, + 756, + 1108, + 792, + 300, + 792 + ], + "score": 0.865 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.588 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.458 + }, + { + "category_id": 13, + "poly": [ + 407, + 2002, + 502, + 2002, + 502, + 2037, + 407, + 2037 + ], + "score": 0.93, + "latex": "q ( \\pmb { a } \\mid \\mathcal { E } )" + }, + { + "category_id": 13, + "poly": [ + 541, + 1230, + 635, + 1230, + 635, + 1264, + 541, + 1264 + ], + "score": 0.92, + "latex": "q ( \\pmb { a } \\mid \\mathcal { E } )" + }, + { + "category_id": 13, + "poly": [ + 821, + 1260, + 965, + 1260, + 965, + 1294, + 821, + 1294 + ], + "score": 0.92, + "latex": "q ( { \\bar { \\mathcal { A } } } ( { \\bar { P } } ) \\mid \\varepsilon )" + }, + { + "category_id": 13, + "poly": [ + 1268, + 1138, + 1398, + 1138, + 1398, + 1172, + 1268, + 1172 + ], + "score": 0.92, + "latex": "\\mathbf { \\boldsymbol { a } } \\overset { \\cdot } { = } \\mathbf { \\bar { A } } ( \\mathbf { \\boldsymbol { P } } )" + }, + { + "category_id": 13, + "poly": [ + 658, + 1591, + 709, + 1591, + 709, + 1623, + 658, + 1623 + ], + "score": 0.92, + "latex": "\\mathbf { \\pmb { a } } ^ { ( n ) }" + }, + { + "category_id": 13, + "poly": [ + 715, + 1783, + 810, + 1783, + 810, + 1817, + 715, + 1817 + ], + "score": 0.92, + "latex": "q ( \\pmb { a } \\mid \\mathcal { E } )" + }, + { + "category_id": 13, + "poly": [ + 910, + 1556, + 1172, + 1556, + 1172, + 1595, + 910, + 1595 + ], + "score": 0.91, + "latex": "( ( P ^ { ( n ) } , \\pmb { a } ^ { ( n ) } , \\pmb { \\mathcal { E } } ^ { ( n ) } ) ) _ { n = 1 } ^ { N }" + }, + { + "category_id": 13, + "poly": [ + 1195, + 1591, + 1246, + 1591, + 1246, + 1623, + 1195, + 1623 + ], + "score": 0.89, + "latex": "{ \\mathcal { E } } ^ { ( n ) }" + }, + { + "category_id": 13, + "poly": [ + 1315, + 1557, + 1371, + 1557, + 1371, + 1588, + 1315, + 1588 + ], + "score": 0.89, + "latex": "P ^ { ( n ) }" + }, + { + "category_id": 13, + "poly": [ + 634, + 1263, + 659, + 1263, + 659, + 1288, + 634, + 1288 + ], + "score": 0.84, + "latex": "P" + }, + { + "category_id": 13, + "poly": [ + 805, + 1140, + 831, + 1140, + 831, + 1166, + 805, + 1166 + ], + "score": 0.82, + "latex": "P" + }, + { + "category_id": 13, + "poly": [ + 718, + 1231, + 739, + 1231, + 739, + 1258, + 718, + 1258 + ], + "score": 0.8, + "latex": "\\mathcal { E }" + }, + { + "category_id": 13, + "poly": [ + 783, + 1817, + 802, + 1817, + 802, + 1842, + 783, + 1842 + ], + "score": 0.79, + "latex": "\\mathcal { E }" + }, + { + "category_id": 13, + "poly": [ + 1376, + 1431, + 1401, + 1431, + 1401, + 1457, + 1376, + 1457 + ], + "score": 0.74, + "latex": "\\mathcal { A }" + }, + { + "category_id": 13, + "poly": [ + 540, + 1140, + 566, + 1140, + 566, + 1167, + 540, + 1167 + ], + "score": 0.7, + "latex": "\\mathcal { A }" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 754.0, + 1110.0, + 754.0, + 1110.0, + 800.0, + 291.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 860.0, + 2085.0, + 860.0, + 2116.0, + 839.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1045.0, + 1405.0, + 1045.0, + 1405.0, + 1083.0, + 293.0, + 1083.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1078.0, + 1406.0, + 1078.0, + 1406.0, + 1111.0, + 294.0, + 1111.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1107.0, + 1406.0, + 1107.0, + 1406.0, + 1143.0, + 293.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1139.0, + 539.0, + 1139.0, + 539.0, + 1172.0, + 292.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 567.0, + 1139.0, + 804.0, + 1139.0, + 804.0, + 1172.0, + 567.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 1139.0, + 1267.0, + 1139.0, + 1267.0, + 1172.0, + 832.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 1139.0, + 1407.0, + 1139.0, + 1407.0, + 1172.0, + 1399.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1168.0, + 1408.0, + 1168.0, + 1408.0, + 1204.0, + 294.0, + 1204.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1199.0, + 1406.0, + 1199.0, + 1406.0, + 1235.0, + 294.0, + 1235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1230.0, + 540.0, + 1230.0, + 540.0, + 1265.0, + 294.0, + 1265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 636.0, + 1230.0, + 717.0, + 1230.0, + 717.0, + 1265.0, + 636.0, + 1265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 1230.0, + 1405.0, + 1230.0, + 1405.0, + 1265.0, + 740.0, + 1265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1259.0, + 633.0, + 1259.0, + 633.0, + 1295.0, + 293.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 660.0, + 1259.0, + 820.0, + 1259.0, + 820.0, + 1295.0, + 660.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 966.0, + 1259.0, + 1404.0, + 1259.0, + 1404.0, + 1295.0, + 966.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1291.0, + 1405.0, + 1291.0, + 1405.0, + 1327.0, + 294.0, + 1327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1321.0, + 671.0, + 1321.0, + 671.0, + 1356.0, + 295.0, + 1356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 524.0, + 1406.0, + 524.0, + 1406.0, + 564.0, + 295.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 556.0, + 1407.0, + 556.0, + 1407.0, + 592.0, + 295.0, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 588.0, + 1405.0, + 588.0, + 1405.0, + 624.0, + 293.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 616.0, + 1405.0, + 616.0, + 1405.0, + 654.0, + 292.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 649.0, + 1406.0, + 649.0, + 1406.0, + 685.0, + 292.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 678.0, + 1393.0, + 678.0, + 1393.0, + 716.0, + 293.0, + 716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 821.0, + 1406.0, + 821.0, + 1406.0, + 867.0, + 291.0, + 867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 860.0, + 1403.0, + 860.0, + 1403.0, + 892.0, + 295.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 886.0, + 1408.0, + 886.0, + 1408.0, + 925.0, + 292.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 919.0, + 1405.0, + 919.0, + 1405.0, + 955.0, + 295.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 949.0, + 1406.0, + 949.0, + 1406.0, + 984.0, + 295.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 978.0, + 1410.0, + 978.0, + 1410.0, + 1015.0, + 293.0, + 1015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1546.0, + 909.0, + 1546.0, + 909.0, + 1606.0, + 289.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1173.0, + 1546.0, + 1314.0, + 1546.0, + 1314.0, + 1606.0, + 1173.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1372.0, + 1546.0, + 1411.0, + 1546.0, + 1411.0, + 1606.0, + 1372.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1584.0, + 657.0, + 1584.0, + 657.0, + 1634.0, + 291.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 710.0, + 1584.0, + 1194.0, + 1584.0, + 1194.0, + 1634.0, + 710.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1584.0, + 1410.0, + 1584.0, + 1410.0, + 1634.0, + 1247.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1622.0, + 1406.0, + 1622.0, + 1406.0, + 1664.0, + 293.0, + 1664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1653.0, + 1405.0, + 1653.0, + 1405.0, + 1690.0, + 293.0, + 1690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1682.0, + 1234.0, + 1682.0, + 1234.0, + 1722.0, + 292.0, + 1722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1750.0, + 1410.0, + 1750.0, + 1410.0, + 1789.0, + 293.0, + 1789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1783.0, + 714.0, + 1783.0, + 714.0, + 1819.0, + 295.0, + 1819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 1783.0, + 1408.0, + 1783.0, + 1408.0, + 1819.0, + 811.0, + 1819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1815.0, + 782.0, + 1815.0, + 782.0, + 1847.0, + 295.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 803.0, + 1815.0, + 1405.0, + 1815.0, + 1405.0, + 1847.0, + 803.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1844.0, + 1405.0, + 1844.0, + 1405.0, + 1880.0, + 293.0, + 1880.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1876.0, + 1403.0, + 1876.0, + 1403.0, + 1908.0, + 296.0, + 1908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1906.0, + 1403.0, + 1906.0, + 1403.0, + 1941.0, + 295.0, + 1941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1366.0, + 1404.0, + 1366.0, + 1404.0, + 1404.0, + 292.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1399.0, + 1404.0, + 1399.0, + 1404.0, + 1432.0, + 294.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1428.0, + 1375.0, + 1428.0, + 1375.0, + 1466.0, + 292.0, + 1466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1428.0, + 1406.0, + 1428.0, + 1406.0, + 1466.0, + 1402.0, + 1466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1457.0, + 1406.0, + 1457.0, + 1406.0, + 1495.0, + 292.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1490.0, + 1382.0, + 1490.0, + 1382.0, + 1526.0, + 293.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 366.0, + 1407.0, + 366.0, + 1407.0, + 404.0, + 292.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 397.0, + 1405.0, + 397.0, + 1405.0, + 435.0, + 292.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 429.0, + 1405.0, + 429.0, + 1405.0, + 465.0, + 292.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 460.0, + 1358.0, + 460.0, + 1358.0, + 496.0, + 293.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 230.0, + 1408.0, + 230.0, + 1408.0, + 265.0, + 292.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 260.0, + 1405.0, + 260.0, + 1405.0, + 296.0, + 294.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 292.0, + 1404.0, + 292.0, + 1404.0, + 328.0, + 294.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 323.0, + 982.0, + 323.0, + 982.0, + 356.0, + 294.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1969.0, + 1405.0, + 1969.0, + 1405.0, + 2008.0, + 295.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2002.0, + 406.0, + 2002.0, + 406.0, + 2037.0, + 294.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 503.0, + 2002.0, + 1310.0, + 2002.0, + 1310.0, + 2037.0, + 503.0, + 2037.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1537, + 1405, + 1537, + 1405, + 1814, + 297, + 1814 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1086, + 1408, + 1086, + 1408, + 1301, + 297, + 1301 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 458, + 1403, + 458, + 1403, + 580, + 298, + 580 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 595, + 1405, + 595, + 1405, + 781, + 297, + 781 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1316, + 1404, + 1316, + 1404, + 1440, + 298, + 1440 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 1911, + 1404, + 1911, + 1404, + 2034, + 299, + 2034 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 300, + 296, + 1406, + 296, + 1406, + 360, + 300, + 360 + ], + "score": 0.951 + }, + { + "category_id": 0, + "poly": [ + 299, + 225, + 532, + 225, + 532, + 262, + 299, + 262 + ], + "score": 0.913 + }, + { + "category_id": 0, + "poly": [ + 300, + 1479, + 597, + 1479, + 597, + 1511, + 300, + 1511 + ], + "score": 0.906 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.895 + }, + { + "category_id": 0, + "poly": [ + 301, + 1852, + 714, + 1852, + 714, + 1884, + 301, + 1884 + ], + "score": 0.892 + }, + { + "category_id": 0, + "poly": [ + 297, + 399, + 944, + 399, + 944, + 431, + 297, + 431 + ], + "score": 0.834 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 857, + 2089, + 857, + 2111, + 840, + 2111 + ], + "score": 0.768 + }, + { + "category_id": 3, + "poly": [ + 299, + 810, + 1431, + 810, + 1431, + 980, + 299, + 980 + ], + "score": 0.693 + }, + { + "category_id": 4, + "poly": [ + 365, + 1001, + 1331, + 1001, + 1331, + 1035, + 365, + 1035 + ], + "score": 0.591 + }, + { + "category_id": 6, + "poly": [ + 365, + 1001, + 1331, + 1001, + 1331, + 1035, + 365, + 1035 + ], + "score": 0.381 + }, + { + "category_id": 5, + "poly": [ + 299, + 810, + 1431, + 810, + 1431, + 980, + 299, + 980 + ], + "score": 0.32, + "html": "
a←[int]An input-output example:
b ←FILTER(<O)aInput:
C ←MAP(*4)b[-17,-3,4,11,0,-5,-9,13,6,6,-8,11]
d ← SORT ce←REVERSE dOutput: [-12,-20,-32,-36,-68]
" + }, + { + "category_id": 13, + "poly": [ + 1084, + 749, + 1160, + 749, + 1160, + 777, + 1084, + 777 + ], + "score": 0.89, + "latex": "T = 4" + }, + { + "category_id": 13, + "poly": [ + 312, + 1242, + 400, + 1242, + 400, + 1269, + 312, + 1269 + ], + "score": 0.88, + "latex": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 1" + }, + { + "category_id": 13, + "poly": [ + 463, + 1211, + 521, + 1211, + 521, + 1240, + 463, + 1240 + ], + "score": 0.83, + "latex": "( \\star 4 )" + }, + { + "category_id": 13, + "poly": [ + 1293, + 1212, + 1383, + 1212, + 1383, + 1239, + 1293, + 1239 + ], + "score": 0.83, + "latex": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 0" + }, + { + "category_id": 13, + "poly": [ + 302, + 1212, + 359, + 1212, + 359, + 1240, + 302, + 1240 + ], + "score": 0.8, + "latex": "( \\star 3 )" + }, + { + "category_id": 13, + "poly": [ + 1127, + 1212, + 1179, + 1212, + 1179, + 1240, + 1127, + 1240 + ], + "score": 0.74, + "latex": "( > 0 )" + }, + { + "category_id": 13, + "poly": [ + 1203, + 1212, + 1259, + 1212, + 1259, + 1240, + 1203, + 1240 + ], + "score": 0.7, + "latex": "( < 0 )" + }, + { + "category_id": 13, + "poly": [ + 1030, + 1180, + 1088, + 1180, + 1088, + 1209, + 1030, + 1209 + ], + "score": 0.69, + "latex": "( \\star 2 )" + }, + { + "category_id": 13, + "poly": [ + 872, + 1181, + 930, + 1181, + 930, + 1209, + 872, + 1209 + ], + "score": 0.68, + "latex": "( + 1 )" + }, + { + "category_id": 13, + "poly": [ + 1317, + 1180, + 1392, + 1180, + 1392, + 1209, + 1317, + 1209 + ], + "score": 0.63, + "latex": "( \\star \\star 2 )" + }, + { + "category_id": 13, + "poly": [ + 1084, + 1242, + 1261, + 1242, + 1261, + 1271, + 1084, + 1271 + ], + "score": 0.42, + "latex": "( + ) , ( - ) , ( \\star ) ," + }, + { + "category_id": 13, + "poly": [ + 951, + 1181, + 1008, + 1181, + 1008, + 1209, + 951, + 1209 + ], + "score": 0.39, + "latex": "( - 1 )" + }, + { + "category_id": 13, + "poly": [ + 382, + 1210, + 439, + 1210, + 439, + 1240, + 382, + 1240 + ], + "score": 0.37, + "latex": "( / 3 )" + }, + { + "category_id": 13, + "poly": [ + 1210, + 1242, + 1253, + 1242, + 1253, + 1270, + 1210, + 1270 + ], + "score": 0.36, + "latex": "( \\star )" + }, + { + "category_id": 13, + "poly": [ + 312, + 854, + 371, + 854, + 371, + 878, + 312, + 878 + ], + "score": 0.36, + "latex": "\\ u \\text b \\gets" + }, + { + "category_id": 13, + "poly": [ + 1190, + 1180, + 1293, + 1180, + 1293, + 1209, + 1190, + 1209 + ], + "score": 0.34, + "latex": "( \\star \\ ( - 1 ) \\ )" + }, + { + "category_id": 13, + "poly": [ + 1109, + 1180, + 1164, + 1180, + 1164, + 1209, + 1109, + 1209 + ], + "score": 0.32, + "latex": "( / 2 )" + }, + { + "category_id": 13, + "poly": [ + 543, + 1211, + 600, + 1211, + 600, + 1240, + 543, + 1240 + ], + "score": 0.3, + "latex": "( / 4 )" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 220.0, + 538.0, + 220.0, + 538.0, + 267.0, + 291.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1479.0, + 602.0, + 1479.0, + 602.0, + 1515.0, + 294.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1849.0, + 720.0, + 1849.0, + 720.0, + 1888.0, + 294.0, + 1888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 399.0, + 946.0, + 399.0, + 946.0, + 435.0, + 295.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 818.0, + 462.0, + 818.0, + 462.0, + 853.0, + 307.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 814.0, + 958.0, + 814.0, + 958.0, + 854.0, + 638.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 845.0, + 311.0, + 845.0, + 311.0, + 883.0, + 306.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 845.0, + 562.0, + 845.0, + 562.0, + 883.0, + 372.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 845.0, + 722.0, + 845.0, + 722.0, + 886.0, + 638.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 879.0, + 535.0, + 879.0, + 535.0, + 914.0, + 308.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 639.0, + 877.0, + 1394.0, + 877.0, + 1394.0, + 914.0, + 639.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 906.0, + 473.0, + 906.0, + 473.0, + 945.0, + 307.0, + 945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 905.0, + 740.0, + 905.0, + 740.0, + 946.0, + 640.0, + 946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 940.0, + 517.0, + 940.0, + 517.0, + 975.0, + 307.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 642.0, + 937.0, + 1064.0, + 937.0, + 1064.0, + 976.0, + 642.0, + 976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 999.0, + 1333.0, + 999.0, + 1333.0, + 1039.0, + 364.0, + 1039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 999.0, + 1333.0, + 999.0, + 1333.0, + 1039.0, + 364.0, + 1039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1538.0, + 1405.0, + 1538.0, + 1405.0, + 1575.0, + 295.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1566.0, + 1408.0, + 1566.0, + 1408.0, + 1607.0, + 292.0, + 1607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1601.0, + 1405.0, + 1601.0, + 1405.0, + 1634.0, + 295.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1626.0, + 1408.0, + 1626.0, + 1408.0, + 1669.0, + 292.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1661.0, + 1405.0, + 1661.0, + 1405.0, + 1694.0, + 295.0, + 1694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1690.0, + 1405.0, + 1690.0, + 1405.0, + 1725.0, + 294.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1720.0, + 1405.0, + 1720.0, + 1405.0, + 1757.0, + 294.0, + 1757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1750.0, + 1405.0, + 1750.0, + 1405.0, + 1788.0, + 292.0, + 1788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1782.0, + 1400.0, + 1782.0, + 1400.0, + 1818.0, + 295.0, + 1818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1085.0, + 1408.0, + 1085.0, + 1408.0, + 1122.0, + 295.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1117.0, + 1410.0, + 1117.0, + 1410.0, + 1152.0, + 294.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1147.0, + 1406.0, + 1147.0, + 1406.0, + 1182.0, + 294.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1179.0, + 871.0, + 1179.0, + 871.0, + 1213.0, + 295.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 931.0, + 1179.0, + 950.0, + 1179.0, + 950.0, + 1213.0, + 931.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1179.0, + 1029.0, + 1179.0, + 1029.0, + 1213.0, + 1009.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1089.0, + 1179.0, + 1108.0, + 1179.0, + 1108.0, + 1213.0, + 1089.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1165.0, + 1179.0, + 1189.0, + 1179.0, + 1189.0, + 1213.0, + 1165.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1294.0, + 1179.0, + 1316.0, + 1179.0, + 1316.0, + 1213.0, + 1294.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1393.0, + 1179.0, + 1410.0, + 1179.0, + 1410.0, + 1213.0, + 1393.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1207.0, + 301.0, + 1207.0, + 301.0, + 1246.0, + 296.0, + 1246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 360.0, + 1207.0, + 381.0, + 1207.0, + 381.0, + 1246.0, + 360.0, + 1246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.0, + 1207.0, + 462.0, + 1207.0, + 462.0, + 1246.0, + 440.0, + 1246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 522.0, + 1207.0, + 542.0, + 1207.0, + 542.0, + 1246.0, + 522.0, + 1246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 1207.0, + 1126.0, + 1207.0, + 1126.0, + 1246.0, + 601.0, + 1246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1180.0, + 1207.0, + 1202.0, + 1207.0, + 1202.0, + 1246.0, + 1180.0, + 1246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1260.0, + 1207.0, + 1292.0, + 1207.0, + 1292.0, + 1246.0, + 1260.0, + 1246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1384.0, + 1207.0, + 1410.0, + 1207.0, + 1410.0, + 1246.0, + 1384.0, + 1246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1240.0, + 311.0, + 1240.0, + 311.0, + 1275.0, + 297.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 1240.0, + 1083.0, + 1240.0, + 1083.0, + 1275.0, + 401.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1262.0, + 1240.0, + 1411.0, + 1240.0, + 1411.0, + 1275.0, + 1262.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1270.0, + 1120.0, + 1270.0, + 1120.0, + 1304.0, + 294.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 459.0, + 1404.0, + 459.0, + 1404.0, + 491.0, + 294.0, + 491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 488.0, + 1406.0, + 488.0, + 1406.0, + 522.0, + 292.0, + 522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 519.0, + 1405.0, + 519.0, + 1405.0, + 555.0, + 294.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 550.0, + 1309.0, + 550.0, + 1309.0, + 583.0, + 296.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 594.0, + 1408.0, + 594.0, + 1408.0, + 632.0, + 294.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 625.0, + 1407.0, + 625.0, + 1407.0, + 661.0, + 294.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 656.0, + 1407.0, + 656.0, + 1407.0, + 692.0, + 292.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 688.0, + 1405.0, + 688.0, + 1405.0, + 722.0, + 294.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 719.0, + 1406.0, + 719.0, + 1406.0, + 752.0, + 294.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 748.0, + 1083.0, + 748.0, + 1083.0, + 784.0, + 295.0, + 784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1161.0, + 748.0, + 1301.0, + 748.0, + 1301.0, + 784.0, + 1161.0, + 784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1314.0, + 1404.0, + 1314.0, + 1404.0, + 1351.0, + 292.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1345.0, + 1405.0, + 1345.0, + 1405.0, + 1383.0, + 293.0, + 1383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1376.0, + 1404.0, + 1376.0, + 1404.0, + 1415.0, + 293.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1410.0, + 842.0, + 1410.0, + 842.0, + 1442.0, + 294.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1909.0, + 1409.0, + 1909.0, + 1409.0, + 1947.0, + 293.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1940.0, + 1405.0, + 1940.0, + 1405.0, + 1978.0, + 293.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1972.0, + 1408.0, + 1972.0, + 1408.0, + 2009.0, + 294.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2004.0, + 1407.0, + 2004.0, + 1407.0, + 2036.0, + 293.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 295.0, + 1402.0, + 295.0, + 1402.0, + 331.0, + 296.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 325.0, + 1386.0, + 325.0, + 1386.0, + 368.0, + 295.0, + 368.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 474, + 1405, + 474, + 1405, + 782, + 298, + 782 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1754, + 1404, + 1754, + 1404, + 1939, + 298, + 1939 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 933, + 1403, + 933, + 1403, + 1150, + 297, + 1150 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1597, + 1404, + 1597, + 1404, + 1722, + 298, + 1722 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 299, + 1473, + 1405, + 1473, + 1405, + 1565, + 299, + 1565 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 299, + 795, + 1405, + 795, + 1405, + 918, + 299, + 918 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 294, + 229, + 1403, + 229, + 1403, + 293, + 294, + 293 + ], + "score": 0.948 + }, + { + "category_id": 3, + "poly": [ + 310, + 1188, + 1389, + 1188, + 1389, + 1295, + 310, + 1295 + ], + "score": 0.948 + }, + { + "category_id": 1, + "poly": [ + 297, + 1971, + 1402, + 1971, + 1402, + 2034, + 297, + 2034 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 362, + 317, + 1404, + 317, + 1404, + 451, + 362, + 451 + ], + "score": 0.932 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.899 + }, + { + "category_id": 0, + "poly": [ + 298, + 1416, + 466, + 1416, + 466, + 1447, + 298, + 1447 + ], + "score": 0.89 + }, + { + "category_id": 4, + "poly": [ + 306, + 1328, + 1381, + 1328, + 1381, + 1363, + 306, + 1363 + ], + "score": 0.863 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.724 + }, + { + "category_id": 13, + "poly": [ + 1163, + 996, + 1243, + 996, + 1243, + 1025, + 1163, + 1025 + ], + "score": 0.9, + "latex": "C \\times K" + }, + { + "category_id": 13, + "poly": [ + 931, + 659, + 1011, + 659, + 1011, + 687, + 931, + 687 + ], + "score": 0.9, + "latex": "H = 3" + }, + { + "category_id": 13, + "poly": [ + 297, + 1026, + 391, + 1026, + 391, + 1055, + 297, + 1055 + ], + "score": 0.9, + "latex": "C = 3 4" + }, + { + "category_id": 13, + "poly": [ + 726, + 567, + 818, + 567, + 818, + 595, + 726, + 595 + ], + "score": 0.89, + "latex": "E = 2 0" + }, + { + "category_id": 13, + "poly": [ + 1295, + 659, + 1402, + 659, + 1402, + 688, + 1295, + 688 + ], + "score": 0.87, + "latex": "K = 2 5 6" + }, + { + "category_id": 13, + "poly": [ + 729, + 1058, + 754, + 1058, + 754, + 1085, + 729, + 1085 + ], + "score": 0.81, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 1298, + 390, + 1331, + 390, + 1331, + 416, + 1298, + 416 + ], + "score": 0.8, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 963, + 318, + 996, + 318, + 996, + 345, + 963, + 345 + ], + "score": 0.78, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 823, + 829, + 845, + 829, + 845, + 855, + 823, + 855 + ], + "score": 0.78, + "latex": "L" + }, + { + "category_id": 13, + "poly": [ + 557, + 1631, + 582, + 1631, + 582, + 1658, + 557, + 1658 + ], + "score": 0.77, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 374, + 538, + 396, + 538, + 396, + 564, + 374, + 564 + ], + "score": 0.73, + "latex": "L" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 1221.0, + 340.0, + 1221.0, + 340.0, + 1258.0, + 316.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 1223.0, + 373.0, + 1223.0, + 373.0, + 1260.0, + 346.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 379.0, + 1226.0, + 404.0, + 1226.0, + 404.0, + 1257.0, + 379.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 411.0, + 1225.0, + 434.0, + 1225.0, + 434.0, + 1258.0, + 411.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 442.0, + 1218.0, + 468.0, + 1218.0, + 468.0, + 1260.0, + 442.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 1217.0, + 499.0, + 1217.0, + 499.0, + 1260.0, + 472.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 504.0, + 1223.0, + 531.0, + 1223.0, + 531.0, + 1260.0, + 504.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 1226.0, + 561.0, + 1226.0, + 561.0, + 1258.0, + 538.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1222.0, + 594.0, + 1222.0, + 594.0, + 1258.0, + 570.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1223.0, + 626.0, + 1223.0, + 626.0, + 1260.0, + 599.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 632.0, + 1221.0, + 655.0, + 1221.0, + 655.0, + 1258.0, + 632.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 1221.0, + 687.0, + 1221.0, + 687.0, + 1256.0, + 664.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 695.0, + 1188.0, + 719.0, + 1188.0, + 719.0, + 1257.0, + 695.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 1187.0, + 752.0, + 1187.0, + 752.0, + 1260.0, + 724.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 757.0, + 1210.0, + 782.0, + 1210.0, + 782.0, + 1260.0, + 757.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 791.0, + 1217.0, + 813.0, + 1217.0, + 813.0, + 1258.0, + 791.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 1218.0, + 846.0, + 1218.0, + 846.0, + 1260.0, + 820.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 854.0, + 1203.0, + 879.0, + 1203.0, + 879.0, + 1260.0, + 854.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 1213.0, + 907.0, + 1213.0, + 907.0, + 1258.0, + 885.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 916.0, + 1190.0, + 940.0, + 1190.0, + 940.0, + 1260.0, + 916.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 949.0, + 1214.0, + 971.0, + 1214.0, + 971.0, + 1258.0, + 949.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 1211.0, + 1001.0, + 1211.0, + 1001.0, + 1258.0, + 975.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1010.0, + 1198.0, + 1035.0, + 1198.0, + 1035.0, + 1260.0, + 1010.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 1195.0, + 1067.0, + 1195.0, + 1067.0, + 1260.0, + 1042.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.0, + 1199.0, + 1097.0, + 1199.0, + 1097.0, + 1259.0, + 1071.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1110.0, + 1239.0, + 1126.0, + 1239.0, + 1126.0, + 1256.0, + 1110.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1148.0, + 1248.0, + 1154.0, + 1248.0, + 1154.0, + 1254.0, + 1148.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.0, + 1244.0, + 1185.0, + 1244.0, + 1185.0, + 1257.0, + 1174.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1202.0, + 1223.0, + 1224.0, + 1223.0, + 1224.0, + 1258.0, + 1202.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1233.0, + 1220.0, + 1255.0, + 1220.0, + 1255.0, + 1258.0, + 1233.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1263.0, + 1203.0, + 1288.0, + 1203.0, + 1288.0, + 1260.0, + 1263.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1295.0, + 1188.0, + 1320.0, + 1188.0, + 1320.0, + 1260.0, + 1295.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1328.0, + 1187.0, + 1349.0, + 1187.0, + 1349.0, + 1258.0, + 1328.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1358.0, + 1218.0, + 1384.0, + 1218.0, + 1384.0, + 1261.0, + 1358.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1263.0, + 340.0, + 1263.0, + 340.0, + 1287.0, + 320.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 1263.0, + 371.0, + 1263.0, + 371.0, + 1285.0, + 350.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 1263.0, + 401.0, + 1263.0, + 401.0, + 1285.0, + 383.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 414.0, + 1263.0, + 434.0, + 1263.0, + 434.0, + 1285.0, + 414.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 445.0, + 1265.0, + 466.0, + 1265.0, + 466.0, + 1285.0, + 445.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 477.0, + 1265.0, + 498.0, + 1265.0, + 498.0, + 1285.0, + 477.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 508.0, + 1263.0, + 529.0, + 1263.0, + 529.0, + 1285.0, + 508.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 540.0, + 1263.0, + 561.0, + 1263.0, + 561.0, + 1285.0, + 540.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 1260.0, + 600.0, + 1260.0, + 600.0, + 1288.0, + 565.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 1263.0, + 624.0, + 1263.0, + 624.0, + 1285.0, + 604.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 1263.0, + 655.0, + 1263.0, + 655.0, + 1285.0, + 635.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 659.0, + 1260.0, + 694.0, + 1260.0, + 694.0, + 1288.0, + 659.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 698.0, + 1263.0, + 719.0, + 1263.0, + 719.0, + 1285.0, + 698.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 1263.0, + 750.0, + 1263.0, + 750.0, + 1287.0, + 730.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 762.0, + 1263.0, + 783.0, + 1263.0, + 783.0, + 1285.0, + 762.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 793.0, + 1263.0, + 814.0, + 1263.0, + 814.0, + 1285.0, + 793.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 1260.0, + 915.0, + 1260.0, + 915.0, + 1288.0, + 818.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 917.0, + 1261.0, + 942.0, + 1261.0, + 942.0, + 1288.0, + 917.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 953.0, + 1265.0, + 972.0, + 1265.0, + 972.0, + 1285.0, + 953.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 1263.0, + 1002.0, + 1263.0, + 1002.0, + 1285.0, + 982.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1014.0, + 1263.0, + 1035.0, + 1263.0, + 1035.0, + 1287.0, + 1014.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 1263.0, + 1067.0, + 1263.0, + 1067.0, + 1287.0, + 1046.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 1263.0, + 1099.0, + 1263.0, + 1099.0, + 1285.0, + 1077.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1109.0, + 1263.0, + 1130.0, + 1263.0, + 1130.0, + 1285.0, + 1109.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1139.0, + 1265.0, + 1160.0, + 1265.0, + 1160.0, + 1285.0, + 1139.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1172.0, + 1263.0, + 1193.0, + 1263.0, + 1193.0, + 1285.0, + 1172.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1204.0, + 1263.0, + 1224.0, + 1263.0, + 1224.0, + 1285.0, + 1204.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1236.0, + 1263.0, + 1255.0, + 1263.0, + 1255.0, + 1285.0, + 1236.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 1265.0, + 1288.0, + 1265.0, + 1288.0, + 1285.0, + 1268.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1298.0, + 1265.0, + 1320.0, + 1265.0, + 1320.0, + 1285.0, + 1298.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1331.0, + 1265.0, + 1351.0, + 1265.0, + 1351.0, + 1285.0, + 1331.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1363.0, + 1265.0, + 1383.0, + 1265.0, + 1383.0, + 1285.0, + 1363.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1414.0, + 470.0, + 1414.0, + 470.0, + 1449.0, + 294.0, + 1449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 1324.0, + 1383.0, + 1324.0, + 1383.0, + 1368.0, + 314.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 861.0, + 2085.0, + 861.0, + 2120.0, + 839.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 472.0, + 1405.0, + 472.0, + 1405.0, + 511.0, + 293.0, + 511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 506.0, + 1407.0, + 506.0, + 1407.0, + 543.0, + 292.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 535.0, + 373.0, + 535.0, + 373.0, + 572.0, + 293.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 535.0, + 1406.0, + 535.0, + 1406.0, + 572.0, + 397.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 564.0, + 725.0, + 564.0, + 725.0, + 604.0, + 293.0, + 604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 564.0, + 1405.0, + 564.0, + 1405.0, + 604.0, + 819.0, + 604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 597.0, + 1408.0, + 597.0, + 1408.0, + 633.0, + 295.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 628.0, + 1408.0, + 628.0, + 1408.0, + 664.0, + 293.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 660.0, + 930.0, + 660.0, + 930.0, + 692.0, + 296.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 660.0, + 1294.0, + 660.0, + 1294.0, + 692.0, + 1012.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 689.0, + 1406.0, + 689.0, + 1406.0, + 725.0, + 295.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 719.0, + 1406.0, + 719.0, + 1406.0, + 757.0, + 292.0, + 757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 750.0, + 1304.0, + 750.0, + 1304.0, + 786.0, + 295.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1751.0, + 1405.0, + 1751.0, + 1405.0, + 1791.0, + 295.0, + 1791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1785.0, + 1405.0, + 1785.0, + 1405.0, + 1819.0, + 293.0, + 1819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1817.0, + 1405.0, + 1817.0, + 1405.0, + 1849.0, + 296.0, + 1849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1845.0, + 1406.0, + 1845.0, + 1406.0, + 1882.0, + 293.0, + 1882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1877.0, + 1405.0, + 1877.0, + 1405.0, + 1913.0, + 294.0, + 1913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1909.0, + 1340.0, + 1909.0, + 1340.0, + 1941.0, + 296.0, + 1941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 933.0, + 1406.0, + 933.0, + 1406.0, + 970.0, + 292.0, + 970.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 966.0, + 1408.0, + 966.0, + 1408.0, + 1001.0, + 295.0, + 1001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 994.0, + 1162.0, + 994.0, + 1162.0, + 1033.0, + 293.0, + 1033.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1244.0, + 994.0, + 1407.0, + 994.0, + 1407.0, + 1033.0, + 1244.0, + 1033.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1023.0, + 1405.0, + 1023.0, + 1405.0, + 1063.0, + 392.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1055.0, + 728.0, + 1055.0, + 728.0, + 1090.0, + 295.0, + 1090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 755.0, + 1055.0, + 1404.0, + 1055.0, + 1404.0, + 1090.0, + 755.0, + 1090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1086.0, + 1407.0, + 1086.0, + 1407.0, + 1124.0, + 293.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1118.0, + 999.0, + 1118.0, + 999.0, + 1153.0, + 295.0, + 1153.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1596.0, + 1408.0, + 1596.0, + 1408.0, + 1634.0, + 293.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1629.0, + 556.0, + 1629.0, + 556.0, + 1663.0, + 292.0, + 1663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 1629.0, + 1406.0, + 1629.0, + 1406.0, + 1663.0, + 583.0, + 1663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1661.0, + 1405.0, + 1661.0, + 1405.0, + 1693.0, + 292.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1692.0, + 1407.0, + 1692.0, + 1407.0, + 1723.0, + 293.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1470.0, + 1405.0, + 1470.0, + 1405.0, + 1509.0, + 294.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1505.0, + 1407.0, + 1505.0, + 1407.0, + 1538.0, + 295.0, + 1538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1531.0, + 1399.0, + 1531.0, + 1399.0, + 1571.0, + 293.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 794.0, + 1405.0, + 794.0, + 1405.0, + 831.0, + 294.0, + 831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 825.0, + 822.0, + 825.0, + 822.0, + 863.0, + 293.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 846.0, + 825.0, + 1406.0, + 825.0, + 1406.0, + 863.0, + 846.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 859.0, + 1402.0, + 859.0, + 1402.0, + 891.0, + 295.0, + 891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 888.0, + 1409.0, + 888.0, + 1409.0, + 920.0, + 295.0, + 920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 226.0, + 1404.0, + 226.0, + 1404.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 261.0, + 1202.0, + 261.0, + 1202.0, + 297.0, + 296.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1969.0, + 1404.0, + 1969.0, + 1404.0, + 2006.0, + 295.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 2001.0, + 1405.0, + 2001.0, + 1405.0, + 2039.0, + 292.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 360.0, + 315.0, + 962.0, + 315.0, + 962.0, + 355.0, + 360.0, + 355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 315.0, + 1404.0, + 315.0, + 1404.0, + 355.0, + 997.0, + 355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 349.0, + 965.0, + 349.0, + 965.0, + 380.0, + 392.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 385.0, + 1297.0, + 385.0, + 1297.0, + 425.0, + 357.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1332.0, + 385.0, + 1410.0, + 385.0, + 1410.0, + 425.0, + 1332.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 421.0, + 1196.0, + 421.0, + 1196.0, + 455.0, + 395.0, + 455.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1559, + 1404, + 1559, + 1404, + 1896, + 298, + 1896 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1015, + 1404, + 1015, + 1404, + 1229, + 298, + 1229 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 664, + 1405, + 664, + 1405, + 879, + 297, + 879 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 1342, + 1405, + 1342, + 1405, + 1465, + 299, + 1465 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 416, + 1403, + 416, + 1403, + 571, + 299, + 571 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1403, + 229, + 1403, + 383, + 298, + 383 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 300, + 1911, + 1401, + 1911, + 1401, + 2034, + 300, + 2034 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 298, + 887, + 1399, + 887, + 1399, + 980, + 298, + 980 + ], + "score": 0.955 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 814, + 76, + 814, + 104, + 300, + 104 + ], + "score": 0.893 + }, + { + "category_id": 0, + "poly": [ + 300, + 1273, + 557, + 1273, + 557, + 1309, + 300, + 1309 + ], + "score": 0.892 + }, + { + "category_id": 0, + "poly": [ + 301, + 608, + 690, + 608, + 690, + 638, + 301, + 638 + ], + "score": 0.882 + }, + { + "category_id": 0, + "poly": [ + 301, + 1502, + 840, + 1502, + 840, + 1533, + 301, + 1533 + ], + "score": 0.876 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2112, + 841, + 2112 + ], + "score": 0.77 + }, + { + "category_id": 13, + "poly": [ + 489, + 726, + 585, + 726, + 585, + 760, + 489, + 760 + ], + "score": 0.93, + "latex": "q ( \\pmb { a } \\mid \\mathcal { E } )" + }, + { + "category_id": 13, + "poly": [ + 1025, + 1910, + 1148, + 1910, + 1148, + 1941, + 1025, + 1941 + ], + "score": 0.91, + "latex": "\\sim 2 \\times 1 0 ^ { 6 }" + }, + { + "category_id": 13, + "poly": [ + 1055, + 1682, + 1142, + 1682, + 1142, + 1710, + 1055, + 1710 + ], + "score": 0.9, + "latex": "M = 5" + }, + { + "category_id": 13, + "poly": [ + 709, + 1591, + 811, + 1591, + 811, + 1620, + 709, + 1620 + ], + "score": 0.89, + "latex": "P = 5 0 0" + }, + { + "category_id": 13, + "poly": [ + 1085, + 816, + 1127, + 816, + 1127, + 846, + 1085, + 846 + ], + "score": 0.89, + "latex": "\\check { C } ^ { T }" + }, + { + "category_id": 13, + "poly": [ + 643, + 1948, + 716, + 1948, + 716, + 1970, + 643, + 1970 + ], + "score": 0.88, + "latex": "T = 3" + }, + { + "category_id": 13, + "poly": [ + 326, + 1165, + 367, + 1165, + 367, + 1196, + 326, + 1196 + ], + "score": 0.88, + "latex": "C ^ { T }" + }, + { + "category_id": 13, + "poly": [ + 678, + 507, + 709, + 507, + 709, + 536, + 678, + 536 + ], + "score": 0.86, + "latex": "\\lambda ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 367, + 415, + 400, + 415, + 400, + 446, + 367, + 446 + ], + "score": 0.85, + "latex": "\\lambda ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 297, + 415, + 330, + 415, + 330, + 446, + 297, + 446 + ], + "score": 0.81, + "latex": "\\lambda ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 353, + 818, + 379, + 818, + 379, + 845, + 353, + 845 + ], + "score": 0.8, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 1092, + 1139, + 1118, + 1139, + 1118, + 1166, + 1092, + 1166 + ], + "score": 0.79, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 1377, + 789, + 1401, + 789, + 1401, + 815, + 1377, + 815 + ], + "score": 0.76, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1009, + 732, + 1030, + 732, + 1030, + 755, + 1009, + 755 + ], + "score": 0.7, + "latex": "\\textbf { \\em a }" + }, + { + "category_id": 13, + "poly": [ + 1368, + 1804, + 1401, + 1804, + 1401, + 1832, + 1368, + 1832 + ], + "score": 0.66, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 776, + 889, + 799, + 889, + 799, + 916, + 776, + 916 + ], + "score": 0.48, + "latex": "T" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1269.0, + 562.0, + 1269.0, + 562.0, + 1314.0, + 291.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 607.0, + 695.0, + 607.0, + 695.0, + 642.0, + 295.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1501.0, + 843.0, + 1501.0, + 843.0, + 1537.0, + 295.0, + 1537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2087.0, + 861.0, + 2087.0, + 861.0, + 2118.0, + 840.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1557.0, + 1405.0, + 1557.0, + 1405.0, + 1596.0, + 293.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1591.0, + 708.0, + 1591.0, + 708.0, + 1626.0, + 294.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 812.0, + 1591.0, + 1405.0, + 1591.0, + 1405.0, + 1626.0, + 812.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1621.0, + 1405.0, + 1621.0, + 1405.0, + 1653.0, + 293.0, + 1653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1647.0, + 1405.0, + 1647.0, + 1405.0, + 1690.0, + 292.0, + 1690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1680.0, + 1054.0, + 1680.0, + 1054.0, + 1715.0, + 294.0, + 1715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1143.0, + 1680.0, + 1404.0, + 1680.0, + 1404.0, + 1715.0, + 1143.0, + 1715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1713.0, + 1406.0, + 1713.0, + 1406.0, + 1747.0, + 293.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1742.0, + 1404.0, + 1742.0, + 1404.0, + 1777.0, + 294.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1772.0, + 1408.0, + 1772.0, + 1408.0, + 1811.0, + 294.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1803.0, + 1367.0, + 1803.0, + 1367.0, + 1838.0, + 294.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1834.0, + 1404.0, + 1834.0, + 1404.0, + 1869.0, + 294.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1864.0, + 1229.0, + 1864.0, + 1229.0, + 1900.0, + 293.0, + 1900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1014.0, + 1406.0, + 1014.0, + 1406.0, + 1052.0, + 293.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1045.0, + 1408.0, + 1045.0, + 1408.0, + 1083.0, + 293.0, + 1083.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1077.0, + 1404.0, + 1077.0, + 1404.0, + 1111.0, + 294.0, + 1111.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1109.0, + 1404.0, + 1109.0, + 1404.0, + 1139.0, + 296.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1137.0, + 1091.0, + 1137.0, + 1091.0, + 1171.0, + 293.0, + 1171.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1119.0, + 1137.0, + 1405.0, + 1137.0, + 1405.0, + 1171.0, + 1119.0, + 1171.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1162.0, + 325.0, + 1162.0, + 325.0, + 1203.0, + 292.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 1162.0, + 1408.0, + 1162.0, + 1408.0, + 1203.0, + 368.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1198.0, + 1051.0, + 1198.0, + 1051.0, + 1232.0, + 293.0, + 1232.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1376.0, + 1201.0, + 1404.0, + 1201.0, + 1404.0, + 1227.0, + 1376.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 666.0, + 1403.0, + 666.0, + 1403.0, + 700.0, + 295.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 694.0, + 1407.0, + 694.0, + 1407.0, + 730.0, + 292.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 726.0, + 488.0, + 726.0, + 488.0, + 762.0, + 294.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 586.0, + 726.0, + 1008.0, + 726.0, + 1008.0, + 762.0, + 586.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1031.0, + 726.0, + 1407.0, + 726.0, + 1407.0, + 762.0, + 1031.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 753.0, + 1411.0, + 753.0, + 1411.0, + 794.0, + 292.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 787.0, + 1376.0, + 787.0, + 1376.0, + 822.0, + 294.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 787.0, + 1405.0, + 787.0, + 1405.0, + 822.0, + 1402.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 813.0, + 352.0, + 813.0, + 352.0, + 855.0, + 291.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 813.0, + 1084.0, + 813.0, + 1084.0, + 855.0, + 380.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1128.0, + 813.0, + 1407.0, + 813.0, + 1407.0, + 855.0, + 1128.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 847.0, + 1369.0, + 847.0, + 1369.0, + 882.0, + 292.0, + 882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1342.0, + 1409.0, + 1342.0, + 1409.0, + 1378.0, + 294.0, + 1378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1371.0, + 1410.0, + 1371.0, + 1410.0, + 1408.0, + 293.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1402.0, + 1406.0, + 1402.0, + 1406.0, + 1440.0, + 293.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1436.0, + 1297.0, + 1436.0, + 1297.0, + 1469.0, + 295.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 412.0, + 366.0, + 412.0, + 366.0, + 455.0, + 331.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 412.0, + 1404.0, + 412.0, + 1404.0, + 455.0, + 401.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 448.0, + 1405.0, + 448.0, + 1405.0, + 482.0, + 297.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 474.0, + 1405.0, + 474.0, + 1405.0, + 519.0, + 292.0, + 519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 504.0, + 677.0, + 504.0, + 677.0, + 545.0, + 294.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 710.0, + 504.0, + 1405.0, + 504.0, + 1405.0, + 545.0, + 710.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 537.0, + 1379.0, + 537.0, + 1379.0, + 575.0, + 294.0, + 575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 229.0, + 1405.0, + 229.0, + 1405.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 262.0, + 1404.0, + 262.0, + 1404.0, + 295.0, + 296.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 290.0, + 1405.0, + 290.0, + 1405.0, + 326.0, + 294.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 321.0, + 1405.0, + 321.0, + 1405.0, + 355.0, + 293.0, + 355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 351.0, + 1296.0, + 351.0, + 1296.0, + 387.0, + 293.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1910.0, + 1024.0, + 1910.0, + 1024.0, + 1946.0, + 293.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1149.0, + 1910.0, + 1406.0, + 1910.0, + 1406.0, + 1946.0, + 1149.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1943.0, + 642.0, + 1943.0, + 642.0, + 1976.0, + 295.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1943.0, + 1405.0, + 1943.0, + 1405.0, + 1976.0, + 717.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1974.0, + 1405.0, + 1974.0, + 1405.0, + 2006.0, + 296.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2002.0, + 1405.0, + 2002.0, + 1405.0, + 2036.0, + 295.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 886.0, + 775.0, + 886.0, + 775.0, + 924.0, + 293.0, + 924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 800.0, + 886.0, + 1405.0, + 886.0, + 1405.0, + 924.0, + 800.0, + 924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 917.0, + 1405.0, + 917.0, + 1405.0, + 955.0, + 292.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 950.0, + 737.0, + 950.0, + 737.0, + 984.0, + 296.0, + 984.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1233, + 1404, + 1233, + 1404, + 1480, + 297, + 1480 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1680, + 1404, + 1680, + 1404, + 1866, + 297, + 1866 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 575, + 1404, + 575, + 1404, + 852, + 297, + 852 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 299, + 1880, + 1402, + 1880, + 1402, + 2034, + 299, + 2034 + ], + "score": 0.976 + }, + { + "category_id": 5, + "poly": [ + 296, + 281, + 1399, + 281, + 1399, + 446, + 296, + 446 + ], + "score": 0.968, + "html": "
Timeout needed to solveDFSEnumeration12SketchBeam
20%40%60%20%40%60%20%40%60%20%40%20%
Baseline41ms126ms314ms80ms:335ms861ms18.9s49.6s 84.2s>103s>103s>103s
DeepCoder2.7ms33ms110ms1.3ms6.1ms27ms0.23s0.52s 13.5s2.13s455s292s
Speedup15.2×3.9×2.9×62.2×54.6×31.5×80.4×94.6×6.2×>467×>2.2×>3.4×
" + }, + { + "category_id": 1, + "poly": [ + 300, + 499, + 1400, + 499, + 1400, + 560, + 300, + 560 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 301, + 1494, + 1400, + 1494, + 1400, + 1587, + 301, + 1587 + ], + "score": 0.951 + }, + { + "category_id": 6, + "poly": [ + 304, + 224, + 1379, + 224, + 1379, + 258, + 304, + 258 + ], + "score": 0.901 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 814, + 75, + 814, + 104, + 300, + 104 + ], + "score": 0.9 + }, + { + "category_id": 0, + "poly": [ + 298, + 1626, + 924, + 1626, + 924, + 1655, + 298, + 1655 + ], + "score": 0.899 + }, + { + "category_id": 4, + "poly": [ + 298, + 1167, + 1399, + 1167, + 1399, + 1202, + 298, + 1202 + ], + "score": 0.806 + }, + { + "category_id": 3, + "poly": [ + 294, + 872, + 1385, + 872, + 1385, + 1145, + 294, + 1145 + ], + "score": 0.802 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 858, + 2087, + 858, + 2111, + 841, + 2111 + ], + "score": 0.75 + }, + { + "category_id": 5, + "poly": [ + 294, + 872, + 1385, + 872, + 1385, + 1145, + 294, + 1145 + ], + "score": 0.155, + "html": "
. 4103 dnpaads 10² 101 100
Timeout neededDFSEnumeration12
to solve20%40%60%20%40%60%20%
163s 2887s6832s8181s>104s>104s463s
Baseline DeepCoder24s514s2654s9s264s4640s48s
Speedup6.8×5.6×2.6×907×>37×>2×9.6×
Length of test programs Ttest (a) (b)
" + }, + { + "category_id": 13, + "poly": [ + 404, + 1742, + 610, + 1742, + 610, + 1776, + 404, + 1776 + ], + "score": 0.94, + "latex": "T _ { \\mathrm { t r a i n } } \\in \\{ 1 , . . . , 4 \\}" + }, + { + "category_id": 13, + "poly": [ + 1060, + 1773, + 1257, + 1773, + 1257, + 1807, + 1060, + 1807 + ], + "score": 0.93, + "latex": "T _ { \\mathrm { t e s t } } \\in \\{ 1 , . . . , 5 \\}" + }, + { + "category_id": 13, + "poly": [ + 1155, + 1835, + 1243, + 1835, + 1243, + 1863, + 1155, + 1863 + ], + "score": 0.91, + "latex": "T ^ { \\prime } < T" + }, + { + "category_id": 13, + "poly": [ + 948, + 608, + 1024, + 608, + 1024, + 636, + 948, + 636 + ], + "score": 0.9, + "latex": "T = 5" + }, + { + "category_id": 13, + "poly": [ + 835, + 1169, + 910, + 1169, + 910, + 1197, + 835, + 1197 + ], + "score": 0.9, + "latex": "T = 5" + }, + { + "category_id": 13, + "poly": [ + 660, + 1884, + 715, + 1884, + 715, + 1912, + 660, + 1912 + ], + "score": 0.9, + "latex": "T _ { \\mathrm { t r a i n } }" + }, + { + "category_id": 13, + "poly": [ + 1182, + 788, + 1226, + 788, + 1226, + 818, + 1182, + 818 + ], + "score": 0.89, + "latex": "1 0 ^ { 4 }" + }, + { + "category_id": 13, + "poly": [ + 854, + 225, + 929, + 225, + 929, + 253, + 854, + 253 + ], + "score": 0.89, + "latex": "T = 3" + }, + { + "category_id": 13, + "poly": [ + 400, + 669, + 506, + 669, + 506, + 698, + 400, + 698 + ], + "score": 0.89, + "latex": "P = 1 0 0" + }, + { + "category_id": 13, + "poly": [ + 1157, + 638, + 1231, + 638, + 1231, + 666, + 1157, + 666 + ], + "score": 0.89, + "latex": "T = 4" + }, + { + "category_id": 13, + "poly": [ + 399, + 1942, + 453, + 1942, + 453, + 1972, + 399, + 1972 + ], + "score": 0.88, + "latex": "2 0 \\%" + }, + { + "category_id": 13, + "poly": [ + 951, + 500, + 1005, + 500, + 1005, + 529, + 951, + 529 + ], + "score": 0.87, + "latex": "50 \\%" + }, + { + "category_id": 13, + "poly": [ + 757, + 728, + 789, + 728, + 789, + 758, + 757, + 758 + ], + "score": 0.86, + "latex": "\\lambda ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 766, + 1883, + 813, + 1883, + 813, + 1912, + 766, + 1912 + ], + "score": 0.86, + "latex": "T _ { \\mathrm { t e s t } }" + }, + { + "category_id": 13, + "poly": [ + 296, + 636, + 350, + 636, + 350, + 668, + 296, + 668 + ], + "score": 0.85, + "latex": "1 0 ^ { \\overline { { 1 0 } } }" + }, + { + "category_id": 13, + "poly": [ + 701, + 1805, + 725, + 1805, + 725, + 1831, + 701, + 1831 + ], + "score": 0.82, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 437, + 1836, + 461, + 1836, + 461, + 1862, + 437, + 1862 + ], + "score": 0.8, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1313, + 1083, + 1350, + 1083, + 1350, + 1107, + 1313, + 1107 + ], + "score": 0.62, + "latex": "T _ { t e s t }" + }, + { + "category_id": 13, + "poly": [ + 1327, + 867, + 1374, + 867, + 1374, + 891, + 1327, + 891 + ], + "score": 0.55, + "latex": "T _ { t r a i n }" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 220.0, + 853.0, + 220.0, + 853.0, + 259.0, + 314.0, + 259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 930.0, + 220.0, + 1382.0, + 220.0, + 1382.0, + 259.0, + 930.0, + 259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 817.0, + 72.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1623.0, + 927.0, + 1623.0, + 927.0, + 1659.0, + 294.0, + 1659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1162.0, + 834.0, + 1162.0, + 834.0, + 1208.0, + 293.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 911.0, + 1162.0, + 1404.0, + 1162.0, + 1404.0, + 1208.0, + 911.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1321.0, + 859.0, + 1326.0, + 859.0, + 1326.0, + 901.0, + 1321.0, + 901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1375.0, + 859.0, + 1390.0, + 859.0, + 1390.0, + 901.0, + 1375.0, + 901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 906.0, + 454.0, + 906.0, + 454.0, + 939.0, + 294.0, + 939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 906.0, + 600.0, + 906.0, + 600.0, + 939.0, + 542.0, + 939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 907.0, + 883.0, + 907.0, + 883.0, + 937.0, + 743.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 901.0, + 998.0, + 901.0, + 998.0, + 942.0, + 955.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1258.0, + 896.0, + 1281.0, + 896.0, + 1281.0, + 915.0, + 1258.0, + 915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 892.0, + 1346.0, + 892.0, + 1346.0, + 915.0, + 1305.0, + 915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 941.0, + 379.0, + 941.0, + 379.0, + 976.0, + 291.0, + 976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 476.0, + 942.0, + 533.0, + 942.0, + 533.0, + 975.0, + 476.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 942.0, + 600.0, + 942.0, + 600.0, + 975.0, + 542.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 610.0, + 942.0, + 667.0, + 942.0, + 667.0, + 975.0, + 610.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 942.0, + 774.0, + 942.0, + 774.0, + 975.0, + 717.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 789.0, + 942.0, + 908.0, + 942.0, + 908.0, + 975.0, + 789.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 957.0, + 941.0, + 1016.0, + 941.0, + 1016.0, + 977.0, + 957.0, + 977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1025.0, + 921.0, + 1102.0, + 921.0, + 1102.0, + 1022.0, + 1025.0, + 1022.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 933.0, + 1274.0, + 933.0, + 1274.0, + 942.0, + 1261.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 935.0, + 1346.0, + 935.0, + 1346.0, + 958.0, + 1305.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 977.0, + 387.0, + 977.0, + 387.0, + 1012.0, + 292.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 474.0, + 979.0, + 668.0, + 979.0, + 668.0, + 1012.0, + 474.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 978.0, + 919.0, + 978.0, + 919.0, + 1011.0, + 699.0, + 1011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 977.0, + 1018.0, + 977.0, + 1018.0, + 1014.0, + 956.0, + 1014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 971.0, + 1104.0, + 971.0, + 1104.0, + 1008.0, + 1053.0, + 1008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1209.0, + 985.0, + 1224.0, + 985.0, + 1224.0, + 996.0, + 1209.0, + 996.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1303.0, + 964.0, + 1346.0, + 964.0, + 1346.0, + 992.0, + 1303.0, + 992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1006.0, + 410.0, + 1006.0, + 410.0, + 1079.0, + 291.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 1003.0, + 668.0, + 1003.0, + 668.0, + 1073.0, + 467.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 1005.0, + 916.0, + 1005.0, + 916.0, + 1075.0, + 701.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 950.0, + 1006.0, + 1017.0, + 1006.0, + 1017.0, + 1076.0, + 950.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1101.0, + 1024.0, + 1136.0, + 1024.0, + 1136.0, + 1076.0, + 1101.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 1003.0, + 1178.0, + 1003.0, + 1178.0, + 1078.0, + 1152.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1203.0, + 1033.0, + 1229.0, + 1033.0, + 1229.0, + 1077.0, + 1203.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1255.0, + 997.0, + 1383.0, + 997.0, + 1383.0, + 1078.0, + 1255.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 1088.0, + 681.0, + 1088.0, + 681.0, + 1128.0, + 635.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 1074.0, + 1312.0, + 1074.0, + 1312.0, + 1114.0, + 1077.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1351.0, + 1074.0, + 1356.0, + 1074.0, + 1356.0, + 1114.0, + 1351.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1183.0, + 1110.0, + 1232.0, + 1110.0, + 1232.0, + 1150.0, + 1183.0, + 1150.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.25, + 875.0, + 1106.25, + 875.0, + 1106.25, + 914.0, + 1050.25, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1196.25, + 947.0, + 1238.25, + 947.0, + 1238.25, + 965.0, + 1196.25, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 1021.0, + 1106.0, + 1021.0, + 1106.0, + 1055.0, + 1052.0, + 1055.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2118.0, + 839.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1234.0, + 1405.0, + 1234.0, + 1405.0, + 1271.0, + 294.0, + 1271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1265.0, + 1404.0, + 1265.0, + 1404.0, + 1299.0, + 295.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1296.0, + 1405.0, + 1296.0, + 1405.0, + 1330.0, + 295.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1325.0, + 1404.0, + 1325.0, + 1404.0, + 1361.0, + 292.0, + 1361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1355.0, + 1406.0, + 1355.0, + 1406.0, + 1391.0, + 294.0, + 1391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1388.0, + 1404.0, + 1388.0, + 1404.0, + 1418.0, + 296.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1418.0, + 1406.0, + 1418.0, + 1406.0, + 1452.0, + 295.0, + 1452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1448.0, + 1397.0, + 1448.0, + 1397.0, + 1481.0, + 294.0, + 1481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1681.0, + 1405.0, + 1681.0, + 1405.0, + 1717.0, + 294.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1710.0, + 1404.0, + 1710.0, + 1404.0, + 1749.0, + 291.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1742.0, + 403.0, + 1742.0, + 403.0, + 1778.0, + 295.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 611.0, + 1742.0, + 1405.0, + 1742.0, + 1405.0, + 1778.0, + 611.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1776.0, + 1059.0, + 1776.0, + 1059.0, + 1807.0, + 295.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1258.0, + 1776.0, + 1407.0, + 1776.0, + 1407.0, + 1807.0, + 1258.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1804.0, + 700.0, + 1804.0, + 700.0, + 1839.0, + 295.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 726.0, + 1804.0, + 1406.0, + 1804.0, + 1406.0, + 1839.0, + 726.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1834.0, + 436.0, + 1834.0, + 436.0, + 1867.0, + 292.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 462.0, + 1834.0, + 1154.0, + 1834.0, + 1154.0, + 1867.0, + 462.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1244.0, + 1834.0, + 1257.0, + 1834.0, + 1257.0, + 1867.0, + 1244.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 575.0, + 1405.0, + 575.0, + 1405.0, + 611.0, + 294.0, + 611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 607.0, + 947.0, + 607.0, + 947.0, + 640.0, + 292.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1025.0, + 607.0, + 1406.0, + 607.0, + 1406.0, + 640.0, + 1025.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 632.0, + 295.0, + 632.0, + 295.0, + 676.0, + 292.0, + 676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 632.0, + 1156.0, + 632.0, + 1156.0, + 676.0, + 351.0, + 676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1232.0, + 632.0, + 1408.0, + 632.0, + 1408.0, + 676.0, + 1232.0, + 676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 666.0, + 399.0, + 666.0, + 399.0, + 703.0, + 294.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 666.0, + 1405.0, + 666.0, + 1405.0, + 703.0, + 507.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 698.0, + 1404.0, + 698.0, + 1404.0, + 734.0, + 295.0, + 734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 725.0, + 756.0, + 725.0, + 756.0, + 766.0, + 294.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 725.0, + 1405.0, + 725.0, + 1405.0, + 766.0, + 790.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 759.0, + 1406.0, + 759.0, + 1406.0, + 793.0, + 293.0, + 793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 788.0, + 1181.0, + 788.0, + 1181.0, + 825.0, + 294.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1227.0, + 788.0, + 1406.0, + 788.0, + 1406.0, + 825.0, + 1227.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 821.0, + 1064.0, + 821.0, + 1064.0, + 854.0, + 293.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1880.0, + 659.0, + 1880.0, + 659.0, + 1917.0, + 295.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 1880.0, + 765.0, + 1880.0, + 765.0, + 1917.0, + 716.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 814.0, + 1880.0, + 1404.0, + 1880.0, + 1404.0, + 1917.0, + 814.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1912.0, + 1404.0, + 1912.0, + 1404.0, + 1945.0, + 295.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1940.0, + 398.0, + 1940.0, + 398.0, + 1978.0, + 292.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 1940.0, + 1406.0, + 1940.0, + 1406.0, + 1978.0, + 454.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1972.0, + 1406.0, + 1972.0, + 1406.0, + 2006.0, + 294.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2002.0, + 1406.0, + 2002.0, + 1406.0, + 2038.0, + 293.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 498.0, + 950.0, + 498.0, + 950.0, + 533.0, + 296.0, + 533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1006.0, + 498.0, + 1405.0, + 498.0, + 1405.0, + 533.0, + 1006.0, + 533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 530.0, + 857.0, + 530.0, + 857.0, + 562.0, + 295.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1490.0, + 1405.0, + 1490.0, + 1405.0, + 1533.0, + 294.0, + 1533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1526.0, + 1405.0, + 1526.0, + 1405.0, + 1560.0, + 295.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1553.0, + 369.0, + 1553.0, + 369.0, + 1590.0, + 295.0, + 1590.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 928, + 1405, + 928, + 1405, + 1418, + 298, + 1418 + ], + "score": 0.985 + }, + { + "category_id": 1, + "poly": [ + 298, + 542, + 1404, + 542, + 1404, + 817, + 298, + 817 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1728, + 1405, + 1728, + 1405, + 2034, + 298, + 2034 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 299, + 416, + 1403, + 416, + 1403, + 507, + 299, + 507 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1404, + 229, + 1404, + 323, + 299, + 323 + ], + "score": 0.962 + }, + { + "category_id": 1, + "poly": [ + 298, + 1451, + 1404, + 1451, + 1404, + 1696, + 298, + 1696 + ], + "score": 0.936 + }, + { + "category_id": 0, + "poly": [ + 300, + 861, + 587, + 861, + 587, + 897, + 300, + 897 + ], + "score": 0.9 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.894 + }, + { + "category_id": 0, + "poly": [ + 299, + 359, + 640, + 359, + 640, + 390, + 299, + 390 + ], + "score": 0.89 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.787 + }, + { + "category_id": 13, + "poly": [ + 1247, + 695, + 1320, + 695, + 1320, + 725, + 1247, + 725 + ], + "score": 0.9, + "latex": "T \\le 2" + }, + { + "category_id": 13, + "poly": [ + 849, + 724, + 891, + 724, + 891, + 755, + 849, + 755 + ], + "score": 0.86, + "latex": "1 0 ^ { 3 }" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 858.0, + 593.0, + 858.0, + 593.0, + 901.0, + 293.0, + 901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 358.0, + 644.0, + 358.0, + 644.0, + 394.0, + 295.0, + 394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2116.0, + 839.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 925.0, + 1406.0, + 925.0, + 1406.0, + 968.0, + 293.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 962.0, + 1407.0, + 962.0, + 1407.0, + 996.0, + 293.0, + 996.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 990.0, + 1408.0, + 990.0, + 1408.0, + 1024.0, + 293.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1021.0, + 1407.0, + 1021.0, + 1407.0, + 1057.0, + 293.0, + 1057.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1050.0, + 1406.0, + 1050.0, + 1406.0, + 1086.0, + 292.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1082.0, + 1406.0, + 1082.0, + 1406.0, + 1120.0, + 293.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1112.0, + 1406.0, + 1112.0, + 1406.0, + 1151.0, + 293.0, + 1151.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1143.0, + 1405.0, + 1143.0, + 1405.0, + 1178.0, + 295.0, + 1178.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1174.0, + 1405.0, + 1174.0, + 1405.0, + 1209.0, + 293.0, + 1209.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1204.0, + 1405.0, + 1204.0, + 1405.0, + 1238.0, + 295.0, + 1238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1233.0, + 1403.0, + 1233.0, + 1403.0, + 1268.0, + 295.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1265.0, + 1406.0, + 1265.0, + 1406.0, + 1300.0, + 295.0, + 1300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1296.0, + 1407.0, + 1296.0, + 1407.0, + 1330.0, + 295.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1325.0, + 1405.0, + 1325.0, + 1405.0, + 1360.0, + 295.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1356.0, + 1403.0, + 1356.0, + 1403.0, + 1394.0, + 293.0, + 1394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1388.0, + 960.0, + 1388.0, + 960.0, + 1423.0, + 296.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 541.0, + 1406.0, + 541.0, + 1406.0, + 578.0, + 294.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 573.0, + 1405.0, + 573.0, + 1405.0, + 605.0, + 293.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 601.0, + 1402.0, + 601.0, + 1402.0, + 638.0, + 294.0, + 638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 631.0, + 1405.0, + 631.0, + 1405.0, + 669.0, + 292.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 664.0, + 1407.0, + 664.0, + 1407.0, + 699.0, + 293.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 694.0, + 1246.0, + 694.0, + 1246.0, + 730.0, + 294.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1321.0, + 694.0, + 1404.0, + 694.0, + 1404.0, + 730.0, + 1321.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 722.0, + 848.0, + 722.0, + 848.0, + 762.0, + 293.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 722.0, + 1405.0, + 722.0, + 1405.0, + 762.0, + 892.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 755.0, + 1406.0, + 755.0, + 1406.0, + 791.0, + 294.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 784.0, + 1372.0, + 784.0, + 1372.0, + 824.0, + 293.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1726.0, + 1403.0, + 1726.0, + 1403.0, + 1762.0, + 295.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1758.0, + 1405.0, + 1758.0, + 1405.0, + 1793.0, + 293.0, + 1793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1790.0, + 1408.0, + 1790.0, + 1408.0, + 1825.0, + 293.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1820.0, + 1403.0, + 1820.0, + 1403.0, + 1856.0, + 293.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1851.0, + 1403.0, + 1851.0, + 1403.0, + 1882.0, + 296.0, + 1882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1881.0, + 1405.0, + 1881.0, + 1405.0, + 1915.0, + 292.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1911.0, + 1407.0, + 1911.0, + 1407.0, + 1947.0, + 295.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1941.0, + 1407.0, + 1941.0, + 1407.0, + 1977.0, + 292.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1970.0, + 1410.0, + 1970.0, + 1410.0, + 2008.0, + 292.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 2000.0, + 388.0, + 2000.0, + 388.0, + 2038.0, + 292.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 414.0, + 1407.0, + 414.0, + 1407.0, + 452.0, + 293.0, + 452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 444.0, + 1405.0, + 444.0, + 1405.0, + 485.0, + 293.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 479.0, + 1196.0, + 479.0, + 1196.0, + 509.0, + 297.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 227.0, + 1406.0, + 227.0, + 1406.0, + 266.0, + 293.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 260.0, + 1406.0, + 260.0, + 1406.0, + 298.0, + 294.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 291.0, + 1370.0, + 291.0, + 1370.0, + 328.0, + 293.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1450.0, + 1409.0, + 1450.0, + 1409.0, + 1487.0, + 293.0, + 1487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1482.0, + 1406.0, + 1482.0, + 1406.0, + 1516.0, + 294.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1512.0, + 1409.0, + 1512.0, + 1409.0, + 1550.0, + 293.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1544.0, + 1406.0, + 1544.0, + 1406.0, + 1577.0, + 294.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1572.0, + 1405.0, + 1572.0, + 1405.0, + 1606.0, + 294.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1603.0, + 1405.0, + 1603.0, + 1405.0, + 1641.0, + 293.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1636.0, + 1405.0, + 1636.0, + 1405.0, + 1666.0, + 297.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1665.0, + 1149.0, + 1665.0, + 1149.0, + 1700.0, + 293.0, + 1700.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 295, + 1403, + 295, + 1403, + 539, + 298, + 539 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 555, + 1405, + 555, + 1405, + 890, + 298, + 890 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 299, + 906, + 1405, + 906, + 1405, + 1060, + 299, + 1060 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1146, + 1400, + 1146, + 1400, + 1209, + 299, + 1209 + ], + "score": 0.944 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 815, + 76, + 815, + 104, + 299, + 104 + ], + "score": 0.881 + }, + { + "category_id": 0, + "poly": [ + 300, + 1253, + 488, + 1253, + 488, + 1287, + 300, + 1287 + ], + "score": 0.873 + }, + { + "category_id": 0, + "poly": [ + 302, + 226, + 824, + 226, + 824, + 262, + 302, + 262 + ], + "score": 0.871 + }, + { + "category_id": 0, + "poly": [ + 300, + 1095, + 557, + 1095, + 557, + 1124, + 300, + 1124 + ], + "score": 0.86 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.77 + }, + { + "category_id": 1, + "poly": [ + 293, + 1301, + 1409, + 1301, + 1409, + 2038, + 293, + 2038 + ], + "score": 0.741 + }, + { + "category_id": 13, + "poly": [ + 777, + 1176, + 808, + 1176, + 808, + 1206, + 777, + 1206 + ], + "score": 0.85, + "latex": "\\lambda ^ { 2 }" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1253.0, + 490.0, + 1253.0, + 490.0, + 1290.0, + 296.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 222.0, + 832.0, + 222.0, + 832.0, + 269.0, + 293.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 1096.0, + 558.0, + 1096.0, + 558.0, + 1126.0, + 299.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2087.0, + 860.0, + 2087.0, + 860.0, + 2117.0, + 839.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 294.0, + 1405.0, + 294.0, + 1405.0, + 330.0, + 293.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 326.0, + 1404.0, + 326.0, + 1404.0, + 358.0, + 292.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 357.0, + 1404.0, + 357.0, + 1404.0, + 391.0, + 294.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 386.0, + 1404.0, + 386.0, + 1404.0, + 423.0, + 293.0, + 423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 418.0, + 1405.0, + 418.0, + 1405.0, + 452.0, + 294.0, + 452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 448.0, + 1405.0, + 448.0, + 1405.0, + 481.0, + 294.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 476.0, + 1405.0, + 476.0, + 1405.0, + 515.0, + 292.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 509.0, + 744.0, + 509.0, + 744.0, + 541.0, + 294.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 554.0, + 1406.0, + 554.0, + 1406.0, + 593.0, + 293.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 585.0, + 1407.0, + 585.0, + 1407.0, + 620.0, + 295.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 615.0, + 1407.0, + 615.0, + 1407.0, + 653.0, + 293.0, + 653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 646.0, + 1405.0, + 646.0, + 1405.0, + 683.0, + 293.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 678.0, + 1406.0, + 678.0, + 1406.0, + 713.0, + 295.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 706.0, + 1405.0, + 706.0, + 1405.0, + 744.0, + 293.0, + 744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 736.0, + 1405.0, + 736.0, + 1405.0, + 776.0, + 292.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 767.0, + 1405.0, + 767.0, + 1405.0, + 804.0, + 293.0, + 804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 799.0, + 1405.0, + 799.0, + 1405.0, + 834.0, + 295.0, + 834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 830.0, + 1406.0, + 830.0, + 1406.0, + 865.0, + 295.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 862.0, + 710.0, + 862.0, + 710.0, + 894.0, + 293.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 904.0, + 1409.0, + 904.0, + 1409.0, + 942.0, + 294.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 937.0, + 1405.0, + 937.0, + 1405.0, + 974.0, + 295.0, + 974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 966.0, + 1409.0, + 966.0, + 1409.0, + 1004.0, + 293.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 998.0, + 1407.0, + 998.0, + 1407.0, + 1035.0, + 294.0, + 1035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1028.0, + 831.0, + 1028.0, + 831.0, + 1066.0, + 294.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1144.0, + 1404.0, + 1144.0, + 1404.0, + 1179.0, + 294.0, + 1179.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1175.0, + 776.0, + 1175.0, + 776.0, + 1214.0, + 293.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 1175.0, + 1123.0, + 1175.0, + 1123.0, + 1214.0, + 809.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1305.0, + 1407.0, + 1305.0, + 1407.0, + 1339.0, + 296.0, + 1339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1337.0, + 1402.0, + 1337.0, + 1402.0, + 1368.0, + 324.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1368.0, + 957.0, + 1368.0, + 957.0, + 1399.0, + 324.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1413.0, + 1406.0, + 1413.0, + 1406.0, + 1453.0, + 291.0, + 1453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1444.0, + 1406.0, + 1444.0, + 1406.0, + 1484.0, + 320.0, + 1484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1479.0, + 705.0, + 1479.0, + 705.0, + 1510.0, + 324.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1528.0, + 1408.0, + 1528.0, + 1408.0, + 1562.0, + 295.0, + 1562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1559.0, + 794.0, + 1559.0, + 794.0, + 1594.0, + 322.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1608.0, + 1408.0, + 1608.0, + 1408.0, + 1643.0, + 296.0, + 1643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1638.0, + 1407.0, + 1638.0, + 1407.0, + 1673.0, + 323.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1667.0, + 396.0, + 1667.0, + 396.0, + 1704.0, + 324.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1719.0, + 1406.0, + 1719.0, + 1406.0, + 1754.0, + 296.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1748.0, + 1406.0, + 1748.0, + 1406.0, + 1788.0, + 320.0, + 1788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1780.0, + 701.0, + 1780.0, + 701.0, + 1815.0, + 320.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1831.0, + 1405.0, + 1831.0, + 1405.0, + 1866.0, + 294.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1859.0, + 1405.0, + 1859.0, + 1405.0, + 1900.0, + 319.0, + 1900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1892.0, + 919.0, + 1892.0, + 919.0, + 1927.0, + 322.0, + 1927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1977.0, + 296.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1972.0, + 1411.0, + 1972.0, + 1411.0, + 2011.0, + 322.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 2002.0, + 1258.0, + 2002.0, + 1258.0, + 2038.0, + 323.0, + 2038.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.877 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2113, + 836, + 2113 + ], + "score": 0.821 + }, + { + "category_id": 1, + "poly": [ + 298, + 947, + 1401, + 947, + 1401, + 1043, + 298, + 1043 + ], + "score": 0.745 + }, + { + "category_id": 1, + "poly": [ + 294, + 1059, + 1403, + 1059, + 1403, + 1124, + 294, + 1124 + ], + "score": 0.743 + }, + { + "category_id": 1, + "poly": [ + 299, + 836, + 1402, + 836, + 1402, + 932, + 299, + 932 + ], + "score": 0.734 + }, + { + "category_id": 1, + "poly": [ + 297, + 1139, + 1404, + 1139, + 1404, + 1205, + 297, + 1205 + ], + "score": 0.705 + }, + { + "category_id": 1, + "poly": [ + 301, + 1300, + 1404, + 1300, + 1404, + 1396, + 301, + 1396 + ], + "score": 0.705 + }, + { + "category_id": 1, + "poly": [ + 297, + 1220, + 1402, + 1220, + 1402, + 1287, + 297, + 1287 + ], + "score": 0.684 + }, + { + "category_id": 1, + "poly": [ + 299, + 724, + 1404, + 724, + 1404, + 819, + 299, + 819 + ], + "score": 0.661 + }, + { + "category_id": 1, + "poly": [ + 300, + 1605, + 1407, + 1605, + 1407, + 1701, + 300, + 1701 + ], + "score": 0.66 + }, + { + "category_id": 1, + "poly": [ + 292, + 1524, + 1404, + 1524, + 1404, + 1591, + 292, + 1591 + ], + "score": 0.656 + }, + { + "category_id": 1, + "poly": [ + 301, + 1413, + 1400, + 1413, + 1400, + 1510, + 301, + 1510 + ], + "score": 0.644 + }, + { + "category_id": 1, + "poly": [ + 299, + 1717, + 1402, + 1717, + 1402, + 1813, + 299, + 1813 + ], + "score": 0.61 + }, + { + "category_id": 1, + "poly": [ + 293, + 229, + 1405, + 229, + 1405, + 294, + 293, + 294 + ], + "score": 0.59 + }, + { + "category_id": 1, + "poly": [ + 302, + 613, + 1403, + 613, + 1403, + 709, + 302, + 709 + ], + "score": 0.588 + }, + { + "category_id": 1, + "poly": [ + 301, + 309, + 1404, + 309, + 1404, + 405, + 301, + 405 + ], + "score": 0.558 + }, + { + "category_id": 1, + "poly": [ + 300, + 421, + 1402, + 421, + 1402, + 516, + 300, + 516 + ], + "score": 0.552 + }, + { + "category_id": 1, + "poly": [ + 302, + 1828, + 1403, + 1828, + 1403, + 1924, + 302, + 1924 + ], + "score": 0.549 + }, + { + "category_id": 1, + "poly": [ + 294, + 533, + 1402, + 533, + 1402, + 598, + 294, + 598 + ], + "score": 0.514 + }, + { + "category_id": 1, + "poly": [ + 299, + 1941, + 1407, + 1941, + 1407, + 2035, + 299, + 2035 + ], + "score": 0.388 + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2123.0, + 831.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 947.0, + 1405.0, + 947.0, + 1405.0, + 984.0, + 294.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 978.0, + 1406.0, + 978.0, + 1406.0, + 1018.0, + 318.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1010.0, + 579.0, + 1010.0, + 579.0, + 1044.0, + 321.0, + 1044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1061.0, + 1406.0, + 1061.0, + 1406.0, + 1097.0, + 294.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1090.0, + 933.0, + 1090.0, + 933.0, + 1125.0, + 322.0, + 1125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 837.0, + 1406.0, + 837.0, + 1406.0, + 872.0, + 297.0, + 872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 869.0, + 1406.0, + 869.0, + 1406.0, + 904.0, + 323.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 901.0, + 901.0, + 901.0, + 901.0, + 932.0, + 325.0, + 932.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1140.0, + 1404.0, + 1140.0, + 1404.0, + 1176.0, + 295.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1173.0, + 1360.0, + 1173.0, + 1360.0, + 1206.0, + 324.0, + 1206.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1303.0, + 1404.0, + 1303.0, + 1404.0, + 1337.0, + 297.0, + 1337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1332.0, + 1408.0, + 1332.0, + 1408.0, + 1370.0, + 320.0, + 1370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1363.0, + 396.0, + 1363.0, + 396.0, + 1397.0, + 321.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1221.0, + 1407.0, + 1221.0, + 1407.0, + 1257.0, + 296.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1252.0, + 1331.0, + 1252.0, + 1331.0, + 1287.0, + 321.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 723.0, + 1408.0, + 723.0, + 1408.0, + 764.0, + 293.0, + 764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 754.0, + 1405.0, + 754.0, + 1405.0, + 795.0, + 321.0, + 795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 787.0, + 484.0, + 787.0, + 484.0, + 823.0, + 321.0, + 823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1606.0, + 1405.0, + 1606.0, + 1405.0, + 1641.0, + 297.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1637.0, + 1407.0, + 1637.0, + 1407.0, + 1675.0, + 322.0, + 1675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1666.0, + 874.0, + 1666.0, + 874.0, + 1703.0, + 324.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1525.0, + 1406.0, + 1525.0, + 1406.0, + 1561.0, + 295.0, + 1561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1555.0, + 1412.0, + 1555.0, + 1412.0, + 1594.0, + 320.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1415.0, + 1404.0, + 1415.0, + 1404.0, + 1449.0, + 297.0, + 1449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1444.0, + 1404.0, + 1444.0, + 1404.0, + 1481.0, + 321.0, + 1481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1475.0, + 1188.0, + 1475.0, + 1188.0, + 1513.0, + 321.0, + 1513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1715.0, + 1407.0, + 1715.0, + 1407.0, + 1756.0, + 293.0, + 1756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1749.0, + 1406.0, + 1749.0, + 1406.0, + 1787.0, + 323.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1780.0, + 669.0, + 1780.0, + 669.0, + 1814.0, + 322.0, + 1814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 231.0, + 1408.0, + 231.0, + 1408.0, + 263.0, + 297.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 260.0, + 898.0, + 260.0, + 898.0, + 295.0, + 325.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 613.0, + 1403.0, + 613.0, + 1403.0, + 650.0, + 296.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 644.0, + 1405.0, + 644.0, + 1405.0, + 685.0, + 321.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 677.0, + 801.0, + 677.0, + 801.0, + 711.0, + 323.0, + 711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 309.0, + 1409.0, + 309.0, + 1409.0, + 347.0, + 296.0, + 347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 340.0, + 1409.0, + 340.0, + 1409.0, + 379.0, + 320.0, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 373.0, + 1379.0, + 373.0, + 1379.0, + 407.0, + 322.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 419.0, + 1407.0, + 419.0, + 1407.0, + 459.0, + 294.0, + 459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 454.0, + 1406.0, + 454.0, + 1406.0, + 488.0, + 323.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 482.0, + 847.0, + 482.0, + 847.0, + 520.0, + 323.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1828.0, + 1409.0, + 1828.0, + 1409.0, + 1866.0, + 297.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1860.0, + 1408.0, + 1860.0, + 1408.0, + 1898.0, + 322.0, + 1898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1892.0, + 1129.0, + 1892.0, + 1129.0, + 1926.0, + 323.0, + 1926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 533.0, + 1404.0, + 533.0, + 1404.0, + 569.0, + 296.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 564.0, + 1387.0, + 564.0, + 1387.0, + 600.0, + 322.0, + 600.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1938.0, + 1408.0, + 1938.0, + 1408.0, + 1978.0, + 293.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1971.0, + 1407.0, + 1971.0, + 1407.0, + 2009.0, + 321.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 2003.0, + 858.0, + 2003.0, + 858.0, + 2037.0, + 323.0, + 2037.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.887 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 862, + 2088, + 862, + 2113, + 835, + 2113 + ], + "score": 0.828 + }, + { + "category_id": 1, + "poly": [ + 293, + 984, + 1401, + 984, + 1401, + 1050, + 293, + 1050 + ], + "score": 0.585 + }, + { + "category_id": 1, + "poly": [ + 295, + 870, + 1403, + 870, + 1403, + 966, + 295, + 966 + ], + "score": 0.53 + }, + { + "category_id": 1, + "poly": [ + 299, + 757, + 1404, + 757, + 1404, + 851, + 299, + 851 + ], + "score": 0.498 + }, + { + "category_id": 1, + "poly": [ + 299, + 1068, + 1405, + 1068, + 1405, + 1162, + 299, + 1162 + ], + "score": 0.432 + }, + { + "category_id": 1, + "poly": [ + 294, + 229, + 1403, + 229, + 1403, + 294, + 294, + 294 + ], + "score": 0.426 + }, + { + "category_id": 1, + "poly": [ + 292, + 674, + 1404, + 674, + 1404, + 738, + 292, + 738 + ], + "score": 0.412 + }, + { + "category_id": 1, + "poly": [ + 296, + 312, + 1400, + 312, + 1400, + 378, + 296, + 378 + ], + "score": 0.405 + }, + { + "category_id": 1, + "poly": [ + 300, + 477, + 1402, + 477, + 1402, + 573, + 300, + 573 + ], + "score": 0.394 + }, + { + "category_id": 1, + "poly": [ + 294, + 394, + 1402, + 394, + 1402, + 460, + 294, + 460 + ], + "score": 0.389 + }, + { + "category_id": 1, + "poly": [ + 290, + 591, + 1403, + 591, + 1403, + 656, + 290, + 656 + ], + "score": 0.359 + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 867.0, + 2085.0, + 867.0, + 2125.0, + 831.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 985.0, + 1406.0, + 985.0, + 1406.0, + 1021.0, + 295.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1016.0, + 1101.0, + 1016.0, + 1101.0, + 1051.0, + 321.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 871.0, + 1406.0, + 871.0, + 1406.0, + 906.0, + 297.0, + 906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 900.0, + 1406.0, + 900.0, + 1406.0, + 940.0, + 321.0, + 940.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 933.0, + 484.0, + 933.0, + 484.0, + 968.0, + 321.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 759.0, + 1408.0, + 759.0, + 1408.0, + 793.0, + 295.0, + 793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 788.0, + 1408.0, + 788.0, + 1408.0, + 825.0, + 321.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 814.0, + 399.0, + 814.0, + 399.0, + 855.0, + 321.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1066.0, + 1405.0, + 1066.0, + 1405.0, + 1105.0, + 294.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1097.0, + 1405.0, + 1097.0, + 1405.0, + 1137.0, + 319.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1128.0, + 491.0, + 1128.0, + 491.0, + 1164.0, + 321.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 228.0, + 1403.0, + 228.0, + 1403.0, + 264.0, + 296.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 260.0, + 1100.0, + 260.0, + 1100.0, + 296.0, + 322.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 668.0, + 1410.0, + 668.0, + 1410.0, + 716.0, + 291.0, + 716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 702.0, + 400.0, + 702.0, + 400.0, + 741.0, + 319.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 314.0, + 1402.0, + 314.0, + 1402.0, + 346.0, + 297.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 344.0, + 1390.0, + 344.0, + 1390.0, + 380.0, + 323.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 477.0, + 1407.0, + 477.0, + 1407.0, + 515.0, + 293.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 508.0, + 1407.0, + 508.0, + 1407.0, + 548.0, + 321.0, + 548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 538.0, + 907.0, + 538.0, + 907.0, + 574.0, + 324.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 392.0, + 1407.0, + 392.0, + 1407.0, + 434.0, + 293.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 427.0, + 713.0, + 427.0, + 713.0, + 461.0, + 323.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 593.0, + 1405.0, + 593.0, + 1405.0, + 629.0, + 294.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 622.0, + 1238.0, + 622.0, + 1238.0, + 658.0, + 322.0, + 658.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 358, + 1407, + 358, + 1407, + 480, + 298, + 480 + ], + "score": 0.965 + }, + { + "category_id": 2, + "poly": [ + 299, + 74, + 816, + 74, + 816, + 105, + 299, + 105 + ], + "score": 0.892 + }, + { + "category_id": 1, + "poly": [ + 311, + 1527, + 588, + 1527, + 588, + 1738, + 311, + 1738 + ], + "score": 0.882 + }, + { + "category_id": 1, + "poly": [ + 312, + 1265, + 588, + 1265, + 588, + 1414, + 312, + 1414 + ], + "score": 0.874 + }, + { + "category_id": 1, + "poly": [ + 311, + 1050, + 589, + 1050, + 589, + 1170, + 311, + 1170 + ], + "score": 0.871 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 864, + 2088, + 864, + 2113, + 835, + 2113 + ], + "score": 0.848 + }, + { + "category_id": 1, + "poly": [ + 609, + 1836, + 881, + 1836, + 881, + 1990, + 609, + 1990 + ], + "score": 0.829 + }, + { + "category_id": 1, + "poly": [ + 907, + 1048, + 1402, + 1048, + 1402, + 1196, + 907, + 1196 + ], + "score": 0.821 + }, + { + "category_id": 1, + "poly": [ + 907, + 1264, + 1399, + 1264, + 1399, + 1444, + 907, + 1444 + ], + "score": 0.82 + }, + { + "category_id": 1, + "poly": [ + 311, + 788, + 587, + 788, + 587, + 936, + 311, + 936 + ], + "score": 0.798 + }, + { + "category_id": 0, + "poly": [ + 300, + 225, + 672, + 225, + 672, + 262, + 300, + 262 + ], + "score": 0.775 + }, + { + "category_id": 0, + "poly": [ + 314, + 1234, + 452, + 1234, + 452, + 1261, + 314, + 1261 + ], + "score": 0.751 + }, + { + "category_id": 1, + "poly": [ + 907, + 766, + 1402, + 766, + 1402, + 979, + 907, + 979 + ], + "score": 0.701 + }, + { + "category_id": 0, + "poly": [ + 314, + 1495, + 452, + 1495, + 452, + 1523, + 314, + 1523 + ], + "score": 0.701 + }, + { + "category_id": 1, + "poly": [ + 905, + 1508, + 1401, + 1508, + 1401, + 1752, + 905, + 1752 + ], + "score": 0.694 + }, + { + "category_id": 1, + "poly": [ + 312, + 553, + 491, + 553, + 491, + 699, + 312, + 699 + ], + "score": 0.688 + }, + { + "category_id": 1, + "poly": [ + 609, + 1051, + 804, + 1051, + 804, + 1195, + 609, + 1195 + ], + "score": 0.681 + }, + { + "category_id": 1, + "poly": [ + 906, + 1819, + 1399, + 1819, + 1399, + 2034, + 906, + 2034 + ], + "score": 0.676 + }, + { + "category_id": 0, + "poly": [ + 314, + 1019, + 452, + 1019, + 452, + 1046, + 314, + 1046 + ], + "score": 0.653 + }, + { + "category_id": 1, + "poly": [ + 609, + 517, + 880, + 517, + 880, + 681, + 609, + 681 + ], + "score": 0.636 + }, + { + "category_id": 0, + "poly": [ + 313, + 756, + 452, + 756, + 452, + 783, + 313, + 783 + ], + "score": 0.588 + }, + { + "category_id": 1, + "poly": [ + 907, + 547, + 1400, + 547, + 1400, + 699, + 907, + 699 + ], + "score": 0.574 + }, + { + "category_id": 0, + "poly": [ + 313, + 520, + 453, + 520, + 453, + 547, + 313, + 547 + ], + "score": 0.548 + }, + { + "category_id": 0, + "poly": [ + 907, + 1790, + 1048, + 1790, + 1048, + 1818, + 907, + 1818 + ], + "score": 0.486 + }, + { + "category_id": 1, + "poly": [ + 610, + 752, + 882, + 752, + 882, + 935, + 610, + 935 + ], + "score": 0.482 + }, + { + "category_id": 1, + "poly": [ + 609, + 1497, + 875, + 1497, + 875, + 1677, + 609, + 1677 + ], + "score": 0.422 + }, + { + "category_id": 0, + "poly": [ + 314, + 1839, + 452, + 1839, + 452, + 1867, + 314, + 1867 + ], + "score": 0.413 + }, + { + "category_id": 1, + "poly": [ + 907, + 1478, + 1048, + 1478, + 1048, + 1506, + 907, + 1506 + ], + "score": 0.378 + }, + { + "category_id": 1, + "poly": [ + 907, + 737, + 1048, + 737, + 1048, + 765, + 907, + 765 + ], + "score": 0.345 + }, + { + "category_id": 0, + "poly": [ + 907, + 737, + 1048, + 737, + 1048, + 765, + 907, + 765 + ], + "score": 0.34 + }, + { + "category_id": 0, + "poly": [ + 612, + 1235, + 884, + 1235, + 884, + 1262, + 612, + 1262 + ], + "score": 0.31 + }, + { + "category_id": 1, + "poly": [ + 311, + 1837, + 591, + 1837, + 591, + 1959, + 311, + 1959 + ], + "score": 0.307 + }, + { + "category_id": 0, + "poly": [ + 610, + 1497, + 882, + 1497, + 882, + 1526, + 610, + 1526 + ], + "score": 0.255 + }, + { + "category_id": 1, + "poly": [ + 907, + 1790, + 1048, + 1790, + 1048, + 1818, + 907, + 1818 + ], + "score": 0.238 + }, + { + "category_id": 1, + "poly": [ + 906, + 518, + 1048, + 518, + 1048, + 545, + 906, + 545 + ], + "score": 0.218 + }, + { + "category_id": 0, + "poly": [ + 610, + 1018, + 883, + 1018, + 883, + 1047, + 610, + 1047 + ], + "score": 0.217 + }, + { + "category_id": 0, + "poly": [ + 907, + 1478, + 1048, + 1478, + 1048, + 1506, + 907, + 1506 + ], + "score": 0.216 + }, + { + "category_id": 0, + "poly": [ + 610, + 755, + 883, + 755, + 883, + 784, + 610, + 784 + ], + "score": 0.214 + }, + { + "category_id": 1, + "poly": [ + 609, + 1234, + 881, + 1234, + 881, + 1393, + 609, + 1393 + ], + "score": 0.206 + }, + { + "category_id": 1, + "poly": [ + 906, + 1017, + 1047, + 1017, + 1047, + 1046, + 906, + 1046 + ], + "score": 0.149 + }, + { + "category_id": 1, + "poly": [ + 300, + 225, + 672, + 225, + 672, + 262, + 300, + 262 + ], + "score": 0.113 + }, + { + "category_id": 1, + "poly": [ + 905, + 1233, + 1046, + 1233, + 1046, + 1261, + 905, + 1261 + ], + "score": 0.095 + }, + { + "category_id": 13, + "poly": [ + 1027, + 577, + 1119, + 577, + 1119, + 604, + 1027, + 604 + ], + "score": 0.91, + "latex": "k \\ < \\ n" + }, + { + "category_id": 13, + "poly": [ + 1237, + 2001, + 1374, + 2001, + 1374, + 2034, + 1237, + 2034 + ], + "score": 0.89, + "latex": "b [ n - i - 1 ]" + }, + { + "category_id": 13, + "poly": [ + 1317, + 889, + 1365, + 889, + 1365, + 917, + 1317, + 917 + ], + "score": 0.88, + "latex": "w , t" + }, + { + "category_id": 13, + "poly": [ + 1328, + 1970, + 1367, + 1970, + 1367, + 2002, + 1328, + 2002 + ], + "score": 0.88, + "latex": "c [ i ]" + }, + { + "category_id": 13, + "poly": [ + 1164, + 917, + 1213, + 917, + 1213, + 950, + 1164, + 950 + ], + "score": 0.83, + "latex": "w [ i ]" + }, + { + "category_id": 13, + "poly": [ + 1283, + 918, + 1324, + 918, + 1324, + 950, + 1283, + 950 + ], + "score": 0.8, + "latex": "t [ i ] ," + }, + { + "category_id": 13, + "poly": [ + 978, + 2000, + 1017, + 2000, + 1017, + 2034, + 978, + 2034 + ], + "score": 0.72, + "latex": "b [ i ]" + }, + { + "category_id": 13, + "poly": [ + 1171, + 1946, + 1191, + 1946, + 1191, + 1968, + 1171, + 1968 + ], + "score": 0.69, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1263, + 551, + 1284, + 551, + 1284, + 573, + 1263, + 573 + ], + "score": 0.67, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1156, + 951, + 1170, + 951, + 1170, + 975, + 1156, + 975 + ], + "score": 0.64, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1129, + 1114, + 1148, + 1114, + 1148, + 1135, + 1129, + 1135 + ], + "score": 0.63, + "latex": "a" + }, + { + "category_id": 13, + "poly": [ + 1041, + 1941, + 1057, + 1941, + 1057, + 1967, + 1041, + 1967 + ], + "score": 0.6, + "latex": "b" + }, + { + "category_id": 13, + "poly": [ + 1205, + 1109, + 1221, + 1109, + 1221, + 1136, + 1205, + 1136 + ], + "score": 0.6, + "latex": "b" + }, + { + "category_id": 13, + "poly": [ + 1380, + 1946, + 1396, + 1946, + 1396, + 1967, + 1380, + 1967 + ], + "score": 0.56, + "latex": "c" + }, + { + "category_id": 13, + "poly": [ + 313, + 1871, + 373, + 1871, + 373, + 1897, + 313, + 1897 + ], + "score": 0.55, + "latex": "\\ a \\gets" + }, + { + "category_id": 13, + "poly": [ + 314, + 1386, + 456, + 1386, + 456, + 1413, + 314, + 1413 + ], + "score": 0.54, + "latex": "\\mathrm { ~ e ~ } { \\gets } \\mathbf { S } \\mathbf { U } \\mathbf { M } \\mathrm { ~ d ~ }" + }, + { + "category_id": 13, + "poly": [ + 314, + 1707, + 448, + 1707, + 448, + 1738, + 314, + 1738 + ], + "score": 0.49, + "latex": "\\mathsf { g } \\gets \\mathsf { S U M } \\mathrm { ~ f ~ }" + }, + { + "category_id": 13, + "poly": [ + 313, + 551, + 371, + 551, + 371, + 577, + 313, + 577 + ], + "score": 0.48, + "latex": "\\mathrm { k } " + }, + { + "category_id": 13, + "poly": [ + 312, + 787, + 372, + 787, + 372, + 812, + 312, + 812 + ], + "score": 0.36, + "latex": "\\bar { w } " + }, + { + "category_id": 13, + "poly": [ + 475, + 1141, + 524, + 1141, + 524, + 1169, + 475, + 1169 + ], + "score": 0.35, + "latex": "( > 0 )" + }, + { + "category_id": 13, + "poly": [ + 312, + 1901, + 371, + 1901, + 371, + 1926, + 312, + 1926 + ], + "score": 0.35, + "latex": "\\ u \\text b \\gets" + }, + { + "category_id": 13, + "poly": [ + 315, + 1931, + 371, + 1931, + 371, + 1957, + 315, + 1957 + ], + "score": 0.35, + "latex": "\\subset " + }, + { + "category_id": 13, + "poly": [ + 314, + 1141, + 463, + 1141, + 463, + 1169, + 314, + 1169 + ], + "score": 0.31, + "latex": "\\mathsf { d } \\gets \\mathbf { C o u v r } \\mathsf { T }" + }, + { + "category_id": 13, + "poly": [ + 471, + 1356, + 520, + 1356, + 520, + 1384, + 471, + 1384 + ], + "score": 0.31, + "latex": "( > 0 )" + }, + { + "category_id": 13, + "poly": [ + 314, + 1357, + 371, + 1357, + 371, + 1382, + 314, + 1382 + ], + "score": 0.27, + "latex": "\\mathrm { ~ d ~ } " + }, + { + "category_id": 13, + "poly": [ + 313, + 1587, + 464, + 1587, + 464, + 1614, + 313, + 1614 + ], + "score": 0.26, + "latex": "\\mathbf { \\boldsymbol { \\mathrm { c } } } \\gets \\mathbf { \\boldsymbol { S } } \\mathbf { \\boldsymbol { O } } \\mathbf { R } \\mathbf { \\boldsymbol { T } } \\ \\mathbf { \\boldsymbol { x } }" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 817.0, + 72.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 222.0, + 674.0, + 222.0, + 674.0, + 268.0, + 294.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1229.0, + 458.0, + 1229.0, + 458.0, + 1267.0, + 309.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1490.0, + 458.0, + 1490.0, + 458.0, + 1529.0, + 309.0, + 1529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1014.0, + 457.0, + 1014.0, + 457.0, + 1052.0, + 309.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 751.0, + 458.0, + 751.0, + 458.0, + 789.0, + 309.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 515.0, + 456.0, + 515.0, + 456.0, + 553.0, + 311.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 1783.0, + 1052.0, + 1783.0, + 1052.0, + 1824.0, + 903.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1834.0, + 458.0, + 1834.0, + 458.0, + 1873.0, + 309.0, + 1873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 730.0, + 1052.0, + 730.0, + 1052.0, + 771.0, + 903.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 1229.0, + 885.0, + 1229.0, + 885.0, + 1272.0, + 608.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 1491.0, + 885.0, + 1491.0, + 885.0, + 1536.0, + 608.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 610.0, + 1014.0, + 885.0, + 1014.0, + 885.0, + 1056.0, + 610.0, + 1056.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 1471.0, + 1052.0, + 1471.0, + 1052.0, + 1512.0, + 903.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 609.0, + 749.0, + 886.0, + 749.0, + 886.0, + 794.0, + 609.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 357.0, + 1408.0, + 357.0, + 1408.0, + 395.0, + 292.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 388.0, + 1407.0, + 388.0, + 1407.0, + 427.0, + 292.0, + 427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 420.0, + 1407.0, + 420.0, + 1407.0, + 457.0, + 292.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 446.0, + 367.0, + 446.0, + 367.0, + 485.0, + 291.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1524.0, + 458.0, + 1524.0, + 458.0, + 1553.0, + 308.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1554.0, + 461.0, + 1554.0, + 461.0, + 1586.0, + 307.0, + 1586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1582.0, + 312.0, + 1582.0, + 312.0, + 1617.0, + 308.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 1582.0, + 468.0, + 1582.0, + 468.0, + 1617.0, + 465.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1609.0, + 469.0, + 1609.0, + 469.0, + 1651.0, + 308.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 1645.0, + 515.0, + 1645.0, + 515.0, + 1676.0, + 311.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 1672.0, + 592.0, + 1672.0, + 592.0, + 1708.0, + 310.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 1707.0, + 313.0, + 1707.0, + 313.0, + 1736.0, + 310.0, + 1736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1707.0, + 458.0, + 1707.0, + 458.0, + 1736.0, + 449.0, + 1736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1258.0, + 460.0, + 1258.0, + 460.0, + 1294.0, + 308.0, + 1294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1291.0, + 559.0, + 1291.0, + 559.0, + 1322.0, + 309.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1321.0, + 592.0, + 1321.0, + 592.0, + 1353.0, + 308.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1350.0, + 313.0, + 1350.0, + 313.0, + 1387.0, + 309.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1350.0, + 470.0, + 1350.0, + 470.0, + 1387.0, + 372.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 521.0, + 1350.0, + 562.0, + 1350.0, + 562.0, + 1387.0, + 521.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1382.0, + 313.0, + 1382.0, + 313.0, + 1414.0, + 309.0, + 1414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 457.0, + 1382.0, + 461.0, + 1382.0, + 461.0, + 1414.0, + 457.0, + 1414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1047.0, + 459.0, + 1047.0, + 459.0, + 1079.0, + 309.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1078.0, + 460.0, + 1078.0, + 460.0, + 1109.0, + 308.0, + 1109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1106.0, + 593.0, + 1106.0, + 593.0, + 1140.0, + 308.0, + 1140.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 1134.0, + 474.0, + 1134.0, + 474.0, + 1173.0, + 464.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 525.0, + 1134.0, + 565.0, + 1134.0, + 565.0, + 1173.0, + 525.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 1833.0, + 885.0, + 1833.0, + 885.0, + 1872.0, + 608.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 1865.0, + 686.0, + 1865.0, + 686.0, + 1898.0, + 607.0, + 1898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 1894.0, + 799.0, + 1894.0, + 799.0, + 1932.0, + 606.0, + 1932.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 1924.0, + 705.0, + 1924.0, + 705.0, + 1962.0, + 607.0, + 1962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 1955.0, + 798.0, + 1955.0, + 798.0, + 1990.0, + 608.0, + 1990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 1045.0, + 1397.0, + 1045.0, + 1397.0, + 1077.0, + 905.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 902.0, + 1072.0, + 1402.0, + 1072.0, + 1402.0, + 1112.0, + 902.0, + 1112.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 1109.0, + 1128.0, + 1109.0, + 1128.0, + 1139.0, + 906.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1149.0, + 1109.0, + 1204.0, + 1109.0, + 1204.0, + 1139.0, + 1149.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1222.0, + 1109.0, + 1397.0, + 1109.0, + 1397.0, + 1139.0, + 1222.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 1138.0, + 1397.0, + 1138.0, + 1397.0, + 1171.0, + 905.0, + 1171.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 1164.0, + 970.0, + 1164.0, + 970.0, + 1200.0, + 903.0, + 1200.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 1260.0, + 1398.0, + 1260.0, + 1398.0, + 1295.0, + 904.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 1291.0, + 1399.0, + 1291.0, + 1399.0, + 1324.0, + 905.0, + 1324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 1322.0, + 1399.0, + 1322.0, + 1399.0, + 1354.0, + 905.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 1352.0, + 1400.0, + 1352.0, + 1400.0, + 1385.0, + 904.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 1385.0, + 1399.0, + 1385.0, + 1399.0, + 1415.0, + 906.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 907.0, + 1414.0, + 1293.0, + 1414.0, + 1293.0, + 1444.0, + 907.0, + 1444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 785.0, + 311.0, + 785.0, + 311.0, + 813.0, + 308.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 373.0, + 785.0, + 457.0, + 785.0, + 457.0, + 813.0, + 373.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 812.0, + 459.0, + 812.0, + 459.0, + 847.0, + 309.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 844.0, + 535.0, + 844.0, + 535.0, + 875.0, + 309.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 873.0, + 592.0, + 873.0, + 592.0, + 907.0, + 310.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 905.0, + 534.0, + 905.0, + 534.0, + 936.0, + 309.0, + 936.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 764.0, + 1399.0, + 764.0, + 1399.0, + 798.0, + 905.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 794.0, + 1398.0, + 794.0, + 1398.0, + 827.0, + 905.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 826.0, + 1402.0, + 826.0, + 1402.0, + 857.0, + 904.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 902.0, + 855.0, + 1400.0, + 855.0, + 1400.0, + 889.0, + 902.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 886.0, + 1316.0, + 886.0, + 1316.0, + 919.0, + 904.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1366.0, + 886.0, + 1400.0, + 886.0, + 1400.0, + 919.0, + 1366.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 917.0, + 1163.0, + 917.0, + 1163.0, + 951.0, + 906.0, + 951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.0, + 917.0, + 1282.0, + 917.0, + 1282.0, + 951.0, + 1214.0, + 951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1325.0, + 917.0, + 1398.0, + 917.0, + 1398.0, + 951.0, + 1325.0, + 951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 947.0, + 1155.0, + 947.0, + 1155.0, + 981.0, + 905.0, + 981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 947.0, + 1360.0, + 947.0, + 1360.0, + 981.0, + 1171.0, + 981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 1506.0, + 1397.0, + 1506.0, + 1397.0, + 1539.0, + 905.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 1537.0, + 1402.0, + 1537.0, + 1402.0, + 1570.0, + 905.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 1565.0, + 1399.0, + 1565.0, + 1399.0, + 1601.0, + 904.0, + 1601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 1596.0, + 1400.0, + 1596.0, + 1400.0, + 1632.0, + 905.0, + 1632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 1628.0, + 1398.0, + 1628.0, + 1398.0, + 1661.0, + 904.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 1657.0, + 1399.0, + 1657.0, + 1399.0, + 1691.0, + 904.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 1689.0, + 1399.0, + 1689.0, + 1399.0, + 1723.0, + 906.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 1721.0, + 1293.0, + 1721.0, + 1293.0, + 1752.0, + 908.0, + 1752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 548.0, + 312.0, + 548.0, + 312.0, + 579.0, + 309.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 548.0, + 428.0, + 548.0, + 428.0, + 579.0, + 372.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 576.0, + 461.0, + 576.0, + 461.0, + 612.0, + 307.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 607.0, + 467.0, + 607.0, + 467.0, + 639.0, + 307.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 638.0, + 492.0, + 638.0, + 492.0, + 671.0, + 309.0, + 671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 669.0, + 460.0, + 669.0, + 460.0, + 700.0, + 309.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 603.0, + 1043.0, + 689.0, + 1043.0, + 689.0, + 1081.0, + 603.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 1073.0, + 809.0, + 1073.0, + 809.0, + 1113.0, + 607.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 1104.0, + 804.0, + 1104.0, + 804.0, + 1143.0, + 608.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 603.0, + 1133.0, + 706.0, + 1133.0, + 706.0, + 1175.0, + 603.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 1167.0, + 637.0, + 1167.0, + 637.0, + 1202.0, + 605.0, + 1202.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 1817.0, + 1398.0, + 1817.0, + 1398.0, + 1852.0, + 906.0, + 1852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 907.0, + 1850.0, + 1398.0, + 1850.0, + 1398.0, + 1880.0, + 907.0, + 1880.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 1878.0, + 1400.0, + 1878.0, + 1400.0, + 1912.0, + 905.0, + 1912.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 907.0, + 1910.0, + 1399.0, + 1910.0, + 1399.0, + 1944.0, + 907.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 1939.0, + 1040.0, + 1939.0, + 1040.0, + 1975.0, + 904.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 1939.0, + 1170.0, + 1939.0, + 1170.0, + 1975.0, + 1058.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1192.0, + 1939.0, + 1379.0, + 1939.0, + 1379.0, + 1975.0, + 1192.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1397.0, + 1939.0, + 1400.0, + 1939.0, + 1400.0, + 1975.0, + 1397.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 1969.0, + 1327.0, + 1969.0, + 1327.0, + 2003.0, + 906.0, + 2003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1368.0, + 1969.0, + 1397.0, + 1969.0, + 1397.0, + 2003.0, + 1368.0, + 2003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 1999.0, + 977.0, + 1999.0, + 977.0, + 2037.0, + 906.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1018.0, + 1999.0, + 1236.0, + 1999.0, + 1236.0, + 2037.0, + 1018.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1375.0, + 1999.0, + 1386.0, + 1999.0, + 1386.0, + 2037.0, + 1375.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 515.0, + 884.0, + 515.0, + 884.0, + 555.0, + 608.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 548.0, + 686.0, + 548.0, + 686.0, + 584.0, + 606.0, + 584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 603.0, + 574.0, + 849.0, + 574.0, + 849.0, + 617.0, + 603.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 605.0, + 704.0, + 605.0, + 704.0, + 647.0, + 605.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 636.0, + 668.0, + 636.0, + 668.0, + 677.0, + 607.0, + 677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 540.0, + 1262.0, + 540.0, + 1262.0, + 581.0, + 903.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1285.0, + 540.0, + 1404.0, + 540.0, + 1404.0, + 581.0, + 1285.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 573.0, + 1026.0, + 573.0, + 1026.0, + 608.0, + 903.0, + 608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 573.0, + 1400.0, + 573.0, + 1400.0, + 608.0, + 1120.0, + 608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 601.0, + 1400.0, + 601.0, + 1400.0, + 642.0, + 903.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 636.0, + 1399.0, + 636.0, + 1399.0, + 669.0, + 906.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 667.0, + 1283.0, + 667.0, + 1283.0, + 700.0, + 906.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 750.0, + 886.0, + 750.0, + 886.0, + 790.0, + 607.0, + 790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 782.0, + 688.0, + 782.0, + 688.0, + 819.0, + 606.0, + 819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 812.0, + 810.0, + 812.0, + 810.0, + 849.0, + 607.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 610.0, + 841.0, + 800.0, + 841.0, + 800.0, + 879.0, + 610.0, + 879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 873.0, + 703.0, + 873.0, + 703.0, + 909.0, + 606.0, + 909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 902.0, + 654.0, + 902.0, + 654.0, + 940.0, + 606.0, + 940.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 1494.0, + 877.0, + 1494.0, + 877.0, + 1531.0, + 608.0, + 1531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 1525.0, + 687.0, + 1525.0, + 687.0, + 1558.0, + 607.0, + 1558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 1553.0, + 810.0, + 1553.0, + 810.0, + 1590.0, + 607.0, + 1590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 1583.0, + 800.0, + 1583.0, + 800.0, + 1620.0, + 608.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 1614.0, + 706.0, + 1614.0, + 706.0, + 1653.0, + 604.0, + 1653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 603.0, + 1643.0, + 656.0, + 1643.0, + 656.0, + 1682.0, + 603.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 1471.0, + 1052.0, + 1471.0, + 1052.0, + 1512.0, + 903.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 730.0, + 1052.0, + 730.0, + 1052.0, + 771.0, + 903.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 1835.0, + 455.0, + 1835.0, + 455.0, + 1870.0, + 310.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 374.0, + 1868.0, + 458.0, + 1868.0, + 458.0, + 1900.0, + 374.0, + 1900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1896.0, + 311.0, + 1896.0, + 311.0, + 1930.0, + 308.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1896.0, + 515.0, + 1896.0, + 515.0, + 1930.0, + 372.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1926.0, + 314.0, + 1926.0, + 314.0, + 1958.0, + 309.0, + 1958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1926.0, + 594.0, + 1926.0, + 594.0, + 1958.0, + 372.0, + 1958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 1783.0, + 1052.0, + 1783.0, + 1052.0, + 1824.0, + 903.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 514.0, + 1052.0, + 514.0, + 1052.0, + 549.0, + 905.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 1228.0, + 885.0, + 1228.0, + 885.0, + 1269.0, + 608.0, + 1269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 1261.0, + 685.0, + 1261.0, + 685.0, + 1295.0, + 607.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 1289.0, + 798.0, + 1289.0, + 798.0, + 1328.0, + 608.0, + 1328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 1319.0, + 704.0, + 1319.0, + 704.0, + 1360.0, + 605.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 1352.0, + 636.0, + 1352.0, + 636.0, + 1386.0, + 608.0, + 1386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 1011.0, + 1053.0, + 1011.0, + 1053.0, + 1052.0, + 903.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 222.0, + 674.0, + 222.0, + 674.0, + 268.0, + 294.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 1230.0, + 1051.0, + 1230.0, + 1051.0, + 1266.0, + 905.0, + 1266.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 305, + 1447, + 1394, + 1447, + 1394, + 1723, + 305, + 1723 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 298, + 1972, + 1404, + 1972, + 1404, + 2035, + 298, + 2035 + ], + "score": 0.941 + }, + { + "category_id": 4, + "poly": [ + 297, + 1752, + 1408, + 1752, + 1408, + 1845, + 297, + 1845 + ], + "score": 0.939 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 814, + 76, + 814, + 104, + 300, + 104 + ], + "score": 0.884 + }, + { + "category_id": 0, + "poly": [ + 302, + 1905, + 720, + 1905, + 720, + 1940, + 302, + 1940 + ], + "score": 0.883 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2112, + 836, + 2112 + ], + "score": 0.855 + }, + { + "category_id": 4, + "poly": [ + 296, + 1319, + 1406, + 1319, + 1406, + 1413, + 296, + 1413 + ], + "score": 0.823 + }, + { + "category_id": 5, + "poly": [ + 299, + 118, + 1409, + 118, + 1409, + 1288, + 299, + 1288 + ], + "score": 0.721, + "html": "
Program 6: IO example: t←[int] Input: p←[int] [4 8 11 2], C←MAP(-1)t [2341] d←MAP(-1)p Output: e ←ZIPWITH(+)c d 1 f←MINIMUMeDescription: Umberto has a large collection of ties and match- ing pocket squares—too large, his wife says—and he needs to sell one pair. Given their values as arrays t and p,assuming that he sells the cheapest pair, and selling costs 2,how much will he lose from the sale?
Program 7: IO example: s←[int] Input: p←[int] [4723], C ← SCANL1(+)p [2131] d ←ZIPWITH(*)S C Output: e←SUMd 62Description: Zack always promised his n friends to buy them candy, but never did. Now he won the lottery and counts how often and how much candy he promised to his friends,obtaining arrays p (num- ber of promises) and s (number of promised sweets). He announces that to repay them,he will buy s[1]+s[2]+...+s[n] pieces of candy for the firstp[1]days,thens[2]+s[3]+...+s[n]for p[2] days,and so on,until he has fulfilled all promises. How much candy will he buy in total?
Program 8: IO example: s←[int] Input: b ←REVERSE S [12457] C ←ZIPWITH(-)b s Output: d ←FILTER(>O)C 9 e←SuMdDescription: Vivian loves rearranging things.Most of all,when she sees a row of heaps, she wants to make sure that each heap has more items than the one to its left. She is also obsessed with efficiency, so always moves the least possible number of items.Her dad really dislikes if she changes the size of heaps,so she only moves single items between them,making sure that the set of sizes of the heaps is the same as at the start; they are only in a different order. When you come in, you see heaps of sizes (of course,sizes strictly monotonically increasing)s[O],s[1],... s[n].What is the maximal number of items that Vivian could have moved?
" + }, + { + "category_id": 1, + "poly": [ + 296, + 1319, + 1406, + 1319, + 1406, + 1413, + 296, + 1413 + ], + "score": 0.237 + }, + { + "category_id": 13, + "poly": [ + 1271, + 1321, + 1351, + 1321, + 1351, + 1349, + 1271, + 1349 + ], + "score": 0.9, + "latex": "T = 4" + }, + { + "category_id": 13, + "poly": [ + 1054, + 722, + 1351, + 722, + 1351, + 751, + 1054, + 751 + ], + "score": 0.9, + "latex": "\\mathtt { s } [ 2 ] + \\mathtt { s } [ 3 ] + \\dots + \\mathtt { s } [ \\mathtt { n } ]" + }, + { + "category_id": 13, + "poly": [ + 810, + 691, + 1108, + 691, + 1108, + 720, + 810, + 720 + ], + "score": 0.77, + "latex": "\\mathbf { s } \\left[ 1 \\right] + \\mathbf { s } \\left[ 2 \\right] + \\mathbf { . } \\mathbf { \\sigma . } \\mathbf { . } + \\mathbf { s } \\left[ \\mathrm { n } \\right]" + }, + { + "category_id": 13, + "poly": [ + 1127, + 512, + 1148, + 512, + 1148, + 535, + 1127, + 535 + ], + "score": 0.75, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 807, + 752, + 874, + 752, + 874, + 783, + 807, + 783 + ], + "score": 0.65, + "latex": "\\mathrm { ~ p ~ } [ 2 ]" + }, + { + "category_id": 13, + "poly": [ + 1296, + 603, + 1321, + 603, + 1321, + 630, + 1296, + 630 + ], + "score": 0.64, + "latex": "\\mathrm { p }" + }, + { + "category_id": 13, + "poly": [ + 314, + 1125, + 456, + 1125, + 456, + 1153, + 314, + 1153 + ], + "score": 0.57, + "latex": "\\mathrm { ~ e ~ } { \\gets } \\mathbf { S } \\mathbf { U } \\mathbf { M } \\mathrm { ~ d ~ }" + }, + { + "category_id": 13, + "poly": [ + 312, + 1033, + 509, + 1033, + 509, + 1062, + 312, + 1062 + ], + "score": 0.49, + "latex": "\\mathrm { \\Delta b \\gets R E V E R S E \\ { s } }" + }, + { + "category_id": 13, + "poly": [ + 858, + 723, + 926, + 723, + 926, + 751, + 858, + 751 + ], + "score": 0.47, + "latex": "\\mathrm { ~ p ~ } [ \\mathrm { ~ 1 ~ } ]" + }, + { + "category_id": 13, + "poly": [ + 1044, + 633, + 1064, + 633, + 1064, + 657, + 1044, + 657 + ], + "score": 0.46, + "latex": "_ { \\textrm { \\tiny S } }" + }, + { + "category_id": 13, + "poly": [ + 471, + 1095, + 519, + 1095, + 519, + 1122, + 471, + 1122 + ], + "score": 0.39, + "latex": "( > 0" + }, + { + "category_id": 13, + "poly": [ + 315, + 1005, + 371, + 1005, + 371, + 1030, + 315, + 1030 + ], + "score": 0.38, + "latex": "\\scriptscriptstyle \\mathrm { ~ s ~ } \\gets" + }, + { + "category_id": 13, + "poly": [ + 312, + 297, + 372, + 297, + 372, + 324, + 312, + 324 + ], + "score": 0.34, + "latex": "\\mathrm { ~ p ~ } \\gets" + }, + { + "category_id": 13, + "poly": [ + 315, + 589, + 373, + 589, + 373, + 615, + 315, + 615 + ], + "score": 0.34, + "latex": "\\scriptscriptstyle \\mathrm { ~ s ~ } \\gets" + }, + { + "category_id": 13, + "poly": [ + 313, + 265, + 373, + 265, + 373, + 290, + 313, + 290 + ], + "score": 0.33, + "latex": "\\ t \\gets" + }, + { + "category_id": 13, + "poly": [ + 314, + 356, + 434, + 356, + 434, + 383, + 314, + 383 + ], + "score": 0.3, + "latex": "\\mathrm { d } \\mathrm { M A P }" + }, + { + "category_id": 13, + "poly": [ + 312, + 621, + 372, + 621, + 372, + 648, + 312, + 648 + ], + "score": 0.26, + "latex": "\\mathrm { ~ p ~ } \\gets" + }, + { + "category_id": 13, + "poly": [ + 314, + 1096, + 371, + 1096, + 371, + 1121, + 314, + 1121 + ], + "score": 0.26, + "latex": "\\mathrm { ~ d ~ } " + }, + { + "category_id": 13, + "poly": [ + 314, + 1064, + 487, + 1064, + 487, + 1093, + 314, + 1093 + ], + "score": 0.25, + "latex": "\\mathrm { { c } \\gets \\mathrm { { Z I P W I T H } } }" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 1474.0, + 609.0, + 1474.0, + 609.0, + 1503.0, + 591.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 613.0, + 1478.0, + 634.0, + 1478.0, + 634.0, + 1503.0, + 613.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 636.0, + 1478.0, + 656.0, + 1478.0, + 656.0, + 1503.0, + 636.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 660.0, + 1478.0, + 680.0, + 1478.0, + 680.0, + 1504.0, + 660.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 1471.0, + 705.0, + 1471.0, + 705.0, + 1504.0, + 682.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 1471.0, + 727.0, + 1471.0, + 727.0, + 1503.0, + 708.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 732.0, + 1477.0, + 750.0, + 1477.0, + 750.0, + 1503.0, + 732.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 755.0, + 1478.0, + 775.0, + 1478.0, + 775.0, + 1504.0, + 755.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 1474.0, + 800.0, + 1474.0, + 800.0, + 1505.0, + 780.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 802.0, + 1479.0, + 821.0, + 1479.0, + 821.0, + 1504.0, + 802.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 826.0, + 1474.0, + 845.0, + 1474.0, + 845.0, + 1503.0, + 826.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 849.0, + 1474.0, + 869.0, + 1474.0, + 869.0, + 1501.0, + 849.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 1449.0, + 893.0, + 1449.0, + 893.0, + 1503.0, + 872.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 895.0, + 1449.0, + 916.0, + 1449.0, + 916.0, + 1503.0, + 895.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 1465.0, + 940.0, + 1465.0, + 940.0, + 1505.0, + 919.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 944.0, + 1471.0, + 962.0, + 1471.0, + 962.0, + 1503.0, + 944.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 967.0, + 1474.0, + 986.0, + 1474.0, + 986.0, + 1503.0, + 967.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 989.0, + 1460.0, + 1012.0, + 1460.0, + 1012.0, + 1504.0, + 989.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1013.0, + 1466.0, + 1034.0, + 1466.0, + 1034.0, + 1504.0, + 1013.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 1448.0, + 1058.0, + 1448.0, + 1058.0, + 1503.0, + 1037.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1060.0, + 1467.0, + 1081.0, + 1467.0, + 1081.0, + 1504.0, + 1060.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1085.0, + 1465.0, + 1106.0, + 1465.0, + 1106.0, + 1504.0, + 1085.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1110.0, + 1456.0, + 1127.0, + 1456.0, + 1127.0, + 1501.0, + 1110.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 1454.0, + 1150.0, + 1454.0, + 1150.0, + 1503.0, + 1133.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 1454.0, + 1177.0, + 1454.0, + 1177.0, + 1505.0, + 1156.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1184.0, + 1488.0, + 1195.0, + 1488.0, + 1195.0, + 1501.0, + 1184.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1230.0, + 1492.0, + 1241.0, + 1492.0, + 1241.0, + 1503.0, + 1230.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 1477.0, + 1269.0, + 1477.0, + 1269.0, + 1501.0, + 1251.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1272.0, + 1471.0, + 1294.0, + 1471.0, + 1294.0, + 1503.0, + 1272.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1298.0, + 1460.0, + 1315.0, + 1460.0, + 1315.0, + 1503.0, + 1298.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1320.0, + 1448.0, + 1340.0, + 1448.0, + 1340.0, + 1503.0, + 1320.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1344.0, + 1445.0, + 1363.0, + 1445.0, + 1363.0, + 1503.0, + 1344.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1367.0, + 1473.0, + 1386.0, + 1473.0, + 1386.0, + 1503.0, + 1367.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 438.0, + 1505.0, + 588.0, + 1505.0, + 588.0, + 1526.0, + 438.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 612.0, + 1505.0, + 635.0, + 1505.0, + 635.0, + 1528.0, + 612.0, + 1528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 636.0, + 1507.0, + 681.0, + 1507.0, + 681.0, + 1528.0, + 636.0, + 1528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 1505.0, + 706.0, + 1505.0, + 706.0, + 1528.0, + 686.0, + 1528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 707.0, + 1507.0, + 776.0, + 1507.0, + 776.0, + 1526.0, + 707.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 779.0, + 1507.0, + 871.0, + 1507.0, + 871.0, + 1528.0, + 779.0, + 1528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 1508.0, + 892.0, + 1508.0, + 892.0, + 1525.0, + 876.0, + 1525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 895.0, + 1507.0, + 918.0, + 1507.0, + 918.0, + 1526.0, + 895.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 1507.0, + 941.0, + 1507.0, + 941.0, + 1526.0, + 919.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 944.0, + 1504.0, + 1037.0, + 1504.0, + 1037.0, + 1530.0, + 944.0, + 1530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 1507.0, + 1056.0, + 1507.0, + 1056.0, + 1525.0, + 1040.0, + 1525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1060.0, + 1505.0, + 1084.0, + 1505.0, + 1084.0, + 1528.0, + 1060.0, + 1528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1089.0, + 1508.0, + 1105.0, + 1508.0, + 1105.0, + 1525.0, + 1089.0, + 1525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1110.0, + 1507.0, + 1131.0, + 1507.0, + 1131.0, + 1526.0, + 1110.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 1507.0, + 1248.0, + 1507.0, + 1248.0, + 1526.0, + 1133.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 1505.0, + 1271.0, + 1505.0, + 1271.0, + 1526.0, + 1251.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1277.0, + 1508.0, + 1294.0, + 1508.0, + 1294.0, + 1525.0, + 1277.0, + 1525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1298.0, + 1507.0, + 1319.0, + 1507.0, + 1319.0, + 1526.0, + 1298.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1320.0, + 1507.0, + 1341.0, + 1507.0, + 1341.0, + 1526.0, + 1320.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1344.0, + 1507.0, + 1365.0, + 1507.0, + 1365.0, + 1526.0, + 1344.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1366.0, + 1505.0, + 1391.0, + 1505.0, + 1391.0, + 1526.0, + 1366.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 1529.0, + 588.0, + 1529.0, + 588.0, + 1550.0, + 368.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 1531.0, + 609.0, + 1531.0, + 609.0, + 1548.0, + 593.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 617.0, + 1531.0, + 633.0, + 1531.0, + 633.0, + 1548.0, + 617.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 636.0, + 1530.0, + 658.0, + 1530.0, + 658.0, + 1550.0, + 636.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 660.0, + 1530.0, + 681.0, + 1530.0, + 681.0, + 1550.0, + 660.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1531.0, + 705.0, + 1531.0, + 705.0, + 1548.0, + 687.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 711.0, + 1525.0, + 871.0, + 1525.0, + 871.0, + 1555.0, + 711.0, + 1555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 1531.0, + 892.0, + 1531.0, + 892.0, + 1548.0, + 874.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1530.0, + 941.0, + 1530.0, + 941.0, + 1550.0, + 894.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 944.0, + 1528.0, + 993.0, + 1528.0, + 993.0, + 1554.0, + 944.0, + 1554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 994.0, + 1531.0, + 1011.0, + 1531.0, + 1011.0, + 1548.0, + 994.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1015.0, + 1533.0, + 1033.0, + 1533.0, + 1033.0, + 1548.0, + 1015.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 1533.0, + 1056.0, + 1533.0, + 1056.0, + 1548.0, + 1040.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1533.0, + 1081.0, + 1533.0, + 1081.0, + 1548.0, + 1064.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1089.0, + 1531.0, + 1105.0, + 1531.0, + 1105.0, + 1547.0, + 1089.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 1531.0, + 1127.0, + 1531.0, + 1127.0, + 1548.0, + 1112.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1128.0, + 1528.0, + 1176.0, + 1528.0, + 1176.0, + 1554.0, + 1128.0, + 1554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1180.0, + 1529.0, + 1201.0, + 1529.0, + 1201.0, + 1552.0, + 1180.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1205.0, + 1529.0, + 1248.0, + 1529.0, + 1248.0, + 1550.0, + 1205.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1250.0, + 1529.0, + 1295.0, + 1529.0, + 1295.0, + 1551.0, + 1250.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1299.0, + 1530.0, + 1316.0, + 1530.0, + 1316.0, + 1547.0, + 1299.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1323.0, + 1531.0, + 1339.0, + 1531.0, + 1339.0, + 1548.0, + 1323.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1345.0, + 1529.0, + 1366.0, + 1529.0, + 1366.0, + 1552.0, + 1345.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1371.0, + 1531.0, + 1388.0, + 1531.0, + 1388.0, + 1548.0, + 1371.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 1552.0, + 587.0, + 1552.0, + 587.0, + 1573.0, + 422.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 1556.0, + 608.0, + 1556.0, + 608.0, + 1572.0, + 593.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 1555.0, + 633.0, + 1555.0, + 633.0, + 1572.0, + 618.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 1554.0, + 659.0, + 1554.0, + 659.0, + 1573.0, + 638.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 662.0, + 1555.0, + 680.0, + 1555.0, + 680.0, + 1572.0, + 662.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1555.0, + 705.0, + 1555.0, + 705.0, + 1572.0, + 687.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 710.0, + 1556.0, + 727.0, + 1556.0, + 727.0, + 1571.0, + 710.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 1555.0, + 752.0, + 1555.0, + 752.0, + 1572.0, + 734.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 757.0, + 1555.0, + 774.0, + 1555.0, + 774.0, + 1572.0, + 757.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 781.0, + 1555.0, + 799.0, + 1555.0, + 799.0, + 1572.0, + 781.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 1555.0, + 821.0, + 1555.0, + 821.0, + 1572.0, + 806.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 1550.0, + 851.0, + 1550.0, + 851.0, + 1576.0, + 823.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 853.0, + 1555.0, + 868.0, + 1555.0, + 868.0, + 1572.0, + 853.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 1554.0, + 919.0, + 1554.0, + 919.0, + 1573.0, + 876.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 1555.0, + 940.0, + 1555.0, + 940.0, + 1572.0, + 923.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 1555.0, + 962.0, + 1555.0, + 962.0, + 1572.0, + 946.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 1555.0, + 987.0, + 1555.0, + 987.0, + 1572.0, + 971.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 994.0, + 1555.0, + 1012.0, + 1555.0, + 1012.0, + 1572.0, + 994.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 1556.0, + 1033.0, + 1556.0, + 1033.0, + 1571.0, + 1017.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 1556.0, + 1056.0, + 1556.0, + 1056.0, + 1571.0, + 1040.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1555.0, + 1081.0, + 1555.0, + 1081.0, + 1571.0, + 1065.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1087.0, + 1555.0, + 1105.0, + 1555.0, + 1105.0, + 1571.0, + 1087.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1111.0, + 1555.0, + 1127.0, + 1555.0, + 1127.0, + 1571.0, + 1111.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 1554.0, + 1155.0, + 1554.0, + 1155.0, + 1573.0, + 1131.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 1555.0, + 1175.0, + 1555.0, + 1175.0, + 1571.0, + 1158.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1183.0, + 1555.0, + 1198.0, + 1555.0, + 1198.0, + 1571.0, + 1183.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1204.0, + 1554.0, + 1225.0, + 1554.0, + 1225.0, + 1575.0, + 1204.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1230.0, + 1555.0, + 1247.0, + 1555.0, + 1247.0, + 1572.0, + 1230.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1248.0, + 1551.0, + 1321.0, + 1551.0, + 1321.0, + 1576.0, + 1248.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1324.0, + 1555.0, + 1339.0, + 1555.0, + 1339.0, + 1571.0, + 1324.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1346.0, + 1555.0, + 1363.0, + 1555.0, + 1363.0, + 1571.0, + 1346.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1371.0, + 1555.0, + 1388.0, + 1555.0, + 1388.0, + 1572.0, + 1371.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1576.0, + 588.0, + 1576.0, + 588.0, + 1597.0, + 307.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 1578.0, + 610.0, + 1578.0, + 610.0, + 1595.0, + 593.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 1578.0, + 633.0, + 1578.0, + 633.0, + 1595.0, + 615.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 1578.0, + 655.0, + 1578.0, + 655.0, + 1595.0, + 638.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 662.0, + 1578.0, + 680.0, + 1578.0, + 680.0, + 1595.0, + 662.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 1578.0, + 703.0, + 1578.0, + 703.0, + 1595.0, + 686.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 1577.0, + 729.0, + 1577.0, + 729.0, + 1597.0, + 708.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 1578.0, + 752.0, + 1578.0, + 752.0, + 1595.0, + 734.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 755.0, + 1577.0, + 776.0, + 1577.0, + 776.0, + 1597.0, + 755.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 781.0, + 1578.0, + 799.0, + 1578.0, + 799.0, + 1595.0, + 781.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 1578.0, + 821.0, + 1578.0, + 821.0, + 1595.0, + 806.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 1573.0, + 848.0, + 1573.0, + 848.0, + 1601.0, + 823.0, + 1601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 852.0, + 1578.0, + 869.0, + 1578.0, + 869.0, + 1595.0, + 852.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 1578.0, + 893.0, + 1578.0, + 893.0, + 1595.0, + 876.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1577.0, + 918.0, + 1577.0, + 918.0, + 1597.0, + 894.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 1578.0, + 940.0, + 1578.0, + 940.0, + 1595.0, + 923.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 1578.0, + 962.0, + 1578.0, + 962.0, + 1595.0, + 946.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 1578.0, + 986.0, + 1578.0, + 986.0, + 1594.0, + 971.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 1575.0, + 1012.0, + 1575.0, + 1012.0, + 1598.0, + 991.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1019.0, + 1578.0, + 1034.0, + 1578.0, + 1034.0, + 1594.0, + 1019.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 1580.0, + 1056.0, + 1580.0, + 1056.0, + 1594.0, + 1039.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1578.0, + 1082.0, + 1578.0, + 1082.0, + 1594.0, + 1064.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1085.0, + 1577.0, + 1106.0, + 1577.0, + 1106.0, + 1597.0, + 1085.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 1578.0, + 1127.0, + 1578.0, + 1127.0, + 1594.0, + 1112.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 1576.0, + 1154.0, + 1576.0, + 1154.0, + 1595.0, + 1131.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1157.0, + 1578.0, + 1176.0, + 1578.0, + 1176.0, + 1594.0, + 1157.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1183.0, + 1578.0, + 1198.0, + 1578.0, + 1198.0, + 1594.0, + 1183.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1204.0, + 1576.0, + 1225.0, + 1576.0, + 1225.0, + 1597.0, + 1204.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1232.0, + 1582.0, + 1243.0, + 1582.0, + 1243.0, + 1593.0, + 1232.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 1576.0, + 1273.0, + 1576.0, + 1273.0, + 1597.0, + 1251.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1279.0, + 1582.0, + 1290.0, + 1582.0, + 1290.0, + 1593.0, + 1279.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1300.0, + 1580.0, + 1316.0, + 1580.0, + 1316.0, + 1595.0, + 1300.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1324.0, + 1578.0, + 1341.0, + 1578.0, + 1341.0, + 1595.0, + 1324.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1346.0, + 1575.0, + 1391.0, + 1575.0, + 1391.0, + 1596.0, + 1346.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1599.0, + 589.0, + 1599.0, + 589.0, + 1620.0, + 308.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 1601.0, + 612.0, + 1601.0, + 612.0, + 1620.0, + 591.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 613.0, + 1603.0, + 633.0, + 1603.0, + 633.0, + 1619.0, + 613.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 639.0, + 1603.0, + 655.0, + 1603.0, + 655.0, + 1619.0, + 639.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 662.0, + 1602.0, + 680.0, + 1602.0, + 680.0, + 1619.0, + 662.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1602.0, + 703.0, + 1602.0, + 703.0, + 1620.0, + 687.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 710.0, + 1599.0, + 729.0, + 1599.0, + 729.0, + 1620.0, + 710.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 1602.0, + 752.0, + 1602.0, + 752.0, + 1619.0, + 734.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 757.0, + 1602.0, + 774.0, + 1602.0, + 774.0, + 1619.0, + 757.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 1599.0, + 800.0, + 1599.0, + 800.0, + 1622.0, + 780.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 1602.0, + 825.0, + 1602.0, + 825.0, + 1622.0, + 804.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 826.0, + 1603.0, + 846.0, + 1603.0, + 846.0, + 1619.0, + 826.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 849.0, + 1601.0, + 871.0, + 1601.0, + 871.0, + 1620.0, + 849.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 1602.0, + 893.0, + 1602.0, + 893.0, + 1619.0, + 876.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 897.0, + 1601.0, + 919.0, + 1601.0, + 919.0, + 1620.0, + 897.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 1603.0, + 941.0, + 1603.0, + 941.0, + 1619.0, + 924.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 1603.0, + 962.0, + 1603.0, + 962.0, + 1619.0, + 945.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 1602.0, + 986.0, + 1602.0, + 986.0, + 1618.0, + 971.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 994.0, + 1602.0, + 1009.0, + 1602.0, + 1009.0, + 1619.0, + 994.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1014.0, + 1601.0, + 1035.0, + 1601.0, + 1035.0, + 1620.0, + 1014.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 1601.0, + 1059.0, + 1601.0, + 1059.0, + 1620.0, + 1038.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1602.0, + 1081.0, + 1602.0, + 1081.0, + 1618.0, + 1065.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1085.0, + 1601.0, + 1106.0, + 1601.0, + 1106.0, + 1620.0, + 1085.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1113.0, + 1602.0, + 1128.0, + 1602.0, + 1128.0, + 1619.0, + 1113.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1132.0, + 1601.0, + 1153.0, + 1601.0, + 1153.0, + 1620.0, + 1132.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 1603.0, + 1175.0, + 1603.0, + 1175.0, + 1619.0, + 1159.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1183.0, + 1603.0, + 1200.0, + 1603.0, + 1200.0, + 1619.0, + 1183.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1226.0, + 1601.0, + 1247.0, + 1601.0, + 1247.0, + 1620.0, + 1226.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 1601.0, + 1272.0, + 1601.0, + 1272.0, + 1620.0, + 1251.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1277.0, + 1603.0, + 1293.0, + 1603.0, + 1293.0, + 1619.0, + 1277.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1298.0, + 1601.0, + 1318.0, + 1601.0, + 1318.0, + 1622.0, + 1298.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1321.0, + 1601.0, + 1342.0, + 1601.0, + 1342.0, + 1620.0, + 1321.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1347.0, + 1602.0, + 1362.0, + 1602.0, + 1362.0, + 1619.0, + 1347.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1368.0, + 1601.0, + 1390.0, + 1601.0, + 1390.0, + 1622.0, + 1368.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 1622.0, + 587.0, + 1622.0, + 587.0, + 1642.0, + 420.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 592.0, + 1623.0, + 634.0, + 1623.0, + 634.0, + 1644.0, + 592.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 639.0, + 1625.0, + 656.0, + 1625.0, + 656.0, + 1642.0, + 639.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 662.0, + 1625.0, + 680.0, + 1625.0, + 680.0, + 1642.0, + 662.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 1624.0, + 706.0, + 1624.0, + 706.0, + 1645.0, + 686.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 711.0, + 1627.0, + 727.0, + 1627.0, + 727.0, + 1642.0, + 711.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 1625.0, + 752.0, + 1625.0, + 752.0, + 1642.0, + 734.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 758.0, + 1625.0, + 774.0, + 1625.0, + 774.0, + 1642.0, + 758.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 781.0, + 1625.0, + 799.0, + 1625.0, + 799.0, + 1642.0, + 781.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1625.0, + 822.0, + 1625.0, + 822.0, + 1642.0, + 805.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 1625.0, + 846.0, + 1625.0, + 846.0, + 1642.0, + 828.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 849.0, + 1624.0, + 871.0, + 1624.0, + 871.0, + 1644.0, + 849.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 1627.0, + 893.0, + 1627.0, + 893.0, + 1642.0, + 877.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 898.0, + 1627.0, + 916.0, + 1627.0, + 916.0, + 1642.0, + 898.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 1627.0, + 940.0, + 1627.0, + 940.0, + 1641.0, + 923.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 1627.0, + 962.0, + 1627.0, + 962.0, + 1642.0, + 946.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 976.0, + 1628.0, + 985.0, + 1628.0, + 985.0, + 1639.0, + 976.0, + 1639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 1624.0, + 1014.0, + 1624.0, + 1014.0, + 1644.0, + 992.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 1625.0, + 1034.0, + 1625.0, + 1034.0, + 1642.0, + 1017.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 1624.0, + 1060.0, + 1624.0, + 1060.0, + 1644.0, + 1037.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1627.0, + 1081.0, + 1627.0, + 1081.0, + 1642.0, + 1065.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1087.0, + 1625.0, + 1105.0, + 1625.0, + 1105.0, + 1642.0, + 1087.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 1627.0, + 1127.0, + 1627.0, + 1127.0, + 1642.0, + 1112.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 1624.0, + 1155.0, + 1624.0, + 1155.0, + 1644.0, + 1131.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 1625.0, + 1176.0, + 1625.0, + 1176.0, + 1642.0, + 1159.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1183.0, + 1625.0, + 1200.0, + 1625.0, + 1200.0, + 1642.0, + 1183.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1201.0, + 1624.0, + 1224.0, + 1624.0, + 1224.0, + 1644.0, + 1201.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1228.0, + 1625.0, + 1246.0, + 1625.0, + 1246.0, + 1642.0, + 1228.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1622.0, + 1276.0, + 1622.0, + 1276.0, + 1646.0, + 1247.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1277.0, + 1627.0, + 1293.0, + 1627.0, + 1293.0, + 1642.0, + 1277.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1300.0, + 1625.0, + 1316.0, + 1625.0, + 1316.0, + 1642.0, + 1300.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1321.0, + 1627.0, + 1340.0, + 1627.0, + 1340.0, + 1642.0, + 1321.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1347.0, + 1627.0, + 1363.0, + 1627.0, + 1363.0, + 1642.0, + 1347.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1371.0, + 1627.0, + 1387.0, + 1627.0, + 1387.0, + 1642.0, + 1371.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 1644.0, + 589.0, + 1644.0, + 589.0, + 1670.0, + 311.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 1649.0, + 608.0, + 1649.0, + 608.0, + 1666.0, + 593.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 612.0, + 1648.0, + 635.0, + 1648.0, + 635.0, + 1669.0, + 612.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 641.0, + 1650.0, + 656.0, + 1650.0, + 656.0, + 1666.0, + 641.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 1650.0, + 680.0, + 1650.0, + 680.0, + 1666.0, + 664.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1650.0, + 703.0, + 1650.0, + 703.0, + 1666.0, + 687.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 711.0, + 1650.0, + 727.0, + 1650.0, + 727.0, + 1665.0, + 711.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 1650.0, + 752.0, + 1650.0, + 752.0, + 1666.0, + 734.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 758.0, + 1650.0, + 774.0, + 1650.0, + 774.0, + 1666.0, + 758.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 1650.0, + 799.0, + 1650.0, + 799.0, + 1666.0, + 780.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 1650.0, + 822.0, + 1650.0, + 822.0, + 1666.0, + 804.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 1650.0, + 846.0, + 1650.0, + 846.0, + 1666.0, + 827.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 851.0, + 1649.0, + 868.0, + 1649.0, + 868.0, + 1666.0, + 851.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 1649.0, + 892.0, + 1649.0, + 892.0, + 1666.0, + 876.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 1649.0, + 915.0, + 1649.0, + 915.0, + 1666.0, + 900.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 925.0, + 1649.0, + 940.0, + 1649.0, + 940.0, + 1665.0, + 925.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 1649.0, + 962.0, + 1649.0, + 962.0, + 1666.0, + 946.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 967.0, + 1648.0, + 988.0, + 1648.0, + 988.0, + 1669.0, + 967.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 994.0, + 1649.0, + 1011.0, + 1649.0, + 1011.0, + 1666.0, + 994.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 1650.0, + 1033.0, + 1650.0, + 1033.0, + 1666.0, + 1017.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 1650.0, + 1056.0, + 1650.0, + 1056.0, + 1666.0, + 1040.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1650.0, + 1081.0, + 1650.0, + 1081.0, + 1666.0, + 1065.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1086.0, + 1650.0, + 1105.0, + 1650.0, + 1105.0, + 1666.0, + 1086.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1111.0, + 1650.0, + 1127.0, + 1650.0, + 1127.0, + 1666.0, + 1111.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 1648.0, + 1155.0, + 1648.0, + 1155.0, + 1669.0, + 1131.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 1649.0, + 1174.0, + 1649.0, + 1174.0, + 1666.0, + 1159.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1180.0, + 1648.0, + 1201.0, + 1648.0, + 1201.0, + 1667.0, + 1180.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 1649.0, + 1222.0, + 1649.0, + 1222.0, + 1666.0, + 1206.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1226.0, + 1648.0, + 1248.0, + 1648.0, + 1248.0, + 1667.0, + 1226.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 1650.0, + 1269.0, + 1650.0, + 1269.0, + 1667.0, + 1252.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1277.0, + 1649.0, + 1293.0, + 1649.0, + 1293.0, + 1666.0, + 1277.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1300.0, + 1649.0, + 1314.0, + 1649.0, + 1314.0, + 1666.0, + 1300.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1318.0, + 1645.0, + 1345.0, + 1645.0, + 1345.0, + 1670.0, + 1318.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1349.0, + 1649.0, + 1363.0, + 1649.0, + 1363.0, + 1666.0, + 1349.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1371.0, + 1649.0, + 1388.0, + 1649.0, + 1388.0, + 1666.0, + 1371.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1672.0, + 587.0, + 1672.0, + 587.0, + 1689.0, + 392.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 1674.0, + 609.0, + 1674.0, + 609.0, + 1689.0, + 593.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 619.0, + 1676.0, + 632.0, + 1676.0, + 632.0, + 1688.0, + 619.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 1674.0, + 656.0, + 1674.0, + 656.0, + 1689.0, + 640.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 1674.0, + 680.0, + 1674.0, + 680.0, + 1689.0, + 664.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1672.0, + 703.0, + 1672.0, + 703.0, + 1691.0, + 687.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 710.0, + 1671.0, + 729.0, + 1671.0, + 729.0, + 1692.0, + 710.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 1672.0, + 752.0, + 1672.0, + 752.0, + 1691.0, + 736.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 758.0, + 1672.0, + 774.0, + 1672.0, + 774.0, + 1691.0, + 758.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 781.0, + 1672.0, + 797.0, + 1672.0, + 797.0, + 1691.0, + 781.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 1672.0, + 822.0, + 1672.0, + 822.0, + 1689.0, + 806.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 1674.0, + 845.0, + 1674.0, + 845.0, + 1689.0, + 830.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 852.0, + 1674.0, + 868.0, + 1674.0, + 868.0, + 1689.0, + 852.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 1674.0, + 892.0, + 1674.0, + 892.0, + 1689.0, + 876.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 897.0, + 1674.0, + 916.0, + 1674.0, + 916.0, + 1689.0, + 897.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 1674.0, + 940.0, + 1674.0, + 940.0, + 1689.0, + 923.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 1674.0, + 962.0, + 1674.0, + 962.0, + 1689.0, + 946.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 1676.0, + 985.0, + 1676.0, + 985.0, + 1687.0, + 971.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 996.0, + 1676.0, + 1008.0, + 1676.0, + 1008.0, + 1688.0, + 996.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1018.0, + 1674.0, + 1034.0, + 1674.0, + 1034.0, + 1689.0, + 1018.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 1674.0, + 1056.0, + 1674.0, + 1056.0, + 1688.0, + 1040.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1674.0, + 1081.0, + 1674.0, + 1081.0, + 1688.0, + 1065.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1087.0, + 1674.0, + 1105.0, + 1674.0, + 1105.0, + 1689.0, + 1087.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1113.0, + 1675.0, + 1126.0, + 1675.0, + 1126.0, + 1687.0, + 1113.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1132.0, + 1674.0, + 1153.0, + 1674.0, + 1153.0, + 1688.0, + 1132.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1157.0, + 1672.0, + 1175.0, + 1672.0, + 1175.0, + 1688.0, + 1157.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1181.0, + 1672.0, + 1198.0, + 1672.0, + 1198.0, + 1689.0, + 1181.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1207.0, + 1672.0, + 1222.0, + 1672.0, + 1222.0, + 1688.0, + 1207.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 1670.0, + 1250.0, + 1670.0, + 1250.0, + 1691.0, + 1225.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 1674.0, + 1269.0, + 1674.0, + 1269.0, + 1691.0, + 1252.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1274.0, + 1671.0, + 1295.0, + 1671.0, + 1295.0, + 1691.0, + 1274.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1299.0, + 1674.0, + 1316.0, + 1674.0, + 1316.0, + 1691.0, + 1299.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1320.0, + 1672.0, + 1342.0, + 1672.0, + 1342.0, + 1692.0, + 1320.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1347.0, + 1672.0, + 1361.0, + 1672.0, + 1361.0, + 1689.0, + 1347.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1366.0, + 1669.0, + 1391.0, + 1669.0, + 1391.0, + 1696.0, + 1366.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1696.0, + 587.0, + 1696.0, + 587.0, + 1713.0, + 322.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 1696.0, + 609.0, + 1696.0, + 609.0, + 1713.0, + 593.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 1697.0, + 633.0, + 1697.0, + 633.0, + 1713.0, + 618.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 639.0, + 1697.0, + 656.0, + 1697.0, + 656.0, + 1713.0, + 639.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 662.0, + 1697.0, + 679.0, + 1697.0, + 679.0, + 1713.0, + 662.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1697.0, + 703.0, + 1697.0, + 703.0, + 1713.0, + 687.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 711.0, + 1697.0, + 727.0, + 1697.0, + 727.0, + 1713.0, + 711.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 1697.0, + 752.0, + 1697.0, + 752.0, + 1713.0, + 734.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 757.0, + 1697.0, + 774.0, + 1697.0, + 774.0, + 1713.0, + 757.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 1695.0, + 800.0, + 1695.0, + 800.0, + 1716.0, + 780.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 1697.0, + 821.0, + 1697.0, + 821.0, + 1713.0, + 806.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 825.0, + 1695.0, + 847.0, + 1695.0, + 847.0, + 1716.0, + 825.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 853.0, + 1697.0, + 868.0, + 1697.0, + 868.0, + 1713.0, + 853.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 1697.0, + 892.0, + 1697.0, + 892.0, + 1713.0, + 876.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 1697.0, + 916.0, + 1697.0, + 916.0, + 1713.0, + 899.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 1697.0, + 940.0, + 1697.0, + 940.0, + 1713.0, + 923.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 947.0, + 1697.0, + 962.0, + 1697.0, + 962.0, + 1713.0, + 947.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 1696.0, + 986.0, + 1696.0, + 986.0, + 1712.0, + 971.0, + 1712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 1695.0, + 1012.0, + 1695.0, + 1012.0, + 1716.0, + 991.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1020.0, + 1699.0, + 1030.0, + 1699.0, + 1030.0, + 1712.0, + 1020.0, + 1712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 1695.0, + 1060.0, + 1695.0, + 1060.0, + 1716.0, + 1038.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1066.0, + 1697.0, + 1081.0, + 1697.0, + 1081.0, + 1713.0, + 1066.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1086.0, + 1697.0, + 1105.0, + 1697.0, + 1105.0, + 1713.0, + 1086.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 1697.0, + 1127.0, + 1697.0, + 1127.0, + 1713.0, + 1112.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 1695.0, + 1225.0, + 1695.0, + 1225.0, + 1717.0, + 1131.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1227.0, + 1696.0, + 1248.0, + 1696.0, + 1248.0, + 1716.0, + 1227.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 1696.0, + 1269.0, + 1696.0, + 1269.0, + 1713.0, + 1252.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1273.0, + 1695.0, + 1295.0, + 1695.0, + 1295.0, + 1714.0, + 1273.0, + 1714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1300.0, + 1697.0, + 1316.0, + 1697.0, + 1316.0, + 1713.0, + 1300.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1323.0, + 1697.0, + 1341.0, + 1697.0, + 1341.0, + 1713.0, + 1323.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1347.0, + 1697.0, + 1362.0, + 1697.0, + 1362.0, + 1713.0, + 1347.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1366.0, + 1695.0, + 1390.0, + 1695.0, + 1390.0, + 1716.0, + 1366.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 1505.5, + 614.0, + 1505.5, + 614.0, + 1527.5, + 588.0, + 1527.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1200.0, + 1602.5, + 1225.0, + 1602.5, + 1225.0, + 1618.5, + 1200.0, + 1618.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1749.0, + 1408.0, + 1749.0, + 1408.0, + 1788.0, + 294.0, + 1788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1780.0, + 1408.0, + 1780.0, + 1408.0, + 1817.0, + 294.0, + 1817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1811.0, + 1179.0, + 1811.0, + 1179.0, + 1846.0, + 294.0, + 1846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1902.0, + 723.0, + 1902.0, + 723.0, + 1945.0, + 293.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2084.0, + 867.0, + 2084.0, + 867.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1319.0, + 1270.0, + 1319.0, + 1270.0, + 1355.0, + 293.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 1319.0, + 1407.0, + 1319.0, + 1407.0, + 1355.0, + 1352.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1350.0, + 1404.0, + 1350.0, + 1404.0, + 1384.0, + 293.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1379.0, + 1062.0, + 1379.0, + 1062.0, + 1416.0, + 294.0, + 1416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1972.0, + 1408.0, + 1972.0, + 1408.0, + 2007.0, + 294.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2001.0, + 1401.0, + 2001.0, + 1401.0, + 2037.0, + 294.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1319.0, + 1270.0, + 1319.0, + 1270.0, + 1355.0, + 293.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 1319.0, + 1407.0, + 1319.0, + 1407.0, + 1355.0, + 1352.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1350.0, + 1404.0, + 1350.0, + 1404.0, + 1384.0, + 293.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1379.0, + 1062.0, + 1379.0, + 1062.0, + 1416.0, + 294.0, + 1416.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 923, + 1406, + 923, + 1406, + 1108, + 297, + 1108 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 296, + 307, + 1405, + 307, + 1405, + 492, + 296, + 492 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 297, + 1122, + 1404, + 1122, + 1404, + 1247, + 297, + 1247 + ], + "score": 0.965 + }, + { + "category_id": 3, + "poly": [ + 307, + 531, + 1383, + 531, + 1383, + 809, + 307, + 809 + ], + "score": 0.962 + }, + { + "category_id": 3, + "poly": [ + 309, + 1288, + 1384, + 1288, + 1384, + 1520, + 309, + 1520 + ], + "score": 0.962 + }, + { + "category_id": 1, + "poly": [ + 293, + 229, + 1404, + 229, + 1404, + 293, + 293, + 293 + ], + "score": 0.941 + }, + { + "category_id": 4, + "poly": [ + 472, + 850, + 1226, + 850, + 1226, + 883, + 472, + 883 + ], + "score": 0.931 + }, + { + "category_id": 4, + "poly": [ + 471, + 1554, + 1225, + 1554, + 1225, + 1588, + 471, + 1588 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 304, + 1734, + 1381, + 1734, + 1381, + 1768, + 304, + 1768 + ], + "score": 0.912 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.903 + }, + { + "category_id": 0, + "poly": [ + 300, + 1660, + 706, + 1660, + 706, + 1697, + 300, + 1697 + ], + "score": 0.884 + }, + { + "category_id": 1, + "poly": [ + 351, + 1794, + 1370, + 1794, + 1370, + 1829, + 351, + 1829 + ], + "score": 0.858 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2112, + 836, + 2112 + ], + "score": 0.852 + }, + { + "category_id": 1, + "poly": [ + 423, + 1842, + 1403, + 1842, + 1403, + 2035, + 423, + 2035 + ], + "score": 0.802 + }, + { + "category_id": 13, + "poly": [ + 372, + 400, + 447, + 400, + 447, + 428, + 372, + 428 + ], + "score": 0.91, + "latex": "T = 3" + }, + { + "category_id": 13, + "poly": [ + 475, + 1185, + 582, + 1185, + 582, + 1213, + 475, + 1213 + ], + "score": 0.9, + "latex": "P = 1 0 0" + }, + { + "category_id": 13, + "poly": [ + 549, + 1216, + 624, + 1216, + 624, + 1243, + 549, + 1243 + ], + "score": 0.9, + "latex": "T = 4" + }, + { + "category_id": 13, + "poly": [ + 954, + 1185, + 1031, + 1185, + 1031, + 1213, + 954, + 1213 + ], + "score": 0.9, + "latex": "T = 5" + }, + { + "category_id": 13, + "poly": [ + 1007, + 369, + 1111, + 369, + 1111, + 397, + 1007, + 397 + ], + "score": 0.89, + "latex": "P = 5 0 0" + }, + { + "category_id": 13, + "poly": [ + 913, + 1973, + 1013, + 1973, + 1013, + 2001, + 913, + 2001 + ], + "score": 0.89, + "latex": "E = 2 0" + }, + { + "category_id": 13, + "poly": [ + 1259, + 1843, + 1346, + 1843, + 1346, + 1871, + 1259, + 1871 + ], + "score": 0.89, + "latex": "L = 2 0" + }, + { + "category_id": 13, + "poly": [ + 339, + 338, + 371, + 338, + 371, + 367, + 339, + 367 + ], + "score": 0.86, + "latex": "\\lambda ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 626, + 983, + 657, + 983, + 657, + 1013, + 626, + 1013 + ], + "score": 0.86, + "latex": "2 ^ { k }" + }, + { + "category_id": 13, + "poly": [ + 835, + 983, + 867, + 983, + 867, + 1013, + 835, + 1013 + ], + "score": 0.86, + "latex": "\\dot { \\lambda ^ { 2 } }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1152, + 329, + 1152, + 329, + 1182, + 297, + 1182 + ], + "score": 0.85, + "latex": "\\lambda ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1369, + 1014, + 1401, + 1014, + 1401, + 1043, + 1369, + 1043 + ], + "score": 0.84, + "latex": "\\lambda ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1332, + 1943, + 1403, + 1943, + 1403, + 1974, + 1332, + 1974 + ], + "score": 0.6, + "latex": "( - 2 5 6" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 533.0, + 377.0, + 533.0, + 377.0, + 563.0, + 333.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 555.0, + 335.0, + 555.0, + 335.0, + 703.0, + 305.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 570.0, + 375.0, + 570.0, + 375.0, + 591.0, + 337.0, + 591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 548.0, + 1168.0, + 548.0, + 1168.0, + 607.0, + 906.0, + 607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 599.0, + 377.0, + 599.0, + 377.0, + 625.0, + 334.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 907.0, + 606.0, + 1284.0, + 606.0, + 1284.0, + 636.0, + 907.0, + 636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 631.0, + 376.0, + 631.0, + 376.0, + 657.0, + 334.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 637.0, + 1205.0, + 637.0, + 1205.0, + 663.0, + 909.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 663.0, + 376.0, + 663.0, + 376.0, + 689.0, + 335.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 665.0, + 1382.0, + 665.0, + 1382.0, + 691.0, + 909.0, + 691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 696.0, + 383.0, + 696.0, + 383.0, + 718.0, + 354.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 700.0, + 697.0, + 825.0, + 697.0, + 825.0, + 715.0, + 700.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 691.0, + 1306.0, + 691.0, + 1306.0, + 721.0, + 906.0, + 721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 479.0, + 712.0, + 527.0, + 712.0, + 527.0, + 735.0, + 479.0, + 735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 710.0, + 594.0, + 710.0, + 594.0, + 739.0, + 541.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 603.0, + 710.0, + 715.0, + 710.0, + 715.0, + 739.0, + 603.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 709.0, + 840.0, + 709.0, + 840.0, + 740.0, + 730.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 907.0, + 722.0, + 1041.0, + 722.0, + 1041.0, + 749.0, + 907.0, + 749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 484.0, + 739.0, + 715.0, + 739.0, + 715.0, + 765.0, + 484.0, + 765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 907.0, + 752.0, + 1322.0, + 752.0, + 1322.0, + 777.0, + 907.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 776.0, + 1249.0, + 776.0, + 1249.0, + 808.0, + 906.0, + 808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 709.0, + 404.0, + 709.0, + 404.0, + 738.5, + 350.0, + 738.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 413.0, + 709.0, + 467.0, + 709.0, + 467.0, + 738.5, + 413.0, + 738.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 1290.0, + 377.0, + 1290.0, + 377.0, + 1317.0, + 335.0, + 1317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1312.0, + 335.0, + 1312.0, + 335.0, + 1456.0, + 307.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 345.0, + 1324.0, + 377.0, + 1324.0, + 377.0, + 1348.0, + 345.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 1304.0, + 1168.0, + 1304.0, + 1168.0, + 1364.0, + 906.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 345.0, + 1355.0, + 377.0, + 1355.0, + 377.0, + 1379.0, + 345.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 1359.0, + 1283.0, + 1359.0, + 1283.0, + 1392.0, + 905.0, + 1392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 1387.0, + 377.0, + 1387.0, + 377.0, + 1412.0, + 346.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 907.0, + 1387.0, + 1206.0, + 1387.0, + 1206.0, + 1421.0, + 907.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 343.0, + 1417.0, + 378.0, + 1417.0, + 378.0, + 1446.0, + 343.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 1420.0, + 1383.0, + 1420.0, + 1383.0, + 1448.0, + 908.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1451.0, + 388.0, + 1451.0, + 388.0, + 1475.0, + 354.0, + 1475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 1455.0, + 494.0, + 1455.0, + 494.0, + 1469.0, + 467.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 518.0, + 1453.0, + 566.0, + 1453.0, + 566.0, + 1470.0, + 518.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 585.0, + 1457.0, + 599.0, + 1457.0, + 599.0, + 1468.0, + 585.0, + 1468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 684.0, + 1453.0, + 719.0, + 1453.0, + 719.0, + 1470.0, + 684.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 1452.0, + 827.0, + 1452.0, + 827.0, + 1470.0, + 734.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 1448.0, + 1305.0, + 1448.0, + 1305.0, + 1477.0, + 908.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 1465.0, + 619.0, + 1465.0, + 619.0, + 1493.0, + 577.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 632.0, + 1465.0, + 674.0, + 1465.0, + 674.0, + 1493.0, + 632.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 744.0, + 1465.0, + 785.0, + 1465.0, + 785.0, + 1493.0, + 744.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 482.0, + 1491.0, + 716.0, + 1491.0, + 716.0, + 1521.0, + 482.0, + 1521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.75, + 1465.0, + 403.75, + 1465.0, + 403.75, + 1492.0, + 351.75, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 407.0, + 1464.0, + 457.0, + 1464.0, + 457.0, + 1493.0, + 407.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.25, + 1464.0, + 512.25, + 1464.0, + 512.25, + 1493.0, + 463.25, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 519.0, + 1464.0, + 567.0, + 1464.0, + 567.0, + 1493.0, + 519.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 684.0, + 1465.0, + 732.0, + 1465.0, + 732.0, + 1493.5, + 684.0, + 1493.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 794.0, + 1464.0, + 841.0, + 1464.0, + 841.0, + 1493.0, + 794.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 846.0, + 1229.0, + 846.0, + 1229.0, + 889.0, + 469.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 471.0, + 1552.0, + 1228.0, + 1552.0, + 1228.0, + 1592.0, + 471.0, + 1592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1656.0, + 712.0, + 1656.0, + 712.0, + 1703.0, + 294.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2084.0, + 868.0, + 2084.0, + 868.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 924.0, + 1406.0, + 924.0, + 1406.0, + 956.0, + 296.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 952.0, + 1408.0, + 952.0, + 1408.0, + 990.0, + 294.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 981.0, + 625.0, + 981.0, + 625.0, + 1019.0, + 294.0, + 1019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 981.0, + 834.0, + 981.0, + 834.0, + 1019.0, + 658.0, + 1019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 981.0, + 1408.0, + 981.0, + 1408.0, + 1019.0, + 868.0, + 1019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1012.0, + 1368.0, + 1012.0, + 1368.0, + 1049.0, + 292.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1012.0, + 1407.0, + 1012.0, + 1407.0, + 1049.0, + 1402.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1045.0, + 1403.0, + 1045.0, + 1403.0, + 1077.0, + 296.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1075.0, + 619.0, + 1075.0, + 619.0, + 1110.0, + 294.0, + 1110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 309.0, + 1406.0, + 309.0, + 1406.0, + 341.0, + 295.0, + 341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 336.0, + 338.0, + 336.0, + 338.0, + 373.0, + 293.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 336.0, + 1408.0, + 336.0, + 1408.0, + 373.0, + 372.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 368.0, + 1006.0, + 368.0, + 1006.0, + 403.0, + 293.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 368.0, + 1407.0, + 368.0, + 1407.0, + 403.0, + 1112.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 397.0, + 371.0, + 397.0, + 371.0, + 435.0, + 293.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 397.0, + 1406.0, + 397.0, + 1406.0, + 435.0, + 448.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 427.0, + 1405.0, + 427.0, + 1405.0, + 464.0, + 293.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 459.0, + 596.0, + 459.0, + 596.0, + 492.0, + 292.0, + 492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1125.0, + 1402.0, + 1125.0, + 1402.0, + 1154.0, + 296.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1149.0, + 296.0, + 1149.0, + 296.0, + 1190.0, + 292.0, + 1190.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1149.0, + 1405.0, + 1149.0, + 1405.0, + 1190.0, + 330.0, + 1190.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1183.0, + 474.0, + 1183.0, + 474.0, + 1218.0, + 292.0, + 1218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 1183.0, + 953.0, + 1183.0, + 953.0, + 1218.0, + 583.0, + 1218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 1183.0, + 1406.0, + 1183.0, + 1406.0, + 1218.0, + 1032.0, + 1218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1216.0, + 548.0, + 1216.0, + 548.0, + 1248.0, + 293.0, + 1248.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 1216.0, + 635.0, + 1216.0, + 635.0, + 1248.0, + 625.0, + 1248.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 226.0, + 1404.0, + 226.0, + 1404.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 261.0, + 1409.0, + 261.0, + 1409.0, + 297.0, + 296.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 301.0, + 1734.0, + 1386.0, + 1734.0, + 1386.0, + 1769.0, + 301.0, + 1769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 365.0, + 1791.0, + 1371.0, + 1791.0, + 1371.0, + 1834.0, + 365.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 421.0, + 1841.0, + 1258.0, + 1841.0, + 1258.0, + 1877.0, + 421.0, + 1877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1347.0, + 1841.0, + 1402.0, + 1841.0, + 1402.0, + 1877.0, + 1347.0, + 1877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1874.0, + 704.0, + 1874.0, + 704.0, + 1906.0, + 449.0, + 1906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 421.0, + 1910.0, + 1406.0, + 1910.0, + 1406.0, + 1949.0, + 421.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1943.0, + 1331.0, + 1943.0, + 1331.0, + 1975.0, + 449.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1973.0, + 912.0, + 1973.0, + 912.0, + 2008.0, + 449.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1014.0, + 1973.0, + 1405.0, + 1973.0, + 1405.0, + 2008.0, + 1014.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 452.0, + 2005.0, + 906.0, + 2005.0, + 906.0, + 2037.0, + 452.0, + 2037.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1802, + 1404, + 1802, + 1404, + 1987, + 298, + 1987 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1634, + 1404, + 1634, + 1404, + 1788, + 298, + 1788 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 1300, + 1407, + 1300, + 1407, + 1515, + 297, + 1515 + ], + "score": 0.975 + }, + { + "category_id": 3, + "poly": [ + 303, + 588, + 1405, + 588, + 1405, + 1202, + 303, + 1202 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 423, + 229, + 1404, + 229, + 1404, + 361, + 423, + 361 + ], + "score": 0.937 + }, + { + "category_id": 4, + "poly": [ + 394, + 1231, + 1300, + 1231, + 1300, + 1264, + 394, + 1264 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 362, + 373, + 1404, + 373, + 1404, + 436, + 362, + 436 + ], + "score": 0.918 + }, + { + "category_id": 1, + "poly": [ + 293, + 2001, + 1392, + 2001, + 1392, + 2035, + 293, + 2035 + ], + "score": 0.91 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 814, + 76, + 814, + 104, + 300, + 104 + ], + "score": 0.896 + }, + { + "category_id": 0, + "poly": [ + 300, + 1562, + 682, + 1562, + 682, + 1599, + 300, + 1599 + ], + "score": 0.89 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2112, + 836, + 2112 + ], + "score": 0.857 + }, + { + "category_id": 1, + "poly": [ + 296, + 463, + 1406, + 463, + 1406, + 556, + 296, + 556 + ], + "score": 0.852 + }, + { + "category_id": 4, + "poly": [ + 296, + 463, + 1406, + 463, + 1406, + 556, + 296, + 556 + ], + "score": 0.231 + }, + { + "category_id": 13, + "poly": [ + 1028, + 2001, + 1148, + 2001, + 1148, + 2032, + 1028, + 2032 + ], + "score": 0.91, + "latex": "\\sim 3 \\times 1 0 ^ { 6 }" + }, + { + "category_id": 13, + "poly": [ + 581, + 1332, + 658, + 1332, + 658, + 1360, + 581, + 1360 + ], + "score": 0.91, + "latex": "E = 2" + }, + { + "category_id": 13, + "poly": [ + 1325, + 1332, + 1399, + 1332, + 1399, + 1360, + 1325, + 1360 + ], + "score": 0.9, + "latex": "T = 1" + }, + { + "category_id": 13, + "poly": [ + 843, + 1302, + 934, + 1302, + 934, + 1330, + 843, + 1330 + ], + "score": 0.9, + "latex": "E = 2 0" + }, + { + "category_id": 13, + "poly": [ + 960, + 1805, + 1044, + 1805, + 1044, + 1832, + 960, + 1832 + ], + "score": 0.89, + "latex": "M = 5" + }, + { + "category_id": 13, + "poly": [ + 721, + 328, + 801, + 328, + 801, + 357, + 721, + 357 + ], + "score": 0.89, + "latex": "H = 3" + }, + { + "category_id": 13, + "poly": [ + 532, + 1636, + 589, + 1636, + 589, + 1664, + 532, + 1664 + ], + "score": 0.88, + "latex": "\\mathrm { C } { + } { + }" + }, + { + "category_id": 13, + "poly": [ + 1080, + 329, + 1188, + 329, + 1188, + 357, + 1080, + 357 + ], + "score": 0.88, + "latex": "K = 2 5 6" + }, + { + "category_id": 13, + "poly": [ + 1198, + 1456, + 1286, + 1456, + 1286, + 1483, + 1198, + 1483 + ], + "score": 0.88, + "latex": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 1" + }, + { + "category_id": 13, + "poly": [ + 943, + 1456, + 1030, + 1456, + 1030, + 1483, + 943, + 1483 + ], + "score": 0.87, + "latex": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 0" + }, + { + "category_id": 13, + "poly": [ + 1021, + 1391, + 1057, + 1391, + 1057, + 1420, + 1021, + 1420 + ], + "score": 0.86, + "latex": "\\mathbb { R } ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 598, + 1456, + 655, + 1456, + 655, + 1484, + 598, + 1484 + ], + "score": 0.79, + "latex": "( > 0 )" + }, + { + "category_id": 13, + "poly": [ + 592, + 1866, + 625, + 1866, + 625, + 1892, + 592, + 1892 + ], + "score": 0.77, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 989, + 1835, + 1023, + 1835, + 1023, + 1862, + 989, + 1862 + ], + "score": 0.75, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 766, + 1456, + 823, + 1456, + 823, + 1484, + 766, + 1484 + ], + "score": 0.73, + "latex": "( < 0 )" + }, + { + "category_id": 13, + "poly": [ + 684, + 1728, + 709, + 1728, + 709, + 1754, + 684, + 1754 + ], + "score": 0.7, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 590, + 1667, + 614, + 1667, + 614, + 1693, + 590, + 1693 + ], + "score": 0.66, + "latex": "T" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 595.0, + 529.0, + 595.0, + 529.0, + 630.0, + 303.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 957.0, + 632.0, + 1056.0, + 632.0, + 1056.0, + 669.0, + 957.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 673.0, + 497.0, + 673.0, + 497.0, + 705.0, + 314.0, + 705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 750.0, + 450.0, + 750.0, + 450.0, + 787.0, + 361.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 829.0, + 467.0, + 829.0, + 467.0, + 865.0, + 346.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 345.0, + 890.0, + 469.0, + 890.0, + 469.0, + 930.0, + 345.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 957.0, + 466.0, + 957.0, + 466.0, + 993.0, + 346.0, + 993.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 302.0, + 1031.0, + 510.0, + 1031.0, + 510.0, + 1071.0, + 302.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1119.0, + 491.0, + 1119.0, + 491.0, + 1162.0, + 322.0, + 1162.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 587.0, + 1165.0, + 690.0, + 1165.0, + 690.0, + 1206.0, + 587.0, + 1206.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 785.0, + 1165.0, + 908.0, + 1165.0, + 908.0, + 1206.0, + 785.0, + 1206.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 1164.0, + 1152.0, + 1164.0, + 1152.0, + 1206.0, + 1049.0, + 1206.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1164.0, + 1370.0, + 1164.0, + 1370.0, + 1205.0, + 1247.0, + 1205.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1229.0, + 1305.0, + 1229.0, + 1305.0, + 1267.0, + 394.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1559.0, + 686.0, + 1559.0, + 686.0, + 1603.0, + 294.0, + 1603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 867.0, + 2085.0, + 867.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 461.0, + 1406.0, + 461.0, + 1406.0, + 499.0, + 294.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 491.0, + 1404.0, + 491.0, + 1404.0, + 529.0, + 294.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 523.0, + 657.0, + 523.0, + 657.0, + 560.0, + 294.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1803.0, + 959.0, + 1803.0, + 959.0, + 1839.0, + 293.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 1803.0, + 1409.0, + 1803.0, + 1409.0, + 1839.0, + 1045.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1835.0, + 988.0, + 1835.0, + 988.0, + 1870.0, + 293.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1024.0, + 1835.0, + 1406.0, + 1835.0, + 1406.0, + 1870.0, + 1024.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1863.0, + 591.0, + 1863.0, + 591.0, + 1900.0, + 292.0, + 1900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 626.0, + 1863.0, + 1406.0, + 1863.0, + 1406.0, + 1900.0, + 626.0, + 1900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1893.0, + 1404.0, + 1893.0, + 1404.0, + 1930.0, + 293.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1928.0, + 1404.0, + 1928.0, + 1404.0, + 1959.0, + 296.0, + 1959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1956.0, + 783.0, + 1956.0, + 783.0, + 1991.0, + 294.0, + 1991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1634.0, + 531.0, + 1634.0, + 531.0, + 1667.0, + 296.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 1634.0, + 1402.0, + 1634.0, + 1402.0, + 1667.0, + 590.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1665.0, + 589.0, + 1665.0, + 589.0, + 1699.0, + 292.0, + 1699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 1665.0, + 1405.0, + 1665.0, + 1405.0, + 1699.0, + 615.0, + 1699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1694.0, + 1405.0, + 1694.0, + 1405.0, + 1732.0, + 293.0, + 1732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1726.0, + 683.0, + 1726.0, + 683.0, + 1763.0, + 293.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 710.0, + 1726.0, + 1406.0, + 1726.0, + 1406.0, + 1763.0, + 710.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1757.0, + 665.0, + 1757.0, + 665.0, + 1790.0, + 296.0, + 1790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1297.0, + 842.0, + 1297.0, + 842.0, + 1340.0, + 292.0, + 1340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 935.0, + 1297.0, + 1405.0, + 1297.0, + 1405.0, + 1340.0, + 935.0, + 1340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1331.0, + 580.0, + 1331.0, + 580.0, + 1367.0, + 292.0, + 1367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 659.0, + 1331.0, + 1324.0, + 1331.0, + 1324.0, + 1367.0, + 659.0, + 1367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1400.0, + 1331.0, + 1409.0, + 1331.0, + 1409.0, + 1367.0, + 1400.0, + 1367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1358.0, + 1408.0, + 1358.0, + 1408.0, + 1398.0, + 292.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1390.0, + 1020.0, + 1390.0, + 1020.0, + 1428.0, + 294.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 1390.0, + 1407.0, + 1390.0, + 1407.0, + 1428.0, + 1058.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1420.0, + 1407.0, + 1420.0, + 1407.0, + 1459.0, + 294.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1452.0, + 597.0, + 1452.0, + 597.0, + 1491.0, + 292.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 656.0, + 1452.0, + 765.0, + 1452.0, + 765.0, + 1491.0, + 656.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 824.0, + 1452.0, + 942.0, + 1452.0, + 942.0, + 1491.0, + 824.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1031.0, + 1452.0, + 1197.0, + 1452.0, + 1197.0, + 1491.0, + 1031.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1287.0, + 1452.0, + 1407.0, + 1452.0, + 1407.0, + 1491.0, + 1287.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1485.0, + 920.0, + 1485.0, + 920.0, + 1517.0, + 295.0, + 1517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 227.0, + 1403.0, + 227.0, + 1403.0, + 267.0, + 426.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 260.0, + 1406.0, + 260.0, + 1406.0, + 301.0, + 448.0, + 301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 291.0, + 911.0, + 291.0, + 911.0, + 329.0, + 450.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 421.0, + 325.0, + 720.0, + 325.0, + 720.0, + 366.0, + 421.0, + 366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 802.0, + 325.0, + 1079.0, + 325.0, + 1079.0, + 366.0, + 802.0, + 366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1189.0, + 325.0, + 1408.0, + 325.0, + 1408.0, + 366.0, + 1189.0, + 366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 369.0, + 1408.0, + 369.0, + 1408.0, + 410.0, + 366.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 399.0, + 587.0, + 399.0, + 587.0, + 440.0, + 393.0, + 440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2000.0, + 1027.0, + 2000.0, + 1027.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1149.0, + 2000.0, + 1395.0, + 2000.0, + 1395.0, + 2039.0, + 1149.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 461.0, + 1406.0, + 461.0, + 1406.0, + 499.0, + 294.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 491.0, + 1404.0, + 491.0, + 1404.0, + 529.0, + 294.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 523.0, + 657.0, + 523.0, + 657.0, + 560.0, + 294.0, + 560.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 14, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1189, + 1405, + 1189, + 1405, + 1312, + 298, + 1312 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 919, + 1406, + 919, + 1406, + 1073, + 297, + 1073 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1328, + 1403, + 1328, + 1403, + 1453, + 298, + 1453 + ], + "score": 0.973 + }, + { + "category_id": 3, + "poly": [ + 304, + 234, + 1392, + 234, + 1392, + 759, + 304, + 759 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 300, + 1464, + 1403, + 1464, + 1403, + 1561, + 300, + 1561 + ], + "score": 0.962 + }, + { + "category_id": 8, + "poly": [ + 684, + 1832, + 1114, + 1832, + 1114, + 1930, + 684, + 1930 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 715, + 1638, + 1082, + 1638, + 1082, + 1729, + 715, + 1729 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 367, + 1749, + 1401, + 1749, + 1401, + 1813, + 367, + 1813 + ], + "score": 0.951 + }, + { + "category_id": 4, + "poly": [ + 298, + 795, + 1398, + 795, + 1398, + 860, + 298, + 860 + ], + "score": 0.938 + }, + { + "category_id": 8, + "poly": [ + 752, + 2000, + 1043, + 2000, + 1043, + 2041, + 752, + 2041 + ], + "score": 0.936 + }, + { + "category_id": 1, + "poly": [ + 367, + 1950, + 1342, + 1950, + 1342, + 1985, + 367, + 1985 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 367, + 1585, + 1392, + 1585, + 1392, + 1619, + 367, + 1619 + ], + "score": 0.923 + }, + { + "category_id": 0, + "poly": [ + 301, + 1118, + 744, + 1118, + 744, + 1155, + 301, + 1155 + ], + "score": 0.912 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 814, + 76, + 814, + 104, + 299, + 104 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 864, + 2088, + 864, + 2113, + 835, + 2113 + ], + "score": 0.868 + }, + { + "category_id": 14, + "poly": [ + 716, + 1633, + 1082, + 1633, + 1082, + 1731, + 716, + 1731 + ], + "score": 0.95, + "latex": "L _ { H } ( \\mathbf { y } , \\mathbf { h } ( \\mathbf { x } ) ) = \\sum _ { c = 1 } ^ { C } \\mathbb { 1 } _ { \\{ y _ { c } \\neq h _ { c } ( \\mathbf { x } ) \\} }" + }, + { + "category_id": 14, + "poly": [ + 682, + 1825, + 1115, + 1825, + 1115, + 1930, + 682, + 1930 + ], + "score": 0.94, + "latex": "L _ { r } ( \\mathbf { y } , \\mathbf { f } ( \\mathbf { x } ) ) = \\sum _ { ( i , j ) : y _ { i } = 1 , y _ { j } = 0 } ^ { C } \\mathbb { 1 } _ { \\{ f _ { i } < f _ { j } \\} }" + }, + { + "category_id": 13, + "poly": [ + 796, + 1465, + 936, + 1465, + 936, + 1500, + 796, + 1500 + ], + "score": 0.92, + "latex": "\\mathbf { y } \\in \\{ 0 , 1 \\} ^ { C }" + }, + { + "category_id": 13, + "poly": [ + 787, + 795, + 1207, + 795, + 1207, + 830, + 787, + 830 + ], + "score": 0.92, + "latex": "\\{ - 2 5 6 , - 2 5 5 , \\ldots , - 1 , 0 , 1 , \\ldots , 2 5 5 \\}" + }, + { + "category_id": 14, + "poly": [ + 751, + 1999, + 1046, + 1999, + 1046, + 2040, + 751, + 2040 + ], + "score": 0.91, + "latex": "L _ { s } ( \\mathbf { y } , \\mathbf { h } ( \\mathbf { x } ) ) = \\mathbb { 1 } _ { \\{ \\mathbf { y } \\neq \\mathbf { h } ( \\mathbf { x } ) \\} }" + }, + { + "category_id": 13, + "poly": [ + 884, + 1421, + 973, + 1421, + 973, + 1449, + 884, + 1449 + ], + "score": 0.9, + "latex": "C = 3 4" + }, + { + "category_id": 13, + "poly": [ + 821, + 1500, + 880, + 1500, + 880, + 1530, + 821, + 1530 + ], + "score": 0.88, + "latex": "\\mathbf { h } ( \\mathbf { x } )" + }, + { + "category_id": 13, + "poly": [ + 789, + 733, + 841, + 733, + 841, + 760, + 789, + 760 + ], + "score": 0.87, + "latex": "\\phi _ { 1 } ( n )" + }, + { + "category_id": 13, + "poly": [ + 1241, + 795, + 1277, + 795, + 1277, + 825, + 1241, + 825 + ], + "score": 0.86, + "latex": "\\mathbb { R } ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 460, + 1422, + 484, + 1422, + 484, + 1448, + 460, + 1448 + ], + "score": 0.82, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 1115, + 1497, + 1169, + 1497, + 1169, + 1530, + 1115, + 1530 + ], + "score": 0.76, + "latex": "\\mathbf { f } \\left( \\mathbf { x } \\right)" + }, + { + "category_id": 13, + "poly": [ + 1314, + 1953, + 1334, + 1953, + 1334, + 1979, + 1314, + 1979 + ], + "score": 0.44, + "latex": "\\mathbf { h }" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 245.0, + 1384.0, + 245.0, + 1384.0, + 278.0, + 1092.0, + 278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1090.0, + 278.0, + 1382.0, + 278.0, + 1382.0, + 313.0, + 1090.0, + 313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 296.0, + 342.0, + 296.0, + 342.0, + 675.0, + 306.0, + 675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 313.0, + 1371.0, + 313.0, + 1371.0, + 349.0, + 1094.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 853.0, + 343.0, + 886.0, + 343.0, + 886.0, + 389.0, + 853.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 348.0, + 1380.0, + 348.0, + 1380.0, + 383.0, + 1092.0, + 383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 387.0, + 1159.0, + 387.0, + 1159.0, + 420.0, + 1092.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 418.0, + 1353.0, + 418.0, + 1353.0, + 457.0, + 1092.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 536.0, + 570.0, + 536.0, + 570.0, + 569.0, + 529.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 599.0, + 685.0, + 599.0, + 685.0, + 631.0, + 658.0, + 631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 605.0, + 654.0, + 605.0, + 654.0, + 620.0, + 634.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 654.0, + 606.0, + 664.0, + 606.0, + 664.0, + 616.0, + 654.0, + 616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 698.0, + 612.0, + 725.0, + 612.0, + 725.0, + 639.0, + 698.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 721.0, + 620.0, + 734.0, + 620.0, + 734.0, + 637.0, + 721.0, + 637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 623.0, + 703.0, + 623.0, + 703.0, + 638.0, + 688.0, + 638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 502.0, + 725.0, + 788.0, + 725.0, + 788.0, + 764.0, + 502.0, + 764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 270.5, + 787.0, + 270.5, + 787.0, + 301.0, + 780.0, + 301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 272.0, + 869.0, + 272.0, + 869.0, + 303.5, + 865.0, + 303.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 655.25, + 284.5, + 714.25, + 284.5, + 714.25, + 308.0, + 655.25, + 308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 721.0, + 301.5, + 786.0, + 301.5, + 786.0, + 323.0, + 721.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 382.0, + 972.0, + 382.0, + 972.0, + 406.0, + 885.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.25, + 520.0, + 467.25, + 520.0, + 467.25, + 534.5, + 431.25, + 534.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 519.75, + 604.0, + 593.75, + 604.0, + 593.75, + 643.0, + 519.75, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 793.0, + 786.0, + 793.0, + 786.0, + 833.0, + 294.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1208.0, + 793.0, + 1240.0, + 793.0, + 1240.0, + 833.0, + 1208.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1278.0, + 793.0, + 1403.0, + 793.0, + 1403.0, + 833.0, + 1278.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 824.0, + 1013.0, + 824.0, + 1013.0, + 865.0, + 292.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1115.0, + 749.0, + 1115.0, + 749.0, + 1161.0, + 292.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1189.0, + 1406.0, + 1189.0, + 1406.0, + 1225.0, + 293.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1221.0, + 1405.0, + 1221.0, + 1405.0, + 1254.0, + 293.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1250.0, + 1405.0, + 1250.0, + 1405.0, + 1285.0, + 293.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1281.0, + 521.0, + 1281.0, + 521.0, + 1313.0, + 295.0, + 1313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 921.0, + 1404.0, + 921.0, + 1404.0, + 954.0, + 295.0, + 954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 950.0, + 1403.0, + 950.0, + 1403.0, + 983.0, + 294.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 979.0, + 1411.0, + 979.0, + 1411.0, + 1017.0, + 291.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1012.0, + 1406.0, + 1012.0, + 1406.0, + 1045.0, + 295.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1039.0, + 415.0, + 1039.0, + 415.0, + 1077.0, + 293.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1328.0, + 1404.0, + 1328.0, + 1404.0, + 1361.0, + 293.0, + 1361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1359.0, + 1406.0, + 1359.0, + 1406.0, + 1393.0, + 292.0, + 1393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1388.0, + 1405.0, + 1388.0, + 1405.0, + 1423.0, + 293.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1420.0, + 459.0, + 1420.0, + 459.0, + 1456.0, + 294.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 485.0, + 1420.0, + 883.0, + 1420.0, + 883.0, + 1456.0, + 485.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 974.0, + 1420.0, + 986.0, + 1420.0, + 986.0, + 1456.0, + 974.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1463.0, + 795.0, + 1463.0, + 795.0, + 1503.0, + 293.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 937.0, + 1463.0, + 1405.0, + 1463.0, + 1405.0, + 1503.0, + 937.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1498.0, + 820.0, + 1498.0, + 820.0, + 1532.0, + 294.0, + 1532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 1498.0, + 1114.0, + 1498.0, + 1114.0, + 1532.0, + 881.0, + 1532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 1498.0, + 1409.0, + 1498.0, + 1409.0, + 1532.0, + 1170.0, + 1532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1529.0, + 849.0, + 1529.0, + 849.0, + 1563.0, + 296.0, + 1563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 1749.0, + 1404.0, + 1749.0, + 1404.0, + 1785.0, + 368.0, + 1785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1778.0, + 1049.0, + 1778.0, + 1049.0, + 1814.0, + 393.0, + 1814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 365.0, + 1946.0, + 1313.0, + 1946.0, + 1313.0, + 1989.0, + 365.0, + 1989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1335.0, + 1946.0, + 1346.0, + 1946.0, + 1346.0, + 1989.0, + 1335.0, + 1989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 1583.0, + 1393.0, + 1583.0, + 1393.0, + 1622.0, + 366.0, + 1622.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 15, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 642, + 1405, + 642, + 1405, + 827, + 297, + 827 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 1200, + 1406, + 1200, + 1406, + 1324, + 297, + 1324 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 304, + 535, + 1405, + 535, + 1405, + 629, + 304, + 629 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 297, + 1470, + 1405, + 1470, + 1405, + 1564, + 297, + 1564 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 298, + 1674, + 1405, + 1674, + 1405, + 1770, + 298, + 1770 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 297, + 888, + 1401, + 888, + 1401, + 984, + 297, + 984 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1404, + 229, + 1404, + 325, + 298, + 325 + ], + "score": 0.96 + }, + { + "category_id": 1, + "poly": [ + 300, + 998, + 1398, + 998, + 1398, + 1093, + 300, + 1093 + ], + "score": 0.957 + }, + { + "category_id": 1, + "poly": [ + 368, + 1841, + 1193, + 1841, + 1193, + 2035, + 368, + 2035 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 368, + 346, + 1404, + 346, + 1404, + 511, + 368, + 511 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 296, + 1345, + 1403, + 1345, + 1403, + 1410, + 296, + 1410 + ], + "score": 0.947 + }, + { + "category_id": 8, + "poly": [ + 627, + 836, + 1072, + 836, + 1072, + 881, + 627, + 881 + ], + "score": 0.942 + }, + { + "category_id": 0, + "poly": [ + 298, + 1606, + 1021, + 1606, + 1021, + 1644, + 298, + 1644 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 295, + 1100, + 1402, + 1100, + 1402, + 1158, + 295, + 1158 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 298, + 1784, + 536, + 1784, + 536, + 1815, + 298, + 1815 + ], + "score": 0.915 + }, + { + "category_id": 8, + "poly": [ + 413, + 1421, + 1284, + 1421, + 1284, + 1461, + 413, + 1461 + ], + "score": 0.912 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 815, + 75, + 815, + 105, + 299, + 105 + ], + "score": 0.906 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 863, + 2088, + 863, + 2112, + 835, + 2112 + ], + "score": 0.853 + }, + { + "category_id": 8, + "poly": [ + 474, + 1159, + 1216, + 1159, + 1216, + 1193, + 474, + 1193 + ], + "score": 0.568 + }, + { + "category_id": 13, + "poly": [ + 546, + 1347, + 760, + 1347, + 760, + 1381, + 546, + 1381 + ], + "score": 0.95, + "latex": "L _ { r } ( \\mathbf { y } _ { P } , \\mathbf { f } ( \\mathbf { x } ) ) \\ge D" + }, + { + "category_id": 13, + "poly": [ + 849, + 1501, + 1056, + 1501, + 1056, + 1535, + 849, + 1535 + ], + "score": 0.93, + "latex": "\\bar { L _ { r } } ( { \\bf y } _ { P } , { \\bf f } ( { \\bf x } ) ) = 0" + }, + { + "category_id": 13, + "poly": [ + 1067, + 998, + 1226, + 998, + 1226, + 1034, + 1067, + 1034 + ], + "score": 0.93, + "latex": "\\mathbf { y } _ { P } \\in \\{ 0 , 1 \\} ^ { C }" + }, + { + "category_id": 13, + "poly": [ + 608, + 291, + 706, + 291, + 706, + 325, + 608, + 325 + ], + "score": 0.93, + "latex": "p _ { c } ( y _ { c } | \\mathbf { x } )" + }, + { + "category_id": 14, + "poly": [ + 625, + 837, + 1072, + 837, + 1072, + 880, + 625, + 880 + ], + "score": 0.93, + "latex": "1 ^ { T } + 2 ^ { T } + \\cdot \\cdot \\cdot + C _ { A } ^ { T } \\leq C _ { A } ^ { T + 1 } \\leq C C _ { A } ^ { T }" + }, + { + "category_id": 13, + "poly": [ + 694, + 1031, + 880, + 1031, + 880, + 1061, + 694, + 1061 + ], + "score": 0.92, + "latex": "D : = C _ { A } - C _ { P }" + }, + { + "category_id": 13, + "poly": [ + 352, + 1533, + 467, + 1533, + 467, + 1564, + 352, + 1564 + ], + "score": 0.91, + "latex": "C _ { A } = C _ { P }" + }, + { + "category_id": 13, + "poly": [ + 1023, + 948, + 1064, + 948, + 1064, + 984, + 1023, + 984 + ], + "score": 0.91, + "latex": "C _ { A } ^ { T }" + }, + { + "category_id": 13, + "poly": [ + 554, + 1261, + 859, + 1261, + 859, + 1295, + 554, + 1295 + ], + "score": 0.91, + "latex": "L _ { r } ( \\mathbf { y } _ { P } , \\mathbf { f } ( \\mathbf { x } ) ) = 2 + 5 = 7" + }, + { + "category_id": 13, + "poly": [ + 633, + 1200, + 729, + 1200, + 729, + 1231, + 633, + 1231 + ], + "score": 0.9, + "latex": "C _ { P } = 6" + }, + { + "category_id": 13, + "poly": [ + 1295, + 1201, + 1404, + 1201, + 1404, + 1231, + 1295, + 1231 + ], + "score": 0.9, + "latex": "C _ { A } = 1 1" + }, + { + "category_id": 13, + "poly": [ + 369, + 891, + 410, + 891, + 410, + 920, + 369, + 920 + ], + "score": 0.9, + "latex": "C _ { A }" + }, + { + "category_id": 13, + "poly": [ + 1210, + 1503, + 1288, + 1503, + 1288, + 1530, + 1210, + 1530 + ], + "score": 0.89, + "latex": "D = 0" + }, + { + "category_id": 13, + "poly": [ + 473, + 734, + 514, + 734, + 514, + 763, + 473, + 763 + ], + "score": 0.89, + "latex": "C ^ { T }" + }, + { + "category_id": 13, + "poly": [ + 831, + 1002, + 871, + 1002, + 871, + 1030, + 831, + 1030 + ], + "score": 0.88, + "latex": "C _ { P }" + }, + { + "category_id": 14, + "poly": [ + 414, + 1418, + 1285, + 1418, + 1285, + 1462, + 414, + 1462 + ], + "score": 0.88, + "latex": "C _ { A } ^ { T } = ( C _ { P } + D ) ^ { T } \\leq \\mathrm { c o n s t } + \\mathrm { c o n s t } \\times D ^ { T } \\leq \\mathrm { c o n s t } + \\mathrm { c o n s t } \\times L _ { r } ( \\mathbf { y } _ { P } , \\mathbf { f } ( \\mathbf { x } ) ) ^ { T }" + }, + { + "category_id": 13, + "poly": [ + 634, + 1233, + 712, + 1233, + 712, + 1259, + 634, + 1259 + ], + "score": 0.87, + "latex": "D = 5" + }, + { + "category_id": 13, + "poly": [ + 1298, + 1100, + 1352, + 1100, + 1352, + 1134, + 1298, + 1134 + ], + "score": 0.87, + "latex": "\\mathbf { f } \\left( \\mathbf { x } \\right)" + }, + { + "category_id": 13, + "poly": [ + 470, + 1261, + 523, + 1261, + 523, + 1294, + 470, + 1294 + ], + "score": 0.86, + "latex": "\\mathbf { f } \\left( \\mathbf { x } \\right)" + }, + { + "category_id": 13, + "poly": [ + 618, + 1502, + 672, + 1502, + 672, + 1535, + 618, + 1535 + ], + "score": 0.85, + "latex": "\\mathbf { f } \\left( \\mathbf { x } \\right)" + }, + { + "category_id": 13, + "poly": [ + 662, + 1002, + 687, + 1002, + 687, + 1028, + 662, + 1028 + ], + "score": 0.84, + "latex": "P" + }, + { + "category_id": 13, + "poly": [ + 773, + 1064, + 798, + 1064, + 798, + 1089, + 773, + 1089 + ], + "score": 0.83, + "latex": "P" + }, + { + "category_id": 13, + "poly": [ + 922, + 705, + 947, + 705, + 947, + 732, + 922, + 732 + ], + "score": 0.83, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 765, + 1473, + 788, + 1473, + 788, + 1499, + 765, + 1499 + ], + "score": 0.82, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 502, + 1202, + 527, + 1202, + 527, + 1228, + 502, + 1228 + ], + "score": 0.82, + "latex": "P" + }, + { + "category_id": 13, + "poly": [ + 838, + 706, + 862, + 706, + 862, + 732, + 838, + 732 + ], + "score": 0.8, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 612, + 1032, + 636, + 1032, + 636, + 1058, + 612, + 1058 + ], + "score": 0.8, + "latex": "P" + }, + { + "category_id": 14, + "poly": [ + 481, + 1160, + 1217, + 1160, + 1217, + 1193, + 481, + 1193 + ], + "score": 0.8, + "latex": "\\begin{array} { r l r l r } { 1 \\mathrm { ~ 1 ~ 1 ~ 1 ~ } } & { { } } & { 1 } & \\qquad 1 \\mathrm ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 ~ 0 0 ~ 0 ~ 0 ~ 0 ~ 0 0 \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1201, + 736, + 1225, + 736, + 1225, + 762, + 1201, + 762 + ], + "score": 0.8, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 802, + 1975, + 899, + 1975, + 899, + 2003, + 802, + 2003 + ], + "score": 0.59, + "latex": "( \\mathbf { \\nabla } _ { \\mathbf { X } } \\mathbf { s } ) > 0" + }, + { + "category_id": 13, + "poly": [ + 787, + 1874, + 882, + 1874, + 882, + 1902, + 787, + 1902 + ], + "score": 0.53, + "latex": "( \\mathbf { \\nabla } _ { \\mathbf { X } } \\mathbf { S } \\mathbf { \\nabla } ) > 0" + }, + { + "category_id": 13, + "poly": [ + 626, + 1946, + 666, + 1946, + 666, + 1971, + 626, + 1971 + ], + "score": 0.48, + "latex": "- >" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1606.0, + 1023.0, + 1606.0, + 1023.0, + 1647.0, + 294.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 640.0, + 1408.0, + 640.0, + 1408.0, + 679.0, + 292.0, + 679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 672.0, + 1407.0, + 672.0, + 1407.0, + 710.0, + 292.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 705.0, + 837.0, + 705.0, + 837.0, + 737.0, + 296.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 705.0, + 921.0, + 705.0, + 921.0, + 737.0, + 863.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 948.0, + 705.0, + 1402.0, + 705.0, + 1402.0, + 737.0, + 948.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 732.0, + 472.0, + 732.0, + 472.0, + 770.0, + 291.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 515.0, + 732.0, + 1200.0, + 732.0, + 1200.0, + 770.0, + 515.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1226.0, + 732.0, + 1406.0, + 732.0, + 1406.0, + 770.0, + 1226.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 766.0, + 1405.0, + 766.0, + 1405.0, + 798.0, + 296.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 796.0, + 963.0, + 796.0, + 963.0, + 831.0, + 294.0, + 831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1198.0, + 501.0, + 1198.0, + 501.0, + 1234.0, + 294.0, + 1234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 528.0, + 1198.0, + 632.0, + 1198.0, + 632.0, + 1234.0, + 528.0, + 1234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 1198.0, + 1294.0, + 1198.0, + 1294.0, + 1234.0, + 730.0, + 1234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1230.0, + 633.0, + 1230.0, + 633.0, + 1263.0, + 295.0, + 1263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 713.0, + 1230.0, + 1406.0, + 1230.0, + 1406.0, + 1263.0, + 713.0, + 1263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1261.0, + 469.0, + 1261.0, + 469.0, + 1297.0, + 295.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 524.0, + 1261.0, + 553.0, + 1261.0, + 553.0, + 1297.0, + 524.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 1261.0, + 1406.0, + 1261.0, + 1406.0, + 1297.0, + 860.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1292.0, + 844.0, + 1292.0, + 844.0, + 1325.0, + 295.0, + 1325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 536.0, + 1404.0, + 536.0, + 1404.0, + 570.0, + 299.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 564.0, + 1405.0, + 564.0, + 1405.0, + 605.0, + 298.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 598.0, + 1381.0, + 598.0, + 1381.0, + 632.0, + 298.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1466.0, + 764.0, + 1466.0, + 764.0, + 1507.0, + 292.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 789.0, + 1466.0, + 1405.0, + 1466.0, + 1405.0, + 1507.0, + 789.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1498.0, + 617.0, + 1498.0, + 617.0, + 1538.0, + 292.0, + 1538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 673.0, + 1498.0, + 848.0, + 1498.0, + 848.0, + 1538.0, + 673.0, + 1538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1057.0, + 1498.0, + 1209.0, + 1498.0, + 1209.0, + 1538.0, + 1057.0, + 1538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1289.0, + 1498.0, + 1406.0, + 1498.0, + 1406.0, + 1538.0, + 1289.0, + 1538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1528.0, + 351.0, + 1528.0, + 351.0, + 1569.0, + 293.0, + 1569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 468.0, + 1528.0, + 481.0, + 1528.0, + 481.0, + 1569.0, + 468.0, + 1569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1673.0, + 1406.0, + 1673.0, + 1406.0, + 1712.0, + 292.0, + 1712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1705.0, + 1405.0, + 1705.0, + 1405.0, + 1742.0, + 293.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1737.0, + 595.0, + 1737.0, + 595.0, + 1775.0, + 295.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 888.0, + 368.0, + 888.0, + 368.0, + 923.0, + 295.0, + 923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 411.0, + 888.0, + 1405.0, + 888.0, + 1405.0, + 923.0, + 411.0, + 923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 920.0, + 1406.0, + 920.0, + 1406.0, + 952.0, + 293.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 941.0, + 1022.0, + 941.0, + 1022.0, + 995.0, + 288.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 941.0, + 1081.0, + 941.0, + 1081.0, + 995.0, + 1065.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 230.0, + 1404.0, + 230.0, + 1404.0, + 265.0, + 296.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 260.0, + 1405.0, + 260.0, + 1405.0, + 297.0, + 293.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 290.0, + 607.0, + 290.0, + 607.0, + 328.0, + 294.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 707.0, + 290.0, + 931.0, + 290.0, + 931.0, + 328.0, + 707.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 998.0, + 661.0, + 998.0, + 661.0, + 1036.0, + 294.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 998.0, + 830.0, + 998.0, + 830.0, + 1036.0, + 688.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 998.0, + 1066.0, + 998.0, + 1066.0, + 1036.0, + 872.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1227.0, + 998.0, + 1403.0, + 998.0, + 1403.0, + 1036.0, + 1227.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1028.0, + 611.0, + 1028.0, + 611.0, + 1063.0, + 295.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 637.0, + 1028.0, + 693.0, + 1028.0, + 693.0, + 1063.0, + 637.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 1028.0, + 1402.0, + 1028.0, + 1402.0, + 1063.0, + 881.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1060.0, + 772.0, + 1060.0, + 772.0, + 1094.0, + 295.0, + 1094.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 799.0, + 1060.0, + 997.0, + 1060.0, + 997.0, + 1094.0, + 799.0, + 1094.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1839.0, + 740.0, + 1839.0, + 740.0, + 1873.0, + 369.0, + 1873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 1872.0, + 786.0, + 1872.0, + 786.0, + 1903.0, + 396.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 883.0, + 1872.0, + 1050.0, + 1872.0, + 1050.0, + 1903.0, + 883.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1897.0, + 1193.0, + 1897.0, + 1193.0, + 1938.0, + 394.0, + 1938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 377.0, + 1942.0, + 625.0, + 1942.0, + 625.0, + 1974.0, + 377.0, + 1974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 1942.0, + 733.0, + 1942.0, + 733.0, + 1974.0, + 667.0, + 1974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1972.0, + 801.0, + 1972.0, + 801.0, + 2006.0, + 395.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 1972.0, + 1068.0, + 1972.0, + 1068.0, + 2006.0, + 900.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 2000.0, + 1188.0, + 2000.0, + 1188.0, + 2038.0, + 395.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 342.0, + 1406.0, + 342.0, + 1406.0, + 384.0, + 367.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 379.0, + 770.0, + 379.0, + 770.0, + 412.0, + 395.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 414.0, + 1406.0, + 414.0, + 1406.0, + 453.0, + 380.0, + 453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 446.0, + 1408.0, + 446.0, + 1408.0, + 485.0, + 391.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 473.0, + 474.0, + 473.0, + 474.0, + 517.0, + 390.0, + 517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1344.0, + 545.0, + 1344.0, + 545.0, + 1384.0, + 293.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 1344.0, + 1406.0, + 1344.0, + 1406.0, + 1384.0, + 761.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1377.0, + 758.0, + 1377.0, + 758.0, + 1414.0, + 295.0, + 1414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1094.0, + 1297.0, + 1094.0, + 1297.0, + 1139.0, + 293.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1353.0, + 1094.0, + 1406.0, + 1094.0, + 1406.0, + 1139.0, + 1353.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1130.0, + 427.0, + 1130.0, + 427.0, + 1166.0, + 293.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1781.0, + 540.0, + 1781.0, + 540.0, + 1819.0, + 294.0, + 1819.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 16, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 367, + 1223, + 1406, + 1223, + 1406, + 1919, + 367, + 1919 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 366, + 228, + 1403, + 228, + 1403, + 1141, + 366, + 1141 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 300, + 1943, + 1404, + 1943, + 1404, + 2036, + 300, + 2036 + ], + "score": 0.945 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 814, + 75, + 814, + 105, + 299, + 105 + ], + "score": 0.88 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 864, + 2088, + 864, + 2113, + 835, + 2113 + ], + "score": 0.846 + }, + { + "category_id": 1, + "poly": [ + 297, + 1167, + 562, + 1167, + 562, + 1198, + 297, + 1198 + ], + "score": 0.717 + }, + { + "category_id": 0, + "poly": [ + 297, + 1167, + 562, + 1167, + 562, + 1198, + 297, + 1198 + ], + "score": 0.166 + }, + { + "category_id": 13, + "poly": [ + 954, + 1885, + 1024, + 1885, + 1024, + 1914, + 954, + 1914 + ], + "score": 0.89, + "latex": "n \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 778, + 532, + 850, + 532, + 850, + 559, + 778, + 559 + ], + "score": 0.87, + "latex": "\\mathrm { n } > = 0" + }, + { + "category_id": 13, + "poly": [ + 602, + 2005, + 690, + 2005, + 690, + 2032, + 602, + 2032 + ], + "score": 0.86, + "latex": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 1" + }, + { + "category_id": 13, + "poly": [ + 472, + 2005, + 560, + 2005, + 560, + 2032, + 472, + 2032 + ], + "score": 0.85, + "latex": "\\scriptstyle { \\frac { 0 } { 0 } } 2 = = 0" + }, + { + "category_id": 13, + "poly": [ + 1281, + 1854, + 1402, + 1854, + 1402, + 1884, + 1281, + 1884 + ], + "score": 0.83, + "latex": "\\begin{array} { r l } { \\mathrm { y s } \\left[ 0 \\right] } & { { } = } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 904, + 562, + 971, + 562, + 971, + 591, + 904, + 591 + ], + "score": 0.8, + "latex": "( \\mathrm { n } { + } 1 )" + }, + { + "category_id": 13, + "poly": [ + 302, + 2005, + 359, + 2005, + 359, + 2034, + 302, + 2034 + ], + "score": 0.78, + "latex": "( > 0 )" + }, + { + "category_id": 13, + "poly": [ + 682, + 635, + 723, + 635, + 723, + 662, + 682, + 662 + ], + "score": 0.72, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 382, + 2005, + 439, + 2005, + 439, + 2034, + 382, + 2034 + ], + "score": 0.72, + "latex": "( < 0 )" + }, + { + "category_id": 13, + "poly": [ + 987, + 533, + 1082, + 533, + 1082, + 560, + 987, + 560 + ], + "score": 0.71, + "latex": "( \\mathsf { x s } ) > \\mathsf { n }" + }, + { + "category_id": 13, + "poly": [ + 1162, + 1975, + 1304, + 1975, + 1304, + 2002, + 1162, + 2002 + ], + "score": 0.68, + "latex": "\\mathrm { I N T } { } \\mathrm { B O O L }" + }, + { + "category_id": 13, + "poly": [ + 643, + 1795, + 683, + 1795, + 683, + 1821, + 643, + 1821 + ], + "score": 0.64, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 1130, + 564, + 1166, + 564, + 1166, + 588, + 1130, + 588 + ], + "score": 0.63, + "latex": "_ { \\textrm { x S } }" + }, + { + "category_id": 13, + "poly": [ + 1263, + 1945, + 1320, + 1945, + 1320, + 1973, + 1263, + 1973 + ], + "score": 0.61, + "latex": "( \\star 4 )" + }, + { + "category_id": 13, + "poly": [ + 759, + 1794, + 800, + 1794, + 800, + 1820, + 759, + 1820 + ], + "score": 0.59, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 390, + 1946, + 417, + 1946, + 417, + 1970, + 390, + 1970 + ], + "score": 0.59, + "latex": "" + }, + { + "category_id": 13, + "poly": [ + 654, + 1631, + 695, + 1631, + 695, + 1656, + 654, + 1656 + ], + "score": 0.58, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 772, + 502, + 813, + 502, + 813, + 528, + 772, + 528 + ], + "score": 0.57, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 820, + 769, + 916, + 769, + 916, + 797, + 820, + 797 + ], + "score": 0.56, + "latex": "( \\mathbf { \\nabla } _ { \\mathbf { X } } \\mathbf { S } ) > 0" + }, + { + "category_id": 13, + "poly": [ + 770, + 1631, + 812, + 1631, + 812, + 1656, + 770, + 1656 + ], + "score": 0.56, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 891, + 1794, + 933, + 1794, + 933, + 1821, + 891, + 1821 + ], + "score": 0.55, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 394, + 1885, + 777, + 1885, + 777, + 1917, + 394, + 1917 + ], + "score": 0.55, + "latex": "\\mathbf { x } \\mathbf { s } \\left[ 0 \\right] , \\mathbf { y } \\mathbf { s } \\left[ \\mathrm { n } \\right] \\mathbf { \\Psi } = \\mathbf { \\Psi } \\mathbf { f } \\left( \\mathbf { y } \\mathbf { s } \\left[ \\mathrm { n - 1 } \\right] \\right." + }, + { + "category_id": 13, + "poly": [ + 728, + 565, + 764, + 565, + 764, + 589, + 728, + 589 + ], + "score": 0.53, + "latex": "_ { \\textrm { x S } }" + }, + { + "category_id": 13, + "poly": [ + 623, + 502, + 664, + 502, + 664, + 528, + 623, + 528 + ], + "score": 0.52, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 821, + 666, + 916, + 666, + 916, + 694, + 821, + 694 + ], + "score": 0.52, + "latex": "( \\mathbf { \\nabla } _ { \\mathbf { X } } \\mathbf { S } ) > 0" + }, + { + "category_id": 13, + "poly": [ + 632, + 1497, + 672, + 1497, + 672, + 1522, + 632, + 1522 + ], + "score": 0.48, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 745, + 367, + 786, + 367, + 786, + 393, + 745, + 393 + ], + "score": 0.47, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 568, + 1945, + 624, + 1945, + 624, + 1973, + 568, + 1973 + ], + "score": 0.45, + "latex": "( + 1 )" + }, + { + "category_id": 13, + "poly": [ + 565, + 1943, + 1382, + 1943, + 1382, + 1974, + 565, + 1974 + ], + "score": 0.43, + "latex": "\\left( + 1 \\right) , \\left( - 1 \\right) , \\left( \\star 2 \\right) , \\left( / 2 \\right) , \\left( \\star \\left( - 1 \\right) \\right) , \\left( \\star \\star 2 \\right) , \\left( \\star 3 \\right) , \\left( / 3 \\right) , \\left( \\star 4 \\right) , \\left( / 4 \\right) , \\left( \\star 3 \\right) , \\left( \\star 4 \\right) ." + }, + { + "category_id": 13, + "poly": [ + 596, + 367, + 637, + 367, + 637, + 393, + 596, + 393 + ], + "score": 0.43, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 629, + 1363, + 669, + 1363, + 669, + 1387, + 629, + 1387 + ], + "score": 0.41, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 1105, + 1945, + 1163, + 1945, + 1163, + 1973, + 1105, + 1973 + ], + "score": 0.41, + "latex": "( \\star 3 )" + }, + { + "category_id": 13, + "poly": [ + 780, + 1496, + 822, + 1496, + 822, + 1523, + 780, + 1523 + ], + "score": 0.4, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 1171, + 296, + 1191, + 296, + 1191, + 320, + 1171, + 320 + ], + "score": 0.4, + "latex": "\\boldsymbol { \\mathrm { n } }" + }, + { + "category_id": 13, + "poly": [ + 778, + 1362, + 820, + 1362, + 820, + 1389, + 778, + 1389 + ], + "score": 0.37, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 691, + 739, + 730, + 739, + 730, + 765, + 691, + 765 + ], + "score": 0.37, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 807, + 1886, + 898, + 1886, + 898, + 1915, + 807, + 1915 + ], + "score": 0.36, + "latex": "\\mathtt { x s } [ \\mathtt { n } ]" + }, + { + "category_id": 13, + "poly": [ + 902, + 1631, + 944, + 1631, + 944, + 1656, + 902, + 1656 + ], + "score": 0.36, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 718, + 432, + 754, + 432, + 754, + 454, + 718, + 454 + ], + "score": 0.36, + "latex": "_ { \\textrm { x S } }" + }, + { + "category_id": 13, + "poly": [ + 1010, + 1945, + 1083, + 1945, + 1083, + 1973, + 1010, + 1973 + ], + "score": 0.35, + "latex": "( \\star \\star 2 )" + }, + { + "category_id": 13, + "poly": [ + 1238, + 1829, + 1274, + 1829, + 1274, + 1851, + 1238, + 1851 + ], + "score": 0.33, + "latex": "_ { \\textrm { x S } }" + }, + { + "category_id": 13, + "poly": [ + 674, + 843, + 714, + 843, + 714, + 868, + 674, + 868 + ], + "score": 0.33, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 1075, + 1754, + 1111, + 1754, + 1111, + 1778, + 1075, + 1778 + ], + "score": 0.32, + "latex": "_ { \\textrm { x S } }" + }, + { + "category_id": 13, + "poly": [ + 594, + 233, + 634, + 233, + 634, + 259, + 594, + 259 + ], + "score": 0.32, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 616, + 1051, + 658, + 1051, + 658, + 1077, + 616, + 1077 + ], + "score": 0.3, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 930, + 1496, + 971, + 1496, + 971, + 1523, + 930, + 1523 + ], + "score": 0.28, + "latex": "- >" + }, + { + "category_id": 13, + "poly": [ + 674, + 595, + 693, + 595, + 693, + 618, + 674, + 618 + ], + "score": 0.27, + "latex": "\\boldsymbol { \\mathrm { n } }" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2122.0, + 831.0, + 2122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1165.0, + 566.0, + 1165.0, + 566.0, + 1201.0, + 297.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 1223.0, + 1021.0, + 1223.0, + 1021.0, + 1258.0, + 367.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1256.0, + 930.0, + 1256.0, + 930.0, + 1288.0, + 395.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1284.0, + 1404.0, + 1284.0, + 1404.0, + 1322.0, + 394.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1316.0, + 1009.0, + 1316.0, + 1009.0, + 1349.0, + 395.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1358.0, + 628.0, + 1358.0, + 628.0, + 1392.0, + 372.0, + 1392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 670.0, + 1358.0, + 777.0, + 1358.0, + 777.0, + 1392.0, + 670.0, + 1392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 1358.0, + 1066.0, + 1358.0, + 1066.0, + 1392.0, + 821.0, + 1392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1389.0, + 1013.0, + 1389.0, + 1013.0, + 1424.0, + 395.0, + 1424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1419.0, + 1403.0, + 1419.0, + 1403.0, + 1454.0, + 395.0, + 1454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1449.0, + 1085.0, + 1449.0, + 1085.0, + 1485.0, + 394.0, + 1485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 374.0, + 1492.0, + 631.0, + 1492.0, + 631.0, + 1526.0, + 374.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 673.0, + 1492.0, + 779.0, + 1492.0, + 779.0, + 1526.0, + 673.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 1492.0, + 929.0, + 1492.0, + 929.0, + 1526.0, + 823.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 972.0, + 1492.0, + 1037.0, + 1492.0, + 1037.0, + 1526.0, + 972.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1522.0, + 1095.0, + 1522.0, + 1095.0, + 1557.0, + 395.0, + 1557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1553.0, + 1403.0, + 1553.0, + 1403.0, + 1589.0, + 395.0, + 1589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1584.0, + 961.0, + 1584.0, + 961.0, + 1618.0, + 394.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1625.0, + 653.0, + 1625.0, + 653.0, + 1661.0, + 369.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 1625.0, + 769.0, + 1625.0, + 769.0, + 1661.0, + 696.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 813.0, + 1625.0, + 901.0, + 1625.0, + 901.0, + 1661.0, + 813.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 1625.0, + 1337.0, + 1625.0, + 1337.0, + 1661.0, + 945.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1656.0, + 1280.0, + 1656.0, + 1280.0, + 1693.0, + 394.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1687.0, + 1409.0, + 1687.0, + 1409.0, + 1724.0, + 394.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1718.0, + 1405.0, + 1718.0, + 1405.0, + 1755.0, + 393.0, + 1755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1749.0, + 1074.0, + 1749.0, + 1074.0, + 1784.0, + 393.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 1749.0, + 1209.0, + 1749.0, + 1209.0, + 1784.0, + 1112.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 1788.0, + 642.0, + 1788.0, + 642.0, + 1827.0, + 388.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 684.0, + 1788.0, + 758.0, + 1788.0, + 758.0, + 1827.0, + 684.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 801.0, + 1788.0, + 890.0, + 1788.0, + 890.0, + 1827.0, + 801.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 934.0, + 1788.0, + 1180.0, + 1788.0, + 1180.0, + 1827.0, + 934.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1821.0, + 1237.0, + 1821.0, + 1237.0, + 1858.0, + 394.0, + 1858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 1821.0, + 1405.0, + 1821.0, + 1405.0, + 1858.0, + 1275.0, + 1858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1852.0, + 1280.0, + 1852.0, + 1280.0, + 1888.0, + 394.0, + 1888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 1852.0, + 1407.0, + 1852.0, + 1407.0, + 1888.0, + 1403.0, + 1888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 1885.0, + 806.0, + 1885.0, + 806.0, + 1918.0, + 778.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 1885.0, + 953.0, + 1885.0, + 953.0, + 1918.0, + 899.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1025.0, + 1885.0, + 1035.0, + 1885.0, + 1035.0, + 1918.0, + 1025.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 228.0, + 593.0, + 228.0, + 593.0, + 264.0, + 369.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 228.0, + 850.0, + 228.0, + 850.0, + 264.0, + 635.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 260.0, + 732.0, + 260.0, + 732.0, + 298.0, + 396.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 291.0, + 1170.0, + 291.0, + 1170.0, + 327.0, + 394.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1192.0, + 291.0, + 1404.0, + 291.0, + 1404.0, + 327.0, + 1192.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 322.0, + 1369.0, + 322.0, + 1369.0, + 354.0, + 394.0, + 354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 364.0, + 595.0, + 364.0, + 595.0, + 396.0, + 367.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 364.0, + 744.0, + 364.0, + 744.0, + 396.0, + 638.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 787.0, + 364.0, + 851.0, + 364.0, + 851.0, + 396.0, + 787.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 395.0, + 733.0, + 395.0, + 733.0, + 430.0, + 396.0, + 430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 423.0, + 717.0, + 423.0, + 717.0, + 461.0, + 394.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 755.0, + 423.0, + 1403.0, + 423.0, + 1403.0, + 461.0, + 755.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 455.0, + 1281.0, + 455.0, + 1281.0, + 490.0, + 394.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 497.0, + 622.0, + 497.0, + 622.0, + 531.0, + 367.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 665.0, + 497.0, + 771.0, + 497.0, + 771.0, + 531.0, + 665.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 814.0, + 497.0, + 880.0, + 497.0, + 880.0, + 531.0, + 814.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 529.0, + 777.0, + 529.0, + 777.0, + 561.0, + 395.0, + 561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 851.0, + 529.0, + 986.0, + 529.0, + 986.0, + 561.0, + 851.0, + 561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 529.0, + 1248.0, + 529.0, + 1248.0, + 561.0, + 1083.0, + 561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 560.0, + 727.0, + 560.0, + 727.0, + 593.0, + 397.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 560.0, + 903.0, + 560.0, + 903.0, + 593.0, + 765.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 972.0, + 560.0, + 1129.0, + 560.0, + 1129.0, + 593.0, + 972.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 560.0, + 1403.0, + 560.0, + 1403.0, + 593.0, + 1167.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 592.0, + 673.0, + 592.0, + 673.0, + 621.0, + 395.0, + 621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 694.0, + 592.0, + 1112.0, + 592.0, + 1112.0, + 621.0, + 694.0, + 621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 379.0, + 631.0, + 681.0, + 631.0, + 681.0, + 665.0, + 379.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 631.0, + 789.0, + 631.0, + 789.0, + 665.0, + 724.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 662.0, + 820.0, + 662.0, + 820.0, + 696.0, + 394.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 917.0, + 662.0, + 1083.0, + 662.0, + 1083.0, + 696.0, + 917.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 690.0, + 1162.0, + 690.0, + 1162.0, + 730.0, + 394.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 736.0, + 690.0, + 736.0, + 690.0, + 769.0, + 368.0, + 769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 731.0, + 736.0, + 796.0, + 736.0, + 796.0, + 769.0, + 731.0, + 769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 767.0, + 819.0, + 767.0, + 819.0, + 798.0, + 394.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 917.0, + 767.0, + 1083.0, + 767.0, + 1083.0, + 798.0, + 917.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 797.0, + 1166.0, + 797.0, + 1166.0, + 832.0, + 394.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 389.0, + 839.0, + 673.0, + 839.0, + 673.0, + 872.0, + 389.0, + 872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 839.0, + 811.0, + 839.0, + 811.0, + 872.0, + 715.0, + 872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 871.0, + 879.0, + 871.0, + 879.0, + 903.0, + 397.0, + 903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 901.0, + 992.0, + 901.0, + 992.0, + 934.0, + 397.0, + 934.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 942.0, + 764.0, + 942.0, + 764.0, + 978.0, + 367.0, + 978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 974.0, + 746.0, + 974.0, + 746.0, + 1006.0, + 397.0, + 1006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1005.0, + 1057.0, + 1005.0, + 1057.0, + 1037.0, + 395.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 1046.0, + 615.0, + 1046.0, + 615.0, + 1081.0, + 391.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 659.0, + 1046.0, + 724.0, + 1046.0, + 724.0, + 1081.0, + 659.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 1078.0, + 696.0, + 1078.0, + 696.0, + 1110.0, + 396.0, + 1110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1104.0, + 1303.0, + 1104.0, + 1303.0, + 1143.0, + 394.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1940.0, + 389.0, + 1940.0, + 389.0, + 1976.0, + 295.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 418.0, + 1940.0, + 564.0, + 1940.0, + 564.0, + 1976.0, + 418.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1383.0, + 1940.0, + 1403.0, + 1940.0, + 1403.0, + 1976.0, + 1383.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1974.0, + 1161.0, + 1974.0, + 1161.0, + 2005.0, + 295.0, + 2005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 1974.0, + 1405.0, + 1974.0, + 1405.0, + 2005.0, + 1305.0, + 2005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2002.0, + 301.0, + 2002.0, + 301.0, + 2038.0, + 295.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 360.0, + 2002.0, + 381.0, + 2002.0, + 381.0, + 2038.0, + 360.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.0, + 2002.0, + 471.0, + 2002.0, + 471.0, + 2038.0, + 440.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 561.0, + 2002.0, + 601.0, + 2002.0, + 601.0, + 2038.0, + 561.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.0, + 2002.0, + 1408.0, + 2002.0, + 1408.0, + 2038.0, + 691.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1165.0, + 566.0, + 1165.0, + 566.0, + 1201.0, + 297.0, + 1201.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 17, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1880, + 1403, + 1880, + 1403, + 2035, + 298, + 2035 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 307, + 1403, + 307, + 1403, + 430, + 298, + 430 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 294, + 229, + 1401, + 229, + 1401, + 293, + 294, + 293 + ], + "score": 0.952 + }, + { + "category_id": 4, + "poly": [ + 296, + 1583, + 1406, + 1583, + 1406, + 1738, + 296, + 1738 + ], + "score": 0.931 + }, + { + "category_id": 3, + "poly": [ + 302, + 460, + 1394, + 460, + 1394, + 1557, + 302, + 1557 + ], + "score": 0.93 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.9 + }, + { + "category_id": 0, + "poly": [ + 298, + 1812, + 983, + 1812, + 983, + 1846, + 298, + 1846 + ], + "score": 0.897 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2112, + 836, + 2112 + ], + "score": 0.846 + }, + { + "category_id": 13, + "poly": [ + 417, + 2003, + 475, + 2003, + 475, + 2036, + 417, + 2036 + ], + "score": 0.92, + "latex": "( i , j )" + }, + { + "category_id": 13, + "poly": [ + 372, + 1614, + 447, + 1614, + 447, + 1642, + 372, + 1642 + ], + "score": 0.9, + "latex": "T = 3" + }, + { + "category_id": 13, + "poly": [ + 1156, + 1584, + 1260, + 1584, + 1260, + 1612, + 1156, + 1612 + ], + "score": 0.89, + "latex": "P = 5 0 0" + }, + { + "category_id": 13, + "poly": [ + 1066, + 2007, + 1081, + 2007, + 1081, + 2035, + 1066, + 2035 + ], + "score": 0.83, + "latex": "j" + }, + { + "category_id": 13, + "poly": [ + 1301, + 370, + 1323, + 370, + 1323, + 396, + 1301, + 396 + ], + "score": 0.76, + "latex": "L" + }, + { + "category_id": 13, + "poly": [ + 312, + 840, + 373, + 840, + 373, + 857, + 312, + 857 + ], + "score": 0.73, + "latex": "( \\% 2 = 1 )" + }, + { + "category_id": 13, + "poly": [ + 297, + 401, + 310, + 401, + 310, + 427, + 297, + 427 + ], + "score": 0.73, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1115, + 340, + 1137, + 340, + 1137, + 366, + 1115, + 366 + ], + "score": 0.71, + "latex": "L" + }, + { + "category_id": 13, + "poly": [ + 310, + 869, + 374, + 869, + 374, + 888, + 310, + 888 + ], + "score": 0.67, + "latex": "( \\% 2 = = 0 )" + }, + { + "category_id": 13, + "poly": [ + 741, + 234, + 769, + 234, + 769, + 258, + 741, + 258 + ], + "score": 0.6, + "latex": "" + }, + { + "category_id": 13, + "poly": [ + 745, + 402, + 759, + 402, + 759, + 427, + 745, + 427 + ], + "score": 0.58, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 385, + 340, + 567, + 340, + 567, + 368, + 385, + 368 + ], + "score": 0.54, + "latex": "\\mathrm { I N T } { } \\mathrm { I N T } { } \\mathrm { I N T }" + }, + { + "category_id": 13, + "poly": [ + 812, + 234, + 840, + 234, + 840, + 259, + 812, + 259 + ], + "score": 0.47, + "latex": "" + }, + { + "category_id": 13, + "poly": [ + 429, + 342, + 457, + 342, + 457, + 366, + 429, + 366 + ], + "score": 0.47, + "latex": "" + }, + { + "category_id": 13, + "poly": [ + 995, + 232, + 1164, + 232, + 1164, + 262, + 995, + 262 + ], + "score": 0.44, + "latex": "( + ) , ( - ) , ( \\star )" + }, + { + "category_id": 13, + "poly": [ + 696, + 232, + 879, + 232, + 879, + 260, + 696, + 260 + ], + "score": 0.41, + "latex": "\\mathrm { I N T } { } \\mathrm { I N T } { } \\mathrm { I N T }" + }, + { + "category_id": 13, + "poly": [ + 1064, + 372, + 1086, + 372, + 1086, + 397, + 1064, + 397 + ], + "score": 0.4, + "latex": "\\mathrm { b }" + }, + { + "category_id": 13, + "poly": [ + 1121, + 233, + 1164, + 233, + 1164, + 261, + 1121, + 261 + ], + "score": 0.33, + "latex": "( \\star )" + }, + { + "category_id": 13, + "poly": [ + 895, + 406, + 914, + 406, + 914, + 427, + 895, + 427 + ], + "score": 0.31, + "latex": "\\exists" + }, + { + "category_id": 13, + "poly": [ + 498, + 341, + 527, + 341, + 527, + 367, + 498, + 367 + ], + "score": 0.26, + "latex": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1582.0, + 1155.0, + 1582.0, + 1155.0, + 1615.0, + 295.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 1582.0, + 1403.0, + 1582.0, + 1403.0, + 1615.0, + 1261.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1609.0, + 371.0, + 1609.0, + 371.0, + 1653.0, + 293.0, + 1653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1609.0, + 1404.0, + 1609.0, + 1404.0, + 1653.0, + 448.0, + 1653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1641.0, + 1406.0, + 1641.0, + 1406.0, + 1683.0, + 293.0, + 1683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1674.0, + 1406.0, + 1674.0, + 1406.0, + 1711.0, + 294.0, + 1711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1703.0, + 908.0, + 1703.0, + 908.0, + 1743.0, + 294.0, + 1743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 855.0, + 1087.0, + 916.0, + 1087.0, + 916.0, + 1106.0, + 855.0, + 1106.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 1087.0, + 1064.0, + 1087.0, + 1064.0, + 1106.0, + 975.0, + 1106.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1084.0, + 1392.0, + 1084.0, + 1392.0, + 1106.0, + 1065.0, + 1106.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 1107.0, + 379.0, + 1107.0, + 379.0, + 1128.0, + 314.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 1102.0, + 946.0, + 1102.0, + 946.0, + 1138.0, + 380.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 1102.0, + 1392.0, + 1102.0, + 1392.0, + 1136.0, + 975.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1136.0, + 379.0, + 1136.0, + 379.0, + 1161.0, + 317.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 1133.0, + 497.0, + 1133.0, + 497.0, + 1166.0, + 380.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 1130.0, + 796.0, + 1130.0, + 796.0, + 1167.0, + 498.0, + 1167.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 1133.0, + 826.0, + 1133.0, + 826.0, + 1166.0, + 798.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 1133.0, + 854.0, + 1133.0, + 854.0, + 1166.0, + 828.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 1133.0, + 884.0, + 1133.0, + 884.0, + 1164.0, + 858.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 1132.0, + 916.0, + 1132.0, + 916.0, + 1164.0, + 886.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.0, + 1133.0, + 944.0, + 1133.0, + 944.0, + 1166.0, + 918.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 1134.0, + 975.0, + 1134.0, + 975.0, + 1164.0, + 946.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1004.0, + 1132.0, + 1183.0, + 1132.0, + 1183.0, + 1164.0, + 1004.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1184.0, + 1134.0, + 1392.0, + 1134.0, + 1392.0, + 1166.0, + 1184.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 1166.0, + 380.0, + 1166.0, + 380.0, + 1191.0, + 331.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 1163.0, + 408.0, + 1163.0, + 408.0, + 1194.0, + 382.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 410.0, + 1163.0, + 438.0, + 1163.0, + 438.0, + 1194.0, + 410.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 1164.0, + 467.0, + 1164.0, + 467.0, + 1194.0, + 439.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1164.0, + 495.0, + 1164.0, + 495.0, + 1194.0, + 469.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1164.0, + 526.0, + 1164.0, + 526.0, + 1194.0, + 499.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 1164.0, + 557.0, + 1164.0, + 557.0, + 1194.0, + 530.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1164.0, + 586.0, + 1164.0, + 586.0, + 1194.0, + 559.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 1163.0, + 617.0, + 1163.0, + 617.0, + 1194.0, + 590.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 620.0, + 1164.0, + 646.0, + 1164.0, + 646.0, + 1194.0, + 620.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 649.0, + 1164.0, + 677.0, + 1164.0, + 677.0, + 1194.0, + 649.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 1164.0, + 706.0, + 1164.0, + 706.0, + 1194.0, + 678.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 709.0, + 1164.0, + 735.0, + 1164.0, + 735.0, + 1194.0, + 709.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 1163.0, + 765.0, + 1163.0, + 765.0, + 1196.0, + 739.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 1164.0, + 793.0, + 1164.0, + 793.0, + 1196.0, + 769.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 800.0, + 1163.0, + 826.0, + 1163.0, + 826.0, + 1196.0, + 800.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 1163.0, + 854.0, + 1163.0, + 854.0, + 1196.0, + 828.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 857.0, + 1162.0, + 886.0, + 1162.0, + 886.0, + 1194.0, + 857.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 1176.0, + 914.0, + 1176.0, + 914.0, + 1194.0, + 888.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.0, + 1163.0, + 944.0, + 1163.0, + 944.0, + 1194.0, + 918.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 947.0, + 1164.0, + 973.0, + 1164.0, + 973.0, + 1194.0, + 947.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 1162.0, + 1006.0, + 1162.0, + 1006.0, + 1197.0, + 975.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1034.0, + 1162.0, + 1065.0, + 1162.0, + 1065.0, + 1194.0, + 1034.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 1164.0, + 1094.0, + 1164.0, + 1094.0, + 1196.0, + 1067.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1096.0, + 1164.0, + 1124.0, + 1164.0, + 1124.0, + 1194.0, + 1096.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 1164.0, + 1153.0, + 1164.0, + 1153.0, + 1194.0, + 1126.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 1164.0, + 1183.0, + 1164.0, + 1183.0, + 1194.0, + 1156.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1164.0, + 1213.0, + 1164.0, + 1213.0, + 1194.0, + 1187.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 1164.0, + 1243.0, + 1164.0, + 1243.0, + 1194.0, + 1216.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1245.0, + 1164.0, + 1271.0, + 1164.0, + 1271.0, + 1194.0, + 1245.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 1164.0, + 1302.0, + 1164.0, + 1302.0, + 1194.0, + 1275.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 1164.0, + 1332.0, + 1164.0, + 1332.0, + 1194.0, + 1305.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1335.0, + 1164.0, + 1361.0, + 1164.0, + 1361.0, + 1194.0, + 1335.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1366.0, + 1164.0, + 1392.0, + 1164.0, + 1392.0, + 1194.0, + 1366.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1197.0, + 379.0, + 1197.0, + 379.0, + 1218.0, + 309.0, + 1218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 1193.0, + 436.0, + 1193.0, + 436.0, + 1224.0, + 381.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 1193.0, + 467.0, + 1193.0, + 467.0, + 1224.0, + 439.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1193.0, + 497.0, + 1193.0, + 497.0, + 1224.0, + 469.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1193.0, + 526.0, + 1193.0, + 526.0, + 1224.0, + 499.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 1193.0, + 556.0, + 1193.0, + 556.0, + 1224.0, + 529.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1193.0, + 587.0, + 1193.0, + 587.0, + 1224.0, + 559.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 1192.0, + 616.0, + 1192.0, + 616.0, + 1224.0, + 590.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 620.0, + 1193.0, + 646.0, + 1193.0, + 646.0, + 1224.0, + 620.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 1193.0, + 675.0, + 1193.0, + 675.0, + 1224.0, + 648.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 677.0, + 1191.0, + 706.0, + 1191.0, + 706.0, + 1224.0, + 677.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 709.0, + 1192.0, + 735.0, + 1192.0, + 735.0, + 1224.0, + 709.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 1193.0, + 766.0, + 1193.0, + 766.0, + 1225.0, + 739.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 767.0, + 1191.0, + 796.0, + 1191.0, + 796.0, + 1224.0, + 767.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 800.0, + 1191.0, + 885.0, + 1191.0, + 885.0, + 1225.0, + 800.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 1192.0, + 914.0, + 1192.0, + 914.0, + 1224.0, + 888.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 916.0, + 1191.0, + 945.0, + 1191.0, + 945.0, + 1224.0, + 916.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 1192.0, + 1035.0, + 1192.0, + 1035.0, + 1225.0, + 946.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1191.0, + 1095.0, + 1191.0, + 1095.0, + 1224.0, + 1065.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1096.0, + 1193.0, + 1122.0, + 1193.0, + 1122.0, + 1224.0, + 1096.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 1192.0, + 1155.0, + 1192.0, + 1155.0, + 1224.0, + 1125.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 1193.0, + 1182.0, + 1193.0, + 1182.0, + 1225.0, + 1156.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1186.0, + 1192.0, + 1212.0, + 1192.0, + 1212.0, + 1224.0, + 1186.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1194.0, + 1242.0, + 1194.0, + 1242.0, + 1224.0, + 1217.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1245.0, + 1194.0, + 1273.0, + 1194.0, + 1273.0, + 1224.0, + 1245.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1274.0, + 1193.0, + 1302.0, + 1193.0, + 1302.0, + 1224.0, + 1274.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1304.0, + 1193.0, + 1332.0, + 1193.0, + 1332.0, + 1224.0, + 1304.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 1191.0, + 1363.0, + 1191.0, + 1363.0, + 1224.0, + 1333.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1366.0, + 1193.0, + 1391.0, + 1193.0, + 1391.0, + 1224.0, + 1366.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 338.0, + 1224.0, + 380.0, + 1224.0, + 380.0, + 1250.0, + 338.0, + 1250.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 1219.0, + 466.0, + 1219.0, + 466.0, + 1254.0, + 381.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1223.0, + 495.0, + 1223.0, + 495.0, + 1254.0, + 469.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1223.0, + 526.0, + 1223.0, + 526.0, + 1254.0, + 499.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 528.0, + 1220.0, + 587.0, + 1220.0, + 587.0, + 1254.0, + 528.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 1222.0, + 616.0, + 1222.0, + 616.0, + 1254.0, + 590.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 617.0, + 1220.0, + 677.0, + 1220.0, + 677.0, + 1254.0, + 617.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 1223.0, + 706.0, + 1223.0, + 706.0, + 1254.0, + 678.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 1219.0, + 766.0, + 1219.0, + 766.0, + 1254.0, + 708.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 1220.0, + 857.0, + 1220.0, + 857.0, + 1257.0, + 798.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 1223.0, + 885.0, + 1223.0, + 885.0, + 1254.0, + 858.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 1220.0, + 944.0, + 1220.0, + 944.0, + 1254.0, + 886.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 1220.0, + 975.0, + 1220.0, + 975.0, + 1254.0, + 946.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 976.0, + 1220.0, + 1068.0, + 1220.0, + 1068.0, + 1257.0, + 976.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1096.0, + 1220.0, + 1125.0, + 1220.0, + 1125.0, + 1254.0, + 1096.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 1222.0, + 1152.0, + 1222.0, + 1152.0, + 1254.0, + 1126.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1154.0, + 1223.0, + 1184.0, + 1223.0, + 1184.0, + 1257.0, + 1154.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1222.0, + 1212.0, + 1222.0, + 1212.0, + 1254.0, + 1187.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 1223.0, + 1242.0, + 1223.0, + 1242.0, + 1254.0, + 1216.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1244.0, + 1220.0, + 1274.0, + 1220.0, + 1274.0, + 1254.0, + 1244.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 1223.0, + 1302.0, + 1223.0, + 1302.0, + 1254.0, + 1276.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 1223.0, + 1332.0, + 1223.0, + 1332.0, + 1254.0, + 1306.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1335.0, + 1222.0, + 1362.0, + 1222.0, + 1362.0, + 1254.0, + 1335.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1366.0, + 1223.0, + 1391.0, + 1223.0, + 1391.0, + 1254.0, + 1366.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 1254.0, + 379.0, + 1254.0, + 379.0, + 1280.0, + 335.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 1250.0, + 437.0, + 1250.0, + 437.0, + 1284.0, + 380.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 438.0, + 1250.0, + 587.0, + 1250.0, + 587.0, + 1284.0, + 438.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 1252.0, + 616.0, + 1252.0, + 616.0, + 1284.0, + 590.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 1249.0, + 766.0, + 1249.0, + 766.0, + 1284.0, + 618.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 1250.0, + 857.0, + 1250.0, + 857.0, + 1287.0, + 796.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 1250.0, + 915.0, + 1250.0, + 915.0, + 1284.0, + 858.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 916.0, + 1250.0, + 1006.0, + 1250.0, + 1006.0, + 1285.0, + 916.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 1250.0, + 1065.0, + 1250.0, + 1065.0, + 1284.0, + 1007.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 1253.0, + 1093.0, + 1253.0, + 1093.0, + 1284.0, + 1067.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 1250.0, + 1184.0, + 1250.0, + 1184.0, + 1284.0, + 1125.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1252.0, + 1212.0, + 1252.0, + 1212.0, + 1284.0, + 1187.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.0, + 1250.0, + 1274.0, + 1250.0, + 1274.0, + 1284.0, + 1214.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 1250.0, + 1332.0, + 1250.0, + 1332.0, + 1284.0, + 1275.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 1250.0, + 1363.0, + 1250.0, + 1363.0, + 1284.0, + 1333.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1366.0, + 1253.0, + 1391.0, + 1253.0, + 1391.0, + 1284.0, + 1366.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 338.0, + 1278.0, + 437.0, + 1278.0, + 437.0, + 1318.0, + 338.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 438.0, + 1280.0, + 468.0, + 1280.0, + 468.0, + 1314.0, + 438.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1283.0, + 497.0, + 1283.0, + 497.0, + 1314.0, + 469.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1283.0, + 526.0, + 1283.0, + 526.0, + 1314.0, + 499.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 528.0, + 1280.0, + 557.0, + 1280.0, + 557.0, + 1314.0, + 528.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1283.0, + 587.0, + 1283.0, + 587.0, + 1313.0, + 559.0, + 1313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 1282.0, + 615.0, + 1282.0, + 615.0, + 1314.0, + 590.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 1283.0, + 646.0, + 1283.0, + 646.0, + 1314.0, + 618.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 649.0, + 1283.0, + 675.0, + 1283.0, + 675.0, + 1314.0, + 649.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 1283.0, + 706.0, + 1283.0, + 706.0, + 1314.0, + 678.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 1279.0, + 735.0, + 1279.0, + 735.0, + 1314.0, + 708.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 1280.0, + 766.0, + 1280.0, + 766.0, + 1314.0, + 736.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 1280.0, + 886.0, + 1280.0, + 886.0, + 1314.0, + 797.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 1282.0, + 914.0, + 1282.0, + 914.0, + 1314.0, + 888.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 1280.0, + 945.0, + 1280.0, + 945.0, + 1314.0, + 915.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 1280.0, + 1034.0, + 1280.0, + 1034.0, + 1314.0, + 946.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 1282.0, + 1063.0, + 1282.0, + 1063.0, + 1314.0, + 1037.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 1282.0, + 1093.0, + 1282.0, + 1093.0, + 1314.0, + 1067.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 1283.0, + 1122.0, + 1283.0, + 1122.0, + 1314.0, + 1094.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 1279.0, + 1213.0, + 1279.0, + 1213.0, + 1318.0, + 1152.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 1282.0, + 1242.0, + 1282.0, + 1242.0, + 1314.0, + 1216.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1244.0, + 1283.0, + 1273.0, + 1283.0, + 1273.0, + 1314.0, + 1244.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 1283.0, + 1302.0, + 1283.0, + 1302.0, + 1314.0, + 1275.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 1283.0, + 1332.0, + 1283.0, + 1332.0, + 1314.0, + 1305.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1335.0, + 1282.0, + 1362.0, + 1282.0, + 1362.0, + 1314.0, + 1335.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1365.0, + 1283.0, + 1391.0, + 1283.0, + 1391.0, + 1314.0, + 1365.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 345.0, + 1315.0, + 380.0, + 1315.0, + 380.0, + 1339.0, + 345.0, + 1339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 1311.0, + 407.0, + 1311.0, + 407.0, + 1344.0, + 381.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 410.0, + 1311.0, + 436.0, + 1311.0, + 436.0, + 1344.0, + 410.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 1311.0, + 466.0, + 1311.0, + 466.0, + 1343.0, + 439.0, + 1343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1311.0, + 495.0, + 1311.0, + 495.0, + 1343.0, + 469.0, + 1343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 1310.0, + 557.0, + 1310.0, + 557.0, + 1344.0, + 498.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1313.0, + 586.0, + 1313.0, + 586.0, + 1343.0, + 559.0, + 1343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 587.0, + 1310.0, + 617.0, + 1310.0, + 617.0, + 1344.0, + 587.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 1307.0, + 735.0, + 1307.0, + 735.0, + 1344.0, + 618.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 1310.0, + 766.0, + 1310.0, + 766.0, + 1344.0, + 736.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 1310.0, + 855.0, + 1310.0, + 855.0, + 1344.0, + 797.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 857.0, + 1310.0, + 886.0, + 1310.0, + 886.0, + 1344.0, + 857.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 1311.0, + 914.0, + 1311.0, + 914.0, + 1344.0, + 888.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 1310.0, + 1065.0, + 1310.0, + 1065.0, + 1344.0, + 915.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 1311.0, + 1093.0, + 1311.0, + 1093.0, + 1344.0, + 1067.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 1310.0, + 1124.0, + 1310.0, + 1124.0, + 1344.0, + 1094.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 1313.0, + 1156.0, + 1313.0, + 1156.0, + 1344.0, + 1125.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1184.0, + 1310.0, + 1214.0, + 1310.0, + 1214.0, + 1344.0, + 1184.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 1311.0, + 1242.0, + 1311.0, + 1242.0, + 1344.0, + 1216.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1243.0, + 1310.0, + 1273.0, + 1310.0, + 1273.0, + 1344.0, + 1243.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1274.0, + 1307.0, + 1364.0, + 1307.0, + 1364.0, + 1344.0, + 1274.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1365.0, + 1311.0, + 1391.0, + 1311.0, + 1391.0, + 1344.0, + 1365.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 344.0, + 1345.0, + 379.0, + 1345.0, + 379.0, + 1369.0, + 344.0, + 1369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 1341.0, + 407.0, + 1341.0, + 407.0, + 1374.0, + 381.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 409.0, + 1337.0, + 498.0, + 1337.0, + 498.0, + 1374.0, + 409.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1337.0, + 528.0, + 1337.0, + 528.0, + 1373.0, + 499.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 1343.0, + 556.0, + 1343.0, + 556.0, + 1374.0, + 529.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1343.0, + 586.0, + 1343.0, + 586.0, + 1374.0, + 559.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 1337.0, + 766.0, + 1337.0, + 766.0, + 1374.0, + 588.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 1340.0, + 854.0, + 1340.0, + 854.0, + 1374.0, + 797.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 857.0, + 1340.0, + 886.0, + 1340.0, + 886.0, + 1374.0, + 857.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 1341.0, + 914.0, + 1341.0, + 914.0, + 1374.0, + 888.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 1340.0, + 945.0, + 1340.0, + 945.0, + 1374.0, + 915.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 949.0, + 1341.0, + 975.0, + 1341.0, + 975.0, + 1374.0, + 949.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 976.0, + 1340.0, + 1033.0, + 1340.0, + 1033.0, + 1374.0, + 976.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 1341.0, + 1063.0, + 1341.0, + 1063.0, + 1374.0, + 1037.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 1341.0, + 1093.0, + 1341.0, + 1093.0, + 1374.0, + 1067.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 1340.0, + 1153.0, + 1340.0, + 1153.0, + 1374.0, + 1094.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 1343.0, + 1183.0, + 1343.0, + 1183.0, + 1374.0, + 1155.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 1341.0, + 1242.0, + 1341.0, + 1242.0, + 1374.0, + 1216.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1245.0, + 1340.0, + 1304.0, + 1340.0, + 1304.0, + 1374.0, + 1245.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 1340.0, + 1363.0, + 1340.0, + 1363.0, + 1374.0, + 1305.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1365.0, + 1341.0, + 1391.0, + 1341.0, + 1391.0, + 1374.0, + 1365.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 344.0, + 1375.0, + 379.0, + 1375.0, + 379.0, + 1399.0, + 344.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 1371.0, + 407.0, + 1371.0, + 407.0, + 1404.0, + 382.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 410.0, + 1371.0, + 437.0, + 1371.0, + 437.0, + 1403.0, + 410.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 1371.0, + 467.0, + 1371.0, + 467.0, + 1403.0, + 439.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1371.0, + 497.0, + 1371.0, + 497.0, + 1403.0, + 469.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 1370.0, + 528.0, + 1370.0, + 528.0, + 1403.0, + 498.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 1371.0, + 556.0, + 1371.0, + 556.0, + 1403.0, + 529.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1371.0, + 586.0, + 1371.0, + 586.0, + 1403.0, + 559.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 1371.0, + 616.0, + 1371.0, + 616.0, + 1403.0, + 588.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 617.0, + 1370.0, + 766.0, + 1370.0, + 766.0, + 1403.0, + 617.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 1370.0, + 855.0, + 1370.0, + 855.0, + 1404.0, + 797.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 857.0, + 1370.0, + 914.0, + 1370.0, + 914.0, + 1404.0, + 857.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 1370.0, + 946.0, + 1370.0, + 946.0, + 1404.0, + 915.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 947.0, + 1371.0, + 973.0, + 1371.0, + 973.0, + 1404.0, + 947.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 976.0, + 1370.0, + 1034.0, + 1370.0, + 1034.0, + 1404.0, + 976.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 1367.0, + 1065.0, + 1367.0, + 1065.0, + 1404.0, + 1037.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 1371.0, + 1093.0, + 1371.0, + 1093.0, + 1404.0, + 1067.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1095.0, + 1367.0, + 1153.0, + 1367.0, + 1153.0, + 1404.0, + 1095.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 1371.0, + 1182.0, + 1371.0, + 1182.0, + 1404.0, + 1156.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1184.0, + 1373.0, + 1213.0, + 1373.0, + 1213.0, + 1404.0, + 1184.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1244.0, + 1370.0, + 1333.0, + 1370.0, + 1333.0, + 1404.0, + 1244.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 1367.0, + 1364.0, + 1367.0, + 1364.0, + 1404.0, + 1334.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1365.0, + 1371.0, + 1391.0, + 1371.0, + 1391.0, + 1404.0, + 1365.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 343.0, + 1401.0, + 407.0, + 1401.0, + 407.0, + 1430.0, + 343.0, + 1430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 410.0, + 1401.0, + 437.0, + 1401.0, + 437.0, + 1420.0, + 410.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 1401.0, + 467.0, + 1401.0, + 467.0, + 1420.0, + 439.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1401.0, + 497.0, + 1401.0, + 497.0, + 1420.0, + 469.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1401.0, + 526.0, + 1401.0, + 526.0, + 1420.0, + 499.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 1401.0, + 556.0, + 1401.0, + 556.0, + 1420.0, + 529.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1403.0, + 586.0, + 1403.0, + 586.0, + 1420.0, + 559.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 1401.0, + 616.0, + 1401.0, + 616.0, + 1420.0, + 588.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 1401.0, + 646.0, + 1401.0, + 646.0, + 1420.0, + 618.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 1401.0, + 675.0, + 1401.0, + 675.0, + 1420.0, + 648.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 1401.0, + 705.0, + 1401.0, + 705.0, + 1420.0, + 678.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 1400.0, + 766.0, + 1400.0, + 766.0, + 1422.0, + 708.0, + 1422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 1400.0, + 855.0, + 1400.0, + 855.0, + 1422.0, + 797.0, + 1422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 1401.0, + 884.0, + 1401.0, + 884.0, + 1420.0, + 858.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 1401.0, + 915.0, + 1401.0, + 915.0, + 1420.0, + 886.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.0, + 1401.0, + 944.0, + 1401.0, + 944.0, + 1421.0, + 918.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 1397.0, + 1034.0, + 1397.0, + 1034.0, + 1423.0, + 946.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1035.0, + 1401.0, + 1063.0, + 1401.0, + 1063.0, + 1420.0, + 1035.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 1401.0, + 1093.0, + 1401.0, + 1093.0, + 1421.0, + 1067.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 1400.0, + 1124.0, + 1400.0, + 1124.0, + 1422.0, + 1094.0, + 1422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 1401.0, + 1153.0, + 1401.0, + 1153.0, + 1420.0, + 1125.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 1401.0, + 1183.0, + 1401.0, + 1183.0, + 1420.0, + 1155.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1186.0, + 1403.0, + 1243.0, + 1403.0, + 1243.0, + 1421.0, + 1186.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1273.0, + 1400.0, + 1332.0, + 1400.0, + 1332.0, + 1422.0, + 1273.0, + 1422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 1401.0, + 1362.0, + 1401.0, + 1362.0, + 1420.0, + 1333.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1365.0, + 1401.0, + 1391.0, + 1401.0, + 1391.0, + 1420.0, + 1365.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 1414.0, + 407.0, + 1414.0, + 407.0, + 1432.0, + 382.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 410.0, + 1415.0, + 436.0, + 1415.0, + 436.0, + 1432.0, + 410.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 1415.0, + 467.0, + 1415.0, + 467.0, + 1432.0, + 439.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1415.0, + 495.0, + 1415.0, + 495.0, + 1432.0, + 469.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1415.0, + 526.0, + 1415.0, + 526.0, + 1432.0, + 499.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 1415.0, + 556.0, + 1415.0, + 556.0, + 1432.0, + 530.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1415.0, + 585.0, + 1415.0, + 585.0, + 1432.0, + 559.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 1415.0, + 615.0, + 1415.0, + 615.0, + 1432.0, + 588.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 1415.0, + 644.0, + 1415.0, + 644.0, + 1434.0, + 618.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 1415.0, + 674.0, + 1415.0, + 674.0, + 1432.0, + 648.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 1415.0, + 705.0, + 1415.0, + 705.0, + 1432.0, + 679.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 709.0, + 1415.0, + 735.0, + 1415.0, + 735.0, + 1434.0, + 709.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 737.0, + 1415.0, + 764.0, + 1415.0, + 764.0, + 1432.0, + 737.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 1415.0, + 824.0, + 1415.0, + 824.0, + 1432.0, + 798.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 1415.0, + 854.0, + 1415.0, + 854.0, + 1434.0, + 828.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 855.0, + 1412.0, + 885.0, + 1412.0, + 885.0, + 1435.0, + 855.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 1415.0, + 914.0, + 1415.0, + 914.0, + 1434.0, + 886.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.0, + 1415.0, + 944.0, + 1415.0, + 944.0, + 1434.0, + 918.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 949.0, + 1415.0, + 972.0, + 1415.0, + 972.0, + 1434.0, + 949.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 977.0, + 1415.0, + 1003.0, + 1415.0, + 1003.0, + 1434.0, + 977.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 1415.0, + 1032.0, + 1415.0, + 1032.0, + 1434.0, + 1007.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 1415.0, + 1063.0, + 1415.0, + 1063.0, + 1434.0, + 1037.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1415.0, + 1091.0, + 1415.0, + 1091.0, + 1434.0, + 1065.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1096.0, + 1415.0, + 1122.0, + 1415.0, + 1122.0, + 1434.0, + 1096.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 1415.0, + 1151.0, + 1415.0, + 1151.0, + 1434.0, + 1126.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 1415.0, + 1182.0, + 1415.0, + 1182.0, + 1432.0, + 1156.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1186.0, + 1415.0, + 1211.0, + 1415.0, + 1211.0, + 1434.0, + 1186.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.0, + 1415.0, + 1243.0, + 1415.0, + 1243.0, + 1434.0, + 1214.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 1415.0, + 1302.0, + 1415.0, + 1302.0, + 1434.0, + 1275.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1304.0, + 1415.0, + 1331.0, + 1415.0, + 1331.0, + 1432.0, + 1304.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1335.0, + 1415.0, + 1361.0, + 1415.0, + 1361.0, + 1434.0, + 1335.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1365.0, + 1415.0, + 1391.0, + 1415.0, + 1391.0, + 1434.0, + 1365.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 1435.0, + 379.0, + 1435.0, + 379.0, + 1459.0, + 346.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 1430.0, + 437.0, + 1430.0, + 437.0, + 1462.0, + 380.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 438.0, + 1431.0, + 467.0, + 1431.0, + 467.0, + 1462.0, + 438.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1431.0, + 497.0, + 1431.0, + 497.0, + 1462.0, + 469.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1431.0, + 526.0, + 1431.0, + 526.0, + 1462.0, + 499.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 528.0, + 1431.0, + 556.0, + 1431.0, + 556.0, + 1462.0, + 528.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1431.0, + 586.0, + 1431.0, + 586.0, + 1462.0, + 559.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 1431.0, + 617.0, + 1431.0, + 617.0, + 1462.0, + 588.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 1431.0, + 646.0, + 1431.0, + 646.0, + 1462.0, + 618.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 1431.0, + 675.0, + 1431.0, + 675.0, + 1462.0, + 648.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 1431.0, + 735.0, + 1431.0, + 735.0, + 1462.0, + 678.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 737.0, + 1427.0, + 767.0, + 1427.0, + 767.0, + 1462.0, + 737.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 1430.0, + 914.0, + 1430.0, + 914.0, + 1465.0, + 796.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 916.0, + 1430.0, + 1004.0, + 1430.0, + 1004.0, + 1462.0, + 916.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 1430.0, + 1064.0, + 1430.0, + 1064.0, + 1464.0, + 1007.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1431.0, + 1094.0, + 1431.0, + 1094.0, + 1464.0, + 1065.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1095.0, + 1431.0, + 1122.0, + 1431.0, + 1122.0, + 1464.0, + 1095.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 1431.0, + 1153.0, + 1431.0, + 1153.0, + 1464.0, + 1125.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 1431.0, + 1183.0, + 1431.0, + 1183.0, + 1464.0, + 1155.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1186.0, + 1431.0, + 1212.0, + 1431.0, + 1212.0, + 1464.0, + 1186.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1213.0, + 1430.0, + 1271.0, + 1430.0, + 1271.0, + 1464.0, + 1213.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1304.0, + 1432.0, + 1332.0, + 1432.0, + 1332.0, + 1462.0, + 1304.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1335.0, + 1431.0, + 1362.0, + 1431.0, + 1362.0, + 1464.0, + 1335.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1365.0, + 1431.0, + 1391.0, + 1431.0, + 1391.0, + 1462.0, + 1365.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 1465.0, + 379.0, + 1465.0, + 379.0, + 1489.0, + 346.0, + 1489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 1461.0, + 407.0, + 1461.0, + 407.0, + 1492.0, + 381.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 410.0, + 1461.0, + 436.0, + 1461.0, + 436.0, + 1492.0, + 410.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 1461.0, + 467.0, + 1461.0, + 467.0, + 1492.0, + 439.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1461.0, + 497.0, + 1461.0, + 497.0, + 1492.0, + 469.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1462.0, + 526.0, + 1462.0, + 526.0, + 1492.0, + 499.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 1461.0, + 556.0, + 1461.0, + 556.0, + 1492.0, + 529.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1461.0, + 586.0, + 1461.0, + 586.0, + 1492.0, + 559.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 1462.0, + 616.0, + 1462.0, + 616.0, + 1492.0, + 588.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 1460.0, + 677.0, + 1460.0, + 677.0, + 1492.0, + 618.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 1461.0, + 705.0, + 1461.0, + 705.0, + 1492.0, + 678.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 1462.0, + 736.0, + 1462.0, + 736.0, + 1492.0, + 708.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 737.0, + 1458.0, + 766.0, + 1458.0, + 766.0, + 1492.0, + 737.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 1461.0, + 826.0, + 1461.0, + 826.0, + 1492.0, + 797.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 1461.0, + 854.0, + 1461.0, + 854.0, + 1494.0, + 828.0, + 1494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 857.0, + 1461.0, + 884.0, + 1461.0, + 884.0, + 1492.0, + 857.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 1461.0, + 915.0, + 1461.0, + 915.0, + 1492.0, + 888.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 916.0, + 1462.0, + 945.0, + 1462.0, + 945.0, + 1492.0, + 916.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 1460.0, + 1004.0, + 1460.0, + 1004.0, + 1492.0, + 946.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 1461.0, + 1033.0, + 1461.0, + 1033.0, + 1492.0, + 1007.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 1461.0, + 1063.0, + 1461.0, + 1063.0, + 1492.0, + 1037.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1461.0, + 1094.0, + 1461.0, + 1094.0, + 1492.0, + 1065.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1096.0, + 1462.0, + 1122.0, + 1462.0, + 1122.0, + 1492.0, + 1096.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 1461.0, + 1153.0, + 1461.0, + 1153.0, + 1492.0, + 1126.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 1461.0, + 1183.0, + 1461.0, + 1183.0, + 1494.0, + 1155.0, + 1494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1186.0, + 1461.0, + 1212.0, + 1461.0, + 1212.0, + 1492.0, + 1186.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.0, + 1462.0, + 1242.0, + 1462.0, + 1242.0, + 1492.0, + 1214.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1244.0, + 1462.0, + 1271.0, + 1462.0, + 1271.0, + 1492.0, + 1244.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1273.0, + 1461.0, + 1302.0, + 1461.0, + 1302.0, + 1495.0, + 1273.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 1460.0, + 1392.0, + 1460.0, + 1392.0, + 1495.0, + 1333.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 345.0, + 1489.0, + 467.0, + 1489.0, + 467.0, + 1522.0, + 345.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1491.0, + 497.0, + 1491.0, + 497.0, + 1522.0, + 469.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1491.0, + 526.0, + 1491.0, + 526.0, + 1522.0, + 499.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 1491.0, + 556.0, + 1491.0, + 556.0, + 1522.0, + 529.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1491.0, + 586.0, + 1491.0, + 586.0, + 1522.0, + 559.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 1491.0, + 617.0, + 1491.0, + 617.0, + 1522.0, + 588.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 1488.0, + 647.0, + 1488.0, + 647.0, + 1522.0, + 618.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 1491.0, + 677.0, + 1491.0, + 677.0, + 1522.0, + 648.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 1491.0, + 706.0, + 1491.0, + 706.0, + 1522.0, + 678.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 709.0, + 1491.0, + 736.0, + 1491.0, + 736.0, + 1522.0, + 709.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 737.0, + 1491.0, + 765.0, + 1491.0, + 765.0, + 1522.0, + 737.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 1491.0, + 826.0, + 1491.0, + 826.0, + 1522.0, + 798.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 1491.0, + 855.0, + 1491.0, + 855.0, + 1522.0, + 828.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 1491.0, + 885.0, + 1491.0, + 885.0, + 1522.0, + 858.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 1491.0, + 915.0, + 1491.0, + 915.0, + 1522.0, + 886.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 916.0, + 1491.0, + 944.0, + 1491.0, + 944.0, + 1522.0, + 916.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 947.0, + 1491.0, + 975.0, + 1491.0, + 975.0, + 1521.0, + 947.0, + 1521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 976.0, + 1491.0, + 1003.0, + 1491.0, + 1003.0, + 1522.0, + 976.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 1491.0, + 1034.0, + 1491.0, + 1034.0, + 1522.0, + 1007.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 1491.0, + 1063.0, + 1491.0, + 1063.0, + 1522.0, + 1037.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1491.0, + 1093.0, + 1491.0, + 1093.0, + 1522.0, + 1065.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1096.0, + 1491.0, + 1122.0, + 1491.0, + 1122.0, + 1522.0, + 1096.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 1491.0, + 1152.0, + 1491.0, + 1152.0, + 1523.0, + 1125.0, + 1523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 1491.0, + 1182.0, + 1491.0, + 1182.0, + 1522.0, + 1156.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1186.0, + 1491.0, + 1212.0, + 1491.0, + 1212.0, + 1522.0, + 1186.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.0, + 1491.0, + 1243.0, + 1491.0, + 1243.0, + 1522.0, + 1214.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1245.0, + 1491.0, + 1271.0, + 1491.0, + 1271.0, + 1522.0, + 1245.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1274.0, + 1490.0, + 1333.0, + 1490.0, + 1333.0, + 1523.0, + 1274.0, + 1523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1363.0, + 1490.0, + 1393.0, + 1490.0, + 1393.0, + 1522.0, + 1363.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 340.0, + 1523.0, + 380.0, + 1523.0, + 380.0, + 1546.0, + 340.0, + 1546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 1520.0, + 406.0, + 1520.0, + 406.0, + 1552.0, + 381.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 410.0, + 1521.0, + 436.0, + 1521.0, + 436.0, + 1551.0, + 410.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 1521.0, + 468.0, + 1521.0, + 468.0, + 1551.0, + 439.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 471.0, + 1521.0, + 498.0, + 1521.0, + 498.0, + 1551.0, + 471.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.0, + 1521.0, + 525.0, + 1521.0, + 525.0, + 1551.0, + 500.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 1521.0, + 557.0, + 1521.0, + 557.0, + 1551.0, + 529.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 560.0, + 1521.0, + 586.0, + 1521.0, + 586.0, + 1551.0, + 560.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 1521.0, + 617.0, + 1521.0, + 617.0, + 1552.0, + 588.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 620.0, + 1521.0, + 646.0, + 1521.0, + 646.0, + 1551.0, + 620.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 649.0, + 1521.0, + 675.0, + 1521.0, + 675.0, + 1551.0, + 649.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 1521.0, + 706.0, + 1521.0, + 706.0, + 1551.0, + 678.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 709.0, + 1521.0, + 736.0, + 1521.0, + 736.0, + 1551.0, + 709.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 1521.0, + 765.0, + 1521.0, + 765.0, + 1551.0, + 739.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 1521.0, + 796.0, + 1521.0, + 796.0, + 1552.0, + 769.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 1521.0, + 826.0, + 1521.0, + 826.0, + 1551.0, + 798.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 1521.0, + 854.0, + 1521.0, + 854.0, + 1552.0, + 828.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 1521.0, + 884.0, + 1521.0, + 884.0, + 1551.0, + 858.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 1521.0, + 915.0, + 1521.0, + 915.0, + 1551.0, + 886.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.0, + 1521.0, + 944.0, + 1521.0, + 944.0, + 1551.0, + 918.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 947.0, + 1521.0, + 1004.0, + 1521.0, + 1004.0, + 1552.0, + 947.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 1521.0, + 1033.0, + 1521.0, + 1033.0, + 1552.0, + 1007.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 1521.0, + 1063.0, + 1521.0, + 1063.0, + 1551.0, + 1037.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 1521.0, + 1093.0, + 1521.0, + 1093.0, + 1551.0, + 1067.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1096.0, + 1521.0, + 1122.0, + 1521.0, + 1122.0, + 1551.0, + 1096.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 1521.0, + 1152.0, + 1521.0, + 1152.0, + 1551.0, + 1126.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 1521.0, + 1183.0, + 1521.0, + 1183.0, + 1551.0, + 1156.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1186.0, + 1521.0, + 1213.0, + 1521.0, + 1213.0, + 1551.0, + 1186.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 1521.0, + 1243.0, + 1521.0, + 1243.0, + 1551.0, + 1216.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1245.0, + 1521.0, + 1301.0, + 1521.0, + 1301.0, + 1551.0, + 1245.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 1521.0, + 1332.0, + 1521.0, + 1332.0, + 1551.0, + 1305.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 1521.0, + 1362.0, + 1521.0, + 1362.0, + 1552.0, + 1333.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.25, + 1163.0, + 913.25, + 1163.0, + 913.25, + 1182.0, + 888.25, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1807.0, + 985.0, + 1807.0, + 985.0, + 1852.0, + 295.0, + 1852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1882.0, + 1404.0, + 1882.0, + 1404.0, + 1915.0, + 297.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1912.0, + 1404.0, + 1912.0, + 1404.0, + 1946.0, + 296.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1939.0, + 1405.0, + 1939.0, + 1405.0, + 1979.0, + 292.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1973.0, + 1404.0, + 1973.0, + 1404.0, + 2007.0, + 294.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2004.0, + 416.0, + 2004.0, + 416.0, + 2037.0, + 296.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 476.0, + 2004.0, + 1065.0, + 2004.0, + 1065.0, + 2037.0, + 476.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1082.0, + 2004.0, + 1404.0, + 2004.0, + 1404.0, + 2037.0, + 1082.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 308.0, + 1405.0, + 308.0, + 1405.0, + 341.0, + 294.0, + 341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 338.0, + 384.0, + 338.0, + 384.0, + 373.0, + 293.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 338.0, + 1114.0, + 338.0, + 1114.0, + 373.0, + 568.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1138.0, + 338.0, + 1405.0, + 338.0, + 1405.0, + 373.0, + 1138.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 369.0, + 1063.0, + 369.0, + 1063.0, + 405.0, + 293.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1087.0, + 369.0, + 1300.0, + 369.0, + 1300.0, + 405.0, + 1087.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1324.0, + 369.0, + 1405.0, + 369.0, + 1405.0, + 405.0, + 1324.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 399.0, + 296.0, + 399.0, + 296.0, + 432.0, + 293.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 399.0, + 744.0, + 399.0, + 744.0, + 432.0, + 311.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 760.0, + 399.0, + 894.0, + 399.0, + 894.0, + 432.0, + 760.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 399.0, + 927.0, + 399.0, + 927.0, + 432.0, + 915.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 226.0, + 695.0, + 226.0, + 695.0, + 267.0, + 293.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 226.0, + 994.0, + 226.0, + 994.0, + 267.0, + 880.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1165.0, + 226.0, + 1406.0, + 226.0, + 1406.0, + 267.0, + 1165.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 258.0, + 941.0, + 258.0, + 941.0, + 298.0, + 294.0, + 298.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 18, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 307, + 1404, + 307, + 1404, + 461, + 299, + 461 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 368, + 486, + 1405, + 486, + 1405, + 767, + 368, + 767 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 294, + 229, + 1402, + 229, + 1402, + 294, + 294, + 294 + ], + "score": 0.951 + }, + { + "category_id": 3, + "poly": [ + 305, + 812, + 1392, + 812, + 1392, + 1904, + 305, + 1904 + ], + "score": 0.913 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.904 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 866, + 2088, + 866, + 2113, + 835, + 2113 + ], + "score": 0.862 + }, + { + "category_id": 1, + "poly": [ + 295, + 1933, + 1401, + 1933, + 1401, + 1997, + 295, + 1997 + ], + "score": 0.845 + }, + { + "category_id": 4, + "poly": [ + 295, + 1933, + 1401, + 1933, + 1401, + 1997, + 295, + 1997 + ], + "score": 0.126 + }, + { + "category_id": 13, + "poly": [ + 1157, + 1935, + 1261, + 1935, + 1261, + 1962, + 1157, + 1962 + ], + "score": 0.89, + "latex": "P = 5 0 0" + }, + { + "category_id": 13, + "poly": [ + 1151, + 309, + 1255, + 309, + 1255, + 338, + 1151, + 338 + ], + "score": 0.89, + "latex": "P = 5 0 0" + }, + { + "category_id": 13, + "poly": [ + 647, + 706, + 720, + 706, + 720, + 734, + 647, + 734 + ], + "score": 0.89, + "latex": "( \\star \\star 2 )" + }, + { + "category_id": 13, + "poly": [ + 373, + 1965, + 448, + 1965, + 448, + 1992, + 373, + 1992 + ], + "score": 0.89, + "latex": "T = 5" + }, + { + "category_id": 13, + "poly": [ + 577, + 664, + 698, + 664, + 698, + 694, + 577, + 694 + ], + "score": 0.84, + "latex": "( - ) ~ ; ~ ( + 1 )" + }, + { + "category_id": 13, + "poly": [ + 799, + 592, + 891, + 592, + 891, + 620, + 799, + 620 + ], + "score": 0.84, + "latex": "\\scriptstyle { \\frac { 0 } { \\circ } } 2 = = 0" + }, + { + "category_id": 13, + "poly": [ + 669, + 593, + 762, + 593, + 762, + 621, + 669, + 621 + ], + "score": 0.82, + "latex": "\\scriptstyle { \\frac { \\circ } { \\circ } } 2 = = 1" + }, + { + "category_id": 13, + "poly": [ + 1344, + 264, + 1361, + 264, + 1361, + 294, + 1344, + 294 + ], + "score": 0.81, + "latex": "j" + }, + { + "category_id": 13, + "poly": [ + 822, + 233, + 839, + 233, + 839, + 263, + 822, + 263 + ], + "score": 0.81, + "latex": "j" + }, + { + "category_id": 13, + "poly": [ + 315, + 1197, + 382, + 1197, + 382, + 1217, + 315, + 1217 + ], + "score": 0.81, + "latex": "( \\% 2 = 1" + }, + { + "category_id": 13, + "poly": [ + 488, + 665, + 529, + 665, + 529, + 693, + 488, + 693 + ], + "score": 0.77, + "latex": "( + )" + }, + { + "category_id": 13, + "poly": [ + 314, + 1226, + 385, + 1226, + 385, + 1247, + 314, + 1247 + ], + "score": 0.76, + "latex": "( \\% 2 = = 0 )" + }, + { + "category_id": 13, + "poly": [ + 581, + 593, + 639, + 593, + 639, + 622, + 581, + 622 + ], + "score": 0.75, + "latex": "( < 0 )" + }, + { + "category_id": 13, + "poly": [ + 502, + 592, + 556, + 592, + 556, + 621, + 502, + 621 + ], + "score": 0.75, + "latex": "( > 0 )" + }, + { + "category_id": 13, + "poly": [ + 1018, + 233, + 1031, + 233, + 1031, + 258, + 1018, + 258 + ], + "score": 0.7, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 747, + 664, + 883, + 664, + 883, + 695, + 747, + 695 + ], + "score": 0.7, + "latex": "( - 1 ) \\ ; \\ ( \\ / 2 )" + }, + { + "category_id": 13, + "poly": [ + 570, + 264, + 584, + 264, + 584, + 289, + 570, + 289 + ], + "score": 0.67, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 488, + 233, + 501, + 233, + 501, + 258, + 488, + 258 + ], + "score": 0.65, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1120, + 706, + 1162, + 706, + 1162, + 735, + 1120, + 735 + ], + "score": 0.63, + "latex": "( \\star )" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1442.0, + 742.0, + 1442.0, + 742.0, + 1460.0, + 717.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 1442.0, + 772.0, + 1442.0, + 772.0, + 1460.0, + 747.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 777.0, + 1442.0, + 802.0, + 1442.0, + 802.0, + 1460.0, + 777.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1442.0, + 830.0, + 1442.0, + 830.0, + 1460.0, + 805.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 1442.0, + 1007.0, + 1442.0, + 1007.0, + 1461.0, + 982.0, + 1461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 1442.0, + 1036.0, + 1442.0, + 1036.0, + 1461.0, + 1012.0, + 1461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 1442.0, + 1065.0, + 1442.0, + 1065.0, + 1461.0, + 1041.0, + 1461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 1444.0, + 1093.0, + 1444.0, + 1093.0, + 1459.0, + 1072.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 1442.0, + 1125.0, + 1442.0, + 1125.0, + 1461.0, + 1100.0, + 1461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1442.0, + 1154.0, + 1442.0, + 1154.0, + 1460.0, + 1129.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1160.0, + 1444.0, + 1181.0, + 1444.0, + 1181.0, + 1459.0, + 1160.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1442.0, + 1212.0, + 1442.0, + 1212.0, + 1461.0, + 1187.0, + 1461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1442.0, + 1242.0, + 1442.0, + 1242.0, + 1460.0, + 1217.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1442.0, + 1271.0, + 1442.0, + 1271.0, + 1461.0, + 1247.0, + 1461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 1442.0, + 1329.0, + 1442.0, + 1329.0, + 1460.0, + 1305.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 1442.0, + 1359.0, + 1442.0, + 1359.0, + 1460.0, + 1334.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1365.0, + 1444.0, + 1386.0, + 1444.0, + 1386.0, + 1459.0, + 1365.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1460.0, + 391.0, + 1460.0, + 391.0, + 1485.0, + 317.0, + 1485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1457.0, + 479.0, + 1457.0, + 479.0, + 1490.0, + 393.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 480.0, + 1457.0, + 508.0, + 1457.0, + 508.0, + 1490.0, + 480.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 1457.0, + 568.0, + 1457.0, + 568.0, + 1490.0, + 510.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 569.0, + 1457.0, + 627.0, + 1457.0, + 627.0, + 1490.0, + 569.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 1457.0, + 656.0, + 1457.0, + 656.0, + 1490.0, + 628.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 1457.0, + 714.0, + 1457.0, + 714.0, + 1490.0, + 657.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 1457.0, + 773.0, + 1457.0, + 773.0, + 1490.0, + 716.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 777.0, + 1457.0, + 802.0, + 1457.0, + 802.0, + 1490.0, + 777.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 1457.0, + 832.0, + 1457.0, + 832.0, + 1490.0, + 804.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 834.0, + 1457.0, + 950.0, + 1457.0, + 950.0, + 1490.0, + 834.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 1457.0, + 1097.0, + 1457.0, + 1097.0, + 1490.0, + 980.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 1457.0, + 1127.0, + 1457.0, + 1127.0, + 1490.0, + 1098.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1128.0, + 1457.0, + 1185.0, + 1457.0, + 1185.0, + 1490.0, + 1128.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1457.0, + 1243.0, + 1457.0, + 1243.0, + 1490.0, + 1187.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1245.0, + 1457.0, + 1273.0, + 1457.0, + 1273.0, + 1490.0, + 1245.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1274.0, + 1457.0, + 1332.0, + 1457.0, + 1332.0, + 1490.0, + 1274.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 1457.0, + 1390.0, + 1457.0, + 1390.0, + 1490.0, + 1333.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1490.0, + 390.0, + 1490.0, + 390.0, + 1514.0, + 321.0, + 1514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1487.0, + 479.0, + 1487.0, + 479.0, + 1521.0, + 392.0, + 1521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 480.0, + 1487.0, + 508.0, + 1487.0, + 508.0, + 1519.0, + 480.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 1486.0, + 715.0, + 1486.0, + 715.0, + 1521.0, + 510.0, + 1521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 1487.0, + 745.0, + 1487.0, + 745.0, + 1519.0, + 716.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1487.0, + 773.0, + 1487.0, + 773.0, + 1519.0, + 746.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 777.0, + 1487.0, + 950.0, + 1487.0, + 950.0, + 1521.0, + 777.0, + 1521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 951.0, + 1487.0, + 980.0, + 1487.0, + 980.0, + 1519.0, + 951.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1010.0, + 1487.0, + 1097.0, + 1487.0, + 1097.0, + 1519.0, + 1010.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 1487.0, + 1156.0, + 1487.0, + 1156.0, + 1519.0, + 1098.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 1487.0, + 1185.0, + 1487.0, + 1185.0, + 1519.0, + 1158.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1186.0, + 1487.0, + 1243.0, + 1487.0, + 1243.0, + 1519.0, + 1186.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1245.0, + 1487.0, + 1273.0, + 1487.0, + 1273.0, + 1519.0, + 1245.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1274.0, + 1486.0, + 1390.0, + 1486.0, + 1390.0, + 1521.0, + 1274.0, + 1521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 339.0, + 1518.0, + 391.0, + 1518.0, + 391.0, + 1544.0, + 339.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1513.0, + 421.0, + 1513.0, + 421.0, + 1548.0, + 393.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 1516.0, + 448.0, + 1516.0, + 448.0, + 1549.0, + 422.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 452.0, + 1516.0, + 479.0, + 1516.0, + 479.0, + 1548.0, + 452.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 481.0, + 1516.0, + 507.0, + 1516.0, + 507.0, + 1547.0, + 481.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 511.0, + 1516.0, + 537.0, + 1516.0, + 537.0, + 1548.0, + 511.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1516.0, + 567.0, + 1516.0, + 567.0, + 1548.0, + 541.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 1514.0, + 597.0, + 1514.0, + 597.0, + 1549.0, + 568.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1516.0, + 625.0, + 1516.0, + 625.0, + 1549.0, + 599.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 1516.0, + 654.0, + 1516.0, + 654.0, + 1549.0, + 628.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 1514.0, + 687.0, + 1514.0, + 687.0, + 1548.0, + 657.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 1516.0, + 715.0, + 1516.0, + 715.0, + 1549.0, + 688.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1516.0, + 743.0, + 1516.0, + 743.0, + 1548.0, + 717.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1517.0, + 772.0, + 1517.0, + 772.0, + 1548.0, + 746.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 776.0, + 1516.0, + 802.0, + 1516.0, + 802.0, + 1549.0, + 776.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1516.0, + 831.0, + 1516.0, + 831.0, + 1548.0, + 805.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1516.0, + 861.0, + 1516.0, + 861.0, + 1548.0, + 835.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1516.0, + 891.0, + 1516.0, + 891.0, + 1547.0, + 865.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1516.0, + 919.0, + 1516.0, + 919.0, + 1547.0, + 894.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 1516.0, + 947.0, + 1516.0, + 947.0, + 1549.0, + 924.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 1516.0, + 977.0, + 1516.0, + 977.0, + 1549.0, + 952.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 1514.0, + 1009.0, + 1514.0, + 1009.0, + 1549.0, + 980.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 1514.0, + 1069.0, + 1514.0, + 1069.0, + 1550.0, + 1039.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.0, + 1516.0, + 1096.0, + 1516.0, + 1096.0, + 1547.0, + 1071.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 1516.0, + 1125.0, + 1516.0, + 1125.0, + 1549.0, + 1100.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1517.0, + 1155.0, + 1517.0, + 1155.0, + 1549.0, + 1129.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 1516.0, + 1184.0, + 1516.0, + 1184.0, + 1549.0, + 1158.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1516.0, + 1213.0, + 1516.0, + 1213.0, + 1547.0, + 1187.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1516.0, + 1242.0, + 1516.0, + 1242.0, + 1549.0, + 1217.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1516.0, + 1271.0, + 1516.0, + 1271.0, + 1547.0, + 1247.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 1517.0, + 1301.0, + 1517.0, + 1301.0, + 1547.0, + 1275.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 1516.0, + 1331.0, + 1516.0, + 1331.0, + 1549.0, + 1305.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 1516.0, + 1360.0, + 1516.0, + 1360.0, + 1549.0, + 1336.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1516.0, + 1389.0, + 1516.0, + 1389.0, + 1548.0, + 1364.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 1548.0, + 390.0, + 1548.0, + 390.0, + 1573.0, + 311.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1544.0, + 419.0, + 1544.0, + 419.0, + 1578.0, + 395.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1545.0, + 448.0, + 1545.0, + 448.0, + 1578.0, + 423.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 1545.0, + 478.0, + 1545.0, + 478.0, + 1578.0, + 453.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1545.0, + 507.0, + 1545.0, + 507.0, + 1578.0, + 483.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 511.0, + 1545.0, + 537.0, + 1545.0, + 537.0, + 1578.0, + 511.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1545.0, + 567.0, + 1545.0, + 567.0, + 1578.0, + 541.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1545.0, + 596.0, + 1545.0, + 596.0, + 1578.0, + 570.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 1545.0, + 625.0, + 1545.0, + 625.0, + 1579.0, + 600.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 1545.0, + 654.0, + 1545.0, + 654.0, + 1579.0, + 628.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1545.0, + 684.0, + 1545.0, + 684.0, + 1578.0, + 658.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 1545.0, + 714.0, + 1545.0, + 714.0, + 1578.0, + 688.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1545.0, + 743.0, + 1545.0, + 743.0, + 1578.0, + 717.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1545.0, + 772.0, + 1545.0, + 772.0, + 1578.0, + 746.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 774.0, + 1545.0, + 802.0, + 1545.0, + 802.0, + 1579.0, + 774.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1545.0, + 831.0, + 1545.0, + 831.0, + 1578.0, + 805.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1545.0, + 861.0, + 1545.0, + 861.0, + 1578.0, + 835.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1545.0, + 891.0, + 1545.0, + 891.0, + 1577.0, + 865.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1545.0, + 919.0, + 1545.0, + 919.0, + 1578.0, + 894.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 1545.0, + 949.0, + 1545.0, + 949.0, + 1579.0, + 924.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 1545.0, + 977.0, + 1545.0, + 977.0, + 1579.0, + 952.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 1545.0, + 1007.0, + 1545.0, + 1007.0, + 1578.0, + 982.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1544.0, + 1039.0, + 1544.0, + 1039.0, + 1579.0, + 1009.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 1545.0, + 1096.0, + 1545.0, + 1096.0, + 1578.0, + 1070.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 1545.0, + 1125.0, + 1545.0, + 1125.0, + 1578.0, + 1100.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1545.0, + 1154.0, + 1545.0, + 1154.0, + 1579.0, + 1129.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 1545.0, + 1184.0, + 1545.0, + 1184.0, + 1578.0, + 1158.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1545.0, + 1213.0, + 1545.0, + 1213.0, + 1578.0, + 1187.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1545.0, + 1242.0, + 1545.0, + 1242.0, + 1578.0, + 1217.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1545.0, + 1271.0, + 1545.0, + 1271.0, + 1577.0, + 1247.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 1545.0, + 1300.0, + 1545.0, + 1300.0, + 1577.0, + 1275.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 1545.0, + 1329.0, + 1545.0, + 1329.0, + 1578.0, + 1306.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 1544.0, + 1359.0, + 1544.0, + 1359.0, + 1578.0, + 1336.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1545.0, + 1389.0, + 1545.0, + 1389.0, + 1578.0, + 1364.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 345.0, + 1577.0, + 391.0, + 1577.0, + 391.0, + 1604.0, + 345.0, + 1604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1574.0, + 419.0, + 1574.0, + 419.0, + 1608.0, + 395.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1574.0, + 449.0, + 1574.0, + 449.0, + 1608.0, + 423.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 1574.0, + 478.0, + 1574.0, + 478.0, + 1608.0, + 453.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1575.0, + 507.0, + 1575.0, + 507.0, + 1608.0, + 483.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 511.0, + 1575.0, + 537.0, + 1575.0, + 537.0, + 1608.0, + 511.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1575.0, + 567.0, + 1575.0, + 567.0, + 1608.0, + 541.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1575.0, + 596.0, + 1575.0, + 596.0, + 1608.0, + 570.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 1575.0, + 625.0, + 1575.0, + 625.0, + 1608.0, + 600.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 1575.0, + 656.0, + 1575.0, + 656.0, + 1608.0, + 628.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1575.0, + 684.0, + 1575.0, + 684.0, + 1608.0, + 658.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 1575.0, + 714.0, + 1575.0, + 714.0, + 1608.0, + 688.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1575.0, + 743.0, + 1575.0, + 743.0, + 1608.0, + 717.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1575.0, + 773.0, + 1575.0, + 773.0, + 1608.0, + 746.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1575.0, + 831.0, + 1575.0, + 831.0, + 1608.0, + 805.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1575.0, + 861.0, + 1575.0, + 861.0, + 1608.0, + 835.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1575.0, + 889.0, + 1575.0, + 889.0, + 1608.0, + 865.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1575.0, + 919.0, + 1575.0, + 919.0, + 1608.0, + 894.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 1575.0, + 950.0, + 1575.0, + 950.0, + 1608.0, + 921.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 1575.0, + 978.0, + 1575.0, + 978.0, + 1608.0, + 952.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 1575.0, + 1007.0, + 1575.0, + 1007.0, + 1608.0, + 982.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 1575.0, + 1036.0, + 1575.0, + 1036.0, + 1608.0, + 1012.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 1575.0, + 1067.0, + 1575.0, + 1067.0, + 1608.0, + 1040.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 1575.0, + 1125.0, + 1575.0, + 1125.0, + 1608.0, + 1100.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1575.0, + 1154.0, + 1575.0, + 1154.0, + 1608.0, + 1129.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 1575.0, + 1184.0, + 1575.0, + 1184.0, + 1608.0, + 1158.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1575.0, + 1213.0, + 1575.0, + 1213.0, + 1608.0, + 1187.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1575.0, + 1242.0, + 1575.0, + 1242.0, + 1608.0, + 1217.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1575.0, + 1271.0, + 1575.0, + 1271.0, + 1608.0, + 1247.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 1575.0, + 1301.0, + 1575.0, + 1301.0, + 1608.0, + 1275.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 1575.0, + 1331.0, + 1575.0, + 1331.0, + 1608.0, + 1306.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 1575.0, + 1360.0, + 1575.0, + 1360.0, + 1608.0, + 1336.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1575.0, + 1389.0, + 1575.0, + 1389.0, + 1608.0, + 1364.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 344.0, + 1606.0, + 390.0, + 1606.0, + 390.0, + 1634.0, + 344.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1604.0, + 418.0, + 1604.0, + 418.0, + 1624.0, + 395.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1604.0, + 448.0, + 1604.0, + 448.0, + 1624.0, + 424.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 1604.0, + 478.0, + 1604.0, + 478.0, + 1622.0, + 453.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1604.0, + 507.0, + 1604.0, + 507.0, + 1622.0, + 483.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 511.0, + 1605.0, + 537.0, + 1605.0, + 537.0, + 1622.0, + 511.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1605.0, + 567.0, + 1605.0, + 567.0, + 1622.0, + 541.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1605.0, + 596.0, + 1605.0, + 596.0, + 1622.0, + 570.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 1604.0, + 626.0, + 1604.0, + 626.0, + 1622.0, + 600.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1605.0, + 654.0, + 1605.0, + 654.0, + 1622.0, + 630.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1604.0, + 684.0, + 1604.0, + 684.0, + 1624.0, + 658.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 1605.0, + 714.0, + 1605.0, + 714.0, + 1624.0, + 688.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1604.0, + 743.0, + 1604.0, + 743.0, + 1622.0, + 717.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1605.0, + 773.0, + 1605.0, + 773.0, + 1624.0, + 746.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 1604.0, + 831.0, + 1604.0, + 831.0, + 1624.0, + 806.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 1605.0, + 860.0, + 1605.0, + 860.0, + 1624.0, + 836.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1604.0, + 891.0, + 1604.0, + 891.0, + 1622.0, + 865.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 1605.0, + 917.0, + 1605.0, + 917.0, + 1622.0, + 892.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 925.0, + 1604.0, + 950.0, + 1604.0, + 950.0, + 1622.0, + 925.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 951.0, + 1603.0, + 981.0, + 1603.0, + 981.0, + 1625.0, + 951.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 1604.0, + 1007.0, + 1604.0, + 1007.0, + 1624.0, + 982.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 1605.0, + 1036.0, + 1605.0, + 1036.0, + 1624.0, + 1012.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 1605.0, + 1067.0, + 1605.0, + 1067.0, + 1624.0, + 1041.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 1605.0, + 1096.0, + 1605.0, + 1096.0, + 1622.0, + 1070.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1605.0, + 1154.0, + 1605.0, + 1154.0, + 1624.0, + 1129.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 1604.0, + 1184.0, + 1604.0, + 1184.0, + 1622.0, + 1158.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1189.0, + 1605.0, + 1213.0, + 1605.0, + 1213.0, + 1624.0, + 1189.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1604.0, + 1243.0, + 1604.0, + 1243.0, + 1624.0, + 1217.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1605.0, + 1271.0, + 1605.0, + 1271.0, + 1624.0, + 1247.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 1605.0, + 1301.0, + 1605.0, + 1301.0, + 1624.0, + 1276.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1307.0, + 1606.0, + 1328.0, + 1606.0, + 1328.0, + 1621.0, + 1307.0, + 1621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 1604.0, + 1360.0, + 1604.0, + 1360.0, + 1624.0, + 1336.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1605.0, + 1389.0, + 1605.0, + 1389.0, + 1624.0, + 1364.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1618.0, + 418.0, + 1618.0, + 418.0, + 1636.0, + 395.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1618.0, + 448.0, + 1618.0, + 448.0, + 1637.0, + 424.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 1618.0, + 478.0, + 1618.0, + 478.0, + 1636.0, + 453.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1619.0, + 507.0, + 1619.0, + 507.0, + 1636.0, + 483.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1619.0, + 537.0, + 1619.0, + 537.0, + 1636.0, + 512.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1619.0, + 567.0, + 1619.0, + 567.0, + 1636.0, + 541.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 569.0, + 1619.0, + 596.0, + 1619.0, + 596.0, + 1636.0, + 569.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 1619.0, + 625.0, + 1619.0, + 625.0, + 1637.0, + 600.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1619.0, + 654.0, + 1619.0, + 654.0, + 1636.0, + 630.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1619.0, + 684.0, + 1619.0, + 684.0, + 1636.0, + 658.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1619.0, + 714.0, + 1619.0, + 714.0, + 1636.0, + 687.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1619.0, + 743.0, + 1619.0, + 743.0, + 1636.0, + 717.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1619.0, + 773.0, + 1619.0, + 773.0, + 1636.0, + 746.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1618.0, + 831.0, + 1618.0, + 831.0, + 1636.0, + 805.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1619.0, + 860.0, + 1619.0, + 860.0, + 1636.0, + 835.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1619.0, + 892.0, + 1619.0, + 892.0, + 1636.0, + 865.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 895.0, + 1620.0, + 917.0, + 1620.0, + 917.0, + 1635.0, + 895.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 1619.0, + 947.0, + 1619.0, + 947.0, + 1636.0, + 923.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 1619.0, + 978.0, + 1619.0, + 978.0, + 1637.0, + 952.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 1618.0, + 1007.0, + 1618.0, + 1007.0, + 1636.0, + 982.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 1619.0, + 1036.0, + 1619.0, + 1036.0, + 1636.0, + 1012.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 1619.0, + 1066.0, + 1619.0, + 1066.0, + 1636.0, + 1041.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 1619.0, + 1095.0, + 1619.0, + 1095.0, + 1637.0, + 1070.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1619.0, + 1154.0, + 1619.0, + 1154.0, + 1636.0, + 1129.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 1619.0, + 1184.0, + 1619.0, + 1184.0, + 1636.0, + 1158.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1619.0, + 1212.0, + 1619.0, + 1212.0, + 1636.0, + 1187.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 1618.0, + 1242.0, + 1618.0, + 1242.0, + 1636.0, + 1216.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1248.0, + 1620.0, + 1269.0, + 1620.0, + 1269.0, + 1635.0, + 1248.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1278.0, + 1620.0, + 1299.0, + 1620.0, + 1299.0, + 1635.0, + 1278.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 1619.0, + 1329.0, + 1619.0, + 1329.0, + 1636.0, + 1305.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 1619.0, + 1359.0, + 1619.0, + 1359.0, + 1636.0, + 1334.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1619.0, + 1389.0, + 1619.0, + 1389.0, + 1636.0, + 1364.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 1636.0, + 391.0, + 1636.0, + 391.0, + 1663.0, + 346.0, + 1663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1634.0, + 419.0, + 1634.0, + 419.0, + 1666.0, + 395.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1634.0, + 448.0, + 1634.0, + 448.0, + 1666.0, + 424.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 1634.0, + 478.0, + 1634.0, + 478.0, + 1666.0, + 453.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1634.0, + 507.0, + 1634.0, + 507.0, + 1666.0, + 483.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 511.0, + 1634.0, + 537.0, + 1634.0, + 537.0, + 1666.0, + 511.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1635.0, + 567.0, + 1635.0, + 567.0, + 1666.0, + 541.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1634.0, + 596.0, + 1634.0, + 596.0, + 1666.0, + 570.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1634.0, + 625.0, + 1634.0, + 625.0, + 1666.0, + 599.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1634.0, + 654.0, + 1634.0, + 654.0, + 1666.0, + 630.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1634.0, + 684.0, + 1634.0, + 684.0, + 1666.0, + 658.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 1634.0, + 715.0, + 1634.0, + 715.0, + 1666.0, + 688.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 1634.0, + 743.0, + 1634.0, + 743.0, + 1666.0, + 716.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 1634.0, + 773.0, + 1634.0, + 773.0, + 1666.0, + 747.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1634.0, + 831.0, + 1634.0, + 831.0, + 1666.0, + 805.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1634.0, + 861.0, + 1634.0, + 861.0, + 1666.0, + 835.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1634.0, + 892.0, + 1634.0, + 892.0, + 1666.0, + 865.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1634.0, + 919.0, + 1634.0, + 919.0, + 1666.0, + 894.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 1634.0, + 949.0, + 1634.0, + 949.0, + 1666.0, + 923.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 1634.0, + 980.0, + 1634.0, + 980.0, + 1666.0, + 952.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 1634.0, + 1008.0, + 1634.0, + 1008.0, + 1666.0, + 982.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 1635.0, + 1036.0, + 1635.0, + 1036.0, + 1666.0, + 1012.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 1634.0, + 1066.0, + 1634.0, + 1066.0, + 1666.0, + 1040.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 1634.0, + 1095.0, + 1634.0, + 1095.0, + 1666.0, + 1070.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 1634.0, + 1125.0, + 1634.0, + 1125.0, + 1666.0, + 1100.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 1634.0, + 1185.0, + 1634.0, + 1185.0, + 1666.0, + 1158.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1634.0, + 1212.0, + 1634.0, + 1212.0, + 1666.0, + 1187.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1634.0, + 1243.0, + 1634.0, + 1243.0, + 1666.0, + 1217.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1634.0, + 1271.0, + 1634.0, + 1271.0, + 1665.0, + 1247.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 1634.0, + 1301.0, + 1634.0, + 1301.0, + 1663.0, + 1276.0, + 1663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 1634.0, + 1331.0, + 1634.0, + 1331.0, + 1665.0, + 1306.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 1634.0, + 1360.0, + 1634.0, + 1360.0, + 1666.0, + 1334.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1634.0, + 1389.0, + 1634.0, + 1389.0, + 1666.0, + 1364.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1665.0, + 390.0, + 1665.0, + 390.0, + 1692.0, + 353.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1662.0, + 418.0, + 1662.0, + 418.0, + 1696.0, + 395.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1663.0, + 449.0, + 1663.0, + 449.0, + 1693.0, + 424.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 452.0, + 1663.0, + 478.0, + 1663.0, + 478.0, + 1694.0, + 452.0, + 1694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1663.0, + 507.0, + 1663.0, + 507.0, + 1696.0, + 483.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1663.0, + 537.0, + 1663.0, + 537.0, + 1694.0, + 512.0, + 1694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1663.0, + 567.0, + 1663.0, + 567.0, + 1682.0, + 541.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1663.0, + 596.0, + 1663.0, + 596.0, + 1696.0, + 570.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1663.0, + 626.0, + 1663.0, + 626.0, + 1696.0, + 599.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1663.0, + 654.0, + 1663.0, + 654.0, + 1696.0, + 630.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1663.0, + 684.0, + 1663.0, + 684.0, + 1696.0, + 658.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 1663.0, + 714.0, + 1663.0, + 714.0, + 1682.0, + 688.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 1663.0, + 745.0, + 1663.0, + 745.0, + 1682.0, + 716.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1663.0, + 773.0, + 1663.0, + 773.0, + 1696.0, + 746.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1662.0, + 831.0, + 1662.0, + 831.0, + 1696.0, + 805.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1663.0, + 861.0, + 1663.0, + 861.0, + 1696.0, + 835.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1663.0, + 891.0, + 1663.0, + 891.0, + 1697.0, + 865.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 1663.0, + 920.0, + 1663.0, + 920.0, + 1696.0, + 893.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 1663.0, + 949.0, + 1663.0, + 949.0, + 1696.0, + 924.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 1663.0, + 978.0, + 1663.0, + 978.0, + 1696.0, + 952.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 981.0, + 1663.0, + 1008.0, + 1663.0, + 1008.0, + 1696.0, + 981.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 1663.0, + 1036.0, + 1663.0, + 1036.0, + 1696.0, + 1012.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 1663.0, + 1066.0, + 1663.0, + 1066.0, + 1696.0, + 1040.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 1663.0, + 1095.0, + 1663.0, + 1095.0, + 1696.0, + 1070.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 1663.0, + 1125.0, + 1663.0, + 1125.0, + 1696.0, + 1100.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1663.0, + 1156.0, + 1663.0, + 1156.0, + 1696.0, + 1129.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1189.0, + 1663.0, + 1212.0, + 1663.0, + 1212.0, + 1682.0, + 1189.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1663.0, + 1242.0, + 1663.0, + 1242.0, + 1682.0, + 1217.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1663.0, + 1271.0, + 1663.0, + 1271.0, + 1696.0, + 1247.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 1663.0, + 1301.0, + 1663.0, + 1301.0, + 1693.0, + 1276.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 1663.0, + 1329.0, + 1663.0, + 1329.0, + 1694.0, + 1306.0, + 1694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 1663.0, + 1360.0, + 1663.0, + 1360.0, + 1694.0, + 1334.0, + 1694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1663.0, + 1389.0, + 1663.0, + 1389.0, + 1696.0, + 1364.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1694.0, + 390.0, + 1694.0, + 390.0, + 1722.0, + 351.0, + 1722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1692.0, + 419.0, + 1692.0, + 419.0, + 1726.0, + 395.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1692.0, + 449.0, + 1692.0, + 449.0, + 1723.0, + 424.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 1693.0, + 479.0, + 1693.0, + 479.0, + 1723.0, + 453.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1693.0, + 507.0, + 1693.0, + 507.0, + 1726.0, + 483.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1693.0, + 537.0, + 1693.0, + 537.0, + 1724.0, + 512.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1693.0, + 567.0, + 1693.0, + 567.0, + 1724.0, + 541.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1693.0, + 596.0, + 1693.0, + 596.0, + 1726.0, + 570.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 1692.0, + 626.0, + 1692.0, + 626.0, + 1726.0, + 600.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1693.0, + 656.0, + 1693.0, + 656.0, + 1726.0, + 630.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1693.0, + 684.0, + 1693.0, + 684.0, + 1724.0, + 658.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1693.0, + 714.0, + 1693.0, + 714.0, + 1724.0, + 687.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1693.0, + 743.0, + 1693.0, + 743.0, + 1726.0, + 717.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 1693.0, + 772.0, + 1693.0, + 772.0, + 1726.0, + 747.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1692.0, + 831.0, + 1692.0, + 831.0, + 1726.0, + 805.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1692.0, + 861.0, + 1692.0, + 861.0, + 1724.0, + 835.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1692.0, + 891.0, + 1692.0, + 891.0, + 1726.0, + 865.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1692.0, + 920.0, + 1692.0, + 920.0, + 1726.0, + 894.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 1693.0, + 949.0, + 1693.0, + 949.0, + 1724.0, + 924.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1693.0, + 978.0, + 1693.0, + 978.0, + 1726.0, + 954.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 1693.0, + 1008.0, + 1693.0, + 1008.0, + 1726.0, + 982.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 1693.0, + 1036.0, + 1693.0, + 1036.0, + 1726.0, + 1012.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 1692.0, + 1067.0, + 1692.0, + 1067.0, + 1726.0, + 1040.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 1693.0, + 1095.0, + 1693.0, + 1095.0, + 1726.0, + 1070.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1101.0, + 1693.0, + 1125.0, + 1693.0, + 1125.0, + 1726.0, + 1101.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1693.0, + 1154.0, + 1693.0, + 1154.0, + 1726.0, + 1129.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 1693.0, + 1184.0, + 1693.0, + 1184.0, + 1724.0, + 1158.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1693.0, + 1242.0, + 1693.0, + 1242.0, + 1723.0, + 1217.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1693.0, + 1271.0, + 1693.0, + 1271.0, + 1726.0, + 1247.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 1692.0, + 1301.0, + 1692.0, + 1301.0, + 1726.0, + 1276.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 1693.0, + 1329.0, + 1693.0, + 1329.0, + 1723.0, + 1306.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 1693.0, + 1359.0, + 1693.0, + 1359.0, + 1726.0, + 1334.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1365.0, + 1692.0, + 1389.0, + 1692.0, + 1389.0, + 1723.0, + 1365.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1723.0, + 390.0, + 1723.0, + 390.0, + 1752.0, + 351.0, + 1752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1722.0, + 419.0, + 1722.0, + 419.0, + 1742.0, + 395.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1722.0, + 449.0, + 1722.0, + 449.0, + 1742.0, + 424.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 1722.0, + 479.0, + 1722.0, + 479.0, + 1742.0, + 453.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1722.0, + 507.0, + 1722.0, + 507.0, + 1742.0, + 483.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1722.0, + 537.0, + 1722.0, + 537.0, + 1742.0, + 512.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 1722.0, + 567.0, + 1722.0, + 567.0, + 1742.0, + 542.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1722.0, + 596.0, + 1722.0, + 596.0, + 1742.0, + 570.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 1723.0, + 624.0, + 1723.0, + 624.0, + 1739.0, + 598.0, + 1739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1722.0, + 654.0, + 1722.0, + 654.0, + 1742.0, + 630.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1722.0, + 684.0, + 1722.0, + 684.0, + 1742.0, + 658.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1721.0, + 716.0, + 1721.0, + 716.0, + 1743.0, + 687.0, + 1743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1722.0, + 743.0, + 1722.0, + 743.0, + 1742.0, + 717.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 1722.0, + 772.0, + 1722.0, + 772.0, + 1742.0, + 747.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1722.0, + 831.0, + 1722.0, + 831.0, + 1742.0, + 805.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 1722.0, + 861.0, + 1722.0, + 861.0, + 1742.0, + 836.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 1721.0, + 893.0, + 1721.0, + 893.0, + 1743.0, + 862.0, + 1743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1722.0, + 919.0, + 1722.0, + 919.0, + 1742.0, + 894.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 1722.0, + 950.0, + 1722.0, + 950.0, + 1740.0, + 924.0, + 1740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1722.0, + 978.0, + 1722.0, + 978.0, + 1742.0, + 954.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 1720.0, + 1009.0, + 1720.0, + 1009.0, + 1744.0, + 983.0, + 1744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1013.0, + 1723.0, + 1036.0, + 1723.0, + 1036.0, + 1742.0, + 1013.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 1722.0, + 1066.0, + 1722.0, + 1066.0, + 1742.0, + 1041.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.0, + 1722.0, + 1095.0, + 1722.0, + 1095.0, + 1742.0, + 1071.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1101.0, + 1722.0, + 1124.0, + 1722.0, + 1124.0, + 1742.0, + 1101.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1722.0, + 1154.0, + 1722.0, + 1154.0, + 1742.0, + 1129.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 1722.0, + 1184.0, + 1722.0, + 1184.0, + 1742.0, + 1159.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1722.0, + 1213.0, + 1722.0, + 1213.0, + 1742.0, + 1187.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1722.0, + 1271.0, + 1722.0, + 1271.0, + 1742.0, + 1247.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 1722.0, + 1301.0, + 1722.0, + 1301.0, + 1742.0, + 1276.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 1722.0, + 1331.0, + 1722.0, + 1331.0, + 1742.0, + 1306.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 1722.0, + 1359.0, + 1722.0, + 1359.0, + 1742.0, + 1336.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1722.0, + 1388.0, + 1722.0, + 1388.0, + 1742.0, + 1364.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1735.0, + 418.0, + 1735.0, + 418.0, + 1754.0, + 395.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1735.0, + 448.0, + 1735.0, + 448.0, + 1754.0, + 424.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 1735.0, + 478.0, + 1735.0, + 478.0, + 1754.0, + 454.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1735.0, + 506.0, + 1735.0, + 506.0, + 1754.0, + 483.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1735.0, + 536.0, + 1735.0, + 536.0, + 1754.0, + 512.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 1735.0, + 565.0, + 1735.0, + 565.0, + 1754.0, + 542.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1737.0, + 595.0, + 1737.0, + 595.0, + 1754.0, + 570.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 1737.0, + 625.0, + 1737.0, + 625.0, + 1754.0, + 600.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1737.0, + 654.0, + 1737.0, + 654.0, + 1754.0, + 630.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1737.0, + 683.0, + 1737.0, + 683.0, + 1754.0, + 658.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 1737.0, + 714.0, + 1737.0, + 714.0, + 1754.0, + 688.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1735.0, + 742.0, + 1735.0, + 742.0, + 1754.0, + 717.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 1735.0, + 772.0, + 1735.0, + 772.0, + 1754.0, + 747.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1735.0, + 831.0, + 1735.0, + 831.0, + 1754.0, + 805.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1735.0, + 860.0, + 1735.0, + 860.0, + 1754.0, + 835.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1735.0, + 889.0, + 1735.0, + 889.0, + 1754.0, + 865.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1735.0, + 919.0, + 1735.0, + 919.0, + 1754.0, + 894.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 1737.0, + 949.0, + 1737.0, + 949.0, + 1754.0, + 923.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 1735.0, + 977.0, + 1735.0, + 977.0, + 1754.0, + 952.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 1737.0, + 1007.0, + 1737.0, + 1007.0, + 1754.0, + 982.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1013.0, + 1738.0, + 1034.0, + 1738.0, + 1034.0, + 1753.0, + 1013.0, + 1753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 1738.0, + 1064.0, + 1738.0, + 1064.0, + 1753.0, + 1043.0, + 1753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 1738.0, + 1093.0, + 1738.0, + 1093.0, + 1753.0, + 1072.0, + 1753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 1737.0, + 1124.0, + 1737.0, + 1124.0, + 1754.0, + 1100.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1737.0, + 1154.0, + 1737.0, + 1154.0, + 1754.0, + 1129.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 1735.0, + 1182.0, + 1735.0, + 1182.0, + 1754.0, + 1159.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1189.0, + 1735.0, + 1212.0, + 1735.0, + 1212.0, + 1754.0, + 1189.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1735.0, + 1271.0, + 1735.0, + 1271.0, + 1754.0, + 1247.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1278.0, + 1738.0, + 1299.0, + 1738.0, + 1299.0, + 1753.0, + 1278.0, + 1753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 1735.0, + 1329.0, + 1735.0, + 1329.0, + 1754.0, + 1306.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 1735.0, + 1358.0, + 1735.0, + 1358.0, + 1754.0, + 1334.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1735.0, + 1389.0, + 1735.0, + 1389.0, + 1754.0, + 1364.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1754.0, + 391.0, + 1754.0, + 391.0, + 1781.0, + 351.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1750.0, + 419.0, + 1750.0, + 419.0, + 1781.0, + 395.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1750.0, + 448.0, + 1750.0, + 448.0, + 1783.0, + 423.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 1750.0, + 478.0, + 1750.0, + 478.0, + 1781.0, + 453.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1752.0, + 507.0, + 1752.0, + 507.0, + 1781.0, + 483.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1752.0, + 537.0, + 1752.0, + 537.0, + 1783.0, + 512.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1752.0, + 567.0, + 1752.0, + 567.0, + 1783.0, + 541.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1752.0, + 596.0, + 1752.0, + 596.0, + 1783.0, + 570.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1752.0, + 626.0, + 1752.0, + 626.0, + 1784.0, + 599.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 1752.0, + 654.0, + 1752.0, + 654.0, + 1783.0, + 628.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 1752.0, + 685.0, + 1752.0, + 685.0, + 1783.0, + 657.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 1751.0, + 745.0, + 1751.0, + 745.0, + 1784.0, + 688.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1752.0, + 773.0, + 1752.0, + 773.0, + 1784.0, + 746.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1752.0, + 832.0, + 1752.0, + 832.0, + 1784.0, + 805.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 834.0, + 1749.0, + 862.0, + 1749.0, + 862.0, + 1783.0, + 834.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1752.0, + 891.0, + 1752.0, + 891.0, + 1783.0, + 865.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 1752.0, + 919.0, + 1752.0, + 919.0, + 1784.0, + 893.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 1752.0, + 950.0, + 1752.0, + 950.0, + 1784.0, + 923.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 1752.0, + 978.0, + 1752.0, + 978.0, + 1784.0, + 952.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 1752.0, + 1008.0, + 1752.0, + 1008.0, + 1784.0, + 983.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 1752.0, + 1036.0, + 1752.0, + 1036.0, + 1783.0, + 1012.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 1752.0, + 1067.0, + 1752.0, + 1067.0, + 1784.0, + 1041.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.0, + 1752.0, + 1095.0, + 1752.0, + 1095.0, + 1781.0, + 1071.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 1752.0, + 1124.0, + 1752.0, + 1124.0, + 1784.0, + 1100.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1752.0, + 1154.0, + 1752.0, + 1154.0, + 1783.0, + 1129.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 1752.0, + 1184.0, + 1752.0, + 1184.0, + 1781.0, + 1159.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1189.0, + 1752.0, + 1212.0, + 1752.0, + 1212.0, + 1781.0, + 1189.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1752.0, + 1243.0, + 1752.0, + 1243.0, + 1784.0, + 1217.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 1752.0, + 1301.0, + 1752.0, + 1301.0, + 1784.0, + 1275.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 1752.0, + 1331.0, + 1752.0, + 1331.0, + 1783.0, + 1305.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 1752.0, + 1360.0, + 1752.0, + 1360.0, + 1783.0, + 1334.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1750.0, + 1389.0, + 1750.0, + 1389.0, + 1783.0, + 1364.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1783.0, + 390.0, + 1783.0, + 390.0, + 1810.0, + 354.0, + 1810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1780.0, + 419.0, + 1780.0, + 419.0, + 1812.0, + 395.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1780.0, + 449.0, + 1780.0, + 449.0, + 1812.0, + 423.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 1780.0, + 478.0, + 1780.0, + 478.0, + 1811.0, + 453.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1780.0, + 507.0, + 1780.0, + 507.0, + 1811.0, + 483.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 511.0, + 1781.0, + 537.0, + 1781.0, + 537.0, + 1811.0, + 511.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1781.0, + 567.0, + 1781.0, + 567.0, + 1811.0, + 541.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1780.0, + 595.0, + 1780.0, + 595.0, + 1811.0, + 570.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1781.0, + 626.0, + 1781.0, + 626.0, + 1812.0, + 599.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1780.0, + 654.0, + 1780.0, + 654.0, + 1812.0, + 630.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1781.0, + 684.0, + 1781.0, + 684.0, + 1811.0, + 658.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 1780.0, + 714.0, + 1780.0, + 714.0, + 1812.0, + 688.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1781.0, + 743.0, + 1781.0, + 743.0, + 1812.0, + 717.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 1780.0, + 773.0, + 1780.0, + 773.0, + 1812.0, + 747.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 1780.0, + 832.0, + 1780.0, + 832.0, + 1812.0, + 804.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1780.0, + 861.0, + 1780.0, + 861.0, + 1811.0, + 835.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1780.0, + 891.0, + 1780.0, + 891.0, + 1812.0, + 865.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1781.0, + 919.0, + 1781.0, + 919.0, + 1811.0, + 894.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 1781.0, + 949.0, + 1781.0, + 949.0, + 1812.0, + 923.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 1781.0, + 978.0, + 1781.0, + 978.0, + 1812.0, + 952.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 1781.0, + 1008.0, + 1781.0, + 1008.0, + 1811.0, + 982.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 1781.0, + 1038.0, + 1781.0, + 1038.0, + 1812.0, + 1012.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 1781.0, + 1067.0, + 1781.0, + 1067.0, + 1811.0, + 1041.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 1781.0, + 1095.0, + 1781.0, + 1095.0, + 1811.0, + 1070.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 1781.0, + 1125.0, + 1781.0, + 1125.0, + 1811.0, + 1100.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1781.0, + 1154.0, + 1781.0, + 1154.0, + 1812.0, + 1129.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 1780.0, + 1182.0, + 1780.0, + 1182.0, + 1811.0, + 1158.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1781.0, + 1213.0, + 1781.0, + 1213.0, + 1811.0, + 1187.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1781.0, + 1242.0, + 1781.0, + 1242.0, + 1811.0, + 1217.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1781.0, + 1271.0, + 1781.0, + 1271.0, + 1811.0, + 1247.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1304.0, + 1780.0, + 1332.0, + 1780.0, + 1332.0, + 1812.0, + 1304.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 1780.0, + 1360.0, + 1780.0, + 1360.0, + 1811.0, + 1336.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1780.0, + 1389.0, + 1780.0, + 1389.0, + 1811.0, + 1364.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1812.0, + 391.0, + 1812.0, + 391.0, + 1841.0, + 354.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 1810.0, + 419.0, + 1810.0, + 419.0, + 1830.0, + 396.0, + 1830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1810.0, + 449.0, + 1810.0, + 449.0, + 1829.0, + 424.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 1810.0, + 478.0, + 1810.0, + 478.0, + 1830.0, + 454.0, + 1830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1810.0, + 507.0, + 1810.0, + 507.0, + 1829.0, + 483.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1810.0, + 537.0, + 1810.0, + 537.0, + 1829.0, + 512.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 1810.0, + 567.0, + 1810.0, + 567.0, + 1829.0, + 542.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1810.0, + 596.0, + 1810.0, + 596.0, + 1829.0, + 570.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 1810.0, + 625.0, + 1810.0, + 625.0, + 1829.0, + 600.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1810.0, + 654.0, + 1810.0, + 654.0, + 1829.0, + 630.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 659.0, + 1810.0, + 684.0, + 1810.0, + 684.0, + 1829.0, + 659.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 1810.0, + 712.0, + 1810.0, + 712.0, + 1829.0, + 688.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1810.0, + 743.0, + 1810.0, + 743.0, + 1830.0, + 717.0, + 1830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 1810.0, + 773.0, + 1810.0, + 773.0, + 1830.0, + 747.0, + 1830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 1809.0, + 834.0, + 1809.0, + 834.0, + 1831.0, + 804.0, + 1831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 1810.0, + 861.0, + 1810.0, + 861.0, + 1830.0, + 836.0, + 1830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 1810.0, + 891.0, + 1810.0, + 891.0, + 1830.0, + 866.0, + 1830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 895.0, + 1810.0, + 920.0, + 1810.0, + 920.0, + 1830.0, + 895.0, + 1830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 1810.0, + 950.0, + 1810.0, + 950.0, + 1829.0, + 924.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1810.0, + 978.0, + 1810.0, + 978.0, + 1830.0, + 954.0, + 1830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 1811.0, + 1008.0, + 1811.0, + 1008.0, + 1829.0, + 983.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 1811.0, + 1036.0, + 1811.0, + 1036.0, + 1829.0, + 1012.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 1811.0, + 1067.0, + 1811.0, + 1067.0, + 1829.0, + 1041.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 1812.0, + 1093.0, + 1812.0, + 1093.0, + 1827.0, + 1072.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1101.0, + 1811.0, + 1125.0, + 1811.0, + 1125.0, + 1829.0, + 1101.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1810.0, + 1154.0, + 1810.0, + 1154.0, + 1829.0, + 1129.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 1810.0, + 1184.0, + 1810.0, + 1184.0, + 1829.0, + 1159.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1189.0, + 1810.0, + 1213.0, + 1810.0, + 1213.0, + 1829.0, + 1189.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1810.0, + 1242.0, + 1810.0, + 1242.0, + 1829.0, + 1217.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1810.0, + 1271.0, + 1810.0, + 1271.0, + 1830.0, + 1247.0, + 1830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1273.0, + 1807.0, + 1304.0, + 1807.0, + 1304.0, + 1832.0, + 1273.0, + 1832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 1810.0, + 1360.0, + 1810.0, + 1360.0, + 1830.0, + 1336.0, + 1830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1810.0, + 1388.0, + 1810.0, + 1388.0, + 1830.0, + 1364.0, + 1830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1824.0, + 418.0, + 1824.0, + 418.0, + 1842.0, + 395.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1824.0, + 448.0, + 1824.0, + 448.0, + 1842.0, + 424.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 455.0, + 1826.0, + 476.0, + 1826.0, + 476.0, + 1841.0, + 455.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 484.0, + 1826.0, + 505.0, + 1826.0, + 505.0, + 1841.0, + 484.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 513.0, + 1824.0, + 536.0, + 1824.0, + 536.0, + 1842.0, + 513.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 1824.0, + 565.0, + 1824.0, + 565.0, + 1842.0, + 542.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1824.0, + 595.0, + 1824.0, + 595.0, + 1842.0, + 570.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1824.0, + 626.0, + 1824.0, + 626.0, + 1842.0, + 599.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1825.0, + 654.0, + 1825.0, + 654.0, + 1842.0, + 630.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 659.0, + 1824.0, + 683.0, + 1824.0, + 683.0, + 1842.0, + 659.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1826.0, + 711.0, + 1826.0, + 711.0, + 1841.0, + 690.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1824.0, + 742.0, + 1824.0, + 742.0, + 1842.0, + 717.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 1824.0, + 773.0, + 1824.0, + 773.0, + 1842.0, + 747.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1824.0, + 831.0, + 1824.0, + 831.0, + 1842.0, + 805.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1824.0, + 861.0, + 1824.0, + 861.0, + 1842.0, + 835.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1824.0, + 891.0, + 1824.0, + 891.0, + 1842.0, + 865.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1824.0, + 919.0, + 1824.0, + 919.0, + 1842.0, + 894.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 1824.0, + 949.0, + 1824.0, + 949.0, + 1842.0, + 924.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 1824.0, + 977.0, + 1824.0, + 977.0, + 1842.0, + 952.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1826.0, + 1004.0, + 1826.0, + 1004.0, + 1841.0, + 985.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 1824.0, + 1035.0, + 1824.0, + 1035.0, + 1842.0, + 1012.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 1824.0, + 1065.0, + 1824.0, + 1065.0, + 1842.0, + 1041.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.0, + 1824.0, + 1095.0, + 1824.0, + 1095.0, + 1842.0, + 1071.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 1825.0, + 1124.0, + 1825.0, + 1124.0, + 1842.0, + 1100.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1824.0, + 1154.0, + 1824.0, + 1154.0, + 1842.0, + 1129.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1160.0, + 1826.0, + 1181.0, + 1826.0, + 1181.0, + 1841.0, + 1160.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1189.0, + 1824.0, + 1212.0, + 1824.0, + 1212.0, + 1842.0, + 1189.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1824.0, + 1242.0, + 1824.0, + 1242.0, + 1842.0, + 1217.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1824.0, + 1270.0, + 1824.0, + 1270.0, + 1842.0, + 1247.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 1824.0, + 1300.0, + 1824.0, + 1300.0, + 1842.0, + 1276.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 1825.0, + 1363.0, + 1825.0, + 1363.0, + 1842.0, + 1333.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1824.0, + 1389.0, + 1824.0, + 1389.0, + 1842.0, + 1364.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1842.0, + 391.0, + 1842.0, + 391.0, + 1870.0, + 354.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1839.0, + 419.0, + 1839.0, + 419.0, + 1872.0, + 395.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1839.0, + 448.0, + 1839.0, + 448.0, + 1872.0, + 423.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 1839.0, + 479.0, + 1839.0, + 479.0, + 1872.0, + 453.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 481.0, + 1839.0, + 507.0, + 1839.0, + 507.0, + 1872.0, + 481.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 511.0, + 1839.0, + 537.0, + 1839.0, + 537.0, + 1872.0, + 511.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1839.0, + 567.0, + 1839.0, + 567.0, + 1872.0, + 541.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1839.0, + 596.0, + 1839.0, + 596.0, + 1872.0, + 570.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 1837.0, + 627.0, + 1837.0, + 627.0, + 1872.0, + 597.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 1840.0, + 656.0, + 1840.0, + 656.0, + 1872.0, + 628.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1839.0, + 684.0, + 1839.0, + 684.0, + 1872.0, + 658.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 1839.0, + 714.0, + 1839.0, + 714.0, + 1872.0, + 688.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1839.0, + 743.0, + 1839.0, + 743.0, + 1872.0, + 717.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 745.0, + 1837.0, + 774.0, + 1837.0, + 774.0, + 1872.0, + 745.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 1837.0, + 861.0, + 1837.0, + 861.0, + 1872.0, + 804.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1839.0, + 891.0, + 1839.0, + 891.0, + 1872.0, + 865.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1839.0, + 920.0, + 1839.0, + 920.0, + 1872.0, + 894.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 1839.0, + 949.0, + 1839.0, + 949.0, + 1872.0, + 923.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1839.0, + 978.0, + 1839.0, + 978.0, + 1872.0, + 954.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 1840.0, + 1008.0, + 1840.0, + 1008.0, + 1872.0, + 982.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 1839.0, + 1038.0, + 1839.0, + 1038.0, + 1872.0, + 1012.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 1839.0, + 1066.0, + 1839.0, + 1066.0, + 1872.0, + 1040.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 1839.0, + 1095.0, + 1839.0, + 1095.0, + 1872.0, + 1070.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 1839.0, + 1125.0, + 1839.0, + 1125.0, + 1872.0, + 1100.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1128.0, + 1839.0, + 1154.0, + 1839.0, + 1154.0, + 1872.0, + 1128.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 1839.0, + 1184.0, + 1839.0, + 1184.0, + 1872.0, + 1158.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1839.0, + 1212.0, + 1839.0, + 1212.0, + 1872.0, + 1187.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1839.0, + 1242.0, + 1839.0, + 1242.0, + 1872.0, + 1217.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1839.0, + 1273.0, + 1839.0, + 1273.0, + 1872.0, + 1247.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1274.0, + 1839.0, + 1301.0, + 1839.0, + 1301.0, + 1872.0, + 1274.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1302.0, + 1840.0, + 1332.0, + 1840.0, + 1332.0, + 1872.0, + 1302.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1837.0, + 1391.0, + 1837.0, + 1391.0, + 1871.0, + 1364.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 1871.0, + 391.0, + 1871.0, + 391.0, + 1897.0, + 346.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1868.0, + 418.0, + 1868.0, + 418.0, + 1899.0, + 395.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1868.0, + 448.0, + 1868.0, + 448.0, + 1899.0, + 423.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 452.0, + 1868.0, + 478.0, + 1868.0, + 478.0, + 1899.0, + 452.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1868.0, + 508.0, + 1868.0, + 508.0, + 1899.0, + 483.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 511.0, + 1868.0, + 537.0, + 1868.0, + 537.0, + 1899.0, + 511.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1868.0, + 565.0, + 1868.0, + 565.0, + 1899.0, + 541.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1868.0, + 596.0, + 1868.0, + 596.0, + 1902.0, + 570.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 1867.0, + 627.0, + 1867.0, + 627.0, + 1899.0, + 597.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1868.0, + 656.0, + 1868.0, + 656.0, + 1901.0, + 630.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1868.0, + 684.0, + 1868.0, + 684.0, + 1899.0, + 658.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 1868.0, + 742.0, + 1868.0, + 742.0, + 1899.0, + 688.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1868.0, + 773.0, + 1868.0, + 773.0, + 1899.0, + 746.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 1867.0, + 834.0, + 1867.0, + 834.0, + 1901.0, + 804.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1868.0, + 861.0, + 1868.0, + 861.0, + 1899.0, + 835.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 1868.0, + 891.0, + 1868.0, + 891.0, + 1899.0, + 866.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1868.0, + 920.0, + 1868.0, + 920.0, + 1899.0, + 894.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 1868.0, + 950.0, + 1868.0, + 950.0, + 1899.0, + 924.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1868.0, + 977.0, + 1868.0, + 977.0, + 1901.0, + 954.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 1868.0, + 1007.0, + 1868.0, + 1007.0, + 1897.0, + 982.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 1868.0, + 1036.0, + 1868.0, + 1036.0, + 1901.0, + 1012.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 1868.0, + 1066.0, + 1868.0, + 1066.0, + 1902.0, + 1041.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.0, + 1870.0, + 1096.0, + 1870.0, + 1096.0, + 1899.0, + 1071.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 1868.0, + 1125.0, + 1868.0, + 1125.0, + 1901.0, + 1100.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1868.0, + 1154.0, + 1868.0, + 1154.0, + 1899.0, + 1129.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 1870.0, + 1184.0, + 1870.0, + 1184.0, + 1899.0, + 1158.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1868.0, + 1212.0, + 1868.0, + 1212.0, + 1899.0, + 1187.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.0, + 1867.0, + 1244.0, + 1867.0, + 1244.0, + 1899.0, + 1214.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 1868.0, + 1271.0, + 1868.0, + 1271.0, + 1899.0, + 1247.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 1868.0, + 1301.0, + 1868.0, + 1301.0, + 1899.0, + 1275.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 1868.0, + 1331.0, + 1868.0, + 1331.0, + 1899.0, + 1305.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1335.0, + 1866.0, + 1361.0, + 1866.0, + 1361.0, + 1899.0, + 1335.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1677.0, + 565.0, + 1677.0, + 565.0, + 1695.0, + 541.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.25, + 1677.0, + 712.25, + 1677.0, + 712.25, + 1695.0, + 688.25, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.75, + 1676.0, + 741.75, + 1676.0, + 741.75, + 1695.0, + 716.75, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1189.0, + 1677.0, + 1210.0, + 1677.0, + 1210.0, + 1694.5, + 1189.0, + 1694.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.75, + 1676.0, + 1239.75, + 1676.0, + 1239.75, + 1695.0, + 1217.75, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 2083.0, + 872.0, + 2083.0, + 872.0, + 2124.0, + 829.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1932.0, + 1156.0, + 1932.0, + 1156.0, + 1968.0, + 295.0, + 1968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1262.0, + 1932.0, + 1406.0, + 1932.0, + 1406.0, + 1968.0, + 1262.0, + 1968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1961.0, + 372.0, + 1961.0, + 372.0, + 1997.0, + 295.0, + 1997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1961.0, + 945.0, + 1961.0, + 945.0, + 1997.0, + 449.0, + 1997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 307.0, + 1150.0, + 307.0, + 1150.0, + 340.0, + 297.0, + 340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1256.0, + 307.0, + 1404.0, + 307.0, + 1404.0, + 340.0, + 1256.0, + 340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 339.0, + 1405.0, + 339.0, + 1405.0, + 372.0, + 295.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 368.0, + 1406.0, + 368.0, + 1406.0, + 405.0, + 293.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 400.0, + 1405.0, + 400.0, + 1405.0, + 433.0, + 295.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 426.0, + 1362.0, + 426.0, + 1362.0, + 466.0, + 293.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 486.0, + 1402.0, + 486.0, + 1402.0, + 522.0, + 367.0, + 522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 519.0, + 1016.0, + 519.0, + 1016.0, + 551.0, + 394.0, + 551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 557.0, + 1405.0, + 557.0, + 1405.0, + 594.0, + 370.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 591.0, + 501.0, + 591.0, + 501.0, + 624.0, + 394.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 557.0, + 591.0, + 580.0, + 591.0, + 580.0, + 624.0, + 557.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 591.0, + 668.0, + 591.0, + 668.0, + 624.0, + 640.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 763.0, + 591.0, + 798.0, + 591.0, + 798.0, + 624.0, + 763.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 591.0, + 1307.0, + 591.0, + 1307.0, + 624.0, + 892.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 631.0, + 1403.0, + 631.0, + 1403.0, + 665.0, + 384.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 661.0, + 487.0, + 661.0, + 487.0, + 697.0, + 393.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 661.0, + 576.0, + 661.0, + 576.0, + 697.0, + 530.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 661.0, + 746.0, + 661.0, + 746.0, + 697.0, + 699.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 884.0, + 661.0, + 1109.0, + 661.0, + 1109.0, + 697.0, + 884.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 704.0, + 646.0, + 704.0, + 646.0, + 737.0, + 368.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 721.0, + 704.0, + 1119.0, + 704.0, + 1119.0, + 737.0, + 721.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1163.0, + 704.0, + 1403.0, + 704.0, + 1403.0, + 737.0, + 1163.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 734.0, + 871.0, + 734.0, + 871.0, + 769.0, + 394.0, + 769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 229.0, + 487.0, + 229.0, + 487.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 502.0, + 229.0, + 821.0, + 229.0, + 821.0, + 265.0, + 502.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 229.0, + 1017.0, + 229.0, + 1017.0, + 265.0, + 840.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 229.0, + 1405.0, + 229.0, + 1405.0, + 265.0, + 1032.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 258.0, + 569.0, + 258.0, + 569.0, + 300.0, + 293.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 585.0, + 258.0, + 1343.0, + 258.0, + 1343.0, + 300.0, + 585.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1362.0, + 258.0, + 1373.0, + 258.0, + 1373.0, + 300.0, + 1362.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1932.0, + 1156.0, + 1932.0, + 1156.0, + 1968.0, + 295.0, + 1968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1262.0, + 1932.0, + 1406.0, + 1932.0, + 1406.0, + 1968.0, + 1262.0, + 1968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1961.0, + 372.0, + 1961.0, + 372.0, + 1997.0, + 295.0, + 1997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1961.0, + 945.0, + 1961.0, + 945.0, + 1997.0, + 449.0, + 1997.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 19, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/ByxXZpVtPB/ByxXZpVtPB.md b/parse/train/ByxXZpVtPB/ByxXZpVtPB.md new file mode 100644 index 0000000000000000000000000000000000000000..5c9c2ef86ffaa7fce669fe4a7863a1b95de2b550 --- /dev/null +++ b/parse/train/ByxXZpVtPB/ByxXZpVtPB.md @@ -0,0 +1,204 @@ +# HOMOGENEOUS LINEAR INEQUALITY CONSTRAINTS FOR NEURAL NETWORK ACTIVATIONS + +Anonymous authors Paper under double-blind review + +# ABSTRACT + +We propose a method to impose homogeneous linear inequality constraints of the form $A x \le 0$ on neural network activations. The proposed method allows a datadriven training approach to be combined with modeling prior knowledge about the task. One way to achieve this task is by means of a projection step at test time after unconstrained training. However, this is an expensive operation. By directly incorporating the constraints into the architecture, we can significantly speed-up inference at test time; for instance, our experiments show a speed-up of up to two orders of magnitude over a projection method. Our algorithm computes a suitable parameterization of the feasible set at initialization and uses standard variants of stochastic gradient descent to find solutions to the constrained network. Thus, the modeling constraints are always satisfied during training. Crucially, our approach avoids to solve an optimization problem at each training step or to manually trade-off data and constraint fidelity with additional hyperparameters. We consider constrained generative modeling as an important application domain and experimentally demonstrate the proposed method by constraining a variational autoencoder. + +# 1 INTRODUCTION + +Deep learning models (LeCun et al., 2015) have demonstrated remarkable success in tasks that require exploitation of subtle correlations, such as computer vision (Krizhevsky et al., 2012) and sequence learning (Sutskever et al., 2014). Typically, humans have strong prior knowledge about a task, e.g., based on symmetry, geometry, or physics. Learning such a priori assumptions in a purely data-driven manner is inefficient and, in some situations, may not be feasible at all. While certain prior knowledge was successfully imposed – for example translational symmetry through convolutional architectures (LeCun et al., 1998) – incorporating more general modeling assumptions in the training of deep networks remains an open challenge. Recently, generative neural networks have advanced significantly (Goodfellow et al., 2014; Kingma & Welling, 2014). With such models, controlling the generative process beyond a data-driven, black-box approach is particularly important. + +In this paper, we present a method to impose prior knowledge through homogeneous linear inequality constraints of the form $A x \le 0$ on the activations of deep learning models. We directly impose these constraints through a suitable parameterization of the feasible set. This has several advantages: + +• The constraints are hard-constraints in the sense that they are satisfied at any point during training and inference. +• Inference on the constrained network incurs no overhead compared to unconstrained inference. +• There is no manual trade-off between constraint satisfaction and data representation. + +In summary, the main contribution of our method is a reparameterization that incorporates homogeneous linear inequality hard-constraints on neural network activations and allows for efficient test time predictions, i.e., our method is faster up to two orders of magnitude. The model can be optimized by standard variants of stochastic gradient descent. As an application in generative modeling, we demonstrate that our method is able to produce authentic samples from a variational autoencoder while satisfying the imposed constraints. + +![](images/6ff2de8059afd1546259716b3fa3bcc6f284f19dca82e98544dec5426da694f1.jpg) +Figure 1: Samples drawn from a variational autoencoder trained on MNIST without constraints (left) and with a checkerboard constraint on the output domain (right). For a pixel intensity domain $[ - 1 , 1 ]$ , the checkerboard constraint forces the image tiles to have average positive or negative brightness. + +# 2 RELATED WORK + +Various works have introduced methods to impose some type of hard constraint on neural network activations. This differs from a classical constrained optimization problem (Nocedal & Wright, 2006) in that the constraints are on the image of a parameterized function rather than on the neural network parameters. + +Marquez-Neila et al. (2017) formulated generic differentiable equality constraints as soft constraints ´ and employed a Lagrangian approach to train their model. While this is a principled approach to constrained optimization, it does not scale well to practical deep neural network models with their vast number of parameters. To make their method computationally tractable, a subset of the constraints is selected at each training step. In addition, these constraints are locally linearized; thus, there is no guarantee that this subset will be satisfied after a parameter update. + +For the specific problem of weakly supervised segmentation, Pathak et al. (2015) proposed an optimization scheme that alternates between optimizing the deep learning model and fitting a constrained distribution to these intermediate models. However, this method involves solving a (convex) optimization problem at each training step. Furthermore, the overall convergence path depends on how the alternating optimization steps are combined, which introduces an additional hyperparameter that must be tuned. Briq et al. (2018) approached the weakly supervised segmentation problem with a layer that implements the orthogonal projection onto a simplex, thereby directly constraining the activations to a probability distribution. This optimization problem can be solved efficiently, but does not generalize to other types of inequality constraints. + +OptNet, an approach to solve a generic quadratic program as a differentiable network layer, was proposed by Amos & Kolter (2017). OptNet backpropagates through the first-order optimality conditions of the quadratic program, and linear inequality constraints can be enforced as a special case. The formulation is flexible; however, it scales cubically with the number of variables and constraints. Thus, it becomes prohibitively expensive to train large-scale deep learning models. + +Finally, several works have proposed handcrafted solutions for specific applications, such as skeleton prediction (Zhou et al., 2016) and prediction of rigid body motion (Byravan & Fox, 2017). In contrast, to avoid laborious architecture design, we argue for the value of generically modeling constraint classes. In practice, this makes constraint methods more accessible for a broader class of problems. + +Contribution In this work, we tackle the problem of imposing homogeneous linear inequality constraints on neural network activations. Rather than solving an optimization problem during training, we split this task into a feasibility step at initialization and an optimality step during training. At initialization, we compute a suitable parameterization of the constraint set (a polyhedral cone) and use the neural network training algorithm to find a good solution within this feasible set. Conceptually, we are trading-off computational cost during initialization to obtain a model that has no overhead at test time. The proposed method is implemented as a neural network layer that is specified by a set of homogeneous linear inequalities and whose output parameterizes the feasible set. + +We consider a generic $L$ layer neural network $F _ { \theta }$ with model parameters $\theta$ for inputs $x$ as follows: + +$$ +F _ { \theta } ( x ) = f _ { \theta _ { L } } ^ { ( L ) } ( \sigma ( f _ { \theta _ { L - 1 } } ^ { ( L - 1 ) } ( \sigma ( \dots f _ { \theta _ { 1 } } ^ { ( 1 ) } ( x ) \dots ) ) ) ) , +$$ + +where $f _ { \theta _ { l } } ^ { ( l ) }$ are affine functions, e.g., a fully-connected or convolutional layer, and $\sigma$ is an elementwise non-linearity1, e.g., a sigmoid or rectified linear unit (ReLU). In supervised learning, training targets $y$ are known and a loss $\mathcal { L } _ { y } ( F _ { \theta } ( x ) )$ is minimized as a function of the network parameters $\theta$ . A typical loss for a classification task is the cross entropy between the network output and the empirical target distribution, while the mean-squared error is commonly used for a regression task. The proposed method can be applied to constrain any linear activations $z ^ { ( l ) } = f _ { \theta _ { l } } ^ { ( l ) } ( a ^ { ( l - 1 ) } )$ or non-linear activations $a ^ { ( l ) } = \sigma ( z ^ { ( l ) } )$ . In most cases, one would like to constrain the output $F _ { \theta } ( x )$ . + +The feasible set for $m$ linear inequality constraints in $d$ dimensions is the convex polyhedron + +$$ +\mathcal { C } : = \left\{ z \bigg | A z \leq b , A \in \mathbb { R } ^ { m \times d } , b \in \mathbb { R } ^ { m } \right\} \subseteq \mathbb { R } ^ { d } . +$$ + +A suitable description of the convex polyhedron $\mathcal { C }$ is obtained by the decomposition theorem for polyhedra. + +Theorem 1 (Decomposition of polyhedra, Minkowski-Weyl). $A$ set $\mathcal { C } \subset \mathbb { R } ^ { d }$ is a convex polyhedron of the form (2) if and only $i f$ + +$$ +\begin{array} { l } { { \displaystyle { \mathcal C } = \mathrm { c o n v } \big ( \upsilon _ { 1 } , \ldots , \upsilon _ { n } \big ) + \mathrm { c o n e } \big ( r _ { 1 } , \ldots , r _ { s } \big ) } \ ~ } \\ { { \displaystyle ~ = \left\{ \sum _ { i = 1 } ^ { n } \lambda _ { i } \upsilon _ { i } + \sum _ { j = 1 } ^ { s } \mu _ { j } r _ { j } \bigg | \lambda _ { i } , \mu _ { j } \geq 0 , \sum _ { i = 1 } ^ { n } \lambda _ { i } = 1 \right\} } \ } \end{array} +$$ + +for finitely many vertices $\{ v _ { 1 } , \ldots , v _ { n } \}$ and rays $\{ r _ { 1 } , \ldots , r _ { s } \}$ + +Furthermore, $\mathcal { C } = \left\{ z | A z \leq 0 , A \in \mathbb { R } ^ { m \times d } \right\}$ if and only if + +$$ +\mathcal { C } = \mathrm { c o n e } ( r _ { 1 } , . . . , r _ { s } ) +$$ + +for finitely many rays $\{ r _ { 1 } , \ldots , r _ { s } \}$ + +The theorem states that an intersection of half-spaces (half-space or $\mathrm { H } \cdot$ -representation) can be written as the Minkowski sum of a convex combination of the polyhedron’s vertices and a conical combination of some rays (vertex or $\mathrm { V } .$ -representation). One can switch algorithmically between these two viewpoints via the double description method (Motzkin et al., 1953; Fukuda & Prodon, 1996), which we discuss in the following. Thus, the $\mathrm { H }$ -representation, which is natural when modeling inequality constraints, can be transformed into the V-representation, which can be incorporated into gradient-based neural network training. + +In this paper, we focus on homogeneous constraints of the form (4), for which the feasible set is a polyhedral cone. Due to the special structure of this set, we can avoid to work with the convex combination parameters in (3), which is numerically advantageous (Section 3.5), and we can efficiently combine modeling constraints and domain constraints, such as a $[ - 1 , 1 ]$ -pixel domain for images (Section 3.3). Such a polyhedral cone is shown in Figure 2. + +# 3.1 DOUBLE DESCRIPTION METHOD + +The double description method converts between the half-space and vertex representation of a system of linear inequalities. It was originally proposed by Motzkin et al. (1953) and further refined by Fukuda & Prodon (1996).2 Here, we are only interested in the conversion from $\mathrm { H } \cdot$ -representation to V-representation for homogeneous constraints (4), + +$$ +\mathcal { H } \to \mathrm { c o n e } ( r _ { 1 } , \dots , r _ { s } ) \ . +$$ + +![](images/e34f7d5efaaf63be07414ce913edd9a6616ef7e1dcd0ac505ab2653737bf016f.jpg) +Figure 2: Diagram illustrating an iteration of the double description method. Adding a constraint to the $k$ -constraint set $A ^ { k }$ at iteration $k + 1$ introduces a hyperplane $H$ . The intersection points of $H$ with the boundary of the current polyhedron $R ^ { k }$ (marked by $\circ ^ { \prime }$ ) are added as rays $r _ { 6 }$ and $r _ { 7 }$ to the polyhedral cone. The ray $r _ { 2 }$ is cut-off by the hyperplane $H$ and is removed from $R ^ { k }$ . The result is the next iterate Rk+1. + +The core algorithm proceeds as follows. Let the rows of $A$ define a set of homogeneous inequalities and let $R = [ r _ { 1 } , \ldots , r _ { s } ]$ be the matrix whose columns are the rays of the corresponding cone. Here, $( A , R )$ form a double description pair. The algorithm iteratively builds a double description pair $( A ^ { k + 1 } , R ^ { k + 1 } )$ from $( A ^ { k } , R ^ { k } )$ in the following manner. The rows in $A ^ { k }$ represent a $k$ -subset of the rows of $A$ and thus define a convex polyhedron associated with $R ^ { k }$ . Adding a single row to $A ^ { k }$ introduces an additional half-space constraint, which corresponds to a hyperplane. If the vector $r _ { i } - r _ { j }$ for two columns $r _ { i } , r _ { j }$ of $\bar { \boldsymbol { R } } ^ { k }$ intersects with this hyperplane then this intersection point is added to $R ^ { k }$ . Existing rays that are cut-off by the additional hyperplane are removed from $R ^ { k }$ . The result is the double description pair $( A ^ { k + 1 } , \dot { R } ^ { k + 1 } )$ . This procedure is shown in Figure 2. + +Adding a hyperplane might drastically increase the number of rays in intermediate representations, which, in turn, contribute combinatorically in the subsequent iteration. In fact, there exist worst case polyhedra for which the algorithm has exponential run time as a function of the number of inequalities and the input dimension, as well as the number of rays (Dyer, 1983; Bremner, 1999). Overall, one can expect the algorithm to be efficient only for problems with a reasonably small number $m$ of inequalities and dimension $d$ . + +# 3.2 INTEGRATION IN NEURAL NETWORK ARCHITECTURES + +We parameterize the homogeneous form (4) via a neural network layer. This layer takes as input some (latent) representation of the data, which is mapped to activations satisfying the desired hard constraints. The algorithm is provided with the $_ \mathrm { H }$ -representation of linear inequality constraints, i.e., a matrix $A \in \breve { \mathbb { R } } ^ { m \times d }$ for $m$ constraints in $d$ dimensions to specify the feasible set (4). At initialization, we convert this to the $\mathrm { V } .$ -representation via the double description method (Section 3.1). This corresponds to computing the set of rays $\{ r _ { 1 } , \ldots , r _ { s } \}$ to represent the polyhedral cone. During training, the neural network training algorithm is used to optimize within in the feasible set. There are two critical aspects in this procedure. First, as outlined in Section 3.1, the run-time complexity of the double description method may be prohibitive. Conceptually, the proposed approach allows for significant compute time at initialization to obtain an algorithm that is very efficient at training and test time. Second, we must ensure that the mapping from the latent representation to the parameters integrates well with the training algorithm. We assume that the model is trained with gradient-based backpropagation, as is common for current deep learning applications. The constraint layer comprises a batch normalization layer and an affine mapping (fully-connected layer with biases) followed by the element-wise absolute value function that ensures the non-negativity required by the conical combination parameters. In theory, any function $f : \mathbb { R } \to \mathbb { R } _ { \geq 0 }$ would fulfill this requirement; however, care must be taken to not interfere with backpropagated gradients. + +# 3.3 COMBINING MODELING AND DOMAIN CONSTRAINTS + +Domain constraints are often formulated as unit box constraints, $B : = \{ x \in \mathbb { R } ^ { d } | - 1 \leq x _ { i } \leq 1 \}$ , such as a pixel domain for images. Box constraints are particularly unfit to be converted using the double description method because the number of vertices is exponential in the dimension. Therefore, we distinguish modeling constraints and domain constraints and only convert the former into $\mathrm { V } .$ - representation. Based on this representation, we obtain a point in the modeling constraint set, $x \in { \mathcal { C } }$ . However, this point may not be in the unit box $\boldsymbol { B }$ . To arrive at a point in the intersection $\mathcal { C } \cap \mathcal { B }$ , we normalize $x$ by its infinity norm if $x \notin B$ , $\hat { x } = x / \operatorname* { m a x } \{ \| x \| _ { \infty } , 1 \bar \}$ . Indeed, $\hat { x } \in \mathcal { C } \cap B$ since scaling by a positive constant remains in the cone, i.e., if $x \in { \mathcal { C } }$ , then $\alpha x \in \mathcal { C } \forall \alpha \geq 0$ . + +# 3.4 APPLICATIONS OF HOMOGENEOUS LINEAR INEQUALITY CONSTRAINTS + +A natural application of constraints of the form $A x \le 0$ is a parameterization of a set of binary classifiers. If each row $a _ { i }$ of $A$ is such a binary classifier, then the method presented in this paper parameterizes the set $\{ x | a _ { i } ^ { T } x \le 0 \ \forall i \}$ . Consequently, it can be guaranteed that neural network activations satisfy a set of binary criteria. Another domain is to express certain direct relations between neural network activations. Notably, one can guarantee mathematical properties such as monotonicity via $x _ { i + 1 } \geq x _ { i }$ and convexity via $x _ { i + 1 } - 2 x _ { i } + x _ { i - 1 } \geq 0$ . + +# 3.5 EXTENSION TO GENERAL LINEAR INEQUALITY CONSTRAINTS + +The proposed method takes advantage of the special structure of a polyhedral cone to efficiently combine modeling and domain constraints (Section 3.3). General linear inequality constraints of the form $A x \leq b$ without restrictions on $A$ and $b$ possibly require the conic and convex component of (3) for their $\mathrm { v } .$ -representation. The main approach of this paper may be used in this case, i.e., our layer additionally needs to predict convex combination parameters. However, we observed slow convergence, which we ascribe to the simplex parameterization for the convex combination parameters. We used a softmax function $f ( x ) _ { i } = { \mathrm { { \bar { e x p } } } ( x _ { i } ) } / { \sum _ { j = 1 } ^ { m } \exp ( x _ { j } ) }$ to enforce the constraints $\begin{array} { r } { \lambda _ { i } \ge 0 , \sum _ { i = 1 } ^ { m } \lambda _ { i } = 1 } \end{array}$ of the convex combination parameters in (3). This function has vanishing gradients when one $x _ { i }$ is significantly greater than the other vector entries. Furthermore, this most general setting does not allow for efficient incorporation of domain constraints, as this would require an efficient parameterization of the intersection of a general convex polyhedron and the unit box. + +# 4 NUMERICAL RESULTS + +We compare the proposed constraint parameterization algorithm with an algorithm that trains without constraints, but requires a projection step at test time. We call this latter algorithm test time projection. We analyze these algorithms in two different settings. In an initial experiment, we learn the orthogonal projection onto a constraint set to demonstrate properties of these algorithms. Here, the result can be compared to the optimal solution of the convex optimization problem. In a second experiment, consistent with our motivation to constrain the output of generative models, we apply these algorithms to a variational autoencoder. Finally, we evaluate the running time of inference for these problems and show that the proposed algorithm is significantly more efficient compared to the test time projection method. + +We used the MNIST dataset (LeCun et al.) for both experiments (59000 training, 1000 validation, and 10000 test samples). We chose PyTorch (Paszke et al., 2017) for our implementation3 and all experiments were performed on a single Nvidia Titan X GPU. All networks were optimized with the Adam optimizer and we evaluated learning rates in the range $[ 1 0 ^ { - 5 } , 1 0 ^ { - 3 } ]$ . The initial learning rate was annealed by a factor of $1 / 2$ if progress on the validation loss stagnated for more than 5 epochs. We used OSQP (Stellato et al., 2017) as an efficient solver to compute orthogonal projections. + +Both experiments were performed with a checkerboard constraint with 16 tiles, where neighboring tiles are constrained to be on average either below or above pixel domain midpoint. For a $[ - 1 , 1 ]$ -pixel domain, the tiles’ average intensity is positive or negative, respectively. The initial computational cost of converting these constraints into $\mathrm { v } .$ -representation via the double description method is negligible (less than 1s). We observed that it is numerically advantageous to activate unit box scaling after the constraint parameterization model was initially optimized only with modeling constraints for a specified number of epochs. + +One might consider OptNet (Amos & Kolter, 2017) and an analogous version of the method introduced by Pathak et al. (2015) as baselines. However, these approaches incur a significant drawback for the setup presented in this paper as they are are computationally expensive at training time. An OptNet layer solves a generic quadratic program as a differentiable network layer, which scales cubically with the number of variables and constraints. The method by Pathak et al. (2015) for the regression problems in this paper alternates between optimization steps in the network parameters via a variant of stochastic gradient descent and projecting the network output onto the constraints, which is computationally expensive. + +# 4.1 ORTHOGONAL PROJECTION ONTO A CONSTRAINT SET + +We learn an orthogonal projection to demonstrate general properties of both algorithms. For given linear inequalities specified in H-representation, we solve the following problem: + +$$ +\operatorname* { m i n } _ { z \in \mathbb { R } ^ { d } } \left\| z - y \right\| _ { 2 } \quad \mathrm { s . t . } A z \leq 0 \qquad , +$$ + +where $y$ is an MNIST image. Here, the problem is convex; therefore, the global optimum can be readily computed and compared to the performance of the learning algorithms. In this setting, we can expect that training an unconstrained network with subsequent projection onto the constraint set at test time yields good results, which can be seen as follows. Let $\begin{array} { r } { \mathcal { P } c ( y ) : = \arg \operatorname* { m i n } _ { z \in \mathcal { C } } \| z - y \| _ { 2 } } \end{array}$ be the orthogonal projection onto the constraint set $\mathcal { C }$ and denote the mean-squared error as $\mathcal { L } _ { y } ( x ) : =$ $\| x - y \| _ { 2 }$ . Both mappings are Lipschitz continuous with Lipschitz constant $L = 1$ . Consequently, for an output $\hat { y }$ of an unconstrained model, + +$$ +\begin{array} { r } { \displaystyle \Big | \mathcal { L } _ { y } ( \mathcal { P } _ { \mathcal { C } } ( \hat { y } ) ) - \mathcal { L } _ { y } ( \mathcal { P } _ { \mathcal { C } } ( y ) ) \Big | \le \left\| \mathcal { P } _ { \mathcal { C } } ( \hat { y } ) - \mathcal { P } _ { \mathcal { C } } ( y ) \right\| _ { 2 } \le \left\| \hat { y } - y \right\| _ { 2 } , } \end{array} +$$ + +where, by definition, the term $\mathcal { L } _ { y } ( \mathcal { P } c ( y ) )$ is the optimal value of problem (6). The training algorithm fits $\hat { y }$ to $y$ ; therefore, projecting the unconstrained output $\hat { y }$ onto the constraint set will yield an objective value that is close to the optimal value of the constrained optimization problem. + +To have a comparable number of parameters for both methods, we use a single fully-connected layer in both cases. For the unconstrained model, we employ an $F C ( 7 8 4 , 7 8 4 )$ layer, and for the constrained model we employ an $F C ( 7 8 4 , n _ { r } )$ layer with $n _ { r } = 1 5 5 2$ many rays to represent the constraint set in V-representation. Additionally, the constraint layer first applies a batch normalization operation (Ioffe & Szegedy, 2015). Both models were optimized with an initial learning rate of $1 0 ^ { - 4 }$ , which was annealed by a factor of 0.1 if progress on the validation loss stagnated for more than 5 epochs. The batch size was chosen to be 256. The unit box constraints were activated after 25 epochs. Additionally, the data for training the model with all constraints being active is shown. This mode eventually results in worse generalization. Figure 3 shows that the mean-squared validation objective for both algorithms converges close to the average optimum. The constraint parameterization method has a larger variance and optimality gap, which hints at the numerical difficulty of training the constrained network. To be precise, the best average validation error during training is within $9 \%$ of the optimum for the constraint parameterization method and within $1 \%$ of the optimum for the test time projection method. Figure 4 shows a test set sample and the respective output of the learned models. + +![](images/ccb26edf90e7c914ec8c93ff4de1521e67d3e69261ccf2961a943d7f3e77649f.jpg) +Figure 3: Mean-squared validation loss averaged over all pixels for 10 runs; shaded area denotes standard deviation. The objective function (6) is computed on a held-out validation set for the proposed constraint parameterization method and unconstrained optimization with subsequent test time projection. The average optimum over the validation set is obtained as a solution to a convex optimization problem. For the box delay curve, the box constraints are activated after 25 epochs (after $\sim \mathrm { 3 0 s }$ ), which results in better generalization. The best average validation error during training is within $9 \%$ of the optimum for the constraint parameterization method with box constraint delay and within $1 \%$ of the optimum for the test time projection method. + +![](images/49fc0106d7c90222b808e52dcf5a411c2b40977fc67fcc1408d6bbddb9492dbf.jpg) +Figure 4: Learning to solve the orthogonal projection onto a constraint set as defined in (6). From left to right: MNIST sample from a test set, optimal projection by solving a quadratic program, constraint parameterization model inference, and test time projection model inference. + +# 4.2 CONSTRAINED GENERATIVE MODELING WITH VARIATIONAL AUTOENCODERS + +Variational autoencoders (VAE) are a class of generative models that are jointly trained to encode observations into latent variables via an encoder or inference network and decode observations from latent variables using a decoder or generative network (Kingma & Welling, 2014). We base our implementation on (Baumgartner, 2018). The model has a fully-connected architecture: ¨ + +Here, $\mathrm { R e L U } ( x ) = \operatorname* { m a x } ( 0 , x )$ and the sigmoid non-linearity takes the form $\sigma ( x ) = 1 / ( 1 { + } \mathrm { e x p } ( - x ) )$ . In contrast to a standard VAE, we constrain the samples generated by the model to obey a checkerboard constraint. The model was optimized with an initial learning rate of $1 0 ^ { - 4 }$ , which was annealed by a factor of 0.1 if progress on the validation loss stagnated for more than 5 epochs. The batch size was chosen to be 64. The model was trained for 200 epochs while the unit box constraints were activated after 100 epochs. To generate images, we sample the latent space prior $z \sim \mathcal { N } ( 0 , I )$ and evaluate the decoding neural network (Figure 5). The model is able to sample authentic digits while obeying the checkerboard constraint. + +# 4.3 FAST INFERENCE WITH CONSTRAINED NEURAL NETWORKS + +The main advantage of the proposed method over a simple projection method is a vast speed-up at test time. Since the constraint is incorporated into the neural network architecture, a forward pass has almost no overhead compared to an unconstrained network. On the other hand, for a network that was trained without constraints, a final projection step is necessary; this requires solving a convex optimization problem, which is relatively costly. Table 1 shows inference times for both models for the above numerical experiments. The constraint parameterization approach is up to two orders of magnitude faster at test time compared to the test time projection algorithm. + +![](images/02f0cfe4745a3f1d0401396a1e80304dc0a37a9588d7f9d2d50cf658cde58b72.jpg) +Figure 5: Samples from a constrained variational autoencoder trained with the test time projection method and our constraint parameterization method. The images represent authentic digits while satisfying the imposed checkerboard constraint. Inference is significantly faster using our method. + +Table 1: Inference time for test time projection and constraint parameterization methods. Mean and standard deviation of running times are computed over 100 runs of 59000 samples with a batch size of 256. + +
METHODPROJECTIONVAE
Test time projection82±1 s40±1s
Constraint parameterization (ours)0.46 ± 0.02 s0.75 ± 0.04 s
+ +# 5 CONCLUSION + +To combine a data-driven task with modeling constraints, we have developed a method to impose homogeneous linear inequality constraints on neural network activations. At initialization, a suitable parameterization is computed and subsequently a standard variant of stochastic gradient descent is used to train the reparameterized network. In this way, we can efficiently guarantee that network activations – in the final or any intermediate layer – satisfy the constraints at any point during training. The main advantage of our method over simply projecting onto the feasible set after unconstrained training is a significant speed-up at test time of up to two orders of magnitude. An important application of the proposed method is generative modeling with prior assumptions. Therefore, we demonstrated experimentally that the proposed method can be used successfully to constrain the output of a variational autoencoder. Our method is implemented as a layer, which is simple to combine with existing and novel neural network architectures in modern deep learning frameworks and is therefore readily available in practice. + +# REFERENCES + +Brandon Amos and J. Zico Kolter. OptNet: Differentiable optimization as a layer in neural networks. In Proceedings of the 34th International Conference on Machine Learning (ICML 2017), pp. 136– 145, 2017. + +Tim Baumgartner.¨ VAE-CVAE-MNIST. https://github.com/timbmg/ VAE-CVAE-MNIST, 2018. commit: e4ba231. + +David Bremner. Incremental convex hull algorithms are not output sensitive. Discrete & Computational Geometry, 21(1):57–68, 1999. + +Rania Briq, Michael Moeller, and Juergen Gall. Convolutional Simplex Projection Network (CSPN) for Weakly Supervised Semantic Segmentation. BMVC 2018, 2018. + +Arunkumar Byravan and Dieter Fox. SE3-nets: Learning rigid body motion using deep neural networks. In 2017 IEEE International Conference on Robotics and Automation (ICRA), 2017. + +Martin E. Dyer. The complexity of vertex enumeration methods. Mathematics of Operations Research, 8(3):381–402, 1983. + +Komei Fukuda and Alain Prodon. Double description method revisited, pp. 91–111. Combinatorics and Computer Science: 8th Franco-Japanese and 4th Franco-Chinese Conference Brest, France, July 3–5, 1995 Selected Papers. Springer Berlin Heidelberg, 1996. + +Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. Generative adversarial nets. In Advances in Neural Information Processing Systems 27 (NIPS 2014), pp. 2672–2680. 2014. + +Sergey Ioffe and Christian Szegedy. Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift. In Proceedings of the 32nd International Conference on Machine Learning, volume 37, pp. 448–456. PMLR, 07–09 Jul 2015. + +Diederik Kingma and Max Welling. Auto-encoding variational bayes. In International Conference on Learning Representations (ICLR 2014), 2014. + +Alex Krizhevsky, Ilya Sutskever, and Geoffrey Hinton. ImageNet classification with deep convolutional neural networks. In Proceedings of the 25th International Conference of Neural Information Processing Systems (NIPS 2012), 2012. + +Yann LeCun, Corinna Cortes, and Christopher Burges. The MNIST database of handwritten digits. URL http://yann.lecun.com/exdb/mnist/. + +Yann LeCun, Leon Bottou, Yoshua Bengio, and Patrick Haffner. Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998. + +Yann LeCun, Yoshua Bengio, and Geoffrey Hinton. Deep learning. Nature, 521(7553):436–444, 2015. + +Pablo Marquez-Neila, Mathieu Salzmann, and Pascal Fua. Imposing hard constraints on deep net- ´ works: Promises and limitations. First Workshop on Negative Results in Computer Vision, CVPR 2017, 2017. + +T. S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. Thrall. The double description method. In Contributions to the Theory of Games II, volume 8 of Ann. of Math. Stud., pp. 51–73. Princeton University Press, 1953. + +Jorge Nocedal and Stephen Wright. Numerical Optimization. Springer Series in Operations Research and Financial Engineering. Springer, 2006. + +Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer. Automatic differentiation in PyTorch. Autodiff Workshop, NIPS 2017, 2017. + +Deepak Pathak, Philipp Krahenb ¨ uhl, and Trevor Darrell. Constrained Convolutional Neural Net- ¨ works for Weakly Supervised Segmentation. In International Conference on Computer Vision (ICCV 2015), 2015. + +Bartolomeo Stellato, Goran Banjac, Paul Goulart, Alberto Bemporad, and Stephen Boyd. OSQP: An Operator Splitting Solver for Quadratic Programs. ArXiv e-prints, 2017. + +Ilya Sutskever, Oriol Vinyals, and Quoc V Le. Sequence to Sequence Learning with Neural Networks. In Proceedings of the 27th International Conference of Neural Information Processing Systems (NIPS 2014), 2014. + +Xingyi Zhou, Xiao Sun, Wei Zhang, Shuang Liang, and Yichen Wei. Deep Kinematic Pose Regression. Workshop on Geometry Meets Deep Learning, ECCV 2016, 2016. \ No newline at end of file diff --git a/parse/train/ByxXZpVtPB/ByxXZpVtPB_content_list.json b/parse/train/ByxXZpVtPB/ByxXZpVtPB_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..9f8d5e6aaa14aaea23b16cc85f4cf9b9087957b1 --- /dev/null +++ b/parse/train/ByxXZpVtPB/ByxXZpVtPB_content_list.json @@ -0,0 +1,1079 @@ +[ + { + "type": "text", + "text": "HOMOGENEOUS LINEAR INEQUALITY CONSTRAINTS FOR NEURAL NETWORK ACTIVATIONS ", + "text_level": 1, + "bbox": [ + 176, + 98, + 823, + 146 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Anonymous authors Paper under double-blind review ", + "bbox": [ + 183, + 171, + 398, + 198 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 234, + 544, + 251 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "We propose a method to impose homogeneous linear inequality constraints of the form $A x \\le 0$ on neural network activations. The proposed method allows a datadriven training approach to be combined with modeling prior knowledge about the task. One way to achieve this task is by means of a projection step at test time after unconstrained training. However, this is an expensive operation. By directly incorporating the constraints into the architecture, we can significantly speed-up inference at test time; for instance, our experiments show a speed-up of up to two orders of magnitude over a projection method. Our algorithm computes a suitable parameterization of the feasible set at initialization and uses standard variants of stochastic gradient descent to find solutions to the constrained network. Thus, the modeling constraints are always satisfied during training. Crucially, our approach avoids to solve an optimization problem at each training step or to manually trade-off data and constraint fidelity with additional hyperparameters. We consider constrained generative modeling as an important application domain and experimentally demonstrate the proposed method by constraining a variational autoencoder. ", + "bbox": [ + 233, + 267, + 764, + 488 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 516, + 336, + 531 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Deep learning models (LeCun et al., 2015) have demonstrated remarkable success in tasks that require exploitation of subtle correlations, such as computer vision (Krizhevsky et al., 2012) and sequence learning (Sutskever et al., 2014). Typically, humans have strong prior knowledge about a task, e.g., based on symmetry, geometry, or physics. Learning such a priori assumptions in a purely data-driven manner is inefficient and, in some situations, may not be feasible at all. While certain prior knowledge was successfully imposed – for example translational symmetry through convolutional architectures (LeCun et al., 1998) – incorporating more general modeling assumptions in the training of deep networks remains an open challenge. Recently, generative neural networks have advanced significantly (Goodfellow et al., 2014; Kingma & Welling, 2014). With such models, controlling the generative process beyond a data-driven, black-box approach is particularly important. ", + "bbox": [ + 174, + 547, + 825, + 686 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In this paper, we present a method to impose prior knowledge through homogeneous linear inequality constraints of the form $A x \\le 0$ on the activations of deep learning models. We directly impose these constraints through a suitable parameterization of the feasible set. This has several advantages: ", + "bbox": [ + 176, + 694, + 825, + 736 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "• The constraints are hard-constraints in the sense that they are satisfied at any point during training and inference. \n• Inference on the constrained network incurs no overhead compared to unconstrained inference. \n• There is no manual trade-off between constraint satisfaction and data representation. ", + "bbox": [ + 215, + 747, + 825, + 828 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In summary, the main contribution of our method is a reparameterization that incorporates homogeneous linear inequality hard-constraints on neural network activations and allows for efficient test time predictions, i.e., our method is faster up to two orders of magnitude. The model can be optimized by standard variants of stochastic gradient descent. As an application in generative modeling, we demonstrate that our method is able to produce authentic samples from a variational autoencoder while satisfying the imposed constraints. ", + "bbox": [ + 174, + 840, + 825, + 924 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/6ff2de8059afd1546259716b3fa3bcc6f284f19dca82e98544dec5426da694f1.jpg", + "image_caption": [ + "Figure 1: Samples drawn from a variational autoencoder trained on MNIST without constraints (left) and with a checkerboard constraint on the output domain (right). For a pixel intensity domain $[ - 1 , 1 ]$ , the checkerboard constraint forces the image tiles to have average positive or negative brightness. " + ], + "image_footnote": [], + "bbox": [ + 356, + 101, + 637, + 203 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 310, + 341, + 327 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Various works have introduced methods to impose some type of hard constraint on neural network activations. This differs from a classical constrained optimization problem (Nocedal & Wright, 2006) in that the constraints are on the image of a parameterized function rather than on the neural network parameters. ", + "bbox": [ + 174, + 349, + 823, + 406 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Marquez-Neila et al. (2017) formulated generic differentiable equality constraints as soft constraints ´ and employed a Lagrangian approach to train their model. While this is a principled approach to constrained optimization, it does not scale well to practical deep neural network models with their vast number of parameters. To make their method computationally tractable, a subset of the constraints is selected at each training step. In addition, these constraints are locally linearized; thus, there is no guarantee that this subset will be satisfied after a parameter update. ", + "bbox": [ + 174, + 412, + 825, + 497 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "For the specific problem of weakly supervised segmentation, Pathak et al. (2015) proposed an optimization scheme that alternates between optimizing the deep learning model and fitting a constrained distribution to these intermediate models. However, this method involves solving a (convex) optimization problem at each training step. Furthermore, the overall convergence path depends on how the alternating optimization steps are combined, which introduces an additional hyperparameter that must be tuned. Briq et al. (2018) approached the weakly supervised segmentation problem with a layer that implements the orthogonal projection onto a simplex, thereby directly constraining the activations to a probability distribution. This optimization problem can be solved efficiently, but does not generalize to other types of inequality constraints. ", + "bbox": [ + 174, + 503, + 825, + 630 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "OptNet, an approach to solve a generic quadratic program as a differentiable network layer, was proposed by Amos & Kolter (2017). OptNet backpropagates through the first-order optimality conditions of the quadratic program, and linear inequality constraints can be enforced as a special case. The formulation is flexible; however, it scales cubically with the number of variables and constraints. Thus, it becomes prohibitively expensive to train large-scale deep learning models. ", + "bbox": [ + 174, + 636, + 823, + 705 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Finally, several works have proposed handcrafted solutions for specific applications, such as skeleton prediction (Zhou et al., 2016) and prediction of rigid body motion (Byravan & Fox, 2017). In contrast, to avoid laborious architecture design, we argue for the value of generically modeling constraint classes. In practice, this makes constraint methods more accessible for a broader class of problems. ", + "bbox": [ + 174, + 713, + 825, + 782 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Contribution In this work, we tackle the problem of imposing homogeneous linear inequality constraints on neural network activations. Rather than solving an optimization problem during training, we split this task into a feasibility step at initialization and an optimality step during training. At initialization, we compute a suitable parameterization of the constraint set (a polyhedral cone) and use the neural network training algorithm to find a good solution within this feasible set. Conceptually, we are trading-off computational cost during initialization to obtain a model that has no overhead at test time. The proposed method is implemented as a neural network layer that is specified by a set of homogeneous linear inequalities and whose output parameterizes the feasible set. ", + "bbox": [ + 174, + 811, + 825, + 924 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We consider a generic $L$ layer neural network $F _ { \\theta }$ with model parameters $\\theta$ for inputs $x$ as follows: ", + "bbox": [ + 171, + 132, + 816, + 147 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/0ea9f946da75e03aa20d0e9e0bf4f7ce7c4abdbc95f203880c817c6911ffa619.jpg", + "text": "$$\nF _ { \\theta } ( x ) = f _ { \\theta _ { L } } ^ { ( L ) } ( \\sigma ( f _ { \\theta _ { L - 1 } } ^ { ( L - 1 ) } ( \\sigma ( \\dots f _ { \\theta _ { 1 } } ^ { ( 1 ) } ( x ) \\dots ) ) ) ) ,\n$$", + "text_format": "latex", + "bbox": [ + 343, + 151, + 653, + 174 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where $f _ { \\theta _ { l } } ^ { ( l ) }$ are affine functions, e.g., a fully-connected or convolutional layer, and $\\sigma$ is an elementwise non-linearity1, e.g., a sigmoid or rectified linear unit (ReLU). In supervised learning, training targets $y$ are known and a loss $\\mathcal { L } _ { y } ( F _ { \\theta } ( x ) )$ is minimized as a function of the network parameters $\\theta$ . A typical loss for a classification task is the cross entropy between the network output and the empirical target distribution, while the mean-squared error is commonly used for a regression task. The proposed method can be applied to constrain any linear activations $z ^ { ( l ) } = f _ { \\theta _ { l } } ^ { ( l ) } ( a ^ { ( l - 1 ) } )$ or non-linear activations $a ^ { ( l ) } = \\sigma ( z ^ { ( l ) } )$ . In most cases, one would like to constrain the output $F _ { \\theta } ( x )$ . ", + "bbox": [ + 173, + 179, + 825, + 290 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The feasible set for $m$ linear inequality constraints in $d$ dimensions is the convex polyhedron ", + "bbox": [ + 174, + 295, + 781, + 310 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/948dee054635b23f991212ed43f04568c86d4c01a4fc9f9e26ec04531537dd24.jpg", + "text": "$$\n\\mathcal { C } : = \\left\\{ z \\bigg | A z \\leq b , A \\in \\mathbb { R } ^ { m \\times d } , b \\in \\mathbb { R } ^ { m } \\right\\} \\subseteq \\mathbb { R } ^ { d } .\n$$", + "text_format": "latex", + "bbox": [ + 339, + 314, + 656, + 356 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "A suitable description of the convex polyhedron $\\mathcal { C }$ is obtained by the decomposition theorem for polyhedra. ", + "bbox": [ + 173, + 358, + 823, + 387 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Theorem 1 (Decomposition of polyhedra, Minkowski-Weyl). $A$ set $\\mathcal { C } \\subset \\mathbb { R } ^ { d }$ is a convex polyhedron of the form (2) if and only $i f$ ", + "bbox": [ + 174, + 388, + 823, + 419 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/8ed8d31f28a2dfeb5fbe089d56a5410cabba0f133327c41c7397573ce679b99d.jpg", + "text": "$$\n\\begin{array} { l } { { \\displaystyle { \\mathcal C } = \\mathrm { c o n v } \\big ( \\upsilon _ { 1 } , \\ldots , \\upsilon _ { n } \\big ) + \\mathrm { c o n e } \\big ( r _ { 1 } , \\ldots , r _ { s } \\big ) } \\ ~ } \\\\ { { \\displaystyle ~ = \\left\\{ \\sum _ { i = 1 } ^ { n } \\lambda _ { i } \\upsilon _ { i } + \\sum _ { j = 1 } ^ { s } \\mu _ { j } r _ { j } \\bigg | \\lambda _ { i } , \\mu _ { j } \\geq 0 , \\sum _ { i = 1 } ^ { n } \\lambda _ { i } = 1 \\right\\} } \\ } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 323, + 421, + 673, + 491 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "for finitely many vertices $\\{ v _ { 1 } , \\ldots , v _ { n } \\}$ and rays $\\{ r _ { 1 } , \\ldots , r _ { s } \\}$ ", + "bbox": [ + 171, + 493, + 575, + 510 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Furthermore, $\\mathcal { C } = \\left\\{ z | A z \\leq 0 , A \\in \\mathbb { R } ^ { m \\times d } \\right\\}$ if and only if ", + "bbox": [ + 173, + 515, + 553, + 531 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/141c5be6d1de4af0a7e4ef915e90293fa419f7830888a5d6491eb626c5e933aa.jpg", + "text": "$$\n\\mathcal { C } = \\mathrm { c o n e } ( r _ { 1 } , . . . , r _ { s } )\n$$", + "text_format": "latex", + "bbox": [ + 426, + 536, + 571, + 553 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "for finitely many rays $\\{ r _ { 1 } , \\ldots , r _ { s } \\}$ ", + "bbox": [ + 173, + 556, + 403, + 571 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The theorem states that an intersection of half-spaces (half-space or $\\mathrm { H } \\cdot$ -representation) can be written as the Minkowski sum of a convex combination of the polyhedron’s vertices and a conical combination of some rays (vertex or $\\mathrm { V } .$ -representation). One can switch algorithmically between these two viewpoints via the double description method (Motzkin et al., 1953; Fukuda & Prodon, 1996), which we discuss in the following. Thus, the $\\mathrm { H }$ -representation, which is natural when modeling inequality constraints, can be transformed into the V-representation, which can be incorporated into gradient-based neural network training. ", + "bbox": [ + 173, + 580, + 825, + 679 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In this paper, we focus on homogeneous constraints of the form (4), for which the feasible set is a polyhedral cone. Due to the special structure of this set, we can avoid to work with the convex combination parameters in (3), which is numerically advantageous (Section 3.5), and we can efficiently combine modeling constraints and domain constraints, such as a $[ - 1 , 1 ]$ -pixel domain for images (Section 3.3). Such a polyhedral cone is shown in Figure 2. ", + "bbox": [ + 174, + 685, + 825, + 756 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.1 DOUBLE DESCRIPTION METHOD ", + "text_level": 1, + "bbox": [ + 176, + 772, + 437, + 786 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The double description method converts between the half-space and vertex representation of a system of linear inequalities. It was originally proposed by Motzkin et al. (1953) and further refined by Fukuda & Prodon (1996).2 Here, we are only interested in the conversion from $\\mathrm { H } \\cdot$ -representation to V-representation for homogeneous constraints (4), ", + "bbox": [ + 173, + 797, + 825, + 854 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/07953e3b7708217b360452246e0af32fd666d060d8d31f24becee732886e0ca0.jpg", + "text": "$$\n\\mathcal { H } \\to \\mathrm { c o n e } ( r _ { 1 } , \\dots , r _ { s } ) \\ .\n$$", + "text_format": "latex", + "bbox": [ + 416, + 858, + 580, + 875 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/e34f7d5efaaf63be07414ce913edd9a6616ef7e1dcd0ac505ab2653737bf016f.jpg", + "image_caption": [ + "Figure 2: Diagram illustrating an iteration of the double description method. Adding a constraint to the $k$ -constraint set $A ^ { k }$ at iteration $k + 1$ introduces a hyperplane $H$ . The intersection points of $H$ with the boundary of the current polyhedron $R ^ { k }$ (marked by $\\circ ^ { \\prime }$ ) are added as rays $r _ { 6 }$ and $r _ { 7 }$ to the polyhedral cone. The ray $r _ { 2 }$ is cut-off by the hyperplane $H$ and is removed from $R ^ { k }$ . The result is the next iterate Rk+1. " + ], + "image_footnote": [], + "bbox": [ + 277, + 103, + 710, + 301 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The core algorithm proceeds as follows. Let the rows of $A$ define a set of homogeneous inequalities and let $R = [ r _ { 1 } , \\ldots , r _ { s } ]$ be the matrix whose columns are the rays of the corresponding cone. Here, $( A , R )$ form a double description pair. The algorithm iteratively builds a double description pair $( A ^ { k + 1 } , R ^ { k + 1 } )$ from $( A ^ { k } , R ^ { k } )$ in the following manner. The rows in $A ^ { k }$ represent a $k$ -subset of the rows of $A$ and thus define a convex polyhedron associated with $R ^ { k }$ . Adding a single row to $A ^ { k }$ introduces an additional half-space constraint, which corresponds to a hyperplane. If the vector $r _ { i } - r _ { j }$ for two columns $r _ { i } , r _ { j }$ of $\\bar { \\boldsymbol { R } } ^ { k }$ intersects with this hyperplane then this intersection point is added to $R ^ { k }$ . Existing rays that are cut-off by the additional hyperplane are removed from $R ^ { k }$ . The result is the double description pair $( A ^ { k + 1 } , \\dot { R } ^ { k + 1 } )$ . This procedure is shown in Figure 2. ", + "bbox": [ + 174, + 416, + 825, + 544 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Adding a hyperplane might drastically increase the number of rays in intermediate representations, which, in turn, contribute combinatorically in the subsequent iteration. In fact, there exist worst case polyhedra for which the algorithm has exponential run time as a function of the number of inequalities and the input dimension, as well as the number of rays (Dyer, 1983; Bremner, 1999). Overall, one can expect the algorithm to be efficient only for problems with a reasonably small number $m$ of inequalities and dimension $d$ . ", + "bbox": [ + 174, + 550, + 825, + 633 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.2 INTEGRATION IN NEURAL NETWORK ARCHITECTURES ", + "text_level": 1, + "bbox": [ + 174, + 660, + 588, + 672 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We parameterize the homogeneous form (4) via a neural network layer. This layer takes as input some (latent) representation of the data, which is mapped to activations satisfying the desired hard constraints. The algorithm is provided with the $_ \\mathrm { H }$ -representation of linear inequality constraints, i.e., a matrix $A \\in \\breve { \\mathbb { R } } ^ { m \\times d }$ for $m$ constraints in $d$ dimensions to specify the feasible set (4). At initialization, we convert this to the $\\mathrm { V } .$ -representation via the double description method (Section 3.1). This corresponds to computing the set of rays $\\{ r _ { 1 } , \\ldots , r _ { s } \\}$ to represent the polyhedral cone. During training, the neural network training algorithm is used to optimize within in the feasible set. There are two critical aspects in this procedure. First, as outlined in Section 3.1, the run-time complexity of the double description method may be prohibitive. Conceptually, the proposed approach allows for significant compute time at initialization to obtain an algorithm that is very efficient at training and test time. Second, we must ensure that the mapping from the latent representation to the parameters integrates well with the training algorithm. We assume that the model is trained with gradient-based backpropagation, as is common for current deep learning applications. The constraint layer comprises a batch normalization layer and an affine mapping (fully-connected layer with biases) followed by the element-wise absolute value function that ensures the non-negativity required by the conical combination parameters. In theory, any function $f : \\mathbb { R } \\to \\mathbb { R } _ { \\geq 0 }$ would fulfill this requirement; however, care must be taken to not interfere with backpropagated gradients. ", + "bbox": [ + 173, + 688, + 825, + 924 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.3 COMBINING MODELING AND DOMAIN CONSTRAINTS ", + "text_level": 1, + "bbox": [ + 174, + 104, + 575, + 117 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Domain constraints are often formulated as unit box constraints, $B : = \\{ x \\in \\mathbb { R } ^ { d } | - 1 \\leq x _ { i } \\leq 1 \\}$ , such as a pixel domain for images. Box constraints are particularly unfit to be converted using the double description method because the number of vertices is exponential in the dimension. Therefore, we distinguish modeling constraints and domain constraints and only convert the former into $\\mathrm { V } .$ - representation. Based on this representation, we obtain a point in the modeling constraint set, $x \\in { \\mathcal { C } }$ . However, this point may not be in the unit box $\\boldsymbol { B }$ . To arrive at a point in the intersection $\\mathcal { C } \\cap \\mathcal { B }$ , we normalize $x$ by its infinity norm if $x \\notin B$ , $\\hat { x } = x / \\operatorname* { m a x } \\{ \\| x \\| _ { \\infty } , 1 \\bar \\}$ . Indeed, $\\hat { x } \\in \\mathcal { C } \\cap B$ since scaling by a positive constant remains in the cone, i.e., if $x \\in { \\mathcal { C } }$ , then $\\alpha x \\in \\mathcal { C } \\forall \\alpha \\geq 0$ . ", + "bbox": [ + 173, + 128, + 825, + 241 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.4 APPLICATIONS OF HOMOGENEOUS LINEAR INEQUALITY CONSTRAINTS ", + "text_level": 1, + "bbox": [ + 174, + 260, + 704, + 272 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "A natural application of constraints of the form $A x \\le 0$ is a parameterization of a set of binary classifiers. If each row $a _ { i }$ of $A$ is such a binary classifier, then the method presented in this paper parameterizes the set $\\{ x | a _ { i } ^ { T } x \\le 0 \\ \\forall i \\}$ . Consequently, it can be guaranteed that neural network activations satisfy a set of binary criteria. Another domain is to express certain direct relations between neural network activations. Notably, one can guarantee mathematical properties such as monotonicity via $x _ { i + 1 } \\geq x _ { i }$ and convexity via $x _ { i + 1 } - 2 x _ { i } + x _ { i - 1 } \\geq 0$ . ", + "bbox": [ + 174, + 284, + 825, + 368 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.5 EXTENSION TO GENERAL LINEAR INEQUALITY CONSTRAINTS ", + "text_level": 1, + "bbox": [ + 176, + 387, + 640, + 400 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The proposed method takes advantage of the special structure of a polyhedral cone to efficiently combine modeling and domain constraints (Section 3.3). General linear inequality constraints of the form $A x \\leq b$ without restrictions on $A$ and $b$ possibly require the conic and convex component of (3) for their $\\mathrm { v } .$ -representation. The main approach of this paper may be used in this case, i.e., our layer additionally needs to predict convex combination parameters. However, we observed slow convergence, which we ascribe to the simplex parameterization for the convex combination parameters. We used a softmax function $f ( x ) _ { i } = { \\mathrm { { \\bar { e x p } } } ( x _ { i } ) } / { \\sum _ { j = 1 } ^ { m } \\exp ( x _ { j } ) }$ to enforce the constraints $\\begin{array} { r } { \\lambda _ { i } \\ge 0 , \\sum _ { i = 1 } ^ { m } \\lambda _ { i } = 1 } \\end{array}$ of the convex combination parameters in (3). This function has vanishing gradients when one $x _ { i }$ is significantly greater than the other vector entries. Furthermore, this most general setting does not allow for efficient incorporation of domain constraints, as this would require an efficient parameterization of the intersection of a general convex polyhedron and the unit box. ", + "bbox": [ + 173, + 411, + 825, + 568 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4 NUMERICAL RESULTS ", + "text_level": 1, + "bbox": [ + 176, + 588, + 390, + 604 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We compare the proposed constraint parameterization algorithm with an algorithm that trains without constraints, but requires a projection step at test time. We call this latter algorithm test time projection. We analyze these algorithms in two different settings. In an initial experiment, we learn the orthogonal projection onto a constraint set to demonstrate properties of these algorithms. Here, the result can be compared to the optimal solution of the convex optimization problem. In a second experiment, consistent with our motivation to constrain the output of generative models, we apply these algorithms to a variational autoencoder. Finally, we evaluate the running time of inference for these problems and show that the proposed algorithm is significantly more efficient compared to the test time projection method. ", + "bbox": [ + 173, + 621, + 825, + 744 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We used the MNIST dataset (LeCun et al.) for both experiments (59000 training, 1000 validation, and 10000 test samples). We chose PyTorch (Paszke et al., 2017) for our implementation3 and all experiments were performed on a single Nvidia Titan X GPU. All networks were optimized with the Adam optimizer and we evaluated learning rates in the range $[ 1 0 ^ { - 5 } , 1 0 ^ { - 3 } ]$ . The initial learning rate was annealed by a factor of $1 / 2$ if progress on the validation loss stagnated for more than 5 epochs. We used OSQP (Stellato et al., 2017) as an efficient solver to compute orthogonal projections. ", + "bbox": [ + 174, + 752, + 823, + 837 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Both experiments were performed with a checkerboard constraint with 16 tiles, where neighboring tiles are constrained to be on average either below or above pixel domain midpoint. For a $[ - 1 , 1 ]$ -pixel domain, the tiles’ average intensity is positive or negative, respectively. The initial computational cost of converting these constraints into $\\mathrm { v } .$ -representation via the double description method is negligible (less than 1s). We observed that it is numerically advantageous to activate unit box scaling after the constraint parameterization model was initially optimized only with modeling constraints for a specified number of epochs. ", + "bbox": [ + 176, + 843, + 823, + 898 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 823, + 146 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "One might consider OptNet (Amos & Kolter, 2017) and an analogous version of the method introduced by Pathak et al. (2015) as baselines. However, these approaches incur a significant drawback for the setup presented in this paper as they are are computationally expensive at training time. An OptNet layer solves a generic quadratic program as a differentiable network layer, which scales cubically with the number of variables and constraints. The method by Pathak et al. (2015) for the regression problems in this paper alternates between optimization steps in the network parameters via a variant of stochastic gradient descent and projecting the network output onto the constraints, which is computationally expensive. ", + "bbox": [ + 174, + 151, + 825, + 265 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.1 ORTHOGONAL PROJECTION ONTO A CONSTRAINT SET ", + "text_level": 1, + "bbox": [ + 173, + 311, + 586, + 325 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We learn an orthogonal projection to demonstrate general properties of both algorithms. For given linear inequalities specified in H-representation, we solve the following problem: ", + "bbox": [ + 174, + 348, + 825, + 377 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/74fc678c3f170e82d36e5079493783b48948763b7547bae099077e8fe93f45c2.jpg", + "text": "$$\n\\operatorname* { m i n } _ { z \\in \\mathbb { R } ^ { d } } \\left\\| z - y \\right\\| _ { 2 } \\quad \\mathrm { s . t . } A z \\leq 0 \\qquad ,\n$$", + "text_format": "latex", + "bbox": [ + 385, + 410, + 612, + 435 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $y$ is an MNIST image. Here, the problem is convex; therefore, the global optimum can be readily computed and compared to the performance of the learning algorithms. In this setting, we can expect that training an unconstrained network with subsequent projection onto the constraint set at test time yields good results, which can be seen as follows. Let $\\begin{array} { r } { \\mathcal { P } c ( y ) : = \\arg \\operatorname* { m i n } _ { z \\in \\mathcal { C } } \\| z - y \\| _ { 2 } } \\end{array}$ be the orthogonal projection onto the constraint set $\\mathcal { C }$ and denote the mean-squared error as $\\mathcal { L } _ { y } ( x ) : =$ $\\| x - y \\| _ { 2 }$ . Both mappings are Lipschitz continuous with Lipschitz constant $L = 1$ . Consequently, for an output $\\hat { y }$ of an unconstrained model, ", + "bbox": [ + 173, + 467, + 825, + 566 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/920f3f8c46ba6ecacc05ead4128f3ba6ca78c605e3362ed6634c6044f0a99b5d.jpg", + "text": "$$\n\\begin{array} { r } { \\displaystyle \\Big | \\mathcal { L } _ { y } ( \\mathcal { P } _ { \\mathcal { C } } ( \\hat { y } ) ) - \\mathcal { L } _ { y } ( \\mathcal { P } _ { \\mathcal { C } } ( y ) ) \\Big | \\le \\left\\| \\mathcal { P } _ { \\mathcal { C } } ( \\hat { y } ) - \\mathcal { P } _ { \\mathcal { C } } ( y ) \\right\\| _ { 2 } \\le \\left\\| \\hat { y } - y \\right\\| _ { 2 } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 289, + 598, + 707, + 633 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where, by definition, the term $\\mathcal { L } _ { y } ( \\mathcal { P } c ( y ) )$ is the optimal value of problem (6). The training algorithm fits $\\hat { y }$ to $y$ ; therefore, projecting the unconstrained output $\\hat { y }$ onto the constraint set will yield an objective value that is close to the optimal value of the constrained optimization problem. ", + "bbox": [ + 173, + 665, + 825, + 709 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To have a comparable number of parameters for both methods, we use a single fully-connected layer in both cases. For the unconstrained model, we employ an $F C ( 7 8 4 , 7 8 4 )$ layer, and for the constrained model we employ an $F C ( 7 8 4 , n _ { r } )$ layer with $n _ { r } = 1 5 5 2$ many rays to represent the constraint set in V-representation. Additionally, the constraint layer first applies a batch normalization operation (Ioffe & Szegedy, 2015). Both models were optimized with an initial learning rate of $1 0 ^ { - 4 }$ , which was annealed by a factor of 0.1 if progress on the validation loss stagnated for more than 5 epochs. The batch size was chosen to be 256. The unit box constraints were activated after 25 epochs. Additionally, the data for training the model with all constraints being active is shown. This mode eventually results in worse generalization. Figure 3 shows that the mean-squared validation objective for both algorithms converges close to the average optimum. The constraint parameterization method has a larger variance and optimality gap, which hints at the numerical difficulty of training the constrained network. To be precise, the best average validation error during training is within $9 \\%$ of the optimum for the constraint parameterization method and within $1 \\%$ of the optimum for the test time projection method. Figure 4 shows a test set sample and the respective output of the learned models. ", + "bbox": [ + 173, + 715, + 825, + 924 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/ccb26edf90e7c914ec8c93ff4de1521e67d3e69261ccf2961a943d7f3e77649f.jpg", + "image_caption": [ + "Figure 3: Mean-squared validation loss averaged over all pixels for 10 runs; shaded area denotes standard deviation. The objective function (6) is computed on a held-out validation set for the proposed constraint parameterization method and unconstrained optimization with subsequent test time projection. The average optimum over the validation set is obtained as a solution to a convex optimization problem. For the box delay curve, the box constraints are activated after 25 epochs (after $\\sim \\mathrm { 3 0 s }$ ), which results in better generalization. The best average validation error during training is within $9 \\%$ of the optimum for the constraint parameterization method with box constraint delay and within $1 \\%$ of the optimum for the test time projection method. " + ], + "image_footnote": [], + "bbox": [ + 303, + 103, + 684, + 237 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/49fc0106d7c90222b808e52dcf5a411c2b40977fc67fcc1408d6bbddb9492dbf.jpg", + "image_caption": [ + "Figure 4: Learning to solve the orthogonal projection onto a constraint set as defined in (6). From left to right: MNIST sample from a test set, optimal projection by solving a quadratic program, constraint parameterization model inference, and test time projection model inference. " + ], + "image_footnote": [], + "bbox": [ + 207, + 395, + 787, + 500 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.2 CONSTRAINED GENERATIVE MODELING WITH VARIATIONAL AUTOENCODERS", + "text_level": 1, + "bbox": [ + 173, + 582, + 750, + 594 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Variational autoencoders (VAE) are a class of generative models that are jointly trained to encode observations into latent variables via an encoder or inference network and decode observations from latent variables using a decoder or generative network (Kingma & Welling, 2014). We base our implementation on (Baumgartner, 2018). The model has a fully-connected architecture: ¨ ", + "bbox": [ + 174, + 606, + 825, + 662 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Here, $\\mathrm { R e L U } ( x ) = \\operatorname* { m a x } ( 0 , x )$ and the sigmoid non-linearity takes the form $\\sigma ( x ) = 1 / ( 1 { + } \\mathrm { e x p } ( - x ) )$ . In contrast to a standard VAE, we constrain the samples generated by the model to obey a checkerboard constraint. The model was optimized with an initial learning rate of $1 0 ^ { - 4 }$ , which was annealed by a factor of 0.1 if progress on the validation loss stagnated for more than 5 epochs. The batch size was chosen to be 64. The model was trained for 200 epochs while the unit box constraints were activated after 100 epochs. To generate images, we sample the latent space prior $z \\sim \\mathcal { N } ( 0 , I )$ and evaluate the decoding neural network (Figure 5). The model is able to sample authentic digits while obeying the checkerboard constraint. ", + "bbox": [ + 174, + 712, + 825, + 824 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.3 FAST INFERENCE WITH CONSTRAINED NEURAL NETWORKS ", + "text_level": 1, + "bbox": [ + 179, + 842, + 625, + 856 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The main advantage of the proposed method over a simple projection method is a vast speed-up at test time. Since the constraint is incorporated into the neural network architecture, a forward pass has almost no overhead compared to an unconstrained network. On the other hand, for a network that was trained without constraints, a final projection step is necessary; this requires solving a convex optimization problem, which is relatively costly. Table 1 shows inference times for both models for the above numerical experiments. The constraint parameterization approach is up to two orders of magnitude faster at test time compared to the test time projection algorithm. ", + "bbox": [ + 174, + 867, + 823, + 924 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/02f0cfe4745a3f1d0401396a1e80304dc0a37a9588d7f9d2d50cf658cde58b72.jpg", + "image_caption": [ + "Figure 5: Samples from a constrained variational autoencoder trained with the test time projection method and our constraint parameterization method. The images represent authentic digits while satisfying the imposed checkerboard constraint. Inference is significantly faster using our method. " + ], + "image_footnote": [], + "bbox": [ + 187, + 99, + 803, + 308 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/bdbfdf545c0c3896e0aaa1f7c2727179f15affae2568d69cb68ede176ba81380.jpg", + "table_caption": [ + "Table 1: Inference time for test time projection and constraint parameterization methods. Mean and standard deviation of running times are computed over 100 runs of 59000 samples with a batch size of 256. " + ], + "table_footnote": [], + "table_body": "
METHODPROJECTIONVAE
Test time projection82±1 s40±1s
Constraint parameterization (ours)0.46 ± 0.02 s0.75 ± 0.04 s
", + "bbox": [ + 250, + 434, + 746, + 479 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 503, + 826, + 546 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "5 CONCLUSION ", + "text_level": 1, + "bbox": [ + 176, + 566, + 318, + 583 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To combine a data-driven task with modeling constraints, we have developed a method to impose homogeneous linear inequality constraints on neural network activations. At initialization, a suitable parameterization is computed and subsequently a standard variant of stochastic gradient descent is used to train the reparameterized network. In this way, we can efficiently guarantee that network activations – in the final or any intermediate layer – satisfy the constraints at any point during training. The main advantage of our method over simply projecting onto the feasible set after unconstrained training is a significant speed-up at test time of up to two orders of magnitude. An important application of the proposed method is generative modeling with prior assumptions. Therefore, we demonstrated experimentally that the proposed method can be used successfully to constrain the output of a variational autoencoder. Our method is implemented as a layer, which is simple to combine with existing and novel neural network architectures in modern deep learning frameworks and is therefore readily available in practice. ", + "bbox": [ + 173, + 598, + 825, + 765 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 174, + 103, + 287, + 117 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Brandon Amos and J. Zico Kolter. OptNet: Differentiable optimization as a layer in neural networks. In Proceedings of the 34th International Conference on Machine Learning (ICML 2017), pp. 136– 145, 2017. ", + "bbox": [ + 173, + 126, + 823, + 169 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Tim Baumgartner.¨ VAE-CVAE-MNIST. https://github.com/timbmg/ VAE-CVAE-MNIST, 2018. commit: e4ba231. ", + "bbox": [ + 168, + 178, + 821, + 208 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "David Bremner. Incremental convex hull algorithms are not output sensitive. Discrete & Computational Geometry, 21(1):57–68, 1999. ", + "bbox": [ + 171, + 217, + 823, + 246 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Rania Briq, Michael Moeller, and Juergen Gall. Convolutional Simplex Projection Network (CSPN) for Weakly Supervised Semantic Segmentation. BMVC 2018, 2018. ", + "bbox": [ + 169, + 256, + 823, + 285 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Arunkumar Byravan and Dieter Fox. SE3-nets: Learning rigid body motion using deep neural networks. In 2017 IEEE International Conference on Robotics and Automation (ICRA), 2017. ", + "bbox": [ + 173, + 294, + 823, + 324 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Martin E. Dyer. The complexity of vertex enumeration methods. Mathematics of Operations Research, 8(3):381–402, 1983. ", + "bbox": [ + 173, + 333, + 821, + 363 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Komei Fukuda and Alain Prodon. Double description method revisited, pp. 91–111. Combinatorics and Computer Science: 8th Franco-Japanese and 4th Franco-Chinese Conference Brest, France, July 3–5, 1995 Selected Papers. Springer Berlin Heidelberg, 1996. ", + "bbox": [ + 173, + 372, + 825, + 415 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. Generative adversarial nets. In Advances in Neural Information Processing Systems 27 (NIPS 2014), pp. 2672–2680. 2014. ", + "bbox": [ + 173, + 424, + 823, + 468 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Sergey Ioffe and Christian Szegedy. Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift. In Proceedings of the 32nd International Conference on Machine Learning, volume 37, pp. 448–456. PMLR, 07–09 Jul 2015. ", + "bbox": [ + 174, + 477, + 823, + 521 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Diederik Kingma and Max Welling. Auto-encoding variational bayes. In International Conference on Learning Representations (ICLR 2014), 2014. ", + "bbox": [ + 169, + 530, + 823, + 559 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Alex Krizhevsky, Ilya Sutskever, and Geoffrey Hinton. ImageNet classification with deep convolutional neural networks. In Proceedings of the 25th International Conference of Neural Information Processing Systems (NIPS 2012), 2012. ", + "bbox": [ + 174, + 568, + 823, + 612 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Yann LeCun, Corinna Cortes, and Christopher Burges. The MNIST database of handwritten digits. URL http://yann.lecun.com/exdb/mnist/. ", + "bbox": [ + 174, + 621, + 821, + 650 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Yann LeCun, Leon Bottou, Yoshua Bengio, and Patrick Haffner. Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998. ", + "bbox": [ + 174, + 660, + 823, + 689 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Yann LeCun, Yoshua Bengio, and Geoffrey Hinton. Deep learning. Nature, 521(7553):436–444, 2015. ", + "bbox": [ + 173, + 698, + 823, + 727 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Pablo Marquez-Neila, Mathieu Salzmann, and Pascal Fua. Imposing hard constraints on deep net- ´ works: Promises and limitations. First Workshop on Negative Results in Computer Vision, CVPR 2017, 2017. ", + "bbox": [ + 173, + 737, + 825, + 780 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "T. S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. Thrall. The double description method. In Contributions to the Theory of Games II, volume 8 of Ann. of Math. Stud., pp. 51–73. Princeton University Press, 1953. ", + "bbox": [ + 173, + 789, + 823, + 833 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Jorge Nocedal and Stephen Wright. Numerical Optimization. Springer Series in Operations Research and Financial Engineering. Springer, 2006. ", + "bbox": [ + 169, + 842, + 823, + 872 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer. Automatic differentiation in PyTorch. Autodiff Workshop, NIPS 2017, 2017. ", + "bbox": [ + 176, + 881, + 825, + 924 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Deepak Pathak, Philipp Krahenb ¨ uhl, and Trevor Darrell. Constrained Convolutional Neural Net- ¨ works for Weakly Supervised Segmentation. In International Conference on Computer Vision (ICCV 2015), 2015. ", + "bbox": [ + 173, + 103, + 823, + 146 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Bartolomeo Stellato, Goran Banjac, Paul Goulart, Alberto Bemporad, and Stephen Boyd. OSQP: An Operator Splitting Solver for Quadratic Programs. ArXiv e-prints, 2017. ", + "bbox": [ + 171, + 155, + 823, + 184 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ilya Sutskever, Oriol Vinyals, and Quoc V Le. Sequence to Sequence Learning with Neural Networks. In Proceedings of the 27th International Conference of Neural Information Processing Systems (NIPS 2014), 2014. ", + "bbox": [ + 174, + 193, + 823, + 234 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Xingyi Zhou, Xiao Sun, Wei Zhang, Shuang Liang, and Yichen Wei. Deep Kinematic Pose Regression. Workshop on Geometry Meets Deep Learning, ECCV 2016, 2016. ", + "bbox": [ + 173, + 244, + 823, + 272 + ], + "page_idx": 9 + } +] \ No newline at end of file diff --git a/parse/train/ByxXZpVtPB/ByxXZpVtPB_middle.json b/parse/train/ByxXZpVtPB/ByxXZpVtPB_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..3c1e63a86eb9eb538be672ab8c0dac1e614529fc --- /dev/null +++ b/parse/train/ByxXZpVtPB/ByxXZpVtPB_middle.json @@ -0,0 +1,25727 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 78, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 77, + 505, + 98 + ], + "spans": [ + { + "bbox": [ + 105, + 77, + 505, + 98 + ], + "score": 1.0, + "content": "HOMOGENEOUS LINEAR INEQUALITY CONSTRAINTS", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 97, + 393, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 97, + 393, + 118 + ], + "score": 1.0, + "content": "FOR NEURAL NETWORK ACTIVATIONS", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 112, + 136, + 244, + 157 + ], + "lines": [ + { + "bbox": [ + 113, + 136, + 201, + 147 + ], + "spans": [ + { + "bbox": [ + 113, + 136, + 201, + 147 + ], + "score": 1.0, + "content": "Anonymous authors", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 112, + 146, + 245, + 159 + ], + "spans": [ + { + "bbox": [ + 112, + 146, + 245, + 159 + ], + "score": 1.0, + "content": "Paper under double-blind review", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 278, + 186, + 333, + 199 + ], + "lines": [ + { + "bbox": [ + 277, + 186, + 335, + 200 + ], + "spans": [ + { + "bbox": [ + 277, + 186, + 335, + 200 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 143, + 212, + 468, + 387 + ], + "lines": [ + { + "bbox": [ + 141, + 212, + 469, + 225 + ], + "spans": [ + { + "bbox": [ + 141, + 212, + 469, + 225 + ], + "score": 1.0, + "content": "We propose a method to impose homogeneous linear inequality constraints of the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 223, + 470, + 235 + ], + "spans": [ + { + "bbox": [ + 141, + 223, + 164, + 235 + ], + "score": 1.0, + "content": "form", + "type": "text" + }, + { + "bbox": [ + 164, + 223, + 198, + 234 + ], + "score": 0.91, + "content": "A x \\le 0", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 223, + 470, + 235 + ], + "score": 1.0, + "content": "on neural network activations. The proposed method allows a data-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 233, + 470, + 246 + ], + "spans": [ + { + "bbox": [ + 141, + 233, + 470, + 246 + ], + "score": 1.0, + "content": "driven training approach to be combined with modeling prior knowledge about", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 244, + 469, + 257 + ], + "spans": [ + { + "bbox": [ + 141, + 244, + 469, + 257 + ], + "score": 1.0, + "content": "the task. One way to achieve this task is by means of a projection step at test time", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 255, + 469, + 268 + ], + "spans": [ + { + "bbox": [ + 141, + 255, + 469, + 268 + ], + "score": 1.0, + "content": "after unconstrained training. However, this is an expensive operation. By directly", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 266, + 469, + 280 + ], + "spans": [ + { + "bbox": [ + 141, + 266, + 469, + 280 + ], + "score": 1.0, + "content": "incorporating the constraints into the architecture, we can significantly speed-up", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 278, + 469, + 290 + ], + "spans": [ + { + "bbox": [ + 141, + 278, + 469, + 290 + ], + "score": 1.0, + "content": "inference at test time; for instance, our experiments show a speed-up of up to two", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 289, + 470, + 300 + ], + "spans": [ + { + "bbox": [ + 141, + 289, + 470, + 300 + ], + "score": 1.0, + "content": "orders of magnitude over a projection method. Our algorithm computes a suitable", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 300, + 470, + 311 + ], + "spans": [ + { + "bbox": [ + 141, + 300, + 470, + 311 + ], + "score": 1.0, + "content": "parameterization of the feasible set at initialization and uses standard variants of", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 311, + 470, + 322 + ], + "spans": [ + { + "bbox": [ + 141, + 311, + 470, + 322 + ], + "score": 1.0, + "content": "stochastic gradient descent to find solutions to the constrained network. Thus,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 321, + 469, + 334 + ], + "spans": [ + { + "bbox": [ + 141, + 321, + 469, + 334 + ], + "score": 1.0, + "content": "the modeling constraints are always satisfied during training. Crucially, our ap-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 332, + 469, + 345 + ], + "spans": [ + { + "bbox": [ + 141, + 332, + 469, + 345 + ], + "score": 1.0, + "content": "proach avoids to solve an optimization problem at each training step or to man-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 343, + 470, + 356 + ], + "spans": [ + { + "bbox": [ + 141, + 343, + 470, + 356 + ], + "score": 1.0, + "content": "ually trade-off data and constraint fidelity with additional hyperparameters. We", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 354, + 470, + 367 + ], + "spans": [ + { + "bbox": [ + 141, + 354, + 470, + 367 + ], + "score": 1.0, + "content": "consider constrained generative modeling as an important application domain and", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 365, + 470, + 378 + ], + "spans": [ + { + "bbox": [ + 141, + 365, + 470, + 378 + ], + "score": 1.0, + "content": "experimentally demonstrate the proposed method by constraining a variational", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 377, + 195, + 387 + ], + "spans": [ + { + "bbox": [ + 141, + 377, + 195, + 387 + ], + "score": 1.0, + "content": "autoencoder.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 12.5 + }, + { + "type": "title", + "bbox": [ + 108, + 409, + 206, + 421 + ], + "lines": [ + { + "bbox": [ + 105, + 408, + 208, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 408, + 208, + 425 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 107, + 434, + 505, + 544 + ], + "lines": [ + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "score": 1.0, + "content": "Deep learning models (LeCun et al., 2015) have demonstrated remarkable success in tasks that", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 444, + 506, + 458 + ], + "spans": [ + { + "bbox": [ + 104, + 444, + 506, + 458 + ], + "score": 1.0, + "content": "require exploitation of subtle correlations, such as computer vision (Krizhevsky et al., 2012) and", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 456, + 506, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 506, + 469 + ], + "score": 1.0, + "content": "sequence learning (Sutskever et al., 2014). Typically, humans have strong prior knowledge about a", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 466, + 505, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 505, + 481 + ], + "score": 1.0, + "content": "task, e.g., based on symmetry, geometry, or physics. Learning such a priori assumptions in a purely", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 477, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 505, + 491 + ], + "score": 1.0, + "content": "data-driven manner is inefficient and, in some situations, may not be feasible at all. While certain", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "score": 1.0, + "content": "prior knowledge was successfully imposed – for example translational symmetry through convolu-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 499, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 505, + 513 + ], + "score": 1.0, + "content": "tional architectures (LeCun et al., 1998) – incorporating more general modeling assumptions in the", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 510, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 510, + 506, + 525 + ], + "score": 1.0, + "content": "training of deep networks remains an open challenge. Recently, generative neural networks have", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 522, + 504, + 534 + ], + "spans": [ + { + "bbox": [ + 106, + 522, + 504, + 534 + ], + "score": 1.0, + "content": "advanced significantly (Goodfellow et al., 2014; Kingma & Welling, 2014). With such models, con-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 533, + 500, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 500, + 546 + ], + "score": 1.0, + "content": "trolling the generative process beyond a data-driven, black-box approach is particularly important.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 108, + 550, + 505, + 583 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 505, + 563 + ], + "score": 1.0, + "content": "In this paper, we present a method to impose prior knowledge through homogeneous linear inequal-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 560, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 213, + 574 + ], + "score": 1.0, + "content": "ity constraints of the form", + "type": "text" + }, + { + "bbox": [ + 214, + 561, + 248, + 572 + ], + "score": 0.91, + "content": "A x \\le 0", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 560, + 505, + 574 + ], + "score": 1.0, + "content": "on the activations of deep learning models. We directly impose", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "score": 1.0, + "content": "these constraints through a suitable parameterization of the feasible set. This has several advantages:", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 132, + 592, + 505, + 656 + ], + "lines": [ + { + "bbox": [ + 131, + 591, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 131, + 591, + 505, + 606 + ], + "score": 1.0, + "content": "• The constraints are hard-constraints in the sense that they are satisfied at any point during", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 141, + 604, + 234, + 616 + ], + "spans": [ + { + "bbox": [ + 141, + 604, + 234, + 616 + ], + "score": 1.0, + "content": "training and inference.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 131, + 617, + 505, + 631 + ], + "spans": [ + { + "bbox": [ + 131, + 617, + 505, + 631 + ], + "score": 1.0, + "content": "• Inference on the constrained network incurs no overhead compared to unconstrained infer-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 141, + 631, + 165, + 641 + ], + "spans": [ + { + "bbox": [ + 141, + 631, + 165, + 641 + ], + "score": 1.0, + "content": "ence.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 131, + 643, + 481, + 658 + ], + "spans": [ + { + "bbox": [ + 131, + 643, + 481, + 658 + ], + "score": 1.0, + "content": "• There is no manual trade-off between constraint satisfaction and data representation.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 666, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "In summary, the main contribution of our method is a reparameterization that incorporates homo-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "score": 1.0, + "content": "geneous linear inequality hard-constraints on neural network activations and allows for efficient test", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "time predictions, i.e., our method is faster up to two orders of magnitude. The model can be opti-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "mized by standard variants of stochastic gradient descent. As an application in generative modeling,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 710, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 721 + ], + "score": 1.0, + "content": "we demonstrate that our method is able to produce authentic samples from a variational autoencoder", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 720, + 271, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 271, + 733 + ], + "score": 1.0, + "content": "while satisfying the imposed constraints.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 42.5 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 303, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 308, + 761 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 308, + 761 + ], + "score": 1.0, + "content": "1", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 78, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 77, + 505, + 98 + ], + "spans": [ + { + "bbox": [ + 105, + 77, + 505, + 98 + ], + "score": 1.0, + "content": "HOMOGENEOUS LINEAR INEQUALITY CONSTRAINTS", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 97, + 393, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 97, + 393, + 118 + ], + "score": 1.0, + "content": "FOR NEURAL NETWORK ACTIVATIONS", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 112, + 136, + 244, + 157 + ], + "lines": [ + { + "bbox": [ + 113, + 136, + 201, + 147 + ], + "spans": [ + { + "bbox": [ + 113, + 136, + 201, + 147 + ], + "score": 1.0, + "content": "Anonymous authors", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 112, + 146, + 245, + 159 + ], + "spans": [ + { + "bbox": [ + 112, + 146, + 245, + 159 + ], + "score": 1.0, + "content": "Paper under double-blind review", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 112, + 136, + 245, + 159 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 186, + 333, + 199 + ], + "lines": [ + { + "bbox": [ + 277, + 186, + 335, + 200 + ], + "spans": [ + { + "bbox": [ + 277, + 186, + 335, + 200 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 143, + 212, + 468, + 387 + ], + "lines": [ + { + "bbox": [ + 141, + 212, + 469, + 225 + ], + "spans": [ + { + "bbox": [ + 141, + 212, + 469, + 225 + ], + "score": 1.0, + "content": "We propose a method to impose homogeneous linear inequality constraints of the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 223, + 470, + 235 + ], + "spans": [ + { + "bbox": [ + 141, + 223, + 164, + 235 + ], + "score": 1.0, + "content": "form", + "type": "text" + }, + { + "bbox": [ + 164, + 223, + 198, + 234 + ], + "score": 0.91, + "content": "A x \\le 0", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 223, + 470, + 235 + ], + "score": 1.0, + "content": "on neural network activations. The proposed method allows a data-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 233, + 470, + 246 + ], + "spans": [ + { + "bbox": [ + 141, + 233, + 470, + 246 + ], + "score": 1.0, + "content": "driven training approach to be combined with modeling prior knowledge about", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 244, + 469, + 257 + ], + "spans": [ + { + "bbox": [ + 141, + 244, + 469, + 257 + ], + "score": 1.0, + "content": "the task. One way to achieve this task is by means of a projection step at test time", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 255, + 469, + 268 + ], + "spans": [ + { + "bbox": [ + 141, + 255, + 469, + 268 + ], + "score": 1.0, + "content": "after unconstrained training. However, this is an expensive operation. By directly", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 266, + 469, + 280 + ], + "spans": [ + { + "bbox": [ + 141, + 266, + 469, + 280 + ], + "score": 1.0, + "content": "incorporating the constraints into the architecture, we can significantly speed-up", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 278, + 469, + 290 + ], + "spans": [ + { + "bbox": [ + 141, + 278, + 469, + 290 + ], + "score": 1.0, + "content": "inference at test time; for instance, our experiments show a speed-up of up to two", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 289, + 470, + 300 + ], + "spans": [ + { + "bbox": [ + 141, + 289, + 470, + 300 + ], + "score": 1.0, + "content": "orders of magnitude over a projection method. Our algorithm computes a suitable", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 300, + 470, + 311 + ], + "spans": [ + { + "bbox": [ + 141, + 300, + 470, + 311 + ], + "score": 1.0, + "content": "parameterization of the feasible set at initialization and uses standard variants of", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 311, + 470, + 322 + ], + "spans": [ + { + "bbox": [ + 141, + 311, + 470, + 322 + ], + "score": 1.0, + "content": "stochastic gradient descent to find solutions to the constrained network. Thus,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 321, + 469, + 334 + ], + "spans": [ + { + "bbox": [ + 141, + 321, + 469, + 334 + ], + "score": 1.0, + "content": "the modeling constraints are always satisfied during training. Crucially, our ap-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 332, + 469, + 345 + ], + "spans": [ + { + "bbox": [ + 141, + 332, + 469, + 345 + ], + "score": 1.0, + "content": "proach avoids to solve an optimization problem at each training step or to man-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 343, + 470, + 356 + ], + "spans": [ + { + "bbox": [ + 141, + 343, + 470, + 356 + ], + "score": 1.0, + "content": "ually trade-off data and constraint fidelity with additional hyperparameters. We", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 354, + 470, + 367 + ], + "spans": [ + { + "bbox": [ + 141, + 354, + 470, + 367 + ], + "score": 1.0, + "content": "consider constrained generative modeling as an important application domain and", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 365, + 470, + 378 + ], + "spans": [ + { + "bbox": [ + 141, + 365, + 470, + 378 + ], + "score": 1.0, + "content": "experimentally demonstrate the proposed method by constraining a variational", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 377, + 195, + 387 + ], + "spans": [ + { + "bbox": [ + 141, + 377, + 195, + 387 + ], + "score": 1.0, + "content": "autoencoder.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 12.5, + "bbox_fs": [ + 141, + 212, + 470, + 387 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 409, + 206, + 421 + ], + "lines": [ + { + "bbox": [ + 105, + 408, + 208, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 408, + 208, + 425 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 107, + 434, + 505, + 544 + ], + "lines": [ + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "score": 1.0, + "content": "Deep learning models (LeCun et al., 2015) have demonstrated remarkable success in tasks that", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 444, + 506, + 458 + ], + "spans": [ + { + "bbox": [ + 104, + 444, + 506, + 458 + ], + "score": 1.0, + "content": "require exploitation of subtle correlations, such as computer vision (Krizhevsky et al., 2012) and", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 456, + 506, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 506, + 469 + ], + "score": 1.0, + "content": "sequence learning (Sutskever et al., 2014). Typically, humans have strong prior knowledge about a", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 466, + 505, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 505, + 481 + ], + "score": 1.0, + "content": "task, e.g., based on symmetry, geometry, or physics. Learning such a priori assumptions in a purely", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 477, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 505, + 491 + ], + "score": 1.0, + "content": "data-driven manner is inefficient and, in some situations, may not be feasible at all. While certain", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "score": 1.0, + "content": "prior knowledge was successfully imposed – for example translational symmetry through convolu-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 499, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 505, + 513 + ], + "score": 1.0, + "content": "tional architectures (LeCun et al., 1998) – incorporating more general modeling assumptions in the", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 510, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 510, + 506, + 525 + ], + "score": 1.0, + "content": "training of deep networks remains an open challenge. Recently, generative neural networks have", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 522, + 504, + 534 + ], + "spans": [ + { + "bbox": [ + 106, + 522, + 504, + 534 + ], + "score": 1.0, + "content": "advanced significantly (Goodfellow et al., 2014; Kingma & Welling, 2014). With such models, con-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 533, + 500, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 500, + 546 + ], + "score": 1.0, + "content": "trolling the generative process beyond a data-driven, black-box approach is particularly important.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 26.5, + "bbox_fs": [ + 104, + 434, + 506, + 546 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 550, + 505, + 583 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 505, + 563 + ], + "score": 1.0, + "content": "In this paper, we present a method to impose prior knowledge through homogeneous linear inequal-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 560, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 213, + 574 + ], + "score": 1.0, + "content": "ity constraints of the form", + "type": "text" + }, + { + "bbox": [ + 214, + 561, + 248, + 572 + ], + "score": 0.91, + "content": "A x \\le 0", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 560, + 505, + 574 + ], + "score": 1.0, + "content": "on the activations of deep learning models. We directly impose", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "score": 1.0, + "content": "these constraints through a suitable parameterization of the feasible set. This has several advantages:", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33, + "bbox_fs": [ + 105, + 549, + 505, + 585 + ] + }, + { + "type": "list", + "bbox": [ + 132, + 592, + 505, + 656 + ], + "lines": [ + { + "bbox": [ + 131, + 591, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 131, + 591, + 505, + 606 + ], + "score": 1.0, + "content": "• The constraints are hard-constraints in the sense that they are satisfied at any point during", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 604, + 234, + 616 + ], + "spans": [ + { + "bbox": [ + 141, + 604, + 234, + 616 + ], + "score": 1.0, + "content": "training and inference.", + "type": "text" + } + ], + "index": 36, + "is_list_end_line": true + }, + { + "bbox": [ + 131, + 617, + 505, + 631 + ], + "spans": [ + { + "bbox": [ + 131, + 617, + 505, + 631 + ], + "score": 1.0, + "content": "• Inference on the constrained network incurs no overhead compared to unconstrained infer-", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 631, + 165, + 641 + ], + "spans": [ + { + "bbox": [ + 141, + 631, + 165, + 641 + ], + "score": 1.0, + "content": "ence.", + "type": "text" + } + ], + "index": 38, + "is_list_end_line": true + }, + { + "bbox": [ + 131, + 643, + 481, + 658 + ], + "spans": [ + { + "bbox": [ + 131, + 643, + 481, + 658 + ], + "score": 1.0, + "content": "• There is no manual trade-off between constraint satisfaction and data representation.", + "type": "text" + } + ], + "index": 39, + "is_list_start_line": true, + "is_list_end_line": true + } + ], + "index": 37, + "bbox_fs": [ + 131, + 591, + 505, + 658 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 666, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "In summary, the main contribution of our method is a reparameterization that incorporates homo-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "score": 1.0, + "content": "geneous linear inequality hard-constraints on neural network activations and allows for efficient test", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "time predictions, i.e., our method is faster up to two orders of magnitude. The model can be opti-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "mized by standard variants of stochastic gradient descent. As an application in generative modeling,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 710, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 721 + ], + "score": 1.0, + "content": "we demonstrate that our method is able to produce authentic samples from a variational autoencoder", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 720, + 271, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 271, + 733 + ], + "score": 1.0, + "content": "while satisfying the imposed constraints.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 42.5, + "bbox_fs": [ + 105, + 666, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 218, + 80, + 390, + 161 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 218, + 80, + 390, + 161 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 218, + 80, + 390, + 161 + ], + "spans": [ + { + "bbox": [ + 218, + 80, + 390, + 161 + ], + "score": 0.97, + "type": "image", + "image_path": "6ff2de8059afd1546259716b3fa3bcc6f284f19dca82e98544dec5426da694f1.jpg" + } + ] + } + ], + "index": 2.5, + "virtual_lines": [ + { + "bbox": [ + 218, + 80, + 390, + 93.5 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 218, + 93.5, + 390, + 107.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 218, + 107.0, + 390, + 120.5 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 218, + 120.5, + 390, + 134.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 218, + 134.0, + 390, + 147.5 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 218, + 147.5, + 390, + 161.0 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 173, + 506, + 217 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 173, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 105, + 173, + 505, + 184 + ], + "score": 1.0, + "content": "Figure 1: Samples drawn from a variational autoencoder trained on MNIST without constraints", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 183, + 504, + 195 + ], + "spans": [ + { + "bbox": [ + 106, + 183, + 504, + 195 + ], + "score": 1.0, + "content": "(left) and with a checkerboard constraint on the output domain (right). For a pixel intensity do-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 195, + 506, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 129, + 208 + ], + "score": 1.0, + "content": "main", + "type": "text" + }, + { + "bbox": [ + 129, + 195, + 158, + 207 + ], + "score": 0.87, + "content": "[ - 1 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 195, + 506, + 208 + ], + "score": 1.0, + "content": ", the checkerboard constraint forces the image tiles to have average positive or negative", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 204, + 154, + 219 + ], + "spans": [ + { + "bbox": [ + 104, + 204, + 154, + 219 + ], + "score": 1.0, + "content": "brightness.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7.5 + } + ], + "index": 5.0 + }, + { + "type": "title", + "bbox": [ + 108, + 246, + 209, + 259 + ], + "lines": [ + { + "bbox": [ + 105, + 245, + 210, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 210, + 261 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 277, + 504, + 322 + ], + "lines": [ + { + "bbox": [ + 105, + 277, + 506, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 506, + 290 + ], + "score": 1.0, + "content": "Various works have introduced methods to impose some type of hard constraint on neural network", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 289, + 505, + 301 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 505, + 301 + ], + "score": 1.0, + "content": "activations. This differs from a classical constrained optimization problem (Nocedal & Wright,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 299, + 506, + 313 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 506, + 313 + ], + "score": 1.0, + "content": "2006) in that the constraints are on the image of a parameterized function rather than on the neural", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 311, + 190, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 190, + 324 + ], + "score": 1.0, + "content": "network parameters.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 107, + 327, + 505, + 394 + ], + "lines": [ + { + "bbox": [ + 106, + 328, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 106, + 328, + 505, + 340 + ], + "score": 1.0, + "content": "Marquez-Neila et al. (2017) formulated generic differentiable equality constraints as soft constraints ´", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 339, + 505, + 352 + ], + "spans": [ + { + "bbox": [ + 105, + 339, + 505, + 352 + ], + "score": 1.0, + "content": "and employed a Lagrangian approach to train their model. While this is a principled approach", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 350, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 350, + 505, + 362 + ], + "score": 1.0, + "content": "to constrained optimization, it does not scale well to practical deep neural network models with", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 361, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 106, + 361, + 505, + 372 + ], + "score": 1.0, + "content": "their vast number of parameters. To make their method computationally tractable, a subset of the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 371, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 505, + 385 + ], + "score": 1.0, + "content": "constraints is selected at each training step. In addition, these constraints are locally linearized; thus,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 383, + 419, + 395 + ], + "spans": [ + { + "bbox": [ + 106, + 383, + 419, + 395 + ], + "score": 1.0, + "content": "there is no guarantee that this subset will be satisfied after a parameter update.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 107, + 399, + 505, + 499 + ], + "lines": [ + { + "bbox": [ + 105, + 399, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 505, + 412 + ], + "score": 1.0, + "content": "For the specific problem of weakly supervised segmentation, Pathak et al. (2015) proposed an opti-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 411, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 505, + 423 + ], + "score": 1.0, + "content": "mization scheme that alternates between optimizing the deep learning model and fitting a constrained", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "score": 1.0, + "content": "distribution to these intermediate models. However, this method involves solving a (convex) opti-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 432, + 506, + 446 + ], + "spans": [ + { + "bbox": [ + 104, + 432, + 506, + 446 + ], + "score": 1.0, + "content": "mization problem at each training step. Furthermore, the overall convergence path depends on how", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 444, + 506, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 506, + 457 + ], + "score": 1.0, + "content": "the alternating optimization steps are combined, which introduces an additional hyperparameter that", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 454, + 506, + 467 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 506, + 467 + ], + "score": 1.0, + "content": "must be tuned. Briq et al. (2018) approached the weakly supervised segmentation problem with a", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 465, + 505, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 505, + 479 + ], + "score": 1.0, + "content": "layer that implements the orthogonal projection onto a simplex, thereby directly constraining the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 476, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 476, + 505, + 489 + ], + "score": 1.0, + "content": "activations to a probability distribution. This optimization problem can be solved efficiently, but", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 488, + 343, + 500 + ], + "spans": [ + { + "bbox": [ + 106, + 488, + 343, + 500 + ], + "score": 1.0, + "content": "does not generalize to other types of inequality constraints.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 504, + 504, + 559 + ], + "lines": [ + { + "bbox": [ + 106, + 504, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 106, + 504, + 506, + 518 + ], + "score": 1.0, + "content": "OptNet, an approach to solve a generic quadratic program as a differentiable network layer, was", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 514, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 505, + 529 + ], + "score": 1.0, + "content": "proposed by Amos & Kolter (2017). OptNet backpropagates through the first-order optimality con-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 525, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 506, + 540 + ], + "score": 1.0, + "content": "ditions of the quadratic program, and linear inequality constraints can be enforced as a special case.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 536, + 505, + 550 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 505, + 550 + ], + "score": 1.0, + "content": "The formulation is flexible; however, it scales cubically with the number of variables and constraints.", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 547, + 439, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 547, + 439, + 561 + ], + "score": 1.0, + "content": "Thus, it becomes prohibitively expensive to train large-scale deep learning models.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 107, + 565, + 505, + 620 + ], + "lines": [ + { + "bbox": [ + 105, + 564, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 505, + 578 + ], + "score": 1.0, + "content": "Finally, several works have proposed handcrafted solutions for specific applications, such as skeleton", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 576, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 505, + 589 + ], + "score": 1.0, + "content": "prediction (Zhou et al., 2016) and prediction of rigid body motion (Byravan & Fox, 2017). In", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 104, + 585, + 506, + 601 + ], + "spans": [ + { + "bbox": [ + 104, + 585, + 506, + 601 + ], + "score": 1.0, + "content": "contrast, to avoid laborious architecture design, we argue for the value of generically modeling", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 598, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 505, + 610 + ], + "score": 1.0, + "content": "constraint classes. In practice, this makes constraint methods more accessible for a broader class of", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 104, + 609, + 149, + 621 + ], + "spans": [ + { + "bbox": [ + 104, + 609, + 149, + 621 + ], + "score": 1.0, + "content": "problems.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 643, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 642, + 504, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 642, + 504, + 657 + ], + "score": 1.0, + "content": "Contribution In this work, we tackle the problem of imposing homogeneous linear inequality con-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 653, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 653, + 505, + 668 + ], + "score": 1.0, + "content": "straints on neural network activations. Rather than solving an optimization problem during training,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "we split this task into a feasibility step at initialization and an optimality step during training. At ini-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "tialization, we compute a suitable parameterization of the constraint set (a polyhedral cone) and use", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "score": 1.0, + "content": "the neural network training algorithm to find a good solution within this feasible set. Conceptually,", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "we are trading-off computational cost during initialization to obtain a model that has no overhead at", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 710, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 506, + 722 + ], + "score": 1.0, + "content": "test time. The proposed method is implemented as a neural network layer that is specified by a set", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 721, + 444, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 444, + 733 + ], + "score": 1.0, + "content": "of homogeneous linear inequalities and whose output parameterizes the feasible set.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 43.5 + } + ], + "page_idx": 1, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "score": 1.0, + "content": "2", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 218, + 80, + 390, + 161 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 218, + 80, + 390, + 161 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 218, + 80, + 390, + 161 + ], + "spans": [ + { + "bbox": [ + 218, + 80, + 390, + 161 + ], + "score": 0.97, + "type": "image", + "image_path": "6ff2de8059afd1546259716b3fa3bcc6f284f19dca82e98544dec5426da694f1.jpg" + } + ] + } + ], + "index": 2.5, + "virtual_lines": [ + { + "bbox": [ + 218, + 80, + 390, + 93.5 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 218, + 93.5, + 390, + 107.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 218, + 107.0, + 390, + 120.5 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 218, + 120.5, + 390, + 134.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 218, + 134.0, + 390, + 147.5 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 218, + 147.5, + 390, + 161.0 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 173, + 506, + 217 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 173, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 105, + 173, + 505, + 184 + ], + "score": 1.0, + "content": "Figure 1: Samples drawn from a variational autoencoder trained on MNIST without constraints", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 183, + 504, + 195 + ], + "spans": [ + { + "bbox": [ + 106, + 183, + 504, + 195 + ], + "score": 1.0, + "content": "(left) and with a checkerboard constraint on the output domain (right). For a pixel intensity do-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 195, + 506, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 129, + 208 + ], + "score": 1.0, + "content": "main", + "type": "text" + }, + { + "bbox": [ + 129, + 195, + 158, + 207 + ], + "score": 0.87, + "content": "[ - 1 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 195, + 506, + 208 + ], + "score": 1.0, + "content": ", the checkerboard constraint forces the image tiles to have average positive or negative", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 204, + 154, + 219 + ], + "spans": [ + { + "bbox": [ + 104, + 204, + 154, + 219 + ], + "score": 1.0, + "content": "brightness.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7.5 + } + ], + "index": 5.0 + }, + { + "type": "title", + "bbox": [ + 108, + 246, + 209, + 259 + ], + "lines": [ + { + "bbox": [ + 105, + 245, + 210, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 210, + 261 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 277, + 504, + 322 + ], + "lines": [ + { + "bbox": [ + 105, + 277, + 506, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 506, + 290 + ], + "score": 1.0, + "content": "Various works have introduced methods to impose some type of hard constraint on neural network", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 289, + 505, + 301 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 505, + 301 + ], + "score": 1.0, + "content": "activations. This differs from a classical constrained optimization problem (Nocedal & Wright,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 299, + 506, + 313 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 506, + 313 + ], + "score": 1.0, + "content": "2006) in that the constraints are on the image of a parameterized function rather than on the neural", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 311, + 190, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 190, + 324 + ], + "score": 1.0, + "content": "network parameters.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 277, + 506, + 324 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 327, + 505, + 394 + ], + "lines": [ + { + "bbox": [ + 106, + 328, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 106, + 328, + 505, + 340 + ], + "score": 1.0, + "content": "Marquez-Neila et al. (2017) formulated generic differentiable equality constraints as soft constraints ´", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 339, + 505, + 352 + ], + "spans": [ + { + "bbox": [ + 105, + 339, + 505, + 352 + ], + "score": 1.0, + "content": "and employed a Lagrangian approach to train their model. While this is a principled approach", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 350, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 350, + 505, + 362 + ], + "score": 1.0, + "content": "to constrained optimization, it does not scale well to practical deep neural network models with", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 361, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 106, + 361, + 505, + 372 + ], + "score": 1.0, + "content": "their vast number of parameters. To make their method computationally tractable, a subset of the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 371, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 505, + 385 + ], + "score": 1.0, + "content": "constraints is selected at each training step. In addition, these constraints are locally linearized; thus,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 383, + 419, + 395 + ], + "spans": [ + { + "bbox": [ + 106, + 383, + 419, + 395 + ], + "score": 1.0, + "content": "there is no guarantee that this subset will be satisfied after a parameter update.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 328, + 505, + 395 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 399, + 505, + 499 + ], + "lines": [ + { + "bbox": [ + 105, + 399, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 505, + 412 + ], + "score": 1.0, + "content": "For the specific problem of weakly supervised segmentation, Pathak et al. (2015) proposed an opti-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 411, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 505, + 423 + ], + "score": 1.0, + "content": "mization scheme that alternates between optimizing the deep learning model and fitting a constrained", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "score": 1.0, + "content": "distribution to these intermediate models. However, this method involves solving a (convex) opti-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 432, + 506, + 446 + ], + "spans": [ + { + "bbox": [ + 104, + 432, + 506, + 446 + ], + "score": 1.0, + "content": "mization problem at each training step. Furthermore, the overall convergence path depends on how", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 444, + 506, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 506, + 457 + ], + "score": 1.0, + "content": "the alternating optimization steps are combined, which introduces an additional hyperparameter that", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 454, + 506, + 467 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 506, + 467 + ], + "score": 1.0, + "content": "must be tuned. Briq et al. (2018) approached the weakly supervised segmentation problem with a", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 465, + 505, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 505, + 479 + ], + "score": 1.0, + "content": "layer that implements the orthogonal projection onto a simplex, thereby directly constraining the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 476, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 476, + 505, + 489 + ], + "score": 1.0, + "content": "activations to a probability distribution. This optimization problem can be solved efficiently, but", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 488, + 343, + 500 + ], + "spans": [ + { + "bbox": [ + 106, + 488, + 343, + 500 + ], + "score": 1.0, + "content": "does not generalize to other types of inequality constraints.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 25, + "bbox_fs": [ + 104, + 399, + 506, + 500 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 504, + 504, + 559 + ], + "lines": [ + { + "bbox": [ + 106, + 504, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 106, + 504, + 506, + 518 + ], + "score": 1.0, + "content": "OptNet, an approach to solve a generic quadratic program as a differentiable network layer, was", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 514, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 505, + 529 + ], + "score": 1.0, + "content": "proposed by Amos & Kolter (2017). OptNet backpropagates through the first-order optimality con-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 525, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 506, + 540 + ], + "score": 1.0, + "content": "ditions of the quadratic program, and linear inequality constraints can be enforced as a special case.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 536, + 505, + 550 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 505, + 550 + ], + "score": 1.0, + "content": "The formulation is flexible; however, it scales cubically with the number of variables and constraints.", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 547, + 439, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 547, + 439, + 561 + ], + "score": 1.0, + "content": "Thus, it becomes prohibitively expensive to train large-scale deep learning models.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 504, + 506, + 561 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 565, + 505, + 620 + ], + "lines": [ + { + "bbox": [ + 105, + 564, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 505, + 578 + ], + "score": 1.0, + "content": "Finally, several works have proposed handcrafted solutions for specific applications, such as skeleton", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 576, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 505, + 589 + ], + "score": 1.0, + "content": "prediction (Zhou et al., 2016) and prediction of rigid body motion (Byravan & Fox, 2017). In", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 104, + 585, + 506, + 601 + ], + "spans": [ + { + "bbox": [ + 104, + 585, + 506, + 601 + ], + "score": 1.0, + "content": "contrast, to avoid laborious architecture design, we argue for the value of generically modeling", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 598, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 505, + 610 + ], + "score": 1.0, + "content": "constraint classes. In practice, this makes constraint methods more accessible for a broader class of", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 104, + 609, + 149, + 621 + ], + "spans": [ + { + "bbox": [ + 104, + 609, + 149, + 621 + ], + "score": 1.0, + "content": "problems.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37, + "bbox_fs": [ + 104, + 564, + 506, + 621 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 643, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 642, + 504, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 642, + 504, + 657 + ], + "score": 1.0, + "content": "Contribution In this work, we tackle the problem of imposing homogeneous linear inequality con-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 653, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 653, + 505, + 668 + ], + "score": 1.0, + "content": "straints on neural network activations. Rather than solving an optimization problem during training,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "we split this task into a feasibility step at initialization and an optimality step during training. At ini-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "tialization, we compute a suitable parameterization of the constraint set (a polyhedral cone) and use", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "score": 1.0, + "content": "the neural network training algorithm to find a good solution within this feasible set. Conceptually,", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "we are trading-off computational cost during initialization to obtain a model that has no overhead at", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 710, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 506, + 722 + ], + "score": 1.0, + "content": "test time. The proposed method is implemented as a neural network layer that is specified by a set", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 721, + 444, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 444, + 733 + ], + "score": 1.0, + "content": "of homogeneous linear inequalities and whose output parameterizes the feasible set.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 43.5, + "bbox_fs": [ + 105, + 642, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 105, + 500, + 117 + ], + "lines": [ + { + "bbox": [ + 106, + 104, + 500, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 197, + 119 + ], + "score": 1.0, + "content": "We consider a generic", + "type": "text" + }, + { + "bbox": [ + 197, + 106, + 205, + 115 + ], + "score": 0.83, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 104, + 291, + 119 + ], + "score": 1.0, + "content": "layer neural network", + "type": "text" + }, + { + "bbox": [ + 291, + 106, + 303, + 117 + ], + "score": 0.89, + "content": "F _ { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 104, + 398, + 119 + ], + "score": 1.0, + "content": "with model parameters", + "type": "text" + }, + { + "bbox": [ + 398, + 106, + 405, + 115 + ], + "score": 0.82, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 104, + 447, + 119 + ], + "score": 1.0, + "content": "for inputs", + "type": "text" + }, + { + "bbox": [ + 447, + 108, + 453, + 115 + ], + "score": 0.75, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 104, + 500, + 119 + ], + "score": 1.0, + "content": "as follows:", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 120, + 400, + 138 + ], + "lines": [ + { + "bbox": [ + 210, + 120, + 400, + 138 + ], + "spans": [ + { + "bbox": [ + 210, + 120, + 400, + 138 + ], + "score": 0.92, + "content": "F _ { \\theta } ( x ) = f _ { \\theta _ { L } } ^ { ( L ) } ( \\sigma ( f _ { \\theta _ { L - 1 } } ^ { ( L - 1 ) } ( \\sigma ( \\dots f _ { \\theta _ { 1 } } ^ { ( 1 ) } ( x ) \\dots ) ) ) ) ,", + "type": "interline_equation", + "image_path": "0ea9f946da75e03aa20d0e9e0bf4f7ce7c4abdbc95f203880c817c6911ffa619.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 210, + 120, + 400, + 138 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 142, + 505, + 230 + ], + "lines": [ + { + "bbox": [ + 106, + 141, + 505, + 159 + ], + "spans": [ + { + "bbox": [ + 106, + 141, + 133, + 159 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 141, + 150, + 158 + ], + "score": 0.94, + "content": "f _ { \\theta _ { l } } ^ { ( l ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 141, + 437, + 159 + ], + "score": 1.0, + "content": "are affine functions, e.g., a fully-connected or convolutional layer, and", + "type": "text" + }, + { + "bbox": [ + 437, + 147, + 444, + 154 + ], + "score": 0.72, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 141, + 505, + 159 + ], + "score": 1.0, + "content": "is an element-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 157, + 505, + 171 + ], + "spans": [ + { + "bbox": [ + 105, + 157, + 505, + 171 + ], + "score": 1.0, + "content": "wise non-linearity1, e.g., a sigmoid or rectified linear unit (ReLU). In supervised learning, training", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 168, + 505, + 181 + ], + "spans": [ + { + "bbox": [ + 106, + 168, + 135, + 181 + ], + "score": 1.0, + "content": "targets", + "type": "text" + }, + { + "bbox": [ + 135, + 171, + 142, + 180 + ], + "score": 0.78, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 168, + 227, + 181 + ], + "score": 1.0, + "content": "are known and a loss", + "type": "text" + }, + { + "bbox": [ + 227, + 169, + 272, + 181 + ], + "score": 0.92, + "content": "\\mathcal { L } _ { y } ( F _ { \\theta } ( x ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 168, + 485, + 181 + ], + "score": 1.0, + "content": "is minimized as a function of the network parameters", + "type": "text" + }, + { + "bbox": [ + 486, + 171, + 491, + 178 + ], + "score": 0.83, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 168, + 505, + 181 + ], + "score": 1.0, + "content": ". A", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 179, + 505, + 192 + ], + "spans": [ + { + "bbox": [ + 105, + 179, + 505, + 192 + ], + "score": 1.0, + "content": "typical loss for a classification task is the cross entropy between the network output and the empir-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 190, + 505, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 190, + 505, + 204 + ], + "score": 1.0, + "content": "ical target distribution, while the mean-squared error is commonly used for a regression task. The", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 102, + 197, + 509, + 223 + ], + "spans": [ + { + "bbox": [ + 102, + 197, + 373, + 223 + ], + "score": 1.0, + "content": "proposed method can be applied to constrain any linear activations", + "type": "text" + }, + { + "bbox": [ + 374, + 202, + 450, + 218 + ], + "score": 0.93, + "content": "z ^ { ( l ) } = f _ { \\theta _ { l } } ^ { ( l ) } ( a ^ { ( l - 1 ) } )", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 197, + 509, + 223 + ], + "score": 1.0, + "content": "or non-linear", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 216, + 455, + 231 + ], + "spans": [ + { + "bbox": [ + 105, + 216, + 152, + 231 + ], + "score": 1.0, + "content": "activations", + "type": "text" + }, + { + "bbox": [ + 152, + 216, + 208, + 230 + ], + "score": 0.94, + "content": "a ^ { ( l ) } = \\sigma ( z ^ { ( l ) } )", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 216, + 425, + 231 + ], + "score": 1.0, + "content": ". In most cases, one would like to constrain the output", + "type": "text" + }, + { + "bbox": [ + 426, + 219, + 450, + 230 + ], + "score": 0.93, + "content": "F _ { \\theta } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 216, + 455, + 231 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 234, + 478, + 246 + ], + "lines": [ + { + "bbox": [ + 105, + 233, + 478, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 233, + 186, + 248 + ], + "score": 1.0, + "content": "The feasible set for", + "type": "text" + }, + { + "bbox": [ + 186, + 237, + 196, + 245 + ], + "score": 0.78, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 233, + 320, + 248 + ], + "score": 1.0, + "content": "linear inequality constraints in", + "type": "text" + }, + { + "bbox": [ + 321, + 236, + 327, + 245 + ], + "score": 0.82, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 233, + 478, + 248 + ], + "score": 1.0, + "content": "dimensions is the convex polyhedron", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "interline_equation", + "bbox": [ + 208, + 249, + 402, + 282 + ], + "lines": [ + { + "bbox": [ + 208, + 249, + 402, + 282 + ], + "spans": [ + { + "bbox": [ + 208, + 249, + 402, + 282 + ], + "score": 0.93, + "content": "\\mathcal { C } : = \\left\\{ z \\bigg | A z \\leq b , A \\in \\mathbb { R } ^ { m \\times d } , b \\in \\mathbb { R } ^ { m } \\right\\} \\subseteq \\mathbb { R } ^ { d } .", + "type": "interline_equation", + "image_path": "948dee054635b23f991212ed43f04568c86d4c01a4fc9f9e26ec04531537dd24.jpg" + } + ] + } + ], + "index": 10.5, + "virtual_lines": [ + { + "bbox": [ + 208, + 249, + 402, + 265.5 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 208, + 265.5, + 402, + 282.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 284, + 504, + 307 + ], + "lines": [ + { + "bbox": [ + 105, + 283, + 505, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 283, + 306, + 297 + ], + "score": 1.0, + "content": "A suitable description of the convex polyhedron", + "type": "text" + }, + { + "bbox": [ + 307, + 285, + 314, + 294 + ], + "score": 0.82, + "content": "\\mathcal { C }", + "type": "inline_equation" + }, + { + "bbox": [ + 314, + 283, + 505, + 297 + ], + "score": 1.0, + "content": "is obtained by the decomposition theorem for", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 294, + 152, + 308 + ], + "spans": [ + { + "bbox": [ + 104, + 294, + 152, + 308 + ], + "score": 1.0, + "content": "polyhedra.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 107, + 308, + 504, + 332 + ], + "lines": [ + { + "bbox": [ + 105, + 307, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 355, + 322 + ], + "score": 1.0, + "content": "Theorem 1 (Decomposition of polyhedra, Minkowski-Weyl).", + "type": "text" + }, + { + "bbox": [ + 356, + 310, + 364, + 319 + ], + "score": 0.26, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 307, + 378, + 322 + ], + "score": 1.0, + "content": "set", + "type": "text" + }, + { + "bbox": [ + 379, + 308, + 411, + 320 + ], + "score": 0.91, + "content": "\\mathcal { C } \\subset \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 307, + 505, + 322 + ], + "score": 1.0, + "content": "is a convex polyhedron", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 320, + 220, + 333 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 212, + 333 + ], + "score": 1.0, + "content": "of the form (2) if and only", + "type": "text" + }, + { + "bbox": [ + 212, + 321, + 220, + 332 + ], + "score": 0.49, + "content": "i f", + "type": "inline_equation" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "interline_equation", + "bbox": [ + 198, + 334, + 412, + 389 + ], + "lines": [ + { + "bbox": [ + 198, + 334, + 412, + 389 + ], + "spans": [ + { + "bbox": [ + 198, + 334, + 412, + 389 + ], + "score": 0.92, + "content": "\\begin{array} { l } { { \\displaystyle { \\mathcal C } = \\mathrm { c o n v } \\big ( \\upsilon _ { 1 } , \\ldots , \\upsilon _ { n } \\big ) + \\mathrm { c o n e } \\big ( r _ { 1 } , \\ldots , r _ { s } \\big ) } \\ ~ } \\\\ { { \\displaystyle ~ = \\left\\{ \\sum _ { i = 1 } ^ { n } \\lambda _ { i } \\upsilon _ { i } + \\sum _ { j = 1 } ^ { s } \\mu _ { j } r _ { j } \\bigg | \\lambda _ { i } , \\mu _ { j } \\geq 0 , \\sum _ { i = 1 } ^ { n } \\lambda _ { i } = 1 \\right\\} } \\ } \\end{array}", + "type": "interline_equation", + "image_path": "8ed8d31f28a2dfeb5fbe089d56a5410cabba0f133327c41c7397573ce679b99d.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 198, + 334, + 412, + 352.3333333333333 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 198, + 352.3333333333333, + 412, + 370.66666666666663 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 198, + 370.66666666666663, + 412, + 388.99999999999994 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 391, + 352, + 404 + ], + "lines": [ + { + "bbox": [ + 104, + 389, + 349, + 406 + ], + "spans": [ + { + "bbox": [ + 104, + 389, + 208, + 406 + ], + "score": 1.0, + "content": "for finitely many vertices", + "type": "text" + }, + { + "bbox": [ + 208, + 391, + 261, + 403 + ], + "score": 0.94, + "content": "\\{ v _ { 1 } , \\ldots , v _ { n } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 389, + 299, + 406 + ], + "score": 1.0, + "content": "and rays", + "type": "text" + }, + { + "bbox": [ + 299, + 391, + 349, + 404 + ], + "score": 0.93, + "content": "\\{ r _ { 1 } , \\ldots , r _ { s } \\}", + "type": "inline_equation" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 106, + 408, + 339, + 421 + ], + "lines": [ + { + "bbox": [ + 105, + 405, + 339, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 162, + 425 + ], + "score": 1.0, + "content": "Furthermore,", + "type": "text" + }, + { + "bbox": [ + 163, + 408, + 282, + 422 + ], + "score": 0.91, + "content": "\\mathcal { C } = \\left\\{ z | A z \\leq 0 , A \\in \\mathbb { R } ^ { m \\times d } \\right\\}", + "type": "inline_equation" + }, + { + "bbox": [ + 283, + 405, + 339, + 425 + ], + "score": 1.0, + "content": "if and only if", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "interline_equation", + "bbox": [ + 261, + 425, + 350, + 438 + ], + "lines": [ + { + "bbox": [ + 261, + 425, + 350, + 438 + ], + "spans": [ + { + "bbox": [ + 261, + 425, + 350, + 438 + ], + "score": 0.9, + "content": "\\mathcal { C } = \\mathrm { c o n e } ( r _ { 1 } , . . . , r _ { s } )", + "type": "interline_equation", + "image_path": "141c5be6d1de4af0a7e4ef915e90293fa419f7830888a5d6491eb626c5e933aa.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 261, + 425, + 350, + 438 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 441, + 247, + 453 + ], + "lines": [ + { + "bbox": [ + 104, + 439, + 244, + 456 + ], + "spans": [ + { + "bbox": [ + 104, + 439, + 194, + 456 + ], + "score": 1.0, + "content": "for finitely many rays", + "type": "text" + }, + { + "bbox": [ + 194, + 441, + 244, + 453 + ], + "score": 0.93, + "content": "\\{ r _ { 1 } , \\ldots , r _ { s } \\}", + "type": "inline_equation" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 106, + 460, + 505, + 538 + ], + "lines": [ + { + "bbox": [ + 106, + 460, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 106, + 460, + 374, + 473 + ], + "score": 1.0, + "content": "The theorem states that an intersection of half-spaces (half-space or", + "type": "text" + }, + { + "bbox": [ + 375, + 461, + 383, + 471 + ], + "score": 0.27, + "content": "\\mathrm { H } \\cdot", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 460, + 505, + 473 + ], + "score": 1.0, + "content": "-representation) can be written", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 473, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 106, + 473, + 505, + 484 + ], + "score": 1.0, + "content": "as the Minkowski sum of a convex combination of the polyhedron’s vertices and a conical combi-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 483, + 505, + 495 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 235, + 495 + ], + "score": 1.0, + "content": "nation of some rays (vertex or", + "type": "text" + }, + { + "bbox": [ + 235, + 483, + 243, + 493 + ], + "score": 0.28, + "content": "\\mathrm { V } .", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 483, + 505, + 495 + ], + "score": 1.0, + "content": "-representation). One can switch algorithmically between these", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 493, + 505, + 506 + ], + "spans": [ + { + "bbox": [ + 106, + 493, + 505, + 506 + ], + "score": 1.0, + "content": "two viewpoints via the double description method (Motzkin et al., 1953; Fukuda & Prodon, 1996),", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 504, + 505, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 297, + 518 + ], + "score": 1.0, + "content": "which we discuss in the following. Thus, the", + "type": "text" + }, + { + "bbox": [ + 297, + 505, + 306, + 515 + ], + "score": 0.36, + "content": "\\mathrm { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 504, + 505, + 518 + ], + "score": 1.0, + "content": "-representation, which is natural when modeling", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 516, + 505, + 528 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 528 + ], + "score": 1.0, + "content": "inequality constraints, can be transformed into the V-representation, which can be incorporated into", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 527, + 265, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 265, + 540 + ], + "score": 1.0, + "content": "gradient-based neural network training.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 543, + 505, + 599 + ], + "lines": [ + { + "bbox": [ + 105, + 544, + 506, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 506, + 556 + ], + "score": 1.0, + "content": "In this paper, we focus on homogeneous constraints of the form (4), for which the feasible set is a", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 555, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 505, + 567 + ], + "score": 1.0, + "content": "polyhedral cone. Due to the special structure of this set, we can avoid to work with the convex com-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 566, + 504, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 566, + 504, + 578 + ], + "score": 1.0, + "content": "bination parameters in (3), which is numerically advantageous (Section 3.5), and we can efficiently", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 575, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 575, + 372, + 590 + ], + "score": 1.0, + "content": "combine modeling constraints and domain constraints, such as a", + "type": "text" + }, + { + "bbox": [ + 372, + 577, + 401, + 588 + ], + "score": 0.88, + "content": "[ - 1 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 575, + 505, + 590 + ], + "score": 1.0, + "content": "-pixel domain for images", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 587, + 345, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 345, + 601 + ], + "score": 1.0, + "content": "(Section 3.3). Such a polyhedral cone is shown in Figure 2.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32 + }, + { + "type": "title", + "bbox": [ + 108, + 612, + 268, + 623 + ], + "lines": [ + { + "bbox": [ + 106, + 612, + 269, + 624 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 269, + 624 + ], + "score": 1.0, + "content": "3.1 DOUBLE DESCRIPTION METHOD", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 106, + 632, + 505, + 677 + ], + "lines": [ + { + "bbox": [ + 106, + 631, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 505, + 646 + ], + "score": 1.0, + "content": "The double description method converts between the half-space and vertex representation of a sys-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 643, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 505, + 656 + ], + "score": 1.0, + "content": "tem of linear inequalities. It was originally proposed by Motzkin et al. (1953) and further refined by", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 425, + 668 + ], + "score": 1.0, + "content": "Fukuda & Prodon (1996).2 Here, we are only interested in the conversion from", + "type": "text" + }, + { + "bbox": [ + 425, + 655, + 434, + 664 + ], + "score": 0.3, + "content": "\\mathrm { H } \\cdot", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 654, + 506, + 668 + ], + "score": 1.0, + "content": "-representation to", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 665, + 309, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 665, + 309, + 678 + ], + "score": 1.0, + "content": "V-representation for homogeneous constraints (4),", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37.5 + }, + { + "type": "interline_equation", + "bbox": [ + 255, + 680, + 355, + 693 + ], + "lines": [ + { + "bbox": [ + 255, + 680, + 355, + 693 + ], + "spans": [ + { + "bbox": [ + 255, + 680, + 355, + 693 + ], + "score": 0.92, + "content": "\\mathcal { H } \\to \\mathrm { c o n e } ( r _ { 1 } , \\dots , r _ { s } ) \\ .", + "type": "interline_equation", + "image_path": "07953e3b7708217b360452246e0af32fd666d060d8d31f24becee732886e0ca0.jpg" + } + ] + } + ], + "index": 40, + "virtual_lines": [ + { + "bbox": [ + 255, + 680, + 355, + 693 + ], + "spans": [], + "index": 40 + } + ] + } + ], + "page_idx": 2, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 700, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 119, + 699, + 505, + 713 + ], + "spans": [ + { + "bbox": [ + 119, + 699, + 160, + 713 + ], + "score": 1.0, + "content": "1Formally,", + "type": "text" + }, + { + "bbox": [ + 160, + 703, + 167, + 710 + ], + "score": 0.62, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 699, + 505, + 713 + ], + "score": 1.0, + "content": "maps between different spaces for different layers and may also be a different element-wise", + "type": "text" + } + ] + }, + { + "bbox": [ + 105, + 710, + 403, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 403, + 722 + ], + "score": 1.0, + "content": "non-linearity for each layer. We omit such details in favor of notational simplicity.", + "type": "text" + } + ] + }, + { + "bbox": [ + 119, + 720, + 447, + 734 + ], + "spans": [ + { + "bbox": [ + 119, + 720, + 132, + 731 + ], + "score": 0.44, + "content": "^ 2 \\mathrm { I n }", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 720, + 447, + 734 + ], + "score": 1.0, + "content": "our experiments we use pycddlib, which is a Python wrapper of Fukuda’s cddlib.", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 106, + 26, + 308, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 308, + 39 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 308, + 39 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 104, + 82, + 464, + 94 + ], + "lines": [ + { + "bbox": [ + 104, + 81, + 466, + 97 + ], + "spans": [ + { + "bbox": [ + 104, + 81, + 466, + 97 + ], + "score": 1.0, + "content": "3 LINEAR INEQUALITY CONSTRAINTS FOR DEEP LEARNING MODELS", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 105, + 500, + 117 + ], + "lines": [ + { + "bbox": [ + 106, + 104, + 500, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 197, + 119 + ], + "score": 1.0, + "content": "We consider a generic", + "type": "text" + }, + { + "bbox": [ + 197, + 106, + 205, + 115 + ], + "score": 0.83, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 104, + 291, + 119 + ], + "score": 1.0, + "content": "layer neural network", + "type": "text" + }, + { + "bbox": [ + 291, + 106, + 303, + 117 + ], + "score": 0.89, + "content": "F _ { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 104, + 398, + 119 + ], + "score": 1.0, + "content": "with model parameters", + "type": "text" + }, + { + "bbox": [ + 398, + 106, + 405, + 115 + ], + "score": 0.82, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 104, + 447, + 119 + ], + "score": 1.0, + "content": "for inputs", + "type": "text" + }, + { + "bbox": [ + 447, + 108, + 453, + 115 + ], + "score": 0.75, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 104, + 500, + 119 + ], + "score": 1.0, + "content": "as follows:", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 104, + 500, + 119 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 120, + 400, + 138 + ], + "lines": [ + { + "bbox": [ + 210, + 120, + 400, + 138 + ], + "spans": [ + { + "bbox": [ + 210, + 120, + 400, + 138 + ], + "score": 0.92, + "content": "F _ { \\theta } ( x ) = f _ { \\theta _ { L } } ^ { ( L ) } ( \\sigma ( f _ { \\theta _ { L - 1 } } ^ { ( L - 1 ) } ( \\sigma ( \\dots f _ { \\theta _ { 1 } } ^ { ( 1 ) } ( x ) \\dots ) ) ) ) ,", + "type": "interline_equation", + "image_path": "0ea9f946da75e03aa20d0e9e0bf4f7ce7c4abdbc95f203880c817c6911ffa619.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 210, + 120, + 400, + 138 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 142, + 505, + 230 + ], + "lines": [ + { + "bbox": [ + 106, + 141, + 505, + 159 + ], + "spans": [ + { + "bbox": [ + 106, + 141, + 133, + 159 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 141, + 150, + 158 + ], + "score": 0.94, + "content": "f _ { \\theta _ { l } } ^ { ( l ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 141, + 437, + 159 + ], + "score": 1.0, + "content": "are affine functions, e.g., a fully-connected or convolutional layer, and", + "type": "text" + }, + { + "bbox": [ + 437, + 147, + 444, + 154 + ], + "score": 0.72, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 141, + 505, + 159 + ], + "score": 1.0, + "content": "is an element-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 157, + 505, + 171 + ], + "spans": [ + { + "bbox": [ + 105, + 157, + 505, + 171 + ], + "score": 1.0, + "content": "wise non-linearity1, e.g., a sigmoid or rectified linear unit (ReLU). In supervised learning, training", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 168, + 505, + 181 + ], + "spans": [ + { + "bbox": [ + 106, + 168, + 135, + 181 + ], + "score": 1.0, + "content": "targets", + "type": "text" + }, + { + "bbox": [ + 135, + 171, + 142, + 180 + ], + "score": 0.78, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 168, + 227, + 181 + ], + "score": 1.0, + "content": "are known and a loss", + "type": "text" + }, + { + "bbox": [ + 227, + 169, + 272, + 181 + ], + "score": 0.92, + "content": "\\mathcal { L } _ { y } ( F _ { \\theta } ( x ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 168, + 485, + 181 + ], + "score": 1.0, + "content": "is minimized as a function of the network parameters", + "type": "text" + }, + { + "bbox": [ + 486, + 171, + 491, + 178 + ], + "score": 0.83, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 168, + 505, + 181 + ], + "score": 1.0, + "content": ". A", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 179, + 505, + 192 + ], + "spans": [ + { + "bbox": [ + 105, + 179, + 505, + 192 + ], + "score": 1.0, + "content": "typical loss for a classification task is the cross entropy between the network output and the empir-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 190, + 505, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 190, + 505, + 204 + ], + "score": 1.0, + "content": "ical target distribution, while the mean-squared error is commonly used for a regression task. The", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 102, + 197, + 509, + 223 + ], + "spans": [ + { + "bbox": [ + 102, + 197, + 373, + 223 + ], + "score": 1.0, + "content": "proposed method can be applied to constrain any linear activations", + "type": "text" + }, + { + "bbox": [ + 374, + 202, + 450, + 218 + ], + "score": 0.93, + "content": "z ^ { ( l ) } = f _ { \\theta _ { l } } ^ { ( l ) } ( a ^ { ( l - 1 ) } )", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 197, + 509, + 223 + ], + "score": 1.0, + "content": "or non-linear", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 216, + 455, + 231 + ], + "spans": [ + { + "bbox": [ + 105, + 216, + 152, + 231 + ], + "score": 1.0, + "content": "activations", + "type": "text" + }, + { + "bbox": [ + 152, + 216, + 208, + 230 + ], + "score": 0.94, + "content": "a ^ { ( l ) } = \\sigma ( z ^ { ( l ) } )", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 216, + 425, + 231 + ], + "score": 1.0, + "content": ". In most cases, one would like to constrain the output", + "type": "text" + }, + { + "bbox": [ + 426, + 219, + 450, + 230 + ], + "score": 0.93, + "content": "F _ { \\theta } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 216, + 455, + 231 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5, + "bbox_fs": [ + 102, + 141, + 509, + 231 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 234, + 478, + 246 + ], + "lines": [ + { + "bbox": [ + 105, + 233, + 478, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 233, + 186, + 248 + ], + "score": 1.0, + "content": "The feasible set for", + "type": "text" + }, + { + "bbox": [ + 186, + 237, + 196, + 245 + ], + "score": 0.78, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 233, + 320, + 248 + ], + "score": 1.0, + "content": "linear inequality constraints in", + "type": "text" + }, + { + "bbox": [ + 321, + 236, + 327, + 245 + ], + "score": 0.82, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 233, + 478, + 248 + ], + "score": 1.0, + "content": "dimensions is the convex polyhedron", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 233, + 478, + 248 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 208, + 249, + 402, + 282 + ], + "lines": [ + { + "bbox": [ + 208, + 249, + 402, + 282 + ], + "spans": [ + { + "bbox": [ + 208, + 249, + 402, + 282 + ], + "score": 0.93, + "content": "\\mathcal { C } : = \\left\\{ z \\bigg | A z \\leq b , A \\in \\mathbb { R } ^ { m \\times d } , b \\in \\mathbb { R } ^ { m } \\right\\} \\subseteq \\mathbb { R } ^ { d } .", + "type": "interline_equation", + "image_path": "948dee054635b23f991212ed43f04568c86d4c01a4fc9f9e26ec04531537dd24.jpg" + } + ] + } + ], + "index": 10.5, + "virtual_lines": [ + { + "bbox": [ + 208, + 249, + 402, + 265.5 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 208, + 265.5, + 402, + 282.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 284, + 504, + 307 + ], + "lines": [ + { + "bbox": [ + 105, + 283, + 505, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 283, + 306, + 297 + ], + "score": 1.0, + "content": "A suitable description of the convex polyhedron", + "type": "text" + }, + { + "bbox": [ + 307, + 285, + 314, + 294 + ], + "score": 0.82, + "content": "\\mathcal { C }", + "type": "inline_equation" + }, + { + "bbox": [ + 314, + 283, + 505, + 297 + ], + "score": 1.0, + "content": "is obtained by the decomposition theorem for", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 294, + 152, + 308 + ], + "spans": [ + { + "bbox": [ + 104, + 294, + 152, + 308 + ], + "score": 1.0, + "content": "polyhedra.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 104, + 283, + 505, + 308 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 308, + 504, + 332 + ], + "lines": [ + { + "bbox": [ + 105, + 307, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 355, + 322 + ], + "score": 1.0, + "content": "Theorem 1 (Decomposition of polyhedra, Minkowski-Weyl).", + "type": "text" + }, + { + "bbox": [ + 356, + 310, + 364, + 319 + ], + "score": 0.26, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 307, + 378, + 322 + ], + "score": 1.0, + "content": "set", + "type": "text" + }, + { + "bbox": [ + 379, + 308, + 411, + 320 + ], + "score": 0.91, + "content": "\\mathcal { C } \\subset \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 307, + 505, + 322 + ], + "score": 1.0, + "content": "is a convex polyhedron", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 320, + 220, + 333 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 212, + 333 + ], + "score": 1.0, + "content": "of the form (2) if and only", + "type": "text" + }, + { + "bbox": [ + 212, + 321, + 220, + 332 + ], + "score": 0.49, + "content": "i f", + "type": "inline_equation" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 307, + 505, + 333 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 198, + 334, + 412, + 389 + ], + "lines": [ + { + "bbox": [ + 198, + 334, + 412, + 389 + ], + "spans": [ + { + "bbox": [ + 198, + 334, + 412, + 389 + ], + "score": 0.92, + "content": "\\begin{array} { l } { { \\displaystyle { \\mathcal C } = \\mathrm { c o n v } \\big ( \\upsilon _ { 1 } , \\ldots , \\upsilon _ { n } \\big ) + \\mathrm { c o n e } \\big ( r _ { 1 } , \\ldots , r _ { s } \\big ) } \\ ~ } \\\\ { { \\displaystyle ~ = \\left\\{ \\sum _ { i = 1 } ^ { n } \\lambda _ { i } \\upsilon _ { i } + \\sum _ { j = 1 } ^ { s } \\mu _ { j } r _ { j } \\bigg | \\lambda _ { i } , \\mu _ { j } \\geq 0 , \\sum _ { i = 1 } ^ { n } \\lambda _ { i } = 1 \\right\\} } \\ } \\end{array}", + "type": "interline_equation", + "image_path": "8ed8d31f28a2dfeb5fbe089d56a5410cabba0f133327c41c7397573ce679b99d.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 198, + 334, + 412, + 352.3333333333333 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 198, + 352.3333333333333, + 412, + 370.66666666666663 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 198, + 370.66666666666663, + 412, + 388.99999999999994 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 391, + 352, + 404 + ], + "lines": [ + { + "bbox": [ + 104, + 389, + 349, + 406 + ], + "spans": [ + { + "bbox": [ + 104, + 389, + 208, + 406 + ], + "score": 1.0, + "content": "for finitely many vertices", + "type": "text" + }, + { + "bbox": [ + 208, + 391, + 261, + 403 + ], + "score": 0.94, + "content": "\\{ v _ { 1 } , \\ldots , v _ { n } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 389, + 299, + 406 + ], + "score": 1.0, + "content": "and rays", + "type": "text" + }, + { + "bbox": [ + 299, + 391, + 349, + 404 + ], + "score": 0.93, + "content": "\\{ r _ { 1 } , \\ldots , r _ { s } \\}", + "type": "inline_equation" + } + ], + "index": 19 + } + ], + "index": 19, + "bbox_fs": [ + 104, + 389, + 349, + 406 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 408, + 339, + 421 + ], + "lines": [ + { + "bbox": [ + 105, + 405, + 339, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 162, + 425 + ], + "score": 1.0, + "content": "Furthermore,", + "type": "text" + }, + { + "bbox": [ + 163, + 408, + 282, + 422 + ], + "score": 0.91, + "content": "\\mathcal { C } = \\left\\{ z | A z \\leq 0 , A \\in \\mathbb { R } ^ { m \\times d } \\right\\}", + "type": "inline_equation" + }, + { + "bbox": [ + 283, + 405, + 339, + 425 + ], + "score": 1.0, + "content": "if and only if", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 405, + 339, + 425 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 261, + 425, + 350, + 438 + ], + "lines": [ + { + "bbox": [ + 261, + 425, + 350, + 438 + ], + "spans": [ + { + "bbox": [ + 261, + 425, + 350, + 438 + ], + "score": 0.9, + "content": "\\mathcal { C } = \\mathrm { c o n e } ( r _ { 1 } , . . . , r _ { s } )", + "type": "interline_equation", + "image_path": "141c5be6d1de4af0a7e4ef915e90293fa419f7830888a5d6491eb626c5e933aa.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 261, + 425, + 350, + 438 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 441, + 247, + 453 + ], + "lines": [ + { + "bbox": [ + 104, + 439, + 244, + 456 + ], + "spans": [ + { + "bbox": [ + 104, + 439, + 194, + 456 + ], + "score": 1.0, + "content": "for finitely many rays", + "type": "text" + }, + { + "bbox": [ + 194, + 441, + 244, + 453 + ], + "score": 0.93, + "content": "\\{ r _ { 1 } , \\ldots , r _ { s } \\}", + "type": "inline_equation" + } + ], + "index": 22 + } + ], + "index": 22, + "bbox_fs": [ + 104, + 439, + 244, + 456 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 460, + 505, + 538 + ], + "lines": [ + { + "bbox": [ + 106, + 460, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 106, + 460, + 374, + 473 + ], + "score": 1.0, + "content": "The theorem states that an intersection of half-spaces (half-space or", + "type": "text" + }, + { + "bbox": [ + 375, + 461, + 383, + 471 + ], + "score": 0.27, + "content": "\\mathrm { H } \\cdot", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 460, + 505, + 473 + ], + "score": 1.0, + "content": "-representation) can be written", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 473, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 106, + 473, + 505, + 484 + ], + "score": 1.0, + "content": "as the Minkowski sum of a convex combination of the polyhedron’s vertices and a conical combi-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 483, + 505, + 495 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 235, + 495 + ], + "score": 1.0, + "content": "nation of some rays (vertex or", + "type": "text" + }, + { + "bbox": [ + 235, + 483, + 243, + 493 + ], + "score": 0.28, + "content": "\\mathrm { V } .", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 483, + 505, + 495 + ], + "score": 1.0, + "content": "-representation). One can switch algorithmically between these", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 493, + 505, + 506 + ], + "spans": [ + { + "bbox": [ + 106, + 493, + 505, + 506 + ], + "score": 1.0, + "content": "two viewpoints via the double description method (Motzkin et al., 1953; Fukuda & Prodon, 1996),", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 504, + 505, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 297, + 518 + ], + "score": 1.0, + "content": "which we discuss in the following. Thus, the", + "type": "text" + }, + { + "bbox": [ + 297, + 505, + 306, + 515 + ], + "score": 0.36, + "content": "\\mathrm { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 504, + 505, + 518 + ], + "score": 1.0, + "content": "-representation, which is natural when modeling", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 516, + 505, + 528 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 528 + ], + "score": 1.0, + "content": "inequality constraints, can be transformed into the V-representation, which can be incorporated into", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 527, + 265, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 265, + 540 + ], + "score": 1.0, + "content": "gradient-based neural network training.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 460, + 505, + 540 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 543, + 505, + 599 + ], + "lines": [ + { + "bbox": [ + 105, + 544, + 506, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 506, + 556 + ], + "score": 1.0, + "content": "In this paper, we focus on homogeneous constraints of the form (4), for which the feasible set is a", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 555, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 505, + 567 + ], + "score": 1.0, + "content": "polyhedral cone. Due to the special structure of this set, we can avoid to work with the convex com-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 566, + 504, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 566, + 504, + 578 + ], + "score": 1.0, + "content": "bination parameters in (3), which is numerically advantageous (Section 3.5), and we can efficiently", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 575, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 575, + 372, + 590 + ], + "score": 1.0, + "content": "combine modeling constraints and domain constraints, such as a", + "type": "text" + }, + { + "bbox": [ + 372, + 577, + 401, + 588 + ], + "score": 0.88, + "content": "[ - 1 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 575, + 505, + 590 + ], + "score": 1.0, + "content": "-pixel domain for images", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 587, + 345, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 345, + 601 + ], + "score": 1.0, + "content": "(Section 3.3). Such a polyhedral cone is shown in Figure 2.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 544, + 506, + 601 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 612, + 268, + 623 + ], + "lines": [ + { + "bbox": [ + 106, + 612, + 269, + 624 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 269, + 624 + ], + "score": 1.0, + "content": "3.1 DOUBLE DESCRIPTION METHOD", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 106, + 632, + 505, + 677 + ], + "lines": [ + { + "bbox": [ + 106, + 631, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 505, + 646 + ], + "score": 1.0, + "content": "The double description method converts between the half-space and vertex representation of a sys-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 643, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 505, + 656 + ], + "score": 1.0, + "content": "tem of linear inequalities. It was originally proposed by Motzkin et al. (1953) and further refined by", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 425, + 668 + ], + "score": 1.0, + "content": "Fukuda & Prodon (1996).2 Here, we are only interested in the conversion from", + "type": "text" + }, + { + "bbox": [ + 425, + 655, + 434, + 664 + ], + "score": 0.3, + "content": "\\mathrm { H } \\cdot", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 654, + 506, + 668 + ], + "score": 1.0, + "content": "-representation to", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 665, + 309, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 665, + 309, + 678 + ], + "score": 1.0, + "content": "V-representation for homogeneous constraints (4),", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 631, + 506, + 678 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 255, + 680, + 355, + 693 + ], + "lines": [ + { + "bbox": [ + 255, + 680, + 355, + 693 + ], + "spans": [ + { + "bbox": [ + 255, + 680, + 355, + 693 + ], + "score": 0.92, + "content": "\\mathcal { H } \\to \\mathrm { c o n e } ( r _ { 1 } , \\dots , r _ { s } ) \\ .", + "type": "interline_equation", + "image_path": "07953e3b7708217b360452246e0af32fd666d060d8d31f24becee732886e0ca0.jpg" + } + ] + } + ], + "index": 40, + "virtual_lines": [ + { + "bbox": [ + 255, + 680, + 355, + 693 + ], + "spans": [], + "index": 40 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 170, + 82, + 435, + 239 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 170, + 82, + 435, + 239 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 170, + 82, + 435, + 239 + ], + "spans": [ + { + "bbox": [ + 170, + 82, + 435, + 239 + ], + "score": 0.97, + "type": "image", + "image_path": "e34f7d5efaaf63be07414ce913edd9a6616ef7e1dcd0ac505ab2653737bf016f.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 170, + 82, + 435, + 134.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 170, + 134.33333333333334, + 435, + 186.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 170, + 186.66666666666669, + 435, + 239.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 250, + 505, + 305 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 250, + 506, + 264 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 506, + 264 + ], + "score": 1.0, + "content": "Figure 2: Diagram illustrating an iteration of the double description method. Adding a constraint to", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 260, + 504, + 275 + ], + "spans": [ + { + "bbox": [ + 105, + 260, + 121, + 275 + ], + "score": 1.0, + "content": "the", + "type": "text" + }, + { + "bbox": [ + 122, + 262, + 128, + 272 + ], + "score": 0.81, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 128, + 260, + 186, + 275 + ], + "score": 1.0, + "content": "-constraint set", + "type": "text" + }, + { + "bbox": [ + 186, + 261, + 200, + 272 + ], + "score": 0.88, + "content": "A ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 260, + 247, + 275 + ], + "score": 1.0, + "content": "at iteration", + "type": "text" + }, + { + "bbox": [ + 248, + 262, + 272, + 272 + ], + "score": 0.91, + "content": "k + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 260, + 372, + 275 + ], + "score": 1.0, + "content": "introduces a hyperplane", + "type": "text" + }, + { + "bbox": [ + 372, + 262, + 382, + 272 + ], + "score": 0.71, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 260, + 493, + 275 + ], + "score": 1.0, + "content": ". The intersection points of", + "type": "text" + }, + { + "bbox": [ + 494, + 262, + 504, + 272 + ], + "score": 0.79, + "content": "H", + "type": "inline_equation" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 271, + 505, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 271, + 289, + 285 + ], + "score": 1.0, + "content": "with the boundary of the current polyhedron", + "type": "text" + }, + { + "bbox": [ + 289, + 272, + 303, + 283 + ], + "score": 0.88, + "content": "R ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 271, + 353, + 285 + ], + "score": 1.0, + "content": "(marked by", + "type": "text" + }, + { + "bbox": [ + 354, + 275, + 361, + 282 + ], + "score": 0.49, + "content": "\\circ ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 271, + 438, + 285 + ], + "score": 1.0, + "content": ") are added as rays", + "type": "text" + }, + { + "bbox": [ + 438, + 275, + 448, + 284 + ], + "score": 0.84, + "content": "r _ { 6 }", + "type": "inline_equation" + }, + { + "bbox": [ + 449, + 271, + 467, + 285 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 468, + 274, + 478, + 284 + ], + "score": 0.86, + "content": "r _ { 7 }", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 271, + 505, + 285 + ], + "score": 1.0, + "content": "to the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 282, + 506, + 296 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 210, + 296 + ], + "score": 1.0, + "content": "polyhedral cone. The ray", + "type": "text" + }, + { + "bbox": [ + 210, + 285, + 221, + 295 + ], + "score": 0.84, + "content": "r _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 282, + 336, + 296 + ], + "score": 1.0, + "content": "is cut-off by the hyperplane", + "type": "text" + }, + { + "bbox": [ + 336, + 284, + 347, + 294 + ], + "score": 0.76, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 282, + 434, + 296 + ], + "score": 1.0, + "content": "and is removed from", + "type": "text" + }, + { + "bbox": [ + 434, + 284, + 447, + 294 + ], + "score": 0.87, + "content": "R ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 282, + 506, + 296 + ], + "score": 1.0, + "content": ". The result is", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 293, + 195, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 293, + 195, + 306 + ], + "score": 1.0, + "content": "the next iterate Rk+1.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 107, + 330, + 505, + 431 + ], + "lines": [ + { + "bbox": [ + 106, + 330, + 505, + 342 + ], + "spans": [ + { + "bbox": [ + 106, + 330, + 331, + 342 + ], + "score": 1.0, + "content": "The core algorithm proceeds as follows. Let the rows of", + "type": "text" + }, + { + "bbox": [ + 331, + 331, + 340, + 340 + ], + "score": 0.77, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 330, + 505, + 342 + ], + "score": 1.0, + "content": "define a set of homogeneous inequalities", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 341, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 341, + 136, + 354 + ], + "score": 1.0, + "content": "and let", + "type": "text" + }, + { + "bbox": [ + 136, + 341, + 203, + 353 + ], + "score": 0.93, + "content": "R = [ r _ { 1 } , \\ldots , r _ { s } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 341, + 505, + 354 + ], + "score": 1.0, + "content": "be the matrix whose columns are the rays of the corresponding cone. Here,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 351, + 506, + 365 + ], + "spans": [ + { + "bbox": [ + 107, + 352, + 135, + 363 + ], + "score": 0.9, + "content": "( A , R )", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 351, + 506, + 365 + ], + "score": 1.0, + "content": "form a double description pair. The algorithm iteratively builds a double description pair", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 359, + 507, + 378 + ], + "spans": [ + { + "bbox": [ + 107, + 362, + 165, + 375 + ], + "score": 0.9, + "content": "( A ^ { k + 1 } , R ^ { k + 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 359, + 191, + 378 + ], + "score": 1.0, + "content": "from", + "type": "text" + }, + { + "bbox": [ + 191, + 362, + 228, + 375 + ], + "score": 0.92, + "content": "( A ^ { k } , R ^ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 229, + 359, + 392, + 378 + ], + "score": 1.0, + "content": "in the following manner. The rows in", + "type": "text" + }, + { + "bbox": [ + 393, + 362, + 406, + 373 + ], + "score": 0.88, + "content": "A ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 359, + 456, + 378 + ], + "score": 1.0, + "content": "represent a", + "type": "text" + }, + { + "bbox": [ + 457, + 363, + 464, + 373 + ], + "score": 0.82, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 359, + 507, + 378 + ], + "score": 1.0, + "content": "-subset of", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 372, + 506, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 156, + 387 + ], + "score": 1.0, + "content": "the rows of", + "type": "text" + }, + { + "bbox": [ + 157, + 375, + 165, + 384 + ], + "score": 0.76, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 372, + 387, + 387 + ], + "score": 1.0, + "content": "and thus define a convex polyhedron associated with", + "type": "text" + }, + { + "bbox": [ + 387, + 374, + 400, + 384 + ], + "score": 0.89, + "content": "R ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 372, + 506, + 387 + ], + "score": 1.0, + "content": ". Adding a single row to", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 107, + 384, + 506, + 397 + ], + "spans": [ + { + "bbox": [ + 107, + 384, + 120, + 395 + ], + "score": 0.88, + "content": "A ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 120, + 384, + 506, + 397 + ], + "score": 1.0, + "content": "introduces an additional half-space constraint, which corresponds to a hyperplane. If the vector", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 107, + 394, + 507, + 410 + ], + "spans": [ + { + "bbox": [ + 107, + 397, + 137, + 408 + ], + "score": 0.9, + "content": "r _ { i } - r _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 394, + 207, + 410 + ], + "score": 1.0, + "content": "for two columns", + "type": "text" + }, + { + "bbox": [ + 208, + 397, + 231, + 408 + ], + "score": 0.44, + "content": "r _ { i } , r _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 394, + 244, + 410 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 244, + 396, + 258, + 406 + ], + "score": 0.89, + "content": "\\bar { \\boldsymbol { R } } ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 394, + 507, + 410 + ], + "score": 1.0, + "content": "intersects with this hyperplane then this intersection point is", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 406, + 506, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 143, + 421 + ], + "score": 1.0, + "content": "added to", + "type": "text" + }, + { + "bbox": [ + 144, + 408, + 157, + 418 + ], + "score": 0.89, + "content": "R ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 406, + 469, + 421 + ], + "score": 1.0, + "content": ". Existing rays that are cut-off by the additional hyperplane are removed from", + "type": "text" + }, + { + "bbox": [ + 469, + 407, + 482, + 418 + ], + "score": 0.88, + "content": "R ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 406, + 506, + 421 + ], + "score": 1.0, + "content": ". The", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 417, + 461, + 432 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 250, + 432 + ], + "score": 1.0, + "content": "result is the double description pair", + "type": "text" + }, + { + "bbox": [ + 250, + 419, + 307, + 431 + ], + "score": 0.92, + "content": "( A ^ { k + 1 } , \\dot { R } ^ { k + 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 417, + 461, + 432 + ], + "score": 1.0, + "content": ". This procedure is shown in Figure 2.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 436, + 505, + 502 + ], + "lines": [ + { + "bbox": [ + 105, + 435, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 506, + 448 + ], + "score": 1.0, + "content": "Adding a hyperplane might drastically increase the number of rays in intermediate representations,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 448, + 506, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 506, + 459 + ], + "score": 1.0, + "content": "which, in turn, contribute combinatorically in the subsequent iteration. In fact, there exist worst", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 458, + 506, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 458, + 506, + 470 + ], + "score": 1.0, + "content": "case polyhedra for which the algorithm has exponential run time as a function of the number of", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 469, + 505, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 469, + 505, + 481 + ], + "score": 1.0, + "content": "inequalities and the input dimension, as well as the number of rays (Dyer, 1983; Bremner, 1999).", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 480, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 505, + 492 + ], + "score": 1.0, + "content": "Overall, one can expect the algorithm to be efficient only for problems with a reasonably small", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 492, + 281, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 139, + 502 + ], + "score": 1.0, + "content": "number", + "type": "text" + }, + { + "bbox": [ + 140, + 493, + 150, + 501 + ], + "score": 0.76, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 492, + 271, + 502 + ], + "score": 1.0, + "content": "of inequalities and dimension", + "type": "text" + }, + { + "bbox": [ + 271, + 492, + 277, + 501 + ], + "score": 0.81, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 492, + 281, + 502 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 19.5 + }, + { + "type": "title", + "bbox": [ + 107, + 523, + 360, + 533 + ], + "lines": [ + { + "bbox": [ + 106, + 522, + 361, + 534 + ], + "spans": [ + { + "bbox": [ + 106, + 522, + 361, + 534 + ], + "score": 1.0, + "content": "3.2 INTEGRATION IN NEURAL NETWORK ARCHITECTURES", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 106, + 545, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 545, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 106, + 545, + 505, + 558 + ], + "score": 1.0, + "content": "We parameterize the homogeneous form (4) via a neural network layer. This layer takes as input", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 556, + 505, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 505, + 569 + ], + "score": 1.0, + "content": "some (latent) representation of the data, which is mapped to activations satisfying the desired hard", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 567, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 304, + 581 + ], + "score": 1.0, + "content": "constraints. The algorithm is provided with the", + "type": "text" + }, + { + "bbox": [ + 305, + 568, + 314, + 577 + ], + "score": 0.39, + "content": "_ \\mathrm { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 314, + 567, + 505, + 581 + ], + "score": 1.0, + "content": "-representation of linear inequality constraints,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 576, + 506, + 592 + ], + "spans": [ + { + "bbox": [ + 104, + 576, + 161, + 592 + ], + "score": 1.0, + "content": "i.e., a matrix", + "type": "text" + }, + { + "bbox": [ + 161, + 577, + 209, + 588 + ], + "score": 0.92, + "content": "A \\in \\breve { \\mathbb { R } } ^ { m \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 576, + 225, + 592 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 226, + 580, + 236, + 588 + ], + "score": 0.7, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 576, + 294, + 592 + ], + "score": 1.0, + "content": "constraints in", + "type": "text" + }, + { + "bbox": [ + 294, + 579, + 301, + 588 + ], + "score": 0.78, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 576, + 506, + 592 + ], + "score": 1.0, + "content": "dimensions to specify the feasible set (4). At ini-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 588, + 505, + 602 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 240, + 602 + ], + "score": 1.0, + "content": "tialization, we convert this to the", + "type": "text" + }, + { + "bbox": [ + 240, + 590, + 249, + 599 + ], + "score": 0.26, + "content": "\\mathrm { V } .", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 588, + 505, + 602 + ], + "score": 1.0, + "content": "-representation via the double description method (Section 3.1).", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 599, + 506, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 290, + 614 + ], + "score": 1.0, + "content": "This corresponds to computing the set of rays", + "type": "text" + }, + { + "bbox": [ + 290, + 600, + 340, + 612 + ], + "score": 0.93, + "content": "\\{ r _ { 1 } , \\ldots , r _ { s } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 599, + 506, + 614 + ], + "score": 1.0, + "content": "to represent the polyhedral cone. During", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 612, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 505, + 623 + ], + "score": 1.0, + "content": "training, the neural network training algorithm is used to optimize within in the feasible set. There", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 621, + 505, + 636 + ], + "spans": [ + { + "bbox": [ + 104, + 621, + 505, + 636 + ], + "score": 1.0, + "content": "are two critical aspects in this procedure. First, as outlined in Section 3.1, the run-time complexity", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "score": 1.0, + "content": "of the double description method may be prohibitive. Conceptually, the proposed approach allows", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 644, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 657 + ], + "score": 1.0, + "content": "for significant compute time at initialization to obtain an algorithm that is very efficient at train-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "score": 1.0, + "content": "ing and test time. Second, we must ensure that the mapping from the latent representation to the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "parameters integrates well with the training algorithm. We assume that the model is trained with", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "gradient-based backpropagation, as is common for current deep learning applications. The con-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "score": 1.0, + "content": "straint layer comprises a batch normalization layer and an affine mapping (fully-connected layer", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 699, + 504, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 504, + 711 + ], + "score": 1.0, + "content": "with biases) followed by the element-wise absolute value function that ensures the non-negativity", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 396, + 722 + ], + "score": 1.0, + "content": "required by the conical combination parameters. In theory, any function", + "type": "text" + }, + { + "bbox": [ + 396, + 710, + 452, + 722 + ], + "score": 0.92, + "content": "f : \\mathbb { R } \\to \\mathbb { R } _ { \\geq 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "would fulfill", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 720, + 480, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 480, + 734 + ], + "score": 1.0, + "content": "this requirement; however, care must be taken to not interfere with backpropagated gradients.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 32 + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 759 + ], + "lines": [] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 170, + 82, + 435, + 239 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 170, + 82, + 435, + 239 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 170, + 82, + 435, + 239 + ], + "spans": [ + { + "bbox": [ + 170, + 82, + 435, + 239 + ], + "score": 0.97, + "type": "image", + "image_path": "e34f7d5efaaf63be07414ce913edd9a6616ef7e1dcd0ac505ab2653737bf016f.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 170, + 82, + 435, + 134.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 170, + 134.33333333333334, + 435, + 186.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 170, + 186.66666666666669, + 435, + 239.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 250, + 505, + 305 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 250, + 506, + 264 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 506, + 264 + ], + "score": 1.0, + "content": "Figure 2: Diagram illustrating an iteration of the double description method. Adding a constraint to", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 260, + 504, + 275 + ], + "spans": [ + { + "bbox": [ + 105, + 260, + 121, + 275 + ], + "score": 1.0, + "content": "the", + "type": "text" + }, + { + "bbox": [ + 122, + 262, + 128, + 272 + ], + "score": 0.81, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 128, + 260, + 186, + 275 + ], + "score": 1.0, + "content": "-constraint set", + "type": "text" + }, + { + "bbox": [ + 186, + 261, + 200, + 272 + ], + "score": 0.88, + "content": "A ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 260, + 247, + 275 + ], + "score": 1.0, + "content": "at iteration", + "type": "text" + }, + { + "bbox": [ + 248, + 262, + 272, + 272 + ], + "score": 0.91, + "content": "k + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 260, + 372, + 275 + ], + "score": 1.0, + "content": "introduces a hyperplane", + "type": "text" + }, + { + "bbox": [ + 372, + 262, + 382, + 272 + ], + "score": 0.71, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 260, + 493, + 275 + ], + "score": 1.0, + "content": ". The intersection points of", + "type": "text" + }, + { + "bbox": [ + 494, + 262, + 504, + 272 + ], + "score": 0.79, + "content": "H", + "type": "inline_equation" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 271, + 505, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 271, + 289, + 285 + ], + "score": 1.0, + "content": "with the boundary of the current polyhedron", + "type": "text" + }, + { + "bbox": [ + 289, + 272, + 303, + 283 + ], + "score": 0.88, + "content": "R ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 271, + 353, + 285 + ], + "score": 1.0, + "content": "(marked by", + "type": "text" + }, + { + "bbox": [ + 354, + 275, + 361, + 282 + ], + "score": 0.49, + "content": "\\circ ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 271, + 438, + 285 + ], + "score": 1.0, + "content": ") are added as rays", + "type": "text" + }, + { + "bbox": [ + 438, + 275, + 448, + 284 + ], + "score": 0.84, + "content": "r _ { 6 }", + "type": "inline_equation" + }, + { + "bbox": [ + 449, + 271, + 467, + 285 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 468, + 274, + 478, + 284 + ], + "score": 0.86, + "content": "r _ { 7 }", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 271, + 505, + 285 + ], + "score": 1.0, + "content": "to the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 282, + 506, + 296 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 210, + 296 + ], + "score": 1.0, + "content": "polyhedral cone. The ray", + "type": "text" + }, + { + "bbox": [ + 210, + 285, + 221, + 295 + ], + "score": 0.84, + "content": "r _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 282, + 336, + 296 + ], + "score": 1.0, + "content": "is cut-off by the hyperplane", + "type": "text" + }, + { + "bbox": [ + 336, + 284, + 347, + 294 + ], + "score": 0.76, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 282, + 434, + 296 + ], + "score": 1.0, + "content": "and is removed from", + "type": "text" + }, + { + "bbox": [ + 434, + 284, + 447, + 294 + ], + "score": 0.87, + "content": "R ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 282, + 506, + 296 + ], + "score": 1.0, + "content": ". The result is", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 293, + 195, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 293, + 195, + 306 + ], + "score": 1.0, + "content": "the next iterate Rk+1.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 107, + 330, + 505, + 431 + ], + "lines": [ + { + "bbox": [ + 106, + 330, + 505, + 342 + ], + "spans": [ + { + "bbox": [ + 106, + 330, + 331, + 342 + ], + "score": 1.0, + "content": "The core algorithm proceeds as follows. Let the rows of", + "type": "text" + }, + { + "bbox": [ + 331, + 331, + 340, + 340 + ], + "score": 0.77, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 330, + 505, + 342 + ], + "score": 1.0, + "content": "define a set of homogeneous inequalities", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 341, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 341, + 136, + 354 + ], + "score": 1.0, + "content": "and let", + "type": "text" + }, + { + "bbox": [ + 136, + 341, + 203, + 353 + ], + "score": 0.93, + "content": "R = [ r _ { 1 } , \\ldots , r _ { s } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 341, + 505, + 354 + ], + "score": 1.0, + "content": "be the matrix whose columns are the rays of the corresponding cone. Here,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 351, + 506, + 365 + ], + "spans": [ + { + "bbox": [ + 107, + 352, + 135, + 363 + ], + "score": 0.9, + "content": "( A , R )", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 351, + 506, + 365 + ], + "score": 1.0, + "content": "form a double description pair. The algorithm iteratively builds a double description pair", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 359, + 507, + 378 + ], + "spans": [ + { + "bbox": [ + 107, + 362, + 165, + 375 + ], + "score": 0.9, + "content": "( A ^ { k + 1 } , R ^ { k + 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 359, + 191, + 378 + ], + "score": 1.0, + "content": "from", + "type": "text" + }, + { + "bbox": [ + 191, + 362, + 228, + 375 + ], + "score": 0.92, + "content": "( A ^ { k } , R ^ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 229, + 359, + 392, + 378 + ], + "score": 1.0, + "content": "in the following manner. The rows in", + "type": "text" + }, + { + "bbox": [ + 393, + 362, + 406, + 373 + ], + "score": 0.88, + "content": "A ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 359, + 456, + 378 + ], + "score": 1.0, + "content": "represent a", + "type": "text" + }, + { + "bbox": [ + 457, + 363, + 464, + 373 + ], + "score": 0.82, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 359, + 507, + 378 + ], + "score": 1.0, + "content": "-subset of", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 372, + 506, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 156, + 387 + ], + "score": 1.0, + "content": "the rows of", + "type": "text" + }, + { + "bbox": [ + 157, + 375, + 165, + 384 + ], + "score": 0.76, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 372, + 387, + 387 + ], + "score": 1.0, + "content": "and thus define a convex polyhedron associated with", + "type": "text" + }, + { + "bbox": [ + 387, + 374, + 400, + 384 + ], + "score": 0.89, + "content": "R ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 372, + 506, + 387 + ], + "score": 1.0, + "content": ". Adding a single row to", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 107, + 384, + 506, + 397 + ], + "spans": [ + { + "bbox": [ + 107, + 384, + 120, + 395 + ], + "score": 0.88, + "content": "A ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 120, + 384, + 506, + 397 + ], + "score": 1.0, + "content": "introduces an additional half-space constraint, which corresponds to a hyperplane. If the vector", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 107, + 394, + 507, + 410 + ], + "spans": [ + { + "bbox": [ + 107, + 397, + 137, + 408 + ], + "score": 0.9, + "content": "r _ { i } - r _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 394, + 207, + 410 + ], + "score": 1.0, + "content": "for two columns", + "type": "text" + }, + { + "bbox": [ + 208, + 397, + 231, + 408 + ], + "score": 0.44, + "content": "r _ { i } , r _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 394, + 244, + 410 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 244, + 396, + 258, + 406 + ], + "score": 0.89, + "content": "\\bar { \\boldsymbol { R } } ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 394, + 507, + 410 + ], + "score": 1.0, + "content": "intersects with this hyperplane then this intersection point is", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 406, + 506, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 143, + 421 + ], + "score": 1.0, + "content": "added to", + "type": "text" + }, + { + "bbox": [ + 144, + 408, + 157, + 418 + ], + "score": 0.89, + "content": "R ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 406, + 469, + 421 + ], + "score": 1.0, + "content": ". Existing rays that are cut-off by the additional hyperplane are removed from", + "type": "text" + }, + { + "bbox": [ + 469, + 407, + 482, + 418 + ], + "score": 0.88, + "content": "R ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 406, + 506, + 421 + ], + "score": 1.0, + "content": ". The", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 417, + 461, + 432 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 250, + 432 + ], + "score": 1.0, + "content": "result is the double description pair", + "type": "text" + }, + { + "bbox": [ + 250, + 419, + 307, + 431 + ], + "score": 0.92, + "content": "( A ^ { k + 1 } , \\dot { R } ^ { k + 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 417, + 461, + 432 + ], + "score": 1.0, + "content": ". This procedure is shown in Figure 2.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 330, + 507, + 432 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 436, + 505, + 502 + ], + "lines": [ + { + "bbox": [ + 105, + 435, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 506, + 448 + ], + "score": 1.0, + "content": "Adding a hyperplane might drastically increase the number of rays in intermediate representations,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 448, + 506, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 506, + 459 + ], + "score": 1.0, + "content": "which, in turn, contribute combinatorically in the subsequent iteration. In fact, there exist worst", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 458, + 506, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 458, + 506, + 470 + ], + "score": 1.0, + "content": "case polyhedra for which the algorithm has exponential run time as a function of the number of", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 469, + 505, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 469, + 505, + 481 + ], + "score": 1.0, + "content": "inequalities and the input dimension, as well as the number of rays (Dyer, 1983; Bremner, 1999).", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 480, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 505, + 492 + ], + "score": 1.0, + "content": "Overall, one can expect the algorithm to be efficient only for problems with a reasonably small", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 492, + 281, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 139, + 502 + ], + "score": 1.0, + "content": "number", + "type": "text" + }, + { + "bbox": [ + 140, + 493, + 150, + 501 + ], + "score": 0.76, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 492, + 271, + 502 + ], + "score": 1.0, + "content": "of inequalities and dimension", + "type": "text" + }, + { + "bbox": [ + 271, + 492, + 277, + 501 + ], + "score": 0.81, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 492, + 281, + 502 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 435, + 506, + 502 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 523, + 360, + 533 + ], + "lines": [ + { + "bbox": [ + 106, + 522, + 361, + 534 + ], + "spans": [ + { + "bbox": [ + 106, + 522, + 361, + 534 + ], + "score": 1.0, + "content": "3.2 INTEGRATION IN NEURAL NETWORK ARCHITECTURES", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 106, + 545, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 545, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 106, + 545, + 505, + 558 + ], + "score": 1.0, + "content": "We parameterize the homogeneous form (4) via a neural network layer. This layer takes as input", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 556, + 505, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 505, + 569 + ], + "score": 1.0, + "content": "some (latent) representation of the data, which is mapped to activations satisfying the desired hard", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 567, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 304, + 581 + ], + "score": 1.0, + "content": "constraints. The algorithm is provided with the", + "type": "text" + }, + { + "bbox": [ + 305, + 568, + 314, + 577 + ], + "score": 0.39, + "content": "_ \\mathrm { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 314, + 567, + 505, + 581 + ], + "score": 1.0, + "content": "-representation of linear inequality constraints,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 576, + 506, + 592 + ], + "spans": [ + { + "bbox": [ + 104, + 576, + 161, + 592 + ], + "score": 1.0, + "content": "i.e., a matrix", + "type": "text" + }, + { + "bbox": [ + 161, + 577, + 209, + 588 + ], + "score": 0.92, + "content": "A \\in \\breve { \\mathbb { R } } ^ { m \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 576, + 225, + 592 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 226, + 580, + 236, + 588 + ], + "score": 0.7, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 576, + 294, + 592 + ], + "score": 1.0, + "content": "constraints in", + "type": "text" + }, + { + "bbox": [ + 294, + 579, + 301, + 588 + ], + "score": 0.78, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 576, + 506, + 592 + ], + "score": 1.0, + "content": "dimensions to specify the feasible set (4). At ini-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 588, + 505, + 602 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 240, + 602 + ], + "score": 1.0, + "content": "tialization, we convert this to the", + "type": "text" + }, + { + "bbox": [ + 240, + 590, + 249, + 599 + ], + "score": 0.26, + "content": "\\mathrm { V } .", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 588, + 505, + 602 + ], + "score": 1.0, + "content": "-representation via the double description method (Section 3.1).", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 599, + 506, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 290, + 614 + ], + "score": 1.0, + "content": "This corresponds to computing the set of rays", + "type": "text" + }, + { + "bbox": [ + 290, + 600, + 340, + 612 + ], + "score": 0.93, + "content": "\\{ r _ { 1 } , \\ldots , r _ { s } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 599, + 506, + 614 + ], + "score": 1.0, + "content": "to represent the polyhedral cone. During", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 612, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 505, + 623 + ], + "score": 1.0, + "content": "training, the neural network training algorithm is used to optimize within in the feasible set. There", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 621, + 505, + 636 + ], + "spans": [ + { + "bbox": [ + 104, + 621, + 505, + 636 + ], + "score": 1.0, + "content": "are two critical aspects in this procedure. First, as outlined in Section 3.1, the run-time complexity", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "score": 1.0, + "content": "of the double description method may be prohibitive. Conceptually, the proposed approach allows", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 644, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 657 + ], + "score": 1.0, + "content": "for significant compute time at initialization to obtain an algorithm that is very efficient at train-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "score": 1.0, + "content": "ing and test time. Second, we must ensure that the mapping from the latent representation to the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "parameters integrates well with the training algorithm. We assume that the model is trained with", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "gradient-based backpropagation, as is common for current deep learning applications. The con-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "score": 1.0, + "content": "straint layer comprises a batch normalization layer and an affine mapping (fully-connected layer", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 699, + 504, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 504, + 711 + ], + "score": 1.0, + "content": "with biases) followed by the element-wise absolute value function that ensures the non-negativity", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 396, + 722 + ], + "score": 1.0, + "content": "required by the conical combination parameters. In theory, any function", + "type": "text" + }, + { + "bbox": [ + 396, + 710, + 452, + 722 + ], + "score": 0.92, + "content": "f : \\mathbb { R } \\to \\mathbb { R } _ { \\geq 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "would fulfill", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 720, + 480, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 480, + 734 + ], + "score": 1.0, + "content": "this requirement; however, care must be taken to not interfere with backpropagated gradients.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 32, + "bbox_fs": [ + 104, + 545, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 83, + 352, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 354, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 354, + 95 + ], + "score": 1.0, + "content": "3.3 COMBINING MODELING AND DOMAIN CONSTRAINTS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 102, + 505, + 191 + ], + "lines": [ + { + "bbox": [ + 105, + 102, + 505, + 115 + ], + "spans": [ + { + "bbox": [ + 105, + 102, + 360, + 115 + ], + "score": 1.0, + "content": "Domain constraints are often formulated as unit box constraints,", + "type": "text" + }, + { + "bbox": [ + 361, + 102, + 480, + 115 + ], + "score": 0.93, + "content": "B : = \\{ x \\in \\mathbb { R } ^ { d } | - 1 \\leq x _ { i } \\leq 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 102, + 505, + 115 + ], + "score": 1.0, + "content": ", such", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 114, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 104, + 114, + 505, + 127 + ], + "score": 1.0, + "content": "as a pixel domain for images. Box constraints are particularly unfit to be converted using the double", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 125, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 106, + 125, + 505, + 137 + ], + "score": 1.0, + "content": "description method because the number of vertices is exponential in the dimension. Therefore,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 136, + 505, + 148 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 493, + 148 + ], + "score": 1.0, + "content": "we distinguish modeling constraints and domain constraints and only convert the former into", + "type": "text" + }, + { + "bbox": [ + 493, + 136, + 501, + 146 + ], + "score": 0.26, + "content": "\\mathrm { V } .", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 136, + 505, + 148 + ], + "score": 1.0, + "content": "-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 147, + 505, + 159 + ], + "spans": [ + { + "bbox": [ + 104, + 147, + 476, + 159 + ], + "score": 1.0, + "content": "representation. Based on this representation, we obtain a point in the modeling constraint set,", + "type": "text" + }, + { + "bbox": [ + 477, + 147, + 501, + 157 + ], + "score": 0.88, + "content": "x \\in { \\mathcal { C } }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 147, + 505, + 159 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 157, + 506, + 171 + ], + "spans": [ + { + "bbox": [ + 105, + 157, + 295, + 171 + ], + "score": 1.0, + "content": "However, this point may not be in the unit box", + "type": "text" + }, + { + "bbox": [ + 296, + 159, + 304, + 168 + ], + "score": 0.68, + "content": "\\boldsymbol { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 157, + 461, + 171 + ], + "score": 1.0, + "content": ". To arrive at a point in the intersection", + "type": "text" + }, + { + "bbox": [ + 462, + 158, + 487, + 168 + ], + "score": 0.88, + "content": "\\mathcal { C } \\cap \\mathcal { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 157, + 506, + 171 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 104, + 168, + 506, + 182 + ], + "spans": [ + { + "bbox": [ + 104, + 168, + 149, + 182 + ], + "score": 1.0, + "content": "normalize", + "type": "text" + }, + { + "bbox": [ + 149, + 171, + 156, + 179 + ], + "score": 0.77, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 168, + 245, + 182 + ], + "score": 1.0, + "content": "by its infinity norm if", + "type": "text" + }, + { + "bbox": [ + 245, + 169, + 271, + 181 + ], + "score": 0.86, + "content": "x \\notin B", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 168, + 275, + 182 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 276, + 169, + 370, + 181 + ], + "score": 0.84, + "content": "\\hat { x } = x / \\operatorname* { m a x } \\{ \\| x \\| _ { \\infty } , 1 \\bar \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 168, + 407, + 182 + ], + "score": 1.0, + "content": ". Indeed,", + "type": "text" + }, + { + "bbox": [ + 407, + 169, + 450, + 179 + ], + "score": 0.91, + "content": "\\hat { x } \\in \\mathcal { C } \\cap B", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 168, + 506, + 182 + ], + "score": 1.0, + "content": "since scaling", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 180, + 421, + 192 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 304, + 192 + ], + "score": 1.0, + "content": "by a positive constant remains in the cone, i.e., if", + "type": "text" + }, + { + "bbox": [ + 304, + 181, + 329, + 190 + ], + "score": 0.89, + "content": "x \\in { \\mathcal { C } }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 180, + 352, + 192 + ], + "score": 1.0, + "content": ", then", + "type": "text" + }, + { + "bbox": [ + 352, + 180, + 416, + 191 + ], + "score": 0.91, + "content": "\\alpha x \\in \\mathcal { C } \\forall \\alpha \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 180, + 421, + 192 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 4.5 + }, + { + "type": "title", + "bbox": [ + 107, + 206, + 431, + 216 + ], + "lines": [ + { + "bbox": [ + 106, + 205, + 432, + 218 + ], + "spans": [ + { + "bbox": [ + 106, + 205, + 432, + 218 + ], + "score": 1.0, + "content": "3.4 APPLICATIONS OF HOMOGENEOUS LINEAR INEQUALITY CONSTRAINTS", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 107, + 225, + 505, + 292 + ], + "lines": [ + { + "bbox": [ + 105, + 225, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 304, + 239 + ], + "score": 1.0, + "content": "A natural application of constraints of the form", + "type": "text" + }, + { + "bbox": [ + 305, + 226, + 341, + 237 + ], + "score": 0.91, + "content": "A x \\le 0", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 225, + 505, + 239 + ], + "score": 1.0, + "content": "is a parameterization of a set of binary", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 236, + 506, + 250 + ], + "spans": [ + { + "bbox": [ + 105, + 236, + 202, + 250 + ], + "score": 1.0, + "content": "classifiers. If each row", + "type": "text" + }, + { + "bbox": [ + 202, + 239, + 212, + 248 + ], + "score": 0.81, + "content": "a _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 236, + 225, + 250 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 225, + 237, + 234, + 246 + ], + "score": 0.8, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 236, + 506, + 250 + ], + "score": 1.0, + "content": "is such a binary classifier, then the method presented in this paper", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 247, + 506, + 260 + ], + "spans": [ + { + "bbox": [ + 104, + 247, + 196, + 260 + ], + "score": 1.0, + "content": "parameterizes the set", + "type": "text" + }, + { + "bbox": [ + 196, + 247, + 268, + 260 + ], + "score": 0.92, + "content": "\\{ x | a _ { i } ^ { T } x \\le 0 \\ \\forall i \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 247, + 506, + 260 + ], + "score": 1.0, + "content": ". Consequently, it can be guaranteed that neural network", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 259, + 505, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 259, + 505, + 272 + ], + "score": 1.0, + "content": "activations satisfy a set of binary criteria. Another domain is to express certain direct relations", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 270, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 505, + 282 + ], + "score": 1.0, + "content": "between neural network activations. Notably, one can guarantee mathematical properties such as", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 281, + 394, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 177, + 294 + ], + "score": 1.0, + "content": "monotonicity via", + "type": "text" + }, + { + "bbox": [ + 177, + 281, + 219, + 293 + ], + "score": 0.92, + "content": "x _ { i + 1 } \\geq x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 281, + 293, + 294 + ], + "score": 1.0, + "content": "and convexity via", + "type": "text" + }, + { + "bbox": [ + 293, + 281, + 390, + 293 + ], + "score": 0.93, + "content": "x _ { i + 1 } - 2 x _ { i } + x _ { i - 1 } \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 281, + 394, + 294 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 12.5 + }, + { + "type": "title", + "bbox": [ + 108, + 307, + 392, + 317 + ], + "lines": [ + { + "bbox": [ + 105, + 305, + 394, + 319 + ], + "spans": [ + { + "bbox": [ + 105, + 305, + 394, + 319 + ], + "score": 1.0, + "content": "3.5 EXTENSION TO GENERAL LINEAR INEQUALITY CONSTRAINTS", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 106, + 326, + 505, + 450 + ], + "lines": [ + { + "bbox": [ + 105, + 326, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 505, + 339 + ], + "score": 1.0, + "content": "The proposed method takes advantage of the special structure of a polyhedral cone to efficiently", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 338, + 506, + 351 + ], + "spans": [ + { + "bbox": [ + 106, + 338, + 506, + 351 + ], + "score": 1.0, + "content": "combine modeling and domain constraints (Section 3.3). General linear inequality constraints of", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 348, + 506, + 361 + ], + "spans": [ + { + "bbox": [ + 105, + 348, + 143, + 361 + ], + "score": 1.0, + "content": "the form", + "type": "text" + }, + { + "bbox": [ + 144, + 349, + 176, + 360 + ], + "score": 0.91, + "content": "A x \\leq b", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 348, + 270, + 361 + ], + "score": 1.0, + "content": "without restrictions on", + "type": "text" + }, + { + "bbox": [ + 271, + 349, + 279, + 358 + ], + "score": 0.72, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 348, + 297, + 361 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 297, + 349, + 303, + 358 + ], + "score": 0.7, + "content": "b", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 348, + 506, + 361 + ], + "score": 1.0, + "content": "possibly require the conic and convex component", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 359, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 359, + 169, + 372 + ], + "score": 1.0, + "content": "of (3) for their", + "type": "text" + }, + { + "bbox": [ + 170, + 360, + 178, + 370 + ], + "score": 0.28, + "content": "\\mathrm { v } .", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 359, + 505, + 372 + ], + "score": 1.0, + "content": "-representation. The main approach of this paper may be used in this case, i.e.,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 370, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 505, + 383 + ], + "score": 1.0, + "content": "our layer additionally needs to predict convex combination parameters. However, we observed", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 382, + 505, + 393 + ], + "spans": [ + { + "bbox": [ + 106, + 382, + 505, + 393 + ], + "score": 1.0, + "content": "slow convergence, which we ascribe to the simplex parameterization for the convex combination", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 103, + 390, + 507, + 409 + ], + "spans": [ + { + "bbox": [ + 103, + 390, + 267, + 409 + ], + "score": 1.0, + "content": "parameters. We used a softmax function", + "type": "text" + }, + { + "bbox": [ + 267, + 392, + 402, + 406 + ], + "score": 0.93, + "content": "f ( x ) _ { i } = { \\mathrm { { \\bar { e x p } } } ( x _ { i } ) } / { \\sum _ { j = 1 } ^ { m } \\exp ( x _ { j } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 390, + 507, + 409 + ], + "score": 1.0, + "content": "to enforce the constraints", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 402, + 507, + 422 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 198, + 418 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\lambda _ { i } \\ge 0 , \\sum _ { i = 1 } ^ { m } \\lambda _ { i } = 1 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 402, + 507, + 422 + ], + "score": 1.0, + "content": "of the convex combination parameters in (3). This function has vanishing", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 416, + 506, + 429 + ], + "spans": [ + { + "bbox": [ + 104, + 416, + 187, + 429 + ], + "score": 1.0, + "content": "gradients when one", + "type": "text" + }, + { + "bbox": [ + 187, + 419, + 198, + 428 + ], + "score": 0.82, + "content": "x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 416, + 506, + 429 + ], + "score": 1.0, + "content": "is significantly greater than the other vector entries. Furthermore, this most", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 427, + 506, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 427, + 506, + 441 + ], + "score": 1.0, + "content": "general setting does not allow for efficient incorporation of domain constraints, as this would require", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 438, + 495, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 495, + 451 + ], + "score": 1.0, + "content": "an efficient parameterization of the intersection of a general convex polyhedron and the unit box.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 22 + }, + { + "type": "title", + "bbox": [ + 108, + 466, + 239, + 479 + ], + "lines": [ + { + "bbox": [ + 105, + 465, + 240, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 240, + 481 + ], + "score": 1.0, + "content": "4 NUMERICAL RESULTS", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 106, + 492, + 505, + 590 + ], + "lines": [ + { + "bbox": [ + 106, + 492, + 504, + 504 + ], + "spans": [ + { + "bbox": [ + 106, + 492, + 504, + 504 + ], + "score": 1.0, + "content": "We compare the proposed constraint parameterization algorithm with an algorithm that trains with-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 502, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 505, + 516 + ], + "score": 1.0, + "content": "out constraints, but requires a projection step at test time. We call this latter algorithm test time", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 513, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 104, + 513, + 505, + 527 + ], + "score": 1.0, + "content": "projection. We analyze these algorithms in two different settings. In an initial experiment, we learn", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 525, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 505, + 538 + ], + "score": 1.0, + "content": "the orthogonal projection onto a constraint set to demonstrate properties of these algorithms. Here,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 536, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 506, + 549 + ], + "score": 1.0, + "content": "the result can be compared to the optimal solution of the convex optimization problem. In a second", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 546, + 504, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 504, + 559 + ], + "score": 1.0, + "content": "experiment, consistent with our motivation to constrain the output of generative models, we apply", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 557, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 106, + 557, + 505, + 570 + ], + "score": 1.0, + "content": "these algorithms to a variational autoencoder. Finally, we evaluate the running time of inference for", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 567, + 506, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 506, + 582 + ], + "score": 1.0, + "content": "these problems and show that the proposed algorithm is significantly more efficient compared to the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 580, + 220, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 580, + 220, + 591 + ], + "score": 1.0, + "content": "test time projection method.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 596, + 504, + 663 + ], + "lines": [ + { + "bbox": [ + 105, + 595, + 506, + 609 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 506, + 609 + ], + "score": 1.0, + "content": "We used the MNIST dataset (LeCun et al.) for both experiments (59000 training, 1000 validation,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 607, + 506, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 506, + 619 + ], + "score": 1.0, + "content": "and 10000 test samples). We chose PyTorch (Paszke et al., 2017) for our implementation3 and all", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 618, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 618, + 506, + 630 + ], + "score": 1.0, + "content": "experiments were performed on a single Nvidia Titan X GPU. All networks were optimized with the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 628, + 506, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 352, + 642 + ], + "score": 1.0, + "content": "Adam optimizer and we evaluated learning rates in the range", + "type": "text" + }, + { + "bbox": [ + 352, + 628, + 403, + 641 + ], + "score": 0.91, + "content": "[ 1 0 ^ { - 5 } , 1 0 ^ { - 3 } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 628, + 506, + 642 + ], + "score": 1.0, + "content": ". The initial learning rate", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 640, + 505, + 652 + ], + "spans": [ + { + "bbox": [ + 106, + 641, + 218, + 652 + ], + "score": 1.0, + "content": "was annealed by a factor of", + "type": "text" + }, + { + "bbox": [ + 218, + 640, + 235, + 652 + ], + "score": 0.54, + "content": "1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 641, + 505, + 652 + ], + "score": 1.0, + "content": "if progress on the validation loss stagnated for more than 5 epochs.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 650, + 483, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 483, + 664 + ], + "score": 1.0, + "content": "We used OSQP (Stellato et al., 2017) as an efficient solver to compute orthogonal projections.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 40.5 + }, + { + "type": "text", + "bbox": [ + 108, + 668, + 504, + 712 + ], + "lines": [ + { + "bbox": [ + 106, + 668, + 505, + 680 + ], + "spans": [ + { + "bbox": [ + 106, + 668, + 505, + 680 + ], + "score": 1.0, + "content": "Both experiments were performed with a checkerboard constraint with 16 tiles, where neighbor-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 679, + 506, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 679, + 506, + 691 + ], + "score": 1.0, + "content": "ing tiles are constrained to be on average either below or above pixel domain midpoint. For a", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 107, + 690, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 107, + 690, + 135, + 702 + ], + "score": 0.9, + "content": "[ - 1 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 136, + 690, + 505, + 703 + ], + "score": 1.0, + "content": "-pixel domain, the tiles’ average intensity is positive or negative, respectively. The initial", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 701, + 505, + 714 + ], + "spans": [ + { + "bbox": [ + 105, + 701, + 329, + 714 + ], + "score": 1.0, + "content": "computational cost of converting these constraints into", + "type": "text" + }, + { + "bbox": [ + 329, + 702, + 338, + 711 + ], + "score": 0.26, + "content": "\\mathrm { v } .", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 701, + 505, + 714 + ], + "score": 1.0, + "content": "-representation via the double description", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 45.5 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 119, + 721, + 291, + 732 + ], + "lines": [ + { + "bbox": [ + 119, + 719, + 293, + 734 + ], + "spans": [ + { + "bbox": [ + 119, + 719, + 293, + 734 + ], + "score": 1.0, + "content": "3Our implementation will be publicly available.", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 83, + 352, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 354, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 354, + 95 + ], + "score": 1.0, + "content": "3.3 COMBINING MODELING AND DOMAIN CONSTRAINTS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 102, + 505, + 191 + ], + "lines": [ + { + "bbox": [ + 105, + 102, + 505, + 115 + ], + "spans": [ + { + "bbox": [ + 105, + 102, + 360, + 115 + ], + "score": 1.0, + "content": "Domain constraints are often formulated as unit box constraints,", + "type": "text" + }, + { + "bbox": [ + 361, + 102, + 480, + 115 + ], + "score": 0.93, + "content": "B : = \\{ x \\in \\mathbb { R } ^ { d } | - 1 \\leq x _ { i } \\leq 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 102, + 505, + 115 + ], + "score": 1.0, + "content": ", such", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 114, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 104, + 114, + 505, + 127 + ], + "score": 1.0, + "content": "as a pixel domain for images. Box constraints are particularly unfit to be converted using the double", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 125, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 106, + 125, + 505, + 137 + ], + "score": 1.0, + "content": "description method because the number of vertices is exponential in the dimension. Therefore,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 136, + 505, + 148 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 493, + 148 + ], + "score": 1.0, + "content": "we distinguish modeling constraints and domain constraints and only convert the former into", + "type": "text" + }, + { + "bbox": [ + 493, + 136, + 501, + 146 + ], + "score": 0.26, + "content": "\\mathrm { V } .", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 136, + 505, + 148 + ], + "score": 1.0, + "content": "-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 147, + 505, + 159 + ], + "spans": [ + { + "bbox": [ + 104, + 147, + 476, + 159 + ], + "score": 1.0, + "content": "representation. Based on this representation, we obtain a point in the modeling constraint set,", + "type": "text" + }, + { + "bbox": [ + 477, + 147, + 501, + 157 + ], + "score": 0.88, + "content": "x \\in { \\mathcal { C } }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 147, + 505, + 159 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 157, + 506, + 171 + ], + "spans": [ + { + "bbox": [ + 105, + 157, + 295, + 171 + ], + "score": 1.0, + "content": "However, this point may not be in the unit box", + "type": "text" + }, + { + "bbox": [ + 296, + 159, + 304, + 168 + ], + "score": 0.68, + "content": "\\boldsymbol { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 157, + 461, + 171 + ], + "score": 1.0, + "content": ". To arrive at a point in the intersection", + "type": "text" + }, + { + "bbox": [ + 462, + 158, + 487, + 168 + ], + "score": 0.88, + "content": "\\mathcal { C } \\cap \\mathcal { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 157, + 506, + 171 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 104, + 168, + 506, + 182 + ], + "spans": [ + { + "bbox": [ + 104, + 168, + 149, + 182 + ], + "score": 1.0, + "content": "normalize", + "type": "text" + }, + { + "bbox": [ + 149, + 171, + 156, + 179 + ], + "score": 0.77, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 168, + 245, + 182 + ], + "score": 1.0, + "content": "by its infinity norm if", + "type": "text" + }, + { + "bbox": [ + 245, + 169, + 271, + 181 + ], + "score": 0.86, + "content": "x \\notin B", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 168, + 275, + 182 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 276, + 169, + 370, + 181 + ], + "score": 0.84, + "content": "\\hat { x } = x / \\operatorname* { m a x } \\{ \\| x \\| _ { \\infty } , 1 \\bar \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 168, + 407, + 182 + ], + "score": 1.0, + "content": ". Indeed,", + "type": "text" + }, + { + "bbox": [ + 407, + 169, + 450, + 179 + ], + "score": 0.91, + "content": "\\hat { x } \\in \\mathcal { C } \\cap B", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 168, + 506, + 182 + ], + "score": 1.0, + "content": "since scaling", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 180, + 421, + 192 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 304, + 192 + ], + "score": 1.0, + "content": "by a positive constant remains in the cone, i.e., if", + "type": "text" + }, + { + "bbox": [ + 304, + 181, + 329, + 190 + ], + "score": 0.89, + "content": "x \\in { \\mathcal { C } }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 180, + 352, + 192 + ], + "score": 1.0, + "content": ", then", + "type": "text" + }, + { + "bbox": [ + 352, + 180, + 416, + 191 + ], + "score": 0.91, + "content": "\\alpha x \\in \\mathcal { C } \\forall \\alpha \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 180, + 421, + 192 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 4.5, + "bbox_fs": [ + 104, + 102, + 506, + 192 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 206, + 431, + 216 + ], + "lines": [ + { + "bbox": [ + 106, + 205, + 432, + 218 + ], + "spans": [ + { + "bbox": [ + 106, + 205, + 432, + 218 + ], + "score": 1.0, + "content": "3.4 APPLICATIONS OF HOMOGENEOUS LINEAR INEQUALITY CONSTRAINTS", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 107, + 225, + 505, + 292 + ], + "lines": [ + { + "bbox": [ + 105, + 225, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 304, + 239 + ], + "score": 1.0, + "content": "A natural application of constraints of the form", + "type": "text" + }, + { + "bbox": [ + 305, + 226, + 341, + 237 + ], + "score": 0.91, + "content": "A x \\le 0", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 225, + 505, + 239 + ], + "score": 1.0, + "content": "is a parameterization of a set of binary", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 236, + 506, + 250 + ], + "spans": [ + { + "bbox": [ + 105, + 236, + 202, + 250 + ], + "score": 1.0, + "content": "classifiers. If each row", + "type": "text" + }, + { + "bbox": [ + 202, + 239, + 212, + 248 + ], + "score": 0.81, + "content": "a _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 236, + 225, + 250 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 225, + 237, + 234, + 246 + ], + "score": 0.8, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 236, + 506, + 250 + ], + "score": 1.0, + "content": "is such a binary classifier, then the method presented in this paper", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 247, + 506, + 260 + ], + "spans": [ + { + "bbox": [ + 104, + 247, + 196, + 260 + ], + "score": 1.0, + "content": "parameterizes the set", + "type": "text" + }, + { + "bbox": [ + 196, + 247, + 268, + 260 + ], + "score": 0.92, + "content": "\\{ x | a _ { i } ^ { T } x \\le 0 \\ \\forall i \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 247, + 506, + 260 + ], + "score": 1.0, + "content": ". Consequently, it can be guaranteed that neural network", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 259, + 505, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 259, + 505, + 272 + ], + "score": 1.0, + "content": "activations satisfy a set of binary criteria. Another domain is to express certain direct relations", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 270, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 505, + 282 + ], + "score": 1.0, + "content": "between neural network activations. Notably, one can guarantee mathematical properties such as", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 281, + 394, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 177, + 294 + ], + "score": 1.0, + "content": "monotonicity via", + "type": "text" + }, + { + "bbox": [ + 177, + 281, + 219, + 293 + ], + "score": 0.92, + "content": "x _ { i + 1 } \\geq x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 281, + 293, + 294 + ], + "score": 1.0, + "content": "and convexity via", + "type": "text" + }, + { + "bbox": [ + 293, + 281, + 390, + 293 + ], + "score": 0.93, + "content": "x _ { i + 1 } - 2 x _ { i } + x _ { i - 1 } \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 281, + 394, + 294 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 12.5, + "bbox_fs": [ + 104, + 225, + 506, + 294 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 307, + 392, + 317 + ], + "lines": [ + { + "bbox": [ + 105, + 305, + 394, + 319 + ], + "spans": [ + { + "bbox": [ + 105, + 305, + 394, + 319 + ], + "score": 1.0, + "content": "3.5 EXTENSION TO GENERAL LINEAR INEQUALITY CONSTRAINTS", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 106, + 326, + 505, + 450 + ], + "lines": [ + { + "bbox": [ + 105, + 326, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 505, + 339 + ], + "score": 1.0, + "content": "The proposed method takes advantage of the special structure of a polyhedral cone to efficiently", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 338, + 506, + 351 + ], + "spans": [ + { + "bbox": [ + 106, + 338, + 506, + 351 + ], + "score": 1.0, + "content": "combine modeling and domain constraints (Section 3.3). General linear inequality constraints of", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 348, + 506, + 361 + ], + "spans": [ + { + "bbox": [ + 105, + 348, + 143, + 361 + ], + "score": 1.0, + "content": "the form", + "type": "text" + }, + { + "bbox": [ + 144, + 349, + 176, + 360 + ], + "score": 0.91, + "content": "A x \\leq b", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 348, + 270, + 361 + ], + "score": 1.0, + "content": "without restrictions on", + "type": "text" + }, + { + "bbox": [ + 271, + 349, + 279, + 358 + ], + "score": 0.72, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 348, + 297, + 361 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 297, + 349, + 303, + 358 + ], + "score": 0.7, + "content": "b", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 348, + 506, + 361 + ], + "score": 1.0, + "content": "possibly require the conic and convex component", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 359, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 359, + 169, + 372 + ], + "score": 1.0, + "content": "of (3) for their", + "type": "text" + }, + { + "bbox": [ + 170, + 360, + 178, + 370 + ], + "score": 0.28, + "content": "\\mathrm { v } .", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 359, + 505, + 372 + ], + "score": 1.0, + "content": "-representation. The main approach of this paper may be used in this case, i.e.,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 370, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 505, + 383 + ], + "score": 1.0, + "content": "our layer additionally needs to predict convex combination parameters. However, we observed", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 382, + 505, + 393 + ], + "spans": [ + { + "bbox": [ + 106, + 382, + 505, + 393 + ], + "score": 1.0, + "content": "slow convergence, which we ascribe to the simplex parameterization for the convex combination", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 103, + 390, + 507, + 409 + ], + "spans": [ + { + "bbox": [ + 103, + 390, + 267, + 409 + ], + "score": 1.0, + "content": "parameters. We used a softmax function", + "type": "text" + }, + { + "bbox": [ + 267, + 392, + 402, + 406 + ], + "score": 0.93, + "content": "f ( x ) _ { i } = { \\mathrm { { \\bar { e x p } } } ( x _ { i } ) } / { \\sum _ { j = 1 } ^ { m } \\exp ( x _ { j } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 390, + 507, + 409 + ], + "score": 1.0, + "content": "to enforce the constraints", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 402, + 507, + 422 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 198, + 418 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\lambda _ { i } \\ge 0 , \\sum _ { i = 1 } ^ { m } \\lambda _ { i } = 1 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 402, + 507, + 422 + ], + "score": 1.0, + "content": "of the convex combination parameters in (3). This function has vanishing", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 416, + 506, + 429 + ], + "spans": [ + { + "bbox": [ + 104, + 416, + 187, + 429 + ], + "score": 1.0, + "content": "gradients when one", + "type": "text" + }, + { + "bbox": [ + 187, + 419, + 198, + 428 + ], + "score": 0.82, + "content": "x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 416, + 506, + 429 + ], + "score": 1.0, + "content": "is significantly greater than the other vector entries. Furthermore, this most", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 427, + 506, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 427, + 506, + 441 + ], + "score": 1.0, + "content": "general setting does not allow for efficient incorporation of domain constraints, as this would require", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 438, + 495, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 495, + 451 + ], + "score": 1.0, + "content": "an efficient parameterization of the intersection of a general convex polyhedron and the unit box.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 22, + "bbox_fs": [ + 103, + 326, + 507, + 451 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 466, + 239, + 479 + ], + "lines": [ + { + "bbox": [ + 105, + 465, + 240, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 240, + 481 + ], + "score": 1.0, + "content": "4 NUMERICAL RESULTS", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 106, + 492, + 505, + 590 + ], + "lines": [ + { + "bbox": [ + 106, + 492, + 504, + 504 + ], + "spans": [ + { + "bbox": [ + 106, + 492, + 504, + 504 + ], + "score": 1.0, + "content": "We compare the proposed constraint parameterization algorithm with an algorithm that trains with-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 502, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 505, + 516 + ], + "score": 1.0, + "content": "out constraints, but requires a projection step at test time. We call this latter algorithm test time", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 513, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 104, + 513, + 505, + 527 + ], + "score": 1.0, + "content": "projection. We analyze these algorithms in two different settings. In an initial experiment, we learn", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 525, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 505, + 538 + ], + "score": 1.0, + "content": "the orthogonal projection onto a constraint set to demonstrate properties of these algorithms. Here,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 536, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 506, + 549 + ], + "score": 1.0, + "content": "the result can be compared to the optimal solution of the convex optimization problem. In a second", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 546, + 504, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 504, + 559 + ], + "score": 1.0, + "content": "experiment, consistent with our motivation to constrain the output of generative models, we apply", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 557, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 106, + 557, + 505, + 570 + ], + "score": 1.0, + "content": "these algorithms to a variational autoencoder. Finally, we evaluate the running time of inference for", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 567, + 506, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 506, + 582 + ], + "score": 1.0, + "content": "these problems and show that the proposed algorithm is significantly more efficient compared to the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 580, + 220, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 580, + 220, + 591 + ], + "score": 1.0, + "content": "test time projection method.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 33, + "bbox_fs": [ + 104, + 492, + 506, + 591 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 596, + 504, + 663 + ], + "lines": [ + { + "bbox": [ + 105, + 595, + 506, + 609 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 506, + 609 + ], + "score": 1.0, + "content": "We used the MNIST dataset (LeCun et al.) for both experiments (59000 training, 1000 validation,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 607, + 506, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 506, + 619 + ], + "score": 1.0, + "content": "and 10000 test samples). We chose PyTorch (Paszke et al., 2017) for our implementation3 and all", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 618, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 618, + 506, + 630 + ], + "score": 1.0, + "content": "experiments were performed on a single Nvidia Titan X GPU. All networks were optimized with the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 628, + 506, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 352, + 642 + ], + "score": 1.0, + "content": "Adam optimizer and we evaluated learning rates in the range", + "type": "text" + }, + { + "bbox": [ + 352, + 628, + 403, + 641 + ], + "score": 0.91, + "content": "[ 1 0 ^ { - 5 } , 1 0 ^ { - 3 } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 628, + 506, + 642 + ], + "score": 1.0, + "content": ". The initial learning rate", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 640, + 505, + 652 + ], + "spans": [ + { + "bbox": [ + 106, + 641, + 218, + 652 + ], + "score": 1.0, + "content": "was annealed by a factor of", + "type": "text" + }, + { + "bbox": [ + 218, + 640, + 235, + 652 + ], + "score": 0.54, + "content": "1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 641, + 505, + 652 + ], + "score": 1.0, + "content": "if progress on the validation loss stagnated for more than 5 epochs.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 650, + 483, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 483, + 664 + ], + "score": 1.0, + "content": "We used OSQP (Stellato et al., 2017) as an efficient solver to compute orthogonal projections.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 40.5, + "bbox_fs": [ + 105, + 595, + 506, + 664 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 668, + 504, + 712 + ], + "lines": [ + { + "bbox": [ + 106, + 668, + 505, + 680 + ], + "spans": [ + { + "bbox": [ + 106, + 668, + 505, + 680 + ], + "score": 1.0, + "content": "Both experiments were performed with a checkerboard constraint with 16 tiles, where neighbor-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 679, + 506, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 679, + 506, + 691 + ], + "score": 1.0, + "content": "ing tiles are constrained to be on average either below or above pixel domain midpoint. For a", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 107, + 690, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 107, + 690, + 135, + 702 + ], + "score": 0.9, + "content": "[ - 1 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 136, + 690, + 505, + 703 + ], + "score": 1.0, + "content": "-pixel domain, the tiles’ average intensity is positive or negative, respectively. The initial", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 701, + 505, + 714 + ], + "spans": [ + { + "bbox": [ + 105, + 701, + 329, + 714 + ], + "score": 1.0, + "content": "computational cost of converting these constraints into", + "type": "text" + }, + { + "bbox": [ + 329, + 702, + 338, + 711 + ], + "score": 0.26, + "content": "\\mathrm { v } .", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 701, + 505, + 714 + ], + "score": 1.0, + "content": "-representation via the double description", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "method is negligible (less than 1s). We observed that it is numerically advantageous to activate unit", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 506, + 107 + ], + "score": 1.0, + "content": "box scaling after the constraint parameterization model was initially optimized only with modeling", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 286, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 286, + 117 + ], + "score": 1.0, + "content": "constraints for a specified number of epochs.", + "type": "text", + "cross_page": true + } + ], + "index": 2 + } + ], + "index": 45.5, + "bbox_fs": [ + 105, + 668, + 506, + 714 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "method is negligible (less than 1s). We observed that it is numerically advantageous to activate unit", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 506, + 107 + ], + "score": 1.0, + "content": "box scaling after the constraint parameterization model was initially optimized only with modeling", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 286, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 286, + 117 + ], + "score": 1.0, + "content": "constraints for a specified number of epochs.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 107, + 120, + 505, + 210 + ], + "lines": [ + { + "bbox": [ + 106, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 106, + 121, + 505, + 134 + ], + "score": 1.0, + "content": "One might consider OptNet (Amos & Kolter, 2017) and an analogous version of the method intro-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 505, + 145 + ], + "score": 1.0, + "content": "duced by Pathak et al. (2015) as baselines. However, these approaches incur a significant drawback", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "score": 1.0, + "content": "for the setup presented in this paper as they are are computationally expensive at training time. An", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "score": 1.0, + "content": "OptNet layer solves a generic quadratic program as a differentiable network layer, which scales cu-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 505, + 178 + ], + "score": 1.0, + "content": "bically with the number of variables and constraints. The method by Pathak et al. (2015) for the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "score": 1.0, + "content": "regression problems in this paper alternates between optimization steps in the network parameters", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 188, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 188, + 506, + 200 + ], + "score": 1.0, + "content": "via a variant of stochastic gradient descent and projecting the network output onto the constraints,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 198, + 254, + 211 + ], + "spans": [ + { + "bbox": [ + 106, + 198, + 254, + 211 + ], + "score": 1.0, + "content": "which is computationally expensive.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 6.5 + }, + { + "type": "title", + "bbox": [ + 106, + 247, + 359, + 258 + ], + "lines": [ + { + "bbox": [ + 105, + 246, + 360, + 259 + ], + "spans": [ + { + "bbox": [ + 105, + 246, + 360, + 259 + ], + "score": 1.0, + "content": "4.1 ORTHOGONAL PROJECTION ONTO A CONSTRAINT SET", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 276, + 505, + 299 + ], + "lines": [ + { + "bbox": [ + 106, + 275, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 505, + 290 + ], + "score": 1.0, + "content": "We learn an orthogonal projection to demonstrate general properties of both algorithms. For given", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 287, + 432, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 432, + 300 + ], + "score": 1.0, + "content": "linear inequalities specified in H-representation, we solve the following problem:", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 325, + 375, + 345 + ], + "lines": [ + { + "bbox": [ + 236, + 325, + 375, + 345 + ], + "spans": [ + { + "bbox": [ + 236, + 325, + 375, + 345 + ], + "score": 0.92, + "content": "\\operatorname* { m i n } _ { z \\in \\mathbb { R } ^ { d } } \\left\\| z - y \\right\\| _ { 2 } \\quad \\mathrm { s . t . } A z \\leq 0 \\qquad ,", + "type": "interline_equation", + "image_path": "74fc678c3f170e82d36e5079493783b48948763b7547bae099077e8fe93f45c2.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 236, + 325, + 375, + 345 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 370, + 505, + 449 + ], + "lines": [ + { + "bbox": [ + 106, + 371, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 106, + 371, + 134, + 383 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 373, + 141, + 383 + ], + "score": 0.79, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 371, + 505, + 383 + ], + "score": 1.0, + "content": "is an MNIST image. Here, the problem is convex; therefore, the global optimum can be", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 382, + 506, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 506, + 394 + ], + "score": 1.0, + "content": "readily computed and compared to the performance of the learning algorithms. In this setting, we", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 393, + 506, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 506, + 405 + ], + "score": 1.0, + "content": "can expect that training an unconstrained network with subsequent projection onto the constraint set", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 403, + 506, + 418 + ], + "spans": [ + { + "bbox": [ + 104, + 403, + 366, + 418 + ], + "score": 1.0, + "content": "at test time yields good results, which can be seen as follows. Let", + "type": "text" + }, + { + "bbox": [ + 367, + 404, + 492, + 416 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathcal { P } c ( y ) : = \\arg \\operatorname* { m i n } _ { z \\in \\mathcal { C } } \\| z - y \\| _ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 492, + 403, + 506, + 418 + ], + "score": 1.0, + "content": "be", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 414, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 104, + 414, + 302, + 428 + ], + "score": 1.0, + "content": "the orthogonal projection onto the constraint set", + "type": "text" + }, + { + "bbox": [ + 302, + 415, + 309, + 425 + ], + "score": 0.77, + "content": "\\mathcal { C }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 414, + 464, + 428 + ], + "score": 1.0, + "content": "and denote the mean-squared error as", + "type": "text" + }, + { + "bbox": [ + 464, + 416, + 505, + 427 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { y } ( x ) : =", + "type": "inline_equation" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 425, + 505, + 439 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 144, + 438 + ], + "score": 0.9, + "content": "\\| x - y \\| _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 425, + 412, + 439 + ], + "score": 1.0, + "content": ". Both mappings are Lipschitz continuous with Lipschitz constant", + "type": "text" + }, + { + "bbox": [ + 412, + 426, + 440, + 436 + ], + "score": 0.9, + "content": "L = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 425, + 505, + 439 + ], + "score": 1.0, + "content": ". Consequently,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 437, + 280, + 449 + ], + "spans": [ + { + "bbox": [ + 105, + 437, + 160, + 449 + ], + "score": 1.0, + "content": "for an output", + "type": "text" + }, + { + "bbox": [ + 160, + 438, + 167, + 448 + ], + "score": 0.85, + "content": "\\hat { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 437, + 280, + 449 + ], + "score": 1.0, + "content": "of an unconstrained model,", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 18 + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 474, + 433, + 502 + ], + "lines": [ + { + "bbox": [ + 177, + 474, + 433, + 502 + ], + "spans": [ + { + "bbox": [ + 177, + 474, + 433, + 502 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\displaystyle \\Big | \\mathcal { L } _ { y } ( \\mathcal { P } _ { \\mathcal { C } } ( \\hat { y } ) ) - \\mathcal { L } _ { y } ( \\mathcal { P } _ { \\mathcal { C } } ( y ) ) \\Big | \\le \\left\\| \\mathcal { P } _ { \\mathcal { C } } ( \\hat { y } ) - \\mathcal { P } _ { \\mathcal { C } } ( y ) \\right\\| _ { 2 } \\le \\left\\| \\hat { y } - y \\right\\| _ { 2 } , } \\end{array}", + "type": "interline_equation", + "image_path": "920f3f8c46ba6ecacc05ead4128f3ba6ca78c605e3362ed6634c6044f0a99b5d.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 177, + 474, + 433, + 483.3333333333333 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 177, + 483.3333333333333, + 433, + 492.66666666666663 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 177, + 492.66666666666663, + 433, + 501.99999999999994 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 527, + 505, + 562 + ], + "lines": [ + { + "bbox": [ + 105, + 527, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 225, + 542 + ], + "score": 1.0, + "content": "where, by definition, the term", + "type": "text" + }, + { + "bbox": [ + 225, + 528, + 270, + 540 + ], + "score": 0.95, + "content": "\\mathcal { L } _ { y } ( \\mathcal { P } c ( y ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 527, + 505, + 542 + ], + "score": 1.0, + "content": "is the optimal value of problem (6). The training algorithm", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 122, + 552 + ], + "score": 1.0, + "content": "fits", + "type": "text" + }, + { + "bbox": [ + 122, + 540, + 129, + 551 + ], + "score": 0.85, + "content": "\\hat { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 539, + 142, + 552 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 142, + 541, + 150, + 551 + ], + "score": 0.76, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 539, + 346, + 552 + ], + "score": 1.0, + "content": "; therefore, projecting the unconstrained output", + "type": "text" + }, + { + "bbox": [ + 346, + 540, + 353, + 551 + ], + "score": 0.84, + "content": "\\hat { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 539, + 506, + 552 + ], + "score": 1.0, + "content": "onto the constraint set will yield an", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 550, + 465, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 465, + 563 + ], + "score": 1.0, + "content": "objective value that is close to the optimal value of the constrained optimization problem.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 567, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "score": 1.0, + "content": "To have a comparable number of parameters for both methods, we use a single fully-connected", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 578, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 372, + 591 + ], + "score": 1.0, + "content": "layer in both cases. For the unconstrained model, we employ an", + "type": "text" + }, + { + "bbox": [ + 372, + 578, + 430, + 590 + ], + "score": 0.87, + "content": "F C ( 7 8 4 , 7 8 4 )", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 578, + 505, + 591 + ], + "score": 1.0, + "content": "layer, and for the", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 589, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 589, + 244, + 601 + ], + "score": 1.0, + "content": "constrained model we employ an", + "type": "text" + }, + { + "bbox": [ + 245, + 589, + 299, + 601 + ], + "score": 0.92, + "content": "F C ( 7 8 4 , n _ { r } )", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 589, + 344, + 601 + ], + "score": 1.0, + "content": "layer with", + "type": "text" + }, + { + "bbox": [ + 345, + 590, + 393, + 600 + ], + "score": 0.89, + "content": "n _ { r } = 1 5 5 2", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 589, + 505, + 601 + ], + "score": 1.0, + "content": "many rays to represent the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 600, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 505, + 613 + ], + "score": 1.0, + "content": "constraint set in V-representation. Additionally, the constraint layer first applies a batch normaliza-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 611, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 611, + 505, + 622 + ], + "score": 1.0, + "content": "tion operation (Ioffe & Szegedy, 2015). Both models were optimized with an initial learning rate of", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 620, + 506, + 636 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 128, + 632 + ], + "score": 0.88, + "content": "1 0 ^ { - 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 128, + 620, + 506, + 636 + ], + "score": 1.0, + "content": ", which was annealed by a factor of 0.1 if progress on the validation loss stagnated for more", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 633, + 504, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 504, + 645 + ], + "score": 1.0, + "content": "than 5 epochs. The batch size was chosen to be 256. The unit box constraints were activated after 25", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 643, + 506, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 506, + 656 + ], + "score": 1.0, + "content": "epochs. Additionally, the data for training the model with all constraints being active is shown. This", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "score": 1.0, + "content": "mode eventually results in worse generalization. Figure 3 shows that the mean-squared validation", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "objective for both algorithms converges close to the average optimum. The constraint parameteri-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "score": 1.0, + "content": "zation method has a larger variance and optimality gap, which hints at the numerical difficulty of", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "score": 1.0, + "content": "training the constrained network. To be precise, the best average validation error during training is", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 133, + 711 + ], + "score": 1.0, + "content": "within", + "type": "text" + }, + { + "bbox": [ + 134, + 699, + 149, + 709 + ], + "score": 0.87, + "content": "9 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 698, + 426, + 711 + ], + "score": 1.0, + "content": "of the optimum for the constraint parameterization method and within", + "type": "text" + }, + { + "bbox": [ + 426, + 699, + 441, + 709 + ], + "score": 0.88, + "content": "1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "of the optimum", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "for the test time projection method. Figure 4 shows a test set sample and the respective output of the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 720, + 173, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 173, + 732 + ], + "score": 1.0, + "content": "learned models.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 35 + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "6", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 116 + ], + "lines": [], + "index": 1, + "bbox_fs": [ + 105, + 81, + 506, + 117 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 120, + 505, + 210 + ], + "lines": [ + { + "bbox": [ + 106, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 106, + 121, + 505, + 134 + ], + "score": 1.0, + "content": "One might consider OptNet (Amos & Kolter, 2017) and an analogous version of the method intro-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 505, + 145 + ], + "score": 1.0, + "content": "duced by Pathak et al. (2015) as baselines. However, these approaches incur a significant drawback", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "score": 1.0, + "content": "for the setup presented in this paper as they are are computationally expensive at training time. An", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "score": 1.0, + "content": "OptNet layer solves a generic quadratic program as a differentiable network layer, which scales cu-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 505, + 178 + ], + "score": 1.0, + "content": "bically with the number of variables and constraints. The method by Pathak et al. (2015) for the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "score": 1.0, + "content": "regression problems in this paper alternates between optimization steps in the network parameters", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 188, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 188, + 506, + 200 + ], + "score": 1.0, + "content": "via a variant of stochastic gradient descent and projecting the network output onto the constraints,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 198, + 254, + 211 + ], + "spans": [ + { + "bbox": [ + 106, + 198, + 254, + 211 + ], + "score": 1.0, + "content": "which is computationally expensive.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 6.5, + "bbox_fs": [ + 105, + 121, + 506, + 211 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 247, + 359, + 258 + ], + "lines": [ + { + "bbox": [ + 105, + 246, + 360, + 259 + ], + "spans": [ + { + "bbox": [ + 105, + 246, + 360, + 259 + ], + "score": 1.0, + "content": "4.1 ORTHOGONAL PROJECTION ONTO A CONSTRAINT SET", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 276, + 505, + 299 + ], + "lines": [ + { + "bbox": [ + 106, + 275, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 505, + 290 + ], + "score": 1.0, + "content": "We learn an orthogonal projection to demonstrate general properties of both algorithms. For given", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 287, + 432, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 432, + 300 + ], + "score": 1.0, + "content": "linear inequalities specified in H-representation, we solve the following problem:", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 106, + 275, + 505, + 300 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 325, + 375, + 345 + ], + "lines": [ + { + "bbox": [ + 236, + 325, + 375, + 345 + ], + "spans": [ + { + "bbox": [ + 236, + 325, + 375, + 345 + ], + "score": 0.92, + "content": "\\operatorname* { m i n } _ { z \\in \\mathbb { R } ^ { d } } \\left\\| z - y \\right\\| _ { 2 } \\quad \\mathrm { s . t . } A z \\leq 0 \\qquad ,", + "type": "interline_equation", + "image_path": "74fc678c3f170e82d36e5079493783b48948763b7547bae099077e8fe93f45c2.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 236, + 325, + 375, + 345 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 370, + 505, + 449 + ], + "lines": [ + { + "bbox": [ + 106, + 371, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 106, + 371, + 134, + 383 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 373, + 141, + 383 + ], + "score": 0.79, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 371, + 505, + 383 + ], + "score": 1.0, + "content": "is an MNIST image. Here, the problem is convex; therefore, the global optimum can be", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 382, + 506, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 506, + 394 + ], + "score": 1.0, + "content": "readily computed and compared to the performance of the learning algorithms. In this setting, we", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 393, + 506, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 506, + 405 + ], + "score": 1.0, + "content": "can expect that training an unconstrained network with subsequent projection onto the constraint set", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 403, + 506, + 418 + ], + "spans": [ + { + "bbox": [ + 104, + 403, + 366, + 418 + ], + "score": 1.0, + "content": "at test time yields good results, which can be seen as follows. Let", + "type": "text" + }, + { + "bbox": [ + 367, + 404, + 492, + 416 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathcal { P } c ( y ) : = \\arg \\operatorname* { m i n } _ { z \\in \\mathcal { C } } \\| z - y \\| _ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 492, + 403, + 506, + 418 + ], + "score": 1.0, + "content": "be", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 414, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 104, + 414, + 302, + 428 + ], + "score": 1.0, + "content": "the orthogonal projection onto the constraint set", + "type": "text" + }, + { + "bbox": [ + 302, + 415, + 309, + 425 + ], + "score": 0.77, + "content": "\\mathcal { C }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 414, + 464, + 428 + ], + "score": 1.0, + "content": "and denote the mean-squared error as", + "type": "text" + }, + { + "bbox": [ + 464, + 416, + 505, + 427 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { y } ( x ) : =", + "type": "inline_equation" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 425, + 505, + 439 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 144, + 438 + ], + "score": 0.9, + "content": "\\| x - y \\| _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 425, + 412, + 439 + ], + "score": 1.0, + "content": ". Both mappings are Lipschitz continuous with Lipschitz constant", + "type": "text" + }, + { + "bbox": [ + 412, + 426, + 440, + 436 + ], + "score": 0.9, + "content": "L = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 425, + 505, + 439 + ], + "score": 1.0, + "content": ". Consequently,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 437, + 280, + 449 + ], + "spans": [ + { + "bbox": [ + 105, + 437, + 160, + 449 + ], + "score": 1.0, + "content": "for an output", + "type": "text" + }, + { + "bbox": [ + 160, + 438, + 167, + 448 + ], + "score": 0.85, + "content": "\\hat { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 437, + 280, + 449 + ], + "score": 1.0, + "content": "of an unconstrained model,", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 18, + "bbox_fs": [ + 104, + 371, + 506, + 449 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 474, + 433, + 502 + ], + "lines": [ + { + "bbox": [ + 177, + 474, + 433, + 502 + ], + "spans": [ + { + "bbox": [ + 177, + 474, + 433, + 502 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\displaystyle \\Big | \\mathcal { L } _ { y } ( \\mathcal { P } _ { \\mathcal { C } } ( \\hat { y } ) ) - \\mathcal { L } _ { y } ( \\mathcal { P } _ { \\mathcal { C } } ( y ) ) \\Big | \\le \\left\\| \\mathcal { P } _ { \\mathcal { C } } ( \\hat { y } ) - \\mathcal { P } _ { \\mathcal { C } } ( y ) \\right\\| _ { 2 } \\le \\left\\| \\hat { y } - y \\right\\| _ { 2 } , } \\end{array}", + "type": "interline_equation", + "image_path": "920f3f8c46ba6ecacc05ead4128f3ba6ca78c605e3362ed6634c6044f0a99b5d.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 177, + 474, + 433, + 483.3333333333333 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 177, + 483.3333333333333, + 433, + 492.66666666666663 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 177, + 492.66666666666663, + 433, + 501.99999999999994 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 527, + 505, + 562 + ], + "lines": [ + { + "bbox": [ + 105, + 527, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 225, + 542 + ], + "score": 1.0, + "content": "where, by definition, the term", + "type": "text" + }, + { + "bbox": [ + 225, + 528, + 270, + 540 + ], + "score": 0.95, + "content": "\\mathcal { L } _ { y } ( \\mathcal { P } c ( y ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 527, + 505, + 542 + ], + "score": 1.0, + "content": "is the optimal value of problem (6). The training algorithm", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 122, + 552 + ], + "score": 1.0, + "content": "fits", + "type": "text" + }, + { + "bbox": [ + 122, + 540, + 129, + 551 + ], + "score": 0.85, + "content": "\\hat { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 539, + 142, + 552 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 142, + 541, + 150, + 551 + ], + "score": 0.76, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 539, + 346, + 552 + ], + "score": 1.0, + "content": "; therefore, projecting the unconstrained output", + "type": "text" + }, + { + "bbox": [ + 346, + 540, + 353, + 551 + ], + "score": 0.84, + "content": "\\hat { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 539, + 506, + 552 + ], + "score": 1.0, + "content": "onto the constraint set will yield an", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 550, + 465, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 465, + 563 + ], + "score": 1.0, + "content": "objective value that is close to the optimal value of the constrained optimization problem.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 527, + 506, + 563 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 567, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "score": 1.0, + "content": "To have a comparable number of parameters for both methods, we use a single fully-connected", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 578, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 372, + 591 + ], + "score": 1.0, + "content": "layer in both cases. For the unconstrained model, we employ an", + "type": "text" + }, + { + "bbox": [ + 372, + 578, + 430, + 590 + ], + "score": 0.87, + "content": "F C ( 7 8 4 , 7 8 4 )", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 578, + 505, + 591 + ], + "score": 1.0, + "content": "layer, and for the", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 589, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 589, + 244, + 601 + ], + "score": 1.0, + "content": "constrained model we employ an", + "type": "text" + }, + { + "bbox": [ + 245, + 589, + 299, + 601 + ], + "score": 0.92, + "content": "F C ( 7 8 4 , n _ { r } )", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 589, + 344, + 601 + ], + "score": 1.0, + "content": "layer with", + "type": "text" + }, + { + "bbox": [ + 345, + 590, + 393, + 600 + ], + "score": 0.89, + "content": "n _ { r } = 1 5 5 2", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 589, + 505, + 601 + ], + "score": 1.0, + "content": "many rays to represent the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 600, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 505, + 613 + ], + "score": 1.0, + "content": "constraint set in V-representation. Additionally, the constraint layer first applies a batch normaliza-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 611, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 611, + 505, + 622 + ], + "score": 1.0, + "content": "tion operation (Ioffe & Szegedy, 2015). Both models were optimized with an initial learning rate of", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 620, + 506, + 636 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 128, + 632 + ], + "score": 0.88, + "content": "1 0 ^ { - 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 128, + 620, + 506, + 636 + ], + "score": 1.0, + "content": ", which was annealed by a factor of 0.1 if progress on the validation loss stagnated for more", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 633, + 504, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 504, + 645 + ], + "score": 1.0, + "content": "than 5 epochs. The batch size was chosen to be 256. The unit box constraints were activated after 25", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 643, + 506, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 506, + 656 + ], + "score": 1.0, + "content": "epochs. Additionally, the data for training the model with all constraints being active is shown. This", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "score": 1.0, + "content": "mode eventually results in worse generalization. Figure 3 shows that the mean-squared validation", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "objective for both algorithms converges close to the average optimum. The constraint parameteri-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "score": 1.0, + "content": "zation method has a larger variance and optimality gap, which hints at the numerical difficulty of", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "score": 1.0, + "content": "training the constrained network. To be precise, the best average validation error during training is", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 133, + 711 + ], + "score": 1.0, + "content": "within", + "type": "text" + }, + { + "bbox": [ + 134, + 699, + 149, + 709 + ], + "score": 0.87, + "content": "9 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 698, + 426, + 711 + ], + "score": 1.0, + "content": "of the optimum for the constraint parameterization method and within", + "type": "text" + }, + { + "bbox": [ + 426, + 699, + 441, + 709 + ], + "score": 0.88, + "content": "1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "of the optimum", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "for the test time projection method. Figure 4 shows a test set sample and the respective output of the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 720, + 173, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 173, + 732 + ], + "score": 1.0, + "content": "learned models.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 566, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 186, + 82, + 419, + 188 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 186, + 82, + 419, + 188 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 186, + 82, + 419, + 188 + ], + "spans": [ + { + "bbox": [ + 186, + 82, + 419, + 188 + ], + "score": 0.97, + "type": "image", + "image_path": "ccb26edf90e7c914ec8c93ff4de1521e67d3e69261ccf2961a943d7f3e77649f.jpg" + } + ] + } + ], + "index": 3.5, + "virtual_lines": [ + { + "bbox": [ + 186, + 82, + 419, + 95.25 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 186, + 95.25, + 419, + 108.5 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 186, + 108.5, + 419, + 121.75 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 186, + 121.75, + 419, + 135.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 186, + 135.0, + 419, + 148.25 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 186, + 148.25, + 419, + 161.5 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 186, + 161.5, + 419, + 174.75 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 186, + 174.75, + 419, + 188.0 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 201, + 505, + 290 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 203, + 505, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 203, + 505, + 213 + ], + "score": 1.0, + "content": "Figure 3: Mean-squared validation loss averaged over all pixels for 10 runs; shaded area denotes", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 213, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 106, + 213, + 505, + 225 + ], + "score": 1.0, + "content": "standard deviation. The objective function (6) is computed on a held-out validation set for the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 224, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 224, + 505, + 237 + ], + "score": 1.0, + "content": "proposed constraint parameterization method and unconstrained optimization with subsequent test", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 235, + 506, + 247 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 506, + 247 + ], + "score": 1.0, + "content": "time projection. The average optimum over the validation set is obtained as a solution to a convex", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 246, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 106, + 246, + 505, + 258 + ], + "score": 1.0, + "content": "optimization problem. For the box delay curve, the box constraints are activated after 25 epochs", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 255, + 506, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 129, + 270 + ], + "score": 1.0, + "content": "(after", + "type": "text" + }, + { + "bbox": [ + 130, + 257, + 156, + 267 + ], + "score": 0.75, + "content": "\\sim \\mathrm { 3 0 s }", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 255, + 506, + 270 + ], + "score": 1.0, + "content": "), which results in better generalization. The best average validation error during training", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 267, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 104, + 267, + 144, + 281 + ], + "score": 1.0, + "content": "is within", + "type": "text" + }, + { + "bbox": [ + 144, + 268, + 159, + 278 + ], + "score": 0.86, + "content": "9 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 267, + 505, + 281 + ], + "score": 1.0, + "content": "of the optimum for the constraint parameterization method with box constraint delay", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 278, + 374, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 151, + 291 + ], + "score": 1.0, + "content": "and within", + "type": "text" + }, + { + "bbox": [ + 151, + 279, + 166, + 289 + ], + "score": 0.86, + "content": "1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 278, + 374, + 291 + ], + "score": 1.0, + "content": "of the optimum for the test time projection method.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 11.5 + } + ], + "index": 7.5 + }, + { + "type": "image", + "bbox": [ + 127, + 313, + 482, + 396 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 127, + 313, + 482, + 396 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 127, + 313, + 482, + 396 + ], + "spans": [ + { + "bbox": [ + 127, + 313, + 482, + 396 + ], + "score": 0.973, + "type": "image", + "image_path": "49fc0106d7c90222b808e52dcf5a411c2b40977fc67fcc1408d6bbddb9492dbf.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 127, + 313, + 482, + 340.6666666666667 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 127, + 340.6666666666667, + 482, + 368.33333333333337 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 127, + 368.33333333333337, + 482, + 396.00000000000006 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 407, + 505, + 441 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 407, + 505, + 420 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 505, + 420 + ], + "score": 1.0, + "content": "Figure 4: Learning to solve the orthogonal projection onto a constraint set as defined in (6). From", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 417, + 505, + 431 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 505, + 431 + ], + "score": 1.0, + "content": "left to right: MNIST sample from a test set, optimal projection by solving a quadratic program,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 429, + 453, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 429, + 453, + 442 + ], + "score": 1.0, + "content": "constraint parameterization model inference, and test time projection model inference.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20 + } + ], + "index": 18.5 + }, + { + "type": "title", + "bbox": [ + 106, + 461, + 459, + 471 + ], + "lines": [ + { + "bbox": [ + 105, + 460, + 460, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 460, + 473 + ], + "score": 1.0, + "content": "4.2 CONSTRAINED GENERATIVE MODELING WITH VARIATIONAL AUTOENCODERS", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 480, + 505, + 525 + ], + "lines": [ + { + "bbox": [ + 106, + 481, + 504, + 493 + ], + "spans": [ + { + "bbox": [ + 106, + 481, + 504, + 493 + ], + "score": 1.0, + "content": "Variational autoencoders (VAE) are a class of generative models that are jointly trained to encode", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 492, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 106, + 492, + 505, + 504 + ], + "score": 1.0, + "content": "observations into latent variables via an encoder or inference network and decode observations from", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 502, + 506, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 506, + 516 + ], + "score": 1.0, + "content": "latent variables using a decoder or generative network (Kingma & Welling, 2014). We base our", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 514, + 458, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 458, + 527 + ], + "score": 1.0, + "content": "implementation on (Baumgartner, 2018). The model has a fully-connected architecture: ¨", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 107, + 564, + 505, + 653 + ], + "lines": [ + { + "bbox": [ + 105, + 563, + 505, + 577 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 130, + 577 + ], + "score": 1.0, + "content": "Here,", + "type": "text" + }, + { + "bbox": [ + 131, + 564, + 224, + 577 + ], + "score": 0.9, + "content": "\\mathrm { R e L U } ( x ) = \\operatorname* { m a x } ( 0 , x )", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 563, + 400, + 577 + ], + "score": 1.0, + "content": "and the sigmoid non-linearity takes the form", + "type": "text" + }, + { + "bbox": [ + 401, + 564, + 501, + 577 + ], + "score": 0.91, + "content": "\\sigma ( x ) = 1 / ( 1 { + } \\mathrm { e x p } ( - x ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 563, + 505, + 577 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 576, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 505, + 588 + ], + "score": 1.0, + "content": "In contrast to a standard VAE, we constrain the samples generated by the model to obey a checker-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 586, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 398, + 599 + ], + "score": 1.0, + "content": "board constraint. The model was optimized with an initial learning rate of", + "type": "text" + }, + { + "bbox": [ + 398, + 586, + 420, + 597 + ], + "score": 0.91, + "content": "1 0 ^ { - 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 586, + 505, + 599 + ], + "score": 1.0, + "content": ", which was annealed", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 597, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 505, + 610 + ], + "score": 1.0, + "content": "by a factor of 0.1 if progress on the validation loss stagnated for more than 5 epochs. The batch size", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 608, + 506, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 506, + 621 + ], + "score": 1.0, + "content": "was chosen to be 64. The model was trained for 200 epochs while the unit box constraints were", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 620, + 430, + 632 + ], + "score": 1.0, + "content": "activated after 100 epochs. To generate images, we sample the latent space prior", + "type": "text" + }, + { + "bbox": [ + 430, + 619, + 487, + 631 + ], + "score": 0.93, + "content": "z \\sim \\mathcal { N } ( 0 , I )", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 620, + 505, + 632 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 631, + 505, + 643 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 505, + 643 + ], + "score": 1.0, + "content": "evaluate the decoding neural network (Figure 5). The model is able to sample authentic digits while", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 642, + 256, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 642, + 256, + 654 + ], + "score": 1.0, + "content": "obeying the checkerboard constraint.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 30.5 + }, + { + "type": "title", + "bbox": [ + 110, + 667, + 383, + 678 + ], + "lines": [ + { + "bbox": [ + 108, + 666, + 383, + 679 + ], + "spans": [ + { + "bbox": [ + 108, + 666, + 383, + 679 + ], + "score": 1.0, + "content": "4.3 FAST INFERENCE WITH CONSTRAINED NEURAL NETWORKS", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "The main advantage of the proposed method over a simple projection method is a vast speed-up at", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "test time. Since the constraint is incorporated into the neural network architecture, a forward pass has", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "score": 1.0, + "content": "almost no overhead compared to an unconstrained network. On the other hand, for a network that", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "was trained without constraints, a final projection step is necessary; this requires solving a convex", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37.5 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 303, + 751, + 309, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "score": 1.0, + "content": "7", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 186, + 82, + 419, + 188 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 186, + 82, + 419, + 188 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 186, + 82, + 419, + 188 + ], + "spans": [ + { + "bbox": [ + 186, + 82, + 419, + 188 + ], + "score": 0.97, + "type": "image", + "image_path": "ccb26edf90e7c914ec8c93ff4de1521e67d3e69261ccf2961a943d7f3e77649f.jpg" + } + ] + } + ], + "index": 3.5, + "virtual_lines": [ + { + "bbox": [ + 186, + 82, + 419, + 95.25 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 186, + 95.25, + 419, + 108.5 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 186, + 108.5, + 419, + 121.75 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 186, + 121.75, + 419, + 135.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 186, + 135.0, + 419, + 148.25 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 186, + 148.25, + 419, + 161.5 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 186, + 161.5, + 419, + 174.75 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 186, + 174.75, + 419, + 188.0 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 201, + 505, + 290 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 203, + 505, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 203, + 505, + 213 + ], + "score": 1.0, + "content": "Figure 3: Mean-squared validation loss averaged over all pixels for 10 runs; shaded area denotes", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 213, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 106, + 213, + 505, + 225 + ], + "score": 1.0, + "content": "standard deviation. The objective function (6) is computed on a held-out validation set for the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 224, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 224, + 505, + 237 + ], + "score": 1.0, + "content": "proposed constraint parameterization method and unconstrained optimization with subsequent test", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 235, + 506, + 247 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 506, + 247 + ], + "score": 1.0, + "content": "time projection. The average optimum over the validation set is obtained as a solution to a convex", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 246, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 106, + 246, + 505, + 258 + ], + "score": 1.0, + "content": "optimization problem. For the box delay curve, the box constraints are activated after 25 epochs", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 255, + 506, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 129, + 270 + ], + "score": 1.0, + "content": "(after", + "type": "text" + }, + { + "bbox": [ + 130, + 257, + 156, + 267 + ], + "score": 0.75, + "content": "\\sim \\mathrm { 3 0 s }", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 255, + 506, + 270 + ], + "score": 1.0, + "content": "), which results in better generalization. The best average validation error during training", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 267, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 104, + 267, + 144, + 281 + ], + "score": 1.0, + "content": "is within", + "type": "text" + }, + { + "bbox": [ + 144, + 268, + 159, + 278 + ], + "score": 0.86, + "content": "9 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 267, + 505, + 281 + ], + "score": 1.0, + "content": "of the optimum for the constraint parameterization method with box constraint delay", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 278, + 374, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 151, + 291 + ], + "score": 1.0, + "content": "and within", + "type": "text" + }, + { + "bbox": [ + 151, + 279, + 166, + 289 + ], + "score": 0.86, + "content": "1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 278, + 374, + 291 + ], + "score": 1.0, + "content": "of the optimum for the test time projection method.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 11.5 + } + ], + "index": 7.5 + }, + { + "type": "image", + "bbox": [ + 127, + 313, + 482, + 396 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 127, + 313, + 482, + 396 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 127, + 313, + 482, + 396 + ], + "spans": [ + { + "bbox": [ + 127, + 313, + 482, + 396 + ], + "score": 0.973, + "type": "image", + "image_path": "49fc0106d7c90222b808e52dcf5a411c2b40977fc67fcc1408d6bbddb9492dbf.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 127, + 313, + 482, + 340.6666666666667 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 127, + 340.6666666666667, + 482, + 368.33333333333337 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 127, + 368.33333333333337, + 482, + 396.00000000000006 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 407, + 505, + 441 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 407, + 505, + 420 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 505, + 420 + ], + "score": 1.0, + "content": "Figure 4: Learning to solve the orthogonal projection onto a constraint set as defined in (6). From", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 417, + 505, + 431 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 505, + 431 + ], + "score": 1.0, + "content": "left to right: MNIST sample from a test set, optimal projection by solving a quadratic program,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 429, + 453, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 429, + 453, + 442 + ], + "score": 1.0, + "content": "constraint parameterization model inference, and test time projection model inference.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20 + } + ], + "index": 18.5 + }, + { + "type": "title", + "bbox": [ + 106, + 461, + 459, + 471 + ], + "lines": [ + { + "bbox": [ + 105, + 460, + 460, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 460, + 473 + ], + "score": 1.0, + "content": "4.2 CONSTRAINED GENERATIVE MODELING WITH VARIATIONAL AUTOENCODERS", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 480, + 505, + 525 + ], + "lines": [ + { + "bbox": [ + 106, + 481, + 504, + 493 + ], + "spans": [ + { + "bbox": [ + 106, + 481, + 504, + 493 + ], + "score": 1.0, + "content": "Variational autoencoders (VAE) are a class of generative models that are jointly trained to encode", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 492, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 106, + 492, + 505, + 504 + ], + "score": 1.0, + "content": "observations into latent variables via an encoder or inference network and decode observations from", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 502, + 506, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 506, + 516 + ], + "score": 1.0, + "content": "latent variables using a decoder or generative network (Kingma & Welling, 2014). We base our", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 514, + 458, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 458, + 527 + ], + "score": 1.0, + "content": "implementation on (Baumgartner, 2018). The model has a fully-connected architecture: ¨", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 481, + 506, + 527 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 564, + 505, + 653 + ], + "lines": [ + { + "bbox": [ + 105, + 563, + 505, + 577 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 130, + 577 + ], + "score": 1.0, + "content": "Here,", + "type": "text" + }, + { + "bbox": [ + 131, + 564, + 224, + 577 + ], + "score": 0.9, + "content": "\\mathrm { R e L U } ( x ) = \\operatorname* { m a x } ( 0 , x )", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 563, + 400, + 577 + ], + "score": 1.0, + "content": "and the sigmoid non-linearity takes the form", + "type": "text" + }, + { + "bbox": [ + 401, + 564, + 501, + 577 + ], + "score": 0.91, + "content": "\\sigma ( x ) = 1 / ( 1 { + } \\mathrm { e x p } ( - x ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 563, + 505, + 577 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 576, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 505, + 588 + ], + "score": 1.0, + "content": "In contrast to a standard VAE, we constrain the samples generated by the model to obey a checker-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 586, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 398, + 599 + ], + "score": 1.0, + "content": "board constraint. The model was optimized with an initial learning rate of", + "type": "text" + }, + { + "bbox": [ + 398, + 586, + 420, + 597 + ], + "score": 0.91, + "content": "1 0 ^ { - 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 586, + 505, + 599 + ], + "score": 1.0, + "content": ", which was annealed", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 597, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 505, + 610 + ], + "score": 1.0, + "content": "by a factor of 0.1 if progress on the validation loss stagnated for more than 5 epochs. The batch size", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 608, + 506, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 506, + 621 + ], + "score": 1.0, + "content": "was chosen to be 64. The model was trained for 200 epochs while the unit box constraints were", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 620, + 430, + 632 + ], + "score": 1.0, + "content": "activated after 100 epochs. To generate images, we sample the latent space prior", + "type": "text" + }, + { + "bbox": [ + 430, + 619, + 487, + 631 + ], + "score": 0.93, + "content": "z \\sim \\mathcal { N } ( 0 , I )", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 620, + 505, + 632 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 631, + 505, + 643 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 505, + 643 + ], + "score": 1.0, + "content": "evaluate the decoding neural network (Figure 5). The model is able to sample authentic digits while", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 642, + 256, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 642, + 256, + 654 + ], + "score": 1.0, + "content": "obeying the checkerboard constraint.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 563, + 506, + 654 + ] + }, + { + "type": "title", + "bbox": [ + 110, + 667, + 383, + 678 + ], + "lines": [ + { + "bbox": [ + 108, + 666, + 383, + 679 + ], + "spans": [ + { + "bbox": [ + 108, + 666, + 383, + 679 + ], + "score": 1.0, + "content": "4.3 FAST INFERENCE WITH CONSTRAINED NEURAL NETWORKS", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "The main advantage of the proposed method over a simple projection method is a vast speed-up at", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "test time. Since the constraint is incorporated into the neural network architecture, a forward pass has", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "score": 1.0, + "content": "almost no overhead compared to an unconstrained network. On the other hand, for a network that", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "was trained without constraints, a final projection step is necessary; this requires solving a convex", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 399, + 506, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 506, + 412 + ], + "score": 1.0, + "content": "optimization problem, which is relatively costly. Table 1 shows inference times for both models for", + "type": "text", + "cross_page": true + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 411, + 506, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 506, + 423 + ], + "score": 1.0, + "content": "the above numerical experiments. The constraint parameterization approach is up to two orders of", + "type": "text", + "cross_page": true + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 422, + 411, + 434 + ], + "spans": [ + { + "bbox": [ + 106, + 422, + 411, + 434 + ], + "score": 1.0, + "content": "magnitude faster at test time compared to the test time projection algorithm.", + "type": "text", + "cross_page": true + } + ], + "index": 14 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 687, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 115, + 79, + 492, + 244 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 115, + 79, + 492, + 244 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 115, + 79, + 492, + 244 + ], + "spans": [ + { + "bbox": [ + 115, + 79, + 492, + 244 + ], + "score": 0.978, + "type": "image", + "image_path": "02f0cfe4745a3f1d0401396a1e80304dc0a37a9588d7f9d2d50cf658cde58b72.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 115, + 79, + 492, + 134.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 115, + 134.0, + 492, + 189.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 115, + 189.0, + 492, + 244.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 255, + 506, + 289 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 254, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 106, + 254, + 505, + 268 + ], + "score": 1.0, + "content": "Figure 5: Samples from a constrained variational autoencoder trained with the test time projection", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 266, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 106, + 266, + 505, + 279 + ], + "score": 1.0, + "content": "method and our constraint parameterization method. The images represent authentic digits while", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 277, + 500, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 500, + 290 + ], + "score": 1.0, + "content": "satisfying the imposed checkerboard constraint. Inference is significantly faster using our method.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "table", + "bbox": [ + 153, + 344, + 457, + 380 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 308, + 505, + 340 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 307, + 506, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 506, + 321 + ], + "score": 1.0, + "content": "Table 1: Inference time for test time projection and constraint parameterization methods. Mean and", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 318, + 505, + 331 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 505, + 331 + ], + "score": 1.0, + "content": "standard deviation of running times are computed over 100 runs of 59000 samples with a batch size", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 330, + 137, + 341 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 137, + 341 + ], + "score": 1.0, + "content": "of 256.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "table_body", + "bbox": [ + 153, + 344, + 457, + 380 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 153, + 344, + 457, + 380 + ], + "spans": [ + { + "bbox": [ + 153, + 344, + 457, + 380 + ], + "score": 0.95, + "html": "
METHODPROJECTIONVAE
Test time projection82±1 s40±1s
Constraint parameterization (ours)0.46 ± 0.02 s0.75 ± 0.04 s
", + "type": "table", + "image_path": "bdbfdf545c0c3896e0aaa1f7c2727179f15affae2568d69cb68ede176ba81380.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 153, + 344, + 457, + 356.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 153, + 356.0, + 457, + 368.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 153, + 368.0, + 457, + 380.0 + ], + "spans": [], + "index": 11 + } + ] + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 107, + 399, + 506, + 433 + ], + "lines": [ + { + "bbox": [ + 105, + 399, + 506, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 506, + 412 + ], + "score": 1.0, + "content": "optimization problem, which is relatively costly. Table 1 shows inference times for both models for", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 411, + 506, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 506, + 423 + ], + "score": 1.0, + "content": "the above numerical experiments. The constraint parameterization approach is up to two orders of", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 422, + 411, + 434 + ], + "spans": [ + { + "bbox": [ + 106, + 422, + 411, + 434 + ], + "score": 1.0, + "content": "magnitude faster at test time compared to the test time projection algorithm.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "title", + "bbox": [ + 108, + 449, + 195, + 462 + ], + "lines": [ + { + "bbox": [ + 104, + 448, + 197, + 465 + ], + "spans": [ + { + "bbox": [ + 104, + 448, + 197, + 465 + ], + "score": 1.0, + "content": "5 CONCLUSION", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 474, + 505, + 606 + ], + "lines": [ + { + "bbox": [ + 105, + 474, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 474, + 505, + 487 + ], + "score": 1.0, + "content": "To combine a data-driven task with modeling constraints, we have developed a method to impose", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 486, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 505, + 497 + ], + "score": 1.0, + "content": "homogeneous linear inequality constraints on neural network activations. At initialization, a suitable", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 497, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 505, + 509 + ], + "score": 1.0, + "content": "parameterization is computed and subsequently a standard variant of stochastic gradient descent is", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 508, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 106, + 508, + 505, + 520 + ], + "score": 1.0, + "content": "used to train the reparameterized network. In this way, we can efficiently guarantee that network ac-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 518, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 531 + ], + "score": 1.0, + "content": "tivations – in the final or any intermediate layer – satisfy the constraints at any point during training.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 528, + 506, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 506, + 543 + ], + "score": 1.0, + "content": "The main advantage of our method over simply projecting onto the feasible set after unconstrained", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 540, + 504, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 504, + 554 + ], + "score": 1.0, + "content": "training is a significant speed-up at test time of up to two orders of magnitude. An important ap-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 551, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 505, + 564 + ], + "score": 1.0, + "content": "plication of the proposed method is generative modeling with prior assumptions. Therefore, we", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 563, + 504, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 563, + 504, + 574 + ], + "score": 1.0, + "content": "demonstrated experimentally that the proposed method can be used successfully to constrain the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 572, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 586 + ], + "score": 1.0, + "content": "output of a variational autoencoder. Our method is implemented as a layer, which is simple to com-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 583, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 596 + ], + "score": 1.0, + "content": "bine with existing and novel neural network architectures in modern deep learning frameworks and", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 595, + 269, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 269, + 607 + ], + "score": 1.0, + "content": "is therefore readily available in practice.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 21.5 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 300, + 750, + 309, + 761 + ], + "spans": [ + { + "bbox": [ + 300, + 750, + 309, + 761 + ], + "score": 1.0, + "content": "8", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 115, + 79, + 492, + 244 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 115, + 79, + 492, + 244 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 115, + 79, + 492, + 244 + ], + "spans": [ + { + "bbox": [ + 115, + 79, + 492, + 244 + ], + "score": 0.978, + "type": "image", + "image_path": "02f0cfe4745a3f1d0401396a1e80304dc0a37a9588d7f9d2d50cf658cde58b72.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 115, + 79, + 492, + 134.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 115, + 134.0, + 492, + 189.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 115, + 189.0, + 492, + 244.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 255, + 506, + 289 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 254, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 106, + 254, + 505, + 268 + ], + "score": 1.0, + "content": "Figure 5: Samples from a constrained variational autoencoder trained with the test time projection", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 266, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 106, + 266, + 505, + 279 + ], + "score": 1.0, + "content": "method and our constraint parameterization method. The images represent authentic digits while", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 277, + 500, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 500, + 290 + ], + "score": 1.0, + "content": "satisfying the imposed checkerboard constraint. Inference is significantly faster using our method.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "table", + "bbox": [ + 153, + 344, + 457, + 380 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 308, + 505, + 340 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 307, + 506, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 506, + 321 + ], + "score": 1.0, + "content": "Table 1: Inference time for test time projection and constraint parameterization methods. Mean and", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 318, + 505, + 331 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 505, + 331 + ], + "score": 1.0, + "content": "standard deviation of running times are computed over 100 runs of 59000 samples with a batch size", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 330, + 137, + 341 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 137, + 341 + ], + "score": 1.0, + "content": "of 256.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "table_body", + "bbox": [ + 153, + 344, + 457, + 380 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 153, + 344, + 457, + 380 + ], + "spans": [ + { + "bbox": [ + 153, + 344, + 457, + 380 + ], + "score": 0.95, + "html": "
METHODPROJECTIONVAE
Test time projection82±1 s40±1s
Constraint parameterization (ours)0.46 ± 0.02 s0.75 ± 0.04 s
", + "type": "table", + "image_path": "bdbfdf545c0c3896e0aaa1f7c2727179f15affae2568d69cb68ede176ba81380.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 153, + 344, + 457, + 356.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 153, + 356.0, + 457, + 368.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 153, + 368.0, + 457, + 380.0 + ], + "spans": [], + "index": 11 + } + ] + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 107, + 399, + 506, + 433 + ], + "lines": [], + "index": 13, + "bbox_fs": [ + 105, + 399, + 506, + 434 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 108, + 449, + 195, + 462 + ], + "lines": [ + { + "bbox": [ + 104, + 448, + 197, + 465 + ], + "spans": [ + { + "bbox": [ + 104, + 448, + 197, + 465 + ], + "score": 1.0, + "content": "5 CONCLUSION", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 474, + 505, + 606 + ], + "lines": [ + { + "bbox": [ + 105, + 474, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 474, + 505, + 487 + ], + "score": 1.0, + "content": "To combine a data-driven task with modeling constraints, we have developed a method to impose", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 486, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 505, + 497 + ], + "score": 1.0, + "content": "homogeneous linear inequality constraints on neural network activations. At initialization, a suitable", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 497, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 505, + 509 + ], + "score": 1.0, + "content": "parameterization is computed and subsequently a standard variant of stochastic gradient descent is", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 508, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 106, + 508, + 505, + 520 + ], + "score": 1.0, + "content": "used to train the reparameterized network. In this way, we can efficiently guarantee that network ac-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 518, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 531 + ], + "score": 1.0, + "content": "tivations – in the final or any intermediate layer – satisfy the constraints at any point during training.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 528, + 506, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 506, + 543 + ], + "score": 1.0, + "content": "The main advantage of our method over simply projecting onto the feasible set after unconstrained", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 540, + 504, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 504, + 554 + ], + "score": 1.0, + "content": "training is a significant speed-up at test time of up to two orders of magnitude. An important ap-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 551, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 505, + 564 + ], + "score": 1.0, + "content": "plication of the proposed method is generative modeling with prior assumptions. Therefore, we", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 563, + 504, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 563, + 504, + 574 + ], + "score": 1.0, + "content": "demonstrated experimentally that the proposed method can be used successfully to constrain the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 572, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 586 + ], + "score": 1.0, + "content": "output of a variational autoencoder. Our method is implemented as a layer, which is simple to com-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 583, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 596 + ], + "score": 1.0, + "content": "bine with existing and novel neural network architectures in modern deep learning frameworks and", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 595, + 269, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 269, + 607 + ], + "score": 1.0, + "content": "is therefore readily available in practice.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 474, + 506, + 607 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 82, + 176, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 176, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 176, + 95 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 100, + 504, + 134 + ], + "lines": [ + { + "bbox": [ + 106, + 100, + 504, + 113 + ], + "spans": [ + { + "bbox": [ + 106, + 100, + 504, + 113 + ], + "score": 1.0, + "content": "Brandon Amos and J. Zico Kolter. OptNet: Differentiable optimization as a layer in neural networks.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 111, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 116, + 111, + 505, + 123 + ], + "score": 1.0, + "content": "In Proceedings of the 34th International Conference on Machine Learning (ICML 2017), pp. 136–", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 122, + 162, + 133 + ], + "spans": [ + { + "bbox": [ + 116, + 122, + 162, + 133 + ], + "score": 1.0, + "content": "145, 2017.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 103, + 141, + 503, + 165 + ], + "lines": [ + { + "bbox": [ + 106, + 141, + 504, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 141, + 192, + 155 + ], + "score": 1.0, + "content": "Tim Baumgartner.¨", + "type": "text" + }, + { + "bbox": [ + 226, + 142, + 313, + 154 + ], + "score": 1.0, + "content": "VAE-CVAE-MNIST.", + "type": "text" + }, + { + "bbox": [ + 347, + 142, + 504, + 155 + ], + "score": 1.0, + "content": "https://github.com/timbmg/", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 153, + 308, + 164 + ], + "spans": [ + { + "bbox": [ + 116, + 153, + 308, + 164 + ], + "score": 1.0, + "content": "VAE-CVAE-MNIST, 2018. commit: e4ba231.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 105, + 172, + 504, + 195 + ], + "lines": [ + { + "bbox": [ + 106, + 172, + 504, + 185 + ], + "spans": [ + { + "bbox": [ + 106, + 172, + 504, + 185 + ], + "score": 1.0, + "content": "David Bremner. Incremental convex hull algorithms are not output sensitive. Discrete & Computa-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 183, + 265, + 196 + ], + "spans": [ + { + "bbox": [ + 116, + 183, + 265, + 196 + ], + "score": 1.0, + "content": "tional Geometry, 21(1):57–68, 1999.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 104, + 203, + 504, + 226 + ], + "lines": [ + { + "bbox": [ + 106, + 203, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 106, + 203, + 505, + 216 + ], + "score": 1.0, + "content": "Rania Briq, Michael Moeller, and Juergen Gall. Convolutional Simplex Projection Network (CSPN)", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 214, + 389, + 227 + ], + "spans": [ + { + "bbox": [ + 116, + 214, + 389, + 227 + ], + "score": 1.0, + "content": "for Weakly Supervised Semantic Segmentation. BMVC 2018, 2018.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 106, + 233, + 504, + 257 + ], + "lines": [ + { + "bbox": [ + 106, + 233, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 233, + 505, + 246 + ], + "score": 1.0, + "content": "Arunkumar Byravan and Dieter Fox. SE3-nets: Learning rigid body motion using deep neural", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 245, + 494, + 257 + ], + "spans": [ + { + "bbox": [ + 115, + 245, + 494, + 257 + ], + "score": 1.0, + "content": "networks. In 2017 IEEE International Conference on Robotics and Automation (ICRA), 2017.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 106, + 264, + 503, + 288 + ], + "lines": [ + { + "bbox": [ + 104, + 263, + 505, + 278 + ], + "spans": [ + { + "bbox": [ + 104, + 263, + 505, + 278 + ], + "score": 1.0, + "content": "Martin E. Dyer. The complexity of vertex enumeration methods. Mathematics of Operations Re-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 275, + 232, + 288 + ], + "spans": [ + { + "bbox": [ + 115, + 275, + 232, + 288 + ], + "score": 1.0, + "content": "search, 8(3):381–402, 1983.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 106, + 295, + 505, + 329 + ], + "lines": [ + { + "bbox": [ + 105, + 294, + 505, + 308 + ], + "spans": [ + { + "bbox": [ + 105, + 294, + 505, + 308 + ], + "score": 1.0, + "content": "Komei Fukuda and Alain Prodon. Double description method revisited, pp. 91–111. Combinatorics", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 306, + 506, + 320 + ], + "spans": [ + { + "bbox": [ + 115, + 306, + 506, + 320 + ], + "score": 1.0, + "content": "and Computer Science: 8th Franco-Japanese and 4th Franco-Chinese Conference Brest, France,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 317, + 384, + 330 + ], + "spans": [ + { + "bbox": [ + 115, + 317, + 384, + 330 + ], + "score": 1.0, + "content": "July 3–5, 1995 Selected Papers. Springer Berlin Heidelberg, 1996.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 336, + 504, + 371 + ], + "lines": [ + { + "bbox": [ + 105, + 335, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 505, + 350 + ], + "score": 1.0, + "content": "Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 348, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 116, + 348, + 505, + 361 + ], + "score": 1.0, + "content": "Aaron Courville, and Yoshua Bengio. Generative adversarial nets. In Advances in Neural Infor-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 359, + 384, + 371 + ], + "spans": [ + { + "bbox": [ + 115, + 359, + 384, + 371 + ], + "score": 1.0, + "content": "mation Processing Systems 27 (NIPS 2014), pp. 2672–2680. 2014.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 378, + 504, + 413 + ], + "lines": [ + { + "bbox": [ + 105, + 378, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 505, + 392 + ], + "score": 1.0, + "content": "Sergey Ioffe and Christian Szegedy. Batch Normalization: Accelerating Deep Network Training", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 389, + 506, + 402 + ], + "spans": [ + { + "bbox": [ + 115, + 389, + 506, + 402 + ], + "score": 1.0, + "content": "by Reducing Internal Covariate Shift. In Proceedings of the 32nd International Conference on", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 401, + 396, + 413 + ], + "spans": [ + { + "bbox": [ + 116, + 401, + 396, + 413 + ], + "score": 1.0, + "content": "Machine Learning, volume 37, pp. 448–456. PMLR, 07–09 Jul 2015.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 104, + 420, + 504, + 443 + ], + "lines": [ + { + "bbox": [ + 106, + 420, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 106, + 420, + 505, + 433 + ], + "score": 1.0, + "content": "Diederik Kingma and Max Welling. Auto-encoding variational bayes. In International Conference", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 432, + 316, + 443 + ], + "spans": [ + { + "bbox": [ + 115, + 432, + 316, + 443 + ], + "score": 1.0, + "content": "on Learning Representations (ICLR 2014), 2014.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 107, + 450, + 504, + 485 + ], + "lines": [ + { + "bbox": [ + 105, + 450, + 504, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 504, + 464 + ], + "score": 1.0, + "content": "Alex Krizhevsky, Ilya Sutskever, and Geoffrey Hinton. ImageNet classification with deep convolu-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 462, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 116, + 462, + 505, + 475 + ], + "score": 1.0, + "content": "tional neural networks. In Proceedings of the 25th International Conference of Neural Information", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 473, + 277, + 485 + ], + "spans": [ + { + "bbox": [ + 116, + 473, + 277, + 485 + ], + "score": 1.0, + "content": "Processing Systems (NIPS 2012), 2012.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 492, + 503, + 515 + ], + "lines": [ + { + "bbox": [ + 107, + 492, + 504, + 505 + ], + "spans": [ + { + "bbox": [ + 107, + 492, + 504, + 505 + ], + "score": 1.0, + "content": "Yann LeCun, Corinna Cortes, and Christopher Burges. The MNIST database of handwritten digits.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 116, + 502, + 342, + 516 + ], + "spans": [ + { + "bbox": [ + 116, + 502, + 342, + 516 + ], + "score": 1.0, + "content": "URL http://yann.lecun.com/exdb/mnist/.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 107, + 523, + 504, + 546 + ], + "lines": [ + { + "bbox": [ + 107, + 523, + 505, + 536 + ], + "spans": [ + { + "bbox": [ + 107, + 523, + 505, + 536 + ], + "score": 1.0, + "content": "Yann LeCun, Leon Bottou, Yoshua Bengio, and Patrick Haffner. Gradient-based learning applied to", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 534, + 417, + 546 + ], + "spans": [ + { + "bbox": [ + 116, + 534, + 417, + 546 + ], + "score": 1.0, + "content": "document recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 106, + 553, + 504, + 576 + ], + "lines": [ + { + "bbox": [ + 105, + 552, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 505, + 567 + ], + "score": 1.0, + "content": "Yann LeCun, Yoshua Bengio, and Geoffrey Hinton. Deep learning. Nature, 521(7553):436–444,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 114, + 563, + 143, + 577 + ], + "spans": [ + { + "bbox": [ + 114, + 563, + 143, + 577 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 106, + 584, + 505, + 618 + ], + "lines": [ + { + "bbox": [ + 105, + 584, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 584, + 505, + 597 + ], + "score": 1.0, + "content": "Pablo Marquez-Neila, Mathieu Salzmann, and Pascal Fua. Imposing hard constraints on deep net- ´", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 596, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 116, + 596, + 505, + 608 + ], + "score": 1.0, + "content": "works: Promises and limitations. First Workshop on Negative Results in Computer Vision, CVPR", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 605, + 167, + 618 + ], + "spans": [ + { + "bbox": [ + 115, + 605, + 167, + 618 + ], + "score": 1.0, + "content": "2017, 2017.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 106, + 625, + 504, + 660 + ], + "lines": [ + { + "bbox": [ + 105, + 625, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 625, + 505, + 639 + ], + "score": 1.0, + "content": "T. S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. Thrall. The double description method. In", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 636, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 116, + 636, + 505, + 649 + ], + "score": 1.0, + "content": "Contributions to the Theory of Games II, volume 8 of Ann. of Math. Stud., pp. 51–73. Princeton", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 116, + 648, + 212, + 660 + ], + "spans": [ + { + "bbox": [ + 116, + 648, + 212, + 660 + ], + "score": 1.0, + "content": "University Press, 1953.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 104, + 667, + 504, + 691 + ], + "lines": [ + { + "bbox": [ + 106, + 668, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 668, + 505, + 681 + ], + "score": 1.0, + "content": "Jorge Nocedal and Stephen Wright. Numerical Optimization. Springer Series in Operations Re-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 679, + 318, + 691 + ], + "spans": [ + { + "bbox": [ + 115, + 679, + 318, + 691 + ], + "score": 1.0, + "content": "search and Financial Engineering. Springer, 2006.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5 + }, + { + "type": "text", + "bbox": [ + 108, + 698, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 697, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 505, + 712 + ], + "score": 1.0, + "content": "Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 710, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 116, + 710, + 505, + 721 + ], + "score": 1.0, + "content": "Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer. Automatic differentiation in", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 720, + 308, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 308, + 732 + ], + "score": 1.0, + "content": "PyTorch. Autodiff Workshop, NIPS 2017, 2017.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43 + } + ], + "page_idx": 8, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "9", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 82, + 176, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 176, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 176, + 95 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 100, + 504, + 134 + ], + "lines": [ + { + "bbox": [ + 106, + 100, + 504, + 113 + ], + "spans": [ + { + "bbox": [ + 106, + 100, + 504, + 113 + ], + "score": 1.0, + "content": "Brandon Amos and J. Zico Kolter. OptNet: Differentiable optimization as a layer in neural networks.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 111, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 116, + 111, + 505, + 123 + ], + "score": 1.0, + "content": "In Proceedings of the 34th International Conference on Machine Learning (ICML 2017), pp. 136–", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 122, + 162, + 133 + ], + "spans": [ + { + "bbox": [ + 116, + 122, + 162, + 133 + ], + "score": 1.0, + "content": "145, 2017.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2, + "bbox_fs": [ + 106, + 100, + 505, + 133 + ] + }, + { + "type": "text", + "bbox": [ + 103, + 141, + 503, + 165 + ], + "lines": [ + { + "bbox": [ + 106, + 141, + 504, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 141, + 192, + 155 + ], + "score": 1.0, + "content": "Tim Baumgartner.¨", + "type": "text" + }, + { + "bbox": [ + 226, + 142, + 313, + 154 + ], + "score": 1.0, + "content": "VAE-CVAE-MNIST.", + "type": "text" + }, + { + "bbox": [ + 347, + 142, + 504, + 155 + ], + "score": 1.0, + "content": "https://github.com/timbmg/", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 153, + 308, + 164 + ], + "spans": [ + { + "bbox": [ + 116, + 153, + 308, + 164 + ], + "score": 1.0, + "content": "VAE-CVAE-MNIST, 2018. commit: e4ba231.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 106, + 141, + 504, + 164 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 172, + 504, + 195 + ], + "lines": [ + { + "bbox": [ + 106, + 172, + 504, + 185 + ], + "spans": [ + { + "bbox": [ + 106, + 172, + 504, + 185 + ], + "score": 1.0, + "content": "David Bremner. Incremental convex hull algorithms are not output sensitive. Discrete & Computa-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 183, + 265, + 196 + ], + "spans": [ + { + "bbox": [ + 116, + 183, + 265, + 196 + ], + "score": 1.0, + "content": "tional Geometry, 21(1):57–68, 1999.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 106, + 172, + 504, + 196 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 203, + 504, + 226 + ], + "lines": [ + { + "bbox": [ + 106, + 203, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 106, + 203, + 505, + 216 + ], + "score": 1.0, + "content": "Rania Briq, Michael Moeller, and Juergen Gall. Convolutional Simplex Projection Network (CSPN)", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 214, + 389, + 227 + ], + "spans": [ + { + "bbox": [ + 116, + 214, + 389, + 227 + ], + "score": 1.0, + "content": "for Weakly Supervised Semantic Segmentation. BMVC 2018, 2018.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 106, + 203, + 505, + 227 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 233, + 504, + 257 + ], + "lines": [ + { + "bbox": [ + 106, + 233, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 233, + 505, + 246 + ], + "score": 1.0, + "content": "Arunkumar Byravan and Dieter Fox. SE3-nets: Learning rigid body motion using deep neural", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 245, + 494, + 257 + ], + "spans": [ + { + "bbox": [ + 115, + 245, + 494, + 257 + ], + "score": 1.0, + "content": "networks. In 2017 IEEE International Conference on Robotics and Automation (ICRA), 2017.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 106, + 233, + 505, + 257 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 264, + 503, + 288 + ], + "lines": [ + { + "bbox": [ + 104, + 263, + 505, + 278 + ], + "spans": [ + { + "bbox": [ + 104, + 263, + 505, + 278 + ], + "score": 1.0, + "content": "Martin E. Dyer. The complexity of vertex enumeration methods. Mathematics of Operations Re-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 275, + 232, + 288 + ], + "spans": [ + { + "bbox": [ + 115, + 275, + 232, + 288 + ], + "score": 1.0, + "content": "search, 8(3):381–402, 1983.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 104, + 263, + 505, + 288 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 295, + 505, + 329 + ], + "lines": [ + { + "bbox": [ + 105, + 294, + 505, + 308 + ], + "spans": [ + { + "bbox": [ + 105, + 294, + 505, + 308 + ], + "score": 1.0, + "content": "Komei Fukuda and Alain Prodon. Double description method revisited, pp. 91–111. Combinatorics", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 306, + 506, + 320 + ], + "spans": [ + { + "bbox": [ + 115, + 306, + 506, + 320 + ], + "score": 1.0, + "content": "and Computer Science: 8th Franco-Japanese and 4th Franco-Chinese Conference Brest, France,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 317, + 384, + 330 + ], + "spans": [ + { + "bbox": [ + 115, + 317, + 384, + 330 + ], + "score": 1.0, + "content": "July 3–5, 1995 Selected Papers. Springer Berlin Heidelberg, 1996.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 294, + 506, + 330 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 336, + 504, + 371 + ], + "lines": [ + { + "bbox": [ + 105, + 335, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 505, + 350 + ], + "score": 1.0, + "content": "Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 348, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 116, + 348, + 505, + 361 + ], + "score": 1.0, + "content": "Aaron Courville, and Yoshua Bengio. Generative adversarial nets. In Advances in Neural Infor-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 359, + 384, + 371 + ], + "spans": [ + { + "bbox": [ + 115, + 359, + 384, + 371 + ], + "score": 1.0, + "content": "mation Processing Systems 27 (NIPS 2014), pp. 2672–2680. 2014.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 335, + 505, + 371 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 378, + 504, + 413 + ], + "lines": [ + { + "bbox": [ + 105, + 378, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 505, + 392 + ], + "score": 1.0, + "content": "Sergey Ioffe and Christian Szegedy. Batch Normalization: Accelerating Deep Network Training", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 389, + 506, + 402 + ], + "spans": [ + { + "bbox": [ + 115, + 389, + 506, + 402 + ], + "score": 1.0, + "content": "by Reducing Internal Covariate Shift. In Proceedings of the 32nd International Conference on", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 401, + 396, + 413 + ], + "spans": [ + { + "bbox": [ + 116, + 401, + 396, + 413 + ], + "score": 1.0, + "content": "Machine Learning, volume 37, pp. 448–456. PMLR, 07–09 Jul 2015.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 378, + 506, + 413 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 420, + 504, + 443 + ], + "lines": [ + { + "bbox": [ + 106, + 420, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 106, + 420, + 505, + 433 + ], + "score": 1.0, + "content": "Diederik Kingma and Max Welling. Auto-encoding variational bayes. In International Conference", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 432, + 316, + 443 + ], + "spans": [ + { + "bbox": [ + 115, + 432, + 316, + 443 + ], + "score": 1.0, + "content": "on Learning Representations (ICLR 2014), 2014.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 106, + 420, + 505, + 443 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 450, + 504, + 485 + ], + "lines": [ + { + "bbox": [ + 105, + 450, + 504, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 504, + 464 + ], + "score": 1.0, + "content": "Alex Krizhevsky, Ilya Sutskever, and Geoffrey Hinton. ImageNet classification with deep convolu-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 462, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 116, + 462, + 505, + 475 + ], + "score": 1.0, + "content": "tional neural networks. In Proceedings of the 25th International Conference of Neural Information", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 473, + 277, + 485 + ], + "spans": [ + { + "bbox": [ + 116, + 473, + 277, + 485 + ], + "score": 1.0, + "content": "Processing Systems (NIPS 2012), 2012.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 450, + 505, + 485 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 492, + 503, + 515 + ], + "lines": [ + { + "bbox": [ + 107, + 492, + 504, + 505 + ], + "spans": [ + { + "bbox": [ + 107, + 492, + 504, + 505 + ], + "score": 1.0, + "content": "Yann LeCun, Corinna Cortes, and Christopher Burges. The MNIST database of handwritten digits.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 116, + 502, + 342, + 516 + ], + "spans": [ + { + "bbox": [ + 116, + 502, + 342, + 516 + ], + "score": 1.0, + "content": "URL http://yann.lecun.com/exdb/mnist/.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 107, + 492, + 504, + 516 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 523, + 504, + 546 + ], + "lines": [ + { + "bbox": [ + 107, + 523, + 505, + 536 + ], + "spans": [ + { + "bbox": [ + 107, + 523, + 505, + 536 + ], + "score": 1.0, + "content": "Yann LeCun, Leon Bottou, Yoshua Bengio, and Patrick Haffner. Gradient-based learning applied to", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 534, + 417, + 546 + ], + "spans": [ + { + "bbox": [ + 116, + 534, + 417, + 546 + ], + "score": 1.0, + "content": "document recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5, + "bbox_fs": [ + 107, + 523, + 505, + 546 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 553, + 504, + 576 + ], + "lines": [ + { + "bbox": [ + 105, + 552, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 505, + 567 + ], + "score": 1.0, + "content": "Yann LeCun, Yoshua Bengio, and Geoffrey Hinton. Deep learning. Nature, 521(7553):436–444,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 114, + 563, + 143, + 577 + ], + "spans": [ + { + "bbox": [ + 114, + 563, + 143, + 577 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 552, + 505, + 577 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 584, + 505, + 618 + ], + "lines": [ + { + "bbox": [ + 105, + 584, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 584, + 505, + 597 + ], + "score": 1.0, + "content": "Pablo Marquez-Neila, Mathieu Salzmann, and Pascal Fua. Imposing hard constraints on deep net- ´", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 596, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 116, + 596, + 505, + 608 + ], + "score": 1.0, + "content": "works: Promises and limitations. First Workshop on Negative Results in Computer Vision, CVPR", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 605, + 167, + 618 + ], + "spans": [ + { + "bbox": [ + 115, + 605, + 167, + 618 + ], + "score": 1.0, + "content": "2017, 2017.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 584, + 505, + 618 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 625, + 504, + 660 + ], + "lines": [ + { + "bbox": [ + 105, + 625, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 625, + 505, + 639 + ], + "score": 1.0, + "content": "T. S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. Thrall. The double description method. In", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 636, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 116, + 636, + 505, + 649 + ], + "score": 1.0, + "content": "Contributions to the Theory of Games II, volume 8 of Ann. of Math. Stud., pp. 51–73. Princeton", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 116, + 648, + 212, + 660 + ], + "spans": [ + { + "bbox": [ + 116, + 648, + 212, + 660 + ], + "score": 1.0, + "content": "University Press, 1953.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38, + "bbox_fs": [ + 105, + 625, + 505, + 660 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 667, + 504, + 691 + ], + "lines": [ + { + "bbox": [ + 106, + 668, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 668, + 505, + 681 + ], + "score": 1.0, + "content": "Jorge Nocedal and Stephen Wright. Numerical Optimization. Springer Series in Operations Re-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 679, + 318, + 691 + ], + "spans": [ + { + "bbox": [ + 115, + 679, + 318, + 691 + ], + "score": 1.0, + "content": "search and Financial Engineering. Springer, 2006.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5, + "bbox_fs": [ + 106, + 668, + 505, + 691 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 698, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 697, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 505, + 712 + ], + "score": 1.0, + "content": "Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 710, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 116, + 710, + 505, + 721 + ], + "score": 1.0, + "content": "Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer. Automatic differentiation in", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 720, + 308, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 308, + 732 + ], + "score": 1.0, + "content": "PyTorch. Autodiff Workshop, NIPS 2017, 2017.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43, + "bbox_fs": [ + 105, + 697, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Deepak Pathak, Philipp Krahenb ¨ uhl, and Trevor Darrell. Constrained Convolutional Neural Net- ¨", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "works for Weakly Supervised Segmentation. In International Conference on Computer Vision", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 104, + 199, + 117 + ], + "spans": [ + { + "bbox": [ + 116, + 104, + 199, + 117 + ], + "score": 1.0, + "content": "(ICCV 2015), 2015.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 105, + 123, + 504, + 146 + ], + "lines": [ + { + "bbox": [ + 105, + 122, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 505, + 137 + ], + "score": 1.0, + "content": "Bartolomeo Stellato, Goran Banjac, Paul Goulart, Alberto Bemporad, and Stephen Boyd. OSQP:", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 134, + 421, + 146 + ], + "spans": [ + { + "bbox": [ + 116, + 134, + 421, + 146 + ], + "score": 1.0, + "content": "An Operator Splitting Solver for Quadratic Programs. ArXiv e-prints, 2017.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 107, + 153, + 504, + 186 + ], + "lines": [ + { + "bbox": [ + 105, + 153, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 166 + ], + "score": 1.0, + "content": "Ilya Sutskever, Oriol Vinyals, and Quoc V Le. Sequence to Sequence Learning with Neural Net-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 163, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 115, + 163, + 505, + 178 + ], + "score": 1.0, + "content": "works. In Proceedings of the 27th International Conference of Neural Information Processing", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 175, + 231, + 187 + ], + "spans": [ + { + "bbox": [ + 116, + 175, + 231, + 187 + ], + "score": 1.0, + "content": "Systems (NIPS 2014), 2014.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 194, + 504, + 216 + ], + "lines": [ + { + "bbox": [ + 106, + 194, + 504, + 207 + ], + "spans": [ + { + "bbox": [ + 106, + 194, + 504, + 207 + ], + "score": 1.0, + "content": "Xingyi Zhou, Xiao Sun, Wei Zhang, Shuang Liang, and Yichen Wei. Deep Kinematic Pose Regres-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 204, + 404, + 217 + ], + "spans": [ + { + "bbox": [ + 115, + 204, + 404, + 217 + ], + "score": 1.0, + "content": "sion. Workshop on Geometry Meets Deep Learning, ECCV 2016, 2016.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + } + ], + "page_idx": 9, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "10", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 26, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Deepak Pathak, Philipp Krahenb ¨ uhl, and Trevor Darrell. Constrained Convolutional Neural Net- ¨", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "works for Weakly Supervised Segmentation. In International Conference on Computer Vision", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 104, + 199, + 117 + ], + "spans": [ + { + "bbox": [ + 116, + 104, + 199, + 117 + ], + "score": 1.0, + "content": "(ICCV 2015), 2015.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 106, + 82, + 505, + 117 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 123, + 504, + 146 + ], + "lines": [ + { + "bbox": [ + 105, + 122, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 505, + 137 + ], + "score": 1.0, + "content": "Bartolomeo Stellato, Goran Banjac, Paul Goulart, Alberto Bemporad, and Stephen Boyd. OSQP:", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 134, + 421, + 146 + ], + "spans": [ + { + "bbox": [ + 116, + 134, + 421, + 146 + ], + "score": 1.0, + "content": "An Operator Splitting Solver for Quadratic Programs. ArXiv e-prints, 2017.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 122, + 505, + 146 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 153, + 504, + 186 + ], + "lines": [ + { + "bbox": [ + 105, + 153, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 166 + ], + "score": 1.0, + "content": "Ilya Sutskever, Oriol Vinyals, and Quoc V Le. Sequence to Sequence Learning with Neural Net-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 163, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 115, + 163, + 505, + 178 + ], + "score": 1.0, + "content": "works. In Proceedings of the 27th International Conference of Neural Information Processing", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 175, + 231, + 187 + ], + "spans": [ + { + "bbox": [ + 116, + 175, + 231, + 187 + ], + "score": 1.0, + "content": "Systems (NIPS 2014), 2014.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 105, + 153, + 505, + 187 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 194, + 504, + 216 + ], + "lines": [ + { + "bbox": [ + 106, + 194, + 504, + 207 + ], + "spans": [ + { + "bbox": [ + 106, + 194, + 504, + 207 + ], + "score": 1.0, + "content": "Xingyi Zhou, Xiao Sun, Wei Zhang, Shuang Liang, and Yichen Wei. Deep Kinematic Pose Regres-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 204, + 404, + 217 + ], + "spans": [ + { + "bbox": [ + 115, + 204, + 404, + 217 + ], + "score": 1.0, + "content": "sion. Workshop on Geometry Meets Deep Learning, ECCV 2016, 2016.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 106, + 194, + 504, + 217 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/ByxXZpVtPB/ByxXZpVtPB_model.json b/parse/train/ByxXZpVtPB/ByxXZpVtPB_model.json new file mode 100644 index 0000000000000000000000000000000000000000..e595dba638b4d63ed30cea1363c0fa26f043020f --- /dev/null +++ b/parse/train/ByxXZpVtPB/ByxXZpVtPB_model.json @@ -0,0 +1,13019 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 589, + 1302, + 589, + 1302, + 1077, + 398, + 1077 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 1206, + 1403, + 1206, + 1403, + 1513, + 298, + 1513 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1850, + 1403, + 1850, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.976 + }, + { + "category_id": 0, + "poly": [ + 301, + 219, + 1400, + 219, + 1400, + 324, + 301, + 324 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 300, + 1528, + 1404, + 1528, + 1404, + 1621, + 300, + 1621 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 369, + 1646, + 1403, + 1646, + 1403, + 1824, + 369, + 1824 + ], + "score": 0.96 + }, + { + "category_id": 1, + "poly": [ + 313, + 378, + 680, + 378, + 680, + 438, + 313, + 438 + ], + "score": 0.917 + }, + { + "category_id": 0, + "poly": [ + 302, + 1137, + 573, + 1137, + 573, + 1172, + 302, + 1172 + ], + "score": 0.902 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 858, + 75, + 858, + 105, + 298, + 105 + ], + "score": 0.899 + }, + { + "category_id": 0, + "poly": [ + 773, + 519, + 927, + 519, + 927, + 553, + 773, + 553 + ], + "score": 0.874 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 857, + 2088, + 857, + 2112, + 842, + 2112 + ], + "score": 0.679 + }, + { + "category_id": 13, + "poly": [ + 595, + 1559, + 689, + 1559, + 689, + 1589, + 595, + 1589 + ], + "score": 0.91, + "latex": "A x \\le 0" + }, + { + "category_id": 13, + "poly": [ + 458, + 621, + 550, + 621, + 550, + 651, + 458, + 651 + ], + "score": 0.91, + "latex": "A x \\le 0" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 216.0, + 1405.0, + 216.0, + 1405.0, + 274.0, + 294.0, + 274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 271.0, + 1094.0, + 271.0, + 1094.0, + 330.0, + 292.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1134.0, + 579.0, + 1134.0, + 579.0, + 1181.0, + 294.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 518.0, + 932.0, + 518.0, + 932.0, + 556.0, + 770.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 841.0, + 2088.0, + 858.0, + 2088.0, + 858.0, + 2116.0, + 841.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 589.0, + 1305.0, + 589.0, + 1305.0, + 625.0, + 394.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 621.0, + 457.0, + 621.0, + 457.0, + 655.0, + 393.0, + 655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 551.0, + 621.0, + 1306.0, + 621.0, + 1306.0, + 655.0, + 551.0, + 655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 649.0, + 1306.0, + 649.0, + 1306.0, + 686.0, + 393.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 680.0, + 1305.0, + 680.0, + 1305.0, + 715.0, + 394.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 711.0, + 1303.0, + 711.0, + 1303.0, + 745.0, + 394.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 740.0, + 1305.0, + 740.0, + 1305.0, + 778.0, + 393.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 773.0, + 1305.0, + 773.0, + 1305.0, + 806.0, + 394.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 803.0, + 1306.0, + 803.0, + 1306.0, + 835.0, + 394.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 834.0, + 1308.0, + 834.0, + 1308.0, + 866.0, + 392.0, + 866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 866.0, + 1306.0, + 866.0, + 1306.0, + 897.0, + 394.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 894.0, + 1304.0, + 894.0, + 1304.0, + 929.0, + 394.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 924.0, + 1304.0, + 924.0, + 1304.0, + 961.0, + 392.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 953.0, + 1306.0, + 953.0, + 1306.0, + 989.0, + 393.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 986.0, + 1306.0, + 986.0, + 1306.0, + 1021.0, + 394.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1016.0, + 1306.0, + 1016.0, + 1306.0, + 1050.0, + 393.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1049.0, + 544.0, + 1049.0, + 544.0, + 1076.0, + 394.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1207.0, + 1405.0, + 1207.0, + 1405.0, + 1242.0, + 294.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1236.0, + 1407.0, + 1236.0, + 1407.0, + 1273.0, + 291.0, + 1273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1268.0, + 1407.0, + 1268.0, + 1407.0, + 1304.0, + 293.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1296.0, + 1405.0, + 1296.0, + 1405.0, + 1337.0, + 293.0, + 1337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1326.0, + 1405.0, + 1326.0, + 1405.0, + 1365.0, + 293.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1359.0, + 1404.0, + 1359.0, + 1404.0, + 1395.0, + 293.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1387.0, + 1405.0, + 1387.0, + 1405.0, + 1426.0, + 293.0, + 1426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1419.0, + 1407.0, + 1419.0, + 1407.0, + 1459.0, + 293.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1452.0, + 1400.0, + 1452.0, + 1400.0, + 1484.0, + 296.0, + 1484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1482.0, + 1391.0, + 1482.0, + 1391.0, + 1517.0, + 294.0, + 1517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1852.0, + 1404.0, + 1852.0, + 1404.0, + 1884.0, + 296.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1881.0, + 1408.0, + 1881.0, + 1408.0, + 1917.0, + 292.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1910.0, + 1403.0, + 1910.0, + 1403.0, + 1946.0, + 294.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1939.0, + 1404.0, + 1939.0, + 1404.0, + 1979.0, + 293.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1974.0, + 1404.0, + 1974.0, + 1404.0, + 2005.0, + 297.0, + 2005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2002.0, + 755.0, + 2002.0, + 755.0, + 2038.0, + 295.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1525.0, + 1404.0, + 1525.0, + 1404.0, + 1565.0, + 293.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1558.0, + 594.0, + 1558.0, + 594.0, + 1595.0, + 293.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1558.0, + 1405.0, + 1558.0, + 1405.0, + 1595.0, + 690.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1587.0, + 1404.0, + 1587.0, + 1404.0, + 1626.0, + 294.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 1642.0, + 1405.0, + 1642.0, + 1405.0, + 1685.0, + 366.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1678.0, + 652.0, + 1678.0, + 652.0, + 1713.0, + 394.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 1716.0, + 1403.0, + 1716.0, + 1403.0, + 1754.0, + 366.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1754.0, + 461.0, + 1754.0, + 461.0, + 1783.0, + 393.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 365.0, + 1787.0, + 1337.0, + 1787.0, + 1337.0, + 1829.0, + 365.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 379.0, + 560.0, + 379.0, + 560.0, + 411.0, + 315.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 407.0, + 681.0, + 407.0, + 681.0, + 442.0, + 312.0, + 442.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1111, + 1403, + 1111, + 1403, + 1388, + 298, + 1388 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 911, + 1403, + 911, + 1403, + 1095, + 298, + 1095 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1788, + 1403, + 1788, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1402, + 1402, + 1402, + 1402, + 1555, + 298, + 1555 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1570, + 1403, + 1570, + 1403, + 1723, + 298, + 1723 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 772, + 1402, + 772, + 1402, + 896, + 298, + 896 + ], + "score": 0.974 + }, + { + "category_id": 3, + "poly": [ + 607, + 224, + 1085, + 224, + 1085, + 449, + 607, + 449 + ], + "score": 0.97 + }, + { + "category_id": 4, + "poly": [ + 296, + 481, + 1406, + 481, + 1406, + 603, + 296, + 603 + ], + "score": 0.915 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 858, + 75, + 858, + 105, + 297, + 105 + ], + "score": 0.904 + }, + { + "category_id": 0, + "poly": [ + 301, + 685, + 581, + 685, + 581, + 720, + 301, + 720 + ], + "score": 0.904 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.699 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.16 + }, + { + "category_id": 13, + "poly": [ + 360, + 542, + 439, + 542, + 439, + 576, + 360, + 576 + ], + "score": 0.87, + "latex": "[ - 1 , 1 ]" + }, + { + "category_id": 15, + "poly": [ + 976.0, + 370.0, + 992.0, + 370.0, + 992.0, + 377.0, + 976.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 369.0, + 1027.0, + 369.0, + 1027.0, + 376.0, + 1009.0, + 376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 377.0, + 1017.0, + 377.0, + 1017.0, + 384.0, + 997.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 481.0, + 1404.0, + 481.0, + 1404.0, + 513.0, + 294.0, + 513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 511.0, + 1402.0, + 511.0, + 1402.0, + 543.0, + 295.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 542.0, + 359.0, + 542.0, + 359.0, + 578.0, + 293.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.0, + 542.0, + 1406.0, + 542.0, + 1406.0, + 578.0, + 440.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 569.0, + 428.0, + 569.0, + 428.0, + 610.0, + 291.0, + 610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 682.0, + 586.0, + 682.0, + 586.0, + 726.0, + 292.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2120.0, + 839.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2120.0, + 838.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1111.0, + 1403.0, + 1111.0, + 1403.0, + 1147.0, + 294.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1142.0, + 1403.0, + 1142.0, + 1403.0, + 1175.0, + 296.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1172.0, + 1404.0, + 1172.0, + 1404.0, + 1209.0, + 294.0, + 1209.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1200.0, + 1407.0, + 1200.0, + 1407.0, + 1240.0, + 291.0, + 1240.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1234.0, + 1407.0, + 1234.0, + 1407.0, + 1270.0, + 294.0, + 1270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1263.0, + 1408.0, + 1263.0, + 1408.0, + 1299.0, + 293.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1294.0, + 1405.0, + 1294.0, + 1405.0, + 1331.0, + 294.0, + 1331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1323.0, + 1405.0, + 1323.0, + 1405.0, + 1359.0, + 293.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1357.0, + 955.0, + 1357.0, + 955.0, + 1390.0, + 296.0, + 1390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 913.0, + 1404.0, + 913.0, + 1404.0, + 945.0, + 296.0, + 945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 942.0, + 1405.0, + 942.0, + 1405.0, + 978.0, + 294.0, + 978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 973.0, + 1405.0, + 973.0, + 1405.0, + 1007.0, + 293.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1004.0, + 1403.0, + 1004.0, + 1403.0, + 1036.0, + 296.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1033.0, + 1405.0, + 1033.0, + 1405.0, + 1070.0, + 292.0, + 1070.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1066.0, + 1164.0, + 1066.0, + 1164.0, + 1098.0, + 296.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1786.0, + 1402.0, + 1786.0, + 1402.0, + 1826.0, + 296.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1816.0, + 1405.0, + 1816.0, + 1405.0, + 1858.0, + 292.0, + 1858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1852.0, + 1403.0, + 1852.0, + 1403.0, + 1886.0, + 296.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1881.0, + 1404.0, + 1881.0, + 1404.0, + 1915.0, + 294.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1909.0, + 1405.0, + 1909.0, + 1405.0, + 1948.0, + 292.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1943.0, + 1405.0, + 1943.0, + 1405.0, + 1977.0, + 294.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1973.0, + 1407.0, + 1973.0, + 1407.0, + 2007.0, + 294.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2004.0, + 1235.0, + 2004.0, + 1235.0, + 2037.0, + 294.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1402.0, + 1406.0, + 1402.0, + 1406.0, + 1439.0, + 296.0, + 1439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1430.0, + 1403.0, + 1430.0, + 1403.0, + 1471.0, + 293.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1460.0, + 1406.0, + 1460.0, + 1406.0, + 1502.0, + 292.0, + 1502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1490.0, + 1404.0, + 1490.0, + 1404.0, + 1529.0, + 293.0, + 1529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1521.0, + 1220.0, + 1521.0, + 1220.0, + 1560.0, + 294.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1567.0, + 1405.0, + 1567.0, + 1405.0, + 1606.0, + 293.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1600.0, + 1405.0, + 1600.0, + 1405.0, + 1637.0, + 293.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1627.0, + 1407.0, + 1627.0, + 1407.0, + 1670.0, + 291.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1662.0, + 1405.0, + 1662.0, + 1405.0, + 1695.0, + 293.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1692.0, + 416.0, + 1692.0, + 416.0, + 1727.0, + 290.0, + 1727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 772.0, + 1407.0, + 772.0, + 1407.0, + 808.0, + 294.0, + 808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 805.0, + 1403.0, + 805.0, + 1403.0, + 838.0, + 294.0, + 838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 832.0, + 1407.0, + 832.0, + 1407.0, + 870.0, + 292.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 864.0, + 530.0, + 864.0, + 530.0, + 901.0, + 293.0, + 901.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 397, + 1405, + 397, + 1405, + 640, + 297, + 640 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 296, + 1280, + 1405, + 1280, + 1405, + 1497, + 296, + 1497 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1510, + 1403, + 1510, + 1403, + 1666, + 298, + 1666 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 1757, + 1403, + 1757, + 1403, + 1881, + 297, + 1881 + ], + "score": 0.976 + }, + { + "category_id": 8, + "poly": [ + 577, + 693, + 1118, + 693, + 1118, + 783, + 577, + 783 + ], + "score": 0.958 + }, + { + "category_id": 8, + "poly": [ + 552, + 931, + 1142, + 931, + 1142, + 1079, + 552, + 1079 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 295, + 791, + 1402, + 791, + 1402, + 853, + 295, + 853 + ], + "score": 0.939 + }, + { + "category_id": 2, + "poly": [ + 299, + 1946, + 1403, + 1946, + 1403, + 2035, + 299, + 2035 + ], + "score": 0.937 + }, + { + "category_id": 1, + "poly": [ + 298, + 858, + 1401, + 858, + 1401, + 923, + 298, + 923 + ], + "score": 0.932 + }, + { + "category_id": 8, + "poly": [ + 725, + 1183, + 972, + 1183, + 972, + 1219, + 725, + 1219 + ], + "score": 0.925 + }, + { + "category_id": 2, + "poly": [ + 297, + 74, + 858, + 74, + 858, + 106, + 297, + 106 + ], + "score": 0.92 + }, + { + "category_id": 8, + "poly": [ + 713, + 1892, + 982, + 1892, + 982, + 1927, + 713, + 1927 + ], + "score": 0.92 + }, + { + "category_id": 1, + "poly": [ + 298, + 651, + 1328, + 651, + 1328, + 686, + 298, + 686 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 294, + 292, + 1391, + 292, + 1391, + 327, + 294, + 327 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 294, + 1087, + 978, + 1087, + 978, + 1123, + 294, + 1123 + ], + "score": 0.918 + }, + { + "category_id": 1, + "poly": [ + 297, + 1134, + 942, + 1134, + 942, + 1172, + 297, + 1172 + ], + "score": 0.912 + }, + { + "category_id": 0, + "poly": [ + 300, + 1701, + 745, + 1701, + 745, + 1732, + 300, + 1732 + ], + "score": 0.894 + }, + { + "category_id": 9, + "poly": [ + 1365, + 723, + 1400, + 723, + 1400, + 753, + 1365, + 753 + ], + "score": 0.888 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1894, + 1400, + 1894, + 1400, + 1923, + 1366, + 1923 + ], + "score": 0.884 + }, + { + "category_id": 8, + "poly": [ + 584, + 335, + 1116, + 335, + 1116, + 385, + 584, + 385 + ], + "score": 0.882 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1186, + 1400, + 1186, + 1400, + 1215, + 1366, + 1215 + ], + "score": 0.882 + }, + { + "category_id": 9, + "poly": [ + 1366, + 345, + 1400, + 345, + 1400, + 376, + 1366, + 376 + ], + "score": 0.88 + }, + { + "category_id": 1, + "poly": [ + 297, + 1225, + 687, + 1225, + 687, + 1260, + 297, + 1260 + ], + "score": 0.879 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1011, + 1401, + 1011, + 1401, + 1041, + 1365, + 1041 + ], + "score": 0.871 + }, + { + "category_id": 0, + "poly": [ + 290, + 228, + 1290, + 228, + 1290, + 263, + 290, + 263 + ], + "score": 0.774 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.669 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.448 + }, + { + "category_id": 8, + "poly": [ + 550, + 931, + 1142, + 931, + 1142, + 1080, + 550, + 1080 + ], + "score": 0.235 + }, + { + "category_id": 2, + "poly": [ + 290, + 228, + 1290, + 228, + 1290, + 263, + 290, + 263 + ], + "score": 0.13 + }, + { + "category_id": 13, + "poly": [ + 580, + 1088, + 725, + 1088, + 725, + 1122, + 580, + 1122 + ], + "score": 0.94, + "latex": "\\{ v _ { 1 } , \\ldots , v _ { n } \\}" + }, + { + "category_id": 13, + "poly": [ + 373, + 394, + 418, + 394, + 418, + 440, + 373, + 440 + ], + "score": 0.94, + "latex": "f _ { \\theta _ { l } } ^ { ( l ) }" + }, + { + "category_id": 13, + "poly": [ + 424, + 602, + 580, + 602, + 580, + 640, + 424, + 640 + ], + "score": 0.94, + "latex": "a ^ { ( l ) } = \\sigma ( z ^ { ( l ) } )" + }, + { + "category_id": 14, + "poly": [ + 580, + 692, + 1118, + 692, + 1118, + 785, + 580, + 785 + ], + "score": 0.93, + "latex": "\\mathcal { C } : = \\left\\{ z \\bigg | A z \\leq b , A \\in \\mathbb { R } ^ { m \\times d } , b \\in \\mathbb { R } ^ { m } \\right\\} \\subseteq \\mathbb { R } ^ { d } ." + }, + { + "category_id": 13, + "poly": [ + 1039, + 563, + 1250, + 563, + 1250, + 606, + 1039, + 606 + ], + "score": 0.93, + "latex": "z ^ { ( l ) } = f _ { \\theta _ { l } } ^ { ( l ) } ( a ^ { ( l - 1 ) } )" + }, + { + "category_id": 13, + "poly": [ + 833, + 1088, + 972, + 1088, + 972, + 1123, + 833, + 1123 + ], + "score": 0.93, + "latex": "\\{ r _ { 1 } , \\ldots , r _ { s } \\}" + }, + { + "category_id": 13, + "poly": [ + 541, + 1226, + 680, + 1226, + 680, + 1260, + 541, + 1260 + ], + "score": 0.93, + "latex": "\\{ r _ { 1 } , \\ldots , r _ { s } \\}" + }, + { + "category_id": 13, + "poly": [ + 1184, + 610, + 1252, + 610, + 1252, + 640, + 1184, + 640 + ], + "score": 0.93, + "latex": "F _ { \\theta } ( x )" + }, + { + "category_id": 14, + "poly": [ + 711, + 1890, + 987, + 1890, + 987, + 1927, + 711, + 1927 + ], + "score": 0.92, + "latex": "\\mathcal { H } \\to \\mathrm { c o n e } ( r _ { 1 } , \\dots , r _ { s } ) \\ ." + }, + { + "category_id": 14, + "poly": [ + 550, + 929, + 1147, + 929, + 1147, + 1081, + 550, + 1081 + ], + "score": 0.92, + "latex": "\\begin{array} { l } { { \\displaystyle { \\mathcal C } = \\mathrm { c o n v } \\big ( \\upsilon _ { 1 } , \\ldots , \\upsilon _ { n } \\big ) + \\mathrm { c o n e } \\big ( r _ { 1 } , \\ldots , r _ { s } \\big ) } \\ ~ } \\\\ { { \\displaystyle ~ = \\left\\{ \\sum _ { i = 1 } ^ { n } \\lambda _ { i } \\upsilon _ { i } + \\sum _ { j = 1 } ^ { s } \\mu _ { j } r _ { j } \\bigg | \\lambda _ { i } , \\mu _ { j } \\geq 0 , \\sum _ { i = 1 } ^ { n } \\lambda _ { i } = 1 \\right\\} } \\ } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 585, + 334, + 1112, + 334, + 1112, + 385, + 585, + 385 + ], + "score": 0.92, + "latex": "F _ { \\theta } ( x ) = f _ { \\theta _ { L } } ^ { ( L ) } ( \\sigma ( f _ { \\theta _ { L - 1 } } ^ { ( L - 1 ) } ( \\sigma ( \\dots f _ { \\theta _ { 1 } } ^ { ( 1 ) } ( x ) \\dots ) ) ) ) ," + }, + { + "category_id": 13, + "poly": [ + 633, + 470, + 756, + 470, + 756, + 503, + 633, + 503 + ], + "score": 0.92, + "latex": "\\mathcal { L } _ { y } ( F _ { \\theta } ( x ) )" + }, + { + "category_id": 13, + "poly": [ + 453, + 1134, + 786, + 1134, + 786, + 1174, + 453, + 1174 + ], + "score": 0.91, + "latex": "\\mathcal { C } = \\left\\{ z | A z \\leq 0 , A \\in \\mathbb { R } ^ { m \\times d } \\right\\}" + }, + { + "category_id": 13, + "poly": [ + 1053, + 858, + 1142, + 858, + 1142, + 889, + 1053, + 889 + ], + "score": 0.91, + "latex": "\\mathcal { C } \\subset \\mathbb { R } ^ { d }" + }, + { + "category_id": 14, + "poly": [ + 725, + 1182, + 973, + 1182, + 973, + 1219, + 725, + 1219 + ], + "score": 0.9, + "latex": "\\mathcal { C } = \\mathrm { c o n e } ( r _ { 1 } , . . . , r _ { s } )" + }, + { + "category_id": 13, + "poly": [ + 811, + 296, + 843, + 296, + 843, + 326, + 811, + 326 + ], + "score": 0.89, + "latex": "F _ { \\theta }" + }, + { + "category_id": 13, + "poly": [ + 1036, + 1603, + 1115, + 1603, + 1115, + 1636, + 1036, + 1636 + ], + "score": 0.88, + "latex": "[ - 1 , 1 ]" + }, + { + "category_id": 13, + "poly": [ + 549, + 296, + 571, + 296, + 571, + 322, + 549, + 322 + ], + "score": 0.83, + "latex": "L" + }, + { + "category_id": 13, + "poly": [ + 1350, + 475, + 1364, + 475, + 1364, + 496, + 1350, + 496 + ], + "score": 0.83, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 892, + 657, + 909, + 657, + 909, + 681, + 892, + 681 + ], + "score": 0.82, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 853, + 793, + 873, + 793, + 873, + 819, + 853, + 819 + ], + "score": 0.82, + "latex": "\\mathcal { C }" + }, + { + "category_id": 13, + "poly": [ + 1108, + 296, + 1125, + 296, + 1125, + 322, + 1108, + 322 + ], + "score": 0.82, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 518, + 660, + 545, + 660, + 545, + 681, + 518, + 681 + ], + "score": 0.78, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 377, + 475, + 395, + 475, + 395, + 501, + 377, + 501 + ], + "score": 0.78, + "latex": "y" + }, + { + "category_id": 13, + "poly": [ + 1243, + 301, + 1261, + 301, + 1261, + 322, + 1243, + 322 + ], + "score": 0.75, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 1216, + 409, + 1235, + 409, + 1235, + 429, + 1216, + 429 + ], + "score": 0.72, + "latex": "\\sigma" + }, + { + "category_id": 13, + "poly": [ + 446, + 1954, + 464, + 1954, + 464, + 1973, + 446, + 1973 + ], + "score": 0.62, + "latex": "\\sigma" + }, + { + "category_id": 13, + "poly": [ + 591, + 893, + 613, + 893, + 613, + 923, + 591, + 923 + ], + "score": 0.49, + "latex": "i f" + }, + { + "category_id": 13, + "poly": [ + 332, + 2002, + 367, + 2002, + 367, + 2031, + 332, + 2031 + ], + "score": 0.44, + "latex": "^ 2 \\mathrm { I n }" + }, + { + "category_id": 13, + "poly": [ + 827, + 1405, + 852, + 1405, + 852, + 1432, + 827, + 1432 + ], + "score": 0.36, + "latex": "\\mathrm { H }" + }, + { + "category_id": 13, + "poly": [ + 1183, + 1821, + 1207, + 1821, + 1207, + 1847, + 1183, + 1847 + ], + "score": 0.3, + "latex": "\\mathrm { H } \\cdot" + }, + { + "category_id": 13, + "poly": [ + 655, + 1344, + 677, + 1344, + 677, + 1371, + 655, + 1371 + ], + "score": 0.28, + "latex": "\\mathrm { V } ." + }, + { + "category_id": 13, + "poly": [ + 1042, + 1283, + 1066, + 1283, + 1066, + 1309, + 1042, + 1309 + ], + "score": 0.27, + "latex": "\\mathrm { H } \\cdot" + }, + { + "category_id": 13, + "poly": [ + 989, + 862, + 1012, + 862, + 1012, + 888, + 989, + 888 + ], + "score": 0.26, + "latex": "A" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 1942.0, + 445.0, + 1942.0, + 445.0, + 1982.0, + 331.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1982.0, + 465.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1974.0, + 1121.0, + 1974.0, + 1121.0, + 2007.0, + 294.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 2000.0, + 331.0, + 2000.0, + 331.0, + 2040.0, + 328.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 2000.0, + 1242.0, + 2000.0, + 1242.0, + 2040.0, + 368.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 858.0, + 72.0, + 858.0, + 109.0, + 297.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1700.0, + 748.0, + 1700.0, + 748.0, + 1736.0, + 295.0, + 1736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 225.0, + 1295.0, + 225.0, + 1295.0, + 272.0, + 289.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 225.0, + 1295.0, + 225.0, + 1295.0, + 272.0, + 289.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 393.0, + 372.0, + 393.0, + 372.0, + 443.0, + 295.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 419.0, + 393.0, + 1215.0, + 393.0, + 1215.0, + 443.0, + 419.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1236.0, + 393.0, + 1405.0, + 393.0, + 1405.0, + 443.0, + 1236.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 437.0, + 1405.0, + 437.0, + 1405.0, + 477.0, + 294.0, + 477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 468.0, + 376.0, + 468.0, + 376.0, + 505.0, + 295.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 468.0, + 632.0, + 468.0, + 632.0, + 505.0, + 396.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 757.0, + 468.0, + 1349.0, + 468.0, + 1349.0, + 505.0, + 757.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1365.0, + 468.0, + 1405.0, + 468.0, + 1405.0, + 505.0, + 1365.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 498.0, + 1405.0, + 498.0, + 1405.0, + 535.0, + 294.0, + 535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 529.0, + 1405.0, + 529.0, + 1405.0, + 567.0, + 295.0, + 567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 549.0, + 1038.0, + 549.0, + 1038.0, + 620.0, + 285.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 549.0, + 1415.0, + 549.0, + 1415.0, + 620.0, + 1251.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 600.0, + 423.0, + 600.0, + 423.0, + 644.0, + 292.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 581.0, + 600.0, + 1183.0, + 600.0, + 1183.0, + 644.0, + 581.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1253.0, + 600.0, + 1265.0, + 600.0, + 1265.0, + 644.0, + 1253.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1280.0, + 1041.0, + 1280.0, + 1041.0, + 1315.0, + 295.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 1280.0, + 1405.0, + 1280.0, + 1405.0, + 1315.0, + 1067.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1314.0, + 1403.0, + 1314.0, + 1403.0, + 1345.0, + 295.0, + 1345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1344.0, + 654.0, + 1344.0, + 654.0, + 1375.0, + 295.0, + 1375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 1344.0, + 1403.0, + 1344.0, + 1403.0, + 1375.0, + 678.0, + 1375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1372.0, + 1405.0, + 1372.0, + 1405.0, + 1407.0, + 295.0, + 1407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1400.0, + 826.0, + 1400.0, + 826.0, + 1441.0, + 293.0, + 1441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 853.0, + 1400.0, + 1405.0, + 1400.0, + 1405.0, + 1441.0, + 853.0, + 1441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1434.0, + 1405.0, + 1434.0, + 1405.0, + 1469.0, + 294.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1464.0, + 738.0, + 1464.0, + 738.0, + 1501.0, + 294.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1512.0, + 1407.0, + 1512.0, + 1407.0, + 1545.0, + 294.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1543.0, + 1404.0, + 1543.0, + 1404.0, + 1576.0, + 296.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1573.0, + 1402.0, + 1573.0, + 1402.0, + 1607.0, + 296.0, + 1607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1599.0, + 1035.0, + 1599.0, + 1035.0, + 1640.0, + 293.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 1599.0, + 1405.0, + 1599.0, + 1405.0, + 1640.0, + 1116.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1631.0, + 961.0, + 1631.0, + 961.0, + 1671.0, + 294.0, + 1671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1755.0, + 1403.0, + 1755.0, + 1403.0, + 1795.0, + 295.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1787.0, + 1404.0, + 1787.0, + 1404.0, + 1824.0, + 293.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1817.0, + 1182.0, + 1817.0, + 1182.0, + 1856.0, + 292.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1208.0, + 1817.0, + 1407.0, + 1817.0, + 1407.0, + 1856.0, + 1208.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1849.0, + 860.0, + 1849.0, + 860.0, + 1884.0, + 296.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 788.0, + 852.0, + 788.0, + 852.0, + 827.0, + 293.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 788.0, + 1405.0, + 788.0, + 1405.0, + 827.0, + 874.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 818.0, + 424.0, + 818.0, + 424.0, + 857.0, + 290.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 853.0, + 988.0, + 853.0, + 988.0, + 897.0, + 293.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1013.0, + 853.0, + 1052.0, + 853.0, + 1052.0, + 897.0, + 1013.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1143.0, + 853.0, + 1405.0, + 853.0, + 1405.0, + 897.0, + 1143.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 889.0, + 590.0, + 889.0, + 590.0, + 927.0, + 296.0, + 927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 648.0, + 517.0, + 648.0, + 517.0, + 691.0, + 293.0, + 691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 546.0, + 648.0, + 891.0, + 648.0, + 891.0, + 691.0, + 546.0, + 691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 910.0, + 648.0, + 1330.0, + 648.0, + 1330.0, + 691.0, + 910.0, + 691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 291.0, + 548.0, + 291.0, + 548.0, + 331.0, + 296.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 572.0, + 291.0, + 810.0, + 291.0, + 810.0, + 331.0, + 572.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 844.0, + 291.0, + 1107.0, + 291.0, + 1107.0, + 331.0, + 844.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 291.0, + 1242.0, + 291.0, + 1242.0, + 331.0, + 1126.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1262.0, + 291.0, + 1391.0, + 291.0, + 1391.0, + 331.0, + 1262.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1082.0, + 579.0, + 1082.0, + 579.0, + 1129.0, + 289.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 726.0, + 1082.0, + 832.0, + 1082.0, + 832.0, + 1129.0, + 726.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 973.0, + 1082.0, + 984.0, + 1082.0, + 984.0, + 1129.0, + 973.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1127.0, + 452.0, + 1127.0, + 452.0, + 1181.0, + 293.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 787.0, + 1127.0, + 943.0, + 1127.0, + 943.0, + 1181.0, + 787.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1221.0, + 540.0, + 1221.0, + 540.0, + 1268.0, + 291.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 1221.0, + 692.0, + 1221.0, + 692.0, + 1268.0, + 681.0, + 1268.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1515, + 1403, + 1515, + 1403, + 2035, + 297, + 2035 + ], + "score": 0.985 + }, + { + "category_id": 1, + "poly": [ + 298, + 917, + 1404, + 917, + 1404, + 1198, + 298, + 1198 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1212, + 1404, + 1212, + 1404, + 1397, + 298, + 1397 + ], + "score": 0.978 + }, + { + "category_id": 3, + "poly": [ + 474, + 230, + 1209, + 230, + 1209, + 665, + 474, + 665 + ], + "score": 0.97 + }, + { + "category_id": 4, + "poly": [ + 296, + 697, + 1405, + 697, + 1405, + 849, + 296, + 849 + ], + "score": 0.965 + }, + { + "category_id": 2, + "poly": [ + 297, + 76, + 858, + 76, + 858, + 104, + 297, + 104 + ], + "score": 0.885 + }, + { + "category_id": 0, + "poly": [ + 299, + 1453, + 1001, + 1453, + 1001, + 1482, + 299, + 1482 + ], + "score": 0.871 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.758 + }, + { + "category_id": 13, + "poly": [ + 379, + 949, + 565, + 949, + 565, + 982, + 379, + 982 + ], + "score": 0.93, + "latex": "R = [ r _ { 1 } , \\ldots , r _ { s } ]" + }, + { + "category_id": 13, + "poly": [ + 807, + 1668, + 947, + 1668, + 947, + 1702, + 807, + 1702 + ], + "score": 0.93, + "latex": "\\{ r _ { 1 } , \\ldots , r _ { s } \\}" + }, + { + "category_id": 13, + "poly": [ + 1101, + 1973, + 1256, + 1973, + 1256, + 2006, + 1101, + 2006 + ], + "score": 0.92, + "latex": "f : \\mathbb { R } \\to \\mathbb { R } _ { \\geq 0 }" + }, + { + "category_id": 13, + "poly": [ + 532, + 1008, + 636, + 1008, + 636, + 1043, + 532, + 1043 + ], + "score": 0.92, + "latex": "( A ^ { k } , R ^ { k } )" + }, + { + "category_id": 13, + "poly": [ + 449, + 1605, + 582, + 1605, + 582, + 1636, + 449, + 1636 + ], + "score": 0.92, + "latex": "A \\in \\breve { \\mathbb { R } } ^ { m \\times d }" + }, + { + "category_id": 13, + "poly": [ + 696, + 1164, + 855, + 1164, + 855, + 1199, + 696, + 1199 + ], + "score": 0.92, + "latex": "( A ^ { k + 1 } , \\dot { R } ^ { k + 1 } )" + }, + { + "category_id": 13, + "poly": [ + 689, + 729, + 757, + 729, + 757, + 758, + 689, + 758 + ], + "score": 0.91, + "latex": "k + 1" + }, + { + "category_id": 13, + "poly": [ + 469, + 818, + 533, + 818, + 533, + 847, + 469, + 847 + ], + "score": 0.91, + "latex": "R ^ { k + 1 }" + }, + { + "category_id": 13, + "poly": [ + 299, + 980, + 375, + 980, + 375, + 1011, + 299, + 1011 + ], + "score": 0.9, + "latex": "( A , R )" + }, + { + "category_id": 13, + "poly": [ + 298, + 1104, + 382, + 1104, + 382, + 1135, + 298, + 1135 + ], + "score": 0.9, + "latex": "r _ { i } - r _ { j }" + }, + { + "category_id": 13, + "poly": [ + 299, + 1008, + 459, + 1008, + 459, + 1042, + 299, + 1042 + ], + "score": 0.9, + "latex": "( A ^ { k + 1 } , R ^ { k + 1 } )" + }, + { + "category_id": 13, + "poly": [ + 680, + 1100, + 718, + 1100, + 718, + 1130, + 680, + 1130 + ], + "score": 0.89, + "latex": "\\bar { \\boldsymbol { R } } ^ { k }" + }, + { + "category_id": 13, + "poly": [ + 400, + 1134, + 437, + 1134, + 437, + 1163, + 400, + 1163 + ], + "score": 0.89, + "latex": "R ^ { k }" + }, + { + "category_id": 13, + "poly": [ + 1076, + 1039, + 1113, + 1039, + 1113, + 1069, + 1076, + 1069 + ], + "score": 0.89, + "latex": "R ^ { k }" + }, + { + "category_id": 13, + "poly": [ + 1304, + 1133, + 1341, + 1133, + 1341, + 1163, + 1304, + 1163 + ], + "score": 0.88, + "latex": "R ^ { k }" + }, + { + "category_id": 13, + "poly": [ + 519, + 727, + 557, + 727, + 557, + 756, + 519, + 756 + ], + "score": 0.88, + "latex": "A ^ { k }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1069, + 334, + 1069, + 334, + 1099, + 298, + 1099 + ], + "score": 0.88, + "latex": "A ^ { k }" + }, + { + "category_id": 13, + "poly": [ + 1092, + 1008, + 1129, + 1008, + 1129, + 1037, + 1092, + 1037 + ], + "score": 0.88, + "latex": "A ^ { k }" + }, + { + "category_id": 13, + "poly": [ + 805, + 757, + 843, + 757, + 843, + 787, + 805, + 787 + ], + "score": 0.88, + "latex": "R ^ { k }" + }, + { + "category_id": 13, + "poly": [ + 1207, + 789, + 1244, + 789, + 1244, + 817, + 1207, + 817 + ], + "score": 0.87, + "latex": "R ^ { k }" + }, + { + "category_id": 13, + "poly": [ + 996, + 277, + 1021, + 277, + 1021, + 295, + 996, + 295 + ], + "score": 0.87, + "latex": "r _ { 6 }" + }, + { + "category_id": 13, + "poly": [ + 1300, + 763, + 1329, + 763, + 1329, + 790, + 1300, + 790 + ], + "score": 0.86, + "latex": "r _ { 7 }" + }, + { + "category_id": 13, + "poly": [ + 1218, + 764, + 1247, + 764, + 1247, + 789, + 1218, + 789 + ], + "score": 0.84, + "latex": "r _ { 6 }" + }, + { + "category_id": 13, + "poly": [ + 586, + 793, + 615, + 793, + 615, + 820, + 586, + 820 + ], + "score": 0.84, + "latex": "r _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1122, + 288, + 1148, + 288, + 1148, + 305, + 1122, + 305 + ], + "score": 0.83, + "latex": "r _ { 7 }" + }, + { + "category_id": 13, + "poly": [ + 1270, + 1011, + 1289, + 1011, + 1289, + 1037, + 1270, + 1037 + ], + "score": 0.82, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 1179, + 340, + 1204, + 340, + 1204, + 357, + 1179, + 357 + ], + "score": 0.82, + "latex": "r _ { 3 }" + }, + { + "category_id": 13, + "poly": [ + 777, + 340, + 801, + 340, + 801, + 357, + 777, + 357 + ], + "score": 0.81, + "latex": "r _ { 3 }" + }, + { + "category_id": 13, + "poly": [ + 339, + 730, + 357, + 730, + 357, + 756, + 339, + 756 + ], + "score": 0.81, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 754, + 1367, + 771, + 1367, + 771, + 1393, + 754, + 1393 + ], + "score": 0.81, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 1373, + 729, + 1401, + 729, + 1401, + 756, + 1373, + 756 + ], + "score": 0.79, + "latex": "H" + }, + { + "category_id": 13, + "poly": [ + 819, + 1609, + 838, + 1609, + 838, + 1635, + 819, + 1635 + ], + "score": 0.78, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 922, + 920, + 946, + 920, + 946, + 946, + 922, + 946 + ], + "score": 0.77, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 437, + 1043, + 460, + 1043, + 460, + 1068, + 437, + 1068 + ], + "score": 0.76, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 389, + 1370, + 417, + 1370, + 417, + 1393, + 389, + 1393 + ], + "score": 0.76, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 935, + 790, + 964, + 790, + 964, + 817, + 935, + 817 + ], + "score": 0.76, + "latex": "H" + }, + { + "category_id": 13, + "poly": [ + 1035, + 730, + 1063, + 730, + 1063, + 756, + 1035, + 756 + ], + "score": 0.71, + "latex": "H" + }, + { + "category_id": 13, + "poly": [ + 628, + 1612, + 656, + 1612, + 656, + 1635, + 628, + 1635 + ], + "score": 0.7, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 1001, + 389, + 1065, + 389, + 1065, + 414, + 1001, + 414 + ], + "score": 0.68, + "latex": "R ^ { k + 1 }" + }, + { + "category_id": 13, + "poly": [ + 480, + 496, + 493, + 496, + 493, + 510, + 480, + 510 + ], + "score": 0.63, + "latex": "r" + }, + { + "category_id": 13, + "poly": [ + 882, + 496, + 894, + 496, + 894, + 512, + 882, + 512 + ], + "score": 0.56, + "latex": "r" + }, + { + "category_id": 13, + "poly": [ + 616, + 1107, + 643, + 1107, + 643, + 1136, + 616, + 1136 + ], + "score": 0.56, + "latex": "r _ { j }" + }, + { + "category_id": 13, + "poly": [ + 607, + 387, + 648, + 387, + 648, + 416, + 607, + 416 + ], + "score": 0.53, + "latex": "\\mathbf { \\nabla } ^ { \\prime } R ^ { k } \\mathbf { \\nabla }" + }, + { + "category_id": 13, + "poly": [ + 984, + 764, + 1003, + 764, + 1003, + 785, + 984, + 785 + ], + "score": 0.49, + "latex": "\\circ ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 504, + 354, + 517, + 354, + 517, + 368, + 504, + 368 + ], + "score": 0.48, + "latex": "r" + }, + { + "category_id": 13, + "poly": [ + 522, + 456, + 530, + 456, + 530, + 466, + 522, + 466 + ], + "score": 0.46, + "latex": "\\mid" + }, + { + "category_id": 13, + "poly": [ + 641, + 236, + 666, + 236, + 666, + 254, + 641, + 254 + ], + "score": 0.46, + "latex": "r _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 571, + 485, + 580, + 485, + 580, + 496, + 571, + 496 + ], + "score": 0.45, + "latex": "^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 578, + 1105, + 644, + 1105, + 644, + 1135, + 578, + 1135 + ], + "score": 0.44, + "latex": "r _ { i } , r _ { j }" + }, + { + "category_id": 13, + "poly": [ + 1074, + 561, + 1101, + 561, + 1101, + 580, + 1074, + 580 + ], + "score": 0.43, + "latex": "r _ { 4 }" + }, + { + "category_id": 13, + "poly": [ + 848, + 1578, + 873, + 1578, + 873, + 1604, + 848, + 1604 + ], + "score": 0.39, + "latex": "_ \\mathrm { H }" + }, + { + "category_id": 13, + "poly": [ + 990, + 333, + 999, + 333, + 999, + 345, + 990, + 345 + ], + "score": 0.36, + "latex": "\\prime" + }, + { + "category_id": 13, + "poly": [ + 579, + 1107, + 603, + 1107, + 603, + 1133, + 579, + 1133 + ], + "score": 0.32, + "latex": "r _ { i }" + }, + { + "category_id": 13, + "poly": [ + 924, + 456, + 933, + 456, + 933, + 467, + 924, + 467 + ], + "score": 0.32, + "latex": "J" + }, + { + "category_id": 13, + "poly": [ + 908, + 354, + 931, + 354, + 931, + 370, + 908, + 370 + ], + "score": 0.32, + "latex": "r _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 672, + 561, + 698, + 561, + 698, + 580, + 672, + 580 + ], + "score": 0.31, + "latex": "r _ { 4 }" + }, + { + "category_id": 13, + "poly": [ + 669, + 1639, + 692, + 1639, + 692, + 1666, + 669, + 1666 + ], + "score": 0.26, + "latex": "\\mathrm { V } ." + }, + { + "category_id": 15, + "poly": [ + 649.0, + 280.0, + 662.0, + 280.0, + 662.0, + 294.0, + 649.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 744.0, + 278.0, + 781.0, + 278.0, + 781.0, + 316.0, + 744.0, + 316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 989.0, + 267.0, + 995.0, + 267.0, + 995.0, + 301.0, + 989.0, + 301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1022.0, + 267.0, + 1029.0, + 267.0, + 1029.0, + 301.0, + 1022.0, + 301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 645.0, + 297.0, + 655.0, + 297.0, + 655.0, + 305.0, + 645.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 311.0, + 648.0, + 311.0, + 648.0, + 325.0, + 635.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 712.0, + 301.0, + 733.0, + 301.0, + 733.0, + 322.0, + 712.0, + 322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 316.0, + 1125.0, + 316.0, + 1125.0, + 324.0, + 1116.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 506.0, + 351.0, + 519.0, + 351.0, + 519.0, + 364.0, + 506.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 611.0, + 328.0, + 643.0, + 328.0, + 643.0, + 388.0, + 611.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 329.0, + 776.0, + 329.0, + 776.0, + 364.0, + 769.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 802.0, + 329.0, + 809.0, + 329.0, + 809.0, + 364.0, + 802.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 347.0, + 935.0, + 347.0, + 935.0, + 371.0, + 932.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 976.0, + 330.0, + 989.0, + 330.0, + 989.0, + 391.0, + 976.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 327.0, + 1118.0, + 327.0, + 1118.0, + 394.0, + 1072.0, + 394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.0, + 330.0, + 1178.0, + 330.0, + 1178.0, + 363.0, + 1174.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1205.0, + 330.0, + 1211.0, + 330.0, + 1211.0, + 363.0, + 1205.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 398.0, + 751.0, + 398.0, + 751.0, + 406.0, + 743.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 392.0, + 986.0, + 392.0, + 986.0, + 409.0, + 971.0, + 409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1066.0, + 397.0, + 1073.0, + 397.0, + 1073.0, + 411.0, + 1066.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 603.0, + 406.0, + 606.0, + 406.0, + 606.0, + 414.0, + 603.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 966.0, + 408.0, + 982.0, + 408.0, + 982.0, + 426.0, + 966.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 411.0, + 1141.0, + 411.0, + 1141.0, + 419.0, + 1134.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 420.0, + 607.0, + 420.0, + 607.0, + 433.0, + 594.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 719.0, + 423.0, + 727.0, + 423.0, + 727.0, + 432.0, + 719.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 962.0, + 425.0, + 978.0, + 425.0, + 978.0, + 442.0, + 962.0, + 442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1044.0, + 425.0, + 1057.0, + 425.0, + 1057.0, + 439.0, + 1044.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1122.0, + 423.0, + 1131.0, + 423.0, + 1131.0, + 431.0, + 1122.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 436.0, + 600.0, + 436.0, + 600.0, + 448.0, + 588.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 447.0, + 705.0, + 447.0, + 705.0, + 455.0, + 697.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 438.0, + 936.0, + 438.0, + 936.0, + 448.0, + 927.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 958.0, + 442.0, + 974.0, + 442.0, + 974.0, + 457.0, + 958.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1036.0, + 441.0, + 1048.0, + 441.0, + 1048.0, + 452.0, + 1036.0, + 452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1097.0, + 445.0, + 1109.0, + 445.0, + 1109.0, + 458.0, + 1097.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1111.0, + 435.0, + 1119.0, + 435.0, + 1119.0, + 443.0, + 1111.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 452.0, + 591.0, + 452.0, + 591.0, + 462.0, + 583.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 460.0, + 694.0, + 460.0, + 694.0, + 469.0, + 686.0, + 469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 454.0, + 934.0, + 454.0, + 934.0, + 464.0, + 926.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 458.0, + 968.0, + 458.0, + 968.0, + 472.0, + 955.0, + 472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1027.0, + 453.0, + 1041.0, + 453.0, + 1041.0, + 466.0, + 1027.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1086.0, + 457.0, + 1097.0, + 457.0, + 1097.0, + 470.0, + 1086.0, + 470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 466.0, + 588.0, + 466.0, + 588.0, + 478.0, + 576.0, + 478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 675.0, + 471.0, + 683.0, + 471.0, + 683.0, + 479.0, + 675.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1019.0, + 468.0, + 1031.0, + 468.0, + 1031.0, + 481.0, + 1019.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1075.0, + 468.0, + 1088.0, + 468.0, + 1088.0, + 482.0, + 1075.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 473.0, + 485.0, + 479.0, + 485.0, + 479.0, + 520.0, + 473.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 494.0, + 485.0, + 511.0, + 485.0, + 511.0, + 520.0, + 494.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 650.0, + 481.0, + 673.0, + 481.0, + 673.0, + 507.0, + 650.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 878.0, + 486.0, + 881.0, + 486.0, + 881.0, + 519.0, + 878.0, + 519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 895.0, + 486.0, + 913.0, + 486.0, + 913.0, + 519.0, + 895.0, + 519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1003.0, + 483.0, + 1020.0, + 483.0, + 1020.0, + 507.0, + 1003.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 480.0, + 1076.0, + 480.0, + 1076.0, + 507.0, + 1052.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 506.0, + 1053.0, + 506.0, + 1053.0, + 517.0, + 1041.0, + 517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 230.0, + 667.0, + 230.0, + 667.0, + 257.0, + 640.0, + 257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1119.25, + 278.0, + 1149.25, + 278.0, + 1149.25, + 308.5, + 1119.25, + 308.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 592.25, + 378.5, + 662.25, + 378.5, + 662.25, + 422.5, + 592.25, + 422.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 986.0, + 373.5, + 1081.0, + 373.5, + 1081.0, + 422.0, + 986.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 408.0, + 1069.0, + 408.0, + 1069.0, + 426.0, + 1047.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 671.75, + 555.5, + 697.75, + 555.5, + 697.75, + 580.5, + 671.75, + 580.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1074.0, + 555.0, + 1102.0, + 555.0, + 1102.0, + 580.5, + 1074.0, + 580.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 696.0, + 1406.0, + 696.0, + 1406.0, + 734.0, + 293.0, + 734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 724.0, + 338.0, + 724.0, + 338.0, + 764.0, + 293.0, + 764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 724.0, + 518.0, + 724.0, + 518.0, + 764.0, + 358.0, + 764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 558.0, + 724.0, + 688.0, + 724.0, + 688.0, + 764.0, + 558.0, + 764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 758.0, + 724.0, + 1034.0, + 724.0, + 1034.0, + 764.0, + 758.0, + 764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 724.0, + 1372.0, + 724.0, + 1372.0, + 764.0, + 1064.0, + 764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 724.0, + 1405.0, + 724.0, + 1405.0, + 764.0, + 1402.0, + 764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 755.0, + 804.0, + 755.0, + 804.0, + 794.0, + 293.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 844.0, + 755.0, + 983.0, + 755.0, + 983.0, + 794.0, + 844.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1004.0, + 755.0, + 1217.0, + 755.0, + 1217.0, + 794.0, + 1004.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1248.0, + 755.0, + 1299.0, + 755.0, + 1299.0, + 794.0, + 1248.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1330.0, + 755.0, + 1405.0, + 755.0, + 1405.0, + 794.0, + 1330.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 786.0, + 585.0, + 786.0, + 585.0, + 824.0, + 293.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 616.0, + 786.0, + 934.0, + 786.0, + 934.0, + 824.0, + 616.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 965.0, + 786.0, + 1206.0, + 786.0, + 1206.0, + 824.0, + 965.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1245.0, + 786.0, + 1407.0, + 786.0, + 1407.0, + 824.0, + 1245.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.75, + 815.0, + 543.75, + 815.0, + 543.75, + 851.5, + 291.75, + 851.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1450.0, + 1005.0, + 1450.0, + 1005.0, + 1486.0, + 295.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1515.0, + 1405.0, + 1515.0, + 1405.0, + 1552.0, + 296.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1546.0, + 1405.0, + 1546.0, + 1405.0, + 1581.0, + 292.0, + 1581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1575.0, + 847.0, + 1575.0, + 847.0, + 1614.0, + 292.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 1575.0, + 1405.0, + 1575.0, + 1405.0, + 1614.0, + 874.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1601.0, + 448.0, + 1601.0, + 448.0, + 1645.0, + 291.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 1601.0, + 627.0, + 1601.0, + 627.0, + 1645.0, + 583.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 1601.0, + 818.0, + 1601.0, + 818.0, + 1645.0, + 657.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 1601.0, + 1408.0, + 1601.0, + 1408.0, + 1645.0, + 839.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1635.0, + 668.0, + 1635.0, + 668.0, + 1673.0, + 292.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 693.0, + 1635.0, + 1405.0, + 1635.0, + 1405.0, + 1673.0, + 693.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1666.0, + 806.0, + 1666.0, + 806.0, + 1707.0, + 293.0, + 1707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 948.0, + 1666.0, + 1408.0, + 1666.0, + 1408.0, + 1707.0, + 948.0, + 1707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1700.0, + 1405.0, + 1700.0, + 1405.0, + 1732.0, + 296.0, + 1732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1725.0, + 1404.0, + 1725.0, + 1404.0, + 1767.0, + 291.0, + 1767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1759.0, + 1405.0, + 1759.0, + 1405.0, + 1796.0, + 293.0, + 1796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1789.0, + 1404.0, + 1789.0, + 1404.0, + 1825.0, + 295.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1820.0, + 1405.0, + 1820.0, + 1405.0, + 1856.0, + 292.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1851.0, + 1405.0, + 1851.0, + 1405.0, + 1885.0, + 292.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1882.0, + 1405.0, + 1882.0, + 1405.0, + 1916.0, + 293.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1911.0, + 1405.0, + 1911.0, + 1405.0, + 1948.0, + 292.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1944.0, + 1401.0, + 1944.0, + 1401.0, + 1976.0, + 296.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1973.0, + 1100.0, + 1973.0, + 1100.0, + 2006.0, + 292.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1257.0, + 1973.0, + 1404.0, + 1973.0, + 1404.0, + 2006.0, + 1257.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2002.0, + 1336.0, + 2002.0, + 1336.0, + 2039.0, + 295.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 919.0, + 921.0, + 919.0, + 921.0, + 952.0, + 297.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 947.0, + 919.0, + 1405.0, + 919.0, + 1405.0, + 952.0, + 947.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 948.0, + 378.0, + 948.0, + 378.0, + 985.0, + 294.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 948.0, + 1405.0, + 948.0, + 1405.0, + 985.0, + 566.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 975.0, + 298.0, + 975.0, + 298.0, + 1015.0, + 295.0, + 1015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 376.0, + 975.0, + 1406.0, + 975.0, + 1406.0, + 1015.0, + 376.0, + 1015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 999.0, + 298.0, + 999.0, + 298.0, + 1051.0, + 293.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 999.0, + 531.0, + 999.0, + 531.0, + 1051.0, + 460.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 637.0, + 999.0, + 1091.0, + 999.0, + 1091.0, + 1051.0, + 637.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1130.0, + 999.0, + 1269.0, + 999.0, + 1269.0, + 1051.0, + 1130.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1290.0, + 999.0, + 1409.0, + 999.0, + 1409.0, + 1051.0, + 1290.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1036.0, + 436.0, + 1036.0, + 436.0, + 1077.0, + 293.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 461.0, + 1036.0, + 1075.0, + 1036.0, + 1075.0, + 1077.0, + 461.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 1036.0, + 1408.0, + 1036.0, + 1408.0, + 1077.0, + 1114.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 1067.0, + 1406.0, + 1067.0, + 1406.0, + 1105.0, + 335.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1096.0, + 297.0, + 1096.0, + 297.0, + 1139.0, + 291.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 1096.0, + 577.0, + 1096.0, + 577.0, + 1139.0, + 383.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 645.0, + 1096.0, + 679.0, + 1096.0, + 679.0, + 1139.0, + 645.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 719.0, + 1096.0, + 1409.0, + 1096.0, + 1409.0, + 1139.0, + 719.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1130.0, + 399.0, + 1130.0, + 399.0, + 1170.0, + 292.0, + 1170.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 438.0, + 1130.0, + 1303.0, + 1130.0, + 1303.0, + 1170.0, + 438.0, + 1170.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1342.0, + 1130.0, + 1407.0, + 1130.0, + 1407.0, + 1170.0, + 1342.0, + 1170.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1161.0, + 695.0, + 1161.0, + 695.0, + 1202.0, + 293.0, + 1202.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 856.0, + 1161.0, + 1283.0, + 1161.0, + 1283.0, + 1202.0, + 856.0, + 1202.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1210.0, + 1406.0, + 1210.0, + 1406.0, + 1247.0, + 293.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1245.0, + 1406.0, + 1245.0, + 1406.0, + 1277.0, + 296.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1273.0, + 1406.0, + 1273.0, + 1406.0, + 1308.0, + 293.0, + 1308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1303.0, + 1404.0, + 1303.0, + 1404.0, + 1338.0, + 293.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1334.0, + 1405.0, + 1334.0, + 1405.0, + 1368.0, + 293.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1367.0, + 388.0, + 1367.0, + 388.0, + 1397.0, + 294.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 418.0, + 1367.0, + 753.0, + 1367.0, + 753.0, + 1397.0, + 418.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 772.0, + 1367.0, + 782.0, + 1367.0, + 782.0, + 1397.0, + 772.0, + 1397.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 908, + 1404, + 908, + 1404, + 1250, + 297, + 1250 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1367, + 1404, + 1367, + 1404, + 1641, + 297, + 1641 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 286, + 1404, + 286, + 1404, + 532, + 297, + 532 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 627, + 1404, + 627, + 1404, + 813, + 298, + 813 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1657, + 1402, + 1657, + 1402, + 1842, + 298, + 1842 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 300, + 1857, + 1401, + 1857, + 1401, + 1980, + 300, + 1980 + ], + "score": 0.97 + }, + { + "category_id": 2, + "poly": [ + 333, + 2005, + 810, + 2005, + 810, + 2034, + 333, + 2034 + ], + "score": 0.915 + }, + { + "category_id": 0, + "poly": [ + 301, + 1297, + 666, + 1297, + 666, + 1332, + 301, + 1332 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 858, + 75, + 858, + 104, + 298, + 104 + ], + "score": 0.862 + }, + { + "category_id": 0, + "poly": [ + 300, + 853, + 1090, + 853, + 1090, + 882, + 300, + 882 + ], + "score": 0.848 + }, + { + "category_id": 0, + "poly": [ + 299, + 573, + 1198, + 573, + 1198, + 602, + 299, + 602 + ], + "score": 0.777 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.736 + }, + { + "category_id": 0, + "poly": [ + 299, + 232, + 980, + 232, + 980, + 260, + 299, + 260 + ], + "score": 0.707 + }, + { + "category_id": 1, + "poly": [ + 299, + 573, + 1198, + 573, + 1198, + 602, + 299, + 602 + ], + "score": 0.122 + }, + { + "category_id": 1, + "poly": [ + 299, + 232, + 980, + 232, + 980, + 260, + 299, + 260 + ], + "score": 0.117 + }, + { + "category_id": 13, + "poly": [ + 744, + 1090, + 1118, + 1090, + 1118, + 1129, + 744, + 1129 + ], + "score": 0.93, + "latex": "f ( x ) _ { i } = { \\mathrm { { \\bar { e x p } } } ( x _ { i } ) } / { \\sum _ { j = 1 } ^ { m } \\exp ( x _ { j } ) }" + }, + { + "category_id": 13, + "poly": [ + 816, + 782, + 1084, + 782, + 1084, + 814, + 816, + 814 + ], + "score": 0.93, + "latex": "x _ { i + 1 } - 2 x _ { i } + x _ { i - 1 } \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 1003, + 285, + 1336, + 285, + 1336, + 321, + 1003, + 321 + ], + "score": 0.93, + "latex": "B : = \\{ x \\in \\mathbb { R } ^ { d } | - 1 \\leq x _ { i } \\leq 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 546, + 688, + 746, + 688, + 746, + 723, + 546, + 723 + ], + "score": 0.92, + "latex": "\\{ x | a _ { i } ^ { T } x \\le 0 \\ \\forall i \\}" + }, + { + "category_id": 13, + "poly": [ + 493, + 783, + 610, + 783, + 610, + 814, + 493, + 814 + ], + "score": 0.92, + "latex": "x _ { i + 1 } \\geq x _ { i }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1125, + 552, + 1125, + 552, + 1163, + 297, + 1163 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\lambda _ { i } \\ge 0 , \\sum _ { i = 1 } ^ { m } \\lambda _ { i } = 1 } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 400, + 970, + 491, + 970, + 491, + 1000, + 400, + 1000 + ], + "score": 0.91, + "latex": "A x \\leq b" + }, + { + "category_id": 13, + "poly": [ + 980, + 1747, + 1122, + 1747, + 1122, + 1783, + 980, + 1783 + ], + "score": 0.91, + "latex": "[ 1 0 ^ { - 5 } , 1 0 ^ { - 3 } ]" + }, + { + "category_id": 13, + "poly": [ + 980, + 502, + 1158, + 502, + 1158, + 532, + 980, + 532 + ], + "score": 0.91, + "latex": "\\alpha x \\in \\mathcal { C } \\forall \\alpha \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 848, + 629, + 948, + 629, + 948, + 659, + 848, + 659 + ], + "score": 0.91, + "latex": "A x \\le 0" + }, + { + "category_id": 13, + "poly": [ + 1132, + 471, + 1252, + 471, + 1252, + 499, + 1132, + 499 + ], + "score": 0.91, + "latex": "\\hat { x } \\in \\mathcal { C } \\cap B" + }, + { + "category_id": 13, + "poly": [ + 298, + 1918, + 377, + 1918, + 377, + 1952, + 298, + 1952 + ], + "score": 0.9, + "latex": "[ - 1 , 1 ]" + }, + { + "category_id": 13, + "poly": [ + 846, + 504, + 914, + 504, + 914, + 530, + 846, + 530 + ], + "score": 0.89, + "latex": "x \\in { \\mathcal { C } }" + }, + { + "category_id": 13, + "poly": [ + 1325, + 410, + 1393, + 410, + 1393, + 438, + 1325, + 438 + ], + "score": 0.88, + "latex": "x \\in { \\mathcal { C } }" + }, + { + "category_id": 13, + "poly": [ + 1284, + 441, + 1354, + 441, + 1354, + 469, + 1284, + 469 + ], + "score": 0.88, + "latex": "\\mathcal { C } \\cap \\mathcal { B }" + }, + { + "category_id": 13, + "poly": [ + 683, + 471, + 755, + 471, + 755, + 503, + 683, + 503 + ], + "score": 0.86, + "latex": "x \\notin B" + }, + { + "category_id": 13, + "poly": [ + 767, + 470, + 1029, + 470, + 1029, + 503, + 767, + 503 + ], + "score": 0.84, + "latex": "\\hat { x } = x / \\operatorname* { m a x } \\{ \\| x \\| _ { \\infty } , 1 \\bar \\}" + }, + { + "category_id": 13, + "poly": [ + 522, + 1164, + 550, + 1164, + 550, + 1190, + 522, + 1190 + ], + "score": 0.82, + "latex": "x _ { i }" + }, + { + "category_id": 13, + "poly": [ + 563, + 664, + 590, + 664, + 590, + 689, + 563, + 689 + ], + "score": 0.81, + "latex": "a _ { i }" + }, + { + "category_id": 13, + "poly": [ + 627, + 661, + 650, + 661, + 650, + 686, + 627, + 686 + ], + "score": 0.8, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 415, + 476, + 434, + 476, + 434, + 498, + 415, + 498 + ], + "score": 0.77, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 753, + 971, + 777, + 971, + 777, + 997, + 753, + 997 + ], + "score": 0.72, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 827, + 971, + 844, + 971, + 844, + 997, + 827, + 997 + ], + "score": 0.7, + "latex": "b" + }, + { + "category_id": 13, + "poly": [ + 823, + 442, + 845, + 442, + 845, + 468, + 823, + 468 + ], + "score": 0.68, + "latex": "\\boldsymbol { B }" + }, + { + "category_id": 13, + "poly": [ + 608, + 1779, + 653, + 1779, + 653, + 1812, + 608, + 1812 + ], + "score": 0.54, + "latex": "1 / 2" + }, + { + "category_id": 13, + "poly": [ + 473, + 1002, + 495, + 1002, + 495, + 1029, + 473, + 1029 + ], + "score": 0.28, + "latex": "\\mathrm { v } ." + }, + { + "category_id": 13, + "poly": [ + 916, + 1950, + 939, + 1950, + 939, + 1976, + 916, + 1976 + ], + "score": 0.26, + "latex": "\\mathrm { v } ." + }, + { + "category_id": 13, + "poly": [ + 1371, + 380, + 1394, + 380, + 1394, + 407, + 1371, + 407 + ], + "score": 0.26, + "latex": "\\mathrm { V } ." + }, + { + "category_id": 15, + "poly": [ + 332.0, + 1998.0, + 814.0, + 1998.0, + 814.0, + 2040.0, + 332.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1294.0, + 669.0, + 1294.0, + 669.0, + 1338.0, + 293.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 858.0, + 72.0, + 858.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 849.0, + 1095.0, + 849.0, + 1095.0, + 887.0, + 294.0, + 887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 571.0, + 1202.0, + 571.0, + 1202.0, + 606.0, + 295.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 861.0, + 2085.0, + 861.0, + 2120.0, + 839.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 230.0, + 986.0, + 230.0, + 986.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 907.0, + 1405.0, + 907.0, + 1405.0, + 943.0, + 294.0, + 943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 940.0, + 1406.0, + 940.0, + 1406.0, + 975.0, + 295.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 967.0, + 399.0, + 967.0, + 399.0, + 1005.0, + 292.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 492.0, + 967.0, + 752.0, + 967.0, + 752.0, + 1005.0, + 492.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 967.0, + 826.0, + 967.0, + 826.0, + 1005.0, + 778.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 845.0, + 967.0, + 1406.0, + 967.0, + 1406.0, + 1005.0, + 845.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 999.0, + 472.0, + 999.0, + 472.0, + 1036.0, + 294.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 496.0, + 999.0, + 1404.0, + 999.0, + 1404.0, + 1036.0, + 496.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1030.0, + 1405.0, + 1030.0, + 1405.0, + 1065.0, + 294.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1063.0, + 1404.0, + 1063.0, + 1404.0, + 1094.0, + 295.0, + 1094.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 1084.0, + 743.0, + 1084.0, + 743.0, + 1138.0, + 287.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1119.0, + 1084.0, + 1410.0, + 1084.0, + 1410.0, + 1138.0, + 1119.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1118.0, + 296.0, + 1118.0, + 296.0, + 1173.0, + 288.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 1118.0, + 1410.0, + 1118.0, + 1410.0, + 1173.0, + 553.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1158.0, + 521.0, + 1158.0, + 521.0, + 1193.0, + 291.0, + 1193.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 551.0, + 1158.0, + 1407.0, + 1158.0, + 1407.0, + 1193.0, + 551.0, + 1193.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1188.0, + 1406.0, + 1188.0, + 1406.0, + 1226.0, + 292.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1218.0, + 1376.0, + 1218.0, + 1376.0, + 1254.0, + 294.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1369.0, + 1402.0, + 1369.0, + 1402.0, + 1401.0, + 297.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1396.0, + 1405.0, + 1396.0, + 1405.0, + 1434.0, + 292.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1427.0, + 1405.0, + 1427.0, + 1405.0, + 1466.0, + 291.0, + 1466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1459.0, + 1405.0, + 1459.0, + 1405.0, + 1495.0, + 294.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1490.0, + 1406.0, + 1490.0, + 1406.0, + 1526.0, + 294.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1518.0, + 1402.0, + 1518.0, + 1402.0, + 1555.0, + 294.0, + 1555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1549.0, + 1405.0, + 1549.0, + 1405.0, + 1586.0, + 295.0, + 1586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1577.0, + 1406.0, + 1577.0, + 1406.0, + 1618.0, + 292.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1612.0, + 613.0, + 1612.0, + 613.0, + 1644.0, + 293.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 285.0, + 1002.0, + 285.0, + 1002.0, + 322.0, + 294.0, + 322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1337.0, + 285.0, + 1405.0, + 285.0, + 1405.0, + 322.0, + 1337.0, + 322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 317.0, + 1405.0, + 317.0, + 1405.0, + 353.0, + 291.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 349.0, + 1404.0, + 349.0, + 1404.0, + 383.0, + 295.0, + 383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 379.0, + 1370.0, + 379.0, + 1370.0, + 413.0, + 294.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 379.0, + 1404.0, + 379.0, + 1404.0, + 413.0, + 1395.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 409.0, + 1324.0, + 409.0, + 1324.0, + 444.0, + 291.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 409.0, + 1405.0, + 409.0, + 1405.0, + 444.0, + 1394.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 438.0, + 822.0, + 438.0, + 822.0, + 476.0, + 292.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 846.0, + 438.0, + 1283.0, + 438.0, + 1283.0, + 476.0, + 846.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1355.0, + 438.0, + 1406.0, + 438.0, + 1406.0, + 476.0, + 1355.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 467.0, + 414.0, + 467.0, + 414.0, + 508.0, + 291.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 467.0, + 682.0, + 467.0, + 682.0, + 508.0, + 435.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 467.0, + 766.0, + 467.0, + 766.0, + 508.0, + 756.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1030.0, + 467.0, + 1131.0, + 467.0, + 1131.0, + 508.0, + 1030.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1253.0, + 467.0, + 1406.0, + 467.0, + 1406.0, + 508.0, + 1253.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 502.0, + 845.0, + 502.0, + 845.0, + 534.0, + 293.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 502.0, + 979.0, + 502.0, + 979.0, + 534.0, + 915.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 502.0, + 1170.0, + 502.0, + 1170.0, + 534.0, + 1159.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 625.0, + 847.0, + 625.0, + 847.0, + 664.0, + 293.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 949.0, + 625.0, + 1404.0, + 625.0, + 1404.0, + 664.0, + 949.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 657.0, + 562.0, + 657.0, + 562.0, + 696.0, + 293.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 657.0, + 626.0, + 657.0, + 626.0, + 696.0, + 591.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 651.0, + 657.0, + 1406.0, + 657.0, + 1406.0, + 696.0, + 651.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 688.0, + 545.0, + 688.0, + 545.0, + 724.0, + 291.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 688.0, + 1407.0, + 688.0, + 1407.0, + 724.0, + 747.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 720.0, + 1404.0, + 720.0, + 1404.0, + 756.0, + 293.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 751.0, + 1405.0, + 751.0, + 1405.0, + 786.0, + 293.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 783.0, + 492.0, + 783.0, + 492.0, + 818.0, + 293.0, + 818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 611.0, + 783.0, + 815.0, + 783.0, + 815.0, + 818.0, + 611.0, + 818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1085.0, + 783.0, + 1095.0, + 783.0, + 1095.0, + 818.0, + 1085.0, + 818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1654.0, + 1406.0, + 1654.0, + 1406.0, + 1692.0, + 294.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1687.0, + 1406.0, + 1687.0, + 1406.0, + 1721.0, + 293.0, + 1721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1718.0, + 1406.0, + 1718.0, + 1406.0, + 1752.0, + 293.0, + 1752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1746.0, + 979.0, + 1746.0, + 979.0, + 1785.0, + 293.0, + 1785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1123.0, + 1746.0, + 1407.0, + 1746.0, + 1407.0, + 1785.0, + 1123.0, + 1785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1781.0, + 607.0, + 1781.0, + 607.0, + 1813.0, + 296.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 654.0, + 1781.0, + 1403.0, + 1781.0, + 1403.0, + 1813.0, + 654.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1808.0, + 1344.0, + 1808.0, + 1344.0, + 1846.0, + 294.0, + 1846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1858.0, + 1403.0, + 1858.0, + 1403.0, + 1891.0, + 295.0, + 1891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1887.0, + 1407.0, + 1887.0, + 1407.0, + 1922.0, + 293.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 378.0, + 1918.0, + 1405.0, + 1918.0, + 1405.0, + 1955.0, + 378.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1949.0, + 915.0, + 1949.0, + 915.0, + 1985.0, + 294.0, + 1985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 940.0, + 1949.0, + 1405.0, + 1949.0, + 1405.0, + 1985.0, + 940.0, + 1985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 571.0, + 1202.0, + 571.0, + 1202.0, + 606.0, + 295.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 230.0, + 986.0, + 230.0, + 986.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1575, + 1405, + 1575, + 1405, + 2034, + 297, + 2034 + ], + "score": 0.985 + }, + { + "category_id": 1, + "poly": [ + 298, + 336, + 1404, + 336, + 1404, + 584, + 298, + 584 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1029, + 1405, + 1029, + 1405, + 1248, + 297, + 1248 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1401, + 229, + 1401, + 323, + 299, + 323 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 297, + 1466, + 1403, + 1466, + 1403, + 1562, + 297, + 1562 + ], + "score": 0.966 + }, + { + "category_id": 1, + "poly": [ + 298, + 768, + 1403, + 768, + 1403, + 833, + 298, + 833 + ], + "score": 0.954 + }, + { + "category_id": 8, + "poly": [ + 493, + 1321, + 1205, + 1321, + 1205, + 1394, + 493, + 1394 + ], + "score": 0.947 + }, + { + "category_id": 8, + "poly": [ + 661, + 905, + 1044, + 905, + 1044, + 958, + 661, + 958 + ], + "score": 0.939 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 858, + 75, + 858, + 105, + 298, + 105 + ], + "score": 0.913 + }, + { + "category_id": 9, + "poly": [ + 1366, + 910, + 1400, + 910, + 1400, + 939, + 1366, + 939 + ], + "score": 0.89 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1342, + 1400, + 1342, + 1400, + 1373, + 1366, + 1373 + ], + "score": 0.888 + }, + { + "category_id": 0, + "poly": [ + 297, + 687, + 998, + 687, + 998, + 718, + 297, + 718 + ], + "score": 0.879 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 858, + 2089, + 858, + 2112, + 840, + 2112 + ], + "score": 0.782 + }, + { + "category_id": 13, + "poly": [ + 627, + 1468, + 752, + 1468, + 752, + 1502, + 627, + 1502 + ], + "score": 0.95, + "latex": "\\mathcal { L } _ { y } ( \\mathcal { P } c ( y ) )" + }, + { + "category_id": 14, + "poly": [ + 493, + 1318, + 1203, + 1318, + 1203, + 1396, + 493, + 1396 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\displaystyle \\Big | \\mathcal { L } _ { y } ( \\mathcal { P } _ { \\mathcal { C } } ( \\hat { y } ) ) - \\mathcal { L } _ { y } ( \\mathcal { P } _ { \\mathcal { C } } ( y ) ) \\Big | \\le \\left\\| \\mathcal { P } _ { \\mathcal { C } } ( \\hat { y } ) - \\mathcal { P } _ { \\mathcal { C } } ( y ) \\right\\| _ { 2 } \\le \\left\\| \\hat { y } - y \\right\\| _ { 2 } , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 658, + 904, + 1043, + 904, + 1043, + 959, + 658, + 959 + ], + "score": 0.92, + "latex": "\\operatorname* { m i n } _ { z \\in \\mathbb { R } ^ { d } } \\left\\| z - y \\right\\| _ { 2 } \\quad \\mathrm { s . t . } A z \\leq 0 \\qquad ," + }, + { + "category_id": 13, + "poly": [ + 681, + 1638, + 831, + 1638, + 831, + 1670, + 681, + 1670 + ], + "score": 0.92, + "latex": "F C ( 7 8 4 , n _ { r } )" + }, + { + "category_id": 13, + "poly": [ + 1146, + 1185, + 1223, + 1185, + 1223, + 1213, + 1146, + 1213 + ], + "score": 0.9, + "latex": "L = 1" + }, + { + "category_id": 13, + "poly": [ + 295, + 1185, + 400, + 1185, + 400, + 1219, + 295, + 1219 + ], + "score": 0.9, + "latex": "\\| x - y \\| _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1020, + 1123, + 1368, + 1123, + 1368, + 1158, + 1020, + 1158 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\mathcal { P } c ( y ) : = \\arg \\operatorname* { m i n } _ { z \\in \\mathcal { C } } \\| z - y \\| _ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1291, + 1156, + 1405, + 1156, + 1405, + 1187, + 1291, + 1187 + ], + "score": 0.9, + "latex": "\\mathcal { L } _ { y } ( x ) : =" + }, + { + "category_id": 13, + "poly": [ + 959, + 1639, + 1093, + 1639, + 1093, + 1668, + 959, + 1668 + ], + "score": 0.89, + "latex": "n _ { r } = 1 5 5 2" + }, + { + "category_id": 13, + "poly": [ + 297, + 1727, + 357, + 1727, + 357, + 1758, + 297, + 1758 + ], + "score": 0.88, + "latex": "1 0 ^ { - 4 }" + }, + { + "category_id": 13, + "poly": [ + 1186, + 1942, + 1227, + 1942, + 1227, + 1972, + 1186, + 1972 + ], + "score": 0.88, + "latex": "1 \\%" + }, + { + "category_id": 13, + "poly": [ + 1036, + 1607, + 1197, + 1607, + 1197, + 1640, + 1036, + 1640 + ], + "score": 0.87, + "latex": "F C ( 7 8 4 , 7 8 4 )" + }, + { + "category_id": 13, + "poly": [ + 373, + 1942, + 415, + 1942, + 415, + 1972, + 373, + 1972 + ], + "score": 0.87, + "latex": "9 \\%" + }, + { + "category_id": 13, + "poly": [ + 447, + 1217, + 465, + 1217, + 465, + 1247, + 447, + 1247 + ], + "score": 0.85, + "latex": "\\hat { y }" + }, + { + "category_id": 13, + "poly": [ + 341, + 1501, + 360, + 1501, + 360, + 1531, + 341, + 1531 + ], + "score": 0.85, + "latex": "\\hat { y }" + }, + { + "category_id": 13, + "poly": [ + 963, + 1501, + 983, + 1501, + 983, + 1531, + 963, + 1531 + ], + "score": 0.84, + "latex": "\\hat { y }" + }, + { + "category_id": 13, + "poly": [ + 374, + 1038, + 392, + 1038, + 392, + 1064, + 374, + 1064 + ], + "score": 0.79, + "latex": "y" + }, + { + "category_id": 13, + "poly": [ + 841, + 1155, + 861, + 1155, + 861, + 1181, + 841, + 1181 + ], + "score": 0.77, + "latex": "\\mathcal { C }" + }, + { + "category_id": 13, + "poly": [ + 397, + 1505, + 417, + 1505, + 417, + 1532, + 397, + 1532 + ], + "score": 0.76, + "latex": "y" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 685.0, + 1002.0, + 685.0, + 1002.0, + 720.0, + 294.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2087.0, + 861.0, + 2087.0, + 861.0, + 2118.0, + 840.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1574.0, + 1405.0, + 1574.0, + 1405.0, + 1611.0, + 294.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1607.0, + 1035.0, + 1607.0, + 1035.0, + 1642.0, + 294.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1198.0, + 1607.0, + 1405.0, + 1607.0, + 1405.0, + 1642.0, + 1198.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1637.0, + 680.0, + 1637.0, + 680.0, + 1672.0, + 294.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 1637.0, + 958.0, + 1637.0, + 958.0, + 1672.0, + 832.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 1637.0, + 1403.0, + 1637.0, + 1403.0, + 1672.0, + 1094.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1668.0, + 1405.0, + 1668.0, + 1405.0, + 1703.0, + 294.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1698.0, + 1405.0, + 1698.0, + 1405.0, + 1730.0, + 295.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1723.0, + 296.0, + 1723.0, + 296.0, + 1767.0, + 292.0, + 1767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 1723.0, + 1407.0, + 1723.0, + 1407.0, + 1767.0, + 358.0, + 1767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1761.0, + 1402.0, + 1761.0, + 1402.0, + 1792.0, + 296.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1788.0, + 1406.0, + 1788.0, + 1406.0, + 1824.0, + 292.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1821.0, + 1405.0, + 1821.0, + 1405.0, + 1856.0, + 294.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1851.0, + 1406.0, + 1851.0, + 1406.0, + 1886.0, + 295.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1882.0, + 1406.0, + 1882.0, + 1406.0, + 1917.0, + 294.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1911.0, + 1405.0, + 1911.0, + 1405.0, + 1948.0, + 294.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1940.0, + 372.0, + 1940.0, + 372.0, + 1977.0, + 294.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 416.0, + 1940.0, + 1185.0, + 1940.0, + 1185.0, + 1977.0, + 416.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1228.0, + 1940.0, + 1405.0, + 1940.0, + 1405.0, + 1977.0, + 1228.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1970.0, + 1405.0, + 1970.0, + 1405.0, + 2008.0, + 292.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2000.0, + 481.0, + 2000.0, + 481.0, + 2036.0, + 294.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 337.0, + 1404.0, + 337.0, + 1404.0, + 373.0, + 295.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 367.0, + 1405.0, + 367.0, + 1405.0, + 403.0, + 293.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 397.0, + 1404.0, + 397.0, + 1404.0, + 436.0, + 293.0, + 436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 427.0, + 1405.0, + 427.0, + 1405.0, + 466.0, + 293.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 461.0, + 1404.0, + 461.0, + 1404.0, + 495.0, + 294.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 490.0, + 1405.0, + 490.0, + 1405.0, + 526.0, + 292.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 523.0, + 1406.0, + 523.0, + 1406.0, + 557.0, + 294.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 551.0, + 707.0, + 551.0, + 707.0, + 587.0, + 295.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1031.0, + 373.0, + 1031.0, + 373.0, + 1066.0, + 296.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1031.0, + 1403.0, + 1031.0, + 1403.0, + 1066.0, + 393.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1062.0, + 1406.0, + 1062.0, + 1406.0, + 1097.0, + 294.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1094.0, + 1406.0, + 1094.0, + 1406.0, + 1126.0, + 294.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1121.0, + 1019.0, + 1121.0, + 1019.0, + 1163.0, + 291.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1369.0, + 1121.0, + 1407.0, + 1121.0, + 1407.0, + 1163.0, + 1369.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1150.0, + 840.0, + 1150.0, + 840.0, + 1191.0, + 291.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 1150.0, + 1290.0, + 1150.0, + 1290.0, + 1191.0, + 862.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 1183.0, + 1145.0, + 1183.0, + 1145.0, + 1222.0, + 401.0, + 1222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 1183.0, + 1405.0, + 1183.0, + 1405.0, + 1222.0, + 1224.0, + 1222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1215.0, + 446.0, + 1215.0, + 446.0, + 1249.0, + 294.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.0, + 1215.0, + 778.0, + 1215.0, + 778.0, + 1249.0, + 466.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 1405.0, + 227.0, + 1405.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 258.0, + 1406.0, + 258.0, + 1406.0, + 299.0, + 293.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 292.0, + 797.0, + 292.0, + 797.0, + 326.0, + 294.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1465.0, + 626.0, + 1465.0, + 626.0, + 1507.0, + 293.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 753.0, + 1465.0, + 1405.0, + 1465.0, + 1405.0, + 1507.0, + 753.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1498.0, + 340.0, + 1498.0, + 340.0, + 1536.0, + 293.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 1498.0, + 396.0, + 1498.0, + 396.0, + 1536.0, + 361.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 418.0, + 1498.0, + 962.0, + 1498.0, + 962.0, + 1536.0, + 418.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 984.0, + 1498.0, + 1407.0, + 1498.0, + 1407.0, + 1536.0, + 984.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1530.0, + 1292.0, + 1530.0, + 1292.0, + 1564.0, + 296.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 764.0, + 1405.0, + 764.0, + 1405.0, + 807.0, + 295.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 799.0, + 1201.0, + 799.0, + 1201.0, + 835.0, + 296.0, + 835.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1567, + 1404, + 1567, + 1404, + 1816, + 298, + 1816 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 299, + 1336, + 1405, + 1336, + 1405, + 1461, + 299, + 1461 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1911, + 1402, + 1911, + 1402, + 2034, + 299, + 2034 + ], + "score": 0.976 + }, + { + "category_id": 3, + "poly": [ + 355, + 872, + 1339, + 872, + 1339, + 1101, + 355, + 1101 + ], + "score": 0.973 + }, + { + "category_id": 3, + "poly": [ + 519, + 229, + 1166, + 229, + 1166, + 524, + 519, + 524 + ], + "score": 0.97 + }, + { + "category_id": 4, + "poly": [ + 298, + 1131, + 1405, + 1131, + 1405, + 1225, + 298, + 1225 + ], + "score": 0.944 + }, + { + "category_id": 4, + "poly": [ + 295, + 560, + 1405, + 560, + 1405, + 807, + 295, + 807 + ], + "score": 0.942 + }, + { + "category_id": 2, + "poly": [ + 297, + 76, + 858, + 76, + 858, + 104, + 297, + 104 + ], + "score": 0.89 + }, + { + "category_id": 8, + "poly": [ + 445, + 1477, + 1254, + 1477, + 1254, + 1552, + 445, + 1552 + ], + "score": 0.874 + }, + { + "category_id": 0, + "poly": [ + 308, + 1854, + 1066, + 1854, + 1066, + 1884, + 308, + 1884 + ], + "score": 0.871 + }, + { + "category_id": 0, + "poly": [ + 296, + 1281, + 1275, + 1281, + 1275, + 1311, + 296, + 1311 + ], + "score": 0.866 + }, + { + "category_id": 2, + "poly": [ + 842, + 2087, + 858, + 2087, + 858, + 2111, + 842, + 2111 + ], + "score": 0.656 + }, + { + "category_id": 2, + "poly": [ + 842, + 2087, + 859, + 2087, + 859, + 2111, + 842, + 2111 + ], + "score": 0.246 + }, + { + "category_id": 13, + "poly": [ + 1196, + 1722, + 1353, + 1722, + 1353, + 1755, + 1196, + 1755 + ], + "score": 0.93, + "latex": "z \\sim \\mathcal { N } ( 0 , I )" + }, + { + "category_id": 13, + "poly": [ + 1114, + 1569, + 1393, + 1569, + 1393, + 1603, + 1114, + 1603 + ], + "score": 0.91, + "latex": "\\sigma ( x ) = 1 / ( 1 { + } \\mathrm { e x p } ( - x ) )" + }, + { + "category_id": 13, + "poly": [ + 1108, + 1629, + 1167, + 1629, + 1167, + 1660, + 1108, + 1660 + ], + "score": 0.91, + "latex": "1 0 ^ { - 4 }" + }, + { + "category_id": 13, + "poly": [ + 364, + 1569, + 624, + 1569, + 624, + 1603, + 364, + 1603 + ], + "score": 0.9, + "latex": "\\mathrm { R e L U } ( x ) = \\operatorname* { m a x } ( 0 , x )" + }, + { + "category_id": 13, + "poly": [ + 552, + 1479, + 984, + 1479, + 984, + 1514, + 552, + 1514 + ], + "score": 0.87, + "latex": "F C ( 7 8 4 , 2 5 6 ) \\mathrm { - R e L U - } F C ( 2 5 6 , 2 )" + }, + { + "category_id": 13, + "poly": [ + 422, + 776, + 463, + 776, + 463, + 805, + 422, + 805 + ], + "score": 0.86, + "latex": "1 \\%" + }, + { + "category_id": 13, + "poly": [ + 402, + 745, + 443, + 745, + 443, + 774, + 402, + 774 + ], + "score": 0.86, + "latex": "9 \\%" + }, + { + "category_id": 13, + "poly": [ + 362, + 716, + 436, + 716, + 436, + 743, + 362, + 743 + ], + "score": 0.75, + "latex": "\\sim \\mathrm { 3 0 s }" + }, + { + "category_id": 13, + "poly": [ + 554, + 1518, + 1250, + 1518, + 1250, + 1552, + 554, + 1552 + ], + "score": 0.61, + "latex": "F C ( 2 , 2 5 6 ) - \\mathrm { R e L U } - F C ( 2 5 6 , 7 8 4 ) - \\mathrm { s i g m o i d } - \\mathrm { c o n s t r a i n t }" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 981.0, + 524.0, + 981.0, + 524.0, + 1071.0, + 397.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 984.0, + 1296.0, + 984.0, + 1296.0, + 1068.0, + 1206.0, + 1068.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 225.0, + 601.0, + 225.0, + 601.0, + 257.0, + 559.0, + 257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 249.0, + 1128.0, + 249.0, + 1128.0, + 282.0, + 761.0, + 282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 275.0, + 549.0, + 275.0, + 549.0, + 421.0, + 517.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 557.0, + 276.0, + 611.0, + 276.0, + 611.0, + 314.0, + 557.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 760.0, + 279.0, + 1019.0, + 279.0, + 1019.0, + 309.0, + 760.0, + 309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 307.0, + 949.0, + 307.0, + 949.0, + 336.0, + 761.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 558.0, + 332.0, + 612.0, + 332.0, + 612.0, + 366.0, + 558.0, + 366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 760.0, + 333.0, + 973.0, + 333.0, + 973.0, + 364.0, + 760.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 557.0, + 388.0, + 605.0, + 388.0, + 605.0, + 422.0, + 557.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 558.0, + 442.0, + 613.0, + 442.0, + 613.0, + 475.0, + 558.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 595.0, + 464.0, + 1170.0, + 464.0, + 1170.0, + 500.0, + 595.0, + 500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 493.0, + 958.0, + 493.0, + 958.0, + 528.0, + 798.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1131.0, + 1405.0, + 1131.0, + 1405.0, + 1168.0, + 293.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1161.0, + 1403.0, + 1161.0, + 1403.0, + 1199.0, + 293.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1194.0, + 1259.0, + 1194.0, + 1259.0, + 1228.0, + 295.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 564.0, + 1403.0, + 564.0, + 1403.0, + 594.0, + 297.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 593.0, + 1405.0, + 593.0, + 1405.0, + 627.0, + 295.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 623.0, + 1405.0, + 623.0, + 1405.0, + 659.0, + 293.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 655.0, + 1406.0, + 655.0, + 1406.0, + 688.0, + 294.0, + 688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 685.0, + 1405.0, + 685.0, + 1405.0, + 718.0, + 295.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 711.0, + 361.0, + 711.0, + 361.0, + 752.0, + 292.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 437.0, + 711.0, + 1406.0, + 711.0, + 1406.0, + 752.0, + 437.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 743.0, + 401.0, + 743.0, + 401.0, + 782.0, + 290.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 444.0, + 743.0, + 1405.0, + 743.0, + 1405.0, + 782.0, + 444.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 774.0, + 421.0, + 774.0, + 421.0, + 810.0, + 294.0, + 810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 774.0, + 1040.0, + 774.0, + 1040.0, + 810.0, + 464.0, + 810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 300.0, + 1852.0, + 1065.0, + 1852.0, + 1065.0, + 1888.0, + 300.0, + 1888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1280.0, + 1280.0, + 1280.0, + 1280.0, + 1314.0, + 294.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2118.0, + 839.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2086.0, + 861.0, + 2086.0, + 861.0, + 2118.0, + 840.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1565.0, + 363.0, + 1565.0, + 363.0, + 1605.0, + 292.0, + 1605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 1565.0, + 1113.0, + 1565.0, + 1113.0, + 1605.0, + 625.0, + 1605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1565.0, + 1404.0, + 1565.0, + 1404.0, + 1605.0, + 1394.0, + 1605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1601.0, + 1404.0, + 1601.0, + 1404.0, + 1635.0, + 294.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1630.0, + 1107.0, + 1630.0, + 1107.0, + 1664.0, + 294.0, + 1664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1168.0, + 1630.0, + 1405.0, + 1630.0, + 1405.0, + 1664.0, + 1168.0, + 1664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1661.0, + 1405.0, + 1661.0, + 1405.0, + 1695.0, + 294.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1691.0, + 1406.0, + 1691.0, + 1406.0, + 1725.0, + 294.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1723.0, + 1195.0, + 1723.0, + 1195.0, + 1757.0, + 294.0, + 1757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 1723.0, + 1405.0, + 1723.0, + 1405.0, + 1757.0, + 1354.0, + 1757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1753.0, + 1405.0, + 1753.0, + 1405.0, + 1787.0, + 294.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1784.0, + 713.0, + 1784.0, + 713.0, + 1818.0, + 294.0, + 1818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1338.0, + 1402.0, + 1338.0, + 1402.0, + 1370.0, + 295.0, + 1370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1369.0, + 1405.0, + 1369.0, + 1405.0, + 1402.0, + 295.0, + 1402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1396.0, + 1406.0, + 1396.0, + 1406.0, + 1435.0, + 292.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1428.0, + 1274.0, + 1428.0, + 1274.0, + 1464.0, + 294.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1910.0, + 1407.0, + 1910.0, + 1407.0, + 1947.0, + 293.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1943.0, + 1406.0, + 1943.0, + 1406.0, + 1976.0, + 295.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1974.0, + 1406.0, + 1974.0, + 1406.0, + 2006.0, + 295.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2003.0, + 1404.0, + 2003.0, + 1404.0, + 2038.0, + 294.0, + 2038.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1317, + 1404, + 1317, + 1404, + 1686, + 297, + 1686 + ], + "score": 0.983 + }, + { + "category_id": 3, + "poly": [ + 320, + 222, + 1369, + 222, + 1369, + 679, + 320, + 679 + ], + "score": 0.978 + }, + { + "category_id": 4, + "poly": [ + 297, + 710, + 1406, + 710, + 1406, + 804, + 297, + 804 + ], + "score": 0.953 + }, + { + "category_id": 5, + "poly": [ + 427, + 957, + 1272, + 957, + 1272, + 1056, + 427, + 1056 + ], + "score": 0.95, + "html": "
METHODPROJECTIONVAE
Test time projection82±1 s40±1s
Constraint parameterization (ours)0.46 ± 0.02 s0.75 ± 0.04 s
" + }, + { + "category_id": 6, + "poly": [ + 299, + 856, + 1404, + 856, + 1404, + 947, + 299, + 947 + ], + "score": 0.942 + }, + { + "category_id": 1, + "poly": [ + 298, + 1111, + 1406, + 1111, + 1406, + 1205, + 298, + 1205 + ], + "score": 0.929 + }, + { + "category_id": 0, + "poly": [ + 300, + 1249, + 544, + 1249, + 544, + 1284, + 300, + 1284 + ], + "score": 0.906 + }, + { + "category_id": 2, + "poly": [ + 297, + 76, + 858, + 76, + 858, + 104, + 297, + 104 + ], + "score": 0.898 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2112, + 840, + 2112 + ], + "score": 0.789 + }, + { + "category_id": 15, + "poly": [ + 318.0, + 278.0, + 361.0, + 278.0, + 361.0, + 408.0, + 318.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 534.0, + 359.0, + 534.0, + 359.0, + 602.0, + 327.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 708.0, + 1404.0, + 708.0, + 1404.0, + 746.0, + 295.0, + 746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 741.0, + 1404.0, + 741.0, + 1404.0, + 775.0, + 295.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 770.0, + 1390.0, + 770.0, + 1390.0, + 807.0, + 294.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 855.0, + 1406.0, + 855.0, + 1406.0, + 892.0, + 293.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 886.0, + 1404.0, + 886.0, + 1404.0, + 922.0, + 293.0, + 922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 917.0, + 383.0, + 917.0, + 383.0, + 949.0, + 294.0, + 949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1245.0, + 548.0, + 1245.0, + 548.0, + 1293.0, + 291.0, + 1293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 2085.0, + 859.0, + 2085.0, + 859.0, + 2116.0, + 836.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1317.0, + 1405.0, + 1317.0, + 1405.0, + 1353.0, + 294.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1351.0, + 1404.0, + 1351.0, + 1404.0, + 1382.0, + 294.0, + 1382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1381.0, + 1405.0, + 1381.0, + 1405.0, + 1414.0, + 293.0, + 1414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1412.0, + 1404.0, + 1412.0, + 1404.0, + 1447.0, + 295.0, + 1447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1439.0, + 1404.0, + 1439.0, + 1404.0, + 1477.0, + 294.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1468.0, + 1406.0, + 1468.0, + 1406.0, + 1510.0, + 294.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1500.0, + 1402.0, + 1500.0, + 1402.0, + 1539.0, + 294.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1533.0, + 1405.0, + 1533.0, + 1405.0, + 1567.0, + 295.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1565.0, + 1402.0, + 1565.0, + 1402.0, + 1596.0, + 296.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1591.0, + 1405.0, + 1591.0, + 1405.0, + 1630.0, + 292.0, + 1630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1622.0, + 1405.0, + 1622.0, + 1405.0, + 1658.0, + 294.0, + 1658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1653.0, + 749.0, + 1653.0, + 749.0, + 1688.0, + 292.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1111.0, + 1406.0, + 1111.0, + 1406.0, + 1146.0, + 293.0, + 1146.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1142.0, + 1406.0, + 1142.0, + 1406.0, + 1176.0, + 295.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1174.0, + 1143.0, + 1174.0, + 1143.0, + 1208.0, + 295.0, + 1208.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 298, + 75, + 858, + 75, + 858, + 105, + 298, + 105 + ], + "score": 0.887 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2111, + 840, + 2111 + ], + "score": 0.767 + }, + { + "category_id": 0, + "poly": [ + 299, + 228, + 489, + 228, + 489, + 261, + 299, + 261 + ], + "score": 0.659 + }, + { + "category_id": 1, + "poly": [ + 296, + 279, + 1401, + 279, + 1401, + 373, + 296, + 373 + ], + "score": 0.658 + }, + { + "category_id": 1, + "poly": [ + 289, + 1855, + 1402, + 1855, + 1402, + 1921, + 289, + 1921 + ], + "score": 0.604 + }, + { + "category_id": 1, + "poly": [ + 296, + 1738, + 1401, + 1738, + 1401, + 1835, + 296, + 1835 + ], + "score": 0.582 + }, + { + "category_id": 1, + "poly": [ + 295, + 735, + 1398, + 735, + 1398, + 800, + 295, + 800 + ], + "score": 0.581 + }, + { + "category_id": 1, + "poly": [ + 295, + 1623, + 1403, + 1623, + 1403, + 1718, + 295, + 1718 + ], + "score": 0.568 + }, + { + "category_id": 1, + "poly": [ + 296, + 820, + 1403, + 820, + 1403, + 915, + 296, + 915 + ], + "score": 0.552 + }, + { + "category_id": 1, + "poly": [ + 296, + 935, + 1401, + 935, + 1401, + 1032, + 296, + 1032 + ], + "score": 0.551 + }, + { + "category_id": 1, + "poly": [ + 299, + 1453, + 1401, + 1453, + 1401, + 1518, + 299, + 1518 + ], + "score": 0.549 + }, + { + "category_id": 1, + "poly": [ + 297, + 1538, + 1401, + 1538, + 1401, + 1602, + 297, + 1602 + ], + "score": 0.547 + }, + { + "category_id": 1, + "poly": [ + 299, + 1051, + 1400, + 1051, + 1400, + 1148, + 299, + 1148 + ], + "score": 0.532 + }, + { + "category_id": 1, + "poly": [ + 299, + 1367, + 1399, + 1367, + 1399, + 1433, + 299, + 1433 + ], + "score": 0.528 + }, + { + "category_id": 1, + "poly": [ + 292, + 479, + 1400, + 479, + 1400, + 543, + 292, + 543 + ], + "score": 0.517 + }, + { + "category_id": 1, + "poly": [ + 287, + 394, + 1399, + 394, + 1399, + 459, + 287, + 459 + ], + "score": 0.516 + }, + { + "category_id": 1, + "poly": [ + 295, + 649, + 1401, + 649, + 1401, + 715, + 295, + 715 + ], + "score": 0.513 + }, + { + "category_id": 1, + "poly": [ + 289, + 565, + 1402, + 565, + 1402, + 629, + 289, + 629 + ], + "score": 0.484 + }, + { + "category_id": 1, + "poly": [ + 299, + 1252, + 1402, + 1252, + 1402, + 1348, + 299, + 1348 + ], + "score": 0.475 + }, + { + "category_id": 1, + "poly": [ + 291, + 1167, + 1402, + 1167, + 1402, + 1232, + 291, + 1232 + ], + "score": 0.473 + }, + { + "category_id": 1, + "poly": [ + 300, + 1941, + 1403, + 1941, + 1403, + 2034, + 300, + 2034 + ], + "score": 0.468 + }, + { + "category_id": 1, + "poly": [ + 299, + 228, + 489, + 228, + 489, + 261, + 299, + 261 + ], + "score": 0.187 + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2087.0, + 861.0, + 2087.0, + 861.0, + 2117.0, + 839.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 228.0, + 490.0, + 228.0, + 490.0, + 265.0, + 297.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 280.0, + 1402.0, + 280.0, + 1402.0, + 314.0, + 295.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 310.0, + 1403.0, + 310.0, + 1403.0, + 344.0, + 323.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 341.0, + 451.0, + 341.0, + 451.0, + 372.0, + 323.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1856.0, + 1403.0, + 1856.0, + 1403.0, + 1892.0, + 295.0, + 1892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1887.0, + 886.0, + 1887.0, + 886.0, + 1922.0, + 321.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1737.0, + 1405.0, + 1737.0, + 1405.0, + 1775.0, + 294.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1769.0, + 1405.0, + 1769.0, + 1405.0, + 1805.0, + 324.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1801.0, + 591.0, + 1801.0, + 591.0, + 1836.0, + 324.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 731.0, + 1403.0, + 731.0, + 1403.0, + 773.0, + 291.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 765.0, + 646.0, + 765.0, + 646.0, + 800.0, + 320.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1623.0, + 1403.0, + 1623.0, + 1403.0, + 1660.0, + 294.0, + 1660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1656.0, + 1405.0, + 1656.0, + 1405.0, + 1690.0, + 323.0, + 1690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1681.0, + 465.0, + 1681.0, + 465.0, + 1719.0, + 321.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 819.0, + 1405.0, + 819.0, + 1405.0, + 858.0, + 294.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 850.0, + 1408.0, + 850.0, + 1408.0, + 889.0, + 320.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 881.0, + 1068.0, + 881.0, + 1068.0, + 919.0, + 321.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 933.0, + 1405.0, + 933.0, + 1405.0, + 974.0, + 292.0, + 974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 969.0, + 1405.0, + 969.0, + 1405.0, + 1003.0, + 324.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 998.0, + 1069.0, + 998.0, + 1069.0, + 1031.0, + 321.0, + 1031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1455.0, + 1405.0, + 1455.0, + 1405.0, + 1491.0, + 298.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1486.0, + 1159.0, + 1486.0, + 1159.0, + 1519.0, + 323.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1534.0, + 1405.0, + 1534.0, + 1405.0, + 1576.0, + 293.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1566.0, + 399.0, + 1566.0, + 399.0, + 1605.0, + 318.0, + 1605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1050.0, + 1405.0, + 1050.0, + 1405.0, + 1091.0, + 293.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1082.0, + 1406.0, + 1082.0, + 1406.0, + 1119.0, + 322.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1114.0, + 1101.0, + 1114.0, + 1101.0, + 1149.0, + 323.0, + 1149.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1368.0, + 1402.0, + 1368.0, + 1402.0, + 1404.0, + 298.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1397.0, + 950.0, + 1397.0, + 950.0, + 1435.0, + 324.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 480.0, + 1402.0, + 480.0, + 1402.0, + 516.0, + 295.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 510.0, + 738.0, + 510.0, + 738.0, + 546.0, + 324.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 393.0, + 534.0, + 393.0, + 534.0, + 431.0, + 295.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 396.0, + 871.0, + 396.0, + 871.0, + 428.0, + 628.0, + 428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 964.0, + 396.0, + 1400.0, + 396.0, + 1400.0, + 432.0, + 964.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 427.0, + 857.0, + 427.0, + 857.0, + 457.0, + 323.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 648.0, + 1405.0, + 648.0, + 1405.0, + 686.0, + 295.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 681.0, + 1374.0, + 681.0, + 1374.0, + 716.0, + 320.0, + 716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 566.0, + 1404.0, + 566.0, + 1404.0, + 602.0, + 295.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 596.0, + 1083.0, + 596.0, + 1083.0, + 632.0, + 324.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1252.0, + 1402.0, + 1252.0, + 1402.0, + 1290.0, + 294.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1285.0, + 1404.0, + 1285.0, + 1404.0, + 1320.0, + 324.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1315.0, + 770.0, + 1315.0, + 770.0, + 1349.0, + 323.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1169.0, + 1404.0, + 1169.0, + 1404.0, + 1205.0, + 295.0, + 1205.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1200.0, + 878.0, + 1200.0, + 878.0, + 1233.0, + 322.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1937.0, + 1404.0, + 1937.0, + 1404.0, + 1979.0, + 294.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1974.0, + 1403.0, + 1974.0, + 1403.0, + 2004.0, + 323.0, + 2004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 2002.0, + 858.0, + 2002.0, + 858.0, + 2036.0, + 321.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 228.0, + 490.0, + 228.0, + 490.0, + 265.0, + 297.0, + 265.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.836 + }, + { + "category_id": 1, + "poly": [ + 297, + 229, + 1401, + 229, + 1401, + 323, + 297, + 323 + ], + "score": 0.83 + }, + { + "category_id": 1, + "poly": [ + 296, + 539, + 1400, + 539, + 1400, + 602, + 296, + 602 + ], + "score": 0.813 + }, + { + "category_id": 1, + "poly": [ + 298, + 425, + 1400, + 425, + 1400, + 518, + 298, + 518 + ], + "score": 0.758 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 858, + 74, + 858, + 105, + 298, + 105 + ], + "score": 0.749 + }, + { + "category_id": 1, + "poly": [ + 294, + 342, + 1400, + 342, + 1400, + 406, + 294, + 406 + ], + "score": 0.743 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 858, + 74, + 858, + 105, + 298, + 105 + ], + "score": 0.106 + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 857.0, + 72.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 857.0, + 72.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 1405.0, + 229.0, + 1405.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 261.0, + 1405.0, + 261.0, + 1405.0, + 295.0, + 324.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 291.0, + 553.0, + 291.0, + 553.0, + 326.0, + 324.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 540.0, + 1401.0, + 540.0, + 1401.0, + 576.0, + 295.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 569.0, + 1124.0, + 569.0, + 1124.0, + 605.0, + 321.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 426.0, + 1404.0, + 426.0, + 1404.0, + 463.0, + 294.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 453.0, + 1405.0, + 453.0, + 1405.0, + 496.0, + 321.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 487.0, + 642.0, + 487.0, + 642.0, + 521.0, + 323.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 339.0, + 1404.0, + 339.0, + 1404.0, + 382.0, + 293.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 374.0, + 1172.0, + 374.0, + 1172.0, + 407.0, + 323.0, + 407.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/EKV158tSfwv/images/016738b1658887d5192d6f9e87ae2c0aaf68ba3c2aac34ac95050e000e8ca2f0.jpg b/parse/train/EKV158tSfwv/images/016738b1658887d5192d6f9e87ae2c0aaf68ba3c2aac34ac95050e000e8ca2f0.jpg new file mode 100644 index 0000000000000000000000000000000000000000..c5e96f36889f4803d04a3fb36ddd5560a4ac664e --- /dev/null +++ b/parse/train/EKV158tSfwv/images/016738b1658887d5192d6f9e87ae2c0aaf68ba3c2aac34ac95050e000e8ca2f0.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3a5926e60669827d033110cd0f224dd2d74cbce3f3c2360b0d1a21a65adc27dc +size 137873 diff --git a/parse/train/EKV158tSfwv/images/028476a532884b39d36ed3d14d0db7a5693b209303ea005750d6a939c583b0e4.jpg b/parse/train/EKV158tSfwv/images/028476a532884b39d36ed3d14d0db7a5693b209303ea005750d6a939c583b0e4.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f772d3393e9517d28112fa854fef334bbebea8a7 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/028476a532884b39d36ed3d14d0db7a5693b209303ea005750d6a939c583b0e4.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6bc984260cc95041662361028f4105bb497f7671a51d3f58dac5d763635c3331 +size 39224 diff --git a/parse/train/EKV158tSfwv/images/083d3d70eab9424ca9b0bc47b41d1556871b469c3a9a0ddc9deacfbd3e06483c.jpg b/parse/train/EKV158tSfwv/images/083d3d70eab9424ca9b0bc47b41d1556871b469c3a9a0ddc9deacfbd3e06483c.jpg new file mode 100644 index 0000000000000000000000000000000000000000..d592d169e64b6458d6e2ae582a2bc45f370f37e9 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/083d3d70eab9424ca9b0bc47b41d1556871b469c3a9a0ddc9deacfbd3e06483c.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:eae9622f8d7704b15db72fc57dad906cfb402d26f4b697a4c788607e831c65e1 +size 76877 diff --git a/parse/train/EKV158tSfwv/images/0bd238f81d39c3e37eddb8a3fcdde86a0f81b76b0afada83a88f67d100209e35.jpg b/parse/train/EKV158tSfwv/images/0bd238f81d39c3e37eddb8a3fcdde86a0f81b76b0afada83a88f67d100209e35.jpg new file mode 100644 index 0000000000000000000000000000000000000000..b7abed841021fdcac08a7e8f5f8a015d126a9e9b --- /dev/null +++ b/parse/train/EKV158tSfwv/images/0bd238f81d39c3e37eddb8a3fcdde86a0f81b76b0afada83a88f67d100209e35.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:045dd851f266c636b8000fdc2b7b4da211e894fa6c63d2f45885204bf18fd274 +size 43520 diff --git a/parse/train/EKV158tSfwv/images/1272484bc875f051f390fdeccd1c2700634a8673e6ea94a155ffda24e58342bc.jpg b/parse/train/EKV158tSfwv/images/1272484bc875f051f390fdeccd1c2700634a8673e6ea94a155ffda24e58342bc.jpg new file mode 100644 index 0000000000000000000000000000000000000000..6cd8a03e81faa153c5a680c5262cf1bd1c870cc9 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/1272484bc875f051f390fdeccd1c2700634a8673e6ea94a155ffda24e58342bc.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f412bb13476dba7415ea19484876ec59c4afd7d1e878196244bd4243754901e8 +size 8227 diff --git a/parse/train/EKV158tSfwv/images/17ec080f437c916f8123c572d38285089522fcd5f80eed018f3fc0c58bfb21af.jpg b/parse/train/EKV158tSfwv/images/17ec080f437c916f8123c572d38285089522fcd5f80eed018f3fc0c58bfb21af.jpg new file mode 100644 index 0000000000000000000000000000000000000000..9c2a01fd658bcca219f7666dbae485df9d6ce8a8 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/17ec080f437c916f8123c572d38285089522fcd5f80eed018f3fc0c58bfb21af.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d5d247d1725324eacf2497c2a2cd21340d83fdc7fa4cd1a82a654371f9445ee2 +size 127672 diff --git a/parse/train/EKV158tSfwv/images/18951c913dca68571b45e1955eace7e2d03a5c698fa611b719202969d087b335.jpg b/parse/train/EKV158tSfwv/images/18951c913dca68571b45e1955eace7e2d03a5c698fa611b719202969d087b335.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f47bafd8823bad64d5b5821432b13df0f7337ce5 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/18951c913dca68571b45e1955eace7e2d03a5c698fa611b719202969d087b335.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:40f6c39c08b6b46f3753f24841ac068ed7db51d0ddda4a79f05361b08eeed4b1 +size 93226 diff --git a/parse/train/EKV158tSfwv/images/19e05e392812d42406123d639dd61a923b2b18b886de39e192f7f8e449684371.jpg b/parse/train/EKV158tSfwv/images/19e05e392812d42406123d639dd61a923b2b18b886de39e192f7f8e449684371.jpg new file mode 100644 index 0000000000000000000000000000000000000000..9a3aa49dae93c3b04a6df19495a03615d9fb2d86 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/19e05e392812d42406123d639dd61a923b2b18b886de39e192f7f8e449684371.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2ef4987e40836e1e9633f563dc41b07db819ffe65fe1c91a9c423bb7da8f1702 +size 6839 diff --git a/parse/train/EKV158tSfwv/images/1adb9d55c3614fa5d4deaba0752d1adc6648392ab75eb084c920a1da96e037c5.jpg b/parse/train/EKV158tSfwv/images/1adb9d55c3614fa5d4deaba0752d1adc6648392ab75eb084c920a1da96e037c5.jpg new file mode 100644 index 0000000000000000000000000000000000000000..66e5c056c007da9887b5fa402468243124fe3de5 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/1adb9d55c3614fa5d4deaba0752d1adc6648392ab75eb084c920a1da96e037c5.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9885b851037657d4f63d1d680a1eda9cd566ed78850b2997e69aebf09504be16 +size 55855 diff --git a/parse/train/EKV158tSfwv/images/1ae2e2c3ba83e67857d3467fc348e39ce56a1f2a46fc0456ba5962b51088041f.jpg b/parse/train/EKV158tSfwv/images/1ae2e2c3ba83e67857d3467fc348e39ce56a1f2a46fc0456ba5962b51088041f.jpg new file mode 100644 index 0000000000000000000000000000000000000000..c0103bd36bc0256b2a46b6af79b9739bc33d005e --- /dev/null +++ b/parse/train/EKV158tSfwv/images/1ae2e2c3ba83e67857d3467fc348e39ce56a1f2a46fc0456ba5962b51088041f.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:bb598db4fcdabec80476905d0ffac493677ab493f20f1834fff95a83429ec5ef +size 7161 diff --git a/parse/train/EKV158tSfwv/images/230f3e209fbceb452e0cacbf145a045e0f776bcfbd699b15f3d9a268719828f7.jpg b/parse/train/EKV158tSfwv/images/230f3e209fbceb452e0cacbf145a045e0f776bcfbd699b15f3d9a268719828f7.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f5bf9b1a0c3eb62a38697071974f3dc82c3856bb --- /dev/null +++ b/parse/train/EKV158tSfwv/images/230f3e209fbceb452e0cacbf145a045e0f776bcfbd699b15f3d9a268719828f7.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:983684c58eb9cda920176cdbf69b788aa868515ab734447408ce890deb0486a8 +size 57307 diff --git a/parse/train/EKV158tSfwv/images/2dc9622e275140a89614cd4a116278b803f8a74ab43fb682e99cdda4e2983efd.jpg b/parse/train/EKV158tSfwv/images/2dc9622e275140a89614cd4a116278b803f8a74ab43fb682e99cdda4e2983efd.jpg new file mode 100644 index 0000000000000000000000000000000000000000..1582b8151d6ebf05dc6e467b2bd8875b3008689e --- /dev/null +++ b/parse/train/EKV158tSfwv/images/2dc9622e275140a89614cd4a116278b803f8a74ab43fb682e99cdda4e2983efd.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:992bf5b9872f408ca9742287699d03f71a9b37bc9108218e7243c27e7e90e135 +size 97948 diff --git a/parse/train/EKV158tSfwv/images/2ea410f33d13c5bf4d54f8759d58fa63e926c7a4261f5285df87a257976071e0.jpg b/parse/train/EKV158tSfwv/images/2ea410f33d13c5bf4d54f8759d58fa63e926c7a4261f5285df87a257976071e0.jpg new file mode 100644 index 0000000000000000000000000000000000000000..95ab5e137ada8c8aa03214339c6e27773c7f61b9 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/2ea410f33d13c5bf4d54f8759d58fa63e926c7a4261f5285df87a257976071e0.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0346c84c63eaa707ec4113fd733a3c8c8a048ae9c14a3e618f7a8f9dba522015 +size 138597 diff --git a/parse/train/EKV158tSfwv/images/3082a0205f8ca0fa19bad584c2bc254cb66610f53905d3b82bb0fc293c8f4f1b.jpg b/parse/train/EKV158tSfwv/images/3082a0205f8ca0fa19bad584c2bc254cb66610f53905d3b82bb0fc293c8f4f1b.jpg new file mode 100644 index 0000000000000000000000000000000000000000..950c51776a93c58d0db76a54aec796fe38a56156 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/3082a0205f8ca0fa19bad584c2bc254cb66610f53905d3b82bb0fc293c8f4f1b.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:543f4fbd441d6378a4e67bc56dfb68fe8dfcf4c5357597a4093d414b93ad18d8 +size 88523 diff --git a/parse/train/EKV158tSfwv/images/59faebc170755326f1a741f053a3e3239331feaa8c6c73c0c49a37833915a29c.jpg b/parse/train/EKV158tSfwv/images/59faebc170755326f1a741f053a3e3239331feaa8c6c73c0c49a37833915a29c.jpg new file mode 100644 index 0000000000000000000000000000000000000000..0709d0a391b7f09a02551a268646e49489189567 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/59faebc170755326f1a741f053a3e3239331feaa8c6c73c0c49a37833915a29c.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:488ce0eff22cb811ed8f813529bab8b6d53c8d523c9f9810c1dad6172da90817 +size 36032 diff --git a/parse/train/EKV158tSfwv/images/5baa71ed36db05c11ad982d836213faf594098a0f7cc817d7543b4bd2c7b1d9b.jpg b/parse/train/EKV158tSfwv/images/5baa71ed36db05c11ad982d836213faf594098a0f7cc817d7543b4bd2c7b1d9b.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f3e794a476120fc0f5337ee62887509e9bd0be78 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/5baa71ed36db05c11ad982d836213faf594098a0f7cc817d7543b4bd2c7b1d9b.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a611b1f5b34f1aa34c8aab959b9517e9b4c17e4174381f214691dcbd2834db3b +size 113622 diff --git a/parse/train/EKV158tSfwv/images/61cfdcc751c8306c0d6dc61c857c5d35f3f6a62b6aadd3c2faf676f9dce5244a.jpg b/parse/train/EKV158tSfwv/images/61cfdcc751c8306c0d6dc61c857c5d35f3f6a62b6aadd3c2faf676f9dce5244a.jpg new file mode 100644 index 0000000000000000000000000000000000000000..9a409f2d025c9b13abb8364b134d7dda5b529c93 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/61cfdcc751c8306c0d6dc61c857c5d35f3f6a62b6aadd3c2faf676f9dce5244a.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:60b1328f09ebfe82e7cc2083bab2a10837347e456102637f57cf85a0b6171f75 +size 7551 diff --git a/parse/train/EKV158tSfwv/images/6504675e7bba4e4b29771df9cad8ef0f1bc1ac16fed6ca3940a427444b617353.jpg b/parse/train/EKV158tSfwv/images/6504675e7bba4e4b29771df9cad8ef0f1bc1ac16fed6ca3940a427444b617353.jpg new file mode 100644 index 0000000000000000000000000000000000000000..95ab3fcb5d4a158b42bd364931b2cdb149778989 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/6504675e7bba4e4b29771df9cad8ef0f1bc1ac16fed6ca3940a427444b617353.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a68d6d5e36cdf01fb3f6814b00f12695811182b700a3d1ed43bf01d22c09977b +size 35230 diff --git a/parse/train/EKV158tSfwv/images/6c312df5ec5b36e73d7097e7dae5f64a03e8198a7eae4af2f0c439e27b2827a2.jpg b/parse/train/EKV158tSfwv/images/6c312df5ec5b36e73d7097e7dae5f64a03e8198a7eae4af2f0c439e27b2827a2.jpg new file mode 100644 index 0000000000000000000000000000000000000000..4e00de510b58378f27ec36e67e55f859faea241b --- /dev/null +++ b/parse/train/EKV158tSfwv/images/6c312df5ec5b36e73d7097e7dae5f64a03e8198a7eae4af2f0c439e27b2827a2.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7e4c62e4db9b8c964e908b2345af03097f1b3f44598b87096d2bd53f388f038b +size 20989 diff --git a/parse/train/EKV158tSfwv/images/6dff23a033f50eadf42c3616ebcec2d95d6d4472f4a2b701f6fca905189a98da.jpg b/parse/train/EKV158tSfwv/images/6dff23a033f50eadf42c3616ebcec2d95d6d4472f4a2b701f6fca905189a98da.jpg new file mode 100644 index 0000000000000000000000000000000000000000..d541a292d71fa2291b7376ea22ebf131448da9e4 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/6dff23a033f50eadf42c3616ebcec2d95d6d4472f4a2b701f6fca905189a98da.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8eb5d8c0b96c75dea362e632ad2e3a2b4752d2db98c985e13e61e924095ea16f +size 19362 diff --git a/parse/train/EKV158tSfwv/images/759286d18791fab6aab94014e7f91dfc3b7de4d642a759d9c8422f4f9d06cb25.jpg b/parse/train/EKV158tSfwv/images/759286d18791fab6aab94014e7f91dfc3b7de4d642a759d9c8422f4f9d06cb25.jpg new file mode 100644 index 0000000000000000000000000000000000000000..9b19ed6139e0ed184422183d871d49d02085e583 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/759286d18791fab6aab94014e7f91dfc3b7de4d642a759d9c8422f4f9d06cb25.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:1db719247ea31e3fdd50796cf324ecd30c7fa7b5af602483200dd5809d52f76a +size 90551 diff --git a/parse/train/EKV158tSfwv/images/7b30aa5f903208aed3d4c412129bb3a9ed61a9c1503e1613bdb5586fd7bb7360.jpg b/parse/train/EKV158tSfwv/images/7b30aa5f903208aed3d4c412129bb3a9ed61a9c1503e1613bdb5586fd7bb7360.jpg new file mode 100644 index 0000000000000000000000000000000000000000..ee943d645257653acb6f8f21632ffe641a05f76e --- /dev/null +++ b/parse/train/EKV158tSfwv/images/7b30aa5f903208aed3d4c412129bb3a9ed61a9c1503e1613bdb5586fd7bb7360.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c01b9c440c412ea8442069f17139bca4210e7d54181e2531237f51e62c081a04 +size 138322 diff --git a/parse/train/EKV158tSfwv/images/80fddaac0df5b077969f77da997b9aa2b510857222eb5466257ea9d6faf78119.jpg b/parse/train/EKV158tSfwv/images/80fddaac0df5b077969f77da997b9aa2b510857222eb5466257ea9d6faf78119.jpg new file mode 100644 index 0000000000000000000000000000000000000000..daecc1cb675229cdb3001c9ae7367fc24d6767e0 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/80fddaac0df5b077969f77da997b9aa2b510857222eb5466257ea9d6faf78119.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0332beab84dfd46822a4b5dc0c8b86870d8f00baddb833723e275f05a391cd11 +size 54835 diff --git a/parse/train/EKV158tSfwv/images/889d3259c5a7dd19b9331e75f9781a2265e65a2772c75f10eac7863ed58d9891.jpg b/parse/train/EKV158tSfwv/images/889d3259c5a7dd19b9331e75f9781a2265e65a2772c75f10eac7863ed58d9891.jpg new file mode 100644 index 0000000000000000000000000000000000000000..22afd351a8b15f37c8d50e8175a612bfe40d3403 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/889d3259c5a7dd19b9331e75f9781a2265e65a2772c75f10eac7863ed58d9891.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e0f380933f30e78f7934ea0f79d803304b832f2b3bff6f2b7b3382f88e762558 +size 294169 diff --git a/parse/train/EKV158tSfwv/images/96bc8addaa4f716f3390db0c46fc0893bb3015b718fc1ff093a67d8cda261f87.jpg b/parse/train/EKV158tSfwv/images/96bc8addaa4f716f3390db0c46fc0893bb3015b718fc1ff093a67d8cda261f87.jpg new file mode 100644 index 0000000000000000000000000000000000000000..4a557aaa62cf6ea34686c518e4c00961b0de51f0 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/96bc8addaa4f716f3390db0c46fc0893bb3015b718fc1ff093a67d8cda261f87.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5d9a86351be6cce0b6cb6b2df63862a1260b250e2550c172f67f6948dc1f3263 +size 11303 diff --git a/parse/train/EKV158tSfwv/images/9aab59e7cb45f4b818552a6b812185f6a2881323d9a51a2afbe47c773e351103.jpg b/parse/train/EKV158tSfwv/images/9aab59e7cb45f4b818552a6b812185f6a2881323d9a51a2afbe47c773e351103.jpg new file mode 100644 index 0000000000000000000000000000000000000000..78072b69219795523184bafb13497008bbc1446d --- /dev/null +++ b/parse/train/EKV158tSfwv/images/9aab59e7cb45f4b818552a6b812185f6a2881323d9a51a2afbe47c773e351103.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e7744c529c7ad4997a549f3346d624dbbe6dd7bd45ec62e5e486a7aeb4dc5774 +size 29090 diff --git a/parse/train/EKV158tSfwv/images/b4c9f6d5bbe628ccb586a62d611eebc4165991a353062d8e7707476de15105b0.jpg b/parse/train/EKV158tSfwv/images/b4c9f6d5bbe628ccb586a62d611eebc4165991a353062d8e7707476de15105b0.jpg new file mode 100644 index 0000000000000000000000000000000000000000..ff4dc99fabf777f8e21f6a2030dd0afefed385b6 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/b4c9f6d5bbe628ccb586a62d611eebc4165991a353062d8e7707476de15105b0.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b8c50b5dff251c333c6027abe6ffc384d8bc38a91ef2940e5154210178059e26 +size 35229 diff --git a/parse/train/EKV158tSfwv/images/b7f9b35b8a84d582325ec2bbfc0bee4c6d77173ff26d59b877ff598032534602.jpg b/parse/train/EKV158tSfwv/images/b7f9b35b8a84d582325ec2bbfc0bee4c6d77173ff26d59b877ff598032534602.jpg new file mode 100644 index 0000000000000000000000000000000000000000..8a5ee47d28c503c0a6587ae801fae5e76c8731eb --- /dev/null +++ b/parse/train/EKV158tSfwv/images/b7f9b35b8a84d582325ec2bbfc0bee4c6d77173ff26d59b877ff598032534602.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:581f4eddb38c10a8370f8061ce8b3627976da995b94e972741129bcb9ca7317c +size 49302 diff --git a/parse/train/EKV158tSfwv/images/ba90a5e5c787d0b1a789c87492751b6bee5a4ce175c595fe92b25330c14803b4.jpg b/parse/train/EKV158tSfwv/images/ba90a5e5c787d0b1a789c87492751b6bee5a4ce175c595fe92b25330c14803b4.jpg new file mode 100644 index 0000000000000000000000000000000000000000..4d7dbfb14614d7fd25bf1caa8eba6a1cd06667a4 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/ba90a5e5c787d0b1a789c87492751b6bee5a4ce175c595fe92b25330c14803b4.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f81f8fae60a0099384f3ca35534e681052791a64760732686450228f142ce263 +size 16412 diff --git a/parse/train/EKV158tSfwv/images/c32cc4394166e0836b43c5d1dcb41c93c265a3bb0c675b483f0cef350f612b02.jpg b/parse/train/EKV158tSfwv/images/c32cc4394166e0836b43c5d1dcb41c93c265a3bb0c675b483f0cef350f612b02.jpg new file mode 100644 index 0000000000000000000000000000000000000000..bf1b01854b804b4781aefe7ce99b3c619a3f90fa --- /dev/null +++ b/parse/train/EKV158tSfwv/images/c32cc4394166e0836b43c5d1dcb41c93c265a3bb0c675b483f0cef350f612b02.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3d5b348929b88c8d76d3606bb543e29f5a6fb65aa8974f2370b26ea6f8def4dc +size 55390 diff --git a/parse/train/EKV158tSfwv/images/c6303624c7cc0b18950e8aa27071b0fd548e25fd2a4d7fb4c6e609af5aee9464.jpg b/parse/train/EKV158tSfwv/images/c6303624c7cc0b18950e8aa27071b0fd548e25fd2a4d7fb4c6e609af5aee9464.jpg new file mode 100644 index 0000000000000000000000000000000000000000..7e5adabca4651b9148cc6ab5f1ddf1db38958eaf --- /dev/null +++ b/parse/train/EKV158tSfwv/images/c6303624c7cc0b18950e8aa27071b0fd548e25fd2a4d7fb4c6e609af5aee9464.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a011728b450ee2457f942b8511044acf4a92205c81cd983fe99baff487e78ea6 +size 125721 diff --git a/parse/train/EKV158tSfwv/images/caa8ea10cffd0779da767da72531b09f810d16b80bf0893c92d63704f70962d2.jpg b/parse/train/EKV158tSfwv/images/caa8ea10cffd0779da767da72531b09f810d16b80bf0893c92d63704f70962d2.jpg new file mode 100644 index 0000000000000000000000000000000000000000..64ce405874f19dca2a58763fd32d07244c2d3d75 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/caa8ea10cffd0779da767da72531b09f810d16b80bf0893c92d63704f70962d2.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2ac9293c948ce3b5e8508ed9138e9c55ab108ea6d5065f018b532b9d5b0969c2 +size 112165 diff --git a/parse/train/EKV158tSfwv/images/dcce3e23e15b98c8263d5cf94fa62dd6fcccad7b9ea746bbb7a4d63304555659.jpg b/parse/train/EKV158tSfwv/images/dcce3e23e15b98c8263d5cf94fa62dd6fcccad7b9ea746bbb7a4d63304555659.jpg new file mode 100644 index 0000000000000000000000000000000000000000..4bb22760c10475e9fd0fd711314576440068faea --- /dev/null +++ b/parse/train/EKV158tSfwv/images/dcce3e23e15b98c8263d5cf94fa62dd6fcccad7b9ea746bbb7a4d63304555659.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:dc71106ac73431b8ba4353deb7404040f64cb7bd1ececdcb981ea83d8d583c5a +size 144219 diff --git a/parse/train/EKV158tSfwv/images/e0a1a34635e43c20eb32273d35a5b2b31547adf83f3cc757ee037558706cfdf2.jpg b/parse/train/EKV158tSfwv/images/e0a1a34635e43c20eb32273d35a5b2b31547adf83f3cc757ee037558706cfdf2.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f75308c93e4185d858a84993ea00f5ec9010ccc2 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/e0a1a34635e43c20eb32273d35a5b2b31547adf83f3cc757ee037558706cfdf2.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:aa241f6f302de9e7aa1fc107d3bd284a18ece71242ed02fa3ca76109b9d3b823 +size 55150 diff --git a/parse/train/EKV158tSfwv/images/e0ae26df73769b99eceb1f03d844be20f56b3a6b0cd88e27751315f8ec2b9266.jpg b/parse/train/EKV158tSfwv/images/e0ae26df73769b99eceb1f03d844be20f56b3a6b0cd88e27751315f8ec2b9266.jpg new file mode 100644 index 0000000000000000000000000000000000000000..fa2d30300fd1f4c66ece39823d04cc9893558532 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/e0ae26df73769b99eceb1f03d844be20f56b3a6b0cd88e27751315f8ec2b9266.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c833fc99b1281413a11167fcb565a26b40eeb83827f6ec2a3d7a9ae3680a9fa0 +size 28866 diff --git a/parse/train/EKV158tSfwv/images/e900252b5d5c8c80b7264e9bfa18a66f63583474cdbb2c5bb0f355fb11de319f.jpg b/parse/train/EKV158tSfwv/images/e900252b5d5c8c80b7264e9bfa18a66f63583474cdbb2c5bb0f355fb11de319f.jpg new file mode 100644 index 0000000000000000000000000000000000000000..ca233f29510f921055ce1e5ff5bdb87248141ff3 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/e900252b5d5c8c80b7264e9bfa18a66f63583474cdbb2c5bb0f355fb11de319f.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b1ffbd61ad0d85d748d970ce55316533380ee4e8792de9e04b9d8d117ebfac71 +size 257324 diff --git a/parse/train/EKV158tSfwv/images/f59fa345d5ce1d606bbc83443d700bedd41d4878ac58fca23416a5ea619ca5f9.jpg b/parse/train/EKV158tSfwv/images/f59fa345d5ce1d606bbc83443d700bedd41d4878ac58fca23416a5ea619ca5f9.jpg new file mode 100644 index 0000000000000000000000000000000000000000..02be6b13e38653d60001f311c4fecf9f85ea4651 --- /dev/null +++ b/parse/train/EKV158tSfwv/images/f59fa345d5ce1d606bbc83443d700bedd41d4878ac58fca23416a5ea619ca5f9.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:776cded1d056f39e9dcbd07138a8d849ebd1d8b2c76154458245b3e6a487e43b +size 55699 diff --git a/parse/train/H8VDvtm1ij8/H8VDvtm1ij8.md b/parse/train/H8VDvtm1ij8/H8VDvtm1ij8.md new file mode 100644 index 0000000000000000000000000000000000000000..a1a07ec3342105cd0c318496ab25757f051cd63b --- /dev/null +++ b/parse/train/H8VDvtm1ij8/H8VDvtm1ij8.md @@ -0,0 +1,341 @@ +# NORMALIZING FLOWS FOR CALIBRATION AND RECALIBRATION + +Anonymous authors Paper under double-blind review + +# ABSTRACT + +In machine learning, due to model misspecification and overfitting, estimates of the aleatoric uncertainty are often inaccurate. One approach to fix this is isotonic regression, in which a monotonic function is fit on a validation set to map the model’s CDF to an optimally calibrated CDF. However, this makes it infeasible to compute additional statistics of interest on the model distribution (such as the mean). In this paper, through a reframing of recalibration as MLE, we replace isotonic regression with normalizing flows. This allows us to retain the ability to compute the statistical properties of the model (such as closed-form likelihoods, mean, correlation, etc.) and provides an opportunity for additional capacity at the cost of possible overfitting. Most importantly, the fundamental properties of normalizing flows allow us to generalize recalibration to conditional and multivariate distributions. To aid in detecting miscalibration and measuring our success at fixing it, we use a simple extension of the calibration Q-Q plot. + +# 1 INTRODUCTION + +Recent advances in deep learning have led to models with significantly higher overall accuracy on both classification and regression tasks compared to what was achievable in the past. However, an important component in conjunction with accuracy is a model’s ability to accurately assess the uncertainty in its prediction. Most taxonomies classify uncertainty into three sources: approximation, aleatoric, and epistemic uncertainty (Der Kiureghian & Ditlevsen, 2009). Approximation uncertainty quantifies the error from fitting a simple model to complex data. Aleatoric uncertainty quantifies the uncertainty of the conditional distribution of the target variable given features. This uncertainty arises from hidden variables or measurement errors and cannot be reduced through collecting more data under the same experimental conditions. Epistemic uncertainty quantifies the uncertainty arising from fitting a model utilizing finite data, i.e. it is inversely proportional to the density of the training examples and can be reduced by collecting data in the low density regions. + +These different sources of uncertainty have different techniques for handling them. Using high capacity models such as neural networks removes a large part of the approximation uncertainty. By fitting a full distribution on the target conditional on features, we can model the aleatoric uncertainty from observations. Inaccurate estimates of aleatoric uncertainty can be explained by underfitting (insufficient complexity in the conditional distributions) or overfitting (models with sufficient capacity can memorize the data, leading to the distributions collapsing to deltas). Though epistemic uncertainty is important for the model to answer what it does not know, the focus of this paper is on improving estimates of the aleatoric uncertainty. + +Our approach in this paper is to handle both model fit and calibration using normalizing flows. Normalizing flows can be used in conjunction with amortized inference to improve the flexibility of the output distribution, and further, through a reframing of recalibration as maximum likelihood estimation (MLE), normalizing flows can be used to handle any miscalibration found on a validation set. Further, we use a simple extension of the calibration plot from Kuleshov et al. (2018) to help with the the analysis of the calibration of a model across different regions of the data. + +# 2 RELATED WORK + +One method for handling aleatoric uncertainty is amortized inference with Gaussians (Lakshminarayanan et al., 2017; Nix & Weigend, 1994; Kendall & Gal, 2017) where a model, such as a neural network, maps from features to the parameters of a Gaussian. This approach models aleatoric uncertainty directly but suffers from approximation uncertainty as a Gaussian cannot model complex targets. + +Another approach is Bayesian methods such as Bayesian Ridge Regression (Tipping, 2001) and MC Dropout (Gal & Ghahramani, 2016). Similar to amortized inference with Gaussians, the output distribution limits the capacity of the model. Full Bayesian techniques with neural networks are often too computationally expensive in practice, and approximate methods often fail to capture the full complexity of the uncertainty (Lakshminarayanan et al., 2017). + +Another family of methods uses quantile regression with non-linear techniques such as decision trees or neural networks. Some of these methods require a predefined set of quantiles (Takeuchi et al., 2006; Wen et al., 2017; Rodrigues & Pereira, 2018; Taylor, 2000). Simultaneous Quantile Regression (SQR, Tagasovska & Lopez-Paz (2019)) trains one model on all quantiles and is able to learn complex shaped distributions. However the training procedure requires the model to learn to be monotonic instead of being constrained to be so and is not trivial to extend to multidimensional outputs. Pearce et al. (2018) learns a finite set of quantiles by using quality metrics for predictive intervals. + +Normalizing flows have been used in the contexts of variational inference and generative modeling. The approaches to normalizing flows can be categorized into autoregressive methods (Kingma et al., 2016; Papamakarios et al., 2017; Huang et al., 2018; Cao et al., 2019), coupling layers (Dinh et al., 2014; 2016; Kingma & Dhariwal, 2018; Ho et al., 2019), residual networks (Rezende & Mohamed, 2015; van den Berg et al., 2018; Gopal, 2020) and continuous flows (Grathwohl et al., 2018). + +# 3 BACKGROUND + +# 3.1 RECALIBRATION + +An important goal in modeling is to have well-calibrated distributions as this allows users of the model to understand the confidence the model places on its prediction. In other words, with a well-calibrated model, we can better ascertain the uncertainty in the model’s predictions and respond differently to those predictions depending on the uncertainty surrounding them. + +Guo et al. (2017) showed that unlike techniques used decades ago such as Bayesian Ridge Regression, modern neural network-based classifiers are very poorly calibrated. A simple variant of Platt scaling and other histogram based techniques applied to a validation set were shown to help alleviate the calibration problem where perfect calibration is defined as + +$$ +\mathbb { P } ( \hat { Y } = Y | \hat { P } = p ) = p , \quad \forall p \in [ 0 , 1 ] +$$ + +where $\hat { Y }$ is a class prediction and $\hat { P }$ is its predicted probability of correctness. + +Kuleshov et al. (2018) extended the analysis in Guo et al. (2017) to neural network-based regressors; isotonic regression, a method for learning monotonic univariate functions, was applied to map from $\mathcal { F } _ { x _ { j } } ( y _ { j } ) = \hat { p } _ { j }$ to $| \{ y _ { n } | \mathcal { F } _ { x _ { n } } ( y _ { n } ) < \hat { p } _ { j } , n \stackrel { - } { = } 1 , . . . , N \} | / N$ (the fraction of the data where the model CDF is less than $\hat { p }$ ) to improve calibration where perfect calibration is defined as + +$$ +\mathbb { P } ( Y < \mathcal { F } _ { X } ^ { - 1 } ( p ) ) = p , \quad \forall p \in [ 0 , 1 ] +$$ + +where ${ \mathcal { F } } _ { X }$ is the predicted CDF function. + +Kuleshov et al. (2018) further introduced calibration error as a metric to quantitatively measure how well the quantiles are aligned: + +$$ +\begin{array} { r } { \hat { p } _ { j } = \vert \{ y _ { n } \vert \mathcal { F } _ { x _ { n } } ( y _ { n } ) < p _ { j } , n = 1 , \ldots , N \} \vert / N } \\ { \operatorname { c a l } ( y _ { 1 } , \ldots , y _ { N } ) = \displaystyle \sum _ { j = 1 } ^ { M } ( p _ { j } - \hat { p } _ { j } ) ^ { 2 } } \end{array} +$$ + +where $M$ is the number of quantiles that are evaluated. In this paper, we set this to 100 evenly spaced quantiles. + +![](images/52aa6c065ffeced6d996d72cde20955f69b0c8da9a20d8031cebe127f210d0b4.jpg) +Figure 1: A comparison between using a hypernetwork approach versus conditional approach to creating Conditional QuAR Flows to model $p ( X | c )$ where $W _ { 1 }$ and $W _ { 2 }$ parametrize the layers in the residual connection. + +# 3.2 NORMALIZING FLOWS + +A crucial component in improving uncertainty estimates in this paper is to fit normalizing flows, a generative model for density estimation using invertible functions. + +Suppose that we wish to formulate a joint distribution on an $n$ -dimensional real vector $x$ . A flowbased approach treats $x$ as the result of a transformation $g$ applied to an underlying vector $z$ sampled from a base distribution $p _ { z } ( z )$ . The generative process for flows is defined as: + +$$ +\begin{array} { l } { z \sim p _ { z } ( z ) } \\ { x = g ( z ) } \end{array} +$$ + +where $p _ { z }$ is often a Normal distribution and $g$ is an invertible function. Notationally, we will use $f = g ^ { - 1 }$ . Using change of variables, the log likelihood of $x$ is + +$$ +\log p _ { x } ( x ) = \log p _ { z } \left( f ( x ) \right) + \log \left| { \operatorname* { d e t } \left( \frac { \partial f ( x ) } { \partial x } \right) } \right| +$$ + +To train flows (i.e. maximize the log likelihood of data points), we need to be able to compute the logarithm of the absolute value of the determinant of the Jacobian of $f$ , also called the log-determinant. To construct large normalizing flows, we can compose smaller ones as this is still invertible and the log-determinant of this composition is the sum of the individual log-determinants. + +An important observation is that every univariate distribution can be viewed as a flow in which the base distribution $p _ { z } ( z )$ is a Uniform distribution over $[ 0 , 1 ]$ and $g$ is the inverse CDF of the univariate distribution. This can be generalized to multivariate distributions using the chain rule. + +# 3.3 CONDITIONAL QUAR FLOWS + +In this paper, the specific normalizing flow used is Quasi-Autoregressive Residual Flows (QuAR Flows, Gopal (2020)). QuAR Flows were shown to handle modeling complex distributions while having nice optimization properties and computationally efficient log-likelihoods. Other commonly used normalizing flows have drawbacks. Coupling layers do not work for one-dimensional inputs. Autoregressive flows are often conditional Gaussians which means in the one-dimensional case, the flow is simply a Gaussian. Residual Flows (Chen et al., 2019) are expressive but, though equivalent to QuAR Flows in the one-dimensional case, are computationally expensive for high-dimensional distributions. + +If we would like to condition a QuAR Flow given some features $c$ , we could use a hypernetwork that maps $c$ to the parameters of the QuAR Flow (Figure 1a). However, this can be computationally expensive if the QuAR Flow is parameterized with thousands of parameters. Instead, conditional information can be incorporated by concatenating the conditions $c$ before applying the first layer in the residual connection within a QuAR Flow (Figure 1b). + +# 4 REGRESSION USING NORMALIZING FLOWS + +The goal of regression is to model the conditional probability distribution $p ( y | x )$ . Frequently, this task is reduced to obtaining point estimates of the mean or median by minimizing the mean squared error or mean absolute error respectively. In order to access uncertainties, we must model the full conditional distribution; in addition to this, we can still retrieve point estimates of the mean, median, or any other distributional statistic. In this section, we discuss how normalizing flows can be used to this end as well as how recalibration can be reframed as maximum likelihood estimation (MLE). + +# 4.1 CALIBRATION WITH NORMALIZING FLOWS + +One approach to modeling aleatoric uncertainty is to use amortized inference with a Normal distribution as its output distribution, conditioned on features (Lakshminarayanan et al., 2017). However, if a Gaussian is not appropriate to fit the target, then the error in miscalibration can be attributed to approximation error, i.e. insufficient capacity to learn the distribution. A simple example of this is where we have no features to condition on (or all the features we have contain no relevant information) with a one-dimensional target. In Figure 2, we can see that since the target is bimodal, the Gaussian fit does not well describe the data. + +To improve this model, we replace the Gaussian with a normalizing flow conditioned on our data, similar to Figure 1b. In this way, the distribution fit to the targets has sufficient capacity to learn complex distributions, including multimodal distributions (Figure 2). + +# 4.2 RECALIBRATION WITH NORMALIZING FLOWS + +To handle overfitting of the uncertainty, we recalibrate the results of the original model where we assume the original model outputs a full distribution that has closed-form likelihoods. Since the only requirement is a full distribution with a closed-form likelihood, the original model that we recalibrate can be as simple as a Bayesian Linear Regression model or as complicated as a conditional normalizing flow. We recalibrate the original model by fitting a normalizing flow on top of it. In this way, the training process is the following two-step procedure: + +![](images/ad181b91bb85b484eab2f815ac5f66a3057be04180b0b5783e57d91cc0f6099a.jpg) +Figure 2: One-dimensional example of Gaussian versus Flow + +$$ +\begin{array} { r l } & { 1 . \ f _ { \theta } = \arg \operatorname* { m a x } _ { f _ { \theta } } \sum _ { i = 1 } ^ { N _ { t r } } \log p _ { f _ { \theta } } ( y _ { i } ^ { t r } | x _ { i } ^ { t r } ) } \\ & { 2 . \ g _ { \phi } = \arg \operatorname* { m a x } _ { g _ { \phi } } \sum _ { i = 1 } ^ { N _ { v a l } } \log p _ { g _ { \phi } } ( F _ { \theta } ( y _ { i } ^ { v a l } | x _ { i } ^ { v a l } ) ) } \end{array} +$$ + +where the tra $f _ { \boldsymbol { \theta } } ( \boldsymbol { y } | \boldsymbol { x } )$ is thet and nction given is the valid $x$ , i $F _ { \theta } ( y | x )$ is the CDF of hough the for $f _ { \theta } ( y | x ) , \{ x ^ { t r } , y ^ { t r } \} _ { i = 1 } ^ { N _ { t r } }$ ison $\{ x ^ { v a l } , y ^ { v a l } \} _ { i = 1 } ^ { N _ { v a l } }$ above shows we can use any likelihood model for $g _ { \phi }$ , since isotonic regression is a method to fit a free form function to the CDFs, we choose to use normalizing flows, specifically QuAR Flows, as these are more flexible than using autoregressive flows such as MAFs (Papamakarios et al., 2017). + +After the two-step training, the new generative process is: + +$$ +\begin{array} { l } { z \sim \mathrm { U n i f o r m } ( 0 , 1 ) } \\ { u = G _ { \phi } ^ { - 1 } ( z ) } \\ { y = F _ { \theta } ^ { - 1 } ( u | x ) } \end{array} +$$ + +where $G _ { \phi }$ is the CDF of $g _ { \phi }$ . The density function of the above generative process is simply the product of the individual density functions: $f _ { \theta }$ and $g _ { \phi }$ . Given this view of the generative process, one interpretation of the two-step process is to first fit $\theta$ on the training set where $\phi$ is initialized so that $G _ { \phi } ^ { - 1 }$ is the identity function, and then to fit $\phi$ on the validation set while keeping $\theta$ frozen. Though $\theta$ and $\phi$ could be trained end-to-end, similar to the approach in Section 4.1, we show in our experiments (Section 6.2) that there are benefits to this two-step approach. + +![](images/9212fa4438adc3e36c2e75cfd149f1d9ffde426fb5aa80f4de671bd843cb558c.jpg) +Figure 3: Comparison plots of isotonic regression and flow recalibration on multiple outputs. The two axes are different targets being modeled, and the scatter plot shows that the targets are correlated. The top and right sides show the marginal histogram as well as the fit from the recalibrated distribution. The contour plot shows the two-dimensional contours of the recalibrated distribution which can be seen to not align well for isotonic regression. + +Given this log-likelihood viewpoint of recalibration, we can trivially incorporate conditioning of the normalizing flow on additional information. For example, say $f _ { \theta }$ outputs $\mu$ and $\sigma$ that parameterize a Normal distribution, we could then condition $g _ { \phi }$ on these two outputs. If we were to use many features to condition on, we would return to the first situation where we could overfit to the finite number of observations we have. We can think of the first model $f _ { \theta }$ as compressing/embedding the data into two dimensions, and the second model utilizing the embedding to create a meaningful and well-calibrated distribution on the target. Compared to isotonic regression, we can easily incorporate conditional information while retaining monotonicity as normalizing flows are monotonic by construction. + +Recalibration is interesting in that it is useful for both overfitting as well as underfitting. From Guo et al. (2017), we see that multinomial classification models have sufficient capacity to overfit uncertainties and benefit from recalibration. On the other hand, the simple example in Figure 2 suffers from miscalibrated uncertainties due to approximation uncertainty (underfitting), and recalibration reduces the approximation error. + +One solution to handling overfitting is to early-stop on a validation set. Whether early stopping occurs or not, our solution incorporates the information of the validation set to correct potential overfitting. However, if we try to correct for multiple sources of overfitting, then we could introduce a new overfitting problem. In essence, there is a tradeoff between the validation size (which in turn controls training size) and how many sources of overfitting one can try to correct after training. + +# 4.3 MULTIVARIATE RECALIBRATION + +Whereas Platt scaling (Guo et al., 2017) and isotonic regression (Kuleshov et al., 2018) have been shown to improve the calibration of distributions when we have one-dimensional outputs, scaling these solutions to high-dimensional targets is non-trivial. + +Say we are modeling two-dimensional real-valued targets and use isotonic regression to calibrate the targets individually. For simplicity, say we use amortized inference with independent output distributions. If the targets are not conditionally independent, the distribution will not be wellcalibrated, even after recalibration with isotonic regression (Figure 3a). However, using normalizing flows, we can compute the CDF of the observed targets per output distribution and recalibrate this two-dimensional distribution (Figure 3b). + +The general procedure of recalibrating $N$ -dimensional distributions is to fit a normalizing flow on the $N$ -dimensional vector $x _ { i } = F ( y _ { i } | y _ { < i } )$ . + +![](images/bd31ec7371b5fbab3c41c4af090e7e01d02a0effd5315ff0fe11e911a5356c31.jpg) +Figure 4: Calibration Q-Q plots for recalibration using isotonic regression and recalibration using flows for the simulated multivariate case in Figure 3a. The legend contains the calibration error for each curve. + +# 5 MULTIVARIATE RECALIBRATION EXAMPLE + +In multiclass classification, we often focus on individual metrics such as accuracy, precision, recall, F1, etc. However, exploring the accuracy of the separate classes using a confusion matrix can show if the model is biased even if the performance on average is good. Similar to this view for classification, we extend the calibration plot introduced in (Kuleshov et al., 2018) to show calibration performance on different subsets of the data, binned by either a feature or a prediction, e.g. Figure 4. The only restriction is the binning cannot be a function of the target we are evaluating. + +Say we are modeling two-dimensional real-valued targets $( Y _ { 1 } , Y _ { 2 } )$ shown in Figure 3a. If we fit independent Gaussians to the target, the resulting distribution will not align with the contours of the data. + +We first recalibrate the distribution by fittting isotonic regression models on $F ( Y _ { 1 } )$ and $F ( Y _ { 2 } | Y _ { 1 } )$ The results for $F ( Y _ { 2 } | Y _ { 1 } )$ are shown in Figure 4a where we can see that, though across the full dataset the calibration error is zero, when we bucket by $F ( Y _ { 1 } )$ , the calibration error achieved is both significant and a strong function of $Y _ { 1 }$ as it is unable to account for correlations in $Y _ { 1 }$ and $Y _ { 2 }$ . In other words, the model is not calibrated in any given region of the data but only in aggregate. + +However, if we recalibrate using normalizing flows by fitting a flow on the pair $( F ( Y _ { 1 } ) , F ( Y _ { 2 } | Y _ { 1 } ) )$ , we can see in Figure 4b that even if we bucket by $F ( Y _ { 1 } )$ , the calibration error stays close to zero. Unlike isotonic regression, the flow can learn the correlation between the CDFs by being trained jointly on all of them. In addition to this, had we used a more complex calibration model that could model the correlations directly, we would not be able to compute the correlation after recalibrating with isotonic regression. By recalibrating with flows, we obtain a result that is still a distribution with a closed-form likelihood; this allows us to still be able to use the model to compute the correlation and any other distributional statistics. + +In Figure 5, we show visually the difference between recalibration with flows and with isotonic regression. The key differences being that flows can recalibrate the CDFs jointly and be conditioned on additional information $c$ , while isotonic regression is fit on each CDF independently and is unable to incorporate any additional information. The reason is that flows are monotonic by construction and can therefore handle multiple variables and conditions. + +# 6 EXPERIMENTS + +In this section, we analyze the performance of flows on multiple UCI datasets. Importantly, we do not aim for state-of-the-art performance, nor do we expect normalizing flows to outperform isotonic + +![](images/875700dffcddbe4a75f5e5d09bdaf048c24fbe3c4bd6dcd6bef0495db4def2fa.jpg) +Figure 5: A diagram for multivariate recalibration using the same notation as that used in Section 4.2. The first step for recalibration is always the calibration step, shown in the blue box, where any likelihood model $f _ { \theta }$ can be used. On the left, isotonic regression is used to recalibrate the CDFs from $f _ { \theta }$ ; on the right, normalizing flows $g _ { \phi }$ are used to recalibrate the CDFs from $f _ { \theta }$ conditioned on some $c$ . + +regression in aggregate. In terms of calibration, we show that the increase in expressivity can be beneficial; in terms of recalibration, we show specific failure points of isotonic regression that binning uncovers and how normalizing flows fixes these issues. + +# 6.1 CALIBRATION + +To test the effect of increased capacity in distributions, we tested how well normalizing flows improve performance in distributional estimates compared to a few other popular approaches for estimating uncertainties. We do not compare directly against other methods for conditional distributions such as autoregressive flows for the reason specified in Section 3.3: in the one dimensional case, those are often the same as ConditionalGaussian. Instead of replacing the output distribution with a complex distribution created by hand, such as an explicit mixture, we rely on using more expressive flows which can model mixture behavior as well as more complicated behavior such as skew and kurtosis. + +Table 1: Results before and after recalibration on the UCI dataset “naval-propulsion-plant”. Details on the model methodology as well as performance on other UCI datasets are in Appendix B. The mean squared error (MSE) and its uncertainty is computed using 20 seeds. “Calib” is the calibration error (Equation 1) using 100 quantiles across 20 seeds instead of per seed. + +
Before Recalib.Isotonic Recalib.Flow Recalib.
MSECalibMSECalibMSECalib
ConditionalFlow0.009 ±0.0040.45N.A.<0.010.016 ± 0.012<0.01
ConditionalGaussian0.012 ±0.0062.35N.A.<0.010.012 ±0.006<0.01
BayesianRidgeRegression0.055 ±0.0048.03N.A.0.010.48 ± 0.02<0.01
MC Dropout0.005 ±0.0020.51N.A.N.A.N.A.N.A.
SQR0.0052 ± 0.00121.44N.A.N.A.N.A.N.A.
+ +All results were evaluated on a held out test set that was not used for calibration or recalibration. Due to limited space, the full extent of the results and details of the models are left for Appendix A and Appendix B. To show the usefulness of the plot we introduced in Section 5, we focus on the results on the UCI dataset “naval-propulsion-plant” (Dheeru & Karra Taniskidou, 2017) in Table 1 and Section 6.2. + +The models with consistent performance across UCI datasets in terms of calibration are Bayesian Ridge Regression, Conditional Gaussian, and Conditional Flow, with Conditional Flow often performing well in cases where Conditional Gaussian is unable to. Whereas these three models are well calibrated, the mean performance is much weaker for Bayesian Ridge Regression due to the limitations of linear functions. + +# 6.2 RECALIBRATION + +Of the models we tested, we recalibrated the Bayesian Ridge Regression, Conditional Gaussian, and Conditional Flow models. MC Dropout and SQR could also be recalibrated, though we chose not to as they lack closed form CDFs, meaning the technique would be approximate. In Table 1, we see the calibration errors after recalibrating with normalizing flows are comparable to those from isotonic regression. However, after isotonic regression is applied, only the calibration error can be computed. In contrast, we can still compute ordinary distribution statistics such as the mean after applying normalizing flows. Due to this property, we can even detect cases in which an improvement in calibration error coincides with a degradation of mean performance, suggesting if the goal were to only get point estimates of the mean, recalibration could be detrimental. For example, in Table 1 this was the case for Bayesian Ridge Regression. + +In Figure 6a, whereas the calibration error metric shows the flow recalibrated model is well-calibrated averaged across the full dataset, we can see that see that, when bucketing by the predicted mean, the calibration error is significant. + +To improve this, we recalibrate with a normalizing flow conditioned on the mean predicted by the original model. In this way, we see in Figure 6b that though the aggregate performance does not change, the performance is improved across different buckets. In essence we see that if we were analyzing the distribution across the dataset, we would be accurate; if we started to look closer to individual distributions, the performance is worse suggesting the quantiles of individual distributions cannot be trusted. + +![](images/5ba0a74e3b6aa56744216a122f89938ce61fa7461edf3b64016e47551252acc8.jpg) +Figure 6: Calibration Q-Q plots for recalibration with an unconditional flow and recalibration with a conditional flow on the dataset “naval-propulsion-plant”. The legend contains the calibration error for each curve. + +![](images/96799e60b702cd7228ab4ea95bae04d75bb639f63db7286ef906822c86a386ab.jpg) +Figure 7: Calibration Q-Q plots for recalibration with isotonic regression and recalibration with normalizing flows on the second time step on the dataset “electricity”. The legend contains the calibration error for each curve. + +# 6.3 TIME SERIES + +For our time series example, we trained a model on the UCI Dataset “electricity”. We predict two time steps and show that even though we used an autoregressive model for calibration (the model could learn correlated distributions), there is still some correlation not captured that recalibration can help with. + +Figure 7a shows that the calibration error of $F ( Y _ { 2 } | Y _ { 1 } )$ when recalibrated independently with isotonic regression is significant. Figure 7b shows that a flow trained jointly on the CDFs significantly reduces the errors. Although the calibration error of the marginal distribution for the second step is comparable between the two approaches, the conditional performance favors normalizing flows. A possible explanantion of the still imperfect calibration of the flow model, though better than isotonic regression, is distribution shift. + +# 7 CONCLUSION AND FUTURE WORK + +In this paper, we addressed the calibration issue in modern neural networks through using higher capacity distributions via normalizing flows. We showed that normalizing flows can not only help during calibration, but also in recalibrating miscalibrated distributions, even improving the fit in the underfitting case. Though isotonic regression also uses a two-step producedure, we reframe the problem as MLE through which we can trivially generalize recalibration to the multivariate case. Though isotonic regression could be extended such that we could compute the log likelihood implied by its change of variables, normalizing flows are a more natural way to handle this with more research backing this technique, and are easily extendable to conditional and joint distributions. Interestingly, though the Conditional Flow has all it needs to be well calibrated, recalibration helps the overall calibration which was similarly found for classification in Guo et al. (2017); it remains for future work to better understand why and when this is useful. + +Further, we extend the plot introduced in Kuleshov et al. (2018) by showing the calibration error on different subsets of the data, for example bucketed by mean prediction. Though this plot is able to show the calibration error across buckets, for future work, we will explore ways to visually show any trends in the miscalibration as well as whether the misalignments of the quantiles are statistically significant. + +# REFERENCES + +Nicola De Cao, Wilker Aziz, and Ivan Titov. Block neural autoregressive flow. In Conference on Uncertainty in Artificial Intelligence, volume 3, pp. 1723–1735. UAI, 2019. URL http: //auai.org/uai2019/proceedings/papers/511.pdf. + +Ricky T. Q. Chen, Jens Behrmann, David K Duvenaud, and Joern-Henrik Jacobsen. Residual flows for invertible generative modeling. In H. Wallach, H. Larochelle, A. Beygelzimer, F. dAlch ´ e-´ Buc, E. Fox, and R. Garnett (eds.), Advances in Neural Information Processing Systems 32, pp. 9916–9926. Curran Associates, Inc., 2019. URL http://papers.nips.cc/paper/9183- residual-flows-for-invertible-generative-modeling.pdf. + +Djork-Arne Clevert, Thomas Unterthiner, and Sepp Hochreiter. Fast and Accurate Deep Network ´ Learning by Exponential Linear Units (ELUs). arXiv e-prints, art. arXiv:1511.07289, November 2015. + +Armen Der Kiureghian and Ove Ditlevsen. Aleatory or epistemic? does it matter? Structural safety, 31(2):105–112, 2009. + +Dua Dheeru and Efi Karra Taniskidou. UCI machine learning repository, 2017. URL http: //archive.ics.uci.edu/ml. + +Laurent Dinh, David Krueger, and Yoshua Bengio. NICE: Non-linear Independent Components Estimation. arXiv e-prints, art. arXiv:1410.8516, October 2014. + +Laurent Dinh, Jascha Sohl-Dickstein, and Samy Bengio. Density estimation using Real NVP. arXiv e-prints, art. arXiv:1605.08803, May 2016. + +Yarin Gal and Zoubin Ghahramani. Dropout as a bayesian approximation: Representing model uncertainty in deep learning. In Maria Florina Balcan and Kilian Q. Weinberger (eds.), Proceedings of The 33rd International Conference on Machine Learning, volume 48 of Proceedings of Machine Learning Research, pp. 1050–1059, New York, New York, USA, 20–22 Jun 2016. PMLR. URL http://proceedings.mlr.press/v48/gal16.html. + +Achintya Gopal. Quasi-Autoregressive Residual (QuAR) Flows. arXiv e-prints, art. arXiv:2009.07419, September 2020. + +Will Grathwohl, Ricky T. Q. Chen, Jesse Bettencourt, Ilya Sutskever, and David Duvenaud. FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Models. arXiv e-prints, art. arXiv:1810.01367, October 2018. + +Chuan Guo, Geoff Pleiss, Yu Sun, and Kilian Q. Weinberger. On calibration of modern neural networks. In Doina Precup and Yee Whye Teh (eds.), Proceedings of the 34th International Conference on Machine Learning, volume 70 of Proceedings of Machine Learning Research, pp. 1321–1330, International Convention Centre, Sydney, Australia, 06–11 Aug 2017. PMLR. URL http://proceedings.mlr.press/v70/guo17a.html. + +Jonathan Ho, Xi Chen, Aravind Srinivas, Yan Duan, and Pieter Abbeel. Flow $^ { + + }$ : Improving flowbased generative models with variational dequantization and architecture design. In Kamalika Chaudhuri and Ruslan Salakhutdinov (eds.), Proceedings of the 36th International Conference on Machine Learning, volume 97 of Proceedings of Machine Learning Research, pp. 2722–2730, Long Beach, California, USA, 09–15 Jun 2019. PMLR. URL http://proceedings.mlr.press/ v97/ho19a.html. + +Chin-Wei Huang, David Krueger, Alexandre Lacoste, and Aaron Courville. Neural autoregressive flows. In Jennifer Dy and Andreas Krause (eds.), Proceedings of the 35th International Conference on Machine Learning, volume 80 of Proceedings of Machine Learning Research, pp. 2078–2087, Stockholmsmssan, Stockholm Sweden, 10–15 Jul 2018. PMLR. URL http://proceedings.mlr.press/v80/huang18d.html. + +Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, and Tie-Yan Liu. Lightgbm: A highly efficient gradient boosting decision tree. In + +I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (eds.), Advances in Neural Information Processing Systems 30, pp. 3146–3154. Curran Associates, Inc., 2017. URL http://papers.nips.cc/paper/6907-lightgbm-ahighly-efficient-gradient-boosting-decision-tree.pdf. + +Alex Kendall and Yarin Gal. What uncertainties do we need in bayesian deep learning for computer vision? In I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (eds.), Advances in Neural Information Processing Systems 30, pp. 5574–5584. Curran Associates, Inc., 2017. URL http://papers.nips.cc/paper/7141-what-uncertainties-do-we-needin-bayesian-deep-learning-for-computer-vision.pdf. + +Durk P Kingma and Prafulla Dhariwal. Glow: Generative flow with invertible 1x1 convolutions. In S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett (eds.), Advances in Neural Information Processing Systems 31, pp. 10215–10224. Curran Associates, Inc., 2018. URL http://papers.nips.cc/paper/8224-glow-generative-flowwith-invertible-1x1-convolutions.pdf. + +Durk P Kingma, Tim Salimans, Rafal Jozefowicz, Xi Chen, Ilya Sutskever, and Max Welling. Improved variational inference with inverse autoregressive flow. In D. D. Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett (eds.), Advances in Neural Information Processing Systems 29, pp. 4743–4751. Curran Associates, Inc., 2016. URL http://papers.nips.cc/paper/6581-improved-variationalinference-with-inverse-autoregressive-flow.pdf. + +Volodymyr Kuleshov, Nathan Fenner, and Stefano Ermon. Accurate uncertainties for deep learning using calibrated regression. In Jennifer Dy and Andreas Krause (eds.), Proceedings of the 35th International Conference on Machine Learning, volume 80 of Proceedings of Machine Learning Research, pp. 2796–2804, Stockholmsmssan, Stockholm Sweden, 10–15 Jul 2018. PMLR. URL http://proceedings.mlr.press/v80/kuleshov18a.html. + +Balaji Lakshminarayanan, Alexander Pritzel, and Charles Blundell. Simple and scalable predictive uncertainty estimation using deep ensembles. In I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (eds.), Advances in Neural Information Processing Systems 30, pp. 6402–6413. Curran Associates, Inc., 2017. URL http://papers.nips.cc/paper/7219-simple-and-scalablepredictive-uncertainty-estimation-using-deep-ensembles.pdf. + +David A Nix and Andreas S Weigend. Estimating the mean and variance of the target probability distribution. In Proceedings of 1994 ieee international conference on neural networks (ICNN’94), volume 1, pp. 55–60. IEEE, 1994. + +George Papamakarios, Theo Pavlakou, and Iain Murray. Masked autoregressive flow for density estimation. In I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (eds.), Advances in Neural Information Processing Systems 30, pp. 2338–2347. Curran Associates, Inc., 2017. URL http://papers.nips.cc/paper/6828-maskedautoregressive-flow-for-density-estimation.pdf. + +Tim Pearce, Alexandra Brintrup, Mohamed Zaki, and Andy Neely. High-quality prediction intervals for deep learning: A distribution-free, ensembled approach. volume 80 of Proceedings of Machine Learning Research, pp. 4075–4084, Stockholmsmssan, Stockholm Sweden, 10–15 Jul 2018. PMLR. URL http://proceedings.mlr.press/v80/pearce18a.html. + +Boris Polyak and Anatoli Juditsky. Acceleration of stochastic approximation by averaging. SIAM Journal on Control and Optimization, 30:838–855, 07 1992. doi: 10.1137/0330046. + +Danilo Rezende and Shakir Mohamed. Variational inference with normalizing flows. In Francis Bach and David Blei (eds.), Proceedings of the 32nd International Conference on Machine Learning, volume 37 of Proceedings of Machine Learning Research, pp. 1530–1538, Lille, France, 07–09 Jul 2015. PMLR. URL http://proceedings.mlr.press/v37/rezende15.html. + +Filipe Rodrigues and Francisco C. Pereira. Beyond expectation: Deep joint mean and quantile regression for spatio-temporal problems. arXiv e-prints, art. arXiv:1808.08798, August 2018. + +David Salinas, Valentin Flunkert, and Jan Gasthaus. DeepAR: Probabilistic Forecasting with Autoregressive Recurrent Networks. arXiv e-prints, art. arXiv:1704.04110, April 2017. + +Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. Dropout: A simple way to prevent neural networks from overfitting. Journal of Machine Learning Research, 15(56):1929–1958, 2014. URL http://jmlr.org/papers/v15/ srivastava14a.html. + +Natasa Tagasovska and David Lopez-Paz. Single-model uncertainties for deep learning. In Advances in Neural Information Processing Systems 32, pp. 6417–6428. Curran Associates, Inc., 2019. URL http://papers.nips.cc/paper/8870-single-modeluncertainties-for-deep-learning.pdf. + +Ichiro Takeuchi, Quoc V Le, Timothy D Sears, and Alexander J Smola. Nonparametric quantile estimation. Journal of Machine Learning Research, 7:1231–1264, 2006. + +James W Taylor. A quantile regression neural network approach to estimating the conditional density of multiperiod returns. Journal of Forecasting, 19:299–311, 2000. + +Michael E Tipping. Sparse bayesian learning and the relevance vector machine. Journal of machine learning research, 1(Jun):211–244, 2001. + +Rianne van den Berg, Leonard Hasenclever, Jakub M. Tomczak, and Max Welling. Sylvester Normalizing Flows for Variational Inference. arXiv e-prints, art. arXiv:1803.05649, March 2018. + +Ruofeng Wen, Kari Torkkola, Balakrishnan Narayanaswamy, and Dhruv Madeka. A Multi-Horizon Quantile Recurrent Forecaster. arXiv e-prints, art. arXiv:1711.11053, November 2017. + +![](images/c75db8aacd9d4a38c987062b87207c17d500f45fc7262577a8766d51b64af6c7.jpg) +Figure 8: In this figure, we show our conditional flow model. A neural network takes $X$ and outputs the scale and shift of an affine flow and a condition vector for QuAR Flows. The condition used in the QuAR Flow is the same for both $\mathrm { Q u A R }$ Flows. After the first conditional affine flow, there are two QuAR Flows with unconditional affine flows placed in between these two and at the end. The Conditional Flow model is equivalent to a Conditional Gaussian if we removed the QuAR Flows. + +# A MODEL TRAINING DETAILS + +# A.1 CALIBRATION + +We compare the performance of our model and multiple other popular approaches on 8 UCI datasets (Dheeru & Karra Taniskidou, 2017): boston-housing, concrete, energy, kin8nm, naval-propulsionplant, power-plant, wine-quality-red and yacht. The models we compared Conditional Flows to were: Conditional Gaussian (amortized inference with Gaussians, Lakshminarayanan et al. (2017)), Bayesian Ridge Regression (Tipping, 2001), MC Dropout (Gal & Ghahramani, 2016), Simultaneous Quantile Regression (SQR) (Tagasovska & Lopez-Paz, 2019), Conditional Quantile (SQR where we only learn prespecified quantiles), Quality Driven (Pearce et al., 2018), and a Gradient Boosted Decision Tree with LightGBM (Ke et al., 2017). + +Figure 8 shows a representation of the Conditional Flow network we used. The QuAR Flows are conditioned on a 64-dimensional representation from the condition network. Each Conditional QuAR Flow has two hidden layers in the residual connection with a hidden size 64 with ELU (Clevert et al., 2015) as our activation. The condition network has a single hidden layer with size 64 and ReLU as our activation. The QuAR Flows are conditioned on the 64-dimensional representation from the condition network. + +For the other neural network approaches, we used networks with two hidden layers with size 128 and used ReLU as our nonlinearity. For hyperparameter tuning on all our neural networks, we searched the following grid: + +• Learning rate: 1e-2, 1e-3, 1e-4 +• Weight decay: 0, 1e-3, 1e-2, 1e-1 +• Dropout Rates: 0.1 0.25, 0.5 0.75 + +The hyperparameters we used were taken from Tagasovska & Lopez-Paz (2019). We trained each of our neural networks for 2000 epochs with batch size 128. + +For our LightGBM tree model (Ke et al., 2017), we used mean squared error as our loss to learn the mean of the output distribution. The grid of hyperparameters we searched was: + +• Number of Trees: 100, 1000 +• Maximum Depths: 3, 5, 7, 9 +• Learning Rates: 1e-1, 1e-2, 1e-3, 1e-4 +• Minimum Child Samples: 1, 20 +• Dropout Rates: 0.1 0.25, 0.5 0.75 + +To make the tree model distributional, assuming homoscedasticity, we computed the standard deviation of the predicted normal distribution by computing the standard deviation of the residuals (observations minus predictions). + +For SQR and MC Dropout, we computed the estimated mean and CDF from 1000 samples. For Conditional Flows, we computed the estimated mean by using the Gauss-Legendre quadrature with 100 points to approximate the integral. + +# A.2 RECALIBRATION + +For recalibration, we trained the recalibration model on the validation set of each of the 20 seeds. For the flow architecture, we stacked 8 QuAR Flows with affine flows in between each one as well as at the beginning and end. Since the input to the flow is a $\mathrm { C D F } \in [ 0 , 1 ]$ , we also transform the data with a Logit Function as the first layer of the flow and account for the change of variables in the loss. In addition to this, we used a dropout rate of 0.25, two hidden layers with size 64 in each residual connection, and used Polyak averaging (Polyak & Juditsky, 1992) with a decay of 0.999 for evaluation. + +# A.3 TIME SERIES + +For our time series experiments, we tested the performance of flow recalibration on the UCI dataset “electricity”. We filtered the data down to observations after 2014-01-01. We split the data by date, where the first $72 \%$ of dates are in the train set, the next $18 \%$ are in validation set, and the last $10 \%$ are in the test set. + +The data is given in 15 minute increments, and so similarly to Deep AR (Salinas et al., 2017), we averaged the values per hour to have hourly data. Since we were trying to analyze the effect of correlated targets, we predicted two time steps conditioned on 48 hours of data using an autoregressive model. + +We included three numeric covariates: the time step within the sampled time series, the hour of the day, and the day of the week. Each of the covariates were normalized to have zero mean and one standard deviation. In addition to this, since there are 370 different types of time series, we also added an embedding layer from 370 to an embedding dimension of 20, same as that used in Deep AR (Salinas et al., 2017). We concatenated this vector with the observations and covariates, leading to a 27-dimensional vector. + +Since all the observations are positive, we model the target with a conditional Gamma distribution (i.e. amortized inference with Gamma distributiet al., 2017), we normalized each time series $\{ z _ { i , t } \} _ { t = 0 } ^ { T - 1 }$ of by $\begin{array} { r } { v _ { i } = 1 + 1 / T \sum _ { t = 0 } ^ { T - 1 } z _ { i , t } . } \end{array}$ eep AR (Salinas. We account for the scaling in the output distribution, i.e. Gamma $( k , \theta * v _ { i } )$ . + +The model we used was a 1 layer LSTM, and then two linear layers with a ReLU and Dropout (Srivastava et al., 2014) in between were applied to the hidden representation. We set the dropout rate to 0.5 and used a hidden size of 48 everywhere. For evaluation, we used Polyak averaging (Polyak & Juditsky, 1992) with a decay of 0.999. + +For recalibration with flows, we trained on the CDFs for both time steps with a flow with the same architecture as that used in Appendix A.2. + +# B EXPERIMENTAL RESULTS + +# B.1 CALIBRATION + +In Table 2, we compare Conditional Flows against multiple other approaches for estimating uncertainty, and we measure performance using Prediction Interval Coverage Probability (PICP), Mean Squared Error (MSE), and Calibration Error. + +For each model, we trained the model on 20 different seeds where each seed randomly splits the data in $72 \%$ train, $18 \%$ validation, and $10 \%$ test. We picked the best hyperparameter by choosing the hyperparameters that gave the best average validation loss across the 20 seeds where the loss used is the loss defined by the training procedure for the model, e.g. for Conditional Gaussian, we used log likelihood; for LightGBM, we used MSE; for QualityDriven, we used the Quality Driven Loss, etc. + +Table 2: Results on percentage of data captured from 0.025 to 0.975 quantiles (PICP), MSE, and calibration error with 100 buckets. The results are from minimizing the average validation loss across 20 seeds. The optimal value of PICP is 0.95, and the optimal value for MSE and Calib is 0.00. + +
bostonHousingconcrete
PICPMSECalibPICPMSECalib
ConditionalFlow0.93 ± 0.040.13 ± 0.060.060.92 ± 0.030.09 ±0.030.01
ConditionalGaussian0.93 ± 0.030.14±0.070.130.91 ± 0.020.09 ±0.030.06
BayesianRidgeRegression0.95 ± 0.030.28±0.080.340.95 ± 0.030.40±0.070.01
MC Dropout0.50 ± 0.080.11 ± 0.052.990.69 ± 0.050.07±0.030.89
SQR0.73 ± 0.080.11 ± 0.050.480.74± 0.040.07± 0.030.47
ConditionalQuantile0.92 ± 0.05N.A.N.A.0.93 ± 0.03N.A.N.A.
QualityDriven0.83 ± 0.06N.A.N.A.0.83± 0.04N.A.N.A.
LightGBM0.04±0.030.12 ± 0.067.740.63±0.070.07±0.021.25
energykin8nm
PICPMSECalibPICPMSECalib
ConditionalFlow0.96 ± 0.020.0022 ± 0.00060.120.952 ± 0.0060.081 ± 0.0130.01
ConditionalGaussian0.97 ± 0.030.0030± 0.00090.260.947 ± 0.0070.071 ± 0.005<0.01
BayesianRidgeRegression0.89 ± 0.040.09 ±0.020.240.951 ± 0.0070.59 ± 0.020.09
MC Dropout0.97± 0.020.0026 ± 0.00100.170.69 ± 0.020.069 ± 0.0051.14
SQR0.97± 0.020.0028 ± 0.00120.370.892 ± 0.0100.072 ± 0.0050.01
ConditionalQuantile0.98 ±0.02N.A.N.A.0.943 ± 0.011N.A.N.A.
QualityDriven0.96 ± 0.04N.A.N.A.0.88±0.02N.A.N.A.
LightGBM0.24±0.050.0013 ± 0.00065.180.205 ± 0.0100.190 ± 0.0115.59
naval-propulsion-plantpower-plant
PICPMSECalibPICPMSECalib
ConditionalFlow0.98 ± 0.030.009 ±0.0040.450.952 ± 0.0070.048 ±0.0070.01
ConditionalGaussian0.9995 ± 0.00070.012 ± 0.0062.350.947 ± 0.0100.048 ±0.006<0.01
BayesianRidgeRegression1.0 ±0.00.055 ± 0.0048.030.964 ± 0.0070.072 ± 0.0070.01
MC Dropout0.98 ±0.020.005±0.0020.510.59 ±0.020.046±0.0071.88
SQR0.998 ± 0.0020.0052 ± 0.00121.440.93 ± 0.020.048 ±0.0070.02
ConditionalQuantile0.97±0.02N.A.N.A.0.937 ± 0.014N.A.N.A.
QualityDriven0.949 ± 0.010N.A.N.A.0.89 ±0.02N.A.N.A.
LightGBM0.714 ± 0.0110.0056 ± 0.00090.790.17 ± 0.020.035 ± 0.0075.95
wine-quality-redyacht
PICPMSECalibPICPMSECalib
ConditionalFlow0.90 ±0.020.6±0.20.040.95 ± 0.040.004±0.0030.27
ConditionalGaussian0.95 ± 0.020.59 ± 0.090.220.99 ±0.020.004±0.0020.62
BayesianRidgeRegression0.95 ± 0.020.63 ± 0.110.050.94± 0.030.35 ± 0.100.25
MC Dropout0.35 ± 0.040.57 ±0.094.010.97 ± 0.040.004±0.0020.21
SQR0.81±0.090.59 ±0.100.150.96 ±0.040.004±0.0040.49
ConditionalQuantile0.95 ± 0.02N.A.N.A.0.99 ± 0.02N.A.N.A.
QualityDriven0.84 ±0.03N.A.N.A.0.97 ± 0.04N.A.N.A.
LightGBM0.40 ± 0.050.55± 0.102.930.45 ± 0.080.003±0.0033.04
+ +Table 3: Calibration error (with 100 buckets) before and after recalibration. + +
BayesianRidgeRegressionConditionalGaussianConditionalFlow
BeforeFlowIsoBeforeFlowIsoBeforeFlowIso
bostonHousing0.340.020.020.130.040.020.060.020.01
concrete0.010.010.010.060.020.020.010.020.03
energy0.240.020.010.26<0.010.010.120.010.01
kin8nm0.090.01<0.01<0.01<0.01<0.010.01<0.01<0.01
naval-propulsion-plant8.030.01<0.012.35<0.01<0.010.45<0.01<0.01
power-plant0.01<0.01<0.01<0.01<0.01<0.010.01<0.01<0.01
wine-quality-red0.050.02<0.010.220.040.020.040.010.01
yacht0.250.050.070.620.030.030.270.020.03
+ +Table 4: MSE performance before and after recalibration. We do not show the MSE for isotonic regression as the mean cannot be computed after recalibrating with isotonic regression. + +
BayesianRidgeRegressionConditionalGaussian
BeforeFlowBeforeFlow
bostonHousing0.28 ±0.080.28 ±0.080.14 ± 0.070.14 ± 0.07
concrete0.40 ± 0.070.40 ± 0.070.09 ±0.030.09 ± 0.03
energy0.09 ±0.020.09 ±0.020.0030 ±0.00090.0032 ± 0.0011
kin8nm0.59 ± 0.020.59 ± 0.020.071 ± 0.0050.072 ± 0.005
naval-propulsion-plant0.055 ± 0.0040.48 ±0.020.012 ± 0.0060.012 ± 0.007
power-plant0.072 ± 0.0070.072 ± 0.0070.048 ± 0.0060.049 ± 0.006
wine-quality-red0.63 ± 0.110.63 ± 0.110.59 ± 0.090.59 ± 0.10
yacht0.35 ± 0.100.36 ± 0.100.004 ±0.0020.004 ± 0.003
ConditionalFlow
BeforeFlow
bostonHousing0.13 ± 0.06
concrete0.09 ± 0.030.13 ± 0.06 0.09 ± 0.03
0.0022 ± 0.00060.0027 ± 0.0007
energy kin8nm0.081 ± 0.0130.081 ± 0.013
naval-propulsion-plant0.009 ± 0.0040.016 ± 0.012
power-plant0.048 ± 0.0070.048 ± 0.007
wine-quality-red0.6± 0.20.64 ± 0.15
yacht
0.004 ± 0.0030.008 ± 0.012
+ +Reported in Table 2 are the mean and standard deviation of PICP and MSE across the 20 seeds. Due to the limited data, for calibration error with 100 bins, we computed it over the CDFs from all 20 seeds. We included PICP (the percentage of true observations between the quantiles 0.025 and 0.975) to compare against alternative approaches where we prespecify which quantiles we need. + +# B.2 RECALIBRATION + +From the above section, we recalibrate the best Bayesian Ridge Regression, Conditional Gaussian, and Conditional Flow. In Table 3, we compare the calibration error before recalibration, after recalibration with isotonic regression, and after recalibration with normalizing flows. + +As we can see, across all 8 UCI datasets, the calibration errors after recalibrating with normalizing flows are comparable to those from isotonic regression. More interestingly though, improvement in calibration error can be detrimental to mean performance. \ No newline at end of file diff --git a/parse/train/H8VDvtm1ij8/H8VDvtm1ij8_content_list.json b/parse/train/H8VDvtm1ij8/H8VDvtm1ij8_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..e792ceb6617ba627d1e7f0bdaff25dc017eb7373 --- /dev/null +++ b/parse/train/H8VDvtm1ij8/H8VDvtm1ij8_content_list.json @@ -0,0 +1,1799 @@ +[ + { + "type": "text", + "text": "NORMALIZING FLOWS FOR CALIBRATION AND RECALIBRATION ", + "text_level": 1, + "bbox": [ + 176, + 99, + 826, + 145 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Anonymous authors Paper under double-blind review ", + "bbox": [ + 183, + 171, + 398, + 198 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 236, + 544, + 251 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In machine learning, due to model misspecification and overfitting, estimates of the aleatoric uncertainty are often inaccurate. One approach to fix this is isotonic regression, in which a monotonic function is fit on a validation set to map the model’s CDF to an optimally calibrated CDF. However, this makes it infeasible to compute additional statistics of interest on the model distribution (such as the mean). In this paper, through a reframing of recalibration as MLE, we replace isotonic regression with normalizing flows. This allows us to retain the ability to compute the statistical properties of the model (such as closed-form likelihoods, mean, correlation, etc.) and provides an opportunity for additional capacity at the cost of possible overfitting. Most importantly, the fundamental properties of normalizing flows allow us to generalize recalibration to conditional and multivariate distributions. To aid in detecting miscalibration and measuring our success at fixing it, we use a simple extension of the calibration Q-Q plot. ", + "bbox": [ + 233, + 280, + 766, + 459 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 518, + 334, + 535 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Recent advances in deep learning have led to models with significantly higher overall accuracy on both classification and regression tasks compared to what was achievable in the past. However, an important component in conjunction with accuracy is a model’s ability to accurately assess the uncertainty in its prediction. Most taxonomies classify uncertainty into three sources: approximation, aleatoric, and epistemic uncertainty (Der Kiureghian & Ditlevsen, 2009). Approximation uncertainty quantifies the error from fitting a simple model to complex data. Aleatoric uncertainty quantifies the uncertainty of the conditional distribution of the target variable given features. This uncertainty arises from hidden variables or measurement errors and cannot be reduced through collecting more data under the same experimental conditions. Epistemic uncertainty quantifies the uncertainty arising from fitting a model utilizing finite data, i.e. it is inversely proportional to the density of the training examples and can be reduced by collecting data in the low density regions. ", + "bbox": [ + 174, + 561, + 825, + 714 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "These different sources of uncertainty have different techniques for handling them. Using high capacity models such as neural networks removes a large part of the approximation uncertainty. By fitting a full distribution on the target conditional on features, we can model the aleatoric uncertainty from observations. Inaccurate estimates of aleatoric uncertainty can be explained by underfitting (insufficient complexity in the conditional distributions) or overfitting (models with sufficient capacity can memorize the data, leading to the distributions collapsing to deltas). Though epistemic uncertainty is important for the model to answer what it does not know, the focus of this paper is on improving estimates of the aleatoric uncertainty. ", + "bbox": [ + 174, + 722, + 825, + 833 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Our approach in this paper is to handle both model fit and calibration using normalizing flows. Normalizing flows can be used in conjunction with amortized inference to improve the flexibility of the output distribution, and further, through a reframing of recalibration as maximum likelihood estimation (MLE), normalizing flows can be used to handle any miscalibration found on a validation set. Further, we use a simple extension of the calibration plot from Kuleshov et al. (2018) to help with the the analysis of the calibration of a model across different regions of the data. ", + "bbox": [ + 174, + 840, + 825, + 922 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "2 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 102, + 344, + 118 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "One method for handling aleatoric uncertainty is amortized inference with Gaussians (Lakshminarayanan et al., 2017; Nix & Weigend, 1994; Kendall & Gal, 2017) where a model, such as a neural network, maps from features to the parameters of a Gaussian. This approach models aleatoric uncertainty directly but suffers from approximation uncertainty as a Gaussian cannot model complex targets. ", + "bbox": [ + 174, + 132, + 825, + 203 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Another approach is Bayesian methods such as Bayesian Ridge Regression (Tipping, 2001) and MC Dropout (Gal & Ghahramani, 2016). Similar to amortized inference with Gaussians, the output distribution limits the capacity of the model. Full Bayesian techniques with neural networks are often too computationally expensive in practice, and approximate methods often fail to capture the full complexity of the uncertainty (Lakshminarayanan et al., 2017). ", + "bbox": [ + 174, + 209, + 825, + 279 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Another family of methods uses quantile regression with non-linear techniques such as decision trees or neural networks. Some of these methods require a predefined set of quantiles (Takeuchi et al., 2006; Wen et al., 2017; Rodrigues & Pereira, 2018; Taylor, 2000). Simultaneous Quantile Regression (SQR, Tagasovska & Lopez-Paz (2019)) trains one model on all quantiles and is able to learn complex shaped distributions. However the training procedure requires the model to learn to be monotonic instead of being constrained to be so and is not trivial to extend to multidimensional outputs. Pearce et al. (2018) learns a finite set of quantiles by using quality metrics for predictive intervals. ", + "bbox": [ + 173, + 285, + 825, + 383 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Normalizing flows have been used in the contexts of variational inference and generative modeling. The approaches to normalizing flows can be categorized into autoregressive methods (Kingma et al., 2016; Papamakarios et al., 2017; Huang et al., 2018; Cao et al., 2019), coupling layers (Dinh et al., 2014; 2016; Kingma & Dhariwal, 2018; Ho et al., 2019), residual networks (Rezende & Mohamed, 2015; van den Berg et al., 2018; Gopal, 2020) and continuous flows (Grathwohl et al., 2018). ", + "bbox": [ + 174, + 390, + 826, + 460 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "3 BACKGROUND ", + "text_level": 1, + "bbox": [ + 176, + 479, + 326, + 496 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "3.1 RECALIBRATION ", + "text_level": 1, + "bbox": [ + 176, + 510, + 331, + 525 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "An important goal in modeling is to have well-calibrated distributions as this allows users of the model to understand the confidence the model places on its prediction. In other words, with a well-calibrated model, we can better ascertain the uncertainty in the model’s predictions and respond differently to those predictions depending on the uncertainty surrounding them. ", + "bbox": [ + 174, + 536, + 825, + 592 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Guo et al. (2017) showed that unlike techniques used decades ago such as Bayesian Ridge Regression, modern neural network-based classifiers are very poorly calibrated. A simple variant of Platt scaling and other histogram based techniques applied to a validation set were shown to help alleviate the calibration problem where perfect calibration is defined as ", + "bbox": [ + 173, + 598, + 825, + 655 + ], + "page_idx": 1 + }, + { + "type": "equation", + "img_path": "images/e43808e66d2bfbf69972fead871980cc742ab0f6c00f45c4152c55d07f3044f3.jpg", + "text": "$$\n\\mathbb { P } ( \\hat { Y } = Y | \\hat { P } = p ) = p , \\quad \\forall p \\in [ 0 , 1 ]\n$$", + "text_format": "latex", + "bbox": [ + 375, + 657, + 620, + 676 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "where $\\hat { Y }$ is a class prediction and $\\hat { P }$ is its predicted probability of correctness. ", + "bbox": [ + 174, + 680, + 683, + 695 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Kuleshov et al. (2018) extended the analysis in Guo et al. (2017) to neural network-based regressors; isotonic regression, a method for learning monotonic univariate functions, was applied to map from $\\mathcal { F } _ { x _ { j } } ( y _ { j } ) = \\hat { p } _ { j }$ to $| \\{ y _ { n } | \\mathcal { F } _ { x _ { n } } ( y _ { n } ) < \\hat { p } _ { j } , n \\stackrel { - } { = } 1 , . . . , N \\} | / N$ (the fraction of the data where the model CDF is less than $\\hat { p }$ ) to improve calibration where perfect calibration is defined as ", + "bbox": [ + 173, + 702, + 826, + 758 + ], + "page_idx": 1 + }, + { + "type": "equation", + "img_path": "images/f8cfef23ac0b22f3f9c42993e6b5b55e99c0a224ebf71a0cd384b8b878d64f09.jpg", + "text": "$$\n\\mathbb { P } ( Y < \\mathcal { F } _ { X } ^ { - 1 } ( p ) ) = p , \\quad \\forall p \\in [ 0 , 1 ]\n$$", + "text_format": "latex", + "bbox": [ + 380, + 758, + 617, + 777 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "where ${ \\mathcal { F } } _ { X }$ is the predicted CDF function. ", + "bbox": [ + 174, + 779, + 444, + 794 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Kuleshov et al. (2018) further introduced calibration error as a metric to quantitatively measure how well the quantiles are aligned: ", + "bbox": [ + 176, + 800, + 825, + 828 + ], + "page_idx": 1 + }, + { + "type": "equation", + "img_path": "images/dcb4f26b646c6177de95703c877c629775389f8a8b0e1d7feaa1897790b407a4.jpg", + "text": "$$\n\\begin{array} { r } { \\hat { p } _ { j } = \\vert \\{ y _ { n } \\vert \\mathcal { F } _ { x _ { n } } ( y _ { n } ) < p _ { j } , n = 1 , \\ldots , N \\} \\vert / N } \\\\ { \\operatorname { c a l } ( y _ { 1 } , \\ldots , y _ { N } ) = \\displaystyle \\sum _ { j = 1 } ^ { M } ( p _ { j } - \\hat { p } _ { j } ) ^ { 2 } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 344, + 829, + 656, + 895 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "where $M$ is the number of quantiles that are evaluated. In this paper, we set this to 100 evenly spaced quantiles. ", + "bbox": [ + 174, + 895, + 826, + 924 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/52aa6c065ffeced6d996d72cde20955f69b0c8da9a20d8031cebe127f210d0b4.jpg", + "image_caption": [ + "Figure 1: A comparison between using a hypernetwork approach versus conditional approach to creating Conditional QuAR Flows to model $p ( X | c )$ where $W _ { 1 }$ and $W _ { 2 }$ parametrize the layers in the residual connection. " + ], + "image_footnote": [], + "bbox": [ + 204, + 97, + 794, + 228 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.2 NORMALIZING FLOWS ", + "text_level": 1, + "bbox": [ + 176, + 327, + 372, + 340 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "A crucial component in improving uncertainty estimates in this paper is to fit normalizing flows, a generative model for density estimation using invertible functions. ", + "bbox": [ + 171, + 354, + 823, + 383 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Suppose that we wish to formulate a joint distribution on an $n$ -dimensional real vector $x$ . A flowbased approach treats $x$ as the result of a transformation $g$ applied to an underlying vector $z$ sampled from a base distribution $p _ { z } ( z )$ . The generative process for flows is defined as: ", + "bbox": [ + 174, + 390, + 825, + 433 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/ee13df7ff53df7ed3c8c5c5dfae1d84c3938600f51fcccaafc04540b8869278f.jpg", + "text": "$$\n\\begin{array} { l } { z \\sim p _ { z } ( z ) } \\\\ { x = g ( z ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 462, + 444, + 534, + 482 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where $p _ { z }$ is often a Normal distribution and $g$ is an invertible function. Notationally, we will use $f = g ^ { - 1 }$ . Using change of variables, the log likelihood of $x$ is ", + "bbox": [ + 169, + 492, + 823, + 521 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/09787bde3ddfbf23fec9c4cdeb1c41f2934a30cd91950c65b558857aa9ce255b.jpg", + "text": "$$\n\\log p _ { x } ( x ) = \\log p _ { z } \\left( f ( x ) \\right) + \\log \\left| { \\operatorname* { d e t } \\left( \\frac { \\partial f ( x ) } { \\partial x } \\right) } \\right|\n$$", + "text_format": "latex", + "bbox": [ + 338, + 531, + 660, + 568 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To train flows (i.e. maximize the log likelihood of data points), we need to be able to compute the logarithm of the absolute value of the determinant of the Jacobian of $f$ , also called the log-determinant. To construct large normalizing flows, we can compose smaller ones as this is still invertible and the log-determinant of this composition is the sum of the individual log-determinants. ", + "bbox": [ + 173, + 578, + 825, + 636 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "An important observation is that every univariate distribution can be viewed as a flow in which the base distribution $p _ { z } ( z )$ is a Uniform distribution over $[ 0 , 1 ]$ and $g$ is the inverse CDF of the univariate distribution. This can be generalized to multivariate distributions using the chain rule. ", + "bbox": [ + 174, + 641, + 823, + 684 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.3 CONDITIONAL QUAR FLOWS ", + "text_level": 1, + "bbox": [ + 176, + 707, + 419, + 722 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In this paper, the specific normalizing flow used is Quasi-Autoregressive Residual Flows (QuAR Flows, Gopal (2020)). QuAR Flows were shown to handle modeling complex distributions while having nice optimization properties and computationally efficient log-likelihoods. Other commonly used normalizing flows have drawbacks. Coupling layers do not work for one-dimensional inputs. Autoregressive flows are often conditional Gaussians which means in the one-dimensional case, the flow is simply a Gaussian. Residual Flows (Chen et al., 2019) are expressive but, though equivalent to QuAR Flows in the one-dimensional case, are computationally expensive for high-dimensional distributions. ", + "bbox": [ + 173, + 734, + 825, + 847 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "If we would like to condition a QuAR Flow given some features $c$ , we could use a hypernetwork that maps $c$ to the parameters of the QuAR Flow (Figure 1a). However, this can be computationally expensive if the QuAR Flow is parameterized with thousands of parameters. Instead, conditional information can be incorporated by concatenating the conditions $c$ before applying the first layer in the residual connection within a QuAR Flow (Figure 1b). ", + "bbox": [ + 174, + 853, + 823, + 924 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "4 REGRESSION USING NORMALIZING FLOWS ", + "text_level": 1, + "bbox": [ + 173, + 102, + 568, + 118 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The goal of regression is to model the conditional probability distribution $p ( y | x )$ . Frequently, this task is reduced to obtaining point estimates of the mean or median by minimizing the mean squared error or mean absolute error respectively. In order to access uncertainties, we must model the full conditional distribution; in addition to this, we can still retrieve point estimates of the mean, median, or any other distributional statistic. In this section, we discuss how normalizing flows can be used to this end as well as how recalibration can be reframed as maximum likelihood estimation (MLE). ", + "bbox": [ + 174, + 132, + 826, + 217 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "4.1 CALIBRATION WITH NORMALIZING FLOWS ", + "text_level": 1, + "bbox": [ + 174, + 234, + 516, + 250 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "One approach to modeling aleatoric uncertainty is to use amortized inference with a Normal distribution as its output distribution, conditioned on features (Lakshminarayanan et al., 2017). However, if a Gaussian is not appropriate to fit the target, then the error in miscalibration can be attributed to approximation error, i.e. insufficient capacity to learn the distribution. A simple example of this is where we have no features to condition on (or all the features we have contain no relevant information) with a one-dimensional target. In Figure 2, we can see that since the target is bimodal, the Gaussian fit does not well describe the data. ", + "bbox": [ + 173, + 261, + 826, + 358 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "To improve this model, we replace the Gaussian with a normalizing flow conditioned on our data, similar to Figure 1b. In this way, the distribution fit to the targets has sufficient capacity to learn complex distributions, including multimodal distributions (Figure 2). ", + "bbox": [ + 173, + 364, + 517, + 449 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "4.2 RECALIBRATION WITH NORMALIZING FLOWS ", + "text_level": 1, + "bbox": [ + 173, + 467, + 374, + 494 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "To handle overfitting of the uncertainty, we recalibrate the results of the original model where we assume the original model outputs a full distribution that has closed-form likelihoods. Since the only requirement is a full distribution with a closed-form likelihood, the original model that we recalibrate can be as simple as a Bayesian Linear Regression model or as complicated as a conditional normalizing flow. We recalibrate the original model by fitting a normalizing flow on top of it. In this way, the training process is the following two-step procedure: ", + "bbox": [ + 174, + 506, + 517, + 603 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/ad181b91bb85b484eab2f815ac5f66a3057be04180b0b5783e57d91cc0f6099a.jpg", + "image_caption": [ + "Figure 2: One-dimensional example of Gaussian versus Flow " + ], + "image_footnote": [], + "bbox": [ + 529, + 383, + 821, + 547 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 603, + 823, + 632 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/c1646d62cd1f3dda7b41ed6bad0e7e343abd4ada3ef43285bf596837f42266e8.jpg", + "text": "$$\n\\begin{array} { r l } & { 1 . \\ f _ { \\theta } = \\arg \\operatorname* { m a x } _ { f _ { \\theta } } \\sum _ { i = 1 } ^ { N _ { t r } } \\log p _ { f _ { \\theta } } ( y _ { i } ^ { t r } | x _ { i } ^ { t r } ) } \\\\ & { 2 . \\ g _ { \\phi } = \\arg \\operatorname* { m a x } _ { g _ { \\phi } } \\sum _ { i = 1 } ^ { N _ { v a l } } \\log p _ { g _ { \\phi } } ( F _ { \\theta } ( y _ { i } ^ { v a l } | x _ { i } ^ { v a l } ) ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 210, + 641, + 547, + 689 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where the tra $f _ { \\boldsymbol { \\theta } } ( \\boldsymbol { y } | \\boldsymbol { x } )$ is thet and nction given is the valid $x$ , i $F _ { \\theta } ( y | x )$ is the CDF of hough the for $f _ { \\theta } ( y | x ) , \\{ x ^ { t r } , y ^ { t r } \\} _ { i = 1 } ^ { N _ { t r } }$ ison $\\{ x ^ { v a l } , y ^ { v a l } \\} _ { i = 1 } ^ { N _ { v a l } }$ above shows we can use any likelihood model for $g _ { \\phi }$ , since isotonic regression is a method to fit a free form function to the CDFs, we choose to use normalizing flows, specifically QuAR Flows, as these are more flexible than using autoregressive flows such as MAFs (Papamakarios et al., 2017). ", + "bbox": [ + 173, + 700, + 825, + 773 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "After the two-step training, the new generative process is: ", + "bbox": [ + 174, + 780, + 552, + 795 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/80e6d83ca80da3b9239424445b97d3f04f662d18bb6ae77cac0633b9b50a4f85.jpg", + "text": "$$\n\\begin{array} { l } { z \\sim \\mathrm { U n i f o r m } ( 0 , 1 ) } \\\\ { u = G _ { \\phi } ^ { - 1 } ( z ) } \\\\ { y = F _ { \\theta } ^ { - 1 } ( u | x ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 434, + 801, + 563, + 864 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $G _ { \\phi }$ is the CDF of $g _ { \\phi }$ . The density function of the above generative process is simply the product of the individual density functions: $f _ { \\theta }$ and $g _ { \\phi }$ . Given this view of the generative process, one interpretation of the two-step process is to first fit $\\theta$ on the training set where $\\phi$ is initialized so that $G _ { \\phi } ^ { - 1 }$ is the identity function, and then to fit $\\phi$ on the validation set while keeping $\\theta$ frozen. Though $\\theta$ and $\\phi$ could be trained end-to-end, similar to the approach in Section 4.1, we show in our experiments (Section 6.2) that there are benefits to this two-step approach. ", + "bbox": [ + 174, + 867, + 825, + 924 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/9212fa4438adc3e36c2e75cfd149f1d9ffde426fb5aa80f4de671bd843cb558c.jpg", + "image_caption": [ + "Figure 3: Comparison plots of isotonic regression and flow recalibration on multiple outputs. The two axes are different targets being modeled, and the scatter plot shows that the targets are correlated. The top and right sides show the marginal histogram as well as the fit from the recalibrated distribution. The contour plot shows the two-dimensional contours of the recalibrated distribution which can be seen to not align well for isotonic regression. " + ], + "image_footnote": [], + "bbox": [ + 178, + 101, + 823, + 285 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "", + "bbox": [ + 171, + 401, + 823, + 429 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Given this log-likelihood viewpoint of recalibration, we can trivially incorporate conditioning of the normalizing flow on additional information. For example, say $f _ { \\theta }$ outputs $\\mu$ and $\\sigma$ that parameterize a Normal distribution, we could then condition $g _ { \\phi }$ on these two outputs. If we were to use many features to condition on, we would return to the first situation where we could overfit to the finite number of observations we have. We can think of the first model $f _ { \\theta }$ as compressing/embedding the data into two dimensions, and the second model utilizing the embedding to create a meaningful and well-calibrated distribution on the target. Compared to isotonic regression, we can easily incorporate conditional information while retaining monotonicity as normalizing flows are monotonic by construction. ", + "bbox": [ + 174, + 436, + 825, + 547 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Recalibration is interesting in that it is useful for both overfitting as well as underfitting. From Guo et al. (2017), we see that multinomial classification models have sufficient capacity to overfit uncertainties and benefit from recalibration. On the other hand, the simple example in Figure 2 suffers from miscalibrated uncertainties due to approximation uncertainty (underfitting), and recalibration reduces the approximation error. ", + "bbox": [ + 174, + 555, + 825, + 625 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "One solution to handling overfitting is to early-stop on a validation set. Whether early stopping occurs or not, our solution incorporates the information of the validation set to correct potential overfitting. However, if we try to correct for multiple sources of overfitting, then we could introduce a new overfitting problem. In essence, there is a tradeoff between the validation size (which in turn controls training size) and how many sources of overfitting one can try to correct after training. ", + "bbox": [ + 174, + 632, + 825, + 702 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4.3 MULTIVARIATE RECALIBRATION ", + "text_level": 1, + "bbox": [ + 176, + 727, + 441, + 741 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Whereas Platt scaling (Guo et al., 2017) and isotonic regression (Kuleshov et al., 2018) have been shown to improve the calibration of distributions when we have one-dimensional outputs, scaling these solutions to high-dimensional targets is non-trivial. ", + "bbox": [ + 174, + 756, + 825, + 797 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Say we are modeling two-dimensional real-valued targets and use isotonic regression to calibrate the targets individually. For simplicity, say we use amortized inference with independent output distributions. If the targets are not conditionally independent, the distribution will not be wellcalibrated, even after recalibration with isotonic regression (Figure 3a). However, using normalizing flows, we can compute the CDF of the observed targets per output distribution and recalibrate this two-dimensional distribution (Figure 3b). ", + "bbox": [ + 174, + 804, + 825, + 888 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The general procedure of recalibrating $N$ -dimensional distributions is to fit a normalizing flow on the $N$ -dimensional vector $x _ { i } = F ( y _ { i } | y _ { < i } )$ . ", + "bbox": [ + 174, + 895, + 821, + 925 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/bd31ec7371b5fbab3c41c4af090e7e01d02a0effd5315ff0fe11e911a5356c31.jpg", + "image_caption": [ + "Figure 4: Calibration Q-Q plots for recalibration using isotonic regression and recalibration using flows for the simulated multivariate case in Figure 3a. The legend contains the calibration error for each curve. " + ], + "image_footnote": [], + "bbox": [ + 176, + 121, + 799, + 323 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "5 MULTIVARIATE RECALIBRATION EXAMPLE", + "text_level": 1, + "bbox": [ + 174, + 402, + 566, + 420 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In multiclass classification, we often focus on individual metrics such as accuracy, precision, recall, F1, etc. However, exploring the accuracy of the separate classes using a confusion matrix can show if the model is biased even if the performance on average is good. Similar to this view for classification, we extend the calibration plot introduced in (Kuleshov et al., 2018) to show calibration performance on different subsets of the data, binned by either a feature or a prediction, e.g. Figure 4. The only restriction is the binning cannot be a function of the target we are evaluating. ", + "bbox": [ + 174, + 435, + 825, + 520 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Say we are modeling two-dimensional real-valued targets $( Y _ { 1 } , Y _ { 2 } )$ shown in Figure 3a. If we fit independent Gaussians to the target, the resulting distribution will not align with the contours of the data. ", + "bbox": [ + 176, + 526, + 823, + 569 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We first recalibrate the distribution by fittting isotonic regression models on $F ( Y _ { 1 } )$ and $F ( Y _ { 2 } | Y _ { 1 } )$ The results for $F ( Y _ { 2 } | Y _ { 1 } )$ are shown in Figure 4a where we can see that, though across the full dataset the calibration error is zero, when we bucket by $F ( Y _ { 1 } )$ , the calibration error achieved is both significant and a strong function of $Y _ { 1 }$ as it is unable to account for correlations in $Y _ { 1 }$ and $Y _ { 2 }$ . In other words, the model is not calibrated in any given region of the data but only in aggregate. ", + "bbox": [ + 174, + 575, + 825, + 645 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "However, if we recalibrate using normalizing flows by fitting a flow on the pair $( F ( Y _ { 1 } ) , F ( Y _ { 2 } | Y _ { 1 } ) )$ , we can see in Figure 4b that even if we bucket by $F ( Y _ { 1 } )$ , the calibration error stays close to zero. Unlike isotonic regression, the flow can learn the correlation between the CDFs by being trained jointly on all of them. In addition to this, had we used a more complex calibration model that could model the correlations directly, we would not be able to compute the correlation after recalibrating with isotonic regression. By recalibrating with flows, we obtain a result that is still a distribution with a closed-form likelihood; this allows us to still be able to use the model to compute the correlation and any other distributional statistics. ", + "bbox": [ + 174, + 652, + 825, + 763 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In Figure 5, we show visually the difference between recalibration with flows and with isotonic regression. The key differences being that flows can recalibrate the CDFs jointly and be conditioned on additional information $c$ , while isotonic regression is fit on each CDF independently and is unable to incorporate any additional information. The reason is that flows are monotonic by construction and can therefore handle multiple variables and conditions. ", + "bbox": [ + 174, + 770, + 825, + 840 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "6 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 174, + 863, + 326, + 878 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this section, we analyze the performance of flows on multiple UCI datasets. Importantly, we do not aim for state-of-the-art performance, nor do we expect normalizing flows to outperform isotonic ", + "bbox": [ + 173, + 895, + 823, + 924 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/875700dffcddbe4a75f5e5d09bdaf048c24fbe3c4bd6dcd6bef0495db4def2fa.jpg", + "image_caption": [ + "Figure 5: A diagram for multivariate recalibration using the same notation as that used in Section 4.2. The first step for recalibration is always the calibration step, shown in the blue box, where any likelihood model $f _ { \\theta }$ can be used. On the left, isotonic regression is used to recalibrate the CDFs from $f _ { \\theta }$ ; on the right, normalizing flows $g _ { \\phi }$ are used to recalibrate the CDFs from $f _ { \\theta }$ conditioned on some $c$ . " + ], + "image_footnote": [], + "bbox": [ + 274, + 98, + 722, + 409 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "regression in aggregate. In terms of calibration, we show that the increase in expressivity can be beneficial; in terms of recalibration, we show specific failure points of isotonic regression that binning uncovers and how normalizing flows fixes these issues. ", + "bbox": [ + 174, + 522, + 825, + 564 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "6.1 CALIBRATION ", + "text_level": 1, + "bbox": [ + 174, + 588, + 312, + 602 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To test the effect of increased capacity in distributions, we tested how well normalizing flows improve performance in distributional estimates compared to a few other popular approaches for estimating uncertainties. We do not compare directly against other methods for conditional distributions such as autoregressive flows for the reason specified in Section 3.3: in the one dimensional case, those are often the same as ConditionalGaussian. Instead of replacing the output distribution with a complex distribution created by hand, such as an explicit mixture, we rely on using more expressive flows which can model mixture behavior as well as more complicated behavior such as skew and kurtosis. ", + "bbox": [ + 174, + 616, + 825, + 714 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/7abeef572c6f552073f92457b1bb61bd0b47b3ab73a6d809ea69090876e017c1.jpg", + "table_caption": [ + "Table 1: Results before and after recalibration on the UCI dataset “naval-propulsion-plant”. Details on the model methodology as well as performance on other UCI datasets are in Appendix B. The mean squared error (MSE) and its uncertainty is computed using 20 seeds. “Calib” is the calibration error (Equation 1) using 100 quantiles across 20 seeds instead of per seed. " + ], + "table_footnote": [], + "table_body": "
Before Recalib.Isotonic Recalib.Flow Recalib.
MSECalibMSECalibMSECalib
ConditionalFlow0.009 ±0.0040.45N.A.<0.010.016 ± 0.012<0.01
ConditionalGaussian0.012 ±0.0062.35N.A.<0.010.012 ±0.006<0.01
BayesianRidgeRegression0.055 ±0.0048.03N.A.0.010.48 ± 0.02<0.01
MC Dropout0.005 ±0.0020.51N.A.N.A.N.A.N.A.
SQR0.0052 ± 0.00121.44N.A.N.A.N.A.N.A.
", + "bbox": [ + 179, + 810, + 816, + 921 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "All results were evaluated on a held out test set that was not used for calibration or recalibration. Due to limited space, the full extent of the results and details of the models are left for Appendix A and Appendix B. To show the usefulness of the plot we introduced in Section 5, we focus on the results on the UCI dataset “naval-propulsion-plant” (Dheeru & Karra Taniskidou, 2017) in Table 1 and Section 6.2. ", + "bbox": [ + 174, + 103, + 825, + 172 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The models with consistent performance across UCI datasets in terms of calibration are Bayesian Ridge Regression, Conditional Gaussian, and Conditional Flow, with Conditional Flow often performing well in cases where Conditional Gaussian is unable to. Whereas these three models are well calibrated, the mean performance is much weaker for Bayesian Ridge Regression due to the limitations of linear functions. ", + "bbox": [ + 174, + 180, + 825, + 251 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "6.2 RECALIBRATION ", + "text_level": 1, + "bbox": [ + 176, + 290, + 331, + 304 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Of the models we tested, we recalibrated the Bayesian Ridge Regression, Conditional Gaussian, and Conditional Flow models. MC Dropout and SQR could also be recalibrated, though we chose not to as they lack closed form CDFs, meaning the technique would be approximate. In Table 1, we see the calibration errors after recalibrating with normalizing flows are comparable to those from isotonic regression. However, after isotonic regression is applied, only the calibration error can be computed. In contrast, we can still compute ordinary distribution statistics such as the mean after applying normalizing flows. Due to this property, we can even detect cases in which an improvement in calibration error coincides with a degradation of mean performance, suggesting if the goal were to only get point estimates of the mean, recalibration could be detrimental. For example, in Table 1 this was the case for Bayesian Ridge Regression. ", + "bbox": [ + 174, + 324, + 825, + 464 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In Figure 6a, whereas the calibration error metric shows the flow recalibrated model is well-calibrated averaged across the full dataset, we can see that see that, when bucketing by the predicted mean, the calibration error is significant. ", + "bbox": [ + 174, + 470, + 825, + 512 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To improve this, we recalibrate with a normalizing flow conditioned on the mean predicted by the original model. In this way, we see in Figure 6b that though the aggregate performance does not change, the performance is improved across different buckets. In essence we see that if we were analyzing the distribution across the dataset, we would be accurate; if we started to look closer to individual distributions, the performance is worse suggesting the quantiles of individual distributions cannot be trusted. ", + "bbox": [ + 174, + 520, + 825, + 603 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/5ba0a74e3b6aa56744216a122f89938ce61fa7461edf3b64016e47551252acc8.jpg", + "image_caption": [ + "Figure 6: Calibration Q-Q plots for recalibration with an unconditional flow and recalibration with a conditional flow on the dataset “naval-propulsion-plant”. The legend contains the calibration error for each curve. " + ], + "image_footnote": [], + "bbox": [ + 176, + 662, + 799, + 866 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/96799e60b702cd7228ab4ea95bae04d75bb639f63db7286ef906822c86a386ab.jpg", + "image_caption": [ + "Figure 7: Calibration Q-Q plots for recalibration with isotonic regression and recalibration with normalizing flows on the second time step on the dataset “electricity”. The legend contains the calibration error for each curve. " + ], + "image_footnote": [], + "bbox": [ + 176, + 121, + 799, + 323 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "6.3 TIME SERIES ", + "text_level": 1, + "bbox": [ + 174, + 424, + 305, + 438 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "For our time series example, we trained a model on the UCI Dataset “electricity”. We predict two time steps and show that even though we used an autoregressive model for calibration (the model could learn correlated distributions), there is still some correlation not captured that recalibration can help with. ", + "bbox": [ + 174, + 458, + 825, + 515 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Figure 7a shows that the calibration error of $F ( Y _ { 2 } | Y _ { 1 } )$ when recalibrated independently with isotonic regression is significant. Figure 7b shows that a flow trained jointly on the CDFs significantly reduces the errors. Although the calibration error of the marginal distribution for the second step is comparable between the two approaches, the conditional performance favors normalizing flows. A possible explanantion of the still imperfect calibration of the flow model, though better than isotonic regression, is distribution shift. ", + "bbox": [ + 173, + 521, + 825, + 604 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "7 CONCLUSION AND FUTURE WORK ", + "text_level": 1, + "bbox": [ + 174, + 648, + 495, + 665 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In this paper, we addressed the calibration issue in modern neural networks through using higher capacity distributions via normalizing flows. We showed that normalizing flows can not only help during calibration, but also in recalibrating miscalibrated distributions, even improving the fit in the underfitting case. Though isotonic regression also uses a two-step producedure, we reframe the problem as MLE through which we can trivially generalize recalibration to the multivariate case. Though isotonic regression could be extended such that we could compute the log likelihood implied by its change of variables, normalizing flows are a more natural way to handle this with more research backing this technique, and are easily extendable to conditional and joint distributions. Interestingly, though the Conditional Flow has all it needs to be well calibrated, recalibration helps the overall calibration which was similarly found for classification in Guo et al. (2017); it remains for future work to better understand why and when this is useful. ", + "bbox": [ + 173, + 693, + 825, + 847 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Further, we extend the plot introduced in Kuleshov et al. (2018) by showing the calibration error on different subsets of the data, for example bucketed by mean prediction. Though this plot is able to show the calibration error across buckets, for future work, we will explore ways to visually show any trends in the miscalibration as well as whether the misalignments of the quantiles are statistically significant. ", + "bbox": [ + 174, + 854, + 823, + 924 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 176, + 103, + 285, + 117 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Nicola De Cao, Wilker Aziz, and Ivan Titov. Block neural autoregressive flow. In Conference on Uncertainty in Artificial Intelligence, volume 3, pp. 1723–1735. UAI, 2019. URL http: //auai.org/uai2019/proceedings/papers/511.pdf. ", + "bbox": [ + 174, + 126, + 823, + 169 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ricky T. Q. Chen, Jens Behrmann, David K Duvenaud, and Joern-Henrik Jacobsen. Residual flows for invertible generative modeling. In H. Wallach, H. Larochelle, A. Beygelzimer, F. dAlch ´ e-´ Buc, E. Fox, and R. Garnett (eds.), Advances in Neural Information Processing Systems 32, pp. 9916–9926. Curran Associates, Inc., 2019. URL http://papers.nips.cc/paper/9183- residual-flows-for-invertible-generative-modeling.pdf. ", + "bbox": [ + 174, + 179, + 826, + 251 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Djork-Arne Clevert, Thomas Unterthiner, and Sepp Hochreiter. Fast and Accurate Deep Network ´ Learning by Exponential Linear Units (ELUs). arXiv e-prints, art. arXiv:1511.07289, November 2015. ", + "bbox": [ + 174, + 261, + 826, + 303 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Armen Der Kiureghian and Ove Ditlevsen. Aleatory or epistemic? does it matter? Structural safety, 31(2):105–112, 2009. ", + "bbox": [ + 173, + 313, + 825, + 342 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Dua Dheeru and Efi Karra Taniskidou. UCI machine learning repository, 2017. URL http: //archive.ics.uci.edu/ml. ", + "bbox": [ + 173, + 352, + 825, + 381 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Laurent Dinh, David Krueger, and Yoshua Bengio. NICE: Non-linear Independent Components Estimation. arXiv e-prints, art. arXiv:1410.8516, October 2014. ", + "bbox": [ + 173, + 390, + 823, + 420 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Laurent Dinh, Jascha Sohl-Dickstein, and Samy Bengio. Density estimation using Real NVP. arXiv e-prints, art. arXiv:1605.08803, May 2016. ", + "bbox": [ + 173, + 429, + 823, + 458 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Yarin Gal and Zoubin Ghahramani. Dropout as a bayesian approximation: Representing model uncertainty in deep learning. In Maria Florina Balcan and Kilian Q. Weinberger (eds.), Proceedings of The 33rd International Conference on Machine Learning, volume 48 of Proceedings of Machine Learning Research, pp. 1050–1059, New York, New York, USA, 20–22 Jun 2016. PMLR. URL http://proceedings.mlr.press/v48/gal16.html. ", + "bbox": [ + 174, + 468, + 825, + 539 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Achintya Gopal. Quasi-Autoregressive Residual (QuAR) Flows. arXiv e-prints, art. arXiv:2009.07419, September 2020. ", + "bbox": [ + 173, + 547, + 825, + 577 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Will Grathwohl, Ricky T. Q. Chen, Jesse Bettencourt, Ilya Sutskever, and David Duvenaud. FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Models. arXiv e-prints, art. arXiv:1810.01367, October 2018. ", + "bbox": [ + 174, + 587, + 826, + 630 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Chuan Guo, Geoff Pleiss, Yu Sun, and Kilian Q. Weinberger. On calibration of modern neural networks. In Doina Precup and Yee Whye Teh (eds.), Proceedings of the 34th International Conference on Machine Learning, volume 70 of Proceedings of Machine Learning Research, pp. 1321–1330, International Convention Centre, Sydney, Australia, 06–11 Aug 2017. PMLR. URL http://proceedings.mlr.press/v70/guo17a.html. ", + "bbox": [ + 174, + 640, + 825, + 710 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jonathan Ho, Xi Chen, Aravind Srinivas, Yan Duan, and Pieter Abbeel. Flow $^ { + + }$ : Improving flowbased generative models with variational dequantization and architecture design. In Kamalika Chaudhuri and Ruslan Salakhutdinov (eds.), Proceedings of the 36th International Conference on Machine Learning, volume 97 of Proceedings of Machine Learning Research, pp. 2722–2730, Long Beach, California, USA, 09–15 Jun 2019. PMLR. URL http://proceedings.mlr.press/ v97/ho19a.html. ", + "bbox": [ + 174, + 720, + 826, + 804 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Chin-Wei Huang, David Krueger, Alexandre Lacoste, and Aaron Courville. Neural autoregressive flows. In Jennifer Dy and Andreas Krause (eds.), Proceedings of the 35th International Conference on Machine Learning, volume 80 of Proceedings of Machine Learning Research, pp. 2078–2087, Stockholmsmssan, Stockholm Sweden, 10–15 Jul 2018. PMLR. URL http://proceedings.mlr.press/v80/huang18d.html. ", + "bbox": [ + 174, + 815, + 826, + 886 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, and Tie-Yan Liu. Lightgbm: A highly efficient gradient boosting decision tree. In ", + "bbox": [ + 178, + 895, + 823, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (eds.), Advances in Neural Information Processing Systems 30, pp. 3146–3154. Curran Associates, Inc., 2017. URL http://papers.nips.cc/paper/6907-lightgbm-ahighly-efficient-gradient-boosting-decision-tree.pdf. ", + "bbox": [ + 189, + 103, + 826, + 160 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Alex Kendall and Yarin Gal. What uncertainties do we need in bayesian deep learning for computer vision? In I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (eds.), Advances in Neural Information Processing Systems 30, pp. 5574–5584. Curran Associates, Inc., 2017. URL http://papers.nips.cc/paper/7141-what-uncertainties-do-we-needin-bayesian-deep-learning-for-computer-vision.pdf. ", + "bbox": [ + 174, + 167, + 826, + 252 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Durk P Kingma and Prafulla Dhariwal. Glow: Generative flow with invertible 1x1 convolutions. In S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett (eds.), Advances in Neural Information Processing Systems 31, pp. 10215–10224. Curran Associates, Inc., 2018. URL http://papers.nips.cc/paper/8224-glow-generative-flowwith-invertible-1x1-convolutions.pdf. ", + "bbox": [ + 174, + 260, + 826, + 330 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Durk P Kingma, Tim Salimans, Rafal Jozefowicz, Xi Chen, Ilya Sutskever, and Max Welling. Improved variational inference with inverse autoregressive flow. In D. D. Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett (eds.), Advances in Neural Information Processing Systems 29, pp. 4743–4751. Curran Associates, Inc., 2016. URL http://papers.nips.cc/paper/6581-improved-variationalinference-with-inverse-autoregressive-flow.pdf. ", + "bbox": [ + 173, + 338, + 826, + 422 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Volodymyr Kuleshov, Nathan Fenner, and Stefano Ermon. Accurate uncertainties for deep learning using calibrated regression. In Jennifer Dy and Andreas Krause (eds.), Proceedings of the 35th International Conference on Machine Learning, volume 80 of Proceedings of Machine Learning Research, pp. 2796–2804, Stockholmsmssan, Stockholm Sweden, 10–15 Jul 2018. PMLR. URL http://proceedings.mlr.press/v80/kuleshov18a.html. ", + "bbox": [ + 174, + 430, + 825, + 501 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Balaji Lakshminarayanan, Alexander Pritzel, and Charles Blundell. Simple and scalable predictive uncertainty estimation using deep ensembles. In I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (eds.), Advances in Neural Information Processing Systems 30, pp. 6402–6413. Curran Associates, Inc., 2017. URL http://papers.nips.cc/paper/7219-simple-and-scalablepredictive-uncertainty-estimation-using-deep-ensembles.pdf. ", + "bbox": [ + 173, + 508, + 826, + 593 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "David A Nix and Andreas S Weigend. Estimating the mean and variance of the target probability distribution. In Proceedings of 1994 ieee international conference on neural networks (ICNN’94), volume 1, pp. 55–60. IEEE, 1994. ", + "bbox": [ + 174, + 601, + 825, + 643 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "George Papamakarios, Theo Pavlakou, and Iain Murray. Masked autoregressive flow for density estimation. In I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (eds.), Advances in Neural Information Processing Systems 30, pp. 2338–2347. Curran Associates, Inc., 2017. URL http://papers.nips.cc/paper/6828-maskedautoregressive-flow-for-density-estimation.pdf. ", + "bbox": [ + 173, + 651, + 826, + 722 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Tim Pearce, Alexandra Brintrup, Mohamed Zaki, and Andy Neely. High-quality prediction intervals for deep learning: A distribution-free, ensembled approach. volume 80 of Proceedings of Machine Learning Research, pp. 4075–4084, Stockholmsmssan, Stockholm Sweden, 10–15 Jul 2018. PMLR. URL http://proceedings.mlr.press/v80/pearce18a.html. ", + "bbox": [ + 174, + 729, + 825, + 786 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Boris Polyak and Anatoli Juditsky. Acceleration of stochastic approximation by averaging. SIAM Journal on Control and Optimization, 30:838–855, 07 1992. doi: 10.1137/0330046. ", + "bbox": [ + 176, + 794, + 823, + 823 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Danilo Rezende and Shakir Mohamed. Variational inference with normalizing flows. In Francis Bach and David Blei (eds.), Proceedings of the 32nd International Conference on Machine Learning, volume 37 of Proceedings of Machine Learning Research, pp. 1530–1538, Lille, France, 07–09 Jul 2015. PMLR. URL http://proceedings.mlr.press/v37/rezende15.html. ", + "bbox": [ + 174, + 830, + 826, + 888 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Filipe Rodrigues and Francisco C. Pereira. Beyond expectation: Deep joint mean and quantile regression for spatio-temporal problems. arXiv e-prints, art. arXiv:1808.08798, August 2018. ", + "bbox": [ + 174, + 895, + 823, + 924 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "David Salinas, Valentin Flunkert, and Jan Gasthaus. DeepAR: Probabilistic Forecasting with Autoregressive Recurrent Networks. arXiv e-prints, art. arXiv:1704.04110, April 2017. ", + "bbox": [ + 171, + 103, + 825, + 132 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. Dropout: A simple way to prevent neural networks from overfitting. Journal of Machine Learning Research, 15(56):1929–1958, 2014. URL http://jmlr.org/papers/v15/ srivastava14a.html. ", + "bbox": [ + 174, + 141, + 826, + 196 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Natasa Tagasovska and David Lopez-Paz. Single-model uncertainties for deep learning. In Advances in Neural Information Processing Systems 32, pp. 6417–6428. Curran Associates, Inc., 2019. URL http://papers.nips.cc/paper/8870-single-modeluncertainties-for-deep-learning.pdf. ", + "bbox": [ + 174, + 207, + 826, + 263 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ichiro Takeuchi, Quoc V Le, Timothy D Sears, and Alexander J Smola. Nonparametric quantile estimation. Journal of Machine Learning Research, 7:1231–1264, 2006. ", + "bbox": [ + 171, + 271, + 825, + 301 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "James W Taylor. A quantile regression neural network approach to estimating the conditional density of multiperiod returns. Journal of Forecasting, 19:299–311, 2000. ", + "bbox": [ + 174, + 309, + 823, + 338 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Michael E Tipping. Sparse bayesian learning and the relevance vector machine. Journal of machine learning research, 1(Jun):211–244, 2001. ", + "bbox": [ + 173, + 347, + 825, + 376 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Rianne van den Berg, Leonard Hasenclever, Jakub M. Tomczak, and Max Welling. Sylvester Normalizing Flows for Variational Inference. arXiv e-prints, art. arXiv:1803.05649, March 2018. ", + "bbox": [ + 174, + 385, + 823, + 414 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ruofeng Wen, Kari Torkkola, Balakrishnan Narayanaswamy, and Dhruv Madeka. A Multi-Horizon Quantile Recurrent Forecaster. arXiv e-prints, art. arXiv:1711.11053, November 2017. ", + "bbox": [ + 173, + 422, + 825, + 452 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/c75db8aacd9d4a38c987062b87207c17d500f45fc7262577a8766d51b64af6c7.jpg", + "image_caption": [ + "Figure 8: In this figure, we show our conditional flow model. A neural network takes $X$ and outputs the scale and shift of an affine flow and a condition vector for QuAR Flows. The condition used in the QuAR Flow is the same for both $\\mathrm { Q u A R }$ Flows. After the first conditional affine flow, there are two QuAR Flows with unconditional affine flows placed in between these two and at the end. The Conditional Flow model is equivalent to a Conditional Gaussian if we removed the QuAR Flows. " + ], + "image_footnote": [], + "bbox": [ + 271, + 98, + 725, + 190 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "A MODEL TRAINING DETAILS ", + "text_level": 1, + "bbox": [ + 178, + 297, + 442, + 314 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "A.1 CALIBRATION ", + "text_level": 1, + "bbox": [ + 176, + 330, + 316, + 345 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We compare the performance of our model and multiple other popular approaches on 8 UCI datasets (Dheeru & Karra Taniskidou, 2017): boston-housing, concrete, energy, kin8nm, naval-propulsionplant, power-plant, wine-quality-red and yacht. The models we compared Conditional Flows to were: Conditional Gaussian (amortized inference with Gaussians, Lakshminarayanan et al. (2017)), Bayesian Ridge Regression (Tipping, 2001), MC Dropout (Gal & Ghahramani, 2016), Simultaneous Quantile Regression (SQR) (Tagasovska & Lopez-Paz, 2019), Conditional Quantile (SQR where we only learn prespecified quantiles), Quality Driven (Pearce et al., 2018), and a Gradient Boosted Decision Tree with LightGBM (Ke et al., 2017). ", + "bbox": [ + 173, + 357, + 825, + 469 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Figure 8 shows a representation of the Conditional Flow network we used. The QuAR Flows are conditioned on a 64-dimensional representation from the condition network. Each Conditional QuAR Flow has two hidden layers in the residual connection with a hidden size 64 with ELU (Clevert et al., 2015) as our activation. The condition network has a single hidden layer with size 64 and ReLU as our activation. The QuAR Flows are conditioned on the 64-dimensional representation from the condition network. ", + "bbox": [ + 173, + 476, + 825, + 560 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "For the other neural network approaches, we used networks with two hidden layers with size 128 and used ReLU as our nonlinearity. For hyperparameter tuning on all our neural networks, we searched the following grid: ", + "bbox": [ + 176, + 566, + 825, + 609 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "• Learning rate: 1e-2, 1e-3, 1e-4 \n• Weight decay: 0, 1e-3, 1e-2, 1e-1 \n• Dropout Rates: 0.1 0.25, 0.5 0.75 ", + "bbox": [ + 215, + 622, + 454, + 679 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "The hyperparameters we used were taken from Tagasovska & Lopez-Paz (2019). We trained each of our neural networks for 2000 epochs with batch size 128. ", + "bbox": [ + 171, + 693, + 825, + 722 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "For our LightGBM tree model (Ke et al., 2017), we used mean squared error as our loss to learn the mean of the output distribution. The grid of hyperparameters we searched was: ", + "bbox": [ + 169, + 728, + 823, + 757 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "• Number of Trees: 100, 1000 \n• Maximum Depths: 3, 5, 7, 9 \n• Learning Rates: 1e-1, 1e-2, 1e-3, 1e-4 \n• Minimum Child Samples: 1, 20 \n• Dropout Rates: 0.1 0.25, 0.5 0.75 ", + "bbox": [ + 215, + 770, + 485, + 867 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "To make the tree model distributional, assuming homoscedasticity, we computed the standard deviation of the predicted normal distribution by computing the standard deviation of the residuals (observations minus predictions). ", + "bbox": [ + 176, + 882, + 825, + 924 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "For SQR and MC Dropout, we computed the estimated mean and CDF from 1000 samples. For Conditional Flows, we computed the estimated mean by using the Gauss-Legendre quadrature with 100 points to approximate the integral. ", + "bbox": [ + 174, + 103, + 825, + 146 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "A.2 RECALIBRATION ", + "text_level": 1, + "bbox": [ + 176, + 167, + 334, + 183 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "For recalibration, we trained the recalibration model on the validation set of each of the 20 seeds. For the flow architecture, we stacked 8 QuAR Flows with affine flows in between each one as well as at the beginning and end. Since the input to the flow is a $\\mathrm { C D F } \\in [ 0 , 1 ]$ , we also transform the data with a Logit Function as the first layer of the flow and account for the change of variables in the loss. In addition to this, we used a dropout rate of 0.25, two hidden layers with size 64 in each residual connection, and used Polyak averaging (Polyak & Juditsky, 1992) with a decay of 0.999 for evaluation. ", + "bbox": [ + 174, + 195, + 826, + 294 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "A.3 TIME SERIES ", + "text_level": 1, + "bbox": [ + 176, + 315, + 310, + 330 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "For our time series experiments, we tested the performance of flow recalibration on the UCI dataset “electricity”. We filtered the data down to observations after 2014-01-01. We split the data by date, where the first $72 \\%$ of dates are in the train set, the next $18 \\%$ are in validation set, and the last $10 \\%$ are in the test set. ", + "bbox": [ + 174, + 343, + 825, + 398 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The data is given in 15 minute increments, and so similarly to Deep AR (Salinas et al., 2017), we averaged the values per hour to have hourly data. Since we were trying to analyze the effect of correlated targets, we predicted two time steps conditioned on 48 hours of data using an autoregressive model. ", + "bbox": [ + 174, + 406, + 825, + 462 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We included three numeric covariates: the time step within the sampled time series, the hour of the day, and the day of the week. Each of the covariates were normalized to have zero mean and one standard deviation. In addition to this, since there are 370 different types of time series, we also added an embedding layer from 370 to an embedding dimension of 20, same as that used in Deep AR (Salinas et al., 2017). We concatenated this vector with the observations and covariates, leading to a 27-dimensional vector. ", + "bbox": [ + 174, + 469, + 825, + 553 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Since all the observations are positive, we model the target with a conditional Gamma distribution (i.e. amortized inference with Gamma distributiet al., 2017), we normalized each time series $\\{ z _ { i , t } \\} _ { t = 0 } ^ { T - 1 }$ of by $\\begin{array} { r } { v _ { i } = 1 + 1 / T \\sum _ { t = 0 } ^ { T - 1 } z _ { i , t } . } \\end{array}$ eep AR (Salinas. We account for the scaling in the output distribution, i.e. Gamma $( k , \\theta * v _ { i } )$ . ", + "bbox": [ + 174, + 559, + 825, + 619 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The model we used was a 1 layer LSTM, and then two linear layers with a ReLU and Dropout (Srivastava et al., 2014) in between were applied to the hidden representation. We set the dropout rate to 0.5 and used a hidden size of 48 everywhere. For evaluation, we used Polyak averaging (Polyak & Juditsky, 1992) with a decay of 0.999. ", + "bbox": [ + 174, + 625, + 825, + 681 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "For recalibration with flows, we trained on the CDFs for both time steps with a flow with the same architecture as that used in Appendix A.2. ", + "bbox": [ + 174, + 688, + 823, + 717 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "B EXPERIMENTAL RESULTS ", + "text_level": 1, + "bbox": [ + 176, + 742, + 421, + 758 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "B.1 CALIBRATION ", + "text_level": 1, + "bbox": [ + 176, + 776, + 316, + 791 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In Table 2, we compare Conditional Flows against multiple other approaches for estimating uncertainty, and we measure performance using Prediction Interval Coverage Probability (PICP), Mean Squared Error (MSE), and Calibration Error. ", + "bbox": [ + 176, + 805, + 823, + 847 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "For each model, we trained the model on 20 different seeds where each seed randomly splits the data in $72 \\%$ train, $18 \\%$ validation, and $10 \\%$ test. We picked the best hyperparameter by choosing the hyperparameters that gave the best average validation loss across the 20 seeds where the loss used is the loss defined by the training procedure for the model, e.g. for Conditional Gaussian, we used log likelihood; for LightGBM, we used MSE; for QualityDriven, we used the Quality Driven Loss, etc. ", + "bbox": [ + 176, + 853, + 823, + 924 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/ee857c7ba0f01bf9efb745de65bc42756ed607cf38e79d06640bf392e208a62a.jpg", + "table_caption": [ + "Table 2: Results on percentage of data captured from 0.025 to 0.975 quantiles (PICP), MSE, and calibration error with 100 buckets. The results are from minimizing the average validation loss across 20 seeds. The optimal value of PICP is 0.95, and the optimal value for MSE and Calib is 0.00. " + ], + "table_footnote": [], + "table_body": "
bostonHousingconcrete
PICPMSECalibPICPMSECalib
ConditionalFlow0.93 ± 0.040.13 ± 0.060.060.92 ± 0.030.09 ±0.030.01
ConditionalGaussian0.93 ± 0.030.14±0.070.130.91 ± 0.020.09 ±0.030.06
BayesianRidgeRegression0.95 ± 0.030.28±0.080.340.95 ± 0.030.40±0.070.01
MC Dropout0.50 ± 0.080.11 ± 0.052.990.69 ± 0.050.07±0.030.89
SQR0.73 ± 0.080.11 ± 0.050.480.74± 0.040.07± 0.030.47
ConditionalQuantile0.92 ± 0.05N.A.N.A.0.93 ± 0.03N.A.N.A.
QualityDriven0.83 ± 0.06N.A.N.A.0.83± 0.04N.A.N.A.
LightGBM0.04±0.030.12 ± 0.067.740.63±0.070.07±0.021.25
energykin8nm
PICPMSECalibPICPMSECalib
ConditionalFlow0.96 ± 0.020.0022 ± 0.00060.120.952 ± 0.0060.081 ± 0.0130.01
ConditionalGaussian0.97 ± 0.030.0030± 0.00090.260.947 ± 0.0070.071 ± 0.005<0.01
BayesianRidgeRegression0.89 ± 0.040.09 ±0.020.240.951 ± 0.0070.59 ± 0.020.09
MC Dropout0.97± 0.020.0026 ± 0.00100.170.69 ± 0.020.069 ± 0.0051.14
SQR0.97± 0.020.0028 ± 0.00120.370.892 ± 0.0100.072 ± 0.0050.01
ConditionalQuantile0.98 ±0.02N.A.N.A.0.943 ± 0.011N.A.N.A.
QualityDriven0.96 ± 0.04N.A.N.A.0.88±0.02N.A.N.A.
LightGBM0.24±0.050.0013 ± 0.00065.180.205 ± 0.0100.190 ± 0.0115.59
naval-propulsion-plantpower-plant
PICPMSECalibPICPMSECalib
ConditionalFlow0.98 ± 0.030.009 ±0.0040.450.952 ± 0.0070.048 ±0.0070.01
ConditionalGaussian0.9995 ± 0.00070.012 ± 0.0062.350.947 ± 0.0100.048 ±0.006<0.01
BayesianRidgeRegression1.0 ±0.00.055 ± 0.0048.030.964 ± 0.0070.072 ± 0.0070.01
MC Dropout0.98 ±0.020.005±0.0020.510.59 ±0.020.046±0.0071.88
SQR0.998 ± 0.0020.0052 ± 0.00121.440.93 ± 0.020.048 ±0.0070.02
ConditionalQuantile0.97±0.02N.A.N.A.0.937 ± 0.014N.A.N.A.
QualityDriven0.949 ± 0.010N.A.N.A.0.89 ±0.02N.A.N.A.
LightGBM0.714 ± 0.0110.0056 ± 0.00090.790.17 ± 0.020.035 ± 0.0075.95
wine-quality-redyacht
PICPMSECalibPICPMSECalib
ConditionalFlow0.90 ±0.020.6±0.20.040.95 ± 0.040.004±0.0030.27
ConditionalGaussian0.95 ± 0.020.59 ± 0.090.220.99 ±0.020.004±0.0020.62
BayesianRidgeRegression0.95 ± 0.020.63 ± 0.110.050.94± 0.030.35 ± 0.100.25
MC Dropout0.35 ± 0.040.57 ±0.094.010.97 ± 0.040.004±0.0020.21
SQR0.81±0.090.59 ±0.100.150.96 ±0.040.004±0.0040.49
ConditionalQuantile0.95 ± 0.02N.A.N.A.0.99 ± 0.02N.A.N.A.
QualityDriven0.84 ±0.03N.A.N.A.0.97 ± 0.04N.A.N.A.
LightGBM0.40 ± 0.050.55± 0.102.930.45 ± 0.080.003±0.0033.04
", + "bbox": [ + 129, + 233, + 875, + 837 + ], + "page_idx": 14 + }, + { + "type": "table", + "img_path": "images/d978e71823dd45f48ecdfeb91085639f8de04ae9198cc4086ae3aa1241745175.jpg", + "table_caption": [ + "Table 3: Calibration error (with 100 buckets) before and after recalibration. " + ], + "table_footnote": [], + "table_body": "
BayesianRidgeRegressionConditionalGaussianConditionalFlow
BeforeFlowIsoBeforeFlowIsoBeforeFlowIso
bostonHousing0.340.020.020.130.040.020.060.020.01
concrete0.010.010.010.060.020.020.010.020.03
energy0.240.020.010.26<0.010.010.120.010.01
kin8nm0.090.01<0.01<0.01<0.01<0.010.01<0.01<0.01
naval-propulsion-plant8.030.01<0.012.35<0.01<0.010.45<0.01<0.01
power-plant0.01<0.01<0.01<0.01<0.01<0.010.01<0.01<0.01
wine-quality-red0.050.02<0.010.220.040.020.040.010.01
yacht0.250.050.070.620.030.030.270.020.03
", + "bbox": [ + 142, + 126, + 851, + 275 + ], + "page_idx": 15 + }, + { + "type": "table", + "img_path": "images/0fc0d10d28bfe001a56686f5c0b27f829ffc23a2fccbd3c80e31c43e5c515719.jpg", + "table_caption": [ + "Table 4: MSE performance before and after recalibration. We do not show the MSE for isotonic regression as the mean cannot be computed after recalibrating with isotonic regression. " + ], + "table_footnote": [], + "table_body": "
BayesianRidgeRegressionConditionalGaussian
BeforeFlowBeforeFlow
bostonHousing0.28 ±0.080.28 ±0.080.14 ± 0.070.14 ± 0.07
concrete0.40 ± 0.070.40 ± 0.070.09 ±0.030.09 ± 0.03
energy0.09 ±0.020.09 ±0.020.0030 ±0.00090.0032 ± 0.0011
kin8nm0.59 ± 0.020.59 ± 0.020.071 ± 0.0050.072 ± 0.005
naval-propulsion-plant0.055 ± 0.0040.48 ±0.020.012 ± 0.0060.012 ± 0.007
power-plant0.072 ± 0.0070.072 ± 0.0070.048 ± 0.0060.049 ± 0.006
wine-quality-red0.63 ± 0.110.63 ± 0.110.59 ± 0.090.59 ± 0.10
yacht0.35 ± 0.100.36 ± 0.100.004 ±0.0020.004 ± 0.003
ConditionalFlow
BeforeFlow
bostonHousing0.13 ± 0.06
concrete0.09 ± 0.030.13 ± 0.06 0.09 ± 0.03
0.0022 ± 0.00060.0027 ± 0.0007
energy kin8nm0.081 ± 0.0130.081 ± 0.013
naval-propulsion-plant0.009 ± 0.0040.016 ± 0.012
power-plant0.048 ± 0.0070.048 ± 0.007
wine-quality-red0.6± 0.20.64 ± 0.15
yacht
0.004 ± 0.0030.008 ± 0.012
", + "bbox": [ + 173, + 328, + 830, + 650 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Reported in Table 2 are the mean and standard deviation of PICP and MSE across the 20 seeds. Due to the limited data, for calibration error with 100 bins, we computed it over the CDFs from all 20 seeds. We included PICP (the percentage of true observations between the quantiles 0.025 and 0.975) to compare against alternative approaches where we prespecify which quantiles we need. ", + "bbox": [ + 173, + 674, + 826, + 731 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "B.2 RECALIBRATION ", + "text_level": 1, + "bbox": [ + 174, + 747, + 334, + 762 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "From the above section, we recalibrate the best Bayesian Ridge Regression, Conditional Gaussian, and Conditional Flow. In Table 3, we compare the calibration error before recalibration, after recalibration with isotonic regression, and after recalibration with normalizing flows. ", + "bbox": [ + 174, + 773, + 826, + 815 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "As we can see, across all 8 UCI datasets, the calibration errors after recalibrating with normalizing flows are comparable to those from isotonic regression. More interestingly though, improvement in calibration error can be detrimental to mean performance. ", + "bbox": [ + 174, + 821, + 825, + 864 + ], + "page_idx": 15 + } +] \ No newline at end of file diff --git a/parse/train/H8VDvtm1ij8/H8VDvtm1ij8_middle.json b/parse/train/H8VDvtm1ij8/H8VDvtm1ij8_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..003562bc626ab57b32445e8d627ae4f51bb8f4df --- /dev/null +++ b/parse/train/H8VDvtm1ij8/H8VDvtm1ij8_middle.json @@ -0,0 +1,35878 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 79, + 506, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 77, + 509, + 98 + ], + "spans": [ + { + "bbox": [ + 105, + 77, + 509, + 98 + ], + "score": 1.0, + "content": "NORMALIZING FLOWS FOR CALIBRATION AND RE-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 100, + 211, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 100, + 211, + 117 + ], + "score": 1.0, + "content": "CALIBRATION", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 112, + 136, + 244, + 157 + ], + "lines": [ + { + "bbox": [ + 113, + 136, + 201, + 147 + ], + "spans": [ + { + "bbox": [ + 113, + 136, + 201, + 147 + ], + "score": 1.0, + "content": "Anonymous authors", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 112, + 146, + 245, + 159 + ], + "spans": [ + { + "bbox": [ + 112, + 146, + 245, + 159 + ], + "score": 1.0, + "content": "Paper under double-blind review", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 278, + 187, + 333, + 199 + ], + "lines": [ + { + "bbox": [ + 276, + 186, + 335, + 200 + ], + "spans": [ + { + "bbox": [ + 276, + 186, + 335, + 200 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 143, + 222, + 469, + 364 + ], + "lines": [ + { + "bbox": [ + 141, + 221, + 469, + 235 + ], + "spans": [ + { + "bbox": [ + 141, + 221, + 469, + 235 + ], + "score": 1.0, + "content": "In machine learning, due to model misspecification and overfitting, estimates", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 142, + 234, + 469, + 245 + ], + "spans": [ + { + "bbox": [ + 142, + 234, + 469, + 245 + ], + "score": 1.0, + "content": "of the aleatoric uncertainty are often inaccurate. One approach to fix this is", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 244, + 469, + 255 + ], + "spans": [ + { + "bbox": [ + 141, + 244, + 469, + 255 + ], + "score": 1.0, + "content": "isotonic regression, in which a monotonic function is fit on a validation set to", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 255, + 470, + 266 + ], + "spans": [ + { + "bbox": [ + 141, + 255, + 470, + 266 + ], + "score": 1.0, + "content": "map the model’s CDF to an optimally calibrated CDF. However, this makes it", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 265, + 469, + 278 + ], + "spans": [ + { + "bbox": [ + 141, + 265, + 469, + 278 + ], + "score": 1.0, + "content": "infeasible to compute additional statistics of interest on the model distribution", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 277, + 470, + 288 + ], + "spans": [ + { + "bbox": [ + 141, + 277, + 470, + 288 + ], + "score": 1.0, + "content": "(such as the mean). In this paper, through a reframing of recalibration as MLE,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 288, + 469, + 299 + ], + "spans": [ + { + "bbox": [ + 141, + 288, + 469, + 299 + ], + "score": 1.0, + "content": "we replace isotonic regression with normalizing flows. This allows us to retain", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 299, + 469, + 311 + ], + "spans": [ + { + "bbox": [ + 141, + 299, + 469, + 311 + ], + "score": 1.0, + "content": "the ability to compute the statistical properties of the model (such as closed-form", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 309, + 469, + 322 + ], + "spans": [ + { + "bbox": [ + 141, + 309, + 469, + 322 + ], + "score": 1.0, + "content": "likelihoods, mean, correlation, etc.) and provides an opportunity for additional", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 321, + 469, + 332 + ], + "spans": [ + { + "bbox": [ + 141, + 321, + 469, + 332 + ], + "score": 1.0, + "content": "capacity at the cost of possible overfitting. Most importantly, the fundamental", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 332, + 469, + 343 + ], + "spans": [ + { + "bbox": [ + 141, + 332, + 469, + 343 + ], + "score": 1.0, + "content": "properties of normalizing flows allow us to generalize recalibration to conditional", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 342, + 469, + 355 + ], + "spans": [ + { + "bbox": [ + 141, + 342, + 469, + 355 + ], + "score": 1.0, + "content": "and multivariate distributions. To aid in detecting miscalibration and measuring", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 353, + 454, + 366 + ], + "spans": [ + { + "bbox": [ + 141, + 353, + 454, + 366 + ], + "score": 1.0, + "content": "our success at fixing it, we use a simple extension of the calibration Q-Q plot.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 11 + }, + { + "type": "title", + "bbox": [ + 108, + 411, + 205, + 424 + ], + "lines": [ + { + "bbox": [ + 105, + 410, + 208, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 208, + 426 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 445, + 505, + 566 + ], + "lines": [ + { + "bbox": [ + 105, + 446, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 505, + 459 + ], + "score": 1.0, + "content": "Recent advances in deep learning have led to models with significantly higher overall accuracy on", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 457, + 506, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 506, + 469 + ], + "score": 1.0, + "content": "both classification and regression tasks compared to what was achievable in the past. However,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "score": 1.0, + "content": "an important component in conjunction with accuracy is a model’s ability to accurately assess the", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 479, + 506, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 506, + 491 + ], + "score": 1.0, + "content": "uncertainty in its prediction. Most taxonomies classify uncertainty into three sources: approximation,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 488, + 505, + 503 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 505, + 503 + ], + "score": 1.0, + "content": "aleatoric, and epistemic uncertainty (Der Kiureghian & Ditlevsen, 2009). Approximation uncertainty", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 500, + 506, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 506, + 514 + ], + "score": 1.0, + "content": "quantifies the error from fitting a simple model to complex data. Aleatoric uncertainty quantifies", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "score": 1.0, + "content": "the uncertainty of the conditional distribution of the target variable given features. This uncertainty", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 521, + 506, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 521, + 506, + 536 + ], + "score": 1.0, + "content": "arises from hidden variables or measurement errors and cannot be reduced through collecting more", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 532, + 506, + 547 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 506, + 547 + ], + "score": 1.0, + "content": "data under the same experimental conditions. Epistemic uncertainty quantifies the uncertainty arising", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 543, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 505, + 558 + ], + "score": 1.0, + "content": "from fitting a model utilizing finite data, i.e. it is inversely proportional to the density of the training", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 556, + 406, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 406, + 568 + ], + "score": 1.0, + "content": "examples and can be reduced by collecting data in the low density regions.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 572, + 505, + 660 + ], + "lines": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "These different sources of uncertainty have different techniques for handling them. Using high", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 583, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 596 + ], + "score": 1.0, + "content": "capacity models such as neural networks removes a large part of the approximation uncertainty. By", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "fitting a full distribution on the target conditional on features, we can model the aleatoric uncertainty", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "score": 1.0, + "content": "from observations. Inaccurate estimates of aleatoric uncertainty can be explained by underfitting", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 615, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 630 + ], + "score": 1.0, + "content": "(insufficient complexity in the conditional distributions) or overfitting (models with sufficient capacity", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 626, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 505, + 640 + ], + "score": 1.0, + "content": "can memorize the data, leading to the distributions collapsing to deltas). Though epistemic uncertainty", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 637, + 505, + 652 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 505, + 652 + ], + "score": 1.0, + "content": "is important for the model to answer what it does not know, the focus of this paper is on improving", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 648, + 257, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 257, + 662 + ], + "score": 1.0, + "content": "estimates of the aleatoric uncertainty.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 107, + 666, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 106, + 665, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 665, + 506, + 678 + ], + "score": 1.0, + "content": "Our approach in this paper is to handle both model fit and calibration using normalizing flows.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "Normalizing flows can be used in conjunction with amortized inference to improve the flexibility", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 688, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 699 + ], + "score": 1.0, + "content": "of the output distribution, and further, through a reframing of recalibration as maximum likelihood", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "estimation (MLE), normalizing flows can be used to handle any miscalibration found on a validation", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "set. Further, we use a simple extension of the calibration plot from Kuleshov et al. (2018) to help", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 720, + 448, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 448, + 733 + ], + "score": 1.0, + "content": "with the the analysis of the calibration of a model across different regions of the data.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 40.5 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 308, + 761 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 308, + 761 + ], + "score": 1.0, + "content": "1", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 79, + 506, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 77, + 509, + 98 + ], + "spans": [ + { + "bbox": [ + 105, + 77, + 509, + 98 + ], + "score": 1.0, + "content": "NORMALIZING FLOWS FOR CALIBRATION AND RE-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 100, + 211, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 100, + 211, + 117 + ], + "score": 1.0, + "content": "CALIBRATION", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 112, + 136, + 244, + 157 + ], + "lines": [ + { + "bbox": [ + 113, + 136, + 201, + 147 + ], + "spans": [ + { + "bbox": [ + 113, + 136, + 201, + 147 + ], + "score": 1.0, + "content": "Anonymous authors", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 112, + 146, + 245, + 159 + ], + "spans": [ + { + "bbox": [ + 112, + 146, + 245, + 159 + ], + "score": 1.0, + "content": "Paper under double-blind review", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 112, + 136, + 245, + 159 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 187, + 333, + 199 + ], + "lines": [ + { + "bbox": [ + 276, + 186, + 335, + 200 + ], + "spans": [ + { + "bbox": [ + 276, + 186, + 335, + 200 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 143, + 222, + 469, + 364 + ], + "lines": [ + { + "bbox": [ + 141, + 221, + 469, + 235 + ], + "spans": [ + { + "bbox": [ + 141, + 221, + 469, + 235 + ], + "score": 1.0, + "content": "In machine learning, due to model misspecification and overfitting, estimates", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 142, + 234, + 469, + 245 + ], + "spans": [ + { + "bbox": [ + 142, + 234, + 469, + 245 + ], + "score": 1.0, + "content": "of the aleatoric uncertainty are often inaccurate. One approach to fix this is", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 244, + 469, + 255 + ], + "spans": [ + { + "bbox": [ + 141, + 244, + 469, + 255 + ], + "score": 1.0, + "content": "isotonic regression, in which a monotonic function is fit on a validation set to", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 255, + 470, + 266 + ], + "spans": [ + { + "bbox": [ + 141, + 255, + 470, + 266 + ], + "score": 1.0, + "content": "map the model’s CDF to an optimally calibrated CDF. However, this makes it", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 265, + 469, + 278 + ], + "spans": [ + { + "bbox": [ + 141, + 265, + 469, + 278 + ], + "score": 1.0, + "content": "infeasible to compute additional statistics of interest on the model distribution", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 277, + 470, + 288 + ], + "spans": [ + { + "bbox": [ + 141, + 277, + 470, + 288 + ], + "score": 1.0, + "content": "(such as the mean). In this paper, through a reframing of recalibration as MLE,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 288, + 469, + 299 + ], + "spans": [ + { + "bbox": [ + 141, + 288, + 469, + 299 + ], + "score": 1.0, + "content": "we replace isotonic regression with normalizing flows. This allows us to retain", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 299, + 469, + 311 + ], + "spans": [ + { + "bbox": [ + 141, + 299, + 469, + 311 + ], + "score": 1.0, + "content": "the ability to compute the statistical properties of the model (such as closed-form", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 309, + 469, + 322 + ], + "spans": [ + { + "bbox": [ + 141, + 309, + 469, + 322 + ], + "score": 1.0, + "content": "likelihoods, mean, correlation, etc.) and provides an opportunity for additional", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 321, + 469, + 332 + ], + "spans": [ + { + "bbox": [ + 141, + 321, + 469, + 332 + ], + "score": 1.0, + "content": "capacity at the cost of possible overfitting. Most importantly, the fundamental", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 332, + 469, + 343 + ], + "spans": [ + { + "bbox": [ + 141, + 332, + 469, + 343 + ], + "score": 1.0, + "content": "properties of normalizing flows allow us to generalize recalibration to conditional", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 342, + 469, + 355 + ], + "spans": [ + { + "bbox": [ + 141, + 342, + 469, + 355 + ], + "score": 1.0, + "content": "and multivariate distributions. To aid in detecting miscalibration and measuring", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 353, + 454, + 366 + ], + "spans": [ + { + "bbox": [ + 141, + 353, + 454, + 366 + ], + "score": 1.0, + "content": "our success at fixing it, we use a simple extension of the calibration Q-Q plot.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 11, + "bbox_fs": [ + 141, + 221, + 470, + 366 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 411, + 205, + 424 + ], + "lines": [ + { + "bbox": [ + 105, + 410, + 208, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 208, + 426 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 445, + 505, + 566 + ], + "lines": [ + { + "bbox": [ + 105, + 446, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 505, + 459 + ], + "score": 1.0, + "content": "Recent advances in deep learning have led to models with significantly higher overall accuracy on", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 457, + 506, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 506, + 469 + ], + "score": 1.0, + "content": "both classification and regression tasks compared to what was achievable in the past. However,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "score": 1.0, + "content": "an important component in conjunction with accuracy is a model’s ability to accurately assess the", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 479, + 506, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 506, + 491 + ], + "score": 1.0, + "content": "uncertainty in its prediction. Most taxonomies classify uncertainty into three sources: approximation,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 488, + 505, + 503 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 505, + 503 + ], + "score": 1.0, + "content": "aleatoric, and epistemic uncertainty (Der Kiureghian & Ditlevsen, 2009). Approximation uncertainty", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 500, + 506, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 506, + 514 + ], + "score": 1.0, + "content": "quantifies the error from fitting a simple model to complex data. Aleatoric uncertainty quantifies", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "score": 1.0, + "content": "the uncertainty of the conditional distribution of the target variable given features. This uncertainty", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 521, + 506, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 521, + 506, + 536 + ], + "score": 1.0, + "content": "arises from hidden variables or measurement errors and cannot be reduced through collecting more", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 532, + 506, + 547 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 506, + 547 + ], + "score": 1.0, + "content": "data under the same experimental conditions. Epistemic uncertainty quantifies the uncertainty arising", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 543, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 505, + 558 + ], + "score": 1.0, + "content": "from fitting a model utilizing finite data, i.e. it is inversely proportional to the density of the training", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 556, + 406, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 406, + 568 + ], + "score": 1.0, + "content": "examples and can be reduced by collecting data in the low density regions.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 446, + 506, + 568 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 572, + 505, + 660 + ], + "lines": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "These different sources of uncertainty have different techniques for handling them. Using high", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 583, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 596 + ], + "score": 1.0, + "content": "capacity models such as neural networks removes a large part of the approximation uncertainty. By", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "fitting a full distribution on the target conditional on features, we can model the aleatoric uncertainty", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "score": 1.0, + "content": "from observations. Inaccurate estimates of aleatoric uncertainty can be explained by underfitting", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 615, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 630 + ], + "score": 1.0, + "content": "(insufficient complexity in the conditional distributions) or overfitting (models with sufficient capacity", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 626, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 505, + 640 + ], + "score": 1.0, + "content": "can memorize the data, leading to the distributions collapsing to deltas). Though epistemic uncertainty", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 637, + 505, + 652 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 505, + 652 + ], + "score": 1.0, + "content": "is important for the model to answer what it does not know, the focus of this paper is on improving", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 648, + 257, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 257, + 662 + ], + "score": 1.0, + "content": "estimates of the aleatoric uncertainty.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 572, + 506, + 662 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 666, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 106, + 665, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 665, + 506, + 678 + ], + "score": 1.0, + "content": "Our approach in this paper is to handle both model fit and calibration using normalizing flows.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "Normalizing flows can be used in conjunction with amortized inference to improve the flexibility", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 688, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 699 + ], + "score": 1.0, + "content": "of the output distribution, and further, through a reframing of recalibration as maximum likelihood", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "estimation (MLE), normalizing flows can be used to handle any miscalibration found on a validation", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "set. Further, we use a simple extension of the calibration plot from Kuleshov et al. (2018) to help", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 720, + 448, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 448, + 733 + ], + "score": 1.0, + "content": "with the the analysis of the calibration of a model across different regions of the data.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 40.5, + "bbox_fs": [ + 105, + 665, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 211, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 213, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 213, + 96 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 105, + 505, + 161 + ], + "lines": [ + { + "bbox": [ + 106, + 105, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 506, + 117 + ], + "score": 1.0, + "content": "One method for handling aleatoric uncertainty is amortized inference with Gaussians (Lakshmi-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 116, + 506, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 116, + 506, + 129 + ], + "score": 1.0, + "content": "narayanan et al., 2017; Nix & Weigend, 1994; Kendall & Gal, 2017) where a model, such as a", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 128, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 505, + 140 + ], + "score": 1.0, + "content": "neural network, maps from features to the parameters of a Gaussian. This approach models aleatoric", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 138, + 505, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 505, + 151 + ], + "score": 1.0, + "content": "uncertainty directly but suffers from approximation uncertainty as a Gaussian cannot model complex", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 150, + 138, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 138, + 163 + ], + "score": 1.0, + "content": "targets.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 166, + 505, + 221 + ], + "lines": [ + { + "bbox": [ + 105, + 166, + 505, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 166, + 505, + 179 + ], + "score": 1.0, + "content": "Another approach is Bayesian methods such as Bayesian Ridge Regression (Tipping, 2001) and", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 177, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 106, + 177, + 505, + 189 + ], + "score": 1.0, + "content": "MC Dropout (Gal & Ghahramani, 2016). Similar to amortized inference with Gaussians, the output", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 187, + 505, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 201 + ], + "score": 1.0, + "content": "distribution limits the capacity of the model. Full Bayesian techniques with neural networks are often", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 199, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 505, + 212 + ], + "score": 1.0, + "content": "too computationally expensive in practice, and approximate methods often fail to capture the full", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 210, + 360, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 360, + 223 + ], + "score": 1.0, + "content": "complexity of the uncertainty (Lakshminarayanan et al., 2017).", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 106, + 226, + 505, + 304 + ], + "lines": [ + { + "bbox": [ + 105, + 226, + 506, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 506, + 240 + ], + "score": 1.0, + "content": "Another family of methods uses quantile regression with non-linear techniques such as decision trees", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 238, + 506, + 251 + ], + "spans": [ + { + "bbox": [ + 105, + 238, + 506, + 251 + ], + "score": 1.0, + "content": "or neural networks. Some of these methods require a predefined set of quantiles (Takeuchi et al.,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 249, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 249, + 505, + 261 + ], + "score": 1.0, + "content": "2006; Wen et al., 2017; Rodrigues & Pereira, 2018; Taylor, 2000). Simultaneous Quantile Regression", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 260, + 506, + 272 + ], + "spans": [ + { + "bbox": [ + 106, + 260, + 506, + 272 + ], + "score": 1.0, + "content": "(SQR, Tagasovska & Lopez-Paz (2019)) trains one model on all quantiles and is able to learn complex", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 270, + 506, + 283 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 506, + 283 + ], + "score": 1.0, + "content": "shaped distributions. However the training procedure requires the model to learn to be monotonic", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 281, + 506, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 506, + 294 + ], + "score": 1.0, + "content": "instead of being constrained to be so and is not trivial to extend to multidimensional outputs. Pearce", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 293, + 470, + 306 + ], + "spans": [ + { + "bbox": [ + 106, + 293, + 470, + 306 + ], + "score": 1.0, + "content": "et al. (2018) learns a finite set of quantiles by using quality metrics for predictive intervals.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 309, + 506, + 365 + ], + "lines": [ + { + "bbox": [ + 105, + 307, + 507, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 507, + 324 + ], + "score": 1.0, + "content": "Normalizing flows have been used in the contexts of variational inference and generative modeling.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 320, + 506, + 334 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 506, + 334 + ], + "score": 1.0, + "content": "The approaches to normalizing flows can be categorized into autoregressive methods (Kingma et al.,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 330, + 507, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 507, + 345 + ], + "score": 1.0, + "content": "2016; Papamakarios et al., 2017; Huang et al., 2018; Cao et al., 2019), coupling layers (Dinh et al.,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 341, + 506, + 355 + ], + "spans": [ + { + "bbox": [ + 105, + 341, + 506, + 355 + ], + "score": 1.0, + "content": "2014; 2016; Kingma & Dhariwal, 2018; Ho et al., 2019), residual networks (Rezende & Mohamed,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 353, + 479, + 366 + ], + "spans": [ + { + "bbox": [ + 106, + 353, + 479, + 366 + ], + "score": 1.0, + "content": "2015; van den Berg et al., 2018; Gopal, 2020) and continuous flows (Grathwohl et al., 2018).", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20 + }, + { + "type": "title", + "bbox": [ + 108, + 380, + 200, + 393 + ], + "lines": [ + { + "bbox": [ + 104, + 379, + 201, + 396 + ], + "spans": [ + { + "bbox": [ + 104, + 379, + 201, + 396 + ], + "score": 1.0, + "content": "3 BACKGROUND", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "title", + "bbox": [ + 108, + 404, + 203, + 416 + ], + "lines": [ + { + "bbox": [ + 106, + 404, + 204, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 404, + 204, + 417 + ], + "score": 1.0, + "content": "3.1 RECALIBRATION", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 425, + 505, + 469 + ], + "lines": [ + { + "bbox": [ + 105, + 425, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 505, + 437 + ], + "score": 1.0, + "content": "An important goal in modeling is to have well-calibrated distributions as this allows users of the model", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 436, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 436, + 505, + 448 + ], + "score": 1.0, + "content": "to understand the confidence the model places on its prediction. In other words, with a well-calibrated", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 447, + 505, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 505, + 460 + ], + "score": 1.0, + "content": "model, we can better ascertain the uncertainty in the model’s predictions and respond differently to", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 459, + 370, + 470 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 370, + 470 + ], + "score": 1.0, + "content": "those predictions depending on the uncertainty surrounding them.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 106, + 474, + 505, + 519 + ], + "lines": [ + { + "bbox": [ + 106, + 474, + 506, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 506, + 487 + ], + "score": 1.0, + "content": "Guo et al. (2017) showed that unlike techniques used decades ago such as Bayesian Ridge Regression,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 484, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 505, + 500 + ], + "score": 1.0, + "content": "modern neural network-based classifiers are very poorly calibrated. A simple variant of Platt scaling", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "score": 1.0, + "content": "and other histogram based techniques applied to a validation set were shown to help alleviate the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 508, + 342, + 520 + ], + "spans": [ + { + "bbox": [ + 106, + 508, + 342, + 520 + ], + "score": 1.0, + "content": "calibration problem where perfect calibration is defined as", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5 + }, + { + "type": "interline_equation", + "bbox": [ + 230, + 521, + 380, + 536 + ], + "lines": [ + { + "bbox": [ + 230, + 521, + 380, + 536 + ], + "spans": [ + { + "bbox": [ + 230, + 521, + 380, + 536 + ], + "score": 0.92, + "content": "\\mathbb { P } ( \\hat { Y } = Y | \\hat { P } = p ) = p , \\quad \\forall p \\in [ 0 , 1 ]", + "type": "interline_equation", + "image_path": "e43808e66d2bfbf69972fead871980cc742ab0f6c00f45c4152c55d07f3044f3.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 230, + 521, + 380, + 536 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 539, + 418, + 551 + ], + "lines": [ + { + "bbox": [ + 105, + 536, + 419, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 133, + 555 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 538, + 142, + 550 + ], + "score": 0.85, + "content": "\\hat { Y }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 536, + 241, + 555 + ], + "score": 1.0, + "content": "is a class prediction and", + "type": "text" + }, + { + "bbox": [ + 241, + 538, + 250, + 550 + ], + "score": 0.87, + "content": "\\hat { P }", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 536, + 419, + 555 + ], + "score": 1.0, + "content": "is its predicted probability of correctness.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 556, + 506, + 601 + ], + "lines": [ + { + "bbox": [ + 105, + 555, + 507, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 507, + 570 + ], + "score": 1.0, + "content": "Kuleshov et al. (2018) extended the analysis in Guo et al. (2017) to neural network-based regressors;", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 567, + 505, + 580 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 505, + 580 + ], + "score": 1.0, + "content": "isotonic regression, a method for learning monotonic univariate functions, was applied to map from", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 577, + 506, + 593 + ], + "spans": [ + { + "bbox": [ + 107, + 578, + 163, + 591 + ], + "score": 0.92, + "content": "\\mathcal { F } _ { x _ { j } } ( y _ { j } ) = \\hat { p } _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 577, + 175, + 593 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 175, + 578, + 335, + 591 + ], + "score": 0.9, + "content": "| \\{ y _ { n } | \\mathcal { F } _ { x _ { n } } ( y _ { n } ) < \\hat { p } _ { j } , n \\stackrel { - } { = } 1 , . . . , N \\} | / N", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 577, + 506, + 593 + ], + "score": 1.0, + "content": "(the fraction of the data where the model", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 588, + 431, + 602 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 174, + 602 + ], + "score": 1.0, + "content": "CDF is less than", + "type": "text" + }, + { + "bbox": [ + 175, + 591, + 181, + 601 + ], + "score": 0.79, + "content": "\\hat { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 588, + 431, + 602 + ], + "score": 1.0, + "content": ") to improve calibration where perfect calibration is defined as", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36.5 + }, + { + "type": "interline_equation", + "bbox": [ + 233, + 601, + 378, + 616 + ], + "lines": [ + { + "bbox": [ + 233, + 601, + 378, + 616 + ], + "spans": [ + { + "bbox": [ + 233, + 601, + 378, + 616 + ], + "score": 0.9, + "content": "\\mathbb { P } ( Y < \\mathcal { F } _ { X } ^ { - 1 } ( p ) ) = p , \\quad \\forall p \\in [ 0 , 1 ]", + "type": "interline_equation", + "image_path": "f8cfef23ac0b22f3f9c42993e6b5b55e99c0a224ebf71a0cd384b8b878d64f09.jpg" + } + ] + } + ], + "index": 39, + "virtual_lines": [ + { + "bbox": [ + 233, + 601, + 378, + 616 + ], + "spans": [], + "index": 39 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 617, + 272, + 629 + ], + "lines": [ + { + "bbox": [ + 106, + 617, + 273, + 630 + ], + "spans": [ + { + "bbox": [ + 106, + 617, + 133, + 630 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 618, + 149, + 628 + ], + "score": 0.89, + "content": "{ \\mathcal { F } } _ { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 617, + 273, + 630 + ], + "score": 1.0, + "content": "is the predicted CDF function.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 108, + 634, + 505, + 656 + ], + "lines": [ + { + "bbox": [ + 105, + 632, + 505, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 648 + ], + "score": 1.0, + "content": "Kuleshov et al. (2018) further introduced calibration error as a metric to quantitatively measure how", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 644, + 227, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 227, + 657 + ], + "score": 1.0, + "content": "well the quantiles are aligned:", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5 + }, + { + "type": "interline_equation", + "bbox": [ + 211, + 657, + 402, + 709 + ], + "lines": [ + { + "bbox": [ + 211, + 657, + 402, + 709 + ], + "spans": [ + { + "bbox": [ + 211, + 657, + 402, + 709 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\hat { p } _ { j } = \\vert \\{ y _ { n } \\vert \\mathcal { F } _ { x _ { n } } ( y _ { n } ) < p _ { j } , n = 1 , \\ldots , N \\} \\vert / N } \\\\ { \\operatorname { c a l } ( y _ { 1 } , \\ldots , y _ { N } ) = \\displaystyle \\sum _ { j = 1 } ^ { M } ( p _ { j } - \\hat { p } _ { j } ) ^ { 2 } } \\end{array}", + "type": "interline_equation", + "image_path": "dcb4f26b646c6177de95703c877c629775389f8a8b0e1d7feaa1897790b407a4.jpg" + } + ] + } + ], + "index": 44.5, + "virtual_lines": [ + { + "bbox": [ + 211, + 657, + 402, + 670.0 + ], + "spans": [], + "index": 43 + }, + { + "bbox": [ + 211, + 670.0, + 402, + 683.0 + ], + "spans": [], + "index": 44 + }, + { + "bbox": [ + 211, + 683.0, + 402, + 696.0 + ], + "spans": [], + "index": 45 + }, + { + "bbox": [ + 211, + 696.0, + 402, + 709.0 + ], + "spans": [], + "index": 46 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 506, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 132, + 722 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 710, + 145, + 720 + ], + "score": 0.82, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 708, + 506, + 722 + ], + "score": 1.0, + "content": "is the number of quantiles that are evaluated. In this paper, we set this to 100 evenly spaced", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 104, + 720, + 148, + 733 + ], + "spans": [ + { + "bbox": [ + 104, + 720, + 148, + 733 + ], + "score": 1.0, + "content": "quantiles.", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 47.5 + } + ], + "page_idx": 1, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "score": 1.0, + "content": "2", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 211, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 213, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 213, + 96 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 105, + 505, + 161 + ], + "lines": [ + { + "bbox": [ + 106, + 105, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 506, + 117 + ], + "score": 1.0, + "content": "One method for handling aleatoric uncertainty is amortized inference with Gaussians (Lakshmi-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 116, + 506, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 116, + 506, + 129 + ], + "score": 1.0, + "content": "narayanan et al., 2017; Nix & Weigend, 1994; Kendall & Gal, 2017) where a model, such as a", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 128, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 505, + 140 + ], + "score": 1.0, + "content": "neural network, maps from features to the parameters of a Gaussian. This approach models aleatoric", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 138, + 505, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 505, + 151 + ], + "score": 1.0, + "content": "uncertainty directly but suffers from approximation uncertainty as a Gaussian cannot model complex", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 150, + 138, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 138, + 163 + ], + "score": 1.0, + "content": "targets.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 105, + 506, + 163 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 166, + 505, + 221 + ], + "lines": [ + { + "bbox": [ + 105, + 166, + 505, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 166, + 505, + 179 + ], + "score": 1.0, + "content": "Another approach is Bayesian methods such as Bayesian Ridge Regression (Tipping, 2001) and", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 177, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 106, + 177, + 505, + 189 + ], + "score": 1.0, + "content": "MC Dropout (Gal & Ghahramani, 2016). Similar to amortized inference with Gaussians, the output", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 187, + 505, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 201 + ], + "score": 1.0, + "content": "distribution limits the capacity of the model. Full Bayesian techniques with neural networks are often", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 199, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 505, + 212 + ], + "score": 1.0, + "content": "too computationally expensive in practice, and approximate methods often fail to capture the full", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 210, + 360, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 360, + 223 + ], + "score": 1.0, + "content": "complexity of the uncertainty (Lakshminarayanan et al., 2017).", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 166, + 505, + 223 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 226, + 505, + 304 + ], + "lines": [ + { + "bbox": [ + 105, + 226, + 506, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 506, + 240 + ], + "score": 1.0, + "content": "Another family of methods uses quantile regression with non-linear techniques such as decision trees", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 238, + 506, + 251 + ], + "spans": [ + { + "bbox": [ + 105, + 238, + 506, + 251 + ], + "score": 1.0, + "content": "or neural networks. Some of these methods require a predefined set of quantiles (Takeuchi et al.,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 249, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 249, + 505, + 261 + ], + "score": 1.0, + "content": "2006; Wen et al., 2017; Rodrigues & Pereira, 2018; Taylor, 2000). Simultaneous Quantile Regression", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 260, + 506, + 272 + ], + "spans": [ + { + "bbox": [ + 106, + 260, + 506, + 272 + ], + "score": 1.0, + "content": "(SQR, Tagasovska & Lopez-Paz (2019)) trains one model on all quantiles and is able to learn complex", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 270, + 506, + 283 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 506, + 283 + ], + "score": 1.0, + "content": "shaped distributions. However the training procedure requires the model to learn to be monotonic", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 281, + 506, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 506, + 294 + ], + "score": 1.0, + "content": "instead of being constrained to be so and is not trivial to extend to multidimensional outputs. Pearce", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 293, + 470, + 306 + ], + "spans": [ + { + "bbox": [ + 106, + 293, + 470, + 306 + ], + "score": 1.0, + "content": "et al. (2018) learns a finite set of quantiles by using quality metrics for predictive intervals.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 226, + 506, + 306 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 309, + 506, + 365 + ], + "lines": [ + { + "bbox": [ + 105, + 307, + 507, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 507, + 324 + ], + "score": 1.0, + "content": "Normalizing flows have been used in the contexts of variational inference and generative modeling.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 320, + 506, + 334 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 506, + 334 + ], + "score": 1.0, + "content": "The approaches to normalizing flows can be categorized into autoregressive methods (Kingma et al.,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 330, + 507, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 507, + 345 + ], + "score": 1.0, + "content": "2016; Papamakarios et al., 2017; Huang et al., 2018; Cao et al., 2019), coupling layers (Dinh et al.,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 341, + 506, + 355 + ], + "spans": [ + { + "bbox": [ + 105, + 341, + 506, + 355 + ], + "score": 1.0, + "content": "2014; 2016; Kingma & Dhariwal, 2018; Ho et al., 2019), residual networks (Rezende & Mohamed,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 353, + 479, + 366 + ], + "spans": [ + { + "bbox": [ + 106, + 353, + 479, + 366 + ], + "score": 1.0, + "content": "2015; van den Berg et al., 2018; Gopal, 2020) and continuous flows (Grathwohl et al., 2018).", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 307, + 507, + 366 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 380, + 200, + 393 + ], + "lines": [ + { + "bbox": [ + 104, + 379, + 201, + 396 + ], + "spans": [ + { + "bbox": [ + 104, + 379, + 201, + 396 + ], + "score": 1.0, + "content": "3 BACKGROUND", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "title", + "bbox": [ + 108, + 404, + 203, + 416 + ], + "lines": [ + { + "bbox": [ + 106, + 404, + 204, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 404, + 204, + 417 + ], + "score": 1.0, + "content": "3.1 RECALIBRATION", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 425, + 505, + 469 + ], + "lines": [ + { + "bbox": [ + 105, + 425, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 505, + 437 + ], + "score": 1.0, + "content": "An important goal in modeling is to have well-calibrated distributions as this allows users of the model", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 436, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 436, + 505, + 448 + ], + "score": 1.0, + "content": "to understand the confidence the model places on its prediction. In other words, with a well-calibrated", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 447, + 505, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 505, + 460 + ], + "score": 1.0, + "content": "model, we can better ascertain the uncertainty in the model’s predictions and respond differently to", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 459, + 370, + 470 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 370, + 470 + ], + "score": 1.0, + "content": "those predictions depending on the uncertainty surrounding them.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 425, + 505, + 470 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 474, + 505, + 519 + ], + "lines": [ + { + "bbox": [ + 106, + 474, + 506, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 506, + 487 + ], + "score": 1.0, + "content": "Guo et al. (2017) showed that unlike techniques used decades ago such as Bayesian Ridge Regression,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 484, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 505, + 500 + ], + "score": 1.0, + "content": "modern neural network-based classifiers are very poorly calibrated. A simple variant of Platt scaling", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "score": 1.0, + "content": "and other histogram based techniques applied to a validation set were shown to help alleviate the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 508, + 342, + 520 + ], + "spans": [ + { + "bbox": [ + 106, + 508, + 342, + 520 + ], + "score": 1.0, + "content": "calibration problem where perfect calibration is defined as", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 474, + 506, + 520 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 230, + 521, + 380, + 536 + ], + "lines": [ + { + "bbox": [ + 230, + 521, + 380, + 536 + ], + "spans": [ + { + "bbox": [ + 230, + 521, + 380, + 536 + ], + "score": 0.92, + "content": "\\mathbb { P } ( \\hat { Y } = Y | \\hat { P } = p ) = p , \\quad \\forall p \\in [ 0 , 1 ]", + "type": "interline_equation", + "image_path": "e43808e66d2bfbf69972fead871980cc742ab0f6c00f45c4152c55d07f3044f3.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 230, + 521, + 380, + 536 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 539, + 418, + 551 + ], + "lines": [ + { + "bbox": [ + 105, + 536, + 419, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 133, + 555 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 538, + 142, + 550 + ], + "score": 0.85, + "content": "\\hat { Y }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 536, + 241, + 555 + ], + "score": 1.0, + "content": "is a class prediction and", + "type": "text" + }, + { + "bbox": [ + 241, + 538, + 250, + 550 + ], + "score": 0.87, + "content": "\\hat { P }", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 536, + 419, + 555 + ], + "score": 1.0, + "content": "is its predicted probability of correctness.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 536, + 419, + 555 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 556, + 506, + 601 + ], + "lines": [ + { + "bbox": [ + 105, + 555, + 507, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 507, + 570 + ], + "score": 1.0, + "content": "Kuleshov et al. (2018) extended the analysis in Guo et al. (2017) to neural network-based regressors;", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 567, + 505, + 580 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 505, + 580 + ], + "score": 1.0, + "content": "isotonic regression, a method for learning monotonic univariate functions, was applied to map from", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 577, + 506, + 593 + ], + "spans": [ + { + "bbox": [ + 107, + 578, + 163, + 591 + ], + "score": 0.92, + "content": "\\mathcal { F } _ { x _ { j } } ( y _ { j } ) = \\hat { p } _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 577, + 175, + 593 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 175, + 578, + 335, + 591 + ], + "score": 0.9, + "content": "| \\{ y _ { n } | \\mathcal { F } _ { x _ { n } } ( y _ { n } ) < \\hat { p } _ { j } , n \\stackrel { - } { = } 1 , . . . , N \\} | / N", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 577, + 506, + 593 + ], + "score": 1.0, + "content": "(the fraction of the data where the model", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 588, + 431, + 602 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 174, + 602 + ], + "score": 1.0, + "content": "CDF is less than", + "type": "text" + }, + { + "bbox": [ + 175, + 591, + 181, + 601 + ], + "score": 0.79, + "content": "\\hat { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 588, + 431, + 602 + ], + "score": 1.0, + "content": ") to improve calibration where perfect calibration is defined as", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 555, + 507, + 602 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 233, + 601, + 378, + 616 + ], + "lines": [ + { + "bbox": [ + 233, + 601, + 378, + 616 + ], + "spans": [ + { + "bbox": [ + 233, + 601, + 378, + 616 + ], + "score": 0.9, + "content": "\\mathbb { P } ( Y < \\mathcal { F } _ { X } ^ { - 1 } ( p ) ) = p , \\quad \\forall p \\in [ 0 , 1 ]", + "type": "interline_equation", + "image_path": "f8cfef23ac0b22f3f9c42993e6b5b55e99c0a224ebf71a0cd384b8b878d64f09.jpg" + } + ] + } + ], + "index": 39, + "virtual_lines": [ + { + "bbox": [ + 233, + 601, + 378, + 616 + ], + "spans": [], + "index": 39 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 617, + 272, + 629 + ], + "lines": [ + { + "bbox": [ + 106, + 617, + 273, + 630 + ], + "spans": [ + { + "bbox": [ + 106, + 617, + 133, + 630 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 618, + 149, + 628 + ], + "score": 0.89, + "content": "{ \\mathcal { F } } _ { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 617, + 273, + 630 + ], + "score": 1.0, + "content": "is the predicted CDF function.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40, + "bbox_fs": [ + 106, + 617, + 273, + 630 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 634, + 505, + 656 + ], + "lines": [ + { + "bbox": [ + 105, + 632, + 505, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 648 + ], + "score": 1.0, + "content": "Kuleshov et al. (2018) further introduced calibration error as a metric to quantitatively measure how", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 644, + 227, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 227, + 657 + ], + "score": 1.0, + "content": "well the quantiles are aligned:", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5, + "bbox_fs": [ + 105, + 632, + 505, + 657 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 211, + 657, + 402, + 709 + ], + "lines": [ + { + "bbox": [ + 211, + 657, + 402, + 709 + ], + "spans": [ + { + "bbox": [ + 211, + 657, + 402, + 709 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\hat { p } _ { j } = \\vert \\{ y _ { n } \\vert \\mathcal { F } _ { x _ { n } } ( y _ { n } ) < p _ { j } , n = 1 , \\ldots , N \\} \\vert / N } \\\\ { \\operatorname { c a l } ( y _ { 1 } , \\ldots , y _ { N } ) = \\displaystyle \\sum _ { j = 1 } ^ { M } ( p _ { j } - \\hat { p } _ { j } ) ^ { 2 } } \\end{array}", + "type": "interline_equation", + "image_path": "dcb4f26b646c6177de95703c877c629775389f8a8b0e1d7feaa1897790b407a4.jpg" + } + ] + } + ], + "index": 44.5, + "virtual_lines": [ + { + "bbox": [ + 211, + 657, + 402, + 670.0 + ], + "spans": [], + "index": 43 + }, + { + "bbox": [ + 211, + 670.0, + 402, + 683.0 + ], + "spans": [], + "index": 44 + }, + { + "bbox": [ + 211, + 683.0, + 402, + 696.0 + ], + "spans": [], + "index": 45 + }, + { + "bbox": [ + 211, + 696.0, + 402, + 709.0 + ], + "spans": [], + "index": 46 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 506, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 132, + 722 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 710, + 145, + 720 + ], + "score": 0.82, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 708, + 506, + 722 + ], + "score": 1.0, + "content": "is the number of quantiles that are evaluated. In this paper, we set this to 100 evenly spaced", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 104, + 720, + 148, + 733 + ], + "spans": [ + { + "bbox": [ + 104, + 720, + 148, + 733 + ], + "score": 1.0, + "content": "quantiles.", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 47.5, + "bbox_fs": [ + 104, + 708, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 125, + 77, + 486, + 181 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 125, + 77, + 486, + 181 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 125, + 77, + 486, + 181 + ], + "spans": [ + { + "bbox": [ + 125, + 77, + 486, + 181 + ], + "score": 0.969, + "type": "image", + "image_path": "52aa6c065ffeced6d996d72cde20955f69b0c8da9a20d8031cebe127f210d0b4.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 125, + 77, + 486, + 111.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 125, + 111.66666666666666, + 486, + 146.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 125, + 146.33333333333331, + 486, + 180.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 200, + 506, + 233 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 199, + 506, + 213 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 506, + 213 + ], + "score": 1.0, + "content": "Figure 1: A comparison between using a hypernetwork approach versus conditional approach to", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 211, + 505, + 223 + ], + "spans": [ + { + "bbox": [ + 106, + 211, + 282, + 223 + ], + "score": 1.0, + "content": "creating Conditional QuAR Flows to model", + "type": "text" + }, + { + "bbox": [ + 282, + 211, + 312, + 223 + ], + "score": 0.93, + "content": "p ( X | c )", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 211, + 340, + 223 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 341, + 211, + 356, + 222 + ], + "score": 0.89, + "content": "W _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 211, + 374, + 223 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 374, + 211, + 389, + 222 + ], + "score": 0.88, + "content": "W _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 211, + 505, + 223 + ], + "score": 1.0, + "content": "parametrize the layers in the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 222, + 189, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 189, + 234 + ], + "score": 1.0, + "content": "residual connection.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 108, + 259, + 228, + 270 + ], + "lines": [ + { + "bbox": [ + 105, + 258, + 229, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 229, + 272 + ], + "score": 1.0, + "content": "3.2 NORMALIZING FLOWS", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 105, + 281, + 504, + 304 + ], + "lines": [ + { + "bbox": [ + 104, + 280, + 506, + 295 + ], + "spans": [ + { + "bbox": [ + 104, + 280, + 506, + 295 + ], + "score": 1.0, + "content": "A crucial component in improving uncertainty estimates in this paper is to fit normalizing flows, a", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 292, + 374, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 292, + 374, + 306 + ], + "score": 1.0, + "content": "generative model for density estimation using invertible functions.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 107, + 309, + 505, + 343 + ], + "lines": [ + { + "bbox": [ + 106, + 309, + 506, + 322 + ], + "spans": [ + { + "bbox": [ + 106, + 309, + 353, + 322 + ], + "score": 1.0, + "content": "Suppose that we wish to formulate a joint distribution on an", + "type": "text" + }, + { + "bbox": [ + 354, + 312, + 361, + 320 + ], + "score": 0.77, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 309, + 461, + 322 + ], + "score": 1.0, + "content": "-dimensional real vector", + "type": "text" + }, + { + "bbox": [ + 461, + 312, + 468, + 320 + ], + "score": 0.69, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 309, + 506, + 322 + ], + "score": 1.0, + "content": ". A flow-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 320, + 505, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 320, + 194, + 333 + ], + "score": 1.0, + "content": "based approach treats", + "type": "text" + }, + { + "bbox": [ + 194, + 323, + 201, + 331 + ], + "score": 0.74, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 320, + 329, + 333 + ], + "score": 1.0, + "content": "as the result of a transformation", + "type": "text" + }, + { + "bbox": [ + 329, + 323, + 336, + 333 + ], + "score": 0.79, + "content": "g", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 320, + 462, + 333 + ], + "score": 1.0, + "content": "applied to an underlying vector", + "type": "text" + }, + { + "bbox": [ + 462, + 323, + 469, + 331 + ], + "score": 0.77, + "content": "z", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 320, + 505, + 333 + ], + "score": 1.0, + "content": "sampled", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 331, + 418, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 204, + 344 + ], + "score": 1.0, + "content": "from a base distribution", + "type": "text" + }, + { + "bbox": [ + 204, + 331, + 227, + 344 + ], + "score": 0.92, + "content": "p _ { z } ( z )", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 331, + 418, + 344 + ], + "score": 1.0, + "content": ". The generative process for flows is defined as:", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "interline_equation", + "bbox": [ + 283, + 352, + 327, + 382 + ], + "lines": [ + { + "bbox": [ + 283, + 352, + 327, + 382 + ], + "spans": [ + { + "bbox": [ + 283, + 352, + 327, + 382 + ], + "score": 0.91, + "content": "\\begin{array} { l } { z \\sim p _ { z } ( z ) } \\\\ { x = g ( z ) } \\end{array}", + "type": "interline_equation", + "image_path": "ee13df7ff53df7ed3c8c5c5dfae1d84c3938600f51fcccaafc04540b8869278f.jpg" + } + ] + } + ], + "index": 12.5, + "virtual_lines": [ + { + "bbox": [ + 283, + 352, + 327, + 367.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 283, + 367.0, + 327, + 382.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 390, + 504, + 413 + ], + "lines": [ + { + "bbox": [ + 106, + 390, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 133, + 403 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 392, + 145, + 401 + ], + "score": 0.82, + "content": "p _ { z }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 390, + 288, + 403 + ], + "score": 1.0, + "content": "is often a Normal distribution and", + "type": "text" + }, + { + "bbox": [ + 288, + 392, + 294, + 402 + ], + "score": 0.82, + "content": "g", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 390, + 505, + 403 + ], + "score": 1.0, + "content": "is an invertible function. Notationally, we will use", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 107, + 401, + 358, + 415 + ], + "spans": [ + { + "bbox": [ + 107, + 402, + 142, + 413 + ], + "score": 0.91, + "content": "f = g ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 143, + 401, + 339, + 415 + ], + "score": 1.0, + "content": ". Using change of variables, the log likelihood of", + "type": "text" + }, + { + "bbox": [ + 339, + 403, + 346, + 411 + ], + "score": 0.76, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 401, + 358, + 415 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "interline_equation", + "bbox": [ + 207, + 421, + 404, + 450 + ], + "lines": [ + { + "bbox": [ + 207, + 421, + 404, + 450 + ], + "spans": [ + { + "bbox": [ + 207, + 421, + 404, + 450 + ], + "score": 0.93, + "content": "\\log p _ { x } ( x ) = \\log p _ { z } \\left( f ( x ) \\right) + \\log \\left| { \\operatorname* { d e t } \\left( \\frac { \\partial f ( x ) } { \\partial x } \\right) } \\right|", + "type": "interline_equation", + "image_path": "09787bde3ddfbf23fec9c4cdeb1c41f2934a30cd91950c65b558857aa9ce255b.jpg" + } + ] + } + ], + "index": 16.5, + "virtual_lines": [ + { + "bbox": [ + 207, + 421, + 404, + 435.5 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 207, + 435.5, + 404, + 450.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 458, + 505, + 504 + ], + "lines": [ + { + "bbox": [ + 105, + 459, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 505, + 471 + ], + "score": 1.0, + "content": "To train flows (i.e. maximize the log likelihood of data points), we need to be able to compute the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 470, + 506, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 371, + 482 + ], + "score": 1.0, + "content": "logarithm of the absolute value of the determinant of the Jacobian of", + "type": "text" + }, + { + "bbox": [ + 372, + 470, + 379, + 482 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 470, + 506, + 482 + ], + "score": 1.0, + "content": ", also called the log-determinant.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 480, + 506, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 506, + 493 + ], + "score": 1.0, + "content": "To construct large normalizing flows, we can compose smaller ones as this is still invertible and the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 492, + 435, + 504 + ], + "spans": [ + { + "bbox": [ + 106, + 492, + 435, + 504 + ], + "score": 1.0, + "content": "log-determinant of this composition is the sum of the individual log-determinants.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 107, + 508, + 504, + 542 + ], + "lines": [ + { + "bbox": [ + 106, + 509, + 505, + 521 + ], + "spans": [ + { + "bbox": [ + 106, + 509, + 505, + 521 + ], + "score": 1.0, + "content": "An important observation is that every univariate distribution can be viewed as a flow in which the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 520, + 173, + 532 + ], + "score": 1.0, + "content": "base distribution", + "type": "text" + }, + { + "bbox": [ + 174, + 519, + 197, + 532 + ], + "score": 0.92, + "content": "p _ { z } ( z )", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 520, + 317, + 532 + ], + "score": 1.0, + "content": "is a Uniform distribution over", + "type": "text" + }, + { + "bbox": [ + 318, + 520, + 338, + 532 + ], + "score": 0.42, + "content": "[ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 520, + 356, + 532 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 356, + 521, + 363, + 531 + ], + "score": 0.81, + "content": "g", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 520, + 505, + 532 + ], + "score": 1.0, + "content": "is the inverse CDF of the univariate", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 530, + 451, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 451, + 543 + ], + "score": 1.0, + "content": "distribution. This can be generalized to multivariate distributions using the chain rule.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23 + }, + { + "type": "title", + "bbox": [ + 108, + 560, + 257, + 572 + ], + "lines": [ + { + "bbox": [ + 104, + 558, + 258, + 574 + ], + "spans": [ + { + "bbox": [ + 104, + 558, + 258, + 574 + ], + "score": 1.0, + "content": "3.3 CONDITIONAL QUAR FLOWS", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 582, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 105, + 582, + 506, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 506, + 596 + ], + "score": 1.0, + "content": "In this paper, the specific normalizing flow used is Quasi-Autoregressive Residual Flows (QuAR", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "Flows, Gopal (2020)). QuAR Flows were shown to handle modeling complex distributions while", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "having nice optimization properties and computationally efficient log-likelihoods. Other commonly", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 616, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 506, + 628 + ], + "score": 1.0, + "content": "used normalizing flows have drawbacks. Coupling layers do not work for one-dimensional inputs.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "Autoregressive flows are often conditional Gaussians which means in the one-dimensional case, the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "flow is simply a Gaussian. Residual Flows (Chen et al., 2019) are expressive but, though equivalent", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "score": 1.0, + "content": "to QuAR Flows in the one-dimensional case, are computationally expensive for high-dimensional", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 659, + 162, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 659, + 162, + 672 + ], + "score": 1.0, + "content": "distributions.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 107, + 676, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 373, + 690 + ], + "score": 1.0, + "content": "If we would like to condition a QuAR Flow given some features", + "type": "text" + }, + { + "bbox": [ + 373, + 680, + 379, + 687 + ], + "score": 0.56, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 676, + 506, + 690 + ], + "score": 1.0, + "content": ", we could use a hypernetwork", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 687, + 504, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 147, + 699 + ], + "score": 1.0, + "content": "that maps", + "type": "text" + }, + { + "bbox": [ + 147, + 690, + 153, + 698 + ], + "score": 0.7, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 687, + 504, + 699 + ], + "score": 1.0, + "content": "to the parameters of the QuAR Flow (Figure 1a). However, this can be computationally", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "expensive if the QuAR Flow is parameterized with thousands of parameters. Instead, conditional", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 367, + 723 + ], + "score": 1.0, + "content": "information can be incorporated by concatenating the conditions", + "type": "text" + }, + { + "bbox": [ + 367, + 712, + 373, + 720 + ], + "score": 0.72, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "before applying the first layer in", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 721, + 337, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 337, + 732 + ], + "score": 1.0, + "content": "the residual connection within a QuAR Flow (Figure 1b).", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36 + } + ], + "page_idx": 2, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 125, + 77, + 486, + 181 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 125, + 77, + 486, + 181 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 125, + 77, + 486, + 181 + ], + "spans": [ + { + "bbox": [ + 125, + 77, + 486, + 181 + ], + "score": 0.969, + "type": "image", + "image_path": "52aa6c065ffeced6d996d72cde20955f69b0c8da9a20d8031cebe127f210d0b4.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 125, + 77, + 486, + 111.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 125, + 111.66666666666666, + 486, + 146.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 125, + 146.33333333333331, + 486, + 180.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 200, + 506, + 233 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 199, + 506, + 213 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 506, + 213 + ], + "score": 1.0, + "content": "Figure 1: A comparison between using a hypernetwork approach versus conditional approach to", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 211, + 505, + 223 + ], + "spans": [ + { + "bbox": [ + 106, + 211, + 282, + 223 + ], + "score": 1.0, + "content": "creating Conditional QuAR Flows to model", + "type": "text" + }, + { + "bbox": [ + 282, + 211, + 312, + 223 + ], + "score": 0.93, + "content": "p ( X | c )", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 211, + 340, + 223 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 341, + 211, + 356, + 222 + ], + "score": 0.89, + "content": "W _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 211, + 374, + 223 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 374, + 211, + 389, + 222 + ], + "score": 0.88, + "content": "W _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 211, + 505, + 223 + ], + "score": 1.0, + "content": "parametrize the layers in the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 222, + 189, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 189, + 234 + ], + "score": 1.0, + "content": "residual connection.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 108, + 259, + 228, + 270 + ], + "lines": [ + { + "bbox": [ + 105, + 258, + 229, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 229, + 272 + ], + "score": 1.0, + "content": "3.2 NORMALIZING FLOWS", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 105, + 281, + 504, + 304 + ], + "lines": [ + { + "bbox": [ + 104, + 280, + 506, + 295 + ], + "spans": [ + { + "bbox": [ + 104, + 280, + 506, + 295 + ], + "score": 1.0, + "content": "A crucial component in improving uncertainty estimates in this paper is to fit normalizing flows, a", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 292, + 374, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 292, + 374, + 306 + ], + "score": 1.0, + "content": "generative model for density estimation using invertible functions.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 104, + 280, + 506, + 306 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 309, + 505, + 343 + ], + "lines": [ + { + "bbox": [ + 106, + 309, + 506, + 322 + ], + "spans": [ + { + "bbox": [ + 106, + 309, + 353, + 322 + ], + "score": 1.0, + "content": "Suppose that we wish to formulate a joint distribution on an", + "type": "text" + }, + { + "bbox": [ + 354, + 312, + 361, + 320 + ], + "score": 0.77, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 309, + 461, + 322 + ], + "score": 1.0, + "content": "-dimensional real vector", + "type": "text" + }, + { + "bbox": [ + 461, + 312, + 468, + 320 + ], + "score": 0.69, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 309, + 506, + 322 + ], + "score": 1.0, + "content": ". A flow-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 320, + 505, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 320, + 194, + 333 + ], + "score": 1.0, + "content": "based approach treats", + "type": "text" + }, + { + "bbox": [ + 194, + 323, + 201, + 331 + ], + "score": 0.74, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 320, + 329, + 333 + ], + "score": 1.0, + "content": "as the result of a transformation", + "type": "text" + }, + { + "bbox": [ + 329, + 323, + 336, + 333 + ], + "score": 0.79, + "content": "g", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 320, + 462, + 333 + ], + "score": 1.0, + "content": "applied to an underlying vector", + "type": "text" + }, + { + "bbox": [ + 462, + 323, + 469, + 331 + ], + "score": 0.77, + "content": "z", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 320, + 505, + 333 + ], + "score": 1.0, + "content": "sampled", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 331, + 418, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 204, + 344 + ], + "score": 1.0, + "content": "from a base distribution", + "type": "text" + }, + { + "bbox": [ + 204, + 331, + 227, + 344 + ], + "score": 0.92, + "content": "p _ { z } ( z )", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 331, + 418, + 344 + ], + "score": 1.0, + "content": ". The generative process for flows is defined as:", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 309, + 506, + 344 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 283, + 352, + 327, + 382 + ], + "lines": [ + { + "bbox": [ + 283, + 352, + 327, + 382 + ], + "spans": [ + { + "bbox": [ + 283, + 352, + 327, + 382 + ], + "score": 0.91, + "content": "\\begin{array} { l } { z \\sim p _ { z } ( z ) } \\\\ { x = g ( z ) } \\end{array}", + "type": "interline_equation", + "image_path": "ee13df7ff53df7ed3c8c5c5dfae1d84c3938600f51fcccaafc04540b8869278f.jpg" + } + ] + } + ], + "index": 12.5, + "virtual_lines": [ + { + "bbox": [ + 283, + 352, + 327, + 367.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 283, + 367.0, + 327, + 382.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 390, + 504, + 413 + ], + "lines": [ + { + "bbox": [ + 106, + 390, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 133, + 403 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 392, + 145, + 401 + ], + "score": 0.82, + "content": "p _ { z }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 390, + 288, + 403 + ], + "score": 1.0, + "content": "is often a Normal distribution and", + "type": "text" + }, + { + "bbox": [ + 288, + 392, + 294, + 402 + ], + "score": 0.82, + "content": "g", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 390, + 505, + 403 + ], + "score": 1.0, + "content": "is an invertible function. Notationally, we will use", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 107, + 401, + 358, + 415 + ], + "spans": [ + { + "bbox": [ + 107, + 402, + 142, + 413 + ], + "score": 0.91, + "content": "f = g ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 143, + 401, + 339, + 415 + ], + "score": 1.0, + "content": ". Using change of variables, the log likelihood of", + "type": "text" + }, + { + "bbox": [ + 339, + 403, + 346, + 411 + ], + "score": 0.76, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 401, + 358, + 415 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 106, + 390, + 505, + 415 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 207, + 421, + 404, + 450 + ], + "lines": [ + { + "bbox": [ + 207, + 421, + 404, + 450 + ], + "spans": [ + { + "bbox": [ + 207, + 421, + 404, + 450 + ], + "score": 0.93, + "content": "\\log p _ { x } ( x ) = \\log p _ { z } \\left( f ( x ) \\right) + \\log \\left| { \\operatorname* { d e t } \\left( \\frac { \\partial f ( x ) } { \\partial x } \\right) } \\right|", + "type": "interline_equation", + "image_path": "09787bde3ddfbf23fec9c4cdeb1c41f2934a30cd91950c65b558857aa9ce255b.jpg" + } + ] + } + ], + "index": 16.5, + "virtual_lines": [ + { + "bbox": [ + 207, + 421, + 404, + 435.5 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 207, + 435.5, + 404, + 450.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 458, + 505, + 504 + ], + "lines": [ + { + "bbox": [ + 105, + 459, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 505, + 471 + ], + "score": 1.0, + "content": "To train flows (i.e. maximize the log likelihood of data points), we need to be able to compute the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 470, + 506, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 371, + 482 + ], + "score": 1.0, + "content": "logarithm of the absolute value of the determinant of the Jacobian of", + "type": "text" + }, + { + "bbox": [ + 372, + 470, + 379, + 482 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 470, + 506, + 482 + ], + "score": 1.0, + "content": ", also called the log-determinant.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 480, + 506, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 506, + 493 + ], + "score": 1.0, + "content": "To construct large normalizing flows, we can compose smaller ones as this is still invertible and the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 492, + 435, + 504 + ], + "spans": [ + { + "bbox": [ + 106, + 492, + 435, + 504 + ], + "score": 1.0, + "content": "log-determinant of this composition is the sum of the individual log-determinants.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 459, + 506, + 504 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 508, + 504, + 542 + ], + "lines": [ + { + "bbox": [ + 106, + 509, + 505, + 521 + ], + "spans": [ + { + "bbox": [ + 106, + 509, + 505, + 521 + ], + "score": 1.0, + "content": "An important observation is that every univariate distribution can be viewed as a flow in which the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 520, + 173, + 532 + ], + "score": 1.0, + "content": "base distribution", + "type": "text" + }, + { + "bbox": [ + 174, + 519, + 197, + 532 + ], + "score": 0.92, + "content": "p _ { z } ( z )", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 520, + 317, + 532 + ], + "score": 1.0, + "content": "is a Uniform distribution over", + "type": "text" + }, + { + "bbox": [ + 318, + 520, + 338, + 532 + ], + "score": 0.42, + "content": "[ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 520, + 356, + 532 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 356, + 521, + 363, + 531 + ], + "score": 0.81, + "content": "g", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 520, + 505, + 532 + ], + "score": 1.0, + "content": "is the inverse CDF of the univariate", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 530, + 451, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 451, + 543 + ], + "score": 1.0, + "content": "distribution. This can be generalized to multivariate distributions using the chain rule.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 509, + 505, + 543 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 560, + 257, + 572 + ], + "lines": [ + { + "bbox": [ + 104, + 558, + 258, + 574 + ], + "spans": [ + { + "bbox": [ + 104, + 558, + 258, + 574 + ], + "score": 1.0, + "content": "3.3 CONDITIONAL QUAR FLOWS", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 582, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 105, + 582, + 506, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 506, + 596 + ], + "score": 1.0, + "content": "In this paper, the specific normalizing flow used is Quasi-Autoregressive Residual Flows (QuAR", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "Flows, Gopal (2020)). QuAR Flows were shown to handle modeling complex distributions while", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "having nice optimization properties and computationally efficient log-likelihoods. Other commonly", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 616, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 506, + 628 + ], + "score": 1.0, + "content": "used normalizing flows have drawbacks. Coupling layers do not work for one-dimensional inputs.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "Autoregressive flows are often conditional Gaussians which means in the one-dimensional case, the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "flow is simply a Gaussian. Residual Flows (Chen et al., 2019) are expressive but, though equivalent", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "score": 1.0, + "content": "to QuAR Flows in the one-dimensional case, are computationally expensive for high-dimensional", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 659, + 162, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 659, + 162, + 672 + ], + "score": 1.0, + "content": "distributions.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 29.5, + "bbox_fs": [ + 105, + 582, + 506, + 672 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 676, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 373, + 690 + ], + "score": 1.0, + "content": "If we would like to condition a QuAR Flow given some features", + "type": "text" + }, + { + "bbox": [ + 373, + 680, + 379, + 687 + ], + "score": 0.56, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 676, + 506, + 690 + ], + "score": 1.0, + "content": ", we could use a hypernetwork", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 687, + 504, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 147, + 699 + ], + "score": 1.0, + "content": "that maps", + "type": "text" + }, + { + "bbox": [ + 147, + 690, + 153, + 698 + ], + "score": 0.7, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 687, + 504, + 699 + ], + "score": 1.0, + "content": "to the parameters of the QuAR Flow (Figure 1a). However, this can be computationally", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "expensive if the QuAR Flow is parameterized with thousands of parameters. Instead, conditional", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 367, + 723 + ], + "score": 1.0, + "content": "information can be incorporated by concatenating the conditions", + "type": "text" + }, + { + "bbox": [ + 367, + 712, + 373, + 720 + ], + "score": 0.72, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "before applying the first layer in", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 721, + 337, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 337, + 732 + ], + "score": 1.0, + "content": "the residual connection within a QuAR Flow (Figure 1b).", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 676, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 106, + 81, + 348, + 94 + ], + "lines": [ + { + "bbox": [ + 104, + 80, + 349, + 96 + ], + "spans": [ + { + "bbox": [ + 104, + 80, + 349, + 96 + ], + "score": 1.0, + "content": "4 REGRESSION USING NORMALIZING FLOWS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 105, + 506, + 172 + ], + "lines": [ + { + "bbox": [ + 105, + 105, + 506, + 119 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 407, + 119 + ], + "score": 1.0, + "content": "The goal of regression is to model the conditional probability distribution", + "type": "text" + }, + { + "bbox": [ + 407, + 106, + 434, + 118 + ], + "score": 0.92, + "content": "p ( y | x )", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 105, + 506, + 119 + ], + "score": 1.0, + "content": ". Frequently, this", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 117, + 506, + 130 + ], + "spans": [ + { + "bbox": [ + 106, + 117, + 506, + 130 + ], + "score": 1.0, + "content": "task is reduced to obtaining point estimates of the mean or median by minimizing the mean squared", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 128, + 506, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 506, + 140 + ], + "score": 1.0, + "content": "error or mean absolute error respectively. In order to access uncertainties, we must model the full", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 140, + 505, + 151 + ], + "spans": [ + { + "bbox": [ + 106, + 140, + 505, + 151 + ], + "score": 1.0, + "content": "conditional distribution; in addition to this, we can still retrieve point estimates of the mean, median,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 151, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 106, + 151, + 505, + 162 + ], + "score": 1.0, + "content": "or any other distributional statistic. In this section, we discuss how normalizing flows can be used to", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 162, + 493, + 173 + ], + "spans": [ + { + "bbox": [ + 106, + 162, + 493, + 173 + ], + "score": 1.0, + "content": "this end as well as how recalibration can be reframed as maximum likelihood estimation (MLE).", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 3.5 + }, + { + "type": "title", + "bbox": [ + 107, + 186, + 316, + 198 + ], + "lines": [ + { + "bbox": [ + 105, + 185, + 317, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 317, + 199 + ], + "score": 1.0, + "content": "4.1 CALIBRATION WITH NORMALIZING FLOWS", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 207, + 506, + 284 + ], + "lines": [ + { + "bbox": [ + 106, + 207, + 507, + 219 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 507, + 219 + ], + "score": 1.0, + "content": "One approach to modeling aleatoric uncertainty is to use amortized inference with a Normal distribu-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 218, + 507, + 231 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 507, + 231 + ], + "score": 1.0, + "content": "tion as its output distribution, conditioned on features (Lakshminarayanan et al., 2017). However,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 228, + 506, + 242 + ], + "spans": [ + { + "bbox": [ + 104, + 228, + 506, + 242 + ], + "score": 1.0, + "content": "if a Gaussian is not appropriate to fit the target, then the error in miscalibration can be attributed to", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 240, + 506, + 252 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 506, + 252 + ], + "score": 1.0, + "content": "approximation error, i.e. insufficient capacity to learn the distribution. A simple example of this is", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 252, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 106, + 252, + 505, + 262 + ], + "score": 1.0, + "content": "where we have no features to condition on (or all the features we have contain no relevant information)", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 262, + 506, + 275 + ], + "spans": [ + { + "bbox": [ + 105, + 262, + 506, + 275 + ], + "score": 1.0, + "content": "with a one-dimensional target. In Figure 2, we can see that since the target is bimodal, the Gaussian", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 273, + 244, + 284 + ], + "spans": [ + { + "bbox": [ + 106, + 273, + 244, + 284 + ], + "score": 1.0, + "content": "fit does not well describe the data.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 289, + 317, + 356 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 317, + 301 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 317, + 301 + ], + "score": 1.0, + "content": "To improve this model, we replace the Gaussian with", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 301, + 317, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 301, + 317, + 312 + ], + "score": 1.0, + "content": "a normalizing flow conditioned on our data, similar", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 312, + 316, + 323 + ], + "spans": [ + { + "bbox": [ + 106, + 312, + 316, + 323 + ], + "score": 1.0, + "content": "to Figure 1b. In this way, the distribution fit to the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 323, + 318, + 334 + ], + "spans": [ + { + "bbox": [ + 106, + 323, + 318, + 334 + ], + "score": 1.0, + "content": "targets has sufficient capacity to learn complex distri-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 333, + 317, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 333, + 317, + 345 + ], + "score": 1.0, + "content": "butions, including multimodal distributions (Figure", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 344, + 121, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 121, + 358 + ], + "score": 1.0, + "content": "2).", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5 + }, + { + "type": "title", + "bbox": [ + 106, + 370, + 229, + 392 + ], + "lines": [ + { + "bbox": [ + 105, + 369, + 204, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 204, + 381 + ], + "score": 1.0, + "content": "4.2 RECALIBRATION", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 380, + 230, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 230, + 392 + ], + "score": 1.0, + "content": "WITH NORMALIZING FLOWS", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 107, + 401, + 317, + 478 + ], + "lines": [ + { + "bbox": [ + 105, + 401, + 318, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 318, + 414 + ], + "score": 1.0, + "content": "To handle overfitting of the uncertainty, we recali-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 412, + 318, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 412, + 318, + 424 + ], + "score": 1.0, + "content": "brate the results of the original model where we as-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 424, + 317, + 434 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 317, + 434 + ], + "score": 1.0, + "content": "sume the original model outputs a full distribution", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 434, + 317, + 446 + ], + "spans": [ + { + "bbox": [ + 106, + 434, + 317, + 446 + ], + "score": 1.0, + "content": "that has closed-form likelihoods. Since the only re-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 445, + 317, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 317, + 456 + ], + "score": 1.0, + "content": "quirement is a full distribution with a closed-form", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 456, + 317, + 468 + ], + "spans": [ + { + "bbox": [ + 106, + 456, + 317, + 468 + ], + "score": 1.0, + "content": "likelihood, the original model that we recalibrate can", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 467, + 317, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 467, + 317, + 479 + ], + "score": 1.0, + "content": "be as simple as a Bayesian Linear Regression model", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32 + }, + { + "type": "image", + "bbox": [ + 324, + 304, + 503, + 434 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 324, + 304, + 503, + 434 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 324, + 304, + 503, + 434 + ], + "spans": [ + { + "bbox": [ + 324, + 304, + 503, + 434 + ], + "score": 0.97, + "type": "image", + "image_path": "ad181b91bb85b484eab2f815ac5f66a3057be04180b0b5783e57d91cc0f6099a.jpg" + } + ] + } + ], + "index": 27.0, + "virtual_lines": [ + { + "bbox": [ + 324, + 304, + 503, + 317.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 324, + 317.0, + 503, + 330.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 324, + 330.0, + 503, + 343.0 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 324, + 343.0, + 503, + 356.0 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 324, + 356.0, + 503, + 369.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 324, + 369.0, + 503, + 382.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 324, + 382.0, + 503, + 395.0 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 324, + 395.0, + 503, + 408.0 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 324, + 408.0, + 503, + 421.0 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 324, + 421.0, + 503, + 434.0 + ], + "spans": [], + "index": 39 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 324, + 443, + 505, + 466 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 324, + 443, + 506, + 456 + ], + "spans": [ + { + "bbox": [ + 324, + 443, + 506, + 456 + ], + "score": 1.0, + "content": "Figure 2: One-dimensional example of Gaus-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 325, + 455, + 393, + 466 + ], + "spans": [ + { + "bbox": [ + 325, + 455, + 393, + 466 + ], + "score": 1.0, + "content": "sian versus Flow", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5 + } + ], + "index": 33.75 + }, + { + "type": "text", + "bbox": [ + 106, + 478, + 504, + 501 + ], + "lines": [ + { + "bbox": [ + 105, + 477, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 505, + 492 + ], + "score": 1.0, + "content": "or as complicated as a conditional normalizing flow. We recalibrate the original model by fitting a", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 489, + 502, + 502 + ], + "spans": [ + { + "bbox": [ + 106, + 489, + 502, + 502 + ], + "score": 1.0, + "content": "normalizing flow on top of it. In this way, the training process is the following two-step procedure:", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5 + }, + { + "type": "interline_equation", + "bbox": [ + 129, + 508, + 335, + 546 + ], + "lines": [ + { + "bbox": [ + 129, + 508, + 335, + 546 + ], + "spans": [ + { + "bbox": [ + 129, + 508, + 335, + 546 + ], + "score": 0.69, + "content": "\\begin{array} { r l } & { 1 . \\ f _ { \\theta } = \\arg \\operatorname* { m a x } _ { f _ { \\theta } } \\sum _ { i = 1 } ^ { N _ { t r } } \\log p _ { f _ { \\theta } } ( y _ { i } ^ { t r } | x _ { i } ^ { t r } ) } \\\\ & { 2 . \\ g _ { \\phi } = \\arg \\operatorname* { m a x } _ { g _ { \\phi } } \\sum _ { i = 1 } ^ { N _ { v a l } } \\log p _ { g _ { \\phi } } ( F _ { \\theta } ( y _ { i } ^ { v a l } | x _ { i } ^ { v a l } ) ) } \\end{array}", + "type": "interline_equation", + "image_path": "c1646d62cd1f3dda7b41ed6bad0e7e343abd4ada3ef43285bf596837f42266e8.jpg" + } + ] + } + ], + "index": 45, + "virtual_lines": [ + { + "bbox": [ + 129, + 508, + 335, + 520.6666666666666 + ], + "spans": [], + "index": 44 + }, + { + "bbox": [ + 129, + 520.6666666666666, + 335, + 533.3333333333333 + ], + "spans": [], + "index": 45 + }, + { + "bbox": [ + 129, + 533.3333333333333, + 335, + 545.9999999999999 + ], + "spans": [], + "index": 46 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 555, + 505, + 613 + ], + "lines": [ + { + "bbox": [ + 102, + 551, + 508, + 584 + ], + "spans": [ + { + "bbox": [ + 102, + 551, + 132, + 584 + ], + "score": 1.0, + "content": "where the tra", + "type": "text" + }, + { + "bbox": [ + 133, + 555, + 164, + 568 + ], + "score": 0.92, + "content": "f _ { \\boldsymbol { \\theta } } ( \\boldsymbol { y } | \\boldsymbol { x } )", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 551, + 187, + 584 + ], + "score": 1.0, + "content": "is thet and", + "type": "text" + }, + { + "bbox": [ + 254, + 551, + 302, + 584 + ], + "score": 1.0, + "content": "nction given is the valid", + "type": "text" + }, + { + "bbox": [ + 303, + 558, + 309, + 566 + ], + "score": 0.55, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 551, + 313, + 584 + ], + "score": 1.0, + "content": ", i", + "type": "text" + }, + { + "bbox": [ + 313, + 555, + 347, + 568 + ], + "score": 0.9, + "content": "F _ { \\theta } ( y | x )", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 551, + 404, + 584 + ], + "score": 1.0, + "content": "is the CDF of hough the for", + "type": "text" + }, + { + "bbox": [ + 405, + 554, + 495, + 568 + ], + "score": 0.67, + "content": "f _ { \\theta } ( y | x ) , \\{ x ^ { t r } , y ^ { t r } \\} _ { i = 1 } ^ { N _ { t r } }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 551, + 508, + 584 + ], + "score": 1.0, + "content": "ison", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 187, + 567, + 254, + 581 + ], + "spans": [ + { + "bbox": [ + 187, + 567, + 254, + 581 + ], + "score": 0.93, + "content": "\\{ x ^ { v a l } , y ^ { v a l } \\} _ { i = 1 } ^ { N _ { v a l } }", + "type": "inline_equation" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 579, + 506, + 593 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 310, + 593 + ], + "score": 1.0, + "content": "above shows we can use any likelihood model for", + "type": "text" + }, + { + "bbox": [ + 310, + 581, + 321, + 592 + ], + "score": 0.86, + "content": "g _ { \\phi }", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 579, + 506, + 593 + ], + "score": 1.0, + "content": ", since isotonic regression is a method to fit a", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 588, + 505, + 604 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 604 + ], + "score": 1.0, + "content": "free form function to the CDFs, we choose to use normalizing flows, specifically QuAR Flows, as", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 601, + 500, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 601, + 500, + 613 + ], + "score": 1.0, + "content": "these are more flexible than using autoregressive flows such as MAFs (Papamakarios et al., 2017).", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 49 + }, + { + "type": "text", + "bbox": [ + 107, + 618, + 338, + 630 + ], + "lines": [ + { + "bbox": [ + 105, + 615, + 339, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 339, + 633 + ], + "score": 1.0, + "content": "After the two-step training, the new generative process is:", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 52 + }, + { + "type": "interline_equation", + "bbox": [ + 266, + 635, + 345, + 685 + ], + "lines": [ + { + "bbox": [ + 266, + 635, + 345, + 685 + ], + "spans": [ + { + "bbox": [ + 266, + 635, + 345, + 685 + ], + "score": 0.92, + "content": "\\begin{array} { l } { z \\sim \\mathrm { U n i f o r m } ( 0 , 1 ) } \\\\ { u = G _ { \\phi } ^ { - 1 } ( z ) } \\\\ { y = F _ { \\theta } ^ { - 1 } ( u | x ) } \\end{array}", + "type": "interline_equation", + "image_path": "80e6d83ca80da3b9239424445b97d3f04f662d18bb6ae77cac0633b9b50a4f85.jpg" + } + ] + } + ], + "index": 53.5, + "virtual_lines": [ + { + "bbox": [ + 266, + 635, + 345, + 660.0 + ], + "spans": [], + "index": 53 + }, + { + "bbox": [ + 266, + 660.0, + 345, + 685.0 + ], + "spans": [], + "index": 54 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 134, + 700 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 688, + 149, + 700 + ], + "score": 0.89, + "content": "G _ { \\phi }", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 687, + 210, + 700 + ], + "score": 1.0, + "content": "is the CDF of", + "type": "text" + }, + { + "bbox": [ + 210, + 689, + 221, + 700 + ], + "score": 0.84, + "content": "g _ { \\phi }", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 687, + 505, + 700 + ], + "score": 1.0, + "content": ". The density function of the above generative process is simply the", + "type": "text" + } + ], + "index": 55 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 279, + 712 + ], + "score": 1.0, + "content": "product of the individual density functions:", + "type": "text" + }, + { + "bbox": [ + 279, + 700, + 289, + 711 + ], + "score": 0.87, + "content": "f _ { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 699, + 307, + 712 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 307, + 700, + 318, + 711 + ], + "score": 0.84, + "content": "g _ { \\phi }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 699, + 506, + 712 + ], + "score": 1.0, + "content": ". Given this view of the generative process, one", + "type": "text" + } + ], + "index": 56 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 307, + 722 + ], + "score": 1.0, + "content": "interpretation of the two-step process is to first fit", + "type": "text" + }, + { + "bbox": [ + 307, + 711, + 313, + 720 + ], + "score": 0.82, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 710, + 415, + 722 + ], + "score": 1.0, + "content": "on the training set where", + "type": "text" + }, + { + "bbox": [ + 416, + 710, + 423, + 721 + ], + "score": 0.84, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "is initialized so that", + "type": "text" + } + ], + "index": 57 + }, + { + "bbox": [ + 107, + 720, + 504, + 735 + ], + "spans": [ + { + "bbox": [ + 107, + 720, + 126, + 735 + ], + "score": 0.91, + "content": "G _ { \\phi } ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 126, + 721, + 278, + 733 + ], + "score": 1.0, + "content": "is the identity function, and then to fit", + "type": "text" + }, + { + "bbox": [ + 279, + 722, + 285, + 732 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 721, + 426, + 733 + ], + "score": 1.0, + "content": "on the validation set while keeping", + "type": "text" + }, + { + "bbox": [ + 426, + 721, + 433, + 730 + ], + "score": 0.78, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 721, + 497, + 733 + ], + "score": 1.0, + "content": "frozen. Though", + "type": "text" + }, + { + "bbox": [ + 498, + 721, + 504, + 730 + ], + "score": 0.77, + "content": "\\theta", + "type": "inline_equation" + } + ], + "index": 58 + } + ], + "index": 56.5 + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 309, + 762 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 12, + "width": 8 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 106, + 81, + 348, + 94 + ], + "lines": [ + { + "bbox": [ + 104, + 80, + 349, + 96 + ], + "spans": [ + { + "bbox": [ + 104, + 80, + 349, + 96 + ], + "score": 1.0, + "content": "4 REGRESSION USING NORMALIZING FLOWS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 105, + 506, + 172 + ], + "lines": [ + { + "bbox": [ + 105, + 105, + 506, + 119 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 407, + 119 + ], + "score": 1.0, + "content": "The goal of regression is to model the conditional probability distribution", + "type": "text" + }, + { + "bbox": [ + 407, + 106, + 434, + 118 + ], + "score": 0.92, + "content": "p ( y | x )", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 105, + 506, + 119 + ], + "score": 1.0, + "content": ". Frequently, this", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 117, + 506, + 130 + ], + "spans": [ + { + "bbox": [ + 106, + 117, + 506, + 130 + ], + "score": 1.0, + "content": "task is reduced to obtaining point estimates of the mean or median by minimizing the mean squared", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 128, + 506, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 506, + 140 + ], + "score": 1.0, + "content": "error or mean absolute error respectively. In order to access uncertainties, we must model the full", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 140, + 505, + 151 + ], + "spans": [ + { + "bbox": [ + 106, + 140, + 505, + 151 + ], + "score": 1.0, + "content": "conditional distribution; in addition to this, we can still retrieve point estimates of the mean, median,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 151, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 106, + 151, + 505, + 162 + ], + "score": 1.0, + "content": "or any other distributional statistic. In this section, we discuss how normalizing flows can be used to", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 162, + 493, + 173 + ], + "spans": [ + { + "bbox": [ + 106, + 162, + 493, + 173 + ], + "score": 1.0, + "content": "this end as well as how recalibration can be reframed as maximum likelihood estimation (MLE).", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 105, + 506, + 173 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 186, + 316, + 198 + ], + "lines": [ + { + "bbox": [ + 105, + 185, + 317, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 317, + 199 + ], + "score": 1.0, + "content": "4.1 CALIBRATION WITH NORMALIZING FLOWS", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 207, + 506, + 284 + ], + "lines": [ + { + "bbox": [ + 106, + 207, + 507, + 219 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 507, + 219 + ], + "score": 1.0, + "content": "One approach to modeling aleatoric uncertainty is to use amortized inference with a Normal distribu-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 218, + 507, + 231 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 507, + 231 + ], + "score": 1.0, + "content": "tion as its output distribution, conditioned on features (Lakshminarayanan et al., 2017). However,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 228, + 506, + 242 + ], + "spans": [ + { + "bbox": [ + 104, + 228, + 506, + 242 + ], + "score": 1.0, + "content": "if a Gaussian is not appropriate to fit the target, then the error in miscalibration can be attributed to", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 240, + 506, + 252 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 506, + 252 + ], + "score": 1.0, + "content": "approximation error, i.e. insufficient capacity to learn the distribution. A simple example of this is", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 252, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 106, + 252, + 505, + 262 + ], + "score": 1.0, + "content": "where we have no features to condition on (or all the features we have contain no relevant information)", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 262, + 506, + 275 + ], + "spans": [ + { + "bbox": [ + 105, + 262, + 506, + 275 + ], + "score": 1.0, + "content": "with a one-dimensional target. In Figure 2, we can see that since the target is bimodal, the Gaussian", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 273, + 244, + 284 + ], + "spans": [ + { + "bbox": [ + 106, + 273, + 244, + 284 + ], + "score": 1.0, + "content": "fit does not well describe the data.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 11, + "bbox_fs": [ + 104, + 207, + 507, + 284 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 289, + 317, + 356 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 317, + 301 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 317, + 301 + ], + "score": 1.0, + "content": "To improve this model, we replace the Gaussian with", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 301, + 317, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 301, + 317, + 312 + ], + "score": 1.0, + "content": "a normalizing flow conditioned on our data, similar", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 312, + 316, + 323 + ], + "spans": [ + { + "bbox": [ + 106, + 312, + 316, + 323 + ], + "score": 1.0, + "content": "to Figure 1b. In this way, the distribution fit to the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 323, + 318, + 334 + ], + "spans": [ + { + "bbox": [ + 106, + 323, + 318, + 334 + ], + "score": 1.0, + "content": "targets has sufficient capacity to learn complex distri-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 333, + 317, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 333, + 317, + 345 + ], + "score": 1.0, + "content": "butions, including multimodal distributions (Figure", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 344, + 121, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 121, + 358 + ], + "score": 1.0, + "content": "2).", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 289, + 318, + 358 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 370, + 229, + 392 + ], + "lines": [ + { + "bbox": [ + 105, + 369, + 204, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 204, + 381 + ], + "score": 1.0, + "content": "4.2 RECALIBRATION", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 380, + 230, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 230, + 392 + ], + "score": 1.0, + "content": "WITH NORMALIZING FLOWS", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 107, + 401, + 317, + 478 + ], + "lines": [ + { + "bbox": [ + 105, + 401, + 318, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 318, + 414 + ], + "score": 1.0, + "content": "To handle overfitting of the uncertainty, we recali-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 412, + 318, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 412, + 318, + 424 + ], + "score": 1.0, + "content": "brate the results of the original model where we as-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 424, + 317, + 434 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 317, + 434 + ], + "score": 1.0, + "content": "sume the original model outputs a full distribution", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 434, + 317, + 446 + ], + "spans": [ + { + "bbox": [ + 106, + 434, + 317, + 446 + ], + "score": 1.0, + "content": "that has closed-form likelihoods. Since the only re-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 445, + 317, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 317, + 456 + ], + "score": 1.0, + "content": "quirement is a full distribution with a closed-form", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 456, + 317, + 468 + ], + "spans": [ + { + "bbox": [ + 106, + 456, + 317, + 468 + ], + "score": 1.0, + "content": "likelihood, the original model that we recalibrate can", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 467, + 317, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 467, + 317, + 479 + ], + "score": 1.0, + "content": "be as simple as a Bayesian Linear Regression model", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 477, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 505, + 492 + ], + "score": 1.0, + "content": "or as complicated as a conditional normalizing flow. We recalibrate the original model by fitting a", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 489, + 502, + 502 + ], + "spans": [ + { + "bbox": [ + 106, + 489, + 502, + 502 + ], + "score": 1.0, + "content": "normalizing flow on top of it. In this way, the training process is the following two-step procedure:", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 401, + 318, + 479 + ] + }, + { + "type": "image", + "bbox": [ + 324, + 304, + 503, + 434 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 324, + 304, + 503, + 434 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 324, + 304, + 503, + 434 + ], + "spans": [ + { + "bbox": [ + 324, + 304, + 503, + 434 + ], + "score": 0.97, + "type": "image", + "image_path": "ad181b91bb85b484eab2f815ac5f66a3057be04180b0b5783e57d91cc0f6099a.jpg" + } + ] + } + ], + "index": 27.0, + "virtual_lines": [ + { + "bbox": [ + 324, + 304, + 503, + 317.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 324, + 317.0, + 503, + 330.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 324, + 330.0, + 503, + 343.0 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 324, + 343.0, + 503, + 356.0 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 324, + 356.0, + 503, + 369.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 324, + 369.0, + 503, + 382.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 324, + 382.0, + 503, + 395.0 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 324, + 395.0, + 503, + 408.0 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 324, + 408.0, + 503, + 421.0 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 324, + 421.0, + 503, + 434.0 + ], + "spans": [], + "index": 39 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 324, + 443, + 505, + 466 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 324, + 443, + 506, + 456 + ], + "spans": [ + { + "bbox": [ + 324, + 443, + 506, + 456 + ], + "score": 1.0, + "content": "Figure 2: One-dimensional example of Gaus-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 325, + 455, + 393, + 466 + ], + "spans": [ + { + "bbox": [ + 325, + 455, + 393, + 466 + ], + "score": 1.0, + "content": "sian versus Flow", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5 + } + ], + "index": 33.75 + }, + { + "type": "text", + "bbox": [ + 106, + 478, + 504, + 501 + ], + "lines": [], + "index": 42.5, + "bbox_fs": [ + 105, + 477, + 505, + 502 + ], + "lines_deleted": true + }, + { + "type": "interline_equation", + "bbox": [ + 129, + 508, + 335, + 546 + ], + "lines": [ + { + "bbox": [ + 129, + 508, + 335, + 546 + ], + "spans": [ + { + "bbox": [ + 129, + 508, + 335, + 546 + ], + "score": 0.69, + "content": "\\begin{array} { r l } & { 1 . \\ f _ { \\theta } = \\arg \\operatorname* { m a x } _ { f _ { \\theta } } \\sum _ { i = 1 } ^ { N _ { t r } } \\log p _ { f _ { \\theta } } ( y _ { i } ^ { t r } | x _ { i } ^ { t r } ) } \\\\ & { 2 . \\ g _ { \\phi } = \\arg \\operatorname* { m a x } _ { g _ { \\phi } } \\sum _ { i = 1 } ^ { N _ { v a l } } \\log p _ { g _ { \\phi } } ( F _ { \\theta } ( y _ { i } ^ { v a l } | x _ { i } ^ { v a l } ) ) } \\end{array}", + "type": "interline_equation", + "image_path": "c1646d62cd1f3dda7b41ed6bad0e7e343abd4ada3ef43285bf596837f42266e8.jpg" + } + ] + } + ], + "index": 45, + "virtual_lines": [ + { + "bbox": [ + 129, + 508, + 335, + 520.6666666666666 + ], + "spans": [], + "index": 44 + }, + { + "bbox": [ + 129, + 520.6666666666666, + 335, + 533.3333333333333 + ], + "spans": [], + "index": 45 + }, + { + "bbox": [ + 129, + 533.3333333333333, + 335, + 545.9999999999999 + ], + "spans": [], + "index": 46 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 555, + 505, + 613 + ], + "lines": [ + { + "bbox": [ + 102, + 551, + 508, + 584 + ], + "spans": [ + { + "bbox": [ + 102, + 551, + 132, + 584 + ], + "score": 1.0, + "content": "where the tra", + "type": "text" + }, + { + "bbox": [ + 133, + 555, + 164, + 568 + ], + "score": 0.92, + "content": "f _ { \\boldsymbol { \\theta } } ( \\boldsymbol { y } | \\boldsymbol { x } )", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 551, + 187, + 584 + ], + "score": 1.0, + "content": "is thet and", + "type": "text" + }, + { + "bbox": [ + 254, + 551, + 302, + 584 + ], + "score": 1.0, + "content": "nction given is the valid", + "type": "text" + }, + { + "bbox": [ + 303, + 558, + 309, + 566 + ], + "score": 0.55, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 551, + 313, + 584 + ], + "score": 1.0, + "content": ", i", + "type": "text" + }, + { + "bbox": [ + 313, + 555, + 347, + 568 + ], + "score": 0.9, + "content": "F _ { \\theta } ( y | x )", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 551, + 404, + 584 + ], + "score": 1.0, + "content": "is the CDF of hough the for", + "type": "text" + }, + { + "bbox": [ + 405, + 554, + 495, + 568 + ], + "score": 0.67, + "content": "f _ { \\theta } ( y | x ) , \\{ x ^ { t r } , y ^ { t r } \\} _ { i = 1 } ^ { N _ { t r } }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 551, + 508, + 584 + ], + "score": 1.0, + "content": "ison", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 187, + 567, + 254, + 581 + ], + "spans": [ + { + "bbox": [ + 187, + 567, + 254, + 581 + ], + "score": 0.93, + "content": "\\{ x ^ { v a l } , y ^ { v a l } \\} _ { i = 1 } ^ { N _ { v a l } }", + "type": "inline_equation" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 579, + 506, + 593 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 310, + 593 + ], + "score": 1.0, + "content": "above shows we can use any likelihood model for", + "type": "text" + }, + { + "bbox": [ + 310, + 581, + 321, + 592 + ], + "score": 0.86, + "content": "g _ { \\phi }", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 579, + 506, + 593 + ], + "score": 1.0, + "content": ", since isotonic regression is a method to fit a", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 588, + 505, + 604 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 604 + ], + "score": 1.0, + "content": "free form function to the CDFs, we choose to use normalizing flows, specifically QuAR Flows, as", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 601, + 500, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 601, + 500, + 613 + ], + "score": 1.0, + "content": "these are more flexible than using autoregressive flows such as MAFs (Papamakarios et al., 2017).", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 49, + "bbox_fs": [ + 102, + 551, + 508, + 613 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 618, + 338, + 630 + ], + "lines": [ + { + "bbox": [ + 105, + 615, + 339, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 339, + 633 + ], + "score": 1.0, + "content": "After the two-step training, the new generative process is:", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 52, + "bbox_fs": [ + 105, + 615, + 339, + 633 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 266, + 635, + 345, + 685 + ], + "lines": [ + { + "bbox": [ + 266, + 635, + 345, + 685 + ], + "spans": [ + { + "bbox": [ + 266, + 635, + 345, + 685 + ], + "score": 0.92, + "content": "\\begin{array} { l } { z \\sim \\mathrm { U n i f o r m } ( 0 , 1 ) } \\\\ { u = G _ { \\phi } ^ { - 1 } ( z ) } \\\\ { y = F _ { \\theta } ^ { - 1 } ( u | x ) } \\end{array}", + "type": "interline_equation", + "image_path": "80e6d83ca80da3b9239424445b97d3f04f662d18bb6ae77cac0633b9b50a4f85.jpg" + } + ] + } + ], + "index": 53.5, + "virtual_lines": [ + { + "bbox": [ + 266, + 635, + 345, + 660.0 + ], + "spans": [], + "index": 53 + }, + { + "bbox": [ + 266, + 660.0, + 345, + 685.0 + ], + "spans": [], + "index": 54 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 134, + 700 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 688, + 149, + 700 + ], + "score": 0.89, + "content": "G _ { \\phi }", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 687, + 210, + 700 + ], + "score": 1.0, + "content": "is the CDF of", + "type": "text" + }, + { + "bbox": [ + 210, + 689, + 221, + 700 + ], + "score": 0.84, + "content": "g _ { \\phi }", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 687, + 505, + 700 + ], + "score": 1.0, + "content": ". The density function of the above generative process is simply the", + "type": "text" + } + ], + "index": 55 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 279, + 712 + ], + "score": 1.0, + "content": "product of the individual density functions:", + "type": "text" + }, + { + "bbox": [ + 279, + 700, + 289, + 711 + ], + "score": 0.87, + "content": "f _ { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 699, + 307, + 712 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 307, + 700, + 318, + 711 + ], + "score": 0.84, + "content": "g _ { \\phi }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 699, + 506, + 712 + ], + "score": 1.0, + "content": ". Given this view of the generative process, one", + "type": "text" + } + ], + "index": 56 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 307, + 722 + ], + "score": 1.0, + "content": "interpretation of the two-step process is to first fit", + "type": "text" + }, + { + "bbox": [ + 307, + 711, + 313, + 720 + ], + "score": 0.82, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 710, + 415, + 722 + ], + "score": 1.0, + "content": "on the training set where", + "type": "text" + }, + { + "bbox": [ + 416, + 710, + 423, + 721 + ], + "score": 0.84, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "is initialized so that", + "type": "text" + } + ], + "index": 57 + }, + { + "bbox": [ + 107, + 720, + 504, + 735 + ], + "spans": [ + { + "bbox": [ + 107, + 720, + 126, + 735 + ], + "score": 0.91, + "content": "G _ { \\phi } ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 126, + 721, + 278, + 733 + ], + "score": 1.0, + "content": "is the identity function, and then to fit", + "type": "text" + }, + { + "bbox": [ + 279, + 722, + 285, + 732 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 721, + 426, + 733 + ], + "score": 1.0, + "content": "on the validation set while keeping", + "type": "text" + }, + { + "bbox": [ + 426, + 721, + 433, + 730 + ], + "score": 0.78, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 721, + 497, + 733 + ], + "score": 1.0, + "content": "frozen. Though", + "type": "text" + }, + { + "bbox": [ + 498, + 721, + 504, + 730 + ], + "score": 0.77, + "content": "\\theta", + "type": "inline_equation" + } + ], + "index": 58 + }, + { + "bbox": [ + 106, + 318, + 505, + 331 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 123, + 331 + ], + "score": 1.0, + "content": "and", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 123, + 319, + 130, + 330 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 131, + 318, + 505, + 331 + ], + "score": 1.0, + "content": "could be trained end-to-end, similar to the approach in Section 4.1, we show in our experiments", + "type": "text", + "cross_page": true + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 329, + 353, + 342 + ], + "spans": [ + { + "bbox": [ + 106, + 329, + 353, + 342 + ], + "score": 1.0, + "content": "(Section 6.2) that there are benefits to this two-step approach.", + "type": "text", + "cross_page": true + } + ], + "index": 9 + } + ], + "index": 56.5, + "bbox_fs": [ + 105, + 687, + 506, + 735 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 80, + 504, + 226 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 80, + 504, + 226 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 80, + 504, + 226 + ], + "spans": [ + { + "bbox": [ + 109, + 80, + 504, + 226 + ], + "score": 0.967, + "type": "image", + "image_path": "9212fa4438adc3e36c2e75cfd149f1d9ffde426fb5aa80f4de671bd843cb558c.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 80, + 504, + 128.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 128.66666666666666, + 504, + 177.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 177.33333333333331, + 504, + 225.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 235, + 506, + 291 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 235, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 235, + 505, + 249 + ], + "score": 1.0, + "content": "Figure 3: Comparison plots of isotonic regression and flow recalibration on multiple outputs. The two", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 247, + 505, + 259 + ], + "spans": [ + { + "bbox": [ + 106, + 247, + 505, + 259 + ], + "score": 1.0, + "content": "axes are different targets being modeled, and the scatter plot shows that the targets are correlated. The", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 257, + 507, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 507, + 270 + ], + "score": 1.0, + "content": "top and right sides show the marginal histogram as well as the fit from the recalibrated distribution.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 269, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 269, + 505, + 281 + ], + "score": 1.0, + "content": "The contour plot shows the two-dimensional contours of the recalibrated distribution which can be", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 280, + 288, + 292 + ], + "spans": [ + { + "bbox": [ + 106, + 280, + 288, + 292 + ], + "score": 1.0, + "content": "seen to not align well for isotonic regression.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 105, + 318, + 504, + 340 + ], + "lines": [ + { + "bbox": [ + 106, + 318, + 505, + 331 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 123, + 331 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 123, + 319, + 130, + 330 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 318, + 505, + 331 + ], + "score": 1.0, + "content": "could be trained end-to-end, similar to the approach in Section 4.1, we show in our experiments", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 329, + 353, + 342 + ], + "spans": [ + { + "bbox": [ + 106, + 329, + 353, + 342 + ], + "score": 1.0, + "content": "(Section 6.2) that there are benefits to this two-step approach.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 107, + 346, + 505, + 434 + ], + "lines": [ + { + "bbox": [ + 106, + 347, + 505, + 358 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 505, + 358 + ], + "score": 1.0, + "content": "Given this log-likelihood viewpoint of recalibration, we can trivially incorporate conditioning of the", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 358, + 506, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 351, + 370 + ], + "score": 1.0, + "content": "normalizing flow on additional information. For example, say", + "type": "text" + }, + { + "bbox": [ + 351, + 358, + 362, + 369 + ], + "score": 0.88, + "content": "f _ { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 358, + 394, + 370 + ], + "score": 1.0, + "content": "outputs", + "type": "text" + }, + { + "bbox": [ + 394, + 359, + 402, + 369 + ], + "score": 0.82, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 358, + 419, + 370 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 419, + 359, + 427, + 367 + ], + "score": 0.77, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 358, + 506, + 370 + ], + "score": 1.0, + "content": "that parameterize a", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 368, + 506, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 283, + 381 + ], + "score": 1.0, + "content": "Normal distribution, we could then condition", + "type": "text" + }, + { + "bbox": [ + 283, + 370, + 294, + 380 + ], + "score": 0.86, + "content": "g _ { \\phi }", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 368, + 506, + 381 + ], + "score": 1.0, + "content": "on these two outputs. If we were to use many features", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 379, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 506, + 392 + ], + "score": 1.0, + "content": "to condition on, we would return to the first situation where we could overfit to the finite number of", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 317, + 403 + ], + "score": 1.0, + "content": "observations we have. We can think of the first model", + "type": "text" + }, + { + "bbox": [ + 318, + 390, + 328, + 402 + ], + "score": 0.85, + "content": "f _ { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 390, + 505, + 403 + ], + "score": 1.0, + "content": "as compressing/embedding the data into two", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 401, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 506, + 414 + ], + "score": 1.0, + "content": "dimensions, and the second model utilizing the embedding to create a meaningful and well-calibrated", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 411, + 506, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 506, + 426 + ], + "score": 1.0, + "content": "distribution on the target. Compared to isotonic regression, we can easily incorporate conditional", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 423, + 486, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 486, + 436 + ], + "score": 1.0, + "content": "information while retaining monotonicity as normalizing flows are monotonic by construction.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 107, + 440, + 505, + 495 + ], + "lines": [ + { + "bbox": [ + 106, + 439, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 439, + 505, + 453 + ], + "score": 1.0, + "content": "Recalibration is interesting in that it is useful for both overfitting as well as underfitting. From", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 450, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 505, + 464 + ], + "score": 1.0, + "content": "Guo et al. (2017), we see that multinomial classification models have sufficient capacity to overfit", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 461, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 505, + 475 + ], + "score": 1.0, + "content": "uncertainties and benefit from recalibration. On the other hand, the simple example in Figure 2 suffers", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 473, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 505, + 486 + ], + "score": 1.0, + "content": "from miscalibrated uncertainties due to approximation uncertainty (underfitting), and recalibration", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 484, + 238, + 496 + ], + "spans": [ + { + "bbox": [ + 106, + 484, + 238, + 496 + ], + "score": 1.0, + "content": "reduces the approximation error.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 501, + 505, + 556 + ], + "lines": [ + { + "bbox": [ + 106, + 501, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 501, + 505, + 513 + ], + "score": 1.0, + "content": "One solution to handling overfitting is to early-stop on a validation set. Whether early stopping occurs", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 511, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 506, + 525 + ], + "score": 1.0, + "content": "or not, our solution incorporates the information of the validation set to correct potential overfitting.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 523, + 505, + 535 + ], + "spans": [ + { + "bbox": [ + 106, + 523, + 505, + 535 + ], + "score": 1.0, + "content": "However, if we try to correct for multiple sources of overfitting, then we could introduce a new", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 533, + 506, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 506, + 546 + ], + "score": 1.0, + "content": "overfitting problem. In essence, there is a tradeoff between the validation size (which in turn controls", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 544, + 452, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 452, + 558 + ], + "score": 1.0, + "content": "training size) and how many sources of overfitting one can try to correct after training.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 25 + }, + { + "type": "title", + "bbox": [ + 108, + 576, + 270, + 587 + ], + "lines": [ + { + "bbox": [ + 105, + 576, + 272, + 588 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 272, + 588 + ], + "score": 1.0, + "content": "4.3 MULTIVARIATE RECALIBRATION", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 599, + 505, + 632 + ], + "lines": [ + { + "bbox": [ + 105, + 598, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 505, + 612 + ], + "score": 1.0, + "content": "Whereas Platt scaling (Guo et al., 2017) and isotonic regression (Kuleshov et al., 2018) have been", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 609, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 505, + 623 + ], + "score": 1.0, + "content": "shown to improve the calibration of distributions when we have one-dimensional outputs, scaling", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 622, + 335, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 335, + 633 + ], + "score": 1.0, + "content": "these solutions to high-dimensional targets is non-trivial.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 107, + 637, + 505, + 704 + ], + "lines": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "Say we are modeling two-dimensional real-valued targets and use isotonic regression to calibrate", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 649, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 506, + 662 + ], + "score": 1.0, + "content": "the targets individually. For simplicity, say we use amortized inference with independent output", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 660, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 506, + 673 + ], + "score": 1.0, + "content": "distributions. If the targets are not conditionally independent, the distribution will not be well-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "score": 1.0, + "content": "calibrated, even after recalibration with isotonic regression (Figure 3a). However, using normalizing", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 681, + 506, + 695 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 506, + 695 + ], + "score": 1.0, + "content": "flows, we can compute the CDF of the observed targets per output distribution and recalibrate this", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 693, + 274, + 705 + ], + "spans": [ + { + "bbox": [ + 106, + 693, + 274, + 705 + ], + "score": 1.0, + "content": "two-dimensional distribution (Figure 3b).", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 503, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 259, + 722 + ], + "score": 1.0, + "content": "The general procedure of recalibrating", + "type": "text" + }, + { + "bbox": [ + 259, + 712, + 269, + 720 + ], + "score": 0.85, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "-dimensional distributions is to fit a normalizing flow on the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 107, + 718, + 266, + 734 + ], + "spans": [ + { + "bbox": [ + 107, + 721, + 117, + 730 + ], + "score": 0.78, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 718, + 197, + 734 + ], + "score": 1.0, + "content": "-dimensional vector", + "type": "text" + }, + { + "bbox": [ + 198, + 721, + 262, + 732 + ], + "score": 0.93, + "content": "x _ { i } = F ( y _ { i } | y _ { < i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 718, + 266, + 734 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 306, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 80, + 504, + 226 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 80, + 504, + 226 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 80, + 504, + 226 + ], + "spans": [ + { + "bbox": [ + 109, + 80, + 504, + 226 + ], + "score": 0.967, + "type": "image", + "image_path": "9212fa4438adc3e36c2e75cfd149f1d9ffde426fb5aa80f4de671bd843cb558c.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 80, + 504, + 128.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 128.66666666666666, + 504, + 177.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 177.33333333333331, + 504, + 225.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 235, + 506, + 291 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 235, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 235, + 505, + 249 + ], + "score": 1.0, + "content": "Figure 3: Comparison plots of isotonic regression and flow recalibration on multiple outputs. The two", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 247, + 505, + 259 + ], + "spans": [ + { + "bbox": [ + 106, + 247, + 505, + 259 + ], + "score": 1.0, + "content": "axes are different targets being modeled, and the scatter plot shows that the targets are correlated. The", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 257, + 507, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 507, + 270 + ], + "score": 1.0, + "content": "top and right sides show the marginal histogram as well as the fit from the recalibrated distribution.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 269, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 269, + 505, + 281 + ], + "score": 1.0, + "content": "The contour plot shows the two-dimensional contours of the recalibrated distribution which can be", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 280, + 288, + 292 + ], + "spans": [ + { + "bbox": [ + 106, + 280, + 288, + 292 + ], + "score": 1.0, + "content": "seen to not align well for isotonic regression.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 105, + 318, + 504, + 340 + ], + "lines": [], + "index": 8.5, + "bbox_fs": [ + 106, + 318, + 505, + 342 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 346, + 505, + 434 + ], + "lines": [ + { + "bbox": [ + 106, + 347, + 505, + 358 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 505, + 358 + ], + "score": 1.0, + "content": "Given this log-likelihood viewpoint of recalibration, we can trivially incorporate conditioning of the", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 358, + 506, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 351, + 370 + ], + "score": 1.0, + "content": "normalizing flow on additional information. For example, say", + "type": "text" + }, + { + "bbox": [ + 351, + 358, + 362, + 369 + ], + "score": 0.88, + "content": "f _ { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 358, + 394, + 370 + ], + "score": 1.0, + "content": "outputs", + "type": "text" + }, + { + "bbox": [ + 394, + 359, + 402, + 369 + ], + "score": 0.82, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 358, + 419, + 370 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 419, + 359, + 427, + 367 + ], + "score": 0.77, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 358, + 506, + 370 + ], + "score": 1.0, + "content": "that parameterize a", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 368, + 506, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 283, + 381 + ], + "score": 1.0, + "content": "Normal distribution, we could then condition", + "type": "text" + }, + { + "bbox": [ + 283, + 370, + 294, + 380 + ], + "score": 0.86, + "content": "g _ { \\phi }", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 368, + 506, + 381 + ], + "score": 1.0, + "content": "on these two outputs. If we were to use many features", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 379, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 506, + 392 + ], + "score": 1.0, + "content": "to condition on, we would return to the first situation where we could overfit to the finite number of", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 317, + 403 + ], + "score": 1.0, + "content": "observations we have. We can think of the first model", + "type": "text" + }, + { + "bbox": [ + 318, + 390, + 328, + 402 + ], + "score": 0.85, + "content": "f _ { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 390, + 505, + 403 + ], + "score": 1.0, + "content": "as compressing/embedding the data into two", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 401, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 506, + 414 + ], + "score": 1.0, + "content": "dimensions, and the second model utilizing the embedding to create a meaningful and well-calibrated", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 411, + 506, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 506, + 426 + ], + "score": 1.0, + "content": "distribution on the target. Compared to isotonic regression, we can easily incorporate conditional", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 423, + 486, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 486, + 436 + ], + "score": 1.0, + "content": "information while retaining monotonicity as normalizing flows are monotonic by construction.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 347, + 506, + 436 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 440, + 505, + 495 + ], + "lines": [ + { + "bbox": [ + 106, + 439, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 439, + 505, + 453 + ], + "score": 1.0, + "content": "Recalibration is interesting in that it is useful for both overfitting as well as underfitting. From", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 450, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 505, + 464 + ], + "score": 1.0, + "content": "Guo et al. (2017), we see that multinomial classification models have sufficient capacity to overfit", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 461, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 505, + 475 + ], + "score": 1.0, + "content": "uncertainties and benefit from recalibration. On the other hand, the simple example in Figure 2 suffers", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 473, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 505, + 486 + ], + "score": 1.0, + "content": "from miscalibrated uncertainties due to approximation uncertainty (underfitting), and recalibration", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 484, + 238, + 496 + ], + "spans": [ + { + "bbox": [ + 106, + 484, + 238, + 496 + ], + "score": 1.0, + "content": "reduces the approximation error.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 439, + 505, + 496 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 501, + 505, + 556 + ], + "lines": [ + { + "bbox": [ + 106, + 501, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 501, + 505, + 513 + ], + "score": 1.0, + "content": "One solution to handling overfitting is to early-stop on a validation set. Whether early stopping occurs", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 511, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 506, + 525 + ], + "score": 1.0, + "content": "or not, our solution incorporates the information of the validation set to correct potential overfitting.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 523, + 505, + 535 + ], + "spans": [ + { + "bbox": [ + 106, + 523, + 505, + 535 + ], + "score": 1.0, + "content": "However, if we try to correct for multiple sources of overfitting, then we could introduce a new", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 533, + 506, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 506, + 546 + ], + "score": 1.0, + "content": "overfitting problem. In essence, there is a tradeoff between the validation size (which in turn controls", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 544, + 452, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 452, + 558 + ], + "score": 1.0, + "content": "training size) and how many sources of overfitting one can try to correct after training.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 501, + 506, + 558 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 576, + 270, + 587 + ], + "lines": [ + { + "bbox": [ + 105, + 576, + 272, + 588 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 272, + 588 + ], + "score": 1.0, + "content": "4.3 MULTIVARIATE RECALIBRATION", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 599, + 505, + 632 + ], + "lines": [ + { + "bbox": [ + 105, + 598, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 505, + 612 + ], + "score": 1.0, + "content": "Whereas Platt scaling (Guo et al., 2017) and isotonic regression (Kuleshov et al., 2018) have been", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 609, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 505, + 623 + ], + "score": 1.0, + "content": "shown to improve the calibration of distributions when we have one-dimensional outputs, scaling", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 622, + 335, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 335, + 633 + ], + "score": 1.0, + "content": "these solutions to high-dimensional targets is non-trivial.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 598, + 505, + 633 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 637, + 505, + 704 + ], + "lines": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "Say we are modeling two-dimensional real-valued targets and use isotonic regression to calibrate", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 649, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 506, + 662 + ], + "score": 1.0, + "content": "the targets individually. For simplicity, say we use amortized inference with independent output", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 660, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 506, + 673 + ], + "score": 1.0, + "content": "distributions. If the targets are not conditionally independent, the distribution will not be well-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "score": 1.0, + "content": "calibrated, even after recalibration with isotonic regression (Figure 3a). However, using normalizing", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 681, + 506, + 695 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 506, + 695 + ], + "score": 1.0, + "content": "flows, we can compute the CDF of the observed targets per output distribution and recalibrate this", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 693, + 274, + 705 + ], + "spans": [ + { + "bbox": [ + 106, + 693, + 274, + 705 + ], + "score": 1.0, + "content": "two-dimensional distribution (Figure 3b).", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 34.5, + "bbox_fs": [ + 105, + 638, + 506, + 705 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 503, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 259, + 722 + ], + "score": 1.0, + "content": "The general procedure of recalibrating", + "type": "text" + }, + { + "bbox": [ + 259, + 712, + 269, + 720 + ], + "score": 0.85, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "-dimensional distributions is to fit a normalizing flow on the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 107, + 718, + 266, + 734 + ], + "spans": [ + { + "bbox": [ + 107, + 721, + 117, + 730 + ], + "score": 0.78, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 718, + 197, + 734 + ], + "score": 1.0, + "content": "-dimensional vector", + "type": "text" + }, + { + "bbox": [ + 198, + 721, + 262, + 732 + ], + "score": 0.93, + "content": "x _ { i } = F ( y _ { i } | y _ { < i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 718, + 266, + 734 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 708, + 505, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 96, + 489, + 256 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 96, + 489, + 256 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 96, + 489, + 256 + ], + "spans": [ + { + "bbox": [ + 108, + 96, + 489, + 256 + ], + "score": 0.964, + "type": "image", + "image_path": "bd31ec7371b5fbab3c41c4af090e7e01d02a0effd5315ff0fe11e911a5356c31.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 96, + 489, + 149.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 149.33333333333334, + 489, + 202.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 202.66666666666669, + 489, + 256.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 265, + 505, + 298 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 264, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 505, + 279 + ], + "score": 1.0, + "content": "Figure 4: Calibration Q-Q plots for recalibration using isotonic regression and recalibration using", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 275, + 505, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 288 + ], + "score": 1.0, + "content": "flows for the simulated multivariate case in Figure 3a. The legend contains the calibration error for", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 286, + 155, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 155, + 299 + ], + "score": 1.0, + "content": "each curve.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 107, + 319, + 347, + 333 + ], + "lines": [ + { + "bbox": [ + 105, + 319, + 348, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 348, + 334 + ], + "score": 1.0, + "content": "5 MULTIVARIATE RECALIBRATION EXAMPLE", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 107, + 345, + 505, + 412 + ], + "lines": [ + { + "bbox": [ + 106, + 346, + 506, + 358 + ], + "spans": [ + { + "bbox": [ + 106, + 346, + 506, + 358 + ], + "score": 1.0, + "content": "In multiclass classification, we often focus on individual metrics such as accuracy, precision, recall,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 356, + 506, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 506, + 369 + ], + "score": 1.0, + "content": "F1, etc. However, exploring the accuracy of the separate classes using a confusion matrix can show if", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 367, + 506, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 506, + 380 + ], + "score": 1.0, + "content": "the model is biased even if the performance on average is good. Similar to this view for classification,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 379, + 505, + 391 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 505, + 391 + ], + "score": 1.0, + "content": "we extend the calibration plot introduced in (Kuleshov et al., 2018) to show calibration performance", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 389, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 505, + 403 + ], + "score": 1.0, + "content": "on different subsets of the data, binned by either a feature or a prediction, e.g. Figure 4. The only", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 399, + 415, + 415 + ], + "spans": [ + { + "bbox": [ + 104, + 399, + 415, + 415 + ], + "score": 1.0, + "content": "restriction is the binning cannot be a function of the target we are evaluating.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 108, + 417, + 504, + 451 + ], + "lines": [ + { + "bbox": [ + 106, + 417, + 506, + 430 + ], + "spans": [ + { + "bbox": [ + 106, + 417, + 347, + 430 + ], + "score": 1.0, + "content": "Say we are modeling two-dimensional real-valued targets", + "type": "text" + }, + { + "bbox": [ + 347, + 417, + 380, + 429 + ], + "score": 0.95, + "content": "( Y _ { 1 } , Y _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 417, + 506, + 430 + ], + "score": 1.0, + "content": "shown in Figure 3a. If we fit", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 427, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 427, + 505, + 441 + ], + "score": 1.0, + "content": "independent Gaussians to the target, the resulting distribution will not align with the contours of the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 438, + 129, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 129, + 452 + ], + "score": 1.0, + "content": "data.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 456, + 505, + 511 + ], + "lines": [ + { + "bbox": [ + 105, + 455, + 503, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 417, + 469 + ], + "score": 1.0, + "content": "We first recalibrate the distribution by fittting isotonic regression models on", + "type": "text" + }, + { + "bbox": [ + 417, + 456, + 444, + 469 + ], + "score": 0.93, + "content": "F ( Y _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 455, + 462, + 469 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 463, + 456, + 503, + 469 + ], + "score": 0.93, + "content": "F ( Y _ { 2 } | Y _ { 1 } )", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 466, + 506, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 171, + 480 + ], + "score": 1.0, + "content": "The results for", + "type": "text" + }, + { + "bbox": [ + 171, + 467, + 210, + 479 + ], + "score": 0.93, + "content": "F ( Y _ { 2 } | Y _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 211, + 466, + 506, + 480 + ], + "score": 1.0, + "content": "are shown in Figure 4a where we can see that, though across the full", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 478, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 478, + 327, + 491 + ], + "score": 1.0, + "content": "dataset the calibration error is zero, when we bucket by", + "type": "text" + }, + { + "bbox": [ + 327, + 479, + 354, + 491 + ], + "score": 0.92, + "content": "F ( Y _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 478, + 505, + 491 + ], + "score": 1.0, + "content": ", the calibration error achieved is both", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 252, + 502 + ], + "score": 1.0, + "content": "significant and a strong function of", + "type": "text" + }, + { + "bbox": [ + 253, + 489, + 264, + 500 + ], + "score": 0.88, + "content": "Y _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 489, + 446, + 502 + ], + "score": 1.0, + "content": "as it is unable to account for correlations in", + "type": "text" + }, + { + "bbox": [ + 447, + 489, + 458, + 500 + ], + "score": 0.87, + "content": "Y _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 458, + 489, + 477, + 502 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 477, + 489, + 488, + 500 + ], + "score": 0.86, + "content": "Y _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 489, + 505, + 502 + ], + "score": 1.0, + "content": ". In", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 499, + 479, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 479, + 513 + ], + "score": 1.0, + "content": "other words, the model is not calibrated in any given region of the data but only in aggregate.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 517, + 505, + 605 + ], + "lines": [ + { + "bbox": [ + 106, + 517, + 506, + 530 + ], + "spans": [ + { + "bbox": [ + 106, + 517, + 425, + 530 + ], + "score": 1.0, + "content": "However, if we recalibrate using normalizing flows by fitting a flow on the pair", + "type": "text" + }, + { + "bbox": [ + 425, + 517, + 502, + 529 + ], + "score": 0.9, + "content": "( F ( Y _ { 1 } ) , F ( Y _ { 2 } | Y _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 517, + 506, + 530 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 528, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 312, + 540 + ], + "score": 1.0, + "content": "we can see in Figure 4b that even if we bucket by", + "type": "text" + }, + { + "bbox": [ + 312, + 528, + 339, + 540 + ], + "score": 0.95, + "content": "F ( Y _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 528, + 506, + 540 + ], + "score": 1.0, + "content": ", the calibration error stays close to zero.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 538, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 505, + 551 + ], + "score": 1.0, + "content": "Unlike isotonic regression, the flow can learn the correlation between the CDFs by being trained", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 550, + 506, + 562 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 506, + 562 + ], + "score": 1.0, + "content": "jointly on all of them. In addition to this, had we used a more complex calibration model that could", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 560, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 505, + 573 + ], + "score": 1.0, + "content": "model the correlations directly, we would not be able to compute the correlation after recalibrating", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 572, + 504, + 583 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 504, + 583 + ], + "score": 1.0, + "content": "with isotonic regression. By recalibrating with flows, we obtain a result that is still a distribution with", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 582, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 505, + 595 + ], + "score": 1.0, + "content": "a closed-form likelihood; this allows us to still be able to use the model to compute the correlation", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 594, + 258, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 258, + 606 + ], + "score": 1.0, + "content": "and any other distributional statistics.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 107, + 610, + 505, + 666 + ], + "lines": [ + { + "bbox": [ + 106, + 610, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 505, + 622 + ], + "score": 1.0, + "content": "In Figure 5, we show visually the difference between recalibration with flows and with isotonic", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 621, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 506, + 635 + ], + "score": 1.0, + "content": "regression. The key differences being that flows can recalibrate the CDFs jointly and be conditioned", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 632, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 209, + 646 + ], + "score": 1.0, + "content": "on additional information", + "type": "text" + }, + { + "bbox": [ + 209, + 635, + 215, + 643 + ], + "score": 0.54, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 632, + 505, + 646 + ], + "score": 1.0, + "content": ", while isotonic regression is fit on each CDF independently and is unable", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "to incorporate any additional information. The reason is that flows are monotonic by construction", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 655, + 344, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 344, + 667 + ], + "score": 1.0, + "content": "and can therefore handle multiple variables and conditions.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31 + }, + { + "type": "title", + "bbox": [ + 107, + 684, + 200, + 696 + ], + "lines": [ + { + "bbox": [ + 105, + 682, + 201, + 698 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 201, + 698 + ], + "score": 1.0, + "content": "6 EXPERIMENTS", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 710, + 504, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 504, + 721 + ], + "score": 1.0, + "content": "In this section, we analyze the performance of flows on multiple UCI datasets. Importantly, we do", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "not aim for state-of-the-art performance, nor do we expect normalizing flows to outperform isotonic", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5 + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 306, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "6", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 96, + 489, + 256 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 96, + 489, + 256 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 96, + 489, + 256 + ], + "spans": [ + { + "bbox": [ + 108, + 96, + 489, + 256 + ], + "score": 0.964, + "type": "image", + "image_path": "bd31ec7371b5fbab3c41c4af090e7e01d02a0effd5315ff0fe11e911a5356c31.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 96, + 489, + 149.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 149.33333333333334, + 489, + 202.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 202.66666666666669, + 489, + 256.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 265, + 505, + 298 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 264, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 505, + 279 + ], + "score": 1.0, + "content": "Figure 4: Calibration Q-Q plots for recalibration using isotonic regression and recalibration using", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 275, + 505, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 288 + ], + "score": 1.0, + "content": "flows for the simulated multivariate case in Figure 3a. The legend contains the calibration error for", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 286, + 155, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 155, + 299 + ], + "score": 1.0, + "content": "each curve.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 107, + 319, + 347, + 333 + ], + "lines": [ + { + "bbox": [ + 105, + 319, + 348, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 348, + 334 + ], + "score": 1.0, + "content": "5 MULTIVARIATE RECALIBRATION EXAMPLE", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 107, + 345, + 505, + 412 + ], + "lines": [ + { + "bbox": [ + 106, + 346, + 506, + 358 + ], + "spans": [ + { + "bbox": [ + 106, + 346, + 506, + 358 + ], + "score": 1.0, + "content": "In multiclass classification, we often focus on individual metrics such as accuracy, precision, recall,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 356, + 506, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 506, + 369 + ], + "score": 1.0, + "content": "F1, etc. However, exploring the accuracy of the separate classes using a confusion matrix can show if", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 367, + 506, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 506, + 380 + ], + "score": 1.0, + "content": "the model is biased even if the performance on average is good. Similar to this view for classification,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 379, + 505, + 391 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 505, + 391 + ], + "score": 1.0, + "content": "we extend the calibration plot introduced in (Kuleshov et al., 2018) to show calibration performance", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 389, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 505, + 403 + ], + "score": 1.0, + "content": "on different subsets of the data, binned by either a feature or a prediction, e.g. Figure 4. The only", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 399, + 415, + 415 + ], + "spans": [ + { + "bbox": [ + 104, + 399, + 415, + 415 + ], + "score": 1.0, + "content": "restriction is the binning cannot be a function of the target we are evaluating.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 9.5, + "bbox_fs": [ + 104, + 346, + 506, + 415 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 417, + 504, + 451 + ], + "lines": [ + { + "bbox": [ + 106, + 417, + 506, + 430 + ], + "spans": [ + { + "bbox": [ + 106, + 417, + 347, + 430 + ], + "score": 1.0, + "content": "Say we are modeling two-dimensional real-valued targets", + "type": "text" + }, + { + "bbox": [ + 347, + 417, + 380, + 429 + ], + "score": 0.95, + "content": "( Y _ { 1 } , Y _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 417, + 506, + 430 + ], + "score": 1.0, + "content": "shown in Figure 3a. If we fit", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 427, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 427, + 505, + 441 + ], + "score": 1.0, + "content": "independent Gaussians to the target, the resulting distribution will not align with the contours of the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 438, + 129, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 129, + 452 + ], + "score": 1.0, + "content": "data.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 417, + 506, + 452 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 456, + 505, + 511 + ], + "lines": [ + { + "bbox": [ + 105, + 455, + 503, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 417, + 469 + ], + "score": 1.0, + "content": "We first recalibrate the distribution by fittting isotonic regression models on", + "type": "text" + }, + { + "bbox": [ + 417, + 456, + 444, + 469 + ], + "score": 0.93, + "content": "F ( Y _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 455, + 462, + 469 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 463, + 456, + 503, + 469 + ], + "score": 0.93, + "content": "F ( Y _ { 2 } | Y _ { 1 } )", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 466, + 506, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 171, + 480 + ], + "score": 1.0, + "content": "The results for", + "type": "text" + }, + { + "bbox": [ + 171, + 467, + 210, + 479 + ], + "score": 0.93, + "content": "F ( Y _ { 2 } | Y _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 211, + 466, + 506, + 480 + ], + "score": 1.0, + "content": "are shown in Figure 4a where we can see that, though across the full", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 478, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 478, + 327, + 491 + ], + "score": 1.0, + "content": "dataset the calibration error is zero, when we bucket by", + "type": "text" + }, + { + "bbox": [ + 327, + 479, + 354, + 491 + ], + "score": 0.92, + "content": "F ( Y _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 478, + 505, + 491 + ], + "score": 1.0, + "content": ", the calibration error achieved is both", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 252, + 502 + ], + "score": 1.0, + "content": "significant and a strong function of", + "type": "text" + }, + { + "bbox": [ + 253, + 489, + 264, + 500 + ], + "score": 0.88, + "content": "Y _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 489, + 446, + 502 + ], + "score": 1.0, + "content": "as it is unable to account for correlations in", + "type": "text" + }, + { + "bbox": [ + 447, + 489, + 458, + 500 + ], + "score": 0.87, + "content": "Y _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 458, + 489, + 477, + 502 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 477, + 489, + 488, + 500 + ], + "score": 0.86, + "content": "Y _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 489, + 505, + 502 + ], + "score": 1.0, + "content": ". In", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 499, + 479, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 479, + 513 + ], + "score": 1.0, + "content": "other words, the model is not calibrated in any given region of the data but only in aggregate.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 455, + 506, + 513 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 517, + 505, + 605 + ], + "lines": [ + { + "bbox": [ + 106, + 517, + 506, + 530 + ], + "spans": [ + { + "bbox": [ + 106, + 517, + 425, + 530 + ], + "score": 1.0, + "content": "However, if we recalibrate using normalizing flows by fitting a flow on the pair", + "type": "text" + }, + { + "bbox": [ + 425, + 517, + 502, + 529 + ], + "score": 0.9, + "content": "( F ( Y _ { 1 } ) , F ( Y _ { 2 } | Y _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 517, + 506, + 530 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 528, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 312, + 540 + ], + "score": 1.0, + "content": "we can see in Figure 4b that even if we bucket by", + "type": "text" + }, + { + "bbox": [ + 312, + 528, + 339, + 540 + ], + "score": 0.95, + "content": "F ( Y _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 528, + 506, + 540 + ], + "score": 1.0, + "content": ", the calibration error stays close to zero.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 538, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 505, + 551 + ], + "score": 1.0, + "content": "Unlike isotonic regression, the flow can learn the correlation between the CDFs by being trained", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 550, + 506, + 562 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 506, + 562 + ], + "score": 1.0, + "content": "jointly on all of them. In addition to this, had we used a more complex calibration model that could", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 560, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 505, + 573 + ], + "score": 1.0, + "content": "model the correlations directly, we would not be able to compute the correlation after recalibrating", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 572, + 504, + 583 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 504, + 583 + ], + "score": 1.0, + "content": "with isotonic regression. By recalibrating with flows, we obtain a result that is still a distribution with", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 582, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 505, + 595 + ], + "score": 1.0, + "content": "a closed-form likelihood; this allows us to still be able to use the model to compute the correlation", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 594, + 258, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 258, + 606 + ], + "score": 1.0, + "content": "and any other distributional statistics.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 517, + 506, + 606 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 610, + 505, + 666 + ], + "lines": [ + { + "bbox": [ + 106, + 610, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 505, + 622 + ], + "score": 1.0, + "content": "In Figure 5, we show visually the difference between recalibration with flows and with isotonic", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 621, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 506, + 635 + ], + "score": 1.0, + "content": "regression. The key differences being that flows can recalibrate the CDFs jointly and be conditioned", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 632, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 209, + 646 + ], + "score": 1.0, + "content": "on additional information", + "type": "text" + }, + { + "bbox": [ + 209, + 635, + 215, + 643 + ], + "score": 0.54, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 632, + 505, + 646 + ], + "score": 1.0, + "content": ", while isotonic regression is fit on each CDF independently and is unable", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "to incorporate any additional information. The reason is that flows are monotonic by construction", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 655, + 344, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 344, + 667 + ], + "score": 1.0, + "content": "and can therefore handle multiple variables and conditions.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 610, + 506, + 667 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 684, + 200, + 696 + ], + "lines": [ + { + "bbox": [ + 105, + 682, + 201, + 698 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 201, + 698 + ], + "score": 1.0, + "content": "6 EXPERIMENTS", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 710, + 504, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 504, + 721 + ], + "score": 1.0, + "content": "In this section, we analyze the performance of flows on multiple UCI datasets. Importantly, we do", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "not aim for state-of-the-art performance, nor do we expect normalizing flows to outperform isotonic", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 710, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 168, + 78, + 442, + 324 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 168, + 78, + 442, + 324 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 168, + 78, + 442, + 324 + ], + "spans": [ + { + "bbox": [ + 168, + 78, + 442, + 324 + ], + "score": 0.97, + "type": "image", + "image_path": "875700dffcddbe4a75f5e5d09bdaf048c24fbe3c4bd6dcd6bef0495db4def2fa.jpg" + } + ] + } + ], + "index": 8.5, + "virtual_lines": [ + { + "bbox": [ + 168, + 78, + 442, + 91.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 168, + 91.66666666666667, + 442, + 105.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 168, + 105.33333333333334, + 442, + 119.00000000000001 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 168, + 119.00000000000001, + 442, + 132.66666666666669 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 168, + 132.66666666666669, + 442, + 146.33333333333334 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 168, + 146.33333333333334, + 442, + 160.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 168, + 160.0, + 442, + 173.66666666666666 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 168, + 173.66666666666666, + 442, + 187.33333333333331 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 168, + 187.33333333333331, + 442, + 200.99999999999997 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 168, + 200.99999999999997, + 442, + 214.66666666666663 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 168, + 214.66666666666663, + 442, + 228.3333333333333 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 168, + 228.3333333333333, + 442, + 241.99999999999994 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 168, + 241.99999999999994, + 442, + 255.6666666666666 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 168, + 255.6666666666666, + 442, + 269.33333333333326 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 168, + 269.33333333333326, + 442, + 282.99999999999994 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 168, + 282.99999999999994, + 442, + 296.66666666666663 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 168, + 296.66666666666663, + 442, + 310.3333333333333 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 168, + 310.3333333333333, + 442, + 324.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 333, + 506, + 388 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 333, + 506, + 346 + ], + "spans": [ + { + "bbox": [ + 105, + 333, + 506, + 346 + ], + "score": 1.0, + "content": "Figure 5: A diagram for multivariate recalibration using the same notation as that used in Section", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 343, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 104, + 343, + 505, + 357 + ], + "score": 1.0, + "content": "4.2. The first step for recalibration is always the calibration step, shown in the blue box, where any", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 354, + 505, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 175, + 366 + ], + "score": 1.0, + "content": "likelihood model", + "type": "text" + }, + { + "bbox": [ + 175, + 355, + 186, + 367 + ], + "score": 0.86, + "content": "f _ { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 354, + 505, + 366 + ], + "score": 1.0, + "content": "can be used. On the left, isotonic regression is used to recalibrate the CDFs from", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 107, + 365, + 506, + 379 + ], + "spans": [ + { + "bbox": [ + 107, + 366, + 117, + 378 + ], + "score": 0.84, + "content": "f _ { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 365, + 245, + 379 + ], + "score": 1.0, + "content": "; on the right, normalizing flows", + "type": "text" + }, + { + "bbox": [ + 245, + 367, + 256, + 378 + ], + "score": 0.86, + "content": "g _ { \\phi }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 365, + 408, + 379 + ], + "score": 1.0, + "content": "are used to recalibrate the CDFs from", + "type": "text" + }, + { + "bbox": [ + 409, + 366, + 419, + 378 + ], + "score": 0.85, + "content": "f _ { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 365, + 506, + 379 + ], + "score": 1.0, + "content": "conditioned on some", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 107, + 379, + 116, + 389 + ], + "spans": [ + { + "bbox": [ + 107, + 380, + 112, + 387 + ], + "score": 0.29, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 113, + 379, + 116, + 389 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20 + } + ], + "index": 14.25 + }, + { + "type": "text", + "bbox": [ + 107, + 414, + 505, + 447 + ], + "lines": [ + { + "bbox": [ + 105, + 414, + 505, + 427 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 505, + 427 + ], + "score": 1.0, + "content": "regression in aggregate. In terms of calibration, we show that the increase in expressivity can be", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 424, + 505, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 505, + 439 + ], + "score": 1.0, + "content": "beneficial; in terms of recalibration, we show specific failure points of isotonic regression that binning", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 437, + 328, + 449 + ], + "spans": [ + { + "bbox": [ + 106, + 437, + 328, + 449 + ], + "score": 1.0, + "content": "uncovers and how normalizing flows fixes these issues.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24 + }, + { + "type": "title", + "bbox": [ + 107, + 466, + 191, + 477 + ], + "lines": [ + { + "bbox": [ + 106, + 466, + 193, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 193, + 479 + ], + "score": 1.0, + "content": "6.1 CALIBRATION", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 488, + 505, + 566 + ], + "lines": [ + { + "bbox": [ + 105, + 488, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 505, + 502 + ], + "score": 1.0, + "content": "To test the effect of increased capacity in distributions, we tested how well normalizing flows improve", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 499, + 506, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 506, + 514 + ], + "score": 1.0, + "content": "performance in distributional estimates compared to a few other popular approaches for estimating", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 511, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 523 + ], + "score": 1.0, + "content": "uncertainties. We do not compare directly against other methods for conditional distributions such as", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 522, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 522, + 505, + 533 + ], + "score": 1.0, + "content": "autoregressive flows for the reason specified in Section 3.3: in the one dimensional case, those are", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 533, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 106, + 533, + 505, + 545 + ], + "score": 1.0, + "content": "often the same as ConditionalGaussian. Instead of replacing the output distribution with a complex", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 543, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 505, + 556 + ], + "score": 1.0, + "content": "distribution created by hand, such as an explicit mixture, we rely on using more expressive flows", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 555, + 506, + 566 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 506, + 566 + ], + "score": 1.0, + "content": "which can model mixture behavior as well as more complicated behavior such as skew and kurtosis.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 30 + }, + { + "type": "table", + "bbox": [ + 110, + 642, + 500, + 730 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 588, + 505, + 633 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 588, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 601 + ], + "score": 1.0, + "content": "Table 1: Results before and after recalibration on the UCI dataset “naval-propulsion-plant”. Details", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "score": 1.0, + "content": "on the model methodology as well as performance on other UCI datasets are in Appendix B. The", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 610, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 610, + 505, + 623 + ], + "score": 1.0, + "content": "mean squared error (MSE) and its uncertainty is computed using 20 seeds. “Calib” is the calibration", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 622, + 404, + 635 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 404, + 635 + ], + "score": 1.0, + "content": "error (Equation 1) using 100 quantiles across 20 seeds instead of per seed.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35.5 + }, + { + "type": "table_body", + "bbox": [ + 110, + 642, + 500, + 730 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 642, + 500, + 730 + ], + "spans": [ + { + "bbox": [ + 110, + 642, + 500, + 730 + ], + "score": 0.98, + "html": "
Before Recalib.Isotonic Recalib.Flow Recalib.
MSECalibMSECalibMSECalib
ConditionalFlow0.009 ±0.0040.45N.A.<0.010.016 ± 0.012<0.01
ConditionalGaussian0.012 ±0.0062.35N.A.<0.010.012 ±0.006<0.01
BayesianRidgeRegression0.055 ±0.0048.03N.A.0.010.48 ± 0.02<0.01
MC Dropout0.005 ±0.0020.51N.A.N.A.N.A.N.A.
SQR0.0052 ± 0.00121.44N.A.N.A.N.A.N.A.
", + "type": "table", + "image_path": "7abeef572c6f552073f92457b1bb61bd0b47b3ab73a6d809ea69090876e017c1.jpg" + } + ] + } + ], + "index": 39, + "virtual_lines": [ + { + "bbox": [ + 110, + 642, + 500, + 671.3333333333334 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 110, + 671.3333333333334, + 500, + 700.6666666666667 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 110, + 700.6666666666667, + 500, + 730.0000000000001 + ], + "spans": [], + "index": 40 + } + ] + } + ], + "index": 37.25 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "score": 1.0, + "content": "7", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 168, + 78, + 442, + 324 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 168, + 78, + 442, + 324 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 168, + 78, + 442, + 324 + ], + "spans": [ + { + "bbox": [ + 168, + 78, + 442, + 324 + ], + "score": 0.97, + "type": "image", + "image_path": "875700dffcddbe4a75f5e5d09bdaf048c24fbe3c4bd6dcd6bef0495db4def2fa.jpg" + } + ] + } + ], + "index": 8.5, + "virtual_lines": [ + { + "bbox": [ + 168, + 78, + 442, + 91.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 168, + 91.66666666666667, + 442, + 105.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 168, + 105.33333333333334, + 442, + 119.00000000000001 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 168, + 119.00000000000001, + 442, + 132.66666666666669 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 168, + 132.66666666666669, + 442, + 146.33333333333334 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 168, + 146.33333333333334, + 442, + 160.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 168, + 160.0, + 442, + 173.66666666666666 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 168, + 173.66666666666666, + 442, + 187.33333333333331 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 168, + 187.33333333333331, + 442, + 200.99999999999997 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 168, + 200.99999999999997, + 442, + 214.66666666666663 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 168, + 214.66666666666663, + 442, + 228.3333333333333 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 168, + 228.3333333333333, + 442, + 241.99999999999994 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 168, + 241.99999999999994, + 442, + 255.6666666666666 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 168, + 255.6666666666666, + 442, + 269.33333333333326 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 168, + 269.33333333333326, + 442, + 282.99999999999994 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 168, + 282.99999999999994, + 442, + 296.66666666666663 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 168, + 296.66666666666663, + 442, + 310.3333333333333 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 168, + 310.3333333333333, + 442, + 324.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 333, + 506, + 388 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 333, + 506, + 346 + ], + "spans": [ + { + "bbox": [ + 105, + 333, + 506, + 346 + ], + "score": 1.0, + "content": "Figure 5: A diagram for multivariate recalibration using the same notation as that used in Section", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 343, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 104, + 343, + 505, + 357 + ], + "score": 1.0, + "content": "4.2. The first step for recalibration is always the calibration step, shown in the blue box, where any", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 354, + 505, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 175, + 366 + ], + "score": 1.0, + "content": "likelihood model", + "type": "text" + }, + { + "bbox": [ + 175, + 355, + 186, + 367 + ], + "score": 0.86, + "content": "f _ { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 354, + 505, + 366 + ], + "score": 1.0, + "content": "can be used. On the left, isotonic regression is used to recalibrate the CDFs from", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 107, + 365, + 506, + 379 + ], + "spans": [ + { + "bbox": [ + 107, + 366, + 117, + 378 + ], + "score": 0.84, + "content": "f _ { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 365, + 245, + 379 + ], + "score": 1.0, + "content": "; on the right, normalizing flows", + "type": "text" + }, + { + "bbox": [ + 245, + 367, + 256, + 378 + ], + "score": 0.86, + "content": "g _ { \\phi }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 365, + 408, + 379 + ], + "score": 1.0, + "content": "are used to recalibrate the CDFs from", + "type": "text" + }, + { + "bbox": [ + 409, + 366, + 419, + 378 + ], + "score": 0.85, + "content": "f _ { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 365, + 506, + 379 + ], + "score": 1.0, + "content": "conditioned on some", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 107, + 379, + 116, + 389 + ], + "spans": [ + { + "bbox": [ + 107, + 380, + 112, + 387 + ], + "score": 0.29, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 113, + 379, + 116, + 389 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20 + } + ], + "index": 14.25 + }, + { + "type": "text", + "bbox": [ + 107, + 414, + 505, + 447 + ], + "lines": [ + { + "bbox": [ + 105, + 414, + 505, + 427 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 505, + 427 + ], + "score": 1.0, + "content": "regression in aggregate. In terms of calibration, we show that the increase in expressivity can be", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 424, + 505, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 505, + 439 + ], + "score": 1.0, + "content": "beneficial; in terms of recalibration, we show specific failure points of isotonic regression that binning", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 437, + 328, + 449 + ], + "spans": [ + { + "bbox": [ + 106, + 437, + 328, + 449 + ], + "score": 1.0, + "content": "uncovers and how normalizing flows fixes these issues.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 414, + 505, + 449 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 466, + 191, + 477 + ], + "lines": [ + { + "bbox": [ + 106, + 466, + 193, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 193, + 479 + ], + "score": 1.0, + "content": "6.1 CALIBRATION", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 488, + 505, + 566 + ], + "lines": [ + { + "bbox": [ + 105, + 488, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 505, + 502 + ], + "score": 1.0, + "content": "To test the effect of increased capacity in distributions, we tested how well normalizing flows improve", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 499, + 506, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 506, + 514 + ], + "score": 1.0, + "content": "performance in distributional estimates compared to a few other popular approaches for estimating", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 511, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 523 + ], + "score": 1.0, + "content": "uncertainties. We do not compare directly against other methods for conditional distributions such as", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 522, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 522, + 505, + 533 + ], + "score": 1.0, + "content": "autoregressive flows for the reason specified in Section 3.3: in the one dimensional case, those are", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 533, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 106, + 533, + 505, + 545 + ], + "score": 1.0, + "content": "often the same as ConditionalGaussian. Instead of replacing the output distribution with a complex", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 543, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 505, + 556 + ], + "score": 1.0, + "content": "distribution created by hand, such as an explicit mixture, we rely on using more expressive flows", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 555, + 506, + 566 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 506, + 566 + ], + "score": 1.0, + "content": "which can model mixture behavior as well as more complicated behavior such as skew and kurtosis.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 488, + 506, + 566 + ] + }, + { + "type": "table", + "bbox": [ + 110, + 642, + 500, + 730 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 588, + 505, + 633 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 588, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 601 + ], + "score": 1.0, + "content": "Table 1: Results before and after recalibration on the UCI dataset “naval-propulsion-plant”. Details", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "score": 1.0, + "content": "on the model methodology as well as performance on other UCI datasets are in Appendix B. The", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 610, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 610, + 505, + 623 + ], + "score": 1.0, + "content": "mean squared error (MSE) and its uncertainty is computed using 20 seeds. “Calib” is the calibration", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 622, + 404, + 635 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 404, + 635 + ], + "score": 1.0, + "content": "error (Equation 1) using 100 quantiles across 20 seeds instead of per seed.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35.5 + }, + { + "type": "table_body", + "bbox": [ + 110, + 642, + 500, + 730 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 642, + 500, + 730 + ], + "spans": [ + { + "bbox": [ + 110, + 642, + 500, + 730 + ], + "score": 0.98, + "html": "
Before Recalib.Isotonic Recalib.Flow Recalib.
MSECalibMSECalibMSECalib
ConditionalFlow0.009 ±0.0040.45N.A.<0.010.016 ± 0.012<0.01
ConditionalGaussian0.012 ±0.0062.35N.A.<0.010.012 ±0.006<0.01
BayesianRidgeRegression0.055 ±0.0048.03N.A.0.010.48 ± 0.02<0.01
MC Dropout0.005 ±0.0020.51N.A.N.A.N.A.N.A.
SQR0.0052 ± 0.00121.44N.A.N.A.N.A.N.A.
", + "type": "table", + "image_path": "7abeef572c6f552073f92457b1bb61bd0b47b3ab73a6d809ea69090876e017c1.jpg" + } + ] + } + ], + "index": 39, + "virtual_lines": [ + { + "bbox": [ + 110, + 642, + 500, + 671.3333333333334 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 110, + 671.3333333333334, + 500, + 700.6666666666667 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 110, + 700.6666666666667, + 500, + 730.0000000000001 + ], + "spans": [], + "index": 40 + } + ] + } + ], + "index": 37.25 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 137 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 507, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 507, + 94 + ], + "score": 1.0, + "content": "All results were evaluated on a held out test set that was not used for calibration or recalibration.", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 506, + 106 + ], + "score": 1.0, + "content": "Due to limited space, the full extent of the results and details of the models are left for Appendix A", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "score": 1.0, + "content": "and Appendix B. To show the usefulness of the plot we introduced in Section 5, we focus on the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "results on the UCI dataset “naval-propulsion-plant” (Dheeru & Karra Taniskidou, 2017) in Table 1", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 173, + 138 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 173, + 138 + ], + "score": 1.0, + "content": "and Section 6.2.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 107, + 143, + 505, + 199 + ], + "lines": [ + { + "bbox": [ + 106, + 143, + 505, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 143, + 505, + 155 + ], + "score": 1.0, + "content": "The models with consistent performance across UCI datasets in terms of calibration are Bayesian", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 506, + 167 + ], + "score": 1.0, + "content": "Ridge Regression, Conditional Gaussian, and Conditional Flow, with Conditional Flow often per-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 164, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 164, + 505, + 178 + ], + "score": 1.0, + "content": "forming well in cases where Conditional Gaussian is unable to. Whereas these three models are", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 175, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 175, + 505, + 189 + ], + "score": 1.0, + "content": "well calibrated, the mean performance is much weaker for Bayesian Ridge Regression due to the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 187, + 229, + 199 + ], + "spans": [ + { + "bbox": [ + 106, + 187, + 229, + 199 + ], + "score": 1.0, + "content": "limitations of linear functions.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7 + }, + { + "type": "title", + "bbox": [ + 108, + 230, + 203, + 241 + ], + "lines": [ + { + "bbox": [ + 106, + 230, + 204, + 242 + ], + "spans": [ + { + "bbox": [ + 106, + 230, + 204, + 242 + ], + "score": 1.0, + "content": "6.2 RECALIBRATION", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 257, + 505, + 368 + ], + "lines": [ + { + "bbox": [ + 105, + 257, + 506, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 506, + 270 + ], + "score": 1.0, + "content": "Of the models we tested, we recalibrated the Bayesian Ridge Regression, Conditional Gaussian, and", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 268, + 506, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 506, + 281 + ], + "score": 1.0, + "content": "Conditional Flow models. MC Dropout and SQR could also be recalibrated, though we chose not", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 279, + 506, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 506, + 293 + ], + "score": 1.0, + "content": "to as they lack closed form CDFs, meaning the technique would be approximate. In Table 1, we", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 291, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 106, + 291, + 505, + 303 + ], + "score": 1.0, + "content": "see the calibration errors after recalibrating with normalizing flows are comparable to those from", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 303, + 505, + 314 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 505, + 314 + ], + "score": 1.0, + "content": "isotonic regression. However, after isotonic regression is applied, only the calibration error can be", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 312, + 505, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 312, + 505, + 325 + ], + "score": 1.0, + "content": "computed. In contrast, we can still compute ordinary distribution statistics such as the mean after", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 323, + 506, + 337 + ], + "spans": [ + { + "bbox": [ + 105, + 323, + 506, + 337 + ], + "score": 1.0, + "content": "applying normalizing flows. Due to this property, we can even detect cases in which an improvement", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 335, + 506, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 506, + 347 + ], + "score": 1.0, + "content": "in calibration error coincides with a degradation of mean performance, suggesting if the goal were to", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 345, + 506, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 506, + 358 + ], + "score": 1.0, + "content": "only get point estimates of the mean, recalibration could be detrimental. For example, in Table 1 this", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 356, + 286, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 286, + 369 + ], + "score": 1.0, + "content": "was the case for Bayesian Ridge Regression.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 107, + 373, + 505, + 406 + ], + "lines": [ + { + "bbox": [ + 105, + 373, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 505, + 385 + ], + "score": 1.0, + "content": "In Figure 6a, whereas the calibration error metric shows the flow recalibrated model is well-calibrated", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 385, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 505, + 397 + ], + "score": 1.0, + "content": "averaged across the full dataset, we can see that see that, when bucketing by the predicted mean, the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 396, + 229, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 396, + 229, + 407 + ], + "score": 1.0, + "content": "calibration error is significant.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 412, + 505, + 478 + ], + "lines": [ + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "score": 1.0, + "content": "To improve this, we recalibrate with a normalizing flow conditioned on the mean predicted by the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 423, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 106, + 423, + 505, + 435 + ], + "score": 1.0, + "content": "original model. In this way, we see in Figure 6b that though the aggregate performance does not", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 434, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 106, + 434, + 506, + 447 + ], + "score": 1.0, + "content": "change, the performance is improved across different buckets. In essence we see that if we were", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 445, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 505, + 457 + ], + "score": 1.0, + "content": "analyzing the distribution across the dataset, we would be accurate; if we started to look closer to", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 455, + 506, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 506, + 469 + ], + "score": 1.0, + "content": "individual distributions, the performance is worse suggesting the quantiles of individual distributions", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 467, + 180, + 478 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 180, + 478 + ], + "score": 1.0, + "content": "cannot be trusted.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26.5 + }, + { + "type": "image", + "bbox": [ + 108, + 525, + 489, + 686 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 525, + 489, + 686 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 525, + 489, + 686 + ], + "spans": [ + { + "bbox": [ + 108, + 525, + 489, + 686 + ], + "score": 0.963, + "type": "image", + "image_path": "5ba0a74e3b6aa56744216a122f89938ce61fa7461edf3b64016e47551252acc8.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 108, + 525, + 489, + 578.6666666666666 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 108, + 578.6666666666666, + 489, + 632.3333333333333 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 108, + 632.3333333333333, + 489, + 685.9999999999999 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 695, + 505, + 729 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 695, + 506, + 707 + ], + "spans": [ + { + "bbox": [ + 105, + 695, + 506, + 707 + ], + "score": 1.0, + "content": "Figure 6: Calibration Q-Q plots for recalibration with an unconditional flow and recalibration with a", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 706, + 505, + 718 + ], + "spans": [ + { + "bbox": [ + 106, + 706, + 505, + 718 + ], + "score": 1.0, + "content": "conditional flow on the dataset “naval-propulsion-plant”. The legend contains the calibration error", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 716, + 169, + 729 + ], + "spans": [ + { + "bbox": [ + 106, + 716, + 169, + 729 + ], + "score": 1.0, + "content": "for each curve.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + } + ], + "index": 32.5 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 300, + 750, + 309, + 761 + ], + "spans": [ + { + "bbox": [ + 300, + 750, + 309, + 761 + ], + "score": 1.0, + "content": "8", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 137 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 507, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 507, + 94 + ], + "score": 1.0, + "content": "All results were evaluated on a held out test set that was not used for calibration or recalibration.", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 506, + 106 + ], + "score": 1.0, + "content": "Due to limited space, the full extent of the results and details of the models are left for Appendix A", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "score": 1.0, + "content": "and Appendix B. To show the usefulness of the plot we introduced in Section 5, we focus on the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "results on the UCI dataset “naval-propulsion-plant” (Dheeru & Karra Taniskidou, 2017) in Table 1", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 173, + 138 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 173, + 138 + ], + "score": 1.0, + "content": "and Section 6.2.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 82, + 507, + 138 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 143, + 505, + 199 + ], + "lines": [ + { + "bbox": [ + 106, + 143, + 505, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 143, + 505, + 155 + ], + "score": 1.0, + "content": "The models with consistent performance across UCI datasets in terms of calibration are Bayesian", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 506, + 167 + ], + "score": 1.0, + "content": "Ridge Regression, Conditional Gaussian, and Conditional Flow, with Conditional Flow often per-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 164, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 164, + 505, + 178 + ], + "score": 1.0, + "content": "forming well in cases where Conditional Gaussian is unable to. Whereas these three models are", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 175, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 175, + 505, + 189 + ], + "score": 1.0, + "content": "well calibrated, the mean performance is much weaker for Bayesian Ridge Regression due to the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 187, + 229, + 199 + ], + "spans": [ + { + "bbox": [ + 106, + 187, + 229, + 199 + ], + "score": 1.0, + "content": "limitations of linear functions.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 143, + 506, + 199 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 230, + 203, + 241 + ], + "lines": [ + { + "bbox": [ + 106, + 230, + 204, + 242 + ], + "spans": [ + { + "bbox": [ + 106, + 230, + 204, + 242 + ], + "score": 1.0, + "content": "6.2 RECALIBRATION", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 257, + 505, + 368 + ], + "lines": [ + { + "bbox": [ + 105, + 257, + 506, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 506, + 270 + ], + "score": 1.0, + "content": "Of the models we tested, we recalibrated the Bayesian Ridge Regression, Conditional Gaussian, and", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 268, + 506, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 506, + 281 + ], + "score": 1.0, + "content": "Conditional Flow models. MC Dropout and SQR could also be recalibrated, though we chose not", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 279, + 506, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 506, + 293 + ], + "score": 1.0, + "content": "to as they lack closed form CDFs, meaning the technique would be approximate. In Table 1, we", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 291, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 106, + 291, + 505, + 303 + ], + "score": 1.0, + "content": "see the calibration errors after recalibrating with normalizing flows are comparable to those from", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 303, + 505, + 314 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 505, + 314 + ], + "score": 1.0, + "content": "isotonic regression. However, after isotonic regression is applied, only the calibration error can be", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 312, + 505, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 312, + 505, + 325 + ], + "score": 1.0, + "content": "computed. In contrast, we can still compute ordinary distribution statistics such as the mean after", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 323, + 506, + 337 + ], + "spans": [ + { + "bbox": [ + 105, + 323, + 506, + 337 + ], + "score": 1.0, + "content": "applying normalizing flows. Due to this property, we can even detect cases in which an improvement", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 335, + 506, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 506, + 347 + ], + "score": 1.0, + "content": "in calibration error coincides with a degradation of mean performance, suggesting if the goal were to", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 345, + 506, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 506, + 358 + ], + "score": 1.0, + "content": "only get point estimates of the mean, recalibration could be detrimental. For example, in Table 1 this", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 356, + 286, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 286, + 369 + ], + "score": 1.0, + "content": "was the case for Bayesian Ridge Regression.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 257, + 506, + 369 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 373, + 505, + 406 + ], + "lines": [ + { + "bbox": [ + 105, + 373, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 505, + 385 + ], + "score": 1.0, + "content": "In Figure 6a, whereas the calibration error metric shows the flow recalibrated model is well-calibrated", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 385, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 505, + 397 + ], + "score": 1.0, + "content": "averaged across the full dataset, we can see that see that, when bucketing by the predicted mean, the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 396, + 229, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 396, + 229, + 407 + ], + "score": 1.0, + "content": "calibration error is significant.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 373, + 505, + 407 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 412, + 505, + 478 + ], + "lines": [ + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "score": 1.0, + "content": "To improve this, we recalibrate with a normalizing flow conditioned on the mean predicted by the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 423, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 106, + 423, + 505, + 435 + ], + "score": 1.0, + "content": "original model. In this way, we see in Figure 6b that though the aggregate performance does not", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 434, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 106, + 434, + 506, + 447 + ], + "score": 1.0, + "content": "change, the performance is improved across different buckets. In essence we see that if we were", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 445, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 505, + 457 + ], + "score": 1.0, + "content": "analyzing the distribution across the dataset, we would be accurate; if we started to look closer to", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 455, + 506, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 506, + 469 + ], + "score": 1.0, + "content": "individual distributions, the performance is worse suggesting the quantiles of individual distributions", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 467, + 180, + 478 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 180, + 478 + ], + "score": 1.0, + "content": "cannot be trusted.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 412, + 506, + 478 + ] + }, + { + "type": "image", + "bbox": [ + 108, + 525, + 489, + 686 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 525, + 489, + 686 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 525, + 489, + 686 + ], + "spans": [ + { + "bbox": [ + 108, + 525, + 489, + 686 + ], + "score": 0.963, + "type": "image", + "image_path": "5ba0a74e3b6aa56744216a122f89938ce61fa7461edf3b64016e47551252acc8.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 108, + 525, + 489, + 578.6666666666666 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 108, + 578.6666666666666, + 489, + 632.3333333333333 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 108, + 632.3333333333333, + 489, + 685.9999999999999 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 695, + 505, + 729 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 695, + 506, + 707 + ], + "spans": [ + { + "bbox": [ + 105, + 695, + 506, + 707 + ], + "score": 1.0, + "content": "Figure 6: Calibration Q-Q plots for recalibration with an unconditional flow and recalibration with a", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 706, + 505, + 718 + ], + "spans": [ + { + "bbox": [ + 106, + 706, + 505, + 718 + ], + "score": 1.0, + "content": "conditional flow on the dataset “naval-propulsion-plant”. The legend contains the calibration error", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 716, + 169, + 729 + ], + "spans": [ + { + "bbox": [ + 106, + 716, + 169, + 729 + ], + "score": 1.0, + "content": "for each curve.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + } + ], + "index": 32.5 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 96, + 489, + 256 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 96, + 489, + 256 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 96, + 489, + 256 + ], + "spans": [ + { + "bbox": [ + 108, + 96, + 489, + 256 + ], + "score": 0.962, + "type": "image", + "image_path": "96799e60b702cd7228ab4ea95bae04d75bb639f63db7286ef906822c86a386ab.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 96, + 489, + 149.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 149.33333333333334, + 489, + 202.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 202.66666666666669, + 489, + 256.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 264, + 505, + 298 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 265, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 106, + 265, + 505, + 277 + ], + "score": 1.0, + "content": "Figure 7: Calibration Q-Q plots for recalibration with isotonic regression and recalibration with", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 275, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 289 + ], + "score": 1.0, + "content": "normalizing flows on the second time step on the dataset “electricity”. The legend contains the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 286, + 236, + 299 + ], + "spans": [ + { + "bbox": [ + 106, + 286, + 236, + 299 + ], + "score": 1.0, + "content": "calibration error for each curve.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 107, + 336, + 187, + 347 + ], + "lines": [ + { + "bbox": [ + 106, + 335, + 189, + 349 + ], + "spans": [ + { + "bbox": [ + 106, + 335, + 189, + 349 + ], + "score": 1.0, + "content": "6.3 TIME SERIES", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 107, + 363, + 505, + 408 + ], + "lines": [ + { + "bbox": [ + 105, + 363, + 506, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 506, + 376 + ], + "score": 1.0, + "content": "For our time series example, we trained a model on the UCI Dataset “electricity”. We predict two", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 375, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 375, + 505, + 387 + ], + "score": 1.0, + "content": "time steps and show that even though we used an autoregressive model for calibration (the model", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 386, + 505, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 386, + 505, + 398 + ], + "score": 1.0, + "content": "could learn correlated distributions), there is still some correlation not captured that recalibration can", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 397, + 149, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 397, + 149, + 409 + ], + "score": 1.0, + "content": "help with.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 106, + 413, + 505, + 479 + ], + "lines": [ + { + "bbox": [ + 106, + 413, + 505, + 426 + ], + "spans": [ + { + "bbox": [ + 106, + 413, + 280, + 426 + ], + "score": 1.0, + "content": "Figure 7a shows that the calibration error of", + "type": "text" + }, + { + "bbox": [ + 281, + 414, + 320, + 426 + ], + "score": 0.93, + "content": "F ( Y _ { 2 } | Y _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 413, + 505, + 426 + ], + "score": 1.0, + "content": "when recalibrated independently with isotonic", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 425, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 505, + 437 + ], + "score": 1.0, + "content": "regression is significant. Figure 7b shows that a flow trained jointly on the CDFs significantly", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 435, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 505, + 448 + ], + "score": 1.0, + "content": "reduces the errors. Although the calibration error of the marginal distribution for the second step is", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 447, + 506, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 447, + 506, + 459 + ], + "score": 1.0, + "content": "comparable between the two approaches, the conditional performance favors normalizing flows. A", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 457, + 504, + 470 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 504, + 470 + ], + "score": 1.0, + "content": "possible explanantion of the still imperfect calibration of the flow model, though better than isotonic", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 470, + 232, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 470, + 232, + 479 + ], + "score": 1.0, + "content": "regression, is distribution shift.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 13.5 + }, + { + "type": "title", + "bbox": [ + 107, + 514, + 303, + 527 + ], + "lines": [ + { + "bbox": [ + 105, + 512, + 304, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 304, + 529 + ], + "score": 1.0, + "content": "7 CONCLUSION AND FUTURE WORK", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 549, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 506, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 506, + 564 + ], + "score": 1.0, + "content": "In this paper, we addressed the calibration issue in modern neural networks through using higher", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 560, + 505, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 505, + 575 + ], + "score": 1.0, + "content": "capacity distributions via normalizing flows. We showed that normalizing flows can not only help", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 572, + 506, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 506, + 585 + ], + "score": 1.0, + "content": "during calibration, but also in recalibrating miscalibrated distributions, even improving the fit in", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 582, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 505, + 596 + ], + "score": 1.0, + "content": "the underfitting case. Though isotonic regression also uses a two-step producedure, we reframe the", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 594, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 506, + 606 + ], + "score": 1.0, + "content": "problem as MLE through which we can trivially generalize recalibration to the multivariate case.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "score": 1.0, + "content": "Though isotonic regression could be extended such that we could compute the log likelihood implied", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 616, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 505, + 629 + ], + "score": 1.0, + "content": "by its change of variables, normalizing flows are a more natural way to handle this with more research", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 627, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 505, + 640 + ], + "score": 1.0, + "content": "backing this technique, and are easily extendable to conditional and joint distributions. Interestingly,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "though the Conditional Flow has all it needs to be well calibrated, recalibration helps the overall", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 649, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 505, + 660 + ], + "score": 1.0, + "content": "calibration which was similarly found for classification in Guo et al. (2017); it remains for future", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 660, + 326, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 326, + 672 + ], + "score": 1.0, + "content": "work to better understand why and when this is useful.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 677, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "score": 1.0, + "content": "Further, we extend the plot introduced in Kuleshov et al. (2018) by showing the calibration error on", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 686, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 506, + 700 + ], + "score": 1.0, + "content": "different subsets of the data, for example bucketed by mean prediction. Though this plot is able to", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 697, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 506, + 712 + ], + "score": 1.0, + "content": "show the calibration error across buckets, for future work, we will explore ways to visually show any", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "trends in the miscalibration as well as whether the misalignments of the quantiles are statistically", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 720, + 153, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 153, + 734 + ], + "score": 1.0, + "content": "significant.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31 + } + ], + "page_idx": 8, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "9", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 96, + 489, + 256 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 96, + 489, + 256 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 96, + 489, + 256 + ], + "spans": [ + { + "bbox": [ + 108, + 96, + 489, + 256 + ], + "score": 0.962, + "type": "image", + "image_path": "96799e60b702cd7228ab4ea95bae04d75bb639f63db7286ef906822c86a386ab.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 96, + 489, + 149.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 149.33333333333334, + 489, + 202.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 202.66666666666669, + 489, + 256.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 264, + 505, + 298 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 265, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 106, + 265, + 505, + 277 + ], + "score": 1.0, + "content": "Figure 7: Calibration Q-Q plots for recalibration with isotonic regression and recalibration with", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 275, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 289 + ], + "score": 1.0, + "content": "normalizing flows on the second time step on the dataset “electricity”. The legend contains the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 286, + 236, + 299 + ], + "spans": [ + { + "bbox": [ + 106, + 286, + 236, + 299 + ], + "score": 1.0, + "content": "calibration error for each curve.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 107, + 336, + 187, + 347 + ], + "lines": [ + { + "bbox": [ + 106, + 335, + 189, + 349 + ], + "spans": [ + { + "bbox": [ + 106, + 335, + 189, + 349 + ], + "score": 1.0, + "content": "6.3 TIME SERIES", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 107, + 363, + 505, + 408 + ], + "lines": [ + { + "bbox": [ + 105, + 363, + 506, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 506, + 376 + ], + "score": 1.0, + "content": "For our time series example, we trained a model on the UCI Dataset “electricity”. We predict two", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 375, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 375, + 505, + 387 + ], + "score": 1.0, + "content": "time steps and show that even though we used an autoregressive model for calibration (the model", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 386, + 505, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 386, + 505, + 398 + ], + "score": 1.0, + "content": "could learn correlated distributions), there is still some correlation not captured that recalibration can", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 397, + 149, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 397, + 149, + 409 + ], + "score": 1.0, + "content": "help with.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 363, + 506, + 409 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 413, + 505, + 479 + ], + "lines": [ + { + "bbox": [ + 106, + 413, + 505, + 426 + ], + "spans": [ + { + "bbox": [ + 106, + 413, + 280, + 426 + ], + "score": 1.0, + "content": "Figure 7a shows that the calibration error of", + "type": "text" + }, + { + "bbox": [ + 281, + 414, + 320, + 426 + ], + "score": 0.93, + "content": "F ( Y _ { 2 } | Y _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 413, + 505, + 426 + ], + "score": 1.0, + "content": "when recalibrated independently with isotonic", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 425, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 505, + 437 + ], + "score": 1.0, + "content": "regression is significant. Figure 7b shows that a flow trained jointly on the CDFs significantly", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 435, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 505, + 448 + ], + "score": 1.0, + "content": "reduces the errors. Although the calibration error of the marginal distribution for the second step is", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 447, + 506, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 447, + 506, + 459 + ], + "score": 1.0, + "content": "comparable between the two approaches, the conditional performance favors normalizing flows. A", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 457, + 504, + 470 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 504, + 470 + ], + "score": 1.0, + "content": "possible explanantion of the still imperfect calibration of the flow model, though better than isotonic", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 470, + 232, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 470, + 232, + 479 + ], + "score": 1.0, + "content": "regression, is distribution shift.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 413, + 506, + 479 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 514, + 303, + 527 + ], + "lines": [ + { + "bbox": [ + 105, + 512, + 304, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 304, + 529 + ], + "score": 1.0, + "content": "7 CONCLUSION AND FUTURE WORK", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 549, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 506, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 506, + 564 + ], + "score": 1.0, + "content": "In this paper, we addressed the calibration issue in modern neural networks through using higher", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 560, + 505, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 505, + 575 + ], + "score": 1.0, + "content": "capacity distributions via normalizing flows. We showed that normalizing flows can not only help", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 572, + 506, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 506, + 585 + ], + "score": 1.0, + "content": "during calibration, but also in recalibrating miscalibrated distributions, even improving the fit in", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 582, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 505, + 596 + ], + "score": 1.0, + "content": "the underfitting case. Though isotonic regression also uses a two-step producedure, we reframe the", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 594, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 506, + 606 + ], + "score": 1.0, + "content": "problem as MLE through which we can trivially generalize recalibration to the multivariate case.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "score": 1.0, + "content": "Though isotonic regression could be extended such that we could compute the log likelihood implied", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 616, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 505, + 629 + ], + "score": 1.0, + "content": "by its change of variables, normalizing flows are a more natural way to handle this with more research", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 627, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 505, + 640 + ], + "score": 1.0, + "content": "backing this technique, and are easily extendable to conditional and joint distributions. Interestingly,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "though the Conditional Flow has all it needs to be well calibrated, recalibration helps the overall", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 649, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 505, + 660 + ], + "score": 1.0, + "content": "calibration which was similarly found for classification in Guo et al. (2017); it remains for future", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 660, + 326, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 326, + 672 + ], + "score": 1.0, + "content": "work to better understand why and when this is useful.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 549, + 506, + 672 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 677, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "score": 1.0, + "content": "Further, we extend the plot introduced in Kuleshov et al. (2018) by showing the calibration error on", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 686, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 506, + 700 + ], + "score": 1.0, + "content": "different subsets of the data, for example bucketed by mean prediction. Though this plot is able to", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 697, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 506, + 712 + ], + "score": 1.0, + "content": "show the calibration error across buckets, for future work, we will explore ways to visually show any", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "trends in the miscalibration as well as whether the misalignments of the quantiles are statistically", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 720, + 153, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 153, + 734 + ], + "score": 1.0, + "content": "significant.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 676, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 82, + 175, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 176, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 176, + 95 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 100, + 504, + 134 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 505, + 113 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 505, + 113 + ], + "score": 1.0, + "content": "Nicola De Cao, Wilker Aziz, and Ivan Titov. Block neural autoregressive flow. In Conference", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 114, + 110, + 507, + 125 + ], + "spans": [ + { + "bbox": [ + 114, + 110, + 507, + 125 + ], + "score": 1.0, + "content": "on Uncertainty in Artificial Intelligence, volume 3, pp. 1723–1735. UAI, 2019. URL http:", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 122, + 384, + 135 + ], + "spans": [ + { + "bbox": [ + 116, + 122, + 384, + 135 + ], + "score": 1.0, + "content": "//auai.org/uai2019/proceedings/papers/511.pdf.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 107, + 142, + 506, + 199 + ], + "lines": [ + { + "bbox": [ + 106, + 142, + 505, + 154 + ], + "spans": [ + { + "bbox": [ + 106, + 142, + 505, + 154 + ], + "score": 1.0, + "content": "Ricky T. Q. Chen, Jens Behrmann, David K Duvenaud, and Joern-Henrik Jacobsen. Residual flows", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 115, + 154, + 505, + 167 + ], + "score": 1.0, + "content": "for invertible generative modeling. In H. Wallach, H. Larochelle, A. Beygelzimer, F. dAlch ´ e-´", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 164, + 507, + 179 + ], + "spans": [ + { + "bbox": [ + 115, + 164, + 507, + 179 + ], + "score": 1.0, + "content": "Buc, E. Fox, and R. Garnett (eds.), Advances in Neural Information Processing Systems 32, pp.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 176, + 507, + 189 + ], + "spans": [ + { + "bbox": [ + 115, + 176, + 507, + 189 + ], + "score": 1.0, + "content": "9916–9926. Curran Associates, Inc., 2019. URL http://papers.nips.cc/paper/9183-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 187, + 437, + 199 + ], + "spans": [ + { + "bbox": [ + 115, + 187, + 437, + 199 + ], + "score": 1.0, + "content": "residual-flows-for-invertible-generative-modeling.pdf.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 107, + 207, + 506, + 240 + ], + "lines": [ + { + "bbox": [ + 106, + 207, + 505, + 219 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 505, + 219 + ], + "score": 1.0, + "content": "Djork-Arne Clevert, Thomas Unterthiner, and Sepp Hochreiter. Fast and Accurate Deep Network ´", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 114, + 217, + 506, + 231 + ], + "spans": [ + { + "bbox": [ + 114, + 217, + 506, + 231 + ], + "score": 1.0, + "content": "Learning by Exponential Linear Units (ELUs). arXiv e-prints, art. arXiv:1511.07289, November", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 227, + 144, + 242 + ], + "spans": [ + { + "bbox": [ + 115, + 227, + 144, + 242 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 106, + 248, + 505, + 271 + ], + "lines": [ + { + "bbox": [ + 105, + 247, + 507, + 262 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 507, + 262 + ], + "score": 1.0, + "content": "Armen Der Kiureghian and Ove Ditlevsen. Aleatory or epistemic? does it matter? Structural safety,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 259, + 206, + 271 + ], + "spans": [ + { + "bbox": [ + 115, + 259, + 206, + 271 + ], + "score": 1.0, + "content": "31(2):105–112, 2009.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 106, + 279, + 505, + 302 + ], + "lines": [ + { + "bbox": [ + 105, + 277, + 507, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 507, + 293 + ], + "score": 1.0, + "content": "Dua Dheeru and Efi Karra Taniskidou. UCI machine learning repository, 2017. URL http:", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 117, + 291, + 254, + 302 + ], + "spans": [ + { + "bbox": [ + 117, + 291, + 254, + 302 + ], + "score": 1.0, + "content": "//archive.ics.uci.edu/ml.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 106, + 309, + 504, + 333 + ], + "lines": [ + { + "bbox": [ + 105, + 308, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 505, + 324 + ], + "score": 1.0, + "content": "Laurent Dinh, David Krueger, and Yoshua Bengio. NICE: Non-linear Independent Components", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 321, + 374, + 333 + ], + "spans": [ + { + "bbox": [ + 116, + 321, + 374, + 333 + ], + "score": 1.0, + "content": "Estimation. arXiv e-prints, art. arXiv:1410.8516, October 2014.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 106, + 340, + 504, + 363 + ], + "lines": [ + { + "bbox": [ + 106, + 341, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 341, + 505, + 354 + ], + "score": 1.0, + "content": "Laurent Dinh, Jascha Sohl-Dickstein, and Samy Bengio. Density estimation using Real NVP. arXiv", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 352, + 292, + 363 + ], + "spans": [ + { + "bbox": [ + 115, + 352, + 292, + 363 + ], + "score": 1.0, + "content": "e-prints, art. arXiv:1605.08803, May 2016.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "text", + "bbox": [ + 107, + 371, + 505, + 427 + ], + "lines": [ + { + "bbox": [ + 106, + 370, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 106, + 370, + 505, + 384 + ], + "score": 1.0, + "content": "Yarin Gal and Zoubin Ghahramani. Dropout as a bayesian approximation: Representing model", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 382, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 116, + 382, + 505, + 396 + ], + "score": 1.0, + "content": "uncertainty in deep learning. In Maria Florina Balcan and Kilian Q. Weinberger (eds.), Proceedings", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 394, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 116, + 394, + 505, + 406 + ], + "score": 1.0, + "content": "of The 33rd International Conference on Machine Learning, volume 48 of Proceedings of Machine", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 404, + 506, + 417 + ], + "spans": [ + { + "bbox": [ + 115, + 404, + 506, + 417 + ], + "score": 1.0, + "content": "Learning Research, pp. 1050–1059, New York, New York, USA, 20–22 Jun 2016. PMLR. URL", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 415, + 370, + 429 + ], + "spans": [ + { + "bbox": [ + 115, + 415, + 370, + 429 + ], + "score": 1.0, + "content": "http://proceedings.mlr.press/v48/gal16.html.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 106, + 434, + 505, + 457 + ], + "lines": [ + { + "bbox": [ + 105, + 433, + 507, + 449 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 507, + 449 + ], + "score": 1.0, + "content": "Achintya Gopal. Quasi-Autoregressive Residual (QuAR) Flows. arXiv e-prints, art.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 446, + 264, + 459 + ], + "spans": [ + { + "bbox": [ + 116, + 446, + 264, + 459 + ], + "score": 1.0, + "content": "arXiv:2009.07419, September 2020.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 107, + 465, + 506, + 499 + ], + "lines": [ + { + "bbox": [ + 106, + 465, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 465, + 506, + 479 + ], + "score": 1.0, + "content": "Will Grathwohl, Ricky T. Q. Chen, Jesse Bettencourt, Ilya Sutskever, and David Duvenaud. FFJORD:", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 477, + 506, + 489 + ], + "spans": [ + { + "bbox": [ + 115, + 477, + 506, + 489 + ], + "score": 1.0, + "content": "Free-form Continuous Dynamics for Scalable Reversible Generative Models. arXiv e-prints, art.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 488, + 254, + 500 + ], + "spans": [ + { + "bbox": [ + 115, + 488, + 254, + 500 + ], + "score": 1.0, + "content": "arXiv:1810.01367, October 2018.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 507, + 505, + 563 + ], + "lines": [ + { + "bbox": [ + 106, + 508, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 106, + 508, + 505, + 520 + ], + "score": 1.0, + "content": "Chuan Guo, Geoff Pleiss, Yu Sun, and Kilian Q. Weinberger. On calibration of modern neural", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 519, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 115, + 519, + 505, + 531 + ], + "score": 1.0, + "content": "networks. In Doina Precup and Yee Whye Teh (eds.), Proceedings of the 34th International", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 528, + 506, + 543 + ], + "spans": [ + { + "bbox": [ + 115, + 528, + 506, + 543 + ], + "score": 1.0, + "content": "Conference on Machine Learning, volume 70 of Proceedings of Machine Learning Research, pp.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 540, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 115, + 540, + 506, + 554 + ], + "score": 1.0, + "content": "1321–1330, International Convention Centre, Sydney, Australia, 06–11 Aug 2017. PMLR. URL", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 552, + 374, + 564 + ], + "spans": [ + { + "bbox": [ + 115, + 552, + 374, + 564 + ], + "score": 1.0, + "content": "http://proceedings.mlr.press/v70/guo17a.html.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 107, + 571, + 506, + 637 + ], + "lines": [ + { + "bbox": [ + 106, + 572, + 506, + 583 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 420, + 583 + ], + "score": 1.0, + "content": "Jonathan Ho, Xi Chen, Aravind Srinivas, Yan Duan, and Pieter Abbeel. Flow", + "type": "text" + }, + { + "bbox": [ + 421, + 573, + 433, + 582 + ], + "score": 0.52, + "content": "^ { + + }", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 572, + 506, + 583 + ], + "score": 1.0, + "content": ": Improving flow-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 582, + 506, + 595 + ], + "spans": [ + { + "bbox": [ + 115, + 582, + 506, + 595 + ], + "score": 1.0, + "content": "based generative models with variational dequantization and architecture design. In Kamalika", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 592, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 115, + 592, + 506, + 606 + ], + "score": 1.0, + "content": "Chaudhuri and Ruslan Salakhutdinov (eds.), Proceedings of the 36th International Conference on", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 114, + 602, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 114, + 602, + 506, + 618 + ], + "score": 1.0, + "content": "Machine Learning, volume 97 of Proceedings of Machine Learning Research, pp. 2722–2730, Long", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 614, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 115, + 614, + 506, + 628 + ], + "score": 1.0, + "content": "Beach, California, USA, 09–15 Jun 2019. PMLR. URL http://proceedings.mlr.press/", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 626, + 203, + 638 + ], + "spans": [ + { + "bbox": [ + 115, + 626, + 203, + 638 + ], + "score": 1.0, + "content": "v97/ho19a.html.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 107, + 646, + 506, + 702 + ], + "lines": [ + { + "bbox": [ + 106, + 646, + 506, + 658 + ], + "spans": [ + { + "bbox": [ + 106, + 646, + 506, + 658 + ], + "score": 1.0, + "content": "Chin-Wei Huang, David Krueger, Alexandre Lacoste, and Aaron Courville. Neural autore-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 657, + 506, + 670 + ], + "spans": [ + { + "bbox": [ + 115, + 657, + 506, + 670 + ], + "score": 1.0, + "content": "gressive flows. In Jennifer Dy and Andreas Krause (eds.), Proceedings of the 35th Interna-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 667, + 506, + 681 + ], + "spans": [ + { + "bbox": [ + 116, + 667, + 506, + 681 + ], + "score": 1.0, + "content": "tional Conference on Machine Learning, volume 80 of Proceedings of Machine Learning Re-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 678, + 506, + 691 + ], + "spans": [ + { + "bbox": [ + 115, + 678, + 506, + 691 + ], + "score": 1.0, + "content": "search, pp. 2078–2087, Stockholmsmssan, Stockholm Sweden, 10–15 Jul 2018. PMLR. URL", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 116, + 690, + 387, + 702 + ], + "spans": [ + { + "bbox": [ + 116, + 690, + 387, + 702 + ], + "score": 1.0, + "content": "http://proceedings.mlr.press/v80/huang18d.html.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 109, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 507, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 507, + 722 + ], + "score": 1.0, + "content": "Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye,", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 115, + 720, + 507, + 734 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 507, + 734 + ], + "score": 1.0, + "content": "and Tie-Yan Liu. Lightgbm: A highly efficient gradient boosting decision tree. In", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46.5 + } + ], + "page_idx": 9, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "10", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 82, + 175, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 176, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 176, + 95 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 100, + 504, + 134 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 505, + 113 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 505, + 113 + ], + "score": 1.0, + "content": "Nicola De Cao, Wilker Aziz, and Ivan Titov. Block neural autoregressive flow. In Conference", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 114, + 110, + 507, + 125 + ], + "spans": [ + { + "bbox": [ + 114, + 110, + 507, + 125 + ], + "score": 1.0, + "content": "on Uncertainty in Artificial Intelligence, volume 3, pp. 1723–1735. UAI, 2019. URL http:", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 122, + 384, + 135 + ], + "spans": [ + { + "bbox": [ + 116, + 122, + 384, + 135 + ], + "score": 1.0, + "content": "//auai.org/uai2019/proceedings/papers/511.pdf.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 99, + 507, + 135 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 142, + 506, + 199 + ], + "lines": [ + { + "bbox": [ + 106, + 142, + 505, + 154 + ], + "spans": [ + { + "bbox": [ + 106, + 142, + 505, + 154 + ], + "score": 1.0, + "content": "Ricky T. Q. Chen, Jens Behrmann, David K Duvenaud, and Joern-Henrik Jacobsen. Residual flows", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 115, + 154, + 505, + 167 + ], + "score": 1.0, + "content": "for invertible generative modeling. In H. Wallach, H. Larochelle, A. Beygelzimer, F. dAlch ´ e-´", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 164, + 507, + 179 + ], + "spans": [ + { + "bbox": [ + 115, + 164, + 507, + 179 + ], + "score": 1.0, + "content": "Buc, E. Fox, and R. Garnett (eds.), Advances in Neural Information Processing Systems 32, pp.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 176, + 507, + 189 + ], + "spans": [ + { + "bbox": [ + 115, + 176, + 507, + 189 + ], + "score": 1.0, + "content": "9916–9926. Curran Associates, Inc., 2019. URL http://papers.nips.cc/paper/9183-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 187, + 437, + 199 + ], + "spans": [ + { + "bbox": [ + 115, + 187, + 437, + 199 + ], + "score": 1.0, + "content": "residual-flows-for-invertible-generative-modeling.pdf.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 142, + 507, + 199 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 207, + 506, + 240 + ], + "lines": [ + { + "bbox": [ + 106, + 207, + 505, + 219 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 505, + 219 + ], + "score": 1.0, + "content": "Djork-Arne Clevert, Thomas Unterthiner, and Sepp Hochreiter. Fast and Accurate Deep Network ´", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 114, + 217, + 506, + 231 + ], + "spans": [ + { + "bbox": [ + 114, + 217, + 506, + 231 + ], + "score": 1.0, + "content": "Learning by Exponential Linear Units (ELUs). arXiv e-prints, art. arXiv:1511.07289, November", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 227, + 144, + 242 + ], + "spans": [ + { + "bbox": [ + 115, + 227, + 144, + 242 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10, + "bbox_fs": [ + 106, + 207, + 506, + 242 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 248, + 505, + 271 + ], + "lines": [ + { + "bbox": [ + 105, + 247, + 507, + 262 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 507, + 262 + ], + "score": 1.0, + "content": "Armen Der Kiureghian and Ove Ditlevsen. Aleatory or epistemic? does it matter? Structural safety,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 259, + 206, + 271 + ], + "spans": [ + { + "bbox": [ + 115, + 259, + 206, + 271 + ], + "score": 1.0, + "content": "31(2):105–112, 2009.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 247, + 507, + 271 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 279, + 505, + 302 + ], + "lines": [ + { + "bbox": [ + 105, + 277, + 507, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 507, + 293 + ], + "score": 1.0, + "content": "Dua Dheeru and Efi Karra Taniskidou. UCI machine learning repository, 2017. URL http:", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 117, + 291, + 254, + 302 + ], + "spans": [ + { + "bbox": [ + 117, + 291, + 254, + 302 + ], + "score": 1.0, + "content": "//archive.ics.uci.edu/ml.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 277, + 507, + 302 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 309, + 504, + 333 + ], + "lines": [ + { + "bbox": [ + 105, + 308, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 505, + 324 + ], + "score": 1.0, + "content": "Laurent Dinh, David Krueger, and Yoshua Bengio. NICE: Non-linear Independent Components", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 321, + 374, + 333 + ], + "spans": [ + { + "bbox": [ + 116, + 321, + 374, + 333 + ], + "score": 1.0, + "content": "Estimation. arXiv e-prints, art. arXiv:1410.8516, October 2014.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5, + "bbox_fs": [ + 105, + 308, + 505, + 333 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 340, + 504, + 363 + ], + "lines": [ + { + "bbox": [ + 106, + 341, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 341, + 505, + 354 + ], + "score": 1.0, + "content": "Laurent Dinh, Jascha Sohl-Dickstein, and Samy Bengio. Density estimation using Real NVP. arXiv", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 352, + 292, + 363 + ], + "spans": [ + { + "bbox": [ + 115, + 352, + 292, + 363 + ], + "score": 1.0, + "content": "e-prints, art. arXiv:1605.08803, May 2016.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 106, + 341, + 505, + 363 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 371, + 505, + 427 + ], + "lines": [ + { + "bbox": [ + 106, + 370, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 106, + 370, + 505, + 384 + ], + "score": 1.0, + "content": "Yarin Gal and Zoubin Ghahramani. Dropout as a bayesian approximation: Representing model", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 382, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 116, + 382, + 505, + 396 + ], + "score": 1.0, + "content": "uncertainty in deep learning. In Maria Florina Balcan and Kilian Q. Weinberger (eds.), Proceedings", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 394, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 116, + 394, + 505, + 406 + ], + "score": 1.0, + "content": "of The 33rd International Conference on Machine Learning, volume 48 of Proceedings of Machine", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 404, + 506, + 417 + ], + "spans": [ + { + "bbox": [ + 115, + 404, + 506, + 417 + ], + "score": 1.0, + "content": "Learning Research, pp. 1050–1059, New York, New York, USA, 20–22 Jun 2016. PMLR. URL", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 415, + 370, + 429 + ], + "spans": [ + { + "bbox": [ + 115, + 415, + 370, + 429 + ], + "score": 1.0, + "content": "http://proceedings.mlr.press/v48/gal16.html.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22, + "bbox_fs": [ + 106, + 370, + 506, + 429 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 434, + 505, + 457 + ], + "lines": [ + { + "bbox": [ + 105, + 433, + 507, + 449 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 507, + 449 + ], + "score": 1.0, + "content": "Achintya Gopal. Quasi-Autoregressive Residual (QuAR) Flows. arXiv e-prints, art.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 446, + 264, + 459 + ], + "spans": [ + { + "bbox": [ + 116, + 446, + 264, + 459 + ], + "score": 1.0, + "content": "arXiv:2009.07419, September 2020.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 433, + 507, + 459 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 465, + 506, + 499 + ], + "lines": [ + { + "bbox": [ + 106, + 465, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 465, + 506, + 479 + ], + "score": 1.0, + "content": "Will Grathwohl, Ricky T. Q. Chen, Jesse Bettencourt, Ilya Sutskever, and David Duvenaud. FFJORD:", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 477, + 506, + 489 + ], + "spans": [ + { + "bbox": [ + 115, + 477, + 506, + 489 + ], + "score": 1.0, + "content": "Free-form Continuous Dynamics for Scalable Reversible Generative Models. arXiv e-prints, art.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 488, + 254, + 500 + ], + "spans": [ + { + "bbox": [ + 115, + 488, + 254, + 500 + ], + "score": 1.0, + "content": "arXiv:1810.01367, October 2018.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28, + "bbox_fs": [ + 106, + 465, + 506, + 500 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 507, + 505, + 563 + ], + "lines": [ + { + "bbox": [ + 106, + 508, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 106, + 508, + 505, + 520 + ], + "score": 1.0, + "content": "Chuan Guo, Geoff Pleiss, Yu Sun, and Kilian Q. Weinberger. On calibration of modern neural", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 519, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 115, + 519, + 505, + 531 + ], + "score": 1.0, + "content": "networks. In Doina Precup and Yee Whye Teh (eds.), Proceedings of the 34th International", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 528, + 506, + 543 + ], + "spans": [ + { + "bbox": [ + 115, + 528, + 506, + 543 + ], + "score": 1.0, + "content": "Conference on Machine Learning, volume 70 of Proceedings of Machine Learning Research, pp.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 540, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 115, + 540, + 506, + 554 + ], + "score": 1.0, + "content": "1321–1330, International Convention Centre, Sydney, Australia, 06–11 Aug 2017. PMLR. URL", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 552, + 374, + 564 + ], + "spans": [ + { + "bbox": [ + 115, + 552, + 374, + 564 + ], + "score": 1.0, + "content": "http://proceedings.mlr.press/v70/guo17a.html.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32, + "bbox_fs": [ + 106, + 508, + 506, + 564 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 571, + 506, + 637 + ], + "lines": [ + { + "bbox": [ + 106, + 572, + 506, + 583 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 420, + 583 + ], + "score": 1.0, + "content": "Jonathan Ho, Xi Chen, Aravind Srinivas, Yan Duan, and Pieter Abbeel. Flow", + "type": "text" + }, + { + "bbox": [ + 421, + 573, + 433, + 582 + ], + "score": 0.52, + "content": "^ { + + }", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 572, + 506, + 583 + ], + "score": 1.0, + "content": ": Improving flow-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 582, + 506, + 595 + ], + "spans": [ + { + "bbox": [ + 115, + 582, + 506, + 595 + ], + "score": 1.0, + "content": "based generative models with variational dequantization and architecture design. In Kamalika", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 592, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 115, + 592, + 506, + 606 + ], + "score": 1.0, + "content": "Chaudhuri and Ruslan Salakhutdinov (eds.), Proceedings of the 36th International Conference on", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 114, + 602, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 114, + 602, + 506, + 618 + ], + "score": 1.0, + "content": "Machine Learning, volume 97 of Proceedings of Machine Learning Research, pp. 2722–2730, Long", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 614, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 115, + 614, + 506, + 628 + ], + "score": 1.0, + "content": "Beach, California, USA, 09–15 Jun 2019. PMLR. URL http://proceedings.mlr.press/", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 626, + 203, + 638 + ], + "spans": [ + { + "bbox": [ + 115, + 626, + 203, + 638 + ], + "score": 1.0, + "content": "v97/ho19a.html.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37.5, + "bbox_fs": [ + 106, + 572, + 506, + 638 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 646, + 506, + 702 + ], + "lines": [ + { + "bbox": [ + 106, + 646, + 506, + 658 + ], + "spans": [ + { + "bbox": [ + 106, + 646, + 506, + 658 + ], + "score": 1.0, + "content": "Chin-Wei Huang, David Krueger, Alexandre Lacoste, and Aaron Courville. Neural autore-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 657, + 506, + 670 + ], + "spans": [ + { + "bbox": [ + 115, + 657, + 506, + 670 + ], + "score": 1.0, + "content": "gressive flows. In Jennifer Dy and Andreas Krause (eds.), Proceedings of the 35th Interna-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 667, + 506, + 681 + ], + "spans": [ + { + "bbox": [ + 116, + 667, + 506, + 681 + ], + "score": 1.0, + "content": "tional Conference on Machine Learning, volume 80 of Proceedings of Machine Learning Re-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 678, + 506, + 691 + ], + "spans": [ + { + "bbox": [ + 115, + 678, + 506, + 691 + ], + "score": 1.0, + "content": "search, pp. 2078–2087, Stockholmsmssan, Stockholm Sweden, 10–15 Jul 2018. PMLR. URL", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 116, + 690, + 387, + 702 + ], + "spans": [ + { + "bbox": [ + 116, + 690, + 387, + 702 + ], + "score": 1.0, + "content": "http://proceedings.mlr.press/v80/huang18d.html.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43, + "bbox_fs": [ + 106, + 646, + 506, + 702 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 507, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 507, + 722 + ], + "score": 1.0, + "content": "Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye,", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 115, + 720, + 507, + 734 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 507, + 734 + ], + "score": 1.0, + "content": "and Tie-Yan Liu. Lightgbm: A highly efficient gradient boosting decision tree. In", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46.5, + "bbox_fs": [ + 106, + 708, + 507, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 116, + 82, + 506, + 127 + ], + "lines": [ + { + "bbox": [ + 115, + 82, + 506, + 94 + ], + "spans": [ + { + "bbox": [ + 115, + 82, + 506, + 94 + ], + "score": 1.0, + "content": "I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Gar-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 505, + 105 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 505, + 105 + ], + "score": 1.0, + "content": "nett (eds.), Advances in Neural Information Processing Systems 30, pp. 3146–3154. Curran", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 104, + 507, + 117 + ], + "spans": [ + { + "bbox": [ + 115, + 104, + 507, + 117 + ], + "score": 1.0, + "content": "Associates, Inc., 2017. URL http://papers.nips.cc/paper/6907-lightgbm-a-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 115, + 432, + 128 + ], + "spans": [ + { + "bbox": [ + 115, + 115, + 432, + 128 + ], + "score": 1.0, + "content": "highly-efficient-gradient-boosting-decision-tree.pdf.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "text", + "bbox": [ + 107, + 133, + 506, + 200 + ], + "lines": [ + { + "bbox": [ + 106, + 132, + 507, + 146 + ], + "spans": [ + { + "bbox": [ + 106, + 132, + 507, + 146 + ], + "score": 1.0, + "content": "Alex Kendall and Yarin Gal. What uncertainties do we need in bayesian deep learn-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 114, + 144, + 507, + 157 + ], + "spans": [ + { + "bbox": [ + 114, + 144, + 233, + 157 + ], + "score": 1.0, + "content": "ing for computer vision?", + "type": "text" + }, + { + "bbox": [ + 253, + 144, + 507, + 157 + ], + "score": 1.0, + "content": "In I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach,", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 114, + 154, + 507, + 168 + ], + "spans": [ + { + "bbox": [ + 114, + 154, + 507, + 168 + ], + "score": 1.0, + "content": "R. Fergus, S. Vishwanathan, and R. Garnett (eds.), Advances in Neural Informa-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 166, + 506, + 179 + ], + "spans": [ + { + "bbox": [ + 115, + 166, + 469, + 179 + ], + "score": 1.0, + "content": "tion Processing Systems 30, pp. 5574–5584. Curran Associates, Inc., 2017.", + "type": "text" + }, + { + "bbox": [ + 481, + 167, + 506, + 178 + ], + "score": 1.0, + "content": "URL", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 177, + 491, + 190 + ], + "spans": [ + { + "bbox": [ + 115, + 177, + 491, + 190 + ], + "score": 1.0, + "content": "http://papers.nips.cc/paper/7141-what-uncertainties-do-we-need-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 117, + 189, + 414, + 200 + ], + "spans": [ + { + "bbox": [ + 117, + 189, + 414, + 200 + ], + "score": 1.0, + "content": "in-bayesian-deep-learning-for-computer-vision.pdf.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 107, + 206, + 506, + 262 + ], + "lines": [ + { + "bbox": [ + 106, + 207, + 506, + 217 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 506, + 217 + ], + "score": 1.0, + "content": "Durk P Kingma and Prafulla Dhariwal. Glow: Generative flow with invertible 1x1 convolutions.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 217, + 507, + 230 + ], + "spans": [ + { + "bbox": [ + 115, + 217, + 507, + 230 + ], + "score": 1.0, + "content": "In S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett (eds.),", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 228, + 507, + 241 + ], + "spans": [ + { + "bbox": [ + 115, + 228, + 507, + 241 + ], + "score": 1.0, + "content": "Advances in Neural Information Processing Systems 31, pp. 10215–10224. Curran Associates,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 239, + 507, + 253 + ], + "spans": [ + { + "bbox": [ + 115, + 239, + 507, + 253 + ], + "score": 1.0, + "content": "Inc., 2018. URL http://papers.nips.cc/paper/8224-glow-generative-flow-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 250, + 335, + 262 + ], + "spans": [ + { + "bbox": [ + 115, + 250, + 335, + 262 + ], + "score": 1.0, + "content": "with-invertible-1x1-convolutions.pdf.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 268, + 506, + 335 + ], + "lines": [ + { + "bbox": [ + 106, + 267, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 106, + 267, + 505, + 280 + ], + "score": 1.0, + "content": "Durk P Kingma, Tim Salimans, Rafal Jozefowicz, Xi Chen, Ilya Sutskever, and Max", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 277, + 507, + 293 + ], + "spans": [ + { + "bbox": [ + 115, + 277, + 507, + 293 + ], + "score": 1.0, + "content": "Welling. Improved variational inference with inverse autoregressive flow. In D. D.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 290, + 506, + 303 + ], + "spans": [ + { + "bbox": [ + 115, + 290, + 506, + 303 + ], + "score": 1.0, + "content": "Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett (eds.), Advances in", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 114, + 300, + 507, + 314 + ], + "spans": [ + { + "bbox": [ + 114, + 300, + 507, + 314 + ], + "score": 1.0, + "content": "Neural Information Processing Systems 29, pp. 4743–4751. Curran Associates, Inc.,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 311, + 508, + 325 + ], + "spans": [ + { + "bbox": [ + 115, + 311, + 145, + 324 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + }, + { + "bbox": [ + 157, + 311, + 508, + 325 + ], + "score": 1.0, + "content": "URL http://papers.nips.cc/paper/6581-improved-variational-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 322, + 396, + 336 + ], + "spans": [ + { + "bbox": [ + 115, + 322, + 396, + 336 + ], + "score": 1.0, + "content": "inference-with-inverse-autoregressive-flow.pdf.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 107, + 341, + 505, + 397 + ], + "lines": [ + { + "bbox": [ + 106, + 339, + 506, + 356 + ], + "spans": [ + { + "bbox": [ + 106, + 339, + 506, + 356 + ], + "score": 1.0, + "content": "Volodymyr Kuleshov, Nathan Fenner, and Stefano Ermon. Accurate uncertainties for deep learning", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 353, + 505, + 365 + ], + "spans": [ + { + "bbox": [ + 116, + 353, + 505, + 365 + ], + "score": 1.0, + "content": "using calibrated regression. In Jennifer Dy and Andreas Krause (eds.), Proceedings of the 35th", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 361, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 115, + 361, + 506, + 378 + ], + "score": 1.0, + "content": "International Conference on Machine Learning, volume 80 of Proceedings of Machine Learning", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 374, + 506, + 386 + ], + "spans": [ + { + "bbox": [ + 115, + 374, + 506, + 386 + ], + "score": 1.0, + "content": "Research, pp. 2796–2804, Stockholmsmssan, Stockholm Sweden, 10–15 Jul 2018. PMLR. URL", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 386, + 405, + 398 + ], + "spans": [ + { + "bbox": [ + 116, + 386, + 405, + 398 + ], + "score": 1.0, + "content": "http://proceedings.mlr.press/v80/kuleshov18a.html.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 106, + 403, + 506, + 470 + ], + "lines": [ + { + "bbox": [ + 106, + 403, + 506, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 403, + 424, + 415 + ], + "score": 1.0, + "content": "Balaji Lakshminarayanan, Alexander Pritzel, and Charles Blundell.", + "type": "text" + }, + { + "bbox": [ + 426, + 403, + 506, + 415 + ], + "score": 1.0, + "content": "Simple and scal-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 414, + 507, + 427 + ], + "spans": [ + { + "bbox": [ + 115, + 414, + 394, + 427 + ], + "score": 1.0, + "content": "able predictive uncertainty estimation using deep ensembles.", + "type": "text" + }, + { + "bbox": [ + 408, + 414, + 507, + 427 + ], + "score": 1.0, + "content": "In I. Guyon, U. V.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 425, + 507, + 437 + ], + "spans": [ + { + "bbox": [ + 116, + 425, + 507, + 437 + ], + "score": 1.0, + "content": "Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (eds.), Ad-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 116, + 436, + 507, + 449 + ], + "spans": [ + { + "bbox": [ + 116, + 436, + 507, + 449 + ], + "score": 1.0, + "content": "vances in Neural Information Processing Systems 30, pp. 6402–6413. Curran Associates,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 446, + 507, + 461 + ], + "spans": [ + { + "bbox": [ + 115, + 446, + 507, + 461 + ], + "score": 1.0, + "content": "Inc., 2017. URL http://papers.nips.cc/paper/7219-simple-and-scalable-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 458, + 468, + 471 + ], + "spans": [ + { + "bbox": [ + 115, + 458, + 468, + 471 + ], + "score": 1.0, + "content": "predictive-uncertainty-estimation-using-deep-ensembles.pdf.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 107, + 476, + 505, + 510 + ], + "lines": [ + { + "bbox": [ + 105, + 475, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 475, + 505, + 489 + ], + "score": 1.0, + "content": "David A Nix and Andreas S Weigend. Estimating the mean and variance of the target probability", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 487, + 506, + 500 + ], + "spans": [ + { + "bbox": [ + 116, + 487, + 506, + 500 + ], + "score": 1.0, + "content": "distribution. In Proceedings of 1994 ieee international conference on neural networks (ICNN’94),", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 498, + 255, + 510 + ], + "spans": [ + { + "bbox": [ + 116, + 498, + 255, + 510 + ], + "score": 1.0, + "content": "volume 1, pp. 55–60. IEEE, 1994.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 106, + 516, + 506, + 572 + ], + "lines": [ + { + "bbox": [ + 106, + 515, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 106, + 515, + 505, + 529 + ], + "score": 1.0, + "content": "George Papamakarios, Theo Pavlakou, and Iain Murray. Masked autoregressive flow for density", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 527, + 506, + 541 + ], + "spans": [ + { + "bbox": [ + 115, + 527, + 506, + 541 + ], + "score": 1.0, + "content": "estimation. In I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 538, + 506, + 551 + ], + "spans": [ + { + "bbox": [ + 116, + 538, + 506, + 551 + ], + "score": 1.0, + "content": "and R. Garnett (eds.), Advances in Neural Information Processing Systems 30, pp. 2338–2347.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 549, + 507, + 563 + ], + "spans": [ + { + "bbox": [ + 116, + 549, + 507, + 563 + ], + "score": 1.0, + "content": "Curran Associates, Inc., 2017. URL http://papers.nips.cc/paper/6828-masked-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 561, + 395, + 572 + ], + "spans": [ + { + "bbox": [ + 115, + 561, + 395, + 572 + ], + "score": 1.0, + "content": "autoregressive-flow-for-density-estimation.pdf.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 578, + 505, + 623 + ], + "lines": [ + { + "bbox": [ + 106, + 579, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 505, + 591 + ], + "score": 1.0, + "content": "Tim Pearce, Alexandra Brintrup, Mohamed Zaki, and Andy Neely. High-quality prediction intervals", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 589, + 504, + 601 + ], + "spans": [ + { + "bbox": [ + 116, + 589, + 504, + 601 + ], + "score": 1.0, + "content": "for deep learning: A distribution-free, ensembled approach. volume 80 of Proceedings of Machine", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 600, + 506, + 612 + ], + "spans": [ + { + "bbox": [ + 115, + 600, + 506, + 612 + ], + "score": 1.0, + "content": "Learning Research, pp. 4075–4084, Stockholmsmssan, Stockholm Sweden, 10–15 Jul 2018.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 612, + 448, + 624 + ], + "spans": [ + { + "bbox": [ + 115, + 612, + 448, + 624 + ], + "score": 1.0, + "content": "PMLR. URL http://proceedings.mlr.press/v80/pearce18a.html.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 41.5 + }, + { + "type": "text", + "bbox": [ + 108, + 629, + 504, + 652 + ], + "lines": [ + { + "bbox": [ + 106, + 628, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 106, + 628, + 505, + 642 + ], + "score": 1.0, + "content": "Boris Polyak and Anatoli Juditsky. Acceleration of stochastic approximation by averaging. SIAM", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 640, + 454, + 653 + ], + "spans": [ + { + "bbox": [ + 115, + 640, + 454, + 653 + ], + "score": 1.0, + "content": "Journal on Control and Optimization, 30:838–855, 07 1992. doi: 10.1137/0330046.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44.5 + }, + { + "type": "text", + "bbox": [ + 107, + 658, + 506, + 704 + ], + "lines": [ + { + "bbox": [ + 106, + 658, + 505, + 670 + ], + "spans": [ + { + "bbox": [ + 106, + 658, + 505, + 670 + ], + "score": 1.0, + "content": "Danilo Rezende and Shakir Mohamed. Variational inference with normalizing flows. In Francis Bach", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 115, + 669, + 507, + 683 + ], + "spans": [ + { + "bbox": [ + 115, + 669, + 507, + 683 + ], + "score": 1.0, + "content": "and David Blei (eds.), Proceedings of the 32nd International Conference on Machine Learning,", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 115, + 680, + 506, + 693 + ], + "spans": [ + { + "bbox": [ + 115, + 680, + 506, + 693 + ], + "score": 1.0, + "content": "volume 37 of Proceedings of Machine Learning Research, pp. 1530–1538, Lille, France, 07–09", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 115, + 691, + 488, + 705 + ], + "spans": [ + { + "bbox": [ + 115, + 691, + 488, + 705 + ], + "score": 1.0, + "content": "Jul 2015. PMLR. URL http://proceedings.mlr.press/v37/rezende15.html.", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 47.5 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "Filipe Rodrigues and Francisco C. Pereira. Beyond expectation: Deep joint mean and quantile", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 114, + 720, + 492, + 733 + ], + "spans": [ + { + "bbox": [ + 114, + 720, + 492, + 733 + ], + "score": 1.0, + "content": "regression for spatio-temporal problems. arXiv e-prints, art. arXiv:1808.08798, August 2018.", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 50.5 + } + ], + "page_idx": 10, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 116, + 82, + 506, + 127 + ], + "lines": [ + { + "bbox": [ + 115, + 82, + 506, + 94 + ], + "spans": [ + { + "bbox": [ + 115, + 82, + 506, + 94 + ], + "score": 1.0, + "content": "I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Gar-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 505, + 105 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 505, + 105 + ], + "score": 1.0, + "content": "nett (eds.), Advances in Neural Information Processing Systems 30, pp. 3146–3154. Curran", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 104, + 507, + 117 + ], + "spans": [ + { + "bbox": [ + 115, + 104, + 507, + 117 + ], + "score": 1.0, + "content": "Associates, Inc., 2017. URL http://papers.nips.cc/paper/6907-lightgbm-a-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 115, + 432, + 128 + ], + "spans": [ + { + "bbox": [ + 115, + 115, + 432, + 128 + ], + "score": 1.0, + "content": "highly-efficient-gradient-boosting-decision-tree.pdf.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5, + "bbox_fs": [ + 115, + 82, + 507, + 128 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 133, + 506, + 200 + ], + "lines": [ + { + "bbox": [ + 106, + 132, + 507, + 146 + ], + "spans": [ + { + "bbox": [ + 106, + 132, + 507, + 146 + ], + "score": 1.0, + "content": "Alex Kendall and Yarin Gal. What uncertainties do we need in bayesian deep learn-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 114, + 144, + 507, + 157 + ], + "spans": [ + { + "bbox": [ + 114, + 144, + 233, + 157 + ], + "score": 1.0, + "content": "ing for computer vision?", + "type": "text" + }, + { + "bbox": [ + 253, + 144, + 507, + 157 + ], + "score": 1.0, + "content": "In I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach,", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 114, + 154, + 507, + 168 + ], + "spans": [ + { + "bbox": [ + 114, + 154, + 507, + 168 + ], + "score": 1.0, + "content": "R. Fergus, S. Vishwanathan, and R. Garnett (eds.), Advances in Neural Informa-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 166, + 506, + 179 + ], + "spans": [ + { + "bbox": [ + 115, + 166, + 469, + 179 + ], + "score": 1.0, + "content": "tion Processing Systems 30, pp. 5574–5584. Curran Associates, Inc., 2017.", + "type": "text" + }, + { + "bbox": [ + 481, + 167, + 506, + 178 + ], + "score": 1.0, + "content": "URL", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 177, + 491, + 190 + ], + "spans": [ + { + "bbox": [ + 115, + 177, + 491, + 190 + ], + "score": 1.0, + "content": "http://papers.nips.cc/paper/7141-what-uncertainties-do-we-need-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 117, + 189, + 414, + 200 + ], + "spans": [ + { + "bbox": [ + 117, + 189, + 414, + 200 + ], + "score": 1.0, + "content": "in-bayesian-deep-learning-for-computer-vision.pdf.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6.5, + "bbox_fs": [ + 106, + 132, + 507, + 200 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 206, + 506, + 262 + ], + "lines": [ + { + "bbox": [ + 106, + 207, + 506, + 217 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 506, + 217 + ], + "score": 1.0, + "content": "Durk P Kingma and Prafulla Dhariwal. Glow: Generative flow with invertible 1x1 convolutions.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 217, + 507, + 230 + ], + "spans": [ + { + "bbox": [ + 115, + 217, + 507, + 230 + ], + "score": 1.0, + "content": "In S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett (eds.),", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 228, + 507, + 241 + ], + "spans": [ + { + "bbox": [ + 115, + 228, + 507, + 241 + ], + "score": 1.0, + "content": "Advances in Neural Information Processing Systems 31, pp. 10215–10224. Curran Associates,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 239, + 507, + 253 + ], + "spans": [ + { + "bbox": [ + 115, + 239, + 507, + 253 + ], + "score": 1.0, + "content": "Inc., 2018. URL http://papers.nips.cc/paper/8224-glow-generative-flow-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 250, + 335, + 262 + ], + "spans": [ + { + "bbox": [ + 115, + 250, + 335, + 262 + ], + "score": 1.0, + "content": "with-invertible-1x1-convolutions.pdf.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12, + "bbox_fs": [ + 106, + 207, + 507, + 262 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 268, + 506, + 335 + ], + "lines": [ + { + "bbox": [ + 106, + 267, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 106, + 267, + 505, + 280 + ], + "score": 1.0, + "content": "Durk P Kingma, Tim Salimans, Rafal Jozefowicz, Xi Chen, Ilya Sutskever, and Max", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 277, + 507, + 293 + ], + "spans": [ + { + "bbox": [ + 115, + 277, + 507, + 293 + ], + "score": 1.0, + "content": "Welling. Improved variational inference with inverse autoregressive flow. In D. D.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 290, + 506, + 303 + ], + "spans": [ + { + "bbox": [ + 115, + 290, + 506, + 303 + ], + "score": 1.0, + "content": "Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett (eds.), Advances in", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 114, + 300, + 507, + 314 + ], + "spans": [ + { + "bbox": [ + 114, + 300, + 507, + 314 + ], + "score": 1.0, + "content": "Neural Information Processing Systems 29, pp. 4743–4751. Curran Associates, Inc.,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 311, + 508, + 325 + ], + "spans": [ + { + "bbox": [ + 115, + 311, + 145, + 324 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + }, + { + "bbox": [ + 157, + 311, + 508, + 325 + ], + "score": 1.0, + "content": "URL http://papers.nips.cc/paper/6581-improved-variational-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 322, + 396, + 336 + ], + "spans": [ + { + "bbox": [ + 115, + 322, + 396, + 336 + ], + "score": 1.0, + "content": "inference-with-inverse-autoregressive-flow.pdf.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5, + "bbox_fs": [ + 106, + 267, + 508, + 336 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 341, + 505, + 397 + ], + "lines": [ + { + "bbox": [ + 106, + 339, + 506, + 356 + ], + "spans": [ + { + "bbox": [ + 106, + 339, + 506, + 356 + ], + "score": 1.0, + "content": "Volodymyr Kuleshov, Nathan Fenner, and Stefano Ermon. Accurate uncertainties for deep learning", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 353, + 505, + 365 + ], + "spans": [ + { + "bbox": [ + 116, + 353, + 505, + 365 + ], + "score": 1.0, + "content": "using calibrated regression. In Jennifer Dy and Andreas Krause (eds.), Proceedings of the 35th", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 361, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 115, + 361, + 506, + 378 + ], + "score": 1.0, + "content": "International Conference on Machine Learning, volume 80 of Proceedings of Machine Learning", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 374, + 506, + 386 + ], + "spans": [ + { + "bbox": [ + 115, + 374, + 506, + 386 + ], + "score": 1.0, + "content": "Research, pp. 2796–2804, Stockholmsmssan, Stockholm Sweden, 10–15 Jul 2018. PMLR. URL", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 386, + 405, + 398 + ], + "spans": [ + { + "bbox": [ + 116, + 386, + 405, + 398 + ], + "score": 1.0, + "content": "http://proceedings.mlr.press/v80/kuleshov18a.html.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23, + "bbox_fs": [ + 106, + 339, + 506, + 398 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 403, + 506, + 470 + ], + "lines": [ + { + "bbox": [ + 106, + 403, + 506, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 403, + 424, + 415 + ], + "score": 1.0, + "content": "Balaji Lakshminarayanan, Alexander Pritzel, and Charles Blundell.", + "type": "text" + }, + { + "bbox": [ + 426, + 403, + 506, + 415 + ], + "score": 1.0, + "content": "Simple and scal-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 414, + 507, + 427 + ], + "spans": [ + { + "bbox": [ + 115, + 414, + 394, + 427 + ], + "score": 1.0, + "content": "able predictive uncertainty estimation using deep ensembles.", + "type": "text" + }, + { + "bbox": [ + 408, + 414, + 507, + 427 + ], + "score": 1.0, + "content": "In I. Guyon, U. V.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 425, + 507, + 437 + ], + "spans": [ + { + "bbox": [ + 116, + 425, + 507, + 437 + ], + "score": 1.0, + "content": "Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (eds.), Ad-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 116, + 436, + 507, + 449 + ], + "spans": [ + { + "bbox": [ + 116, + 436, + 507, + 449 + ], + "score": 1.0, + "content": "vances in Neural Information Processing Systems 30, pp. 6402–6413. Curran Associates,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 446, + 507, + 461 + ], + "spans": [ + { + "bbox": [ + 115, + 446, + 507, + 461 + ], + "score": 1.0, + "content": "Inc., 2017. URL http://papers.nips.cc/paper/7219-simple-and-scalable-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 458, + 468, + 471 + ], + "spans": [ + { + "bbox": [ + 115, + 458, + 468, + 471 + ], + "score": 1.0, + "content": "predictive-uncertainty-estimation-using-deep-ensembles.pdf.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5, + "bbox_fs": [ + 106, + 403, + 507, + 471 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 476, + 505, + 510 + ], + "lines": [ + { + "bbox": [ + 105, + 475, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 475, + 505, + 489 + ], + "score": 1.0, + "content": "David A Nix and Andreas S Weigend. Estimating the mean and variance of the target probability", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 487, + 506, + 500 + ], + "spans": [ + { + "bbox": [ + 116, + 487, + 506, + 500 + ], + "score": 1.0, + "content": "distribution. In Proceedings of 1994 ieee international conference on neural networks (ICNN’94),", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 498, + 255, + 510 + ], + "spans": [ + { + "bbox": [ + 116, + 498, + 255, + 510 + ], + "score": 1.0, + "content": "volume 1, pp. 55–60. IEEE, 1994.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33, + "bbox_fs": [ + 105, + 475, + 506, + 510 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 516, + 506, + 572 + ], + "lines": [ + { + "bbox": [ + 106, + 515, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 106, + 515, + 505, + 529 + ], + "score": 1.0, + "content": "George Papamakarios, Theo Pavlakou, and Iain Murray. Masked autoregressive flow for density", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 527, + 506, + 541 + ], + "spans": [ + { + "bbox": [ + 115, + 527, + 506, + 541 + ], + "score": 1.0, + "content": "estimation. In I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 538, + 506, + 551 + ], + "spans": [ + { + "bbox": [ + 116, + 538, + 506, + 551 + ], + "score": 1.0, + "content": "and R. Garnett (eds.), Advances in Neural Information Processing Systems 30, pp. 2338–2347.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 549, + 507, + 563 + ], + "spans": [ + { + "bbox": [ + 116, + 549, + 507, + 563 + ], + "score": 1.0, + "content": "Curran Associates, Inc., 2017. URL http://papers.nips.cc/paper/6828-masked-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 561, + 395, + 572 + ], + "spans": [ + { + "bbox": [ + 115, + 561, + 395, + 572 + ], + "score": 1.0, + "content": "autoregressive-flow-for-density-estimation.pdf.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37, + "bbox_fs": [ + 106, + 515, + 507, + 572 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 578, + 505, + 623 + ], + "lines": [ + { + "bbox": [ + 106, + 579, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 505, + 591 + ], + "score": 1.0, + "content": "Tim Pearce, Alexandra Brintrup, Mohamed Zaki, and Andy Neely. High-quality prediction intervals", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 589, + 504, + 601 + ], + "spans": [ + { + "bbox": [ + 116, + 589, + 504, + 601 + ], + "score": 1.0, + "content": "for deep learning: A distribution-free, ensembled approach. volume 80 of Proceedings of Machine", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 600, + 506, + 612 + ], + "spans": [ + { + "bbox": [ + 115, + 600, + 506, + 612 + ], + "score": 1.0, + "content": "Learning Research, pp. 4075–4084, Stockholmsmssan, Stockholm Sweden, 10–15 Jul 2018.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 612, + 448, + 624 + ], + "spans": [ + { + "bbox": [ + 115, + 612, + 448, + 624 + ], + "score": 1.0, + "content": "PMLR. URL http://proceedings.mlr.press/v80/pearce18a.html.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 41.5, + "bbox_fs": [ + 106, + 579, + 506, + 624 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 629, + 504, + 652 + ], + "lines": [ + { + "bbox": [ + 106, + 628, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 106, + 628, + 505, + 642 + ], + "score": 1.0, + "content": "Boris Polyak and Anatoli Juditsky. Acceleration of stochastic approximation by averaging. SIAM", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 640, + 454, + 653 + ], + "spans": [ + { + "bbox": [ + 115, + 640, + 454, + 653 + ], + "score": 1.0, + "content": "Journal on Control and Optimization, 30:838–855, 07 1992. doi: 10.1137/0330046.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44.5, + "bbox_fs": [ + 106, + 628, + 505, + 653 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 658, + 506, + 704 + ], + "lines": [ + { + "bbox": [ + 106, + 658, + 505, + 670 + ], + "spans": [ + { + "bbox": [ + 106, + 658, + 505, + 670 + ], + "score": 1.0, + "content": "Danilo Rezende and Shakir Mohamed. Variational inference with normalizing flows. In Francis Bach", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 115, + 669, + 507, + 683 + ], + "spans": [ + { + "bbox": [ + 115, + 669, + 507, + 683 + ], + "score": 1.0, + "content": "and David Blei (eds.), Proceedings of the 32nd International Conference on Machine Learning,", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 115, + 680, + 506, + 693 + ], + "spans": [ + { + "bbox": [ + 115, + 680, + 506, + 693 + ], + "score": 1.0, + "content": "volume 37 of Proceedings of Machine Learning Research, pp. 1530–1538, Lille, France, 07–09", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 115, + 691, + 488, + 705 + ], + "spans": [ + { + "bbox": [ + 115, + 691, + 488, + 705 + ], + "score": 1.0, + "content": "Jul 2015. PMLR. URL http://proceedings.mlr.press/v37/rezende15.html.", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 47.5, + "bbox_fs": [ + 106, + 658, + 507, + 705 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "Filipe Rodrigues and Francisco C. Pereira. Beyond expectation: Deep joint mean and quantile", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 114, + 720, + 492, + 733 + ], + "spans": [ + { + "bbox": [ + 114, + 720, + 492, + 733 + ], + "score": 1.0, + "content": "regression for spatio-temporal problems. arXiv e-prints, art. arXiv:1808.08798, August 2018.", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 50.5, + "bbox_fs": [ + 105, + 708, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 506, + 95 + ], + "score": 1.0, + "content": "David Salinas, Valentin Flunkert, and Jan Gasthaus. DeepAR: Probabilistic Forecasting with Autore-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 441, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 441, + 106 + ], + "score": 1.0, + "content": "gressive Recurrent Networks. arXiv e-prints, art. arXiv:1704.04110, April 2017.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 112, + 506, + 156 + ], + "lines": [ + { + "bbox": [ + 105, + 112, + 506, + 124 + ], + "spans": [ + { + "bbox": [ + 105, + 112, + 506, + 124 + ], + "score": 1.0, + "content": "Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdi-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 124, + 506, + 136 + ], + "spans": [ + { + "bbox": [ + 115, + 124, + 506, + 136 + ], + "score": 1.0, + "content": "nov. Dropout: A simple way to prevent neural networks from overfitting. Journal of Ma-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 134, + 506, + 147 + ], + "spans": [ + { + "bbox": [ + 115, + 134, + 506, + 147 + ], + "score": 1.0, + "content": "chine Learning Research, 15(56):1929–1958, 2014. URL http://jmlr.org/papers/v15/", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 117, + 146, + 226, + 156 + ], + "spans": [ + { + "bbox": [ + 117, + 146, + 226, + 156 + ], + "score": 1.0, + "content": "srivastava14a.html.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 107, + 164, + 506, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 163, + 507, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 163, + 507, + 177 + ], + "score": 1.0, + "content": "Natasa Tagasovska and David Lopez-Paz. Single-model uncertainties for deep learning.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 175, + 507, + 187 + ], + "spans": [ + { + "bbox": [ + 115, + 175, + 507, + 187 + ], + "score": 1.0, + "content": "In Advances in Neural Information Processing Systems 32, pp. 6417–6428. Curran As-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 186, + 508, + 199 + ], + "spans": [ + { + "bbox": [ + 115, + 186, + 508, + 199 + ], + "score": 1.0, + "content": "sociates, Inc., 2019. URL http://papers.nips.cc/paper/8870-single-model-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 117, + 198, + 330, + 209 + ], + "spans": [ + { + "bbox": [ + 117, + 198, + 330, + 209 + ], + "score": 1.0, + "content": "uncertainties-for-deep-learning.pdf.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 105, + 215, + 505, + 239 + ], + "lines": [ + { + "bbox": [ + 105, + 216, + 504, + 229 + ], + "spans": [ + { + "bbox": [ + 105, + 216, + 504, + 229 + ], + "score": 1.0, + "content": "Ichiro Takeuchi, Quoc V Le, Timothy D Sears, and Alexander J Smola. Nonparametric quantile", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 227, + 408, + 239 + ], + "spans": [ + { + "bbox": [ + 115, + 227, + 408, + 239 + ], + "score": 1.0, + "content": "estimation. Journal of Machine Learning Research, 7:1231–1264, 2006.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 107, + 245, + 504, + 268 + ], + "lines": [ + { + "bbox": [ + 105, + 245, + 505, + 259 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 505, + 259 + ], + "score": 1.0, + "content": "James W Taylor. A quantile regression neural network approach to estimating the conditional density", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 257, + 381, + 268 + ], + "spans": [ + { + "bbox": [ + 116, + 257, + 381, + 268 + ], + "score": 1.0, + "content": "of multiperiod returns. Journal of Forecasting, 19:299–311, 2000.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 106, + 275, + 505, + 298 + ], + "lines": [ + { + "bbox": [ + 106, + 275, + 505, + 288 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 505, + 288 + ], + "score": 1.0, + "content": "Michael E Tipping. Sparse bayesian learning and the relevance vector machine. Journal of machine", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 116, + 286, + 285, + 298 + ], + "spans": [ + { + "bbox": [ + 116, + 286, + 285, + 298 + ], + "score": 1.0, + "content": "learning research, 1(Jun):211–244, 2001.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 107, + 305, + 504, + 328 + ], + "lines": [ + { + "bbox": [ + 106, + 305, + 506, + 318 + ], + "spans": [ + { + "bbox": [ + 106, + 305, + 506, + 318 + ], + "score": 1.0, + "content": "Rianne van den Berg, Leonard Hasenclever, Jakub M. Tomczak, and Max Welling. Sylvester", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 316, + 506, + 329 + ], + "spans": [ + { + "bbox": [ + 116, + 316, + 506, + 329 + ], + "score": 1.0, + "content": "Normalizing Flows for Variational Inference. arXiv e-prints, art. arXiv:1803.05649, March 2018.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 106, + 335, + 505, + 358 + ], + "lines": [ + { + "bbox": [ + 106, + 336, + 505, + 347 + ], + "spans": [ + { + "bbox": [ + 106, + 336, + 505, + 347 + ], + "score": 1.0, + "content": "Ruofeng Wen, Kari Torkkola, Balakrishnan Narayanaswamy, and Dhruv Madeka. A Multi-Horizon", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 346, + 466, + 358 + ], + "spans": [ + { + "bbox": [ + 115, + 346, + 466, + 358 + ], + "score": 1.0, + "content": "Quantile Recurrent Forecaster. arXiv e-prints, art. arXiv:1711.11053, November 2017.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + } + ], + "page_idx": 11, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "12", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 506, + 95 + ], + "score": 1.0, + "content": "David Salinas, Valentin Flunkert, and Jan Gasthaus. DeepAR: Probabilistic Forecasting with Autore-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 441, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 441, + 106 + ], + "score": 1.0, + "content": "gressive Recurrent Networks. arXiv e-prints, art. arXiv:1704.04110, April 2017.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 506, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 112, + 506, + 156 + ], + "lines": [ + { + "bbox": [ + 105, + 112, + 506, + 124 + ], + "spans": [ + { + "bbox": [ + 105, + 112, + 506, + 124 + ], + "score": 1.0, + "content": "Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdi-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 124, + 506, + 136 + ], + "spans": [ + { + "bbox": [ + 115, + 124, + 506, + 136 + ], + "score": 1.0, + "content": "nov. Dropout: A simple way to prevent neural networks from overfitting. Journal of Ma-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 134, + 506, + 147 + ], + "spans": [ + { + "bbox": [ + 115, + 134, + 506, + 147 + ], + "score": 1.0, + "content": "chine Learning Research, 15(56):1929–1958, 2014. URL http://jmlr.org/papers/v15/", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 117, + 146, + 226, + 156 + ], + "spans": [ + { + "bbox": [ + 117, + 146, + 226, + 156 + ], + "score": 1.0, + "content": "srivastava14a.html.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 112, + 506, + 156 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 164, + 506, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 163, + 507, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 163, + 507, + 177 + ], + "score": 1.0, + "content": "Natasa Tagasovska and David Lopez-Paz. Single-model uncertainties for deep learning.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 175, + 507, + 187 + ], + "spans": [ + { + "bbox": [ + 115, + 175, + 507, + 187 + ], + "score": 1.0, + "content": "In Advances in Neural Information Processing Systems 32, pp. 6417–6428. Curran As-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 186, + 508, + 199 + ], + "spans": [ + { + "bbox": [ + 115, + 186, + 508, + 199 + ], + "score": 1.0, + "content": "sociates, Inc., 2019. URL http://papers.nips.cc/paper/8870-single-model-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 117, + 198, + 330, + 209 + ], + "spans": [ + { + "bbox": [ + 117, + 198, + 330, + 209 + ], + "score": 1.0, + "content": "uncertainties-for-deep-learning.pdf.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 163, + 508, + 209 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 215, + 505, + 239 + ], + "lines": [ + { + "bbox": [ + 105, + 216, + 504, + 229 + ], + "spans": [ + { + "bbox": [ + 105, + 216, + 504, + 229 + ], + "score": 1.0, + "content": "Ichiro Takeuchi, Quoc V Le, Timothy D Sears, and Alexander J Smola. Nonparametric quantile", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 227, + 408, + 239 + ], + "spans": [ + { + "bbox": [ + 115, + 227, + 408, + 239 + ], + "score": 1.0, + "content": "estimation. Journal of Machine Learning Research, 7:1231–1264, 2006.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 216, + 504, + 239 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 245, + 504, + 268 + ], + "lines": [ + { + "bbox": [ + 105, + 245, + 505, + 259 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 505, + 259 + ], + "score": 1.0, + "content": "James W Taylor. A quantile regression neural network approach to estimating the conditional density", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 257, + 381, + 268 + ], + "spans": [ + { + "bbox": [ + 116, + 257, + 381, + 268 + ], + "score": 1.0, + "content": "of multiperiod returns. Journal of Forecasting, 19:299–311, 2000.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 245, + 505, + 268 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 275, + 505, + 298 + ], + "lines": [ + { + "bbox": [ + 106, + 275, + 505, + 288 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 505, + 288 + ], + "score": 1.0, + "content": "Michael E Tipping. Sparse bayesian learning and the relevance vector machine. Journal of machine", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 116, + 286, + 285, + 298 + ], + "spans": [ + { + "bbox": [ + 116, + 286, + 285, + 298 + ], + "score": 1.0, + "content": "learning research, 1(Jun):211–244, 2001.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 106, + 275, + 505, + 298 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 305, + 504, + 328 + ], + "lines": [ + { + "bbox": [ + 106, + 305, + 506, + 318 + ], + "spans": [ + { + "bbox": [ + 106, + 305, + 506, + 318 + ], + "score": 1.0, + "content": "Rianne van den Berg, Leonard Hasenclever, Jakub M. Tomczak, and Max Welling. Sylvester", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 316, + 506, + 329 + ], + "spans": [ + { + "bbox": [ + 116, + 316, + 506, + 329 + ], + "score": 1.0, + "content": "Normalizing Flows for Variational Inference. arXiv e-prints, art. arXiv:1803.05649, March 2018.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5, + "bbox_fs": [ + 106, + 305, + 506, + 329 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 335, + 505, + 358 + ], + "lines": [ + { + "bbox": [ + 106, + 336, + 505, + 347 + ], + "spans": [ + { + "bbox": [ + 106, + 336, + 505, + 347 + ], + "score": 1.0, + "content": "Ruofeng Wen, Kari Torkkola, Balakrishnan Narayanaswamy, and Dhruv Madeka. A Multi-Horizon", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 346, + 466, + 358 + ], + "spans": [ + { + "bbox": [ + 115, + 346, + 466, + 358 + ], + "score": 1.0, + "content": "Quantile Recurrent Forecaster. arXiv e-prints, art. arXiv:1711.11053, November 2017.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 106, + 336, + 505, + 358 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 166, + 78, + 444, + 151 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 166, + 78, + 444, + 151 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 166, + 78, + 444, + 151 + ], + "spans": [ + { + "bbox": [ + 166, + 78, + 444, + 151 + ], + "score": 0.958, + "type": "image", + "image_path": "c75db8aacd9d4a38c987062b87207c17d500f45fc7262577a8766d51b64af6c7.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 166, + 78, + 444, + 102.33333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 166, + 102.33333333333333, + 444, + 126.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 166, + 126.66666666666666, + 444, + 151.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 159, + 506, + 215 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 159, + 505, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 445, + 172 + ], + "score": 1.0, + "content": "Figure 8: In this figure, we show our conditional flow model. A neural network takes", + "type": "text" + }, + { + "bbox": [ + 445, + 160, + 456, + 170 + ], + "score": 0.77, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 159, + 505, + 172 + ], + "score": 1.0, + "content": "and outputs", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 171, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 505, + 183 + ], + "score": 1.0, + "content": "the scale and shift of an affine flow and a condition vector for QuAR Flows. The condition used in", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 181, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 255, + 194 + ], + "score": 1.0, + "content": "the QuAR Flow is the same for both", + "type": "text" + }, + { + "bbox": [ + 255, + 182, + 284, + 193 + ], + "score": 0.31, + "content": "\\mathrm { Q u A R }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 181, + 505, + 194 + ], + "score": 1.0, + "content": "Flows. After the first conditional affine flow, there are", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 193, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 106, + 193, + 505, + 205 + ], + "score": 1.0, + "content": "two QuAR Flows with unconditional affine flows placed in between these two and at the end. The", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 204, + 496, + 216 + ], + "spans": [ + { + "bbox": [ + 106, + 204, + 496, + 216 + ], + "score": 1.0, + "content": "Conditional Flow model is equivalent to a Conditional Gaussian if we removed the QuAR Flows.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "title", + "bbox": [ + 109, + 236, + 271, + 249 + ], + "lines": [ + { + "bbox": [ + 105, + 235, + 272, + 252 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 272, + 252 + ], + "score": 1.0, + "content": "A MODEL TRAINING DETAILS", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "title", + "bbox": [ + 108, + 262, + 194, + 274 + ], + "lines": [ + { + "bbox": [ + 105, + 261, + 196, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 196, + 276 + ], + "score": 1.0, + "content": "A.1 CALIBRATION", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 106, + 283, + 505, + 372 + ], + "lines": [ + { + "bbox": [ + 105, + 284, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 506, + 297 + ], + "score": 1.0, + "content": "We compare the performance of our model and multiple other popular approaches on 8 UCI datasets", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 295, + 506, + 308 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 506, + 308 + ], + "score": 1.0, + "content": "(Dheeru & Karra Taniskidou, 2017): boston-housing, concrete, energy, kin8nm, naval-propulsion-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 306, + 506, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 306, + 506, + 318 + ], + "score": 1.0, + "content": "plant, power-plant, wine-quality-red and yacht. The models we compared Conditional Flows to", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 316, + 506, + 330 + ], + "spans": [ + { + "bbox": [ + 105, + 316, + 506, + 330 + ], + "score": 1.0, + "content": "were: Conditional Gaussian (amortized inference with Gaussians, Lakshminarayanan et al. (2017)),", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 327, + 506, + 341 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 506, + 341 + ], + "score": 1.0, + "content": "Bayesian Ridge Regression (Tipping, 2001), MC Dropout (Gal & Ghahramani, 2016), Simultaneous", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 338, + 505, + 352 + ], + "spans": [ + { + "bbox": [ + 106, + 338, + 505, + 352 + ], + "score": 1.0, + "content": "Quantile Regression (SQR) (Tagasovska & Lopez-Paz, 2019), Conditional Quantile (SQR where", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 349, + 506, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 349, + 506, + 362 + ], + "score": 1.0, + "content": "we only learn prespecified quantiles), Quality Driven (Pearce et al., 2018), and a Gradient Boosted", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 361, + 301, + 373 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 301, + 373 + ], + "score": 1.0, + "content": "Decision Tree with LightGBM (Ke et al., 2017).", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 377, + 505, + 444 + ], + "lines": [ + { + "bbox": [ + 105, + 377, + 506, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 377, + 506, + 390 + ], + "score": 1.0, + "content": "Figure 8 shows a representation of the Conditional Flow network we used. The QuAR Flows are", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 388, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 106, + 388, + 506, + 401 + ], + "score": 1.0, + "content": "conditioned on a 64-dimensional representation from the condition network. Each Conditional QuAR", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 398, + 506, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 506, + 412 + ], + "score": 1.0, + "content": "Flow has two hidden layers in the residual connection with a hidden size 64 with ELU (Clevert et al.,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 410, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 505, + 423 + ], + "score": 1.0, + "content": "2015) as our activation. The condition network has a single hidden layer with size 64 and ReLU", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 421, + 504, + 433 + ], + "spans": [ + { + "bbox": [ + 106, + 421, + 504, + 433 + ], + "score": 1.0, + "content": "as our activation. The QuAR Flows are conditioned on the 64-dimensional representation from the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 433, + 183, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 183, + 443 + ], + "score": 1.0, + "content": "condition network.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 108, + 449, + 505, + 483 + ], + "lines": [ + { + "bbox": [ + 106, + 449, + 505, + 461 + ], + "spans": [ + { + "bbox": [ + 106, + 449, + 505, + 461 + ], + "score": 1.0, + "content": "For the other neural network approaches, we used networks with two hidden layers with size 128 and", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 460, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 106, + 460, + 505, + 473 + ], + "score": 1.0, + "content": "used ReLU as our nonlinearity. For hyperparameter tuning on all our neural networks, we searched", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 471, + 183, + 484 + ], + "spans": [ + { + "bbox": [ + 106, + 471, + 183, + 484 + ], + "score": 1.0, + "content": "the following grid:", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 132, + 493, + 278, + 538 + ], + "lines": [ + { + "bbox": [ + 132, + 493, + 267, + 505 + ], + "spans": [ + { + "bbox": [ + 132, + 493, + 267, + 505 + ], + "score": 1.0, + "content": "• Learning rate: 1e-2, 1e-3, 1e-4", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 133, + 510, + 277, + 522 + ], + "spans": [ + { + "bbox": [ + 133, + 510, + 277, + 522 + ], + "score": 1.0, + "content": "• Weight decay: 0, 1e-3, 1e-2, 1e-1", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 133, + 526, + 278, + 538 + ], + "spans": [ + { + "bbox": [ + 133, + 526, + 278, + 538 + ], + "score": 1.0, + "content": "• Dropout Rates: 0.1 0.25, 0.5 0.75", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 105, + 549, + 505, + 572 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 506, + 562 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 506, + 562 + ], + "score": 1.0, + "content": "The hyperparameters we used were taken from Tagasovska & Lopez-Paz (2019). We trained each of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 560, + 337, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 337, + 572 + ], + "score": 1.0, + "content": "our neural networks for 2000 epochs with batch size 128.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 104, + 577, + 504, + 600 + ], + "lines": [ + { + "bbox": [ + 106, + 577, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 106, + 577, + 505, + 589 + ], + "score": 1.0, + "content": "For our LightGBM tree model (Ke et al., 2017), we used mean squared error as our loss to learn the", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 588, + 424, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 424, + 601 + ], + "score": 1.0, + "content": "mean of the output distribution. The grid of hyperparameters we searched was:", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 132, + 610, + 297, + 687 + ], + "lines": [ + { + "bbox": [ + 132, + 610, + 258, + 622 + ], + "spans": [ + { + "bbox": [ + 132, + 610, + 258, + 622 + ], + "score": 1.0, + "content": "• Number of Trees: 100, 1000", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 132, + 626, + 258, + 640 + ], + "spans": [ + { + "bbox": [ + 132, + 626, + 258, + 640 + ], + "score": 1.0, + "content": "• Maximum Depths: 3, 5, 7, 9", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 133, + 643, + 297, + 655 + ], + "spans": [ + { + "bbox": [ + 133, + 643, + 297, + 655 + ], + "score": 1.0, + "content": "• Learning Rates: 1e-1, 1e-2, 1e-3, 1e-4", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 132, + 658, + 271, + 672 + ], + "spans": [ + { + "bbox": [ + 132, + 658, + 271, + 672 + ], + "score": 1.0, + "content": "• Minimum Child Samples: 1, 20", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 133, + 676, + 277, + 688 + ], + "spans": [ + { + "bbox": [ + 133, + 676, + 277, + 688 + ], + "score": 1.0, + "content": "• Dropout Rates: 0.1 0.25, 0.5 0.75", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "score": 1.0, + "content": "To make the tree model distributional, assuming homoscedasticity, we computed the standard de-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "viation of the predicted normal distribution by computing the standard deviation of the residuals", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 721, + 241, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 241, + 733 + ], + "score": 1.0, + "content": "(observations minus predictions).", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40 + } + ], + "page_idx": 12, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 166, + 78, + 444, + 151 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 166, + 78, + 444, + 151 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 166, + 78, + 444, + 151 + ], + "spans": [ + { + "bbox": [ + 166, + 78, + 444, + 151 + ], + "score": 0.958, + "type": "image", + "image_path": "c75db8aacd9d4a38c987062b87207c17d500f45fc7262577a8766d51b64af6c7.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 166, + 78, + 444, + 102.33333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 166, + 102.33333333333333, + 444, + 126.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 166, + 126.66666666666666, + 444, + 151.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 159, + 506, + 215 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 159, + 505, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 445, + 172 + ], + "score": 1.0, + "content": "Figure 8: In this figure, we show our conditional flow model. A neural network takes", + "type": "text" + }, + { + "bbox": [ + 445, + 160, + 456, + 170 + ], + "score": 0.77, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 159, + 505, + 172 + ], + "score": 1.0, + "content": "and outputs", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 171, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 505, + 183 + ], + "score": 1.0, + "content": "the scale and shift of an affine flow and a condition vector for QuAR Flows. The condition used in", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 181, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 255, + 194 + ], + "score": 1.0, + "content": "the QuAR Flow is the same for both", + "type": "text" + }, + { + "bbox": [ + 255, + 182, + 284, + 193 + ], + "score": 0.31, + "content": "\\mathrm { Q u A R }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 181, + 505, + 194 + ], + "score": 1.0, + "content": "Flows. After the first conditional affine flow, there are", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 193, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 106, + 193, + 505, + 205 + ], + "score": 1.0, + "content": "two QuAR Flows with unconditional affine flows placed in between these two and at the end. The", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 204, + 496, + 216 + ], + "spans": [ + { + "bbox": [ + 106, + 204, + 496, + 216 + ], + "score": 1.0, + "content": "Conditional Flow model is equivalent to a Conditional Gaussian if we removed the QuAR Flows.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "title", + "bbox": [ + 109, + 236, + 271, + 249 + ], + "lines": [ + { + "bbox": [ + 105, + 235, + 272, + 252 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 272, + 252 + ], + "score": 1.0, + "content": "A MODEL TRAINING DETAILS", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "title", + "bbox": [ + 108, + 262, + 194, + 274 + ], + "lines": [ + { + "bbox": [ + 105, + 261, + 196, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 196, + 276 + ], + "score": 1.0, + "content": "A.1 CALIBRATION", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 106, + 283, + 505, + 372 + ], + "lines": [ + { + "bbox": [ + 105, + 284, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 506, + 297 + ], + "score": 1.0, + "content": "We compare the performance of our model and multiple other popular approaches on 8 UCI datasets", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 295, + 506, + 308 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 506, + 308 + ], + "score": 1.0, + "content": "(Dheeru & Karra Taniskidou, 2017): boston-housing, concrete, energy, kin8nm, naval-propulsion-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 306, + 506, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 306, + 506, + 318 + ], + "score": 1.0, + "content": "plant, power-plant, wine-quality-red and yacht. The models we compared Conditional Flows to", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 316, + 506, + 330 + ], + "spans": [ + { + "bbox": [ + 105, + 316, + 506, + 330 + ], + "score": 1.0, + "content": "were: Conditional Gaussian (amortized inference with Gaussians, Lakshminarayanan et al. (2017)),", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 327, + 506, + 341 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 506, + 341 + ], + "score": 1.0, + "content": "Bayesian Ridge Regression (Tipping, 2001), MC Dropout (Gal & Ghahramani, 2016), Simultaneous", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 338, + 505, + 352 + ], + "spans": [ + { + "bbox": [ + 106, + 338, + 505, + 352 + ], + "score": 1.0, + "content": "Quantile Regression (SQR) (Tagasovska & Lopez-Paz, 2019), Conditional Quantile (SQR where", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 349, + 506, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 349, + 506, + 362 + ], + "score": 1.0, + "content": "we only learn prespecified quantiles), Quality Driven (Pearce et al., 2018), and a Gradient Boosted", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 361, + 301, + 373 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 301, + 373 + ], + "score": 1.0, + "content": "Decision Tree with LightGBM (Ke et al., 2017).", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 284, + 506, + 373 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 377, + 505, + 444 + ], + "lines": [ + { + "bbox": [ + 105, + 377, + 506, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 377, + 506, + 390 + ], + "score": 1.0, + "content": "Figure 8 shows a representation of the Conditional Flow network we used. The QuAR Flows are", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 388, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 106, + 388, + 506, + 401 + ], + "score": 1.0, + "content": "conditioned on a 64-dimensional representation from the condition network. Each Conditional QuAR", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 398, + 506, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 506, + 412 + ], + "score": 1.0, + "content": "Flow has two hidden layers in the residual connection with a hidden size 64 with ELU (Clevert et al.,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 410, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 505, + 423 + ], + "score": 1.0, + "content": "2015) as our activation. The condition network has a single hidden layer with size 64 and ReLU", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 421, + 504, + 433 + ], + "spans": [ + { + "bbox": [ + 106, + 421, + 504, + 433 + ], + "score": 1.0, + "content": "as our activation. The QuAR Flows are conditioned on the 64-dimensional representation from the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 433, + 183, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 183, + 443 + ], + "score": 1.0, + "content": "condition network.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 377, + 506, + 443 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 449, + 505, + 483 + ], + "lines": [ + { + "bbox": [ + 106, + 449, + 505, + 461 + ], + "spans": [ + { + "bbox": [ + 106, + 449, + 505, + 461 + ], + "score": 1.0, + "content": "For the other neural network approaches, we used networks with two hidden layers with size 128 and", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 460, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 106, + 460, + 505, + 473 + ], + "score": 1.0, + "content": "used ReLU as our nonlinearity. For hyperparameter tuning on all our neural networks, we searched", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 471, + 183, + 484 + ], + "spans": [ + { + "bbox": [ + 106, + 471, + 183, + 484 + ], + "score": 1.0, + "content": "the following grid:", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 106, + 449, + 505, + 484 + ] + }, + { + "type": "index", + "bbox": [ + 132, + 493, + 278, + 538 + ], + "lines": [ + { + "bbox": [ + 132, + 493, + 267, + 505 + ], + "spans": [ + { + "bbox": [ + 132, + 493, + 267, + 505 + ], + "score": 1.0, + "content": "• Learning rate: 1e-2, 1e-3, 1e-4", + "type": "text" + } + ], + "index": 27, + "is_list_start_line": true + }, + { + "bbox": [ + 133, + 510, + 277, + 522 + ], + "spans": [ + { + "bbox": [ + 133, + 510, + 277, + 522 + ], + "score": 1.0, + "content": "• Weight decay: 0, 1e-3, 1e-2, 1e-1", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 133, + 526, + 278, + 538 + ], + "spans": [ + { + "bbox": [ + 133, + 526, + 278, + 538 + ], + "score": 1.0, + "content": "• Dropout Rates: 0.1 0.25, 0.5 0.75", + "type": "text" + } + ], + "index": 29, + "is_list_start_line": true + } + ], + "index": 28, + "bbox_fs": [ + 132, + 493, + 278, + 538 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 549, + 505, + 572 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 506, + 562 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 506, + 562 + ], + "score": 1.0, + "content": "The hyperparameters we used were taken from Tagasovska & Lopez-Paz (2019). We trained each of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 560, + 337, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 337, + 572 + ], + "score": 1.0, + "content": "our neural networks for 2000 epochs with batch size 128.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 549, + 506, + 572 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 577, + 504, + 600 + ], + "lines": [ + { + "bbox": [ + 106, + 577, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 106, + 577, + 505, + 589 + ], + "score": 1.0, + "content": "For our LightGBM tree model (Ke et al., 2017), we used mean squared error as our loss to learn the", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 588, + 424, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 424, + 601 + ], + "score": 1.0, + "content": "mean of the output distribution. The grid of hyperparameters we searched was:", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 577, + 505, + 601 + ] + }, + { + "type": "index", + "bbox": [ + 132, + 610, + 297, + 687 + ], + "lines": [ + { + "bbox": [ + 132, + 610, + 258, + 622 + ], + "spans": [ + { + "bbox": [ + 132, + 610, + 258, + 622 + ], + "score": 1.0, + "content": "• Number of Trees: 100, 1000", + "type": "text" + } + ], + "index": 34, + "is_list_start_line": true + }, + { + "bbox": [ + 132, + 626, + 258, + 640 + ], + "spans": [ + { + "bbox": [ + 132, + 626, + 258, + 640 + ], + "score": 1.0, + "content": "• Maximum Depths: 3, 5, 7, 9", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 133, + 643, + 297, + 655 + ], + "spans": [ + { + "bbox": [ + 133, + 643, + 297, + 655 + ], + "score": 1.0, + "content": "• Learning Rates: 1e-1, 1e-2, 1e-3, 1e-4", + "type": "text" + } + ], + "index": 36, + "is_list_start_line": true + }, + { + "bbox": [ + 132, + 658, + 271, + 672 + ], + "spans": [ + { + "bbox": [ + 132, + 658, + 271, + 672 + ], + "score": 1.0, + "content": "• Minimum Child Samples: 1, 20", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 133, + 676, + 277, + 688 + ], + "spans": [ + { + "bbox": [ + 133, + 676, + 277, + 688 + ], + "score": 1.0, + "content": "• Dropout Rates: 0.1 0.25, 0.5 0.75", + "type": "text" + } + ], + "index": 38, + "is_list_start_line": true + } + ], + "index": 36, + "bbox_fs": [ + 132, + 610, + 297, + 688 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "score": 1.0, + "content": "To make the tree model distributional, assuming homoscedasticity, we computed the standard de-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "viation of the predicted normal distribution by computing the standard deviation of the residuals", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 721, + 241, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 241, + 733 + ], + "score": 1.0, + "content": "(observations minus predictions).", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 698, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 96 + ], + "score": 1.0, + "content": "For SQR and MC Dropout, we computed the estimated mean and CDF from 1000 samples. For", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 505, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 505, + 107 + ], + "score": 1.0, + "content": "Conditional Flows, we computed the estimated mean by using the Gauss-Legendre quadrature with", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 263, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 263, + 118 + ], + "score": 1.0, + "content": "100 points to approximate the integral.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "title", + "bbox": [ + 108, + 133, + 205, + 145 + ], + "lines": [ + { + "bbox": [ + 106, + 132, + 206, + 146 + ], + "spans": [ + { + "bbox": [ + 106, + 132, + 206, + 146 + ], + "score": 1.0, + "content": "A.2 RECALIBRATION", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 155, + 506, + 233 + ], + "lines": [ + { + "bbox": [ + 106, + 155, + 506, + 168 + ], + "spans": [ + { + "bbox": [ + 106, + 155, + 506, + 168 + ], + "score": 1.0, + "content": "For recalibration, we trained the recalibration model on the validation set of each of the 20 seeds.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 166, + 506, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 166, + 506, + 179 + ], + "score": 1.0, + "content": "For the flow architecture, we stacked 8 QuAR Flows with affine flows in between each one as well", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 177, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 177, + 355, + 190 + ], + "score": 1.0, + "content": "as at the beginning and end. Since the input to the flow is a", + "type": "text" + }, + { + "bbox": [ + 355, + 177, + 409, + 190 + ], + "score": 0.9, + "content": "\\mathrm { C D F } \\in [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 177, + 505, + 190 + ], + "score": 1.0, + "content": ", we also transform the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 188, + 505, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 188, + 505, + 201 + ], + "score": 1.0, + "content": "data with a Logit Function as the first layer of the flow and account for the change of variables in", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 199, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 106, + 199, + 505, + 212 + ], + "score": 1.0, + "content": "the loss. In addition to this, we used a dropout rate of 0.25, two hidden layers with size 64 in each", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 211, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 211, + 506, + 223 + ], + "score": 1.0, + "content": "residual connection, and used Polyak averaging (Polyak & Juditsky, 1992) with a decay of 0.999 for", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 221, + 152, + 234 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 152, + 234 + ], + "score": 1.0, + "content": "evaluation.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7 + }, + { + "type": "title", + "bbox": [ + 108, + 250, + 190, + 262 + ], + "lines": [ + { + "bbox": [ + 105, + 249, + 191, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 191, + 263 + ], + "score": 1.0, + "content": "A.3 TIME SERIES", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 272, + 505, + 316 + ], + "lines": [ + { + "bbox": [ + 105, + 273, + 506, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 506, + 284 + ], + "score": 1.0, + "content": "For our time series experiments, we tested the performance of flow recalibration on the UCI dataset", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 283, + 506, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 283, + 506, + 295 + ], + "score": 1.0, + "content": "“electricity”. We filtered the data down to observations after 2014-01-01. We split the data by date,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 295, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 165, + 307 + ], + "score": 1.0, + "content": "where the first", + "type": "text" + }, + { + "bbox": [ + 166, + 295, + 186, + 305 + ], + "score": 0.9, + "content": "72 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 295, + 332, + 307 + ], + "score": 1.0, + "content": "of dates are in the train set, the next", + "type": "text" + }, + { + "bbox": [ + 333, + 295, + 352, + 305 + ], + "score": 0.87, + "content": "18 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 295, + 485, + 307 + ], + "score": 1.0, + "content": "are in validation set, and the last", + "type": "text" + }, + { + "bbox": [ + 485, + 295, + 505, + 305 + ], + "score": 0.84, + "content": "10 \\%", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 307, + 178, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 178, + 316 + ], + "score": 1.0, + "content": "are in the test set.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 107, + 322, + 505, + 366 + ], + "lines": [ + { + "bbox": [ + 105, + 322, + 506, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 506, + 335 + ], + "score": 1.0, + "content": "The data is given in 15 minute increments, and so similarly to Deep AR (Salinas et al., 2017), we", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 334, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 505, + 345 + ], + "score": 1.0, + "content": "averaged the values per hour to have hourly data. Since we were trying to analyze the effect of", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 344, + 505, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 505, + 358 + ], + "score": 1.0, + "content": "correlated targets, we predicted two time steps conditioned on 48 hours of data using an autoregressive", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 355, + 137, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 355, + 137, + 367 + ], + "score": 1.0, + "content": "model.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 107, + 372, + 505, + 438 + ], + "lines": [ + { + "bbox": [ + 106, + 372, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 106, + 372, + 505, + 384 + ], + "score": 1.0, + "content": "We included three numeric covariates: the time step within the sampled time series, the hour of the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 383, + 504, + 395 + ], + "spans": [ + { + "bbox": [ + 106, + 383, + 504, + 395 + ], + "score": 1.0, + "content": "day, and the day of the week. Each of the covariates were normalized to have zero mean and one", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 394, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 505, + 407 + ], + "score": 1.0, + "content": "standard deviation. In addition to this, since there are 370 different types of time series, we also", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 405, + 504, + 418 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 504, + 418 + ], + "score": 1.0, + "content": "added an embedding layer from 370 to an embedding dimension of 20, same as that used in Deep AR", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 415, + 506, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 506, + 429 + ], + "score": 1.0, + "content": "(Salinas et al., 2017). We concatenated this vector with the observations and covariates, leading to a", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 426, + 200, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 200, + 439 + ], + "score": 1.0, + "content": "27-dimensional vector.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 107, + 443, + 505, + 491 + ], + "lines": [ + { + "bbox": [ + 105, + 442, + 507, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 507, + 457 + ], + "score": 1.0, + "content": "Since all the observations are positive, we model the target with a conditional Gamma distribution (i.e.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 102, + 455, + 510, + 487 + ], + "spans": [ + { + "bbox": [ + 102, + 455, + 284, + 487 + ], + "score": 1.0, + "content": "amortized inference with Gamma distributiet al., 2017), we normalized each time series", + "type": "text" + }, + { + "bbox": [ + 284, + 466, + 324, + 480 + ], + "score": 0.92, + "content": "\\{ z _ { i , t } \\} _ { t = 0 } ^ { T - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 455, + 338, + 487 + ], + "score": 1.0, + "content": "of by", + "type": "text" + }, + { + "bbox": [ + 339, + 466, + 439, + 480 + ], + "score": 0.92, + "content": "\\begin{array} { r } { v _ { i } = 1 + 1 / T \\sum _ { t = 0 } ^ { T - 1 } z _ { i , t } . } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 455, + 510, + 487 + ], + "score": 1.0, + "content": "eep AR (Salinas. We account for", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 479, + 348, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 303, + 491 + ], + "score": 1.0, + "content": "the scaling in the output distribution, i.e. Gamma", + "type": "text" + }, + { + "bbox": [ + 303, + 480, + 343, + 491 + ], + "score": 0.66, + "content": "( k , \\theta * v _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 479, + 348, + 491 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 495, + 505, + 540 + ], + "lines": [ + { + "bbox": [ + 105, + 495, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 505, + 508 + ], + "score": 1.0, + "content": "The model we used was a 1 layer LSTM, and then two linear layers with a ReLU and Dropout", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 506, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 505, + 520 + ], + "score": 1.0, + "content": "(Srivastava et al., 2014) in between were applied to the hidden representation. We set the dropout rate", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 517, + 507, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 507, + 531 + ], + "score": 1.0, + "content": "to 0.5 and used a hidden size of 48 everywhere. For evaluation, we used Polyak averaging (Polyak &", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 529, + 262, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 262, + 541 + ], + "score": 1.0, + "content": "Juditsky, 1992) with a decay of 0.999.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 107, + 545, + 504, + 568 + ], + "lines": [ + { + "bbox": [ + 105, + 544, + 505, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 505, + 559 + ], + "score": 1.0, + "content": "For recalibration with flows, we trained on the CDFs for both time steps with a flow with the same", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 557, + 276, + 568 + ], + "spans": [ + { + "bbox": [ + 106, + 557, + 276, + 568 + ], + "score": 1.0, + "content": "architecture as that used in Appendix A.2.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5 + }, + { + "type": "title", + "bbox": [ + 108, + 588, + 258, + 601 + ], + "lines": [ + { + "bbox": [ + 105, + 587, + 260, + 603 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 260, + 603 + ], + "score": 1.0, + "content": "B EXPERIMENTAL RESULTS", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "title", + "bbox": [ + 108, + 615, + 194, + 627 + ], + "lines": [ + { + "bbox": [ + 105, + 615, + 194, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 194, + 628 + ], + "score": 1.0, + "content": "B.1 CALIBRATION", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 108, + 638, + 504, + 671 + ], + "lines": [ + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "score": 1.0, + "content": "In Table 2, we compare Conditional Flows against multiple other approaches for estimating uncer-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "score": 1.0, + "content": "tainty, and we measure performance using Prediction Interval Coverage Probability (PICP), Mean", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 659, + 287, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 659, + 287, + 672 + ], + "score": 1.0, + "content": "Squared Error (MSE), and Calibration Error.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 108, + 676, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "For each model, we trained the model on 20 different seeds where each seed randomly splits the data", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 117, + 700 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 117, + 688, + 137, + 698 + ], + "score": 0.88, + "content": "72 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 688, + 163, + 700 + ], + "score": 1.0, + "content": "train,", + "type": "text" + }, + { + "bbox": [ + 163, + 688, + 183, + 698 + ], + "score": 0.86, + "content": "18 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 688, + 248, + 700 + ], + "score": 1.0, + "content": "validation, and", + "type": "text" + }, + { + "bbox": [ + 248, + 688, + 268, + 698 + ], + "score": 0.87, + "content": "10 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "test. We picked the best hyperparameter by choosing the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "hyperparameters that gave the best average validation loss across the 20 seeds where the loss used is", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "the loss defined by the training procedure for the model, e.g. for Conditional Gaussian, we used log", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 719, + 504, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 504, + 734 + ], + "score": 1.0, + "content": "likelihood; for LightGBM, we used MSE; for QualityDriven, we used the Quality Driven Loss, etc.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42 + } + ], + "page_idx": 13, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 96 + ], + "score": 1.0, + "content": "For SQR and MC Dropout, we computed the estimated mean and CDF from 1000 samples. For", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 505, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 505, + 107 + ], + "score": 1.0, + "content": "Conditional Flows, we computed the estimated mean by using the Gauss-Legendre quadrature with", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 263, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 263, + 118 + ], + "score": 1.0, + "content": "100 points to approximate the integral.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 82, + 506, + 118 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 133, + 205, + 145 + ], + "lines": [ + { + "bbox": [ + 106, + 132, + 206, + 146 + ], + "spans": [ + { + "bbox": [ + 106, + 132, + 206, + 146 + ], + "score": 1.0, + "content": "A.2 RECALIBRATION", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 155, + 506, + 233 + ], + "lines": [ + { + "bbox": [ + 106, + 155, + 506, + 168 + ], + "spans": [ + { + "bbox": [ + 106, + 155, + 506, + 168 + ], + "score": 1.0, + "content": "For recalibration, we trained the recalibration model on the validation set of each of the 20 seeds.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 166, + 506, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 166, + 506, + 179 + ], + "score": 1.0, + "content": "For the flow architecture, we stacked 8 QuAR Flows with affine flows in between each one as well", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 177, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 177, + 355, + 190 + ], + "score": 1.0, + "content": "as at the beginning and end. Since the input to the flow is a", + "type": "text" + }, + { + "bbox": [ + 355, + 177, + 409, + 190 + ], + "score": 0.9, + "content": "\\mathrm { C D F } \\in [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 177, + 505, + 190 + ], + "score": 1.0, + "content": ", we also transform the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 188, + 505, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 188, + 505, + 201 + ], + "score": 1.0, + "content": "data with a Logit Function as the first layer of the flow and account for the change of variables in", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 199, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 106, + 199, + 505, + 212 + ], + "score": 1.0, + "content": "the loss. In addition to this, we used a dropout rate of 0.25, two hidden layers with size 64 in each", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 211, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 211, + 506, + 223 + ], + "score": 1.0, + "content": "residual connection, and used Polyak averaging (Polyak & Juditsky, 1992) with a decay of 0.999 for", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 221, + 152, + 234 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 152, + 234 + ], + "score": 1.0, + "content": "evaluation.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 155, + 506, + 234 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 250, + 190, + 262 + ], + "lines": [ + { + "bbox": [ + 105, + 249, + 191, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 191, + 263 + ], + "score": 1.0, + "content": "A.3 TIME SERIES", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 272, + 505, + 316 + ], + "lines": [ + { + "bbox": [ + 105, + 273, + 506, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 506, + 284 + ], + "score": 1.0, + "content": "For our time series experiments, we tested the performance of flow recalibration on the UCI dataset", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 283, + 506, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 283, + 506, + 295 + ], + "score": 1.0, + "content": "“electricity”. We filtered the data down to observations after 2014-01-01. We split the data by date,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 295, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 165, + 307 + ], + "score": 1.0, + "content": "where the first", + "type": "text" + }, + { + "bbox": [ + 166, + 295, + 186, + 305 + ], + "score": 0.9, + "content": "72 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 295, + 332, + 307 + ], + "score": 1.0, + "content": "of dates are in the train set, the next", + "type": "text" + }, + { + "bbox": [ + 333, + 295, + 352, + 305 + ], + "score": 0.87, + "content": "18 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 295, + 485, + 307 + ], + "score": 1.0, + "content": "are in validation set, and the last", + "type": "text" + }, + { + "bbox": [ + 485, + 295, + 505, + 305 + ], + "score": 0.84, + "content": "10 \\%", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 307, + 178, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 178, + 316 + ], + "score": 1.0, + "content": "are in the test set.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 273, + 506, + 316 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 322, + 505, + 366 + ], + "lines": [ + { + "bbox": [ + 105, + 322, + 506, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 506, + 335 + ], + "score": 1.0, + "content": "The data is given in 15 minute increments, and so similarly to Deep AR (Salinas et al., 2017), we", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 334, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 505, + 345 + ], + "score": 1.0, + "content": "averaged the values per hour to have hourly data. Since we were trying to analyze the effect of", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 344, + 505, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 505, + 358 + ], + "score": 1.0, + "content": "correlated targets, we predicted two time steps conditioned on 48 hours of data using an autoregressive", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 355, + 137, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 355, + 137, + 367 + ], + "score": 1.0, + "content": "model.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 322, + 506, + 367 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 372, + 505, + 438 + ], + "lines": [ + { + "bbox": [ + 106, + 372, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 106, + 372, + 505, + 384 + ], + "score": 1.0, + "content": "We included three numeric covariates: the time step within the sampled time series, the hour of the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 383, + 504, + 395 + ], + "spans": [ + { + "bbox": [ + 106, + 383, + 504, + 395 + ], + "score": 1.0, + "content": "day, and the day of the week. Each of the covariates were normalized to have zero mean and one", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 394, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 505, + 407 + ], + "score": 1.0, + "content": "standard deviation. In addition to this, since there are 370 different types of time series, we also", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 405, + 504, + 418 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 504, + 418 + ], + "score": 1.0, + "content": "added an embedding layer from 370 to an embedding dimension of 20, same as that used in Deep AR", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 415, + 506, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 506, + 429 + ], + "score": 1.0, + "content": "(Salinas et al., 2017). We concatenated this vector with the observations and covariates, leading to a", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 426, + 200, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 200, + 439 + ], + "score": 1.0, + "content": "27-dimensional vector.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 372, + 506, + 439 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 443, + 505, + 491 + ], + "lines": [ + { + "bbox": [ + 105, + 442, + 507, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 507, + 457 + ], + "score": 1.0, + "content": "Since all the observations are positive, we model the target with a conditional Gamma distribution (i.e.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 102, + 455, + 510, + 487 + ], + "spans": [ + { + "bbox": [ + 102, + 455, + 284, + 487 + ], + "score": 1.0, + "content": "amortized inference with Gamma distributiet al., 2017), we normalized each time series", + "type": "text" + }, + { + "bbox": [ + 284, + 466, + 324, + 480 + ], + "score": 0.92, + "content": "\\{ z _ { i , t } \\} _ { t = 0 } ^ { T - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 455, + 338, + 487 + ], + "score": 1.0, + "content": "of by", + "type": "text" + }, + { + "bbox": [ + 339, + 466, + 439, + 480 + ], + "score": 0.92, + "content": "\\begin{array} { r } { v _ { i } = 1 + 1 / T \\sum _ { t = 0 } ^ { T - 1 } z _ { i , t } . } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 455, + 510, + 487 + ], + "score": 1.0, + "content": "eep AR (Salinas. We account for", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 479, + 348, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 303, + 491 + ], + "score": 1.0, + "content": "the scaling in the output distribution, i.e. Gamma", + "type": "text" + }, + { + "bbox": [ + 303, + 480, + 343, + 491 + ], + "score": 0.66, + "content": "( k , \\theta * v _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 479, + 348, + 491 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 102, + 442, + 510, + 491 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 495, + 505, + 540 + ], + "lines": [ + { + "bbox": [ + 105, + 495, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 505, + 508 + ], + "score": 1.0, + "content": "The model we used was a 1 layer LSTM, and then two linear layers with a ReLU and Dropout", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 506, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 505, + 520 + ], + "score": 1.0, + "content": "(Srivastava et al., 2014) in between were applied to the hidden representation. We set the dropout rate", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 517, + 507, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 507, + 531 + ], + "score": 1.0, + "content": "to 0.5 and used a hidden size of 48 everywhere. For evaluation, we used Polyak averaging (Polyak &", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 529, + 262, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 262, + 541 + ], + "score": 1.0, + "content": "Juditsky, 1992) with a decay of 0.999.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 495, + 507, + 541 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 545, + 504, + 568 + ], + "lines": [ + { + "bbox": [ + 105, + 544, + 505, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 505, + 559 + ], + "score": 1.0, + "content": "For recalibration with flows, we trained on the CDFs for both time steps with a flow with the same", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 557, + 276, + 568 + ], + "spans": [ + { + "bbox": [ + 106, + 557, + 276, + 568 + ], + "score": 1.0, + "content": "architecture as that used in Appendix A.2.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 544, + 505, + 568 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 588, + 258, + 601 + ], + "lines": [ + { + "bbox": [ + 105, + 587, + 260, + 603 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 260, + 603 + ], + "score": 1.0, + "content": "B EXPERIMENTAL RESULTS", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "title", + "bbox": [ + 108, + 615, + 194, + 627 + ], + "lines": [ + { + "bbox": [ + 105, + 615, + 194, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 194, + 628 + ], + "score": 1.0, + "content": "B.1 CALIBRATION", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 108, + 638, + 504, + 671 + ], + "lines": [ + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "score": 1.0, + "content": "In Table 2, we compare Conditional Flows against multiple other approaches for estimating uncer-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "score": 1.0, + "content": "tainty, and we measure performance using Prediction Interval Coverage Probability (PICP), Mean", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 659, + 287, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 659, + 287, + 672 + ], + "score": 1.0, + "content": "Squared Error (MSE), and Calibration Error.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38, + "bbox_fs": [ + 105, + 637, + 506, + 672 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 676, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "For each model, we trained the model on 20 different seeds where each seed randomly splits the data", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 117, + 700 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 117, + 688, + 137, + 698 + ], + "score": 0.88, + "content": "72 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 688, + 163, + 700 + ], + "score": 1.0, + "content": "train,", + "type": "text" + }, + { + "bbox": [ + 163, + 688, + 183, + 698 + ], + "score": 0.86, + "content": "18 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 688, + 248, + 700 + ], + "score": 1.0, + "content": "validation, and", + "type": "text" + }, + { + "bbox": [ + 248, + 688, + 268, + 698 + ], + "score": 0.87, + "content": "10 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "test. We picked the best hyperparameter by choosing the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "hyperparameters that gave the best average validation loss across the 20 seeds where the loss used is", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "the loss defined by the training procedure for the model, e.g. for Conditional Gaussian, we used log", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 719, + 504, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 504, + 734 + ], + "score": 1.0, + "content": "likelihood; for LightGBM, we used MSE; for QualityDriven, we used the Quality Driven Loss, etc.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42, + "bbox_fs": [ + 105, + 677, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 79, + 185, + 536, + 663 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 148, + 506, + 182 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 148, + 506, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 506, + 162 + ], + "score": 1.0, + "content": "Table 2: Results on percentage of data captured from 0.025 to 0.975 quantiles (PICP), MSE, and", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 160, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 506, + 172 + ], + "score": 1.0, + "content": "calibration error with 100 buckets. The results are from minimizing the average validation loss across", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 171, + 485, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 485, + 183 + ], + "score": 1.0, + "content": "20 seeds. The optimal value of PICP is 0.95, and the optimal value for MSE and Calib is 0.00.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "table_body", + "bbox": [ + 79, + 185, + 536, + 663 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 79, + 185, + 536, + 663 + ], + "spans": [ + { + "bbox": [ + 79, + 185, + 536, + 663 + ], + "score": 0.954, + "html": "
bostonHousingconcrete
PICPMSECalibPICPMSECalib
ConditionalFlow0.93 ± 0.040.13 ± 0.060.060.92 ± 0.030.09 ±0.030.01
ConditionalGaussian0.93 ± 0.030.14±0.070.130.91 ± 0.020.09 ±0.030.06
BayesianRidgeRegression0.95 ± 0.030.28±0.080.340.95 ± 0.030.40±0.070.01
MC Dropout0.50 ± 0.080.11 ± 0.052.990.69 ± 0.050.07±0.030.89
SQR0.73 ± 0.080.11 ± 0.050.480.74± 0.040.07± 0.030.47
ConditionalQuantile0.92 ± 0.05N.A.N.A.0.93 ± 0.03N.A.N.A.
QualityDriven0.83 ± 0.06N.A.N.A.0.83± 0.04N.A.N.A.
LightGBM0.04±0.030.12 ± 0.067.740.63±0.070.07±0.021.25
energykin8nm
PICPMSECalibPICPMSECalib
ConditionalFlow0.96 ± 0.020.0022 ± 0.00060.120.952 ± 0.0060.081 ± 0.0130.01
ConditionalGaussian0.97 ± 0.030.0030± 0.00090.260.947 ± 0.0070.071 ± 0.005<0.01
BayesianRidgeRegression0.89 ± 0.040.09 ±0.020.240.951 ± 0.0070.59 ± 0.020.09
MC Dropout0.97± 0.020.0026 ± 0.00100.170.69 ± 0.020.069 ± 0.0051.14
SQR0.97± 0.020.0028 ± 0.00120.370.892 ± 0.0100.072 ± 0.0050.01
ConditionalQuantile0.98 ±0.02N.A.N.A.0.943 ± 0.011N.A.N.A.
QualityDriven0.96 ± 0.04N.A.N.A.0.88±0.02N.A.N.A.
LightGBM0.24±0.050.0013 ± 0.00065.180.205 ± 0.0100.190 ± 0.0115.59
naval-propulsion-plantpower-plant
PICPMSECalibPICPMSECalib
ConditionalFlow0.98 ± 0.030.009 ±0.0040.450.952 ± 0.0070.048 ±0.0070.01
ConditionalGaussian0.9995 ± 0.00070.012 ± 0.0062.350.947 ± 0.0100.048 ±0.006<0.01
BayesianRidgeRegression1.0 ±0.00.055 ± 0.0048.030.964 ± 0.0070.072 ± 0.0070.01
MC Dropout0.98 ±0.020.005±0.0020.510.59 ±0.020.046±0.0071.88
SQR0.998 ± 0.0020.0052 ± 0.00121.440.93 ± 0.020.048 ±0.0070.02
ConditionalQuantile0.97±0.02N.A.N.A.0.937 ± 0.014N.A.N.A.
QualityDriven0.949 ± 0.010N.A.N.A.0.89 ±0.02N.A.N.A.
LightGBM0.714 ± 0.0110.0056 ± 0.00090.790.17 ± 0.020.035 ± 0.0075.95
wine-quality-redyacht
PICPMSECalibPICPMSECalib
ConditionalFlow0.90 ±0.020.6±0.20.040.95 ± 0.040.004±0.0030.27
ConditionalGaussian0.95 ± 0.020.59 ± 0.090.220.99 ±0.020.004±0.0020.62
BayesianRidgeRegression0.95 ± 0.020.63 ± 0.110.050.94± 0.030.35 ± 0.100.25
MC Dropout0.35 ± 0.040.57 ±0.094.010.97 ± 0.040.004±0.0020.21
SQR0.81±0.090.59 ±0.100.150.96 ±0.040.004±0.0040.49
ConditionalQuantile0.95 ± 0.02N.A.N.A.0.99 ± 0.02N.A.N.A.
QualityDriven0.84 ±0.03N.A.N.A.0.97 ± 0.04N.A.N.A.
LightGBM0.40 ± 0.050.55± 0.102.930.45 ± 0.080.003±0.0033.04
", + "type": "table", + "image_path": "ee857c7ba0f01bf9efb745de65bc42756ed607cf38e79d06640bf392e208a62a.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 79, + 185, + 536, + 344.33333333333337 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 79, + 344.33333333333337, + 536, + 503.66666666666674 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 79, + 503.66666666666674, + 536, + 663.0000000000001 + ], + "spans": [], + "index": 5 + } + ] + } + ], + "index": 2.5 + } + ], + "page_idx": 14, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "15", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 79, + 185, + 536, + 663 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 148, + 506, + 182 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 148, + 506, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 506, + 162 + ], + "score": 1.0, + "content": "Table 2: Results on percentage of data captured from 0.025 to 0.975 quantiles (PICP), MSE, and", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 160, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 506, + 172 + ], + "score": 1.0, + "content": "calibration error with 100 buckets. The results are from minimizing the average validation loss across", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 171, + 485, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 485, + 183 + ], + "score": 1.0, + "content": "20 seeds. The optimal value of PICP is 0.95, and the optimal value for MSE and Calib is 0.00.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "table_body", + "bbox": [ + 79, + 185, + 536, + 663 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 79, + 185, + 536, + 663 + ], + "spans": [ + { + "bbox": [ + 79, + 185, + 536, + 663 + ], + "score": 0.954, + "html": "
bostonHousingconcrete
PICPMSECalibPICPMSECalib
ConditionalFlow0.93 ± 0.040.13 ± 0.060.060.92 ± 0.030.09 ±0.030.01
ConditionalGaussian0.93 ± 0.030.14±0.070.130.91 ± 0.020.09 ±0.030.06
BayesianRidgeRegression0.95 ± 0.030.28±0.080.340.95 ± 0.030.40±0.070.01
MC Dropout0.50 ± 0.080.11 ± 0.052.990.69 ± 0.050.07±0.030.89
SQR0.73 ± 0.080.11 ± 0.050.480.74± 0.040.07± 0.030.47
ConditionalQuantile0.92 ± 0.05N.A.N.A.0.93 ± 0.03N.A.N.A.
QualityDriven0.83 ± 0.06N.A.N.A.0.83± 0.04N.A.N.A.
LightGBM0.04±0.030.12 ± 0.067.740.63±0.070.07±0.021.25
energykin8nm
PICPMSECalibPICPMSECalib
ConditionalFlow0.96 ± 0.020.0022 ± 0.00060.120.952 ± 0.0060.081 ± 0.0130.01
ConditionalGaussian0.97 ± 0.030.0030± 0.00090.260.947 ± 0.0070.071 ± 0.005<0.01
BayesianRidgeRegression0.89 ± 0.040.09 ±0.020.240.951 ± 0.0070.59 ± 0.020.09
MC Dropout0.97± 0.020.0026 ± 0.00100.170.69 ± 0.020.069 ± 0.0051.14
SQR0.97± 0.020.0028 ± 0.00120.370.892 ± 0.0100.072 ± 0.0050.01
ConditionalQuantile0.98 ±0.02N.A.N.A.0.943 ± 0.011N.A.N.A.
QualityDriven0.96 ± 0.04N.A.N.A.0.88±0.02N.A.N.A.
LightGBM0.24±0.050.0013 ± 0.00065.180.205 ± 0.0100.190 ± 0.0115.59
naval-propulsion-plantpower-plant
PICPMSECalibPICPMSECalib
ConditionalFlow0.98 ± 0.030.009 ±0.0040.450.952 ± 0.0070.048 ±0.0070.01
ConditionalGaussian0.9995 ± 0.00070.012 ± 0.0062.350.947 ± 0.0100.048 ±0.006<0.01
BayesianRidgeRegression1.0 ±0.00.055 ± 0.0048.030.964 ± 0.0070.072 ± 0.0070.01
MC Dropout0.98 ±0.020.005±0.0020.510.59 ±0.020.046±0.0071.88
SQR0.998 ± 0.0020.0052 ± 0.00121.440.93 ± 0.020.048 ±0.0070.02
ConditionalQuantile0.97±0.02N.A.N.A.0.937 ± 0.014N.A.N.A.
QualityDriven0.949 ± 0.010N.A.N.A.0.89 ±0.02N.A.N.A.
LightGBM0.714 ± 0.0110.0056 ± 0.00090.790.17 ± 0.020.035 ± 0.0075.95
wine-quality-redyacht
PICPMSECalibPICPMSECalib
ConditionalFlow0.90 ±0.020.6±0.20.040.95 ± 0.040.004±0.0030.27
ConditionalGaussian0.95 ± 0.020.59 ± 0.090.220.99 ±0.020.004±0.0020.62
BayesianRidgeRegression0.95 ± 0.020.63 ± 0.110.050.94± 0.030.35 ± 0.100.25
MC Dropout0.35 ± 0.040.57 ±0.094.010.97 ± 0.040.004±0.0020.21
SQR0.81±0.090.59 ±0.100.150.96 ±0.040.004±0.0040.49
ConditionalQuantile0.95 ± 0.02N.A.N.A.0.99 ± 0.02N.A.N.A.
QualityDriven0.84 ±0.03N.A.N.A.0.97 ± 0.04N.A.N.A.
LightGBM0.40 ± 0.050.55± 0.102.930.45 ± 0.080.003±0.0033.04
", + "type": "table", + "image_path": "ee857c7ba0f01bf9efb745de65bc42756ed607cf38e79d06640bf392e208a62a.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 79, + 185, + 536, + 344.33333333333337 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 79, + 344.33333333333337, + 536, + 503.66666666666674 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 79, + 503.66666666666674, + 536, + 663.0000000000001 + ], + "spans": [], + "index": 5 + } + ] + } + ], + "index": 2.5 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 87, + 100, + 521, + 218 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 154, + 80, + 455, + 92 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 154, + 80, + 456, + 92 + ], + "spans": [ + { + "bbox": [ + 154, + 80, + 456, + 92 + ], + "score": 1.0, + "content": "Table 3: Calibration error (with 100 buckets) before and after recalibration.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table_body", + "bbox": [ + 87, + 100, + 521, + 218 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 87, + 100, + 521, + 218 + ], + "spans": [ + { + "bbox": [ + 87, + 100, + 521, + 218 + ], + "score": 0.982, + "html": "
BayesianRidgeRegressionConditionalGaussianConditionalFlow
BeforeFlowIsoBeforeFlowIsoBeforeFlowIso
bostonHousing0.340.020.020.130.040.020.060.020.01
concrete0.010.010.010.060.020.020.010.020.03
energy0.240.020.010.26<0.010.010.120.010.01
kin8nm0.090.01<0.01<0.01<0.01<0.010.01<0.01<0.01
naval-propulsion-plant8.030.01<0.012.35<0.01<0.010.45<0.01<0.01
power-plant0.01<0.01<0.01<0.01<0.01<0.010.01<0.01<0.01
wine-quality-red0.050.02<0.010.220.040.020.040.010.01
yacht0.250.050.070.620.030.030.270.020.03
", + "type": "table", + "image_path": "d978e71823dd45f48ecdfeb91085639f8de04ae9198cc4086ae3aa1241745175.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 87, + 100, + 521, + 139.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 87, + 139.33333333333334, + 521, + 178.66666666666669 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 87, + 178.66666666666669, + 521, + 218.00000000000003 + ], + "spans": [], + "index": 3 + } + ] + } + ], + "index": 1.0 + }, + { + "type": "table", + "bbox": [ + 106, + 260, + 508, + 515 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 228, + 504, + 251 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 228, + 504, + 240 + ], + "spans": [ + { + "bbox": [ + 106, + 228, + 504, + 240 + ], + "score": 1.0, + "content": "Table 4: MSE performance before and after recalibration. We do not show the MSE for isotonic", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 239, + 455, + 252 + ], + "spans": [ + { + "bbox": [ + 105, + 239, + 455, + 252 + ], + "score": 1.0, + "content": "regression as the mean cannot be computed after recalibrating with isotonic regression.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "table_body", + "bbox": [ + 106, + 260, + 508, + 515 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 260, + 508, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 260, + 508, + 515 + ], + "score": 0.875, + "html": "
BayesianRidgeRegressionConditionalGaussian
BeforeFlowBeforeFlow
bostonHousing0.28 ±0.080.28 ±0.080.14 ± 0.070.14 ± 0.07
concrete0.40 ± 0.070.40 ± 0.070.09 ±0.030.09 ± 0.03
energy0.09 ±0.020.09 ±0.020.0030 ±0.00090.0032 ± 0.0011
kin8nm0.59 ± 0.020.59 ± 0.020.071 ± 0.0050.072 ± 0.005
naval-propulsion-plant0.055 ± 0.0040.48 ±0.020.012 ± 0.0060.012 ± 0.007
power-plant0.072 ± 0.0070.072 ± 0.0070.048 ± 0.0060.049 ± 0.006
wine-quality-red0.63 ± 0.110.63 ± 0.110.59 ± 0.090.59 ± 0.10
yacht0.35 ± 0.100.36 ± 0.100.004 ±0.0020.004 ± 0.003
ConditionalFlow
BeforeFlow
bostonHousing0.13 ± 0.06
concrete0.09 ± 0.030.13 ± 0.06 0.09 ± 0.03
0.0022 ± 0.00060.0027 ± 0.0007
energy kin8nm0.081 ± 0.0130.081 ± 0.013
naval-propulsion-plant0.009 ± 0.0040.016 ± 0.012
power-plant0.048 ± 0.0070.048 ± 0.007
wine-quality-red0.6± 0.20.64 ± 0.15
yacht
0.004 ± 0.0030.008 ± 0.012
", + "type": "table", + "image_path": "0fc0d10d28bfe001a56686f5c0b27f829ffc23a2fccbd3c80e31c43e5c515719.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 106, + 260, + 508, + 345.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 106, + 345.0, + 508, + 430.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 106, + 430.0, + 508, + 515.0 + ], + "spans": [], + "index": 8 + } + ] + } + ], + "index": 5.75 + }, + { + "type": "text", + "bbox": [ + 106, + 534, + 506, + 579 + ], + "lines": [ + { + "bbox": [ + 106, + 534, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 106, + 534, + 505, + 546 + ], + "score": 1.0, + "content": "Reported in Table 2 are the mean and standard deviation of PICP and MSE across the 20 seeds. Due", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 545, + 506, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 506, + 559 + ], + "score": 1.0, + "content": "to the limited data, for calibration error with 100 bins, we computed it over the CDFs from all 20", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 557, + 506, + 569 + ], + "spans": [ + { + "bbox": [ + 106, + 557, + 506, + 569 + ], + "score": 1.0, + "content": "seeds. We included PICP (the percentage of true observations between the quantiles 0.025 and 0.975)", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 567, + 464, + 580 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 464, + 580 + ], + "score": 1.0, + "content": "to compare against alternative approaches where we prespecify which quantiles we need.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10.5 + }, + { + "type": "title", + "bbox": [ + 107, + 592, + 205, + 604 + ], + "lines": [ + { + "bbox": [ + 105, + 592, + 205, + 605 + ], + "spans": [ + { + "bbox": [ + 105, + 592, + 205, + 605 + ], + "score": 1.0, + "content": "B.2 RECALIBRATION", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 107, + 613, + 506, + 646 + ], + "lines": [ + { + "bbox": [ + 105, + 612, + 506, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 506, + 626 + ], + "score": 1.0, + "content": "From the above section, we recalibrate the best Bayesian Ridge Regression, Conditional Gaussian,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 624, + 506, + 636 + ], + "spans": [ + { + "bbox": [ + 106, + 624, + 506, + 636 + ], + "score": 1.0, + "content": "and Conditional Flow. In Table 3, we compare the calibration error before recalibration, after", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 635, + 448, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 448, + 648 + ], + "score": 1.0, + "content": "recalibration with isotonic regression, and after recalibration with normalizing flows.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 107, + 651, + 505, + 685 + ], + "lines": [ + { + "bbox": [ + 105, + 650, + 505, + 666 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 505, + 666 + ], + "score": 1.0, + "content": "As we can see, across all 8 UCI datasets, the calibration errors after recalibrating with normalizing", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 662, + 505, + 675 + ], + "spans": [ + { + "bbox": [ + 105, + 662, + 505, + 675 + ], + "score": 1.0, + "content": "flows are comparable to those from isotonic regression. More interestingly though, improvement in", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 673, + 339, + 687 + ], + "spans": [ + { + "bbox": [ + 105, + 673, + 339, + 687 + ], + "score": 1.0, + "content": "calibration error can be detrimental to mean performance.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + } + ], + "page_idx": 15, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 752, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 106, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 87, + 100, + 521, + 218 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 154, + 80, + 455, + 92 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 154, + 80, + 456, + 92 + ], + "spans": [ + { + "bbox": [ + 154, + 80, + 456, + 92 + ], + "score": 1.0, + "content": "Table 3: Calibration error (with 100 buckets) before and after recalibration.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table_body", + "bbox": [ + 87, + 100, + 521, + 218 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 87, + 100, + 521, + 218 + ], + "spans": [ + { + "bbox": [ + 87, + 100, + 521, + 218 + ], + "score": 0.982, + "html": "
BayesianRidgeRegressionConditionalGaussianConditionalFlow
BeforeFlowIsoBeforeFlowIsoBeforeFlowIso
bostonHousing0.340.020.020.130.040.020.060.020.01
concrete0.010.010.010.060.020.020.010.020.03
energy0.240.020.010.26<0.010.010.120.010.01
kin8nm0.090.01<0.01<0.01<0.01<0.010.01<0.01<0.01
naval-propulsion-plant8.030.01<0.012.35<0.01<0.010.45<0.01<0.01
power-plant0.01<0.01<0.01<0.01<0.01<0.010.01<0.01<0.01
wine-quality-red0.050.02<0.010.220.040.020.040.010.01
yacht0.250.050.070.620.030.030.270.020.03
", + "type": "table", + "image_path": "d978e71823dd45f48ecdfeb91085639f8de04ae9198cc4086ae3aa1241745175.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 87, + 100, + 521, + 139.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 87, + 139.33333333333334, + 521, + 178.66666666666669 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 87, + 178.66666666666669, + 521, + 218.00000000000003 + ], + "spans": [], + "index": 3 + } + ] + } + ], + "index": 1.0 + }, + { + "type": "table", + "bbox": [ + 106, + 260, + 508, + 515 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 228, + 504, + 251 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 228, + 504, + 240 + ], + "spans": [ + { + "bbox": [ + 106, + 228, + 504, + 240 + ], + "score": 1.0, + "content": "Table 4: MSE performance before and after recalibration. We do not show the MSE for isotonic", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 239, + 455, + 252 + ], + "spans": [ + { + "bbox": [ + 105, + 239, + 455, + 252 + ], + "score": 1.0, + "content": "regression as the mean cannot be computed after recalibrating with isotonic regression.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "table_body", + "bbox": [ + 106, + 260, + 508, + 515 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 260, + 508, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 260, + 508, + 515 + ], + "score": 0.875, + "html": "
BayesianRidgeRegressionConditionalGaussian
BeforeFlowBeforeFlow
bostonHousing0.28 ±0.080.28 ±0.080.14 ± 0.070.14 ± 0.07
concrete0.40 ± 0.070.40 ± 0.070.09 ±0.030.09 ± 0.03
energy0.09 ±0.020.09 ±0.020.0030 ±0.00090.0032 ± 0.0011
kin8nm0.59 ± 0.020.59 ± 0.020.071 ± 0.0050.072 ± 0.005
naval-propulsion-plant0.055 ± 0.0040.48 ±0.020.012 ± 0.0060.012 ± 0.007
power-plant0.072 ± 0.0070.072 ± 0.0070.048 ± 0.0060.049 ± 0.006
wine-quality-red0.63 ± 0.110.63 ± 0.110.59 ± 0.090.59 ± 0.10
yacht0.35 ± 0.100.36 ± 0.100.004 ±0.0020.004 ± 0.003
ConditionalFlow
BeforeFlow
bostonHousing0.13 ± 0.06
concrete0.09 ± 0.030.13 ± 0.06 0.09 ± 0.03
0.0022 ± 0.00060.0027 ± 0.0007
energy kin8nm0.081 ± 0.0130.081 ± 0.013
naval-propulsion-plant0.009 ± 0.0040.016 ± 0.012
power-plant0.048 ± 0.0070.048 ± 0.007
wine-quality-red0.6± 0.20.64 ± 0.15
yacht
0.004 ± 0.0030.008 ± 0.012
", + "type": "table", + "image_path": "0fc0d10d28bfe001a56686f5c0b27f829ffc23a2fccbd3c80e31c43e5c515719.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 106, + 260, + 508, + 345.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 106, + 345.0, + 508, + 430.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 106, + 430.0, + 508, + 515.0 + ], + "spans": [], + "index": 8 + } + ] + } + ], + "index": 5.75 + }, + { + "type": "text", + "bbox": [ + 106, + 534, + 506, + 579 + ], + "lines": [ + { + "bbox": [ + 106, + 534, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 106, + 534, + 505, + 546 + ], + "score": 1.0, + "content": "Reported in Table 2 are the mean and standard deviation of PICP and MSE across the 20 seeds. Due", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 545, + 506, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 506, + 559 + ], + "score": 1.0, + "content": "to the limited data, for calibration error with 100 bins, we computed it over the CDFs from all 20", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 557, + 506, + 569 + ], + "spans": [ + { + "bbox": [ + 106, + 557, + 506, + 569 + ], + "score": 1.0, + "content": "seeds. We included PICP (the percentage of true observations between the quantiles 0.025 and 0.975)", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 567, + 464, + 580 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 464, + 580 + ], + "score": 1.0, + "content": "to compare against alternative approaches where we prespecify which quantiles we need.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 534, + 506, + 580 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 592, + 205, + 604 + ], + "lines": [ + { + "bbox": [ + 105, + 592, + 205, + 605 + ], + "spans": [ + { + "bbox": [ + 105, + 592, + 205, + 605 + ], + "score": 1.0, + "content": "B.2 RECALIBRATION", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 107, + 613, + 506, + 646 + ], + "lines": [ + { + "bbox": [ + 105, + 612, + 506, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 506, + 626 + ], + "score": 1.0, + "content": "From the above section, we recalibrate the best Bayesian Ridge Regression, Conditional Gaussian,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 624, + 506, + 636 + ], + "spans": [ + { + "bbox": [ + 106, + 624, + 506, + 636 + ], + "score": 1.0, + "content": "and Conditional Flow. In Table 3, we compare the calibration error before recalibration, after", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 635, + 448, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 448, + 648 + ], + "score": 1.0, + "content": "recalibration with isotonic regression, and after recalibration with normalizing flows.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 612, + 506, + 648 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 651, + 505, + 685 + ], + "lines": [ + { + "bbox": [ + 105, + 650, + 505, + 666 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 505, + 666 + ], + "score": 1.0, + "content": "As we can see, across all 8 UCI datasets, the calibration errors after recalibrating with normalizing", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 662, + 505, + 675 + ], + "spans": [ + { + "bbox": [ + 105, + 662, + 505, + 675 + ], + "score": 1.0, + "content": "flows are comparable to those from isotonic regression. More interestingly though, improvement in", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 673, + 339, + 687 + ], + "spans": [ + { + "bbox": [ + 105, + 673, + 339, + 687 + ], + "score": 1.0, + "content": "calibration error can be detrimental to mean performance.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 650, + 505, + 687 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/H8VDvtm1ij8/H8VDvtm1ij8_model.json b/parse/train/H8VDvtm1ij8/H8VDvtm1ij8_model.json new file mode 100644 index 0000000000000000000000000000000000000000..eb82a3ad82aceb4befc4fe5d17aa5719fd1c8be5 --- /dev/null +++ b/parse/train/H8VDvtm1ij8/H8VDvtm1ij8_model.json @@ -0,0 +1,18105 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1238, + 1404, + 1238, + 1404, + 1574, + 298, + 1574 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 398, + 617, + 1303, + 617, + 1303, + 1013, + 398, + 1013 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1590, + 1403, + 1590, + 1403, + 1835, + 298, + 1835 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1850, + 1403, + 1850, + 1403, + 2033, + 298, + 2033 + ], + "score": 0.98 + }, + { + "category_id": 0, + "poly": [ + 300, + 220, + 1408, + 220, + 1408, + 321, + 300, + 321 + ], + "score": 0.96 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 104, + 298, + 104 + ], + "score": 0.877 + }, + { + "category_id": 0, + "poly": [ + 773, + 520, + 926, + 520, + 926, + 553, + 773, + 553 + ], + "score": 0.863 + }, + { + "category_id": 0, + "poly": [ + 302, + 1144, + 572, + 1144, + 572, + 1178, + 302, + 1178 + ], + "score": 0.861 + }, + { + "category_id": 1, + "poly": [ + 313, + 378, + 680, + 378, + 680, + 438, + 313, + 438 + ], + "score": 0.839 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 856, + 2088, + 856, + 2112, + 841, + 2112 + ], + "score": 0.707 + }, + { + "category_id": 15, + "poly": [ + 292.0, + 216.0, + 1414.0, + 216.0, + 1414.0, + 274.0, + 292.0, + 274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 279.0, + 587.0, + 279.0, + 587.0, + 327.0, + 295.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 857.0, + 72.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 519.0, + 932.0, + 519.0, + 932.0, + 556.0, + 769.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1140.0, + 578.0, + 1140.0, + 578.0, + 1186.0, + 294.0, + 1186.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2088.0, + 857.0, + 2088.0, + 857.0, + 2116.0, + 840.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1240.0, + 1405.0, + 1240.0, + 1405.0, + 1275.0, + 294.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1272.0, + 1406.0, + 1272.0, + 1406.0, + 1303.0, + 296.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1301.0, + 1405.0, + 1301.0, + 1405.0, + 1334.0, + 293.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1332.0, + 1408.0, + 1332.0, + 1408.0, + 1366.0, + 294.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1358.0, + 1405.0, + 1358.0, + 1405.0, + 1399.0, + 292.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1391.0, + 1406.0, + 1391.0, + 1406.0, + 1428.0, + 292.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1420.0, + 1404.0, + 1420.0, + 1404.0, + 1458.0, + 293.0, + 1458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1449.0, + 1406.0, + 1449.0, + 1406.0, + 1490.0, + 292.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1479.0, + 1406.0, + 1479.0, + 1406.0, + 1521.0, + 292.0, + 1521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1510.0, + 1405.0, + 1510.0, + 1405.0, + 1552.0, + 292.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1545.0, + 1130.0, + 1545.0, + 1130.0, + 1579.0, + 294.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 616.0, + 1305.0, + 616.0, + 1305.0, + 653.0, + 393.0, + 653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 650.0, + 1304.0, + 650.0, + 1304.0, + 682.0, + 395.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 679.0, + 1305.0, + 679.0, + 1305.0, + 711.0, + 393.0, + 711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 709.0, + 1306.0, + 709.0, + 1306.0, + 741.0, + 393.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 737.0, + 1305.0, + 737.0, + 1305.0, + 774.0, + 393.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 770.0, + 1307.0, + 770.0, + 1307.0, + 802.0, + 393.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 802.0, + 1305.0, + 802.0, + 1305.0, + 833.0, + 393.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 831.0, + 1305.0, + 831.0, + 1305.0, + 866.0, + 394.0, + 866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 860.0, + 1304.0, + 860.0, + 1304.0, + 896.0, + 394.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 894.0, + 1305.0, + 894.0, + 1305.0, + 923.0, + 394.0, + 923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 924.0, + 1305.0, + 924.0, + 1305.0, + 954.0, + 394.0, + 954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 951.0, + 1304.0, + 951.0, + 1304.0, + 987.0, + 394.0, + 987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 982.0, + 1262.0, + 982.0, + 1262.0, + 1018.0, + 394.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1589.0, + 1404.0, + 1589.0, + 1404.0, + 1626.0, + 293.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1620.0, + 1404.0, + 1620.0, + 1404.0, + 1656.0, + 293.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1650.0, + 1404.0, + 1650.0, + 1404.0, + 1686.0, + 293.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1678.0, + 1407.0, + 1678.0, + 1407.0, + 1719.0, + 292.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1710.0, + 1407.0, + 1710.0, + 1407.0, + 1750.0, + 292.0, + 1750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1741.0, + 1404.0, + 1741.0, + 1404.0, + 1780.0, + 292.0, + 1780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1770.0, + 1404.0, + 1770.0, + 1404.0, + 1812.0, + 292.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1802.0, + 715.0, + 1802.0, + 715.0, + 1840.0, + 293.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1849.0, + 1408.0, + 1849.0, + 1408.0, + 1885.0, + 296.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1880.0, + 1405.0, + 1880.0, + 1405.0, + 1916.0, + 292.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1912.0, + 1404.0, + 1912.0, + 1404.0, + 1944.0, + 296.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1944.0, + 1405.0, + 1944.0, + 1405.0, + 1976.0, + 296.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1974.0, + 1404.0, + 1974.0, + 1404.0, + 2006.0, + 296.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2001.0, + 1247.0, + 2001.0, + 1247.0, + 2038.0, + 293.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 379.0, + 560.0, + 379.0, + 560.0, + 411.0, + 315.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 407.0, + 681.0, + 407.0, + 681.0, + 442.0, + 312.0, + 442.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 630, + 1404, + 630, + 1404, + 847, + 297, + 847 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 860, + 1406, + 860, + 1406, + 1016, + 298, + 1016 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1181, + 1403, + 1181, + 1403, + 1305, + 298, + 1305 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 462, + 1403, + 462, + 1403, + 616, + 298, + 616 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 1546, + 1406, + 1546, + 1406, + 1670, + 297, + 1670 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 1319, + 1405, + 1319, + 1405, + 1444, + 297, + 1444 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 293, + 1404, + 293, + 1404, + 448, + 298, + 448 + ], + "score": 0.975 + }, + { + "category_id": 8, + "poly": [ + 586, + 1829, + 1115, + 1829, + 1115, + 1965, + 586, + 1965 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 300, + 1763, + 1403, + 1763, + 1403, + 1824, + 300, + 1824 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 649, + 1674, + 1048, + 1674, + 1048, + 1714, + 649, + 1714 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 298, + 1972, + 1406, + 1972, + 1406, + 2034, + 298, + 2034 + ], + "score": 0.942 + }, + { + "category_id": 8, + "poly": [ + 643, + 1450, + 1057, + 1450, + 1057, + 1491, + 643, + 1491 + ], + "score": 0.941 + }, + { + "category_id": 1, + "poly": [ + 299, + 1716, + 758, + 1716, + 758, + 1748, + 299, + 1748 + ], + "score": 0.924 + }, + { + "category_id": 1, + "poly": [ + 299, + 1498, + 1163, + 1498, + 1163, + 1533, + 299, + 1533 + ], + "score": 0.92 + }, + { + "category_id": 0, + "poly": [ + 300, + 225, + 587, + 225, + 587, + 262, + 300, + 262 + ], + "score": 0.912 + }, + { + "category_id": 0, + "poly": [ + 300, + 1056, + 557, + 1056, + 557, + 1093, + 300, + 1093 + ], + "score": 0.909 + }, + { + "category_id": 0, + "poly": [ + 300, + 1124, + 565, + 1124, + 565, + 1156, + 300, + 1156 + ], + "score": 0.909 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.905 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1884, + 1400, + 1884, + 1400, + 1914, + 1366, + 1914 + ], + "score": 0.883 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.752 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2112, + 840, + 2112 + ], + "score": 0.11 + }, + { + "category_id": 8, + "poly": [ + 735, + 1877, + 1114, + 1877, + 1114, + 1966, + 735, + 1966 + ], + "score": 0.093 + }, + { + "category_id": 13, + "poly": [ + 298, + 1607, + 453, + 1607, + 453, + 1643, + 298, + 1643 + ], + "score": 0.92, + "latex": "\\mathcal { F } _ { x _ { j } } ( y _ { j } ) = \\hat { p } _ { j }" + }, + { + "category_id": 14, + "poly": [ + 640, + 1448, + 1057, + 1448, + 1057, + 1490, + 640, + 1490 + ], + "score": 0.92, + "latex": "\\mathbb { P } ( \\hat { Y } = Y | \\hat { P } = p ) = p , \\quad \\forall p \\in [ 0 , 1 ]" + }, + { + "category_id": 14, + "poly": [ + 587, + 1826, + 1117, + 1826, + 1117, + 1970, + 587, + 1970 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\hat { p } _ { j } = \\vert \\{ y _ { n } \\vert \\mathcal { F } _ { x _ { n } } ( y _ { n } ) < p _ { j } , n = 1 , \\ldots , N \\} \\vert / N } \\\\ { \\operatorname { c a l } ( y _ { 1 } , \\ldots , y _ { N } ) = \\displaystyle \\sum _ { j = 1 } ^ { M } ( p _ { j } - \\hat { p } _ { j } ) ^ { 2 } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 648, + 1672, + 1051, + 1672, + 1051, + 1713, + 648, + 1713 + ], + "score": 0.9, + "latex": "\\mathbb { P } ( Y < \\mathcal { F } _ { X } ^ { - 1 } ( p ) ) = p , \\quad \\forall p \\in [ 0 , 1 ]" + }, + { + "category_id": 13, + "poly": [ + 488, + 1607, + 933, + 1607, + 933, + 1643, + 488, + 1643 + ], + "score": 0.9, + "latex": "| \\{ y _ { n } | \\mathcal { F } _ { x _ { n } } ( y _ { n } ) < \\hat { p } _ { j } , n \\stackrel { - } { = } 1 , . . . , N \\} | / N" + }, + { + "category_id": 13, + "poly": [ + 371, + 1718, + 414, + 1718, + 414, + 1747, + 371, + 1747 + ], + "score": 0.89, + "latex": "{ \\mathcal { F } } _ { X }" + }, + { + "category_id": 13, + "poly": [ + 671, + 1496, + 697, + 1496, + 697, + 1528, + 671, + 1528 + ], + "score": 0.87, + "latex": "\\hat { P }" + }, + { + "category_id": 13, + "poly": [ + 371, + 1495, + 396, + 1495, + 396, + 1528, + 371, + 1528 + ], + "score": 0.85, + "latex": "\\hat { Y }" + }, + { + "category_id": 13, + "poly": [ + 370, + 1974, + 403, + 1974, + 403, + 2000, + 370, + 2000 + ], + "score": 0.82, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 487, + 1642, + 504, + 1642, + 504, + 1670, + 487, + 1670 + ], + "score": 0.79, + "latex": "\\hat { p }" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 223.0, + 593.0, + 223.0, + 593.0, + 267.0, + 292.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1053.0, + 561.0, + 1053.0, + 561.0, + 1100.0, + 291.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1123.0, + 569.0, + 1123.0, + 569.0, + 1160.0, + 295.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2120.0, + 838.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 863.0, + 2085.0, + 863.0, + 2120.0, + 838.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 630.0, + 1406.0, + 630.0, + 1406.0, + 667.0, + 292.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 663.0, + 1407.0, + 663.0, + 1407.0, + 698.0, + 294.0, + 698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 693.0, + 1405.0, + 693.0, + 1405.0, + 727.0, + 295.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 724.0, + 1406.0, + 724.0, + 1406.0, + 758.0, + 295.0, + 758.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 752.0, + 1406.0, + 752.0, + 1406.0, + 788.0, + 294.0, + 788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 783.0, + 1406.0, + 783.0, + 1406.0, + 819.0, + 292.0, + 819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 815.0, + 1306.0, + 815.0, + 1306.0, + 850.0, + 295.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 855.0, + 1409.0, + 855.0, + 1409.0, + 901.0, + 292.0, + 901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 891.0, + 1408.0, + 891.0, + 1408.0, + 929.0, + 296.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 917.0, + 1411.0, + 917.0, + 1411.0, + 961.0, + 292.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 949.0, + 1408.0, + 949.0, + 1408.0, + 987.0, + 293.0, + 987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 982.0, + 1331.0, + 982.0, + 1331.0, + 1019.0, + 295.0, + 1019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1182.0, + 1404.0, + 1182.0, + 1404.0, + 1215.0, + 294.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1213.0, + 1405.0, + 1213.0, + 1405.0, + 1245.0, + 294.0, + 1245.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1243.0, + 1404.0, + 1243.0, + 1404.0, + 1279.0, + 293.0, + 1279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1275.0, + 1030.0, + 1275.0, + 1030.0, + 1307.0, + 296.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 462.0, + 1405.0, + 462.0, + 1405.0, + 499.0, + 294.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 494.0, + 1404.0, + 494.0, + 1404.0, + 527.0, + 296.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 522.0, + 1405.0, + 522.0, + 1405.0, + 560.0, + 293.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 554.0, + 1405.0, + 554.0, + 1405.0, + 589.0, + 293.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 584.0, + 1002.0, + 584.0, + 1002.0, + 621.0, + 294.0, + 621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1543.0, + 1409.0, + 1543.0, + 1409.0, + 1584.0, + 294.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1576.0, + 1404.0, + 1576.0, + 1404.0, + 1612.0, + 294.0, + 1612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1604.0, + 297.0, + 1604.0, + 297.0, + 1648.0, + 292.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 1604.0, + 487.0, + 1604.0, + 487.0, + 1648.0, + 454.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 934.0, + 1604.0, + 1408.0, + 1604.0, + 1408.0, + 1648.0, + 934.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1636.0, + 486.0, + 1636.0, + 486.0, + 1673.0, + 294.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 505.0, + 1636.0, + 1198.0, + 1636.0, + 1198.0, + 1673.0, + 505.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1318.0, + 1407.0, + 1318.0, + 1407.0, + 1355.0, + 295.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1347.0, + 1405.0, + 1347.0, + 1405.0, + 1389.0, + 292.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1383.0, + 1403.0, + 1383.0, + 1403.0, + 1415.0, + 296.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1413.0, + 950.0, + 1413.0, + 950.0, + 1446.0, + 295.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 293.0, + 1406.0, + 293.0, + 1406.0, + 327.0, + 297.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 324.0, + 1407.0, + 324.0, + 1407.0, + 360.0, + 293.0, + 360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 356.0, + 1405.0, + 356.0, + 1405.0, + 389.0, + 294.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 386.0, + 1405.0, + 386.0, + 1405.0, + 420.0, + 294.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 418.0, + 384.0, + 418.0, + 384.0, + 454.0, + 293.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1758.0, + 1405.0, + 1758.0, + 1405.0, + 1800.0, + 294.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1791.0, + 633.0, + 1791.0, + 633.0, + 1826.0, + 296.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1968.0, + 369.0, + 1968.0, + 369.0, + 2008.0, + 292.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1968.0, + 1406.0, + 1968.0, + 1406.0, + 2008.0, + 404.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 2001.0, + 413.0, + 2001.0, + 413.0, + 2037.0, + 290.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1714.0, + 370.0, + 1714.0, + 370.0, + 1751.0, + 296.0, + 1751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 415.0, + 1714.0, + 760.0, + 1714.0, + 760.0, + 1751.0, + 415.0, + 1751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1490.0, + 370.0, + 1490.0, + 370.0, + 1542.0, + 292.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 1490.0, + 670.0, + 1490.0, + 670.0, + 1542.0, + 397.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 698.0, + 1490.0, + 1166.0, + 1490.0, + 1166.0, + 1542.0, + 698.0, + 1542.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1618, + 1405, + 1618, + 1405, + 1866, + 297, + 1866 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 1274, + 1404, + 1274, + 1404, + 1400, + 297, + 1400 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1880, + 1402, + 1880, + 1402, + 2034, + 299, + 2034 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1413, + 1401, + 1413, + 1401, + 1508, + 299, + 1508 + ], + "score": 0.97 + }, + { + "category_id": 3, + "poly": [ + 348, + 216, + 1351, + 216, + 1351, + 505, + 348, + 505 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 298, + 860, + 1403, + 860, + 1403, + 955, + 298, + 955 + ], + "score": 0.959 + }, + { + "category_id": 1, + "poly": [ + 293, + 783, + 1402, + 783, + 1402, + 846, + 293, + 846 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 289, + 1084, + 1402, + 1084, + 1402, + 1149, + 289, + 1149 + ], + "score": 0.954 + }, + { + "category_id": 8, + "poly": [ + 575, + 1174, + 1119, + 1174, + 1119, + 1251, + 575, + 1251 + ], + "score": 0.952 + }, + { + "category_id": 4, + "poly": [ + 295, + 556, + 1406, + 556, + 1406, + 649, + 295, + 649 + ], + "score": 0.951 + }, + { + "category_id": 8, + "poly": [ + 788, + 983, + 910, + 983, + 910, + 1059, + 788, + 1059 + ], + "score": 0.942 + }, + { + "category_id": 0, + "poly": [ + 300, + 720, + 634, + 720, + 634, + 752, + 300, + 752 + ], + "score": 0.906 + }, + { + "category_id": 0, + "poly": [ + 301, + 1557, + 714, + 1557, + 714, + 1589, + 301, + 1589 + ], + "score": 0.891 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 854, + 76, + 854, + 105, + 298, + 105 + ], + "score": 0.724 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.609 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.455 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 852, + 76, + 852, + 104, + 299, + 104 + ], + "score": 0.325 + }, + { + "category_id": 13, + "poly": [ + 786, + 587, + 869, + 587, + 869, + 621, + 786, + 621 + ], + "score": 0.93, + "latex": "p ( X | c )" + }, + { + "category_id": 14, + "poly": [ + 575, + 1172, + 1123, + 1172, + 1123, + 1252, + 575, + 1252 + ], + "score": 0.93, + "latex": "\\log p _ { x } ( x ) = \\log p _ { z } \\left( f ( x ) \\right) + \\log \\left| { \\operatorname* { d e t } \\left( \\frac { \\partial f ( x ) } { \\partial x } \\right) } \\right|" + }, + { + "category_id": 13, + "poly": [ + 484, + 1444, + 549, + 1444, + 549, + 1478, + 484, + 1478 + ], + "score": 0.92, + "latex": "p _ { z } ( z )" + }, + { + "category_id": 13, + "poly": [ + 568, + 922, + 632, + 922, + 632, + 956, + 568, + 956 + ], + "score": 0.92, + "latex": "p _ { z } ( z )" + }, + { + "category_id": 13, + "poly": [ + 298, + 1117, + 397, + 1117, + 397, + 1149, + 298, + 1149 + ], + "score": 0.91, + "latex": "f = g ^ { - 1 }" + }, + { + "category_id": 14, + "poly": [ + 788, + 979, + 910, + 979, + 910, + 1062, + 788, + 1062 + ], + "score": 0.91, + "latex": "\\begin{array} { l } { z \\sim p _ { z } ( z ) } \\\\ { x = g ( z ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 948, + 588, + 989, + 588, + 989, + 618, + 948, + 618 + ], + "score": 0.89, + "latex": "W _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1040, + 588, + 1081, + 588, + 1081, + 619, + 1040, + 619 + ], + "score": 0.88, + "latex": "W _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1034, + 1308, + 1053, + 1308, + 1053, + 1339, + 1034, + 1339 + ], + "score": 0.84, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 373, + 1091, + 403, + 1091, + 403, + 1116, + 373, + 1116 + ], + "score": 0.82, + "latex": "p _ { z }" + }, + { + "category_id": 13, + "poly": [ + 801, + 1091, + 819, + 1091, + 819, + 1118, + 801, + 1118 + ], + "score": 0.82, + "latex": "g" + }, + { + "category_id": 13, + "poly": [ + 991, + 1449, + 1009, + 1449, + 1009, + 1477, + 991, + 1477 + ], + "score": 0.81, + "latex": "g" + }, + { + "category_id": 13, + "poly": [ + 916, + 898, + 935, + 898, + 935, + 925, + 916, + 925 + ], + "score": 0.79, + "latex": "g" + }, + { + "category_id": 13, + "poly": [ + 984, + 868, + 1003, + 868, + 1003, + 889, + 984, + 889 + ], + "score": 0.77, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1285, + 899, + 1303, + 899, + 1303, + 920, + 1285, + 920 + ], + "score": 0.77, + "latex": "z" + }, + { + "category_id": 13, + "poly": [ + 944, + 1122, + 962, + 1122, + 962, + 1144, + 944, + 1144 + ], + "score": 0.76, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 540, + 899, + 559, + 899, + 559, + 920, + 540, + 920 + ], + "score": 0.74, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 1022, + 1980, + 1037, + 1980, + 1037, + 2000, + 1022, + 2000 + ], + "score": 0.72, + "latex": "c" + }, + { + "category_id": 13, + "poly": [ + 411, + 1918, + 427, + 1918, + 427, + 1939, + 411, + 1939 + ], + "score": 0.7, + "latex": "c" + }, + { + "category_id": 13, + "poly": [ + 1283, + 868, + 1301, + 868, + 1301, + 889, + 1283, + 889 + ], + "score": 0.69, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 1038, + 1889, + 1053, + 1889, + 1053, + 1910, + 1038, + 1910 + ], + "score": 0.56, + "latex": "c" + }, + { + "category_id": 13, + "poly": [ + 884, + 1445, + 941, + 1445, + 941, + 1478, + 884, + 1478 + ], + "score": 0.42, + "latex": "[ 0 , 1 ]" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 242.0, + 428.0, + 242.0, + 428.0, + 269.0, + 406.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 953.0, + 241.0, + 980.0, + 241.0, + 980.0, + 271.0, + 953.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 519.0, + 376.0, + 552.0, + 376.0, + 552.0, + 396.0, + 519.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 425.0, + 427.0, + 425.0, + 427.0, + 442.0, + 408.0, + 442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 447.0, + 427.0, + 457.0, + 427.0, + 457.0, + 439.0, + 447.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 411.0, + 527.0, + 411.0, + 527.0, + 457.0, + 463.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 572.0, + 397.0, + 613.0, + 397.0, + 613.0, + 433.0, + 572.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1101.0, + 415.0, + 1151.0, + 415.0, + 1151.0, + 452.0, + 1101.0, + 452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1178.0, + 416.0, + 1229.0, + 416.0, + 1229.0, + 453.0, + 1178.0, + 453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 444.0, + 469.0, + 703.0, + 469.0, + 703.0, + 502.0, + 444.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 468.0, + 1242.0, + 468.0, + 1242.0, + 502.0, + 1007.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.75, + 386.0, + 1135.75, + 386.0, + 1135.75, + 405.0, + 1112.75, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 555.0, + 1406.0, + 555.0, + 1406.0, + 593.0, + 294.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 588.0, + 785.0, + 588.0, + 785.0, + 622.0, + 295.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 588.0, + 947.0, + 588.0, + 947.0, + 622.0, + 870.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 588.0, + 1039.0, + 588.0, + 1039.0, + 622.0, + 990.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1082.0, + 588.0, + 1404.0, + 588.0, + 1404.0, + 622.0, + 1082.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 618.0, + 525.0, + 618.0, + 525.0, + 650.0, + 295.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 717.0, + 638.0, + 717.0, + 638.0, + 757.0, + 294.0, + 757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1551.0, + 719.0, + 1551.0, + 719.0, + 1597.0, + 291.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 857.0, + 72.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 860.0, + 2085.0, + 860.0, + 2116.0, + 839.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1618.0, + 1406.0, + 1618.0, + 1406.0, + 1657.0, + 292.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1651.0, + 1405.0, + 1651.0, + 1405.0, + 1685.0, + 294.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1683.0, + 1403.0, + 1683.0, + 1403.0, + 1717.0, + 294.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1713.0, + 1408.0, + 1713.0, + 1408.0, + 1747.0, + 295.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1743.0, + 1405.0, + 1743.0, + 1405.0, + 1777.0, + 294.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1773.0, + 1405.0, + 1773.0, + 1405.0, + 1807.0, + 294.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1802.0, + 1406.0, + 1802.0, + 1406.0, + 1839.0, + 292.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1832.0, + 450.0, + 1832.0, + 450.0, + 1867.0, + 295.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1275.0, + 1404.0, + 1275.0, + 1404.0, + 1310.0, + 294.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1306.0, + 1033.0, + 1306.0, + 1033.0, + 1341.0, + 294.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 1306.0, + 1407.0, + 1306.0, + 1407.0, + 1341.0, + 1054.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1336.0, + 1406.0, + 1336.0, + 1406.0, + 1372.0, + 292.0, + 1372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1368.0, + 1209.0, + 1368.0, + 1209.0, + 1401.0, + 295.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1880.0, + 1037.0, + 1880.0, + 1037.0, + 1917.0, + 294.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 1880.0, + 1406.0, + 1880.0, + 1406.0, + 1917.0, + 1054.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1911.0, + 410.0, + 1911.0, + 410.0, + 1944.0, + 295.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 428.0, + 1911.0, + 1402.0, + 1911.0, + 1402.0, + 1944.0, + 428.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1942.0, + 1406.0, + 1942.0, + 1406.0, + 1975.0, + 293.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1972.0, + 1021.0, + 1972.0, + 1021.0, + 2009.0, + 295.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 1972.0, + 1406.0, + 1972.0, + 1406.0, + 2009.0, + 1038.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2003.0, + 937.0, + 2003.0, + 937.0, + 2036.0, + 295.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1414.0, + 1405.0, + 1414.0, + 1405.0, + 1448.0, + 295.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1445.0, + 483.0, + 1445.0, + 483.0, + 1479.0, + 295.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 550.0, + 1445.0, + 883.0, + 1445.0, + 883.0, + 1479.0, + 550.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 942.0, + 1445.0, + 990.0, + 1445.0, + 990.0, + 1479.0, + 942.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1010.0, + 1445.0, + 1405.0, + 1445.0, + 1405.0, + 1479.0, + 1010.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1474.0, + 1253.0, + 1474.0, + 1253.0, + 1510.0, + 294.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 861.0, + 983.0, + 861.0, + 983.0, + 895.0, + 297.0, + 895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1004.0, + 861.0, + 1282.0, + 861.0, + 1282.0, + 895.0, + 1004.0, + 895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1302.0, + 861.0, + 1407.0, + 861.0, + 1407.0, + 895.0, + 1302.0, + 895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 890.0, + 539.0, + 890.0, + 539.0, + 927.0, + 294.0, + 927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 560.0, + 890.0, + 915.0, + 890.0, + 915.0, + 927.0, + 560.0, + 927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 936.0, + 890.0, + 1284.0, + 890.0, + 1284.0, + 927.0, + 936.0, + 927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1304.0, + 890.0, + 1405.0, + 890.0, + 1405.0, + 927.0, + 1304.0, + 927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 921.0, + 567.0, + 921.0, + 567.0, + 956.0, + 294.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 633.0, + 921.0, + 1163.0, + 921.0, + 1163.0, + 956.0, + 633.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 780.0, + 1407.0, + 780.0, + 1407.0, + 822.0, + 291.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 813.0, + 1039.0, + 813.0, + 1039.0, + 851.0, + 292.0, + 851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1084.0, + 372.0, + 1084.0, + 372.0, + 1120.0, + 296.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1084.0, + 800.0, + 1084.0, + 800.0, + 1120.0, + 404.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 1084.0, + 1404.0, + 1084.0, + 1404.0, + 1120.0, + 820.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1115.0, + 297.0, + 1115.0, + 297.0, + 1153.0, + 292.0, + 1153.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 398.0, + 1115.0, + 943.0, + 1115.0, + 943.0, + 1153.0, + 398.0, + 1153.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 963.0, + 1115.0, + 995.0, + 1115.0, + 995.0, + 1153.0, + 963.0, + 1153.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 294, + 1406, + 294, + 1406, + 480, + 298, + 480 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 575, + 1406, + 575, + 1406, + 790, + 297, + 790 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 805, + 882, + 805, + 882, + 989, + 297, + 989 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 1542, + 1405, + 1542, + 1405, + 1704, + 297, + 1704 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1116, + 883, + 1116, + 883, + 1329, + 298, + 1329 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1910, + 1403, + 1910, + 1403, + 2036, + 298, + 2036 + ], + "score": 0.973 + }, + { + "category_id": 3, + "poly": [ + 902, + 847, + 1398, + 847, + 1398, + 1208, + 902, + 1208 + ], + "score": 0.97 + }, + { + "category_id": 4, + "poly": [ + 900, + 1233, + 1404, + 1233, + 1404, + 1295, + 900, + 1295 + ], + "score": 0.958 + }, + { + "category_id": 1, + "poly": [ + 297, + 1330, + 1400, + 1330, + 1400, + 1392, + 297, + 1392 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 360, + 1415, + 930, + 1415, + 930, + 1516, + 360, + 1516 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 740, + 1766, + 957, + 1766, + 957, + 1899, + 740, + 1899 + ], + "score": 0.943 + }, + { + "category_id": 1, + "poly": [ + 298, + 1718, + 940, + 1718, + 940, + 1751, + 298, + 1751 + ], + "score": 0.923 + }, + { + "category_id": 0, + "poly": [ + 297, + 225, + 967, + 225, + 967, + 262, + 297, + 262 + ], + "score": 0.898 + }, + { + "category_id": 0, + "poly": [ + 298, + 518, + 878, + 518, + 878, + 551, + 298, + 551 + ], + "score": 0.885 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.856 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 857, + 2088, + 857, + 2111, + 840, + 2111 + ], + "score": 0.791 + }, + { + "category_id": 0, + "poly": [ + 296, + 1028, + 637, + 1028, + 637, + 1089, + 296, + 1089 + ], + "score": 0.703 + }, + { + "category_id": 13, + "poly": [ + 522, + 1575, + 706, + 1575, + 706, + 1616, + 522, + 1616 + ], + "score": 0.93, + "latex": "\\{ x ^ { v a l } , y ^ { v a l } \\} _ { i = 1 } ^ { N _ { v a l } }" + }, + { + "category_id": 13, + "poly": [ + 370, + 1544, + 458, + 1544, + 458, + 1578, + 370, + 1578 + ], + "score": 0.92, + "latex": "f _ { \\boldsymbol { \\theta } } ( \\boldsymbol { y } | \\boldsymbol { x } )" + }, + { + "category_id": 13, + "poly": [ + 1132, + 296, + 1208, + 296, + 1208, + 330, + 1132, + 330 + ], + "score": 0.92, + "latex": "p ( y | x )" + }, + { + "category_id": 14, + "poly": [ + 740, + 1764, + 959, + 1764, + 959, + 1904, + 740, + 1904 + ], + "score": 0.92, + "latex": "\\begin{array} { l } { z \\sim \\mathrm { U n i f o r m } ( 0 , 1 ) } \\\\ { u = G _ { \\phi } ^ { - 1 } ( z ) } \\\\ { y = F _ { \\theta } ^ { - 1 } ( u | x ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 2001, + 351, + 2001, + 351, + 2042, + 298, + 2042 + ], + "score": 0.91, + "latex": "G _ { \\phi } ^ { - 1 }" + }, + { + "category_id": 13, + "poly": [ + 872, + 1544, + 965, + 1544, + 965, + 1578, + 872, + 1578 + ], + "score": 0.9, + "latex": "F _ { \\theta } ( y | x )" + }, + { + "category_id": 13, + "poly": [ + 374, + 1912, + 414, + 1912, + 414, + 1945, + 374, + 1945 + ], + "score": 0.89, + "latex": "G _ { \\phi }" + }, + { + "category_id": 13, + "poly": [ + 776, + 1945, + 804, + 1945, + 804, + 1975, + 776, + 1975 + ], + "score": 0.87, + "latex": "f _ { \\theta }" + }, + { + "category_id": 13, + "poly": [ + 863, + 1615, + 893, + 1615, + 893, + 1645, + 863, + 1645 + ], + "score": 0.86, + "latex": "g _ { \\phi }" + }, + { + "category_id": 13, + "poly": [ + 775, + 2006, + 794, + 2006, + 794, + 2035, + 775, + 2035 + ], + "score": 0.85, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 1156, + 1974, + 1177, + 1974, + 1177, + 2004, + 1156, + 2004 + ], + "score": 0.84, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 586, + 1916, + 616, + 1916, + 616, + 1946, + 586, + 1946 + ], + "score": 0.84, + "latex": "g _ { \\phi }" + }, + { + "category_id": 13, + "poly": [ + 854, + 1945, + 885, + 1945, + 885, + 1977, + 854, + 1977 + ], + "score": 0.84, + "latex": "g _ { \\phi }" + }, + { + "category_id": 13, + "poly": [ + 854, + 1977, + 870, + 1977, + 870, + 2000, + 854, + 2000 + ], + "score": 0.82, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 1186, + 2004, + 1204, + 2004, + 1204, + 2030, + 1186, + 2030 + ], + "score": 0.78, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 1384, + 2004, + 1401, + 2004, + 1401, + 2030, + 1384, + 2030 + ], + "score": 0.77, + "latex": "\\theta" + }, + { + "category_id": 14, + "poly": [ + 359, + 1412, + 932, + 1412, + 932, + 1518, + 359, + 1518 + ], + "score": 0.69, + "latex": "\\begin{array} { r l } & { 1 . \\ f _ { \\theta } = \\arg \\operatorname* { m a x } _ { f _ { \\theta } } \\sum _ { i = 1 } ^ { N _ { t r } } \\log p _ { f _ { \\theta } } ( y _ { i } ^ { t r } | x _ { i } ^ { t r } ) } \\\\ & { 2 . \\ g _ { \\phi } = \\arg \\operatorname* { m a x } _ { g _ { \\phi } } \\sum _ { i = 1 } ^ { N _ { v a l } } \\log p _ { g _ { \\phi } } ( F _ { \\theta } ( y _ { i } ^ { v a l } | x _ { i } ^ { v a l } ) ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1125, + 1539, + 1375, + 1539, + 1375, + 1579, + 1125, + 1579 + ], + "score": 0.67, + "latex": "f _ { \\theta } ( y | x ) , \\{ x ^ { t r } , y ^ { t r } \\} _ { i = 1 } ^ { N _ { t r } }" + }, + { + "category_id": 13, + "poly": [ + 1124, + 1543, + 1212, + 1543, + 1212, + 1578, + 1124, + 1578 + ], + "score": 0.66, + "latex": "f _ { \\boldsymbol { \\theta } } ( \\boldsymbol { y } | \\boldsymbol { x } )" + }, + { + "category_id": 13, + "poly": [ + 842, + 1550, + 861, + 1550, + 861, + 1573, + 842, + 1573 + ], + "score": 0.55, + "latex": "x" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 842.0, + 938.0, + 842.0, + 938.0, + 868.0, + 903.0, + 868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1002.0, + 859.0, + 1144.0, + 859.0, + 1144.0, + 889.0, + 1002.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1200.0, + 858.0, + 1311.0, + 858.0, + 1311.0, + 889.0, + 1200.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 897.0, + 937.0, + 897.0, + 937.0, + 925.0, + 903.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 951.0, + 937.0, + 951.0, + 937.0, + 979.0, + 903.0, + 979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 902.0, + 1005.0, + 939.0, + 1005.0, + 939.0, + 1036.0, + 902.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 902.0, + 1060.0, + 938.0, + 1060.0, + 938.0, + 1091.0, + 902.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 1117.0, + 937.0, + 1117.0, + 937.0, + 1145.0, + 903.0, + 1145.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 1174.0, + 936.0, + 1174.0, + 936.0, + 1196.0, + 904.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 969.0, + 1186.0, + 999.0, + 1186.0, + 999.0, + 1210.0, + 969.0, + 1210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1188.0, + 1088.0, + 1188.0, + 1088.0, + 1208.0, + 1064.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 1189.0, + 1175.0, + 1189.0, + 1175.0, + 1207.0, + 1159.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 1188.0, + 1358.0, + 1188.0, + 1358.0, + 1207.0, + 1343.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 1232.0, + 1407.0, + 1232.0, + 1407.0, + 1267.0, + 901.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 1266.0, + 1092.0, + 1266.0, + 1092.0, + 1295.0, + 903.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 223.0, + 971.0, + 223.0, + 971.0, + 268.0, + 291.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 515.0, + 881.0, + 515.0, + 881.0, + 555.0, + 293.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2086.0, + 861.0, + 2086.0, + 861.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1026.0, + 568.0, + 1026.0, + 568.0, + 1061.0, + 294.0, + 1061.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1058.0, + 640.0, + 1058.0, + 640.0, + 1091.0, + 295.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 294.0, + 1131.0, + 294.0, + 1131.0, + 333.0, + 293.0, + 333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1209.0, + 294.0, + 1406.0, + 294.0, + 1406.0, + 333.0, + 1209.0, + 333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 327.0, + 1406.0, + 327.0, + 1406.0, + 363.0, + 295.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 356.0, + 1406.0, + 356.0, + 1406.0, + 391.0, + 292.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 390.0, + 1404.0, + 390.0, + 1404.0, + 421.0, + 296.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 421.0, + 1404.0, + 421.0, + 1404.0, + 450.0, + 297.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 450.0, + 1370.0, + 450.0, + 1370.0, + 481.0, + 296.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 577.0, + 1409.0, + 577.0, + 1409.0, + 611.0, + 296.0, + 611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 606.0, + 1409.0, + 606.0, + 1409.0, + 642.0, + 294.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 634.0, + 1407.0, + 634.0, + 1407.0, + 674.0, + 291.0, + 674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 668.0, + 1406.0, + 668.0, + 1406.0, + 702.0, + 294.0, + 702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 700.0, + 1404.0, + 700.0, + 1404.0, + 730.0, + 295.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 728.0, + 1407.0, + 728.0, + 1407.0, + 766.0, + 292.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 760.0, + 680.0, + 760.0, + 680.0, + 791.0, + 295.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 804.0, + 881.0, + 804.0, + 881.0, + 838.0, + 294.0, + 838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 837.0, + 881.0, + 837.0, + 881.0, + 867.0, + 294.0, + 867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 867.0, + 880.0, + 867.0, + 880.0, + 898.0, + 296.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 899.0, + 884.0, + 899.0, + 884.0, + 930.0, + 296.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 926.0, + 882.0, + 926.0, + 882.0, + 961.0, + 294.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 956.0, + 338.0, + 956.0, + 338.0, + 995.0, + 293.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 1533.0, + 369.0, + 1533.0, + 369.0, + 1623.0, + 285.0, + 1623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 1533.0, + 521.0, + 1533.0, + 521.0, + 1623.0, + 459.0, + 1623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 707.0, + 1533.0, + 841.0, + 1533.0, + 841.0, + 1623.0, + 707.0, + 1623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 1533.0, + 871.0, + 1533.0, + 871.0, + 1623.0, + 862.0, + 1623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 966.0, + 1533.0, + 1123.0, + 1533.0, + 1123.0, + 1623.0, + 966.0, + 1623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1376.0, + 1533.0, + 1413.0, + 1533.0, + 1413.0, + 1623.0, + 1376.0, + 1623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1609.0, + 862.0, + 1609.0, + 862.0, + 1648.0, + 295.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1609.0, + 1407.0, + 1609.0, + 1407.0, + 1648.0, + 894.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1635.0, + 1405.0, + 1635.0, + 1405.0, + 1679.0, + 294.0, + 1679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1671.0, + 1390.0, + 1671.0, + 1390.0, + 1705.0, + 295.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1114.0, + 885.0, + 1114.0, + 885.0, + 1150.0, + 294.0, + 1150.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1146.0, + 885.0, + 1146.0, + 885.0, + 1179.0, + 295.0, + 1179.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1178.0, + 881.0, + 1178.0, + 881.0, + 1208.0, + 295.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1207.0, + 883.0, + 1207.0, + 883.0, + 1239.0, + 295.0, + 1239.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1237.0, + 882.0, + 1237.0, + 882.0, + 1269.0, + 294.0, + 1269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1267.0, + 881.0, + 1267.0, + 881.0, + 1300.0, + 295.0, + 1300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1299.0, + 882.0, + 1299.0, + 882.0, + 1332.0, + 295.0, + 1332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1911.0, + 373.0, + 1911.0, + 373.0, + 1947.0, + 294.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 415.0, + 1911.0, + 585.0, + 1911.0, + 585.0, + 1947.0, + 415.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 617.0, + 1911.0, + 1404.0, + 1911.0, + 1404.0, + 1947.0, + 617.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1942.0, + 775.0, + 1942.0, + 775.0, + 1979.0, + 293.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1942.0, + 853.0, + 1942.0, + 853.0, + 1979.0, + 805.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 1942.0, + 1407.0, + 1942.0, + 1407.0, + 1979.0, + 886.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1974.0, + 853.0, + 1974.0, + 853.0, + 2007.0, + 294.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 1974.0, + 1155.0, + 1974.0, + 1155.0, + 2007.0, + 871.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1178.0, + 1974.0, + 1405.0, + 1974.0, + 1405.0, + 2007.0, + 1178.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 2004.0, + 774.0, + 2004.0, + 774.0, + 2037.0, + 352.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 795.0, + 2004.0, + 1185.0, + 2004.0, + 1185.0, + 2037.0, + 795.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1205.0, + 2004.0, + 1383.0, + 2004.0, + 1383.0, + 2037.0, + 1205.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1326.0, + 1405.0, + 1326.0, + 1405.0, + 1367.0, + 292.0, + 1367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1360.0, + 1397.0, + 1360.0, + 1397.0, + 1395.0, + 295.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1709.0, + 944.0, + 1709.0, + 944.0, + 1760.0, + 292.0, + 1760.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 962, + 1404, + 962, + 1404, + 1208, + 298, + 1208 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 299, + 1223, + 1403, + 1223, + 1403, + 1376, + 299, + 1376 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1772, + 1403, + 1772, + 1403, + 1957, + 299, + 1957 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1392, + 1404, + 1392, + 1404, + 1546, + 299, + 1546 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1664, + 1403, + 1664, + 1403, + 1757, + 299, + 1757 + ], + "score": 0.975 + }, + { + "category_id": 4, + "poly": [ + 296, + 655, + 1406, + 655, + 1406, + 809, + 296, + 809 + ], + "score": 0.968 + }, + { + "category_id": 3, + "poly": [ + 303, + 224, + 1400, + 224, + 1400, + 630, + 303, + 630 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 299, + 1972, + 1398, + 1972, + 1398, + 2037, + 299, + 2037 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 293, + 884, + 1401, + 884, + 1401, + 947, + 293, + 947 + ], + "score": 0.944 + }, + { + "category_id": 2, + "poly": [ + 299, + 77, + 852, + 77, + 852, + 104, + 299, + 104 + ], + "score": 0.873 + }, + { + "category_id": 0, + "poly": [ + 301, + 1601, + 751, + 1601, + 751, + 1631, + 301, + 1631 + ], + "score": 0.838 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.707 + }, + { + "category_id": 13, + "poly": [ + 550, + 2003, + 728, + 2003, + 728, + 2036, + 550, + 2036 + ], + "score": 0.93, + "latex": "x _ { i } = F ( y _ { i } | y _ { < i } )" + }, + { + "category_id": 13, + "poly": [ + 977, + 995, + 1006, + 995, + 1006, + 1026, + 977, + 1026 + ], + "score": 0.88, + "latex": "f _ { \\theta }" + }, + { + "category_id": 13, + "poly": [ + 788, + 1029, + 818, + 1029, + 818, + 1058, + 788, + 1058 + ], + "score": 0.86, + "latex": "g _ { \\phi }" + }, + { + "category_id": 13, + "poly": [ + 884, + 1086, + 913, + 1086, + 913, + 1117, + 884, + 1117 + ], + "score": 0.85, + "latex": "f _ { \\theta }" + }, + { + "category_id": 13, + "poly": [ + 343, + 887, + 363, + 887, + 363, + 917, + 343, + 917 + ], + "score": 0.85, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 722, + 1978, + 749, + 1978, + 749, + 2000, + 722, + 2000 + ], + "score": 0.85, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 1096, + 999, + 1118, + 999, + 1118, + 1026, + 1096, + 1026 + ], + "score": 0.82, + "latex": "\\mu" + }, + { + "category_id": 13, + "poly": [ + 298, + 2004, + 325, + 2004, + 325, + 2030, + 298, + 2030 + ], + "score": 0.78, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 1166, + 998, + 1187, + 998, + 1187, + 1022, + 1166, + 1022 + ], + "score": 0.77, + "latex": "\\sigma" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 654.0, + 1404.0, + 654.0, + 1404.0, + 692.0, + 295.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 687.0, + 1404.0, + 687.0, + 1404.0, + 720.0, + 295.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 716.0, + 1409.0, + 716.0, + 1409.0, + 752.0, + 293.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 748.0, + 1404.0, + 748.0, + 1404.0, + 781.0, + 295.0, + 781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 780.0, + 801.0, + 780.0, + 801.0, + 813.0, + 295.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 319.0, + 333.0, + 319.0, + 333.0, + 338.0, + 310.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 916.0, + 321.0, + 936.0, + 321.0, + 936.0, + 336.0, + 916.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 359.0, + 333.0, + 359.0, + 333.0, + 378.0, + 310.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 359.0, + 939.0, + 359.0, + 939.0, + 378.0, + 915.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 400.0, + 332.0, + 400.0, + 332.0, + 416.0, + 318.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 925.0, + 403.0, + 934.0, + 403.0, + 934.0, + 415.0, + 925.0, + 415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 443.0, + 330.0, + 443.0, + 330.0, + 455.0, + 319.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 444.0, + 935.0, + 444.0, + 935.0, + 454.0, + 924.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 482.0, + 330.0, + 482.0, + 330.0, + 495.0, + 314.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 519.0, + 333.0, + 519.0, + 333.0, + 538.0, + 308.0, + 538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.0, + 522.0, + 935.0, + 522.0, + 935.0, + 535.0, + 918.0, + 535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 571.0, + 381.0, + 571.0, + 381.0, + 586.0, + 364.0, + 586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 399.0, + 569.0, + 425.0, + 569.0, + 425.0, + 586.0, + 399.0, + 586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 445.0, + 568.0, + 466.0, + 568.0, + 466.0, + 588.0, + 445.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 490.0, + 571.0, + 507.0, + 571.0, + 507.0, + 586.0, + 490.0, + 586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 566.0, + 647.0, + 566.0, + 647.0, + 590.0, + 529.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 659.0, + 568.0, + 682.0, + 568.0, + 682.0, + 588.0, + 659.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 966.0, + 569.0, + 989.0, + 569.0, + 989.0, + 588.0, + 966.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 571.0, + 1029.0, + 571.0, + 1029.0, + 585.0, + 1007.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 568.0, + 1071.0, + 568.0, + 1071.0, + 588.0, + 1051.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 572.0, + 1108.0, + 572.0, + 1108.0, + 584.0, + 1098.0, + 584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 568.0, + 1159.0, + 568.0, + 1159.0, + 588.0, + 1136.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1177.0, + 568.0, + 1202.0, + 568.0, + 1202.0, + 588.0, + 1177.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1221.0, + 568.0, + 1246.0, + 568.0, + 1246.0, + 588.0, + 1221.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1265.0, + 568.0, + 1287.0, + 568.0, + 1287.0, + 588.0, + 1265.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 599.0, + 746.0, + 599.0, + 746.0, + 633.0, + 349.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 599.0, + 1349.0, + 599.0, + 1349.0, + 633.0, + 956.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 856.0, + 73.0, + 856.0, + 107.0, + 297.0, + 107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1600.0, + 757.0, + 1600.0, + 757.0, + 1635.0, + 294.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 861.0, + 2085.0, + 861.0, + 2120.0, + 839.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 964.0, + 1404.0, + 964.0, + 1404.0, + 997.0, + 296.0, + 997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 995.0, + 976.0, + 995.0, + 976.0, + 1029.0, + 294.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 995.0, + 1095.0, + 995.0, + 1095.0, + 1029.0, + 1007.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1119.0, + 995.0, + 1165.0, + 995.0, + 1165.0, + 1029.0, + 1119.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1188.0, + 995.0, + 1406.0, + 995.0, + 1406.0, + 1029.0, + 1188.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1024.0, + 787.0, + 1024.0, + 787.0, + 1059.0, + 293.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 1024.0, + 1406.0, + 1024.0, + 1406.0, + 1059.0, + 819.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1055.0, + 1406.0, + 1055.0, + 1406.0, + 1089.0, + 294.0, + 1089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1084.0, + 883.0, + 1084.0, + 883.0, + 1120.0, + 293.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 914.0, + 1084.0, + 1405.0, + 1084.0, + 1405.0, + 1120.0, + 914.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1115.0, + 1406.0, + 1115.0, + 1406.0, + 1152.0, + 294.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1144.0, + 1406.0, + 1144.0, + 1406.0, + 1184.0, + 293.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1175.0, + 1350.0, + 1175.0, + 1350.0, + 1212.0, + 293.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1220.0, + 1404.0, + 1220.0, + 1404.0, + 1259.0, + 295.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1251.0, + 1405.0, + 1251.0, + 1405.0, + 1290.0, + 294.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1281.0, + 1405.0, + 1281.0, + 1405.0, + 1321.0, + 293.0, + 1321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1314.0, + 1404.0, + 1314.0, + 1404.0, + 1351.0, + 294.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1347.0, + 663.0, + 1347.0, + 663.0, + 1380.0, + 295.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1774.0, + 1404.0, + 1774.0, + 1404.0, + 1806.0, + 297.0, + 1806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1803.0, + 1407.0, + 1803.0, + 1407.0, + 1839.0, + 294.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1834.0, + 1408.0, + 1834.0, + 1408.0, + 1870.0, + 295.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1862.0, + 1405.0, + 1862.0, + 1405.0, + 1900.0, + 294.0, + 1900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1892.0, + 1407.0, + 1892.0, + 1407.0, + 1932.0, + 293.0, + 1932.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1927.0, + 762.0, + 1927.0, + 762.0, + 1959.0, + 297.0, + 1959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1394.0, + 1404.0, + 1394.0, + 1404.0, + 1427.0, + 297.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1420.0, + 1408.0, + 1420.0, + 1408.0, + 1460.0, + 293.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1454.0, + 1405.0, + 1454.0, + 1405.0, + 1488.0, + 295.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1482.0, + 1406.0, + 1482.0, + 1406.0, + 1518.0, + 294.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1513.0, + 1257.0, + 1513.0, + 1257.0, + 1552.0, + 294.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1663.0, + 1405.0, + 1663.0, + 1405.0, + 1701.0, + 294.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1692.0, + 1405.0, + 1692.0, + 1405.0, + 1733.0, + 293.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1729.0, + 931.0, + 1729.0, + 931.0, + 1759.0, + 297.0, + 1759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1967.0, + 721.0, + 1967.0, + 721.0, + 2007.0, + 294.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 1967.0, + 1403.0, + 1967.0, + 1403.0, + 2007.0, + 750.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1997.0, + 297.0, + 1997.0, + 297.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1997.0, + 549.0, + 1997.0, + 549.0, + 2039.0, + 326.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 729.0, + 1997.0, + 740.0, + 1997.0, + 740.0, + 2039.0, + 729.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 885.0, + 342.0, + 885.0, + 342.0, + 921.0, + 295.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 885.0, + 1403.0, + 885.0, + 1403.0, + 921.0, + 364.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 916.0, + 982.0, + 916.0, + 982.0, + 951.0, + 295.0, + 951.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1437, + 1405, + 1437, + 1405, + 1682, + 298, + 1682 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 961, + 1405, + 961, + 1405, + 1146, + 298, + 1146 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 1697, + 1403, + 1697, + 1403, + 1851, + 299, + 1851 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1268, + 1405, + 1268, + 1405, + 1422, + 298, + 1422 + ], + "score": 0.976 + }, + { + "category_id": 3, + "poly": [ + 301, + 267, + 1359, + 267, + 1359, + 712, + 301, + 712 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 301, + 1160, + 1400, + 1160, + 1400, + 1253, + 301, + 1253 + ], + "score": 0.961 + }, + { + "category_id": 4, + "poly": [ + 296, + 737, + 1403, + 737, + 1403, + 829, + 296, + 829 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 295, + 1971, + 1401, + 1971, + 1401, + 2034, + 295, + 2034 + ], + "score": 0.943 + }, + { + "category_id": 0, + "poly": [ + 298, + 888, + 964, + 888, + 964, + 925, + 298, + 925 + ], + "score": 0.928 + }, + { + "category_id": 0, + "poly": [ + 299, + 1900, + 557, + 1900, + 557, + 1935, + 299, + 1935 + ], + "score": 0.897 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 852, + 76, + 852, + 104, + 299, + 104 + ], + "score": 0.827 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 858, + 2089, + 858, + 2112, + 840, + 2112 + ], + "score": 0.78 + }, + { + "category_id": 13, + "poly": [ + 868, + 1469, + 942, + 1469, + 942, + 1502, + 868, + 1502 + ], + "score": 0.95, + "latex": "F ( Y _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 966, + 1161, + 1057, + 1161, + 1057, + 1194, + 966, + 1194 + ], + "score": 0.95, + "latex": "( Y _ { 1 } , Y _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 476, + 1299, + 586, + 1299, + 586, + 1333, + 476, + 1333 + ], + "score": 0.93, + "latex": "F ( Y _ { 2 } | Y _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 1160, + 1269, + 1234, + 1269, + 1234, + 1303, + 1160, + 1303 + ], + "score": 0.93, + "latex": "F ( Y _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 1287, + 1269, + 1398, + 1269, + 1398, + 1303, + 1287, + 1303 + ], + "score": 0.93, + "latex": "F ( Y _ { 2 } | Y _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 910, + 1331, + 984, + 1331, + 984, + 1364, + 910, + 1364 + ], + "score": 0.92, + "latex": "F ( Y _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 1183, + 1437, + 1396, + 1437, + 1396, + 1472, + 1183, + 1472 + ], + "score": 0.9, + "latex": "( F ( Y _ { 1 } ) , F ( Y _ { 2 } | Y _ { 1 } ) )" + }, + { + "category_id": 13, + "poly": [ + 703, + 1361, + 735, + 1361, + 735, + 1391, + 703, + 1391 + ], + "score": 0.88, + "latex": "Y _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1242, + 1361, + 1273, + 1361, + 1273, + 1391, + 1242, + 1391 + ], + "score": 0.87, + "latex": "Y _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1327, + 1361, + 1358, + 1361, + 1358, + 1391, + 1327, + 1391 + ], + "score": 0.86, + "latex": "Y _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 583, + 1766, + 598, + 1766, + 598, + 1788, + 583, + 1788 + ], + "score": 0.54, + "latex": "c" + }, + { + "category_id": 13, + "poly": [ + 1157, + 542, + 1287, + 542, + 1287, + 560, + 1157, + 560 + ], + "score": 0.46, + "latex": "F ( Y _ { 1 } ) \\in [ 0 . 5 0 , 0 . 7 5 )" + }, + { + "category_id": 13, + "poly": [ + 1156, + 521, + 1287, + 521, + 1287, + 540, + 1156, + 540 + ], + "score": 0.31, + "latex": "F ( Y _ { 1 } ) \\in [ 0 . 2 5 , 0 . 5 0 )" + }, + { + "category_id": 13, + "poly": [ + 595, + 542, + 726, + 542, + 726, + 560, + 595, + 560 + ], + "score": 0.27, + "latex": "F ( Y _ { 1 } ) \\in [ 0 . 5 0 , 0 . 7 5 )" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 266.0, + 368.0, + 266.0, + 368.0, + 294.0, + 329.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 266.0, + 928.0, + 266.0, + 928.0, + 294.0, + 890.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 333.0, + 368.0, + 333.0, + 368.0, + 361.0, + 328.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 889.0, + 333.0, + 928.0, + 333.0, + 928.0, + 361.0, + 889.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 364.0, + 339.0, + 364.0, + 339.0, + 526.0, + 299.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 859.0, + 364.0, + 899.0, + 364.0, + 899.0, + 527.0, + 859.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 399.0, + 367.0, + 399.0, + 367.0, + 426.0, + 329.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 399.0, + 926.0, + 399.0, + 926.0, + 426.0, + 890.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 466.0, + 364.0, + 466.0, + 364.0, + 493.0, + 329.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 476.0, + 733.0, + 476.0, + 733.0, + 503.0, + 601.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 468.0, + 925.0, + 468.0, + 925.0, + 491.0, + 892.0, + 491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1163.0, + 479.0, + 1293.0, + 479.0, + 1293.0, + 502.0, + 1163.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 587.0, + 496.0, + 778.0, + 496.0, + 778.0, + 521.0, + 587.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 496.0, + 1340.0, + 496.0, + 1340.0, + 522.0, + 1152.0, + 522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 516.0, + 778.0, + 516.0, + 778.0, + 543.0, + 588.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 516.0, + 1155.0, + 516.0, + 1155.0, + 543.0, + 1152.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1288.0, + 516.0, + 1340.0, + 516.0, + 1340.0, + 543.0, + 1288.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 532.0, + 366.0, + 532.0, + 366.0, + 560.0, + 328.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.0, + 537.0, + 594.0, + 537.0, + 594.0, + 564.0, + 589.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 727.0, + 537.0, + 779.0, + 537.0, + 779.0, + 564.0, + 727.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 532.0, + 928.0, + 532.0, + 928.0, + 560.0, + 890.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 537.0, + 1156.0, + 537.0, + 1156.0, + 564.0, + 1152.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1288.0, + 537.0, + 1340.0, + 537.0, + 1340.0, + 564.0, + 1288.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.0, + 556.0, + 778.0, + 556.0, + 778.0, + 583.0, + 589.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 556.0, + 1339.0, + 556.0, + 1339.0, + 583.0, + 1151.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 551.0, + 576.0, + 679.0, + 576.0, + 679.0, + 606.0, + 551.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 723.0, + 576.0, + 781.0, + 576.0, + 781.0, + 606.0, + 723.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 578.0, + 1240.0, + 578.0, + 1240.0, + 606.0, + 1115.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1285.0, + 576.0, + 1341.0, + 576.0, + 1341.0, + 606.0, + 1285.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 599.0, + 368.0, + 599.0, + 368.0, + 626.0, + 328.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 889.0, + 597.0, + 936.0, + 597.0, + 936.0, + 627.0, + 889.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 614.0, + 387.0, + 614.0, + 387.0, + 640.0, + 346.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.0, + 611.0, + 472.0, + 611.0, + 472.0, + 643.0, + 431.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 612.0, + 554.0, + 612.0, + 554.0, + 640.0, + 516.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 611.0, + 639.0, + 611.0, + 639.0, + 643.0, + 598.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 612.0, + 721.0, + 612.0, + 721.0, + 640.0, + 683.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 767.0, + 614.0, + 803.0, + 614.0, + 803.0, + 642.0, + 767.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 910.0, + 614.0, + 947.0, + 614.0, + 947.0, + 640.0, + 910.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 993.0, + 614.0, + 1030.0, + 614.0, + 1030.0, + 642.0, + 993.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 612.0, + 1115.0, + 612.0, + 1115.0, + 640.0, + 1077.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 611.0, + 1200.0, + 611.0, + 1200.0, + 643.0, + 1159.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1244.0, + 612.0, + 1281.0, + 612.0, + 1281.0, + 640.0, + 1244.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1328.0, + 614.0, + 1364.0, + 614.0, + 1364.0, + 642.0, + 1328.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 528.0, + 633.0, + 624.0, + 633.0, + 624.0, + 670.0, + 528.0, + 670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 633.0, + 1183.0, + 633.0, + 1183.0, + 670.0, + 1091.0, + 670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 679.0, + 773.0, + 679.0, + 773.0, + 713.0, + 364.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 679.0, + 1332.0, + 679.0, + 1332.0, + 713.0, + 929.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1279.0, + 300.0, + 1350.0, + 300.0, + 1350.0, + 313.0, + 1279.0, + 313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1265.0, + 328.5, + 1293.0, + 328.5, + 1293.0, + 340.5, + 1265.0, + 340.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 439.5, + 1228.0, + 439.5, + 1228.0, + 460.0, + 1033.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 920.25, + 592.0, + 965.25, + 592.0, + 965.25, + 605.0, + 920.25, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 734.0, + 1405.0, + 734.0, + 1405.0, + 775.0, + 293.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 766.0, + 1405.0, + 766.0, + 1405.0, + 801.0, + 294.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 797.0, + 432.0, + 797.0, + 432.0, + 832.0, + 294.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 888.0, + 967.0, + 888.0, + 967.0, + 929.0, + 293.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1896.0, + 561.0, + 1896.0, + 561.0, + 1941.0, + 293.0, + 1941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2087.0, + 861.0, + 2087.0, + 861.0, + 2118.0, + 840.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1437.0, + 1182.0, + 1437.0, + 1182.0, + 1474.0, + 295.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1397.0, + 1437.0, + 1408.0, + 1437.0, + 1408.0, + 1474.0, + 1397.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1467.0, + 867.0, + 1467.0, + 867.0, + 1501.0, + 293.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 943.0, + 1467.0, + 1407.0, + 1467.0, + 1407.0, + 1501.0, + 943.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1497.0, + 1405.0, + 1497.0, + 1405.0, + 1532.0, + 295.0, + 1532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1528.0, + 1406.0, + 1528.0, + 1406.0, + 1563.0, + 292.0, + 1563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1558.0, + 1405.0, + 1558.0, + 1405.0, + 1594.0, + 293.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1591.0, + 1401.0, + 1591.0, + 1401.0, + 1621.0, + 296.0, + 1621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1619.0, + 1405.0, + 1619.0, + 1405.0, + 1654.0, + 292.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1652.0, + 718.0, + 1652.0, + 718.0, + 1685.0, + 296.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 963.0, + 1406.0, + 963.0, + 1406.0, + 995.0, + 296.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 991.0, + 1407.0, + 991.0, + 1407.0, + 1027.0, + 293.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1020.0, + 1408.0, + 1020.0, + 1408.0, + 1057.0, + 293.0, + 1057.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1055.0, + 1405.0, + 1055.0, + 1405.0, + 1087.0, + 295.0, + 1087.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1083.0, + 1405.0, + 1083.0, + 1405.0, + 1120.0, + 293.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1111.0, + 1155.0, + 1111.0, + 1155.0, + 1154.0, + 291.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1697.0, + 1403.0, + 1697.0, + 1403.0, + 1730.0, + 295.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1726.0, + 1407.0, + 1726.0, + 1407.0, + 1765.0, + 293.0, + 1765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1758.0, + 582.0, + 1758.0, + 582.0, + 1795.0, + 294.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1758.0, + 1404.0, + 1758.0, + 1404.0, + 1795.0, + 599.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1789.0, + 1404.0, + 1789.0, + 1404.0, + 1824.0, + 294.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1820.0, + 958.0, + 1820.0, + 958.0, + 1853.0, + 295.0, + 1853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1266.0, + 1159.0, + 1266.0, + 1159.0, + 1305.0, + 293.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1235.0, + 1266.0, + 1286.0, + 1266.0, + 1286.0, + 1305.0, + 1235.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 1266.0, + 1409.0, + 1266.0, + 1409.0, + 1305.0, + 1399.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1296.0, + 475.0, + 1296.0, + 475.0, + 1334.0, + 293.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 587.0, + 1296.0, + 1406.0, + 1296.0, + 1406.0, + 1334.0, + 587.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1330.0, + 909.0, + 1330.0, + 909.0, + 1364.0, + 296.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1330.0, + 1403.0, + 1330.0, + 1403.0, + 1364.0, + 985.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1360.0, + 702.0, + 1360.0, + 702.0, + 1395.0, + 293.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 1360.0, + 1241.0, + 1360.0, + 1241.0, + 1395.0, + 736.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1274.0, + 1360.0, + 1326.0, + 1360.0, + 1326.0, + 1395.0, + 1274.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1359.0, + 1360.0, + 1405.0, + 1360.0, + 1405.0, + 1395.0, + 1359.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1387.0, + 1332.0, + 1387.0, + 1332.0, + 1427.0, + 293.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1159.0, + 965.0, + 1159.0, + 965.0, + 1197.0, + 295.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 1159.0, + 1406.0, + 1159.0, + 1406.0, + 1197.0, + 1058.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1188.0, + 1405.0, + 1188.0, + 1405.0, + 1227.0, + 293.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1219.0, + 360.0, + 1219.0, + 360.0, + 1258.0, + 294.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1973.0, + 1401.0, + 1973.0, + 1401.0, + 2005.0, + 297.0, + 2005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2001.0, + 1405.0, + 2001.0, + 1405.0, + 2038.0, + 294.0, + 2038.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 307, + 1785, + 1391, + 1785, + 1391, + 2030, + 307, + 2030 + ], + "score": 0.98, + "html": "
Before Recalib.Isotonic Recalib.Flow Recalib.
MSECalibMSECalibMSECalib
ConditionalFlow0.009 ±0.0040.45N.A.<0.010.016 ± 0.012<0.01
ConditionalGaussian0.012 ±0.0062.35N.A.<0.010.012 ±0.006<0.01
BayesianRidgeRegression0.055 ±0.0048.03N.A.0.010.48 ± 0.02<0.01
MC Dropout0.005 ±0.0020.51N.A.N.A.N.A.N.A.
SQR0.0052 ± 0.00121.44N.A.N.A.N.A.N.A.
" + }, + { + "category_id": 1, + "poly": [ + 298, + 1358, + 1405, + 1358, + 1405, + 1574, + 298, + 1574 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1151, + 1404, + 1151, + 1404, + 1244, + 298, + 1244 + ], + "score": 0.974 + }, + { + "category_id": 3, + "poly": [ + 467, + 218, + 1230, + 218, + 1230, + 902, + 467, + 902 + ], + "score": 0.97 + }, + { + "category_id": 4, + "poly": [ + 295, + 925, + 1406, + 925, + 1406, + 1078, + 295, + 1078 + ], + "score": 0.967 + }, + { + "category_id": 6, + "poly": [ + 296, + 1635, + 1404, + 1635, + 1404, + 1761, + 296, + 1761 + ], + "score": 0.963 + }, + { + "category_id": 0, + "poly": [ + 299, + 1295, + 533, + 1295, + 533, + 1327, + 299, + 1327 + ], + "score": 0.884 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 854, + 76, + 854, + 104, + 298, + 104 + ], + "score": 0.83 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 858, + 2087, + 858, + 2112, + 841, + 2112 + ], + "score": 0.782 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 852, + 76, + 852, + 104, + 299, + 104 + ], + "score": 0.173 + }, + { + "category_id": 13, + "poly": [ + 488, + 988, + 518, + 988, + 518, + 1020, + 488, + 1020 + ], + "score": 0.86, + "latex": "f _ { \\theta }" + }, + { + "category_id": 13, + "poly": [ + 682, + 1022, + 713, + 1022, + 713, + 1052, + 682, + 1052 + ], + "score": 0.86, + "latex": "g _ { \\phi }" + }, + { + "category_id": 13, + "poly": [ + 1137, + 1018, + 1166, + 1018, + 1166, + 1050, + 1137, + 1050 + ], + "score": 0.85, + "latex": "f _ { \\theta }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1018, + 326, + 1018, + 326, + 1050, + 298, + 1050 + ], + "score": 0.84, + "latex": "f _ { \\theta }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1056, + 313, + 1056, + 313, + 1076, + 298, + 1076 + ], + "score": 0.29, + "latex": "c" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 237.0, + 864.0, + 237.0, + 864.0, + 271.0, + 738.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 278.0, + 864.0, + 278.0, + 864.0, + 314.0, + 832.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 327.0, + 851.0, + 327.0, + 851.0, + 344.0, + 842.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 834.0, + 336.0, + 859.0, + 336.0, + 859.0, + 372.0, + 834.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 370.0, + 868.0, + 370.0, + 868.0, + 415.0, + 827.0, + 415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 759.0, + 471.0, + 933.0, + 471.0, + 933.0, + 512.0, + 759.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 489.0, + 608.0, + 718.0, + 608.0, + 718.0, + 638.0, + 489.0, + 638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1010.0, + 603.0, + 1213.0, + 603.0, + 1213.0, + 642.0, + 1010.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 526.0, + 643.0, + 619.0, + 643.0, + 619.0, + 692.0, + 526.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 644.0, + 793.0, + 644.0, + 793.0, + 691.0, + 667.0, + 691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 895.0, + 647.0, + 990.0, + 647.0, + 990.0, + 689.0, + 895.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1006.0, + 645.0, + 1131.0, + 645.0, + 1131.0, + 689.0, + 1006.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1162.0, + 657.0, + 1186.0, + 657.0, + 1186.0, + 684.0, + 1162.0, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 561.0, + 723.0, + 583.0, + 723.0, + 583.0, + 745.0, + 561.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 723.0, + 1092.0, + 723.0, + 1092.0, + 752.0, + 1048.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 745.0, + 608.0, + 745.0, + 608.0, + 791.0, + 538.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 750.0, + 1091.0, + 750.0, + 1091.0, + 786.0, + 1046.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 560.0, + 824.0, + 585.0, + 824.0, + 585.0, + 849.0, + 560.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 721.0, + 828.0, + 740.0, + 828.0, + 740.0, + 846.0, + 721.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 822.0, + 1075.0, + 822.0, + 1075.0, + 837.0, + 1064.0, + 837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 849.0, + 589.0, + 849.0, + 589.0, + 883.0, + 553.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 711.0, + 850.0, + 748.0, + 850.0, + 748.0, + 883.0, + 711.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 842.0, + 1208.0, + 842.0, + 1208.0, + 886.0, + 926.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 747.5, + 761.0, + 747.5, + 761.0, + 786.5, + 696.0, + 786.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 925.0, + 1407.0, + 925.0, + 1407.0, + 962.0, + 294.0, + 962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 953.0, + 1404.0, + 953.0, + 1404.0, + 994.0, + 290.0, + 994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 986.0, + 487.0, + 986.0, + 487.0, + 1019.0, + 294.0, + 1019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 519.0, + 986.0, + 1403.0, + 986.0, + 1403.0, + 1019.0, + 519.0, + 1019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1015.0, + 297.0, + 1015.0, + 297.0, + 1054.0, + 292.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1015.0, + 681.0, + 1015.0, + 681.0, + 1054.0, + 327.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 714.0, + 1015.0, + 1136.0, + 1015.0, + 1136.0, + 1054.0, + 714.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 1015.0, + 1406.0, + 1015.0, + 1406.0, + 1054.0, + 1167.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1054.0, + 297.0, + 1054.0, + 297.0, + 1082.0, + 294.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 1054.0, + 323.0, + 1054.0, + 323.0, + 1082.0, + 314.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1634.0, + 1404.0, + 1634.0, + 1404.0, + 1670.0, + 293.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1669.0, + 1405.0, + 1669.0, + 1405.0, + 1702.0, + 295.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1697.0, + 1405.0, + 1697.0, + 1405.0, + 1732.0, + 294.0, + 1732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1729.0, + 1123.0, + 1729.0, + 1123.0, + 1764.0, + 295.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1295.0, + 537.0, + 1295.0, + 537.0, + 1331.0, + 295.0, + 1331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2118.0, + 839.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1357.0, + 1405.0, + 1357.0, + 1405.0, + 1396.0, + 293.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1387.0, + 1406.0, + 1387.0, + 1406.0, + 1428.0, + 292.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1420.0, + 1405.0, + 1420.0, + 1405.0, + 1454.0, + 293.0, + 1454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1452.0, + 1405.0, + 1452.0, + 1405.0, + 1483.0, + 296.0, + 1483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1481.0, + 1405.0, + 1481.0, + 1405.0, + 1515.0, + 295.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1510.0, + 1405.0, + 1510.0, + 1405.0, + 1546.0, + 293.0, + 1546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1543.0, + 1407.0, + 1543.0, + 1407.0, + 1573.0, + 296.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1150.0, + 1404.0, + 1150.0, + 1404.0, + 1188.0, + 292.0, + 1188.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1178.0, + 1405.0, + 1178.0, + 1405.0, + 1220.0, + 292.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1214.0, + 913.0, + 1214.0, + 913.0, + 1248.0, + 296.0, + 1248.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 716, + 1404, + 716, + 1404, + 1023, + 298, + 1023 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1146, + 1404, + 1146, + 1404, + 1330, + 298, + 1330 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 398, + 1404, + 398, + 1404, + 553, + 299, + 553 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1405, + 229, + 1405, + 382, + 299, + 382 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 1038, + 1404, + 1038, + 1404, + 1130, + 299, + 1130 + ], + "score": 0.97 + }, + { + "category_id": 3, + "poly": [ + 300, + 1461, + 1360, + 1461, + 1360, + 1907, + 300, + 1907 + ], + "score": 0.963 + }, + { + "category_id": 4, + "poly": [ + 294, + 1931, + 1403, + 1931, + 1403, + 2025, + 294, + 2025 + ], + "score": 0.953 + }, + { + "category_id": 0, + "poly": [ + 300, + 640, + 564, + 640, + 564, + 671, + 300, + 671 + ], + "score": 0.9 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2112, + 840, + 2112 + ], + "score": 0.795 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 852, + 76, + 852, + 104, + 300, + 104 + ], + "score": 0.59 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 853, + 76, + 853, + 104, + 299, + 104 + ], + "score": 0.44 + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1460.0, + 370.0, + 1460.0, + 370.0, + 1491.0, + 329.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 889.0, + 1460.0, + 930.0, + 1460.0, + 930.0, + 1491.0, + 889.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1528.0, + 367.0, + 1528.0, + 367.0, + 1556.0, + 329.0, + 1556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 889.0, + 1528.0, + 928.0, + 1528.0, + 928.0, + 1556.0, + 889.0, + 1556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1559.0, + 339.0, + 1559.0, + 339.0, + 1724.0, + 296.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 859.0, + 1560.0, + 899.0, + 1560.0, + 899.0, + 1723.0, + 859.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1595.0, + 366.0, + 1595.0, + 366.0, + 1622.0, + 330.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 1595.0, + 927.0, + 1595.0, + 927.0, + 1622.0, + 890.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1662.0, + 366.0, + 1662.0, + 366.0, + 1689.0, + 330.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 1672.0, + 727.0, + 1672.0, + 727.0, + 1699.0, + 593.0, + 1699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 1662.0, + 927.0, + 1662.0, + 927.0, + 1689.0, + 890.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 1674.0, + 1287.0, + 1674.0, + 1287.0, + 1697.0, + 1156.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 1691.0, + 777.0, + 1691.0, + 777.0, + 1718.0, + 577.0, + 1718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1139.0, + 1694.0, + 1336.0, + 1694.0, + 1336.0, + 1717.0, + 1139.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 1709.0, + 717.0, + 1709.0, + 717.0, + 1740.0, + 575.0, + 1740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 719.0, + 1711.0, + 778.0, + 1711.0, + 778.0, + 1740.0, + 719.0, + 1740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1138.0, + 1712.0, + 1277.0, + 1712.0, + 1277.0, + 1740.0, + 1138.0, + 1740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1282.0, + 1711.0, + 1340.0, + 1711.0, + 1340.0, + 1740.0, + 1282.0, + 1740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1728.0, + 367.0, + 1728.0, + 367.0, + 1756.0, + 330.0, + 1756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 1733.0, + 703.0, + 1733.0, + 703.0, + 1760.0, + 576.0, + 1760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 1732.0, + 779.0, + 1732.0, + 779.0, + 1761.0, + 724.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 1728.0, + 927.0, + 1728.0, + 927.0, + 1756.0, + 890.0, + 1756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1138.0, + 1733.0, + 1265.0, + 1733.0, + 1265.0, + 1760.0, + 1138.0, + 1760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1284.0, + 1732.0, + 1341.0, + 1732.0, + 1341.0, + 1761.0, + 1284.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 1751.0, + 704.0, + 1751.0, + 704.0, + 1783.0, + 575.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 1752.0, + 780.0, + 1752.0, + 780.0, + 1781.0, + 724.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1137.0, + 1751.0, + 1266.0, + 1751.0, + 1266.0, + 1783.0, + 1137.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1284.0, + 1752.0, + 1341.0, + 1752.0, + 1341.0, + 1781.0, + 1284.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1774.0, + 664.0, + 1774.0, + 664.0, + 1802.0, + 541.0, + 1802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 722.0, + 1772.0, + 779.0, + 1772.0, + 779.0, + 1802.0, + 722.0, + 1802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1104.0, + 1773.0, + 1225.0, + 1773.0, + 1225.0, + 1801.0, + 1104.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1283.0, + 1772.0, + 1340.0, + 1772.0, + 1340.0, + 1802.0, + 1283.0, + 1802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1795.0, + 367.0, + 1795.0, + 367.0, + 1822.0, + 330.0, + 1822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 1796.0, + 927.0, + 1796.0, + 927.0, + 1819.0, + 888.0, + 1819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 1810.0, + 387.0, + 1810.0, + 387.0, + 1836.0, + 349.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 432.0, + 1810.0, + 470.0, + 1810.0, + 470.0, + 1836.0, + 432.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 1808.0, + 553.0, + 1808.0, + 553.0, + 1836.0, + 516.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 1807.0, + 639.0, + 1807.0, + 639.0, + 1839.0, + 598.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 1808.0, + 721.0, + 1808.0, + 721.0, + 1836.0, + 683.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 767.0, + 1810.0, + 803.0, + 1810.0, + 803.0, + 1836.0, + 767.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 910.0, + 1810.0, + 947.0, + 1810.0, + 947.0, + 1836.0, + 910.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 993.0, + 1810.0, + 1031.0, + 1810.0, + 1031.0, + 1836.0, + 993.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 1808.0, + 1114.0, + 1808.0, + 1114.0, + 1836.0, + 1078.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1160.0, + 1808.0, + 1199.0, + 1808.0, + 1199.0, + 1836.0, + 1160.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1243.0, + 1810.0, + 1282.0, + 1810.0, + 1282.0, + 1836.0, + 1243.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1328.0, + 1810.0, + 1364.0, + 1810.0, + 1364.0, + 1836.0, + 1328.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 1827.0, + 624.0, + 1827.0, + 624.0, + 1867.0, + 529.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 1829.0, + 1184.0, + 1829.0, + 1184.0, + 1866.0, + 1091.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 446.0, + 1874.0, + 692.0, + 1874.0, + 692.0, + 1908.0, + 446.0, + 1908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 917.0, + 1874.0, + 1342.0, + 1874.0, + 1342.0, + 1908.0, + 917.0, + 1908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1258.25, + 1504.0, + 1333.25, + 1504.0, + 1333.25, + 1519.0, + 1258.25, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 1624.0, + 1206.0, + 1624.0, + 1206.0, + 1640.0, + 1091.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 922.0, + 1748.5, + 1065.0, + 1748.5, + 1065.0, + 1768.5, + 922.0, + 1768.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1931.0, + 1406.0, + 1931.0, + 1406.0, + 1965.0, + 294.0, + 1965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1962.0, + 1405.0, + 1962.0, + 1405.0, + 1996.0, + 296.0, + 1996.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1991.0, + 472.0, + 1991.0, + 472.0, + 2027.0, + 295.0, + 2027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 640.0, + 568.0, + 640.0, + 568.0, + 673.0, + 296.0, + 673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 2085.0, + 859.0, + 2085.0, + 859.0, + 2116.0, + 836.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 714.0, + 1406.0, + 714.0, + 1406.0, + 751.0, + 293.0, + 751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 745.0, + 1408.0, + 745.0, + 1408.0, + 783.0, + 293.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 777.0, + 1406.0, + 777.0, + 1406.0, + 815.0, + 293.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 810.0, + 1404.0, + 810.0, + 1404.0, + 842.0, + 296.0, + 842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 842.0, + 1405.0, + 842.0, + 1405.0, + 873.0, + 294.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 868.0, + 1405.0, + 868.0, + 1405.0, + 904.0, + 294.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 899.0, + 1407.0, + 899.0, + 1407.0, + 937.0, + 292.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 931.0, + 1406.0, + 931.0, + 1406.0, + 966.0, + 294.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 960.0, + 1406.0, + 960.0, + 1406.0, + 995.0, + 293.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 990.0, + 797.0, + 990.0, + 797.0, + 1027.0, + 292.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1145.0, + 1405.0, + 1145.0, + 1405.0, + 1181.0, + 294.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1177.0, + 1404.0, + 1177.0, + 1404.0, + 1209.0, + 296.0, + 1209.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1208.0, + 1406.0, + 1208.0, + 1406.0, + 1243.0, + 296.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1238.0, + 1405.0, + 1238.0, + 1405.0, + 1270.0, + 294.0, + 1270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1265.0, + 1406.0, + 1265.0, + 1406.0, + 1305.0, + 292.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1299.0, + 500.0, + 1299.0, + 500.0, + 1329.0, + 294.0, + 1329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 398.0, + 1403.0, + 398.0, + 1403.0, + 432.0, + 295.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 426.0, + 1406.0, + 426.0, + 1406.0, + 466.0, + 293.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 458.0, + 1405.0, + 458.0, + 1405.0, + 497.0, + 293.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 487.0, + 1404.0, + 487.0, + 1404.0, + 527.0, + 293.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 522.0, + 638.0, + 522.0, + 638.0, + 555.0, + 295.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 230.0, + 1409.0, + 230.0, + 1409.0, + 263.0, + 295.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 258.0, + 1406.0, + 258.0, + 1406.0, + 296.0, + 293.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 290.0, + 1406.0, + 290.0, + 1406.0, + 327.0, + 294.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 320.0, + 1406.0, + 320.0, + 1406.0, + 357.0, + 294.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 352.0, + 483.0, + 352.0, + 483.0, + 385.0, + 294.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1038.0, + 1405.0, + 1038.0, + 1405.0, + 1072.0, + 294.0, + 1072.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1070.0, + 1404.0, + 1070.0, + 1404.0, + 1103.0, + 294.0, + 1103.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1100.0, + 637.0, + 1100.0, + 637.0, + 1133.0, + 295.0, + 1133.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1527, + 1405, + 1527, + 1405, + 1866, + 297, + 1866 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1148, + 1404, + 1148, + 1404, + 1333, + 297, + 1333 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1011, + 1403, + 1011, + 1403, + 1134, + 298, + 1134 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 1881, + 1402, + 1881, + 1402, + 2034, + 299, + 2034 + ], + "score": 0.975 + }, + { + "category_id": 3, + "poly": [ + 302, + 267, + 1359, + 267, + 1359, + 712, + 302, + 712 + ], + "score": 0.962 + }, + { + "category_id": 4, + "poly": [ + 297, + 736, + 1403, + 736, + 1403, + 830, + 297, + 830 + ], + "score": 0.955 + }, + { + "category_id": 0, + "poly": [ + 299, + 1428, + 842, + 1428, + 842, + 1464, + 299, + 1464 + ], + "score": 0.92 + }, + { + "category_id": 0, + "poly": [ + 298, + 934, + 522, + 934, + 522, + 966, + 298, + 966 + ], + "score": 0.91 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.783 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 852, + 76, + 852, + 104, + 299, + 104 + ], + "score": 0.741 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 854, + 76, + 854, + 104, + 298, + 104 + ], + "score": 0.092 + }, + { + "category_id": 13, + "poly": [ + 781, + 1150, + 891, + 1150, + 891, + 1184, + 781, + 1184 + ], + "score": 0.93, + "latex": "F ( Y _ { 2 } | Y _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 1157, + 542, + 1287, + 542, + 1287, + 560, + 1157, + 560 + ], + "score": 0.52, + "latex": "F ( Y _ { 1 } ) \\in [ 0 . 5 0 , 0 . 7 5 )" + }, + { + "category_id": 13, + "poly": [ + 1156, + 521, + 1287, + 521, + 1287, + 540, + 1156, + 540 + ], + "score": 0.39, + "latex": "F ( Y _ { 1 } ) \\in [ 0 . 2 5 , 0 . 5 0 )" + }, + { + "category_id": 13, + "poly": [ + 1151, + 500, + 1287, + 500, + 1287, + 519, + 1151, + 519 + ], + "score": 0.31, + "latex": "F ( Y _ { 1 } ) \\in [ 0 . 0 0 , 0 . 2 5 )" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 264.0, + 369.0, + 264.0, + 369.0, + 296.0, + 328.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 266.0, + 928.0, + 266.0, + 928.0, + 294.0, + 891.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 333.0, + 366.0, + 333.0, + 366.0, + 361.0, + 328.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 333.0, + 928.0, + 333.0, + 928.0, + 361.0, + 890.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 301.0, + 371.0, + 365.0, + 371.0, + 365.0, + 518.0, + 301.0, + 518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 859.0, + 370.0, + 927.0, + 370.0, + 927.0, + 522.0, + 859.0, + 522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 466.0, + 365.0, + 466.0, + 365.0, + 493.0, + 330.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 476.0, + 733.0, + 476.0, + 733.0, + 503.0, + 599.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 466.0, + 927.0, + 466.0, + 927.0, + 493.0, + 891.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1162.0, + 479.0, + 1292.0, + 479.0, + 1292.0, + 502.0, + 1162.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 592.0, + 497.0, + 779.0, + 497.0, + 779.0, + 524.0, + 592.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1288.0, + 497.0, + 1340.0, + 497.0, + 1340.0, + 522.0, + 1288.0, + 522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 516.0, + 779.0, + 516.0, + 779.0, + 543.0, + 591.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 516.0, + 1155.0, + 516.0, + 1155.0, + 543.0, + 1151.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1288.0, + 516.0, + 1340.0, + 516.0, + 1340.0, + 543.0, + 1288.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 532.0, + 365.0, + 532.0, + 365.0, + 560.0, + 329.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.0, + 537.0, + 779.0, + 537.0, + 779.0, + 564.0, + 589.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 532.0, + 927.0, + 532.0, + 927.0, + 560.0, + 891.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 537.0, + 1156.0, + 537.0, + 1156.0, + 564.0, + 1151.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1288.0, + 537.0, + 1340.0, + 537.0, + 1340.0, + 564.0, + 1288.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 558.0, + 779.0, + 558.0, + 779.0, + 584.0, + 591.0, + 584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 556.0, + 1339.0, + 556.0, + 1339.0, + 583.0, + 1150.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 578.0, + 679.0, + 578.0, + 679.0, + 606.0, + 553.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 723.0, + 577.0, + 780.0, + 577.0, + 780.0, + 606.0, + 723.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 578.0, + 1240.0, + 578.0, + 1240.0, + 606.0, + 1114.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1284.0, + 576.0, + 1342.0, + 576.0, + 1342.0, + 606.0, + 1284.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 598.0, + 366.0, + 598.0, + 366.0, + 626.0, + 329.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 598.0, + 929.0, + 598.0, + 929.0, + 626.0, + 891.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 614.0, + 387.0, + 614.0, + 387.0, + 640.0, + 346.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 432.0, + 611.0, + 471.0, + 611.0, + 471.0, + 643.0, + 432.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 614.0, + 553.0, + 614.0, + 553.0, + 640.0, + 516.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 611.0, + 639.0, + 611.0, + 639.0, + 643.0, + 598.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 612.0, + 721.0, + 612.0, + 721.0, + 640.0, + 683.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 767.0, + 614.0, + 804.0, + 614.0, + 804.0, + 642.0, + 767.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 910.0, + 614.0, + 947.0, + 614.0, + 947.0, + 640.0, + 910.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 611.0, + 1032.0, + 611.0, + 1032.0, + 643.0, + 992.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.0, + 612.0, + 1115.0, + 612.0, + 1115.0, + 640.0, + 1076.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 611.0, + 1200.0, + 611.0, + 1200.0, + 643.0, + 1158.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 611.0, + 1282.0, + 611.0, + 1282.0, + 643.0, + 1241.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1328.0, + 614.0, + 1364.0, + 614.0, + 1364.0, + 642.0, + 1328.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 532.0, + 633.0, + 621.0, + 633.0, + 621.0, + 670.0, + 532.0, + 670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 630.0, + 1182.0, + 630.0, + 1182.0, + 671.0, + 1092.0, + 671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 679.0, + 770.0, + 679.0, + 770.0, + 713.0, + 369.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 677.0, + 1328.0, + 677.0, + 1328.0, + 715.0, + 932.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1288.25, + 290.0, + 1339.25, + 290.0, + 1339.25, + 306.0, + 1288.25, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 737.0, + 1403.0, + 737.0, + 1403.0, + 771.0, + 296.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 766.0, + 1405.0, + 766.0, + 1405.0, + 804.0, + 293.0, + 804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 795.0, + 657.0, + 795.0, + 657.0, + 833.0, + 295.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1424.0, + 846.0, + 1424.0, + 846.0, + 1470.0, + 292.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 931.0, + 526.0, + 931.0, + 526.0, + 971.0, + 295.0, + 971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2087.0, + 860.0, + 2087.0, + 860.0, + 2117.0, + 839.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1526.0, + 1407.0, + 1526.0, + 1407.0, + 1567.0, + 292.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1558.0, + 1405.0, + 1558.0, + 1405.0, + 1599.0, + 292.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1590.0, + 1406.0, + 1590.0, + 1406.0, + 1625.0, + 295.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1619.0, + 1405.0, + 1619.0, + 1405.0, + 1657.0, + 294.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1650.0, + 1407.0, + 1650.0, + 1407.0, + 1685.0, + 295.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1678.0, + 1408.0, + 1678.0, + 1408.0, + 1718.0, + 292.0, + 1718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1713.0, + 1405.0, + 1713.0, + 1405.0, + 1748.0, + 295.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1743.0, + 1405.0, + 1743.0, + 1405.0, + 1778.0, + 295.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1773.0, + 1405.0, + 1773.0, + 1405.0, + 1807.0, + 295.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1804.0, + 1403.0, + 1804.0, + 1403.0, + 1835.0, + 296.0, + 1835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1836.0, + 908.0, + 1836.0, + 908.0, + 1867.0, + 295.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1149.0, + 780.0, + 1149.0, + 780.0, + 1185.0, + 295.0, + 1185.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 1149.0, + 1404.0, + 1149.0, + 1404.0, + 1185.0, + 892.0, + 1185.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1181.0, + 1404.0, + 1181.0, + 1404.0, + 1216.0, + 294.0, + 1216.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1209.0, + 1405.0, + 1209.0, + 1405.0, + 1247.0, + 292.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1242.0, + 1406.0, + 1242.0, + 1406.0, + 1277.0, + 295.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1271.0, + 1402.0, + 1271.0, + 1402.0, + 1307.0, + 295.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1306.0, + 645.0, + 1306.0, + 645.0, + 1333.0, + 295.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1010.0, + 1407.0, + 1010.0, + 1407.0, + 1047.0, + 292.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1043.0, + 1405.0, + 1043.0, + 1405.0, + 1076.0, + 294.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1074.0, + 1405.0, + 1074.0, + 1405.0, + 1107.0, + 292.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1103.0, + 416.0, + 1103.0, + 416.0, + 1138.0, + 292.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1880.0, + 1406.0, + 1880.0, + 1406.0, + 1917.0, + 294.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1907.0, + 1406.0, + 1907.0, + 1406.0, + 1947.0, + 294.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1938.0, + 1406.0, + 1938.0, + 1406.0, + 1980.0, + 294.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1969.0, + 1404.0, + 1969.0, + 1404.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2001.0, + 427.0, + 2001.0, + 427.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.886 + }, + { + "category_id": 1, + "poly": [ + 299, + 280, + 1400, + 280, + 1400, + 374, + 299, + 374 + ], + "score": 0.883 + }, + { + "category_id": 1, + "poly": [ + 295, + 946, + 1402, + 946, + 1402, + 1011, + 295, + 1011 + ], + "score": 0.879 + }, + { + "category_id": 1, + "poly": [ + 298, + 1293, + 1406, + 1293, + 1406, + 1388, + 298, + 1388 + ], + "score": 0.876 + }, + { + "category_id": 1, + "poly": [ + 295, + 861, + 1402, + 861, + 1402, + 926, + 295, + 926 + ], + "score": 0.875 + }, + { + "category_id": 1, + "poly": [ + 296, + 775, + 1404, + 775, + 1404, + 841, + 296, + 841 + ], + "score": 0.873 + }, + { + "category_id": 1, + "poly": [ + 303, + 1971, + 1401, + 1971, + 1401, + 2035, + 303, + 2035 + ], + "score": 0.869 + }, + { + "category_id": 1, + "poly": [ + 297, + 1208, + 1405, + 1208, + 1405, + 1272, + 297, + 1272 + ], + "score": 0.861 + }, + { + "category_id": 1, + "poly": [ + 298, + 1032, + 1405, + 1032, + 1405, + 1188, + 298, + 1188 + ], + "score": 0.859 + }, + { + "category_id": 1, + "poly": [ + 298, + 395, + 1407, + 395, + 1407, + 554, + 298, + 554 + ], + "score": 0.851 + }, + { + "category_id": 1, + "poly": [ + 298, + 1410, + 1405, + 1410, + 1405, + 1566, + 298, + 1566 + ], + "score": 0.84 + }, + { + "category_id": 1, + "poly": [ + 298, + 1795, + 1406, + 1795, + 1406, + 1950, + 298, + 1950 + ], + "score": 0.837 + }, + { + "category_id": 1, + "poly": [ + 296, + 691, + 1404, + 691, + 1404, + 754, + 296, + 754 + ], + "score": 0.836 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2113, + 836, + 2113 + ], + "score": 0.825 + }, + { + "category_id": 1, + "poly": [ + 298, + 1587, + 1406, + 1587, + 1406, + 1772, + 298, + 1772 + ], + "score": 0.817 + }, + { + "category_id": 1, + "poly": [ + 298, + 575, + 1406, + 575, + 1406, + 668, + 298, + 668 + ], + "score": 0.801 + }, + { + "category_id": 0, + "poly": [ + 300, + 228, + 488, + 228, + 488, + 261, + 300, + 261 + ], + "score": 0.754 + }, + { + "category_id": 1, + "poly": [ + 300, + 228, + 488, + 228, + 488, + 261, + 300, + 261 + ], + "score": 0.118 + }, + { + "category_id": 13, + "poly": [ + 1170, + 1592, + 1204, + 1592, + 1204, + 1617, + 1170, + 1617 + ], + "score": 0.52, + "latex": "^ { + + }" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2123.0, + 831.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 227.0, + 491.0, + 227.0, + 491.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 277.0, + 1405.0, + 277.0, + 1405.0, + 316.0, + 293.0, + 316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 308.0, + 1410.0, + 308.0, + 1410.0, + 349.0, + 319.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 340.0, + 1067.0, + 340.0, + 1067.0, + 377.0, + 324.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 948.0, + 1403.0, + 948.0, + 1403.0, + 984.0, + 295.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 979.0, + 812.0, + 979.0, + 812.0, + 1011.0, + 322.0, + 1011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1292.0, + 1408.0, + 1292.0, + 1408.0, + 1331.0, + 295.0, + 1331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1326.0, + 1408.0, + 1326.0, + 1408.0, + 1361.0, + 322.0, + 1361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1356.0, + 706.0, + 1356.0, + 706.0, + 1389.0, + 322.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 857.0, + 1404.0, + 857.0, + 1404.0, + 900.0, + 293.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 892.0, + 1040.0, + 892.0, + 1040.0, + 927.0, + 323.0, + 927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 770.0, + 1410.0, + 770.0, + 1410.0, + 816.0, + 293.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 811.0, + 707.0, + 811.0, + 707.0, + 839.0, + 325.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1967.0, + 1409.0, + 1967.0, + 1409.0, + 2008.0, + 295.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 2000.0, + 1409.0, + 2000.0, + 1409.0, + 2039.0, + 322.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1205.0, + 1410.0, + 1205.0, + 1410.0, + 1248.0, + 294.0, + 1248.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1239.0, + 734.0, + 1239.0, + 734.0, + 1275.0, + 324.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1030.0, + 1405.0, + 1030.0, + 1405.0, + 1069.0, + 296.0, + 1069.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1063.0, + 1405.0, + 1063.0, + 1405.0, + 1101.0, + 323.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1095.0, + 1403.0, + 1095.0, + 1403.0, + 1129.0, + 323.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1123.0, + 1407.0, + 1123.0, + 1407.0, + 1159.0, + 320.0, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1155.0, + 1028.0, + 1155.0, + 1028.0, + 1193.0, + 322.0, + 1193.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 396.0, + 1405.0, + 396.0, + 1405.0, + 430.0, + 296.0, + 430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 430.0, + 1405.0, + 430.0, + 1405.0, + 464.0, + 322.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 457.0, + 1409.0, + 457.0, + 1409.0, + 499.0, + 320.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 489.0, + 1410.0, + 489.0, + 1410.0, + 527.0, + 322.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 522.0, + 1216.0, + 522.0, + 1216.0, + 555.0, + 322.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1412.0, + 1403.0, + 1412.0, + 1403.0, + 1445.0, + 297.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1443.0, + 1405.0, + 1443.0, + 1405.0, + 1476.0, + 322.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1469.0, + 1407.0, + 1469.0, + 1407.0, + 1511.0, + 322.0, + 1511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1501.0, + 1407.0, + 1501.0, + 1407.0, + 1539.0, + 321.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1535.0, + 1041.0, + 1535.0, + 1041.0, + 1568.0, + 322.0, + 1568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1795.0, + 1408.0, + 1795.0, + 1408.0, + 1829.0, + 297.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1826.0, + 1408.0, + 1826.0, + 1408.0, + 1862.0, + 322.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1855.0, + 1408.0, + 1855.0, + 1408.0, + 1892.0, + 324.0, + 1892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1886.0, + 1408.0, + 1886.0, + 1408.0, + 1920.0, + 320.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1919.0, + 1076.0, + 1919.0, + 1076.0, + 1952.0, + 324.0, + 1952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 687.0, + 1409.0, + 687.0, + 1409.0, + 730.0, + 294.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 720.0, + 573.0, + 720.0, + 573.0, + 754.0, + 321.0, + 754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1589.0, + 1169.0, + 1589.0, + 1169.0, + 1621.0, + 296.0, + 1621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1205.0, + 1589.0, + 1408.0, + 1589.0, + 1408.0, + 1621.0, + 1205.0, + 1621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1617.0, + 1406.0, + 1617.0, + 1406.0, + 1654.0, + 321.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1646.0, + 1406.0, + 1646.0, + 1406.0, + 1686.0, + 322.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1674.0, + 1406.0, + 1674.0, + 1406.0, + 1718.0, + 319.0, + 1718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1707.0, + 1406.0, + 1707.0, + 1406.0, + 1746.0, + 320.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1739.0, + 564.0, + 1739.0, + 564.0, + 1774.0, + 321.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 576.0, + 1404.0, + 576.0, + 1404.0, + 609.0, + 296.0, + 609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 605.0, + 1407.0, + 605.0, + 1407.0, + 642.0, + 318.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 632.0, + 400.0, + 632.0, + 400.0, + 673.0, + 320.0, + 673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 227.0, + 491.0, + 227.0, + 491.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 323, + 229, + 1406, + 229, + 1406, + 353, + 323, + 353 + ], + "score": 0.936 + }, + { + "category_id": 1, + "poly": [ + 298, + 948, + 1405, + 948, + 1405, + 1104, + 298, + 1104 + ], + "score": 0.907 + }, + { + "category_id": 1, + "poly": [ + 297, + 746, + 1408, + 746, + 1408, + 931, + 297, + 931 + ], + "score": 0.9 + }, + { + "category_id": 1, + "poly": [ + 298, + 372, + 1407, + 372, + 1407, + 557, + 298, + 557 + ], + "score": 0.894 + }, + { + "category_id": 1, + "poly": [ + 297, + 1120, + 1408, + 1120, + 1408, + 1308, + 297, + 1308 + ], + "score": 0.891 + }, + { + "category_id": 1, + "poly": [ + 298, + 573, + 1407, + 573, + 1407, + 728, + 298, + 728 + ], + "score": 0.869 + }, + { + "category_id": 1, + "poly": [ + 301, + 1748, + 1401, + 1748, + 1401, + 1812, + 301, + 1812 + ], + "score": 0.866 + }, + { + "category_id": 1, + "poly": [ + 299, + 1323, + 1403, + 1323, + 1403, + 1417, + 299, + 1417 + ], + "score": 0.865 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.863 + }, + { + "category_id": 1, + "poly": [ + 298, + 1829, + 1406, + 1829, + 1406, + 1956, + 298, + 1956 + ], + "score": 0.858 + }, + { + "category_id": 1, + "poly": [ + 299, + 1607, + 1405, + 1607, + 1405, + 1733, + 299, + 1733 + ], + "score": 0.849 + }, + { + "category_id": 1, + "poly": [ + 299, + 1971, + 1401, + 1971, + 1401, + 2034, + 299, + 2034 + ], + "score": 0.846 + }, + { + "category_id": 1, + "poly": [ + 297, + 1434, + 1407, + 1434, + 1407, + 1590, + 297, + 1590 + ], + "score": 0.843 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 861, + 2088, + 861, + 2113, + 835, + 2113 + ], + "score": 0.825 + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 867.0, + 2085.0, + 867.0, + 2125.0, + 831.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 230.0, + 1407.0, + 230.0, + 1407.0, + 263.0, + 322.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 261.0, + 1403.0, + 261.0, + 1403.0, + 293.0, + 322.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 290.0, + 1410.0, + 290.0, + 1410.0, + 327.0, + 320.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 321.0, + 1201.0, + 321.0, + 1201.0, + 357.0, + 321.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 943.0, + 1406.0, + 943.0, + 1406.0, + 989.0, + 295.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 981.0, + 1405.0, + 981.0, + 1405.0, + 1014.0, + 323.0, + 1014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1005.0, + 1406.0, + 1005.0, + 1406.0, + 1050.0, + 320.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1041.0, + 1406.0, + 1041.0, + 1406.0, + 1074.0, + 321.0, + 1074.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1073.0, + 1126.0, + 1073.0, + 1126.0, + 1106.0, + 323.0, + 1106.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 743.0, + 1405.0, + 743.0, + 1405.0, + 779.0, + 295.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 772.0, + 1410.0, + 772.0, + 1410.0, + 815.0, + 320.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 807.0, + 1406.0, + 807.0, + 1406.0, + 842.0, + 320.0, + 842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 835.0, + 1409.0, + 835.0, + 1409.0, + 873.0, + 318.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 866.0, + 405.0, + 866.0, + 405.0, + 900.0, + 320.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 438.0, + 864.0, + 1413.0, + 864.0, + 1413.0, + 905.0, + 438.0, + 905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 897.0, + 1102.0, + 897.0, + 1102.0, + 934.0, + 321.0, + 934.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 369.0, + 1409.0, + 369.0, + 1409.0, + 406.0, + 296.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 401.0, + 648.0, + 401.0, + 648.0, + 438.0, + 318.0, + 438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 400.0, + 1409.0, + 400.0, + 1409.0, + 437.0, + 703.0, + 437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 430.0, + 1409.0, + 430.0, + 1409.0, + 468.0, + 319.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 462.0, + 1305.0, + 462.0, + 1305.0, + 498.0, + 320.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1337.0, + 464.0, + 1407.0, + 464.0, + 1407.0, + 495.0, + 1337.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 494.0, + 1365.0, + 494.0, + 1365.0, + 529.0, + 321.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 526.0, + 1152.0, + 526.0, + 1152.0, + 557.0, + 326.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1121.0, + 1179.0, + 1121.0, + 1179.0, + 1154.0, + 296.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1184.0, + 1121.0, + 1406.0, + 1121.0, + 1406.0, + 1154.0, + 1184.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1151.0, + 1097.0, + 1151.0, + 1097.0, + 1187.0, + 321.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1135.0, + 1151.0, + 1410.0, + 1151.0, + 1410.0, + 1187.0, + 1135.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1183.0, + 1409.0, + 1183.0, + 1409.0, + 1215.0, + 323.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1213.0, + 1410.0, + 1213.0, + 1410.0, + 1249.0, + 323.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1240.0, + 1410.0, + 1240.0, + 1410.0, + 1281.0, + 320.0, + 1281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1274.0, + 1302.0, + 1274.0, + 1302.0, + 1309.0, + 320.0, + 1309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 576.0, + 1408.0, + 576.0, + 1408.0, + 605.0, + 297.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 603.0, + 1409.0, + 603.0, + 1409.0, + 641.0, + 321.0, + 641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 635.0, + 1410.0, + 635.0, + 1410.0, + 672.0, + 320.0, + 672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 664.0, + 1410.0, + 664.0, + 1410.0, + 704.0, + 320.0, + 704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 697.0, + 931.0, + 697.0, + 931.0, + 730.0, + 322.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1747.0, + 1405.0, + 1747.0, + 1405.0, + 1785.0, + 295.0, + 1785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1779.0, + 1263.0, + 1779.0, + 1263.0, + 1815.0, + 320.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1321.0, + 1404.0, + 1321.0, + 1404.0, + 1359.0, + 294.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1355.0, + 1407.0, + 1355.0, + 1407.0, + 1389.0, + 324.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1385.0, + 710.0, + 1385.0, + 710.0, + 1418.0, + 323.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1830.0, + 1404.0, + 1830.0, + 1404.0, + 1863.0, + 295.0, + 1863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1859.0, + 1409.0, + 1859.0, + 1409.0, + 1898.0, + 321.0, + 1898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1890.0, + 1406.0, + 1890.0, + 1406.0, + 1926.0, + 321.0, + 1926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1922.0, + 1357.0, + 1922.0, + 1357.0, + 1959.0, + 320.0, + 1959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1609.0, + 1405.0, + 1609.0, + 1405.0, + 1642.0, + 297.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1638.0, + 1402.0, + 1638.0, + 1402.0, + 1671.0, + 323.0, + 1671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1669.0, + 1408.0, + 1669.0, + 1408.0, + 1702.0, + 321.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1701.0, + 1246.0, + 1701.0, + 1246.0, + 1734.0, + 322.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1969.0, + 1405.0, + 1969.0, + 1405.0, + 2008.0, + 294.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 2001.0, + 1367.0, + 2001.0, + 1367.0, + 2037.0, + 319.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1432.0, + 1405.0, + 1432.0, + 1405.0, + 1472.0, + 295.0, + 1472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1464.0, + 1407.0, + 1464.0, + 1407.0, + 1503.0, + 321.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1497.0, + 1408.0, + 1497.0, + 1408.0, + 1531.0, + 323.0, + 1531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1527.0, + 1410.0, + 1527.0, + 1410.0, + 1564.0, + 324.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1559.0, + 1099.0, + 1559.0, + 1099.0, + 1591.0, + 321.0, + 1591.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.878 + }, + { + "category_id": 1, + "poly": [ + 294, + 229, + 1403, + 229, + 1403, + 294, + 294, + 294 + ], + "score": 0.873 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 864, + 2088, + 864, + 2113, + 835, + 2113 + ], + "score": 0.835 + }, + { + "category_id": 1, + "poly": [ + 298, + 312, + 1407, + 312, + 1407, + 435, + 298, + 435 + ], + "score": 0.821 + }, + { + "category_id": 1, + "poly": [ + 297, + 766, + 1403, + 766, + 1403, + 830, + 297, + 830 + ], + "score": 0.809 + }, + { + "category_id": 1, + "poly": [ + 298, + 683, + 1401, + 683, + 1401, + 747, + 298, + 747 + ], + "score": 0.793 + }, + { + "category_id": 1, + "poly": [ + 298, + 456, + 1407, + 456, + 1407, + 581, + 298, + 581 + ], + "score": 0.777 + }, + { + "category_id": 1, + "poly": [ + 294, + 599, + 1404, + 599, + 1404, + 664, + 294, + 664 + ], + "score": 0.761 + }, + { + "category_id": 1, + "poly": [ + 299, + 849, + 1402, + 849, + 1402, + 913, + 299, + 913 + ], + "score": 0.708 + }, + { + "category_id": 1, + "poly": [ + 297, + 932, + 1404, + 932, + 1404, + 995, + 297, + 995 + ], + "score": 0.69 + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 1406.0, + 227.0, + 1406.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 260.0, + 1225.0, + 260.0, + 1225.0, + 296.0, + 321.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 312.0, + 1408.0, + 312.0, + 1408.0, + 347.0, + 292.0, + 347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 346.0, + 1407.0, + 346.0, + 1407.0, + 378.0, + 322.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 374.0, + 1407.0, + 374.0, + 1407.0, + 410.0, + 322.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 407.0, + 630.0, + 407.0, + 630.0, + 436.0, + 325.0, + 436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 766.0, + 1404.0, + 766.0, + 1404.0, + 802.0, + 295.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 797.0, + 793.0, + 797.0, + 793.0, + 830.0, + 324.0, + 830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 682.0, + 1403.0, + 682.0, + 1403.0, + 720.0, + 293.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 715.0, + 1061.0, + 715.0, + 1061.0, + 747.0, + 324.0, + 747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 454.0, + 1409.0, + 454.0, + 1409.0, + 493.0, + 292.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 488.0, + 1409.0, + 488.0, + 1409.0, + 521.0, + 322.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 518.0, + 1412.0, + 518.0, + 1412.0, + 555.0, + 322.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 550.0, + 917.0, + 550.0, + 917.0, + 583.0, + 325.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 601.0, + 1402.0, + 601.0, + 1402.0, + 637.0, + 294.0, + 637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 632.0, + 1134.0, + 632.0, + 1134.0, + 665.0, + 322.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 849.0, + 1406.0, + 849.0, + 1406.0, + 885.0, + 295.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 880.0, + 1408.0, + 880.0, + 1408.0, + 916.0, + 324.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 934.0, + 1404.0, + 934.0, + 1404.0, + 966.0, + 296.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 962.0, + 1296.0, + 962.0, + 1296.0, + 997.0, + 322.0, + 997.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 788, + 1405, + 788, + 1405, + 1035, + 297, + 1035 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1049, + 1404, + 1049, + 1404, + 1234, + 297, + 1234 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 367, + 1696, + 825, + 1696, + 825, + 1910, + 367, + 1910 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 300, + 1942, + 1405, + 1942, + 1405, + 2035, + 300, + 2035 + ], + "score": 0.962 + }, + { + "category_id": 1, + "poly": [ + 369, + 1371, + 774, + 1371, + 774, + 1496, + 369, + 1496 + ], + "score": 0.962 + }, + { + "category_id": 1, + "poly": [ + 300, + 1249, + 1404, + 1249, + 1404, + 1342, + 300, + 1342 + ], + "score": 0.961 + }, + { + "category_id": 3, + "poly": [ + 463, + 219, + 1236, + 219, + 1236, + 422, + 463, + 422 + ], + "score": 0.958 + }, + { + "category_id": 1, + "poly": [ + 294, + 1527, + 1403, + 1527, + 1403, + 1589, + 294, + 1589 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 291, + 1603, + 1402, + 1603, + 1402, + 1668, + 291, + 1668 + ], + "score": 0.937 + }, + { + "category_id": 4, + "poly": [ + 295, + 444, + 1407, + 444, + 1407, + 599, + 295, + 599 + ], + "score": 0.923 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 854, + 75, + 854, + 105, + 297, + 105 + ], + "score": 0.901 + }, + { + "category_id": 0, + "poly": [ + 300, + 730, + 540, + 730, + 540, + 763, + 300, + 763 + ], + "score": 0.885 + }, + { + "category_id": 0, + "poly": [ + 303, + 658, + 754, + 658, + 754, + 694, + 303, + 694 + ], + "score": 0.875 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 863, + 2088, + 863, + 2113, + 835, + 2113 + ], + "score": 0.849 + }, + { + "category_id": 13, + "poly": [ + 1238, + 447, + 1267, + 447, + 1267, + 473, + 1238, + 473 + ], + "score": 0.77, + "latex": "X" + }, + { + "category_id": 13, + "poly": [ + 711, + 507, + 789, + 507, + 789, + 537, + 711, + 537 + ], + "score": 0.31, + "latex": "\\mathrm { Q u A R }" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 252.0, + 778.0, + 252.0, + 778.0, + 294.0, + 692.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 802.0, + 245.0, + 818.0, + 245.0, + 818.0, + 322.0, + 802.0, + 322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 251.0, + 951.0, + 251.0, + 951.0, + 293.0, + 832.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 255.0, + 1091.0, + 255.0, + 1091.0, + 291.0, + 1007.0, + 291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1130.0, + 258.0, + 1137.0, + 258.0, + 1137.0, + 267.0, + 1130.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 262.0, + 583.0, + 262.0, + 583.0, + 279.0, + 568.0, + 279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1196.0, + 263.0, + 1218.0, + 263.0, + 1218.0, + 286.0, + 1196.0, + 286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 276.0, + 1137.0, + 276.0, + 1137.0, + 306.0, + 1127.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 623.0, + 326.0, + 693.0, + 326.0, + 693.0, + 359.0, + 623.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 324.0, + 841.0, + 324.0, + 841.0, + 360.0, + 778.0, + 360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 898.0, + 329.0, + 921.0, + 329.0, + 921.0, + 357.0, + 898.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 486.0, + 377.0, + 511.0, + 377.0, + 511.0, + 403.0, + 486.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.0, + 372.0, + 645.0, + 372.0, + 645.0, + 410.0, + 589.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1132.25, + 284.5, + 1178.25, + 284.5, + 1178.25, + 315.5, + 1132.25, + 315.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 444.0, + 1237.0, + 444.0, + 1237.0, + 479.0, + 294.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 444.0, + 1405.0, + 444.0, + 1405.0, + 479.0, + 1268.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 476.0, + 1404.0, + 476.0, + 1404.0, + 510.0, + 296.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 503.0, + 710.0, + 503.0, + 710.0, + 540.0, + 294.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 503.0, + 1405.0, + 503.0, + 1405.0, + 540.0, + 790.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 537.0, + 1404.0, + 537.0, + 1404.0, + 571.0, + 297.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 568.0, + 1380.0, + 568.0, + 1380.0, + 601.0, + 297.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 726.0, + 545.0, + 726.0, + 545.0, + 767.0, + 294.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 655.0, + 758.0, + 655.0, + 758.0, + 701.0, + 294.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2123.0, + 831.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 789.0, + 1406.0, + 789.0, + 1406.0, + 826.0, + 294.0, + 826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 820.0, + 1408.0, + 820.0, + 1408.0, + 857.0, + 292.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 850.0, + 1406.0, + 850.0, + 1406.0, + 886.0, + 294.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 880.0, + 1408.0, + 880.0, + 1408.0, + 918.0, + 292.0, + 918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 910.0, + 1406.0, + 910.0, + 1406.0, + 948.0, + 292.0, + 948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 940.0, + 1405.0, + 940.0, + 1405.0, + 978.0, + 295.0, + 978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 972.0, + 1406.0, + 972.0, + 1406.0, + 1007.0, + 294.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1003.0, + 838.0, + 1003.0, + 838.0, + 1037.0, + 294.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1049.0, + 1406.0, + 1049.0, + 1406.0, + 1086.0, + 294.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1079.0, + 1406.0, + 1079.0, + 1406.0, + 1115.0, + 295.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1107.0, + 1408.0, + 1107.0, + 1408.0, + 1145.0, + 294.0, + 1145.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1140.0, + 1405.0, + 1140.0, + 1405.0, + 1176.0, + 295.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1172.0, + 1402.0, + 1172.0, + 1402.0, + 1204.0, + 295.0, + 1204.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1203.0, + 511.0, + 1203.0, + 511.0, + 1233.0, + 293.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1697.0, + 718.0, + 1697.0, + 718.0, + 1730.0, + 369.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 1741.0, + 718.0, + 1741.0, + 718.0, + 1778.0, + 368.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 1787.0, + 826.0, + 1787.0, + 826.0, + 1821.0, + 370.0, + 1821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 1830.0, + 755.0, + 1830.0, + 755.0, + 1867.0, + 368.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 1878.0, + 772.0, + 1878.0, + 772.0, + 1912.0, + 370.0, + 1912.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1940.0, + 1407.0, + 1940.0, + 1407.0, + 1976.0, + 294.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1972.0, + 1406.0, + 1972.0, + 1406.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2003.0, + 672.0, + 2003.0, + 672.0, + 2037.0, + 295.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 1372.0, + 743.0, + 1372.0, + 743.0, + 1405.0, + 368.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 1418.0, + 771.0, + 1418.0, + 771.0, + 1451.0, + 370.0, + 1451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 1462.0, + 773.0, + 1462.0, + 773.0, + 1497.0, + 370.0, + 1497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1248.0, + 1404.0, + 1248.0, + 1404.0, + 1282.0, + 295.0, + 1282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1280.0, + 1404.0, + 1280.0, + 1404.0, + 1314.0, + 295.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1310.0, + 510.0, + 1310.0, + 510.0, + 1345.0, + 295.0, + 1345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1526.0, + 1406.0, + 1526.0, + 1406.0, + 1562.0, + 294.0, + 1562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1557.0, + 938.0, + 1557.0, + 938.0, + 1591.0, + 293.0, + 1591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1605.0, + 1403.0, + 1605.0, + 1403.0, + 1637.0, + 297.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1636.0, + 1178.0, + 1636.0, + 1178.0, + 1670.0, + 294.0, + 1670.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 432, + 1406, + 432, + 1406, + 648, + 298, + 648 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1034, + 1404, + 1034, + 1404, + 1218, + 298, + 1218 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 300, + 1880, + 1402, + 1880, + 1402, + 2034, + 300, + 2034 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 896, + 1403, + 896, + 1403, + 1019, + 299, + 1019 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 758, + 1404, + 758, + 1404, + 880, + 298, + 880 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 299, + 1233, + 1404, + 1233, + 1404, + 1364, + 299, + 1364 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 1377, + 1404, + 1377, + 1404, + 1501, + 298, + 1501 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1403, + 229, + 1403, + 324, + 299, + 324 + ], + "score": 0.962 + }, + { + "category_id": 1, + "poly": [ + 301, + 1773, + 1401, + 1773, + 1401, + 1865, + 301, + 1865 + ], + "score": 0.961 + }, + { + "category_id": 1, + "poly": [ + 299, + 1516, + 1401, + 1516, + 1401, + 1579, + 299, + 1579 + ], + "score": 0.949 + }, + { + "category_id": 0, + "poly": [ + 300, + 696, + 529, + 696, + 529, + 728, + 300, + 728 + ], + "score": 0.902 + }, + { + "category_id": 0, + "poly": [ + 301, + 372, + 570, + 372, + 570, + 403, + 301, + 403 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 104, + 298, + 104 + ], + "score": 0.892 + }, + { + "category_id": 0, + "poly": [ + 300, + 1710, + 539, + 1710, + 539, + 1742, + 300, + 1742 + ], + "score": 0.891 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2112, + 836, + 2112 + ], + "score": 0.838 + }, + { + "category_id": 0, + "poly": [ + 302, + 1634, + 719, + 1634, + 719, + 1670, + 302, + 1670 + ], + "score": 0.799 + }, + { + "category_id": 1, + "poly": [ + 302, + 1634, + 719, + 1634, + 719, + 1670, + 302, + 1670 + ], + "score": 0.097 + }, + { + "category_id": 13, + "poly": [ + 942, + 1296, + 1222, + 1296, + 1222, + 1336, + 942, + 1336 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { v _ { i } = 1 + 1 / T \\sum _ { t = 0 } ^ { T - 1 } z _ { i , t } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 790, + 1296, + 902, + 1296, + 902, + 1335, + 790, + 1335 + ], + "score": 0.92, + "latex": "\\{ z _ { i , t } \\} _ { t = 0 } ^ { T - 1 }" + }, + { + "category_id": 13, + "poly": [ + 988, + 494, + 1137, + 494, + 1137, + 528, + 988, + 528 + ], + "score": 0.9, + "latex": "\\mathrm { C D F } \\in [ 0 , 1 ]" + }, + { + "category_id": 13, + "poly": [ + 462, + 820, + 517, + 820, + 517, + 849, + 462, + 849 + ], + "score": 0.9, + "latex": "72 \\%" + }, + { + "category_id": 13, + "poly": [ + 326, + 1912, + 382, + 1912, + 382, + 1941, + 326, + 1941 + ], + "score": 0.88, + "latex": "72 \\%" + }, + { + "category_id": 13, + "poly": [ + 691, + 1912, + 745, + 1912, + 745, + 1941, + 691, + 1941 + ], + "score": 0.87, + "latex": "10 \\%" + }, + { + "category_id": 13, + "poly": [ + 925, + 820, + 979, + 820, + 979, + 848, + 925, + 848 + ], + "score": 0.87, + "latex": "18 \\%" + }, + { + "category_id": 13, + "poly": [ + 455, + 1912, + 509, + 1912, + 509, + 1941, + 455, + 1941 + ], + "score": 0.86, + "latex": "18 \\%" + }, + { + "category_id": 13, + "poly": [ + 1349, + 820, + 1403, + 820, + 1403, + 848, + 1349, + 848 + ], + "score": 0.84, + "latex": "10 \\%" + }, + { + "category_id": 13, + "poly": [ + 844, + 1334, + 953, + 1334, + 953, + 1365, + 844, + 1365 + ], + "score": 0.66, + "latex": "( k , \\theta * v _ { i } )" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 693.0, + 532.0, + 693.0, + 532.0, + 733.0, + 294.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 369.0, + 574.0, + 369.0, + 574.0, + 408.0, + 295.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 857.0, + 72.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1709.0, + 541.0, + 1709.0, + 541.0, + 1746.0, + 294.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2084.0, + 868.0, + 2084.0, + 868.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1631.0, + 724.0, + 1631.0, + 724.0, + 1677.0, + 292.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 433.0, + 1408.0, + 433.0, + 1408.0, + 467.0, + 295.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 462.0, + 1406.0, + 462.0, + 1406.0, + 498.0, + 293.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 494.0, + 987.0, + 494.0, + 987.0, + 528.0, + 292.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1138.0, + 494.0, + 1404.0, + 494.0, + 1404.0, + 528.0, + 1138.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 524.0, + 1404.0, + 524.0, + 1404.0, + 560.0, + 293.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 555.0, + 1404.0, + 555.0, + 1404.0, + 589.0, + 295.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 587.0, + 1407.0, + 587.0, + 1407.0, + 621.0, + 293.0, + 621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 615.0, + 424.0, + 615.0, + 424.0, + 650.0, + 294.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1036.0, + 1404.0, + 1036.0, + 1404.0, + 1068.0, + 296.0, + 1068.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1066.0, + 1402.0, + 1066.0, + 1402.0, + 1098.0, + 296.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1096.0, + 1405.0, + 1096.0, + 1405.0, + 1131.0, + 294.0, + 1131.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1126.0, + 1402.0, + 1126.0, + 1402.0, + 1162.0, + 294.0, + 1162.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1155.0, + 1406.0, + 1155.0, + 1406.0, + 1193.0, + 293.0, + 1193.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1185.0, + 557.0, + 1185.0, + 557.0, + 1221.0, + 293.0, + 1221.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1882.0, + 1404.0, + 1882.0, + 1404.0, + 1915.0, + 296.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1912.0, + 325.0, + 1912.0, + 325.0, + 1945.0, + 295.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 1912.0, + 454.0, + 1912.0, + 454.0, + 1945.0, + 383.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 1912.0, + 690.0, + 1912.0, + 690.0, + 1945.0, + 510.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1912.0, + 1404.0, + 1912.0, + 1404.0, + 1945.0, + 746.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1942.0, + 1406.0, + 1942.0, + 1406.0, + 1977.0, + 293.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1968.0, + 1404.0, + 1968.0, + 1404.0, + 2011.0, + 294.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1999.0, + 1402.0, + 1999.0, + 1402.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 895.0, + 1407.0, + 895.0, + 1407.0, + 932.0, + 293.0, + 932.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 928.0, + 1405.0, + 928.0, + 1405.0, + 961.0, + 294.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 957.0, + 1404.0, + 957.0, + 1404.0, + 995.0, + 292.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 987.0, + 382.0, + 987.0, + 382.0, + 1021.0, + 293.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 759.0, + 1406.0, + 759.0, + 1406.0, + 791.0, + 294.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 788.0, + 1408.0, + 788.0, + 1408.0, + 822.0, + 292.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 820.0, + 461.0, + 820.0, + 461.0, + 853.0, + 294.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 518.0, + 820.0, + 924.0, + 820.0, + 924.0, + 853.0, + 518.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 820.0, + 1348.0, + 820.0, + 1348.0, + 853.0, + 980.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1404.0, + 820.0, + 1408.0, + 820.0, + 1408.0, + 853.0, + 1404.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 853.0, + 496.0, + 853.0, + 496.0, + 880.0, + 293.0, + 880.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1230.0, + 1409.0, + 1230.0, + 1409.0, + 1270.0, + 293.0, + 1270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 1265.0, + 789.0, + 1265.0, + 789.0, + 1354.0, + 284.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 1265.0, + 941.0, + 1265.0, + 941.0, + 1354.0, + 903.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 1265.0, + 1419.0, + 1265.0, + 1419.0, + 1354.0, + 1223.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1332.0, + 843.0, + 1332.0, + 843.0, + 1366.0, + 295.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1332.0, + 967.0, + 1332.0, + 967.0, + 1366.0, + 954.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1376.0, + 1405.0, + 1376.0, + 1405.0, + 1413.0, + 292.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1407.0, + 1405.0, + 1407.0, + 1405.0, + 1445.0, + 293.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1438.0, + 1409.0, + 1438.0, + 1409.0, + 1477.0, + 292.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1471.0, + 728.0, + 1471.0, + 728.0, + 1503.0, + 293.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 229.0, + 1407.0, + 229.0, + 1407.0, + 267.0, + 294.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 258.0, + 1404.0, + 258.0, + 1404.0, + 298.0, + 293.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 291.0, + 731.0, + 291.0, + 731.0, + 329.0, + 294.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1770.0, + 1406.0, + 1770.0, + 1406.0, + 1811.0, + 292.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1805.0, + 1404.0, + 1805.0, + 1404.0, + 1838.0, + 295.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1833.0, + 798.0, + 1833.0, + 798.0, + 1869.0, + 296.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1513.0, + 1405.0, + 1513.0, + 1405.0, + 1553.0, + 294.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1548.0, + 769.0, + 1548.0, + 769.0, + 1579.0, + 297.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1631.0, + 724.0, + 1631.0, + 724.0, + 1677.0, + 292.0, + 1677.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 6, + "poly": [ + 296, + 413, + 1406, + 413, + 1406, + 508, + 296, + 508 + ], + "score": 0.964 + }, + { + "category_id": 5, + "poly": [ + 222, + 515, + 1491, + 515, + 1491, + 1842, + 222, + 1842 + ], + "score": 0.954, + "html": "
bostonHousingconcrete
PICPMSECalibPICPMSECalib
ConditionalFlow0.93 ± 0.040.13 ± 0.060.060.92 ± 0.030.09 ±0.030.01
ConditionalGaussian0.93 ± 0.030.14±0.070.130.91 ± 0.020.09 ±0.030.06
BayesianRidgeRegression0.95 ± 0.030.28±0.080.340.95 ± 0.030.40±0.070.01
MC Dropout0.50 ± 0.080.11 ± 0.052.990.69 ± 0.050.07±0.030.89
SQR0.73 ± 0.080.11 ± 0.050.480.74± 0.040.07± 0.030.47
ConditionalQuantile0.92 ± 0.05N.A.N.A.0.93 ± 0.03N.A.N.A.
QualityDriven0.83 ± 0.06N.A.N.A.0.83± 0.04N.A.N.A.
LightGBM0.04±0.030.12 ± 0.067.740.63±0.070.07±0.021.25
energykin8nm
PICPMSECalibPICPMSECalib
ConditionalFlow0.96 ± 0.020.0022 ± 0.00060.120.952 ± 0.0060.081 ± 0.0130.01
ConditionalGaussian0.97 ± 0.030.0030± 0.00090.260.947 ± 0.0070.071 ± 0.005<0.01
BayesianRidgeRegression0.89 ± 0.040.09 ±0.020.240.951 ± 0.0070.59 ± 0.020.09
MC Dropout0.97± 0.020.0026 ± 0.00100.170.69 ± 0.020.069 ± 0.0051.14
SQR0.97± 0.020.0028 ± 0.00120.370.892 ± 0.0100.072 ± 0.0050.01
ConditionalQuantile0.98 ±0.02N.A.N.A.0.943 ± 0.011N.A.N.A.
QualityDriven0.96 ± 0.04N.A.N.A.0.88±0.02N.A.N.A.
LightGBM0.24±0.050.0013 ± 0.00065.180.205 ± 0.0100.190 ± 0.0115.59
naval-propulsion-plantpower-plant
PICPMSECalibPICPMSECalib
ConditionalFlow0.98 ± 0.030.009 ±0.0040.450.952 ± 0.0070.048 ±0.0070.01
ConditionalGaussian0.9995 ± 0.00070.012 ± 0.0062.350.947 ± 0.0100.048 ±0.006<0.01
BayesianRidgeRegression1.0 ±0.00.055 ± 0.0048.030.964 ± 0.0070.072 ± 0.0070.01
MC Dropout0.98 ±0.020.005±0.0020.510.59 ±0.020.046±0.0071.88
SQR0.998 ± 0.0020.0052 ± 0.00121.440.93 ± 0.020.048 ±0.0070.02
ConditionalQuantile0.97±0.02N.A.N.A.0.937 ± 0.014N.A.N.A.
QualityDriven0.949 ± 0.010N.A.N.A.0.89 ±0.02N.A.N.A.
LightGBM0.714 ± 0.0110.0056 ± 0.00090.790.17 ± 0.020.035 ± 0.0075.95
wine-quality-redyacht
PICPMSECalibPICPMSECalib
ConditionalFlow0.90 ±0.020.6±0.20.040.95 ± 0.040.004±0.0030.27
ConditionalGaussian0.95 ± 0.020.59 ± 0.090.220.99 ±0.020.004±0.0020.62
BayesianRidgeRegression0.95 ± 0.020.63 ± 0.110.050.94± 0.030.35 ± 0.100.25
MC Dropout0.35 ± 0.040.57 ±0.094.010.97 ± 0.040.004±0.0020.21
SQR0.81±0.090.59 ±0.100.150.96 ±0.040.004±0.0040.49
ConditionalQuantile0.95 ± 0.02N.A.N.A.0.99 ± 0.02N.A.N.A.
QualityDriven0.84 ±0.03N.A.N.A.0.97 ± 0.04N.A.N.A.
LightGBM0.40 ± 0.050.55± 0.102.930.45 ± 0.080.003±0.0033.04
" + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 854, + 75, + 854, + 105, + 297, + 105 + ], + "score": 0.889 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 864, + 2088, + 864, + 2113, + 835, + 2113 + ], + "score": 0.855 + }, + { + "category_id": 15, + "poly": [ + 293.0, + 413.0, + 1406.0, + 413.0, + 1406.0, + 451.0, + 293.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 445.0, + 1406.0, + 445.0, + 1406.0, + 480.0, + 294.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 476.0, + 1348.0, + 476.0, + 1348.0, + 510.0, + 295.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2123.0, + 831.0, + 2123.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 14, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 244, + 280, + 1448, + 280, + 1448, + 607, + 244, + 607 + ], + "score": 0.982, + "html": "
BayesianRidgeRegressionConditionalGaussianConditionalFlow
BeforeFlowIsoBeforeFlowIsoBeforeFlowIso
bostonHousing0.340.020.020.130.040.020.060.020.01
concrete0.010.010.010.060.020.020.010.020.03
energy0.240.020.010.26<0.010.010.120.010.01
kin8nm0.090.01<0.01<0.01<0.01<0.010.01<0.01<0.01
naval-propulsion-plant8.030.01<0.012.35<0.01<0.010.45<0.01<0.01
power-plant0.01<0.01<0.01<0.01<0.01<0.010.01<0.01<0.01
wine-quality-red0.050.02<0.010.220.040.020.040.010.01
yacht0.250.050.070.620.030.030.270.020.03
" + }, + { + "category_id": 1, + "poly": [ + 299, + 1811, + 1404, + 1811, + 1404, + 1905, + 299, + 1905 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 1703, + 1406, + 1703, + 1406, + 1797, + 299, + 1797 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 297, + 1486, + 1406, + 1486, + 1406, + 1610, + 297, + 1610 + ], + "score": 0.966 + }, + { + "category_id": 6, + "poly": [ + 299, + 636, + 1401, + 636, + 1401, + 699, + 299, + 699 + ], + "score": 0.933 + }, + { + "category_id": 6, + "poly": [ + 428, + 224, + 1265, + 224, + 1265, + 257, + 428, + 257 + ], + "score": 0.916 + }, + { + "category_id": 0, + "poly": [ + 299, + 1647, + 570, + 1647, + 570, + 1679, + 299, + 1679 + ], + "score": 0.896 + }, + { + "category_id": 5, + "poly": [ + 297, + 723, + 1413, + 723, + 1413, + 1433, + 297, + 1433 + ], + "score": 0.875, + "html": "
BayesianRidgeRegressionConditionalGaussian
BeforeFlowBeforeFlow
bostonHousing0.28 ±0.080.28 ±0.080.14 ± 0.070.14 ± 0.07
concrete0.40 ± 0.070.40 ± 0.070.09 ±0.030.09 ± 0.03
energy0.09 ±0.020.09 ±0.020.0030 ±0.00090.0032 ± 0.0011
kin8nm0.59 ± 0.020.59 ± 0.020.071 ± 0.0050.072 ± 0.005
naval-propulsion-plant0.055 ± 0.0040.48 ±0.020.012 ± 0.0060.012 ± 0.007
power-plant0.072 ± 0.0070.072 ± 0.0070.048 ± 0.0060.049 ± 0.006
wine-quality-red0.63 ± 0.110.63 ± 0.110.59 ± 0.090.59 ± 0.10
yacht0.35 ± 0.100.36 ± 0.100.004 ±0.0020.004 ± 0.003
ConditionalFlow
BeforeFlow
bostonHousing0.13 ± 0.06
concrete0.09 ± 0.030.13 ± 0.06 0.09 ± 0.03
0.0022 ± 0.00060.0027 ± 0.0007
energy kin8nm0.081 ± 0.0130.081 ± 0.013
naval-propulsion-plant0.009 ± 0.0040.016 ± 0.012
power-plant0.048 ± 0.0070.048 ± 0.007
wine-quality-red0.6± 0.20.64 ± 0.15
yacht
0.004 ± 0.0030.008 ± 0.012
" + }, + { + "category_id": 2, + "poly": [ + 836, + 2089, + 864, + 2089, + 864, + 2112, + 836, + 2112 + ], + "score": 0.851 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 854, + 75, + 854, + 105, + 297, + 105 + ], + "score": 0.828 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 854, + 75, + 854, + 105, + 297, + 105 + ], + "score": 0.124 + }, + { + "category_id": 15, + "poly": [ + 297.0, + 636.0, + 1402.0, + 636.0, + 1402.0, + 667.0, + 297.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 666.0, + 1266.0, + 666.0, + 1266.0, + 702.0, + 294.0, + 702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 429.0, + 223.0, + 1269.0, + 223.0, + 1269.0, + 258.0, + 429.0, + 258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1645.0, + 572.0, + 1645.0, + 572.0, + 1682.0, + 294.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1808.0, + 1404.0, + 1808.0, + 1404.0, + 1850.0, + 293.0, + 1850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1841.0, + 1404.0, + 1841.0, + 1404.0, + 1877.0, + 294.0, + 1877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1871.0, + 944.0, + 1871.0, + 944.0, + 1909.0, + 294.0, + 1909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1701.0, + 1408.0, + 1701.0, + 1408.0, + 1740.0, + 293.0, + 1740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1734.0, + 1406.0, + 1734.0, + 1406.0, + 1768.0, + 296.0, + 1768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1765.0, + 1245.0, + 1765.0, + 1245.0, + 1802.0, + 294.0, + 1802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1486.0, + 1403.0, + 1486.0, + 1403.0, + 1519.0, + 295.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1516.0, + 1406.0, + 1516.0, + 1406.0, + 1553.0, + 292.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1549.0, + 1406.0, + 1549.0, + 1406.0, + 1582.0, + 295.0, + 1582.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1577.0, + 1290.0, + 1577.0, + 1290.0, + 1613.0, + 292.0, + 1613.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 15, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/QkVi6KogNbu/images/0251c2a07a7ad71736197a172db6653412920a14d1f00de56c464b9b8ecb03b8.jpg b/parse/train/QkVi6KogNbu/images/0251c2a07a7ad71736197a172db6653412920a14d1f00de56c464b9b8ecb03b8.jpg new file mode 100644 index 0000000000000000000000000000000000000000..329c7ecf52756f3c27eed8bbe1f6156df4332dfc --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/0251c2a07a7ad71736197a172db6653412920a14d1f00de56c464b9b8ecb03b8.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:921f01606f90c6ea2b8740db753d7f9e09d1913851762eefdc0c804b2e598d59 +size 7745 diff --git a/parse/train/QkVi6KogNbu/images/03921b9dd6349d37713859ff54d092826276d5c9575d54510229cf85a06c6be2.jpg b/parse/train/QkVi6KogNbu/images/03921b9dd6349d37713859ff54d092826276d5c9575d54510229cf85a06c6be2.jpg new file mode 100644 index 0000000000000000000000000000000000000000..9acf8c43dc3a898e7838a45e8289b7f356fccadf --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/03921b9dd6349d37713859ff54d092826276d5c9575d54510229cf85a06c6be2.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f9af8bc3044fb06ec1a6997d22450ff545c3b6cd5fc3099a5c8790e898ce8a11 +size 10875 diff --git a/parse/train/QkVi6KogNbu/images/03efa6c3f111e8247d7b67f22c489518c91985f0149818caf10f682310218164.jpg b/parse/train/QkVi6KogNbu/images/03efa6c3f111e8247d7b67f22c489518c91985f0149818caf10f682310218164.jpg new file mode 100644 index 0000000000000000000000000000000000000000..e6aa520381647b868050cc4497b687590ffadb2b --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/03efa6c3f111e8247d7b67f22c489518c91985f0149818caf10f682310218164.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:267f364e06456ca88e39cec212d571b32b1bf032dd3565a9a7bfef7dcfc40817 +size 2226 diff --git a/parse/train/QkVi6KogNbu/images/06b0a1b22fca426c54b432dbd8fc4cddc60b27567240261a49ced1b4868e2456.jpg b/parse/train/QkVi6KogNbu/images/06b0a1b22fca426c54b432dbd8fc4cddc60b27567240261a49ced1b4868e2456.jpg new file mode 100644 index 0000000000000000000000000000000000000000..e0ba2a4e6d27437559925e86036f2c6489df1b6c --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/06b0a1b22fca426c54b432dbd8fc4cddc60b27567240261a49ced1b4868e2456.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:bea4150d58fb00856971d55a4933d974d20627055849889cb94d461262104168 +size 5244 diff --git a/parse/train/QkVi6KogNbu/images/086a71817bf3685fd8243bead94dd3cce6ac729ee50fd499e312bea7a0ef8b7c.jpg b/parse/train/QkVi6KogNbu/images/086a71817bf3685fd8243bead94dd3cce6ac729ee50fd499e312bea7a0ef8b7c.jpg new file mode 100644 index 0000000000000000000000000000000000000000..0f7945cb6f8233d7d7e22cb968c280851f2c277e --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/086a71817bf3685fd8243bead94dd3cce6ac729ee50fd499e312bea7a0ef8b7c.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3472c0c0b01eab83e63d4920e411b403688faaef27821af45b28abc8f2c017dc +size 9604 diff --git a/parse/train/QkVi6KogNbu/images/0fa6ad236fe1b1048c7c5538ffda7f9cf67889dedc7bdb731cab5ff834208c22.jpg b/parse/train/QkVi6KogNbu/images/0fa6ad236fe1b1048c7c5538ffda7f9cf67889dedc7bdb731cab5ff834208c22.jpg new file mode 100644 index 0000000000000000000000000000000000000000..47e36487a701210eb370a5faff6e5930eb095ef2 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/0fa6ad236fe1b1048c7c5538ffda7f9cf67889dedc7bdb731cab5ff834208c22.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7b3fac765ab5a8bc808334b24b2412446dddb9e2a25664ab0535aef16e6e8403 +size 3821 diff --git a/parse/train/QkVi6KogNbu/images/0fe538b8ad359f0f62044870266f7a763ad9d29d26728ba5aef7248381cba2aa.jpg b/parse/train/QkVi6KogNbu/images/0fe538b8ad359f0f62044870266f7a763ad9d29d26728ba5aef7248381cba2aa.jpg new file mode 100644 index 0000000000000000000000000000000000000000..62c18ba92fe303359919952d48dba3760e62ab68 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/0fe538b8ad359f0f62044870266f7a763ad9d29d26728ba5aef7248381cba2aa.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:82836659a7ddf449f2c73e8d773032425f551c6332d1daa953216a0f52088737 +size 3486 diff --git a/parse/train/QkVi6KogNbu/images/1152d95a2950f97d42bd0610654c076a3997e86cf9b2bd86469fd3b98364f1df.jpg b/parse/train/QkVi6KogNbu/images/1152d95a2950f97d42bd0610654c076a3997e86cf9b2bd86469fd3b98364f1df.jpg new file mode 100644 index 0000000000000000000000000000000000000000..b1e9dc3656aa233768484af1eb875fbc8c95591b --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/1152d95a2950f97d42bd0610654c076a3997e86cf9b2bd86469fd3b98364f1df.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ba0fd88d6577d3b25e4f409788f696ff9da8a7cfb0a6d529f88d2124fd3a4ca9 +size 55554 diff --git a/parse/train/QkVi6KogNbu/images/2444b2d01624a227cfbe0331228816eac647aa8d1b44563bf566c6be993a95ff.jpg b/parse/train/QkVi6KogNbu/images/2444b2d01624a227cfbe0331228816eac647aa8d1b44563bf566c6be993a95ff.jpg new file mode 100644 index 0000000000000000000000000000000000000000..930aa45ba335dcb279e0453c859fd0c114ad57dd --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/2444b2d01624a227cfbe0331228816eac647aa8d1b44563bf566c6be993a95ff.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a5e9d3704c87ec0e1e1b35e7a8b4d141543ad448d9d4dec612b40bc970ac46bd +size 5141 diff --git a/parse/train/QkVi6KogNbu/images/24fb140af7f5ca8d00afb653bff55f2849d59d995cef5489ffa9e6ef6602b0a1.jpg b/parse/train/QkVi6KogNbu/images/24fb140af7f5ca8d00afb653bff55f2849d59d995cef5489ffa9e6ef6602b0a1.jpg new file mode 100644 index 0000000000000000000000000000000000000000..09487919f4e1ec6f2fe27fa2900e40c0191fdc34 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/24fb140af7f5ca8d00afb653bff55f2849d59d995cef5489ffa9e6ef6602b0a1.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:60185d0b75e106c68a3325d702824b7a21c3049d51b61a14c67d5ad9ea98f5df +size 5316 diff --git a/parse/train/QkVi6KogNbu/images/28ddab8ce7208563fe29e41882daa8db5aebaa98a5303bc57351cccf4bc44f92.jpg b/parse/train/QkVi6KogNbu/images/28ddab8ce7208563fe29e41882daa8db5aebaa98a5303bc57351cccf4bc44f92.jpg new file mode 100644 index 0000000000000000000000000000000000000000..29de0b68d4e3234cf4e4b5a33cc05cfeb819f1dc --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/28ddab8ce7208563fe29e41882daa8db5aebaa98a5303bc57351cccf4bc44f92.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:700371658a8acf8e6cd6a70336a5d2b49af1d5b9e22e1576f916ed225340c012 +size 3762 diff --git a/parse/train/QkVi6KogNbu/images/28e52601e44ca37be4ee057f54febdfdd3b5f5c15b718de3a0dbe5d9a315ad09.jpg b/parse/train/QkVi6KogNbu/images/28e52601e44ca37be4ee057f54febdfdd3b5f5c15b718de3a0dbe5d9a315ad09.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f9ca8d23f96a14f6b42d6119e773d7348312beb4 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/28e52601e44ca37be4ee057f54febdfdd3b5f5c15b718de3a0dbe5d9a315ad09.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:58fea7bab58705a452bdf7f9735e3ae1198b86f8f9254b6644ebf758110de782 +size 4929 diff --git a/parse/train/QkVi6KogNbu/images/2d7f49d83ef9d9c3449d7d5c5bdcd05a1cd059f2e584fa8f3153560a55ccf24c.jpg b/parse/train/QkVi6KogNbu/images/2d7f49d83ef9d9c3449d7d5c5bdcd05a1cd059f2e584fa8f3153560a55ccf24c.jpg new file mode 100644 index 0000000000000000000000000000000000000000..7c2bb0d319b0052a17f6c9fd806b8b530c91f465 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/2d7f49d83ef9d9c3449d7d5c5bdcd05a1cd059f2e584fa8f3153560a55ccf24c.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2952dd3d3475018fd0bf3544058317452fb0ad137eac4cc266463acf22af3d54 +size 10919 diff --git a/parse/train/QkVi6KogNbu/images/301d917cb6cccff33f2330bf15069d3a5a29b8ef9144d63eb5db96775bdbd1be.jpg b/parse/train/QkVi6KogNbu/images/301d917cb6cccff33f2330bf15069d3a5a29b8ef9144d63eb5db96775bdbd1be.jpg new file mode 100644 index 0000000000000000000000000000000000000000..a1c18dd775ff0181f3960a4a8a279a90e847a7d4 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/301d917cb6cccff33f2330bf15069d3a5a29b8ef9144d63eb5db96775bdbd1be.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:024adbc7f34eaeaed2f47901bbcc0faa69d1d0e47989053b2ac44ec84e6237c0 +size 2054 diff --git a/parse/train/QkVi6KogNbu/images/34aec5f48f486f80c7e304e4b9e196a16bea4db2280a4c343218ad7df667c662.jpg b/parse/train/QkVi6KogNbu/images/34aec5f48f486f80c7e304e4b9e196a16bea4db2280a4c343218ad7df667c662.jpg new file mode 100644 index 0000000000000000000000000000000000000000..a591bd897c3ca71a73cb25235db8181e9339c67e --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/34aec5f48f486f80c7e304e4b9e196a16bea4db2280a4c343218ad7df667c662.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:251f315b46c1f16d19c594c971e120ecc948f350046f3df56e43a994d16c13b7 +size 10658 diff --git a/parse/train/QkVi6KogNbu/images/3ed6cf313b682b0e88f8cfe59d86723e092066ddd475425fba91826057edc027.jpg b/parse/train/QkVi6KogNbu/images/3ed6cf313b682b0e88f8cfe59d86723e092066ddd475425fba91826057edc027.jpg new file mode 100644 index 0000000000000000000000000000000000000000..99fb6aef67d3b1218737a7fccdb382f4a5234205 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/3ed6cf313b682b0e88f8cfe59d86723e092066ddd475425fba91826057edc027.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:bcb2df16e60eabf9c0eceb8b60b427c86286b8c38d25d8033e0a6eb895ac9ea5 +size 4941 diff --git a/parse/train/QkVi6KogNbu/images/4537bfb87e99fb8f00e11f6179b05ab12fb0703f3338bb3a20ae68cbf47a270f.jpg b/parse/train/QkVi6KogNbu/images/4537bfb87e99fb8f00e11f6179b05ab12fb0703f3338bb3a20ae68cbf47a270f.jpg new file mode 100644 index 0000000000000000000000000000000000000000..0389df3b2508e3a728baeefd447f39a21a0fc3aa --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/4537bfb87e99fb8f00e11f6179b05ab12fb0703f3338bb3a20ae68cbf47a270f.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:1cfd91d2631234b84c70decf9be714e25aa5f4d3fc0c61ec73b656b058d93595 +size 4365 diff --git a/parse/train/QkVi6KogNbu/images/56b0a04e4d90132dc6c33c0d97a561e4c008001943f04df9ef81528f588dbde5.jpg b/parse/train/QkVi6KogNbu/images/56b0a04e4d90132dc6c33c0d97a561e4c008001943f04df9ef81528f588dbde5.jpg new file mode 100644 index 0000000000000000000000000000000000000000..ba6df5420249dac50b29663a3350107c5aae31af --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/56b0a04e4d90132dc6c33c0d97a561e4c008001943f04df9ef81528f588dbde5.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:800d9da7592b45d34034b575497c26f0a15b1a7913b26160674a75ad603907c6 +size 6841 diff --git a/parse/train/QkVi6KogNbu/images/5aa6e1de469112812175ebf07fc7956efe25597faddb8c57cc20b2699e167f07.jpg b/parse/train/QkVi6KogNbu/images/5aa6e1de469112812175ebf07fc7956efe25597faddb8c57cc20b2699e167f07.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f582d02f76d333f27b578efd50a01b5b8d735c7b --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/5aa6e1de469112812175ebf07fc7956efe25597faddb8c57cc20b2699e167f07.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:453a7ba85d1425aa0805546ecc72cf798ee23bb5e3a07258d0f60d7b4c7489fe +size 4592 diff --git a/parse/train/QkVi6KogNbu/images/6e8ca2f406d41c556606d808901915f88c268ebce1a59533ec3da86f54529740.jpg b/parse/train/QkVi6KogNbu/images/6e8ca2f406d41c556606d808901915f88c268ebce1a59533ec3da86f54529740.jpg new file mode 100644 index 0000000000000000000000000000000000000000..2c92b08947d89ee4028c42aa398ed7f3eca8ea18 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/6e8ca2f406d41c556606d808901915f88c268ebce1a59533ec3da86f54529740.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:724e923c3e2b1d8c85867adabbb4113a77ae550756e50a43a5420d4ad3eb4fa1 +size 6531 diff --git a/parse/train/QkVi6KogNbu/images/7430fdb8ca3a8fa66cc25fa09af0250d10653e6af9d22d3e67bfb1b1ff74833d.jpg b/parse/train/QkVi6KogNbu/images/7430fdb8ca3a8fa66cc25fa09af0250d10653e6af9d22d3e67bfb1b1ff74833d.jpg new file mode 100644 index 0000000000000000000000000000000000000000..588ea665807e15403e538b70e2d61dacc4b23685 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/7430fdb8ca3a8fa66cc25fa09af0250d10653e6af9d22d3e67bfb1b1ff74833d.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e0bf5fe982aea8b7af70d36ab0a1a069a83686d5e1aab175b3c7b756e8088da6 +size 3554 diff --git a/parse/train/QkVi6KogNbu/images/75747962245266449929ece28395aa43b220b1b55d3b9bca25051a207d9f7a40.jpg b/parse/train/QkVi6KogNbu/images/75747962245266449929ece28395aa43b220b1b55d3b9bca25051a207d9f7a40.jpg new file mode 100644 index 0000000000000000000000000000000000000000..c6f81537135692681c0e2594ee079c1fd7dedd5f --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/75747962245266449929ece28395aa43b220b1b55d3b9bca25051a207d9f7a40.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:65d468e10a5bec661269b35a0f96467c5066e53b6b78a9c69c53cc02520ebae3 +size 9123 diff --git a/parse/train/QkVi6KogNbu/images/7ae5696db630fa8992a0b5df2c7dbe8c3630e973ebff738cc261f7b747fef6fe.jpg b/parse/train/QkVi6KogNbu/images/7ae5696db630fa8992a0b5df2c7dbe8c3630e973ebff738cc261f7b747fef6fe.jpg new file mode 100644 index 0000000000000000000000000000000000000000..b91efdcf3b40017956c22b46905abe0624c19edb --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/7ae5696db630fa8992a0b5df2c7dbe8c3630e973ebff738cc261f7b747fef6fe.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2769d9fe370af16d606c64c503b74a39caa3cf53b125b9c475cc454fcea6ac34 +size 40909 diff --git a/parse/train/QkVi6KogNbu/images/a1e416abb3e0c03d6ca5ac8fa45efcdaa377a4e7db5c64553834b387bd18020e.jpg b/parse/train/QkVi6KogNbu/images/a1e416abb3e0c03d6ca5ac8fa45efcdaa377a4e7db5c64553834b387bd18020e.jpg new file mode 100644 index 0000000000000000000000000000000000000000..6c09727ec55349e528d1f033d46abf7265fa74d0 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/a1e416abb3e0c03d6ca5ac8fa45efcdaa377a4e7db5c64553834b387bd18020e.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d32243a77009a8e4ae66a8cb42a48d5d5d233bdb11b6f63e59af77aed9b0b942 +size 5456 diff --git a/parse/train/QkVi6KogNbu/images/a53bb2ba46105f69bf28015bbf491a4cf592a23f4ef18da3635df34d4c6b4665.jpg b/parse/train/QkVi6KogNbu/images/a53bb2ba46105f69bf28015bbf491a4cf592a23f4ef18da3635df34d4c6b4665.jpg new file mode 100644 index 0000000000000000000000000000000000000000..9d90ef2c6be9c4f5156f3ea0900a7d59f5025a6a --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/a53bb2ba46105f69bf28015bbf491a4cf592a23f4ef18da3635df34d4c6b4665.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:08e54165aa5b36084c6d4fdd919282c69c537db06b88fe181b9719ad488475bf +size 9506 diff --git a/parse/train/QkVi6KogNbu/images/a683f9aaa8552ebdd38daf828598f88fb782eb08f26deefde9056a5627c1872d.jpg b/parse/train/QkVi6KogNbu/images/a683f9aaa8552ebdd38daf828598f88fb782eb08f26deefde9056a5627c1872d.jpg new file mode 100644 index 0000000000000000000000000000000000000000..492a9ad3b74da7a2d1d7eb84eba4a54b91604768 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/a683f9aaa8552ebdd38daf828598f88fb782eb08f26deefde9056a5627c1872d.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:13a9c7085a734f0c0613563c9abdb9b7e0c1c2af71f6365fe174a8599cf713c3 +size 6453 diff --git a/parse/train/QkVi6KogNbu/images/b4062cdf6c6148363451f34a71acccf830e98a858401d027065f0452d2cac67b.jpg b/parse/train/QkVi6KogNbu/images/b4062cdf6c6148363451f34a71acccf830e98a858401d027065f0452d2cac67b.jpg new file mode 100644 index 0000000000000000000000000000000000000000..69809cbd842c57550fdc93801c4170b3c8949ec5 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/b4062cdf6c6148363451f34a71acccf830e98a858401d027065f0452d2cac67b.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:aa4572f41238e4d02fe6fd832a54fee0e7943690902c535675ec6a0b2fa38c88 +size 3373 diff --git a/parse/train/QkVi6KogNbu/images/b5aef8d6eb1225cc7483cbbd61d6b7bbf07a801de3574a109e1a5b7ea1d498f6.jpg b/parse/train/QkVi6KogNbu/images/b5aef8d6eb1225cc7483cbbd61d6b7bbf07a801de3574a109e1a5b7ea1d498f6.jpg new file mode 100644 index 0000000000000000000000000000000000000000..4980c2b72c1837c6e0438d4a528ae63165e32483 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/b5aef8d6eb1225cc7483cbbd61d6b7bbf07a801de3574a109e1a5b7ea1d498f6.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:07d9242b4fc7ffe382a8069cd6ecd485e682a8306bc893c044f3bb732b326c70 +size 8336 diff --git a/parse/train/QkVi6KogNbu/images/b713f576bc4afcc1cf96f2f15a424c3a09c0e0cf47d9de6694089a5d849b114e.jpg b/parse/train/QkVi6KogNbu/images/b713f576bc4afcc1cf96f2f15a424c3a09c0e0cf47d9de6694089a5d849b114e.jpg new file mode 100644 index 0000000000000000000000000000000000000000..008af3086b6e40a16585f3d3c3289f2820860d32 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/b713f576bc4afcc1cf96f2f15a424c3a09c0e0cf47d9de6694089a5d849b114e.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6a066e3afbbceb8b2686b56ea73b9d2d3faf1be92053d07cae4d191433ed5dcb +size 5275 diff --git a/parse/train/QkVi6KogNbu/images/bd03460c00d63676423398a7e3d504713a73ba933c89cffafb50c9740424dee3.jpg b/parse/train/QkVi6KogNbu/images/bd03460c00d63676423398a7e3d504713a73ba933c89cffafb50c9740424dee3.jpg new file mode 100644 index 0000000000000000000000000000000000000000..545bd17538f5d613fe4d1e0139f65657dfee8f2d --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/bd03460c00d63676423398a7e3d504713a73ba933c89cffafb50c9740424dee3.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5d0189eeb17db95ce9ea340ee939a71aef7dbd9ac97eb1e3bf01141e7e4da475 +size 85809 diff --git a/parse/train/QkVi6KogNbu/images/bea2fce608e49b428e3c022111ffcb1062bc83c24ed54cf419390dc95bce3cca.jpg b/parse/train/QkVi6KogNbu/images/bea2fce608e49b428e3c022111ffcb1062bc83c24ed54cf419390dc95bce3cca.jpg new file mode 100644 index 0000000000000000000000000000000000000000..c4c86a0a316dae370b8c8d7bd08229c1c7ef53a2 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/bea2fce608e49b428e3c022111ffcb1062bc83c24ed54cf419390dc95bce3cca.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:12c3b86a2c92a5dd0d622c97aec6f8b808b53fb751f62e0fa7442c86efc94a56 +size 11497 diff --git a/parse/train/QkVi6KogNbu/images/cc5d096b5f70a14ffb0ca804843038cf3ed70b1109f355258052ed4c38a41939.jpg b/parse/train/QkVi6KogNbu/images/cc5d096b5f70a14ffb0ca804843038cf3ed70b1109f355258052ed4c38a41939.jpg new file mode 100644 index 0000000000000000000000000000000000000000..93568c92975967893e97309a71b1c8c56c577243 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/cc5d096b5f70a14ffb0ca804843038cf3ed70b1109f355258052ed4c38a41939.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7feff362fbf8068f092303c1086335d318d37d1a699320e821c8a89a7faa6c68 +size 8377 diff --git a/parse/train/QkVi6KogNbu/images/d200739cc8d7149b07c1a388568fd882113e370afdd95850a310bc288a66a9b9.jpg b/parse/train/QkVi6KogNbu/images/d200739cc8d7149b07c1a388568fd882113e370afdd95850a310bc288a66a9b9.jpg new file mode 100644 index 0000000000000000000000000000000000000000..cbe6a0d22a74d9b17fe333072d5320e7643e36e1 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/d200739cc8d7149b07c1a388568fd882113e370afdd95850a310bc288a66a9b9.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d73d01ec9b7b32b2fc4d436c3bc07a13ed1b19cfb5a14b58b18415d46ecb18f2 +size 12268 diff --git a/parse/train/QkVi6KogNbu/images/ecf296a9a713046c7ae0a30243177a9f75294e46f8e813bf06c437d3501f68fd.jpg b/parse/train/QkVi6KogNbu/images/ecf296a9a713046c7ae0a30243177a9f75294e46f8e813bf06c437d3501f68fd.jpg new file mode 100644 index 0000000000000000000000000000000000000000..9bada2db05856ee108647295e2614ea1ac1299b5 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/ecf296a9a713046c7ae0a30243177a9f75294e46f8e813bf06c437d3501f68fd.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c8c899f7546fc7a03cb194c2d998bfa3fcb8a70f669b7c750e8b50dde4efcb45 +size 14589 diff --git a/parse/train/QkVi6KogNbu/images/f6fa67422b58f5987db0b89e65f33d6646cea5820c256ac52064f7e4da1ec942.jpg b/parse/train/QkVi6KogNbu/images/f6fa67422b58f5987db0b89e65f33d6646cea5820c256ac52064f7e4da1ec942.jpg new file mode 100644 index 0000000000000000000000000000000000000000..b426cba22e7d66484045b2f30cb5af9ec8b7b127 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/f6fa67422b58f5987db0b89e65f33d6646cea5820c256ac52064f7e4da1ec942.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b1c612b58a66aa0959b3f0c0f5f81f1d683103f62c2a95deb1757c1bfb412a87 +size 8380 diff --git a/parse/train/QkVi6KogNbu/images/f7e66af7de1a6fcb8d2c3b1c86030599165a688873f538aa8f7f7590fdd2452c.jpg b/parse/train/QkVi6KogNbu/images/f7e66af7de1a6fcb8d2c3b1c86030599165a688873f538aa8f7f7590fdd2452c.jpg new file mode 100644 index 0000000000000000000000000000000000000000..b7d154d286c6ce1daf724778db3982e4a631d3ec --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/f7e66af7de1a6fcb8d2c3b1c86030599165a688873f538aa8f7f7590fdd2452c.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b9878dd260f8a6e79f81a9e9cd7be50bf8c3ea378c72bb5027e4499e0fe78558 +size 52991 diff --git a/parse/train/QkVi6KogNbu/images/fa28ea1087936028f4cf09b5228d2de7ce9472eb370de07898d5cfc486ca7b03.jpg b/parse/train/QkVi6KogNbu/images/fa28ea1087936028f4cf09b5228d2de7ce9472eb370de07898d5cfc486ca7b03.jpg new file mode 100644 index 0000000000000000000000000000000000000000..786c5abcad1c9931c4cc058624a57dc50e4424f4 --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/fa28ea1087936028f4cf09b5228d2de7ce9472eb370de07898d5cfc486ca7b03.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:53e7826cde83991d76abd59b066f6d54b05f0e1891ba247d50dce35c12264cf2 +size 7635 diff --git a/parse/train/QkVi6KogNbu/images/fd03fc7c3f257bb9b78e249c90b4f102e58eeb00de690c90aac01f3920eb83f9.jpg b/parse/train/QkVi6KogNbu/images/fd03fc7c3f257bb9b78e249c90b4f102e58eeb00de690c90aac01f3920eb83f9.jpg new file mode 100644 index 0000000000000000000000000000000000000000..bc3e8838f15efd918ec4c75317b9e90cb34a3f1a --- /dev/null +++ b/parse/train/QkVi6KogNbu/images/fd03fc7c3f257bb9b78e249c90b4f102e58eeb00de690c90aac01f3920eb83f9.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b6780d53a1b51ce6dbc4dcef354b16ca407075ea069b501cb30bacbba4189903 +size 2477 diff --git a/parse/train/S1ANxQW0b/S1ANxQW0b.md b/parse/train/S1ANxQW0b/S1ANxQW0b.md new file mode 100644 index 0000000000000000000000000000000000000000..388b152d9b01201c0cf73139eae99d3a129bf864 --- /dev/null +++ b/parse/train/S1ANxQW0b/S1ANxQW0b.md @@ -0,0 +1,747 @@ +# MAXIMUM A POSTERIORI POLICY OPTIMISATION + +Abbas Abdolmaleki, Jost Tobias Springenberg, Yuval Tassa, Remi Munos, +Nicolas Heess, Martin Riedmiller +DeepMind, London, UK +{aabdolmaleki,springenberg,tassa,munos,heess,riedmiller}@google.com + +# ABSTRACT + +We introduce a new algorithm for reinforcement learning called Maximum aposteriori Policy Optimisation (MPO) based on coordinate ascent on a relativeentropy objective. We show that several existing methods can directly be related to our derivation. We develop two off-policy algorithms and demonstrate that they are competitive with the state-of-the-art in deep reinforcement learning. In particular, for continuous control, our method outperforms existing methods with respect to sample efficiency, premature convergence and robustness to hyperparameter settings. + +# 1 INTRODUCTION + +Model free reinforcement learning algorithms can acquire sophisticated behaviours by interacting with the environment while receiving simple rewards. Recent experiments (Mnih et al., 2015; Jaderberg et al., 2016; Heess et al., 2017) successfully combined these algorithms with powerful deep neural-network approximators while benefiting from the increase of compute capacity. + +Unfortunately, the generality and flexibility of these algorithms comes at a price: They can require a large number of samples and – especially in continuous action spaces – suffer from high gradient variance. Taken together these issues can lead to unstable learning and/or slow convergence. Nonetheless, recent years have seen significant progress, with improvements to different aspects of learning algorithms including stability, data-efficiency and speed, enabling notable results on a variety of domains, including locomotion (Heess et al., 2017; Peng et al., 2016), multi-agent behaviour (Bansal et al., 2017) and classical control (Duan et al., 2016). + +Two types of algorithms currently dominate scalable learning for continuous control problems: First, Trust-Region Policy Optimisation (TRPO; Schulman et al. 2015) and the derivative family of Proximal Policy Optimisation algorithms (PPO; Schulman et al. 2017b). These policy-gradient algorithms are on-policy by design, reducing gradient variance through large batches and limiting the allowed change in parameters. They are robust, applicable to high-dimensional problems, and require moderate parameter tuning, making them a popular first choice (Ho & Ermon, 2016). However, as on-policy algorithms, they suffer from poor sample efficiency. + +In contrast, off-policy value-gradient algorithms such as the Deep Deterministic Policy Gradient (DDPG, Silver et al. 2014; Lillicrap et al. 2016), Stochastic Value Gradient (SVG, Heess et al. 2015), and the related Normalized Advantage Function formulation (NAF, Gu et al. 2016b) rely on experience replay and learned (action-)value functions. These algorithms exhibit much better data efficiency, approaching the regime where experiments with real robots are possible (Gu et al., 2016a; Andrychowicz et al., 2017). While also popular, these algorithms can be difficult to tune, especially for high-dimensional domains like general robot manipulation tasks. + +In this paper we propose a novel off-policy algorithm that benefits from the best properties of both classes. It exhibits the scalability, robustness and hyperparameter insensitivity of on-policy algorithms, while offering the data-efficiency of off-policy, value-based methods. + +To derive our algorithm, we take advantage of the duality between control and estimation by using Expectation Maximisation (EM), a powerful tool from the probabilistic estimation toolbox, in order to solve control problems. This duality can be understood as replacing the question “what are the actions which maximise future rewards?” with the question “assuming future success in maximising rewards, what are the actions most likely to have been taken?”. By using this estimation objective we have more control over the policy change in both E and M steps, yielding robust learning. We show below that several algorithms, including TRPO, can be directly related to this perspective. We leverage the fast convergence properties of EM-style coordinate ascent by alternating a nonparametric data-based E-step which re-weights state-action samples, with a supervised, parametric M-step using deep neural networks. + +We evaluate our algorithm on a broad spectrum of continuous control problems including a 56 DoF humanoid body. All experiments used the same optimisation hyperparameters 1. Our algorithm shows remarkable data efficiency often solving the tasks we consider an order of magnitude faster than the state-of-the-art. A video of some resulting behaviours can be found here dropbox.com/s/pgcmjst7t0zwm4y/MPO.mp4. + +# 2 BACKGROUND AND NOTATION + +# 2.1 RELATED WORK + +Casting Reinforcement Learning (RL) as an inference problem has a long history dating back at least two decades (Dayan & Hinton, 1997). The framework presented here is inspired by a variational inference perspective on RL that has previously been utilised in multiple studies; c.f. Dayan & Hinton (1997); Neumann (2011); Deisenroth et al. (2013); Rawlik et al. (2012); Levine & Koltun (2013); Florensa et al. (2017). + +Particular attention has been paid to obtaining maximum entropy policies as the solution to an inference problem. The penalisation of determinism can be seen encouraging both robustness and simplicity. Among these are methods that perform trajectory optimisation using either linearised dynamics (Todorov, 2008; Toussaint, 2009; Levine & Koltun, 2013) or general dynamics as in path integral control (Kappen, 2005; Theodorou et al., 2010). In contrast to these algorithms, here we do not assume the availability of a transition model and avoid on-policy optimisation. A number of other authors have considered the same perspective but in a model-free RL setting (Neumann, 2011; Peters et al., 2010a; Florensa et al., 2017; Daniel et al., 2016) or inverse RL problems (Ziebart et al., 2008). These algorithms are more directly related to our work and can be cast in the same (EM-like) alternating optimisation scheme on which we base our algorithm. However, they typically lack the maximisation (M)-step – with the prominent exception of REPS, AC-REPS, $\mathrm { P \bar { I } ^ { 2 } }$ -GPS and MDGPS (Peters et al., 2010a; Wirth et al., 2016; Chebotar et al., 2016; Montgomery & Levine, 2016) to which our algorithm is closely related as outlined below. An interesting recent addition to these approaches is an EM-perspective on the PoWER algorithm (Roux, 2016) which uses the same iterative policy improvement employed here, but commits to parametric inference distributions and avoids an exponential reward transformation, resulting in a harder to optimise lower bound. + +As an alternative to these policy gradient inspired algorithms, the class of recent algorithms for soft Q-learning (e.g. Rawlik et al. (2012); Haarnoja et al. (2017); Fox et al. (2016) parameterise and estimate a so called “soft” Q-function directly, implicitly inducing a maximum entropy policy. A perspective that can also be extended to hierarchical policies (Florensa et al., 2017), and has recently been used to establish connections between Q-learning and policy gradient methods (O’Donoghue et al., 2016; Schulman et al., 2017a). In contrast, we here rely on a parametric policy, our bound and derivation is however closely related to the definition of the soft (entropy regularised) Q-function. + +A line of work, that is directly related to the “RL as inference” perspective, has focused on using information theoretic regularisers such as the entropy of the policy or the Kullback-Leibler divergence (KL) between policies to stabilise standard RL objectives. In fact, most state-of-the-art policy gradient algorithms fall into this category. For example see the entropy regularization terms used in Mnih et al. (2016) or the KL constraints employed by work on trust-region based methods (Schulman et al., 2015; 2017b; Gu et al., 2017; Wang et al., 2017). The latter methods introduce a trust region constraint, defined by the KL divergence between the new policy and the old policy, so that the expected KL divergence over state space is bounded. From the perspective of this paper these trust-region based methods can be seen as optimising a parametric E-step, as in our algorithm, but are “missing” an explicit M-step. + +Finally, the connection between RL and inference has been invoked to motivate work on exploration. The most prominent examples for this are formed by work on Boltzmann exploration such as Kaelbling et al. (1996); Perkins & Precup (2002); Sutton (1990); O’Donoghue et al. (2017), which can be connected back to soft Q-learning (and thus to our approach) as shown in Haarnoja et al. (2017). + +# 2.2 MARKOV DECISION PROCESSES + +We consider the problem of finding an optimal policy $\pi$ for a discounted reinforcement learning (RL) problem; formally characterized by a Markov decision process (MDP). The MDP consists of: continuous states $s$ , actions $a$ , transition probabilities $p ( s _ { t + 1 } | s _ { t } , a _ { t } )$ – specifying the probability of transitioning from state $s _ { t }$ to $s _ { t + 1 }$ under action $a _ { t } \textrm { -- }$ , a reward function $r ( s , a ) \in \mathbb { R }$ as well as the discounting factor $\gamma \in [ 0 , 1 )$ . The policy $\pi ( a | s , \theta )$ (with parameters $\pmb { \theta }$ ) is assumed to specify a probability distribution over action choices given any state and – together with the transition probabilities – gives rise to the stationary distribution $\mu _ { \pi } ( s )$ . + +Using these basic quantities we can now define the notion of a Markov sequence or trajec$\overline { { \tau } } _ { \pi } ~ = ~ \{ ( s _ { 0 } , a _ { 0 } ) \} \ldots ( s _ { T } , a _ { T } ) \}$ by following the policy ; and the expected return $\pi$ $\begin{array} { r } { \tau _ { \pi } ~ \sim ~ p _ { \pi } ( \tau ) } \end{array}$ with. We $\begin{array} { r } { p _ { \pi } ( \tau ) = p ( s _ { 0 } ) \prod _ { t > 0 } p ( s _ { t + 1 } \vert s _ { t } , a _ { t } ) \pi ( a _ { t } \vert s _ { t } ) ; } \end{array}$ $\begin{array} { r } { \mathbb { E } _ { \tau _ { \pi } } [ \sum _ { t = 0 } ^ { \infty } \gamma ^ { t } r ( s _ { t } , s _ { t } ) ] } \end{array}$ will use the shorthand $r _ { t } = r ( s _ { t } , a _ { t } )$ . + +# 3 MAXIMUM A POSTERIORI POLICY OPTIMISATION + +Our approach is motivated by the well established connection between RL and probabilistic inference. This connection casts the reinforcement learning problem as that of inference in a particular probabilistic model. Conventional formulations of RL aim to find a trajectory that maximizes expected reward. In contrast, inference formulations start from a prior distribution over trajectories, condition a desired outcome such as achieving a goal state, and then estimate the posterior distribution over trajectories consistent with this outcome. + +A finite-horizon undiscounted reward formulation can be cast as inference problem by constructing a suitable probabilistic model via a likelihood function $p ( O = 1 | \tau ) \propto \mathrm { e x p } ( \Sigma _ { t } r _ { t } / \alpha )$ , where $\alpha$ is a temperature parameter. Intuitively, $O$ can be interpreted as the event of obtaining maximum reward by choosing an action; or the event of succeeding at the RL task (Toussaint, 2009; Neumann, 2011). With this definition we can define the following lower bound on the likelihood of optimality for the policy $\pi$ : + +$$ +\begin{array} { l } { \displaystyle \log p _ { \pi } ( O = 1 ) = \log \int p _ { \pi } ( \tau ) p ( O = 1 | \tau ) d \tau \geq \int q ( \tau ) \big [ \log p ( O = 1 | \tau ) + \log \frac { p _ { \pi } ( \tau ) } { q ( \tau ) } \big ] d \tau } \\ { \displaystyle \qquad = \mathbb { E } _ { q } \Big [ \sum _ { t } r _ { t } / \alpha \Big ] - \mathrm { K L } \Big ( q ( \tau ) | | p _ { \pi } ( \tau ) \Big ) = \mathcal { I } ( q , \pi ) , } \end{array} +$$ + +where $p _ { \pi }$ is the trajectory distribution induced by policy $\pi ( a | s )$ as described in section 2.2 and $q ( \tau )$ is an auxiliary distribution over trajectories that will discussed in more detail below. The lower bound $\mathcal { I }$ is the evidence lower bound (ELBO) which plays an important role in the probabilistic modeling literature. It is worth already noting here that optimizing (2) with respect to $q$ can be seen as a regularized RL problem. + +An important motivation for transforming a RL problem into an inference problem is that this allows us draw from the rich toolbox of inference methods: For instance, $\mathcal { I }$ can be optimized with the familiy of expectation maximization (EM) algorithms which alternate between improving $\mathcal { I }$ with respect to $q$ and $\pi$ . In this paper we follow classical (Dayan & Hinton, 1997) and more recent works (e.g. Peters et al. 2010b; Levine & Koltun 2013; Daniel et al. 2016; Wirth et al. 2016) and cast policy search as a particular instance of this family. Our algorithm then combines properties of existing approaches in this family with properties of recent off-policy algorithms for neural networks. + +The algorithm alternates between two phases which we refer to as E and M step in reference to an EM-algorithm. The E-step improves $\mathcal { I }$ with respect to $q$ . Existing EM policy search approaches perform this step typically by reweighting trajectories with sample returns (Kober & Peters, 2009) or via local trajectory optimization (Levine & Koltun, 2013). We show how off-policy deep RL techniques and value-function approximation can be used to make this step both scalable as well as data efficient. The M-step then updates the parametric policy in a supervised learning step using the reweighted state-action samples from the E-step as targets. + +These choices lead to the following desirable properties: (a) low-variance estimates of the expected return via function approximation; (b) low-sample complexity of value function estimate via robust off-policy learning; (c) minimal parametric assumption about the form of the trajectory distribution in the E-step; (d) policy updates via supervised learning in the M step; (e) robust updates via hard trust-region constraints in both the E and the M step. + +# 3.1 POLICY IMPROVEMENT + +The derivation of our algorithm then starts from the infinite-horizon analogue of the KL-regularized expected reward objective from Equation (2). In particular, we consider variational distributions $q ( \tau )$ that factor in the same way as $p _ { \pi }$ , i.e. $\begin{array} { r } { q ( \tau ) = \bar { p } ( s _ { 0 } ) \prod _ { t > 0 } p ( s _ { t + 1 } | s _ { t } , a _ { t } ) q ( a _ { t } | s _ { t } ) } \end{array}$ which yields: + +$$ +\mathcal { I } ( \boldsymbol { q } , \theta ) = \mathbb { E } _ { \boldsymbol { q } } \Big [ \sum _ { t = 0 } ^ { \infty } \gamma ^ { t } \big [ r _ { t } - \alpha \mathbf { K L } \big ( \boldsymbol { q } ( \boldsymbol { a } | s _ { t } ) \| \pi ( \boldsymbol { a } | s _ { t } , \theta ) \big ) \big ] \Big ] + \log p ( \theta ) . +$$ + +Note that due to the assumption about the structure of $q ( \tau )$ the $\mathrm { K L }$ over trajectories decomposes into a KL over the individual state-conditional action distributions. This objective has also been considered e.g. by Haarnoja et al. (2017); Schulman et al. (2017a). The additional $\log p ( \pmb \theta )$ term is a prior over policy parameters and can be motivated by a maximum a-posteriori estimation problem (see appendix for more details). + +We also define the regularized Q-value function associated with (3) as + +$$ +Q _ { \theta } ^ { q } ( s , a ) = r _ { 0 } + \mathbb { E } _ { q ( \tau ) , s _ { 0 } = s , a _ { 0 } = a } \left[ \sum _ { t \geq 1 } ^ { \infty } \gamma ^ { t } \big [ r _ { t } - \alpha \mathrm { K L } ( q _ { t } \| \pi _ { t } ) \big ] \right] , +$$ + +with $\mathrm { K L } \big ( q _ { t } | | \pi _ { t } \big ) = \mathrm { K L } \big ( q ( a | s _ { t } ) \big ) \| \pi ( a | s _ { t } , \pmb { \theta } ) \big )$ . Note that $\mathrm { K L } \big ( q _ { 0 } | | \pi _ { 0 } \big )$ and $p ( \theta )$ are not part of the Q-function as they are not a function of the action. + +We observe that optimizing $\mathcal { I }$ with respect to $q$ is equivalent to solving an expected reward RL problem with augmented reward $\begin{array} { r } { \tilde { r } _ { t } = r _ { t } - \alpha \log \frac { q ( a _ { t } | s _ { t } ) } { \pi ( a _ { t } | s _ { t } , \pmb { \theta } ) } } \end{array}$ . In this view $\pi$ represents a default policy towards which $q$ is regularized – i.e. the current best policy. The MPO algorithm treats $\pi$ as the primary object of interest. In this case $q$ serves as an auxiliary distribution that allows optimizing $\mathcal { I }$ via alternate coordinate ascent in $q$ and $\pi _ { \pmb { \theta } }$ , analogous to the expectation-maximization algorithm in the probabilistic modelling literature. In our case, the E-step optimizes $\mathcal { I }$ with respect to $q$ while the M-step optimizes $\mathcal { I }$ with respect to $\pi$ . Different optimizations in the $\mathrm { E }$ -step and M-step lead to different algorithms. In particular, we note that for the case where $p ( \pmb \theta )$ is an uninformative prior a variant of our algorithm has a monotonic improvement guarantee as show in the Appendix A. + +# 3.2 E-STEP + +In the E-step of iteration $i$ we perform a partial maximization of $\mathcal { I } ( \boldsymbol { q } , \boldsymbol { \theta } )$ with respect to $q$ given $\theta = \theta _ { i }$ . We start by setting $q = \pi _ { \pmb { \theta } _ { i } }$ and estimate the unregularized action-value function: + +$$ +Q _ { \theta _ { i } } ^ { q } ( s , a ) = Q _ { \theta _ { i } } ( s , a ) = \mathbb { E } _ { \tau _ { \pi _ { i } } , s _ { 0 } = s , a _ { 0 } = a } \left[ \sum _ { t } ^ { \infty } \gamma ^ { t } r _ { t } \right] , +$$ + +since $\mathrm { K L } ( q | | \pi _ { i } ) = 0$ . In practice we estimate $Q _ { \pmb { \theta } _ { i } }$ from off-policy data (we refer to Section 4 for details about the policy evaluation step). This greatly increases the data efficiency of our algorithm. Given $Q _ { \pmb { \theta } _ { i } }$ we improve the lower bound $\mathcal { I }$ w.r.t. $q$ by first expanding $Q _ { \theta _ { i } } ( s , a )$ via the regularized Bellman operator $\begin{array} { r } { T ^ { \pi , q } = \mathbb { E } _ { q ( a \mid s ) } \Big [ r ( s , a ) - \alpha \mathbf { K L } ( q \| \pi _ { i } ) + \gamma \mathbb { E } _ { p ( s ^ { \prime } \mid s , a ) } [ V _ { \pmb { \theta } _ { i } } ( s ^ { \prime } ) ] \Big ] . } \end{array}$ , and optimize the “one-step” KL regularised objective + +$$ +\begin{array} { l } { \displaystyle \mathop { \operatorname* { m a x } } _ { \boldsymbol { q } } \bar { \mathcal { T } } _ { s } ( \boldsymbol { q } , \theta _ { i } ) = \mathop { \operatorname* { m a x } } _ { \boldsymbol { q } } T ^ { \pi , { q } } Q _ { \theta _ { i } } ( s , \boldsymbol { a } ) } \\ { \displaystyle \mathop { \quad = } \mathop { \operatorname* { m a x } } _ { \boldsymbol { q } } \mathbb { E } _ { \boldsymbol { \mu } ( s ) } \Big [ \mathbb { E } _ { \boldsymbol { q } ( \cdot \vert s ) } [ Q _ { \theta _ { i } } ( s , \boldsymbol { a } ) ] - \alpha \mathbf { K } \mathbf { L } ( \boldsymbol { q } \| \pi _ { i } ) \Big ] , } \end{array} +$$ + +since $V _ { \pmb { \theta } _ { i } } ( s ) = \mathbb { E } _ { q ( a | s } [ Q _ { \pmb { \theta } _ { i } } ( s , a ) ]$ and thus $Q _ { \pmb { \theta } _ { i } } ( s , a ) = r ( s , a ) + \gamma V _ { \pmb { \theta } _ { i } } ( s ) .$ . + +Maximizing Equation (6), thus obtaining $q _ { i } = \arg \operatorname* { m a x } \bar { \mathcal { I } } ( q , \theta _ { i } )$ , does not fully optimize $\mathcal { I }$ since we treat $Q _ { \theta _ { i } }$ as constant with respect to $q$ . An intuitive interpretation $q _ { i }$ is that it chooses the softoptimal action for one step and then resorts to executing policy $\pi$ . In the language of the EM algorithm this optimization implements a partial E-step. In practice we also choose $\mu _ { q }$ to be the stationary distribution as given through samples from the replay buffer. + +# CONSTRAINED E-STEP + +The reward and the KL terms are on an arbitray relative scale. This can make it difficult to choose $\alpha$ . We therefore replace the soft KL regularization with a hard constraint with parameter $\epsilon$ , i.e, + +$$ +\begin{array} { r l } & { \underset { q } { \operatorname* { m a x } } \mathbb { E } _ { \boldsymbol { \mu } ( s ) } \left[ \mathbb { E } _ { q ( a \mid s ) } \left[ Q _ { \boldsymbol { \theta } _ { i } } ( s , a ) \right] \right] } \\ & { s . t . \mathbb { E } _ { \boldsymbol { \mu } ( s ) } \left[ { \mathbf { K L } } ( q ( a \mid s ) , \pi ( a \mid s , \boldsymbol { \theta } _ { i } ) ) \right] < \epsilon . } \end{array} +$$ + +If we choose to explicitly parameterize $q ( a | s ) -$ option 1 below – the resulting optimisation is similar to that performed by the recent TRPO algorithm for continuous control (Schulman et al., 2015); only in an off-policy setting. Analogously, the unconstrained objective (6) is similar to the objective used by PPO (Schulman et al., 2017b). We note, however, that the KL is reversed when compared to the KL used by TRPO and PPO. + +To implement (7) we need to choose a form for the variational policy $q ( a | s )$ . Two options arise: + +1. We can use a parametric variational distribution $q ( a | s , \pmb \theta ^ { q } )$ , with parameters $\pmb { \theta } ^ { q }$ , and optimise Equation (7) via the likelihood ratio or action-value gradients. This leads to an algorithm similar to TRPO/PPO and an explicit M-step becomes unnecessary (see. Alg. 3). 2. We can choose a non-parametric representation of $q ( a | s )$ given by one probability factor per sample. To achieve generalization in state space we then fit a parametric policy in the M-step. + +Fitting a parametric policy in the M-step is a supervised learning problem, allowing us to employ various regularization techniques at that point. It also makes it easier to enforce the hard KL constraint. + +# NON PARAMETRIC VARIATIONAL DISTRIBUTION + +In the non-parametric case we can obtain the optimal sample based $q$ distribution – the solution to Equation (7) – in closed form (see the appendix for a full derivation), as, + +$$ +q _ { i } ( a | s ) \propto \pi ( a | s , \pmb { \theta } _ { i } ) \exp \Big ( \frac { Q _ { \theta _ { i } } ( s , a ) } { \eta ^ { * } } \Big ) , +$$ + +where we can obtain $\eta ^ { * }$ by minimising the following convex dual function, + +$$ +g ( \eta ) = \eta \epsilon + \eta \int \mu ( s ) \log \int \pi ( a | s , \pmb { \theta } _ { i } ) \exp \Big ( \frac { Q _ { \theta _ { i } } ( s , a ) } { \eta } \Big ) d a d s , +$$ + +after the optimisation of which we can evaluate $q _ { i } ( a | s )$ on given samples. + +This optimization problem is similar to the one solved by relative entropy policy search (REPS) (Peters et al., 2010a) with the difference that we optimise only for the conditional variational distribution $q ( a | s )$ instead of a joint distribution $\scriptstyle q ( a , s )$ – effectively fixing $\mu _ { q } ( s )$ to the stationary distribution given by previously collected experience – and we use the $\mathrm { Q }$ function of the old policy to evaluate the integral over $a$ . While this might seem unimportant it is crucial as it allows us to estimate the integral over actions with multiple samples without additional environment interaction. This greatly reduces the variance of the estimate and allows for fully off-policy learning at the cost of performing only a partial optimization of $\mathcal { I }$ as described above. + +# 3.3 M-STEP + +Given $q _ { i }$ from the E-step we can optimize the lower bound $\mathcal { I }$ with respect to $\pmb \theta$ to obtain an updated policy $\pmb { \theta } _ { i + 1 } = \arg \operatorname* { m a x } _ { \pmb { \theta } } \mathcal { I } ( q _ { i } , \pmb { \theta } )$ . Dropping terms independent of $\pmb { \theta }$ this entails solving for the solution of + +$$ +\operatorname* { m a x } _ { \theta } \mathcal { I } ( q _ { i } , \theta ) = \operatorname* { m a x } _ { \theta } \mathbb { E } _ { \mu _ { q } ( s ) } \Big [ \mathbb { E } _ { q ( a | s ) } \Big [ \log \pi ( a | s , \theta ) \Big ] \Big ] + \log p ( \theta ) , +$$ + +which corresponds to a weighted maximum a-posteriroi estimation (MAP) problem where samples are weighted by the variational distribution from the E-step. Since this is essentially a supervised learning step we can choose any policy representation in combination with any prior for regularisation. In this paper we set $p ( \pmb \theta )$ to a Gaussian prior around the current policy, i.e, $\begin{array} { r } { p ( \pmb { \theta } ) \approx \mathcal { N } \Big ( \mu = \pmb { \theta } _ { i } , \Sigma = \frac { F _ { \pmb { \theta } _ { i } } } { \lambda } \Big ) } \end{array}$ , where $\pmb \theta _ { i }$ are the parameters of the current policy distribution, $F _ { \pmb { \theta } _ { i } }$ is the empirical Fisher information matrix and $\lambda$ is a positive scalar. As shown in the appendix this suggests the following generalized M-step: + +$$ +\operatorname* { m a x } _ { \pi } \mathbb { E } _ { \mu _ { q } ( s ) } \Big [ \mathbb { E } _ { q ( a | s ) } \Big [ \log \pi ( a | s , \pmb { \theta } ) \Big ] - \lambda \mathrm { K L } \Big ( \pi ( a | s , \pmb { \theta } _ { i } ) , \pi ( a | s , \pmb { \theta } ) \Big ) \Big ] +$$ + +which can be re-written as the hard constrained version: + +$$ +\begin{array} { r } { \underset { \pi } { \operatorname* { m a x } } \mathbb { E } _ { \mu _ { q } ( s ) } \left[ \mathbb { E } _ { q ( a | s ) } \left[ \log \pi ( a | s , \pmb { \theta } ) \right] \right] } \\ { s . t . \mathbb { E } _ { \mu _ { q } ( s ) } \left[ { \mathbf { K L } } ( \pi ( a | s , \pmb { \theta } _ { i } ) , \pi ( a | s , \pmb { \theta } ) ) \right] < \epsilon . } \end{array} +$$ + +This additional constraint minimises the risk of overfitting the samples, i.e. it helps us to obtain a policy that generalises beyond the state-action samples used for the optimisation. In practice we have found the KL constraint in the M step to greatly increase stability of the algorithm. We also note that in the E-step we are using the reverse, mode-seeking, KL while in the M-step we are using the forward, moment-matching, KL which reduces the tendency of the entropy of the parametric policy to collapse. This is in contrast to other RL algorithms that use M-projection without KL constraint to fit a parametric policy (Peters et al., 2010a; Wirth et al., 2016; Chebotar et al., 2016; Montgomery & Levine, 2016). Using KL constraint in M-step has also been shown effective for stochastic search algorithms (Abdolmaleki et al., 2017). + +# 4 POLICY EVALUATION + +Our method is directly applicable in an off-policy setting. For this, we have to rely on a stable policy evaluation operator to obtain a parametric representation of the Q-function $Q _ { \theta } ( s , a )$ . We make use of the policy evaluation operator from the Retrace algorithm Munos et al. (2016), which we found to yield stable policy evaluation in practice2. Concretely, we fit the Q-function $Q _ { \theta _ { i } } ( s , a , \phi )$ as represented by a neural network, with parameters $\phi$ , by minimising the squared loss: + +$$ +\begin{array} { l } { \displaystyle \mathop { \operatorname* { m i n } } _ { \phi } L ( \phi ) = \mathop { \operatorname* { m i n } } _ { \phi } \mathbb { E } _ { \mu _ { b } ( s ) , b ( a | s ) } \left[ \left( Q _ { \theta _ { i } } ( s _ { t } , a _ { t } , \phi ) - Q _ { t } ^ { \mathrm { r e t } } \right) ^ { 2 } \right] , \mathrm { w i t h } } \\ { \displaystyle Q _ { t } ^ { \mathrm { r e t } } = Q _ { \phi ^ { \prime } } ( s _ { t } , a _ { t } ) + \sum _ { j = t } ^ { \infty } \gamma ^ { j - t } \Big ( \prod _ { k = t + 1 } ^ { j } c _ { k } \Big ) \left[ r ( s _ { j } , a _ { j } ) + \mathbb { E } _ { \pi ( a | s _ { j + 1 } ) } [ Q _ { \phi ^ { \prime } } ( s _ { j + 1 } , a ) ] - Q _ { \phi ^ { \prime } } ( s _ { j } , a _ { j } ) \right] , } \\ { \displaystyle c _ { k } = \operatorname* { m i n } \Big ( 1 , \frac { \pi ( a _ { k } | s _ { k } ) } { b ( a _ { k } | s _ { k } ) } \Big ) , } \end{array} +$$ + +where $Q _ { \phi ^ { \prime } } ( s , a )$ denotes the output of a target Q-network, with parameters $\phi ^ { \prime }$ , that we copy from the current parameters $\phi$ after each M-step. We truncate the infinite sum after $N$ steps by bootstrapping with $Q _ { \phi ^ { \prime } }$ (rather than considering a $\lambda$ return). Additionally, $b ( a | s )$ denotes the probabilities of an arbitrary behaviour policy. In our case we use an experience replay buffer and hence $b$ is given by the action probabilities stored in the buffer; which correspond to the action probabilities at the time of action selection. + +# 5 EXPERIMENTS + +For our experiments we evaluate our MPO algorithm across a wide range of tasks. Specifically, we start by looking at the continuous control tasks of the DeepMind Control Suite (Tassa et al. (2018), see Figure 1), and then consider the challenging parkour environments recently published in Heess et al. (2017). In both cases we use a Gaussian distribution for the policy whose mean and covariance are parameterized by a neural network (see appendix for details). In addition, we present initial experiments for discrete control using ATARI environments using a categorical policy distribution (whose logits are again parameterized by a neural network) in the appendix. + +# 5.1 EVALUATION ON CONTROL SUITE + +![](images/754c06df74f11ccb9772163bdb2d3c935cb2cba2b5b65def9b07cd08ab62b078.jpg) +Figure 1: Control Suite domains used for benchmarking. Top: Acrobot, Ball-in-cup, Cart-pole, Cheetah, Finger, Fish, Hopper. Bottom: Humanoid, Manipulator, Pendulum, Point-mass, Reacher, Swimmers (6 and 15 links), Walker. + +The suite of continuous control tasks that we are evaluating against contains 18 tasks, comprising a wide range of domains including well known tasks from the literature. For example, the classical cart-pole and acrobot dynamical systems, 2D and Humanoid walking as well as simple low-dimensional planar reaching and manipulation tasks. This suite of tasks was built in python on top of mujoco and will also be open sourced to the public by the time of publication. + +While we include plots depicting the performance of our algorithm on all tasks below; comparing it against the state-of-the-art algorithms in terms of data-efficiency. We want to start by directing the attention of the reader to a more detailed evaluation on three of the harder tasks from the suite. + +5.1.1 DETAILED ANALYSIS ON WALKER-2D, ACROBOT, HOPPER + +We start by looking at the results for the classical Acrobot task (two degrees of freedom, one continuous action dimension) as well as the 2D walker (which has 12 degrees of freedom and thus a 12 dimensional action space and a 21 dimensional state space) and the hopper standing task. The reward in the Acrobot task is the distance of the robots end-effector to an upright position of the underactuated system. For the walker task it is given by the forward velocity, whereas in the hopper the requirement is to stand still. + +Figure 2 shows the results for this task obtained by applying our algorithm MPO as well as several ablations – in which different parts were removed from the MPO optimization – and two baselines: our implementation of Proximal Policy Optimization (PPO) (Schulman et al., 2017b) and DDPG. The hyperparameters for MPO were kept fixed for all experiments in the paper (see the appendix for hyperparameter settings). + +As a first observation, we can see that MPO gives stable learning on all tasks and, thanks to its fully off-policy implementation, is significantly more sample efficient than the on-policy PPO baseline. Furthermore, we can observe that changing from the non-parametric variational distribution to a parametric distribution3 (which, as described above, can be related to PPO) results in only a minor asymptotic performance loss but slowed down optimisation and thus hampered sample efficiency; which can be attributed to the fact that the parametric $q$ distribution required a stricter KL constraint. Removing the automatically tuned KL constraint and replacing it with a manually set entropy regulariser then yields an off-policy actor-critic method with Retrace. This policy gradient method still uses the idea of estimating the integral over actions – and thus, for a gradient based optimiser, its likelihood ratio derivative – via multiple action samples (as judged by a Q-Retrace critic). This idea has previously been coined as using the expected policy gradient (EPG) (Ciosek & Whiteson, 2017) and we hence denote the corresponding algorithm with EPG $^ +$ Retrace, which no-longer follows the intuitions of the MPO perspective. $\mathrm { E P G } + .$ Retrace performed well when the correct entropy regularisation scale is used. This, however, required task specific tuning (c.f. Figure 4 where this hyperparameter was set to the one that performed best in average across tasks). Finally using only a single sample to estimate the integral (and hence the likelihood ratio gradient) results in an actor-critic variant with Retrace that is the least performant off-policy algorithm in our comparison. + +![](images/c77b362823bc448bf6268c862a2c6ae8c0cbe92c11eed9cb0fed52cbb3223fbf.jpg) +Figure 2: Ablation study of the MPO algorithm and comparison to common baselines from the literature on three domains from the control suite. We plot the median performance over 10 experiments with different random seeds. + +# 5.1.2 COMPLETE RESULTS ON THE CONTROL SUITE + +The results for MPO (non-parameteric) – and a comparison to an implementation of state-of-the-art algorithms from the literature in our framework – on all the environments from the control suite that we tested on are shown in Figure 4. All tasks have rewards that are scaled to be between 0 and 1000. We note that in order to ensure a fair comparison all algorithms ran with exactly the same network configuration, used a single learner (no distributed computation), used the same optimizer and were tuned w.r.t. their hyperparameters for best performance across all tasks. We refer to the appendix for a complete description of the hyperparameters. Our comparison is made in terms of data-efficiency. + +From the plot a few trends are readily apparent: i) We can clearly observe the advantage in terms of data-efficiency that methods relying on a Q-critic obtain over the PPO baseline. This difference is so extreme that in several instances the PPO baseline converges an order of magnitude slower than the off-policy algorithms and we thus indicate the asymptotic performance of each algorithm of PPO and DDPG (which also improved significantly later during training in some instances) with a colored star in the plot; ii) the difference between the MPO results and the (expected) policy gradient (EPG) with entropy regularisation confirm our suspicion from Section 5.1.1: finding a good setting for the entropy regulariser that transfers across environments without additional constraints on the policy distribution is very difficult, leading to instabilities in the learning curves. In contrast to this the MPO results appear to be stable across all environments; iii) Finally, in terms of data-efficiency the methods utilising Retrace obtain a clear advantage over DDPG. The single learner vanilla DDPG implementation learns the lower dimensional environments quickly but suffers in terms of learning speed in environments with sparse rewards (finger, acrobot) and higher dimensional action spaces. Overall, MPO is able to solve all environments using surprisingly moderate amounts of data. On average less than 1000 trajectories (or $1 0 ^ { 6 }$ samples) are needed to reach the best performance. + +# 5.2 HIGH-DIMENSIONAL CONTINUOUS CONTROL + +Next we turn to evaluating our algorithm on two higher-dimensional continuous control problems; humanoid and walker. To make computation time bearable in these more complicated domains we utilize a parallel variant of our algorithm: in this implementation K learners are all independently collecting data from an instance of the environment. Updates are performed at the end of each collected trajectory using distributed synchronous gradient descent on a shared set of policy and Q-function parameters (we refer to the appendix for an algorithm description). The results of this experiment are depicted in Figure 3. + +For the Humanoid running domain we can observe a similar trend to the experiments from the previous section: MPO quickly finds a stable running policy, outperforming all other algorithms in terms of sample efficiency also in this high-dimensional control problem. + +The case for the Walker-2D parkour domain (where we compare against a PPO baseline) is even more striking: where standard PPO requires approximately 1M trajectories to find a good policy MPO finds a solution that is asymptotically no worse than the PPO solution in in about 70k trajectories (or 60M samples), resulting in an order of magnitude improvement. In addition to the walker experiment we have also evaluated MPO on the Parkour domain using a humanoid body (with 22 degrees of freedom) which was learned successfully (not shown in the plot, please see the supplementary video). + +![](images/3f0db1cdbd6cb97bb8fdb4b7ec7943a5ae55699354d37055db91d206400596e2.jpg) +Figure 3: MPO on high-dimensional control problems (Parkour Walker2D and Humanoid walking from control suite). + +![](images/b39b3f4bf39eeac87f2d9d9433c59fe69a73415f4747eb95d2ef18eb773ea4b6.jpg) + +# 5.3 DISCRETE CONTROL + +As a proof of concept – showcasing the robustness of our algorithm and its hyperparameters – we performed an experiment on a subset of the games contained contained in the "Arcade Learning Environment" (ALE) where we used the same hyperparameter settings for the KL constraints as for the continuous control experiments. The results of this experiment can be found in the Appendix. + +# 6 CONCLUSION + +We have presented a new off-policy reinforcement learning algorithm called Maximum a-posteriori Policy Optimisation (MPO). The algorithm is motivated by the connection between RL and inference and it consists of an alternating optimisation scheme that has a direct relation to several existing algorithms from the literature. Overall, we arrive at a novel, off-policy algorithm that is highly data efficient, robust to hyperparameter choices and applicable to complex control problems. We demonstrated the effectiveness of MPO on a large set of continuous control problems. + +![](images/1fb493111520008f89fe9fd5525df44f3315390e08daaf3a2e48f3e75e24a2a1.jpg) +Figure 4: Complete comparison of results for the control suite. We plot the median performance over 10 random seeds together with 5 and $95 \%$ quantiles (shaded area). Note that for DDPG we only plot the median to avoid clutter in the plots. For DDPG and PPO final performance is marked by a star). + +# REFERENCES + +Abbas Abdolmaleki, Bob Price, Nuno Lau, Luis Paulo Reis, Gerhard Neumann, et al. Deriving and improving cma-es with information geometric trust regions. Proceedings of the Genetic and Evolutionary Computation Conference, 2017. + +Marcin Andrychowicz, Filip Wolski, Alex Ray, Jonas Schneider, Rachel Fong, Peter Welinder, Bob McGrew, Josh Tobin, Pieter Abbeel, and Wojciech Zaremba. Hindsight experience replay, 2017. + +Trapit Bansal, Jakub Pachocki, Szymon Sidor, Ilya Sutskever, and Igor Mordatch. Emergent complexity via multi-agent competition, 2017. + +Marc G. Bellemare, Will Dabney, and Rémi Munos. A distributional perspective on reinforcement learning. In Proceedings of the 34th International Conference on Machine Learning, ICML, 2017. + +Yevgen Chebotar, Mrinal Kalakrishnan, Ali Yahya, Adrian Li, Stefan Schaal, and Sergey Levine. Path integral guided policy search. CoRR, abs/1610.00529, 2016. + +Kamil Ciosek and Shimon Whiteson. Expected policy gradients. CoRR, abs/1706.05374, 2017. + +C. Daniel, G. Neumann, O. Kroemer, and J. Peters. Hierarchical relative entropy policy search. Journal of Machine Learning Research (JMLR), 2016. + +Peter Dayan and Geoffrey E Hinton. Using expectation-maximization for reinforcement learning. Neural Computation, 9(2):271–278, 1997. + +Marc Peter Deisenroth, Gerhard Neumann, Jan Peters, et al. A survey on policy search for robotics. Foundations and Trends in Robotics, 2(1-2):1–142, 2013. + +Yan Duan, Xi Chen, Rein Houthooft, John Schulman, and Pieter Abbeel. Benchmarking deep reinforcement learning for continuous control. In Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48, ICML’16, pp. 1329– 1338. JMLR.org, 2016. URL http://dl.acm.org/citation.cfm?id $=$ 3045390. 3045531. + +Carlos Florensa, Yan Duan, and Pieter Abbeel. Stochastic neural networks for hierarchical reinforcement learning. CoRR, abs/1704.03012, 2017. + +Roy Fox, Ari Pakman, and Naftali Tishby. Taming the noise in reinforcement learning via soft updates. In Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence UAI, 2016. + +Shixiang Gu, Ethan Holly, Timothy Lillicrap, and Sergey Levine. Deep reinforcement learning for robotic manipulation. arXiv preprint arXiv:1610.00633, 2016a. + +Shixiang Gu, Tim Lillicrap, Ilya Sutskever, and Sergey Levine. Continuous deep q-learning with model-based acceleration. In International Conference on Machine Learning (ICML), 2016b. + +Shixiang Gu, Timothy Lillicrap, Zoubin Ghahramani, Richard E. Turner, and Sergey Levine. Qprop: Sample-efficient policy gradient with an off-policy critic. In 5th International Conference on Learning Representations (ICLR), 2017. + +Tuomas Haarnoja, Haoran Tang, Pieter Abbeel, and Sergey Levine. Reinforcement learning with deep energy-based policies. CoRR, abs/1702.08165, 2017. + +Nicolas Heess, Gregory Wayne, David Silver, Tim Lillicrap, Tom Erez, and Yuval Tassa. Learning continuous control policies by stochastic value gradients. In Advances in Neural Information Processing Systems (NIPS), pp. 2926–2934, 2015. + +Nicolas Heess, Srinivasan Sriram, Jay Lemmon, Josh Merel, Greg Wayne, Yuval Tassa, Tom Erez, Ziyu Wang, Ali Eslami, Martin Riedmiller, et al. Emergence of locomotion behaviours in rich environments. arXiv preprint arXiv:1707.02286, 2017. + +Jonathan Ho and Stefano Ermon. Generative adversarial imitation learning. In D. D. Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett (eds.), Advances in Neural Information Processing Systems 29, pp. 4565–4573. Curran Associates, Inc., 2016. URL http://papers. nips.cc/paper/6391-generative-adversarial-imitation-learning. pdf. + +Max Jaderberg, Volodymyr Mnih, Wojciech Marian Czarnecki, Tom Schaul, Joel Z Leibo, David Silver, and Koray Kavukcuoglu. Reinforcement learning with unsupervised auxiliary tasks, 2016. + +Leslie Pack Kaelbling, Michael L. Littman, and Andrew P. Moore. Reinforcement learning: A survey. Journal of Artificial Intelligence Research, 4:237–285, 1996. + +H J Kappen. Path integrals and symmetry breaking for optimal control theory. Journal of Statistical Mechanics: Theory and Experiment, 2005. + +Jens Kober and Jan Peters. Policy search for motor primitives in robotics. In Advances in neural information processing systems, pp. 849–856, 2009. + +Sergey Levine and Vladlen Koltun. Variational policy search via trajectory optimization. In Advances in Neural Information Processing Systems, pp. 207–215, 2013. + +Timothy P Lillicrap, Jonathan J Hunt, Alexander Pritzel, Nicolas Heess, Tom Erez, Yuval Tassa, David Silver, and Daan Wierstra. Continuous control with deep reinforcement learning. International Conference on Learning Representations (ICLR), 2016. + +Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A Rusu, Joel Veness, Marc G Bellemare, Alex Graves, Martin Riedmiller, Andreas K Fidjeland, Georg Ostrovski, et al. Human-level control through deep reinforcement learning. Nature, 518(7540):529–533, 2015. + +Volodymyr Mnih, Adria Puigdomenech Badia, Mehdi Mirza, Alex Graves, Timothy P Lillicrap, Tim Harley, David Silver, and Koray Kavukcuoglu. Asynchronous methods for deep reinforcement learning. In International Conference on Machine Learning (ICML), 2016. + +William Montgomery and Sergey Levine. Guided policy search as approximate mirror descent. CoRR, abs/1607.04614, 2016. URL http://arxiv.org/abs/1607.04614. + +Rémi Munos, Tom Stepleton, Anna Harutyunyan, and Marc G. Bellemare. Safe and efficient offpolicy reinforcement learning. In Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems (NIPS), 2016. + +Gerhard Neumann. Variational inference for policy search in changing situations. In Proceedings of the 28th international conference on machine learning (ICML-11), pp. 817–824, 2011. + +Brendan O’Donoghue, Rémi Munos, Koray Kavukcuoglu, and Volodymyr Mnih. PGQ: combining policy gradient and q-learning. CoRR, abs/1611.01626, 2016. + +Brendan O’Donoghue, Ian Osband, Rémi Munos, and Volodymyr Mnih. The uncertainty bellman equation and exploration. CoRR, abs/1709.05380, 2017. URL http://arxiv.org/abs/ 1709.05380. + +Xue Bin Peng, Glen Berseth, and Michiel van de Panne. Terrain-adaptive locomotion skills using deep reinforcement learning. ACM Transactions on Graphics (Proc. SIGGRAPH 2016), 2016. + +Theodore J. Perkins and Doina Precup. A convergent form of approximate policy iteration. In Advances in Neural Information Processing Systems 15 (NIPS). MIT Press, Cambridge, MA, 2002. + +Jan Peters, Katharina Mülling, and Yasemin Altün. Relative entropy policy search. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI), 2010a. + +Jan Peters, Katharina Mülling, and Yasemin Altun. Relative entropy policy search. In AAAI. Atlanta, 2010b. + +Konrad Rawlik, Marc Toussaint, and Sethu Vijayakumar. On stochastic optimal control and reinforcement learning by approximate inference. In (R:SS 2012), 2012. Runner Up Best Paper Award. + +Nicolas Le Roux. Efficient iterative policy optimization. CoRR, abs/1612.08967, 2016. URL http://arxiv.org/abs/1612.08967. + +John Schulman, Sergey Levine, Pieter Abbeel, Michael Jordan, and Philipp Moritz. Trust region policy optimization. In Proceedings of the 32nd International Conference on Machine Learning (ICML), 2015. + +John Schulman, Pieter Abbeel, and Xi Chen. Equivalence between policy gradients and soft qlearning. CoRR, abs/1704.06440, 2017a. + +John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algorithms. CoRR, abs/1707.06347, 2017b. URL http://arxiv.org/abs/ 1707.06347. + +David Silver, Guy Lever, Nicolas Heess, Thomas Degris, Daan Wierstra, and Martin Riedmiller. Deterministic policy gradient algorithms. In International Conference on Machine Learning (ICML), 2014. + +Richard S Sutton. Integrated architectures for learning, planning, and reacting based on approximating dynamic programming. In International Conference on Machine Learning (ICML), pp. 216–224, 1990. + +Yuval Tassa, Yotam Doron, Alistair Muldal, Tom Erez, Yazhe Li, Diego de Las Casas, David Budden, Abbas Abdolmaleki, Josh Merel, Andrew Lefrancq, Timothy Lillicrap, and Martin Riedmiller. Deepmind control suite, 2018. URL http://arxiv.org/abs/1801.00690. + +Evangelos Theodorou, Jonas Buchli, and Stefan Schaal. A generalized path integral control approach to reinforcement learning. Journal of Machine Learning Research (JMLR), 2010. + +Emanuel Todorov. General duality between optimal control and estimation. In Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008, December 9-11, 2008, Cancún, México, pp. 4286–4292, 2008. + +Ahmed Touati, Pierre-Luc Bacon, Doina Precup, and Pascal Vincent. Convergent tree-backup and retrace with function approximation. CoRR, abs/1705.09322, 2017. URL http://arxiv. org/abs/1705.09322. + +Marc Toussaint. Robot trajectory optimization using approximate inference. In Proceedings of the 26th Annual International Conference on Machine Learning, ICML ’09, pp. 1049–1056, 2009. ISBN 978-1-60558-516-1. + +Ziyu Wang, Victor Bapst, Nicolas Heess, Volodymyr Mnih, Rémi Munos, Koray Kavukcuoglu, and Nando de Freitas. Sample efficient actor-critic with experience replay. 5th International Conference on Learning Representations (ICLR), 2017. + +Christian Wirth, Johannes Furnkranz, and Gerhard Neumann. Model-free preference-based reinforcement learning. In 30th AAAI Conference on Artificial Intelligence, AAAI 2016, pp. 2222– 2228, 2016. + +Brian D Ziebart, Andrew L Maas, J Andrew Bagnell, and Anind K Dey. Maximum entropy inverse reinforcement learning. In AAAI, pp. 1433–1438, 2008. + +# A PROOF OF MONOTONIC IMPROVEMENT FOR THE KL-REGULARIZED POLICY OPTIMIZATION PROCEDURE + +In this section we prove a monotonic improvement guarantee for KL-regularized policy optimization via alternating updates on $\pi$ and $q$ under the assumption that the prior on $\theta$ is uninformative. + +# A.1 REGULARIZED REINFORCEMENT LEARNING + +Let $\pi$ be an arbitrary policy. For any other policy $q$ such that, for all $x , a , \{ \pi ( a | x ) > 0 \} \implies$ $\{ q ( a | x ) > 0 \}$ , define the $\pi$ -regularized reward for policy $q$ : + +$$ +r _ { \alpha } ^ { \pi , q } ( x , a ) = r ( x , a ) - \alpha \log \frac { q ( a | x ) } { \pi ( a | x ) } , +$$ + +where $\alpha > 0$ . + +Bellman operators: Define the $\pi$ -regularized Bellman operator for policy $q$ + +$$ +\begin{array} { r } { T _ { \alpha } ^ { \pi , q } V ( x ) = \mathbb { E } _ { a \sim q ( \cdot | x ) } \Big [ r _ { \alpha } ^ { \pi , q } ( x , a ) + \gamma \mathbb { E } _ { y \sim p ( \cdot | x , a ) } V ( y ) \Big ] , } \end{array} +$$ + +and the non-regularized Bellman operator for policy $q$ + +$$ +T ^ { q } V ( x ) = \mathbb { E } _ { a \sim q ( \cdot | x ) } \Big [ r ( x , a ) + \gamma \mathbb { E } _ { y \sim p ( \cdot | x , a ) } V ( y ) \Big ] . +$$ + +Value function: Define the $\pi$ -regularized value function for policy $q$ as + +$$ +V _ { \alpha } ^ { \pi , q } ( \boldsymbol { x } ) = \mathbb { E } _ { q } \Big [ \sum _ { t \geq 0 } \gamma ^ { t } r _ { \alpha } ^ { \pi , q } ( \boldsymbol { x } _ { t } , a _ { t } ) | \boldsymbol { x } _ { 0 } = \boldsymbol { x } , q \Big ] . +$$ + +and the non-regularized value function + +$$ +V ^ { q } ( x ) = \mathbb { E } _ { q } \Big [ \sum _ { t \geq 0 } \gamma ^ { t } r ( x _ { t } , a _ { t } ) | x _ { 0 } = x , q \Big ] . +$$ + +Proposition 1. For any $q , \pi , V$ , we have $V _ { \alpha } ^ { \pi , q } \leq V ^ { q }$ and $T _ { \alpha } ^ { \pi , q } V \le T ^ { q } V$ . Indeed + +$$ +\mathbb { E } _ { q } \Big [ \log \frac { q \big ( a _ { t } | x _ { t } \big ) } { \pi \big ( a _ { t } | x _ { t } \big ) } \Big ] = K L \big ( q ( \cdot | x _ { t } ) \| \pi ( \cdot | x _ { t } ) \big ) \geq 0 . +$$ + +Optimal value function and policy Define the optimal regularized value function: $V _ { \alpha } ^ { \pi , * } ( x ) =$ $\operatorname* { m a x } _ { q } V _ { \alpha } ^ { \pi , q } ( x )$ , and the optimal (non-regularized) value function: $V ^ { * } ( x ) = \operatorname* { m a x } _ { q } V ^ { q } ( x )$ . + +The optimal policy of the $\pi$ -regularized problem $q _ { \alpha } ^ { \pi , * } ( \cdot | x ) = \arg \operatorname* { m a x } _ { q } V _ { \alpha } ^ { \pi , q } ( x )$ and the optimal policy of the non-regularized problem $q ^ { * } ( \cdot | x ) = \arg \operatorname* { m a x } _ { q } V ^ { q }$ . + +Proposition 2. We have that $V _ { \alpha } ^ { \pi , q }$ is the unique fixed point of $T _ { \alpha } ^ { \pi , q }$ , and $V ^ { q }$ is the unique fixed point of $T ^ { q }$ . Thus we have the following Bellman equations: For all $x \in X$ , + +$$ +\begin{array} { r c l } { { V _ { \alpha } ^ { \pi , q } ( x ) } } & { { = } } & { { \displaystyle \sum _ { a } q ( a | x ) \Big [ r _ { \alpha } ^ { \pi , q } ( x , a ) + \gamma \mathbb { E } _ { y \sim p ( \cdot | x , a ) } \big [ V _ { \alpha } ^ { \pi , q } ( y ) \big ] \Big ] } } \\ { { } } & { { } } & { { } } \\ { { V ^ { q } ( x ) } } & { { = } } & { { \displaystyle \sum _ { a } q ( a | x ) \Big [ r ( x , a ) + \gamma \mathbb { E } _ { y \sim p ( \cdot | x , a ) } \big [ V ^ { q } ( y ) \big ] \Big ] } } \\ { { } } & { { } } & { { } } \\ { { V _ { \alpha } ^ { \pi , * } ( x ) } } & { { = } } & { { \displaystyle r _ { \alpha } ^ { \pi , q _ { \alpha } ^ { \pi , * } } ( x , a ) + \gamma \mathbb { E } _ { y \sim p ( \cdot | x , a ) } \big [ V _ { \alpha } ^ { \pi , * } ( y ) \big ] f o r a l l a \in A , } } \\ { { } } & { { } } & { { } } \\ { { V ^ { * } ( x ) } } & { { = } } & { { \displaystyle \operatorname* { m a x } _ { a \in A } \Big [ r ( x , a ) + \gamma \mathbb { E } _ { y \sim p ( \cdot | x , a ) } \big [ V ^ { * } ( y ) \big ] \Big ] . } } \end{array} +$$ + +Notice that (16) holds for all actions $a \in A$ , and not in expectation w.r.t. $a \sim q ( \cdot | x )$ only. + +# A.2 REGULARIZED JOINT POLICY GRADIENT + +We now consider a parametrized policy $\pi _ { \theta }$ and consider maximizing the regularized joint policy optimization problem for a given initial state $x _ { 0 }$ (this could be a distribution over initial states). Thus we want to find a parameter $\theta$ that (locally) maximizes + +$$ +\mathcal { I } ( \theta , q ) = V ^ { \pi _ { \theta } , q } ( \boldsymbol { x } _ { 0 } ) = \mathbb { E } _ { q } \Big [ \sum _ { t \geq 0 } \gamma ^ { t } \big ( r ( \boldsymbol { x } _ { t } , a _ { t } ) - \alpha \mathrm { K L } ( q ( \cdot | \boldsymbol { x } _ { t } ) | | \pi _ { \theta } ( \cdot | \boldsymbol { x } _ { t } ) ) \big ) \big | \boldsymbol { x } _ { 0 } , q \Big ] . +$$ + +We start with an initial parameter $\theta _ { 0 }$ and define a sequence of policies $\pi _ { i } = \pi _ { \theta _ { i } }$ parametrized by $\theta _ { i }$ , in the following way: + +• Given $\theta _ { i }$ , define + +$$ +q _ { i } = \arg \operatorname* { m a x } _ { q } T _ { \alpha } ^ { \pi _ { \theta _ { i } } , q } V ^ { \pi _ { \theta _ { i } } } , +$$ + +• Define $\theta _ { i + 1 }$ as + +$$ +\theta _ { i + 1 } = \theta _ { i } - \beta \nabla _ { \theta } \mathbb { E } _ { \pi _ { i } } \left[ \sum _ { t \geq 0 } \gamma ^ { t } \mathrm { K L } \big ( q _ { k } ( \cdot | x _ { t } ) | | \pi _ { \theta } ( \cdot | x _ { t } ) \big ) _ { | \theta = \theta _ { i } } \big | x _ { 0 } , \pi _ { i } \right] . +$$ + +Proposition 3. We have the following properties: + +• The policy $q _ { i }$ satisfies: + +$$ +q _ { i } ( a | x ) = \frac { \pi _ { i } ( a | x ) e ^ { \frac { 1 } { \alpha } Q ^ { \pi _ { i } } ( x , a ) } } { \mathbb { E } _ { b \sim \pi _ { i } ( \cdot | x ) } \big [ e ^ { \frac { 1 } { \alpha } Q ^ { \pi _ { i } } ( x , b ) } \big ] } , +$$ + +where $Q ^ { \pi } ( x , a ) = r ( x , a ) + \gamma \mathbb { E } _ { y \sim p ( \cdot | x , a ) } V ^ { \pi } ( y ) .$ + +• We have + +$$ +V _ { \alpha } ^ { \pi _ { i } , q _ { i } } \geq V ^ { \pi _ { i } } . +$$ + +• For η sufficiently small, we have + +$$ +\mathcal { I } ( \theta _ { i + 1 } , q _ { i + 1 } ) \geq \mathcal { I } ( \theta _ { i } , q _ { i } ) + c g _ { i } , +$$ + +where c is a numerical constant, and $g _ { i }$ is the norm of the gradient (minimized by the algorithm): + +$$ +g _ { i } = \Big \| \nabla _ { \theta } \mathbb { E } _ { \pi _ { i } } \Big [ \sum _ { t \geq 0 } \gamma ^ { t } K L \big ( q _ { i } ( \cdot | x _ { t } ) \| \pi _ { \theta } ( \cdot | x _ { t } ) \big ) _ { | \theta = \theta _ { i } } \big | x _ { 0 } , \pi _ { i } \Big ] \Big \| . +$$ + +Thus we build a sequence of policies $( \pi _ { \theta _ { i } } , q _ { i } )$ whose values $\mathcal { I } ( \theta _ { i } , q _ { i } )$ are non-decreasing thus converge to a local maximum. In addition, the improvement is lower-bounded by $a$ constant times the norm of the gradient, thus the algorithm keeps improving the performance until the gradient vanishes (when we reach the limit of the capacity of our representation). + +Proof. We have + +$$ +\begin{array} { r l r } { q _ { i } ( \cdot | x ) } & { = } & { \arg \underset { q } { \operatorname* { m a x } } \mathbb { E } _ { a \sim q ( \cdot | x ) } \Big [ \underset { Q ^ { \pi _ { i } } ( x , a ) } { \underbrace { r \big ( x , a ) + \gamma \mathbb { E } _ { y \sim p ( \cdot | x , a ) } V ^ { \pi _ { i } } ( y ) } } - \alpha \log \frac { q \big ( a | x \big ) } { \pi _ { i } \big ( a | x \big ) } \Big ] , } \end{array} +$$ + +from which we deduce (19). Now, from the definition of $q _ { i }$ , we have + +$$ +T _ { \alpha } ^ { \pi _ { i } , q _ { i } } V ^ { \pi _ { i } } \geq T _ { \alpha } ^ { \pi _ { i } , \pi _ { i } } V ^ { \pi _ { i } } = T ^ { \pi _ { i } } V ^ { \pi _ { i } } = V ^ { \pi _ { i } } . +$$ + +Now, since and its fixe $T _ { \alpha } ^ { \pi _ { i } , q _ { i } }$ is is otone operator (i.e. if , we have $V _ { 1 } \geq V _ { 2 }$ elementwise, then $T _ { \alpha } ^ { \pi _ { i } , q _ { i } } V _ { 1 } \geq T _ { \alpha } ^ { \pi _ { i } , q _ { i } } V _ { 2 } )$ $V _ { \alpha } ^ { \pi _ { i } , q _ { i } }$ + +$$ +V _ { \alpha } ^ { \pi _ { i } , q _ { i } } = \operatorname* { l i m } _ { t \to \infty } ( T _ { \alpha } ^ { \pi _ { i } , q _ { i } } ) ^ { t } V ^ { \pi _ { i } } \geq V ^ { \pi _ { i } } , +$$ + +which proves (20). + +Now, in order to prove (21) we derive the following steps. + +Step 1: From the definition of $q _ { i + 1 }$ we have, for any $x$ + +$$ +\begin{array} { r } { \tilde { \Sigma } _ { a \sim q _ { 4 } + 1 } \left[ Q ^ { \pi _ { i + 1 } } ( x , a ) \right] - \alpha \mathbf { K L } \left( q _ { i + 1 } ( \cdot | x ) \| \pi _ { i + 1 } ( \cdot | x ) \right) \geq \mathbb { E } _ { a \sim q _ { 4 } } \left[ Q ^ { \pi _ { i + 1 } } ( x , a ) \right] - \alpha \mathbf { K L } \left( q _ { i } ( \cdot | x ) \| \pi _ { i + 1 } ( \cdot | x ) \right) } \end{array} +$$ + +Writing the functional that we minimize + +$$ +f ( \pi , q , \theta ) = \mathbb { E } _ { \pi } \Big [ \sum _ { t \geq 0 } \gamma ^ { t } \mathrm { K L } \big ( q ( \cdot | x _ { t } ) \| \pi _ { \theta } ( \cdot | x _ { t } ) \big ) \big | x _ { 0 } , \pi \Big ] , +$$ + +the update rule is $\theta _ { i + 1 } = \theta _ { i } - \beta \nabla _ { \theta } f ( \pi _ { i } , q _ { i } , \theta _ { i } )$ . Thus we have that for sufficiently small $\beta$ , + +$$ +f ( \pi _ { i } , q _ { i } , \theta _ { i + 1 } ) \leq f ( \pi _ { i } , q _ { i } , \theta _ { i } ) - \beta g _ { i } , +$$ + +where $\begin{array} { r } { g _ { i } = \frac { 1 } { 2 } \| \nabla _ { \theta } f ( \pi _ { i } , q _ { i } , \theta _ { i } ) \| } \end{array}$ . + +Step 2: Now define $\mathcal { F }$ : + +$$ +\begin{array} { r c l } { \mathcal { F } ( \pi , q , \theta , \pi ^ { \prime } ) } & { = } & { \displaystyle \mathbb { E } _ { \pi } \left[ \sum _ { t \geq 0 } \gamma ^ { t } \big ( \mathbb { E } _ { a \sim q } \big [ Q ^ { \pi ^ { \prime } } ( x _ { t } , a ) \big ] - \alpha \mathrm { K L } \big ( q ( \cdot | x _ { t } ) \| \pi _ { \theta } ( \cdot | x _ { t } ) \big ) \big ) \big | x _ { 0 } , \pi \right] } \\ & { = } & { \displaystyle \delta _ { x _ { 0 } } \big ( I - \gamma P ^ { \pi } \big ) ^ { - 1 } T _ { \alpha } ^ { \pi _ { \theta } , q } V ^ { \pi ^ { \prime } } } \\ & { = } & { \delta _ { x _ { 0 } } \big ( I - \gamma P ^ { \pi } \big ) ^ { - 1 } T ^ { q } V ^ { \pi ^ { \prime } } - f ( \pi , q , \theta ) , } \end{array} +$$ + +where $\delta _ { x _ { 0 } }$ is a Dirac (in the row vector $x _ { 0 }$ ), and $P ^ { \pi }$ is the transition matrix for policy $\pi$ + +From (22) and (23) we deduce that + +$$ +\begin{array} { r c l } { \mathcal { F } ( \pi _ { i } , q _ { i + 1 } , \theta _ { i + 1 } , \pi _ { i + 1 } ) } & { \geq } & { \mathcal { F } ( \pi _ { i } , q _ { i } , \theta _ { i + 1 } , \pi _ { i + 1 } ) } \\ & { \geq } & { \mathcal { F } ( \pi _ { i } , q _ { i } , \theta _ { i } , \pi _ { i + 1 } ) + \beta g _ { i } . } \end{array} +$$ + +We deduce + +$$ +\begin{array} { r l } & { \mathcal { F } ( \pi _ { i } , q _ { i + 1 } , \theta _ { i + 1 } , \pi _ { i } ) } \\ { \geq } & { \mathcal { F } ( \pi _ { i } , q _ { i } , \theta _ { i } , \pi _ { i } ) + \beta g _ { i } } \\ & { + \mathcal { F } ( \pi _ { i } , q _ { i + 1 } , \theta _ { i + 1 } , \pi _ { i } ) - \mathcal { F } ( \pi _ { i } , q _ { i + 1 } , \theta _ { i + 1 } , \pi _ { i + 1 } ) + \mathcal { F } ( \pi _ { i } , q _ { i } , \theta _ { i } , \pi _ { i + 1 } ) - \mathcal { F } ( \pi _ { i } , q _ { i } , \theta _ { i } , \pi _ { i } ) } \\ { = } & { \mathcal { F } ( \pi _ { i } , q _ { i } , \theta _ { i } , \pi _ { i } ) + \beta g _ { i } + } \\ & { \mathbb { E } _ { \pi _ { i } } \Big [ \displaystyle \sum _ { t \geq 0 } \gamma ^ { t } \big ( \mathbb { E } _ { a \sim q _ { i + 1 } } \big [ Q ^ { \pi _ { i } } ( x _ { t } , a ) - Q ^ { \pi _ { i + 1 } } ( x _ { t } , a ) \big ] - \mathbb { E } _ { a \sim q _ { i } } \big [ Q ^ { \pi _ { i } } ( x _ { t } , a ) - Q ^ { \pi _ { i + 1 } } ( x _ { t } , a ) \big ] \big ) \Big ] } \end{array} +$$ + +This rewrites: + +$$ +\delta _ { x _ { 0 } } ( I - \gamma ^ { \pi _ { i } } ) ^ { - 1 } \big ( T _ { \alpha } ^ { q _ { i + 1 } , \pi _ { i + 1 } } V ^ { \pi _ { i } } - T _ { \alpha } ^ { q _ { i } , \pi _ { i } } V ^ { \pi _ { i } } \big ) \geq \eta g _ { i } + O ( \beta ^ { 2 } ) . +$$ + +Step 3: Now a bit of algebra. For two stochastic matrices $P$ and $P ^ { \prime }$ , we have + +$$ +\begin{array} { r l } & { ( I - \gamma P ) ^ { - 1 } } \\ { = } & { ( I - \gamma P ^ { \prime } ) ^ { - 1 } + \gamma ( I - \gamma P ) ^ { - 1 } ( P - P ^ { \prime } ) ( I - \gamma P ^ { \prime } ) ^ { - 1 } } \\ { = } & { ( I - \gamma P ^ { \prime } ) ^ { - 1 } + \gamma \big [ ( I - \gamma P ^ { \prime } ) ^ { - 1 } + \gamma ( I - \gamma P ) ^ { - 1 } ( P - P ^ { \prime } ) ( I - \gamma P ^ { \prime } ) ^ { - 1 } \big ] ( P - P ^ { \prime } ) ( I - \gamma P ^ { \prime } ) ^ { - 1 } } \\ { = } & { ( I - \gamma P ^ { \prime } ) ^ { - 1 } + \gamma ( I - \gamma P ^ { \prime } ) ^ { - 1 } ( P - P ^ { \prime } ) ( I - \gamma P ^ { \prime } ) ^ { - 1 } } \\ & { + \gamma ^ { 2 } ( I - \gamma P ) ^ { - 1 } ( P - P ^ { \prime } ) ( I - \gamma P ^ { \prime } ) ^ { - 1 } ( P - P ^ { \prime } ) ( I - \gamma P ^ { \prime } ) ^ { - 1 } . } \end{array} +$$ + +Applying this equality to the transition matrices $P ^ { \pi _ { k } }$ and $P ^ { \pi _ { k + 1 } }$ and since $\lVert P ^ { \pi _ { k + 1 } } - P ^ { \pi _ { k } } \rVert = O ( \eta )$ , we have: + +$$ +\begin{array} { r l } & { V _ { \alpha } ^ { q _ { i + 1 } , \pi _ { i + 1 } } } \\ { = } & { ( I - \gamma P ^ { \pi _ { i } } ) ^ { - 1 } r _ { \alpha } ^ { q _ { i + 1 } , \pi _ { i + 1 } } } \\ { = } & { ( I - \gamma P ^ { \pi _ { i } } ) ^ { - 1 } r _ { \alpha } ^ { q _ { i + 1 } , \pi _ { i + 1 } } + \gamma ( I - \gamma P ^ { \pi _ { i } } ) ^ { - 1 } ( P ^ { \pi _ { i + 1 } } - P ^ { \pi _ { i } } ) ( I - \gamma P ^ { \pi _ { i } } ) ^ { - 1 } r _ { \alpha } ^ { q _ { i + 1 } , \pi _ { i + 1 } } + O ( \beta ^ { 2 } ) } \\ { = } & { ( I - \gamma P ^ { \pi _ { i } } ) ^ { - 1 } r _ { \alpha } ^ { q _ { i } , \pi _ { i } } + ( I - \gamma P ^ { \pi _ { i } } ) ^ { - 1 } ( r _ { \alpha } ^ { q _ { i + 1 } , \pi _ { i + 1 } } - r _ { \alpha } ^ { q _ { i } , \pi _ { i } } + \gamma P ^ { \pi _ { i + 1 } } - \gamma P ^ { \pi _ { i } } ) ( I - \gamma P ^ { \pi _ { i } } ) ^ { - 1 } r _ { \alpha } ^ { q _ { i } , \pi _ { i } } } \\ { = } & { V _ { \alpha } ^ { q _ { i } , \pi _ { i } } + ( I - \gamma P ^ { \pi _ { i } } ) ^ { - 1 } ( T _ { \alpha } ^ { q _ { i + 1 } , \pi _ { i } + 1 } V ^ { \pi _ { i } } - T _ { \alpha } ^ { q _ { i } , \pi _ { i } } V ^ { \pi _ { k } } ) + O ( \beta ^ { 2 } ) . } \end{array} +$$ + +Table 1: Results on a subset of the ALE environments in comparison to baselines taken from (Bellemare et al., 2017) + +
Game/AgentHumanDQNPrior. DuelingC51MPO
19.520.9
Pong Breakout14.6 30.5385.5366.020.9 74820.9 360.5
13,455.013,117.318,760.323,784
Q*bert Tennis-8.312.20.023.110,317.0
98.922.2
Boxing12.188.097.882.0
+ +Finally, using (24), we deduce that + +$$ +\begin{array} { l l l } { \mathcal { I } ( \theta _ { i + 1 } , q _ { i + 1 } ) } & { = } & { V _ { \alpha } ^ { q _ { i } + 1 , \pi _ { i } + 1 } \big ( x _ { 0 } \big ) } \\ & { = } & { V _ { \alpha } ^ { q _ { i } , \pi _ { i } } \big ( x _ { 0 } \big ) + \delta _ { x _ { 0 } } \big ( I - \gamma P ^ { \pi _ { i } } \big ) ^ { - 1 } \big ( T _ { \alpha } ^ { q _ { i } + 1 , \pi _ { i + 1 } } V ^ { \pi _ { i } } - T _ { \alpha } ^ { q _ { i } , \pi _ { i } } V ^ { \pi _ { i } } \big ) + O ( \beta ^ { 2 } ) } \\ & { \geq } & { \mathcal { I } ( \theta _ { i } , q _ { i } ) + \eta g _ { i } + O ( \beta ^ { 2 } ) } \\ & { \geq } & { \mathcal { I } ( \theta _ { i } , q _ { i } ) + \frac { 1 } { 2 } \eta g _ { i } , } \end{array} +$$ + +for small enough $\eta$ . + +# B ADDITIONAL EXPERIMENT: DISCRETE CONTROL + +As a proof of concept – showcasing the robustness of our algorithm and its hyperparameters – we performed an experiment on a subset of the games contained contained in the "Arcade Learning Environment" (ALE). For this experiment we used the same hyperparameter settings for the KL constraints as for the continuous control experiments as well as the same learning rate and merely altered the network architecture to the standard network structure used by DQN Mnih et al. (2015) – and created a seperate network with the same architecture, but predicting the parameters of the policy distribution. A comparison between our algorithm and well established baselines from the literature, in terms of the mean performance, is listed in Table 1. While we do not obtain state-ofthe-art performance in this experiment, the fact that MPO is competitive, out-of-the-box in these domains suggests that combining the ideas presented in this paper with recent advances for RL with discrete actions (Bellemare et al., 2017) could be a fruitful avenue for future work. + +# C EXPERIMENT DETAILS + +In this section we give the details on the hyper-parameters used for each experiment. All the continuous control experiments use a feed-forward network except for Parkour-2d were we used the same network architecture as in Heess et al. (2017). Other hyper parameters for MPO with non parametric variational distribution were set as follows, + +Table 2: Parameters for non-parametric variational distribution + +
Hyperparametercontrol suitehumanoid
Policy net100-100200-200
Q function net200-200300-300
E0.11
Eμ0.1"
£0.0001"
Discount factor()0.991
Adam learning rate0.00051
+ +Hyperparameters for MPO with parametric variational distribution were as follows, + +Table 3: Parameters for parametric variational distribution + +
Hyperparametercontrol suite taskshumanoid
Policy net100-100200-200
Q function net200-200300-300
Eμ0.11
£0.00011
Discount factor ()0.991
Adam learning rate0.00051
+ +# D DERIVATION OF UPDATE RULES FOR A GAUSSIAN POLICY + +For continuous control we assume that the policy is given by a Gaussian distribution with a full covariance matrix, i.e, $\pi ( \boldsymbol { a } | \boldsymbol { s } , \pmb { \theta } ) = \mathcal { N } \left( \mu , \pmb { \Sigma } \right)$ . Our neural network outputs the mean $\mu = \mu ( s )$ and Cholesky factor $A = A ( s )$ , such that $\Sigma = A A ^ { T }$ . The lower triagular factor $A$ has positive diagonal elements enforced by the softplus transform $A _ { i i } \log ( 1 + \exp ( A _ { i i } ) )$ . + +# D.1 NON-PARAMETRIC VARIATIONAL DISTRIBUTION + +In this section we provide the derivations and implementation details for the non-parametric variational distribution case for both $\mathrm { E }$ -step and M-step. + +# D.2 E-STEP + +The E-step with a non-parametric variational solves the following program, where we have replaced expectations with integrals to simplify the following derivations: + +$$ +\begin{array} { l } { \displaystyle \operatorname* { m a x } _ { q } \int \mu _ { q } ( s ) \int q ( a | s ) Q _ { \theta _ { i } } ( s , a ) d a d s } \\ { \displaystyle s . t . \int \mu _ { q } ( s ) { \bf K L } ( q ( a | s ) , \pi ( a | s , \theta _ { i } ) ) d a < \epsilon , } \\ { \displaystyle \iint \mu _ { q } ( s ) q ( a | s ) d a d s = 1 . } \end{array} +$$ + +First we write the Lagrangian equation, i.e, + +$$ +\begin{array} { c } { { L ( q , \eta , \gamma ) = \displaystyle \int \mu _ { q } ( s ) \int q ( a | s ) Q _ { \theta _ { i } } ( s , a ) d a d s + } } \\ { { \displaystyle \eta \left( \epsilon - \int \mu _ { q } ( s ) \int q ( a | s ) \log \frac { q ( a | s ) } { \pi ( a | s , \theta _ { i } ) } \right) + \gamma \left( 1 - \displaystyle \iint \mu _ { q } ( s ) q ( a | s ) d a d s \right) . } } \end{array} +$$ + +Next we maximise the Lagrangian $L$ w.r.t the primal variable $q$ . The derivative w.r.t $q$ reads, + +$$ +\partial q L ( q , \eta , \gamma ) = Q _ { \theta _ { i } } ( a , s ) - \eta \log q ( a | s ) + \eta \log \pi ( a | s , \pmb \theta _ { i } ) - ( \eta - \gamma ) . +$$ + +Setting it to zero and rearranging terms we get + +$$ +q ( a | s ) = \pi ( a | s , \pmb { \theta } _ { i } ) \exp \left( \frac { Q _ { \pmb { \theta } _ { i } } ( a , s ) } { \eta } \right) \exp \left( - \frac { \eta - \gamma } { \eta } \right) . +$$ + +However the last exponential term is a normalisation constant for $q$ . Therefore we can write, + +$$ +\exp ( - \frac { \eta - \gamma } { \eta } ) = \int \pi ( a | s , \pmb { \theta } _ { i } ) \exp ( \frac { Q _ { \pmb { \theta } _ { i } } ( a , s ) } { \eta } ) d a , +$$ + +$$ +\gamma = \eta - \eta \log \left( \int \pi ( a | s , \pmb { \theta } _ { i } ) \exp ( \frac { Q _ { \pmb { \theta } _ { i } } ( a , s ) } { \eta } ) d a \right) . +$$ + +Note that we could write $\gamma$ based on $\pi$ and $\eta$ . At this point we can derive the dual function, + +$$ +g ( \eta ) = \eta \epsilon + \eta \int \mu _ { q } ( s ) \log \left( \int \pi ( a | s , \pmb { \theta } _ { i } ) \exp ( \frac { Q ( a , s ) } { \eta } ) d a \right) . +$$ + +# D.3 M-STEP + +To obtain the KL constraint in the $\mathbf { M }$ step we set $p ( \theta )$ to a Gaussian prior around the current policy, i.e, + +$$ +p ( \pmb \theta ) \approx \mathcal { N } \Big ( \mu = \pmb \theta _ { i } , \Sigma = \frac { F _ { \pmb \theta _ { i } } } { \lambda } \Big ) , +$$ + +where $\theta _ { i }$ are the parameters of the current policy distribution, $F _ { \pmb { \theta } _ { i } }$ is the empirical Fisher information matrix and $\lambda$ . + +With this, and dropping constant terms our optimization program becomes + +$$ +\operatorname* { m a x } _ { \pi } \int \mu _ { q } ( s ) \int q ( a | s ) \log \pi ( a | s , \pmb { \theta } ) d a d s - \lambda ( \pmb { \theta } - \pmb { \theta } _ { i } ) ^ { T } F _ { \pmb { \theta _ { i } } } ^ { - 1 } ( \pmb { \theta } - \pmb { \theta } _ { i } ) . +$$ + +We can observe that $( \pmb \theta - \pmb \theta _ { i } ) ^ { T } F _ { \pmb \theta _ { i } } ^ { - 1 } ( \pmb \theta - \pmb \theta _ { i } )$ is the second order Taylor approximation of $\begin{array} { r } { \int \mu _ { q } ( s ) \mathrm { K L } ( \pi ( a | s , \pmb { \theta } _ { i } ) , \pi ( a | s , \pmb { \theta } ) ) d s } \end{array}$ which leads us to the generalized M-step objective: + +$$ +\operatorname* { m a x } _ { \pi } \int \mu _ { q } ( s ) \int q ( a | s ) \log \pi ( a | s , \theta ) d a d s - \lambda \int \mu _ { q } ( s ) \mathbf { K L } ( \pi ( a | s , \theta _ { i } ) , \pi ( a | s , \theta ) ) d s +$$ + +which corresponds to Equation (11) from the main text, where expectations are replaced by integrals. + +After obtaining the non parametric variational distribution in the $\mathbf { M }$ step with a Gaussian policy we empirically observed that better results could be achieved by decoupling the KL constraint into two terms such that we can constrain the contribution of the mean and covariance separately i.e. + +$$ +\int \mu _ { q } ( s ) \mathrm { K L } ( \pi _ { i } ( a | s , \pmb \theta ) , \pi ( a | s , \pmb \theta ) ) = C _ { \mu } + C _ { \Sigma } , +$$ + +where + +$$ +\begin{array} { c } { { C _ { \mu } = \displaystyle \int \mu _ { q } ( s ) \frac 1 2 \big ( \mathrm { t r } \big ( \Sigma ^ { - 1 } \Sigma _ { i } \big ) - n + \mathrm { l n } ( \frac { \Sigma } { \Sigma _ { i } } ) \big ) d s , } } \\ { { { } } } \\ { { C _ { \Sigma } = \displaystyle \int \mu _ { q } ( s ) \frac 1 2 \big ( \mu - \mu _ { i } \big ) ^ { T } \Sigma ^ { - 1 } ( \mu - \mu _ { i } ) d s . } } \end{array} +$$ + +This decoupling allows us to set different $\epsilon$ values for each component, i.e., $\epsilon _ { \mu } , \epsilon _ { \Sigma }$ for the mean, the covariance matrix respectively. Different $\epsilon$ lead to different learning rates. The effectivness of this decoupling has also been shown in Abdolmaleki et al. (2017). We always set a much smaller epsilon for covariance than the mean. The intuition is that while we would like the distribution moves fast in the action space, we also want to keep the exploration to avoid premature convergence. + +In order to solve the constrained optimisation in the M-step, we first write the generalised Lagrangian equation, i.e, + +$$ +L ( \pmb \theta , \eta _ { \mu } , \eta _ { \Sigma } ) = \int \mu _ { q } ( s ) \int q ( a | s ) \log \pi ( a | s , \pmb \theta ) d a d s + \eta _ { \mu } ( \epsilon _ { \mu } - C _ { \mu } ) + \eta _ { \Sigma } ( \epsilon _ { \Sigma } - C _ { \Sigma } ) +$$ + +Where $\eta _ { \mu }$ and $\eta _ { \Sigma }$ are Lagrangian multipliers. Following prior work on constraint optimisation, we formulate the following primal problem, + +$$ +\operatorname* { m a x } _ { \pmb { \theta } } \operatorname* { m i n } _ { \eta _ { \mu } > 0 , \eta _ { \Sigma } > 0 } L ( \pmb { \theta } , \eta _ { \mu } , \eta _ { \Sigma } ) . +$$ + +In order to solve for $\pmb \theta$ we iteratively solve the inner and outer optimisation programs independently: We fix the Lagrangian multipliers to their current value and optimise for $\pmb \theta$ (outer maximisation) and then fix the parameters $\pmb \theta$ to their current value and optimise for the Lagrangian multipliers (inner minimisation). We continue this procedure until policy parameters $\pmb { \theta }$ and Lagrangian multipliers converge. Please note that the same approach can be employed to bound the KL explicitly instead of decoupling the contribution of mean and covariance matrix to the KL. + +# D.4 PARAMETRIC VARIATIONAL DISTRIBUTION + +In this case we assume our variational distribution also uses a Gaussian distribution over the action space and use the same structure as our policy $\pi$ . + +Similar to the non-parametric case for a Gaussian distribution in the M-step we also use a decoupled KL but this time in the E-step for a Gaussian variational distribution. Using the same reasoning as in the previous section we can obtain the following generalized Lagrangian equation: + +$$ +L ( \theta ^ { q } , \eta _ { \mu } , \eta _ { \Sigma } ) = \int \mu _ { q } ( s ) \int q ( a | s ; \theta ^ { q } ) A _ { i } ( a , s ) d a d s + \eta _ { \mu } ( \epsilon _ { \mu } - C _ { \mu } ) + \eta _ { \Sigma } ( \epsilon _ { \Sigma } - C _ { \Sigma } ) . +$$ + +Where $\eta _ { \mu }$ and $\eta _ { \Sigma }$ are Lagrangian multipliers. And where we use the advantage function $A ( a , s )$ instead of the $\mathrm { Q }$ function $Q ( a , s )$ , as it empirically gave better performance. Please note that the KL in the $\mathrm { E }$ -step is different than the one used in the M-step. Following prior works on constraint optimisation, we can formulate the following primal problem, + +$$ +\operatorname* { m a x } _ { \pmb { \theta } ^ { q } } \operatorname* { m i n } _ { \eta _ { \mu } > 0 , \eta _ { \Sigma } > 0 } L ( \pmb { \theta } ^ { q } , \eta _ { \mu } , \eta _ { \Sigma } ) +$$ + +In order to solve for $\pmb { \theta } ^ { q }$ we iteratively solve the inner and outer optimisation programs independently. In order to that we fix the Lagrangian multipliers to their current value and optimise for $\pmb { \theta } ^ { q }$ (outer maximisation), in this case we use the likelihood ratio gradient to compute the gradient w.r.t $\pmb { \theta } ^ { q }$ . Subsequently we fix the parameters $\pmb { \theta } ^ { q }$ to their current value and optimise for Lagrangian multipliers (inner minimisation). We iteratively continue this procedure until the policy parameters $\pmb { \theta } ^ { q }$ and the Lagrangian multipliers converges. Please note that the same approach can be used to bound the KL explicitly instead of decoupling the contribution of mean and covariance matrix to the KL. As our policy has the same structure as the parametric variational distribution, the M step in this case reduce to set the policy parameters $\pmb { \theta }$ to the parameters $\pmb { \theta } ^ { q }$ we obtained in E-step, i.e, + +$$ +\pmb \theta _ { i + 1 } = \pmb \theta ^ { q } +$$ + +# E IMPLEMENTATION DETAILS + +While we ran most of our experiments using a single learner, we implemented a scalable variant of the presented method in which multiple workers collect data independently in an instance of the considered environment, compute gradients and send them to a chief (or parameter server) that performs parameter update by averaging gradients. That is we use distributed synchronous gradient descent. These procedures are described in Algorithms 1 and 2 for the non-parametric case and 3 for the parametric case. + +# Algorithm 1 MPO (chief) + +1: Input $G$ number of gradients to average +2: while True do +3: initialize $\Nu = 0$ +4: initialize gradient store $s _ { \phi } = \{ \} , s _ { \eta } = \{ \} , s _ { \eta _ { \mu } } = \{ \} , s _ { \eta _ { \Sigma } } = \{ \} \ : s _ { \theta } = \{ \}$ +5: while $N < G$ do +6: receive next gradient from worker $w$ +7: $\begin{array} { l } { { s _ { \phi } = s _ { \phi } + [ \bar { \delta } \phi ^ { w } ] } } \\ { { s _ { \phi } = s _ { \theta } + [ \delta \theta ^ { w } ] } } \\ { { s _ { \eta } = s _ { \eta } + [ \delta \eta ^ { w } ] } } \\ { { s _ { \eta _ { \mu } } = s _ { \eta _ { \mu } } + [ \delta \eta _ { \mu } ^ { w } ] } } \\ { { s _ { \eta _ { \theta } } = s _ { \eta _ { \theta } } + [ \delta \eta _ { \theta } ^ { w } ] } } \end{array}$ +8: +9: +10: +11: +12: update parameters with average gradient from +13: $s _ { \phi }$ , sη, sηµ, sηΣ sθ +14: send new parameters to workers + +# Algorithm 2 MPO (worker) - Non parametric variational distribution + +1: Input = , Σ, µ, Lmax +2: $i = 0$ , $L _ { \mathrm { c u r r } } = 0$ +3: Initialise $Q _ { \omega _ { i } } ( a , s ) , \pi ( a | s , \pmb { \theta } _ { i } ) , \eta , \eta _ { \mu } , \eta _ { \Sigma }$ +4: for each worker do +5: while $L _ { \mathrm { c u r r } } > L _ { \mathrm { m a x } }$ do +6: update replay buffer $\boldsymbol { B }$ with $\mathrm { L }$ trajectories from the environment +7: $\bar { k = 0 }$ +8: // Find better policy by gradient descent +9: while $k < 1 0 0 0$ do +10: sample a mini-batch $\boldsymbol { B }$ of $N$ $( s , a , r )$ pairs from replay +11: sample $M$ additional actions for each state from $\boldsymbol { B }$ , $\bar { \pi } ( \bar { a } | s , \pmb \theta _ { i } )$ for estimating integrals +12: compute gradients, estimating integrals using samples +13: // Q-function gradient: +14: $\delta _ { \phi } = \partial _ { \phi } L _ { \phi } ^ { \prime } ( \phi )$ +15: // E-Step gradient: +16: $\delta \eta = \bar { \partial _ { \eta } g ( \eta ) }$ +17: Let: q(a|s) ∝ π(a|s, θi) exp( Qθt (a,s,φ0)η ) +18: // M-Step gradient: +19: $[ \delta _ { \eta _ { \mu } } , \delta _ { \eta _ { \Sigma } } ] \stackrel { - } { = } \alpha \partial _ { \eta _ { \mu } , \eta _ { \Sigma } } { \cal L } ( \theta _ { k } , \eta _ { \mu } , \eta _ { \Sigma } )$ +20: $\delta _ { \theta } = \partial _ { \theta } L ( \theta , \eta _ { \mu _ { k + 1 } } , \eta _ { \Sigma k + 1 } )$ +21: send gradients to chief worker +22: wait for gradient update by chief +23: fetch new parameters $\phi , \theta , \eta , \eta _ { \mu } , \eta _ { \Sigma }$ +24: $\begin{array} { r } { k = k + 1 ^ { \circ } } \\ { i = i + 1 , L _ { \mathrm { c u r r } } = L _ { \mathrm { c u r r } } + L } \\ { \pmb { \theta } _ { i } = \pmb { \theta } , \phi ^ { \prime } = \phi } \end{array}$ +25: +26: + +# Algorithm 3 MPO (worker) - parametric variational distribution + +1: Input = Σ, µ, Lmax +2: $i = 0$ , Lcurr = 0 +3: Initialise $Q _ { \omega _ { i } } ( a , s ) , \pi ( a | s , \pmb { \theta } _ { i } ) , \eta , \eta _ { \mu } , \eta _ { \Sigma }$ +4: for each worker do +5: while $L _ { \mathrm { c u r r } } < L _ { \mathrm { m a x } }$ do +6: update replay buffer $\boldsymbol { B }$ with $\mathrm { L }$ trajectories from the environment +7: $k = 0$ +8: // Find better policy by gradient descent +9: while $k < 1 0 0 0$ do +10: sample a mini-batch $\boldsymbol { B }$ of $\mathrm { ~ V ~ } ( s , a , r )$ pairs from replay +11: sample $M$ additional actions for each state from $\boldsymbol { B }$ , $\dot { \pi } ( a | s , \theta _ { k } )$ for estimating inte +grals +12: compute gradients, estimating integrals using samples +13: // Q-function gradient: +14: $\delta _ { \phi } = \partial _ { \phi } L _ { \phi } ^ { \prime } ( \phi )$ +15: // E-Step gradient: +16: $\begin{array} { r l } & { \bigl [ \delta _ { \eta _ { \mu } } , \delta _ { \eta _ { \Sigma } } \bigr ] ^ { \circ } = \alpha \partial _ { \eta _ { \mu } , \eta _ { \Sigma } } L ( \pmb \theta _ { k } , \eta _ { \mu } , \eta _ { \Sigma } ) } \\ & { \delta _ { \theta } = \partial _ { \theta } L ( \pmb \theta , \eta _ { \mu _ { k + 1 } } , \eta _ { \Sigma k + 1 , \eta } , } \\ & { \dots , \dots } \end{array}$ +17: +18: // M-Step gradient: In practice there is no M-step in this case as policy and variatinal +distribution $q$ use a same structure. +19: send gradients to chief worker +20: wait for gradient update by chief +21: fetch new parameters $\phi , \theta , \eta , \eta _ { \mu } , \eta _ { \Sigma }$ +22: $\begin{array} { r } { k = k + 1 ^ { \mathbf { \complement } } } \\ { i = i + 1 , L _ { \mathrm { c u r r } } = L _ { \mathrm { c u r r } } + L } \\ { \pmb { \theta } _ { i } = \pmb { \theta } , \phi ^ { \prime } = \phi } \end{array}$ +23: +24: \ No newline at end of file diff --git a/parse/train/S1ANxQW0b/S1ANxQW0b_content_list.json b/parse/train/S1ANxQW0b/S1ANxQW0b_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..03b3945de3beb76355de4aae2fb91e3ba426fb56 --- /dev/null +++ b/parse/train/S1ANxQW0b/S1ANxQW0b_content_list.json @@ -0,0 +1,3294 @@ +[ + { + "type": "text", + "text": "MAXIMUM A POSTERIORI POLICY OPTIMISATION ", + "text_level": 1, + "bbox": [ + 174, + 98, + 769, + 121 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abbas Abdolmaleki, Jost Tobias Springenberg, Yuval Tassa, Remi Munos, \nNicolas Heess, Martin Riedmiller \nDeepMind, London, UK \n{aabdolmaleki,springenberg,tassa,munos,heess,riedmiller}@google.com ", + "bbox": [ + 184, + 143, + 841, + 200 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 237, + 544, + 252 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "We introduce a new algorithm for reinforcement learning called Maximum aposteriori Policy Optimisation (MPO) based on coordinate ascent on a relativeentropy objective. We show that several existing methods can directly be related to our derivation. We develop two off-policy algorithms and demonstrate that they are competitive with the state-of-the-art in deep reinforcement learning. In particular, for continuous control, our method outperforms existing methods with respect to sample efficiency, premature convergence and robustness to hyperparameter settings. ", + "bbox": [ + 233, + 270, + 764, + 381 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 410, + 336, + 426 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Model free reinforcement learning algorithms can acquire sophisticated behaviours by interacting with the environment while receiving simple rewards. Recent experiments (Mnih et al., 2015; Jaderberg et al., 2016; Heess et al., 2017) successfully combined these algorithms with powerful deep neural-network approximators while benefiting from the increase of compute capacity. ", + "bbox": [ + 174, + 443, + 825, + 498 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Unfortunately, the generality and flexibility of these algorithms comes at a price: They can require a large number of samples and – especially in continuous action spaces – suffer from high gradient variance. Taken together these issues can lead to unstable learning and/or slow convergence. Nonetheless, recent years have seen significant progress, with improvements to different aspects of learning algorithms including stability, data-efficiency and speed, enabling notable results on a variety of domains, including locomotion (Heess et al., 2017; Peng et al., 2016), multi-agent behaviour (Bansal et al., 2017) and classical control (Duan et al., 2016). ", + "bbox": [ + 174, + 506, + 825, + 603 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Two types of algorithms currently dominate scalable learning for continuous control problems: First, Trust-Region Policy Optimisation (TRPO; Schulman et al. 2015) and the derivative family of Proximal Policy Optimisation algorithms (PPO; Schulman et al. 2017b). These policy-gradient algorithms are on-policy by design, reducing gradient variance through large batches and limiting the allowed change in parameters. They are robust, applicable to high-dimensional problems, and require moderate parameter tuning, making them a popular first choice (Ho & Ermon, 2016). However, as on-policy algorithms, they suffer from poor sample efficiency. ", + "bbox": [ + 174, + 609, + 825, + 707 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In contrast, off-policy value-gradient algorithms such as the Deep Deterministic Policy Gradient (DDPG, Silver et al. 2014; Lillicrap et al. 2016), Stochastic Value Gradient (SVG, Heess et al. 2015), and the related Normalized Advantage Function formulation (NAF, Gu et al. 2016b) rely on experience replay and learned (action-)value functions. These algorithms exhibit much better data efficiency, approaching the regime where experiments with real robots are possible (Gu et al., 2016a; Andrychowicz et al., 2017). While also popular, these algorithms can be difficult to tune, especially for high-dimensional domains like general robot manipulation tasks. ", + "bbox": [ + 174, + 714, + 823, + 811 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In this paper we propose a novel off-policy algorithm that benefits from the best properties of both classes. It exhibits the scalability, robustness and hyperparameter insensitivity of on-policy algorithms, while offering the data-efficiency of off-policy, value-based methods. ", + "bbox": [ + 174, + 819, + 823, + 861 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "To derive our algorithm, we take advantage of the duality between control and estimation by using Expectation Maximisation (EM), a powerful tool from the probabilistic estimation toolbox, in order to solve control problems. This duality can be understood as replacing the question “what are the actions which maximise future rewards?” with the question “assuming future success in maximising rewards, what are the actions most likely to have been taken?”. By using this estimation objective we have more control over the policy change in both E and M steps, yielding robust learning. We show below that several algorithms, including TRPO, can be directly related to this perspective. We leverage the fast convergence properties of EM-style coordinate ascent by alternating a nonparametric data-based E-step which re-weights state-action samples, with a supervised, parametric M-step using deep neural networks. ", + "bbox": [ + 176, + 867, + 823, + 922 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 823, + 186 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We evaluate our algorithm on a broad spectrum of continuous control problems including a 56 DoF humanoid body. All experiments used the same optimisation hyperparameters 1. Our algorithm shows remarkable data efficiency often solving the tasks we consider an order of magnitude faster than the state-of-the-art. A video of some resulting behaviours can be found here dropbox.com/s/pgcmjst7t0zwm4y/MPO.mp4. ", + "bbox": [ + 174, + 194, + 825, + 263 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 BACKGROUND AND NOTATION", + "text_level": 1, + "bbox": [ + 178, + 286, + 460, + 303 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2.1 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 319, + 331, + 333 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Casting Reinforcement Learning (RL) as an inference problem has a long history dating back at least two decades (Dayan & Hinton, 1997). The framework presented here is inspired by a variational inference perspective on RL that has previously been utilised in multiple studies; c.f. Dayan & Hinton (1997); Neumann (2011); Deisenroth et al. (2013); Rawlik et al. (2012); Levine & Koltun (2013); Florensa et al. (2017). ", + "bbox": [ + 174, + 347, + 825, + 416 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Particular attention has been paid to obtaining maximum entropy policies as the solution to an inference problem. The penalisation of determinism can be seen encouraging both robustness and simplicity. Among these are methods that perform trajectory optimisation using either linearised dynamics (Todorov, 2008; Toussaint, 2009; Levine & Koltun, 2013) or general dynamics as in path integral control (Kappen, 2005; Theodorou et al., 2010). In contrast to these algorithms, here we do not assume the availability of a transition model and avoid on-policy optimisation. A number of other authors have considered the same perspective but in a model-free RL setting (Neumann, 2011; Peters et al., 2010a; Florensa et al., 2017; Daniel et al., 2016) or inverse RL problems (Ziebart et al., 2008). These algorithms are more directly related to our work and can be cast in the same (EM-like) alternating optimisation scheme on which we base our algorithm. However, they typically lack the maximisation (M)-step – with the prominent exception of REPS, AC-REPS, $\\mathrm { P \\bar { I } ^ { 2 } }$ -GPS and MDGPS (Peters et al., 2010a; Wirth et al., 2016; Chebotar et al., 2016; Montgomery & Levine, 2016) to which our algorithm is closely related as outlined below. An interesting recent addition to these approaches is an EM-perspective on the PoWER algorithm (Roux, 2016) which uses the same iterative policy improvement employed here, but commits to parametric inference distributions and avoids an exponential reward transformation, resulting in a harder to optimise lower bound. ", + "bbox": [ + 173, + 422, + 825, + 645 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "As an alternative to these policy gradient inspired algorithms, the class of recent algorithms for soft Q-learning (e.g. Rawlik et al. (2012); Haarnoja et al. (2017); Fox et al. (2016) parameterise and estimate a so called “soft” Q-function directly, implicitly inducing a maximum entropy policy. A perspective that can also be extended to hierarchical policies (Florensa et al., 2017), and has recently been used to establish connections between Q-learning and policy gradient methods (O’Donoghue et al., 2016; Schulman et al., 2017a). In contrast, we here rely on a parametric policy, our bound and derivation is however closely related to the definition of the soft (entropy regularised) Q-function. ", + "bbox": [ + 174, + 652, + 823, + 750 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "A line of work, that is directly related to the “RL as inference” perspective, has focused on using information theoretic regularisers such as the entropy of the policy or the Kullback-Leibler divergence (KL) between policies to stabilise standard RL objectives. In fact, most state-of-the-art policy gradient algorithms fall into this category. For example see the entropy regularization terms used in Mnih et al. (2016) or the KL constraints employed by work on trust-region based methods (Schulman et al., 2015; 2017b; Gu et al., 2017; Wang et al., 2017). The latter methods introduce a trust region constraint, defined by the KL divergence between the new policy and the old policy, so that the expected KL divergence over state space is bounded. From the perspective of this paper these trust-region based methods can be seen as optimising a parametric E-step, as in our algorithm, but are “missing” an explicit M-step. ", + "bbox": [ + 174, + 757, + 825, + 895 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Finally, the connection between RL and inference has been invoked to motivate work on exploration. The most prominent examples for this are formed by work on Boltzmann exploration such as Kaelbling et al. (1996); Perkins & Precup (2002); Sutton (1990); O’Donoghue et al. (2017), which can be connected back to soft Q-learning (and thus to our approach) as shown in Haarnoja et al. (2017). ", + "bbox": [ + 174, + 103, + 823, + 160 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.2 MARKOV DECISION PROCESSES ", + "text_level": 1, + "bbox": [ + 176, + 176, + 434, + 190 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We consider the problem of finding an optimal policy $\\pi$ for a discounted reinforcement learning (RL) problem; formally characterized by a Markov decision process (MDP). The MDP consists of: continuous states $s$ , actions $a$ , transition probabilities $p ( s _ { t + 1 } | s _ { t } , a _ { t } )$ – specifying the probability of transitioning from state $s _ { t }$ to $s _ { t + 1 }$ under action $a _ { t } \\textrm { -- }$ , a reward function $r ( s , a ) \\in \\mathbb { R }$ as well as the discounting factor $\\gamma \\in [ 0 , 1 )$ . The policy $\\pi ( a | s , \\theta )$ (with parameters $\\pmb { \\theta }$ ) is assumed to specify a probability distribution over action choices given any state and – together with the transition probabilities – gives rise to the stationary distribution $\\mu _ { \\pi } ( s )$ . ", + "bbox": [ + 173, + 202, + 825, + 301 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Using these basic quantities we can now define the notion of a Markov sequence or trajec$\\overline { { \\tau } } _ { \\pi } ~ = ~ \\{ ( s _ { 0 } , a _ { 0 } ) \\} \\ldots ( s _ { T } , a _ { T } ) \\}$ by following the policy ; and the expected return $\\pi$ $\\begin{array} { r } { \\tau _ { \\pi } ~ \\sim ~ p _ { \\pi } ( \\tau ) } \\end{array}$ with. We $\\begin{array} { r } { p _ { \\pi } ( \\tau ) = p ( s _ { 0 } ) \\prod _ { t > 0 } p ( s _ { t + 1 } \\vert s _ { t } , a _ { t } ) \\pi ( a _ { t } \\vert s _ { t } ) ; } \\end{array}$ $\\begin{array} { r } { \\mathbb { E } _ { \\tau _ { \\pi } } [ \\sum _ { t = 0 } ^ { \\infty } \\gamma ^ { t } r ( s _ { t } , s _ { t } ) ] } \\end{array}$ will use the shorthand $r _ { t } = r ( s _ { t } , a _ { t } )$ . ", + "bbox": [ + 174, + 306, + 825, + 364 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 MAXIMUM A POSTERIORI POLICY OPTIMISATION ", + "text_level": 1, + "bbox": [ + 174, + 383, + 619, + 400 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Our approach is motivated by the well established connection between RL and probabilistic inference. This connection casts the reinforcement learning problem as that of inference in a particular probabilistic model. Conventional formulations of RL aim to find a trajectory that maximizes expected reward. In contrast, inference formulations start from a prior distribution over trajectories, condition a desired outcome such as achieving a goal state, and then estimate the posterior distribution over trajectories consistent with this outcome. ", + "bbox": [ + 173, + 415, + 825, + 498 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "A finite-horizon undiscounted reward formulation can be cast as inference problem by constructing a suitable probabilistic model via a likelihood function $p ( O = 1 | \\tau ) \\propto \\mathrm { e x p } ( \\Sigma _ { t } r _ { t } / \\alpha )$ , where $\\alpha$ is a temperature parameter. Intuitively, $O$ can be interpreted as the event of obtaining maximum reward by choosing an action; or the event of succeeding at the RL task (Toussaint, 2009; Neumann, 2011). With this definition we can define the following lower bound on the likelihood of optimality for the policy $\\pi$ : ", + "bbox": [ + 174, + 506, + 825, + 590 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/c585372fbc484f565501eb5fe988b323a1410d0d19fe5e98590a652145b9366d.jpg", + "text": "$$\n\\begin{array} { l } { \\displaystyle \\log p _ { \\pi } ( O = 1 ) = \\log \\int p _ { \\pi } ( \\tau ) p ( O = 1 | \\tau ) d \\tau \\geq \\int q ( \\tau ) \\big [ \\log p ( O = 1 | \\tau ) + \\log \\frac { p _ { \\pi } ( \\tau ) } { q ( \\tau ) } \\big ] d \\tau } \\\\ { \\displaystyle \\qquad = \\mathbb { E } _ { q } \\Big [ \\sum _ { t } r _ { t } / \\alpha \\Big ] - \\mathrm { K L } \\Big ( q ( \\tau ) | | p _ { \\pi } ( \\tau ) \\Big ) = \\mathcal { I } ( q , \\pi ) , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 192, + 613, + 784, + 683 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where $p _ { \\pi }$ is the trajectory distribution induced by policy $\\pi ( a | s )$ as described in section 2.2 and $q ( \\tau )$ is an auxiliary distribution over trajectories that will discussed in more detail below. The lower bound $\\mathcal { I }$ is the evidence lower bound (ELBO) which plays an important role in the probabilistic modeling literature. It is worth already noting here that optimizing (2) with respect to $q$ can be seen as a regularized RL problem. ", + "bbox": [ + 174, + 686, + 825, + 756 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "An important motivation for transforming a RL problem into an inference problem is that this allows us draw from the rich toolbox of inference methods: For instance, $\\mathcal { I }$ can be optimized with the familiy of expectation maximization (EM) algorithms which alternate between improving $\\mathcal { I }$ with respect to $q$ and $\\pi$ . In this paper we follow classical (Dayan & Hinton, 1997) and more recent works (e.g. Peters et al. 2010b; Levine & Koltun 2013; Daniel et al. 2016; Wirth et al. 2016) and cast policy search as a particular instance of this family. Our algorithm then combines properties of existing approaches in this family with properties of recent off-policy algorithms for neural networks. ", + "bbox": [ + 174, + 762, + 825, + 861 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The algorithm alternates between two phases which we refer to as E and M step in reference to an EM-algorithm. The E-step improves $\\mathcal { I }$ with respect to $q$ . Existing EM policy search approaches perform this step typically by reweighting trajectories with sample returns (Kober & Peters, 2009) or via local trajectory optimization (Levine & Koltun, 2013). We show how off-policy deep RL techniques and value-function approximation can be used to make this step both scalable as well as data efficient. The M-step then updates the parametric policy in a supervised learning step using the reweighted state-action samples from the E-step as targets. ", + "bbox": [ + 174, + 867, + 823, + 924 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 823, + 146 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "These choices lead to the following desirable properties: (a) low-variance estimates of the expected return via function approximation; (b) low-sample complexity of value function estimate via robust off-policy learning; (c) minimal parametric assumption about the form of the trajectory distribution in the E-step; (d) policy updates via supervised learning in the M step; (e) robust updates via hard trust-region constraints in both the E and the M step. ", + "bbox": [ + 173, + 152, + 825, + 223 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 POLICY IMPROVEMENT ", + "text_level": 1, + "bbox": [ + 174, + 239, + 377, + 253 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The derivation of our algorithm then starts from the infinite-horizon analogue of the KL-regularized expected reward objective from Equation (2). In particular, we consider variational distributions $q ( \\tau )$ that factor in the same way as $p _ { \\pi }$ , i.e. $\\begin{array} { r } { q ( \\tau ) = \\bar { p } ( s _ { 0 } ) \\prod _ { t > 0 } p ( s _ { t + 1 } | s _ { t } , a _ { t } ) q ( a _ { t } | s _ { t } ) } \\end{array}$ which yields: ", + "bbox": [ + 174, + 265, + 825, + 309 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/c47386aa60fd8ec474158aad73358c473d096deaaf823906ff6f90a6b43d5fd9.jpg", + "text": "$$\n\\mathcal { I } ( \\boldsymbol { q } , \\theta ) = \\mathbb { E } _ { \\boldsymbol { q } } \\Big [ \\sum _ { t = 0 } ^ { \\infty } \\gamma ^ { t } \\big [ r _ { t } - \\alpha \\mathbf { K L } \\big ( \\boldsymbol { q } ( \\boldsymbol { a } | s _ { t } ) \\| \\pi ( \\boldsymbol { a } | s _ { t } , \\theta ) \\big ) \\big ] \\Big ] + \\log p ( \\theta ) .\n$$", + "text_format": "latex", + "bbox": [ + 276, + 313, + 723, + 353 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Note that due to the assumption about the structure of $q ( \\tau )$ the $\\mathrm { K L }$ over trajectories decomposes into a KL over the individual state-conditional action distributions. This objective has also been considered e.g. by Haarnoja et al. (2017); Schulman et al. (2017a). The additional $\\log p ( \\pmb \\theta )$ term is a prior over policy parameters and can be motivated by a maximum a-posteriori estimation problem (see appendix for more details). ", + "bbox": [ + 173, + 356, + 825, + 426 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We also define the regularized Q-value function associated with (3) as ", + "bbox": [ + 174, + 433, + 632, + 448 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/94b398d8581f4b49760d89cd721f5bc7a45444c60483374fc1cfd24d10e845ba.jpg", + "text": "$$\nQ _ { \\theta } ^ { q } ( s , a ) = r _ { 0 } + \\mathbb { E } _ { q ( \\tau ) , s _ { 0 } = s , a _ { 0 } = a } \\left[ \\sum _ { t \\geq 1 } ^ { \\infty } \\gamma ^ { t } \\big [ r _ { t } - \\alpha \\mathrm { K L } ( q _ { t } \\| \\pi _ { t } ) \\big ] \\right] ,\n$$", + "text_format": "latex", + "bbox": [ + 287, + 450, + 707, + 501 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "with $\\mathrm { K L } \\big ( q _ { t } | | \\pi _ { t } \\big ) = \\mathrm { K L } \\big ( q ( a | s _ { t } ) \\big ) \\| \\pi ( a | s _ { t } , \\pmb { \\theta } ) \\big )$ . Note that $\\mathrm { K L } \\big ( q _ { 0 } | | \\pi _ { 0 } \\big )$ and $p ( \\theta )$ are not part of the Q-function as they are not a function of the action. ", + "bbox": [ + 173, + 503, + 823, + 534 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We observe that optimizing $\\mathcal { I }$ with respect to $q$ is equivalent to solving an expected reward RL problem with augmented reward $\\begin{array} { r } { \\tilde { r } _ { t } = r _ { t } - \\alpha \\log \\frac { q ( a _ { t } | s _ { t } ) } { \\pi ( a _ { t } | s _ { t } , \\pmb { \\theta } ) } } \\end{array}$ . In this view $\\pi$ represents a default policy towards which $q$ is regularized – i.e. the current best policy. The MPO algorithm treats $\\pi$ as the primary object of interest. In this case $q$ serves as an auxiliary distribution that allows optimizing $\\mathcal { I }$ via alternate coordinate ascent in $q$ and $\\pi _ { \\pmb { \\theta } }$ , analogous to the expectation-maximization algorithm in the probabilistic modelling literature. In our case, the E-step optimizes $\\mathcal { I }$ with respect to $q$ while the M-step optimizes $\\mathcal { I }$ with respect to $\\pi$ . Different optimizations in the $\\mathrm { E }$ -step and M-step lead to different algorithms. In particular, we note that for the case where $p ( \\pmb \\theta )$ is an uninformative prior a variant of our algorithm has a monotonic improvement guarantee as show in the Appendix A. ", + "bbox": [ + 173, + 540, + 825, + 671 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.2 E-STEP ", + "text_level": 1, + "bbox": [ + 174, + 686, + 267, + 702 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In the E-step of iteration $i$ we perform a partial maximization of $\\mathcal { I } ( \\boldsymbol { q } , \\boldsymbol { \\theta } )$ with respect to $q$ given $\\theta = \\theta _ { i }$ . We start by setting $q = \\pi _ { \\pmb { \\theta } _ { i } }$ and estimate the unregularized action-value function: ", + "bbox": [ + 174, + 712, + 825, + 742 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/d9f00c5111450b96b213f94b248479dff577bc7b9241eb53ba84cc72b59a9377.jpg", + "text": "$$\nQ _ { \\theta _ { i } } ^ { q } ( s , a ) = Q _ { \\theta _ { i } } ( s , a ) = \\mathbb { E } _ { \\tau _ { \\pi _ { i } } , s _ { 0 } = s , a _ { 0 } = a } \\left[ \\sum _ { t } ^ { \\infty } \\gamma ^ { t } r _ { t } \\right] ,\n$$", + "text_format": "latex", + "bbox": [ + 321, + 744, + 674, + 787 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "since $\\mathrm { K L } ( q | | \\pi _ { i } ) = 0$ . In practice we estimate $Q _ { \\pmb { \\theta } _ { i } }$ from off-policy data (we refer to Section 4 for details about the policy evaluation step). This greatly increases the data efficiency of our algorithm. Given $Q _ { \\pmb { \\theta } _ { i } }$ we improve the lower bound $\\mathcal { I }$ w.r.t. $q$ by first expanding $Q _ { \\theta _ { i } } ( s , a )$ via the regularized Bellman operator $\\begin{array} { r } { T ^ { \\pi , q } = \\mathbb { E } _ { q ( a \\mid s ) } \\Big [ r ( s , a ) - \\alpha \\mathbf { K L } ( q \\| \\pi _ { i } ) + \\gamma \\mathbb { E } _ { p ( s ^ { \\prime } \\mid s , a ) } [ V _ { \\pmb { \\theta } _ { i } } ( s ^ { \\prime } ) ] \\Big ] . } \\end{array}$ , and optimize the “one-step” KL regularised objective ", + "bbox": [ + 174, + 790, + 826, + 869 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/99844cbc259f5753c811b6ea1e6c148c0f2e81f9d3e10080bfbaebbdccf26843.jpg", + "text": "$$\n\\begin{array} { l } { \\displaystyle \\mathop { \\operatorname* { m a x } } _ { \\boldsymbol { q } } \\bar { \\mathcal { T } } _ { s } ( \\boldsymbol { q } , \\theta _ { i } ) = \\mathop { \\operatorname* { m a x } } _ { \\boldsymbol { q } } T ^ { \\pi , { q } } Q _ { \\theta _ { i } } ( s , \\boldsymbol { a } ) } \\\\ { \\displaystyle \\mathop { \\quad = } \\mathop { \\operatorname* { m a x } } _ { \\boldsymbol { q } } \\mathbb { E } _ { \\boldsymbol { \\mu } ( s ) } \\Big [ \\mathbb { E } _ { \\boldsymbol { q } ( \\cdot \\vert s ) } [ Q _ { \\theta _ { i } } ( s , \\boldsymbol { a } ) ] - \\alpha \\mathbf { K } \\mathbf { L } ( \\boldsymbol { q } \\| \\pi _ { i } ) \\Big ] , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 289, + 872, + 710, + 929 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "since $V _ { \\pmb { \\theta } _ { i } } ( s ) = \\mathbb { E } _ { q ( a | s } [ Q _ { \\pmb { \\theta } _ { i } } ( s , a ) ]$ and thus $Q _ { \\pmb { \\theta } _ { i } } ( s , a ) = r ( s , a ) + \\gamma V _ { \\pmb { \\theta } _ { i } } ( s ) .$ . ", + "bbox": [ + 174, + 102, + 658, + 119 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Maximizing Equation (6), thus obtaining $q _ { i } = \\arg \\operatorname* { m a x } \\bar { \\mathcal { I } } ( q , \\theta _ { i } )$ , does not fully optimize $\\mathcal { I }$ since we treat $Q _ { \\theta _ { i } }$ as constant with respect to $q$ . An intuitive interpretation $q _ { i }$ is that it chooses the softoptimal action for one step and then resorts to executing policy $\\pi$ . In the language of the EM algorithm this optimization implements a partial E-step. In practice we also choose $\\mu _ { q }$ to be the stationary distribution as given through samples from the replay buffer. ", + "bbox": [ + 173, + 126, + 825, + 198 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "CONSTRAINED E-STEP ", + "text_level": 1, + "bbox": [ + 174, + 214, + 334, + 228 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The reward and the KL terms are on an arbitray relative scale. This can make it difficult to choose $\\alpha$ . We therefore replace the soft KL regularization with a hard constraint with parameter $\\epsilon$ , i.e, ", + "bbox": [ + 173, + 239, + 825, + 268 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/6c4651b8478ef40a04cd7ecff2dad54f6c17dfa11f57bc574e45c7a73a9649b4.jpg", + "text": "$$\n\\begin{array} { r l } & { \\underset { q } { \\operatorname* { m a x } } \\mathbb { E } _ { \\boldsymbol { \\mu } ( s ) } \\left[ \\mathbb { E } _ { q ( a \\mid s ) } \\left[ Q _ { \\boldsymbol { \\theta } _ { i } } ( s , a ) \\right] \\right] } \\\\ & { s . t . \\mathbb { E } _ { \\boldsymbol { \\mu } ( s ) } \\left[ { \\mathbf { K L } } ( q ( a \\mid s ) , \\pi ( a \\mid s , \\boldsymbol { \\theta } _ { i } ) ) \\right] < \\epsilon . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 370, + 275, + 630, + 334 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "If we choose to explicitly parameterize $q ( a | s ) -$ option 1 below – the resulting optimisation is similar to that performed by the recent TRPO algorithm for continuous control (Schulman et al., 2015); only in an off-policy setting. Analogously, the unconstrained objective (6) is similar to the objective used by PPO (Schulman et al., 2017b). We note, however, that the KL is reversed when compared to the KL used by TRPO and PPO. ", + "bbox": [ + 174, + 348, + 825, + 419 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "To implement (7) we need to choose a form for the variational policy $q ( a | s )$ . Two options arise: ", + "bbox": [ + 173, + 425, + 799, + 441 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "1. We can use a parametric variational distribution $q ( a | s , \\pmb \\theta ^ { q } )$ , with parameters $\\pmb { \\theta } ^ { q }$ , and optimise Equation (7) via the likelihood ratio or action-value gradients. This leads to an algorithm similar to TRPO/PPO and an explicit M-step becomes unnecessary (see. Alg. 3). 2. We can choose a non-parametric representation of $q ( a | s )$ given by one probability factor per sample. To achieve generalization in state space we then fit a parametric policy in the M-step. ", + "bbox": [ + 209, + 452, + 825, + 544 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Fitting a parametric policy in the M-step is a supervised learning problem, allowing us to employ various regularization techniques at that point. It also makes it easier to enforce the hard KL constraint. ", + "bbox": [ + 174, + 556, + 825, + 598 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "NON PARAMETRIC VARIATIONAL DISTRIBUTION ", + "text_level": 1, + "bbox": [ + 176, + 616, + 508, + 630 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In the non-parametric case we can obtain the optimal sample based $q$ distribution – the solution to Equation (7) – in closed form (see the appendix for a full derivation), as, ", + "bbox": [ + 174, + 640, + 823, + 670 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/e2cc243c4fce56c4fd8e0417866e6c3dfe80f34b88867a5673bc94a2ae845caa.jpg", + "text": "$$\nq _ { i } ( a | s ) \\propto \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp \\Big ( \\frac { Q _ { \\theta _ { i } } ( s , a ) } { \\eta ^ { * } } \\Big ) ,\n$$", + "text_format": "latex", + "bbox": [ + 370, + 688, + 627, + 722 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where we can obtain $\\eta ^ { * }$ by minimising the following convex dual function, ", + "bbox": [ + 174, + 726, + 665, + 742 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/c92f4e82fd7f9b818244b56be050da21e0f55ba3880b30c6c94bfd61a49caf39.jpg", + "text": "$$\ng ( \\eta ) = \\eta \\epsilon + \\eta \\int \\mu ( s ) \\log \\int \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp \\Big ( \\frac { Q _ { \\theta _ { i } } ( s , a ) } { \\eta } \\Big ) d a d s ,\n$$", + "text_format": "latex", + "bbox": [ + 290, + 750, + 705, + 782 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "after the optimisation of which we can evaluate $q _ { i } ( a | s )$ on given samples. ", + "bbox": [ + 174, + 790, + 655, + 806 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "This optimization problem is similar to the one solved by relative entropy policy search (REPS) (Peters et al., 2010a) with the difference that we optimise only for the conditional variational distribution $q ( a | s )$ instead of a joint distribution $\\scriptstyle q ( a , s )$ – effectively fixing $\\mu _ { q } ( s )$ to the stationary distribution given by previously collected experience – and we use the $\\mathrm { Q }$ function of the old policy to evaluate the integral over $a$ . While this might seem unimportant it is crucial as it allows us to estimate the integral over actions with multiple samples without additional environment interaction. This greatly reduces the variance of the estimate and allows for fully off-policy learning at the cost of performing only a partial optimization of $\\mathcal { I }$ as described above. ", + "bbox": [ + 173, + 811, + 825, + 924 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.3 M-STEP ", + "text_level": 1, + "bbox": [ + 174, + 103, + 271, + 117 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Given $q _ { i }$ from the E-step we can optimize the lower bound $\\mathcal { I }$ with respect to $\\pmb \\theta$ to obtain an updated policy $\\pmb { \\theta } _ { i + 1 } = \\arg \\operatorname* { m a x } _ { \\pmb { \\theta } } \\mathcal { I } ( q _ { i } , \\pmb { \\theta } )$ . Dropping terms independent of $\\pmb { \\theta }$ this entails solving for the solution of ", + "bbox": [ + 174, + 130, + 825, + 172 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/126b9a3c732b4985eaa8d9188c13a3d13893c384351538cd65543e255a10c66f.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\theta } \\mathcal { I } ( q _ { i } , \\theta ) = \\operatorname* { m a x } _ { \\theta } \\mathbb { E } _ { \\mu _ { q } ( s ) } \\Big [ \\mathbb { E } _ { q ( a | s ) } \\Big [ \\log \\pi ( a | s , \\theta ) \\Big ] \\Big ] + \\log p ( \\theta ) ,\n$$", + "text_format": "latex", + "bbox": [ + 282, + 189, + 714, + 217 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "which corresponds to a weighted maximum a-posteriroi estimation (MAP) problem where samples are weighted by the variational distribution from the E-step. Since this is essentially a supervised learning step we can choose any policy representation in combination with any prior for regularisation. In this paper we set $p ( \\pmb \\theta )$ to a Gaussian prior around the current policy, i.e, $\\begin{array} { r } { p ( \\pmb { \\theta } ) \\approx \\mathcal { N } \\Big ( \\mu = \\pmb { \\theta } _ { i } , \\Sigma = \\frac { F _ { \\pmb { \\theta } _ { i } } } { \\lambda } \\Big ) } \\end{array}$ , where $\\pmb \\theta _ { i }$ are the parameters of the current policy distribution, $F _ { \\pmb { \\theta } _ { i } }$ is the empirical Fisher information matrix and $\\lambda$ is a positive scalar. As shown in the appendix this suggests the following generalized M-step: ", + "bbox": [ + 173, + 228, + 825, + 337 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/e3414a54c816aac2322f74663302b60046b419e9c4fa26ac9745e0714899d392.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\pi } \\mathbb { E } _ { \\mu _ { q } ( s ) } \\Big [ \\mathbb { E } _ { q ( a | s ) } \\Big [ \\log \\pi ( a | s , \\pmb { \\theta } ) \\Big ] - \\lambda \\mathrm { K L } \\Big ( \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\pi ( a | s , \\pmb { \\theta } ) \\Big ) \\Big ]\n$$", + "text_format": "latex", + "bbox": [ + 274, + 353, + 722, + 381 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "which can be re-written as the hard constrained version: ", + "bbox": [ + 176, + 391, + 539, + 406 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/326bacdbf4aabc3a5b055834d5937f2e8ed54ad75664f7b06e32c83160d55f29.jpg", + "text": "$$\n\\begin{array} { r } { \\underset { \\pi } { \\operatorname* { m a x } } \\mathbb { E } _ { \\mu _ { q } ( s ) } \\left[ \\mathbb { E } _ { q ( a | s ) } \\left[ \\log \\pi ( a | s , \\pmb { \\theta } ) \\right] \\right] } \\\\ { s . t . \\mathbb { E } _ { \\mu _ { q } ( s ) } \\left[ { \\mathbf { K L } } ( \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\pi ( a | s , \\pmb { \\theta } ) ) \\right] < \\epsilon . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 356, + 422, + 643, + 481 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "This additional constraint minimises the risk of overfitting the samples, i.e. it helps us to obtain a policy that generalises beyond the state-action samples used for the optimisation. In practice we have found the KL constraint in the M step to greatly increase stability of the algorithm. We also note that in the E-step we are using the reverse, mode-seeking, KL while in the M-step we are using the forward, moment-matching, KL which reduces the tendency of the entropy of the parametric policy to collapse. This is in contrast to other RL algorithms that use M-projection without KL constraint to fit a parametric policy (Peters et al., 2010a; Wirth et al., 2016; Chebotar et al., 2016; Montgomery & Levine, 2016). Using KL constraint in M-step has also been shown effective for stochastic search algorithms (Abdolmaleki et al., 2017). ", + "bbox": [ + 173, + 488, + 825, + 616 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 POLICY EVALUATION ", + "text_level": 1, + "bbox": [ + 176, + 636, + 385, + 651 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Our method is directly applicable in an off-policy setting. For this, we have to rely on a stable policy evaluation operator to obtain a parametric representation of the Q-function $Q _ { \\theta } ( s , a )$ . We make use of the policy evaluation operator from the Retrace algorithm Munos et al. (2016), which we found to yield stable policy evaluation in practice2. Concretely, we fit the Q-function $Q _ { \\theta _ { i } } ( s , a , \\phi )$ as represented by a neural network, with parameters $\\phi$ , by minimising the squared loss: ", + "bbox": [ + 173, + 666, + 825, + 738 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/ddd41d4e1eeeddfb6b26cf9d237375ea93c7ad203c8bd727946d1235131b9f6b.jpg", + "text": "$$\n\\begin{array} { l } { \\displaystyle \\mathop { \\operatorname* { m i n } } _ { \\phi } L ( \\phi ) = \\mathop { \\operatorname* { m i n } } _ { \\phi } \\mathbb { E } _ { \\mu _ { b } ( s ) , b ( a | s ) } \\left[ \\left( Q _ { \\theta _ { i } } ( s _ { t } , a _ { t } , \\phi ) - Q _ { t } ^ { \\mathrm { r e t } } \\right) ^ { 2 } \\right] , \\mathrm { w i t h } } \\\\ { \\displaystyle Q _ { t } ^ { \\mathrm { r e t } } = Q _ { \\phi ^ { \\prime } } ( s _ { t } , a _ { t } ) + \\sum _ { j = t } ^ { \\infty } \\gamma ^ { j - t } \\Big ( \\prod _ { k = t + 1 } ^ { j } c _ { k } \\Big ) \\left[ r ( s _ { j } , a _ { j } ) + \\mathbb { E } _ { \\pi ( a | s _ { j + 1 } ) } [ Q _ { \\phi ^ { \\prime } } ( s _ { j + 1 } , a ) ] - Q _ { \\phi ^ { \\prime } } ( s _ { j } , a _ { j } ) \\right] , } \\\\ { \\displaystyle c _ { k } = \\operatorname* { m i n } \\Big ( 1 , \\frac { \\pi ( a _ { k } | s _ { k } ) } { b ( a _ { k } | s _ { k } ) } \\Big ) , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 762, + 816, + 878 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $Q _ { \\phi ^ { \\prime } } ( s , a )$ denotes the output of a target Q-network, with parameters $\\phi ^ { \\prime }$ , that we copy from the current parameters $\\phi$ after each M-step. We truncate the infinite sum after $N$ steps by bootstrapping with $Q _ { \\phi ^ { \\prime } }$ (rather than considering a $\\lambda$ return). Additionally, $b ( a | s )$ denotes the probabilities of an arbitrary behaviour policy. In our case we use an experience replay buffer and hence $b$ is given by the action probabilities stored in the buffer; which correspond to the action probabilities at the time of action selection. ", + "bbox": [ + 174, + 103, + 825, + 188 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 176, + 208, + 326, + 224 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "For our experiments we evaluate our MPO algorithm across a wide range of tasks. Specifically, we start by looking at the continuous control tasks of the DeepMind Control Suite (Tassa et al. (2018), see Figure 1), and then consider the challenging parkour environments recently published in Heess et al. (2017). In both cases we use a Gaussian distribution for the policy whose mean and covariance are parameterized by a neural network (see appendix for details). In addition, we present initial experiments for discrete control using ATARI environments using a categorical policy distribution (whose logits are again parameterized by a neural network) in the appendix. ", + "bbox": [ + 174, + 239, + 825, + 338 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5.1 EVALUATION ON CONTROL SUITE ", + "text_level": 1, + "bbox": [ + 176, + 356, + 446, + 369 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/754c06df74f11ccb9772163bdb2d3c935cb2cba2b5b65def9b07cd08ab62b078.jpg", + "image_caption": [ + "Figure 1: Control Suite domains used for benchmarking. Top: Acrobot, Ball-in-cup, Cart-pole, Cheetah, Finger, Fish, Hopper. Bottom: Humanoid, Manipulator, Pendulum, Point-mass, Reacher, Swimmers (6 and 15 links), Walker. " + ], + "image_footnote": [], + "bbox": [ + 174, + 386, + 820, + 530 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The suite of continuous control tasks that we are evaluating against contains 18 tasks, comprising a wide range of domains including well known tasks from the literature. For example, the classical cart-pole and acrobot dynamical systems, 2D and Humanoid walking as well as simple low-dimensional planar reaching and manipulation tasks. This suite of tasks was built in python on top of mujoco and will also be open sourced to the public by the time of publication. ", + "bbox": [ + 174, + 603, + 825, + 674 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "While we include plots depicting the performance of our algorithm on all tasks below; comparing it against the state-of-the-art algorithms in terms of data-efficiency. We want to start by directing the attention of the reader to a more detailed evaluation on three of the harder tasks from the suite. ", + "bbox": [ + 176, + 680, + 823, + 722 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5.1.1 DETAILED ANALYSIS ON WALKER-2D, ACROBOT, HOPPER ", + "bbox": [ + 174, + 738, + 635, + 752 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We start by looking at the results for the classical Acrobot task (two degrees of freedom, one continuous action dimension) as well as the 2D walker (which has 12 degrees of freedom and thus a 12 dimensional action space and a 21 dimensional state space) and the hopper standing task. The reward in the Acrobot task is the distance of the robots end-effector to an upright position of the underactuated system. For the walker task it is given by the forward velocity, whereas in the hopper the requirement is to stand still. ", + "bbox": [ + 174, + 762, + 825, + 847 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Figure 2 shows the results for this task obtained by applying our algorithm MPO as well as several ablations – in which different parts were removed from the MPO optimization – and two baselines: our implementation of Proximal Policy Optimization (PPO) (Schulman et al., 2017b) and DDPG. The hyperparameters for MPO were kept fixed for all experiments in the paper (see the appendix for hyperparameter settings). ", + "bbox": [ + 174, + 854, + 823, + 924 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "As a first observation, we can see that MPO gives stable learning on all tasks and, thanks to its fully off-policy implementation, is significantly more sample efficient than the on-policy PPO baseline. Furthermore, we can observe that changing from the non-parametric variational distribution to a parametric distribution3 (which, as described above, can be related to PPO) results in only a minor asymptotic performance loss but slowed down optimisation and thus hampered sample efficiency; which can be attributed to the fact that the parametric $q$ distribution required a stricter KL constraint. Removing the automatically tuned KL constraint and replacing it with a manually set entropy regulariser then yields an off-policy actor-critic method with Retrace. This policy gradient method still uses the idea of estimating the integral over actions – and thus, for a gradient based optimiser, its likelihood ratio derivative – via multiple action samples (as judged by a Q-Retrace critic). This idea has previously been coined as using the expected policy gradient (EPG) (Ciosek & Whiteson, 2017) and we hence denote the corresponding algorithm with EPG $^ +$ Retrace, which no-longer follows the intuitions of the MPO perspective. $\\mathrm { E P G } + .$ Retrace performed well when the correct entropy regularisation scale is used. This, however, required task specific tuning (c.f. Figure 4 where this hyperparameter was set to the one that performed best in average across tasks). Finally using only a single sample to estimate the integral (and hence the likelihood ratio gradient) results in an actor-critic variant with Retrace that is the least performant off-policy algorithm in our comparison. ", + "bbox": [ + 174, + 104, + 825, + 353 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/c77b362823bc448bf6268c862a2c6ae8c0cbe92c11eed9cb0fed52cbb3223fbf.jpg", + "image_caption": [ + "Figure 2: Ablation study of the MPO algorithm and comparison to common baselines from the literature on three domains from the control suite. We plot the median performance over 10 experiments with different random seeds. " + ], + "image_footnote": [], + "bbox": [ + 171, + 425, + 826, + 569 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "5.1.2 COMPLETE RESULTS ON THE CONTROL SUITE ", + "text_level": 1, + "bbox": [ + 178, + 606, + 540, + 618 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The results for MPO (non-parameteric) – and a comparison to an implementation of state-of-the-art algorithms from the literature in our framework – on all the environments from the control suite that we tested on are shown in Figure 4. All tasks have rewards that are scaled to be between 0 and 1000. We note that in order to ensure a fair comparison all algorithms ran with exactly the same network configuration, used a single learner (no distributed computation), used the same optimizer and were tuned w.r.t. their hyperparameters for best performance across all tasks. We refer to the appendix for a complete description of the hyperparameters. Our comparison is made in terms of data-efficiency. ", + "bbox": [ + 174, + 628, + 825, + 727 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "From the plot a few trends are readily apparent: i) We can clearly observe the advantage in terms of data-efficiency that methods relying on a Q-critic obtain over the PPO baseline. This difference is so extreme that in several instances the PPO baseline converges an order of magnitude slower than the off-policy algorithms and we thus indicate the asymptotic performance of each algorithm of PPO and DDPG (which also improved significantly later during training in some instances) with a colored star in the plot; ii) the difference between the MPO results and the (expected) policy gradient (EPG) with entropy regularisation confirm our suspicion from Section 5.1.1: finding a good setting for the entropy regulariser that transfers across environments without additional constraints on the policy distribution is very difficult, leading to instabilities in the learning curves. In contrast to this the MPO results appear to be stable across all environments; iii) Finally, in terms of data-efficiency the methods utilising Retrace obtain a clear advantage over DDPG. The single learner vanilla DDPG implementation learns the lower dimensional environments quickly but suffers in terms of learning speed in environments with sparse rewards (finger, acrobot) and higher dimensional action spaces. Overall, MPO is able to solve all environments using surprisingly moderate amounts of data. On average less than 1000 trajectories (or $1 0 ^ { 6 }$ samples) are needed to reach the best performance. ", + "bbox": [ + 174, + 733, + 825, + 900 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 146 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5.2 HIGH-DIMENSIONAL CONTINUOUS CONTROL ", + "text_level": 1, + "bbox": [ + 174, + 170, + 526, + 183 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Next we turn to evaluating our algorithm on two higher-dimensional continuous control problems; humanoid and walker. To make computation time bearable in these more complicated domains we utilize a parallel variant of our algorithm: in this implementation K learners are all independently collecting data from an instance of the environment. Updates are performed at the end of each collected trajectory using distributed synchronous gradient descent on a shared set of policy and Q-function parameters (we refer to the appendix for an algorithm description). The results of this experiment are depicted in Figure 3. ", + "bbox": [ + 174, + 196, + 825, + 295 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "For the Humanoid running domain we can observe a similar trend to the experiments from the previous section: MPO quickly finds a stable running policy, outperforming all other algorithms in terms of sample efficiency also in this high-dimensional control problem. ", + "bbox": [ + 176, + 301, + 821, + 344 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The case for the Walker-2D parkour domain (where we compare against a PPO baseline) is even more striking: where standard PPO requires approximately 1M trajectories to find a good policy MPO finds a solution that is asymptotically no worse than the PPO solution in in about 70k trajectories (or 60M samples), resulting in an order of magnitude improvement. In addition to the walker experiment we have also evaluated MPO on the Parkour domain using a humanoid body (with 22 degrees of freedom) which was learned successfully (not shown in the plot, please see the supplementary video). ", + "bbox": [ + 173, + 351, + 825, + 448 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/3f0db1cdbd6cb97bb8fdb4b7ec7943a5ae55699354d37055db91d206400596e2.jpg", + "image_caption": [ + "Figure 3: MPO on high-dimensional control problems (Parkour Walker2D and Humanoid walking from control suite). " + ], + "image_footnote": [], + "bbox": [ + 509, + 506, + 756, + 660 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/b39b3f4bf39eeac87f2d9d9433c59fe69a73415f4747eb95d2ef18eb773ea4b6.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 235, + 507, + 457, + 642 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5.3 DISCRETE CONTROL ", + "text_level": 1, + "bbox": [ + 174, + 694, + 356, + 708 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "As a proof of concept – showcasing the robustness of our algorithm and its hyperparameters – we performed an experiment on a subset of the games contained contained in the \"Arcade Learning Environment\" (ALE) where we used the same hyperparameter settings for the KL constraints as for the continuous control experiments. The results of this experiment can be found in the Appendix. ", + "bbox": [ + 174, + 722, + 825, + 779 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "6 CONCLUSION ", + "text_level": 1, + "bbox": [ + 174, + 804, + 318, + 820 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We have presented a new off-policy reinforcement learning algorithm called Maximum a-posteriori Policy Optimisation (MPO). The algorithm is motivated by the connection between RL and inference and it consists of an alternating optimisation scheme that has a direct relation to several existing algorithms from the literature. Overall, we arrive at a novel, off-policy algorithm that is highly data efficient, robust to hyperparameter choices and applicable to complex control problems. We demonstrated the effectiveness of MPO on a large set of continuous control problems. ", + "bbox": [ + 174, + 840, + 825, + 924 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/1fb493111520008f89fe9fd5525df44f3315390e08daaf3a2e48f3e75e24a2a1.jpg", + "image_caption": [ + "Figure 4: Complete comparison of results for the control suite. We plot the median performance over 10 random seeds together with 5 and $95 \\%$ quantiles (shaded area). Note that for DDPG we only plot the median to avoid clutter in the plots. For DDPG and PPO final performance is marked by a star). " + ], + "image_footnote": [], + "bbox": [ + 194, + 165, + 802, + 888 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 176, + 103, + 287, + 117 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Abbas Abdolmaleki, Bob Price, Nuno Lau, Luis Paulo Reis, Gerhard Neumann, et al. Deriving and improving cma-es with information geometric trust regions. Proceedings of the Genetic and Evolutionary Computation Conference, 2017. ", + "bbox": [ + 176, + 126, + 823, + 169 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Marcin Andrychowicz, Filip Wolski, Alex Ray, Jonas Schneider, Rachel Fong, Peter Welinder, Bob McGrew, Josh Tobin, Pieter Abbeel, and Wojciech Zaremba. Hindsight experience replay, 2017. ", + "bbox": [ + 171, + 179, + 823, + 208 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Trapit Bansal, Jakub Pachocki, Szymon Sidor, Ilya Sutskever, and Igor Mordatch. Emergent complexity via multi-agent competition, 2017. ", + "bbox": [ + 173, + 218, + 821, + 248 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Marc G. Bellemare, Will Dabney, and Rémi Munos. A distributional perspective on reinforcement learning. In Proceedings of the 34th International Conference on Machine Learning, ICML, 2017. ", + "bbox": [ + 174, + 258, + 823, + 287 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Yevgen Chebotar, Mrinal Kalakrishnan, Ali Yahya, Adrian Li, Stefan Schaal, and Sergey Levine. Path integral guided policy search. CoRR, abs/1610.00529, 2016. ", + "bbox": [ + 173, + 297, + 821, + 327 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Kamil Ciosek and Shimon Whiteson. Expected policy gradients. CoRR, abs/1706.05374, 2017. ", + "bbox": [ + 173, + 337, + 800, + 353 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "C. Daniel, G. Neumann, O. Kroemer, and J. Peters. Hierarchical relative entropy policy search. Journal of Machine Learning Research (JMLR), 2016. ", + "bbox": [ + 173, + 363, + 823, + 392 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Peter Dayan and Geoffrey E Hinton. Using expectation-maximization for reinforcement learning. Neural Computation, 9(2):271–278, 1997. ", + "bbox": [ + 169, + 402, + 823, + 433 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Marc Peter Deisenroth, Gerhard Neumann, Jan Peters, et al. A survey on policy search for robotics. Foundations and Trends in Robotics, 2(1-2):1–142, 2013. ", + "bbox": [ + 171, + 443, + 821, + 472 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Yan Duan, Xi Chen, Rein Houthooft, John Schulman, and Pieter Abbeel. Benchmarking deep reinforcement learning for continuous control. In Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48, ICML’16, pp. 1329– 1338. JMLR.org, 2016. URL http://dl.acm.org/citation.cfm?id $=$ 3045390. 3045531. ", + "bbox": [ + 173, + 481, + 825, + 553 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Carlos Florensa, Yan Duan, and Pieter Abbeel. Stochastic neural networks for hierarchical reinforcement learning. CoRR, abs/1704.03012, 2017. ", + "bbox": [ + 173, + 563, + 823, + 592 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Roy Fox, Ari Pakman, and Naftali Tishby. Taming the noise in reinforcement learning via soft updates. In Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence UAI, 2016. ", + "bbox": [ + 174, + 602, + 821, + 645 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Shixiang Gu, Ethan Holly, Timothy Lillicrap, and Sergey Levine. Deep reinforcement learning for robotic manipulation. arXiv preprint arXiv:1610.00633, 2016a. ", + "bbox": [ + 169, + 655, + 823, + 685 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Shixiang Gu, Tim Lillicrap, Ilya Sutskever, and Sergey Levine. Continuous deep q-learning with model-based acceleration. In International Conference on Machine Learning (ICML), 2016b. ", + "bbox": [ + 173, + 695, + 823, + 724 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Shixiang Gu, Timothy Lillicrap, Zoubin Ghahramani, Richard E. Turner, and Sergey Levine. Qprop: Sample-efficient policy gradient with an off-policy critic. In 5th International Conference on Learning Representations (ICLR), 2017. ", + "bbox": [ + 174, + 734, + 825, + 779 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Tuomas Haarnoja, Haoran Tang, Pieter Abbeel, and Sergey Levine. Reinforcement learning with deep energy-based policies. CoRR, abs/1702.08165, 2017. ", + "bbox": [ + 171, + 787, + 825, + 818 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Nicolas Heess, Gregory Wayne, David Silver, Tim Lillicrap, Tom Erez, and Yuval Tassa. Learning continuous control policies by stochastic value gradients. In Advances in Neural Information Processing Systems (NIPS), pp. 2926–2934, 2015. ", + "bbox": [ + 176, + 827, + 825, + 871 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Nicolas Heess, Srinivasan Sriram, Jay Lemmon, Josh Merel, Greg Wayne, Yuval Tassa, Tom Erez, Ziyu Wang, Ali Eslami, Martin Riedmiller, et al. Emergence of locomotion behaviours in rich environments. arXiv preprint arXiv:1707.02286, 2017. ", + "bbox": [ + 174, + 882, + 825, + 924 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Jonathan Ho and Stefano Ermon. Generative adversarial imitation learning. In D. D. Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett (eds.), Advances in Neural Information Processing Systems 29, pp. 4565–4573. Curran Associates, Inc., 2016. URL http://papers. nips.cc/paper/6391-generative-adversarial-imitation-learning. pdf. ", + "bbox": [ + 173, + 103, + 825, + 172 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Max Jaderberg, Volodymyr Mnih, Wojciech Marian Czarnecki, Tom Schaul, Joel Z Leibo, David Silver, and Koray Kavukcuoglu. Reinforcement learning with unsupervised auxiliary tasks, 2016. ", + "bbox": [ + 174, + 184, + 823, + 213 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Leslie Pack Kaelbling, Michael L. Littman, and Andrew P. Moore. Reinforcement learning: A survey. Journal of Artificial Intelligence Research, 4:237–285, 1996. ", + "bbox": [ + 174, + 223, + 825, + 252 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "H J Kappen. Path integrals and symmetry breaking for optimal control theory. Journal of Statistical Mechanics: Theory and Experiment, 2005. ", + "bbox": [ + 176, + 262, + 825, + 291 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Jens Kober and Jan Peters. Policy search for motor primitives in robotics. In Advances in neural information processing systems, pp. 849–856, 2009. ", + "bbox": [ + 173, + 301, + 823, + 330 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Sergey Levine and Vladlen Koltun. Variational policy search via trajectory optimization. In Advances in Neural Information Processing Systems, pp. 207–215, 2013. ", + "bbox": [ + 171, + 340, + 823, + 371 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Timothy P Lillicrap, Jonathan J Hunt, Alexander Pritzel, Nicolas Heess, Tom Erez, Yuval Tassa, David Silver, and Daan Wierstra. Continuous control with deep reinforcement learning. International Conference on Learning Representations (ICLR), 2016. ", + "bbox": [ + 176, + 380, + 823, + 422 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A Rusu, Joel Veness, Marc G Bellemare, Alex Graves, Martin Riedmiller, Andreas K Fidjeland, Georg Ostrovski, et al. Human-level control through deep reinforcement learning. Nature, 518(7540):529–533, 2015. ", + "bbox": [ + 174, + 433, + 825, + 477 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Volodymyr Mnih, Adria Puigdomenech Badia, Mehdi Mirza, Alex Graves, Timothy P Lillicrap, Tim Harley, David Silver, and Koray Kavukcuoglu. Asynchronous methods for deep reinforcement learning. In International Conference on Machine Learning (ICML), 2016. ", + "bbox": [ + 174, + 486, + 825, + 530 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "William Montgomery and Sergey Levine. Guided policy search as approximate mirror descent. CoRR, abs/1607.04614, 2016. URL http://arxiv.org/abs/1607.04614. ", + "bbox": [ + 171, + 539, + 823, + 569 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Rémi Munos, Tom Stepleton, Anna Harutyunyan, and Marc G. Bellemare. Safe and efficient offpolicy reinforcement learning. In Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems (NIPS), 2016. ", + "bbox": [ + 176, + 578, + 825, + 622 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Gerhard Neumann. Variational inference for policy search in changing situations. In Proceedings of the 28th international conference on machine learning (ICML-11), pp. 817–824, 2011. ", + "bbox": [ + 173, + 631, + 823, + 661 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Brendan O’Donoghue, Rémi Munos, Koray Kavukcuoglu, and Volodymyr Mnih. PGQ: combining policy gradient and q-learning. CoRR, abs/1611.01626, 2016. ", + "bbox": [ + 173, + 670, + 821, + 700 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Brendan O’Donoghue, Ian Osband, Rémi Munos, and Volodymyr Mnih. The uncertainty bellman equation and exploration. CoRR, abs/1709.05380, 2017. URL http://arxiv.org/abs/ 1709.05380. ", + "bbox": [ + 174, + 710, + 825, + 753 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Xue Bin Peng, Glen Berseth, and Michiel van de Panne. Terrain-adaptive locomotion skills using deep reinforcement learning. ACM Transactions on Graphics (Proc. SIGGRAPH 2016), 2016. ", + "bbox": [ + 173, + 762, + 823, + 792 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Theodore J. Perkins and Doina Precup. A convergent form of approximate policy iteration. In Advances in Neural Information Processing Systems 15 (NIPS). MIT Press, Cambridge, MA, 2002. ", + "bbox": [ + 174, + 803, + 823, + 844 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Jan Peters, Katharina Mülling, and Yasemin Altün. Relative entropy policy search. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI), 2010a. ", + "bbox": [ + 171, + 856, + 825, + 885 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Jan Peters, Katharina Mülling, and Yasemin Altun. Relative entropy policy search. In AAAI. Atlanta, 2010b. ", + "bbox": [ + 174, + 895, + 821, + 922 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Konrad Rawlik, Marc Toussaint, and Sethu Vijayakumar. On stochastic optimal control and reinforcement learning by approximate inference. In (R:SS 2012), 2012. Runner Up Best Paper Award. ", + "bbox": [ + 174, + 103, + 821, + 146 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Nicolas Le Roux. Efficient iterative policy optimization. CoRR, abs/1612.08967, 2016. URL http://arxiv.org/abs/1612.08967. ", + "bbox": [ + 171, + 155, + 823, + 184 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "John Schulman, Sergey Levine, Pieter Abbeel, Michael Jordan, and Philipp Moritz. Trust region policy optimization. In Proceedings of the 32nd International Conference on Machine Learning (ICML), 2015. ", + "bbox": [ + 173, + 193, + 823, + 236 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "John Schulman, Pieter Abbeel, and Xi Chen. Equivalence between policy gradients and soft qlearning. CoRR, abs/1704.06440, 2017a. ", + "bbox": [ + 173, + 243, + 821, + 273 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algorithms. CoRR, abs/1707.06347, 2017b. URL http://arxiv.org/abs/ 1707.06347. ", + "bbox": [ + 173, + 281, + 825, + 324 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "David Silver, Guy Lever, Nicolas Heess, Thomas Degris, Daan Wierstra, and Martin Riedmiller. Deterministic policy gradient algorithms. In International Conference on Machine Learning (ICML), 2014. ", + "bbox": [ + 174, + 333, + 825, + 376 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Richard S Sutton. Integrated architectures for learning, planning, and reacting based on approximating dynamic programming. In International Conference on Machine Learning (ICML), pp. 216–224, 1990. ", + "bbox": [ + 174, + 385, + 825, + 428 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Yuval Tassa, Yotam Doron, Alistair Muldal, Tom Erez, Yazhe Li, Diego de Las Casas, David Budden, Abbas Abdolmaleki, Josh Merel, Andrew Lefrancq, Timothy Lillicrap, and Martin Riedmiller. Deepmind control suite, 2018. URL http://arxiv.org/abs/1801.00690. ", + "bbox": [ + 174, + 435, + 825, + 479 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Evangelos Theodorou, Jonas Buchli, and Stefan Schaal. A generalized path integral control approach to reinforcement learning. Journal of Machine Learning Research (JMLR), 2010. ", + "bbox": [ + 173, + 488, + 823, + 517 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Emanuel Todorov. General duality between optimal control and estimation. In Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008, December 9-11, 2008, Cancún, México, pp. 4286–4292, 2008. ", + "bbox": [ + 176, + 526, + 823, + 569 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Ahmed Touati, Pierre-Luc Bacon, Doina Precup, and Pascal Vincent. Convergent tree-backup and retrace with function approximation. CoRR, abs/1705.09322, 2017. URL http://arxiv. org/abs/1705.09322. ", + "bbox": [ + 174, + 577, + 821, + 619 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Marc Toussaint. Robot trajectory optimization using approximate inference. In Proceedings of the 26th Annual International Conference on Machine Learning, ICML ’09, pp. 1049–1056, 2009. ISBN 978-1-60558-516-1. ", + "bbox": [ + 174, + 628, + 823, + 671 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Ziyu Wang, Victor Bapst, Nicolas Heess, Volodymyr Mnih, Rémi Munos, Koray Kavukcuoglu, and Nando de Freitas. Sample efficient actor-critic with experience replay. 5th International Conference on Learning Representations (ICLR), 2017. ", + "bbox": [ + 176, + 680, + 823, + 723 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Christian Wirth, Johannes Furnkranz, and Gerhard Neumann. Model-free preference-based reinforcement learning. In 30th AAAI Conference on Artificial Intelligence, AAAI 2016, pp. 2222– 2228, 2016. ", + "bbox": [ + 173, + 732, + 825, + 775 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Brian D Ziebart, Andrew L Maas, J Andrew Bagnell, and Anind K Dey. Maximum entropy inverse reinforcement learning. In AAAI, pp. 1433–1438, 2008. ", + "bbox": [ + 173, + 784, + 823, + 814 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "A PROOF OF MONOTONIC IMPROVEMENT FOR THE KL-REGULARIZED POLICY OPTIMIZATION PROCEDURE ", + "text_level": 1, + "bbox": [ + 173, + 102, + 767, + 136 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this section we prove a monotonic improvement guarantee for KL-regularized policy optimization via alternating updates on $\\pi$ and $q$ under the assumption that the prior on $\\theta$ is uninformative. ", + "bbox": [ + 171, + 151, + 825, + 181 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "A.1 REGULARIZED REINFORCEMENT LEARNING ", + "text_level": 1, + "bbox": [ + 174, + 199, + 527, + 214 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Let $\\pi$ be an arbitrary policy. For any other policy $q$ such that, for all $x , a , \\{ \\pi ( a | x ) > 0 \\} \\implies$ $\\{ q ( a | x ) > 0 \\}$ , define the $\\pi$ -regularized reward for policy $q$ : ", + "bbox": [ + 173, + 224, + 823, + 256 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/19b71895a29fda80f1b8591fef2b5e192fca3e05c9ba486025caa6f7d721c698.jpg", + "text": "$$\nr _ { \\alpha } ^ { \\pi , q } ( x , a ) = r ( x , a ) - \\alpha \\log \\frac { q ( a | x ) } { \\pi ( a | x ) } ,\n$$", + "text_format": "latex", + "bbox": [ + 375, + 262, + 620, + 297 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "where $\\alpha > 0$ . ", + "bbox": [ + 174, + 304, + 264, + 319 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Bellman operators: Define the $\\pi$ -regularized Bellman operator for policy $q$ ", + "bbox": [ + 173, + 335, + 686, + 352 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/508ad5a3c5fa9928bfe550dfd50ee50545843b2d286cf673ab0ef7fbced2c085.jpg", + "text": "$$\n\\begin{array} { r } { T _ { \\alpha } ^ { \\pi , q } V ( x ) = \\mathbb { E } _ { a \\sim q ( \\cdot | x ) } \\Big [ r _ { \\alpha } ^ { \\pi , q } ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } V ( y ) \\Big ] , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 312, + 359, + 683, + 386 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "and the non-regularized Bellman operator for policy $q$ ", + "bbox": [ + 174, + 393, + 529, + 409 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/681f737615b202146cd9513dce7825ec03b9da0f1e4390b5dfe43f695e4a0eed.jpg", + "text": "$$\nT ^ { q } V ( x ) = \\mathbb { E } _ { a \\sim q ( \\cdot | x ) } \\Big [ r ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } V ( y ) \\Big ] .\n$$", + "text_format": "latex", + "bbox": [ + 326, + 416, + 669, + 444 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Value function: Define the $\\pi$ -regularized value function for policy $q$ as ", + "bbox": [ + 173, + 458, + 653, + 473 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/4f5602e99a52b3bbbfced2c9d8c1c6cec1445d1690ec985743dde120900363df.jpg", + "text": "$$\nV _ { \\alpha } ^ { \\pi , q } ( \\boldsymbol { x } ) = \\mathbb { E } _ { q } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } r _ { \\alpha } ^ { \\pi , q } ( \\boldsymbol { x } _ { t } , a _ { t } ) | \\boldsymbol { x } _ { 0 } = \\boldsymbol { x } , q \\Big ] .\n$$", + "text_format": "latex", + "bbox": [ + 346, + 481, + 650, + 517 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "and the non-regularized value function ", + "bbox": [ + 173, + 525, + 429, + 540 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/2f7fd48b4d6c6c7288755235956d88617509e88daeb0635db7ca46060c49b50b.jpg", + "text": "$$\nV ^ { q } ( x ) = \\mathbb { E } _ { q } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } r ( x _ { t } , a _ { t } ) | x _ { 0 } = x , q \\Big ] .\n$$", + "text_format": "latex", + "bbox": [ + 361, + 547, + 635, + 585 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Proposition 1. For any $q , \\pi , V$ , we have $V _ { \\alpha } ^ { \\pi , q } \\leq V ^ { q }$ and $T _ { \\alpha } ^ { \\pi , q } V \\le T ^ { q } V$ . Indeed ", + "bbox": [ + 173, + 592, + 705, + 608 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/a64cd95e6d312561d3379d282bc2d9cd023b8307018318681d5a181e94947f9e.jpg", + "text": "$$\n\\mathbb { E } _ { q } \\Big [ \\log \\frac { q \\big ( a _ { t } | x _ { t } \\big ) } { \\pi \\big ( a _ { t } | x _ { t } \\big ) } \\Big ] = K L \\big ( q ( \\cdot | x _ { t } ) \\| \\pi ( \\cdot | x _ { t } ) \\big ) \\geq 0 .\n$$", + "text_format": "latex", + "bbox": [ + 338, + 616, + 658, + 650 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Optimal value function and policy Define the optimal regularized value function: $V _ { \\alpha } ^ { \\pi , * } ( x ) =$ $\\operatorname* { m a x } _ { q } V _ { \\alpha } ^ { \\pi , q } ( x )$ , and the optimal (non-regularized) value function: $V ^ { * } ( x ) = \\operatorname* { m a x } _ { q } V ^ { q } ( x )$ . ", + "bbox": [ + 171, + 665, + 823, + 695 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The optimal policy of the $\\pi$ -regularized problem $q _ { \\alpha } ^ { \\pi , * } ( \\cdot | x ) = \\arg \\operatorname* { m a x } _ { q } V _ { \\alpha } ^ { \\pi , q } ( x )$ and the optimal policy of the non-regularized problem $q ^ { * } ( \\cdot | x ) = \\arg \\operatorname* { m a x } _ { q } V ^ { q }$ . ", + "bbox": [ + 171, + 700, + 823, + 731 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Proposition 2. We have that $V _ { \\alpha } ^ { \\pi , q }$ is the unique fixed point of $T _ { \\alpha } ^ { \\pi , q }$ , and $V ^ { q }$ is the unique fixed point of $T ^ { q }$ . Thus we have the following Bellman equations: For all $x \\in X$ , ", + "bbox": [ + 171, + 734, + 820, + 763 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/66a75351c24b47e29e8ad0475f6feb00abfe1985e8f74a3c359f94cd4b27f79c.jpg", + "text": "$$\n\\begin{array} { r c l } { { V _ { \\alpha } ^ { \\pi , q } ( x ) } } & { { = } } & { { \\displaystyle \\sum _ { a } q ( a | x ) \\Big [ r _ { \\alpha } ^ { \\pi , q } ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } \\big [ V _ { \\alpha } ^ { \\pi , q } ( y ) \\big ] \\Big ] } } \\\\ { { } } & { { } } & { { } } \\\\ { { V ^ { q } ( x ) } } & { { = } } & { { \\displaystyle \\sum _ { a } q ( a | x ) \\Big [ r ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } \\big [ V ^ { q } ( y ) \\big ] \\Big ] } } \\\\ { { } } & { { } } & { { } } \\\\ { { V _ { \\alpha } ^ { \\pi , * } ( x ) } } & { { = } } & { { \\displaystyle r _ { \\alpha } ^ { \\pi , q _ { \\alpha } ^ { \\pi , * } } ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } \\big [ V _ { \\alpha } ^ { \\pi , * } ( y ) \\big ] f o r a l l a \\in A , } } \\\\ { { } } & { { } } & { { } } \\\\ { { V ^ { * } ( x ) } } & { { = } } & { { \\displaystyle \\operatorname* { m a x } _ { a \\in A } \\Big [ r ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } \\big [ V ^ { * } ( y ) \\big ] \\Big ] . } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 272, + 770, + 720, + 895 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Notice that (16) holds for all actions $a \\in A$ , and not in expectation w.r.t. $a \\sim q ( \\cdot | x )$ only. ", + "bbox": [ + 168, + 909, + 754, + 925 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "A.2 REGULARIZED JOINT POLICY GRADIENT ", + "text_level": 1, + "bbox": [ + 174, + 103, + 498, + 118 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We now consider a parametrized policy $\\pi _ { \\theta }$ and consider maximizing the regularized joint policy optimization problem for a given initial state $x _ { 0 }$ (this could be a distribution over initial states). Thus we want to find a parameter $\\theta$ that (locally) maximizes ", + "bbox": [ + 173, + 128, + 825, + 171 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/5fb3af47931f1e293c60f069a4937af38754fd0e6032f29c13b2c5a0ed8f9a2c.jpg", + "text": "$$\n\\mathcal { I } ( \\theta , q ) = V ^ { \\pi _ { \\theta } , q } ( \\boldsymbol { x } _ { 0 } ) = \\mathbb { E } _ { q } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } \\big ( r ( \\boldsymbol { x } _ { t } , a _ { t } ) - \\alpha \\mathrm { K L } ( q ( \\cdot | \\boldsymbol { x } _ { t } ) | | \\pi _ { \\theta } ( \\cdot | \\boldsymbol { x } _ { t } ) ) \\big ) \\big | \\boldsymbol { x } _ { 0 } , q \\Big ] .\n$$", + "text_format": "latex", + "bbox": [ + 235, + 175, + 761, + 213 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We start with an initial parameter $\\theta _ { 0 }$ and define a sequence of policies $\\pi _ { i } = \\pi _ { \\theta _ { i } }$ parametrized by $\\theta _ { i }$ , in the following way: ", + "bbox": [ + 171, + 223, + 825, + 252 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "• Given $\\theta _ { i }$ , define ", + "bbox": [ + 215, + 262, + 339, + 279 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/a231be82b298c49b858d95221233146488ec6ad66e7a6e4f2f7085b7f45643eb.jpg", + "text": "$$\nq _ { i } = \\arg \\operatorname* { m a x } _ { q } T _ { \\alpha } ^ { \\pi _ { \\theta _ { i } } , q } V ^ { \\pi _ { \\theta _ { i } } } ,\n$$", + "text_format": "latex", + "bbox": [ + 439, + 273, + 614, + 299 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "• Define $\\theta _ { i + 1 }$ as ", + "bbox": [ + 215, + 303, + 331, + 319 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/1bee90d5ff4b76d736775fa10d00f95f791d305affcfca00910bdf2205cf6e2f.jpg", + "text": "$$\n\\theta _ { i + 1 } = \\theta _ { i } - \\beta \\nabla _ { \\theta } \\mathbb { E } _ { \\pi _ { i } } \\left[ \\sum _ { t \\geq 0 } \\gamma ^ { t } \\mathrm { K L } \\big ( q _ { k } ( \\cdot | x _ { t } ) | | \\pi _ { \\theta } ( \\cdot | x _ { t } ) \\big ) _ { | \\theta = \\theta _ { i } } \\big | x _ { 0 } , \\pi _ { i } \\right] .\n$$", + "text_format": "latex", + "bbox": [ + 310, + 321, + 745, + 359 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Proposition 3. We have the following properties: ", + "bbox": [ + 173, + 359, + 501, + 376 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "• The policy $q _ { i }$ satisfies: ", + "bbox": [ + 215, + 386, + 380, + 401 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/c85329b4c21ece37a61527077e5df064603bd4e849bef91be85db126d0c9a8ec.jpg", + "text": "$$\nq _ { i } ( a | x ) = \\frac { \\pi _ { i } ( a | x ) e ^ { \\frac { 1 } { \\alpha } Q ^ { \\pi _ { i } } ( x , a ) } } { \\mathbb { E } _ { b \\sim \\pi _ { i } ( \\cdot | x ) } \\big [ e ^ { \\frac { 1 } { \\alpha } Q ^ { \\pi _ { i } } ( x , b ) } \\big ] } ,\n$$", + "text_format": "latex", + "bbox": [ + 413, + 405, + 642, + 444 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "where $Q ^ { \\pi } ( x , a ) = r ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } V ^ { \\pi } ( y ) .$ ", + "bbox": [ + 232, + 448, + 552, + 465 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "• We have ", + "bbox": [ + 215, + 472, + 290, + 487 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/f79df8ab2ba40bba18fbcac661d65d3983e2c2668c1a540bbe267aeb7f8f8b95.jpg", + "text": "$$\nV _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } \\geq V ^ { \\pi _ { i } } .\n$$", + "text_format": "latex", + "bbox": [ + 478, + 486, + 576, + 502 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "• For η sufficiently small, we have ", + "bbox": [ + 217, + 511, + 446, + 526 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/ac411152811a0f9ec2767761960d1140849565463498b556c838ffc1a9c268fb.jpg", + "text": "$$\n\\mathcal { I } ( \\theta _ { i + 1 } , q _ { i + 1 } ) \\geq \\mathcal { I } ( \\theta _ { i } , q _ { i } ) + c g _ { i } ,\n$$", + "text_format": "latex", + "bbox": [ + 416, + 530, + 638, + 547 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "where c is a numerical constant, and $g _ { i }$ is the norm of the gradient (minimized by the algorithm): ", + "bbox": [ + 232, + 551, + 823, + 580 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/3beb61cab24715a6c37c66b8506906fb14e67845ec9f6243b0d72435b8db5c51.jpg", + "text": "$$\ng _ { i } = \\Big \\| \\nabla _ { \\theta } \\mathbb { E } _ { \\pi _ { i } } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } K L \\big ( q _ { i } ( \\cdot | x _ { t } ) \\| \\pi _ { \\theta } ( \\cdot | x _ { t } ) \\big ) _ { | \\theta = \\theta _ { i } } \\big | x _ { 0 } , \\pi _ { i } \\Big ] \\Big \\| .\n$$", + "text_format": "latex", + "bbox": [ + 333, + 583, + 722, + 621 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Thus we build a sequence of policies $( \\pi _ { \\theta _ { i } } , q _ { i } )$ whose values $\\mathcal { I } ( \\theta _ { i } , q _ { i } )$ are non-decreasing thus converge to a local maximum. In addition, the improvement is lower-bounded by $a$ constant times the norm of the gradient, thus the algorithm keeps improving the performance until the gradient vanishes (when we reach the limit of the capacity of our representation). ", + "bbox": [ + 232, + 632, + 825, + 703 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Proof. We have ", + "bbox": [ + 173, + 718, + 281, + 733 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/b7f089d1a8523c5975d650c2cbc3c73cec952033c50a4f0c6b61d739dac54719.jpg", + "text": "$$\n\\begin{array} { r l r } { q _ { i } ( \\cdot | x ) } & { = } & { \\arg \\underset { q } { \\operatorname* { m a x } } \\mathbb { E } _ { a \\sim q ( \\cdot | x ) } \\Big [ \\underset { Q ^ { \\pi _ { i } } ( x , a ) } { \\underbrace { r \\big ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } V ^ { \\pi _ { i } } ( y ) } } - \\alpha \\log \\frac { q \\big ( a | x \\big ) } { \\pi _ { i } \\big ( a | x \\big ) } \\Big ] , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 232, + 738, + 764, + 784 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "from which we deduce (19). Now, from the definition of $q _ { i }$ , we have ", + "bbox": [ + 173, + 787, + 622, + 803 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/04f39d59eb33e246cbee27b1aada1d93ea563fdcd209acdee360483348da0a8c.jpg", + "text": "$$\nT _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } V ^ { \\pi _ { i } } \\geq T _ { \\alpha } ^ { \\pi _ { i } , \\pi _ { i } } V ^ { \\pi _ { i } } = T ^ { \\pi _ { i } } V ^ { \\pi _ { i } } = V ^ { \\pi _ { i } } .\n$$", + "text_format": "latex", + "bbox": [ + 354, + 808, + 642, + 824 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Now, since and its fixe $T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } }$ is is otone operator (i.e. if , we have $V _ { 1 } \\geq V _ { 2 }$ elementwise, then $T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } V _ { 1 } \\geq T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } V _ { 2 } )$ $V _ { \\alpha } ^ { \\pi _ { i } , q _ { i } }$ ", + "bbox": [ + 174, + 828, + 823, + 858 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/b5406ec4758472f538cfbf40ab29a64c9cbd02afff188b0f7c935c8b0aff3228.jpg", + "text": "$$\nV _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } = \\operatorname* { l i m } _ { t \\to \\infty } ( T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } ) ^ { t } V ^ { \\pi _ { i } } \\geq V ^ { \\pi _ { i } } ,\n$$", + "text_format": "latex", + "bbox": [ + 380, + 861, + 616, + 883 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "which proves (20). ", + "bbox": [ + 174, + 887, + 297, + 902 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Now, in order to prove (21) we derive the following steps. ", + "bbox": [ + 173, + 909, + 553, + 925 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Step 1: From the definition of $q _ { i + 1 }$ we have, for any $x$ ", + "bbox": [ + 173, + 103, + 547, + 118 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/552747ed5a6e20240a82619613d59708d93a9469b61b5717ae3776d2b71e4cb3.jpg", + "text": "$$\n\\begin{array} { r } { \\tilde { \\Sigma } _ { a \\sim q _ { 4 } + 1 } \\left[ Q ^ { \\pi _ { i + 1 } } ( x , a ) \\right] - \\alpha \\mathbf { K L } \\left( q _ { i + 1 } ( \\cdot | x ) \\| \\pi _ { i + 1 } ( \\cdot | x ) \\right) \\geq \\mathbb { E } _ { a \\sim q _ { 4 } } \\left[ Q ^ { \\pi _ { i + 1 } } ( x , a ) \\right] - \\alpha \\mathbf { K L } \\left( q _ { i } ( \\cdot | x ) \\| \\pi _ { i + 1 } ( \\cdot | x ) \\right) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 119, + 839, + 140 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Writing the functional that we minimize ", + "bbox": [ + 174, + 156, + 439, + 171 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/1f4b282a29f644d2f9bc8341e93165d2579b6e4b081ef15b9b49301cfa6be4ca.jpg", + "text": "$$\nf ( \\pi , q , \\theta ) = \\mathbb { E } _ { \\pi } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } \\mathrm { K L } \\big ( q ( \\cdot | x _ { t } ) \\| \\pi _ { \\theta } ( \\cdot | x _ { t } ) \\big ) \\big | x _ { 0 } , \\pi \\Big ] ,\n$$", + "text_format": "latex", + "bbox": [ + 303, + 174, + 656, + 210 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "the update rule is $\\theta _ { i + 1 } = \\theta _ { i } - \\beta \\nabla _ { \\theta } f ( \\pi _ { i } , q _ { i } , \\theta _ { i } )$ . Thus we have that for sufficiently small $\\beta$ , ", + "bbox": [ + 168, + 212, + 769, + 228 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/b66ed1027d29baee2cee300451ac53827045f254feacb981ae17b3e6a814444a.jpg", + "text": "$$\nf ( \\pi _ { i } , q _ { i } , \\theta _ { i + 1 } ) \\leq f ( \\pi _ { i } , q _ { i } , \\theta _ { i } ) - \\beta g _ { i } ,\n$$", + "text_format": "latex", + "bbox": [ + 377, + 231, + 619, + 247 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "where $\\begin{array} { r } { g _ { i } = \\frac { 1 } { 2 } \\| \\nabla _ { \\theta } f ( \\pi _ { i } , q _ { i } , \\theta _ { i } ) \\| } \\end{array}$ . ", + "bbox": [ + 174, + 250, + 387, + 268 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Step 2: Now define $\\mathcal { F }$ : ", + "bbox": [ + 173, + 280, + 338, + 295 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/993b4298f6e970d0f2e4670bc59e30344f4ff25766c36ccb063c73e26cbd300e.jpg", + "text": "$$\n\\begin{array} { r c l } { \\mathcal { F } ( \\pi , q , \\theta , \\pi ^ { \\prime } ) } & { = } & { \\displaystyle \\mathbb { E } _ { \\pi } \\left[ \\sum _ { t \\geq 0 } \\gamma ^ { t } \\big ( \\mathbb { E } _ { a \\sim q } \\big [ Q ^ { \\pi ^ { \\prime } } ( x _ { t } , a ) \\big ] - \\alpha \\mathrm { K L } \\big ( q ( \\cdot | x _ { t } ) \\| \\pi _ { \\theta } ( \\cdot | x _ { t } ) \\big ) \\big ) \\big | x _ { 0 } , \\pi \\right] } \\\\ & { = } & { \\displaystyle \\delta _ { x _ { 0 } } \\big ( I - \\gamma P ^ { \\pi } \\big ) ^ { - 1 } T _ { \\alpha } ^ { \\pi _ { \\theta } , q } V ^ { \\pi ^ { \\prime } } } \\\\ & { = } & { \\delta _ { x _ { 0 } } \\big ( I - \\gamma P ^ { \\pi } \\big ) ^ { - 1 } T ^ { q } V ^ { \\pi ^ { \\prime } } - f ( \\pi , q , \\theta ) , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 215, + 296, + 781, + 376 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "where $\\delta _ { x _ { 0 } }$ is a Dirac (in the row vector $x _ { 0 }$ ), and $P ^ { \\pi }$ is the transition matrix for policy $\\pi$ ", + "bbox": [ + 176, + 377, + 746, + 392 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "From (22) and (23) we deduce that ", + "bbox": [ + 173, + 398, + 405, + 412 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/8281c3095dc4a6dd13ecf9d780cf86802e6f3b12a3c26359dd90592202f86a3e.jpg", + "text": "$$\n\\begin{array} { r c l } { \\mathcal { F } ( \\pi _ { i } , q _ { i + 1 } , \\theta _ { i + 1 } , \\pi _ { i + 1 } ) } & { \\geq } & { \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i + 1 } , \\pi _ { i + 1 } ) } \\\\ & { \\geq } & { \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i + 1 } ) + \\beta g _ { i } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 313, + 415, + 684, + 452 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "We deduce ", + "bbox": [ + 173, + 460, + 250, + 473 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/b6f5c5e6ee822b58dd2984629f7c3e6e4c8226af264d9b586eb8d198ae26c22c.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathcal { F } ( \\pi _ { i } , q _ { i + 1 } , \\theta _ { i + 1 } , \\pi _ { i } ) } \\\\ { \\geq } & { \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i } ) + \\beta g _ { i } } \\\\ & { + \\mathcal { F } ( \\pi _ { i } , q _ { i + 1 } , \\theta _ { i + 1 } , \\pi _ { i } ) - \\mathcal { F } ( \\pi _ { i } , q _ { i + 1 } , \\theta _ { i + 1 } , \\pi _ { i + 1 } ) + \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i + 1 } ) - \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i } ) } \\\\ { = } & { \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i } ) + \\beta g _ { i } + } \\\\ & { \\mathbb { E } _ { \\pi _ { i } } \\Big [ \\displaystyle \\sum _ { t \\geq 0 } \\gamma ^ { t } \\big ( \\mathbb { E } _ { a \\sim q _ { i + 1 } } \\big [ Q ^ { \\pi _ { i } } ( x _ { t } , a ) - Q ^ { \\pi _ { i + 1 } } ( x _ { t } , a ) \\big ] - \\mathbb { E } _ { a \\sim q _ { i } } \\big [ Q ^ { \\pi _ { i } } ( x _ { t } , a ) - Q ^ { \\pi _ { i + 1 } } ( x _ { t } , a ) \\big ] \\big ) \\Big ] } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 191, + 476, + 815, + 585 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "This rewrites: ", + "bbox": [ + 174, + 616, + 266, + 631 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/8f25845cb16cee1896d898bedf65d0cec51090548fd89b16c452956e7e7d89fd.jpg", + "text": "$$\n\\delta _ { x _ { 0 } } ( I - \\gamma ^ { \\pi _ { i } } ) ^ { - 1 } \\big ( T _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } V ^ { \\pi _ { i } } - T _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } V ^ { \\pi _ { i } } \\big ) \\geq \\eta g _ { i } + O ( \\beta ^ { 2 } ) .\n$$", + "text_format": "latex", + "bbox": [ + 290, + 632, + 707, + 651 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Step 3: Now a bit of algebra. For two stochastic matrices $P$ and $P ^ { \\prime }$ , we have ", + "bbox": [ + 173, + 661, + 691, + 676 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/6833b9af9c4885f7be6be6eaabc73f30680d58070bd1fbf2d24a0be37741cfa4.jpg", + "text": "$$\n\\begin{array} { r l } & { ( I - \\gamma P ) ^ { - 1 } } \\\\ { = } & { ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } + \\gamma ( I - \\gamma P ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } } \\\\ { = } & { ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } + \\gamma \\big [ ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } + \\gamma ( I - \\gamma P ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } \\big ] ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } } \\\\ { = } & { ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } + \\gamma ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } } \\\\ & { + \\gamma ^ { 2 } ( I - \\gamma P ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 184, + 683, + 838, + 776 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Applying this equality to the transition matrices $P ^ { \\pi _ { k } }$ and $P ^ { \\pi _ { k + 1 } }$ and since $\\lVert P ^ { \\pi _ { k + 1 } } - P ^ { \\pi _ { k } } \\rVert = O ( \\eta )$ , we have: ", + "bbox": [ + 173, + 799, + 825, + 829 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/8bdebb9723dc34c32a537e413c81a04ddbece818013055ae73b233f81c4e75cd.jpg", + "text": "$$\n\\begin{array} { r l } & { V _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } } \\\\ { = } & { ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } } \\\\ { = } & { ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } + \\gamma ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } ( P ^ { \\pi _ { i + 1 } } - P ^ { \\pi _ { i } } ) ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } + O ( \\beta ^ { 2 } ) } \\\\ { = } & { ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } + ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } ( r _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } - r _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } + \\gamma P ^ { \\pi _ { i + 1 } } - \\gamma P ^ { \\pi _ { i } } ) ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } } \\\\ { = } & { V _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } + ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } ( T _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i } + 1 } V ^ { \\pi _ { i } } - T _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } V ^ { \\pi _ { k } } ) + O ( \\beta ^ { 2 } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 186, + 830, + 839, + 929 + ], + "page_idx": 15 + }, + { + "type": "table", + "img_path": "images/3d049027fa95b82742e76aaca76dec4b746d1e3c2894cc45a64f5325b8029996.jpg", + "table_caption": [ + "Table 1: Results on a subset of the ALE environments in comparison to baselines taken from (Bellemare et al., 2017) " + ], + "table_footnote": [], + "table_body": "
Game/AgentHumanDQNPrior. DuelingC51MPO
19.520.9
Pong Breakout14.6 30.5385.5366.020.9 74820.9 360.5
13,455.013,117.318,760.323,784
Q*bert Tennis-8.312.20.023.110,317.0
98.922.2
Boxing12.188.097.882.0
", + "bbox": [ + 235, + 143, + 761, + 246 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Finally, using (24), we deduce that ", + "bbox": [ + 174, + 279, + 403, + 292 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/b21e45fd65a916467315c45c1c84e9892ac2f711ac43978fbb51d0544f98608e.jpg", + "text": "$$\n\\begin{array} { l l l } { \\mathcal { I } ( \\theta _ { i + 1 } , q _ { i + 1 } ) } & { = } & { V _ { \\alpha } ^ { q _ { i } + 1 , \\pi _ { i } + 1 } \\big ( x _ { 0 } \\big ) } \\\\ & { = } & { V _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } \\big ( x _ { 0 } \\big ) + \\delta _ { x _ { 0 } } \\big ( I - \\gamma P ^ { \\pi _ { i } } \\big ) ^ { - 1 } \\big ( T _ { \\alpha } ^ { q _ { i } + 1 , \\pi _ { i + 1 } } V ^ { \\pi _ { i } } - T _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } V ^ { \\pi _ { i } } \\big ) + O ( \\beta ^ { 2 } ) } \\\\ & { \\geq } & { \\mathcal { I } ( \\theta _ { i } , q _ { i } ) + \\eta g _ { i } + O ( \\beta ^ { 2 } ) } \\\\ & { \\geq } & { \\mathcal { I } ( \\theta _ { i } , q _ { i } ) + \\frac { 1 } { 2 } \\eta g _ { i } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 194, + 300, + 803, + 388 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "for small enough $\\eta$ . ", + "bbox": [ + 174, + 395, + 303, + 410 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "B ADDITIONAL EXPERIMENT: DISCRETE CONTROL ", + "text_level": 1, + "bbox": [ + 174, + 430, + 616, + 446 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "As a proof of concept – showcasing the robustness of our algorithm and its hyperparameters – we performed an experiment on a subset of the games contained contained in the \"Arcade Learning Environment\" (ALE). For this experiment we used the same hyperparameter settings for the KL constraints as for the continuous control experiments as well as the same learning rate and merely altered the network architecture to the standard network structure used by DQN Mnih et al. (2015) – and created a seperate network with the same architecture, but predicting the parameters of the policy distribution. A comparison between our algorithm and well established baselines from the literature, in terms of the mean performance, is listed in Table 1. While we do not obtain state-ofthe-art performance in this experiment, the fact that MPO is competitive, out-of-the-box in these domains suggests that combining the ideas presented in this paper with recent advances for RL with discrete actions (Bellemare et al., 2017) could be a fruitful avenue for future work. ", + "bbox": [ + 173, + 463, + 825, + 616 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "C EXPERIMENT DETAILS ", + "text_level": 1, + "bbox": [ + 176, + 638, + 397, + 655 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "In this section we give the details on the hyper-parameters used for each experiment. All the continuous control experiments use a feed-forward network except for Parkour-2d were we used the same network architecture as in Heess et al. (2017). Other hyper parameters for MPO with non parametric variational distribution were set as follows, ", + "bbox": [ + 176, + 670, + 823, + 727 + ], + "page_idx": 16 + }, + { + "type": "table", + "img_path": "images/9aea7df29472b2a734d9b8fb63ea3ef395c0a4ded780c11b28640be851b0d3df.jpg", + "table_caption": [ + "Table 2: Parameters for non-parametric variational distribution " + ], + "table_footnote": [], + "table_body": "
Hyperparametercontrol suitehumanoid
Policy net100-100200-200
Q function net200-200300-300
E0.11
Eμ0.1"
£0.0001"
Discount factor()0.991
Adam learning rate0.00051
", + "bbox": [ + 330, + 739, + 666, + 856 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Hyperparameters for MPO with parametric variational distribution were as follows, ", + "bbox": [ + 173, + 909, + 720, + 924 + ], + "page_idx": 16 + }, + { + "type": "table", + "img_path": "images/265f9d410660612f734f42d9c5e5275ae2403351d3285b07876e818a9a07114b.jpg", + "table_caption": [ + "Table 3: Parameters for parametric variational distribution " + ], + "table_footnote": [], + "table_body": "
Hyperparametercontrol suite taskshumanoid
Policy net100-100200-200
Q function net200-200300-300
Eμ0.11
£0.00011
Discount factor ()0.991
Adam learning rate0.00051
", + "bbox": [ + 312, + 99, + 684, + 202 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "D DERIVATION OF UPDATE RULES FOR A GAUSSIAN POLICY ", + "text_level": 1, + "bbox": [ + 173, + 256, + 689, + 273 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "For continuous control we assume that the policy is given by a Gaussian distribution with a full covariance matrix, i.e, $\\pi ( \\boldsymbol { a } | \\boldsymbol { s } , \\pmb { \\theta } ) = \\mathcal { N } \\left( \\mu , \\pmb { \\Sigma } \\right)$ . Our neural network outputs the mean $\\mu = \\mu ( s )$ and Cholesky factor $A = A ( s )$ , such that $\\Sigma = A A ^ { T }$ . The lower triagular factor $A$ has positive diagonal elements enforced by the softplus transform $A _ { i i } \\log ( 1 + \\exp ( A _ { i i } ) )$ . ", + "bbox": [ + 173, + 287, + 825, + 344 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "D.1 NON-PARAMETRIC VARIATIONAL DISTRIBUTION ", + "text_level": 1, + "bbox": [ + 174, + 362, + 553, + 377 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "In this section we provide the derivations and implementation details for the non-parametric variational distribution case for both $\\mathrm { E }$ -step and M-step. ", + "bbox": [ + 173, + 388, + 823, + 417 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "D.2 E-STEP ", + "text_level": 1, + "bbox": [ + 174, + 434, + 272, + 449 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "The E-step with a non-parametric variational solves the following program, where we have replaced expectations with integrals to simplify the following derivations: ", + "bbox": [ + 173, + 460, + 823, + 489 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/79abb19cfc5e0d689e7bde00318662a5dfa7e557ca8e3279e6a5da350ba71ac7.jpg", + "text": "$$\n\\begin{array} { l } { \\displaystyle \\operatorname* { m a x } _ { q } \\int \\mu _ { q } ( s ) \\int q ( a | s ) Q _ { \\theta _ { i } } ( s , a ) d a d s } \\\\ { \\displaystyle s . t . \\int \\mu _ { q } ( s ) { \\bf K L } ( q ( a | s ) , \\pi ( a | s , \\theta _ { i } ) ) d a < \\epsilon , } \\\\ { \\displaystyle \\iint \\mu _ { q } ( s ) q ( a | s ) d a d s = 1 . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 357, + 506, + 640, + 607 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "First we write the Lagrangian equation, i.e, ", + "bbox": [ + 174, + 614, + 457, + 631 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/486183ca7f5b2729ebda3c5343d5c3c8e310496b9f5e9601dcd9761c13bf9f97.jpg", + "text": "$$\n\\begin{array} { c } { { L ( q , \\eta , \\gamma ) = \\displaystyle \\int \\mu _ { q } ( s ) \\int q ( a | s ) Q _ { \\theta _ { i } } ( s , a ) d a d s + } } \\\\ { { \\displaystyle \\eta \\left( \\epsilon - \\int \\mu _ { q } ( s ) \\int q ( a | s ) \\log \\frac { q ( a | s ) } { \\pi ( a | s , \\theta _ { i } ) } \\right) + \\gamma \\left( 1 - \\displaystyle \\iint \\mu _ { q } ( s ) q ( a | s ) d a d s \\right) . } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 200, + 655, + 800, + 724 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Next we maximise the Lagrangian $L$ w.r.t the primal variable $q$ . The derivative w.r.t $q$ reads, ", + "bbox": [ + 168, + 729, + 776, + 746 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/0723148fe81a97fbe26688adf5c0c326fc468c1bc06907d2fbe2d5df23530a92.jpg", + "text": "$$\n\\partial q L ( q , \\eta , \\gamma ) = Q _ { \\theta _ { i } } ( a , s ) - \\eta \\log q ( a | s ) + \\eta \\log \\pi ( a | s , \\pmb \\theta _ { i } ) - ( \\eta - \\gamma ) .\n$$", + "text_format": "latex", + "bbox": [ + 267, + 763, + 728, + 782 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Setting it to zero and rearranging terms we get ", + "bbox": [ + 173, + 794, + 480, + 809 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/419ba691557a8dd5a84dae08d83546c35a08d6bc39c863a20e1930df77232286.jpg", + "text": "$$\nq ( a | s ) = \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp \\left( \\frac { Q _ { \\pmb { \\theta } _ { i } } ( a , s ) } { \\eta } \\right) \\exp \\left( - \\frac { \\eta - \\gamma } { \\eta } \\right) .\n$$", + "text_format": "latex", + "bbox": [ + 313, + 825, + 683, + 861 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "However the last exponential term is a normalisation constant for $q$ . Therefore we can write, ", + "bbox": [ + 169, + 863, + 777, + 878 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/acd9b0e1d27167627e3254634727a03a260fe88cf8dafe9fe7c1f053dcdc760b.jpg", + "text": "$$\n\\exp ( - \\frac { \\eta - \\gamma } { \\eta } ) = \\int \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp ( \\frac { Q _ { \\pmb { \\theta } _ { i } } ( a , s ) } { \\eta } ) d a ,\n$$", + "text_format": "latex", + "bbox": [ + 333, + 895, + 663, + 929 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/45584bcea1f3f117f3096dc8366d9774d4c64dbda4de636bfefdd2b1fc9f7dbb.jpg", + "text": "$$\n\\gamma = \\eta - \\eta \\log \\left( \\int \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp ( \\frac { Q _ { \\pmb { \\theta } _ { i } } ( a , s ) } { \\eta } ) d a \\right) .\n$$", + "text_format": "latex", + "bbox": [ + 328, + 99, + 668, + 135 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Note that we could write $\\gamma$ based on $\\pi$ and $\\eta$ . At this point we can derive the dual function, ", + "bbox": [ + 171, + 143, + 769, + 160 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/a448e228678b7bb1f2eb43e1ce3a4008cd43608e136500ca96d3727a51d9c816.jpg", + "text": "$$\ng ( \\eta ) = \\eta \\epsilon + \\eta \\int \\mu _ { q } ( s ) \\log \\left( \\int \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp ( \\frac { Q ( a , s ) } { \\eta } ) d a \\right) .\n$$", + "text_format": "latex", + "bbox": [ + 292, + 165, + 704, + 200 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "D.3 M-STEP ", + "text_level": 1, + "bbox": [ + 173, + 214, + 274, + 229 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "To obtain the KL constraint in the $\\mathbf { M }$ step we set $p ( \\theta )$ to a Gaussian prior around the current policy, i.e, ", + "bbox": [ + 176, + 241, + 823, + 268 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/953f1d4dd059437ad180fba7715e206d9437adfdafcb37c9d10cbf016ed52105.jpg", + "text": "$$\np ( \\pmb \\theta ) \\approx \\mathcal { N } \\Big ( \\mu = \\pmb \\theta _ { i } , \\Sigma = \\frac { F _ { \\pmb \\theta _ { i } } } { \\lambda } \\Big ) ,\n$$", + "text_format": "latex", + "bbox": [ + 392, + 267, + 602, + 297 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "where $\\theta _ { i }$ are the parameters of the current policy distribution, $F _ { \\pmb { \\theta } _ { i } }$ is the empirical Fisher information matrix and $\\lambda$ . ", + "bbox": [ + 174, + 299, + 825, + 328 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "With this, and dropping constant terms our optimization program becomes ", + "bbox": [ + 176, + 334, + 663, + 351 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/1298caec4b94c89c434739404123167a1e8e4e6bd9d01d67eb4ba2e682b4adce.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\pi } \\int \\mu _ { q } ( s ) \\int q ( a | s ) \\log \\pi ( a | s , \\pmb { \\theta } ) d a d s - \\lambda ( \\pmb { \\theta } - \\pmb { \\theta } _ { i } ) ^ { T } F _ { \\pmb { \\theta _ { i } } } ^ { - 1 } ( \\pmb { \\theta } - \\pmb { \\theta } _ { i } ) .\n$$", + "text_format": "latex", + "bbox": [ + 264, + 356, + 732, + 388 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "We can observe that $( \\pmb \\theta - \\pmb \\theta _ { i } ) ^ { T } F _ { \\pmb \\theta _ { i } } ^ { - 1 } ( \\pmb \\theta - \\pmb \\theta _ { i } )$ is the second order Taylor approximation of $\\begin{array} { r } { \\int \\mu _ { q } ( s ) \\mathrm { K L } ( \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\pi ( a | s , \\pmb { \\theta } ) ) d s } \\end{array}$ which leads us to the generalized M-step objective: ", + "bbox": [ + 173, + 402, + 826, + 436 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/e5275e1e0cf0f2c9bfddf9241707ccdb4a2151b0b352705a569cd196af07678a.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\pi } \\int \\mu _ { q } ( s ) \\int q ( a | s ) \\log \\pi ( a | s , \\theta ) d a d s - \\lambda \\int \\mu _ { q } ( s ) \\mathbf { K L } ( \\pi ( a | s , \\theta _ { i } ) , \\pi ( a | s , \\theta ) ) d s\n$$", + "text_format": "latex", + "bbox": [ + 209, + 443, + 759, + 477 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "which corresponds to Equation (11) from the main text, where expectations are replaced by integrals. ", + "bbox": [ + 171, + 482, + 823, + 497 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "After obtaining the non parametric variational distribution in the $\\mathbf { M }$ step with a Gaussian policy we empirically observed that better results could be achieved by decoupling the KL constraint into two terms such that we can constrain the contribution of the mean and covariance separately i.e. ", + "bbox": [ + 174, + 502, + 826, + 546 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/23b9d5fa791c4c2bd8b5aa2f89398646a3528bffe20aa5b8a0a0fd3f44d63ede.jpg", + "text": "$$\n\\int \\mu _ { q } ( s ) \\mathrm { K L } ( \\pi _ { i } ( a | s , \\pmb \\theta ) , \\pi ( a | s , \\pmb \\theta ) ) = C _ { \\mu } + C _ { \\Sigma } ,\n$$", + "text_format": "latex", + "bbox": [ + 339, + 571, + 655, + 603 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "where ", + "bbox": [ + 173, + 611, + 217, + 625 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/5e9cecdb584af75d226dc2b9ebded0f7485cc323b36c04fbea13f2add88eaddc.jpg", + "text": "$$\n\\begin{array} { c } { { C _ { \\mu } = \\displaystyle \\int \\mu _ { q } ( s ) \\frac 1 2 \\big ( \\mathrm { t r } \\big ( \\Sigma ^ { - 1 } \\Sigma _ { i } \\big ) - n + \\mathrm { l n } ( \\frac { \\Sigma } { \\Sigma _ { i } } ) \\big ) d s , } } \\\\ { { { } } } \\\\ { { C _ { \\Sigma } = \\displaystyle \\int \\mu _ { q } ( s ) \\frac 1 2 \\big ( \\mu - \\mu _ { i } \\big ) ^ { T } \\Sigma ^ { - 1 } ( \\mu - \\mu _ { i } ) d s . } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 343, + 619, + 655, + 689 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "This decoupling allows us to set different $\\epsilon$ values for each component, i.e., $\\epsilon _ { \\mu } , \\epsilon _ { \\Sigma }$ for the mean, the covariance matrix respectively. Different $\\epsilon$ lead to different learning rates. The effectivness of this decoupling has also been shown in Abdolmaleki et al. (2017). We always set a much smaller epsilon for covariance than the mean. The intuition is that while we would like the distribution moves fast in the action space, we also want to keep the exploration to avoid premature convergence. ", + "bbox": [ + 173, + 696, + 826, + 768 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "In order to solve the constrained optimisation in the M-step, we first write the generalised Lagrangian equation, i.e, ", + "bbox": [ + 173, + 773, + 825, + 804 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/841f2c7aa058eb67d06c4f85f4daddf3b071bc49ee06632b4c8f73aaf33a6cfe.jpg", + "text": "$$\nL ( \\pmb \\theta , \\eta _ { \\mu } , \\eta _ { \\Sigma } ) = \\int \\mu _ { q } ( s ) \\int q ( a | s ) \\log \\pi ( a | s , \\pmb \\theta ) d a d s + \\eta _ { \\mu } ( \\epsilon _ { \\mu } - C _ { \\mu } ) + \\eta _ { \\Sigma } ( \\epsilon _ { \\Sigma } - C _ { \\Sigma } )\n$$", + "text_format": "latex", + "bbox": [ + 217, + 819, + 781, + 852 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Where $\\eta _ { \\mu }$ and $\\eta _ { \\Sigma }$ are Lagrangian multipliers. Following prior work on constraint optimisation, we formulate the following primal problem, ", + "bbox": [ + 173, + 854, + 825, + 883 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/b93b94f99817576cd36409fa558ec24e83f02944d691e76051e954cc61c676b6.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\pmb { \\theta } } \\operatorname* { m i n } _ { \\eta _ { \\mu } > 0 , \\eta _ { \\Sigma } > 0 } L ( \\pmb { \\theta } , \\eta _ { \\mu } , \\eta _ { \\Sigma } ) .\n$$", + "text_format": "latex", + "bbox": [ + 401, + 904, + 594, + 928 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "In order to solve for $\\pmb \\theta$ we iteratively solve the inner and outer optimisation programs independently: We fix the Lagrangian multipliers to their current value and optimise for $\\pmb \\theta$ (outer maximisation) and then fix the parameters $\\pmb \\theta$ to their current value and optimise for the Lagrangian multipliers (inner minimisation). We continue this procedure until policy parameters $\\pmb { \\theta }$ and Lagrangian multipliers converge. Please note that the same approach can be employed to bound the KL explicitly instead of decoupling the contribution of mean and covariance matrix to the KL. ", + "bbox": [ + 174, + 103, + 825, + 188 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "D.4 PARAMETRIC VARIATIONAL DISTRIBUTION ", + "text_level": 1, + "bbox": [ + 178, + 204, + 513, + 218 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "In this case we assume our variational distribution also uses a Gaussian distribution over the action space and use the same structure as our policy $\\pi$ . ", + "bbox": [ + 171, + 229, + 825, + 258 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Similar to the non-parametric case for a Gaussian distribution in the M-step we also use a decoupled KL but this time in the E-step for a Gaussian variational distribution. Using the same reasoning as in the previous section we can obtain the following generalized Lagrangian equation: ", + "bbox": [ + 173, + 265, + 826, + 309 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/de4b2919525f4d6b623529678194f028b8600a1252310bf3abf4bdee14ee6788.jpg", + "text": "$$\nL ( \\theta ^ { q } , \\eta _ { \\mu } , \\eta _ { \\Sigma } ) = \\int \\mu _ { q } ( s ) \\int q ( a | s ; \\theta ^ { q } ) A _ { i } ( a , s ) d a d s + \\eta _ { \\mu } ( \\epsilon _ { \\mu } - C _ { \\mu } ) + \\eta _ { \\Sigma } ( \\epsilon _ { \\Sigma } - C _ { \\Sigma } ) .\n$$", + "text_format": "latex", + "bbox": [ + 215, + 324, + 781, + 357 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Where $\\eta _ { \\mu }$ and $\\eta _ { \\Sigma }$ are Lagrangian multipliers. And where we use the advantage function $A ( a , s )$ instead of the $\\mathrm { Q }$ function $Q ( a , s )$ , as it empirically gave better performance. Please note that the KL in the $\\mathrm { E }$ -step is different than the one used in the M-step. Following prior works on constraint optimisation, we can formulate the following primal problem, ", + "bbox": [ + 174, + 359, + 825, + 415 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/4b234296dd6ac24b07d0dee1307a6b8b8791da36b2d98c8193a85ed6bc4271a2.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\pmb { \\theta } ^ { q } } \\operatorname* { m i n } _ { \\eta _ { \\mu } > 0 , \\eta _ { \\Sigma } > 0 } L ( \\pmb { \\theta } ^ { q } , \\eta _ { \\mu } , \\eta _ { \\Sigma } )\n$$", + "text_format": "latex", + "bbox": [ + 398, + 434, + 598, + 460 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "In order to solve for $\\pmb { \\theta } ^ { q }$ we iteratively solve the inner and outer optimisation programs independently. In order to that we fix the Lagrangian multipliers to their current value and optimise for $\\pmb { \\theta } ^ { q }$ (outer maximisation), in this case we use the likelihood ratio gradient to compute the gradient w.r.t $\\pmb { \\theta } ^ { q }$ . Subsequently we fix the parameters $\\pmb { \\theta } ^ { q }$ to their current value and optimise for Lagrangian multipliers (inner minimisation). We iteratively continue this procedure until the policy parameters $\\pmb { \\theta } ^ { q }$ and the Lagrangian multipliers converges. Please note that the same approach can be used to bound the KL explicitly instead of decoupling the contribution of mean and covariance matrix to the KL. As our policy has the same structure as the parametric variational distribution, the M step in this case reduce to set the policy parameters $\\pmb { \\theta }$ to the parameters $\\pmb { \\theta } ^ { q }$ we obtained in E-step, i.e, ", + "bbox": [ + 173, + 469, + 825, + 597 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/3335988042fcacda2ddb21904a29a953d9a17fbbbd5d1c6bf3c8258d315d9930.jpg", + "text": "$$\n\\pmb \\theta _ { i + 1 } = \\pmb \\theta ^ { q }\n$$", + "text_format": "latex", + "bbox": [ + 460, + 603, + 535, + 619 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "E IMPLEMENTATION DETAILS ", + "text_level": 1, + "bbox": [ + 176, + 640, + 434, + 655 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "While we ran most of our experiments using a single learner, we implemented a scalable variant of the presented method in which multiple workers collect data independently in an instance of the considered environment, compute gradients and send them to a chief (or parameter server) that performs parameter update by averaging gradients. That is we use distributed synchronous gradient descent. These procedures are described in Algorithms 1 and 2 for the non-parametric case and 3 for the parametric case. ", + "bbox": [ + 173, + 670, + 825, + 755 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Algorithm 1 MPO (chief) ", + "text_level": 1, + "bbox": [ + 174, + 151, + 348, + 166 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "1: Input $G$ number of gradients to average \n2: while True do \n3: initialize $\\Nu = 0$ \n4: initialize gradient store $s _ { \\phi } = \\{ \\} , s _ { \\eta } = \\{ \\} , s _ { \\eta _ { \\mu } } = \\{ \\} , s _ { \\eta _ { \\Sigma } } = \\{ \\} \\ : s _ { \\theta } = \\{ \\}$ \n5: while $N < G$ do \n6: receive next gradient from worker $w$ \n7: $\\begin{array} { l } { { s _ { \\phi } = s _ { \\phi } + [ \\bar { \\delta } \\phi ^ { w } ] } } \\\\ { { s _ { \\phi } = s _ { \\theta } + [ \\delta \\theta ^ { w } ] } } \\\\ { { s _ { \\eta } = s _ { \\eta } + [ \\delta \\eta ^ { w } ] } } \\\\ { { s _ { \\eta _ { \\mu } } = s _ { \\eta _ { \\mu } } + [ \\delta \\eta _ { \\mu } ^ { w } ] } } \\\\ { { s _ { \\eta _ { \\theta } } = s _ { \\eta _ { \\theta } } + [ \\delta \\eta _ { \\theta } ^ { w } ] } } \\end{array}$ \n8: \n9: \n10: \n11: \n12: update parameters with average gradient from \n13: $s _ { \\phi }$ , sη, sηµ, sηΣ sθ \n14: send new parameters to workers ", + "bbox": [ + 178, + 169, + 697, + 373 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "Algorithm 2 MPO (worker) - Non parametric variational distribution ", + "text_level": 1, + "bbox": [ + 174, + 482, + 629, + 496 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "1: Input = \u000f, \u000fΣ, \u000fµ, Lmax \n2: $i = 0$ , $L _ { \\mathrm { c u r r } } = 0$ \n3: Initialise $Q _ { \\omega _ { i } } ( a , s ) , \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\eta , \\eta _ { \\mu } , \\eta _ { \\Sigma }$ \n4: for each worker do \n5: while $L _ { \\mathrm { c u r r } } > L _ { \\mathrm { m a x } }$ do \n6: update replay buffer $\\boldsymbol { B }$ with $\\mathrm { L }$ trajectories from the environment \n7: $\\bar { k = 0 }$ \n8: // Find better policy by gradient descent \n9: while $k < 1 0 0 0$ do \n10: sample a mini-batch $\\boldsymbol { B }$ of $N$ $( s , a , r )$ pairs from replay \n11: sample $M$ additional actions for each state from $\\boldsymbol { B }$ , $\\bar { \\pi } ( \\bar { a } | s , \\pmb \\theta _ { i } )$ for estimating integrals \n12: compute gradients, estimating integrals using samples \n13: // Q-function gradient: \n14: $\\delta _ { \\phi } = \\partial _ { \\phi } L _ { \\phi } ^ { \\prime } ( \\phi )$ \n15: // E-Step gradient: \n16: $\\delta \\eta = \\bar { \\partial _ { \\eta } g ( \\eta ) }$ \n17: Let: q(a|s) ∝ π(a|s, θi) exp( Qθt (a,s,φ0)η ) \n18: // M-Step gradient: \n19: $[ \\delta _ { \\eta _ { \\mu } } , \\delta _ { \\eta _ { \\Sigma } } ] \\stackrel { - } { = } \\alpha \\partial _ { \\eta _ { \\mu } , \\eta _ { \\Sigma } } { \\cal L } ( \\theta _ { k } , \\eta _ { \\mu } , \\eta _ { \\Sigma } )$ \n20: $\\delta _ { \\theta } = \\partial _ { \\theta } L ( \\theta , \\eta _ { \\mu _ { k + 1 } } , \\eta _ { \\Sigma k + 1 } )$ \n21: send gradients to chief worker \n22: wait for gradient update by chief \n23: fetch new parameters $\\phi , \\theta , \\eta , \\eta _ { \\mu } , \\eta _ { \\Sigma }$ \n24: $\\begin{array} { r } { k = k + 1 ^ { \\circ } } \\\\ { i = i + 1 , L _ { \\mathrm { c u r r } } = L _ { \\mathrm { c u r r } } + L } \\\\ { \\pmb { \\theta } _ { i } = \\pmb { \\theta } , \\phi ^ { \\prime } = \\phi } \\end{array}$ \n25: \n26: ", + "bbox": [ + 173, + 501, + 826, + 872 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "Algorithm 3 MPO (worker) - parametric variational distribution ", + "text_level": 1, + "bbox": [ + 173, + 320, + 598, + 335 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "1: Input = \u000fΣ, \u000fµ, Lmax \n2: $i = 0$ , Lcurr = 0 \n3: Initialise $Q _ { \\omega _ { i } } ( a , s ) , \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\eta , \\eta _ { \\mu } , \\eta _ { \\Sigma }$ \n4: for each worker do \n5: while $L _ { \\mathrm { c u r r } } < L _ { \\mathrm { m a x } }$ do \n6: update replay buffer $\\boldsymbol { B }$ with $\\mathrm { L }$ trajectories from the environment \n7: $k = 0$ \n8: // Find better policy by gradient descent \n9: while $k < 1 0 0 0$ do \n10: sample a mini-batch $\\boldsymbol { B }$ of $\\mathrm { ~ V ~ } ( s , a , r )$ pairs from replay \n11: sample $M$ additional actions for each state from $\\boldsymbol { B }$ , $\\dot { \\pi } ( a | s , \\theta _ { k } )$ for estimating inte \ngrals \n12: compute gradients, estimating integrals using samples \n13: // Q-function gradient: \n14: $\\delta _ { \\phi } = \\partial _ { \\phi } L _ { \\phi } ^ { \\prime } ( \\phi )$ \n15: // E-Step gradient: \n16: $\\begin{array} { r l } & { \\bigl [ \\delta _ { \\eta _ { \\mu } } , \\delta _ { \\eta _ { \\Sigma } } \\bigr ] ^ { \\circ } = \\alpha \\partial _ { \\eta _ { \\mu } , \\eta _ { \\Sigma } } L ( \\pmb \\theta _ { k } , \\eta _ { \\mu } , \\eta _ { \\Sigma } ) } \\\\ & { \\delta _ { \\theta } = \\partial _ { \\theta } L ( \\pmb \\theta , \\eta _ { \\mu _ { k + 1 } } , \\eta _ { \\Sigma k + 1 , \\eta } , } \\\\ & { \\dots , \\dots } \\end{array}$ \n17: \n18: // M-Step gradient: In practice there is no M-step in this case as policy and variatinal \ndistribution $q$ use a same structure. \n19: send gradients to chief worker \n20: wait for gradient update by chief \n21: fetch new parameters $\\phi , \\theta , \\eta , \\eta _ { \\mu } , \\eta _ { \\Sigma }$ \n22: $\\begin{array} { r } { k = k + 1 ^ { \\mathbf { \\complement } } } \\\\ { i = i + 1 , L _ { \\mathrm { c u r r } } = L _ { \\mathrm { c u r r } } + L } \\\\ { \\pmb { \\theta } _ { i } = \\pmb { \\theta } , \\phi ^ { \\prime } = \\phi } \\end{array}$ \n23: \n24: ", + "bbox": [ + 173, + 340, + 826, + 704 + ], + "page_idx": 21 + } +] \ No newline at end of file diff --git a/parse/train/S1ANxQW0b/S1ANxQW0b_middle.json b/parse/train/S1ANxQW0b/S1ANxQW0b_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..d5e07d21df5ab9b0d577a191e823d5a6893c555e --- /dev/null +++ b/parse/train/S1ANxQW0b/S1ANxQW0b_middle.json @@ -0,0 +1,59235 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 78, + 471, + 96 + ], + "lines": [ + { + "bbox": [ + 105, + 77, + 474, + 99 + ], + "spans": [ + { + "bbox": [ + 105, + 77, + 474, + 99 + ], + "score": 1.0, + "content": "MAXIMUM A POSTERIORI POLICY OPTIMISATION", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 113, + 114, + 515, + 159 + ], + "lines": [ + { + "bbox": [ + 111, + 113, + 430, + 128 + ], + "spans": [ + { + "bbox": [ + 111, + 113, + 430, + 128 + ], + "score": 1.0, + "content": "Abbas Abdolmaleki, Jost Tobias Springenberg, Yuval Tassa, Remi Munos,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 111, + 124, + 257, + 138 + ], + "spans": [ + { + "bbox": [ + 111, + 124, + 257, + 138 + ], + "score": 1.0, + "content": "Nicolas Heess, Martin Riedmiller", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 112, + 137, + 214, + 149 + ], + "spans": [ + { + "bbox": [ + 112, + 137, + 214, + 149 + ], + "score": 1.0, + "content": "DeepMind, London, UK", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 113, + 148, + 516, + 161 + ], + "spans": [ + { + "bbox": [ + 113, + 148, + 516, + 161 + ], + "score": 1.0, + "content": "{aabdolmaleki,springenberg,tassa,munos,heess,riedmiller}@google.com", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 278, + 188, + 333, + 200 + ], + "lines": [ + { + "bbox": [ + 277, + 188, + 335, + 201 + ], + "spans": [ + { + "bbox": [ + 277, + 188, + 335, + 201 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 143, + 214, + 468, + 302 + ], + "lines": [ + { + "bbox": [ + 142, + 214, + 469, + 227 + ], + "spans": [ + { + "bbox": [ + 142, + 214, + 469, + 227 + ], + "score": 1.0, + "content": "We introduce a new algorithm for reinforcement learning called Maximum a-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 140, + 225, + 470, + 238 + ], + "spans": [ + { + "bbox": [ + 140, + 225, + 470, + 238 + ], + "score": 1.0, + "content": "posteriori Policy Optimisation (MPO) based on coordinate ascent on a relative-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 236, + 470, + 248 + ], + "spans": [ + { + "bbox": [ + 141, + 236, + 470, + 248 + ], + "score": 1.0, + "content": "entropy objective. We show that several existing methods can directly be related", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 248, + 470, + 259 + ], + "spans": [ + { + "bbox": [ + 141, + 248, + 470, + 259 + ], + "score": 1.0, + "content": "to our derivation. We develop two off-policy algorithms and demonstrate that", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 258, + 470, + 271 + ], + "spans": [ + { + "bbox": [ + 141, + 258, + 470, + 271 + ], + "score": 1.0, + "content": "they are competitive with the state-of-the-art in deep reinforcement learning. In", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 270, + 469, + 281 + ], + "spans": [ + { + "bbox": [ + 141, + 270, + 469, + 281 + ], + "score": 1.0, + "content": "particular, for continuous control, our method outperforms existing methods with", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 280, + 470, + 293 + ], + "spans": [ + { + "bbox": [ + 141, + 280, + 470, + 293 + ], + "score": 1.0, + "content": "respect to sample efficiency, premature convergence and robustness to hyperpa-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 291, + 211, + 304 + ], + "spans": [ + { + "bbox": [ + 141, + 291, + 211, + 304 + ], + "score": 1.0, + "content": "rameter settings.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 9.5 + }, + { + "type": "title", + "bbox": [ + 108, + 325, + 206, + 338 + ], + "lines": [ + { + "bbox": [ + 105, + 324, + 208, + 341 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 208, + 341 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 351, + 505, + 395 + ], + "lines": [ + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "score": 1.0, + "content": "Model free reinforcement learning algorithms can acquire sophisticated behaviours by interacting", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 361, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 505, + 375 + ], + "score": 1.0, + "content": "with the environment while receiving simple rewards. Recent experiments (Mnih et al., 2015; Jader-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 371, + 506, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 506, + 387 + ], + "score": 1.0, + "content": "berg et al., 2016; Heess et al., 2017) successfully combined these algorithms with powerful deep", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 384, + 453, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 453, + 397 + ], + "score": 1.0, + "content": "neural-network approximators while benefiting from the increase of compute capacity.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 107, + 401, + 505, + 478 + ], + "lines": [ + { + "bbox": [ + 106, + 401, + 504, + 413 + ], + "spans": [ + { + "bbox": [ + 106, + 401, + 504, + 413 + ], + "score": 1.0, + "content": "Unfortunately, the generality and flexibility of these algorithms comes at a price: They can require", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 411, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 505, + 425 + ], + "score": 1.0, + "content": "a large number of samples and – especially in continuous action spaces – suffer from high gradi-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 422, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 422, + 505, + 435 + ], + "score": 1.0, + "content": "ent variance. Taken together these issues can lead to unstable learning and/or slow convergence.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 434, + 506, + 446 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 506, + 446 + ], + "score": 1.0, + "content": "Nonetheless, recent years have seen significant progress, with improvements to different aspects of", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 444, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 505, + 457 + ], + "score": 1.0, + "content": "learning algorithms including stability, data-efficiency and speed, enabling notable results on a vari-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 456, + 505, + 468 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 505, + 468 + ], + "score": 1.0, + "content": "ety of domains, including locomotion (Heess et al., 2017; Peng et al., 2016), multi-agent behaviour", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 468, + 353, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 468, + 353, + 478 + ], + "score": 1.0, + "content": "(Bansal et al., 2017) and classical control (Duan et al., 2016).", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 483, + 505, + 560 + ], + "lines": [ + { + "bbox": [ + 106, + 483, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 505, + 497 + ], + "score": 1.0, + "content": "Two types of algorithms currently dominate scalable learning for continuous control problems: First,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 495, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 505, + 507 + ], + "score": 1.0, + "content": "Trust-Region Policy Optimisation (TRPO; Schulman et al. 2015) and the derivative family of Proxi-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 505, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 505, + 519 + ], + "score": 1.0, + "content": "mal Policy Optimisation algorithms (PPO; Schulman et al. 2017b). These policy-gradient algorithms", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 516, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 529 + ], + "score": 1.0, + "content": "are on-policy by design, reducing gradient variance through large batches and limiting the allowed", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 527, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 505, + 541 + ], + "score": 1.0, + "content": "change in parameters. They are robust, applicable to high-dimensional problems, and require mod-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 538, + 506, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 506, + 551 + ], + "score": 1.0, + "content": "erate parameter tuning, making them a popular first choice (Ho & Ermon, 2016). However, as", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 549, + 356, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 356, + 563 + ], + "score": 1.0, + "content": "on-policy algorithms, they suffer from poor sample efficiency.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 107, + 566, + 504, + 643 + ], + "lines": [ + { + "bbox": [ + 105, + 566, + 506, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 506, + 578 + ], + "score": 1.0, + "content": "In contrast, off-policy value-gradient algorithms such as the Deep Deterministic Policy Gradient", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "(DDPG, Silver et al. 2014; Lillicrap et al. 2016), Stochastic Value Gradient (SVG, Heess et al.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 587, + 506, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 506, + 600 + ], + "score": 1.0, + "content": "2015), and the related Normalized Advantage Function formulation (NAF, Gu et al. 2016b) rely on", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 599, + 506, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 506, + 611 + ], + "score": 1.0, + "content": "experience replay and learned (action-)value functions. These algorithms exhibit much better data", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 609, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 506, + 623 + ], + "score": 1.0, + "content": "efficiency, approaching the regime where experiments with real robots are possible (Gu et al., 2016a;", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "score": 1.0, + "content": "Andrychowicz et al., 2017). While also popular, these algorithms can be difficult to tune, especially", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 632, + 382, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 382, + 644 + ], + "score": 1.0, + "content": "for high-dimensional domains like general robot manipulation tasks.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 107, + 649, + 504, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 648, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 505, + 661 + ], + "score": 1.0, + "content": "In this paper we propose a novel off-policy algorithm that benefits from the best properties of both", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 659, + 505, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 505, + 673 + ], + "score": 1.0, + "content": "classes. It exhibits the scalability, robustness and hyperparameter insensitivity of on-policy algo-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 671, + 415, + 683 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 415, + 683 + ], + "score": 1.0, + "content": "rithms, while offering the data-efficiency of off-policy, value-based methods.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 108, + 687, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 686, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 506, + 701 + ], + "score": 1.0, + "content": "To derive our algorithm, we take advantage of the duality between control and estimation by using", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "Expectation Maximisation (EM), a powerful tool from the probabilistic estimation toolbox, in order", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "to solve control problems. This duality can be understood as replacing the question “what are the", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "actions which maximise future rewards?” with the question “assuming future success in maximising", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 44.5 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 303, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 308, + 761 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 308, + 761 + ], + "score": 1.0, + "content": "1", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 78, + 471, + 96 + ], + "lines": [ + { + "bbox": [ + 105, + 77, + 474, + 99 + ], + "spans": [ + { + "bbox": [ + 105, + 77, + 474, + 99 + ], + "score": 1.0, + "content": "MAXIMUM A POSTERIORI POLICY OPTIMISATION", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "list", + "bbox": [ + 113, + 114, + 515, + 159 + ], + "lines": [ + { + "bbox": [ + 111, + 113, + 430, + 128 + ], + "spans": [ + { + "bbox": [ + 111, + 113, + 430, + 128 + ], + "score": 1.0, + "content": "Abbas Abdolmaleki, Jost Tobias Springenberg, Yuval Tassa, Remi Munos,", + "type": "text" + } + ], + "index": 1, + "is_list_start_line": true + }, + { + "bbox": [ + 111, + 124, + 257, + 138 + ], + "spans": [ + { + "bbox": [ + 111, + 124, + 257, + 138 + ], + "score": 1.0, + "content": "Nicolas Heess, Martin Riedmiller", + "type": "text" + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 112, + 137, + 214, + 149 + ], + "spans": [ + { + "bbox": [ + 112, + 137, + 214, + 149 + ], + "score": 1.0, + "content": "DeepMind, London, UK", + "type": "text" + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 148, + 516, + 161 + ], + "spans": [ + { + "bbox": [ + 113, + 148, + 516, + 161 + ], + "score": 1.0, + "content": "{aabdolmaleki,springenberg,tassa,munos,heess,riedmiller}@google.com", + "type": "text" + } + ], + "index": 4, + "is_list_start_line": true + } + ], + "index": 2.5, + "bbox_fs": [ + 111, + 113, + 516, + 161 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 188, + 333, + 200 + ], + "lines": [ + { + "bbox": [ + 277, + 188, + 335, + 201 + ], + "spans": [ + { + "bbox": [ + 277, + 188, + 335, + 201 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 143, + 214, + 468, + 302 + ], + "lines": [ + { + "bbox": [ + 142, + 214, + 469, + 227 + ], + "spans": [ + { + "bbox": [ + 142, + 214, + 469, + 227 + ], + "score": 1.0, + "content": "We introduce a new algorithm for reinforcement learning called Maximum a-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 140, + 225, + 470, + 238 + ], + "spans": [ + { + "bbox": [ + 140, + 225, + 470, + 238 + ], + "score": 1.0, + "content": "posteriori Policy Optimisation (MPO) based on coordinate ascent on a relative-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 236, + 470, + 248 + ], + "spans": [ + { + "bbox": [ + 141, + 236, + 470, + 248 + ], + "score": 1.0, + "content": "entropy objective. We show that several existing methods can directly be related", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 248, + 470, + 259 + ], + "spans": [ + { + "bbox": [ + 141, + 248, + 470, + 259 + ], + "score": 1.0, + "content": "to our derivation. We develop two off-policy algorithms and demonstrate that", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 258, + 470, + 271 + ], + "spans": [ + { + "bbox": [ + 141, + 258, + 470, + 271 + ], + "score": 1.0, + "content": "they are competitive with the state-of-the-art in deep reinforcement learning. In", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 270, + 469, + 281 + ], + "spans": [ + { + "bbox": [ + 141, + 270, + 469, + 281 + ], + "score": 1.0, + "content": "particular, for continuous control, our method outperforms existing methods with", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 280, + 470, + 293 + ], + "spans": [ + { + "bbox": [ + 141, + 280, + 470, + 293 + ], + "score": 1.0, + "content": "respect to sample efficiency, premature convergence and robustness to hyperpa-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 291, + 211, + 304 + ], + "spans": [ + { + "bbox": [ + 141, + 291, + 211, + 304 + ], + "score": 1.0, + "content": "rameter settings.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 9.5, + "bbox_fs": [ + 140, + 214, + 470, + 304 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 325, + 206, + 338 + ], + "lines": [ + { + "bbox": [ + 105, + 324, + 208, + 341 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 208, + 341 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 351, + 505, + 395 + ], + "lines": [ + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "score": 1.0, + "content": "Model free reinforcement learning algorithms can acquire sophisticated behaviours by interacting", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 361, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 505, + 375 + ], + "score": 1.0, + "content": "with the environment while receiving simple rewards. Recent experiments (Mnih et al., 2015; Jader-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 371, + 506, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 506, + 387 + ], + "score": 1.0, + "content": "berg et al., 2016; Heess et al., 2017) successfully combined these algorithms with powerful deep", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 384, + 453, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 453, + 397 + ], + "score": 1.0, + "content": "neural-network approximators while benefiting from the increase of compute capacity.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16.5, + "bbox_fs": [ + 105, + 351, + 506, + 397 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 401, + 505, + 478 + ], + "lines": [ + { + "bbox": [ + 106, + 401, + 504, + 413 + ], + "spans": [ + { + "bbox": [ + 106, + 401, + 504, + 413 + ], + "score": 1.0, + "content": "Unfortunately, the generality and flexibility of these algorithms comes at a price: They can require", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 411, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 505, + 425 + ], + "score": 1.0, + "content": "a large number of samples and – especially in continuous action spaces – suffer from high gradi-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 422, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 422, + 505, + 435 + ], + "score": 1.0, + "content": "ent variance. Taken together these issues can lead to unstable learning and/or slow convergence.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 434, + 506, + 446 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 506, + 446 + ], + "score": 1.0, + "content": "Nonetheless, recent years have seen significant progress, with improvements to different aspects of", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 444, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 505, + 457 + ], + "score": 1.0, + "content": "learning algorithms including stability, data-efficiency and speed, enabling notable results on a vari-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 456, + 505, + 468 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 505, + 468 + ], + "score": 1.0, + "content": "ety of domains, including locomotion (Heess et al., 2017; Peng et al., 2016), multi-agent behaviour", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 468, + 353, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 468, + 353, + 478 + ], + "score": 1.0, + "content": "(Bansal et al., 2017) and classical control (Duan et al., 2016).", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 401, + 506, + 478 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 483, + 505, + 560 + ], + "lines": [ + { + "bbox": [ + 106, + 483, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 505, + 497 + ], + "score": 1.0, + "content": "Two types of algorithms currently dominate scalable learning for continuous control problems: First,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 495, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 505, + 507 + ], + "score": 1.0, + "content": "Trust-Region Policy Optimisation (TRPO; Schulman et al. 2015) and the derivative family of Proxi-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 505, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 505, + 519 + ], + "score": 1.0, + "content": "mal Policy Optimisation algorithms (PPO; Schulman et al. 2017b). These policy-gradient algorithms", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 516, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 529 + ], + "score": 1.0, + "content": "are on-policy by design, reducing gradient variance through large batches and limiting the allowed", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 527, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 505, + 541 + ], + "score": 1.0, + "content": "change in parameters. They are robust, applicable to high-dimensional problems, and require mod-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 538, + 506, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 506, + 551 + ], + "score": 1.0, + "content": "erate parameter tuning, making them a popular first choice (Ho & Ermon, 2016). However, as", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 549, + 356, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 356, + 563 + ], + "score": 1.0, + "content": "on-policy algorithms, they suffer from poor sample efficiency.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 29, + "bbox_fs": [ + 105, + 483, + 506, + 563 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 566, + 504, + 643 + ], + "lines": [ + { + "bbox": [ + 105, + 566, + 506, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 506, + 578 + ], + "score": 1.0, + "content": "In contrast, off-policy value-gradient algorithms such as the Deep Deterministic Policy Gradient", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "(DDPG, Silver et al. 2014; Lillicrap et al. 2016), Stochastic Value Gradient (SVG, Heess et al.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 587, + 506, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 506, + 600 + ], + "score": 1.0, + "content": "2015), and the related Normalized Advantage Function formulation (NAF, Gu et al. 2016b) rely on", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 599, + 506, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 506, + 611 + ], + "score": 1.0, + "content": "experience replay and learned (action-)value functions. These algorithms exhibit much better data", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 609, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 506, + 623 + ], + "score": 1.0, + "content": "efficiency, approaching the regime where experiments with real robots are possible (Gu et al., 2016a;", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "score": 1.0, + "content": "Andrychowicz et al., 2017). While also popular, these algorithms can be difficult to tune, especially", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 632, + 382, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 382, + 644 + ], + "score": 1.0, + "content": "for high-dimensional domains like general robot manipulation tasks.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 566, + 506, + 644 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 649, + 504, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 648, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 505, + 661 + ], + "score": 1.0, + "content": "In this paper we propose a novel off-policy algorithm that benefits from the best properties of both", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 659, + 505, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 505, + 673 + ], + "score": 1.0, + "content": "classes. It exhibits the scalability, robustness and hyperparameter insensitivity of on-policy algo-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 671, + 415, + 683 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 415, + 683 + ], + "score": 1.0, + "content": "rithms, while offering the data-efficiency of off-policy, value-based methods.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 648, + 505, + 683 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 687, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 686, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 506, + 701 + ], + "score": 1.0, + "content": "To derive our algorithm, we take advantage of the duality between control and estimation by using", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "Expectation Maximisation (EM), a powerful tool from the probabilistic estimation toolbox, in order", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "to solve control problems. This duality can be understood as replacing the question “what are the", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "actions which maximise future rewards?” with the question “assuming future success in maximising", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "rewards, what are the actions most likely to have been taken?”. By using this estimation objective", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 506, + 106 + ], + "score": 1.0, + "content": "we have more control over the policy change in both E and M steps, yielding robust learning. We", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "show below that several algorithms, including TRPO, can be directly related to this perspective.", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "We leverage the fast convergence properties of EM-style coordinate ascent by alternating a non-", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 506, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 506, + 139 + ], + "score": 1.0, + "content": "parametric data-based E-step which re-weights state-action samples, with a supervised, parametric", + "type": "text", + "cross_page": true + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 138, + 251, + 149 + ], + "spans": [ + { + "bbox": [ + 106, + 138, + 251, + 149 + ], + "score": 1.0, + "content": "M-step using deep neural networks.", + "type": "text", + "cross_page": true + } + ], + "index": 5 + } + ], + "index": 44.5, + "bbox_fs": [ + 105, + 686, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 148 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "rewards, what are the actions most likely to have been taken?”. By using this estimation objective", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 506, + 106 + ], + "score": 1.0, + "content": "we have more control over the policy change in both E and M steps, yielding robust learning. We", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "show below that several algorithms, including TRPO, can be directly related to this perspective.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "We leverage the fast convergence properties of EM-style coordinate ascent by alternating a non-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 506, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 506, + 139 + ], + "score": 1.0, + "content": "parametric data-based E-step which re-weights state-action samples, with a supervised, parametric", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 138, + 251, + 149 + ], + "spans": [ + { + "bbox": [ + 106, + 138, + 251, + 149 + ], + "score": 1.0, + "content": "M-step using deep neural networks.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 154, + 505, + 209 + ], + "lines": [ + { + "bbox": [ + 106, + 154, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 505, + 166 + ], + "score": 1.0, + "content": "We evaluate our algorithm on a broad spectrum of continuous control problems including a 56", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 165, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 106, + 165, + 505, + 177 + ], + "score": 1.0, + "content": "DoF humanoid body. All experiments used the same optimisation hyperparameters 1. Our al-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 175, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 175, + 505, + 190 + ], + "score": 1.0, + "content": "gorithm shows remarkable data efficiency often solving the tasks we consider an order of mag-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 187, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 106, + 187, + 505, + 199 + ], + "score": 1.0, + "content": "nitude faster than the state-of-the-art. A video of some resulting behaviours can be found here", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 198, + 333, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 198, + 333, + 211 + ], + "score": 1.0, + "content": "dropbox.com/s/pgcmjst7t0zwm4y/MPO.mp4.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8 + }, + { + "type": "title", + "bbox": [ + 109, + 227, + 282, + 240 + ], + "lines": [ + { + "bbox": [ + 105, + 226, + 284, + 242 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 284, + 242 + ], + "score": 1.0, + "content": "2 BACKGROUND AND NOTATION", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "title", + "bbox": [ + 108, + 253, + 203, + 264 + ], + "lines": [ + { + "bbox": [ + 105, + 252, + 205, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 205, + 266 + ], + "score": 1.0, + "content": "2.1 RELATED WORK", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 275, + 505, + 330 + ], + "lines": [ + { + "bbox": [ + 106, + 275, + 505, + 287 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 505, + 287 + ], + "score": 1.0, + "content": "Casting Reinforcement Learning (RL) as an inference problem has a long history dating back at least", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 286, + 505, + 298 + ], + "spans": [ + { + "bbox": [ + 106, + 286, + 505, + 298 + ], + "score": 1.0, + "content": "two decades (Dayan & Hinton, 1997). The framework presented here is inspired by a variational", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 296, + 505, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 505, + 309 + ], + "score": 1.0, + "content": "inference perspective on RL that has previously been utilised in multiple studies; c.f. Dayan &", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 505, + 321 + ], + "score": 1.0, + "content": "Hinton (1997); Neumann (2011); Deisenroth et al. (2013); Rawlik et al. (2012); Levine & Koltun", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 318, + 228, + 331 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 228, + 331 + ], + "score": 1.0, + "content": "(2013); Florensa et al. (2017).", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 335, + 505, + 511 + ], + "lines": [ + { + "bbox": [ + 105, + 335, + 505, + 349 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 505, + 349 + ], + "score": 1.0, + "content": "Particular attention has been paid to obtaining maximum entropy policies as the solution to an in-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 347, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 505, + 359 + ], + "score": 1.0, + "content": "ference problem. The penalisation of determinism can be seen encouraging both robustness and", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 358, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 106, + 358, + 505, + 370 + ], + "score": 1.0, + "content": "simplicity. Among these are methods that perform trajectory optimisation using either linearised", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 369, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 106, + 369, + 505, + 381 + ], + "score": 1.0, + "content": "dynamics (Todorov, 2008; Toussaint, 2009; Levine & Koltun, 2013) or general dynamics as in path", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 380, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 506, + 392 + ], + "score": 1.0, + "content": "integral control (Kappen, 2005; Theodorou et al., 2010). In contrast to these algorithms, here we", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 390, + 506, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 506, + 402 + ], + "score": 1.0, + "content": "do not assume the availability of a transition model and avoid on-policy optimisation. A number", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 400, + 506, + 415 + ], + "spans": [ + { + "bbox": [ + 104, + 400, + 506, + 415 + ], + "score": 1.0, + "content": "of other authors have considered the same perspective but in a model-free RL setting (Neumann,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 412, + 506, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 506, + 425 + ], + "score": 1.0, + "content": "2011; Peters et al., 2010a; Florensa et al., 2017; Daniel et al., 2016) or inverse RL problems (Ziebart", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 424, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 505, + 435 + ], + "score": 1.0, + "content": "et al., 2008). These algorithms are more directly related to our work and can be cast in the same", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 433, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 506, + 447 + ], + "score": 1.0, + "content": "(EM-like) alternating optimisation scheme on which we base our algorithm. However, they typi-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 445, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 467, + 457 + ], + "score": 1.0, + "content": "cally lack the maximisation (M)-step – with the prominent exception of REPS, AC-REPS,", + "type": "text" + }, + { + "bbox": [ + 468, + 445, + 482, + 456 + ], + "score": 0.82, + "content": "\\mathrm { P \\bar { I } ^ { 2 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 445, + 505, + 457 + ], + "score": 1.0, + "content": "-GPS", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 455, + 506, + 470 + ], + "spans": [ + { + "bbox": [ + 104, + 455, + 506, + 470 + ], + "score": 1.0, + "content": "and MDGPS (Peters et al., 2010a; Wirth et al., 2016; Chebotar et al., 2016; Montgomery & Levine,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 466, + 506, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 506, + 480 + ], + "score": 1.0, + "content": "2016) to which our algorithm is closely related as outlined below. An interesting recent addition to", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 478, + 506, + 490 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 506, + 490 + ], + "score": 1.0, + "content": "these approaches is an EM-perspective on the PoWER algorithm (Roux, 2016) which uses the same", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 489, + 506, + 501 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 506, + 501 + ], + "score": 1.0, + "content": "iterative policy improvement employed here, but commits to parametric inference distributions and", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 500, + 473, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 500, + 473, + 513 + ], + "score": 1.0, + "content": "avoids an exponential reward transformation, resulting in a harder to optimise lower bound.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 107, + 517, + 504, + 594 + ], + "lines": [ + { + "bbox": [ + 105, + 516, + 506, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 506, + 530 + ], + "score": 1.0, + "content": "As an alternative to these policy gradient inspired algorithms, the class of recent algorithms for soft", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 527, + 506, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 506, + 541 + ], + "score": 1.0, + "content": "Q-learning (e.g. Rawlik et al. (2012); Haarnoja et al. (2017); Fox et al. (2016) parameterise and", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 538, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 506, + 552 + ], + "score": 1.0, + "content": "estimate a so called “soft” Q-function directly, implicitly inducing a maximum entropy policy. A", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 104, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 104, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "perspective that can also be extended to hierarchical policies (Florensa et al., 2017), and has recently", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 560, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 506, + 574 + ], + "score": 1.0, + "content": "been used to establish connections between Q-learning and policy gradient methods (O’Donoghue", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 572, + 506, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 506, + 585 + ], + "score": 1.0, + "content": "et al., 2016; Schulman et al., 2017a). In contrast, we here rely on a parametric policy, our bound and", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 582, + 497, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 497, + 595 + ], + "score": 1.0, + "content": "derivation is however closely related to the definition of the soft (entropy regularised) Q-function.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 600, + 505, + 709 + ], + "lines": [ + { + "bbox": [ + 104, + 597, + 506, + 614 + ], + "spans": [ + { + "bbox": [ + 104, + 597, + 506, + 614 + ], + "score": 1.0, + "content": "A line of work, that is directly related to the “RL as inference” perspective, has focused on using", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 611, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 505, + 623 + ], + "score": 1.0, + "content": "information theoretic regularisers such as the entropy of the policy or the Kullback-Leibler diver-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 104, + 621, + 505, + 635 + ], + "spans": [ + { + "bbox": [ + 104, + 621, + 505, + 635 + ], + "score": 1.0, + "content": "gence (KL) between policies to stabilise standard RL objectives. In fact, most state-of-the-art policy", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 104, + 632, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 104, + 632, + 506, + 645 + ], + "score": 1.0, + "content": "gradient algorithms fall into this category. For example see the entropy regularization terms used in", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "score": 1.0, + "content": "Mnih et al. (2016) or the KL constraints employed by work on trust-region based methods (Schul-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 654, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 506, + 667 + ], + "score": 1.0, + "content": "man et al., 2015; 2017b; Gu et al., 2017; Wang et al., 2017). The latter methods introduce a trust", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "region constraint, defined by the KL divergence between the new policy and the old policy, so that", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "the expected KL divergence over state space is bounded. From the perspective of this paper these", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "trust-region based methods can be seen as optimising a parametric E-step, as in our algorithm, but", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 698, + 241, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 241, + 712 + ], + "score": 1.0, + "content": "are “missing” an explicit M-step.", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 45.5 + } + ], + "page_idx": 1, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 119, + 721, + 384, + 732 + ], + "lines": [ + { + "bbox": [ + 119, + 719, + 385, + 734 + ], + "spans": [ + { + "bbox": [ + 119, + 719, + 385, + 734 + ], + "score": 1.0, + "content": "1With the exception of the number of samples collected between updates.", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 310, + 763 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 310, + 763 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 13, + "width": 8 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 148 + ], + "lines": [], + "index": 2.5, + "bbox_fs": [ + 105, + 82, + 506, + 149 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 154, + 505, + 209 + ], + "lines": [ + { + "bbox": [ + 106, + 154, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 505, + 166 + ], + "score": 1.0, + "content": "We evaluate our algorithm on a broad spectrum of continuous control problems including a 56", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 165, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 106, + 165, + 505, + 177 + ], + "score": 1.0, + "content": "DoF humanoid body. All experiments used the same optimisation hyperparameters 1. Our al-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 175, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 175, + 505, + 190 + ], + "score": 1.0, + "content": "gorithm shows remarkable data efficiency often solving the tasks we consider an order of mag-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 187, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 106, + 187, + 505, + 199 + ], + "score": 1.0, + "content": "nitude faster than the state-of-the-art. A video of some resulting behaviours can be found here", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 198, + 333, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 198, + 333, + 211 + ], + "score": 1.0, + "content": "dropbox.com/s/pgcmjst7t0zwm4y/MPO.mp4.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 154, + 505, + 211 + ] + }, + { + "type": "title", + "bbox": [ + 109, + 227, + 282, + 240 + ], + "lines": [ + { + "bbox": [ + 105, + 226, + 284, + 242 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 284, + 242 + ], + "score": 1.0, + "content": "2 BACKGROUND AND NOTATION", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "title", + "bbox": [ + 108, + 253, + 203, + 264 + ], + "lines": [ + { + "bbox": [ + 105, + 252, + 205, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 205, + 266 + ], + "score": 1.0, + "content": "2.1 RELATED WORK", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 275, + 505, + 330 + ], + "lines": [ + { + "bbox": [ + 106, + 275, + 505, + 287 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 505, + 287 + ], + "score": 1.0, + "content": "Casting Reinforcement Learning (RL) as an inference problem has a long history dating back at least", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 286, + 505, + 298 + ], + "spans": [ + { + "bbox": [ + 106, + 286, + 505, + 298 + ], + "score": 1.0, + "content": "two decades (Dayan & Hinton, 1997). The framework presented here is inspired by a variational", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 296, + 505, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 505, + 309 + ], + "score": 1.0, + "content": "inference perspective on RL that has previously been utilised in multiple studies; c.f. Dayan &", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 505, + 321 + ], + "score": 1.0, + "content": "Hinton (1997); Neumann (2011); Deisenroth et al. (2013); Rawlik et al. (2012); Levine & Koltun", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 318, + 228, + 331 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 228, + 331 + ], + "score": 1.0, + "content": "(2013); Florensa et al. (2017).", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 275, + 505, + 331 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 335, + 505, + 511 + ], + "lines": [ + { + "bbox": [ + 105, + 335, + 505, + 349 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 505, + 349 + ], + "score": 1.0, + "content": "Particular attention has been paid to obtaining maximum entropy policies as the solution to an in-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 347, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 505, + 359 + ], + "score": 1.0, + "content": "ference problem. The penalisation of determinism can be seen encouraging both robustness and", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 358, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 106, + 358, + 505, + 370 + ], + "score": 1.0, + "content": "simplicity. Among these are methods that perform trajectory optimisation using either linearised", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 369, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 106, + 369, + 505, + 381 + ], + "score": 1.0, + "content": "dynamics (Todorov, 2008; Toussaint, 2009; Levine & Koltun, 2013) or general dynamics as in path", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 380, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 506, + 392 + ], + "score": 1.0, + "content": "integral control (Kappen, 2005; Theodorou et al., 2010). In contrast to these algorithms, here we", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 390, + 506, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 506, + 402 + ], + "score": 1.0, + "content": "do not assume the availability of a transition model and avoid on-policy optimisation. A number", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 400, + 506, + 415 + ], + "spans": [ + { + "bbox": [ + 104, + 400, + 506, + 415 + ], + "score": 1.0, + "content": "of other authors have considered the same perspective but in a model-free RL setting (Neumann,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 412, + 506, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 506, + 425 + ], + "score": 1.0, + "content": "2011; Peters et al., 2010a; Florensa et al., 2017; Daniel et al., 2016) or inverse RL problems (Ziebart", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 424, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 505, + 435 + ], + "score": 1.0, + "content": "et al., 2008). These algorithms are more directly related to our work and can be cast in the same", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 433, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 506, + 447 + ], + "score": 1.0, + "content": "(EM-like) alternating optimisation scheme on which we base our algorithm. However, they typi-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 445, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 467, + 457 + ], + "score": 1.0, + "content": "cally lack the maximisation (M)-step – with the prominent exception of REPS, AC-REPS,", + "type": "text" + }, + { + "bbox": [ + 468, + 445, + 482, + 456 + ], + "score": 0.82, + "content": "\\mathrm { P \\bar { I } ^ { 2 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 445, + 505, + 457 + ], + "score": 1.0, + "content": "-GPS", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 455, + 506, + 470 + ], + "spans": [ + { + "bbox": [ + 104, + 455, + 506, + 470 + ], + "score": 1.0, + "content": "and MDGPS (Peters et al., 2010a; Wirth et al., 2016; Chebotar et al., 2016; Montgomery & Levine,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 466, + 506, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 506, + 480 + ], + "score": 1.0, + "content": "2016) to which our algorithm is closely related as outlined below. An interesting recent addition to", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 478, + 506, + 490 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 506, + 490 + ], + "score": 1.0, + "content": "these approaches is an EM-perspective on the PoWER algorithm (Roux, 2016) which uses the same", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 489, + 506, + 501 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 506, + 501 + ], + "score": 1.0, + "content": "iterative policy improvement employed here, but commits to parametric inference distributions and", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 500, + 473, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 500, + 473, + 513 + ], + "score": 1.0, + "content": "avoids an exponential reward transformation, resulting in a harder to optimise lower bound.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 25.5, + "bbox_fs": [ + 104, + 335, + 506, + 513 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 517, + 504, + 594 + ], + "lines": [ + { + "bbox": [ + 105, + 516, + 506, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 506, + 530 + ], + "score": 1.0, + "content": "As an alternative to these policy gradient inspired algorithms, the class of recent algorithms for soft", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 527, + 506, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 506, + 541 + ], + "score": 1.0, + "content": "Q-learning (e.g. Rawlik et al. (2012); Haarnoja et al. (2017); Fox et al. (2016) parameterise and", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 538, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 506, + 552 + ], + "score": 1.0, + "content": "estimate a so called “soft” Q-function directly, implicitly inducing a maximum entropy policy. A", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 104, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 104, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "perspective that can also be extended to hierarchical policies (Florensa et al., 2017), and has recently", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 560, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 506, + 574 + ], + "score": 1.0, + "content": "been used to establish connections between Q-learning and policy gradient methods (O’Donoghue", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 572, + 506, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 506, + 585 + ], + "score": 1.0, + "content": "et al., 2016; Schulman et al., 2017a). In contrast, we here rely on a parametric policy, our bound and", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 582, + 497, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 497, + 595 + ], + "score": 1.0, + "content": "derivation is however closely related to the definition of the soft (entropy regularised) Q-function.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37, + "bbox_fs": [ + 104, + 516, + 506, + 595 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 600, + 505, + 709 + ], + "lines": [ + { + "bbox": [ + 104, + 597, + 506, + 614 + ], + "spans": [ + { + "bbox": [ + 104, + 597, + 506, + 614 + ], + "score": 1.0, + "content": "A line of work, that is directly related to the “RL as inference” perspective, has focused on using", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 611, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 505, + 623 + ], + "score": 1.0, + "content": "information theoretic regularisers such as the entropy of the policy or the Kullback-Leibler diver-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 104, + 621, + 505, + 635 + ], + "spans": [ + { + "bbox": [ + 104, + 621, + 505, + 635 + ], + "score": 1.0, + "content": "gence (KL) between policies to stabilise standard RL objectives. In fact, most state-of-the-art policy", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 104, + 632, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 104, + 632, + 506, + 645 + ], + "score": 1.0, + "content": "gradient algorithms fall into this category. For example see the entropy regularization terms used in", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "score": 1.0, + "content": "Mnih et al. (2016) or the KL constraints employed by work on trust-region based methods (Schul-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 654, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 506, + 667 + ], + "score": 1.0, + "content": "man et al., 2015; 2017b; Gu et al., 2017; Wang et al., 2017). The latter methods introduce a trust", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "region constraint, defined by the KL divergence between the new policy and the old policy, so that", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "the expected KL divergence over state space is bounded. From the perspective of this paper these", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "trust-region based methods can be seen as optimising a parametric E-step, as in our algorithm, but", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 698, + 241, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 241, + 712 + ], + "score": 1.0, + "content": "are “missing” an explicit M-step.", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 45.5, + "bbox_fs": [ + 104, + 597, + 506, + 712 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 127 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 504, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 504, + 94 + ], + "score": 1.0, + "content": "Finally, the connection between RL and inference has been invoked to motivate work on exploration.", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 506, + 106 + ], + "score": 1.0, + "content": "The most prominent examples for this are formed by work on Boltzmann exploration such as Kael-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 505, + 117 + ], + "score": 1.0, + "content": "bling et al. (1996); Perkins & Precup (2002); Sutton (1990); O’Donoghue et al. (2017), which can", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "be connected back to soft Q-learning (and thus to our approach) as shown in Haarnoja et al. (2017).", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "title", + "bbox": [ + 108, + 140, + 266, + 151 + ], + "lines": [ + { + "bbox": [ + 106, + 139, + 268, + 153 + ], + "spans": [ + { + "bbox": [ + 106, + 139, + 268, + 153 + ], + "score": 1.0, + "content": "2.2 MARKOV DECISION PROCESSES", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 160, + 505, + 239 + ], + "lines": [ + { + "bbox": [ + 105, + 159, + 505, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 331, + 174 + ], + "score": 1.0, + "content": "We consider the problem of finding an optimal policy", + "type": "text" + }, + { + "bbox": [ + 331, + 163, + 339, + 171 + ], + "score": 0.75, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 159, + 505, + 174 + ], + "score": 1.0, + "content": "for a discounted reinforcement learning", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 171, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 505, + 184 + ], + "score": 1.0, + "content": "(RL) problem; formally characterized by a Markov decision process (MDP). The MDP consists of:", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 182, + 506, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 178, + 196 + ], + "score": 1.0, + "content": "continuous states", + "type": "text" + }, + { + "bbox": [ + 178, + 185, + 184, + 192 + ], + "score": 0.65, + "content": "s", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 182, + 219, + 196 + ], + "score": 1.0, + "content": ", actions", + "type": "text" + }, + { + "bbox": [ + 219, + 185, + 225, + 192 + ], + "score": 0.72, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 182, + 322, + 196 + ], + "score": 1.0, + "content": ", transition probabilities", + "type": "text" + }, + { + "bbox": [ + 323, + 182, + 380, + 195 + ], + "score": 0.87, + "content": "p ( s _ { t + 1 } | s _ { t } , a _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 182, + 506, + 196 + ], + "score": 1.0, + "content": "– specifying the probability of", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 193, + 505, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 193, + 203, + 207 + ], + "score": 1.0, + "content": "transitioning from state", + "type": "text" + }, + { + "bbox": [ + 204, + 195, + 213, + 205 + ], + "score": 0.85, + "content": "s _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 193, + 225, + 207 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 226, + 195, + 245, + 205 + ], + "score": 0.89, + "content": "s _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 193, + 299, + 207 + ], + "score": 1.0, + "content": "under action", + "type": "text" + }, + { + "bbox": [ + 300, + 195, + 318, + 205 + ], + "score": 0.86, + "content": "a _ { t } \\textrm { -- }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 193, + 396, + 207 + ], + "score": 1.0, + "content": ", a reward function", + "type": "text" + }, + { + "bbox": [ + 397, + 194, + 446, + 205 + ], + "score": 0.93, + "content": "r ( s , a ) \\in \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 193, + 505, + 207 + ], + "score": 1.0, + "content": "as well as the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 204, + 505, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 180, + 218 + ], + "score": 1.0, + "content": "discounting factor", + "type": "text" + }, + { + "bbox": [ + 180, + 205, + 220, + 217 + ], + "score": 0.92, + "content": "\\gamma \\in [ 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 204, + 269, + 218 + ], + "score": 1.0, + "content": ". The policy", + "type": "text" + }, + { + "bbox": [ + 269, + 204, + 307, + 217 + ], + "score": 0.96, + "content": "\\pi ( a | s , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 204, + 377, + 218 + ], + "score": 1.0, + "content": "(with parameters", + "type": "text" + }, + { + "bbox": [ + 377, + 205, + 384, + 214 + ], + "score": 0.58, + "content": "\\pmb { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 204, + 505, + 218 + ], + "score": 1.0, + "content": ") is assumed to specify a prob-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 215, + 506, + 229 + ], + "spans": [ + { + "bbox": [ + 105, + 215, + 506, + 229 + ], + "score": 1.0, + "content": "ability distribution over action choices given any state and – together with the transition probabilities", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 226, + 298, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 268, + 240 + ], + "score": 1.0, + "content": "– gives rise to the stationary distribution", + "type": "text" + }, + { + "bbox": [ + 269, + 227, + 294, + 239 + ], + "score": 0.92, + "content": "\\mu _ { \\pi } ( s )", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 226, + 298, + 240 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 243, + 505, + 289 + ], + "lines": [ + { + "bbox": [ + 105, + 242, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 505, + 256 + ], + "score": 1.0, + "content": "Using these basic quantities we can now define the notion of a Markov sequence or trajec-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 127, + 253, + 509, + 282 + ], + "spans": [ + { + "bbox": [ + 127, + 254, + 249, + 266 + ], + "score": 0.88, + "content": "\\overline { { \\tau } } _ { \\pi } ~ = ~ \\{ ( s _ { 0 } , a _ { 0 } ) \\} \\ldots ( s _ { T } , a _ { T } ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 253, + 391, + 282 + ], + "score": 1.0, + "content": "by following the policy ; and the expected return", + "type": "text" + }, + { + "bbox": [ + 392, + 256, + 399, + 264 + ], + "score": 0.7, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 254, + 481, + 266 + ], + "score": 0.89, + "content": "\\begin{array} { r } { \\tau _ { \\pi } ~ \\sim ~ p _ { \\pi } ( \\tau ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 253, + 509, + 282 + ], + "score": 1.0, + "content": "with. We", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 265, + 481, + 278 + ], + "spans": [ + { + "bbox": [ + 106, + 266, + 286, + 278 + ], + "score": 0.89, + "content": "\\begin{array} { r } { p _ { \\pi } ( \\tau ) = p ( s _ { 0 } ) \\prod _ { t > 0 } p ( s _ { t + 1 } \\vert s _ { t } , a _ { t } ) \\pi ( a _ { t } \\vert s _ { t } ) ; } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 265, + 481, + 278 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathbb { E } _ { \\tau _ { \\pi } } [ \\sum _ { t = 0 } ^ { \\infty } \\gamma ^ { t } r ( s _ { t } , s _ { t } ) ] } \\end{array}", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 276, + 257, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 196, + 290 + ], + "score": 1.0, + "content": "will use the shorthand", + "type": "text" + }, + { + "bbox": [ + 197, + 278, + 253, + 289 + ], + "score": 0.92, + "content": "r _ { t } = r ( s _ { t } , a _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 276, + 257, + 290 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5 + }, + { + "type": "title", + "bbox": [ + 107, + 304, + 379, + 317 + ], + "lines": [ + { + "bbox": [ + 104, + 303, + 381, + 319 + ], + "spans": [ + { + "bbox": [ + 104, + 303, + 381, + 319 + ], + "score": 1.0, + "content": "3 MAXIMUM A POSTERIORI POLICY OPTIMISATION", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 106, + 329, + 505, + 395 + ], + "lines": [ + { + "bbox": [ + 106, + 329, + 505, + 341 + ], + "spans": [ + { + "bbox": [ + 106, + 329, + 505, + 341 + ], + "score": 1.0, + "content": "Our approach is motivated by the well established connection between RL and probabilistic infer-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 340, + 505, + 352 + ], + "spans": [ + { + "bbox": [ + 106, + 340, + 505, + 352 + ], + "score": 1.0, + "content": "ence. This connection casts the reinforcement learning problem as that of inference in a particular", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "score": 1.0, + "content": "probabilistic model. Conventional formulations of RL aim to find a trajectory that maximizes ex-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 362, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 505, + 375 + ], + "score": 1.0, + "content": "pected reward. In contrast, inference formulations start from a prior distribution over trajectories,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 372, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 505, + 386 + ], + "score": 1.0, + "content": "condition a desired outcome such as achieving a goal state, and then estimate the posterior distribu-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 384, + 310, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 384, + 310, + 396 + ], + "score": 1.0, + "content": "tion over trajectories consistent with this outcome.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 107, + 401, + 505, + 468 + ], + "lines": [ + { + "bbox": [ + 105, + 399, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 505, + 415 + ], + "score": 1.0, + "content": "A finite-horizon undiscounted reward formulation can be cast as inference problem by constructing", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 411, + 507, + 425 + ], + "spans": [ + { + "bbox": [ + 104, + 411, + 330, + 425 + ], + "score": 1.0, + "content": "a suitable probabilistic model via a likelihood function", + "type": "text" + }, + { + "bbox": [ + 331, + 412, + 447, + 424 + ], + "score": 0.91, + "content": "p ( O = 1 | \\tau ) \\propto \\mathrm { e x p } ( \\Sigma _ { t } r _ { t } / \\alpha )", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 411, + 479, + 425 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 479, + 414, + 487, + 422 + ], + "score": 0.76, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 411, + 507, + 425 + ], + "score": 1.0, + "content": "is a", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 423, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 248, + 435 + ], + "score": 1.0, + "content": "temperature parameter. Intuitively,", + "type": "text" + }, + { + "bbox": [ + 248, + 423, + 257, + 433 + ], + "score": 0.73, + "content": "O", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 424, + 505, + 435 + ], + "score": 1.0, + "content": "can be interpreted as the event of obtaining maximum reward", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 434, + 505, + 446 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 505, + 446 + ], + "score": 1.0, + "content": "by choosing an action; or the event of succeeding at the RL task (Toussaint, 2009; Neumann, 2011).", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 444, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 505, + 457 + ], + "score": 1.0, + "content": "With this definition we can define the following lower bound on the likelihood of optimality for the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 455, + 146, + 470 + ], + "spans": [ + { + "bbox": [ + 104, + 455, + 134, + 470 + ], + "score": 1.0, + "content": "policy", + "type": "text" + }, + { + "bbox": [ + 134, + 458, + 141, + 466 + ], + "score": 0.7, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 455, + 146, + 470 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 25.5 + }, + { + "type": "interline_equation", + "bbox": [ + 118, + 486, + 480, + 541 + ], + "lines": [ + { + "bbox": [ + 118, + 486, + 480, + 541 + ], + "spans": [ + { + "bbox": [ + 118, + 486, + 480, + 541 + ], + "score": 0.94, + "content": "\\begin{array} { l } { \\displaystyle \\log p _ { \\pi } ( O = 1 ) = \\log \\int p _ { \\pi } ( \\tau ) p ( O = 1 | \\tau ) d \\tau \\geq \\int q ( \\tau ) \\big [ \\log p ( O = 1 | \\tau ) + \\log \\frac { p _ { \\pi } ( \\tau ) } { q ( \\tau ) } \\big ] d \\tau } \\\\ { \\displaystyle \\qquad = \\mathbb { E } _ { q } \\Big [ \\sum _ { t } r _ { t } / \\alpha \\Big ] - \\mathrm { K L } \\Big ( q ( \\tau ) | | p _ { \\pi } ( \\tau ) \\Big ) = \\mathcal { I } ( q , \\pi ) , } \\end{array}", + "type": "interline_equation", + "image_path": "c585372fbc484f565501eb5fe988b323a1410d0d19fe5e98590a652145b9366d.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 118, + 486, + 480, + 504.3333333333333 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 118, + 504.3333333333333, + 480, + 522.6666666666666 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 118, + 522.6666666666666, + 480, + 541.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 544, + 505, + 599 + ], + "lines": [ + { + "bbox": [ + 106, + 544, + 504, + 557 + ], + "spans": [ + { + "bbox": [ + 106, + 544, + 133, + 557 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 546, + 145, + 556 + ], + "score": 0.86, + "content": "p _ { \\pi }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 544, + 332, + 557 + ], + "score": 1.0, + "content": "is the trajectory distribution induced by policy", + "type": "text" + }, + { + "bbox": [ + 332, + 544, + 360, + 556 + ], + "score": 0.92, + "content": "\\pi ( a | s )", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 544, + 484, + 557 + ], + "score": 1.0, + "content": "as described in section 2.2 and", + "type": "text" + }, + { + "bbox": [ + 485, + 545, + 504, + 556 + ], + "score": 0.9, + "content": "q ( \\tau )", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 555, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 567 + ], + "score": 1.0, + "content": "is an auxiliary distribution over trajectories that will discussed in more detail below. The lower", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 565, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 135, + 579 + ], + "score": 1.0, + "content": "bound", + "type": "text" + }, + { + "bbox": [ + 135, + 567, + 145, + 577 + ], + "score": 0.84, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 565, + 505, + 579 + ], + "score": 1.0, + "content": "is the evidence lower bound (ELBO) which plays an important role in the probabilistic", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 576, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 449, + 591 + ], + "score": 1.0, + "content": "modeling literature. It is worth already noting here that optimizing (2) with respect to", + "type": "text" + }, + { + "bbox": [ + 449, + 579, + 456, + 588 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 576, + 505, + 591 + ], + "score": 1.0, + "content": "can be seen", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 588, + 224, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 224, + 601 + ], + "score": 1.0, + "content": "as a regularized RL problem.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 107, + 604, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "An important motivation for transforming a RL problem into an inference problem is that this allows", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 617, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 617, + 383, + 628 + ], + "score": 1.0, + "content": "us draw from the rich toolbox of inference methods: For instance,", + "type": "text" + }, + { + "bbox": [ + 384, + 617, + 393, + 627 + ], + "score": 0.8, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 617, + 505, + 628 + ], + "score": 1.0, + "content": "can be optimized with the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 473, + 639 + ], + "score": 1.0, + "content": "familiy of expectation maximization (EM) algorithms which alternate between improving", + "type": "text" + }, + { + "bbox": [ + 473, + 627, + 483, + 638 + ], + "score": 0.79, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 639, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 147, + 650 + ], + "score": 1.0, + "content": "respect to", + "type": "text" + }, + { + "bbox": [ + 147, + 640, + 154, + 649 + ], + "score": 0.75, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 639, + 171, + 650 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 171, + 640, + 178, + 648 + ], + "score": 0.76, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 639, + 505, + 650 + ], + "score": 1.0, + "content": ". In this paper we follow classical (Dayan & Hinton, 1997) and more recent works", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 648, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 505, + 662 + ], + "score": 1.0, + "content": "(e.g. Peters et al. 2010b; Levine & Koltun 2013; Daniel et al. 2016; Wirth et al. 2016) and cast policy", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 659, + 506, + 674 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 506, + 674 + ], + "score": 1.0, + "content": "search as a particular instance of this family. Our algorithm then combines properties of existing", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 671, + 480, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 480, + 682 + ], + "score": 1.0, + "content": "approaches in this family with properties of recent off-policy algorithms for neural networks.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "The algorithm alternates between two phases which we refer to as E and M step in reference to an", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 258, + 712 + ], + "score": 1.0, + "content": "EM-algorithm. The E-step improves", + "type": "text" + }, + { + "bbox": [ + 259, + 699, + 268, + 710 + ], + "score": 0.83, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 699, + 334, + 712 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 334, + 701, + 340, + 710 + ], + "score": 0.74, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 699, + 506, + 712 + ], + "score": 1.0, + "content": ". Existing EM policy search approaches", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 710, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 506, + 722 + ], + "score": 1.0, + "content": "perform this step typically by reweighting trajectories with sample returns (Kober & Peters, 2009)", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 721, + 506, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 506, + 732 + ], + "score": 1.0, + "content": "or via local trajectory optimization (Levine & Koltun, 2013). We show how off-policy deep RL", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 45.5 + } + ], + "page_idx": 2, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 127 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 504, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 504, + 94 + ], + "score": 1.0, + "content": "Finally, the connection between RL and inference has been invoked to motivate work on exploration.", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 506, + 106 + ], + "score": 1.0, + "content": "The most prominent examples for this are formed by work on Boltzmann exploration such as Kael-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 505, + 117 + ], + "score": 1.0, + "content": "bling et al. (1996); Perkins & Precup (2002); Sutton (1990); O’Donoghue et al. (2017), which can", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "be connected back to soft Q-learning (and thus to our approach) as shown in Haarnoja et al. (2017).", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5, + "bbox_fs": [ + 105, + 83, + 506, + 128 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 140, + 266, + 151 + ], + "lines": [ + { + "bbox": [ + 106, + 139, + 268, + 153 + ], + "spans": [ + { + "bbox": [ + 106, + 139, + 268, + 153 + ], + "score": 1.0, + "content": "2.2 MARKOV DECISION PROCESSES", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 160, + 505, + 239 + ], + "lines": [ + { + "bbox": [ + 105, + 159, + 505, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 331, + 174 + ], + "score": 1.0, + "content": "We consider the problem of finding an optimal policy", + "type": "text" + }, + { + "bbox": [ + 331, + 163, + 339, + 171 + ], + "score": 0.75, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 159, + 505, + 174 + ], + "score": 1.0, + "content": "for a discounted reinforcement learning", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 171, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 505, + 184 + ], + "score": 1.0, + "content": "(RL) problem; formally characterized by a Markov decision process (MDP). The MDP consists of:", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 182, + 506, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 178, + 196 + ], + "score": 1.0, + "content": "continuous states", + "type": "text" + }, + { + "bbox": [ + 178, + 185, + 184, + 192 + ], + "score": 0.65, + "content": "s", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 182, + 219, + 196 + ], + "score": 1.0, + "content": ", actions", + "type": "text" + }, + { + "bbox": [ + 219, + 185, + 225, + 192 + ], + "score": 0.72, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 182, + 322, + 196 + ], + "score": 1.0, + "content": ", transition probabilities", + "type": "text" + }, + { + "bbox": [ + 323, + 182, + 380, + 195 + ], + "score": 0.87, + "content": "p ( s _ { t + 1 } | s _ { t } , a _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 182, + 506, + 196 + ], + "score": 1.0, + "content": "– specifying the probability of", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 193, + 505, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 193, + 203, + 207 + ], + "score": 1.0, + "content": "transitioning from state", + "type": "text" + }, + { + "bbox": [ + 204, + 195, + 213, + 205 + ], + "score": 0.85, + "content": "s _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 193, + 225, + 207 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 226, + 195, + 245, + 205 + ], + "score": 0.89, + "content": "s _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 193, + 299, + 207 + ], + "score": 1.0, + "content": "under action", + "type": "text" + }, + { + "bbox": [ + 300, + 195, + 318, + 205 + ], + "score": 0.86, + "content": "a _ { t } \\textrm { -- }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 193, + 396, + 207 + ], + "score": 1.0, + "content": ", a reward function", + "type": "text" + }, + { + "bbox": [ + 397, + 194, + 446, + 205 + ], + "score": 0.93, + "content": "r ( s , a ) \\in \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 193, + 505, + 207 + ], + "score": 1.0, + "content": "as well as the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 204, + 505, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 180, + 218 + ], + "score": 1.0, + "content": "discounting factor", + "type": "text" + }, + { + "bbox": [ + 180, + 205, + 220, + 217 + ], + "score": 0.92, + "content": "\\gamma \\in [ 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 204, + 269, + 218 + ], + "score": 1.0, + "content": ". The policy", + "type": "text" + }, + { + "bbox": [ + 269, + 204, + 307, + 217 + ], + "score": 0.96, + "content": "\\pi ( a | s , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 204, + 377, + 218 + ], + "score": 1.0, + "content": "(with parameters", + "type": "text" + }, + { + "bbox": [ + 377, + 205, + 384, + 214 + ], + "score": 0.58, + "content": "\\pmb { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 204, + 505, + 218 + ], + "score": 1.0, + "content": ") is assumed to specify a prob-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 215, + 506, + 229 + ], + "spans": [ + { + "bbox": [ + 105, + 215, + 506, + 229 + ], + "score": 1.0, + "content": "ability distribution over action choices given any state and – together with the transition probabilities", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 226, + 298, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 268, + 240 + ], + "score": 1.0, + "content": "– gives rise to the stationary distribution", + "type": "text" + }, + { + "bbox": [ + 269, + 227, + 294, + 239 + ], + "score": 0.92, + "content": "\\mu _ { \\pi } ( s )", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 226, + 298, + 240 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 159, + 506, + 240 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 243, + 505, + 289 + ], + "lines": [ + { + "bbox": [ + 105, + 242, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 505, + 256 + ], + "score": 1.0, + "content": "Using these basic quantities we can now define the notion of a Markov sequence or trajec-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 127, + 253, + 509, + 282 + ], + "spans": [ + { + "bbox": [ + 127, + 254, + 249, + 266 + ], + "score": 0.88, + "content": "\\overline { { \\tau } } _ { \\pi } ~ = ~ \\{ ( s _ { 0 } , a _ { 0 } ) \\} \\ldots ( s _ { T } , a _ { T } ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 253, + 391, + 282 + ], + "score": 1.0, + "content": "by following the policy ; and the expected return", + "type": "text" + }, + { + "bbox": [ + 392, + 256, + 399, + 264 + ], + "score": 0.7, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 254, + 481, + 266 + ], + "score": 0.89, + "content": "\\begin{array} { r } { \\tau _ { \\pi } ~ \\sim ~ p _ { \\pi } ( \\tau ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 253, + 509, + 282 + ], + "score": 1.0, + "content": "with. We", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 265, + 481, + 278 + ], + "spans": [ + { + "bbox": [ + 106, + 266, + 286, + 278 + ], + "score": 0.89, + "content": "\\begin{array} { r } { p _ { \\pi } ( \\tau ) = p ( s _ { 0 } ) \\prod _ { t > 0 } p ( s _ { t + 1 } \\vert s _ { t } , a _ { t } ) \\pi ( a _ { t } \\vert s _ { t } ) ; } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 265, + 481, + 278 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathbb { E } _ { \\tau _ { \\pi } } [ \\sum _ { t = 0 } ^ { \\infty } \\gamma ^ { t } r ( s _ { t } , s _ { t } ) ] } \\end{array}", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 276, + 257, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 196, + 290 + ], + "score": 1.0, + "content": "will use the shorthand", + "type": "text" + }, + { + "bbox": [ + 197, + 278, + 253, + 289 + ], + "score": 0.92, + "content": "r _ { t } = r ( s _ { t } , a _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 276, + 257, + 290 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 242, + 509, + 290 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 304, + 379, + 317 + ], + "lines": [ + { + "bbox": [ + 104, + 303, + 381, + 319 + ], + "spans": [ + { + "bbox": [ + 104, + 303, + 381, + 319 + ], + "score": 1.0, + "content": "3 MAXIMUM A POSTERIORI POLICY OPTIMISATION", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 106, + 329, + 505, + 395 + ], + "lines": [ + { + "bbox": [ + 106, + 329, + 505, + 341 + ], + "spans": [ + { + "bbox": [ + 106, + 329, + 505, + 341 + ], + "score": 1.0, + "content": "Our approach is motivated by the well established connection between RL and probabilistic infer-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 340, + 505, + 352 + ], + "spans": [ + { + "bbox": [ + 106, + 340, + 505, + 352 + ], + "score": 1.0, + "content": "ence. This connection casts the reinforcement learning problem as that of inference in a particular", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "score": 1.0, + "content": "probabilistic model. Conventional formulations of RL aim to find a trajectory that maximizes ex-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 362, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 505, + 375 + ], + "score": 1.0, + "content": "pected reward. In contrast, inference formulations start from a prior distribution over trajectories,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 372, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 505, + 386 + ], + "score": 1.0, + "content": "condition a desired outcome such as achieving a goal state, and then estimate the posterior distribu-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 384, + 310, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 384, + 310, + 396 + ], + "score": 1.0, + "content": "tion over trajectories consistent with this outcome.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 329, + 505, + 396 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 401, + 505, + 468 + ], + "lines": [ + { + "bbox": [ + 105, + 399, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 505, + 415 + ], + "score": 1.0, + "content": "A finite-horizon undiscounted reward formulation can be cast as inference problem by constructing", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 411, + 507, + 425 + ], + "spans": [ + { + "bbox": [ + 104, + 411, + 330, + 425 + ], + "score": 1.0, + "content": "a suitable probabilistic model via a likelihood function", + "type": "text" + }, + { + "bbox": [ + 331, + 412, + 447, + 424 + ], + "score": 0.91, + "content": "p ( O = 1 | \\tau ) \\propto \\mathrm { e x p } ( \\Sigma _ { t } r _ { t } / \\alpha )", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 411, + 479, + 425 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 479, + 414, + 487, + 422 + ], + "score": 0.76, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 411, + 507, + 425 + ], + "score": 1.0, + "content": "is a", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 423, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 248, + 435 + ], + "score": 1.0, + "content": "temperature parameter. Intuitively,", + "type": "text" + }, + { + "bbox": [ + 248, + 423, + 257, + 433 + ], + "score": 0.73, + "content": "O", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 424, + 505, + 435 + ], + "score": 1.0, + "content": "can be interpreted as the event of obtaining maximum reward", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 434, + 505, + 446 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 505, + 446 + ], + "score": 1.0, + "content": "by choosing an action; or the event of succeeding at the RL task (Toussaint, 2009; Neumann, 2011).", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 444, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 505, + 457 + ], + "score": 1.0, + "content": "With this definition we can define the following lower bound on the likelihood of optimality for the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 455, + 146, + 470 + ], + "spans": [ + { + "bbox": [ + 104, + 455, + 134, + 470 + ], + "score": 1.0, + "content": "policy", + "type": "text" + }, + { + "bbox": [ + 134, + 458, + 141, + 466 + ], + "score": 0.7, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 455, + 146, + 470 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 25.5, + "bbox_fs": [ + 104, + 399, + 507, + 470 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 118, + 486, + 480, + 541 + ], + "lines": [ + { + "bbox": [ + 118, + 486, + 480, + 541 + ], + "spans": [ + { + "bbox": [ + 118, + 486, + 480, + 541 + ], + "score": 0.94, + "content": "\\begin{array} { l } { \\displaystyle \\log p _ { \\pi } ( O = 1 ) = \\log \\int p _ { \\pi } ( \\tau ) p ( O = 1 | \\tau ) d \\tau \\geq \\int q ( \\tau ) \\big [ \\log p ( O = 1 | \\tau ) + \\log \\frac { p _ { \\pi } ( \\tau ) } { q ( \\tau ) } \\big ] d \\tau } \\\\ { \\displaystyle \\qquad = \\mathbb { E } _ { q } \\Big [ \\sum _ { t } r _ { t } / \\alpha \\Big ] - \\mathrm { K L } \\Big ( q ( \\tau ) | | p _ { \\pi } ( \\tau ) \\Big ) = \\mathcal { I } ( q , \\pi ) , } \\end{array}", + "type": "interline_equation", + "image_path": "c585372fbc484f565501eb5fe988b323a1410d0d19fe5e98590a652145b9366d.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 118, + 486, + 480, + 504.3333333333333 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 118, + 504.3333333333333, + 480, + 522.6666666666666 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 118, + 522.6666666666666, + 480, + 541.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 544, + 505, + 599 + ], + "lines": [ + { + "bbox": [ + 106, + 544, + 504, + 557 + ], + "spans": [ + { + "bbox": [ + 106, + 544, + 133, + 557 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 546, + 145, + 556 + ], + "score": 0.86, + "content": "p _ { \\pi }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 544, + 332, + 557 + ], + "score": 1.0, + "content": "is the trajectory distribution induced by policy", + "type": "text" + }, + { + "bbox": [ + 332, + 544, + 360, + 556 + ], + "score": 0.92, + "content": "\\pi ( a | s )", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 544, + 484, + 557 + ], + "score": 1.0, + "content": "as described in section 2.2 and", + "type": "text" + }, + { + "bbox": [ + 485, + 545, + 504, + 556 + ], + "score": 0.9, + "content": "q ( \\tau )", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 555, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 567 + ], + "score": 1.0, + "content": "is an auxiliary distribution over trajectories that will discussed in more detail below. The lower", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 565, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 135, + 579 + ], + "score": 1.0, + "content": "bound", + "type": "text" + }, + { + "bbox": [ + 135, + 567, + 145, + 577 + ], + "score": 0.84, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 565, + 505, + 579 + ], + "score": 1.0, + "content": "is the evidence lower bound (ELBO) which plays an important role in the probabilistic", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 576, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 449, + 591 + ], + "score": 1.0, + "content": "modeling literature. It is worth already noting here that optimizing (2) with respect to", + "type": "text" + }, + { + "bbox": [ + 449, + 579, + 456, + 588 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 576, + 505, + 591 + ], + "score": 1.0, + "content": "can be seen", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 588, + 224, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 224, + 601 + ], + "score": 1.0, + "content": "as a regularized RL problem.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 544, + 505, + 601 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 604, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "An important motivation for transforming a RL problem into an inference problem is that this allows", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 617, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 617, + 383, + 628 + ], + "score": 1.0, + "content": "us draw from the rich toolbox of inference methods: For instance,", + "type": "text" + }, + { + "bbox": [ + 384, + 617, + 393, + 627 + ], + "score": 0.8, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 617, + 505, + 628 + ], + "score": 1.0, + "content": "can be optimized with the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 473, + 639 + ], + "score": 1.0, + "content": "familiy of expectation maximization (EM) algorithms which alternate between improving", + "type": "text" + }, + { + "bbox": [ + 473, + 627, + 483, + 638 + ], + "score": 0.79, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 639, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 147, + 650 + ], + "score": 1.0, + "content": "respect to", + "type": "text" + }, + { + "bbox": [ + 147, + 640, + 154, + 649 + ], + "score": 0.75, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 639, + 171, + 650 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 171, + 640, + 178, + 648 + ], + "score": 0.76, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 639, + 505, + 650 + ], + "score": 1.0, + "content": ". In this paper we follow classical (Dayan & Hinton, 1997) and more recent works", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 648, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 505, + 662 + ], + "score": 1.0, + "content": "(e.g. Peters et al. 2010b; Levine & Koltun 2013; Daniel et al. 2016; Wirth et al. 2016) and cast policy", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 659, + 506, + 674 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 506, + 674 + ], + "score": 1.0, + "content": "search as a particular instance of this family. Our algorithm then combines properties of existing", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 671, + 480, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 480, + 682 + ], + "score": 1.0, + "content": "approaches in this family with properties of recent off-policy algorithms for neural networks.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 605, + 506, + 682 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "The algorithm alternates between two phases which we refer to as E and M step in reference to an", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 258, + 712 + ], + "score": 1.0, + "content": "EM-algorithm. The E-step improves", + "type": "text" + }, + { + "bbox": [ + 259, + 699, + 268, + 710 + ], + "score": 0.83, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 699, + 334, + 712 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 334, + 701, + 340, + 710 + ], + "score": 0.74, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 699, + 506, + 712 + ], + "score": 1.0, + "content": ". Existing EM policy search approaches", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 710, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 506, + 722 + ], + "score": 1.0, + "content": "perform this step typically by reweighting trajectories with sample returns (Kober & Peters, 2009)", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 721, + 506, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 506, + 732 + ], + "score": 1.0, + "content": "or via local trajectory optimization (Levine & Koltun, 2013). We show how off-policy deep RL", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "techniques and value-function approximation can be used to make this step both scalable as well as", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "data efficient. The M-step then updates the parametric policy in a supervised learning step using the", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 343, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 343, + 117 + ], + "score": 1.0, + "content": "reweighted state-action samples from the E-step as targets.", + "type": "text", + "cross_page": true + } + ], + "index": 2 + } + ], + "index": 45.5, + "bbox_fs": [ + 105, + 687, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "techniques and value-function approximation can be used to make this step both scalable as well as", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "data efficient. The M-step then updates the parametric policy in a supervised learning step using the", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 343, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 343, + 117 + ], + "score": 1.0, + "content": "reweighted state-action samples from the E-step as targets.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 121, + 505, + 177 + ], + "lines": [ + { + "bbox": [ + 106, + 122, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 106, + 122, + 505, + 133 + ], + "score": 1.0, + "content": "These choices lead to the following desirable properties: (a) low-variance estimates of the expected", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 133, + 505, + 145 + ], + "spans": [ + { + "bbox": [ + 106, + 133, + 505, + 145 + ], + "score": 1.0, + "content": "return via function approximation; (b) low-sample complexity of value function estimate via robust", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 144, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 505, + 156 + ], + "score": 1.0, + "content": "off-policy learning; (c) minimal parametric assumption about the form of the trajectory distribution", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 506, + 167 + ], + "score": 1.0, + "content": "in the E-step; (d) policy updates via supervised learning in the M step; (e) robust updates via hard", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 318, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 318, + 179 + ], + "score": 1.0, + "content": "trust-region constraints in both the E and the M step.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + }, + { + "type": "title", + "bbox": [ + 107, + 190, + 231, + 201 + ], + "lines": [ + { + "bbox": [ + 106, + 189, + 232, + 202 + ], + "spans": [ + { + "bbox": [ + 106, + 189, + 232, + 202 + ], + "score": 1.0, + "content": "3.1 POLICY IMPROVEMENT", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 210, + 505, + 245 + ], + "lines": [ + { + "bbox": [ + 105, + 210, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 506, + 223 + ], + "score": 1.0, + "content": "The derivation of our algorithm then starts from the infinite-horizon analogue of the KL-regularized", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 221, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 505, + 234 + ], + "score": 1.0, + "content": "expected reward objective from Equation (2). In particular, we consider variational distributions", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 231, + 503, + 246 + ], + "spans": [ + { + "bbox": [ + 107, + 232, + 126, + 244 + ], + "score": 0.92, + "content": "q ( \\tau )", + "type": "inline_equation" + }, + { + "bbox": [ + 126, + 231, + 246, + 246 + ], + "score": 1.0, + "content": "that factor in the same way as", + "type": "text" + }, + { + "bbox": [ + 247, + 234, + 258, + 244 + ], + "score": 0.85, + "content": "p _ { \\pi }", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 231, + 277, + 246 + ], + "score": 1.0, + "content": ", i.e.", + "type": "text" + }, + { + "bbox": [ + 277, + 232, + 445, + 245 + ], + "score": 0.91, + "content": "\\begin{array} { r } { q ( \\tau ) = \\bar { p } ( s _ { 0 } ) \\prod _ { t > 0 } p ( s _ { t + 1 } | s _ { t } , a _ { t } ) q ( a _ { t } | s _ { t } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 231, + 503, + 246 + ], + "score": 1.0, + "content": "which yields:", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "interline_equation", + "bbox": [ + 169, + 248, + 443, + 280 + ], + "lines": [ + { + "bbox": [ + 169, + 248, + 443, + 280 + ], + "spans": [ + { + "bbox": [ + 169, + 248, + 443, + 280 + ], + "score": 0.92, + "content": "\\mathcal { I } ( \\boldsymbol { q } , \\theta ) = \\mathbb { E } _ { \\boldsymbol { q } } \\Big [ \\sum _ { t = 0 } ^ { \\infty } \\gamma ^ { t } \\big [ r _ { t } - \\alpha \\mathbf { K L } \\big ( \\boldsymbol { q } ( \\boldsymbol { a } | s _ { t } ) \\| \\pi ( \\boldsymbol { a } | s _ { t } , \\theta ) \\big ) \\big ] \\Big ] + \\log p ( \\theta ) .", + "type": "interline_equation", + "image_path": "c47386aa60fd8ec474158aad73358c473d096deaaf823906ff6f90a6b43d5fd9.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 169, + 248, + 443, + 258.6666666666667 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 169, + 258.6666666666667, + 443, + 269.33333333333337 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 169, + 269.33333333333337, + 443, + 280.00000000000006 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 282, + 505, + 338 + ], + "lines": [ + { + "bbox": [ + 106, + 282, + 505, + 295 + ], + "spans": [ + { + "bbox": [ + 106, + 283, + 331, + 295 + ], + "score": 1.0, + "content": "Note that due to the assumption about the structure of", + "type": "text" + }, + { + "bbox": [ + 332, + 282, + 351, + 295 + ], + "score": 0.92, + "content": "q ( \\tau )", + "type": "inline_equation" + }, + { + "bbox": [ + 351, + 283, + 368, + 295 + ], + "score": 1.0, + "content": "the", + "type": "text" + }, + { + "bbox": [ + 369, + 283, + 384, + 293 + ], + "score": 0.27, + "content": "\\mathrm { K L }", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 283, + 505, + 295 + ], + "score": 1.0, + "content": "over trajectories decomposes", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 294, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 505, + 306 + ], + "score": 1.0, + "content": "into a KL over the individual state-conditional action distributions. This objective has also been", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 303, + 506, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 438, + 318 + ], + "score": 1.0, + "content": "considered e.g. by Haarnoja et al. (2017); Schulman et al. (2017a). The additional", + "type": "text" + }, + { + "bbox": [ + 439, + 305, + 473, + 317 + ], + "score": 0.92, + "content": "\\log p ( \\pmb \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 303, + 506, + 318 + ], + "score": 1.0, + "content": "term is", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 315, + 505, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 505, + 329 + ], + "score": 1.0, + "content": "a prior over policy parameters and can be motivated by a maximum a-posteriori estimation problem", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 327, + 235, + 339 + ], + "spans": [ + { + "bbox": [ + 106, + 327, + 235, + 339 + ], + "score": 1.0, + "content": "(see appendix for more details).", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 343, + 387, + 355 + ], + "lines": [ + { + "bbox": [ + 106, + 342, + 388, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 342, + 388, + 357 + ], + "score": 1.0, + "content": "We also define the regularized Q-value function associated with (3) as", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "interline_equation", + "bbox": [ + 176, + 357, + 433, + 397 + ], + "lines": [ + { + "bbox": [ + 176, + 357, + 433, + 397 + ], + "spans": [ + { + "bbox": [ + 176, + 357, + 433, + 397 + ], + "score": 0.94, + "content": "Q _ { \\theta } ^ { q } ( s , a ) = r _ { 0 } + \\mathbb { E } _ { q ( \\tau ) , s _ { 0 } = s , a _ { 0 } = a } \\left[ \\sum _ { t \\geq 1 } ^ { \\infty } \\gamma ^ { t } \\big [ r _ { t } - \\alpha \\mathrm { K L } ( q _ { t } \\| \\pi _ { t } ) \\big ] \\right] ,", + "type": "interline_equation", + "image_path": "94b398d8581f4b49760d89cd721f5bc7a45444c60483374fc1cfd24d10e845ba.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 176, + 357, + 433, + 370.3333333333333 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 176, + 370.3333333333333, + 433, + 383.66666666666663 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 176, + 383.66666666666663, + 433, + 396.99999999999994 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 399, + 504, + 423 + ], + "lines": [ + { + "bbox": [ + 105, + 398, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 127, + 414 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 128, + 399, + 291, + 414 + ], + "score": 0.93, + "content": "\\mathrm { K L } \\big ( q _ { t } | | \\pi _ { t } \\big ) = \\mathrm { K L } \\big ( q ( a | s _ { t } ) \\big ) \\| \\pi ( a | s _ { t } , \\pmb { \\theta } ) \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 398, + 339, + 414 + ], + "score": 1.0, + "content": ". Note that", + "type": "text" + }, + { + "bbox": [ + 340, + 399, + 387, + 414 + ], + "score": 0.92, + "content": "\\mathrm { K L } \\big ( q _ { 0 } | | \\pi _ { 0 } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 398, + 407, + 414 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 407, + 400, + 426, + 413 + ], + "score": 0.92, + "content": "p ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 398, + 506, + 414 + ], + "score": 1.0, + "content": "are not part of the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 411, + 310, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 310, + 424 + ], + "score": 1.0, + "content": "Q-function as they are not a function of the action.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 106, + 428, + 505, + 532 + ], + "lines": [ + { + "bbox": [ + 105, + 428, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 223, + 443 + ], + "score": 1.0, + "content": "We observe that optimizing", + "type": "text" + }, + { + "bbox": [ + 223, + 429, + 233, + 439 + ], + "score": 0.81, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 428, + 299, + 443 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 300, + 431, + 306, + 440 + ], + "score": 0.77, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 428, + 506, + 443 + ], + "score": 1.0, + "content": "is equivalent to solving an expected reward RL", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 102, + 438, + 508, + 461 + ], + "spans": [ + { + "bbox": [ + 102, + 438, + 237, + 461 + ], + "score": 1.0, + "content": "problem with augmented reward", + "type": "text" + }, + { + "bbox": [ + 237, + 440, + 338, + 456 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\tilde { r } _ { t } = r _ { t } - \\alpha \\log \\frac { q ( a _ { t } | s _ { t } ) } { \\pi ( a _ { t } | s _ { t } , \\pmb { \\theta } ) } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 438, + 390, + 461 + ], + "score": 1.0, + "content": ". In this view", + "type": "text" + }, + { + "bbox": [ + 391, + 444, + 398, + 452 + ], + "score": 0.73, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 438, + 508, + 461 + ], + "score": 1.0, + "content": "represents a default policy", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 455, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 168, + 467 + ], + "score": 1.0, + "content": "towards which", + "type": "text" + }, + { + "bbox": [ + 168, + 457, + 175, + 466 + ], + "score": 0.77, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 455, + 469, + 467 + ], + "score": 1.0, + "content": "is regularized – i.e. the current best policy. The MPO algorithm treats", + "type": "text" + }, + { + "bbox": [ + 469, + 457, + 477, + 465 + ], + "score": 0.74, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 455, + 505, + 467 + ], + "score": 1.0, + "content": "as the", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 466, + 504, + 478 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 259, + 478 + ], + "score": 1.0, + "content": "primary object of interest. In this case", + "type": "text" + }, + { + "bbox": [ + 260, + 468, + 266, + 477 + ], + "score": 0.8, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 466, + 494, + 478 + ], + "score": 1.0, + "content": "serves as an auxiliary distribution that allows optimizing", + "type": "text" + }, + { + "bbox": [ + 494, + 466, + 504, + 477 + ], + "score": 0.8, + "content": "\\mathcal { I }", + "type": "inline_equation" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 477, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 240, + 489 + ], + "score": 1.0, + "content": "via alternate coordinate ascent in", + "type": "text" + }, + { + "bbox": [ + 240, + 479, + 246, + 488 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 477, + 264, + 489 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 264, + 478, + 276, + 488 + ], + "score": 0.83, + "content": "\\pi _ { \\pmb { \\theta } }", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 477, + 505, + 489 + ], + "score": 1.0, + "content": ", analogous to the expectation-maximization algorithm in", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 488, + 505, + 499 + ], + "spans": [ + { + "bbox": [ + 106, + 488, + 398, + 499 + ], + "score": 1.0, + "content": "the probabilistic modelling literature. In our case, the E-step optimizes", + "type": "text" + }, + { + "bbox": [ + 398, + 488, + 408, + 498 + ], + "score": 0.83, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 488, + 472, + 499 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 472, + 489, + 479, + 499 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 488, + 505, + 499 + ], + "score": 1.0, + "content": "while", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 497, + 506, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 193, + 512 + ], + "score": 1.0, + "content": "the M-step optimizes", + "type": "text" + }, + { + "bbox": [ + 194, + 499, + 204, + 509 + ], + "score": 0.84, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 497, + 266, + 512 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 267, + 500, + 273, + 508 + ], + "score": 0.71, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 274, + 497, + 399, + 512 + ], + "score": 1.0, + "content": ". Different optimizations in the", + "type": "text" + }, + { + "bbox": [ + 399, + 499, + 407, + 508 + ], + "score": 0.25, + "content": "\\mathrm { E }", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 497, + 506, + 512 + ], + "score": 1.0, + "content": "-step and M-step lead to", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 509, + 506, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 374, + 522 + ], + "score": 1.0, + "content": "different algorithms. In particular, we note that for the case where", + "type": "text" + }, + { + "bbox": [ + 374, + 510, + 394, + 522 + ], + "score": 0.91, + "content": "p ( \\pmb \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 509, + 506, + 522 + ], + "score": 1.0, + "content": "is an uninformative prior a", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 520, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 520, + 481, + 533 + ], + "score": 1.0, + "content": "variant of our algorithm has a monotonic improvement guarantee as show in the Appendix A.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 30 + }, + { + "type": "title", + "bbox": [ + 107, + 544, + 164, + 556 + ], + "lines": [ + { + "bbox": [ + 106, + 543, + 165, + 557 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 165, + 557 + ], + "score": 1.0, + "content": "3.2 E-STEP", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 107, + 564, + 505, + 588 + ], + "lines": [ + { + "bbox": [ + 105, + 563, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 210, + 579 + ], + "score": 1.0, + "content": "In the E-step of iteration", + "type": "text" + }, + { + "bbox": [ + 210, + 566, + 216, + 575 + ], + "score": 0.71, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 563, + 374, + 579 + ], + "score": 1.0, + "content": "we perform a partial maximization of", + "type": "text" + }, + { + "bbox": [ + 374, + 565, + 407, + 577 + ], + "score": 0.93, + "content": "\\mathcal { I } ( \\boldsymbol { q } , \\boldsymbol { \\theta } )", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 563, + 472, + 579 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 473, + 568, + 479, + 577 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 563, + 505, + 579 + ], + "score": 1.0, + "content": "given", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 576, + 464, + 589 + ], + "spans": [ + { + "bbox": [ + 107, + 577, + 134, + 587 + ], + "score": 0.9, + "content": "\\theta = \\theta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 576, + 215, + 589 + ], + "score": 1.0, + "content": ". We start by setting", + "type": "text" + }, + { + "bbox": [ + 215, + 578, + 248, + 588 + ], + "score": 0.9, + "content": "q = \\pi _ { \\pmb { \\theta } _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 576, + 464, + 589 + ], + "score": 1.0, + "content": "and estimate the unregularized action-value function:", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5 + }, + { + "type": "interline_equation", + "bbox": [ + 197, + 590, + 413, + 624 + ], + "lines": [ + { + "bbox": [ + 197, + 590, + 413, + 624 + ], + "spans": [ + { + "bbox": [ + 197, + 590, + 413, + 624 + ], + "score": 0.93, + "content": "Q _ { \\theta _ { i } } ^ { q } ( s , a ) = Q _ { \\theta _ { i } } ( s , a ) = \\mathbb { E } _ { \\tau _ { \\pi _ { i } } , s _ { 0 } = s , a _ { 0 } = a } \\left[ \\sum _ { t } ^ { \\infty } \\gamma ^ { t } r _ { t } \\right] ,", + "type": "interline_equation", + "image_path": "d9f00c5111450b96b213f94b248479dff577bc7b9241eb53ba84cc72b59a9377.jpg" + } + ] + } + ], + "index": 38.5, + "virtual_lines": [ + { + "bbox": [ + 197, + 590, + 413, + 607.0 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 197, + 607.0, + 413, + 624.0 + ], + "spans": [], + "index": 39 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 626, + 506, + 689 + ], + "lines": [ + { + "bbox": [ + 106, + 626, + 506, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 626, + 130, + 640 + ], + "score": 1.0, + "content": "since", + "type": "text" + }, + { + "bbox": [ + 131, + 627, + 192, + 639 + ], + "score": 0.92, + "content": "\\mathrm { K L } ( q | | \\pi _ { i } ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 626, + 295, + 640 + ], + "score": 1.0, + "content": ". In practice we estimate", + "type": "text" + }, + { + "bbox": [ + 296, + 627, + 312, + 639 + ], + "score": 0.91, + "content": "Q _ { \\pmb { \\theta } _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 626, + 506, + 640 + ], + "score": 1.0, + "content": "from off-policy data (we refer to Section 4 for", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 637, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 505, + 651 + ], + "score": 1.0, + "content": "details about the policy evaluation step). This greatly increases the data efficiency of our algorithm.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 648, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 133, + 662 + ], + "score": 1.0, + "content": "Given", + "type": "text" + }, + { + "bbox": [ + 133, + 649, + 150, + 661 + ], + "score": 0.91, + "content": "Q _ { \\pmb { \\theta } _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 648, + 270, + 662 + ], + "score": 1.0, + "content": "we improve the lower bound", + "type": "text" + }, + { + "bbox": [ + 270, + 649, + 279, + 659 + ], + "score": 0.82, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 648, + 304, + 662 + ], + "score": 1.0, + "content": "w.r.t.", + "type": "text" + }, + { + "bbox": [ + 304, + 650, + 311, + 660 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 648, + 387, + 662 + ], + "score": 1.0, + "content": "by first expanding", + "type": "text" + }, + { + "bbox": [ + 387, + 649, + 426, + 661 + ], + "score": 0.93, + "content": "Q _ { \\theta _ { i } } ( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 648, + 505, + 662 + ], + "score": 1.0, + "content": "via the regularized", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 104, + 660, + 506, + 680 + ], + "spans": [ + { + "bbox": [ + 104, + 661, + 180, + 678 + ], + "score": 1.0, + "content": "Bellman operator", + "type": "text" + }, + { + "bbox": [ + 180, + 660, + 430, + 680 + ], + "score": 0.87, + "content": "\\begin{array} { r } { T ^ { \\pi , q } = \\mathbb { E } _ { q ( a \\mid s ) } \\Big [ r ( s , a ) - \\alpha \\mathbf { K L } ( q \\| \\pi _ { i } ) + \\gamma \\mathbb { E } _ { p ( s ^ { \\prime } \\mid s , a ) } [ V _ { \\pmb { \\theta } _ { i } } ( s ^ { \\prime } ) ] \\Big ] . } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 661, + 506, + 678 + ], + "score": 1.0, + "content": ", and optimize the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 676, + 253, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 253, + 691 + ], + "score": 1.0, + "content": "“one-step” KL regularised objective", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42 + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 691, + 435, + 736 + ], + "lines": [ + { + "bbox": [ + 177, + 691, + 435, + 736 + ], + "spans": [ + { + "bbox": [ + 177, + 691, + 435, + 736 + ], + "score": 0.9, + "content": "\\begin{array} { l } { \\displaystyle \\mathop { \\operatorname* { m a x } } _ { \\boldsymbol { q } } \\bar { \\mathcal { T } } _ { s } ( \\boldsymbol { q } , \\theta _ { i } ) = \\mathop { \\operatorname* { m a x } } _ { \\boldsymbol { q } } T ^ { \\pi , { q } } Q _ { \\theta _ { i } } ( s , \\boldsymbol { a } ) } \\\\ { \\displaystyle \\mathop { \\quad = } \\mathop { \\operatorname* { m a x } } _ { \\boldsymbol { q } } \\mathbb { E } _ { \\boldsymbol { \\mu } ( s ) } \\Big [ \\mathbb { E } _ { \\boldsymbol { q } ( \\cdot \\vert s ) } [ Q _ { \\theta _ { i } } ( s , \\boldsymbol { a } ) ] - \\alpha \\mathbf { K } \\mathbf { L } ( \\boldsymbol { q } \\| \\pi _ { i } ) \\Big ] , } \\end{array}", + "type": "interline_equation", + "image_path": "99844cbc259f5753c811b6ea1e6c148c0f2e81f9d3e10080bfbaebbdccf26843.jpg" + } + ] + } + ], + "index": 46, + "virtual_lines": [ + { + "bbox": [ + 177, + 691, + 435, + 706.0 + ], + "spans": [], + "index": 45 + }, + { + "bbox": [ + 177, + 706.0, + 435, + 721.0 + ], + "spans": [], + "index": 46 + }, + { + "bbox": [ + 177, + 721.0, + 435, + 736.0 + ], + "spans": [], + "index": 47 + } + ] + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "4", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 116 + ], + "lines": [], + "index": 1, + "bbox_fs": [ + 105, + 82, + 505, + 117 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 121, + 505, + 177 + ], + "lines": [ + { + "bbox": [ + 106, + 122, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 106, + 122, + 505, + 133 + ], + "score": 1.0, + "content": "These choices lead to the following desirable properties: (a) low-variance estimates of the expected", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 133, + 505, + 145 + ], + "spans": [ + { + "bbox": [ + 106, + 133, + 505, + 145 + ], + "score": 1.0, + "content": "return via function approximation; (b) low-sample complexity of value function estimate via robust", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 144, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 505, + 156 + ], + "score": 1.0, + "content": "off-policy learning; (c) minimal parametric assumption about the form of the trajectory distribution", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 506, + 167 + ], + "score": 1.0, + "content": "in the E-step; (d) policy updates via supervised learning in the M step; (e) robust updates via hard", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 318, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 318, + 179 + ], + "score": 1.0, + "content": "trust-region constraints in both the E and the M step.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 122, + 506, + 179 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 190, + 231, + 201 + ], + "lines": [ + { + "bbox": [ + 106, + 189, + 232, + 202 + ], + "spans": [ + { + "bbox": [ + 106, + 189, + 232, + 202 + ], + "score": 1.0, + "content": "3.1 POLICY IMPROVEMENT", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 210, + 505, + 245 + ], + "lines": [ + { + "bbox": [ + 105, + 210, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 506, + 223 + ], + "score": 1.0, + "content": "The derivation of our algorithm then starts from the infinite-horizon analogue of the KL-regularized", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 221, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 505, + 234 + ], + "score": 1.0, + "content": "expected reward objective from Equation (2). In particular, we consider variational distributions", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 231, + 503, + 246 + ], + "spans": [ + { + "bbox": [ + 107, + 232, + 126, + 244 + ], + "score": 0.92, + "content": "q ( \\tau )", + "type": "inline_equation" + }, + { + "bbox": [ + 126, + 231, + 246, + 246 + ], + "score": 1.0, + "content": "that factor in the same way as", + "type": "text" + }, + { + "bbox": [ + 247, + 234, + 258, + 244 + ], + "score": 0.85, + "content": "p _ { \\pi }", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 231, + 277, + 246 + ], + "score": 1.0, + "content": ", i.e.", + "type": "text" + }, + { + "bbox": [ + 277, + 232, + 445, + 245 + ], + "score": 0.91, + "content": "\\begin{array} { r } { q ( \\tau ) = \\bar { p } ( s _ { 0 } ) \\prod _ { t > 0 } p ( s _ { t + 1 } | s _ { t } , a _ { t } ) q ( a _ { t } | s _ { t } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 231, + 503, + 246 + ], + "score": 1.0, + "content": "which yields:", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 210, + 506, + 246 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 169, + 248, + 443, + 280 + ], + "lines": [ + { + "bbox": [ + 169, + 248, + 443, + 280 + ], + "spans": [ + { + "bbox": [ + 169, + 248, + 443, + 280 + ], + "score": 0.92, + "content": "\\mathcal { I } ( \\boldsymbol { q } , \\theta ) = \\mathbb { E } _ { \\boldsymbol { q } } \\Big [ \\sum _ { t = 0 } ^ { \\infty } \\gamma ^ { t } \\big [ r _ { t } - \\alpha \\mathbf { K L } \\big ( \\boldsymbol { q } ( \\boldsymbol { a } | s _ { t } ) \\| \\pi ( \\boldsymbol { a } | s _ { t } , \\theta ) \\big ) \\big ] \\Big ] + \\log p ( \\theta ) .", + "type": "interline_equation", + "image_path": "c47386aa60fd8ec474158aad73358c473d096deaaf823906ff6f90a6b43d5fd9.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 169, + 248, + 443, + 258.6666666666667 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 169, + 258.6666666666667, + 443, + 269.33333333333337 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 169, + 269.33333333333337, + 443, + 280.00000000000006 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 282, + 505, + 338 + ], + "lines": [ + { + "bbox": [ + 106, + 282, + 505, + 295 + ], + "spans": [ + { + "bbox": [ + 106, + 283, + 331, + 295 + ], + "score": 1.0, + "content": "Note that due to the assumption about the structure of", + "type": "text" + }, + { + "bbox": [ + 332, + 282, + 351, + 295 + ], + "score": 0.92, + "content": "q ( \\tau )", + "type": "inline_equation" + }, + { + "bbox": [ + 351, + 283, + 368, + 295 + ], + "score": 1.0, + "content": "the", + "type": "text" + }, + { + "bbox": [ + 369, + 283, + 384, + 293 + ], + "score": 0.27, + "content": "\\mathrm { K L }", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 283, + 505, + 295 + ], + "score": 1.0, + "content": "over trajectories decomposes", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 294, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 505, + 306 + ], + "score": 1.0, + "content": "into a KL over the individual state-conditional action distributions. This objective has also been", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 303, + 506, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 438, + 318 + ], + "score": 1.0, + "content": "considered e.g. by Haarnoja et al. (2017); Schulman et al. (2017a). The additional", + "type": "text" + }, + { + "bbox": [ + 439, + 305, + 473, + 317 + ], + "score": 0.92, + "content": "\\log p ( \\pmb \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 303, + 506, + 318 + ], + "score": 1.0, + "content": "term is", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 315, + 505, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 505, + 329 + ], + "score": 1.0, + "content": "a prior over policy parameters and can be motivated by a maximum a-posteriori estimation problem", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 327, + 235, + 339 + ], + "spans": [ + { + "bbox": [ + 106, + 327, + 235, + 339 + ], + "score": 1.0, + "content": "(see appendix for more details).", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 282, + 506, + 339 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 343, + 387, + 355 + ], + "lines": [ + { + "bbox": [ + 106, + 342, + 388, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 342, + 388, + 357 + ], + "score": 1.0, + "content": "We also define the regularized Q-value function associated with (3) as", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 106, + 342, + 388, + 357 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 176, + 357, + 433, + 397 + ], + "lines": [ + { + "bbox": [ + 176, + 357, + 433, + 397 + ], + "spans": [ + { + "bbox": [ + 176, + 357, + 433, + 397 + ], + "score": 0.94, + "content": "Q _ { \\theta } ^ { q } ( s , a ) = r _ { 0 } + \\mathbb { E } _ { q ( \\tau ) , s _ { 0 } = s , a _ { 0 } = a } \\left[ \\sum _ { t \\geq 1 } ^ { \\infty } \\gamma ^ { t } \\big [ r _ { t } - \\alpha \\mathrm { K L } ( q _ { t } \\| \\pi _ { t } ) \\big ] \\right] ,", + "type": "interline_equation", + "image_path": "94b398d8581f4b49760d89cd721f5bc7a45444c60483374fc1cfd24d10e845ba.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 176, + 357, + 433, + 370.3333333333333 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 176, + 370.3333333333333, + 433, + 383.66666666666663 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 176, + 383.66666666666663, + 433, + 396.99999999999994 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 399, + 504, + 423 + ], + "lines": [ + { + "bbox": [ + 105, + 398, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 127, + 414 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 128, + 399, + 291, + 414 + ], + "score": 0.93, + "content": "\\mathrm { K L } \\big ( q _ { t } | | \\pi _ { t } \\big ) = \\mathrm { K L } \\big ( q ( a | s _ { t } ) \\big ) \\| \\pi ( a | s _ { t } , \\pmb { \\theta } ) \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 398, + 339, + 414 + ], + "score": 1.0, + "content": ". Note that", + "type": "text" + }, + { + "bbox": [ + 340, + 399, + 387, + 414 + ], + "score": 0.92, + "content": "\\mathrm { K L } \\big ( q _ { 0 } | | \\pi _ { 0 } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 398, + 407, + 414 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 407, + 400, + 426, + 413 + ], + "score": 0.92, + "content": "p ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 398, + 506, + 414 + ], + "score": 1.0, + "content": "are not part of the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 411, + 310, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 310, + 424 + ], + "score": 1.0, + "content": "Q-function as they are not a function of the action.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 398, + 506, + 424 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 428, + 505, + 532 + ], + "lines": [ + { + "bbox": [ + 105, + 428, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 223, + 443 + ], + "score": 1.0, + "content": "We observe that optimizing", + "type": "text" + }, + { + "bbox": [ + 223, + 429, + 233, + 439 + ], + "score": 0.81, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 428, + 299, + 443 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 300, + 431, + 306, + 440 + ], + "score": 0.77, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 428, + 506, + 443 + ], + "score": 1.0, + "content": "is equivalent to solving an expected reward RL", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 102, + 438, + 508, + 461 + ], + "spans": [ + { + "bbox": [ + 102, + 438, + 237, + 461 + ], + "score": 1.0, + "content": "problem with augmented reward", + "type": "text" + }, + { + "bbox": [ + 237, + 440, + 338, + 456 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\tilde { r } _ { t } = r _ { t } - \\alpha \\log \\frac { q ( a _ { t } | s _ { t } ) } { \\pi ( a _ { t } | s _ { t } , \\pmb { \\theta } ) } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 438, + 390, + 461 + ], + "score": 1.0, + "content": ". In this view", + "type": "text" + }, + { + "bbox": [ + 391, + 444, + 398, + 452 + ], + "score": 0.73, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 438, + 508, + 461 + ], + "score": 1.0, + "content": "represents a default policy", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 455, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 168, + 467 + ], + "score": 1.0, + "content": "towards which", + "type": "text" + }, + { + "bbox": [ + 168, + 457, + 175, + 466 + ], + "score": 0.77, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 455, + 469, + 467 + ], + "score": 1.0, + "content": "is regularized – i.e. the current best policy. The MPO algorithm treats", + "type": "text" + }, + { + "bbox": [ + 469, + 457, + 477, + 465 + ], + "score": 0.74, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 455, + 505, + 467 + ], + "score": 1.0, + "content": "as the", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 466, + 504, + 478 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 259, + 478 + ], + "score": 1.0, + "content": "primary object of interest. In this case", + "type": "text" + }, + { + "bbox": [ + 260, + 468, + 266, + 477 + ], + "score": 0.8, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 466, + 494, + 478 + ], + "score": 1.0, + "content": "serves as an auxiliary distribution that allows optimizing", + "type": "text" + }, + { + "bbox": [ + 494, + 466, + 504, + 477 + ], + "score": 0.8, + "content": "\\mathcal { I }", + "type": "inline_equation" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 477, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 240, + 489 + ], + "score": 1.0, + "content": "via alternate coordinate ascent in", + "type": "text" + }, + { + "bbox": [ + 240, + 479, + 246, + 488 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 477, + 264, + 489 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 264, + 478, + 276, + 488 + ], + "score": 0.83, + "content": "\\pi _ { \\pmb { \\theta } }", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 477, + 505, + 489 + ], + "score": 1.0, + "content": ", analogous to the expectation-maximization algorithm in", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 488, + 505, + 499 + ], + "spans": [ + { + "bbox": [ + 106, + 488, + 398, + 499 + ], + "score": 1.0, + "content": "the probabilistic modelling literature. In our case, the E-step optimizes", + "type": "text" + }, + { + "bbox": [ + 398, + 488, + 408, + 498 + ], + "score": 0.83, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 488, + 472, + 499 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 472, + 489, + 479, + 499 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 488, + 505, + 499 + ], + "score": 1.0, + "content": "while", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 497, + 506, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 193, + 512 + ], + "score": 1.0, + "content": "the M-step optimizes", + "type": "text" + }, + { + "bbox": [ + 194, + 499, + 204, + 509 + ], + "score": 0.84, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 497, + 266, + 512 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 267, + 500, + 273, + 508 + ], + "score": 0.71, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 274, + 497, + 399, + 512 + ], + "score": 1.0, + "content": ". Different optimizations in the", + "type": "text" + }, + { + "bbox": [ + 399, + 499, + 407, + 508 + ], + "score": 0.25, + "content": "\\mathrm { E }", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 497, + 506, + 512 + ], + "score": 1.0, + "content": "-step and M-step lead to", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 509, + 506, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 374, + 522 + ], + "score": 1.0, + "content": "different algorithms. In particular, we note that for the case where", + "type": "text" + }, + { + "bbox": [ + 374, + 510, + 394, + 522 + ], + "score": 0.91, + "content": "p ( \\pmb \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 509, + 506, + 522 + ], + "score": 1.0, + "content": "is an uninformative prior a", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 520, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 520, + 481, + 533 + ], + "score": 1.0, + "content": "variant of our algorithm has a monotonic improvement guarantee as show in the Appendix A.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 30, + "bbox_fs": [ + 102, + 428, + 508, + 533 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 544, + 164, + 556 + ], + "lines": [ + { + "bbox": [ + 106, + 543, + 165, + 557 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 165, + 557 + ], + "score": 1.0, + "content": "3.2 E-STEP", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 107, + 564, + 505, + 588 + ], + "lines": [ + { + "bbox": [ + 105, + 563, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 210, + 579 + ], + "score": 1.0, + "content": "In the E-step of iteration", + "type": "text" + }, + { + "bbox": [ + 210, + 566, + 216, + 575 + ], + "score": 0.71, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 563, + 374, + 579 + ], + "score": 1.0, + "content": "we perform a partial maximization of", + "type": "text" + }, + { + "bbox": [ + 374, + 565, + 407, + 577 + ], + "score": 0.93, + "content": "\\mathcal { I } ( \\boldsymbol { q } , \\boldsymbol { \\theta } )", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 563, + 472, + 579 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 473, + 568, + 479, + 577 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 563, + 505, + 579 + ], + "score": 1.0, + "content": "given", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 576, + 464, + 589 + ], + "spans": [ + { + "bbox": [ + 107, + 577, + 134, + 587 + ], + "score": 0.9, + "content": "\\theta = \\theta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 576, + 215, + 589 + ], + "score": 1.0, + "content": ". We start by setting", + "type": "text" + }, + { + "bbox": [ + 215, + 578, + 248, + 588 + ], + "score": 0.9, + "content": "q = \\pi _ { \\pmb { \\theta } _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 576, + 464, + 589 + ], + "score": 1.0, + "content": "and estimate the unregularized action-value function:", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 563, + 505, + 589 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 197, + 590, + 413, + 624 + ], + "lines": [ + { + "bbox": [ + 197, + 590, + 413, + 624 + ], + "spans": [ + { + "bbox": [ + 197, + 590, + 413, + 624 + ], + "score": 0.93, + "content": "Q _ { \\theta _ { i } } ^ { q } ( s , a ) = Q _ { \\theta _ { i } } ( s , a ) = \\mathbb { E } _ { \\tau _ { \\pi _ { i } } , s _ { 0 } = s , a _ { 0 } = a } \\left[ \\sum _ { t } ^ { \\infty } \\gamma ^ { t } r _ { t } \\right] ,", + "type": "interline_equation", + "image_path": "d9f00c5111450b96b213f94b248479dff577bc7b9241eb53ba84cc72b59a9377.jpg" + } + ] + } + ], + "index": 38.5, + "virtual_lines": [ + { + "bbox": [ + 197, + 590, + 413, + 607.0 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 197, + 607.0, + 413, + 624.0 + ], + "spans": [], + "index": 39 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 626, + 506, + 689 + ], + "lines": [ + { + "bbox": [ + 106, + 626, + 506, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 626, + 130, + 640 + ], + "score": 1.0, + "content": "since", + "type": "text" + }, + { + "bbox": [ + 131, + 627, + 192, + 639 + ], + "score": 0.92, + "content": "\\mathrm { K L } ( q | | \\pi _ { i } ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 626, + 295, + 640 + ], + "score": 1.0, + "content": ". In practice we estimate", + "type": "text" + }, + { + "bbox": [ + 296, + 627, + 312, + 639 + ], + "score": 0.91, + "content": "Q _ { \\pmb { \\theta } _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 626, + 506, + 640 + ], + "score": 1.0, + "content": "from off-policy data (we refer to Section 4 for", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 637, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 505, + 651 + ], + "score": 1.0, + "content": "details about the policy evaluation step). This greatly increases the data efficiency of our algorithm.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 648, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 133, + 662 + ], + "score": 1.0, + "content": "Given", + "type": "text" + }, + { + "bbox": [ + 133, + 649, + 150, + 661 + ], + "score": 0.91, + "content": "Q _ { \\pmb { \\theta } _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 648, + 270, + 662 + ], + "score": 1.0, + "content": "we improve the lower bound", + "type": "text" + }, + { + "bbox": [ + 270, + 649, + 279, + 659 + ], + "score": 0.82, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 648, + 304, + 662 + ], + "score": 1.0, + "content": "w.r.t.", + "type": "text" + }, + { + "bbox": [ + 304, + 650, + 311, + 660 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 648, + 387, + 662 + ], + "score": 1.0, + "content": "by first expanding", + "type": "text" + }, + { + "bbox": [ + 387, + 649, + 426, + 661 + ], + "score": 0.93, + "content": "Q _ { \\theta _ { i } } ( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 648, + 505, + 662 + ], + "score": 1.0, + "content": "via the regularized", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 104, + 660, + 506, + 680 + ], + "spans": [ + { + "bbox": [ + 104, + 661, + 180, + 678 + ], + "score": 1.0, + "content": "Bellman operator", + "type": "text" + }, + { + "bbox": [ + 180, + 660, + 430, + 680 + ], + "score": 0.87, + "content": "\\begin{array} { r } { T ^ { \\pi , q } = \\mathbb { E } _ { q ( a \\mid s ) } \\Big [ r ( s , a ) - \\alpha \\mathbf { K L } ( q \\| \\pi _ { i } ) + \\gamma \\mathbb { E } _ { p ( s ^ { \\prime } \\mid s , a ) } [ V _ { \\pmb { \\theta } _ { i } } ( s ^ { \\prime } ) ] \\Big ] . } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 661, + 506, + 678 + ], + "score": 1.0, + "content": ", and optimize the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 676, + 253, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 253, + 691 + ], + "score": 1.0, + "content": "“one-step” KL regularised objective", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42, + "bbox_fs": [ + 104, + 626, + 506, + 691 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 691, + 435, + 736 + ], + "lines": [ + { + "bbox": [ + 177, + 691, + 435, + 736 + ], + "spans": [ + { + "bbox": [ + 177, + 691, + 435, + 736 + ], + "score": 0.9, + "content": "\\begin{array} { l } { \\displaystyle \\mathop { \\operatorname* { m a x } } _ { \\boldsymbol { q } } \\bar { \\mathcal { T } } _ { s } ( \\boldsymbol { q } , \\theta _ { i } ) = \\mathop { \\operatorname* { m a x } } _ { \\boldsymbol { q } } T ^ { \\pi , { q } } Q _ { \\theta _ { i } } ( s , \\boldsymbol { a } ) } \\\\ { \\displaystyle \\mathop { \\quad = } \\mathop { \\operatorname* { m a x } } _ { \\boldsymbol { q } } \\mathbb { E } _ { \\boldsymbol { \\mu } ( s ) } \\Big [ \\mathbb { E } _ { \\boldsymbol { q } ( \\cdot \\vert s ) } [ Q _ { \\theta _ { i } } ( s , \\boldsymbol { a } ) ] - \\alpha \\mathbf { K } \\mathbf { L } ( \\boldsymbol { q } \\| \\pi _ { i } ) \\Big ] , } \\end{array}", + "type": "interline_equation", + "image_path": "99844cbc259f5753c811b6ea1e6c148c0f2e81f9d3e10080bfbaebbdccf26843.jpg" + } + ] + } + ], + "index": 46, + "virtual_lines": [ + { + "bbox": [ + 177, + 691, + 435, + 706.0 + ], + "spans": [], + "index": 45 + }, + { + "bbox": [ + 177, + 706.0, + 435, + 721.0 + ], + "spans": [], + "index": 46 + }, + { + "bbox": [ + 177, + 721.0, + 435, + 736.0 + ], + "spans": [], + "index": 47 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 81, + 403, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 80, + 404, + 97 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 129, + 97 + ], + "score": 1.0, + "content": "since", + "type": "text" + }, + { + "bbox": [ + 129, + 82, + 239, + 96 + ], + "score": 0.93, + "content": "V _ { \\pmb { \\theta } _ { i } } ( s ) = \\mathbb { E } _ { q ( a | s } [ Q _ { \\pmb { \\theta } _ { i } } ( s , a ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 80, + 276, + 97 + ], + "score": 1.0, + "content": "and thus", + "type": "text" + }, + { + "bbox": [ + 276, + 82, + 401, + 95 + ], + "score": 0.9, + "content": "Q _ { \\pmb { \\theta } _ { i } } ( s , a ) = r ( s , a ) + \\gamma V _ { \\pmb { \\theta } _ { i } } ( s ) .", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 80, + 404, + 97 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 100, + 505, + 157 + ], + "lines": [ + { + "bbox": [ + 106, + 100, + 506, + 114 + ], + "spans": [ + { + "bbox": [ + 106, + 101, + 275, + 114 + ], + "score": 1.0, + "content": "Maximizing Equation (6), thus obtaining", + "type": "text" + }, + { + "bbox": [ + 275, + 100, + 369, + 113 + ], + "score": 0.85, + "content": "q _ { i } = \\arg \\operatorname* { m a x } \\bar { \\mathcal { I } } ( q , \\theta _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 101, + 470, + 114 + ], + "score": 1.0, + "content": ", does not fully optimize", + "type": "text" + }, + { + "bbox": [ + 470, + 102, + 480, + 112 + ], + "score": 0.84, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 101, + 506, + 114 + ], + "score": 1.0, + "content": "since", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 111, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 111, + 141, + 125 + ], + "score": 1.0, + "content": "we treat", + "type": "text" + }, + { + "bbox": [ + 142, + 113, + 158, + 124 + ], + "score": 0.9, + "content": "Q _ { \\theta _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 111, + 269, + 125 + ], + "score": 1.0, + "content": "as constant with respect to", + "type": "text" + }, + { + "bbox": [ + 270, + 114, + 275, + 124 + ], + "score": 0.71, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 111, + 388, + 125 + ], + "score": 1.0, + "content": ". An intuitive interpretation", + "type": "text" + }, + { + "bbox": [ + 388, + 114, + 397, + 123 + ], + "score": 0.85, + "content": "q _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 111, + 505, + 125 + ], + "score": 1.0, + "content": "is that it chooses the soft-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 375, + 136 + ], + "score": 1.0, + "content": "optimal action for one step and then resorts to executing policy", + "type": "text" + }, + { + "bbox": [ + 375, + 125, + 383, + 133 + ], + "score": 0.75, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 123, + 505, + 136 + ], + "score": 1.0, + "content": ". In the language of the EM", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 134, + 505, + 147 + ], + "spans": [ + { + "bbox": [ + 106, + 134, + 452, + 147 + ], + "score": 1.0, + "content": "algorithm this optimization implements a partial E-step. In practice we also choose", + "type": "text" + }, + { + "bbox": [ + 452, + 136, + 464, + 146 + ], + "score": 0.86, + "content": "\\mu _ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 134, + 505, + 147 + ], + "score": 1.0, + "content": "to be the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 145, + 392, + 158 + ], + "spans": [ + { + "bbox": [ + 106, + 145, + 392, + 158 + ], + "score": 1.0, + "content": "stationary distribution as given through samples from the replay buffer.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3 + }, + { + "type": "title", + "bbox": [ + 107, + 170, + 205, + 181 + ], + "lines": [ + { + "bbox": [ + 106, + 170, + 205, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 170, + 205, + 183 + ], + "score": 1.0, + "content": "CONSTRAINED E-STEP", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 190, + 505, + 213 + ], + "lines": [ + { + "bbox": [ + 106, + 190, + 505, + 203 + ], + "spans": [ + { + "bbox": [ + 106, + 190, + 505, + 203 + ], + "score": 1.0, + "content": "The reward and the KL terms are on an arbitray relative scale. This can make it difficult to choose", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 200, + 484, + 214 + ], + "spans": [ + { + "bbox": [ + 107, + 203, + 114, + 211 + ], + "score": 0.71, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 200, + 461, + 214 + ], + "score": 1.0, + "content": ". We therefore replace the soft KL regularization with a hard constraint with parameter", + "type": "text" + }, + { + "bbox": [ + 461, + 204, + 466, + 211 + ], + "score": 0.52, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 200, + 484, + 214 + ], + "score": 1.0, + "content": ", i.e,", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "interline_equation", + "bbox": [ + 227, + 218, + 386, + 265 + ], + "lines": [ + { + "bbox": [ + 227, + 218, + 386, + 265 + ], + "spans": [ + { + "bbox": [ + 227, + 218, + 386, + 265 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\underset { q } { \\operatorname* { m a x } } \\mathbb { E } _ { \\boldsymbol { \\mu } ( s ) } \\left[ \\mathbb { E } _ { q ( a \\mid s ) } \\left[ Q _ { \\boldsymbol { \\theta } _ { i } } ( s , a ) \\right] \\right] } \\\\ & { s . t . \\mathbb { E } _ { \\boldsymbol { \\mu } ( s ) } \\left[ { \\mathbf { K L } } ( q ( a \\mid s ) , \\pi ( a \\mid s , \\boldsymbol { \\theta } _ { i } ) ) \\right] < \\epsilon . } \\end{array}", + "type": "interline_equation", + "image_path": "6c4651b8478ef40a04cd7ecff2dad54f6c17dfa11f57bc574e45c7a73a9649b4.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 227, + 218, + 386, + 233.66666666666666 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 227, + 233.66666666666666, + 386, + 249.33333333333331 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 227, + 249.33333333333331, + 386, + 265.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 276, + 505, + 332 + ], + "lines": [ + { + "bbox": [ + 105, + 276, + 506, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 261, + 291 + ], + "score": 1.0, + "content": "If we choose to explicitly parameterize", + "type": "text" + }, + { + "bbox": [ + 262, + 277, + 295, + 289 + ], + "score": 0.84, + "content": "q ( a | s ) -", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 276, + 506, + 291 + ], + "score": 1.0, + "content": "option 1 below – the resulting optimisation is similar", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 288, + 504, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 288, + 504, + 300 + ], + "score": 1.0, + "content": "to that performed by the recent TRPO algorithm for continuous control (Schulman et al., 2015); only", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 299, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 505, + 311 + ], + "score": 1.0, + "content": "in an off-policy setting. Analogously, the unconstrained objective (6) is similar to the objective used", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 309, + 505, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 505, + 323 + ], + "score": 1.0, + "content": "by PPO (Schulman et al., 2017b). We note, however, that the KL is reversed when compared to the", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 320, + 223, + 334 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 223, + 334 + ], + "score": 1.0, + "content": "KL used by TRPO and PPO.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 106, + 337, + 489, + 350 + ], + "lines": [ + { + "bbox": [ + 105, + 336, + 491, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 384, + 351 + ], + "score": 1.0, + "content": "To implement (7) we need to choose a form for the variational policy", + "type": "text" + }, + { + "bbox": [ + 384, + 338, + 410, + 350 + ], + "score": 0.92, + "content": "q ( a | s )", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 336, + 491, + 351 + ], + "score": 1.0, + "content": ". Two options arise:", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 128, + 358, + 505, + 431 + ], + "lines": [ + { + "bbox": [ + 129, + 357, + 505, + 373 + ], + "spans": [ + { + "bbox": [ + 129, + 357, + 341, + 373 + ], + "score": 1.0, + "content": "1. We can use a parametric variational distribution", + "type": "text" + }, + { + "bbox": [ + 341, + 359, + 382, + 371 + ], + "score": 0.93, + "content": "q ( a | s , \\pmb \\theta ^ { q } )", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 357, + 455, + 373 + ], + "score": 1.0, + "content": ", with parameters", + "type": "text" + }, + { + "bbox": [ + 455, + 359, + 466, + 369 + ], + "score": 0.86, + "content": "\\pmb { \\theta } ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 467, + 357, + 505, + 373 + ], + "score": 1.0, + "content": ", and op-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 370, + 505, + 382 + ], + "spans": [ + { + "bbox": [ + 141, + 370, + 505, + 382 + ], + "score": 1.0, + "content": "timise Equation (7) via the likelihood ratio or action-value gradients. This leads to an", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 381, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 141, + 381, + 505, + 394 + ], + "score": 1.0, + "content": "algorithm similar to TRPO/PPO and an explicit M-step becomes unnecessary (see. Alg. 3).", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 128, + 396, + 506, + 411 + ], + "spans": [ + { + "bbox": [ + 128, + 396, + 348, + 411 + ], + "score": 1.0, + "content": "2. We can choose a non-parametric representation of", + "type": "text" + }, + { + "bbox": [ + 349, + 397, + 375, + 410 + ], + "score": 0.93, + "content": "q ( a | s )", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 396, + 506, + 411 + ], + "score": 1.0, + "content": "given by one probability factor", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 141, + 408, + 506, + 421 + ], + "spans": [ + { + "bbox": [ + 141, + 408, + 506, + 421 + ], + "score": 1.0, + "content": "per sample. To achieve generalization in state space we then fit a parametric policy in the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 418, + 177, + 434 + ], + "spans": [ + { + "bbox": [ + 141, + 418, + 177, + 434 + ], + "score": 1.0, + "content": "M-step.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 107, + 441, + 505, + 474 + ], + "lines": [ + { + "bbox": [ + 105, + 440, + 505, + 454 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 505, + 454 + ], + "score": 1.0, + "content": "Fitting a parametric policy in the M-step is a supervised learning problem, allowing us to employ", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 452, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 505, + 464 + ], + "score": 1.0, + "content": "various regularization techniques at that point. It also makes it easier to enforce the hard KL con-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 463, + 137, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 463, + 137, + 475 + ], + "score": 1.0, + "content": "straint.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "title", + "bbox": [ + 108, + 488, + 311, + 499 + ], + "lines": [ + { + "bbox": [ + 106, + 489, + 311, + 500 + ], + "spans": [ + { + "bbox": [ + 106, + 489, + 311, + 500 + ], + "score": 1.0, + "content": "NON PARAMETRIC VARIATIONAL DISTRIBUTION", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 507, + 504, + 531 + ], + "lines": [ + { + "bbox": [ + 105, + 507, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 380, + 520 + ], + "score": 1.0, + "content": "In the non-parametric case we can obtain the optimal sample based", + "type": "text" + }, + { + "bbox": [ + 380, + 510, + 387, + 520 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 507, + 506, + 520 + ], + "score": 1.0, + "content": "distribution – the solution to", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 519, + 398, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 398, + 532 + ], + "score": 1.0, + "content": "Equation (7) – in closed form (see the appendix for a full derivation), as,", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "interline_equation", + "bbox": [ + 227, + 545, + 384, + 572 + ], + "lines": [ + { + "bbox": [ + 227, + 545, + 384, + 572 + ], + "spans": [ + { + "bbox": [ + 227, + 545, + 384, + 572 + ], + "score": 0.94, + "content": "q _ { i } ( a | s ) \\propto \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp \\Big ( \\frac { Q _ { \\theta _ { i } } ( s , a ) } { \\eta ^ { * } } \\Big ) ,", + "type": "interline_equation", + "image_path": "e2cc243c4fce56c4fd8e0417866e6c3dfe80f34b88867a5673bc94a2ae845caa.jpg" + } + ] + } + ], + "index": 30.5, + "virtual_lines": [ + { + "bbox": [ + 227, + 545, + 384, + 558.5 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 227, + 558.5, + 384, + 572.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 575, + 407, + 588 + ], + "lines": [ + { + "bbox": [ + 105, + 574, + 408, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 574, + 191, + 589 + ], + "score": 1.0, + "content": "where we can obtain", + "type": "text" + }, + { + "bbox": [ + 191, + 577, + 202, + 587 + ], + "score": 0.88, + "content": "\\eta ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 574, + 408, + 589 + ], + "score": 1.0, + "content": "by minimising the following convex dual function,", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "interline_equation", + "bbox": [ + 178, + 594, + 432, + 620 + ], + "lines": [ + { + "bbox": [ + 178, + 594, + 432, + 620 + ], + "spans": [ + { + "bbox": [ + 178, + 594, + 432, + 620 + ], + "score": 0.93, + "content": "g ( \\eta ) = \\eta \\epsilon + \\eta \\int \\mu ( s ) \\log \\int \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp \\Big ( \\frac { Q _ { \\theta _ { i } } ( s , a ) } { \\eta } \\Big ) d a d s ,", + "type": "interline_equation", + "image_path": "c92f4e82fd7f9b818244b56be050da21e0f55ba3880b30c6c94bfd61a49caf39.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 178, + 594, + 432, + 620 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 626, + 401, + 639 + ], + "lines": [ + { + "bbox": [ + 105, + 624, + 402, + 641 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 297, + 641 + ], + "score": 1.0, + "content": "after the optimisation of which we can evaluate", + "type": "text" + }, + { + "bbox": [ + 298, + 627, + 327, + 639 + ], + "score": 0.93, + "content": "q _ { i } ( a | s )", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 624, + 402, + 641 + ], + "score": 1.0, + "content": "on given samples.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 643, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 643, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 505, + 656 + ], + "score": 1.0, + "content": "This optimization problem is similar to the one solved by relative entropy policy search (REPS)", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "(Peters et al., 2010a) with the difference that we optimise only for the conditional variational dis-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 665, + 505, + 679 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 144, + 679 + ], + "score": 1.0, + "content": "tribution", + "type": "text" + }, + { + "bbox": [ + 145, + 667, + 171, + 678 + ], + "score": 0.92, + "content": "q ( a | s )", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 665, + 297, + 679 + ], + "score": 1.0, + "content": "instead of a joint distribution", + "type": "text" + }, + { + "bbox": [ + 297, + 666, + 325, + 678 + ], + "score": 0.92, + "content": "\\scriptstyle q ( a , s )", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 665, + 409, + 679 + ], + "score": 1.0, + "content": "– effectively fixing", + "type": "text" + }, + { + "bbox": [ + 409, + 666, + 433, + 678 + ], + "score": 0.92, + "content": "\\mu _ { q } ( s )", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 665, + 505, + 679 + ], + "score": 1.0, + "content": "to the stationary", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 390, + 690 + ], + "score": 1.0, + "content": "distribution given by previously collected experience – and we use the", + "type": "text" + }, + { + "bbox": [ + 390, + 677, + 400, + 688 + ], + "score": 0.34, + "content": "\\mathrm { Q }", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 676, + 505, + 690 + ], + "score": 1.0, + "content": "function of the old policy", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 688, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 223, + 699 + ], + "score": 1.0, + "content": "to evaluate the integral over", + "type": "text" + }, + { + "bbox": [ + 223, + 692, + 229, + 698 + ], + "score": 0.7, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 688, + 505, + 699 + ], + "score": 1.0, + "content": ". While this might seem unimportant it is crucial as it allows us to", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "estimate the integral over actions with multiple samples without additional environment interaction.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "score": 1.0, + "content": "This greatly reduces the variance of the estimate and allows for fully off-policy learning at the cost", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 721, + 375, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 284, + 733 + ], + "score": 1.0, + "content": "of performing only a partial optimization of", + "type": "text" + }, + { + "bbox": [ + 284, + 722, + 293, + 731 + ], + "score": 0.84, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 721, + 375, + 733 + ], + "score": 1.0, + "content": "as described above.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 38.5 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 81, + 403, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 80, + 404, + 97 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 129, + 97 + ], + "score": 1.0, + "content": "since", + "type": "text" + }, + { + "bbox": [ + 129, + 82, + 239, + 96 + ], + "score": 0.93, + "content": "V _ { \\pmb { \\theta } _ { i } } ( s ) = \\mathbb { E } _ { q ( a | s } [ Q _ { \\pmb { \\theta } _ { i } } ( s , a ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 80, + 276, + 97 + ], + "score": 1.0, + "content": "and thus", + "type": "text" + }, + { + "bbox": [ + 276, + 82, + 401, + 95 + ], + "score": 0.9, + "content": "Q _ { \\pmb { \\theta } _ { i } } ( s , a ) = r ( s , a ) + \\gamma V _ { \\pmb { \\theta } _ { i } } ( s ) .", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 80, + 404, + 97 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 80, + 404, + 97 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 100, + 505, + 157 + ], + "lines": [ + { + "bbox": [ + 106, + 100, + 506, + 114 + ], + "spans": [ + { + "bbox": [ + 106, + 101, + 275, + 114 + ], + "score": 1.0, + "content": "Maximizing Equation (6), thus obtaining", + "type": "text" + }, + { + "bbox": [ + 275, + 100, + 369, + 113 + ], + "score": 0.85, + "content": "q _ { i } = \\arg \\operatorname* { m a x } \\bar { \\mathcal { I } } ( q , \\theta _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 101, + 470, + 114 + ], + "score": 1.0, + "content": ", does not fully optimize", + "type": "text" + }, + { + "bbox": [ + 470, + 102, + 480, + 112 + ], + "score": 0.84, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 101, + 506, + 114 + ], + "score": 1.0, + "content": "since", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 111, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 111, + 141, + 125 + ], + "score": 1.0, + "content": "we treat", + "type": "text" + }, + { + "bbox": [ + 142, + 113, + 158, + 124 + ], + "score": 0.9, + "content": "Q _ { \\theta _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 111, + 269, + 125 + ], + "score": 1.0, + "content": "as constant with respect to", + "type": "text" + }, + { + "bbox": [ + 270, + 114, + 275, + 124 + ], + "score": 0.71, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 111, + 388, + 125 + ], + "score": 1.0, + "content": ". An intuitive interpretation", + "type": "text" + }, + { + "bbox": [ + 388, + 114, + 397, + 123 + ], + "score": 0.85, + "content": "q _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 111, + 505, + 125 + ], + "score": 1.0, + "content": "is that it chooses the soft-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 375, + 136 + ], + "score": 1.0, + "content": "optimal action for one step and then resorts to executing policy", + "type": "text" + }, + { + "bbox": [ + 375, + 125, + 383, + 133 + ], + "score": 0.75, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 123, + 505, + 136 + ], + "score": 1.0, + "content": ". In the language of the EM", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 134, + 505, + 147 + ], + "spans": [ + { + "bbox": [ + 106, + 134, + 452, + 147 + ], + "score": 1.0, + "content": "algorithm this optimization implements a partial E-step. In practice we also choose", + "type": "text" + }, + { + "bbox": [ + 452, + 136, + 464, + 146 + ], + "score": 0.86, + "content": "\\mu _ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 134, + 505, + 147 + ], + "score": 1.0, + "content": "to be the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 145, + 392, + 158 + ], + "spans": [ + { + "bbox": [ + 106, + 145, + 392, + 158 + ], + "score": 1.0, + "content": "stationary distribution as given through samples from the replay buffer.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 100, + 506, + 158 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 170, + 205, + 181 + ], + "lines": [ + { + "bbox": [ + 106, + 170, + 205, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 170, + 205, + 183 + ], + "score": 1.0, + "content": "CONSTRAINED E-STEP", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 190, + 505, + 213 + ], + "lines": [ + { + "bbox": [ + 106, + 190, + 505, + 203 + ], + "spans": [ + { + "bbox": [ + 106, + 190, + 505, + 203 + ], + "score": 1.0, + "content": "The reward and the KL terms are on an arbitray relative scale. This can make it difficult to choose", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 200, + 484, + 214 + ], + "spans": [ + { + "bbox": [ + 107, + 203, + 114, + 211 + ], + "score": 0.71, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 200, + 461, + 214 + ], + "score": 1.0, + "content": ". We therefore replace the soft KL regularization with a hard constraint with parameter", + "type": "text" + }, + { + "bbox": [ + 461, + 204, + 466, + 211 + ], + "score": 0.52, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 200, + 484, + 214 + ], + "score": 1.0, + "content": ", i.e,", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 106, + 190, + 505, + 214 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 227, + 218, + 386, + 265 + ], + "lines": [ + { + "bbox": [ + 227, + 218, + 386, + 265 + ], + "spans": [ + { + "bbox": [ + 227, + 218, + 386, + 265 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\underset { q } { \\operatorname* { m a x } } \\mathbb { E } _ { \\boldsymbol { \\mu } ( s ) } \\left[ \\mathbb { E } _ { q ( a \\mid s ) } \\left[ Q _ { \\boldsymbol { \\theta } _ { i } } ( s , a ) \\right] \\right] } \\\\ & { s . t . \\mathbb { E } _ { \\boldsymbol { \\mu } ( s ) } \\left[ { \\mathbf { K L } } ( q ( a \\mid s ) , \\pi ( a \\mid s , \\boldsymbol { \\theta } _ { i } ) ) \\right] < \\epsilon . } \\end{array}", + "type": "interline_equation", + "image_path": "6c4651b8478ef40a04cd7ecff2dad54f6c17dfa11f57bc574e45c7a73a9649b4.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 227, + 218, + 386, + 233.66666666666666 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 227, + 233.66666666666666, + 386, + 249.33333333333331 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 227, + 249.33333333333331, + 386, + 265.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 276, + 505, + 332 + ], + "lines": [ + { + "bbox": [ + 105, + 276, + 506, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 261, + 291 + ], + "score": 1.0, + "content": "If we choose to explicitly parameterize", + "type": "text" + }, + { + "bbox": [ + 262, + 277, + 295, + 289 + ], + "score": 0.84, + "content": "q ( a | s ) -", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 276, + 506, + 291 + ], + "score": 1.0, + "content": "option 1 below – the resulting optimisation is similar", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 288, + 504, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 288, + 504, + 300 + ], + "score": 1.0, + "content": "to that performed by the recent TRPO algorithm for continuous control (Schulman et al., 2015); only", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 299, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 505, + 311 + ], + "score": 1.0, + "content": "in an off-policy setting. Analogously, the unconstrained objective (6) is similar to the objective used", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 309, + 505, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 505, + 323 + ], + "score": 1.0, + "content": "by PPO (Schulman et al., 2017b). We note, however, that the KL is reversed when compared to the", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 320, + 223, + 334 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 223, + 334 + ], + "score": 1.0, + "content": "KL used by TRPO and PPO.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 276, + 506, + 334 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 337, + 489, + 350 + ], + "lines": [ + { + "bbox": [ + 105, + 336, + 491, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 384, + 351 + ], + "score": 1.0, + "content": "To implement (7) we need to choose a form for the variational policy", + "type": "text" + }, + { + "bbox": [ + 384, + 338, + 410, + 350 + ], + "score": 0.92, + "content": "q ( a | s )", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 336, + 491, + 351 + ], + "score": 1.0, + "content": ". Two options arise:", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 336, + 491, + 351 + ] + }, + { + "type": "text", + "bbox": [ + 128, + 358, + 505, + 431 + ], + "lines": [ + { + "bbox": [ + 129, + 357, + 505, + 373 + ], + "spans": [ + { + "bbox": [ + 129, + 357, + 341, + 373 + ], + "score": 1.0, + "content": "1. We can use a parametric variational distribution", + "type": "text" + }, + { + "bbox": [ + 341, + 359, + 382, + 371 + ], + "score": 0.93, + "content": "q ( a | s , \\pmb \\theta ^ { q } )", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 357, + 455, + 373 + ], + "score": 1.0, + "content": ", with parameters", + "type": "text" + }, + { + "bbox": [ + 455, + 359, + 466, + 369 + ], + "score": 0.86, + "content": "\\pmb { \\theta } ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 467, + 357, + 505, + 373 + ], + "score": 1.0, + "content": ", and op-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 370, + 505, + 382 + ], + "spans": [ + { + "bbox": [ + 141, + 370, + 505, + 382 + ], + "score": 1.0, + "content": "timise Equation (7) via the likelihood ratio or action-value gradients. This leads to an", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 381, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 141, + 381, + 505, + 394 + ], + "score": 1.0, + "content": "algorithm similar to TRPO/PPO and an explicit M-step becomes unnecessary (see. Alg. 3).", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 128, + 396, + 506, + 411 + ], + "spans": [ + { + "bbox": [ + 128, + 396, + 348, + 411 + ], + "score": 1.0, + "content": "2. We can choose a non-parametric representation of", + "type": "text" + }, + { + "bbox": [ + 349, + 397, + 375, + 410 + ], + "score": 0.93, + "content": "q ( a | s )", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 396, + 506, + 411 + ], + "score": 1.0, + "content": "given by one probability factor", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 141, + 408, + 506, + 421 + ], + "spans": [ + { + "bbox": [ + 141, + 408, + 506, + 421 + ], + "score": 1.0, + "content": "per sample. To achieve generalization in state space we then fit a parametric policy in the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 418, + 177, + 434 + ], + "spans": [ + { + "bbox": [ + 141, + 418, + 177, + 434 + ], + "score": 1.0, + "content": "M-step.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20.5, + "bbox_fs": [ + 128, + 357, + 506, + 434 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 441, + 505, + 474 + ], + "lines": [ + { + "bbox": [ + 105, + 440, + 505, + 454 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 505, + 454 + ], + "score": 1.0, + "content": "Fitting a parametric policy in the M-step is a supervised learning problem, allowing us to employ", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 452, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 505, + 464 + ], + "score": 1.0, + "content": "various regularization techniques at that point. It also makes it easier to enforce the hard KL con-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 463, + 137, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 463, + 137, + 475 + ], + "score": 1.0, + "content": "straint.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 440, + 505, + 475 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 488, + 311, + 499 + ], + "lines": [ + { + "bbox": [ + 106, + 489, + 311, + 500 + ], + "spans": [ + { + "bbox": [ + 106, + 489, + 311, + 500 + ], + "score": 1.0, + "content": "NON PARAMETRIC VARIATIONAL DISTRIBUTION", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 507, + 504, + 531 + ], + "lines": [ + { + "bbox": [ + 105, + 507, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 380, + 520 + ], + "score": 1.0, + "content": "In the non-parametric case we can obtain the optimal sample based", + "type": "text" + }, + { + "bbox": [ + 380, + 510, + 387, + 520 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 507, + 506, + 520 + ], + "score": 1.0, + "content": "distribution – the solution to", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 519, + 398, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 398, + 532 + ], + "score": 1.0, + "content": "Equation (7) – in closed form (see the appendix for a full derivation), as,", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 507, + 506, + 532 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 227, + 545, + 384, + 572 + ], + "lines": [ + { + "bbox": [ + 227, + 545, + 384, + 572 + ], + "spans": [ + { + "bbox": [ + 227, + 545, + 384, + 572 + ], + "score": 0.94, + "content": "q _ { i } ( a | s ) \\propto \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp \\Big ( \\frac { Q _ { \\theta _ { i } } ( s , a ) } { \\eta ^ { * } } \\Big ) ,", + "type": "interline_equation", + "image_path": "e2cc243c4fce56c4fd8e0417866e6c3dfe80f34b88867a5673bc94a2ae845caa.jpg" + } + ] + } + ], + "index": 30.5, + "virtual_lines": [ + { + "bbox": [ + 227, + 545, + 384, + 558.5 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 227, + 558.5, + 384, + 572.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 575, + 407, + 588 + ], + "lines": [ + { + "bbox": [ + 105, + 574, + 408, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 574, + 191, + 589 + ], + "score": 1.0, + "content": "where we can obtain", + "type": "text" + }, + { + "bbox": [ + 191, + 577, + 202, + 587 + ], + "score": 0.88, + "content": "\\eta ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 574, + 408, + 589 + ], + "score": 1.0, + "content": "by minimising the following convex dual function,", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 574, + 408, + 589 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 178, + 594, + 432, + 620 + ], + "lines": [ + { + "bbox": [ + 178, + 594, + 432, + 620 + ], + "spans": [ + { + "bbox": [ + 178, + 594, + 432, + 620 + ], + "score": 0.93, + "content": "g ( \\eta ) = \\eta \\epsilon + \\eta \\int \\mu ( s ) \\log \\int \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp \\Big ( \\frac { Q _ { \\theta _ { i } } ( s , a ) } { \\eta } \\Big ) d a d s ,", + "type": "interline_equation", + "image_path": "c92f4e82fd7f9b818244b56be050da21e0f55ba3880b30c6c94bfd61a49caf39.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 178, + 594, + 432, + 620 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 626, + 401, + 639 + ], + "lines": [ + { + "bbox": [ + 105, + 624, + 402, + 641 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 297, + 641 + ], + "score": 1.0, + "content": "after the optimisation of which we can evaluate", + "type": "text" + }, + { + "bbox": [ + 298, + 627, + 327, + 639 + ], + "score": 0.93, + "content": "q _ { i } ( a | s )", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 624, + 402, + 641 + ], + "score": 1.0, + "content": "on given samples.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 624, + 402, + 641 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 643, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 643, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 505, + 656 + ], + "score": 1.0, + "content": "This optimization problem is similar to the one solved by relative entropy policy search (REPS)", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "(Peters et al., 2010a) with the difference that we optimise only for the conditional variational dis-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 665, + 505, + 679 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 144, + 679 + ], + "score": 1.0, + "content": "tribution", + "type": "text" + }, + { + "bbox": [ + 145, + 667, + 171, + 678 + ], + "score": 0.92, + "content": "q ( a | s )", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 665, + 297, + 679 + ], + "score": 1.0, + "content": "instead of a joint distribution", + "type": "text" + }, + { + "bbox": [ + 297, + 666, + 325, + 678 + ], + "score": 0.92, + "content": "\\scriptstyle q ( a , s )", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 665, + 409, + 679 + ], + "score": 1.0, + "content": "– effectively fixing", + "type": "text" + }, + { + "bbox": [ + 409, + 666, + 433, + 678 + ], + "score": 0.92, + "content": "\\mu _ { q } ( s )", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 665, + 505, + 679 + ], + "score": 1.0, + "content": "to the stationary", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 390, + 690 + ], + "score": 1.0, + "content": "distribution given by previously collected experience – and we use the", + "type": "text" + }, + { + "bbox": [ + 390, + 677, + 400, + 688 + ], + "score": 0.34, + "content": "\\mathrm { Q }", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 676, + 505, + 690 + ], + "score": 1.0, + "content": "function of the old policy", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 688, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 223, + 699 + ], + "score": 1.0, + "content": "to evaluate the integral over", + "type": "text" + }, + { + "bbox": [ + 223, + 692, + 229, + 698 + ], + "score": 0.7, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 688, + 505, + 699 + ], + "score": 1.0, + "content": ". While this might seem unimportant it is crucial as it allows us to", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "estimate the integral over actions with multiple samples without additional environment interaction.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "score": 1.0, + "content": "This greatly reduces the variance of the estimate and allows for fully off-policy learning at the cost", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 721, + 375, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 284, + 733 + ], + "score": 1.0, + "content": "of performing only a partial optimization of", + "type": "text" + }, + { + "bbox": [ + 284, + 722, + 293, + 731 + ], + "score": 0.84, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 721, + 375, + 733 + ], + "score": 1.0, + "content": "as described above.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 643, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 82, + 166, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 167, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 167, + 95 + ], + "score": 1.0, + "content": "3.3 M-STEP", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 103, + 505, + 137 + ], + "lines": [ + { + "bbox": [ + 105, + 102, + 505, + 116 + ], + "spans": [ + { + "bbox": [ + 105, + 102, + 132, + 116 + ], + "score": 1.0, + "content": "Given", + "type": "text" + }, + { + "bbox": [ + 133, + 105, + 142, + 115 + ], + "score": 0.84, + "content": "q _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 102, + 341, + 116 + ], + "score": 1.0, + "content": "from the E-step we can optimize the lower bound", + "type": "text" + }, + { + "bbox": [ + 342, + 104, + 351, + 114 + ], + "score": 0.84, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 102, + 413, + 116 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 414, + 104, + 421, + 113 + ], + "score": 0.8, + "content": "\\pmb \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 102, + 505, + 116 + ], + "score": 1.0, + "content": "to obtain an updated", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 114, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 135, + 127 + ], + "score": 1.0, + "content": "policy", + "type": "text" + }, + { + "bbox": [ + 135, + 114, + 247, + 126 + ], + "score": 0.52, + "content": "\\pmb { \\theta } _ { i + 1 } = \\arg \\operatorname* { m a x } _ { \\pmb { \\theta } } \\mathcal { I } ( q _ { i } , \\pmb { \\theta } )", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 114, + 385, + 127 + ], + "score": 1.0, + "content": ". Dropping terms independent of", + "type": "text" + }, + { + "bbox": [ + 386, + 115, + 393, + 124 + ], + "score": 0.79, + "content": "\\pmb { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 114, + 505, + 127 + ], + "score": 1.0, + "content": "this entails solving for the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 125, + 153, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 125, + 153, + 136 + ], + "score": 1.0, + "content": "solution of", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "interline_equation", + "bbox": [ + 173, + 150, + 437, + 172 + ], + "lines": [ + { + "bbox": [ + 173, + 150, + 437, + 172 + ], + "spans": [ + { + "bbox": [ + 173, + 150, + 437, + 172 + ], + "score": 0.91, + "content": "\\operatorname* { m a x } _ { \\theta } \\mathcal { I } ( q _ { i } , \\theta ) = \\operatorname* { m a x } _ { \\theta } \\mathbb { E } _ { \\mu _ { q } ( s ) } \\Big [ \\mathbb { E } _ { q ( a | s ) } \\Big [ \\log \\pi ( a | s , \\theta ) \\Big ] \\Big ] + \\log p ( \\theta ) ,", + "type": "interline_equation", + "image_path": "126b9a3c732b4985eaa8d9188c13a3d13893c384351538cd65543e255a10c66f.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 173, + 150, + 437, + 172 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 181, + 505, + 267 + ], + "lines": [ + { + "bbox": [ + 106, + 181, + 504, + 193 + ], + "spans": [ + { + "bbox": [ + 106, + 181, + 504, + 193 + ], + "score": 1.0, + "content": "which corresponds to a weighted maximum a-posteriroi estimation (MAP) problem where sam-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 192, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 505, + 205 + ], + "score": 1.0, + "content": "ples are weighted by the variational distribution from the E-step. Since this is essentially a su-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 203, + 505, + 217 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 505, + 217 + ], + "score": 1.0, + "content": "pervised learning step we can choose any policy representation in combination with any prior", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 213, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 105, + 213, + 273, + 228 + ], + "score": 1.0, + "content": "for regularisation. In this paper we set", + "type": "text" + }, + { + "bbox": [ + 273, + 214, + 293, + 226 + ], + "score": 0.91, + "content": "p ( \\pmb \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 213, + 505, + 228 + ], + "score": 1.0, + "content": "to a Gaussian prior around the current policy, i.e,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 225, + 503, + 245 + ], + "spans": [ + { + "bbox": [ + 106, + 225, + 232, + 245 + ], + "score": 0.92, + "content": "\\begin{array} { r } { p ( \\pmb { \\theta } ) \\approx \\mathcal { N } \\Big ( \\mu = \\pmb { \\theta } _ { i } , \\Sigma = \\frac { F _ { \\pmb { \\theta } _ { i } } } { \\lambda } \\Big ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 228, + 264, + 243 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 264, + 230, + 275, + 240 + ], + "score": 0.87, + "content": "\\pmb \\theta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 228, + 488, + 243 + ], + "score": 1.0, + "content": "are the parameters of the current policy distribution,", + "type": "text" + }, + { + "bbox": [ + 488, + 231, + 503, + 241 + ], + "score": 0.88, + "content": "F _ { \\pmb { \\theta } _ { i } }", + "type": "inline_equation" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 244, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 294, + 256 + ], + "score": 1.0, + "content": "is the empirical Fisher information matrix and", + "type": "text" + }, + { + "bbox": [ + 294, + 244, + 301, + 254 + ], + "score": 0.79, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 244, + 505, + 256 + ], + "score": 1.0, + "content": "is a positive scalar. As shown in the appendix this", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 254, + 280, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 280, + 268 + ], + "score": 1.0, + "content": "suggests the following generalized M-step:", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 8 + }, + { + "type": "interline_equation", + "bbox": [ + 168, + 280, + 442, + 302 + ], + "lines": [ + { + "bbox": [ + 168, + 280, + 442, + 302 + ], + "spans": [ + { + "bbox": [ + 168, + 280, + 442, + 302 + ], + "score": 0.91, + "content": "\\operatorname* { m a x } _ { \\pi } \\mathbb { E } _ { \\mu _ { q } ( s ) } \\Big [ \\mathbb { E } _ { q ( a | s ) } \\Big [ \\log \\pi ( a | s , \\pmb { \\theta } ) \\Big ] - \\lambda \\mathrm { K L } \\Big ( \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\pi ( a | s , \\pmb { \\theta } ) \\Big ) \\Big ]", + "type": "interline_equation", + "image_path": "e3414a54c816aac2322f74663302b60046b419e9c4fa26ac9745e0714899d392.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 168, + 280, + 442, + 302 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 310, + 330, + 322 + ], + "lines": [ + { + "bbox": [ + 106, + 309, + 332, + 323 + ], + "spans": [ + { + "bbox": [ + 106, + 309, + 332, + 323 + ], + "score": 1.0, + "content": "which can be re-written as the hard constrained version:", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "interline_equation", + "bbox": [ + 218, + 335, + 394, + 381 + ], + "lines": [ + { + "bbox": [ + 218, + 335, + 394, + 381 + ], + "spans": [ + { + "bbox": [ + 218, + 335, + 394, + 381 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\underset { \\pi } { \\operatorname* { m a x } } \\mathbb { E } _ { \\mu _ { q } ( s ) } \\left[ \\mathbb { E } _ { q ( a | s ) } \\left[ \\log \\pi ( a | s , \\pmb { \\theta } ) \\right] \\right] } \\\\ { s . t . \\mathbb { E } _ { \\mu _ { q } ( s ) } \\left[ { \\mathbf { K L } } ( \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\pi ( a | s , \\pmb { \\theta } ) ) \\right] < \\epsilon . } \\end{array}", + "type": "interline_equation", + "image_path": "326bacdbf4aabc3a5b055834d5937f2e8ed54ad75664f7b06e32c83160d55f29.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 218, + 335, + 394, + 350.3333333333333 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 218, + 350.3333333333333, + 394, + 365.66666666666663 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 218, + 365.66666666666663, + 394, + 380.99999999999994 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 387, + 505, + 488 + ], + "lines": [ + { + "bbox": [ + 105, + 387, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 506, + 401 + ], + "score": 1.0, + "content": "This additional constraint minimises the risk of overfitting the samples, i.e. it helps us to obtain a", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 399, + 506, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 506, + 412 + ], + "score": 1.0, + "content": "policy that generalises beyond the state-action samples used for the optimisation. In practice we", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 411, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 505, + 423 + ], + "score": 1.0, + "content": "have found the KL constraint in the M step to greatly increase stability of the algorithm. We also", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 419, + 506, + 435 + ], + "spans": [ + { + "bbox": [ + 104, + 419, + 506, + 435 + ], + "score": 1.0, + "content": "note that in the E-step we are using the reverse, mode-seeking, KL while in the M-step we are using", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 432, + 506, + 445 + ], + "spans": [ + { + "bbox": [ + 105, + 432, + 506, + 445 + ], + "score": 1.0, + "content": "the forward, moment-matching, KL which reduces the tendency of the entropy of the parametric", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 443, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 443, + 505, + 455 + ], + "score": 1.0, + "content": "policy to collapse. This is in contrast to other RL algorithms that use M-projection without KL", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 453, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 105, + 453, + 505, + 467 + ], + "score": 1.0, + "content": "constraint to fit a parametric policy (Peters et al., 2010a; Wirth et al., 2016; Chebotar et al., 2016;", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 464, + 506, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 506, + 477 + ], + "score": 1.0, + "content": "Montgomery & Levine, 2016). Using KL constraint in M-step has also been shown effective for", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 476, + 332, + 488 + ], + "spans": [ + { + "bbox": [ + 105, + 476, + 332, + 488 + ], + "score": 1.0, + "content": "stochastic search algorithms (Abdolmaleki et al., 2017).", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 21 + }, + { + "type": "title", + "bbox": [ + 108, + 504, + 236, + 516 + ], + "lines": [ + { + "bbox": [ + 105, + 502, + 237, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 237, + 519 + ], + "score": 1.0, + "content": "4 POLICY EVALUATION", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 528, + 505, + 585 + ], + "lines": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "score": 1.0, + "content": "Our method is directly applicable in an off-policy setting. For this, we have to rely on a stable", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 540, + 506, + 553 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 446, + 553 + ], + "score": 1.0, + "content": "policy evaluation operator to obtain a parametric representation of the Q-function", + "type": "text" + }, + { + "bbox": [ + 446, + 540, + 481, + 552 + ], + "score": 0.92, + "content": "Q _ { \\theta } ( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 540, + 506, + 553 + ], + "score": 1.0, + "content": ". We", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 551, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 505, + 563 + ], + "score": 1.0, + "content": "make use of the policy evaluation operator from the Retrace algorithm Munos et al. (2016), which", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 561, + 504, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 455, + 576 + ], + "score": 1.0, + "content": "we found to yield stable policy evaluation in practice2. Concretely, we fit the Q-function", + "type": "text" + }, + { + "bbox": [ + 455, + 563, + 504, + 574 + ], + "score": 0.92, + "content": "Q _ { \\theta _ { i } } ( s , a , \\phi )", + "type": "inline_equation" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 573, + 457, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 316, + 586 + ], + "score": 1.0, + "content": "as represented by a neural network, with parameters", + "type": "text" + }, + { + "bbox": [ + 317, + 574, + 324, + 585 + ], + "score": 0.84, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 573, + 457, + 586 + ], + "score": 1.0, + "content": ", by minimising the squared loss:", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 29 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 604, + 500, + 696 + ], + "lines": [ + { + "bbox": [ + 111, + 604, + 500, + 696 + ], + "spans": [ + { + "bbox": [ + 111, + 604, + 500, + 696 + ], + "score": 0.93, + "content": "\\begin{array} { l } { \\displaystyle \\mathop { \\operatorname* { m i n } } _ { \\phi } L ( \\phi ) = \\mathop { \\operatorname* { m i n } } _ { \\phi } \\mathbb { E } _ { \\mu _ { b } ( s ) , b ( a | s ) } \\left[ \\left( Q _ { \\theta _ { i } } ( s _ { t } , a _ { t } , \\phi ) - Q _ { t } ^ { \\mathrm { r e t } } \\right) ^ { 2 } \\right] , \\mathrm { w i t h } } \\\\ { \\displaystyle Q _ { t } ^ { \\mathrm { r e t } } = Q _ { \\phi ^ { \\prime } } ( s _ { t } , a _ { t } ) + \\sum _ { j = t } ^ { \\infty } \\gamma ^ { j - t } \\Big ( \\prod _ { k = t + 1 } ^ { j } c _ { k } \\Big ) \\left[ r ( s _ { j } , a _ { j } ) + \\mathbb { E } _ { \\pi ( a | s _ { j + 1 } ) } [ Q _ { \\phi ^ { \\prime } } ( s _ { j + 1 } , a ) ] - Q _ { \\phi ^ { \\prime } } ( s _ { j } , a _ { j } ) \\right] , } \\\\ { \\displaystyle c _ { k } = \\operatorname* { m i n } \\Big ( 1 , \\frac { \\pi ( a _ { k } | s _ { k } ) } { b ( a _ { k } | s _ { k } ) } \\Big ) , } \\end{array}", + "type": "interline_equation", + "image_path": "ddd41d4e1eeeddfb6b26cf9d237375ea93c7ad203c8bd727946d1235131b9f6b.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 111, + 604, + 500, + 634.6666666666666 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 111, + 634.6666666666666, + 500, + 665.3333333333333 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 111, + 665.3333333333333, + 500, + 695.9999999999999 + ], + "spans": [], + "index": 34 + } + ] + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 711, + 506, + 732 + ], + "lines": [ + { + "bbox": [ + 117, + 708, + 506, + 724 + ], + "spans": [ + { + "bbox": [ + 117, + 708, + 506, + 724 + ], + "score": 1.0, + "content": "2We note that, despite this empirical finding, Retrace may not be guaranteed to be stable with function", + "type": "text" + } + ] + }, + { + "bbox": [ + 105, + 721, + 237, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 237, + 732 + ], + "score": 1.0, + "content": "approximation (Touati et al., 2017).", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 310, + 762 + ], + "score": 1.0, + "content": "6", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 82, + 166, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 167, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 167, + 95 + ], + "score": 1.0, + "content": "3.3 M-STEP", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 103, + 505, + 137 + ], + "lines": [ + { + "bbox": [ + 105, + 102, + 505, + 116 + ], + "spans": [ + { + "bbox": [ + 105, + 102, + 132, + 116 + ], + "score": 1.0, + "content": "Given", + "type": "text" + }, + { + "bbox": [ + 133, + 105, + 142, + 115 + ], + "score": 0.84, + "content": "q _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 102, + 341, + 116 + ], + "score": 1.0, + "content": "from the E-step we can optimize the lower bound", + "type": "text" + }, + { + "bbox": [ + 342, + 104, + 351, + 114 + ], + "score": 0.84, + "content": "\\mathcal { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 102, + 413, + 116 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 414, + 104, + 421, + 113 + ], + "score": 0.8, + "content": "\\pmb \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 102, + 505, + 116 + ], + "score": 1.0, + "content": "to obtain an updated", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 114, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 135, + 127 + ], + "score": 1.0, + "content": "policy", + "type": "text" + }, + { + "bbox": [ + 135, + 114, + 247, + 126 + ], + "score": 0.52, + "content": "\\pmb { \\theta } _ { i + 1 } = \\arg \\operatorname* { m a x } _ { \\pmb { \\theta } } \\mathcal { I } ( q _ { i } , \\pmb { \\theta } )", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 114, + 385, + 127 + ], + "score": 1.0, + "content": ". Dropping terms independent of", + "type": "text" + }, + { + "bbox": [ + 386, + 115, + 393, + 124 + ], + "score": 0.79, + "content": "\\pmb { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 114, + 505, + 127 + ], + "score": 1.0, + "content": "this entails solving for the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 125, + 153, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 125, + 153, + 136 + ], + "score": 1.0, + "content": "solution of", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 102, + 505, + 136 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 173, + 150, + 437, + 172 + ], + "lines": [ + { + "bbox": [ + 173, + 150, + 437, + 172 + ], + "spans": [ + { + "bbox": [ + 173, + 150, + 437, + 172 + ], + "score": 0.91, + "content": "\\operatorname* { m a x } _ { \\theta } \\mathcal { I } ( q _ { i } , \\theta ) = \\operatorname* { m a x } _ { \\theta } \\mathbb { E } _ { \\mu _ { q } ( s ) } \\Big [ \\mathbb { E } _ { q ( a | s ) } \\Big [ \\log \\pi ( a | s , \\theta ) \\Big ] \\Big ] + \\log p ( \\theta ) ,", + "type": "interline_equation", + "image_path": "126b9a3c732b4985eaa8d9188c13a3d13893c384351538cd65543e255a10c66f.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 173, + 150, + 437, + 172 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 181, + 505, + 267 + ], + "lines": [ + { + "bbox": [ + 106, + 181, + 504, + 193 + ], + "spans": [ + { + "bbox": [ + 106, + 181, + 504, + 193 + ], + "score": 1.0, + "content": "which corresponds to a weighted maximum a-posteriroi estimation (MAP) problem where sam-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 192, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 505, + 205 + ], + "score": 1.0, + "content": "ples are weighted by the variational distribution from the E-step. Since this is essentially a su-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 203, + 505, + 217 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 505, + 217 + ], + "score": 1.0, + "content": "pervised learning step we can choose any policy representation in combination with any prior", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 213, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 105, + 213, + 273, + 228 + ], + "score": 1.0, + "content": "for regularisation. In this paper we set", + "type": "text" + }, + { + "bbox": [ + 273, + 214, + 293, + 226 + ], + "score": 0.91, + "content": "p ( \\pmb \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 213, + 505, + 228 + ], + "score": 1.0, + "content": "to a Gaussian prior around the current policy, i.e,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 225, + 503, + 245 + ], + "spans": [ + { + "bbox": [ + 106, + 225, + 232, + 245 + ], + "score": 0.92, + "content": "\\begin{array} { r } { p ( \\pmb { \\theta } ) \\approx \\mathcal { N } \\Big ( \\mu = \\pmb { \\theta } _ { i } , \\Sigma = \\frac { F _ { \\pmb { \\theta } _ { i } } } { \\lambda } \\Big ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 228, + 264, + 243 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 264, + 230, + 275, + 240 + ], + "score": 0.87, + "content": "\\pmb \\theta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 228, + 488, + 243 + ], + "score": 1.0, + "content": "are the parameters of the current policy distribution,", + "type": "text" + }, + { + "bbox": [ + 488, + 231, + 503, + 241 + ], + "score": 0.88, + "content": "F _ { \\pmb { \\theta } _ { i } }", + "type": "inline_equation" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 244, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 294, + 256 + ], + "score": 1.0, + "content": "is the empirical Fisher information matrix and", + "type": "text" + }, + { + "bbox": [ + 294, + 244, + 301, + 254 + ], + "score": 0.79, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 244, + 505, + 256 + ], + "score": 1.0, + "content": "is a positive scalar. As shown in the appendix this", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 254, + 280, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 280, + 268 + ], + "score": 1.0, + "content": "suggests the following generalized M-step:", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 181, + 505, + 268 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 168, + 280, + 442, + 302 + ], + "lines": [ + { + "bbox": [ + 168, + 280, + 442, + 302 + ], + "spans": [ + { + "bbox": [ + 168, + 280, + 442, + 302 + ], + "score": 0.91, + "content": "\\operatorname* { m a x } _ { \\pi } \\mathbb { E } _ { \\mu _ { q } ( s ) } \\Big [ \\mathbb { E } _ { q ( a | s ) } \\Big [ \\log \\pi ( a | s , \\pmb { \\theta } ) \\Big ] - \\lambda \\mathrm { K L } \\Big ( \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\pi ( a | s , \\pmb { \\theta } ) \\Big ) \\Big ]", + "type": "interline_equation", + "image_path": "e3414a54c816aac2322f74663302b60046b419e9c4fa26ac9745e0714899d392.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 168, + 280, + 442, + 302 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 310, + 330, + 322 + ], + "lines": [ + { + "bbox": [ + 106, + 309, + 332, + 323 + ], + "spans": [ + { + "bbox": [ + 106, + 309, + 332, + 323 + ], + "score": 1.0, + "content": "which can be re-written as the hard constrained version:", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 106, + 309, + 332, + 323 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 218, + 335, + 394, + 381 + ], + "lines": [ + { + "bbox": [ + 218, + 335, + 394, + 381 + ], + "spans": [ + { + "bbox": [ + 218, + 335, + 394, + 381 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\underset { \\pi } { \\operatorname* { m a x } } \\mathbb { E } _ { \\mu _ { q } ( s ) } \\left[ \\mathbb { E } _ { q ( a | s ) } \\left[ \\log \\pi ( a | s , \\pmb { \\theta } ) \\right] \\right] } \\\\ { s . t . \\mathbb { E } _ { \\mu _ { q } ( s ) } \\left[ { \\mathbf { K L } } ( \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\pi ( a | s , \\pmb { \\theta } ) ) \\right] < \\epsilon . } \\end{array}", + "type": "interline_equation", + "image_path": "326bacdbf4aabc3a5b055834d5937f2e8ed54ad75664f7b06e32c83160d55f29.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 218, + 335, + 394, + 350.3333333333333 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 218, + 350.3333333333333, + 394, + 365.66666666666663 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 218, + 365.66666666666663, + 394, + 380.99999999999994 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 387, + 505, + 488 + ], + "lines": [ + { + "bbox": [ + 105, + 387, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 506, + 401 + ], + "score": 1.0, + "content": "This additional constraint minimises the risk of overfitting the samples, i.e. it helps us to obtain a", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 399, + 506, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 506, + 412 + ], + "score": 1.0, + "content": "policy that generalises beyond the state-action samples used for the optimisation. In practice we", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 411, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 505, + 423 + ], + "score": 1.0, + "content": "have found the KL constraint in the M step to greatly increase stability of the algorithm. We also", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 419, + 506, + 435 + ], + "spans": [ + { + "bbox": [ + 104, + 419, + 506, + 435 + ], + "score": 1.0, + "content": "note that in the E-step we are using the reverse, mode-seeking, KL while in the M-step we are using", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 432, + 506, + 445 + ], + "spans": [ + { + "bbox": [ + 105, + 432, + 506, + 445 + ], + "score": 1.0, + "content": "the forward, moment-matching, KL which reduces the tendency of the entropy of the parametric", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 443, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 443, + 505, + 455 + ], + "score": 1.0, + "content": "policy to collapse. This is in contrast to other RL algorithms that use M-projection without KL", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 453, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 105, + 453, + 505, + 467 + ], + "score": 1.0, + "content": "constraint to fit a parametric policy (Peters et al., 2010a; Wirth et al., 2016; Chebotar et al., 2016;", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 464, + 506, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 506, + 477 + ], + "score": 1.0, + "content": "Montgomery & Levine, 2016). Using KL constraint in M-step has also been shown effective for", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 476, + 332, + 488 + ], + "spans": [ + { + "bbox": [ + 105, + 476, + 332, + 488 + ], + "score": 1.0, + "content": "stochastic search algorithms (Abdolmaleki et al., 2017).", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 21, + "bbox_fs": [ + 104, + 387, + 506, + 488 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 504, + 236, + 516 + ], + "lines": [ + { + "bbox": [ + 105, + 502, + 237, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 237, + 519 + ], + "score": 1.0, + "content": "4 POLICY EVALUATION", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 528, + 505, + 585 + ], + "lines": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "score": 1.0, + "content": "Our method is directly applicable in an off-policy setting. For this, we have to rely on a stable", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 540, + 506, + 553 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 446, + 553 + ], + "score": 1.0, + "content": "policy evaluation operator to obtain a parametric representation of the Q-function", + "type": "text" + }, + { + "bbox": [ + 446, + 540, + 481, + 552 + ], + "score": 0.92, + "content": "Q _ { \\theta } ( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 540, + 506, + 553 + ], + "score": 1.0, + "content": ". We", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 551, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 505, + 563 + ], + "score": 1.0, + "content": "make use of the policy evaluation operator from the Retrace algorithm Munos et al. (2016), which", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 561, + 504, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 455, + 576 + ], + "score": 1.0, + "content": "we found to yield stable policy evaluation in practice2. Concretely, we fit the Q-function", + "type": "text" + }, + { + "bbox": [ + 455, + 563, + 504, + 574 + ], + "score": 0.92, + "content": "Q _ { \\theta _ { i } } ( s , a , \\phi )", + "type": "inline_equation" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 573, + 457, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 316, + 586 + ], + "score": 1.0, + "content": "as represented by a neural network, with parameters", + "type": "text" + }, + { + "bbox": [ + 317, + 574, + 324, + 585 + ], + "score": 0.84, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 573, + 457, + 586 + ], + "score": 1.0, + "content": ", by minimising the squared loss:", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 29, + "bbox_fs": [ + 105, + 529, + 506, + 586 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 604, + 500, + 696 + ], + "lines": [ + { + "bbox": [ + 111, + 604, + 500, + 696 + ], + "spans": [ + { + "bbox": [ + 111, + 604, + 500, + 696 + ], + "score": 0.93, + "content": "\\begin{array} { l } { \\displaystyle \\mathop { \\operatorname* { m i n } } _ { \\phi } L ( \\phi ) = \\mathop { \\operatorname* { m i n } } _ { \\phi } \\mathbb { E } _ { \\mu _ { b } ( s ) , b ( a | s ) } \\left[ \\left( Q _ { \\theta _ { i } } ( s _ { t } , a _ { t } , \\phi ) - Q _ { t } ^ { \\mathrm { r e t } } \\right) ^ { 2 } \\right] , \\mathrm { w i t h } } \\\\ { \\displaystyle Q _ { t } ^ { \\mathrm { r e t } } = Q _ { \\phi ^ { \\prime } } ( s _ { t } , a _ { t } ) + \\sum _ { j = t } ^ { \\infty } \\gamma ^ { j - t } \\Big ( \\prod _ { k = t + 1 } ^ { j } c _ { k } \\Big ) \\left[ r ( s _ { j } , a _ { j } ) + \\mathbb { E } _ { \\pi ( a | s _ { j + 1 } ) } [ Q _ { \\phi ^ { \\prime } } ( s _ { j + 1 } , a ) ] - Q _ { \\phi ^ { \\prime } } ( s _ { j } , a _ { j } ) \\right] , } \\\\ { \\displaystyle c _ { k } = \\operatorname* { m i n } \\Big ( 1 , \\frac { \\pi ( a _ { k } | s _ { k } ) } { b ( a _ { k } | s _ { k } ) } \\Big ) , } \\end{array}", + "type": "interline_equation", + "image_path": "ddd41d4e1eeeddfb6b26cf9d237375ea93c7ad203c8bd727946d1235131b9f6b.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 111, + 604, + 500, + 634.6666666666666 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 111, + 634.6666666666666, + 500, + 665.3333333333333 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 111, + 665.3333333333333, + 500, + 695.9999999999999 + ], + "spans": [], + "index": 34 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 149 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 133, + 95 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 82, + 172, + 95 + ], + "score": 0.93, + "content": "Q _ { \\phi ^ { \\prime } } ( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 82, + 403, + 95 + ], + "score": 1.0, + "content": "denotes the output of a target Q-network, with parameters", + "type": "text" + }, + { + "bbox": [ + 403, + 83, + 413, + 94 + ], + "score": 0.86, + "content": "\\phi ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 82, + 505, + 95 + ], + "score": 1.0, + "content": ", that we copy from the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 506, + 108 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 183, + 108 + ], + "score": 1.0, + "content": "current parameters", + "type": "text" + }, + { + "bbox": [ + 183, + 94, + 191, + 105 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 92, + 401, + 108 + ], + "score": 1.0, + "content": "after each M-step. We truncate the infinite sum after", + "type": "text" + }, + { + "bbox": [ + 402, + 95, + 412, + 104 + ], + "score": 0.82, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 92, + 506, + 108 + ], + "score": 1.0, + "content": "steps by bootstrapping", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 127, + 117 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 127, + 105, + 144, + 117 + ], + "score": 0.91, + "content": "Q _ { \\phi ^ { \\prime } }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 104, + 253, + 117 + ], + "score": 1.0, + "content": "(rather than considering a", + "type": "text" + }, + { + "bbox": [ + 253, + 105, + 261, + 114 + ], + "score": 0.7, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 104, + 352, + 117 + ], + "score": 1.0, + "content": "return). Additionally,", + "type": "text" + }, + { + "bbox": [ + 352, + 104, + 378, + 116 + ], + "score": 0.92, + "content": "b ( a | s )", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "denotes the probabilities of an", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 106, + 115, + 451, + 128 + ], + "score": 1.0, + "content": "arbitrary behaviour policy. In our case we use an experience replay buffer and hence", + "type": "text" + }, + { + "bbox": [ + 451, + 116, + 457, + 125 + ], + "score": 0.73, + "content": "b", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "is given by", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 505, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 139 + ], + "score": 1.0, + "content": "the action probabilities stored in the buffer; which correspond to the action probabilities at the time", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 184, + 149 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 184, + 149 + ], + "score": 1.0, + "content": "of action selection.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 108, + 165, + 200, + 178 + ], + "lines": [ + { + "bbox": [ + 105, + 165, + 201, + 180 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 201, + 180 + ], + "score": 1.0, + "content": "5 EXPERIMENTS", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 107, + 190, + 505, + 268 + ], + "lines": [ + { + "bbox": [ + 105, + 191, + 505, + 204 + ], + "spans": [ + { + "bbox": [ + 105, + 191, + 505, + 204 + ], + "score": 1.0, + "content": "For our experiments we evaluate our MPO algorithm across a wide range of tasks. Specifically, we", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 201, + 505, + 215 + ], + "spans": [ + { + "bbox": [ + 105, + 201, + 505, + 215 + ], + "score": 1.0, + "content": "start by looking at the continuous control tasks of the DeepMind Control Suite (Tassa et al. (2018),", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 212, + 506, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 212, + 506, + 226 + ], + "score": 1.0, + "content": "see Figure 1), and then consider the challenging parkour environments recently published in Heess", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 223, + 506, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 506, + 236 + ], + "score": 1.0, + "content": "et al. (2017). In both cases we use a Gaussian distribution for the policy whose mean and covariance", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 234, + 505, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 234, + 505, + 248 + ], + "score": 1.0, + "content": "are parameterized by a neural network (see appendix for details). In addition, we present initial", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 245, + 506, + 259 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 506, + 259 + ], + "score": 1.0, + "content": "experiments for discrete control using ATARI environments using a categorical policy distribution", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 257, + 411, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 411, + 270 + ], + "score": 1.0, + "content": "(whose logits are again parameterized by a neural network) in the appendix.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10 + }, + { + "type": "title", + "bbox": [ + 108, + 282, + 273, + 293 + ], + "lines": [ + { + "bbox": [ + 106, + 282, + 275, + 295 + ], + "spans": [ + { + "bbox": [ + 106, + 282, + 275, + 295 + ], + "score": 1.0, + "content": "5.1 EVALUATION ON CONTROL SUITE", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "image", + "bbox": [ + 107, + 306, + 502, + 420 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 306, + 502, + 420 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 306, + 502, + 420 + ], + "spans": [ + { + "bbox": [ + 107, + 306, + 502, + 420 + ], + "score": 0.969, + "type": "image", + "image_path": "754c06df74f11ccb9772163bdb2d3c935cb2cba2b5b65def9b07cd08ab62b078.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 107, + 306, + 502, + 344.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 107, + 344.0, + 502, + 382.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 107, + 382.0, + 502, + 420.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 432, + 505, + 465 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 430, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 430, + 505, + 444 + ], + "score": 1.0, + "content": "Figure 1: Control Suite domains used for benchmarking. Top: Acrobot, Ball-in-cup, Cart-pole,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 442, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 505, + 455 + ], + "score": 1.0, + "content": "Cheetah, Finger, Fish, Hopper. Bottom: Humanoid, Manipulator, Pendulum, Point-mass, Reacher,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 454, + 252, + 466 + ], + "spans": [ + { + "bbox": [ + 106, + 454, + 252, + 466 + ], + "score": 1.0, + "content": "Swimmers (6 and 15 links), Walker.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 107, + 478, + 505, + 534 + ], + "lines": [ + { + "bbox": [ + 106, + 478, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 478, + 505, + 491 + ], + "score": 1.0, + "content": "The suite of continuous control tasks that we are evaluating against contains 18 tasks, compris-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "score": 1.0, + "content": "ing a wide range of domains including well known tasks from the literature. For example, the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 500, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 505, + 513 + ], + "score": 1.0, + "content": "classical cart-pole and acrobot dynamical systems, 2D and Humanoid walking as well as simple", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "score": 1.0, + "content": "low-dimensional planar reaching and manipulation tasks. This suite of tasks was built in python on", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 523, + 445, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 445, + 536 + ], + "score": 1.0, + "content": "top of mujoco and will also be open sourced to the public by the time of publication.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 108, + 539, + 504, + 572 + ], + "lines": [ + { + "bbox": [ + 106, + 538, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 506, + 552 + ], + "score": 1.0, + "content": "While we include plots depicting the performance of our algorithm on all tasks below; comparing it", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "against the state-of-the-art algorithms in terms of data-efficiency. We want to start by directing the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 107, + 562, + 485, + 573 + ], + "spans": [ + { + "bbox": [ + 107, + 562, + 485, + 573 + ], + "score": 1.0, + "content": "attention of the reader to a more detailed evaluation on three of the harder tasks from the suite.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 585, + 389, + 596 + ], + "lines": [ + { + "bbox": [ + 105, + 584, + 392, + 598 + ], + "spans": [ + { + "bbox": [ + 105, + 584, + 392, + 598 + ], + "score": 1.0, + "content": "5.1.1 DETAILED ANALYSIS ON WALKER-2D, ACROBOT, HOPPER", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 107, + 604, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 105, + 604, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 618 + ], + "score": 1.0, + "content": "We start by looking at the results for the classical Acrobot task (two degrees of freedom, one con-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 615, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 628 + ], + "score": 1.0, + "content": "tinuous action dimension) as well as the 2D walker (which has 12 degrees of freedom and thus a", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "12 dimensional action space and a 21 dimensional state space) and the hopper standing task. The", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 637, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 505, + 650 + ], + "score": 1.0, + "content": "reward in the Acrobot task is the distance of the robots end-effector to an upright position of the", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "score": 1.0, + "content": "underactuated system. For the walker task it is given by the forward velocity, whereas in the hopper", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 660, + 234, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 234, + 672 + ], + "score": 1.0, + "content": "the requirement is to stand still.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 107, + 677, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "score": 1.0, + "content": "Figure 2 shows the results for this task obtained by applying our algorithm MPO as well as several", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "ablations – in which different parts were removed from the MPO optimization – and two baselines:", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "our implementation of Proximal Policy Optimization (PPO) (Schulman et al., 2017b) and DDPG.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "score": 1.0, + "content": "The hyperparameters for MPO were kept fixed for all experiments in the paper (see the appendix for", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 721, + 210, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 210, + 734 + ], + "score": 1.0, + "content": "hyperparameter settings).", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 303, + 751, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 12, + "width": 7 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 149 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 133, + 95 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 82, + 172, + 95 + ], + "score": 0.93, + "content": "Q _ { \\phi ^ { \\prime } } ( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 82, + 403, + 95 + ], + "score": 1.0, + "content": "denotes the output of a target Q-network, with parameters", + "type": "text" + }, + { + "bbox": [ + 403, + 83, + 413, + 94 + ], + "score": 0.86, + "content": "\\phi ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 82, + 505, + 95 + ], + "score": 1.0, + "content": ", that we copy from the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 506, + 108 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 183, + 108 + ], + "score": 1.0, + "content": "current parameters", + "type": "text" + }, + { + "bbox": [ + 183, + 94, + 191, + 105 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 92, + 401, + 108 + ], + "score": 1.0, + "content": "after each M-step. We truncate the infinite sum after", + "type": "text" + }, + { + "bbox": [ + 402, + 95, + 412, + 104 + ], + "score": 0.82, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 92, + 506, + 108 + ], + "score": 1.0, + "content": "steps by bootstrapping", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 127, + 117 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 127, + 105, + 144, + 117 + ], + "score": 0.91, + "content": "Q _ { \\phi ^ { \\prime } }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 104, + 253, + 117 + ], + "score": 1.0, + "content": "(rather than considering a", + "type": "text" + }, + { + "bbox": [ + 253, + 105, + 261, + 114 + ], + "score": 0.7, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 104, + 352, + 117 + ], + "score": 1.0, + "content": "return). Additionally,", + "type": "text" + }, + { + "bbox": [ + 352, + 104, + 378, + 116 + ], + "score": 0.92, + "content": "b ( a | s )", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "denotes the probabilities of an", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 106, + 115, + 451, + 128 + ], + "score": 1.0, + "content": "arbitrary behaviour policy. In our case we use an experience replay buffer and hence", + "type": "text" + }, + { + "bbox": [ + 451, + 116, + 457, + 125 + ], + "score": 0.73, + "content": "b", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "is given by", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 505, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 139 + ], + "score": 1.0, + "content": "the action probabilities stored in the buffer; which correspond to the action probabilities at the time", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 184, + 149 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 184, + 149 + ], + "score": 1.0, + "content": "of action selection.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 82, + 506, + 149 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 165, + 200, + 178 + ], + "lines": [ + { + "bbox": [ + 105, + 165, + 201, + 180 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 201, + 180 + ], + "score": 1.0, + "content": "5 EXPERIMENTS", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 107, + 190, + 505, + 268 + ], + "lines": [ + { + "bbox": [ + 105, + 191, + 505, + 204 + ], + "spans": [ + { + "bbox": [ + 105, + 191, + 505, + 204 + ], + "score": 1.0, + "content": "For our experiments we evaluate our MPO algorithm across a wide range of tasks. Specifically, we", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 201, + 505, + 215 + ], + "spans": [ + { + "bbox": [ + 105, + 201, + 505, + 215 + ], + "score": 1.0, + "content": "start by looking at the continuous control tasks of the DeepMind Control Suite (Tassa et al. (2018),", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 212, + 506, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 212, + 506, + 226 + ], + "score": 1.0, + "content": "see Figure 1), and then consider the challenging parkour environments recently published in Heess", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 223, + 506, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 506, + 236 + ], + "score": 1.0, + "content": "et al. (2017). In both cases we use a Gaussian distribution for the policy whose mean and covariance", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 234, + 505, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 234, + 505, + 248 + ], + "score": 1.0, + "content": "are parameterized by a neural network (see appendix for details). In addition, we present initial", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 245, + 506, + 259 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 506, + 259 + ], + "score": 1.0, + "content": "experiments for discrete control using ATARI environments using a categorical policy distribution", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 257, + 411, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 411, + 270 + ], + "score": 1.0, + "content": "(whose logits are again parameterized by a neural network) in the appendix.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 191, + 506, + 270 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 282, + 273, + 293 + ], + "lines": [ + { + "bbox": [ + 106, + 282, + 275, + 295 + ], + "spans": [ + { + "bbox": [ + 106, + 282, + 275, + 295 + ], + "score": 1.0, + "content": "5.1 EVALUATION ON CONTROL SUITE", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "image", + "bbox": [ + 107, + 306, + 502, + 420 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 306, + 502, + 420 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 306, + 502, + 420 + ], + "spans": [ + { + "bbox": [ + 107, + 306, + 502, + 420 + ], + "score": 0.969, + "type": "image", + "image_path": "754c06df74f11ccb9772163bdb2d3c935cb2cba2b5b65def9b07cd08ab62b078.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 107, + 306, + 502, + 344.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 107, + 344.0, + 502, + 382.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 107, + 382.0, + 502, + 420.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 432, + 505, + 465 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 430, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 430, + 505, + 444 + ], + "score": 1.0, + "content": "Figure 1: Control Suite domains used for benchmarking. Top: Acrobot, Ball-in-cup, Cart-pole,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 442, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 505, + 455 + ], + "score": 1.0, + "content": "Cheetah, Finger, Fish, Hopper. Bottom: Humanoid, Manipulator, Pendulum, Point-mass, Reacher,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 454, + 252, + 466 + ], + "spans": [ + { + "bbox": [ + 106, + 454, + 252, + 466 + ], + "score": 1.0, + "content": "Swimmers (6 and 15 links), Walker.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 107, + 478, + 505, + 534 + ], + "lines": [ + { + "bbox": [ + 106, + 478, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 478, + 505, + 491 + ], + "score": 1.0, + "content": "The suite of continuous control tasks that we are evaluating against contains 18 tasks, compris-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "score": 1.0, + "content": "ing a wide range of domains including well known tasks from the literature. For example, the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 500, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 505, + 513 + ], + "score": 1.0, + "content": "classical cart-pole and acrobot dynamical systems, 2D and Humanoid walking as well as simple", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "score": 1.0, + "content": "low-dimensional planar reaching and manipulation tasks. This suite of tasks was built in python on", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 523, + 445, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 445, + 536 + ], + "score": 1.0, + "content": "top of mujoco and will also be open sourced to the public by the time of publication.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 478, + 505, + 536 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 539, + 504, + 572 + ], + "lines": [ + { + "bbox": [ + 106, + 538, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 506, + 552 + ], + "score": 1.0, + "content": "While we include plots depicting the performance of our algorithm on all tasks below; comparing it", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "against the state-of-the-art algorithms in terms of data-efficiency. We want to start by directing the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 107, + 562, + 485, + 573 + ], + "spans": [ + { + "bbox": [ + 107, + 562, + 485, + 573 + ], + "score": 1.0, + "content": "attention of the reader to a more detailed evaluation on three of the harder tasks from the suite.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 538, + 506, + 573 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 585, + 389, + 596 + ], + "lines": [ + { + "bbox": [ + 105, + 584, + 392, + 598 + ], + "spans": [ + { + "bbox": [ + 105, + 584, + 392, + 598 + ], + "score": 1.0, + "content": "5.1.1 DETAILED ANALYSIS ON WALKER-2D, ACROBOT, HOPPER", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29, + "bbox_fs": [ + 105, + 584, + 392, + 598 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 604, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 105, + 604, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 618 + ], + "score": 1.0, + "content": "We start by looking at the results for the classical Acrobot task (two degrees of freedom, one con-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 615, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 628 + ], + "score": 1.0, + "content": "tinuous action dimension) as well as the 2D walker (which has 12 degrees of freedom and thus a", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "12 dimensional action space and a 21 dimensional state space) and the hopper standing task. The", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 637, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 505, + 650 + ], + "score": 1.0, + "content": "reward in the Acrobot task is the distance of the robots end-effector to an upright position of the", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "score": 1.0, + "content": "underactuated system. For the walker task it is given by the forward velocity, whereas in the hopper", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 660, + 234, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 234, + 672 + ], + "score": 1.0, + "content": "the requirement is to stand still.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 604, + 506, + 672 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 677, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "score": 1.0, + "content": "Figure 2 shows the results for this task obtained by applying our algorithm MPO as well as several", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "ablations – in which different parts were removed from the MPO optimization – and two baselines:", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "our implementation of Proximal Policy Optimization (PPO) (Schulman et al., 2017b) and DDPG.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "score": 1.0, + "content": "The hyperparameters for MPO were kept fixed for all experiments in the paper (see the appendix for", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 721, + 210, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 210, + 734 + ], + "score": 1.0, + "content": "hyperparameter settings).", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38, + "bbox_fs": [ + 105, + 676, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 83, + 505, + 280 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "As a first observation, we can see that MPO gives stable learning on all tasks and, thanks to its", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "fully off-policy implementation, is significantly more sample efficient than the on-policy PPO base-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "score": 1.0, + "content": "line. Furthermore, we can observe that changing from the non-parametric variational distribution", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "to a parametric distribution3 (which, as described above, can be related to PPO) results in only a", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 504, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 504, + 139 + ], + "score": 1.0, + "content": "minor asymptotic performance loss but slowed down optimisation and thus hampered sample effi-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 358, + 150 + ], + "score": 1.0, + "content": "ciency; which can be attributed to the fact that the parametric", + "type": "text" + }, + { + "bbox": [ + 358, + 139, + 365, + 149 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 137, + 505, + 150 + ], + "score": 1.0, + "content": "distribution required a stricter KL", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 148, + 506, + 161 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 506, + 161 + ], + "score": 1.0, + "content": "constraint. Removing the automatically tuned KL constraint and replacing it with a manually set", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 159, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 506, + 172 + ], + "score": 1.0, + "content": "entropy regulariser then yields an off-policy actor-critic method with Retrace. This policy gradient", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 170, + 506, + 182 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 506, + 182 + ], + "score": 1.0, + "content": "method still uses the idea of estimating the integral over actions – and thus, for a gradient based", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 181, + 505, + 193 + ], + "spans": [ + { + "bbox": [ + 106, + 181, + 505, + 193 + ], + "score": 1.0, + "content": "optimiser, its likelihood ratio derivative – via multiple action samples (as judged by a Q-Retrace", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 192, + 506, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 506, + 205 + ], + "score": 1.0, + "content": "critic). This idea has previously been coined as using the expected policy gradient (EPG) (Ciosek", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 203, + 505, + 215 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 433, + 215 + ], + "score": 1.0, + "content": "& Whiteson, 2017) and we hence denote the corresponding algorithm with EPG", + "type": "text" + }, + { + "bbox": [ + 433, + 204, + 442, + 213 + ], + "score": 0.61, + "content": "^ +", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 203, + 505, + 215 + ], + "score": 1.0, + "content": "Retrace, which", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 213, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 213, + 338, + 226 + ], + "score": 1.0, + "content": "no-longer follows the intuitions of the MPO perspective.", + "type": "text" + }, + { + "bbox": [ + 338, + 214, + 370, + 225 + ], + "score": 0.26, + "content": "\\mathrm { E P G } + .", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 213, + 505, + 226 + ], + "score": 1.0, + "content": "Retrace performed well when the", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 224, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 224, + 505, + 239 + ], + "score": 1.0, + "content": "correct entropy regularisation scale is used. This, however, required task specific tuning (c.f. Fig-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 236, + 505, + 248 + ], + "spans": [ + { + "bbox": [ + 106, + 236, + 505, + 248 + ], + "score": 1.0, + "content": "ure 4 where this hyperparameter was set to the one that performed best in average across tasks).", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 247, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 505, + 260 + ], + "score": 1.0, + "content": "Finally using only a single sample to estimate the integral (and hence the likelihood ratio gradient)", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 258, + 505, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 505, + 271 + ], + "score": 1.0, + "content": "results in an actor-critic variant with Retrace that is the least performant off-policy algorithm in our", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 270, + 158, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 158, + 282 + ], + "score": 1.0, + "content": "comparison.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 8.5 + }, + { + "type": "image", + "bbox": [ + 105, + 337, + 506, + 451 + ], + "blocks": [ + { + "type": "image_caption", + "bbox": [ + 107, + 299, + 503, + 332 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 299, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 106, + 299, + 505, + 312 + ], + "score": 1.0, + "content": "Figure 2: Ablation study of the MPO algorithm and comparison to common baselines from the liter-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 310, + 505, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 310, + 505, + 323 + ], + "score": 1.0, + "content": "ature on three domains from the control suite. We plot the median performance over 10 experiments", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 321, + 222, + 333 + ], + "spans": [ + { + "bbox": [ + 106, + 321, + 222, + 333 + ], + "score": 1.0, + "content": "with different random seeds.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "image_body", + "bbox": [ + 105, + 337, + 506, + 451 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 337, + 506, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 506, + 451 + ], + "score": 0.968, + "type": "image", + "image_path": "c77b362823bc448bf6268c862a2c6ae8c0cbe92c11eed9cb0fed52cbb3223fbf.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 105, + 337, + 506, + 375.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 105, + 375.0, + 506, + 413.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 105, + 413.0, + 506, + 451.0 + ], + "spans": [], + "index": 23 + } + ] + } + ], + "index": 20.5 + }, + { + "type": "title", + "bbox": [ + 109, + 480, + 331, + 490 + ], + "lines": [ + { + "bbox": [ + 106, + 479, + 333, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 333, + 491 + ], + "score": 1.0, + "content": "5.1.2 COMPLETE RESULTS ON THE CONTROL SUITE", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 498, + 505, + 576 + ], + "lines": [ + { + "bbox": [ + 106, + 498, + 505, + 511 + ], + "spans": [ + { + "bbox": [ + 106, + 498, + 505, + 511 + ], + "score": 1.0, + "content": "The results for MPO (non-parameteric) – and a comparison to an implementation of state-of-the-art", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 510, + 506, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 510, + 506, + 522 + ], + "score": 1.0, + "content": "algorithms from the literature in our framework – on all the environments from the control suite that", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 521, + 504, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 521, + 504, + 532 + ], + "score": 1.0, + "content": "we tested on are shown in Figure 4. All tasks have rewards that are scaled to be between 0 and 1000.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 532, + 504, + 543 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 504, + 543 + ], + "score": 1.0, + "content": "We note that in order to ensure a fair comparison all algorithms ran with exactly the same network", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 541, + 506, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 506, + 556 + ], + "score": 1.0, + "content": "configuration, used a single learner (no distributed computation), used the same optimizer and were", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 554, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 106, + 554, + 505, + 565 + ], + "score": 1.0, + "content": "tuned w.r.t. their hyperparameters for best performance across all tasks. We refer to the appendix for", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 564, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 505, + 578 + ], + "score": 1.0, + "content": "a complete description of the hyperparameters. Our comparison is made in terms of data-efficiency.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 581, + 505, + 713 + ], + "lines": [ + { + "bbox": [ + 105, + 581, + 505, + 594 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 505, + 594 + ], + "score": 1.0, + "content": "From the plot a few trends are readily apparent: i) We can clearly observe the advantage in terms", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 593, + 506, + 605 + ], + "spans": [ + { + "bbox": [ + 105, + 593, + 506, + 605 + ], + "score": 1.0, + "content": "of data-efficiency that methods relying on a Q-critic obtain over the PPO baseline. This difference", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 603, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 603, + 505, + 616 + ], + "score": 1.0, + "content": "is so extreme that in several instances the PPO baseline converges an order of magnitude slower", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 614, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 505, + 627 + ], + "score": 1.0, + "content": "than the off-policy algorithms and we thus indicate the asymptotic performance of each algorithm", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 624, + 506, + 638 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 506, + 638 + ], + "score": 1.0, + "content": "of PPO and DDPG (which also improved significantly later during training in some instances) with a", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 636, + 506, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 506, + 649 + ], + "score": 1.0, + "content": "colored star in the plot; ii) the difference between the MPO results and the (expected) policy gradient", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 646, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 505, + 661 + ], + "score": 1.0, + "content": "(EPG) with entropy regularisation confirm our suspicion from Section 5.1.1: finding a good setting", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 657, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 505, + 671 + ], + "score": 1.0, + "content": "for the entropy regulariser that transfers across environments without additional constraints on the", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 669, + 506, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 506, + 681 + ], + "score": 1.0, + "content": "policy distribution is very difficult, leading to instabilities in the learning curves. In contrast to this", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 679, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 679, + 505, + 693 + ], + "score": 1.0, + "content": "the MPO results appear to be stable across all environments; iii) Finally, in terms of data-efficiency", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 691, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 505, + 703 + ], + "score": 1.0, + "content": "the methods utilising Retrace obtain a clear advantage over DDPG. The single learner vanilla DDPG", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 702, + 505, + 714 + ], + "spans": [ + { + "bbox": [ + 106, + 702, + 505, + 714 + ], + "score": 1.0, + "content": "implementation learns the lower dimensional environments quickly but suffers in terms of learning", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 37.5 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 116, + 721, + 471, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 719, + 472, + 734 + ], + "spans": [ + { + "bbox": [ + 118, + 719, + 288, + 734 + ], + "score": 1.0, + "content": "3We note that we use a value function baseline", + "type": "text" + }, + { + "bbox": [ + 289, + 722, + 331, + 732 + ], + "score": 0.89, + "content": "\\mathbb { E } _ { \\pi } [ Q ( s , \\cdot ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 719, + 472, + 734 + ], + "score": 1.0, + "content": "in this setup. See appendix for details.", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 12, + "width": 9 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 83, + 505, + 280 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "As a first observation, we can see that MPO gives stable learning on all tasks and, thanks to its", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "fully off-policy implementation, is significantly more sample efficient than the on-policy PPO base-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "score": 1.0, + "content": "line. Furthermore, we can observe that changing from the non-parametric variational distribution", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "to a parametric distribution3 (which, as described above, can be related to PPO) results in only a", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 504, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 504, + 139 + ], + "score": 1.0, + "content": "minor asymptotic performance loss but slowed down optimisation and thus hampered sample effi-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 358, + 150 + ], + "score": 1.0, + "content": "ciency; which can be attributed to the fact that the parametric", + "type": "text" + }, + { + "bbox": [ + 358, + 139, + 365, + 149 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 137, + 505, + 150 + ], + "score": 1.0, + "content": "distribution required a stricter KL", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 148, + 506, + 161 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 506, + 161 + ], + "score": 1.0, + "content": "constraint. Removing the automatically tuned KL constraint and replacing it with a manually set", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 159, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 506, + 172 + ], + "score": 1.0, + "content": "entropy regulariser then yields an off-policy actor-critic method with Retrace. This policy gradient", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 170, + 506, + 182 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 506, + 182 + ], + "score": 1.0, + "content": "method still uses the idea of estimating the integral over actions – and thus, for a gradient based", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 181, + 505, + 193 + ], + "spans": [ + { + "bbox": [ + 106, + 181, + 505, + 193 + ], + "score": 1.0, + "content": "optimiser, its likelihood ratio derivative – via multiple action samples (as judged by a Q-Retrace", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 192, + 506, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 506, + 205 + ], + "score": 1.0, + "content": "critic). This idea has previously been coined as using the expected policy gradient (EPG) (Ciosek", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 203, + 505, + 215 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 433, + 215 + ], + "score": 1.0, + "content": "& Whiteson, 2017) and we hence denote the corresponding algorithm with EPG", + "type": "text" + }, + { + "bbox": [ + 433, + 204, + 442, + 213 + ], + "score": 0.61, + "content": "^ +", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 203, + 505, + 215 + ], + "score": 1.0, + "content": "Retrace, which", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 213, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 213, + 338, + 226 + ], + "score": 1.0, + "content": "no-longer follows the intuitions of the MPO perspective.", + "type": "text" + }, + { + "bbox": [ + 338, + 214, + 370, + 225 + ], + "score": 0.26, + "content": "\\mathrm { E P G } + .", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 213, + 505, + 226 + ], + "score": 1.0, + "content": "Retrace performed well when the", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 224, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 224, + 505, + 239 + ], + "score": 1.0, + "content": "correct entropy regularisation scale is used. This, however, required task specific tuning (c.f. Fig-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 236, + 505, + 248 + ], + "spans": [ + { + "bbox": [ + 106, + 236, + 505, + 248 + ], + "score": 1.0, + "content": "ure 4 where this hyperparameter was set to the one that performed best in average across tasks).", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 247, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 505, + 260 + ], + "score": 1.0, + "content": "Finally using only a single sample to estimate the integral (and hence the likelihood ratio gradient)", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 258, + 505, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 505, + 271 + ], + "score": 1.0, + "content": "results in an actor-critic variant with Retrace that is the least performant off-policy algorithm in our", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 270, + 158, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 158, + 282 + ], + "score": 1.0, + "content": "comparison.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 82, + 506, + 282 + ] + }, + { + "type": "image", + "bbox": [ + 105, + 337, + 506, + 451 + ], + "blocks": [ + { + "type": "image_caption", + "bbox": [ + 107, + 299, + 503, + 332 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 299, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 106, + 299, + 505, + 312 + ], + "score": 1.0, + "content": "Figure 2: Ablation study of the MPO algorithm and comparison to common baselines from the liter-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 310, + 505, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 310, + 505, + 323 + ], + "score": 1.0, + "content": "ature on three domains from the control suite. We plot the median performance over 10 experiments", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 321, + 222, + 333 + ], + "spans": [ + { + "bbox": [ + 106, + 321, + 222, + 333 + ], + "score": 1.0, + "content": "with different random seeds.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "image_body", + "bbox": [ + 105, + 337, + 506, + 451 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 337, + 506, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 506, + 451 + ], + "score": 0.968, + "type": "image", + "image_path": "c77b362823bc448bf6268c862a2c6ae8c0cbe92c11eed9cb0fed52cbb3223fbf.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 105, + 337, + 506, + 375.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 105, + 375.0, + 506, + 413.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 105, + 413.0, + 506, + 451.0 + ], + "spans": [], + "index": 23 + } + ] + } + ], + "index": 20.5 + }, + { + "type": "title", + "bbox": [ + 109, + 480, + 331, + 490 + ], + "lines": [ + { + "bbox": [ + 106, + 479, + 333, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 333, + 491 + ], + "score": 1.0, + "content": "5.1.2 COMPLETE RESULTS ON THE CONTROL SUITE", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 498, + 505, + 576 + ], + "lines": [ + { + "bbox": [ + 106, + 498, + 505, + 511 + ], + "spans": [ + { + "bbox": [ + 106, + 498, + 505, + 511 + ], + "score": 1.0, + "content": "The results for MPO (non-parameteric) – and a comparison to an implementation of state-of-the-art", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 510, + 506, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 510, + 506, + 522 + ], + "score": 1.0, + "content": "algorithms from the literature in our framework – on all the environments from the control suite that", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 521, + 504, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 521, + 504, + 532 + ], + "score": 1.0, + "content": "we tested on are shown in Figure 4. All tasks have rewards that are scaled to be between 0 and 1000.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 532, + 504, + 543 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 504, + 543 + ], + "score": 1.0, + "content": "We note that in order to ensure a fair comparison all algorithms ran with exactly the same network", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 541, + 506, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 506, + 556 + ], + "score": 1.0, + "content": "configuration, used a single learner (no distributed computation), used the same optimizer and were", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 554, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 106, + 554, + 505, + 565 + ], + "score": 1.0, + "content": "tuned w.r.t. their hyperparameters for best performance across all tasks. We refer to the appendix for", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 564, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 505, + 578 + ], + "score": 1.0, + "content": "a complete description of the hyperparameters. Our comparison is made in terms of data-efficiency.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 498, + 506, + 578 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 581, + 505, + 713 + ], + "lines": [ + { + "bbox": [ + 105, + 581, + 505, + 594 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 505, + 594 + ], + "score": 1.0, + "content": "From the plot a few trends are readily apparent: i) We can clearly observe the advantage in terms", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 593, + 506, + 605 + ], + "spans": [ + { + "bbox": [ + 105, + 593, + 506, + 605 + ], + "score": 1.0, + "content": "of data-efficiency that methods relying on a Q-critic obtain over the PPO baseline. This difference", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 603, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 603, + 505, + 616 + ], + "score": 1.0, + "content": "is so extreme that in several instances the PPO baseline converges an order of magnitude slower", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 614, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 505, + 627 + ], + "score": 1.0, + "content": "than the off-policy algorithms and we thus indicate the asymptotic performance of each algorithm", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 624, + 506, + 638 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 506, + 638 + ], + "score": 1.0, + "content": "of PPO and DDPG (which also improved significantly later during training in some instances) with a", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 636, + 506, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 506, + 649 + ], + "score": 1.0, + "content": "colored star in the plot; ii) the difference between the MPO results and the (expected) policy gradient", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 646, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 505, + 661 + ], + "score": 1.0, + "content": "(EPG) with entropy regularisation confirm our suspicion from Section 5.1.1: finding a good setting", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 657, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 505, + 671 + ], + "score": 1.0, + "content": "for the entropy regulariser that transfers across environments without additional constraints on the", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 669, + 506, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 506, + 681 + ], + "score": 1.0, + "content": "policy distribution is very difficult, leading to instabilities in the learning curves. In contrast to this", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 679, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 679, + 505, + 693 + ], + "score": 1.0, + "content": "the MPO results appear to be stable across all environments; iii) Finally, in terms of data-efficiency", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 691, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 505, + 703 + ], + "score": 1.0, + "content": "the methods utilising Retrace obtain a clear advantage over DDPG. The single learner vanilla DDPG", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 702, + 505, + 714 + ], + "spans": [ + { + "bbox": [ + 106, + 702, + 505, + 714 + ], + "score": 1.0, + "content": "implementation learns the lower dimensional environments quickly but suffers in terms of learning", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 83, + 504, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 504, + 95 + ], + "score": 1.0, + "content": "speed in environments with sparse rewards (finger, acrobot) and higher dimensional action spaces.", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "Overall, MPO is able to solve all environments using surprisingly moderate amounts of data. On", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 486, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 262, + 118 + ], + "score": 1.0, + "content": "average less than 1000 trajectories (or", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 262, + 104, + 278, + 115 + ], + "score": 0.87, + "content": "1 0 ^ { 6 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 279, + 104, + 486, + 118 + ], + "score": 1.0, + "content": "samples) are needed to reach the best performance.", + "type": "text", + "cross_page": true + } + ], + "index": 2 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 581, + 506, + 714 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 504, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 504, + 95 + ], + "score": 1.0, + "content": "speed in environments with sparse rewards (finger, acrobot) and higher dimensional action spaces.", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "Overall, MPO is able to solve all environments using surprisingly moderate amounts of data. On", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 486, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 262, + 118 + ], + "score": 1.0, + "content": "average less than 1000 trajectories (or", + "type": "text" + }, + { + "bbox": [ + 262, + 104, + 278, + 115 + ], + "score": 0.87, + "content": "1 0 ^ { 6 }", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 104, + 486, + 118 + ], + "score": 1.0, + "content": "samples) are needed to reach the best performance.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "title", + "bbox": [ + 107, + 135, + 322, + 145 + ], + "lines": [ + { + "bbox": [ + 105, + 134, + 323, + 147 + ], + "spans": [ + { + "bbox": [ + 105, + 134, + 323, + 147 + ], + "score": 1.0, + "content": "5.2 HIGH-DIMENSIONAL CONTINUOUS CONTROL", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 156, + 505, + 234 + ], + "lines": [ + { + "bbox": [ + 105, + 155, + 505, + 170 + ], + "spans": [ + { + "bbox": [ + 105, + 155, + 505, + 170 + ], + "score": 1.0, + "content": "Next we turn to evaluating our algorithm on two higher-dimensional continuous control problems;", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 168, + 506, + 180 + ], + "spans": [ + { + "bbox": [ + 105, + 168, + 506, + 180 + ], + "score": 1.0, + "content": "humanoid and walker. To make computation time bearable in these more complicated domains we", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 178, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 106, + 178, + 505, + 191 + ], + "score": 1.0, + "content": "utilize a parallel variant of our algorithm: in this implementation K learners are all independently", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 190, + 505, + 202 + ], + "spans": [ + { + "bbox": [ + 105, + 190, + 505, + 202 + ], + "score": 1.0, + "content": "collecting data from an instance of the environment. Updates are performed at the end of each", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 201, + 506, + 213 + ], + "spans": [ + { + "bbox": [ + 105, + 201, + 506, + 213 + ], + "score": 1.0, + "content": "collected trajectory using distributed synchronous gradient descent on a shared set of policy and", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 212, + 505, + 224 + ], + "spans": [ + { + "bbox": [ + 105, + 212, + 505, + 224 + ], + "score": 1.0, + "content": "Q-function parameters (we refer to the appendix for an algorithm description). The results of this", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 223, + 253, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 253, + 235 + ], + "score": 1.0, + "content": "experiment are depicted in Figure 3.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 108, + 239, + 503, + 273 + ], + "lines": [ + { + "bbox": [ + 106, + 240, + 504, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 240, + 504, + 252 + ], + "score": 1.0, + "content": "For the Humanoid running domain we can observe a similar trend to the experiments from the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 250, + 505, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 505, + 263 + ], + "score": 1.0, + "content": "previous section: MPO quickly finds a stable running policy, outperforming all other algorithms in", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 261, + 401, + 274 + ], + "spans": [ + { + "bbox": [ + 106, + 261, + 401, + 274 + ], + "score": 1.0, + "content": "terms of sample efficiency also in this high-dimensional control problem.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 278, + 505, + 355 + ], + "lines": [ + { + "bbox": [ + 105, + 277, + 506, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 506, + 291 + ], + "score": 1.0, + "content": "The case for the Walker-2D parkour domain (where we compare against a PPO baseline) is even", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 288, + 504, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 504, + 302 + ], + "score": 1.0, + "content": "more striking: where standard PPO requires approximately 1M trajectories to find a good policy", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 300, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 505, + 312 + ], + "score": 1.0, + "content": "MPO finds a solution that is asymptotically no worse than the PPO solution in in about 70k tra-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 311, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 104, + 311, + 505, + 324 + ], + "score": 1.0, + "content": "jectories (or 60M samples), resulting in an order of magnitude improvement. In addition to the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 322, + 505, + 335 + ], + "spans": [ + { + "bbox": [ + 106, + 322, + 505, + 335 + ], + "score": 1.0, + "content": "walker experiment we have also evaluated MPO on the Parkour domain using a humanoid body", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 333, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 505, + 345 + ], + "score": 1.0, + "content": "(with 22 degrees of freedom) which was learned successfully (not shown in the plot, please see the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 344, + 198, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 198, + 357 + ], + "score": 1.0, + "content": "supplementary video).", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17 + }, + { + "type": "image", + "bbox": [ + 312, + 401, + 463, + 523 + ], + "blocks": [ + { + "type": "image_caption", + "bbox": [ + 106, + 379, + 505, + 400 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 377, + 505, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 377, + 505, + 393 + ], + "score": 1.0, + "content": "Figure 3: MPO on high-dimensional control problems (Parkour Walker2D and Humanoid walking", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 389, + 186, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 186, + 402 + ], + "score": 1.0, + "content": "from control suite).", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "image_body", + "bbox": [ + 312, + 401, + 463, + 523 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 312, + 401, + 463, + 523 + ], + "spans": [ + { + "bbox": [ + 312, + 401, + 463, + 523 + ], + "score": 0.942, + "type": "image", + "image_path": "3f0db1cdbd6cb97bb8fdb4b7ec7943a5ae55699354d37055db91d206400596e2.jpg" + } + ] + } + ], + "index": 25.0, + "virtual_lines": [ + { + "bbox": [ + 312, + 401, + 463, + 462.0 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 312, + 462.0, + 463, + 523.0 + ], + "spans": [], + "index": 26 + } + ] + } + ], + "index": 23.25 + }, + { + "type": "image", + "bbox": [ + 144, + 402, + 280, + 509 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 144, + 402, + 280, + 509 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 144, + 402, + 280, + 509 + ], + "spans": [ + { + "bbox": [ + 144, + 402, + 280, + 509 + ], + "score": 0.95, + "type": "image", + "image_path": "b39b3f4bf39eeac87f2d9d9433c59fe69a73415f4747eb95d2ef18eb773ea4b6.jpg" + } + ] + } + ], + "index": 24.0, + "virtual_lines": [ + { + "bbox": [ + 144, + 402, + 280, + 455.5 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 144, + 455.5, + 280, + 509.0 + ], + "spans": [], + "index": 25 + } + ] + } + ], + "index": 24.0 + }, + { + "type": "title", + "bbox": [ + 107, + 550, + 218, + 561 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 219, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 219, + 563 + ], + "score": 1.0, + "content": "5.3 DISCRETE CONTROL", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 572, + 505, + 617 + ], + "lines": [ + { + "bbox": [ + 106, + 573, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 573, + 505, + 585 + ], + "score": 1.0, + "content": "As a proof of concept – showcasing the robustness of our algorithm and its hyperparameters – we", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 583, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 597 + ], + "score": 1.0, + "content": "performed an experiment on a subset of the games contained contained in the \"Arcade Learning", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 595, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 505, + 607 + ], + "score": 1.0, + "content": "Environment\" (ALE) where we used the same hyperparameter settings for the KL constraints as for", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 606, + 496, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 606, + 496, + 618 + ], + "score": 1.0, + "content": "the continuous control experiments. The results of this experiment can be found in the Appendix.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 29.5 + }, + { + "type": "title", + "bbox": [ + 107, + 637, + 195, + 650 + ], + "lines": [ + { + "bbox": [ + 105, + 636, + 197, + 653 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 197, + 653 + ], + "score": 1.0, + "content": "6 CONCLUSION", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 107, + 666, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "We have presented a new off-policy reinforcement learning algorithm called Maximum a-posteriori", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "Policy Optimisation (MPO). The algorithm is motivated by the connection between RL and infer-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 686, + 506, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 506, + 702 + ], + "score": 1.0, + "content": "ence and it consists of an alternating optimisation scheme that has a direct relation to several existing", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "algorithms from the literature. Overall, we arrive at a novel, off-policy algorithm that is highly data", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "score": 1.0, + "content": "efficient, robust to hyperparameter choices and applicable to complex control problems. We demon-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 721, + 424, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 424, + 732 + ], + "score": 1.0, + "content": "strated the effectiveness of MPO on a large set of continuous control problems.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 35.5 + } + ], + "page_idx": 8, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "9", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 116 + ], + "lines": [], + "index": 1, + "bbox_fs": [ + 105, + 83, + 505, + 118 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 107, + 135, + 322, + 145 + ], + "lines": [ + { + "bbox": [ + 105, + 134, + 323, + 147 + ], + "spans": [ + { + "bbox": [ + 105, + 134, + 323, + 147 + ], + "score": 1.0, + "content": "5.2 HIGH-DIMENSIONAL CONTINUOUS CONTROL", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 156, + 505, + 234 + ], + "lines": [ + { + "bbox": [ + 105, + 155, + 505, + 170 + ], + "spans": [ + { + "bbox": [ + 105, + 155, + 505, + 170 + ], + "score": 1.0, + "content": "Next we turn to evaluating our algorithm on two higher-dimensional continuous control problems;", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 168, + 506, + 180 + ], + "spans": [ + { + "bbox": [ + 105, + 168, + 506, + 180 + ], + "score": 1.0, + "content": "humanoid and walker. To make computation time bearable in these more complicated domains we", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 178, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 106, + 178, + 505, + 191 + ], + "score": 1.0, + "content": "utilize a parallel variant of our algorithm: in this implementation K learners are all independently", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 190, + 505, + 202 + ], + "spans": [ + { + "bbox": [ + 105, + 190, + 505, + 202 + ], + "score": 1.0, + "content": "collecting data from an instance of the environment. Updates are performed at the end of each", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 201, + 506, + 213 + ], + "spans": [ + { + "bbox": [ + 105, + 201, + 506, + 213 + ], + "score": 1.0, + "content": "collected trajectory using distributed synchronous gradient descent on a shared set of policy and", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 212, + 505, + 224 + ], + "spans": [ + { + "bbox": [ + 105, + 212, + 505, + 224 + ], + "score": 1.0, + "content": "Q-function parameters (we refer to the appendix for an algorithm description). The results of this", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 223, + 253, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 253, + 235 + ], + "score": 1.0, + "content": "experiment are depicted in Figure 3.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 155, + 506, + 235 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 239, + 503, + 273 + ], + "lines": [ + { + "bbox": [ + 106, + 240, + 504, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 240, + 504, + 252 + ], + "score": 1.0, + "content": "For the Humanoid running domain we can observe a similar trend to the experiments from the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 250, + 505, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 505, + 263 + ], + "score": 1.0, + "content": "previous section: MPO quickly finds a stable running policy, outperforming all other algorithms in", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 261, + 401, + 274 + ], + "spans": [ + { + "bbox": [ + 106, + 261, + 401, + 274 + ], + "score": 1.0, + "content": "terms of sample efficiency also in this high-dimensional control problem.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 240, + 505, + 274 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 278, + 505, + 355 + ], + "lines": [ + { + "bbox": [ + 105, + 277, + 506, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 506, + 291 + ], + "score": 1.0, + "content": "The case for the Walker-2D parkour domain (where we compare against a PPO baseline) is even", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 288, + 504, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 504, + 302 + ], + "score": 1.0, + "content": "more striking: where standard PPO requires approximately 1M trajectories to find a good policy", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 300, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 505, + 312 + ], + "score": 1.0, + "content": "MPO finds a solution that is asymptotically no worse than the PPO solution in in about 70k tra-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 311, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 104, + 311, + 505, + 324 + ], + "score": 1.0, + "content": "jectories (or 60M samples), resulting in an order of magnitude improvement. In addition to the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 322, + 505, + 335 + ], + "spans": [ + { + "bbox": [ + 106, + 322, + 505, + 335 + ], + "score": 1.0, + "content": "walker experiment we have also evaluated MPO on the Parkour domain using a humanoid body", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 333, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 505, + 345 + ], + "score": 1.0, + "content": "(with 22 degrees of freedom) which was learned successfully (not shown in the plot, please see the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 344, + 198, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 198, + 357 + ], + "score": 1.0, + "content": "supplementary video).", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17, + "bbox_fs": [ + 104, + 277, + 506, + 357 + ] + }, + { + "type": "image", + "bbox": [ + 312, + 401, + 463, + 523 + ], + "blocks": [ + { + "type": "image_caption", + "bbox": [ + 106, + 379, + 505, + 400 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 377, + 505, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 377, + 505, + 393 + ], + "score": 1.0, + "content": "Figure 3: MPO on high-dimensional control problems (Parkour Walker2D and Humanoid walking", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 389, + 186, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 186, + 402 + ], + "score": 1.0, + "content": "from control suite).", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "image_body", + "bbox": [ + 312, + 401, + 463, + 523 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 312, + 401, + 463, + 523 + ], + "spans": [ + { + "bbox": [ + 312, + 401, + 463, + 523 + ], + "score": 0.942, + "type": "image", + "image_path": "3f0db1cdbd6cb97bb8fdb4b7ec7943a5ae55699354d37055db91d206400596e2.jpg" + } + ] + } + ], + "index": 25.0, + "virtual_lines": [ + { + "bbox": [ + 312, + 401, + 463, + 462.0 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 312, + 462.0, + 463, + 523.0 + ], + "spans": [], + "index": 26 + } + ] + } + ], + "index": 23.25 + }, + { + "type": "image", + "bbox": [ + 144, + 402, + 280, + 509 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 144, + 402, + 280, + 509 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 144, + 402, + 280, + 509 + ], + "spans": [ + { + "bbox": [ + 144, + 402, + 280, + 509 + ], + "score": 0.95, + "type": "image", + "image_path": "b39b3f4bf39eeac87f2d9d9433c59fe69a73415f4747eb95d2ef18eb773ea4b6.jpg" + } + ] + } + ], + "index": 24.0, + "virtual_lines": [ + { + "bbox": [ + 144, + 402, + 280, + 455.5 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 144, + 455.5, + 280, + 509.0 + ], + "spans": [], + "index": 25 + } + ] + } + ], + "index": 24.0 + }, + { + "type": "title", + "bbox": [ + 107, + 550, + 218, + 561 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 219, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 219, + 563 + ], + "score": 1.0, + "content": "5.3 DISCRETE CONTROL", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 572, + 505, + 617 + ], + "lines": [ + { + "bbox": [ + 106, + 573, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 573, + 505, + 585 + ], + "score": 1.0, + "content": "As a proof of concept – showcasing the robustness of our algorithm and its hyperparameters – we", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 583, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 597 + ], + "score": 1.0, + "content": "performed an experiment on a subset of the games contained contained in the \"Arcade Learning", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 595, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 505, + 607 + ], + "score": 1.0, + "content": "Environment\" (ALE) where we used the same hyperparameter settings for the KL constraints as for", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 606, + 496, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 606, + 496, + 618 + ], + "score": 1.0, + "content": "the continuous control experiments. The results of this experiment can be found in the Appendix.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 29.5, + "bbox_fs": [ + 105, + 573, + 505, + 618 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 637, + 195, + 650 + ], + "lines": [ + { + "bbox": [ + 105, + 636, + 197, + 653 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 197, + 653 + ], + "score": 1.0, + "content": "6 CONCLUSION", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 107, + 666, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "We have presented a new off-policy reinforcement learning algorithm called Maximum a-posteriori", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "Policy Optimisation (MPO). The algorithm is motivated by the connection between RL and infer-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 686, + 506, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 506, + 702 + ], + "score": 1.0, + "content": "ence and it consists of an alternating optimisation scheme that has a direct relation to several existing", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "algorithms from the literature. Overall, we arrive at a novel, off-policy algorithm that is highly data", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "score": 1.0, + "content": "efficient, robust to hyperparameter choices and applicable to complex control problems. We demon-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 721, + 424, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 424, + 732 + ], + "score": 1.0, + "content": "strated the effectiveness of MPO on a large set of continuous control problems.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 665, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 119, + 131, + 491, + 704 + ], + "blocks": [ + { + "type": "image_caption", + "bbox": [ + 106, + 89, + 506, + 132 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 88, + 505, + 102 + ], + "spans": [ + { + "bbox": [ + 106, + 88, + 505, + 102 + ], + "score": 1.0, + "content": "Figure 4: Complete comparison of results for the control suite. We plot the median performance", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 100, + 504, + 112 + ], + "spans": [ + { + "bbox": [ + 106, + 100, + 280, + 112 + ], + "score": 1.0, + "content": "over 10 random seeds together with 5 and", + "type": "text" + }, + { + "bbox": [ + 280, + 100, + 303, + 111 + ], + "score": 0.85, + "content": "95 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 100, + 504, + 112 + ], + "score": 1.0, + "content": "quantiles (shaded area). Note that for DDPG we", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 110, + 506, + 124 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 506, + 124 + ], + "score": 1.0, + "content": "only plot the median to avoid clutter in the plots. For DDPG and PPO final performance is marked", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 122, + 149, + 135 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 149, + 135 + ], + "score": 1.0, + "content": "by a star).", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "image_body", + "bbox": [ + 119, + 131, + 491, + 704 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 119, + 131, + 491, + 704 + ], + "spans": [ + { + "bbox": [ + 119, + 131, + 491, + 704 + ], + "score": 0.965, + "type": "image", + "image_path": "1fb493111520008f89fe9fd5525df44f3315390e08daaf3a2e48f3e75e24a2a1.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 119, + 131, + 491, + 322.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 119, + 322.0, + 491, + 513.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 119, + 513.0, + 491, + 704.0 + ], + "spans": [], + "index": 6 + } + ] + } + ], + "index": 3.25 + } + ], + "page_idx": 9, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 752, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 14 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 119, + 131, + 491, + 704 + ], + "blocks": [ + { + "type": "image_caption", + "bbox": [ + 106, + 89, + 506, + 132 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 88, + 505, + 102 + ], + "spans": [ + { + "bbox": [ + 106, + 88, + 505, + 102 + ], + "score": 1.0, + "content": "Figure 4: Complete comparison of results for the control suite. We plot the median performance", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 100, + 504, + 112 + ], + "spans": [ + { + "bbox": [ + 106, + 100, + 280, + 112 + ], + "score": 1.0, + "content": "over 10 random seeds together with 5 and", + "type": "text" + }, + { + "bbox": [ + 280, + 100, + 303, + 111 + ], + "score": 0.85, + "content": "95 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 100, + 504, + 112 + ], + "score": 1.0, + "content": "quantiles (shaded area). Note that for DDPG we", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 110, + 506, + 124 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 506, + 124 + ], + "score": 1.0, + "content": "only plot the median to avoid clutter in the plots. For DDPG and PPO final performance is marked", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 122, + 149, + 135 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 149, + 135 + ], + "score": 1.0, + "content": "by a star).", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "image_body", + "bbox": [ + 119, + 131, + 491, + 704 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 119, + 131, + 491, + 704 + ], + "spans": [ + { + "bbox": [ + 119, + 131, + 491, + 704 + ], + "score": 0.965, + "type": "image", + "image_path": "1fb493111520008f89fe9fd5525df44f3315390e08daaf3a2e48f3e75e24a2a1.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 119, + 131, + 491, + 322.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 119, + 322.0, + 491, + 513.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 119, + 513.0, + 491, + 704.0 + ], + "spans": [], + "index": 6 + } + ] + } + ], + "index": 3.25 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 82, + 176, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 176, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 176, + 95 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 108, + 100, + 504, + 134 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 505, + 114 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 505, + 114 + ], + "score": 1.0, + "content": "Abbas Abdolmaleki, Bob Price, Nuno Lau, Luis Paulo Reis, Gerhard Neumann, et al. Deriving", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 112, + 505, + 124 + ], + "spans": [ + { + "bbox": [ + 116, + 112, + 505, + 124 + ], + "score": 1.0, + "content": "and improving cma-es with information geometric trust regions. Proceedings of the Genetic and", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 122, + 301, + 135 + ], + "spans": [ + { + "bbox": [ + 116, + 122, + 301, + 135 + ], + "score": 1.0, + "content": "Evolutionary Computation Conference, 2017.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 105, + 142, + 504, + 165 + ], + "lines": [ + { + "bbox": [ + 106, + 142, + 505, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 142, + 505, + 155 + ], + "score": 1.0, + "content": "Marcin Andrychowicz, Filip Wolski, Alex Ray, Jonas Schneider, Rachel Fong, Peter Welinder, Bob", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 154, + 503, + 167 + ], + "spans": [ + { + "bbox": [ + 116, + 154, + 503, + 167 + ], + "score": 1.0, + "content": "McGrew, Josh Tobin, Pieter Abbeel, and Wojciech Zaremba. Hindsight experience replay, 2017.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 106, + 173, + 503, + 197 + ], + "lines": [ + { + "bbox": [ + 106, + 173, + 504, + 187 + ], + "spans": [ + { + "bbox": [ + 106, + 173, + 504, + 187 + ], + "score": 1.0, + "content": "Trapit Bansal, Jakub Pachocki, Szymon Sidor, Ilya Sutskever, and Igor Mordatch. Emergent com-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 185, + 288, + 197 + ], + "spans": [ + { + "bbox": [ + 115, + 185, + 288, + 197 + ], + "score": 1.0, + "content": "plexity via multi-agent competition, 2017.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 107, + 205, + 504, + 228 + ], + "lines": [ + { + "bbox": [ + 105, + 205, + 505, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 205, + 505, + 218 + ], + "score": 1.0, + "content": "Marc G. Bellemare, Will Dabney, and Rémi Munos. A distributional perspective on reinforcement", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 117, + 217, + 505, + 229 + ], + "spans": [ + { + "bbox": [ + 117, + 217, + 505, + 229 + ], + "score": 1.0, + "content": "learning. In Proceedings of the 34th International Conference on Machine Learning, ICML, 2017.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 106, + 236, + 503, + 259 + ], + "lines": [ + { + "bbox": [ + 106, + 236, + 504, + 250 + ], + "spans": [ + { + "bbox": [ + 106, + 236, + 504, + 250 + ], + "score": 1.0, + "content": "Yevgen Chebotar, Mrinal Kalakrishnan, Ali Yahya, Adrian Li, Stefan Schaal, and Sergey Levine.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 247, + 379, + 260 + ], + "spans": [ + { + "bbox": [ + 116, + 247, + 379, + 260 + ], + "score": 1.0, + "content": "Path integral guided policy search. CoRR, abs/1610.00529, 2016.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 106, + 267, + 490, + 280 + ], + "lines": [ + { + "bbox": [ + 106, + 266, + 490, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 266, + 490, + 281 + ], + "score": 1.0, + "content": "Kamil Ciosek and Shimon Whiteson. Expected policy gradients. CoRR, abs/1706.05374, 2017.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 288, + 504, + 311 + ], + "lines": [ + { + "bbox": [ + 105, + 287, + 504, + 301 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 504, + 301 + ], + "score": 1.0, + "content": "C. Daniel, G. Neumann, O. Kroemer, and J. Peters. Hierarchical relative entropy policy search.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 300, + 336, + 311 + ], + "spans": [ + { + "bbox": [ + 116, + 300, + 336, + 311 + ], + "score": 1.0, + "content": "Journal of Machine Learning Research (JMLR), 2016.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 104, + 319, + 504, + 343 + ], + "lines": [ + { + "bbox": [ + 104, + 317, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 104, + 317, + 505, + 334 + ], + "score": 1.0, + "content": "Peter Dayan and Geoffrey E Hinton. Using expectation-maximization for reinforcement learning.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 330, + 288, + 343 + ], + "spans": [ + { + "bbox": [ + 115, + 330, + 288, + 343 + ], + "score": 1.0, + "content": "Neural Computation, 9(2):271–278, 1997.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 105, + 351, + 503, + 374 + ], + "lines": [ + { + "bbox": [ + 105, + 350, + 505, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 350, + 505, + 364 + ], + "score": 1.0, + "content": "Marc Peter Deisenroth, Gerhard Neumann, Jan Peters, et al. A survey on policy search for robotics.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 361, + 348, + 374 + ], + "spans": [ + { + "bbox": [ + 115, + 361, + 348, + 374 + ], + "score": 1.0, + "content": "Foundations and Trends in Robotics, 2(1-2):1–142, 2013.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 106, + 381, + 505, + 438 + ], + "lines": [ + { + "bbox": [ + 106, + 380, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 505, + 396 + ], + "score": 1.0, + "content": "Yan Duan, Xi Chen, Rein Houthooft, John Schulman, and Pieter Abbeel. Benchmarking deep", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 393, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 115, + 393, + 505, + 406 + ], + "score": 1.0, + "content": "reinforcement learning for continuous control. In Proceedings of the 33rd International Con-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 404, + 504, + 416 + ], + "spans": [ + { + "bbox": [ + 115, + 404, + 504, + 416 + ], + "score": 1.0, + "content": "ference on International Conference on Machine Learning - Volume 48, ICML’16, pp. 1329–", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 114, + 414, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 114, + 414, + 449, + 428 + ], + "score": 1.0, + "content": "1338. JMLR.org, 2016. URL http://dl.acm.org/citation.cfm?id", + "type": "text" + }, + { + "bbox": [ + 450, + 416, + 456, + 425 + ], + "score": 0.26, + "content": "=", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 414, + 505, + 428 + ], + "score": 1.0, + "content": "3045390.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 426, + 163, + 437 + ], + "spans": [ + { + "bbox": [ + 116, + 426, + 163, + 437 + ], + "score": 1.0, + "content": "3045531.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 106, + 446, + 504, + 469 + ], + "lines": [ + { + "bbox": [ + 106, + 446, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 446, + 505, + 459 + ], + "score": 1.0, + "content": "Carlos Florensa, Yan Duan, and Pieter Abbeel. Stochastic neural networks for hierarchical rein-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 457, + 320, + 469 + ], + "spans": [ + { + "bbox": [ + 116, + 457, + 320, + 469 + ], + "score": 1.0, + "content": "forcement learning. CoRR, abs/1704.03012, 2017.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 107, + 477, + 503, + 511 + ], + "lines": [ + { + "bbox": [ + 105, + 477, + 505, + 490 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 505, + 490 + ], + "score": 1.0, + "content": "Roy Fox, Ari Pakman, and Naftali Tishby. Taming the noise in reinforcement learning via soft", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 489, + 505, + 501 + ], + "spans": [ + { + "bbox": [ + 116, + 489, + 505, + 501 + ], + "score": 1.0, + "content": "updates. In Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 500, + 163, + 511 + ], + "spans": [ + { + "bbox": [ + 116, + 500, + 163, + 511 + ], + "score": 1.0, + "content": "UAI, 2016.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 104, + 519, + 504, + 543 + ], + "lines": [ + { + "bbox": [ + 106, + 520, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 520, + 505, + 533 + ], + "score": 1.0, + "content": "Shixiang Gu, Ethan Holly, Timothy Lillicrap, and Sergey Levine. Deep reinforcement learning for", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 531, + 372, + 543 + ], + "spans": [ + { + "bbox": [ + 115, + 531, + 372, + 543 + ], + "score": 1.0, + "content": "robotic manipulation. arXiv preprint arXiv:1610.00633, 2016a.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 106, + 551, + 504, + 574 + ], + "lines": [ + { + "bbox": [ + 106, + 552, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 106, + 552, + 505, + 564 + ], + "score": 1.0, + "content": "Shixiang Gu, Tim Lillicrap, Ilya Sutskever, and Sergey Levine. Continuous deep q-learning with", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 562, + 492, + 575 + ], + "spans": [ + { + "bbox": [ + 116, + 562, + 492, + 575 + ], + "score": 1.0, + "content": "model-based acceleration. In International Conference on Machine Learning (ICML), 2016b.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 107, + 582, + 505, + 617 + ], + "lines": [ + { + "bbox": [ + 105, + 581, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 505, + 596 + ], + "score": 1.0, + "content": "Shixiang Gu, Timothy Lillicrap, Zoubin Ghahramani, Richard E. Turner, and Sergey Levine. Q-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 594, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 115, + 594, + 505, + 607 + ], + "score": 1.0, + "content": "prop: Sample-efficient policy gradient with an off-policy critic. In 5th International Conference", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 605, + 293, + 617 + ], + "spans": [ + { + "bbox": [ + 116, + 605, + 293, + 617 + ], + "score": 1.0, + "content": "on Learning Representations (ICLR), 2017.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 105, + 624, + 505, + 648 + ], + "lines": [ + { + "bbox": [ + 105, + 624, + 505, + 638 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 505, + 638 + ], + "score": 1.0, + "content": "Tuomas Haarnoja, Haoran Tang, Pieter Abbeel, and Sergey Levine. Reinforcement learning with", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 636, + 353, + 648 + ], + "spans": [ + { + "bbox": [ + 116, + 636, + 353, + 648 + ], + "score": 1.0, + "content": "deep energy-based policies. CoRR, abs/1702.08165, 2017.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5 + }, + { + "type": "text", + "bbox": [ + 108, + 655, + 505, + 690 + ], + "lines": [ + { + "bbox": [ + 105, + 655, + 505, + 670 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 670 + ], + "score": 1.0, + "content": "Nicolas Heess, Gregory Wayne, David Silver, Tim Lillicrap, Tom Erez, and Yuval Tassa. Learning", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 667, + 505, + 680 + ], + "spans": [ + { + "bbox": [ + 115, + 667, + 505, + 680 + ], + "score": 1.0, + "content": "continuous control policies by stochastic value gradients. In Advances in Neural Information", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 678, + 320, + 691 + ], + "spans": [ + { + "bbox": [ + 116, + 678, + 320, + 691 + ], + "score": 1.0, + "content": "Processing Systems (NIPS), pp. 2926–2934, 2015.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 107, + 699, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "Nicolas Heess, Srinivasan Sriram, Jay Lemmon, Josh Merel, Greg Wayne, Yuval Tassa, Tom Erez,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 116, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "Ziyu Wang, Ali Eslami, Martin Riedmiller, et al. Emergence of locomotion behaviours in rich", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 721, + 339, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 339, + 732 + ], + "score": 1.0, + "content": "environments. arXiv preprint arXiv:1707.02286, 2017.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42 + } + ], + "page_idx": 10, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 82, + 176, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 176, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 176, + 95 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 108, + 100, + 504, + 134 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 505, + 114 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 505, + 114 + ], + "score": 1.0, + "content": "Abbas Abdolmaleki, Bob Price, Nuno Lau, Luis Paulo Reis, Gerhard Neumann, et al. Deriving", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 112, + 505, + 124 + ], + "spans": [ + { + "bbox": [ + 116, + 112, + 505, + 124 + ], + "score": 1.0, + "content": "and improving cma-es with information geometric trust regions. Proceedings of the Genetic and", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 122, + 301, + 135 + ], + "spans": [ + { + "bbox": [ + 116, + 122, + 301, + 135 + ], + "score": 1.0, + "content": "Evolutionary Computation Conference, 2017.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 99, + 505, + 135 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 142, + 504, + 165 + ], + "lines": [ + { + "bbox": [ + 106, + 142, + 505, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 142, + 505, + 155 + ], + "score": 1.0, + "content": "Marcin Andrychowicz, Filip Wolski, Alex Ray, Jonas Schneider, Rachel Fong, Peter Welinder, Bob", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 154, + 503, + 167 + ], + "spans": [ + { + "bbox": [ + 116, + 154, + 503, + 167 + ], + "score": 1.0, + "content": "McGrew, Josh Tobin, Pieter Abbeel, and Wojciech Zaremba. Hindsight experience replay, 2017.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 106, + 142, + 505, + 167 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 173, + 503, + 197 + ], + "lines": [ + { + "bbox": [ + 106, + 173, + 504, + 187 + ], + "spans": [ + { + "bbox": [ + 106, + 173, + 504, + 187 + ], + "score": 1.0, + "content": "Trapit Bansal, Jakub Pachocki, Szymon Sidor, Ilya Sutskever, and Igor Mordatch. Emergent com-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 185, + 288, + 197 + ], + "spans": [ + { + "bbox": [ + 115, + 185, + 288, + 197 + ], + "score": 1.0, + "content": "plexity via multi-agent competition, 2017.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 106, + 173, + 504, + 197 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 205, + 504, + 228 + ], + "lines": [ + { + "bbox": [ + 105, + 205, + 505, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 205, + 505, + 218 + ], + "score": 1.0, + "content": "Marc G. Bellemare, Will Dabney, and Rémi Munos. A distributional perspective on reinforcement", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 117, + 217, + 505, + 229 + ], + "spans": [ + { + "bbox": [ + 117, + 217, + 505, + 229 + ], + "score": 1.0, + "content": "learning. In Proceedings of the 34th International Conference on Machine Learning, ICML, 2017.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 205, + 505, + 229 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 236, + 503, + 259 + ], + "lines": [ + { + "bbox": [ + 106, + 236, + 504, + 250 + ], + "spans": [ + { + "bbox": [ + 106, + 236, + 504, + 250 + ], + "score": 1.0, + "content": "Yevgen Chebotar, Mrinal Kalakrishnan, Ali Yahya, Adrian Li, Stefan Schaal, and Sergey Levine.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 247, + 379, + 260 + ], + "spans": [ + { + "bbox": [ + 116, + 247, + 379, + 260 + ], + "score": 1.0, + "content": "Path integral guided policy search. CoRR, abs/1610.00529, 2016.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 106, + 236, + 504, + 260 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 267, + 490, + 280 + ], + "lines": [ + { + "bbox": [ + 106, + 266, + 490, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 266, + 490, + 281 + ], + "score": 1.0, + "content": "Kamil Ciosek and Shimon Whiteson. Expected policy gradients. CoRR, abs/1706.05374, 2017.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 106, + 266, + 490, + 281 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 288, + 504, + 311 + ], + "lines": [ + { + "bbox": [ + 105, + 287, + 504, + 301 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 504, + 301 + ], + "score": 1.0, + "content": "C. Daniel, G. Neumann, O. Kroemer, and J. Peters. Hierarchical relative entropy policy search.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 300, + 336, + 311 + ], + "spans": [ + { + "bbox": [ + 116, + 300, + 336, + 311 + ], + "score": 1.0, + "content": "Journal of Machine Learning Research (JMLR), 2016.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 287, + 504, + 311 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 319, + 504, + 343 + ], + "lines": [ + { + "bbox": [ + 104, + 317, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 104, + 317, + 505, + 334 + ], + "score": 1.0, + "content": "Peter Dayan and Geoffrey E Hinton. Using expectation-maximization for reinforcement learning.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 330, + 288, + 343 + ], + "spans": [ + { + "bbox": [ + 115, + 330, + 288, + 343 + ], + "score": 1.0, + "content": "Neural Computation, 9(2):271–278, 1997.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 104, + 317, + 505, + 343 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 351, + 503, + 374 + ], + "lines": [ + { + "bbox": [ + 105, + 350, + 505, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 350, + 505, + 364 + ], + "score": 1.0, + "content": "Marc Peter Deisenroth, Gerhard Neumann, Jan Peters, et al. A survey on policy search for robotics.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 361, + 348, + 374 + ], + "spans": [ + { + "bbox": [ + 115, + 361, + 348, + 374 + ], + "score": 1.0, + "content": "Foundations and Trends in Robotics, 2(1-2):1–142, 2013.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 350, + 505, + 374 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 381, + 505, + 438 + ], + "lines": [ + { + "bbox": [ + 106, + 380, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 505, + 396 + ], + "score": 1.0, + "content": "Yan Duan, Xi Chen, Rein Houthooft, John Schulman, and Pieter Abbeel. Benchmarking deep", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 393, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 115, + 393, + 505, + 406 + ], + "score": 1.0, + "content": "reinforcement learning for continuous control. In Proceedings of the 33rd International Con-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 404, + 504, + 416 + ], + "spans": [ + { + "bbox": [ + 115, + 404, + 504, + 416 + ], + "score": 1.0, + "content": "ference on International Conference on Machine Learning - Volume 48, ICML’16, pp. 1329–", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 114, + 414, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 114, + 414, + 449, + 428 + ], + "score": 1.0, + "content": "1338. JMLR.org, 2016. URL http://dl.acm.org/citation.cfm?id", + "type": "text" + }, + { + "bbox": [ + 450, + 416, + 456, + 425 + ], + "score": 0.26, + "content": "=", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 414, + 505, + 428 + ], + "score": 1.0, + "content": "3045390.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 426, + 163, + 437 + ], + "spans": [ + { + "bbox": [ + 116, + 426, + 163, + 437 + ], + "score": 1.0, + "content": "3045531.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21, + "bbox_fs": [ + 106, + 380, + 505, + 437 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 446, + 504, + 469 + ], + "lines": [ + { + "bbox": [ + 106, + 446, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 446, + 505, + 459 + ], + "score": 1.0, + "content": "Carlos Florensa, Yan Duan, and Pieter Abbeel. Stochastic neural networks for hierarchical rein-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 457, + 320, + 469 + ], + "spans": [ + { + "bbox": [ + 116, + 457, + 320, + 469 + ], + "score": 1.0, + "content": "forcement learning. CoRR, abs/1704.03012, 2017.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 106, + 446, + 505, + 469 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 477, + 503, + 511 + ], + "lines": [ + { + "bbox": [ + 105, + 477, + 505, + 490 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 505, + 490 + ], + "score": 1.0, + "content": "Roy Fox, Ari Pakman, and Naftali Tishby. Taming the noise in reinforcement learning via soft", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 489, + 505, + 501 + ], + "spans": [ + { + "bbox": [ + 116, + 489, + 505, + 501 + ], + "score": 1.0, + "content": "updates. In Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 500, + 163, + 511 + ], + "spans": [ + { + "bbox": [ + 116, + 500, + 163, + 511 + ], + "score": 1.0, + "content": "UAI, 2016.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 477, + 505, + 511 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 519, + 504, + 543 + ], + "lines": [ + { + "bbox": [ + 106, + 520, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 520, + 505, + 533 + ], + "score": 1.0, + "content": "Shixiang Gu, Ethan Holly, Timothy Lillicrap, and Sergey Levine. Deep reinforcement learning for", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 531, + 372, + 543 + ], + "spans": [ + { + "bbox": [ + 115, + 531, + 372, + 543 + ], + "score": 1.0, + "content": "robotic manipulation. arXiv preprint arXiv:1610.00633, 2016a.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 106, + 520, + 505, + 543 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 551, + 504, + 574 + ], + "lines": [ + { + "bbox": [ + 106, + 552, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 106, + 552, + 505, + 564 + ], + "score": 1.0, + "content": "Shixiang Gu, Tim Lillicrap, Ilya Sutskever, and Sergey Levine. Continuous deep q-learning with", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 562, + 492, + 575 + ], + "spans": [ + { + "bbox": [ + 116, + 562, + 492, + 575 + ], + "score": 1.0, + "content": "model-based acceleration. In International Conference on Machine Learning (ICML), 2016b.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 106, + 552, + 505, + 575 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 582, + 505, + 617 + ], + "lines": [ + { + "bbox": [ + 105, + 581, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 505, + 596 + ], + "score": 1.0, + "content": "Shixiang Gu, Timothy Lillicrap, Zoubin Ghahramani, Richard E. Turner, and Sergey Levine. Q-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 594, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 115, + 594, + 505, + 607 + ], + "score": 1.0, + "content": "prop: Sample-efficient policy gradient with an off-policy critic. In 5th International Conference", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 605, + 293, + 617 + ], + "spans": [ + { + "bbox": [ + 116, + 605, + 293, + 617 + ], + "score": 1.0, + "content": "on Learning Representations (ICLR), 2017.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 581, + 505, + 617 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 624, + 505, + 648 + ], + "lines": [ + { + "bbox": [ + 105, + 624, + 505, + 638 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 505, + 638 + ], + "score": 1.0, + "content": "Tuomas Haarnoja, Haoran Tang, Pieter Abbeel, and Sergey Levine. Reinforcement learning with", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 636, + 353, + 648 + ], + "spans": [ + { + "bbox": [ + 116, + 636, + 353, + 648 + ], + "score": 1.0, + "content": "deep energy-based policies. CoRR, abs/1702.08165, 2017.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 624, + 505, + 648 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 655, + 505, + 690 + ], + "lines": [ + { + "bbox": [ + 105, + 655, + 505, + 670 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 670 + ], + "score": 1.0, + "content": "Nicolas Heess, Gregory Wayne, David Silver, Tim Lillicrap, Tom Erez, and Yuval Tassa. Learning", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 667, + 505, + 680 + ], + "spans": [ + { + "bbox": [ + 115, + 667, + 505, + 680 + ], + "score": 1.0, + "content": "continuous control policies by stochastic value gradients. In Advances in Neural Information", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 678, + 320, + 691 + ], + "spans": [ + { + "bbox": [ + 116, + 678, + 320, + 691 + ], + "score": 1.0, + "content": "Processing Systems (NIPS), pp. 2926–2934, 2015.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39, + "bbox_fs": [ + 105, + 655, + 505, + 691 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 699, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "Nicolas Heess, Srinivasan Sriram, Jay Lemmon, Josh Merel, Greg Wayne, Yuval Tassa, Tom Erez,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 116, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "Ziyu Wang, Ali Eslami, Martin Riedmiller, et al. Emergence of locomotion behaviours in rich", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 721, + 339, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 339, + 732 + ], + "score": 1.0, + "content": "environments. arXiv preprint arXiv:1707.02286, 2017.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42, + "bbox_fs": [ + 105, + 698, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 137 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "Jonathan Ho and Stefano Ermon. Generative adversarial imitation learning. In D. D. Lee,", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 92, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 92, + 505, + 106 + ], + "score": 1.0, + "content": "M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett (eds.), Advances in Neural Information", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 104, + 504, + 118 + ], + "spans": [ + { + "bbox": [ + 115, + 104, + 504, + 118 + ], + "score": 1.0, + "content": "Processing Systems 29, pp. 4565–4573. Curran Associates, Inc., 2016. URL http://papers.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 115, + 484, + 128 + ], + "spans": [ + { + "bbox": [ + 115, + 115, + 484, + 128 + ], + "score": 1.0, + "content": "nips.cc/paper/6391-generative-adversarial-imitation-learning.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 114, + 127, + 140, + 138 + ], + "spans": [ + { + "bbox": [ + 114, + 127, + 140, + 138 + ], + "score": 1.0, + "content": "pdf.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 107, + 146, + 504, + 169 + ], + "lines": [ + { + "bbox": [ + 106, + 146, + 505, + 159 + ], + "spans": [ + { + "bbox": [ + 106, + 146, + 505, + 159 + ], + "score": 1.0, + "content": "Max Jaderberg, Volodymyr Mnih, Wojciech Marian Czarnecki, Tom Schaul, Joel Z Leibo, David", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 158, + 505, + 171 + ], + "spans": [ + { + "bbox": [ + 116, + 158, + 505, + 171 + ], + "score": 1.0, + "content": "Silver, and Koray Kavukcuoglu. Reinforcement learning with unsupervised auxiliary tasks, 2016.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 107, + 177, + 505, + 200 + ], + "lines": [ + { + "bbox": [ + 105, + 176, + 506, + 191 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 506, + 191 + ], + "score": 1.0, + "content": "Leslie Pack Kaelbling, Michael L. Littman, and Andrew P. Moore. Reinforcement learning: A", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 189, + 393, + 201 + ], + "spans": [ + { + "bbox": [ + 115, + 189, + 393, + 201 + ], + "score": 1.0, + "content": "survey. Journal of Artificial Intelligence Research, 4:237–285, 1996.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 108, + 208, + 505, + 231 + ], + "lines": [ + { + "bbox": [ + 106, + 208, + 505, + 221 + ], + "spans": [ + { + "bbox": [ + 106, + 208, + 505, + 221 + ], + "score": 1.0, + "content": "H J Kappen. Path integrals and symmetry breaking for optimal control theory. Journal of Statistical", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 219, + 290, + 232 + ], + "spans": [ + { + "bbox": [ + 115, + 219, + 290, + 232 + ], + "score": 1.0, + "content": "Mechanics: Theory and Experiment, 2005.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 106, + 239, + 504, + 262 + ], + "lines": [ + { + "bbox": [ + 106, + 239, + 506, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 506, + 252 + ], + "score": 1.0, + "content": "Jens Kober and Jan Peters. Policy search for motor primitives in robotics. In Advances in neural", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 250, + 326, + 263 + ], + "spans": [ + { + "bbox": [ + 116, + 250, + 326, + 263 + ], + "score": 1.0, + "content": "information processing systems, pp. 849–856, 2009.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 105, + 270, + 504, + 294 + ], + "lines": [ + { + "bbox": [ + 105, + 270, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 505, + 284 + ], + "score": 1.0, + "content": "Sergey Levine and Vladlen Koltun. Variational policy search via trajectory optimization. In Ad-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 281, + 399, + 294 + ], + "spans": [ + { + "bbox": [ + 115, + 281, + 399, + 294 + ], + "score": 1.0, + "content": "vances in Neural Information Processing Systems, pp. 207–215, 2013.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 108, + 301, + 504, + 335 + ], + "lines": [ + { + "bbox": [ + 106, + 300, + 506, + 315 + ], + "spans": [ + { + "bbox": [ + 106, + 300, + 506, + 315 + ], + "score": 1.0, + "content": "Timothy P Lillicrap, Jonathan J Hunt, Alexander Pritzel, Nicolas Heess, Tom Erez, Yuval Tassa,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 312, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 115, + 312, + 505, + 326 + ], + "score": 1.0, + "content": "David Silver, and Daan Wierstra. Continuous control with deep reinforcement learning. Interna-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 324, + 367, + 336 + ], + "spans": [ + { + "bbox": [ + 116, + 324, + 367, + 336 + ], + "score": 1.0, + "content": "tional Conference on Learning Representations (ICLR), 2016.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 343, + 505, + 378 + ], + "lines": [ + { + "bbox": [ + 106, + 344, + 504, + 356 + ], + "spans": [ + { + "bbox": [ + 106, + 344, + 504, + 356 + ], + "score": 1.0, + "content": "Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A Rusu, Joel Veness, Marc G Belle-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 354, + 506, + 368 + ], + "spans": [ + { + "bbox": [ + 115, + 354, + 506, + 368 + ], + "score": 1.0, + "content": "mare, Alex Graves, Martin Riedmiller, Andreas K Fidjeland, Georg Ostrovski, et al. Human-level", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 366, + 441, + 379 + ], + "spans": [ + { + "bbox": [ + 115, + 366, + 441, + 379 + ], + "score": 1.0, + "content": "control through deep reinforcement learning. Nature, 518(7540):529–533, 2015.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 385, + 505, + 420 + ], + "lines": [ + { + "bbox": [ + 105, + 385, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 505, + 399 + ], + "score": 1.0, + "content": "Volodymyr Mnih, Adria Puigdomenech Badia, Mehdi Mirza, Alex Graves, Timothy P Lillicrap, Tim", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 396, + 506, + 410 + ], + "spans": [ + { + "bbox": [ + 115, + 396, + 506, + 410 + ], + "score": 1.0, + "content": "Harley, David Silver, and Koray Kavukcuoglu. Asynchronous methods for deep reinforcement", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 408, + 417, + 420 + ], + "spans": [ + { + "bbox": [ + 116, + 408, + 417, + 420 + ], + "score": 1.0, + "content": "learning. In International Conference on Machine Learning (ICML), 2016.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 105, + 427, + 504, + 451 + ], + "lines": [ + { + "bbox": [ + 105, + 426, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 505, + 441 + ], + "score": 1.0, + "content": "William Montgomery and Sergey Levine. Guided policy search as approximate mirror descent.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 438, + 453, + 451 + ], + "spans": [ + { + "bbox": [ + 116, + 438, + 453, + 451 + ], + "score": 1.0, + "content": "CoRR, abs/1607.04614, 2016. URL http://arxiv.org/abs/1607.04614.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 108, + 458, + 505, + 493 + ], + "lines": [ + { + "bbox": [ + 106, + 459, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 505, + 471 + ], + "score": 1.0, + "content": "Rémi Munos, Tom Stepleton, Anna Harutyunyan, and Marc G. Bellemare. Safe and efficient off-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 470, + 505, + 483 + ], + "spans": [ + { + "bbox": [ + 116, + 470, + 505, + 483 + ], + "score": 1.0, + "content": "policy reinforcement learning. In Advances in Neural Information Processing Systems 29: Annual", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 117, + 481, + 395, + 493 + ], + "spans": [ + { + "bbox": [ + 117, + 481, + 395, + 493 + ], + "score": 1.0, + "content": "Conference on Neural Information Processing Systems (NIPS), 2016.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 106, + 500, + 504, + 524 + ], + "lines": [ + { + "bbox": [ + 105, + 500, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 506, + 515 + ], + "score": 1.0, + "content": "Gerhard Neumann. Variational inference for policy search in changing situations. In Proceedings", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 511, + 476, + 524 + ], + "spans": [ + { + "bbox": [ + 115, + 511, + 476, + 524 + ], + "score": 1.0, + "content": "of the 28th international conference on machine learning (ICML-11), pp. 817–824, 2011.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 106, + 531, + 503, + 555 + ], + "lines": [ + { + "bbox": [ + 105, + 531, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 505, + 546 + ], + "score": 1.0, + "content": "Brendan O’Donoghue, Rémi Munos, Koray Kavukcuoglu, and Volodymyr Mnih. PGQ: combining", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 543, + 365, + 555 + ], + "spans": [ + { + "bbox": [ + 115, + 543, + 365, + 555 + ], + "score": 1.0, + "content": "policy gradient and q-learning. CoRR, abs/1611.01626, 2016.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 107, + 563, + 505, + 597 + ], + "lines": [ + { + "bbox": [ + 106, + 563, + 505, + 576 + ], + "spans": [ + { + "bbox": [ + 106, + 563, + 505, + 576 + ], + "score": 1.0, + "content": "Brendan O’Donoghue, Ian Osband, Rémi Munos, and Volodymyr Mnih. The uncertainty bellman", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 573, + 505, + 587 + ], + "spans": [ + { + "bbox": [ + 115, + 573, + 505, + 587 + ], + "score": 1.0, + "content": "equation and exploration. CoRR, abs/1709.05380, 2017. URL http://arxiv.org/abs/", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 585, + 182, + 597 + ], + "spans": [ + { + "bbox": [ + 116, + 585, + 182, + 597 + ], + "score": 1.0, + "content": "1709.05380.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 604, + 504, + 628 + ], + "lines": [ + { + "bbox": [ + 105, + 603, + 506, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 603, + 506, + 619 + ], + "score": 1.0, + "content": "Xue Bin Peng, Glen Berseth, and Michiel van de Panne. Terrain-adaptive locomotion skills using", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 616, + 495, + 629 + ], + "spans": [ + { + "bbox": [ + 116, + 616, + 495, + 629 + ], + "score": 1.0, + "content": "deep reinforcement learning. ACM Transactions on Graphics (Proc. SIGGRAPH 2016), 2016.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5 + }, + { + "type": "text", + "bbox": [ + 107, + 636, + 504, + 669 + ], + "lines": [ + { + "bbox": [ + 106, + 636, + 506, + 649 + ], + "spans": [ + { + "bbox": [ + 106, + 636, + 506, + 649 + ], + "score": 1.0, + "content": "Theodore J. Perkins and Doina Precup. A convergent form of approximate policy iteration. In", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 648, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 115, + 648, + 505, + 660 + ], + "score": 1.0, + "content": "Advances in Neural Information Processing Systems 15 (NIPS). MIT Press, Cambridge, MA,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 657, + 143, + 671 + ], + "spans": [ + { + "bbox": [ + 115, + 657, + 143, + 671 + ], + "score": 1.0, + "content": "2002.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 105, + 678, + 505, + 701 + ], + "lines": [ + { + "bbox": [ + 105, + 677, + 505, + 692 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 692 + ], + "score": 1.0, + "content": "Jan Peters, Katharina Mülling, and Yasemin Altün. Relative entropy policy search. In Proceedings", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 690, + 437, + 702 + ], + "spans": [ + { + "bbox": [ + 116, + 690, + 437, + 702 + ], + "score": 1.0, + "content": "of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI), 2010a.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 503, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "score": 1.0, + "content": "Jan Peters, Katharina Mülling, and Yasemin Altun. Relative entropy policy search. In AAAI. Atlanta,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 720, + 147, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 147, + 732 + ], + "score": 1.0, + "content": "2010b.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43.5 + } + ], + "page_idx": 11, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "12", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 137 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "Jonathan Ho and Stefano Ermon. Generative adversarial imitation learning. In D. D. Lee,", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 92, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 92, + 505, + 106 + ], + "score": 1.0, + "content": "M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett (eds.), Advances in Neural Information", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 104, + 504, + 118 + ], + "spans": [ + { + "bbox": [ + 115, + 104, + 504, + 118 + ], + "score": 1.0, + "content": "Processing Systems 29, pp. 4565–4573. Curran Associates, Inc., 2016. URL http://papers.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 115, + 484, + 128 + ], + "spans": [ + { + "bbox": [ + 115, + 115, + 484, + 128 + ], + "score": 1.0, + "content": "nips.cc/paper/6391-generative-adversarial-imitation-learning.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 114, + 127, + 140, + 138 + ], + "spans": [ + { + "bbox": [ + 114, + 127, + 140, + 138 + ], + "score": 1.0, + "content": "pdf.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 81, + 505, + 138 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 146, + 504, + 169 + ], + "lines": [ + { + "bbox": [ + 106, + 146, + 505, + 159 + ], + "spans": [ + { + "bbox": [ + 106, + 146, + 505, + 159 + ], + "score": 1.0, + "content": "Max Jaderberg, Volodymyr Mnih, Wojciech Marian Czarnecki, Tom Schaul, Joel Z Leibo, David", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 158, + 505, + 171 + ], + "spans": [ + { + "bbox": [ + 116, + 158, + 505, + 171 + ], + "score": 1.0, + "content": "Silver, and Koray Kavukcuoglu. Reinforcement learning with unsupervised auxiliary tasks, 2016.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 106, + 146, + 505, + 171 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 177, + 505, + 200 + ], + "lines": [ + { + "bbox": [ + 105, + 176, + 506, + 191 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 506, + 191 + ], + "score": 1.0, + "content": "Leslie Pack Kaelbling, Michael L. Littman, and Andrew P. Moore. Reinforcement learning: A", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 189, + 393, + 201 + ], + "spans": [ + { + "bbox": [ + 115, + 189, + 393, + 201 + ], + "score": 1.0, + "content": "survey. Journal of Artificial Intelligence Research, 4:237–285, 1996.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 176, + 506, + 201 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 208, + 505, + 231 + ], + "lines": [ + { + "bbox": [ + 106, + 208, + 505, + 221 + ], + "spans": [ + { + "bbox": [ + 106, + 208, + 505, + 221 + ], + "score": 1.0, + "content": "H J Kappen. Path integrals and symmetry breaking for optimal control theory. Journal of Statistical", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 219, + 290, + 232 + ], + "spans": [ + { + "bbox": [ + 115, + 219, + 290, + 232 + ], + "score": 1.0, + "content": "Mechanics: Theory and Experiment, 2005.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 106, + 208, + 505, + 232 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 239, + 504, + 262 + ], + "lines": [ + { + "bbox": [ + 106, + 239, + 506, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 506, + 252 + ], + "score": 1.0, + "content": "Jens Kober and Jan Peters. Policy search for motor primitives in robotics. In Advances in neural", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 250, + 326, + 263 + ], + "spans": [ + { + "bbox": [ + 116, + 250, + 326, + 263 + ], + "score": 1.0, + "content": "information processing systems, pp. 849–856, 2009.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 106, + 239, + 506, + 263 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 270, + 504, + 294 + ], + "lines": [ + { + "bbox": [ + 105, + 270, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 505, + 284 + ], + "score": 1.0, + "content": "Sergey Levine and Vladlen Koltun. Variational policy search via trajectory optimization. In Ad-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 281, + 399, + 294 + ], + "spans": [ + { + "bbox": [ + 115, + 281, + 399, + 294 + ], + "score": 1.0, + "content": "vances in Neural Information Processing Systems, pp. 207–215, 2013.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 270, + 505, + 294 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 301, + 504, + 335 + ], + "lines": [ + { + "bbox": [ + 106, + 300, + 506, + 315 + ], + "spans": [ + { + "bbox": [ + 106, + 300, + 506, + 315 + ], + "score": 1.0, + "content": "Timothy P Lillicrap, Jonathan J Hunt, Alexander Pritzel, Nicolas Heess, Tom Erez, Yuval Tassa,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 312, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 115, + 312, + 505, + 326 + ], + "score": 1.0, + "content": "David Silver, and Daan Wierstra. Continuous control with deep reinforcement learning. Interna-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 324, + 367, + 336 + ], + "spans": [ + { + "bbox": [ + 116, + 324, + 367, + 336 + ], + "score": 1.0, + "content": "tional Conference on Learning Representations (ICLR), 2016.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 106, + 300, + 506, + 336 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 343, + 505, + 378 + ], + "lines": [ + { + "bbox": [ + 106, + 344, + 504, + 356 + ], + "spans": [ + { + "bbox": [ + 106, + 344, + 504, + 356 + ], + "score": 1.0, + "content": "Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A Rusu, Joel Veness, Marc G Belle-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 354, + 506, + 368 + ], + "spans": [ + { + "bbox": [ + 115, + 354, + 506, + 368 + ], + "score": 1.0, + "content": "mare, Alex Graves, Martin Riedmiller, Andreas K Fidjeland, Georg Ostrovski, et al. Human-level", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 366, + 441, + 379 + ], + "spans": [ + { + "bbox": [ + 115, + 366, + 441, + 379 + ], + "score": 1.0, + "content": "control through deep reinforcement learning. Nature, 518(7540):529–533, 2015.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 106, + 344, + 506, + 379 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 385, + 505, + 420 + ], + "lines": [ + { + "bbox": [ + 105, + 385, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 505, + 399 + ], + "score": 1.0, + "content": "Volodymyr Mnih, Adria Puigdomenech Badia, Mehdi Mirza, Alex Graves, Timothy P Lillicrap, Tim", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 396, + 506, + 410 + ], + "spans": [ + { + "bbox": [ + 115, + 396, + 506, + 410 + ], + "score": 1.0, + "content": "Harley, David Silver, and Koray Kavukcuoglu. Asynchronous methods for deep reinforcement", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 408, + 417, + 420 + ], + "spans": [ + { + "bbox": [ + 116, + 408, + 417, + 420 + ], + "score": 1.0, + "content": "learning. In International Conference on Machine Learning (ICML), 2016.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 385, + 506, + 420 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 427, + 504, + 451 + ], + "lines": [ + { + "bbox": [ + 105, + 426, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 505, + 441 + ], + "score": 1.0, + "content": "William Montgomery and Sergey Levine. Guided policy search as approximate mirror descent.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 438, + 453, + 451 + ], + "spans": [ + { + "bbox": [ + 116, + 438, + 453, + 451 + ], + "score": 1.0, + "content": "CoRR, abs/1607.04614, 2016. URL http://arxiv.org/abs/1607.04614.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 426, + 505, + 451 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 458, + 505, + 493 + ], + "lines": [ + { + "bbox": [ + 106, + 459, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 505, + 471 + ], + "score": 1.0, + "content": "Rémi Munos, Tom Stepleton, Anna Harutyunyan, and Marc G. Bellemare. Safe and efficient off-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 470, + 505, + 483 + ], + "spans": [ + { + "bbox": [ + 116, + 470, + 505, + 483 + ], + "score": 1.0, + "content": "policy reinforcement learning. In Advances in Neural Information Processing Systems 29: Annual", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 117, + 481, + 395, + 493 + ], + "spans": [ + { + "bbox": [ + 117, + 481, + 395, + 493 + ], + "score": 1.0, + "content": "Conference on Neural Information Processing Systems (NIPS), 2016.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 106, + 459, + 505, + 493 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 500, + 504, + 524 + ], + "lines": [ + { + "bbox": [ + 105, + 500, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 506, + 515 + ], + "score": 1.0, + "content": "Gerhard Neumann. Variational inference for policy search in changing situations. In Proceedings", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 511, + 476, + 524 + ], + "spans": [ + { + "bbox": [ + 115, + 511, + 476, + 524 + ], + "score": 1.0, + "content": "of the 28th international conference on machine learning (ICML-11), pp. 817–824, 2011.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 105, + 500, + 506, + 524 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 531, + 503, + 555 + ], + "lines": [ + { + "bbox": [ + 105, + 531, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 505, + 546 + ], + "score": 1.0, + "content": "Brendan O’Donoghue, Rémi Munos, Koray Kavukcuoglu, and Volodymyr Mnih. PGQ: combining", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 543, + 365, + 555 + ], + "spans": [ + { + "bbox": [ + 115, + 543, + 365, + 555 + ], + "score": 1.0, + "content": "policy gradient and q-learning. CoRR, abs/1611.01626, 2016.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 105, + 531, + 505, + 555 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 563, + 505, + 597 + ], + "lines": [ + { + "bbox": [ + 106, + 563, + 505, + 576 + ], + "spans": [ + { + "bbox": [ + 106, + 563, + 505, + 576 + ], + "score": 1.0, + "content": "Brendan O’Donoghue, Ian Osband, Rémi Munos, and Volodymyr Mnih. The uncertainty bellman", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 573, + 505, + 587 + ], + "spans": [ + { + "bbox": [ + 115, + 573, + 505, + 587 + ], + "score": 1.0, + "content": "equation and exploration. CoRR, abs/1709.05380, 2017. URL http://arxiv.org/abs/", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 585, + 182, + 597 + ], + "spans": [ + { + "bbox": [ + 116, + 585, + 182, + 597 + ], + "score": 1.0, + "content": "1709.05380.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34, + "bbox_fs": [ + 106, + 563, + 505, + 597 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 604, + 504, + 628 + ], + "lines": [ + { + "bbox": [ + 105, + 603, + 506, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 603, + 506, + 619 + ], + "score": 1.0, + "content": "Xue Bin Peng, Glen Berseth, and Michiel van de Panne. Terrain-adaptive locomotion skills using", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 616, + 495, + 629 + ], + "spans": [ + { + "bbox": [ + 116, + 616, + 495, + 629 + ], + "score": 1.0, + "content": "deep reinforcement learning. ACM Transactions on Graphics (Proc. SIGGRAPH 2016), 2016.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 603, + 506, + 629 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 636, + 504, + 669 + ], + "lines": [ + { + "bbox": [ + 106, + 636, + 506, + 649 + ], + "spans": [ + { + "bbox": [ + 106, + 636, + 506, + 649 + ], + "score": 1.0, + "content": "Theodore J. Perkins and Doina Precup. A convergent form of approximate policy iteration. In", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 648, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 115, + 648, + 505, + 660 + ], + "score": 1.0, + "content": "Advances in Neural Information Processing Systems 15 (NIPS). MIT Press, Cambridge, MA,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 657, + 143, + 671 + ], + "spans": [ + { + "bbox": [ + 115, + 657, + 143, + 671 + ], + "score": 1.0, + "content": "2002.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39, + "bbox_fs": [ + 106, + 636, + 506, + 671 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 678, + 505, + 701 + ], + "lines": [ + { + "bbox": [ + 105, + 677, + 505, + 692 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 692 + ], + "score": 1.0, + "content": "Jan Peters, Katharina Mülling, and Yasemin Altün. Relative entropy policy search. In Proceedings", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 690, + 437, + 702 + ], + "spans": [ + { + "bbox": [ + 116, + 690, + 437, + 702 + ], + "score": 1.0, + "content": "of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI), 2010a.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5, + "bbox_fs": [ + 105, + 677, + 505, + 702 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 503, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "score": 1.0, + "content": "Jan Peters, Katharina Mülling, and Yasemin Altun. Relative entropy policy search. In AAAI. Atlanta,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 720, + 147, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 147, + 732 + ], + "score": 1.0, + "content": "2010b.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43.5, + "bbox_fs": [ + 105, + 708, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 503, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Konrad Rawlik, Marc Toussaint, and Sethu Vijayakumar. On stochastic optimal control and re-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "inforcement learning by approximate inference. In (R:SS 2012), 2012. Runner Up Best Paper", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 104, + 148, + 117 + ], + "spans": [ + { + "bbox": [ + 115, + 104, + 148, + 117 + ], + "score": 1.0, + "content": "Award.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 105, + 123, + 504, + 146 + ], + "lines": [ + { + "bbox": [ + 106, + 123, + 506, + 136 + ], + "spans": [ + { + "bbox": [ + 106, + 123, + 506, + 136 + ], + "score": 1.0, + "content": "Nicolas Le Roux. Efficient iterative policy optimization. CoRR, abs/1612.08967, 2016. URL", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 135, + 307, + 146 + ], + "spans": [ + { + "bbox": [ + 116, + 135, + 307, + 146 + ], + "score": 1.0, + "content": "http://arxiv.org/abs/1612.08967.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 106, + 153, + 504, + 187 + ], + "lines": [ + { + "bbox": [ + 105, + 152, + 506, + 166 + ], + "spans": [ + { + "bbox": [ + 105, + 152, + 506, + 166 + ], + "score": 1.0, + "content": "John Schulman, Sergey Levine, Pieter Abbeel, Michael Jordan, and Philipp Moritz. Trust region", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 164, + 506, + 177 + ], + "spans": [ + { + "bbox": [ + 115, + 164, + 506, + 177 + ], + "score": 1.0, + "content": "policy optimization. In Proceedings of the 32nd International Conference on Machine Learning", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 175, + 176, + 187 + ], + "spans": [ + { + "bbox": [ + 116, + 175, + 176, + 187 + ], + "score": 1.0, + "content": "(ICML), 2015.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 193, + 503, + 217 + ], + "lines": [ + { + "bbox": [ + 105, + 191, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 191, + 505, + 208 + ], + "score": 1.0, + "content": "John Schulman, Pieter Abbeel, and Xi Chen. Equivalence between policy gradients and soft q-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 205, + 281, + 217 + ], + "spans": [ + { + "bbox": [ + 116, + 205, + 281, + 217 + ], + "score": 1.0, + "content": "learning. CoRR, abs/1704.06440, 2017a.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 106, + 223, + 505, + 257 + ], + "lines": [ + { + "bbox": [ + 104, + 222, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 104, + 222, + 505, + 237 + ], + "score": 1.0, + "content": "John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 234, + 505, + 248 + ], + "spans": [ + { + "bbox": [ + 115, + 234, + 505, + 248 + ], + "score": 1.0, + "content": "optimization algorithms. CoRR, abs/1707.06347, 2017b. URL http://arxiv.org/abs/", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 245, + 182, + 258 + ], + "spans": [ + { + "bbox": [ + 116, + 245, + 182, + 258 + ], + "score": 1.0, + "content": "1707.06347.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 264, + 505, + 298 + ], + "lines": [ + { + "bbox": [ + 106, + 265, + 504, + 277 + ], + "spans": [ + { + "bbox": [ + 106, + 265, + 504, + 277 + ], + "score": 1.0, + "content": "David Silver, Guy Lever, Nicolas Heess, Thomas Degris, Daan Wierstra, and Martin Riedmiller. De-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 276, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 115, + 276, + 505, + 289 + ], + "score": 1.0, + "content": "terministic policy gradient algorithms. In International Conference on Machine Learning (ICML),", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 286, + 143, + 299 + ], + "spans": [ + { + "bbox": [ + 115, + 286, + 143, + 299 + ], + "score": 1.0, + "content": "2014.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 305, + 505, + 339 + ], + "lines": [ + { + "bbox": [ + 105, + 305, + 504, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 305, + 504, + 318 + ], + "score": 1.0, + "content": "Richard S Sutton. Integrated architectures for learning, planning, and reacting based on approxi-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 315, + 505, + 330 + ], + "spans": [ + { + "bbox": [ + 115, + 315, + 505, + 330 + ], + "score": 1.0, + "content": "mating dynamic programming. In International Conference on Machine Learning (ICML), pp.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 327, + 181, + 339 + ], + "spans": [ + { + "bbox": [ + 116, + 327, + 181, + 339 + ], + "score": 1.0, + "content": "216–224, 1990.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 345, + 505, + 380 + ], + "lines": [ + { + "bbox": [ + 107, + 347, + 504, + 358 + ], + "spans": [ + { + "bbox": [ + 107, + 347, + 504, + 358 + ], + "score": 1.0, + "content": "Yuval Tassa, Yotam Doron, Alistair Muldal, Tom Erez, Yazhe Li, Diego de Las Casas, David Bud-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 116, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "den, Abbas Abdolmaleki, Josh Merel, Andrew Lefrancq, Timothy Lillicrap, and Martin Ried-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 368, + 483, + 381 + ], + "spans": [ + { + "bbox": [ + 116, + 368, + 483, + 381 + ], + "score": 1.0, + "content": "miller. Deepmind control suite, 2018. URL http://arxiv.org/abs/1801.00690.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 387, + 504, + 410 + ], + "lines": [ + { + "bbox": [ + 105, + 385, + 505, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 505, + 402 + ], + "score": 1.0, + "content": "Evangelos Theodorou, Jonas Buchli, and Stefan Schaal. A generalized path integral control ap-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 398, + 473, + 411 + ], + "spans": [ + { + "bbox": [ + 115, + 398, + 473, + 411 + ], + "score": 1.0, + "content": "proach to reinforcement learning. Journal of Machine Learning Research (JMLR), 2010.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 108, + 417, + 504, + 451 + ], + "lines": [ + { + "bbox": [ + 105, + 416, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 505, + 430 + ], + "score": 1.0, + "content": "Emanuel Todorov. General duality between optimal control and estimation. In Proceedings of the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 427, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 115, + 427, + 505, + 441 + ], + "score": 1.0, + "content": "47th IEEE Conference on Decision and Control, CDC 2008, December 9-11, 2008, Cancún,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 439, + 240, + 452 + ], + "spans": [ + { + "bbox": [ + 115, + 439, + 240, + 452 + ], + "score": 1.0, + "content": "México, pp. 4286–4292, 2008.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 457, + 503, + 491 + ], + "lines": [ + { + "bbox": [ + 105, + 457, + 505, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 470 + ], + "score": 1.0, + "content": "Ahmed Touati, Pierre-Luc Bacon, Doina Precup, and Pascal Vincent. Convergent tree-backup and", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 468, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 115, + 468, + 505, + 482 + ], + "score": 1.0, + "content": "retrace with function approximation. CoRR, abs/1705.09322, 2017. URL http://arxiv.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 116, + 480, + 229, + 492 + ], + "spans": [ + { + "bbox": [ + 116, + 480, + 229, + 492 + ], + "score": 1.0, + "content": "org/abs/1705.09322.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 498, + 504, + 532 + ], + "lines": [ + { + "bbox": [ + 105, + 498, + 505, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 505, + 512 + ], + "score": 1.0, + "content": "Marc Toussaint. Robot trajectory optimization using approximate inference. In Proceedings of the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 510, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 116, + 510, + 505, + 522 + ], + "score": 1.0, + "content": "26th Annual International Conference on Machine Learning, ICML ’09, pp. 1049–1056, 2009.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 521, + 224, + 532 + ], + "spans": [ + { + "bbox": [ + 116, + 521, + 224, + 532 + ], + "score": 1.0, + "content": "ISBN 978-1-60558-516-1.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 108, + 539, + 504, + 573 + ], + "lines": [ + { + "bbox": [ + 105, + 538, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 505, + 554 + ], + "score": 1.0, + "content": "Ziyu Wang, Victor Bapst, Nicolas Heess, Volodymyr Mnih, Rémi Munos, Koray Kavukcuoglu,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 551, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 116, + 551, + 505, + 563 + ], + "score": 1.0, + "content": "and Nando de Freitas. Sample efficient actor-critic with experience replay. 5th International", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 117, + 562, + 340, + 574 + ], + "spans": [ + { + "bbox": [ + 117, + 562, + 340, + 574 + ], + "score": 1.0, + "content": "Conference on Learning Representations (ICLR), 2017.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 580, + 505, + 614 + ], + "lines": [ + { + "bbox": [ + 106, + 580, + 504, + 593 + ], + "spans": [ + { + "bbox": [ + 106, + 580, + 504, + 593 + ], + "score": 1.0, + "content": "Christian Wirth, Johannes Furnkranz, and Gerhard Neumann. Model-free preference-based rein-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 591, + 504, + 604 + ], + "spans": [ + { + "bbox": [ + 115, + 591, + 504, + 604 + ], + "score": 1.0, + "content": "forcement learning. In 30th AAAI Conference on Artificial Intelligence, AAAI 2016, pp. 2222–", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 601, + 167, + 615 + ], + "spans": [ + { + "bbox": [ + 115, + 601, + 167, + 615 + ], + "score": 1.0, + "content": "2228, 2016.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 106, + 621, + 504, + 645 + ], + "lines": [ + { + "bbox": [ + 105, + 620, + 505, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 620, + 505, + 635 + ], + "score": 1.0, + "content": "Brian D Ziebart, Andrew L Maas, J Andrew Bagnell, and Anind K Dey. Maximum entropy inverse", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 632, + 341, + 644 + ], + "spans": [ + { + "bbox": [ + 115, + 632, + 341, + 644 + ], + "score": 1.0, + "content": "reinforcement learning. In AAAI, pp. 1433–1438, 2008.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5 + } + ], + "page_idx": 12, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "13", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 503, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Konrad Rawlik, Marc Toussaint, and Sethu Vijayakumar. On stochastic optimal control and re-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "inforcement learning by approximate inference. In (R:SS 2012), 2012. Runner Up Best Paper", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 104, + 148, + 117 + ], + "spans": [ + { + "bbox": [ + 115, + 104, + 148, + 117 + ], + "score": 1.0, + "content": "Award.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 106, + 82, + 505, + 117 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 123, + 504, + 146 + ], + "lines": [ + { + "bbox": [ + 106, + 123, + 506, + 136 + ], + "spans": [ + { + "bbox": [ + 106, + 123, + 506, + 136 + ], + "score": 1.0, + "content": "Nicolas Le Roux. Efficient iterative policy optimization. CoRR, abs/1612.08967, 2016. URL", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 135, + 307, + 146 + ], + "spans": [ + { + "bbox": [ + 116, + 135, + 307, + 146 + ], + "score": 1.0, + "content": "http://arxiv.org/abs/1612.08967.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 106, + 123, + 506, + 146 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 153, + 504, + 187 + ], + "lines": [ + { + "bbox": [ + 105, + 152, + 506, + 166 + ], + "spans": [ + { + "bbox": [ + 105, + 152, + 506, + 166 + ], + "score": 1.0, + "content": "John Schulman, Sergey Levine, Pieter Abbeel, Michael Jordan, and Philipp Moritz. Trust region", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 164, + 506, + 177 + ], + "spans": [ + { + "bbox": [ + 115, + 164, + 506, + 177 + ], + "score": 1.0, + "content": "policy optimization. In Proceedings of the 32nd International Conference on Machine Learning", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 175, + 176, + 187 + ], + "spans": [ + { + "bbox": [ + 116, + 175, + 176, + 187 + ], + "score": 1.0, + "content": "(ICML), 2015.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 105, + 152, + 506, + 187 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 193, + 503, + 217 + ], + "lines": [ + { + "bbox": [ + 105, + 191, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 191, + 505, + 208 + ], + "score": 1.0, + "content": "John Schulman, Pieter Abbeel, and Xi Chen. Equivalence between policy gradients and soft q-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 205, + 281, + 217 + ], + "spans": [ + { + "bbox": [ + 116, + 205, + 281, + 217 + ], + "score": 1.0, + "content": "learning. CoRR, abs/1704.06440, 2017a.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 191, + 505, + 217 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 223, + 505, + 257 + ], + "lines": [ + { + "bbox": [ + 104, + 222, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 104, + 222, + 505, + 237 + ], + "score": 1.0, + "content": "John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 234, + 505, + 248 + ], + "spans": [ + { + "bbox": [ + 115, + 234, + 505, + 248 + ], + "score": 1.0, + "content": "optimization algorithms. CoRR, abs/1707.06347, 2017b. URL http://arxiv.org/abs/", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 245, + 182, + 258 + ], + "spans": [ + { + "bbox": [ + 116, + 245, + 182, + 258 + ], + "score": 1.0, + "content": "1707.06347.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11, + "bbox_fs": [ + 104, + 222, + 505, + 258 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 264, + 505, + 298 + ], + "lines": [ + { + "bbox": [ + 106, + 265, + 504, + 277 + ], + "spans": [ + { + "bbox": [ + 106, + 265, + 504, + 277 + ], + "score": 1.0, + "content": "David Silver, Guy Lever, Nicolas Heess, Thomas Degris, Daan Wierstra, and Martin Riedmiller. De-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 276, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 115, + 276, + 505, + 289 + ], + "score": 1.0, + "content": "terministic policy gradient algorithms. In International Conference on Machine Learning (ICML),", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 286, + 143, + 299 + ], + "spans": [ + { + "bbox": [ + 115, + 286, + 143, + 299 + ], + "score": 1.0, + "content": "2014.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14, + "bbox_fs": [ + 106, + 265, + 505, + 299 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 305, + 505, + 339 + ], + "lines": [ + { + "bbox": [ + 105, + 305, + 504, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 305, + 504, + 318 + ], + "score": 1.0, + "content": "Richard S Sutton. Integrated architectures for learning, planning, and reacting based on approxi-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 315, + 505, + 330 + ], + "spans": [ + { + "bbox": [ + 115, + 315, + 505, + 330 + ], + "score": 1.0, + "content": "mating dynamic programming. In International Conference on Machine Learning (ICML), pp.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 327, + 181, + 339 + ], + "spans": [ + { + "bbox": [ + 116, + 327, + 181, + 339 + ], + "score": 1.0, + "content": "216–224, 1990.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 305, + 505, + 339 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 345, + 505, + 380 + ], + "lines": [ + { + "bbox": [ + 107, + 347, + 504, + 358 + ], + "spans": [ + { + "bbox": [ + 107, + 347, + 504, + 358 + ], + "score": 1.0, + "content": "Yuval Tassa, Yotam Doron, Alistair Muldal, Tom Erez, Yazhe Li, Diego de Las Casas, David Bud-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 116, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "den, Abbas Abdolmaleki, Josh Merel, Andrew Lefrancq, Timothy Lillicrap, and Martin Ried-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 368, + 483, + 381 + ], + "spans": [ + { + "bbox": [ + 116, + 368, + 483, + 381 + ], + "score": 1.0, + "content": "miller. Deepmind control suite, 2018. URL http://arxiv.org/abs/1801.00690.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20, + "bbox_fs": [ + 107, + 347, + 505, + 381 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 387, + 504, + 410 + ], + "lines": [ + { + "bbox": [ + 105, + 385, + 505, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 505, + 402 + ], + "score": 1.0, + "content": "Evangelos Theodorou, Jonas Buchli, and Stefan Schaal. A generalized path integral control ap-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 398, + 473, + 411 + ], + "spans": [ + { + "bbox": [ + 115, + 398, + 473, + 411 + ], + "score": 1.0, + "content": "proach to reinforcement learning. Journal of Machine Learning Research (JMLR), 2010.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 385, + 505, + 411 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 417, + 504, + 451 + ], + "lines": [ + { + "bbox": [ + 105, + 416, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 505, + 430 + ], + "score": 1.0, + "content": "Emanuel Todorov. General duality between optimal control and estimation. In Proceedings of the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 427, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 115, + 427, + 505, + 441 + ], + "score": 1.0, + "content": "47th IEEE Conference on Decision and Control, CDC 2008, December 9-11, 2008, Cancún,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 439, + 240, + 452 + ], + "spans": [ + { + "bbox": [ + 115, + 439, + 240, + 452 + ], + "score": 1.0, + "content": "México, pp. 4286–4292, 2008.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 416, + 505, + 452 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 457, + 503, + 491 + ], + "lines": [ + { + "bbox": [ + 105, + 457, + 505, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 470 + ], + "score": 1.0, + "content": "Ahmed Touati, Pierre-Luc Bacon, Doina Precup, and Pascal Vincent. Convergent tree-backup and", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 468, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 115, + 468, + 505, + 482 + ], + "score": 1.0, + "content": "retrace with function approximation. CoRR, abs/1705.09322, 2017. URL http://arxiv.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 116, + 480, + 229, + 492 + ], + "spans": [ + { + "bbox": [ + 116, + 480, + 229, + 492 + ], + "score": 1.0, + "content": "org/abs/1705.09322.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 457, + 505, + 492 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 498, + 504, + 532 + ], + "lines": [ + { + "bbox": [ + 105, + 498, + 505, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 505, + 512 + ], + "score": 1.0, + "content": "Marc Toussaint. Robot trajectory optimization using approximate inference. In Proceedings of the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 510, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 116, + 510, + 505, + 522 + ], + "score": 1.0, + "content": "26th Annual International Conference on Machine Learning, ICML ’09, pp. 1049–1056, 2009.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 521, + 224, + 532 + ], + "spans": [ + { + "bbox": [ + 116, + 521, + 224, + 532 + ], + "score": 1.0, + "content": "ISBN 978-1-60558-516-1.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 498, + 505, + 532 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 539, + 504, + 573 + ], + "lines": [ + { + "bbox": [ + 105, + 538, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 505, + 554 + ], + "score": 1.0, + "content": "Ziyu Wang, Victor Bapst, Nicolas Heess, Volodymyr Mnih, Rémi Munos, Koray Kavukcuoglu,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 551, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 116, + 551, + 505, + 563 + ], + "score": 1.0, + "content": "and Nando de Freitas. Sample efficient actor-critic with experience replay. 5th International", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 117, + 562, + 340, + 574 + ], + "spans": [ + { + "bbox": [ + 117, + 562, + 340, + 574 + ], + "score": 1.0, + "content": "Conference on Learning Representations (ICLR), 2017.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 538, + 505, + 574 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 580, + 505, + 614 + ], + "lines": [ + { + "bbox": [ + 106, + 580, + 504, + 593 + ], + "spans": [ + { + "bbox": [ + 106, + 580, + 504, + 593 + ], + "score": 1.0, + "content": "Christian Wirth, Johannes Furnkranz, and Gerhard Neumann. Model-free preference-based rein-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 591, + 504, + 604 + ], + "spans": [ + { + "bbox": [ + 115, + 591, + 504, + 604 + ], + "score": 1.0, + "content": "forcement learning. In 30th AAAI Conference on Artificial Intelligence, AAAI 2016, pp. 2222–", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 601, + 167, + 615 + ], + "spans": [ + { + "bbox": [ + 115, + 601, + 167, + 615 + ], + "score": 1.0, + "content": "2228, 2016.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37, + "bbox_fs": [ + 106, + 580, + 504, + 615 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 621, + 504, + 645 + ], + "lines": [ + { + "bbox": [ + 105, + 620, + 505, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 620, + 505, + 635 + ], + "score": 1.0, + "content": "Brian D Ziebart, Andrew L Maas, J Andrew Bagnell, and Anind K Dey. Maximum entropy inverse", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 632, + 341, + 644 + ], + "spans": [ + { + "bbox": [ + 115, + 632, + 341, + 644 + ], + "score": 1.0, + "content": "reinforcement learning. In AAAI, pp. 1433–1438, 2008.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 620, + 505, + 644 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 106, + 81, + 470, + 108 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 471, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 471, + 96 + ], + "score": 1.0, + "content": "A PROOF OF MONOTONIC IMPROVEMENT FOR THE KL-REGULARIZED", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 126, + 97, + 311, + 109 + ], + "spans": [ + { + "bbox": [ + 126, + 97, + 311, + 109 + ], + "score": 1.0, + "content": "POLICY OPTIMIZATION PROCEDURE", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 105, + 120, + 505, + 144 + ], + "lines": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "score": 1.0, + "content": "In this section we prove a monotonic improvement guarantee for KL-regularized policy optimization", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 132, + 476, + 145 + ], + "spans": [ + { + "bbox": [ + 106, + 132, + 212, + 145 + ], + "score": 1.0, + "content": "via alternating updates on", + "type": "text" + }, + { + "bbox": [ + 212, + 134, + 219, + 142 + ], + "score": 0.76, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 132, + 237, + 145 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 237, + 134, + 243, + 144 + ], + "score": 0.82, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 132, + 398, + 145 + ], + "score": 1.0, + "content": "under the assumption that the prior on", + "type": "text" + }, + { + "bbox": [ + 399, + 132, + 405, + 142 + ], + "score": 0.82, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 132, + 476, + 145 + ], + "score": 1.0, + "content": "is uninformative.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 107, + 158, + 323, + 170 + ], + "lines": [ + { + "bbox": [ + 106, + 158, + 323, + 171 + ], + "spans": [ + { + "bbox": [ + 106, + 158, + 323, + 171 + ], + "score": 1.0, + "content": "A.1 REGULARIZED REINFORCEMENT LEARNING", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 178, + 504, + 203 + ], + "lines": [ + { + "bbox": [ + 105, + 178, + 505, + 192 + ], + "spans": [ + { + "bbox": [ + 105, + 178, + 123, + 192 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 181, + 131, + 189 + ], + "score": 0.75, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 178, + 316, + 192 + ], + "score": 1.0, + "content": "be an arbitrary policy. For any other policy", + "type": "text" + }, + { + "bbox": [ + 316, + 182, + 323, + 191 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 178, + 396, + 192 + ], + "score": 1.0, + "content": "such that, for all", + "type": "text" + }, + { + "bbox": [ + 397, + 179, + 505, + 192 + ], + "score": 0.84, + "content": "x , a , \\{ \\pi ( a | x ) > 0 \\} \\implies", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 107, + 189, + 346, + 205 + ], + "spans": [ + { + "bbox": [ + 107, + 190, + 162, + 203 + ], + "score": 0.93, + "content": "\\{ q ( a | x ) > 0 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 189, + 207, + 205 + ], + "score": 1.0, + "content": ", define the", + "type": "text" + }, + { + "bbox": [ + 208, + 192, + 215, + 200 + ], + "score": 0.78, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 189, + 335, + 205 + ], + "score": 1.0, + "content": "-regularized reward for policy", + "type": "text" + }, + { + "bbox": [ + 335, + 193, + 341, + 202 + ], + "score": 0.8, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 189, + 346, + 205 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "interline_equation", + "bbox": [ + 230, + 208, + 380, + 236 + ], + "lines": [ + { + "bbox": [ + 230, + 208, + 380, + 236 + ], + "spans": [ + { + "bbox": [ + 230, + 208, + 380, + 236 + ], + "score": 0.93, + "content": "r _ { \\alpha } ^ { \\pi , q } ( x , a ) = r ( x , a ) - \\alpha \\log \\frac { q ( a | x ) } { \\pi ( a | x ) } ,", + "type": "interline_equation", + "image_path": "19b71895a29fda80f1b8591fef2b5e192fca3e05c9ba486025caa6f7d721c698.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 230, + 208, + 380, + 236 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 241, + 162, + 253 + ], + "lines": [ + { + "bbox": [ + 106, + 241, + 163, + 254 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 133, + 254 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 243, + 159, + 252 + ], + "score": 0.89, + "content": "\\alpha > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 241, + 163, + 254 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 106, + 266, + 420, + 279 + ], + "lines": [ + { + "bbox": [ + 105, + 264, + 419, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 242, + 282 + ], + "score": 1.0, + "content": "Bellman operators: Define the", + "type": "text" + }, + { + "bbox": [ + 243, + 269, + 249, + 277 + ], + "score": 0.78, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 264, + 412, + 282 + ], + "score": 1.0, + "content": "-regularized Bellman operator for policy", + "type": "text" + }, + { + "bbox": [ + 412, + 269, + 419, + 279 + ], + "score": 0.74, + "content": "q", + "type": "inline_equation" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "interline_equation", + "bbox": [ + 191, + 285, + 418, + 306 + ], + "lines": [ + { + "bbox": [ + 191, + 285, + 418, + 306 + ], + "spans": [ + { + "bbox": [ + 191, + 285, + 418, + 306 + ], + "score": 0.9, + "content": "\\begin{array} { r } { T _ { \\alpha } ^ { \\pi , q } V ( x ) = \\mathbb { E } _ { a \\sim q ( \\cdot | x ) } \\Big [ r _ { \\alpha } ^ { \\pi , q } ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } V ( y ) \\Big ] , } \\end{array}", + "type": "interline_equation", + "image_path": "508ad5a3c5fa9928bfe550dfd50ee50545843b2d286cf673ab0ef7fbced2c085.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 191, + 285, + 418, + 306 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 312, + 324, + 324 + ], + "lines": [ + { + "bbox": [ + 104, + 309, + 323, + 328 + ], + "spans": [ + { + "bbox": [ + 104, + 309, + 317, + 328 + ], + "score": 1.0, + "content": "and the non-regularized Bellman operator for policy", + "type": "text" + }, + { + "bbox": [ + 317, + 315, + 323, + 324 + ], + "score": 0.75, + "content": "q", + "type": "inline_equation" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "interline_equation", + "bbox": [ + 200, + 330, + 410, + 352 + ], + "lines": [ + { + "bbox": [ + 200, + 330, + 410, + 352 + ], + "spans": [ + { + "bbox": [ + 200, + 330, + 410, + 352 + ], + "score": 0.92, + "content": "T ^ { q } V ( x ) = \\mathbb { E } _ { a \\sim q ( \\cdot | x ) } \\Big [ r ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } V ( y ) \\Big ] .", + "type": "interline_equation", + "image_path": "681f737615b202146cd9513dce7825ec03b9da0f1e4390b5dfe43f695e4a0eed.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 200, + 330, + 410, + 352 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 363, + 400, + 375 + ], + "lines": [ + { + "bbox": [ + 105, + 361, + 402, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 225, + 378 + ], + "score": 1.0, + "content": "Value function: Define the", + "type": "text" + }, + { + "bbox": [ + 226, + 366, + 232, + 373 + ], + "score": 0.79, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 361, + 383, + 378 + ], + "score": 1.0, + "content": "-regularized value function for policy", + "type": "text" + }, + { + "bbox": [ + 383, + 366, + 389, + 375 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 361, + 402, + 378 + ], + "score": 1.0, + "content": "as", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "interline_equation", + "bbox": [ + 212, + 381, + 398, + 410 + ], + "lines": [ + { + "bbox": [ + 212, + 381, + 398, + 410 + ], + "spans": [ + { + "bbox": [ + 212, + 381, + 398, + 410 + ], + "score": 0.93, + "content": "V _ { \\alpha } ^ { \\pi , q } ( \\boldsymbol { x } ) = \\mathbb { E } _ { q } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } r _ { \\alpha } ^ { \\pi , q } ( \\boldsymbol { x } _ { t } , a _ { t } ) | \\boldsymbol { x } _ { 0 } = \\boldsymbol { x } , q \\Big ] .", + "type": "interline_equation", + "image_path": "4f5602e99a52b3bbbfced2c9d8c1c6cec1445d1690ec985743dde120900363df.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 212, + 381, + 398, + 410 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 416, + 263, + 428 + ], + "lines": [ + { + "bbox": [ + 105, + 416, + 263, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 263, + 429 + ], + "score": 1.0, + "content": "and the non-regularized value function", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "interline_equation", + "bbox": [ + 221, + 434, + 389, + 464 + ], + "lines": [ + { + "bbox": [ + 221, + 434, + 389, + 464 + ], + "spans": [ + { + "bbox": [ + 221, + 434, + 389, + 464 + ], + "score": 0.94, + "content": "V ^ { q } ( x ) = \\mathbb { E } _ { q } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } r ( x _ { t } , a _ { t } ) | x _ { 0 } = x , q \\Big ] .", + "type": "interline_equation", + "image_path": "2f7fd48b4d6c6c7288755235956d88617509e88daeb0635db7ca46060c49b50b.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 221, + 434, + 389, + 464 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 469, + 432, + 482 + ], + "lines": [ + { + "bbox": [ + 105, + 467, + 433, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 204, + 484 + ], + "score": 1.0, + "content": "Proposition 1. For any", + "type": "text" + }, + { + "bbox": [ + 204, + 470, + 232, + 482 + ], + "score": 0.91, + "content": "q , \\pi , V", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 467, + 271, + 484 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 272, + 470, + 318, + 482 + ], + "score": 0.92, + "content": "V _ { \\alpha } ^ { \\pi , q } \\leq V ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 467, + 336, + 484 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 337, + 470, + 397, + 482 + ], + "score": 0.91, + "content": "T _ { \\alpha } ^ { \\pi , q } V \\le T ^ { q } V", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 467, + 433, + 484 + ], + "score": 1.0, + "content": ". Indeed", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "interline_equation", + "bbox": [ + 207, + 488, + 403, + 515 + ], + "lines": [ + { + "bbox": [ + 207, + 488, + 403, + 515 + ], + "spans": [ + { + "bbox": [ + 207, + 488, + 403, + 515 + ], + "score": 0.93, + "content": "\\mathbb { E } _ { q } \\Big [ \\log \\frac { q \\big ( a _ { t } | x _ { t } \\big ) } { \\pi \\big ( a _ { t } | x _ { t } \\big ) } \\Big ] = K L \\big ( q ( \\cdot | x _ { t } ) \\| \\pi ( \\cdot | x _ { t } ) \\big ) \\geq 0 .", + "type": "interline_equation", + "image_path": "a64cd95e6d312561d3379d282bc2d9cd023b8307018318681d5a181e94947f9e.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 207, + 488, + 403, + 515 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 527, + 504, + 551 + ], + "lines": [ + { + "bbox": [ + 105, + 525, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 457, + 542 + ], + "score": 1.0, + "content": "Optimal value function and policy Define the optimal regularized value function:", + "type": "text" + }, + { + "bbox": [ + 457, + 528, + 505, + 540 + ], + "score": 0.89, + "content": "V _ { \\alpha } ^ { \\pi , * } ( x ) =", + "type": "inline_equation" + } + ], + "index": 19 + }, + { + "bbox": [ + 107, + 537, + 464, + 553 + ], + "spans": [ + { + "bbox": [ + 107, + 539, + 165, + 551 + ], + "score": 0.93, + "content": "\\operatorname* { m a x } _ { q } V _ { \\alpha } ^ { \\pi , q } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 537, + 369, + 553 + ], + "score": 1.0, + "content": ", and the optimal (non-regularized) value function:", + "type": "text" + }, + { + "bbox": [ + 369, + 538, + 460, + 551 + ], + "score": 0.92, + "content": "V ^ { * } ( x ) = \\operatorname* { m a x } _ { q } V ^ { q } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 537, + 464, + 553 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 105, + 555, + 504, + 579 + ], + "lines": [ + { + "bbox": [ + 105, + 553, + 506, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 553, + 214, + 570 + ], + "score": 1.0, + "content": "The optimal policy of the", + "type": "text" + }, + { + "bbox": [ + 215, + 558, + 222, + 565 + ], + "score": 0.76, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 553, + 309, + 570 + ], + "score": 1.0, + "content": "-regularized problem", + "type": "text" + }, + { + "bbox": [ + 309, + 555, + 436, + 568 + ], + "score": 0.91, + "content": "q _ { \\alpha } ^ { \\pi , * } ( \\cdot | x ) = \\arg \\operatorname* { m a x } _ { q } V _ { \\alpha } ^ { \\pi , q } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 553, + 506, + 570 + ], + "score": 1.0, + "content": "and the optimal", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 566, + 360, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 260, + 579 + ], + "score": 1.0, + "content": "policy of the non-regularized problem", + "type": "text" + }, + { + "bbox": [ + 261, + 567, + 356, + 579 + ], + "score": 0.91, + "content": "q ^ { * } ( \\cdot | x ) = \\arg \\operatorname* { m a x } _ { q } V ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 566, + 360, + 579 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 105, + 582, + 502, + 605 + ], + "lines": [ + { + "bbox": [ + 104, + 579, + 506, + 599 + ], + "spans": [ + { + "bbox": [ + 104, + 579, + 223, + 599 + ], + "score": 1.0, + "content": "Proposition 2. We have that", + "type": "text" + }, + { + "bbox": [ + 223, + 582, + 244, + 594 + ], + "score": 0.91, + "content": "V _ { \\alpha } ^ { \\pi , q }", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 579, + 352, + 599 + ], + "score": 1.0, + "content": "is the unique fixed point of", + "type": "text" + }, + { + "bbox": [ + 352, + 583, + 372, + 594 + ], + "score": 0.89, + "content": "T _ { \\alpha } ^ { \\pi , q }", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 579, + 393, + 599 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 394, + 583, + 407, + 592 + ], + "score": 0.85, + "content": "V ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 579, + 506, + 599 + ], + "score": 1.0, + "content": "is the unique fixed point", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 593, + 388, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 593, + 117, + 606 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 117, + 594, + 129, + 603 + ], + "score": 0.82, + "content": "T ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 593, + 356, + 606 + ], + "score": 1.0, + "content": ". Thus we have the following Bellman equations: For all", + "type": "text" + }, + { + "bbox": [ + 356, + 594, + 383, + 603 + ], + "score": 0.89, + "content": "x \\in X", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 593, + 388, + 606 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "interline_equation", + "bbox": [ + 167, + 610, + 441, + 709 + ], + "lines": [ + { + "bbox": [ + 167, + 610, + 441, + 709 + ], + "spans": [ + { + "bbox": [ + 167, + 610, + 441, + 709 + ], + "score": 0.95, + "content": "\\begin{array} { r c l } { { V _ { \\alpha } ^ { \\pi , q } ( x ) } } & { { = } } & { { \\displaystyle \\sum _ { a } q ( a | x ) \\Big [ r _ { \\alpha } ^ { \\pi , q } ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } \\big [ V _ { \\alpha } ^ { \\pi , q } ( y ) \\big ] \\Big ] } } \\\\ { { } } & { { } } & { { } } \\\\ { { V ^ { q } ( x ) } } & { { = } } & { { \\displaystyle \\sum _ { a } q ( a | x ) \\Big [ r ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } \\big [ V ^ { q } ( y ) \\big ] \\Big ] } } \\\\ { { } } & { { } } & { { } } \\\\ { { V _ { \\alpha } ^ { \\pi , * } ( x ) } } & { { = } } & { { \\displaystyle r _ { \\alpha } ^ { \\pi , q _ { \\alpha } ^ { \\pi , * } } ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } \\big [ V _ { \\alpha } ^ { \\pi , * } ( y ) \\big ] f o r a l l a \\in A , } } \\\\ { { } } & { { } } & { { } } \\\\ { { V ^ { * } ( x ) } } & { { = } } & { { \\displaystyle \\operatorname* { m a x } _ { a \\in A } \\Big [ r ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } \\big [ V ^ { * } ( y ) \\big ] \\Big ] . } } \\end{array}", + "type": "interline_equation", + "image_path": "66a75351c24b47e29e8ad0475f6feb00abfe1985e8f74a3c359f94cd4b27f79c.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 167, + 610, + 441, + 643.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 167, + 643.0, + 441, + 676.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 167, + 676.0, + 441, + 709.0 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 103, + 720, + 462, + 733 + ], + "lines": [ + { + "bbox": [ + 104, + 717, + 464, + 735 + ], + "spans": [ + { + "bbox": [ + 104, + 717, + 254, + 735 + ], + "score": 1.0, + "content": "Notice that (16) holds for all actions", + "type": "text" + }, + { + "bbox": [ + 254, + 722, + 279, + 731 + ], + "score": 0.89, + "content": "a \\in A", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 717, + 396, + 735 + ], + "score": 1.0, + "content": ", and not in expectation w.r.t.", + "type": "text" + }, + { + "bbox": [ + 396, + 720, + 439, + 732 + ], + "score": 0.93, + "content": "a \\sim q ( \\cdot | x )", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 717, + 464, + 735 + ], + "score": 1.0, + "content": "only.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + } + ], + "page_idx": 13, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "14", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 106, + 81, + 470, + 108 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 471, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 471, + 96 + ], + "score": 1.0, + "content": "A PROOF OF MONOTONIC IMPROVEMENT FOR THE KL-REGULARIZED", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 126, + 97, + 311, + 109 + ], + "spans": [ + { + "bbox": [ + 126, + 97, + 311, + 109 + ], + "score": 1.0, + "content": "POLICY OPTIMIZATION PROCEDURE", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 105, + 120, + 505, + 144 + ], + "lines": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "score": 1.0, + "content": "In this section we prove a monotonic improvement guarantee for KL-regularized policy optimization", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 132, + 476, + 145 + ], + "spans": [ + { + "bbox": [ + 106, + 132, + 212, + 145 + ], + "score": 1.0, + "content": "via alternating updates on", + "type": "text" + }, + { + "bbox": [ + 212, + 134, + 219, + 142 + ], + "score": 0.76, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 132, + 237, + 145 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 237, + 134, + 243, + 144 + ], + "score": 0.82, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 132, + 398, + 145 + ], + "score": 1.0, + "content": "under the assumption that the prior on", + "type": "text" + }, + { + "bbox": [ + 399, + 132, + 405, + 142 + ], + "score": 0.82, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 132, + 476, + 145 + ], + "score": 1.0, + "content": "is uninformative.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 121, + 505, + 145 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 158, + 323, + 170 + ], + "lines": [ + { + "bbox": [ + 106, + 158, + 323, + 171 + ], + "spans": [ + { + "bbox": [ + 106, + 158, + 323, + 171 + ], + "score": 1.0, + "content": "A.1 REGULARIZED REINFORCEMENT LEARNING", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 178, + 504, + 203 + ], + "lines": [ + { + "bbox": [ + 105, + 178, + 505, + 192 + ], + "spans": [ + { + "bbox": [ + 105, + 178, + 123, + 192 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 181, + 131, + 189 + ], + "score": 0.75, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 178, + 316, + 192 + ], + "score": 1.0, + "content": "be an arbitrary policy. For any other policy", + "type": "text" + }, + { + "bbox": [ + 316, + 182, + 323, + 191 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 178, + 396, + 192 + ], + "score": 1.0, + "content": "such that, for all", + "type": "text" + }, + { + "bbox": [ + 397, + 179, + 505, + 192 + ], + "score": 0.84, + "content": "x , a , \\{ \\pi ( a | x ) > 0 \\} \\implies", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 107, + 189, + 346, + 205 + ], + "spans": [ + { + "bbox": [ + 107, + 190, + 162, + 203 + ], + "score": 0.93, + "content": "\\{ q ( a | x ) > 0 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 189, + 207, + 205 + ], + "score": 1.0, + "content": ", define the", + "type": "text" + }, + { + "bbox": [ + 208, + 192, + 215, + 200 + ], + "score": 0.78, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 189, + 335, + 205 + ], + "score": 1.0, + "content": "-regularized reward for policy", + "type": "text" + }, + { + "bbox": [ + 335, + 193, + 341, + 202 + ], + "score": 0.8, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 189, + 346, + 205 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 178, + 505, + 205 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 230, + 208, + 380, + 236 + ], + "lines": [ + { + "bbox": [ + 230, + 208, + 380, + 236 + ], + "spans": [ + { + "bbox": [ + 230, + 208, + 380, + 236 + ], + "score": 0.93, + "content": "r _ { \\alpha } ^ { \\pi , q } ( x , a ) = r ( x , a ) - \\alpha \\log \\frac { q ( a | x ) } { \\pi ( a | x ) } ,", + "type": "interline_equation", + "image_path": "19b71895a29fda80f1b8591fef2b5e192fca3e05c9ba486025caa6f7d721c698.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 230, + 208, + 380, + 236 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 241, + 162, + 253 + ], + "lines": [ + { + "bbox": [ + 106, + 241, + 163, + 254 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 133, + 254 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 243, + 159, + 252 + ], + "score": 0.89, + "content": "\\alpha > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 241, + 163, + 254 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8, + "bbox_fs": [ + 106, + 241, + 163, + 254 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 266, + 420, + 279 + ], + "lines": [ + { + "bbox": [ + 105, + 264, + 419, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 242, + 282 + ], + "score": 1.0, + "content": "Bellman operators: Define the", + "type": "text" + }, + { + "bbox": [ + 243, + 269, + 249, + 277 + ], + "score": 0.78, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 264, + 412, + 282 + ], + "score": 1.0, + "content": "-regularized Bellman operator for policy", + "type": "text" + }, + { + "bbox": [ + 412, + 269, + 419, + 279 + ], + "score": 0.74, + "content": "q", + "type": "inline_equation" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 264, + 419, + 282 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 191, + 285, + 418, + 306 + ], + "lines": [ + { + "bbox": [ + 191, + 285, + 418, + 306 + ], + "spans": [ + { + "bbox": [ + 191, + 285, + 418, + 306 + ], + "score": 0.9, + "content": "\\begin{array} { r } { T _ { \\alpha } ^ { \\pi , q } V ( x ) = \\mathbb { E } _ { a \\sim q ( \\cdot | x ) } \\Big [ r _ { \\alpha } ^ { \\pi , q } ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } V ( y ) \\Big ] , } \\end{array}", + "type": "interline_equation", + "image_path": "508ad5a3c5fa9928bfe550dfd50ee50545843b2d286cf673ab0ef7fbced2c085.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 191, + 285, + 418, + 306 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 312, + 324, + 324 + ], + "lines": [ + { + "bbox": [ + 104, + 309, + 323, + 328 + ], + "spans": [ + { + "bbox": [ + 104, + 309, + 317, + 328 + ], + "score": 1.0, + "content": "and the non-regularized Bellman operator for policy", + "type": "text" + }, + { + "bbox": [ + 317, + 315, + 323, + 324 + ], + "score": 0.75, + "content": "q", + "type": "inline_equation" + } + ], + "index": 11 + } + ], + "index": 11, + "bbox_fs": [ + 104, + 309, + 323, + 328 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 200, + 330, + 410, + 352 + ], + "lines": [ + { + "bbox": [ + 200, + 330, + 410, + 352 + ], + "spans": [ + { + "bbox": [ + 200, + 330, + 410, + 352 + ], + "score": 0.92, + "content": "T ^ { q } V ( x ) = \\mathbb { E } _ { a \\sim q ( \\cdot | x ) } \\Big [ r ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } V ( y ) \\Big ] .", + "type": "interline_equation", + "image_path": "681f737615b202146cd9513dce7825ec03b9da0f1e4390b5dfe43f695e4a0eed.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 200, + 330, + 410, + 352 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 363, + 400, + 375 + ], + "lines": [ + { + "bbox": [ + 105, + 361, + 402, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 225, + 378 + ], + "score": 1.0, + "content": "Value function: Define the", + "type": "text" + }, + { + "bbox": [ + 226, + 366, + 232, + 373 + ], + "score": 0.79, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 361, + 383, + 378 + ], + "score": 1.0, + "content": "-regularized value function for policy", + "type": "text" + }, + { + "bbox": [ + 383, + 366, + 389, + 375 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 361, + 402, + 378 + ], + "score": 1.0, + "content": "as", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 361, + 402, + 378 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 212, + 381, + 398, + 410 + ], + "lines": [ + { + "bbox": [ + 212, + 381, + 398, + 410 + ], + "spans": [ + { + "bbox": [ + 212, + 381, + 398, + 410 + ], + "score": 0.93, + "content": "V _ { \\alpha } ^ { \\pi , q } ( \\boldsymbol { x } ) = \\mathbb { E } _ { q } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } r _ { \\alpha } ^ { \\pi , q } ( \\boldsymbol { x } _ { t } , a _ { t } ) | \\boldsymbol { x } _ { 0 } = \\boldsymbol { x } , q \\Big ] .", + "type": "interline_equation", + "image_path": "4f5602e99a52b3bbbfced2c9d8c1c6cec1445d1690ec985743dde120900363df.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 212, + 381, + 398, + 410 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 416, + 263, + 428 + ], + "lines": [ + { + "bbox": [ + 105, + 416, + 263, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 263, + 429 + ], + "score": 1.0, + "content": "and the non-regularized value function", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 416, + 263, + 429 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 221, + 434, + 389, + 464 + ], + "lines": [ + { + "bbox": [ + 221, + 434, + 389, + 464 + ], + "spans": [ + { + "bbox": [ + 221, + 434, + 389, + 464 + ], + "score": 0.94, + "content": "V ^ { q } ( x ) = \\mathbb { E } _ { q } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } r ( x _ { t } , a _ { t } ) | x _ { 0 } = x , q \\Big ] .", + "type": "interline_equation", + "image_path": "2f7fd48b4d6c6c7288755235956d88617509e88daeb0635db7ca46060c49b50b.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 221, + 434, + 389, + 464 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 469, + 432, + 482 + ], + "lines": [ + { + "bbox": [ + 105, + 467, + 433, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 204, + 484 + ], + "score": 1.0, + "content": "Proposition 1. For any", + "type": "text" + }, + { + "bbox": [ + 204, + 470, + 232, + 482 + ], + "score": 0.91, + "content": "q , \\pi , V", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 467, + 271, + 484 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 272, + 470, + 318, + 482 + ], + "score": 0.92, + "content": "V _ { \\alpha } ^ { \\pi , q } \\leq V ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 467, + 336, + 484 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 337, + 470, + 397, + 482 + ], + "score": 0.91, + "content": "T _ { \\alpha } ^ { \\pi , q } V \\le T ^ { q } V", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 467, + 433, + 484 + ], + "score": 1.0, + "content": ". Indeed", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 467, + 433, + 484 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 207, + 488, + 403, + 515 + ], + "lines": [ + { + "bbox": [ + 207, + 488, + 403, + 515 + ], + "spans": [ + { + "bbox": [ + 207, + 488, + 403, + 515 + ], + "score": 0.93, + "content": "\\mathbb { E } _ { q } \\Big [ \\log \\frac { q \\big ( a _ { t } | x _ { t } \\big ) } { \\pi \\big ( a _ { t } | x _ { t } \\big ) } \\Big ] = K L \\big ( q ( \\cdot | x _ { t } ) \\| \\pi ( \\cdot | x _ { t } ) \\big ) \\geq 0 .", + "type": "interline_equation", + "image_path": "a64cd95e6d312561d3379d282bc2d9cd023b8307018318681d5a181e94947f9e.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 207, + 488, + 403, + 515 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 527, + 504, + 551 + ], + "lines": [ + { + "bbox": [ + 105, + 525, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 457, + 542 + ], + "score": 1.0, + "content": "Optimal value function and policy Define the optimal regularized value function:", + "type": "text" + }, + { + "bbox": [ + 457, + 528, + 505, + 540 + ], + "score": 0.89, + "content": "V _ { \\alpha } ^ { \\pi , * } ( x ) =", + "type": "inline_equation" + } + ], + "index": 19 + }, + { + "bbox": [ + 107, + 537, + 464, + 553 + ], + "spans": [ + { + "bbox": [ + 107, + 539, + 165, + 551 + ], + "score": 0.93, + "content": "\\operatorname* { m a x } _ { q } V _ { \\alpha } ^ { \\pi , q } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 537, + 369, + 553 + ], + "score": 1.0, + "content": ", and the optimal (non-regularized) value function:", + "type": "text" + }, + { + "bbox": [ + 369, + 538, + 460, + 551 + ], + "score": 0.92, + "content": "V ^ { * } ( x ) = \\operatorname* { m a x } _ { q } V ^ { q } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 537, + 464, + 553 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 525, + 505, + 553 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 555, + 504, + 579 + ], + "lines": [ + { + "bbox": [ + 105, + 553, + 506, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 553, + 214, + 570 + ], + "score": 1.0, + "content": "The optimal policy of the", + "type": "text" + }, + { + "bbox": [ + 215, + 558, + 222, + 565 + ], + "score": 0.76, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 553, + 309, + 570 + ], + "score": 1.0, + "content": "-regularized problem", + "type": "text" + }, + { + "bbox": [ + 309, + 555, + 436, + 568 + ], + "score": 0.91, + "content": "q _ { \\alpha } ^ { \\pi , * } ( \\cdot | x ) = \\arg \\operatorname* { m a x } _ { q } V _ { \\alpha } ^ { \\pi , q } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 553, + 506, + 570 + ], + "score": 1.0, + "content": "and the optimal", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 566, + 360, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 260, + 579 + ], + "score": 1.0, + "content": "policy of the non-regularized problem", + "type": "text" + }, + { + "bbox": [ + 261, + 567, + 356, + 579 + ], + "score": 0.91, + "content": "q ^ { * } ( \\cdot | x ) = \\arg \\operatorname* { m a x } _ { q } V ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 566, + 360, + 579 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 553, + 506, + 579 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 582, + 502, + 605 + ], + "lines": [ + { + "bbox": [ + 104, + 579, + 506, + 599 + ], + "spans": [ + { + "bbox": [ + 104, + 579, + 223, + 599 + ], + "score": 1.0, + "content": "Proposition 2. We have that", + "type": "text" + }, + { + "bbox": [ + 223, + 582, + 244, + 594 + ], + "score": 0.91, + "content": "V _ { \\alpha } ^ { \\pi , q }", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 579, + 352, + 599 + ], + "score": 1.0, + "content": "is the unique fixed point of", + "type": "text" + }, + { + "bbox": [ + 352, + 583, + 372, + 594 + ], + "score": 0.89, + "content": "T _ { \\alpha } ^ { \\pi , q }", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 579, + 393, + 599 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 394, + 583, + 407, + 592 + ], + "score": 0.85, + "content": "V ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 579, + 506, + 599 + ], + "score": 1.0, + "content": "is the unique fixed point", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 593, + 388, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 593, + 117, + 606 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 117, + 594, + 129, + 603 + ], + "score": 0.82, + "content": "T ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 593, + 356, + 606 + ], + "score": 1.0, + "content": ". Thus we have the following Bellman equations: For all", + "type": "text" + }, + { + "bbox": [ + 356, + 594, + 383, + 603 + ], + "score": 0.89, + "content": "x \\in X", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 593, + 388, + 606 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 104, + 579, + 506, + 606 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 167, + 610, + 441, + 709 + ], + "lines": [ + { + "bbox": [ + 167, + 610, + 441, + 709 + ], + "spans": [ + { + "bbox": [ + 167, + 610, + 441, + 709 + ], + "score": 0.95, + "content": "\\begin{array} { r c l } { { V _ { \\alpha } ^ { \\pi , q } ( x ) } } & { { = } } & { { \\displaystyle \\sum _ { a } q ( a | x ) \\Big [ r _ { \\alpha } ^ { \\pi , q } ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } \\big [ V _ { \\alpha } ^ { \\pi , q } ( y ) \\big ] \\Big ] } } \\\\ { { } } & { { } } & { { } } \\\\ { { V ^ { q } ( x ) } } & { { = } } & { { \\displaystyle \\sum _ { a } q ( a | x ) \\Big [ r ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } \\big [ V ^ { q } ( y ) \\big ] \\Big ] } } \\\\ { { } } & { { } } & { { } } \\\\ { { V _ { \\alpha } ^ { \\pi , * } ( x ) } } & { { = } } & { { \\displaystyle r _ { \\alpha } ^ { \\pi , q _ { \\alpha } ^ { \\pi , * } } ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } \\big [ V _ { \\alpha } ^ { \\pi , * } ( y ) \\big ] f o r a l l a \\in A , } } \\\\ { { } } & { { } } & { { } } \\\\ { { V ^ { * } ( x ) } } & { { = } } & { { \\displaystyle \\operatorname* { m a x } _ { a \\in A } \\Big [ r ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } \\big [ V ^ { * } ( y ) \\big ] \\Big ] . } } \\end{array}", + "type": "interline_equation", + "image_path": "66a75351c24b47e29e8ad0475f6feb00abfe1985e8f74a3c359f94cd4b27f79c.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 167, + 610, + 441, + 643.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 167, + 643.0, + 441, + 676.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 167, + 676.0, + 441, + 709.0 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 103, + 720, + 462, + 733 + ], + "lines": [ + { + "bbox": [ + 104, + 717, + 464, + 735 + ], + "spans": [ + { + "bbox": [ + 104, + 717, + 254, + 735 + ], + "score": 1.0, + "content": "Notice that (16) holds for all actions", + "type": "text" + }, + { + "bbox": [ + 254, + 722, + 279, + 731 + ], + "score": 0.89, + "content": "a \\in A", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 717, + 396, + 735 + ], + "score": 1.0, + "content": ", and not in expectation w.r.t.", + "type": "text" + }, + { + "bbox": [ + 396, + 720, + 439, + 732 + ], + "score": 0.93, + "content": "a \\sim q ( \\cdot | x )", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 717, + 464, + 735 + ], + "score": 1.0, + "content": "only.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 104, + 717, + 464, + 735 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 82, + 305, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 306, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 306, + 95 + ], + "score": 1.0, + "content": "A.2 REGULARIZED JOINT POLICY GRADIENT", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 102, + 505, + 136 + ], + "lines": [ + { + "bbox": [ + 106, + 102, + 505, + 116 + ], + "spans": [ + { + "bbox": [ + 106, + 102, + 272, + 116 + ], + "score": 1.0, + "content": "We now consider a parametrized policy", + "type": "text" + }, + { + "bbox": [ + 272, + 105, + 284, + 114 + ], + "score": 0.86, + "content": "\\pi _ { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 102, + 505, + 116 + ], + "score": 1.0, + "content": "and consider maximizing the regularized joint policy", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 114, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 106, + 114, + 294, + 127 + ], + "score": 1.0, + "content": "optimization problem for a given initial state", + "type": "text" + }, + { + "bbox": [ + 295, + 116, + 307, + 126 + ], + "score": 0.85, + "content": "x _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 114, + 505, + 127 + ], + "score": 1.0, + "content": "(this could be a distribution over initial states).", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 124, + 349, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 124, + 242, + 137 + ], + "score": 1.0, + "content": "Thus we want to find a parameter", + "type": "text" + }, + { + "bbox": [ + 243, + 126, + 249, + 135 + ], + "score": 0.81, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 124, + 349, + 137 + ], + "score": 1.0, + "content": "that (locally) maximizes", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "interline_equation", + "bbox": [ + 144, + 139, + 466, + 169 + ], + "lines": [ + { + "bbox": [ + 144, + 139, + 466, + 169 + ], + "spans": [ + { + "bbox": [ + 144, + 139, + 466, + 169 + ], + "score": 0.92, + "content": "\\mathcal { I } ( \\theta , q ) = V ^ { \\pi _ { \\theta } , q } ( \\boldsymbol { x } _ { 0 } ) = \\mathbb { E } _ { q } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } \\big ( r ( \\boldsymbol { x } _ { t } , a _ { t } ) - \\alpha \\mathrm { K L } ( q ( \\cdot | \\boldsymbol { x } _ { t } ) | | \\pi _ { \\theta } ( \\cdot | \\boldsymbol { x } _ { t } ) ) \\big ) \\big | \\boldsymbol { x } _ { 0 } , q \\Big ] .", + "type": "interline_equation", + "image_path": "5fb3af47931f1e293c60f069a4937af38754fd0e6032f29c13b2c5a0ed8f9a2c.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 144, + 139, + 466, + 149.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 144, + 149.0, + 466, + 159.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 144, + 159.0, + 466, + 169.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 177, + 505, + 200 + ], + "lines": [ + { + "bbox": [ + 105, + 176, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 241, + 191 + ], + "score": 1.0, + "content": "We start with an initial parameter", + "type": "text" + }, + { + "bbox": [ + 242, + 178, + 252, + 189 + ], + "score": 0.89, + "content": "\\theta _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 176, + 387, + 191 + ], + "score": 1.0, + "content": "and define a sequence of policies", + "type": "text" + }, + { + "bbox": [ + 387, + 180, + 423, + 190 + ], + "score": 0.91, + "content": "\\pi _ { i } = \\pi _ { \\theta _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 176, + 492, + 191 + ], + "score": 1.0, + "content": "parametrized by", + "type": "text" + }, + { + "bbox": [ + 492, + 178, + 501, + 189 + ], + "score": 0.85, + "content": "\\theta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 176, + 505, + 191 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 187, + 195, + 202 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 195, + 202 + ], + "score": 1.0, + "content": "in the following way:", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 132, + 208, + 208, + 221 + ], + "lines": [ + { + "bbox": [ + 132, + 206, + 209, + 222 + ], + "spans": [ + { + "bbox": [ + 132, + 206, + 168, + 222 + ], + "score": 1.0, + "content": "• Given", + "type": "text" + }, + { + "bbox": [ + 169, + 209, + 178, + 220 + ], + "score": 0.86, + "content": "\\theta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 206, + 209, + 222 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "interline_equation", + "bbox": [ + 269, + 217, + 376, + 237 + ], + "lines": [ + { + "bbox": [ + 269, + 217, + 376, + 237 + ], + "spans": [ + { + "bbox": [ + 269, + 217, + 376, + 237 + ], + "score": 0.93, + "content": "q _ { i } = \\arg \\operatorname* { m a x } _ { q } T _ { \\alpha } ^ { \\pi _ { \\theta _ { i } } , q } V ^ { \\pi _ { \\theta _ { i } } } ,", + "type": "interline_equation", + "image_path": "a231be82b298c49b858d95221233146488ec6ad66e7a6e4f2f7085b7f45643eb.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 269, + 217, + 376, + 237 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 132, + 240, + 203, + 253 + ], + "lines": [ + { + "bbox": [ + 131, + 239, + 204, + 254 + ], + "spans": [ + { + "bbox": [ + 131, + 239, + 171, + 254 + ], + "score": 1.0, + "content": "• Define", + "type": "text" + }, + { + "bbox": [ + 172, + 241, + 190, + 253 + ], + "score": 0.91, + "content": "\\theta _ { i + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 239, + 204, + 254 + ], + "score": 1.0, + "content": "as", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "interline_equation", + "bbox": [ + 190, + 255, + 456, + 285 + ], + "lines": [ + { + "bbox": [ + 190, + 255, + 456, + 285 + ], + "spans": [ + { + "bbox": [ + 190, + 255, + 456, + 285 + ], + "score": 0.92, + "content": "\\theta _ { i + 1 } = \\theta _ { i } - \\beta \\nabla _ { \\theta } \\mathbb { E } _ { \\pi _ { i } } \\left[ \\sum _ { t \\geq 0 } \\gamma ^ { t } \\mathrm { K L } \\big ( q _ { k } ( \\cdot | x _ { t } ) | | \\pi _ { \\theta } ( \\cdot | x _ { t } ) \\big ) _ { | \\theta = \\theta _ { i } } \\big | x _ { 0 } , \\pi _ { i } \\right] .", + "type": "interline_equation", + "image_path": "1bee90d5ff4b76d736775fa10d00f95f791d305affcfca00910bdf2205cf6e2f.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 190, + 255, + 456, + 265.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 190, + 265.0, + 456, + 275.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 190, + 275.0, + 456, + 285.0 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 285, + 307, + 298 + ], + "lines": [ + { + "bbox": [ + 105, + 284, + 307, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 307, + 300 + ], + "score": 1.0, + "content": "Proposition 3. We have the following properties:", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 132, + 306, + 233, + 318 + ], + "lines": [ + { + "bbox": [ + 131, + 304, + 235, + 320 + ], + "spans": [ + { + "bbox": [ + 131, + 304, + 186, + 320 + ], + "score": 1.0, + "content": "• The policy", + "type": "text" + }, + { + "bbox": [ + 187, + 308, + 195, + 318 + ], + "score": 0.81, + "content": "q _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 304, + 235, + 320 + ], + "score": 1.0, + "content": "satisfies:", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "interline_equation", + "bbox": [ + 253, + 321, + 393, + 352 + ], + "lines": [ + { + "bbox": [ + 253, + 321, + 393, + 352 + ], + "spans": [ + { + "bbox": [ + 253, + 321, + 393, + 352 + ], + "score": 0.95, + "content": "q _ { i } ( a | x ) = \\frac { \\pi _ { i } ( a | x ) e ^ { \\frac { 1 } { \\alpha } Q ^ { \\pi _ { i } } ( x , a ) } } { \\mathbb { E } _ { b \\sim \\pi _ { i } ( \\cdot | x ) } \\big [ e ^ { \\frac { 1 } { \\alpha } Q ^ { \\pi _ { i } } ( x , b ) } \\big ] } ,", + "type": "interline_equation", + "image_path": "c85329b4c21ece37a61527077e5df064603bd4e849bef91be85db126d0c9a8ec.jpg" + } + ] + } + ], + "index": 17.5, + "virtual_lines": [ + { + "bbox": [ + 253, + 321, + 393, + 336.5 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 253, + 336.5, + 393, + 352.0 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 142, + 355, + 338, + 369 + ], + "lines": [ + { + "bbox": [ + 140, + 352, + 337, + 372 + ], + "spans": [ + { + "bbox": [ + 140, + 352, + 169, + 372 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 169, + 355, + 337, + 369 + ], + "score": 0.9, + "content": "Q ^ { \\pi } ( x , a ) = r ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } V ^ { \\pi } ( y ) .", + "type": "inline_equation" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 132, + 374, + 178, + 386 + ], + "lines": [ + { + "bbox": [ + 132, + 373, + 178, + 387 + ], + "spans": [ + { + "bbox": [ + 132, + 373, + 178, + 387 + ], + "score": 1.0, + "content": "• We have", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "interline_equation", + "bbox": [ + 293, + 385, + 353, + 398 + ], + "lines": [ + { + "bbox": [ + 293, + 385, + 353, + 398 + ], + "spans": [ + { + "bbox": [ + 293, + 385, + 353, + 398 + ], + "score": 0.92, + "content": "V _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } \\geq V ^ { \\pi _ { i } } .", + "type": "interline_equation", + "image_path": "f79df8ab2ba40bba18fbcac661d65d3983e2c2668c1a540bbe267aeb7f8f8b95.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 293, + 385, + 353, + 398 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 133, + 405, + 273, + 417 + ], + "lines": [ + { + "bbox": [ + 132, + 405, + 273, + 418 + ], + "spans": [ + { + "bbox": [ + 132, + 405, + 273, + 418 + ], + "score": 1.0, + "content": "• For η sufficiently small, we have", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "interline_equation", + "bbox": [ + 255, + 420, + 391, + 434 + ], + "lines": [ + { + "bbox": [ + 255, + 420, + 391, + 434 + ], + "spans": [ + { + "bbox": [ + 255, + 420, + 391, + 434 + ], + "score": 0.91, + "content": "\\mathcal { I } ( \\theta _ { i + 1 } , q _ { i + 1 } ) \\geq \\mathcal { I } ( \\theta _ { i } , q _ { i } ) + c g _ { i } ,", + "type": "interline_equation", + "image_path": "ac411152811a0f9ec2767761960d1140849565463498b556c838ffc1a9c268fb.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 255, + 420, + 391, + 434 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 142, + 437, + 504, + 460 + ], + "lines": [ + { + "bbox": [ + 141, + 436, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 141, + 436, + 300, + 450 + ], + "score": 1.0, + "content": "where c is a numerical constant, and", + "type": "text" + }, + { + "bbox": [ + 301, + 439, + 310, + 449 + ], + "score": 0.84, + "content": "g _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 436, + 505, + 450 + ], + "score": 1.0, + "content": "is the norm of the gradient (minimized by the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 141, + 447, + 191, + 461 + ], + "spans": [ + { + "bbox": [ + 141, + 447, + 191, + 461 + ], + "score": 1.0, + "content": "algorithm):", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "interline_equation", + "bbox": [ + 204, + 462, + 442, + 492 + ], + "lines": [ + { + "bbox": [ + 204, + 462, + 442, + 492 + ], + "spans": [ + { + "bbox": [ + 204, + 462, + 442, + 492 + ], + "score": 0.94, + "content": "g _ { i } = \\Big \\| \\nabla _ { \\theta } \\mathbb { E } _ { \\pi _ { i } } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } K L \\big ( q _ { i } ( \\cdot | x _ { t } ) \\| \\pi _ { \\theta } ( \\cdot | x _ { t } ) \\big ) _ { | \\theta = \\theta _ { i } } \\big | x _ { 0 } , \\pi _ { i } \\Big ] \\Big \\| .", + "type": "interline_equation", + "image_path": "3beb61cab24715a6c37c66b8506906fb14e67845ec9f6243b0d72435b8db5c51.jpg" + } + ] + } + ], + "index": 26.5, + "virtual_lines": [ + { + "bbox": [ + 204, + 462, + 442, + 477.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 204, + 477.0, + 442, + 492.0 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 142, + 501, + 505, + 557 + ], + "lines": [ + { + "bbox": [ + 142, + 501, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 142, + 501, + 294, + 515 + ], + "score": 1.0, + "content": "Thus we build a sequence of policies", + "type": "text" + }, + { + "bbox": [ + 294, + 502, + 327, + 514 + ], + "score": 0.92, + "content": "( \\pi _ { \\theta _ { i } } , q _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 501, + 385, + 515 + ], + "score": 1.0, + "content": "whose values", + "type": "text" + }, + { + "bbox": [ + 386, + 502, + 423, + 514 + ], + "score": 0.93, + "content": "\\mathcal { I } ( \\theta _ { i } , q _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 501, + 505, + 515 + ], + "score": 1.0, + "content": "are non-decreasing", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 141, + 512, + 504, + 525 + ], + "spans": [ + { + "bbox": [ + 141, + 512, + 497, + 525 + ], + "score": 1.0, + "content": "thus converge to a local maximum. In addition, the improvement is lower-bounded by", + "type": "text" + }, + { + "bbox": [ + 498, + 515, + 504, + 523 + ], + "score": 0.51, + "content": "a", + "type": "inline_equation" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 524, + 505, + 536 + ], + "spans": [ + { + "bbox": [ + 141, + 524, + 505, + 536 + ], + "score": 1.0, + "content": "constant times the norm of the gradient, thus the algorithm keeps improving the perfor-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 141, + 534, + 505, + 547 + ], + "spans": [ + { + "bbox": [ + 141, + 534, + 505, + 547 + ], + "score": 1.0, + "content": "mance until the gradient vanishes (when we reach the limit of the capacity of our represen-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 141, + 545, + 174, + 558 + ], + "spans": [ + { + "bbox": [ + 141, + 545, + 174, + 558 + ], + "score": 1.0, + "content": "tation).", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 106, + 569, + 172, + 581 + ], + "lines": [ + { + "bbox": [ + 105, + 568, + 173, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 173, + 582 + ], + "score": 1.0, + "content": "Proof. We have", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "interline_equation", + "bbox": [ + 142, + 585, + 468, + 621 + ], + "lines": [ + { + "bbox": [ + 142, + 585, + 468, + 621 + ], + "spans": [ + { + "bbox": [ + 142, + 585, + 468, + 621 + ], + "score": 0.93, + "content": "\\begin{array} { r l r } { q _ { i } ( \\cdot | x ) } & { = } & { \\arg \\underset { q } { \\operatorname* { m a x } } \\mathbb { E } _ { a \\sim q ( \\cdot | x ) } \\Big [ \\underset { Q ^ { \\pi _ { i } } ( x , a ) } { \\underbrace { r \\big ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } V ^ { \\pi _ { i } } ( y ) } } - \\alpha \\log \\frac { q \\big ( a | x \\big ) } { \\pi _ { i } \\big ( a | x \\big ) } \\Big ] , } \\end{array}", + "type": "interline_equation", + "image_path": "b7f089d1a8523c5975d650c2cbc3c73cec952033c50a4f0c6b61d739dac54719.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 142, + 585, + 468, + 597.0 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 142, + 597.0, + 468, + 609.0 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 142, + 609.0, + 468, + 621.0 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 624, + 381, + 636 + ], + "lines": [ + { + "bbox": [ + 105, + 623, + 381, + 638 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 334, + 638 + ], + "score": 1.0, + "content": "from which we deduce (19). Now, from the definition of", + "type": "text" + }, + { + "bbox": [ + 334, + 627, + 342, + 636 + ], + "score": 0.85, + "content": "q _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 623, + 381, + 638 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "interline_equation", + "bbox": [ + 217, + 640, + 393, + 653 + ], + "lines": [ + { + "bbox": [ + 217, + 640, + 393, + 653 + ], + "spans": [ + { + "bbox": [ + 217, + 640, + 393, + 653 + ], + "score": 0.93, + "content": "T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } V ^ { \\pi _ { i } } \\geq T _ { \\alpha } ^ { \\pi _ { i } , \\pi _ { i } } V ^ { \\pi _ { i } } = T ^ { \\pi _ { i } } V ^ { \\pi _ { i } } = V ^ { \\pi _ { i } } .", + "type": "interline_equation", + "image_path": "04f39d59eb33e246cbee27b1aada1d93ea563fdcd209acdee360483348da0a8c.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 217, + 640, + 393, + 653 + ], + "spans": [], + "index": 38 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 656, + 504, + 680 + ], + "lines": [ + { + "bbox": [ + 103, + 653, + 503, + 681 + ], + "spans": [ + { + "bbox": [ + 103, + 653, + 153, + 681 + ], + "score": 1.0, + "content": "Now, since and its fixe", + "type": "text" + }, + { + "bbox": [ + 153, + 657, + 179, + 669 + ], + "score": 0.91, + "content": "T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 653, + 190, + 681 + ], + "score": 1.0, + "content": "is is", + "type": "text" + }, + { + "bbox": [ + 216, + 653, + 303, + 681 + ], + "score": 1.0, + "content": "otone operator (i.e. if , we have", + "type": "text" + }, + { + "bbox": [ + 303, + 657, + 339, + 668 + ], + "score": 0.92, + "content": "V _ { 1 } \\geq V _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 653, + 415, + 681 + ], + "score": 1.0, + "content": "elementwise, then", + "type": "text" + }, + { + "bbox": [ + 415, + 657, + 503, + 669 + ], + "score": 0.92, + "content": "T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } V _ { 1 } \\geq T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } V _ { 2 } )", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 190, + 668, + 216, + 680 + ], + "spans": [ + { + "bbox": [ + 190, + 668, + 216, + 680 + ], + "score": 0.92, + "content": "V _ { \\alpha } ^ { \\pi _ { i } , q _ { i } }", + "type": "inline_equation" + } + ], + "index": 40 + } + ], + "index": 39.5 + }, + { + "type": "interline_equation", + "bbox": [ + 233, + 682, + 377, + 700 + ], + "lines": [ + { + "bbox": [ + 233, + 682, + 377, + 700 + ], + "spans": [ + { + "bbox": [ + 233, + 682, + 377, + 700 + ], + "score": 0.94, + "content": "V _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } = \\operatorname* { l i m } _ { t \\to \\infty } ( T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } ) ^ { t } V ^ { \\pi _ { i } } \\geq V ^ { \\pi _ { i } } ,", + "type": "interline_equation", + "image_path": "b5406ec4758472f538cfbf40ab29a64c9cbd02afff188b0f7c935c8b0aff3228.jpg" + } + ] + } + ], + "index": 41, + "virtual_lines": [ + { + "bbox": [ + 233, + 682, + 377, + 700 + ], + "spans": [], + "index": 41 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 703, + 182, + 715 + ], + "lines": [ + { + "bbox": [ + 106, + 702, + 184, + 717 + ], + "spans": [ + { + "bbox": [ + 106, + 702, + 184, + 717 + ], + "score": 1.0, + "content": "which proves (20).", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 42 + }, + { + "type": "text", + "bbox": [ + 106, + 720, + 339, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 718, + 339, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 718, + 339, + 734 + ], + "score": 1.0, + "content": "Now, in order to prove (21) we derive the following steps.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 43 + } + ], + "page_idx": 14, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "15", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 82, + 305, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 306, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 306, + 95 + ], + "score": 1.0, + "content": "A.2 REGULARIZED JOINT POLICY GRADIENT", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 102, + 505, + 136 + ], + "lines": [ + { + "bbox": [ + 106, + 102, + 505, + 116 + ], + "spans": [ + { + "bbox": [ + 106, + 102, + 272, + 116 + ], + "score": 1.0, + "content": "We now consider a parametrized policy", + "type": "text" + }, + { + "bbox": [ + 272, + 105, + 284, + 114 + ], + "score": 0.86, + "content": "\\pi _ { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 102, + 505, + 116 + ], + "score": 1.0, + "content": "and consider maximizing the regularized joint policy", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 114, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 106, + 114, + 294, + 127 + ], + "score": 1.0, + "content": "optimization problem for a given initial state", + "type": "text" + }, + { + "bbox": [ + 295, + 116, + 307, + 126 + ], + "score": 0.85, + "content": "x _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 114, + 505, + 127 + ], + "score": 1.0, + "content": "(this could be a distribution over initial states).", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 124, + 349, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 124, + 242, + 137 + ], + "score": 1.0, + "content": "Thus we want to find a parameter", + "type": "text" + }, + { + "bbox": [ + 243, + 126, + 249, + 135 + ], + "score": 0.81, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 124, + 349, + 137 + ], + "score": 1.0, + "content": "that (locally) maximizes", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 102, + 505, + 137 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 144, + 139, + 466, + 169 + ], + "lines": [ + { + "bbox": [ + 144, + 139, + 466, + 169 + ], + "spans": [ + { + "bbox": [ + 144, + 139, + 466, + 169 + ], + "score": 0.92, + "content": "\\mathcal { I } ( \\theta , q ) = V ^ { \\pi _ { \\theta } , q } ( \\boldsymbol { x } _ { 0 } ) = \\mathbb { E } _ { q } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } \\big ( r ( \\boldsymbol { x } _ { t } , a _ { t } ) - \\alpha \\mathrm { K L } ( q ( \\cdot | \\boldsymbol { x } _ { t } ) | | \\pi _ { \\theta } ( \\cdot | \\boldsymbol { x } _ { t } ) ) \\big ) \\big | \\boldsymbol { x } _ { 0 } , q \\Big ] .", + "type": "interline_equation", + "image_path": "5fb3af47931f1e293c60f069a4937af38754fd0e6032f29c13b2c5a0ed8f9a2c.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 144, + 139, + 466, + 149.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 144, + 149.0, + 466, + 159.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 144, + 159.0, + 466, + 169.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 177, + 505, + 200 + ], + "lines": [ + { + "bbox": [ + 105, + 176, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 241, + 191 + ], + "score": 1.0, + "content": "We start with an initial parameter", + "type": "text" + }, + { + "bbox": [ + 242, + 178, + 252, + 189 + ], + "score": 0.89, + "content": "\\theta _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 176, + 387, + 191 + ], + "score": 1.0, + "content": "and define a sequence of policies", + "type": "text" + }, + { + "bbox": [ + 387, + 180, + 423, + 190 + ], + "score": 0.91, + "content": "\\pi _ { i } = \\pi _ { \\theta _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 176, + 492, + 191 + ], + "score": 1.0, + "content": "parametrized by", + "type": "text" + }, + { + "bbox": [ + 492, + 178, + 501, + 189 + ], + "score": 0.85, + "content": "\\theta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 176, + 505, + 191 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 187, + 195, + 202 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 195, + 202 + ], + "score": 1.0, + "content": "in the following way:", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 176, + 505, + 202 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 208, + 208, + 221 + ], + "lines": [ + { + "bbox": [ + 132, + 206, + 209, + 222 + ], + "spans": [ + { + "bbox": [ + 132, + 206, + 168, + 222 + ], + "score": 1.0, + "content": "• Given", + "type": "text" + }, + { + "bbox": [ + 169, + 209, + 178, + 220 + ], + "score": 0.86, + "content": "\\theta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 206, + 209, + 222 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 132, + 206, + 209, + 222 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 269, + 217, + 376, + 237 + ], + "lines": [ + { + "bbox": [ + 269, + 217, + 376, + 237 + ], + "spans": [ + { + "bbox": [ + 269, + 217, + 376, + 237 + ], + "score": 0.93, + "content": "q _ { i } = \\arg \\operatorname* { m a x } _ { q } T _ { \\alpha } ^ { \\pi _ { \\theta _ { i } } , q } V ^ { \\pi _ { \\theta _ { i } } } ,", + "type": "interline_equation", + "image_path": "a231be82b298c49b858d95221233146488ec6ad66e7a6e4f2f7085b7f45643eb.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 269, + 217, + 376, + 237 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 132, + 240, + 203, + 253 + ], + "lines": [ + { + "bbox": [ + 131, + 239, + 204, + 254 + ], + "spans": [ + { + "bbox": [ + 131, + 239, + 171, + 254 + ], + "score": 1.0, + "content": "• Define", + "type": "text" + }, + { + "bbox": [ + 172, + 241, + 190, + 253 + ], + "score": 0.91, + "content": "\\theta _ { i + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 239, + 204, + 254 + ], + "score": 1.0, + "content": "as", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11, + "bbox_fs": [ + 131, + 239, + 204, + 254 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 190, + 255, + 456, + 285 + ], + "lines": [ + { + "bbox": [ + 190, + 255, + 456, + 285 + ], + "spans": [ + { + "bbox": [ + 190, + 255, + 456, + 285 + ], + "score": 0.92, + "content": "\\theta _ { i + 1 } = \\theta _ { i } - \\beta \\nabla _ { \\theta } \\mathbb { E } _ { \\pi _ { i } } \\left[ \\sum _ { t \\geq 0 } \\gamma ^ { t } \\mathrm { K L } \\big ( q _ { k } ( \\cdot | x _ { t } ) | | \\pi _ { \\theta } ( \\cdot | x _ { t } ) \\big ) _ { | \\theta = \\theta _ { i } } \\big | x _ { 0 } , \\pi _ { i } \\right] .", + "type": "interline_equation", + "image_path": "1bee90d5ff4b76d736775fa10d00f95f791d305affcfca00910bdf2205cf6e2f.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 190, + 255, + 456, + 265.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 190, + 265.0, + 456, + 275.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 190, + 275.0, + 456, + 285.0 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 285, + 307, + 298 + ], + "lines": [ + { + "bbox": [ + 105, + 284, + 307, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 307, + 300 + ], + "score": 1.0, + "content": "Proposition 3. We have the following properties:", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 284, + 307, + 300 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 306, + 233, + 318 + ], + "lines": [ + { + "bbox": [ + 131, + 304, + 235, + 320 + ], + "spans": [ + { + "bbox": [ + 131, + 304, + 186, + 320 + ], + "score": 1.0, + "content": "• The policy", + "type": "text" + }, + { + "bbox": [ + 187, + 308, + 195, + 318 + ], + "score": 0.81, + "content": "q _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 304, + 235, + 320 + ], + "score": 1.0, + "content": "satisfies:", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 131, + 304, + 235, + 320 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 253, + 321, + 393, + 352 + ], + "lines": [ + { + "bbox": [ + 253, + 321, + 393, + 352 + ], + "spans": [ + { + "bbox": [ + 253, + 321, + 393, + 352 + ], + "score": 0.95, + "content": "q _ { i } ( a | x ) = \\frac { \\pi _ { i } ( a | x ) e ^ { \\frac { 1 } { \\alpha } Q ^ { \\pi _ { i } } ( x , a ) } } { \\mathbb { E } _ { b \\sim \\pi _ { i } ( \\cdot | x ) } \\big [ e ^ { \\frac { 1 } { \\alpha } Q ^ { \\pi _ { i } } ( x , b ) } \\big ] } ,", + "type": "interline_equation", + "image_path": "c85329b4c21ece37a61527077e5df064603bd4e849bef91be85db126d0c9a8ec.jpg" + } + ] + } + ], + "index": 17.5, + "virtual_lines": [ + { + "bbox": [ + 253, + 321, + 393, + 336.5 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 253, + 336.5, + 393, + 352.0 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 142, + 355, + 338, + 369 + ], + "lines": [ + { + "bbox": [ + 140, + 352, + 337, + 372 + ], + "spans": [ + { + "bbox": [ + 140, + 352, + 169, + 372 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 169, + 355, + 337, + 369 + ], + "score": 0.9, + "content": "Q ^ { \\pi } ( x , a ) = r ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } V ^ { \\pi } ( y ) .", + "type": "inline_equation" + } + ], + "index": 19 + } + ], + "index": 19, + "bbox_fs": [ + 140, + 352, + 337, + 372 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 374, + 178, + 386 + ], + "lines": [ + { + "bbox": [ + 132, + 373, + 178, + 387 + ], + "spans": [ + { + "bbox": [ + 132, + 373, + 178, + 387 + ], + "score": 1.0, + "content": "• We have", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 132, + 373, + 178, + 387 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 293, + 385, + 353, + 398 + ], + "lines": [ + { + "bbox": [ + 293, + 385, + 353, + 398 + ], + "spans": [ + { + "bbox": [ + 293, + 385, + 353, + 398 + ], + "score": 0.92, + "content": "V _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } \\geq V ^ { \\pi _ { i } } .", + "type": "interline_equation", + "image_path": "f79df8ab2ba40bba18fbcac661d65d3983e2c2668c1a540bbe267aeb7f8f8b95.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 293, + 385, + 353, + 398 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 133, + 405, + 273, + 417 + ], + "lines": [ + { + "bbox": [ + 132, + 405, + 273, + 418 + ], + "spans": [ + { + "bbox": [ + 132, + 405, + 273, + 418 + ], + "score": 1.0, + "content": "• For η sufficiently small, we have", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22, + "bbox_fs": [ + 132, + 405, + 273, + 418 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 255, + 420, + 391, + 434 + ], + "lines": [ + { + "bbox": [ + 255, + 420, + 391, + 434 + ], + "spans": [ + { + "bbox": [ + 255, + 420, + 391, + 434 + ], + "score": 0.91, + "content": "\\mathcal { I } ( \\theta _ { i + 1 } , q _ { i + 1 } ) \\geq \\mathcal { I } ( \\theta _ { i } , q _ { i } ) + c g _ { i } ,", + "type": "interline_equation", + "image_path": "ac411152811a0f9ec2767761960d1140849565463498b556c838ffc1a9c268fb.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 255, + 420, + 391, + 434 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 142, + 437, + 504, + 460 + ], + "lines": [ + { + "bbox": [ + 141, + 436, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 141, + 436, + 300, + 450 + ], + "score": 1.0, + "content": "where c is a numerical constant, and", + "type": "text" + }, + { + "bbox": [ + 301, + 439, + 310, + 449 + ], + "score": 0.84, + "content": "g _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 436, + 505, + 450 + ], + "score": 1.0, + "content": "is the norm of the gradient (minimized by the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 141, + 447, + 191, + 461 + ], + "spans": [ + { + "bbox": [ + 141, + 447, + 191, + 461 + ], + "score": 1.0, + "content": "algorithm):", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 141, + 436, + 505, + 461 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 204, + 462, + 442, + 492 + ], + "lines": [ + { + "bbox": [ + 204, + 462, + 442, + 492 + ], + "spans": [ + { + "bbox": [ + 204, + 462, + 442, + 492 + ], + "score": 0.94, + "content": "g _ { i } = \\Big \\| \\nabla _ { \\theta } \\mathbb { E } _ { \\pi _ { i } } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } K L \\big ( q _ { i } ( \\cdot | x _ { t } ) \\| \\pi _ { \\theta } ( \\cdot | x _ { t } ) \\big ) _ { | \\theta = \\theta _ { i } } \\big | x _ { 0 } , \\pi _ { i } \\Big ] \\Big \\| .", + "type": "interline_equation", + "image_path": "3beb61cab24715a6c37c66b8506906fb14e67845ec9f6243b0d72435b8db5c51.jpg" + } + ] + } + ], + "index": 26.5, + "virtual_lines": [ + { + "bbox": [ + 204, + 462, + 442, + 477.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 204, + 477.0, + 442, + 492.0 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 142, + 501, + 505, + 557 + ], + "lines": [ + { + "bbox": [ + 142, + 501, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 142, + 501, + 294, + 515 + ], + "score": 1.0, + "content": "Thus we build a sequence of policies", + "type": "text" + }, + { + "bbox": [ + 294, + 502, + 327, + 514 + ], + "score": 0.92, + "content": "( \\pi _ { \\theta _ { i } } , q _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 501, + 385, + 515 + ], + "score": 1.0, + "content": "whose values", + "type": "text" + }, + { + "bbox": [ + 386, + 502, + 423, + 514 + ], + "score": 0.93, + "content": "\\mathcal { I } ( \\theta _ { i } , q _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 501, + 505, + 515 + ], + "score": 1.0, + "content": "are non-decreasing", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 141, + 512, + 504, + 525 + ], + "spans": [ + { + "bbox": [ + 141, + 512, + 497, + 525 + ], + "score": 1.0, + "content": "thus converge to a local maximum. In addition, the improvement is lower-bounded by", + "type": "text" + }, + { + "bbox": [ + 498, + 515, + 504, + 523 + ], + "score": 0.51, + "content": "a", + "type": "inline_equation" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 524, + 505, + 536 + ], + "spans": [ + { + "bbox": [ + 141, + 524, + 505, + 536 + ], + "score": 1.0, + "content": "constant times the norm of the gradient, thus the algorithm keeps improving the perfor-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 141, + 534, + 505, + 547 + ], + "spans": [ + { + "bbox": [ + 141, + 534, + 505, + 547 + ], + "score": 1.0, + "content": "mance until the gradient vanishes (when we reach the limit of the capacity of our represen-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 141, + 545, + 174, + 558 + ], + "spans": [ + { + "bbox": [ + 141, + 545, + 174, + 558 + ], + "score": 1.0, + "content": "tation).", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30, + "bbox_fs": [ + 141, + 501, + 505, + 558 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 569, + 172, + 581 + ], + "lines": [ + { + "bbox": [ + 105, + 568, + 173, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 173, + 582 + ], + "score": 1.0, + "content": "Proof. We have", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33, + "bbox_fs": [ + 105, + 568, + 173, + 582 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 142, + 585, + 468, + 621 + ], + "lines": [ + { + "bbox": [ + 142, + 585, + 468, + 621 + ], + "spans": [ + { + "bbox": [ + 142, + 585, + 468, + 621 + ], + "score": 0.93, + "content": "\\begin{array} { r l r } { q _ { i } ( \\cdot | x ) } & { = } & { \\arg \\underset { q } { \\operatorname* { m a x } } \\mathbb { E } _ { a \\sim q ( \\cdot | x ) } \\Big [ \\underset { Q ^ { \\pi _ { i } } ( x , a ) } { \\underbrace { r \\big ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } V ^ { \\pi _ { i } } ( y ) } } - \\alpha \\log \\frac { q \\big ( a | x \\big ) } { \\pi _ { i } \\big ( a | x \\big ) } \\Big ] , } \\end{array}", + "type": "interline_equation", + "image_path": "b7f089d1a8523c5975d650c2cbc3c73cec952033c50a4f0c6b61d739dac54719.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 142, + 585, + 468, + 597.0 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 142, + 597.0, + 468, + 609.0 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 142, + 609.0, + 468, + 621.0 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 624, + 381, + 636 + ], + "lines": [ + { + "bbox": [ + 105, + 623, + 381, + 638 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 334, + 638 + ], + "score": 1.0, + "content": "from which we deduce (19). Now, from the definition of", + "type": "text" + }, + { + "bbox": [ + 334, + 627, + 342, + 636 + ], + "score": 0.85, + "content": "q _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 623, + 381, + 638 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 623, + 381, + 638 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 217, + 640, + 393, + 653 + ], + "lines": [ + { + "bbox": [ + 217, + 640, + 393, + 653 + ], + "spans": [ + { + "bbox": [ + 217, + 640, + 393, + 653 + ], + "score": 0.93, + "content": "T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } V ^ { \\pi _ { i } } \\geq T _ { \\alpha } ^ { \\pi _ { i } , \\pi _ { i } } V ^ { \\pi _ { i } } = T ^ { \\pi _ { i } } V ^ { \\pi _ { i } } = V ^ { \\pi _ { i } } .", + "type": "interline_equation", + "image_path": "04f39d59eb33e246cbee27b1aada1d93ea563fdcd209acdee360483348da0a8c.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 217, + 640, + 393, + 653 + ], + "spans": [], + "index": 38 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 656, + 504, + 680 + ], + "lines": [ + { + "bbox": [ + 103, + 653, + 503, + 681 + ], + "spans": [ + { + "bbox": [ + 103, + 653, + 153, + 681 + ], + "score": 1.0, + "content": "Now, since and its fixe", + "type": "text" + }, + { + "bbox": [ + 153, + 657, + 179, + 669 + ], + "score": 0.91, + "content": "T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 653, + 190, + 681 + ], + "score": 1.0, + "content": "is is", + "type": "text" + }, + { + "bbox": [ + 216, + 653, + 303, + 681 + ], + "score": 1.0, + "content": "otone operator (i.e. if , we have", + "type": "text" + }, + { + "bbox": [ + 303, + 657, + 339, + 668 + ], + "score": 0.92, + "content": "V _ { 1 } \\geq V _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 653, + 415, + 681 + ], + "score": 1.0, + "content": "elementwise, then", + "type": "text" + }, + { + "bbox": [ + 415, + 657, + 503, + 669 + ], + "score": 0.92, + "content": "T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } V _ { 1 } \\geq T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } V _ { 2 } )", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 190, + 668, + 216, + 680 + ], + "spans": [ + { + "bbox": [ + 190, + 668, + 216, + 680 + ], + "score": 0.92, + "content": "V _ { \\alpha } ^ { \\pi _ { i } , q _ { i } }", + "type": "inline_equation" + } + ], + "index": 40 + } + ], + "index": 39.5, + "bbox_fs": [ + 103, + 653, + 503, + 681 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 233, + 682, + 377, + 700 + ], + "lines": [ + { + "bbox": [ + 233, + 682, + 377, + 700 + ], + "spans": [ + { + "bbox": [ + 233, + 682, + 377, + 700 + ], + "score": 0.94, + "content": "V _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } = \\operatorname* { l i m } _ { t \\to \\infty } ( T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } ) ^ { t } V ^ { \\pi _ { i } } \\geq V ^ { \\pi _ { i } } ,", + "type": "interline_equation", + "image_path": "b5406ec4758472f538cfbf40ab29a64c9cbd02afff188b0f7c935c8b0aff3228.jpg" + } + ] + } + ], + "index": 41, + "virtual_lines": [ + { + "bbox": [ + 233, + 682, + 377, + 700 + ], + "spans": [], + "index": 41 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 703, + 182, + 715 + ], + "lines": [ + { + "bbox": [ + 106, + 702, + 184, + 717 + ], + "spans": [ + { + "bbox": [ + 106, + 702, + 184, + 717 + ], + "score": 1.0, + "content": "which proves (20).", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 42, + "bbox_fs": [ + 106, + 702, + 184, + 717 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 720, + 339, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 718, + 339, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 718, + 339, + 734 + ], + "score": 1.0, + "content": "Now, in order to prove (21) we derive the following steps.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 43, + "bbox_fs": [ + 105, + 718, + 339, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 335, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 332, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 236, + 97 + ], + "score": 1.0, + "content": "Step 1: From the definition of", + "type": "text" + }, + { + "bbox": [ + 236, + 84, + 255, + 95 + ], + "score": 0.87, + "content": "q _ { i + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 80, + 325, + 97 + ], + "score": 1.0, + "content": "we have, for any", + "type": "text" + }, + { + "bbox": [ + 325, + 86, + 332, + 92 + ], + "score": 0.75, + "content": "x", + "type": "inline_equation" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 95, + 514, + 111 + ], + "lines": [ + { + "bbox": [ + 111, + 95, + 514, + 111 + ], + "spans": [ + { + "bbox": [ + 111, + 95, + 514, + 111 + ], + "score": 0.84, + "content": "\\begin{array} { r } { \\tilde { \\Sigma } _ { a \\sim q _ { 4 } + 1 } \\left[ Q ^ { \\pi _ { i + 1 } } ( x , a ) \\right] - \\alpha \\mathbf { K L } \\left( q _ { i + 1 } ( \\cdot | x ) \\| \\pi _ { i + 1 } ( \\cdot | x ) \\right) \\geq \\mathbb { E } _ { a \\sim q _ { 4 } } \\left[ Q ^ { \\pi _ { i + 1 } } ( x , a ) \\right] - \\alpha \\mathbf { K L } \\left( q _ { i } ( \\cdot | x ) \\| \\pi _ { i + 1 } ( \\cdot | x ) \\right) } \\end{array}", + "type": "interline_equation", + "image_path": "552747ed5a6e20240a82619613d59708d93a9469b61b5717ae3776d2b71e4cb3.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 111, + 95, + 514, + 111 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 124, + 269, + 136 + ], + "lines": [ + { + "bbox": [ + 106, + 124, + 269, + 137 + ], + "spans": [ + { + "bbox": [ + 106, + 124, + 269, + 137 + ], + "score": 1.0, + "content": "Writing the functional that we minimize", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 138, + 402, + 167 + ], + "lines": [ + { + "bbox": [ + 186, + 138, + 402, + 167 + ], + "spans": [ + { + "bbox": [ + 186, + 138, + 402, + 167 + ], + "score": 0.92, + "content": "f ( \\pi , q , \\theta ) = \\mathbb { E } _ { \\pi } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } \\mathrm { K L } \\big ( q ( \\cdot | x _ { t } ) \\| \\pi _ { \\theta } ( \\cdot | x _ { t } ) \\big ) \\big | x _ { 0 } , \\pi \\Big ] ,", + "type": "interline_equation", + "image_path": "1f4b282a29f644d2f9bc8341e93165d2579b6e4b081ef15b9b49301cfa6be4ca.jpg" + } + ] + } + ], + "index": 3.5, + "virtual_lines": [ + { + "bbox": [ + 186, + 138, + 402, + 152.5 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 186, + 152.5, + 402, + 167.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 103, + 168, + 471, + 181 + ], + "lines": [ + { + "bbox": [ + 105, + 167, + 472, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 167, + 177, + 183 + ], + "score": 1.0, + "content": "the update rule is", + "type": "text" + }, + { + "bbox": [ + 177, + 169, + 296, + 181 + ], + "score": 0.92, + "content": "\\theta _ { i + 1 } = \\theta _ { i } - \\beta \\nabla _ { \\theta } f ( \\pi _ { i } , q _ { i } , \\theta _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 167, + 461, + 183 + ], + "score": 1.0, + "content": ". Thus we have that for sufficiently small", + "type": "text" + }, + { + "bbox": [ + 461, + 171, + 468, + 181 + ], + "score": 0.83, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 167, + 472, + 183 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 183, + 379, + 196 + ], + "lines": [ + { + "bbox": [ + 231, + 183, + 379, + 196 + ], + "spans": [ + { + "bbox": [ + 231, + 183, + 379, + 196 + ], + "score": 0.82, + "content": "f ( \\pi _ { i } , q _ { i } , \\theta _ { i + 1 } ) \\leq f ( \\pi _ { i } , q _ { i } , \\theta _ { i } ) - \\beta g _ { i } ,", + "type": "interline_equation", + "image_path": "b66ed1027d29baee2cee300451ac53827045f254feacb981ae17b3e6a814444a.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 231, + 183, + 379, + 196 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 198, + 237, + 213 + ], + "lines": [ + { + "bbox": [ + 105, + 195, + 237, + 214 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 133, + 214 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 198, + 233, + 213 + ], + "score": 0.93, + "content": "\\begin{array} { r } { g _ { i } = \\frac { 1 } { 2 } \\| \\nabla _ { \\theta } f ( \\pi _ { i } , q _ { i } , \\theta _ { i } ) \\| } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 195, + 237, + 214 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 222, + 207, + 234 + ], + "lines": [ + { + "bbox": [ + 105, + 221, + 208, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 194, + 235 + ], + "score": 1.0, + "content": "Step 2: Now define", + "type": "text" + }, + { + "bbox": [ + 195, + 223, + 204, + 232 + ], + "score": 0.84, + "content": "\\mathcal { F }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 221, + 208, + 235 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "interline_equation", + "bbox": [ + 132, + 235, + 478, + 298 + ], + "lines": [ + { + "bbox": [ + 132, + 235, + 478, + 298 + ], + "spans": [ + { + "bbox": [ + 132, + 235, + 478, + 298 + ], + "score": 0.93, + "content": "\\begin{array} { r c l } { \\mathcal { F } ( \\pi , q , \\theta , \\pi ^ { \\prime } ) } & { = } & { \\displaystyle \\mathbb { E } _ { \\pi } \\left[ \\sum _ { t \\geq 0 } \\gamma ^ { t } \\big ( \\mathbb { E } _ { a \\sim q } \\big [ Q ^ { \\pi ^ { \\prime } } ( x _ { t } , a ) \\big ] - \\alpha \\mathrm { K L } \\big ( q ( \\cdot | x _ { t } ) \\| \\pi _ { \\theta } ( \\cdot | x _ { t } ) \\big ) \\big ) \\big | x _ { 0 } , \\pi \\right] } \\\\ & { = } & { \\displaystyle \\delta _ { x _ { 0 } } \\big ( I - \\gamma P ^ { \\pi } \\big ) ^ { - 1 } T _ { \\alpha } ^ { \\pi _ { \\theta } , q } V ^ { \\pi ^ { \\prime } } } \\\\ & { = } & { \\delta _ { x _ { 0 } } \\big ( I - \\gamma P ^ { \\pi } \\big ) ^ { - 1 } T ^ { q } V ^ { \\pi ^ { \\prime } } - f ( \\pi , q , \\theta ) , } \\end{array}", + "type": "interline_equation", + "image_path": "993b4298f6e970d0f2e4670bc59e30344f4ff25766c36ccb063c73e26cbd300e.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 132, + 235, + 478, + 256.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 132, + 256.0, + 478, + 277.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 132, + 277.0, + 478, + 298.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 299, + 457, + 311 + ], + "lines": [ + { + "bbox": [ + 106, + 298, + 455, + 312 + ], + "spans": [ + { + "bbox": [ + 106, + 298, + 133, + 312 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 299, + 147, + 311 + ], + "score": 0.91, + "content": "\\delta _ { x _ { 0 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 298, + 263, + 312 + ], + "score": 1.0, + "content": "is a Dirac (in the row vector", + "type": "text" + }, + { + "bbox": [ + 263, + 300, + 275, + 310 + ], + "score": 0.84, + "content": "x _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 298, + 298, + 312 + ], + "score": 1.0, + "content": "), and", + "type": "text" + }, + { + "bbox": [ + 298, + 299, + 312, + 309 + ], + "score": 0.87, + "content": "P ^ { \\pi }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 298, + 448, + 312 + ], + "score": 1.0, + "content": "is the transition matrix for policy", + "type": "text" + }, + { + "bbox": [ + 448, + 302, + 455, + 309 + ], + "score": 0.75, + "content": "\\pi", + "type": "inline_equation" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 316, + 248, + 327 + ], + "lines": [ + { + "bbox": [ + 106, + 315, + 249, + 328 + ], + "spans": [ + { + "bbox": [ + 106, + 315, + 249, + 328 + ], + "score": 1.0, + "content": "From (22) and (23) we deduce that", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 329, + 419, + 358 + ], + "lines": [ + { + "bbox": [ + 192, + 329, + 419, + 358 + ], + "spans": [ + { + "bbox": [ + 192, + 329, + 419, + 358 + ], + "score": 0.92, + "content": "\\begin{array} { r c l } { \\mathcal { F } ( \\pi _ { i } , q _ { i + 1 } , \\theta _ { i + 1 } , \\pi _ { i + 1 } ) } & { \\geq } & { \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i + 1 } , \\pi _ { i + 1 } ) } \\\\ & { \\geq } & { \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i + 1 } ) + \\beta g _ { i } . } \\end{array}", + "type": "interline_equation", + "image_path": "8281c3095dc4a6dd13ecf9d780cf86802e6f3b12a3c26359dd90592202f86a3e.jpg" + } + ] + } + ], + "index": 14.5, + "virtual_lines": [ + { + "bbox": [ + 192, + 329, + 419, + 343.5 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 192, + 343.5, + 419, + 358.0 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 365, + 153, + 375 + ], + "lines": [ + { + "bbox": [ + 105, + 363, + 153, + 377 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 153, + 377 + ], + "score": 1.0, + "content": "We deduce", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "interline_equation", + "bbox": [ + 117, + 377, + 499, + 464 + ], + "lines": [ + { + "bbox": [ + 117, + 377, + 499, + 464 + ], + "spans": [ + { + "bbox": [ + 117, + 377, + 499, + 464 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathcal { F } ( \\pi _ { i } , q _ { i + 1 } , \\theta _ { i + 1 } , \\pi _ { i } ) } \\\\ { \\geq } & { \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i } ) + \\beta g _ { i } } \\\\ & { + \\mathcal { F } ( \\pi _ { i } , q _ { i + 1 } , \\theta _ { i + 1 } , \\pi _ { i } ) - \\mathcal { F } ( \\pi _ { i } , q _ { i + 1 } , \\theta _ { i + 1 } , \\pi _ { i + 1 } ) + \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i + 1 } ) - \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i } ) } \\\\ { = } & { \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i } ) + \\beta g _ { i } + } \\\\ & { \\mathbb { E } _ { \\pi _ { i } } \\Big [ \\displaystyle \\sum _ { t \\geq 0 } \\gamma ^ { t } \\big ( \\mathbb { E } _ { a \\sim q _ { i + 1 } } \\big [ Q ^ { \\pi _ { i } } ( x _ { t } , a ) - Q ^ { \\pi _ { i + 1 } } ( x _ { t } , a ) \\big ] - \\mathbb { E } _ { a \\sim q _ { i } } \\big [ Q ^ { \\pi _ { i } } ( x _ { t } , a ) - Q ^ { \\pi _ { i + 1 } } ( x _ { t } , a ) \\big ] \\big ) \\Big ] } \\end{array}", + "type": "interline_equation", + "image_path": "b6f5c5e6ee822b58dd2984629f7c3e6e4c8226af264d9b586eb8d198ae26c22c.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 117, + 377, + 499, + 406.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 117, + 406.0, + 499, + 435.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 117, + 435.0, + 499, + 464.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 488, + 163, + 500 + ], + "lines": [ + { + "bbox": [ + 105, + 487, + 164, + 501 + ], + "spans": [ + { + "bbox": [ + 105, + 487, + 164, + 501 + ], + "score": 1.0, + "content": "This rewrites:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "interline_equation", + "bbox": [ + 178, + 501, + 433, + 516 + ], + "lines": [ + { + "bbox": [ + 178, + 501, + 433, + 516 + ], + "spans": [ + { + "bbox": [ + 178, + 501, + 433, + 516 + ], + "score": 0.89, + "content": "\\delta _ { x _ { 0 } } ( I - \\gamma ^ { \\pi _ { i } } ) ^ { - 1 } \\big ( T _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } V ^ { \\pi _ { i } } - T _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } V ^ { \\pi _ { i } } \\big ) \\geq \\eta g _ { i } + O ( \\beta ^ { 2 } ) .", + "type": "interline_equation", + "image_path": "8f25845cb16cee1896d898bedf65d0cec51090548fd89b16c452956e7e7d89fd.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 178, + 501, + 433, + 516 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 524, + 423, + 536 + ], + "lines": [ + { + "bbox": [ + 106, + 523, + 423, + 538 + ], + "spans": [ + { + "bbox": [ + 106, + 523, + 345, + 538 + ], + "score": 1.0, + "content": "Step 3: Now a bit of algebra. For two stochastic matrices", + "type": "text" + }, + { + "bbox": [ + 345, + 525, + 354, + 534 + ], + "score": 0.86, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 523, + 372, + 538 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 372, + 524, + 383, + 534 + ], + "score": 0.88, + "content": "P ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 523, + 423, + 538 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "interline_equation", + "bbox": [ + 113, + 541, + 513, + 615 + ], + "lines": [ + { + "bbox": [ + 113, + 541, + 513, + 615 + ], + "spans": [ + { + "bbox": [ + 113, + 541, + 513, + 615 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { ( I - \\gamma P ) ^ { - 1 } } \\\\ { = } & { ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } + \\gamma ( I - \\gamma P ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } } \\\\ { = } & { ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } + \\gamma \\big [ ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } + \\gamma ( I - \\gamma P ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } \\big ] ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } } \\\\ { = } & { ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } + \\gamma ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } } \\\\ & { + \\gamma ^ { 2 } ( I - \\gamma P ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } . } \\end{array}", + "type": "interline_equation", + "image_path": "6833b9af9c4885f7be6be6eaabc73f30680d58070bd1fbf2d24a0be37741cfa4.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 113, + 541, + 513, + 565.6666666666666 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 113, + 565.6666666666666, + 513, + 590.3333333333333 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 113, + 590.3333333333333, + 513, + 614.9999999999999 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 633, + 505, + 657 + ], + "lines": [ + { + "bbox": [ + 104, + 631, + 506, + 649 + ], + "spans": [ + { + "bbox": [ + 104, + 631, + 298, + 649 + ], + "score": 1.0, + "content": "Applying this equality to the transition matrices", + "type": "text" + }, + { + "bbox": [ + 298, + 635, + 316, + 645 + ], + "score": 0.88, + "content": "P ^ { \\pi _ { k } }", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 631, + 334, + 649 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 335, + 635, + 361, + 645 + ], + "score": 0.89, + "content": "P ^ { \\pi _ { k + 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 631, + 402, + 649 + ], + "score": 1.0, + "content": "and since", + "type": "text" + }, + { + "bbox": [ + 402, + 634, + 501, + 647 + ], + "score": 0.92, + "content": "\\lVert P ^ { \\pi _ { k + 1 } } - P ^ { \\pi _ { k } } \\rVert = O ( \\eta )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 631, + 506, + 649 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 645, + 145, + 659 + ], + "spans": [ + { + "bbox": [ + 105, + 645, + 145, + 659 + ], + "score": 1.0, + "content": "we have:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "interline_equation", + "bbox": [ + 114, + 658, + 514, + 736 + ], + "lines": [ + { + "bbox": [ + 114, + 658, + 514, + 736 + ], + "spans": [ + { + "bbox": [ + 114, + 658, + 514, + 736 + ], + "score": 0.9, + "content": "\\begin{array} { r l } & { V _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } } \\\\ { = } & { ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } } \\\\ { = } & { ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } + \\gamma ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } ( P ^ { \\pi _ { i + 1 } } - P ^ { \\pi _ { i } } ) ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } + O ( \\beta ^ { 2 } ) } \\\\ { = } & { ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } + ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } ( r _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } - r _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } + \\gamma P ^ { \\pi _ { i + 1 } } - \\gamma P ^ { \\pi _ { i } } ) ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } } \\\\ { = } & { V _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } + ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } ( T _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i } + 1 } V ^ { \\pi _ { i } } - T _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } V ^ { \\pi _ { k } } ) + O ( \\beta ^ { 2 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "8bdebb9723dc34c32a537e413c81a04ddbece818013055ae73b233f81c4e75cd.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 114, + 658, + 514, + 684.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 114, + 684.0, + 514, + 710.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 114, + 710.0, + 514, + 736.0 + ], + "spans": [], + "index": 30 + } + ] + } + ], + "page_idx": 15, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 761 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "16", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 335, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 332, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 236, + 97 + ], + "score": 1.0, + "content": "Step 1: From the definition of", + "type": "text" + }, + { + "bbox": [ + 236, + 84, + 255, + 95 + ], + "score": 0.87, + "content": "q _ { i + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 80, + 325, + 97 + ], + "score": 1.0, + "content": "we have, for any", + "type": "text" + }, + { + "bbox": [ + 325, + 86, + 332, + 92 + ], + "score": 0.75, + "content": "x", + "type": "inline_equation" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 80, + 332, + 97 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 95, + 514, + 111 + ], + "lines": [ + { + "bbox": [ + 111, + 95, + 514, + 111 + ], + "spans": [ + { + "bbox": [ + 111, + 95, + 514, + 111 + ], + "score": 0.84, + "content": "\\begin{array} { r } { \\tilde { \\Sigma } _ { a \\sim q _ { 4 } + 1 } \\left[ Q ^ { \\pi _ { i + 1 } } ( x , a ) \\right] - \\alpha \\mathbf { K L } \\left( q _ { i + 1 } ( \\cdot | x ) \\| \\pi _ { i + 1 } ( \\cdot | x ) \\right) \\geq \\mathbb { E } _ { a \\sim q _ { 4 } } \\left[ Q ^ { \\pi _ { i + 1 } } ( x , a ) \\right] - \\alpha \\mathbf { K L } \\left( q _ { i } ( \\cdot | x ) \\| \\pi _ { i + 1 } ( \\cdot | x ) \\right) } \\end{array}", + "type": "interline_equation", + "image_path": "552747ed5a6e20240a82619613d59708d93a9469b61b5717ae3776d2b71e4cb3.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 111, + 95, + 514, + 111 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 124, + 269, + 136 + ], + "lines": [ + { + "bbox": [ + 106, + 124, + 269, + 137 + ], + "spans": [ + { + "bbox": [ + 106, + 124, + 269, + 137 + ], + "score": 1.0, + "content": "Writing the functional that we minimize", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2, + "bbox_fs": [ + 106, + 124, + 269, + 137 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 138, + 402, + 167 + ], + "lines": [ + { + "bbox": [ + 186, + 138, + 402, + 167 + ], + "spans": [ + { + "bbox": [ + 186, + 138, + 402, + 167 + ], + "score": 0.92, + "content": "f ( \\pi , q , \\theta ) = \\mathbb { E } _ { \\pi } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } \\mathrm { K L } \\big ( q ( \\cdot | x _ { t } ) \\| \\pi _ { \\theta } ( \\cdot | x _ { t } ) \\big ) \\big | x _ { 0 } , \\pi \\Big ] ,", + "type": "interline_equation", + "image_path": "1f4b282a29f644d2f9bc8341e93165d2579b6e4b081ef15b9b49301cfa6be4ca.jpg" + } + ] + } + ], + "index": 3.5, + "virtual_lines": [ + { + "bbox": [ + 186, + 138, + 402, + 152.5 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 186, + 152.5, + 402, + 167.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 103, + 168, + 471, + 181 + ], + "lines": [ + { + "bbox": [ + 105, + 167, + 472, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 167, + 177, + 183 + ], + "score": 1.0, + "content": "the update rule is", + "type": "text" + }, + { + "bbox": [ + 177, + 169, + 296, + 181 + ], + "score": 0.92, + "content": "\\theta _ { i + 1 } = \\theta _ { i } - \\beta \\nabla _ { \\theta } f ( \\pi _ { i } , q _ { i } , \\theta _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 167, + 461, + 183 + ], + "score": 1.0, + "content": ". Thus we have that for sufficiently small", + "type": "text" + }, + { + "bbox": [ + 461, + 171, + 468, + 181 + ], + "score": 0.83, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 167, + 472, + 183 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 167, + 472, + 183 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 183, + 379, + 196 + ], + "lines": [ + { + "bbox": [ + 231, + 183, + 379, + 196 + ], + "spans": [ + { + "bbox": [ + 231, + 183, + 379, + 196 + ], + "score": 0.82, + "content": "f ( \\pi _ { i } , q _ { i } , \\theta _ { i + 1 } ) \\leq f ( \\pi _ { i } , q _ { i } , \\theta _ { i } ) - \\beta g _ { i } ,", + "type": "interline_equation", + "image_path": "b66ed1027d29baee2cee300451ac53827045f254feacb981ae17b3e6a814444a.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 231, + 183, + 379, + 196 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 198, + 237, + 213 + ], + "lines": [ + { + "bbox": [ + 105, + 195, + 237, + 214 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 133, + 214 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 198, + 233, + 213 + ], + "score": 0.93, + "content": "\\begin{array} { r } { g _ { i } = \\frac { 1 } { 2 } \\| \\nabla _ { \\theta } f ( \\pi _ { i } , q _ { i } , \\theta _ { i } ) \\| } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 195, + 237, + 214 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 195, + 237, + 214 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 222, + 207, + 234 + ], + "lines": [ + { + "bbox": [ + 105, + 221, + 208, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 194, + 235 + ], + "score": 1.0, + "content": "Step 2: Now define", + "type": "text" + }, + { + "bbox": [ + 195, + 223, + 204, + 232 + ], + "score": 0.84, + "content": "\\mathcal { F }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 221, + 208, + 235 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 221, + 208, + 235 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 132, + 235, + 478, + 298 + ], + "lines": [ + { + "bbox": [ + 132, + 235, + 478, + 298 + ], + "spans": [ + { + "bbox": [ + 132, + 235, + 478, + 298 + ], + "score": 0.93, + "content": "\\begin{array} { r c l } { \\mathcal { F } ( \\pi , q , \\theta , \\pi ^ { \\prime } ) } & { = } & { \\displaystyle \\mathbb { E } _ { \\pi } \\left[ \\sum _ { t \\geq 0 } \\gamma ^ { t } \\big ( \\mathbb { E } _ { a \\sim q } \\big [ Q ^ { \\pi ^ { \\prime } } ( x _ { t } , a ) \\big ] - \\alpha \\mathrm { K L } \\big ( q ( \\cdot | x _ { t } ) \\| \\pi _ { \\theta } ( \\cdot | x _ { t } ) \\big ) \\big ) \\big | x _ { 0 } , \\pi \\right] } \\\\ & { = } & { \\displaystyle \\delta _ { x _ { 0 } } \\big ( I - \\gamma P ^ { \\pi } \\big ) ^ { - 1 } T _ { \\alpha } ^ { \\pi _ { \\theta } , q } V ^ { \\pi ^ { \\prime } } } \\\\ & { = } & { \\delta _ { x _ { 0 } } \\big ( I - \\gamma P ^ { \\pi } \\big ) ^ { - 1 } T ^ { q } V ^ { \\pi ^ { \\prime } } - f ( \\pi , q , \\theta ) , } \\end{array}", + "type": "interline_equation", + "image_path": "993b4298f6e970d0f2e4670bc59e30344f4ff25766c36ccb063c73e26cbd300e.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 132, + 235, + 478, + 256.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 132, + 256.0, + 478, + 277.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 132, + 277.0, + 478, + 298.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 299, + 457, + 311 + ], + "lines": [ + { + "bbox": [ + 106, + 298, + 455, + 312 + ], + "spans": [ + { + "bbox": [ + 106, + 298, + 133, + 312 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 299, + 147, + 311 + ], + "score": 0.91, + "content": "\\delta _ { x _ { 0 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 298, + 263, + 312 + ], + "score": 1.0, + "content": "is a Dirac (in the row vector", + "type": "text" + }, + { + "bbox": [ + 263, + 300, + 275, + 310 + ], + "score": 0.84, + "content": "x _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 298, + 298, + 312 + ], + "score": 1.0, + "content": "), and", + "type": "text" + }, + { + "bbox": [ + 298, + 299, + 312, + 309 + ], + "score": 0.87, + "content": "P ^ { \\pi }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 298, + 448, + 312 + ], + "score": 1.0, + "content": "is the transition matrix for policy", + "type": "text" + }, + { + "bbox": [ + 448, + 302, + 455, + 309 + ], + "score": 0.75, + "content": "\\pi", + "type": "inline_equation" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 106, + 298, + 455, + 312 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 316, + 248, + 327 + ], + "lines": [ + { + "bbox": [ + 106, + 315, + 249, + 328 + ], + "spans": [ + { + "bbox": [ + 106, + 315, + 249, + 328 + ], + "score": 1.0, + "content": "From (22) and (23) we deduce that", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 106, + 315, + 249, + 328 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 329, + 419, + 358 + ], + "lines": [ + { + "bbox": [ + 192, + 329, + 419, + 358 + ], + "spans": [ + { + "bbox": [ + 192, + 329, + 419, + 358 + ], + "score": 0.92, + "content": "\\begin{array} { r c l } { \\mathcal { F } ( \\pi _ { i } , q _ { i + 1 } , \\theta _ { i + 1 } , \\pi _ { i + 1 } ) } & { \\geq } & { \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i + 1 } , \\pi _ { i + 1 } ) } \\\\ & { \\geq } & { \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i + 1 } ) + \\beta g _ { i } . } \\end{array}", + "type": "interline_equation", + "image_path": "8281c3095dc4a6dd13ecf9d780cf86802e6f3b12a3c26359dd90592202f86a3e.jpg" + } + ] + } + ], + "index": 14.5, + "virtual_lines": [ + { + "bbox": [ + 192, + 329, + 419, + 343.5 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 192, + 343.5, + 419, + 358.0 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 365, + 153, + 375 + ], + "lines": [ + { + "bbox": [ + 105, + 363, + 153, + 377 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 153, + 377 + ], + "score": 1.0, + "content": "We deduce", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 363, + 153, + 377 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 117, + 377, + 499, + 464 + ], + "lines": [ + { + "bbox": [ + 117, + 377, + 499, + 464 + ], + "spans": [ + { + "bbox": [ + 117, + 377, + 499, + 464 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathcal { F } ( \\pi _ { i } , q _ { i + 1 } , \\theta _ { i + 1 } , \\pi _ { i } ) } \\\\ { \\geq } & { \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i } ) + \\beta g _ { i } } \\\\ & { + \\mathcal { F } ( \\pi _ { i } , q _ { i + 1 } , \\theta _ { i + 1 } , \\pi _ { i } ) - \\mathcal { F } ( \\pi _ { i } , q _ { i + 1 } , \\theta _ { i + 1 } , \\pi _ { i + 1 } ) + \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i + 1 } ) - \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i } ) } \\\\ { = } & { \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i } ) + \\beta g _ { i } + } \\\\ & { \\mathbb { E } _ { \\pi _ { i } } \\Big [ \\displaystyle \\sum _ { t \\geq 0 } \\gamma ^ { t } \\big ( \\mathbb { E } _ { a \\sim q _ { i + 1 } } \\big [ Q ^ { \\pi _ { i } } ( x _ { t } , a ) - Q ^ { \\pi _ { i + 1 } } ( x _ { t } , a ) \\big ] - \\mathbb { E } _ { a \\sim q _ { i } } \\big [ Q ^ { \\pi _ { i } } ( x _ { t } , a ) - Q ^ { \\pi _ { i + 1 } } ( x _ { t } , a ) \\big ] \\big ) \\Big ] } \\end{array}", + "type": "interline_equation", + "image_path": "b6f5c5e6ee822b58dd2984629f7c3e6e4c8226af264d9b586eb8d198ae26c22c.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 117, + 377, + 499, + 406.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 117, + 406.0, + 499, + 435.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 117, + 435.0, + 499, + 464.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 488, + 163, + 500 + ], + "lines": [ + { + "bbox": [ + 105, + 487, + 164, + 501 + ], + "spans": [ + { + "bbox": [ + 105, + 487, + 164, + 501 + ], + "score": 1.0, + "content": "This rewrites:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 487, + 164, + 501 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 178, + 501, + 433, + 516 + ], + "lines": [ + { + "bbox": [ + 178, + 501, + 433, + 516 + ], + "spans": [ + { + "bbox": [ + 178, + 501, + 433, + 516 + ], + "score": 0.89, + "content": "\\delta _ { x _ { 0 } } ( I - \\gamma ^ { \\pi _ { i } } ) ^ { - 1 } \\big ( T _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } V ^ { \\pi _ { i } } - T _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } V ^ { \\pi _ { i } } \\big ) \\geq \\eta g _ { i } + O ( \\beta ^ { 2 } ) .", + "type": "interline_equation", + "image_path": "8f25845cb16cee1896d898bedf65d0cec51090548fd89b16c452956e7e7d89fd.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 178, + 501, + 433, + 516 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 524, + 423, + 536 + ], + "lines": [ + { + "bbox": [ + 106, + 523, + 423, + 538 + ], + "spans": [ + { + "bbox": [ + 106, + 523, + 345, + 538 + ], + "score": 1.0, + "content": "Step 3: Now a bit of algebra. For two stochastic matrices", + "type": "text" + }, + { + "bbox": [ + 345, + 525, + 354, + 534 + ], + "score": 0.86, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 523, + 372, + 538 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 372, + 524, + 383, + 534 + ], + "score": 0.88, + "content": "P ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 523, + 423, + 538 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22, + "bbox_fs": [ + 106, + 523, + 423, + 538 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 113, + 541, + 513, + 615 + ], + "lines": [ + { + "bbox": [ + 113, + 541, + 513, + 615 + ], + "spans": [ + { + "bbox": [ + 113, + 541, + 513, + 615 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { ( I - \\gamma P ) ^ { - 1 } } \\\\ { = } & { ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } + \\gamma ( I - \\gamma P ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } } \\\\ { = } & { ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } + \\gamma \\big [ ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } + \\gamma ( I - \\gamma P ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } \\big ] ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } } \\\\ { = } & { ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } + \\gamma ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } } \\\\ & { + \\gamma ^ { 2 } ( I - \\gamma P ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } . } \\end{array}", + "type": "interline_equation", + "image_path": "6833b9af9c4885f7be6be6eaabc73f30680d58070bd1fbf2d24a0be37741cfa4.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 113, + 541, + 513, + 565.6666666666666 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 113, + 565.6666666666666, + 513, + 590.3333333333333 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 113, + 590.3333333333333, + 513, + 614.9999999999999 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 633, + 505, + 657 + ], + "lines": [ + { + "bbox": [ + 104, + 631, + 506, + 649 + ], + "spans": [ + { + "bbox": [ + 104, + 631, + 298, + 649 + ], + "score": 1.0, + "content": "Applying this equality to the transition matrices", + "type": "text" + }, + { + "bbox": [ + 298, + 635, + 316, + 645 + ], + "score": 0.88, + "content": "P ^ { \\pi _ { k } }", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 631, + 334, + 649 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 335, + 635, + 361, + 645 + ], + "score": 0.89, + "content": "P ^ { \\pi _ { k + 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 631, + 402, + 649 + ], + "score": 1.0, + "content": "and since", + "type": "text" + }, + { + "bbox": [ + 402, + 634, + 501, + 647 + ], + "score": 0.92, + "content": "\\lVert P ^ { \\pi _ { k + 1 } } - P ^ { \\pi _ { k } } \\rVert = O ( \\eta )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 631, + 506, + 649 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 645, + 145, + 659 + ], + "spans": [ + { + "bbox": [ + 105, + 645, + 145, + 659 + ], + "score": 1.0, + "content": "we have:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 104, + 631, + 506, + 659 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 114, + 658, + 514, + 736 + ], + "lines": [ + { + "bbox": [ + 114, + 658, + 514, + 736 + ], + "spans": [ + { + "bbox": [ + 114, + 658, + 514, + 736 + ], + "score": 0.9, + "content": "\\begin{array} { r l } & { V _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } } \\\\ { = } & { ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } } \\\\ { = } & { ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } + \\gamma ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } ( P ^ { \\pi _ { i + 1 } } - P ^ { \\pi _ { i } } ) ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } + O ( \\beta ^ { 2 } ) } \\\\ { = } & { ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } + ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } ( r _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } - r _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } + \\gamma P ^ { \\pi _ { i + 1 } } - \\gamma P ^ { \\pi _ { i } } ) ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } } \\\\ { = } & { V _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } + ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } ( T _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i } + 1 } V ^ { \\pi _ { i } } - T _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } V ^ { \\pi _ { k } } ) + O ( \\beta ^ { 2 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "8bdebb9723dc34c32a537e413c81a04ddbece818013055ae73b233f81c4e75cd.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 114, + 658, + 514, + 684.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 114, + 684.0, + 514, + 710.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 114, + 710.0, + 514, + 736.0 + ], + "spans": [], + "index": 30 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 144, + 114, + 466, + 195 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 89, + 503, + 111 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 89, + 504, + 101 + ], + "spans": [ + { + "bbox": [ + 106, + 89, + 504, + 101 + ], + "score": 1.0, + "content": "Table 1: Results on a subset of the ALE environments in comparison to baselines taken from (Belle-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 100, + 179, + 111 + ], + "spans": [ + { + "bbox": [ + 105, + 100, + 179, + 111 + ], + "score": 1.0, + "content": "mare et al., 2017)", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "table_body", + "bbox": [ + 144, + 114, + 466, + 195 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 144, + 114, + 466, + 195 + ], + "spans": [ + { + "bbox": [ + 144, + 114, + 466, + 195 + ], + "score": 0.975, + "html": "
Game/AgentHumanDQNPrior. DuelingC51MPO
19.520.9
Pong Breakout14.6 30.5385.5366.020.9 74820.9 360.5
13,455.013,117.318,760.323,784
Q*bert Tennis-8.312.20.023.110,317.0
98.922.2
Boxing12.188.097.882.0
", + "type": "table", + "image_path": "3d049027fa95b82742e76aaca76dec4b746d1e3c2894cc45a64f5325b8029996.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 144, + 114, + 466, + 141.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 144, + 141.0, + 466, + 168.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 144, + 168.0, + 466, + 195.0 + ], + "spans": [], + "index": 4 + } + ] + } + ], + "index": 1.75 + }, + { + "type": "text", + "bbox": [ + 107, + 221, + 247, + 232 + ], + "lines": [ + { + "bbox": [ + 106, + 221, + 247, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 247, + 234 + ], + "score": 1.0, + "content": "Finally, using (24), we deduce that", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "interline_equation", + "bbox": [ + 119, + 238, + 492, + 308 + ], + "lines": [ + { + "bbox": [ + 119, + 238, + 492, + 308 + ], + "spans": [ + { + "bbox": [ + 119, + 238, + 492, + 308 + ], + "score": 0.94, + "content": "\\begin{array} { l l l } { \\mathcal { I } ( \\theta _ { i + 1 } , q _ { i + 1 } ) } & { = } & { V _ { \\alpha } ^ { q _ { i } + 1 , \\pi _ { i } + 1 } \\big ( x _ { 0 } \\big ) } \\\\ & { = } & { V _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } \\big ( x _ { 0 } \\big ) + \\delta _ { x _ { 0 } } \\big ( I - \\gamma P ^ { \\pi _ { i } } \\big ) ^ { - 1 } \\big ( T _ { \\alpha } ^ { q _ { i } + 1 , \\pi _ { i + 1 } } V ^ { \\pi _ { i } } - T _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } V ^ { \\pi _ { i } } \\big ) + O ( \\beta ^ { 2 } ) } \\\\ & { \\geq } & { \\mathcal { I } ( \\theta _ { i } , q _ { i } ) + \\eta g _ { i } + O ( \\beta ^ { 2 } ) } \\\\ & { \\geq } & { \\mathcal { I } ( \\theta _ { i } , q _ { i } ) + \\frac { 1 } { 2 } \\eta g _ { i } , } \\end{array}", + "type": "interline_equation", + "image_path": "b21e45fd65a916467315c45c1c84e9892ac2f711ac43978fbb51d0544f98608e.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 119, + 238, + 492, + 261.3333333333333 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 119, + 261.3333333333333, + 492, + 284.66666666666663 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 119, + 284.66666666666663, + 492, + 307.99999999999994 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 313, + 186, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 311, + 187, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 176, + 327 + ], + "score": 1.0, + "content": "for small enough", + "type": "text" + }, + { + "bbox": [ + 177, + 315, + 183, + 325 + ], + "score": 0.79, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 311, + 187, + 327 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "title", + "bbox": [ + 107, + 341, + 377, + 354 + ], + "lines": [ + { + "bbox": [ + 104, + 340, + 379, + 357 + ], + "spans": [ + { + "bbox": [ + 104, + 340, + 379, + 357 + ], + "score": 1.0, + "content": "B ADDITIONAL EXPERIMENT: DISCRETE CONTROL", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 106, + 367, + 505, + 488 + ], + "lines": [ + { + "bbox": [ + 105, + 367, + 506, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 506, + 380 + ], + "score": 1.0, + "content": "As a proof of concept – showcasing the robustness of our algorithm and its hyperparameters – we", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 377, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 104, + 377, + 506, + 393 + ], + "score": 1.0, + "content": "performed an experiment on a subset of the games contained contained in the \"Arcade Learning", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 389, + 506, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 506, + 402 + ], + "score": 1.0, + "content": "Environment\" (ALE). For this experiment we used the same hyperparameter settings for the KL", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 401, + 504, + 412 + ], + "spans": [ + { + "bbox": [ + 106, + 401, + 504, + 412 + ], + "score": 1.0, + "content": "constraints as for the continuous control experiments as well as the same learning rate and merely", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 411, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 505, + 424 + ], + "score": 1.0, + "content": "altered the network architecture to the standard network structure used by DQN Mnih et al. (2015)", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 423, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 106, + 423, + 505, + 434 + ], + "score": 1.0, + "content": "– and created a seperate network with the same architecture, but predicting the parameters of the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 433, + 506, + 445 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 506, + 445 + ], + "score": 1.0, + "content": "policy distribution. A comparison between our algorithm and well established baselines from the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 444, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 505, + 456 + ], + "score": 1.0, + "content": "literature, in terms of the mean performance, is listed in Table 1. While we do not obtain state-of-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 455, + 505, + 468 + ], + "spans": [ + { + "bbox": [ + 106, + 455, + 505, + 468 + ], + "score": 1.0, + "content": "the-art performance in this experiment, the fact that MPO is competitive, out-of-the-box in these", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 466, + 505, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 505, + 479 + ], + "score": 1.0, + "content": "domains suggests that combining the ideas presented in this paper with recent advances for RL with", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 478, + 437, + 489 + ], + "spans": [ + { + "bbox": [ + 106, + 478, + 437, + 489 + ], + "score": 1.0, + "content": "discrete actions (Bellemare et al., 2017) could be a fruitful avenue for future work.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 16 + }, + { + "type": "title", + "bbox": [ + 108, + 506, + 243, + 519 + ], + "lines": [ + { + "bbox": [ + 105, + 504, + 244, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 244, + 521 + ], + "score": 1.0, + "content": "C EXPERIMENT DETAILS", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 108, + 531, + 504, + 576 + ], + "lines": [ + { + "bbox": [ + 105, + 531, + 505, + 544 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 505, + 544 + ], + "score": 1.0, + "content": "In this section we give the details on the hyper-parameters used for each experiment. All the contin-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 542, + 506, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 506, + 555 + ], + "score": 1.0, + "content": "uous control experiments use a feed-forward network except for Parkour-2d were we used the same", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 553, + 505, + 566 + ], + "spans": [ + { + "bbox": [ + 105, + 553, + 505, + 566 + ], + "score": 1.0, + "content": "network architecture as in Heess et al. (2017). Other hyper parameters for MPO with non parametric", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 564, + 281, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 564, + 281, + 577 + ], + "score": 1.0, + "content": "variational distribution were set as follows,", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24.5 + }, + { + "type": "table", + "bbox": [ + 202, + 586, + 408, + 678 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 202, + 586, + 408, + 678 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 202, + 586, + 408, + 678 + ], + "spans": [ + { + "bbox": [ + 202, + 586, + 408, + 678 + ], + "score": 0.975, + "html": "
Hyperparametercontrol suitehumanoid
Policy net100-100200-200
Q function net200-200300-300
E0.11
Eμ0.1"
£0.0001"
Discount factor()0.991
Adam learning rate0.00051
", + "type": "table", + "image_path": "9aea7df29472b2a734d9b8fb63ea3ef395c0a4ded780c11b28640be851b0d3df.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 202, + 586, + 408, + 599.1428571428571 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 202, + 599.1428571428571, + 408, + 612.2857142857142 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 202, + 612.2857142857142, + 408, + 625.4285714285713 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 202, + 625.4285714285713, + 408, + 638.5714285714284 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 202, + 638.5714285714284, + 408, + 651.7142857142856 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 202, + 651.7142857142856, + 408, + 664.8571428571427 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 202, + 664.8571428571427, + 408, + 677.9999999999998 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 179, + 690, + 432, + 702 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 179, + 689, + 432, + 702 + ], + "spans": [ + { + "bbox": [ + 179, + 689, + 432, + 702 + ], + "score": 1.0, + "content": "Table 2: Parameters for non-parametric variational distribution", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + } + ], + "index": 32.0 + }, + { + "type": "text", + "bbox": [ + 106, + 720, + 441, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 719, + 443, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 443, + 734 + ], + "score": 1.0, + "content": "Hyperparameters for MPO with parametric variational distribution were as follows,", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + } + ], + "page_idx": 16, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "17", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 313, + 505, + 324 + ], + "lines": [ + { + "bbox": [ + 495, + 314, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 495, + 314, + 505, + 324 + ], + "score": 0.998, + "content": "□", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 144, + 114, + 466, + 195 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 89, + 503, + 111 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 89, + 504, + 101 + ], + "spans": [ + { + "bbox": [ + 106, + 89, + 504, + 101 + ], + "score": 1.0, + "content": "Table 1: Results on a subset of the ALE environments in comparison to baselines taken from (Belle-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 100, + 179, + 111 + ], + "spans": [ + { + "bbox": [ + 105, + 100, + 179, + 111 + ], + "score": 1.0, + "content": "mare et al., 2017)", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "table_body", + "bbox": [ + 144, + 114, + 466, + 195 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 144, + 114, + 466, + 195 + ], + "spans": [ + { + "bbox": [ + 144, + 114, + 466, + 195 + ], + "score": 0.975, + "html": "
Game/AgentHumanDQNPrior. DuelingC51MPO
19.520.9
Pong Breakout14.6 30.5385.5366.020.9 74820.9 360.5
13,455.013,117.318,760.323,784
Q*bert Tennis-8.312.20.023.110,317.0
98.922.2
Boxing12.188.097.882.0
", + "type": "table", + "image_path": "3d049027fa95b82742e76aaca76dec4b746d1e3c2894cc45a64f5325b8029996.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 144, + 114, + 466, + 141.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 144, + 141.0, + 466, + 168.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 144, + 168.0, + 466, + 195.0 + ], + "spans": [], + "index": 4 + } + ] + } + ], + "index": 1.75 + }, + { + "type": "text", + "bbox": [ + 107, + 221, + 247, + 232 + ], + "lines": [ + { + "bbox": [ + 106, + 221, + 247, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 247, + 234 + ], + "score": 1.0, + "content": "Finally, using (24), we deduce that", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 106, + 221, + 247, + 234 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 119, + 238, + 492, + 308 + ], + "lines": [ + { + "bbox": [ + 119, + 238, + 492, + 308 + ], + "spans": [ + { + "bbox": [ + 119, + 238, + 492, + 308 + ], + "score": 0.94, + "content": "\\begin{array} { l l l } { \\mathcal { I } ( \\theta _ { i + 1 } , q _ { i + 1 } ) } & { = } & { V _ { \\alpha } ^ { q _ { i } + 1 , \\pi _ { i } + 1 } \\big ( x _ { 0 } \\big ) } \\\\ & { = } & { V _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } \\big ( x _ { 0 } \\big ) + \\delta _ { x _ { 0 } } \\big ( I - \\gamma P ^ { \\pi _ { i } } \\big ) ^ { - 1 } \\big ( T _ { \\alpha } ^ { q _ { i } + 1 , \\pi _ { i + 1 } } V ^ { \\pi _ { i } } - T _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } V ^ { \\pi _ { i } } \\big ) + O ( \\beta ^ { 2 } ) } \\\\ & { \\geq } & { \\mathcal { I } ( \\theta _ { i } , q _ { i } ) + \\eta g _ { i } + O ( \\beta ^ { 2 } ) } \\\\ & { \\geq } & { \\mathcal { I } ( \\theta _ { i } , q _ { i } ) + \\frac { 1 } { 2 } \\eta g _ { i } , } \\end{array}", + "type": "interline_equation", + "image_path": "b21e45fd65a916467315c45c1c84e9892ac2f711ac43978fbb51d0544f98608e.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 119, + 238, + 492, + 261.3333333333333 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 119, + 261.3333333333333, + 492, + 284.66666666666663 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 119, + 284.66666666666663, + 492, + 307.99999999999994 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 313, + 186, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 311, + 187, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 176, + 327 + ], + "score": 1.0, + "content": "for small enough", + "type": "text" + }, + { + "bbox": [ + 177, + 315, + 183, + 325 + ], + "score": 0.79, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 311, + 187, + 327 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 311, + 187, + 327 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 341, + 377, + 354 + ], + "lines": [ + { + "bbox": [ + 104, + 340, + 379, + 357 + ], + "spans": [ + { + "bbox": [ + 104, + 340, + 379, + 357 + ], + "score": 1.0, + "content": "B ADDITIONAL EXPERIMENT: DISCRETE CONTROL", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 106, + 367, + 505, + 488 + ], + "lines": [ + { + "bbox": [ + 105, + 367, + 506, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 506, + 380 + ], + "score": 1.0, + "content": "As a proof of concept – showcasing the robustness of our algorithm and its hyperparameters – we", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 377, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 104, + 377, + 506, + 393 + ], + "score": 1.0, + "content": "performed an experiment on a subset of the games contained contained in the \"Arcade Learning", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 389, + 506, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 506, + 402 + ], + "score": 1.0, + "content": "Environment\" (ALE). For this experiment we used the same hyperparameter settings for the KL", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 401, + 504, + 412 + ], + "spans": [ + { + "bbox": [ + 106, + 401, + 504, + 412 + ], + "score": 1.0, + "content": "constraints as for the continuous control experiments as well as the same learning rate and merely", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 411, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 505, + 424 + ], + "score": 1.0, + "content": "altered the network architecture to the standard network structure used by DQN Mnih et al. (2015)", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 423, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 106, + 423, + 505, + 434 + ], + "score": 1.0, + "content": "– and created a seperate network with the same architecture, but predicting the parameters of the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 433, + 506, + 445 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 506, + 445 + ], + "score": 1.0, + "content": "policy distribution. A comparison between our algorithm and well established baselines from the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 444, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 505, + 456 + ], + "score": 1.0, + "content": "literature, in terms of the mean performance, is listed in Table 1. While we do not obtain state-of-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 455, + 505, + 468 + ], + "spans": [ + { + "bbox": [ + 106, + 455, + 505, + 468 + ], + "score": 1.0, + "content": "the-art performance in this experiment, the fact that MPO is competitive, out-of-the-box in these", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 466, + 505, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 505, + 479 + ], + "score": 1.0, + "content": "domains suggests that combining the ideas presented in this paper with recent advances for RL with", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 478, + 437, + 489 + ], + "spans": [ + { + "bbox": [ + 106, + 478, + 437, + 489 + ], + "score": 1.0, + "content": "discrete actions (Bellemare et al., 2017) could be a fruitful avenue for future work.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 16, + "bbox_fs": [ + 104, + 367, + 506, + 489 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 506, + 243, + 519 + ], + "lines": [ + { + "bbox": [ + 105, + 504, + 244, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 244, + 521 + ], + "score": 1.0, + "content": "C EXPERIMENT DETAILS", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 108, + 531, + 504, + 576 + ], + "lines": [ + { + "bbox": [ + 105, + 531, + 505, + 544 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 505, + 544 + ], + "score": 1.0, + "content": "In this section we give the details on the hyper-parameters used for each experiment. All the contin-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 542, + 506, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 506, + 555 + ], + "score": 1.0, + "content": "uous control experiments use a feed-forward network except for Parkour-2d were we used the same", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 553, + 505, + 566 + ], + "spans": [ + { + "bbox": [ + 105, + 553, + 505, + 566 + ], + "score": 1.0, + "content": "network architecture as in Heess et al. (2017). Other hyper parameters for MPO with non parametric", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 564, + 281, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 564, + 281, + 577 + ], + "score": 1.0, + "content": "variational distribution were set as follows,", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 531, + 506, + 577 + ] + }, + { + "type": "table", + "bbox": [ + 202, + 586, + 408, + 678 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 202, + 586, + 408, + 678 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 202, + 586, + 408, + 678 + ], + "spans": [ + { + "bbox": [ + 202, + 586, + 408, + 678 + ], + "score": 0.975, + "html": "
Hyperparametercontrol suitehumanoid
Policy net100-100200-200
Q function net200-200300-300
E0.11
Eμ0.1"
£0.0001"
Discount factor()0.991
Adam learning rate0.00051
", + "type": "table", + "image_path": "9aea7df29472b2a734d9b8fb63ea3ef395c0a4ded780c11b28640be851b0d3df.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 202, + 586, + 408, + 599.1428571428571 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 202, + 599.1428571428571, + 408, + 612.2857142857142 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 202, + 612.2857142857142, + 408, + 625.4285714285713 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 202, + 625.4285714285713, + 408, + 638.5714285714284 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 202, + 638.5714285714284, + 408, + 651.7142857142856 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 202, + 651.7142857142856, + 408, + 664.8571428571427 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 202, + 664.8571428571427, + 408, + 677.9999999999998 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 179, + 690, + 432, + 702 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 179, + 689, + 432, + 702 + ], + "spans": [ + { + "bbox": [ + 179, + 689, + 432, + 702 + ], + "score": 1.0, + "content": "Table 2: Parameters for non-parametric variational distribution", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + } + ], + "index": 32.0 + }, + { + "type": "text", + "bbox": [ + 106, + 720, + 441, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 719, + 443, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 443, + 734 + ], + "score": 1.0, + "content": "Hyperparameters for MPO with parametric variational distribution were as follows,", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 719, + 443, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 191, + 79, + 419, + 160 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 191, + 79, + 419, + 160 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 191, + 79, + 419, + 160 + ], + "spans": [ + { + "bbox": [ + 191, + 79, + 419, + 160 + ], + "score": 0.975, + "html": "
Hyperparametercontrol suite taskshumanoid
Policy net100-100200-200
Q function net200-200300-300
Eμ0.11
£0.00011
Discount factor ()0.991
Adam learning rate0.00051
", + "type": "table", + "image_path": "265f9d410660612f734f42d9c5e5275ae2403351d3285b07876e818a9a07114b.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 191, + 79, + 419, + 95.2 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 191, + 95.2, + 419, + 111.4 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 191, + 111.4, + 419, + 127.60000000000001 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 191, + 127.60000000000001, + 419, + 143.8 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 191, + 143.8, + 419, + 160.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 189, + 172, + 423, + 185 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 188, + 172, + 423, + 185 + ], + "spans": [ + { + "bbox": [ + 188, + 172, + 423, + 185 + ], + "score": 1.0, + "content": "Table 3: Parameters for parametric variational distribution", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + } + ], + "index": 3.5 + }, + { + "type": "title", + "bbox": [ + 106, + 203, + 422, + 217 + ], + "lines": [ + { + "bbox": [ + 105, + 202, + 423, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 202, + 423, + 218 + ], + "score": 1.0, + "content": "D DERIVATION OF UPDATE RULES FOR A GAUSSIAN POLICY", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 228, + 505, + 273 + ], + "lines": [ + { + "bbox": [ + 105, + 228, + 505, + 241 + ], + "spans": [ + { + "bbox": [ + 105, + 228, + 505, + 241 + ], + "score": 1.0, + "content": "For continuous control we assume that the policy is given by a Gaussian distribution with a full", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 104, + 239, + 506, + 253 + ], + "spans": [ + { + "bbox": [ + 104, + 239, + 198, + 253 + ], + "score": 1.0, + "content": "covariance matrix, i.e,", + "type": "text" + }, + { + "bbox": [ + 199, + 240, + 289, + 252 + ], + "score": 0.92, + "content": "\\pi ( \\boldsymbol { a } | \\boldsymbol { s } , \\pmb { \\theta } ) = \\mathcal { N } \\left( \\mu , \\pmb { \\Sigma } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 239, + 447, + 253 + ], + "score": 1.0, + "content": ". Our neural network outputs the mean", + "type": "text" + }, + { + "bbox": [ + 447, + 240, + 487, + 252 + ], + "score": 0.93, + "content": "\\mu = \\mu ( s )", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 239, + 506, + 253 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 250, + 505, + 263 + ], + "spans": [ + { + "bbox": [ + 106, + 250, + 172, + 263 + ], + "score": 1.0, + "content": "Cholesky factor", + "type": "text" + }, + { + "bbox": [ + 172, + 251, + 214, + 263 + ], + "score": 0.92, + "content": "A = A ( s )", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 250, + 256, + 263 + ], + "score": 1.0, + "content": ", such that", + "type": "text" + }, + { + "bbox": [ + 257, + 251, + 299, + 261 + ], + "score": 0.9, + "content": "\\Sigma = A A ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 250, + 408, + 263 + ], + "score": 1.0, + "content": ". The lower triagular factor", + "type": "text" + }, + { + "bbox": [ + 409, + 252, + 417, + 261 + ], + "score": 0.78, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 418, + 250, + 505, + 263 + ], + "score": 1.0, + "content": "has positive diagonal", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 261, + 393, + 275 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 284, + 275 + ], + "score": 1.0, + "content": "elements enforced by the softplus transform", + "type": "text" + }, + { + "bbox": [ + 284, + 262, + 388, + 274 + ], + "score": 0.91, + "content": "A _ { i i } \\log ( 1 + \\exp ( A _ { i i } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 388, + 261, + 393, + 275 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8.5 + }, + { + "type": "title", + "bbox": [ + 107, + 287, + 339, + 299 + ], + "lines": [ + { + "bbox": [ + 106, + 287, + 339, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 339, + 300 + ], + "score": 1.0, + "content": "D.1 NON-PARAMETRIC VARIATIONAL DISTRIBUTION", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 308, + 504, + 331 + ], + "lines": [ + { + "bbox": [ + 105, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 505, + 321 + ], + "score": 1.0, + "content": "In this section we provide the derivations and implementation details for the non-parametric varia-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 318, + 312, + 332 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 234, + 332 + ], + "score": 1.0, + "content": "tional distribution case for both", + "type": "text" + }, + { + "bbox": [ + 234, + 320, + 241, + 329 + ], + "score": 0.26, + "content": "\\mathrm { E }", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 318, + 312, + 332 + ], + "score": 1.0, + "content": "-step and M-step.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "title", + "bbox": [ + 107, + 344, + 167, + 356 + ], + "lines": [ + { + "bbox": [ + 106, + 343, + 167, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 343, + 167, + 357 + ], + "score": 1.0, + "content": "D.2 E-STEP", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 106, + 365, + 504, + 388 + ], + "lines": [ + { + "bbox": [ + 106, + 365, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 106, + 365, + 505, + 378 + ], + "score": 1.0, + "content": "The E-step with a non-parametric variational solves the following program, where we have replaced", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 376, + 366, + 389 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 366, + 389 + ], + "score": 1.0, + "content": "expectations with integrals to simplify the following derivations:", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "interline_equation", + "bbox": [ + 219, + 401, + 392, + 481 + ], + "lines": [ + { + "bbox": [ + 219, + 401, + 392, + 481 + ], + "spans": [ + { + "bbox": [ + 219, + 401, + 392, + 481 + ], + "score": 0.94, + "content": "\\begin{array} { l } { \\displaystyle \\operatorname* { m a x } _ { q } \\int \\mu _ { q } ( s ) \\int q ( a | s ) Q _ { \\theta _ { i } } ( s , a ) d a d s } \\\\ { \\displaystyle s . t . \\int \\mu _ { q } ( s ) { \\bf K L } ( q ( a | s ) , \\pi ( a | s , \\theta _ { i } ) ) d a < \\epsilon , } \\\\ { \\displaystyle \\iint \\mu _ { q } ( s ) q ( a | s ) d a d s = 1 . } \\end{array}", + "type": "interline_equation", + "image_path": "79abb19cfc5e0d689e7bde00318662a5dfa7e557ca8e3279e6a5da350ba71ac7.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 219, + 401, + 392, + 417.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 219, + 417.0, + 392, + 433.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 219, + 433.0, + 392, + 449.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 219, + 449.0, + 392, + 465.0 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 219, + 465.0, + 392, + 481.0 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 487, + 280, + 500 + ], + "lines": [ + { + "bbox": [ + 105, + 485, + 281, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 485, + 281, + 502 + ], + "score": 1.0, + "content": "First we write the Lagrangian equation, i.e,", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "interline_equation", + "bbox": [ + 123, + 519, + 490, + 574 + ], + "lines": [ + { + "bbox": [ + 123, + 519, + 490, + 574 + ], + "spans": [ + { + "bbox": [ + 123, + 519, + 490, + 574 + ], + "score": 0.94, + "content": "\\begin{array} { c } { { L ( q , \\eta , \\gamma ) = \\displaystyle \\int \\mu _ { q } ( s ) \\int q ( a | s ) Q _ { \\theta _ { i } } ( s , a ) d a d s + } } \\\\ { { \\displaystyle \\eta \\left( \\epsilon - \\int \\mu _ { q } ( s ) \\int q ( a | s ) \\log \\frac { q ( a | s ) } { \\pi ( a | s , \\theta _ { i } ) } \\right) + \\gamma \\left( 1 - \\displaystyle \\iint \\mu _ { q } ( s ) q ( a | s ) d a d s \\right) . } } \\end{array}", + "type": "interline_equation", + "image_path": "486183ca7f5b2729ebda3c5343d5c3c8e310496b9f5e9601dcd9761c13bf9f97.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 123, + 519, + 490, + 537.3333333333334 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 123, + 537.3333333333334, + 490, + 555.6666666666667 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 123, + 555.6666666666667, + 490, + 574.0000000000001 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 103, + 578, + 475, + 591 + ], + "lines": [ + { + "bbox": [ + 105, + 577, + 476, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 246, + 592 + ], + "score": 1.0, + "content": "Next we maximise the Lagrangian", + "type": "text" + }, + { + "bbox": [ + 246, + 579, + 254, + 588 + ], + "score": 0.84, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 577, + 352, + 592 + ], + "score": 1.0, + "content": "w.r.t the primal variable", + "type": "text" + }, + { + "bbox": [ + 352, + 581, + 358, + 590 + ], + "score": 0.8, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 577, + 442, + 592 + ], + "score": 1.0, + "content": ". The derivative w.r.t", + "type": "text" + }, + { + "bbox": [ + 442, + 581, + 448, + 590 + ], + "score": 0.82, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 577, + 476, + 592 + ], + "score": 1.0, + "content": "reads,", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "interline_equation", + "bbox": [ + 164, + 605, + 446, + 620 + ], + "lines": [ + { + "bbox": [ + 164, + 605, + 446, + 620 + ], + "spans": [ + { + "bbox": [ + 164, + 605, + 446, + 620 + ], + "score": 0.84, + "content": "\\partial q L ( q , \\eta , \\gamma ) = Q _ { \\theta _ { i } } ( a , s ) - \\eta \\log q ( a | s ) + \\eta \\log \\pi ( a | s , \\pmb \\theta _ { i } ) - ( \\eta - \\gamma ) .", + "type": "interline_equation", + "image_path": "0723148fe81a97fbe26688adf5c0c326fc468c1bc06907d2fbe2d5df23530a92.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 164, + 605, + 446, + 620 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 629, + 294, + 641 + ], + "lines": [ + { + "bbox": [ + 106, + 627, + 294, + 643 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 294, + 643 + ], + "score": 1.0, + "content": "Setting it to zero and rearranging terms we get", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 654, + 418, + 682 + ], + "lines": [ + { + "bbox": [ + 192, + 654, + 418, + 682 + ], + "spans": [ + { + "bbox": [ + 192, + 654, + 418, + 682 + ], + "score": 0.92, + "content": "q ( a | s ) = \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp \\left( \\frac { Q _ { \\pmb { \\theta } _ { i } } ( a , s ) } { \\eta } \\right) \\exp \\left( - \\frac { \\eta - \\gamma } { \\eta } \\right) .", + "type": "interline_equation", + "image_path": "419ba691557a8dd5a84dae08d83546c35a08d6bc39c863a20e1930df77232286.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 192, + 654, + 418, + 682 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 684, + 476, + 696 + ], + "lines": [ + { + "bbox": [ + 105, + 683, + 478, + 697 + ], + "spans": [ + { + "bbox": [ + 105, + 683, + 369, + 697 + ], + "score": 1.0, + "content": "However the last exponential term is a normalisation constant for", + "type": "text" + }, + { + "bbox": [ + 369, + 686, + 374, + 695 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 683, + 478, + 697 + ], + "score": 1.0, + "content": ". Therefore we can write,", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "interline_equation", + "bbox": [ + 204, + 709, + 406, + 736 + ], + "lines": [ + { + "bbox": [ + 204, + 709, + 406, + 736 + ], + "spans": [ + { + "bbox": [ + 204, + 709, + 406, + 736 + ], + "score": 0.91, + "content": "\\exp ( - \\frac { \\eta - \\gamma } { \\eta } ) = \\int \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp ( \\frac { Q _ { \\pmb { \\theta } _ { i } } ( a , s ) } { \\eta } ) d a ,", + "type": "interline_equation", + "image_path": "acd9b0e1d27167627e3254634727a03a260fe88cf8dafe9fe7c1f053dcdc760b.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 204, + 709, + 406, + 736 + ], + "spans": [], + "index": 31 + } + ] + } + ], + "page_idx": 17, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "18", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 191, + 79, + 419, + 160 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 191, + 79, + 419, + 160 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 191, + 79, + 419, + 160 + ], + "spans": [ + { + "bbox": [ + 191, + 79, + 419, + 160 + ], + "score": 0.975, + "html": "
Hyperparametercontrol suite taskshumanoid
Policy net100-100200-200
Q function net200-200300-300
Eμ0.11
£0.00011
Discount factor ()0.991
Adam learning rate0.00051
", + "type": "table", + "image_path": "265f9d410660612f734f42d9c5e5275ae2403351d3285b07876e818a9a07114b.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 191, + 79, + 419, + 95.2 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 191, + 95.2, + 419, + 111.4 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 191, + 111.4, + 419, + 127.60000000000001 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 191, + 127.60000000000001, + 419, + 143.8 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 191, + 143.8, + 419, + 160.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 189, + 172, + 423, + 185 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 188, + 172, + 423, + 185 + ], + "spans": [ + { + "bbox": [ + 188, + 172, + 423, + 185 + ], + "score": 1.0, + "content": "Table 3: Parameters for parametric variational distribution", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + } + ], + "index": 3.5 + }, + { + "type": "title", + "bbox": [ + 106, + 203, + 422, + 217 + ], + "lines": [ + { + "bbox": [ + 105, + 202, + 423, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 202, + 423, + 218 + ], + "score": 1.0, + "content": "D DERIVATION OF UPDATE RULES FOR A GAUSSIAN POLICY", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 228, + 505, + 273 + ], + "lines": [ + { + "bbox": [ + 105, + 228, + 505, + 241 + ], + "spans": [ + { + "bbox": [ + 105, + 228, + 505, + 241 + ], + "score": 1.0, + "content": "For continuous control we assume that the policy is given by a Gaussian distribution with a full", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 104, + 239, + 506, + 253 + ], + "spans": [ + { + "bbox": [ + 104, + 239, + 198, + 253 + ], + "score": 1.0, + "content": "covariance matrix, i.e,", + "type": "text" + }, + { + "bbox": [ + 199, + 240, + 289, + 252 + ], + "score": 0.92, + "content": "\\pi ( \\boldsymbol { a } | \\boldsymbol { s } , \\pmb { \\theta } ) = \\mathcal { N } \\left( \\mu , \\pmb { \\Sigma } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 239, + 447, + 253 + ], + "score": 1.0, + "content": ". Our neural network outputs the mean", + "type": "text" + }, + { + "bbox": [ + 447, + 240, + 487, + 252 + ], + "score": 0.93, + "content": "\\mu = \\mu ( s )", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 239, + 506, + 253 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 250, + 505, + 263 + ], + "spans": [ + { + "bbox": [ + 106, + 250, + 172, + 263 + ], + "score": 1.0, + "content": "Cholesky factor", + "type": "text" + }, + { + "bbox": [ + 172, + 251, + 214, + 263 + ], + "score": 0.92, + "content": "A = A ( s )", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 250, + 256, + 263 + ], + "score": 1.0, + "content": ", such that", + "type": "text" + }, + { + "bbox": [ + 257, + 251, + 299, + 261 + ], + "score": 0.9, + "content": "\\Sigma = A A ^ { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 250, + 408, + 263 + ], + "score": 1.0, + "content": ". The lower triagular factor", + "type": "text" + }, + { + "bbox": [ + 409, + 252, + 417, + 261 + ], + "score": 0.78, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 418, + 250, + 505, + 263 + ], + "score": 1.0, + "content": "has positive diagonal", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 261, + 393, + 275 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 284, + 275 + ], + "score": 1.0, + "content": "elements enforced by the softplus transform", + "type": "text" + }, + { + "bbox": [ + 284, + 262, + 388, + 274 + ], + "score": 0.91, + "content": "A _ { i i } \\log ( 1 + \\exp ( A _ { i i } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 388, + 261, + 393, + 275 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8.5, + "bbox_fs": [ + 104, + 228, + 506, + 275 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 287, + 339, + 299 + ], + "lines": [ + { + "bbox": [ + 106, + 287, + 339, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 339, + 300 + ], + "score": 1.0, + "content": "D.1 NON-PARAMETRIC VARIATIONAL DISTRIBUTION", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 308, + 504, + 331 + ], + "lines": [ + { + "bbox": [ + 105, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 505, + 321 + ], + "score": 1.0, + "content": "In this section we provide the derivations and implementation details for the non-parametric varia-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 318, + 312, + 332 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 234, + 332 + ], + "score": 1.0, + "content": "tional distribution case for both", + "type": "text" + }, + { + "bbox": [ + 234, + 320, + 241, + 329 + ], + "score": 0.26, + "content": "\\mathrm { E }", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 318, + 312, + 332 + ], + "score": 1.0, + "content": "-step and M-step.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 307, + 505, + 332 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 344, + 167, + 356 + ], + "lines": [ + { + "bbox": [ + 106, + 343, + 167, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 343, + 167, + 357 + ], + "score": 1.0, + "content": "D.2 E-STEP", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 106, + 365, + 504, + 388 + ], + "lines": [ + { + "bbox": [ + 106, + 365, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 106, + 365, + 505, + 378 + ], + "score": 1.0, + "content": "The E-step with a non-parametric variational solves the following program, where we have replaced", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 376, + 366, + 389 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 366, + 389 + ], + "score": 1.0, + "content": "expectations with integrals to simplify the following derivations:", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 365, + 505, + 389 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 219, + 401, + 392, + 481 + ], + "lines": [ + { + "bbox": [ + 219, + 401, + 392, + 481 + ], + "spans": [ + { + "bbox": [ + 219, + 401, + 392, + 481 + ], + "score": 0.94, + "content": "\\begin{array} { l } { \\displaystyle \\operatorname* { m a x } _ { q } \\int \\mu _ { q } ( s ) \\int q ( a | s ) Q _ { \\theta _ { i } } ( s , a ) d a d s } \\\\ { \\displaystyle s . t . \\int \\mu _ { q } ( s ) { \\bf K L } ( q ( a | s ) , \\pi ( a | s , \\theta _ { i } ) ) d a < \\epsilon , } \\\\ { \\displaystyle \\iint \\mu _ { q } ( s ) q ( a | s ) d a d s = 1 . } \\end{array}", + "type": "interline_equation", + "image_path": "79abb19cfc5e0d689e7bde00318662a5dfa7e557ca8e3279e6a5da350ba71ac7.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 219, + 401, + 392, + 417.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 219, + 417.0, + 392, + 433.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 219, + 433.0, + 392, + 449.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 219, + 449.0, + 392, + 465.0 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 219, + 465.0, + 392, + 481.0 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 487, + 280, + 500 + ], + "lines": [ + { + "bbox": [ + 105, + 485, + 281, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 485, + 281, + 502 + ], + "score": 1.0, + "content": "First we write the Lagrangian equation, i.e,", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 485, + 281, + 502 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 123, + 519, + 490, + 574 + ], + "lines": [ + { + "bbox": [ + 123, + 519, + 490, + 574 + ], + "spans": [ + { + "bbox": [ + 123, + 519, + 490, + 574 + ], + "score": 0.94, + "content": "\\begin{array} { c } { { L ( q , \\eta , \\gamma ) = \\displaystyle \\int \\mu _ { q } ( s ) \\int q ( a | s ) Q _ { \\theta _ { i } } ( s , a ) d a d s + } } \\\\ { { \\displaystyle \\eta \\left( \\epsilon - \\int \\mu _ { q } ( s ) \\int q ( a | s ) \\log \\frac { q ( a | s ) } { \\pi ( a | s , \\theta _ { i } ) } \\right) + \\gamma \\left( 1 - \\displaystyle \\iint \\mu _ { q } ( s ) q ( a | s ) d a d s \\right) . } } \\end{array}", + "type": "interline_equation", + "image_path": "486183ca7f5b2729ebda3c5343d5c3c8e310496b9f5e9601dcd9761c13bf9f97.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 123, + 519, + 490, + 537.3333333333334 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 123, + 537.3333333333334, + 490, + 555.6666666666667 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 123, + 555.6666666666667, + 490, + 574.0000000000001 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 103, + 578, + 475, + 591 + ], + "lines": [ + { + "bbox": [ + 105, + 577, + 476, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 246, + 592 + ], + "score": 1.0, + "content": "Next we maximise the Lagrangian", + "type": "text" + }, + { + "bbox": [ + 246, + 579, + 254, + 588 + ], + "score": 0.84, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 577, + 352, + 592 + ], + "score": 1.0, + "content": "w.r.t the primal variable", + "type": "text" + }, + { + "bbox": [ + 352, + 581, + 358, + 590 + ], + "score": 0.8, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 577, + 442, + 592 + ], + "score": 1.0, + "content": ". The derivative w.r.t", + "type": "text" + }, + { + "bbox": [ + 442, + 581, + 448, + 590 + ], + "score": 0.82, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 577, + 476, + 592 + ], + "score": 1.0, + "content": "reads,", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 577, + 476, + 592 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 164, + 605, + 446, + 620 + ], + "lines": [ + { + "bbox": [ + 164, + 605, + 446, + 620 + ], + "spans": [ + { + "bbox": [ + 164, + 605, + 446, + 620 + ], + "score": 0.84, + "content": "\\partial q L ( q , \\eta , \\gamma ) = Q _ { \\theta _ { i } } ( a , s ) - \\eta \\log q ( a | s ) + \\eta \\log \\pi ( a | s , \\pmb \\theta _ { i } ) - ( \\eta - \\gamma ) .", + "type": "interline_equation", + "image_path": "0723148fe81a97fbe26688adf5c0c326fc468c1bc06907d2fbe2d5df23530a92.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 164, + 605, + 446, + 620 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 629, + 294, + 641 + ], + "lines": [ + { + "bbox": [ + 106, + 627, + 294, + 643 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 294, + 643 + ], + "score": 1.0, + "content": "Setting it to zero and rearranging terms we get", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 106, + 627, + 294, + 643 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 654, + 418, + 682 + ], + "lines": [ + { + "bbox": [ + 192, + 654, + 418, + 682 + ], + "spans": [ + { + "bbox": [ + 192, + 654, + 418, + 682 + ], + "score": 0.92, + "content": "q ( a | s ) = \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp \\left( \\frac { Q _ { \\pmb { \\theta } _ { i } } ( a , s ) } { \\eta } \\right) \\exp \\left( - \\frac { \\eta - \\gamma } { \\eta } \\right) .", + "type": "interline_equation", + "image_path": "419ba691557a8dd5a84dae08d83546c35a08d6bc39c863a20e1930df77232286.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 192, + 654, + 418, + 682 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 684, + 476, + 696 + ], + "lines": [ + { + "bbox": [ + 105, + 683, + 478, + 697 + ], + "spans": [ + { + "bbox": [ + 105, + 683, + 369, + 697 + ], + "score": 1.0, + "content": "However the last exponential term is a normalisation constant for", + "type": "text" + }, + { + "bbox": [ + 369, + 686, + 374, + 695 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 683, + 478, + 697 + ], + "score": 1.0, + "content": ". Therefore we can write,", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 683, + 478, + 697 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 204, + 709, + 406, + 736 + ], + "lines": [ + { + "bbox": [ + 204, + 709, + 406, + 736 + ], + "spans": [ + { + "bbox": [ + 204, + 709, + 406, + 736 + ], + "score": 0.91, + "content": "\\exp ( - \\frac { \\eta - \\gamma } { \\eta } ) = \\int \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp ( \\frac { Q _ { \\pmb { \\theta } _ { i } } ( a , s ) } { \\eta } ) d a ,", + "type": "interline_equation", + "image_path": "acd9b0e1d27167627e3254634727a03a260fe88cf8dafe9fe7c1f053dcdc760b.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 204, + 709, + 406, + 736 + ], + "spans": [], + "index": 31 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "interline_equation", + "bbox": [ + 201, + 79, + 409, + 107 + ], + "lines": [ + { + "bbox": [ + 201, + 79, + 409, + 107 + ], + "spans": [ + { + "bbox": [ + 201, + 79, + 409, + 107 + ], + "score": 0.91, + "content": "\\gamma = \\eta - \\eta \\log \\left( \\int \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp ( \\frac { Q _ { \\pmb { \\theta } _ { i } } ( a , s ) } { \\eta } ) d a \\right) .", + "type": "interline_equation", + "image_path": "45584bcea1f3f117f3096dc8366d9774d4c64dbda4de636bfefdd2b1fc9f7dbb.jpg" + } + ] + } + ], + "index": 0, + "virtual_lines": [ + { + "bbox": [ + 201, + 79, + 409, + 107 + ], + "spans": [], + "index": 0 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 114, + 471, + 127 + ], + "lines": [ + { + "bbox": [ + 105, + 114, + 472, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 207, + 128 + ], + "score": 1.0, + "content": "Note that we could write", + "type": "text" + }, + { + "bbox": [ + 208, + 117, + 215, + 126 + ], + "score": 0.83, + "content": "\\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 114, + 253, + 128 + ], + "score": 1.0, + "content": "based on", + "type": "text" + }, + { + "bbox": [ + 253, + 117, + 261, + 124 + ], + "score": 0.78, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 114, + 279, + 128 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 279, + 117, + 285, + 126 + ], + "score": 0.8, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 114, + 472, + 128 + ], + "score": 1.0, + "content": ". At this point we can derive the dual function,", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "interline_equation", + "bbox": [ + 179, + 131, + 431, + 159 + ], + "lines": [ + { + "bbox": [ + 179, + 131, + 431, + 159 + ], + "spans": [ + { + "bbox": [ + 179, + 131, + 431, + 159 + ], + "score": 0.92, + "content": "g ( \\eta ) = \\eta \\epsilon + \\eta \\int \\mu _ { q } ( s ) \\log \\left( \\int \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp ( \\frac { Q ( a , s ) } { \\eta } ) d a \\right) .", + "type": "interline_equation", + "image_path": "a448e228678b7bb1f2eb43e1ce3a4008cd43608e136500ca96d3727a51d9c816.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 179, + 131, + 431, + 159 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "title", + "bbox": [ + 106, + 170, + 168, + 182 + ], + "lines": [ + { + "bbox": [ + 105, + 169, + 169, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 169, + 169, + 183 + ], + "score": 1.0, + "content": "D.3 M-STEP", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 108, + 191, + 504, + 213 + ], + "lines": [ + { + "bbox": [ + 104, + 189, + 506, + 206 + ], + "spans": [ + { + "bbox": [ + 104, + 189, + 244, + 206 + ], + "score": 1.0, + "content": "To obtain the KL constraint in the", + "type": "text" + }, + { + "bbox": [ + 244, + 192, + 254, + 202 + ], + "score": 0.38, + "content": "\\mathbf { M }", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 189, + 302, + 206 + ], + "score": 1.0, + "content": "step we set", + "type": "text" + }, + { + "bbox": [ + 302, + 192, + 320, + 204 + ], + "score": 0.92, + "content": "p ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 189, + 506, + 206 + ], + "score": 1.0, + "content": "to a Gaussian prior around the current policy,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 200, + 124, + 216 + ], + "spans": [ + { + "bbox": [ + 104, + 200, + 124, + 216 + ], + "score": 1.0, + "content": "i.e,", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "interline_equation", + "bbox": [ + 240, + 212, + 369, + 236 + ], + "lines": [ + { + "bbox": [ + 240, + 212, + 369, + 236 + ], + "spans": [ + { + "bbox": [ + 240, + 212, + 369, + 236 + ], + "score": 0.94, + "content": "p ( \\pmb \\theta ) \\approx \\mathcal { N } \\Big ( \\mu = \\pmb \\theta _ { i } , \\Sigma = \\frac { F _ { \\pmb \\theta _ { i } } } { \\lambda } \\Big ) ,", + "type": "interline_equation", + "image_path": "953f1d4dd059437ad180fba7715e206d9437adfdafcb37c9d10cbf016ed52105.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 240, + 212, + 369, + 236 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 237, + 505, + 260 + ], + "lines": [ + { + "bbox": [ + 106, + 237, + 505, + 250 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 132, + 250 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 238, + 143, + 249 + ], + "score": 0.88, + "content": "\\theta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 237, + 349, + 250 + ], + "score": 1.0, + "content": "are the parameters of the current policy distribution,", + "type": "text" + }, + { + "bbox": [ + 350, + 238, + 365, + 250 + ], + "score": 0.91, + "content": "F _ { \\pmb { \\theta } _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 237, + 505, + 250 + ], + "score": 1.0, + "content": "is the empirical Fisher information", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 248, + 163, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 248, + 152, + 260 + ], + "score": 1.0, + "content": "matrix and", + "type": "text" + }, + { + "bbox": [ + 152, + 249, + 159, + 259 + ], + "score": 0.81, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 248, + 163, + 260 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 108, + 265, + 406, + 278 + ], + "lines": [ + { + "bbox": [ + 105, + 264, + 406, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 406, + 280 + ], + "score": 1.0, + "content": "With this, and dropping constant terms our optimization program becomes", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "interline_equation", + "bbox": [ + 162, + 282, + 448, + 308 + ], + "lines": [ + { + "bbox": [ + 162, + 282, + 448, + 308 + ], + "spans": [ + { + "bbox": [ + 162, + 282, + 448, + 308 + ], + "score": 0.93, + "content": "\\operatorname* { m a x } _ { \\pi } \\int \\mu _ { q } ( s ) \\int q ( a | s ) \\log \\pi ( a | s , \\pmb { \\theta } ) d a d s - \\lambda ( \\pmb { \\theta } - \\pmb { \\theta } _ { i } ) ^ { T } F _ { \\pmb { \\theta _ { i } } } ^ { - 1 } ( \\pmb { \\theta } - \\pmb { \\theta } _ { i } ) .", + "type": "interline_equation", + "image_path": "1298caec4b94c89c434739404123167a1e8e4e6bd9d01d67eb4ba2e682b4adce.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 162, + 282, + 448, + 308 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 319, + 506, + 346 + ], + "lines": [ + { + "bbox": [ + 104, + 318, + 507, + 336 + ], + "spans": [ + { + "bbox": [ + 104, + 318, + 201, + 336 + ], + "score": 1.0, + "content": "We can observe that", + "type": "text" + }, + { + "bbox": [ + 201, + 320, + 306, + 334 + ], + "score": 0.93, + "content": "( \\pmb \\theta - \\pmb \\theta _ { i } ) ^ { T } F _ { \\pmb \\theta _ { i } } ^ { - 1 } ( \\pmb \\theta - \\pmb \\theta _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 318, + 507, + 336 + ], + "score": 1.0, + "content": "is the second order Taylor approximation of", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 333, + 459, + 348 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 251, + 347 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\int \\mu _ { q } ( s ) \\mathrm { K L } ( \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\pi ( a | s , \\pmb { \\theta } ) ) d s } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 334, + 459, + 348 + ], + "score": 1.0, + "content": "which leads us to the generalized M-step objective:", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "interline_equation", + "bbox": [ + 128, + 351, + 465, + 378 + ], + "lines": [ + { + "bbox": [ + 128, + 351, + 465, + 378 + ], + "spans": [ + { + "bbox": [ + 128, + 351, + 465, + 378 + ], + "score": 0.91, + "content": "\\operatorname* { m a x } _ { \\pi } \\int \\mu _ { q } ( s ) \\int q ( a | s ) \\log \\pi ( a | s , \\theta ) d a d s - \\lambda \\int \\mu _ { q } ( s ) \\mathbf { K L } ( \\pi ( a | s , \\theta _ { i } ) , \\pi ( a | s , \\theta ) ) d s", + "type": "interline_equation", + "image_path": "e5275e1e0cf0f2c9bfddf9241707ccdb4a2151b0b352705a569cd196af07678a.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 128, + 351, + 465, + 378 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 382, + 504, + 394 + ], + "lines": [ + { + "bbox": [ + 106, + 380, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 505, + 396 + ], + "score": 1.0, + "content": "which corresponds to Equation (11) from the main text, where expectations are replaced by integrals.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 398, + 506, + 433 + ], + "lines": [ + { + "bbox": [ + 105, + 398, + 506, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 366, + 412 + ], + "score": 1.0, + "content": "After obtaining the non parametric variational distribution in the", + "type": "text" + }, + { + "bbox": [ + 366, + 399, + 377, + 410 + ], + "score": 0.29, + "content": "\\mathbf { M }", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 398, + 506, + 412 + ], + "score": 1.0, + "content": "step with a Gaussian policy we", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 411, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 505, + 423 + ], + "score": 1.0, + "content": "empirically observed that better results could be achieved by decoupling the KL constraint into two", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 421, + 473, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 473, + 434 + ], + "score": 1.0, + "content": "terms such that we can constrain the contribution of the mean and covariance separately i.e.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "interline_equation", + "bbox": [ + 208, + 453, + 401, + 478 + ], + "lines": [ + { + "bbox": [ + 208, + 453, + 401, + 478 + ], + "spans": [ + { + "bbox": [ + 208, + 453, + 401, + 478 + ], + "score": 0.93, + "content": "\\int \\mu _ { q } ( s ) \\mathrm { K L } ( \\pi _ { i } ( a | s , \\pmb \\theta ) , \\pi ( a | s , \\pmb \\theta ) ) = C _ { \\mu } + C _ { \\Sigma } ,", + "type": "interline_equation", + "image_path": "23b9d5fa791c4c2bd8b5aa2f89398646a3528bffe20aa5b8a0a0fd3f44d63ede.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 208, + 453, + 401, + 478 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 484, + 133, + 495 + ], + "lines": [ + { + "bbox": [ + 105, + 482, + 135, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 135, + 496 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 491, + 401, + 546 + ], + "lines": [ + { + "bbox": [ + 210, + 491, + 401, + 546 + ], + "spans": [ + { + "bbox": [ + 210, + 491, + 401, + 546 + ], + "score": 0.84, + "content": "\\begin{array} { c } { { C _ { \\mu } = \\displaystyle \\int \\mu _ { q } ( s ) \\frac 1 2 \\big ( \\mathrm { t r } \\big ( \\Sigma ^ { - 1 } \\Sigma _ { i } \\big ) - n + \\mathrm { l n } ( \\frac { \\Sigma } { \\Sigma _ { i } } ) \\big ) d s , } } \\\\ { { { } } } \\\\ { { C _ { \\Sigma } = \\displaystyle \\int \\mu _ { q } ( s ) \\frac 1 2 \\big ( \\mu - \\mu _ { i } \\big ) ^ { T } \\Sigma ^ { - 1 } ( \\mu - \\mu _ { i } ) d s . } } \\end{array}", + "type": "interline_equation", + "image_path": "5e9cecdb584af75d226dc2b9ebded0f7485cc323b36c04fbea13f2add88eaddc.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 210, + 491, + 401, + 509.3333333333333 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 210, + 509.3333333333333, + 401, + 527.6666666666666 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 210, + 527.6666666666666, + 401, + 546.0 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 552, + 506, + 609 + ], + "lines": [ + { + "bbox": [ + 106, + 552, + 505, + 566 + ], + "spans": [ + { + "bbox": [ + 106, + 552, + 273, + 566 + ], + "score": 1.0, + "content": "This decoupling allows us to set different", + "type": "text" + }, + { + "bbox": [ + 273, + 555, + 279, + 563 + ], + "score": 0.74, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 552, + 408, + 566 + ], + "score": 1.0, + "content": "values for each component, i.e.,", + "type": "text" + }, + { + "bbox": [ + 408, + 555, + 434, + 565 + ], + "score": 0.87, + "content": "\\epsilon _ { \\mu } , \\epsilon _ { \\Sigma }", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 552, + 505, + 566 + ], + "score": 1.0, + "content": "for the mean, the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 563, + 505, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 273, + 576 + ], + "score": 1.0, + "content": "covariance matrix respectively. Different", + "type": "text" + }, + { + "bbox": [ + 274, + 566, + 280, + 574 + ], + "score": 0.67, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 563, + 505, + 576 + ], + "score": 1.0, + "content": "lead to different learning rates. The effectivness of this", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 575, + 504, + 587 + ], + "spans": [ + { + "bbox": [ + 106, + 575, + 504, + 587 + ], + "score": 1.0, + "content": "decoupling has also been shown in Abdolmaleki et al. (2017). We always set a much smaller epsilon", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 586, + 506, + 598 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 506, + 598 + ], + "score": 1.0, + "content": "for covariance than the mean. The intuition is that while we would like the distribution moves fast", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 596, + 465, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 465, + 610 + ], + "score": 1.0, + "content": "in the action space, we also want to keep the exploration to avoid premature convergence.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 613, + 505, + 637 + ], + "lines": [ + { + "bbox": [ + 104, + 612, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 104, + 612, + 505, + 627 + ], + "score": 1.0, + "content": "In order to solve the constrained optimisation in the M-step, we first write the generalised Lagrangian", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 624, + 162, + 638 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 162, + 638 + ], + "score": 1.0, + "content": "equation, i.e,", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "interline_equation", + "bbox": [ + 133, + 649, + 478, + 675 + ], + "lines": [ + { + "bbox": [ + 133, + 649, + 478, + 675 + ], + "spans": [ + { + "bbox": [ + 133, + 649, + 478, + 675 + ], + "score": 0.94, + "content": "L ( \\pmb \\theta , \\eta _ { \\mu } , \\eta _ { \\Sigma } ) = \\int \\mu _ { q } ( s ) \\int q ( a | s ) \\log \\pi ( a | s , \\pmb \\theta ) d a d s + \\eta _ { \\mu } ( \\epsilon _ { \\mu } - C _ { \\mu } ) + \\eta _ { \\Sigma } ( \\epsilon _ { \\Sigma } - C _ { \\Sigma } )", + "type": "interline_equation", + "image_path": "841f2c7aa058eb67d06c4f85f4daddf3b071bc49ee06632b4c8f73aaf33a6cfe.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 133, + 649, + 478, + 675 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 677, + 505, + 700 + ], + "lines": [ + { + "bbox": [ + 105, + 675, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 675, + 136, + 691 + ], + "score": 1.0, + "content": "Where", + "type": "text" + }, + { + "bbox": [ + 136, + 679, + 147, + 690 + ], + "score": 0.85, + "content": "\\eta _ { \\mu }", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 675, + 165, + 691 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 166, + 679, + 178, + 689 + ], + "score": 0.87, + "content": "\\eta _ { \\Sigma }", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 675, + 505, + 691 + ], + "score": 1.0, + "content": "are Lagrangian multipliers. Following prior work on constraint optimisation, we", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 687, + 270, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 270, + 701 + ], + "score": 1.0, + "content": "formulate the following primal problem,", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "interline_equation", + "bbox": [ + 246, + 716, + 364, + 735 + ], + "lines": [ + { + "bbox": [ + 246, + 716, + 364, + 735 + ], + "spans": [ + { + "bbox": [ + 246, + 716, + 364, + 735 + ], + "score": 0.9, + "content": "\\operatorname* { m a x } _ { \\pmb { \\theta } } \\operatorname* { m i n } _ { \\eta _ { \\mu } > 0 , \\eta _ { \\Sigma } > 0 } L ( \\pmb { \\theta } , \\eta _ { \\mu } , \\eta _ { \\Sigma } ) .", + "type": "interline_equation", + "image_path": "b93b94f99817576cd36409fa558ec24e83f02944d691e76051e954cc61c676b6.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 246, + 716, + 364, + 735 + ], + "spans": [], + "index": 33 + } + ] + } + ], + "page_idx": 18, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 294, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 14 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "interline_equation", + "bbox": [ + 201, + 79, + 409, + 107 + ], + "lines": [ + { + "bbox": [ + 201, + 79, + 409, + 107 + ], + "spans": [ + { + "bbox": [ + 201, + 79, + 409, + 107 + ], + "score": 0.91, + "content": "\\gamma = \\eta - \\eta \\log \\left( \\int \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp ( \\frac { Q _ { \\pmb { \\theta } _ { i } } ( a , s ) } { \\eta } ) d a \\right) .", + "type": "interline_equation", + "image_path": "45584bcea1f3f117f3096dc8366d9774d4c64dbda4de636bfefdd2b1fc9f7dbb.jpg" + } + ] + } + ], + "index": 0, + "virtual_lines": [ + { + "bbox": [ + 201, + 79, + 409, + 107 + ], + "spans": [], + "index": 0 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 114, + 471, + 127 + ], + "lines": [ + { + "bbox": [ + 105, + 114, + 472, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 207, + 128 + ], + "score": 1.0, + "content": "Note that we could write", + "type": "text" + }, + { + "bbox": [ + 208, + 117, + 215, + 126 + ], + "score": 0.83, + "content": "\\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 114, + 253, + 128 + ], + "score": 1.0, + "content": "based on", + "type": "text" + }, + { + "bbox": [ + 253, + 117, + 261, + 124 + ], + "score": 0.78, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 114, + 279, + 128 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 279, + 117, + 285, + 126 + ], + "score": 0.8, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 114, + 472, + 128 + ], + "score": 1.0, + "content": ". At this point we can derive the dual function,", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 114, + 472, + 128 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 179, + 131, + 431, + 159 + ], + "lines": [ + { + "bbox": [ + 179, + 131, + 431, + 159 + ], + "spans": [ + { + "bbox": [ + 179, + 131, + 431, + 159 + ], + "score": 0.92, + "content": "g ( \\eta ) = \\eta \\epsilon + \\eta \\int \\mu _ { q } ( s ) \\log \\left( \\int \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp ( \\frac { Q ( a , s ) } { \\eta } ) d a \\right) .", + "type": "interline_equation", + "image_path": "a448e228678b7bb1f2eb43e1ce3a4008cd43608e136500ca96d3727a51d9c816.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 179, + 131, + 431, + 159 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "title", + "bbox": [ + 106, + 170, + 168, + 182 + ], + "lines": [ + { + "bbox": [ + 105, + 169, + 169, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 169, + 169, + 183 + ], + "score": 1.0, + "content": "D.3 M-STEP", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 108, + 191, + 504, + 213 + ], + "lines": [ + { + "bbox": [ + 104, + 189, + 506, + 206 + ], + "spans": [ + { + "bbox": [ + 104, + 189, + 244, + 206 + ], + "score": 1.0, + "content": "To obtain the KL constraint in the", + "type": "text" + }, + { + "bbox": [ + 244, + 192, + 254, + 202 + ], + "score": 0.38, + "content": "\\mathbf { M }", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 189, + 302, + 206 + ], + "score": 1.0, + "content": "step we set", + "type": "text" + }, + { + "bbox": [ + 302, + 192, + 320, + 204 + ], + "score": 0.92, + "content": "p ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 189, + 506, + 206 + ], + "score": 1.0, + "content": "to a Gaussian prior around the current policy,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 200, + 124, + 216 + ], + "spans": [ + { + "bbox": [ + 104, + 200, + 124, + 216 + ], + "score": 1.0, + "content": "i.e,", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 104, + 189, + 506, + 216 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 240, + 212, + 369, + 236 + ], + "lines": [ + { + "bbox": [ + 240, + 212, + 369, + 236 + ], + "spans": [ + { + "bbox": [ + 240, + 212, + 369, + 236 + ], + "score": 0.94, + "content": "p ( \\pmb \\theta ) \\approx \\mathcal { N } \\Big ( \\mu = \\pmb \\theta _ { i } , \\Sigma = \\frac { F _ { \\pmb \\theta _ { i } } } { \\lambda } \\Big ) ,", + "type": "interline_equation", + "image_path": "953f1d4dd059437ad180fba7715e206d9437adfdafcb37c9d10cbf016ed52105.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 240, + 212, + 369, + 236 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 237, + 505, + 260 + ], + "lines": [ + { + "bbox": [ + 106, + 237, + 505, + 250 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 132, + 250 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 238, + 143, + 249 + ], + "score": 0.88, + "content": "\\theta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 237, + 349, + 250 + ], + "score": 1.0, + "content": "are the parameters of the current policy distribution,", + "type": "text" + }, + { + "bbox": [ + 350, + 238, + 365, + 250 + ], + "score": 0.91, + "content": "F _ { \\pmb { \\theta } _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 237, + 505, + 250 + ], + "score": 1.0, + "content": "is the empirical Fisher information", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 248, + 163, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 248, + 152, + 260 + ], + "score": 1.0, + "content": "matrix and", + "type": "text" + }, + { + "bbox": [ + 152, + 249, + 159, + 259 + ], + "score": 0.81, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 248, + 163, + 260 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 237, + 505, + 260 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 265, + 406, + 278 + ], + "lines": [ + { + "bbox": [ + 105, + 264, + 406, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 406, + 280 + ], + "score": 1.0, + "content": "With this, and dropping constant terms our optimization program becomes", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 264, + 406, + 280 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 162, + 282, + 448, + 308 + ], + "lines": [ + { + "bbox": [ + 162, + 282, + 448, + 308 + ], + "spans": [ + { + "bbox": [ + 162, + 282, + 448, + 308 + ], + "score": 0.93, + "content": "\\operatorname* { m a x } _ { \\pi } \\int \\mu _ { q } ( s ) \\int q ( a | s ) \\log \\pi ( a | s , \\pmb { \\theta } ) d a d s - \\lambda ( \\pmb { \\theta } - \\pmb { \\theta } _ { i } ) ^ { T } F _ { \\pmb { \\theta _ { i } } } ^ { - 1 } ( \\pmb { \\theta } - \\pmb { \\theta } _ { i } ) .", + "type": "interline_equation", + "image_path": "1298caec4b94c89c434739404123167a1e8e4e6bd9d01d67eb4ba2e682b4adce.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 162, + 282, + 448, + 308 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 319, + 506, + 346 + ], + "lines": [ + { + "bbox": [ + 104, + 318, + 507, + 336 + ], + "spans": [ + { + "bbox": [ + 104, + 318, + 201, + 336 + ], + "score": 1.0, + "content": "We can observe that", + "type": "text" + }, + { + "bbox": [ + 201, + 320, + 306, + 334 + ], + "score": 0.93, + "content": "( \\pmb \\theta - \\pmb \\theta _ { i } ) ^ { T } F _ { \\pmb \\theta _ { i } } ^ { - 1 } ( \\pmb \\theta - \\pmb \\theta _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 318, + 507, + 336 + ], + "score": 1.0, + "content": "is the second order Taylor approximation of", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 333, + 459, + 348 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 251, + 347 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\int \\mu _ { q } ( s ) \\mathrm { K L } ( \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\pi ( a | s , \\pmb { \\theta } ) ) d s } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 334, + 459, + 348 + ], + "score": 1.0, + "content": "which leads us to the generalized M-step objective:", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 104, + 318, + 507, + 348 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 128, + 351, + 465, + 378 + ], + "lines": [ + { + "bbox": [ + 128, + 351, + 465, + 378 + ], + "spans": [ + { + "bbox": [ + 128, + 351, + 465, + 378 + ], + "score": 0.91, + "content": "\\operatorname* { m a x } _ { \\pi } \\int \\mu _ { q } ( s ) \\int q ( a | s ) \\log \\pi ( a | s , \\theta ) d a d s - \\lambda \\int \\mu _ { q } ( s ) \\mathbf { K L } ( \\pi ( a | s , \\theta _ { i } ) , \\pi ( a | s , \\theta ) ) d s", + "type": "interline_equation", + "image_path": "e5275e1e0cf0f2c9bfddf9241707ccdb4a2151b0b352705a569cd196af07678a.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 128, + 351, + 465, + 378 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 382, + 504, + 394 + ], + "lines": [ + { + "bbox": [ + 106, + 380, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 505, + 396 + ], + "score": 1.0, + "content": "which corresponds to Equation (11) from the main text, where expectations are replaced by integrals.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 106, + 380, + 505, + 396 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 398, + 506, + 433 + ], + "lines": [ + { + "bbox": [ + 105, + 398, + 506, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 366, + 412 + ], + "score": 1.0, + "content": "After obtaining the non parametric variational distribution in the", + "type": "text" + }, + { + "bbox": [ + 366, + 399, + 377, + 410 + ], + "score": 0.29, + "content": "\\mathbf { M }", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 398, + 506, + 412 + ], + "score": 1.0, + "content": "step with a Gaussian policy we", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 411, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 505, + 423 + ], + "score": 1.0, + "content": "empirically observed that better results could be achieved by decoupling the KL constraint into two", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 421, + 473, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 473, + 434 + ], + "score": 1.0, + "content": "terms such that we can constrain the contribution of the mean and covariance separately i.e.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 398, + 506, + 434 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 208, + 453, + 401, + 478 + ], + "lines": [ + { + "bbox": [ + 208, + 453, + 401, + 478 + ], + "spans": [ + { + "bbox": [ + 208, + 453, + 401, + 478 + ], + "score": 0.93, + "content": "\\int \\mu _ { q } ( s ) \\mathrm { K L } ( \\pi _ { i } ( a | s , \\pmb \\theta ) , \\pi ( a | s , \\pmb \\theta ) ) = C _ { \\mu } + C _ { \\Sigma } ,", + "type": "interline_equation", + "image_path": "23b9d5fa791c4c2bd8b5aa2f89398646a3528bffe20aa5b8a0a0fd3f44d63ede.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 208, + 453, + 401, + 478 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 484, + 133, + 495 + ], + "lines": [ + { + "bbox": [ + 105, + 482, + 135, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 135, + 496 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19, + "bbox_fs": [ + 105, + 482, + 135, + 496 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 491, + 401, + 546 + ], + "lines": [ + { + "bbox": [ + 210, + 491, + 401, + 546 + ], + "spans": [ + { + "bbox": [ + 210, + 491, + 401, + 546 + ], + "score": 0.84, + "content": "\\begin{array} { c } { { C _ { \\mu } = \\displaystyle \\int \\mu _ { q } ( s ) \\frac 1 2 \\big ( \\mathrm { t r } \\big ( \\Sigma ^ { - 1 } \\Sigma _ { i } \\big ) - n + \\mathrm { l n } ( \\frac { \\Sigma } { \\Sigma _ { i } } ) \\big ) d s , } } \\\\ { { { } } } \\\\ { { C _ { \\Sigma } = \\displaystyle \\int \\mu _ { q } ( s ) \\frac 1 2 \\big ( \\mu - \\mu _ { i } \\big ) ^ { T } \\Sigma ^ { - 1 } ( \\mu - \\mu _ { i } ) d s . } } \\end{array}", + "type": "interline_equation", + "image_path": "5e9cecdb584af75d226dc2b9ebded0f7485cc323b36c04fbea13f2add88eaddc.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 210, + 491, + 401, + 509.3333333333333 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 210, + 509.3333333333333, + 401, + 527.6666666666666 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 210, + 527.6666666666666, + 401, + 546.0 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 552, + 506, + 609 + ], + "lines": [ + { + "bbox": [ + 106, + 552, + 505, + 566 + ], + "spans": [ + { + "bbox": [ + 106, + 552, + 273, + 566 + ], + "score": 1.0, + "content": "This decoupling allows us to set different", + "type": "text" + }, + { + "bbox": [ + 273, + 555, + 279, + 563 + ], + "score": 0.74, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 552, + 408, + 566 + ], + "score": 1.0, + "content": "values for each component, i.e.,", + "type": "text" + }, + { + "bbox": [ + 408, + 555, + 434, + 565 + ], + "score": 0.87, + "content": "\\epsilon _ { \\mu } , \\epsilon _ { \\Sigma }", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 552, + 505, + 566 + ], + "score": 1.0, + "content": "for the mean, the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 563, + 505, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 273, + 576 + ], + "score": 1.0, + "content": "covariance matrix respectively. Different", + "type": "text" + }, + { + "bbox": [ + 274, + 566, + 280, + 574 + ], + "score": 0.67, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 563, + 505, + 576 + ], + "score": 1.0, + "content": "lead to different learning rates. The effectivness of this", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 575, + 504, + 587 + ], + "spans": [ + { + "bbox": [ + 106, + 575, + 504, + 587 + ], + "score": 1.0, + "content": "decoupling has also been shown in Abdolmaleki et al. (2017). We always set a much smaller epsilon", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 586, + 506, + 598 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 506, + 598 + ], + "score": 1.0, + "content": "for covariance than the mean. The intuition is that while we would like the distribution moves fast", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 596, + 465, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 465, + 610 + ], + "score": 1.0, + "content": "in the action space, we also want to keep the exploration to avoid premature convergence.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 552, + 506, + 610 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 613, + 505, + 637 + ], + "lines": [ + { + "bbox": [ + 104, + 612, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 104, + 612, + 505, + 627 + ], + "score": 1.0, + "content": "In order to solve the constrained optimisation in the M-step, we first write the generalised Lagrangian", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 624, + 162, + 638 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 162, + 638 + ], + "score": 1.0, + "content": "equation, i.e,", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 104, + 612, + 505, + 638 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 133, + 649, + 478, + 675 + ], + "lines": [ + { + "bbox": [ + 133, + 649, + 478, + 675 + ], + "spans": [ + { + "bbox": [ + 133, + 649, + 478, + 675 + ], + "score": 0.94, + "content": "L ( \\pmb \\theta , \\eta _ { \\mu } , \\eta _ { \\Sigma } ) = \\int \\mu _ { q } ( s ) \\int q ( a | s ) \\log \\pi ( a | s , \\pmb \\theta ) d a d s + \\eta _ { \\mu } ( \\epsilon _ { \\mu } - C _ { \\mu } ) + \\eta _ { \\Sigma } ( \\epsilon _ { \\Sigma } - C _ { \\Sigma } )", + "type": "interline_equation", + "image_path": "841f2c7aa058eb67d06c4f85f4daddf3b071bc49ee06632b4c8f73aaf33a6cfe.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 133, + 649, + 478, + 675 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 677, + 505, + 700 + ], + "lines": [ + { + "bbox": [ + 105, + 675, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 675, + 136, + 691 + ], + "score": 1.0, + "content": "Where", + "type": "text" + }, + { + "bbox": [ + 136, + 679, + 147, + 690 + ], + "score": 0.85, + "content": "\\eta _ { \\mu }", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 675, + 165, + 691 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 166, + 679, + 178, + 689 + ], + "score": 0.87, + "content": "\\eta _ { \\Sigma }", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 675, + 505, + 691 + ], + "score": 1.0, + "content": "are Lagrangian multipliers. Following prior work on constraint optimisation, we", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 687, + 270, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 270, + 701 + ], + "score": 1.0, + "content": "formulate the following primal problem,", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 105, + 675, + 505, + 701 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 246, + 716, + 364, + 735 + ], + "lines": [ + { + "bbox": [ + 246, + 716, + 364, + 735 + ], + "spans": [ + { + "bbox": [ + 246, + 716, + 364, + 735 + ], + "score": 0.9, + "content": "\\operatorname* { m a x } _ { \\pmb { \\theta } } \\operatorname* { m i n } _ { \\eta _ { \\mu } > 0 , \\eta _ { \\Sigma } > 0 } L ( \\pmb { \\theta } , \\eta _ { \\mu } , \\eta _ { \\Sigma } ) .", + "type": "interline_equation", + "image_path": "b93b94f99817576cd36409fa558ec24e83f02944d691e76051e954cc61c676b6.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 246, + 716, + 364, + 735 + ], + "spans": [], + "index": 33 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 149 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 187, + 95 + ], + "score": 1.0, + "content": "In order to solve for", + "type": "text" + }, + { + "bbox": [ + 187, + 83, + 195, + 92 + ], + "score": 0.72, + "content": "\\pmb \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "we iteratively solve the inner and outer optimisation programs independently:", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 394, + 106 + ], + "score": 1.0, + "content": "We fix the Lagrangian multipliers to their current value and optimise for", + "type": "text" + }, + { + "bbox": [ + 394, + 94, + 401, + 104 + ], + "score": 0.6, + "content": "\\pmb \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "(outer maximisation) and", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 202, + 117 + ], + "score": 1.0, + "content": "then fix the parameters", + "type": "text" + }, + { + "bbox": [ + 202, + 105, + 210, + 114 + ], + "score": 0.7, + "content": "\\pmb \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "to their current value and optimise for the Lagrangian multipliers (inner", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 383, + 128 + ], + "score": 1.0, + "content": "minimisation). We continue this procedure until policy parameters", + "type": "text" + }, + { + "bbox": [ + 383, + 116, + 391, + 125 + ], + "score": 0.67, + "content": "\\pmb { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "and Lagrangian multipliers", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 506, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 506, + 139 + ], + "score": 1.0, + "content": "converge. Please note that the same approach can be employed to bound the KL explicitly instead", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 137, + 398, + 149 + ], + "spans": [ + { + "bbox": [ + 106, + 137, + 398, + 149 + ], + "score": 1.0, + "content": "of decoupling the contribution of mean and covariance matrix to the KL.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 109, + 162, + 314, + 173 + ], + "lines": [ + { + "bbox": [ + 107, + 162, + 316, + 174 + ], + "spans": [ + { + "bbox": [ + 107, + 162, + 316, + 174 + ], + "score": 1.0, + "content": "D.4 PARAMETRIC VARIATIONAL DISTRIBUTION", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 105, + 182, + 505, + 205 + ], + "lines": [ + { + "bbox": [ + 105, + 182, + 505, + 195 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 505, + 195 + ], + "score": 1.0, + "content": "In this case we assume our variational distribution also uses a Gaussian distribution over the action", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 194, + 304, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 293, + 207 + ], + "score": 1.0, + "content": "space and use the same structure as our policy", + "type": "text" + }, + { + "bbox": [ + 293, + 197, + 300, + 204 + ], + "score": 0.7, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 194, + 304, + 207 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 106, + 210, + 506, + 245 + ], + "lines": [ + { + "bbox": [ + 106, + 210, + 505, + 223 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 505, + 223 + ], + "score": 1.0, + "content": "Similar to the non-parametric case for a Gaussian distribution in the M-step we also use a decoupled", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 221, + 505, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 505, + 235 + ], + "score": 1.0, + "content": "KL but this time in the E-step for a Gaussian variational distribution. Using the same reasoning as", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 232, + 448, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 448, + 245 + ], + "score": 1.0, + "content": "in the previous section we can obtain the following generalized Lagrangian equation:", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "interline_equation", + "bbox": [ + 132, + 257, + 478, + 283 + ], + "lines": [ + { + "bbox": [ + 132, + 257, + 478, + 283 + ], + "spans": [ + { + "bbox": [ + 132, + 257, + 478, + 283 + ], + "score": 0.92, + "content": "L ( \\theta ^ { q } , \\eta _ { \\mu } , \\eta _ { \\Sigma } ) = \\int \\mu _ { q } ( s ) \\int q ( a | s ; \\theta ^ { q } ) A _ { i } ( a , s ) d a d s + \\eta _ { \\mu } ( \\epsilon _ { \\mu } - C _ { \\mu } ) + \\eta _ { \\Sigma } ( \\epsilon _ { \\Sigma } - C _ { \\Sigma } ) .", + "type": "interline_equation", + "image_path": "de4b2919525f4d6b623529678194f028b8600a1252310bf3abf4bdee14ee6788.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 132, + 257, + 478, + 283 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 285, + 505, + 329 + ], + "lines": [ + { + "bbox": [ + 105, + 284, + 504, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 136, + 298 + ], + "score": 1.0, + "content": "Where", + "type": "text" + }, + { + "bbox": [ + 136, + 287, + 148, + 297 + ], + "score": 0.85, + "content": "\\eta _ { \\mu }", + "type": "inline_equation" + }, + { + "bbox": [ + 148, + 284, + 167, + 298 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 168, + 287, + 180, + 297 + ], + "score": 0.86, + "content": "\\eta _ { \\Sigma }", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 284, + 473, + 298 + ], + "score": 1.0, + "content": "are Lagrangian multipliers. And where we use the advantage function", + "type": "text" + }, + { + "bbox": [ + 473, + 285, + 504, + 297 + ], + "score": 0.91, + "content": "A ( a , s )", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 296, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 164, + 309 + ], + "score": 1.0, + "content": "instead of the", + "type": "text" + }, + { + "bbox": [ + 165, + 297, + 174, + 307 + ], + "score": 0.27, + "content": "\\mathrm { Q }", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 296, + 212, + 309 + ], + "score": 1.0, + "content": "function", + "type": "text" + }, + { + "bbox": [ + 212, + 296, + 243, + 308 + ], + "score": 0.93, + "content": "Q ( a , s )", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 296, + 506, + 309 + ], + "score": 1.0, + "content": ", as it empirically gave better performance. Please note that the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 306, + 505, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 306, + 148, + 320 + ], + "score": 1.0, + "content": "KL in the", + "type": "text" + }, + { + "bbox": [ + 148, + 308, + 156, + 317 + ], + "score": 0.44, + "content": "\\mathrm { E }", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 306, + 505, + 320 + ], + "score": 1.0, + "content": "-step is different than the one used in the M-step. Following prior works on constraint", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 318, + 356, + 331 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 356, + 331 + ], + "score": 1.0, + "content": "optimisation, we can formulate the following primal problem,", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14.5 + }, + { + "type": "interline_equation", + "bbox": [ + 244, + 344, + 366, + 365 + ], + "lines": [ + { + "bbox": [ + 244, + 344, + 366, + 365 + ], + "spans": [ + { + "bbox": [ + 244, + 344, + 366, + 365 + ], + "score": 0.91, + "content": "\\operatorname* { m a x } _ { \\pmb { \\theta } ^ { q } } \\operatorname* { m i n } _ { \\eta _ { \\mu } > 0 , \\eta _ { \\Sigma } > 0 } L ( \\pmb { \\theta } ^ { q } , \\eta _ { \\mu } , \\eta _ { \\Sigma } )", + "type": "interline_equation", + "image_path": "4b234296dd6ac24b07d0dee1307a6b8b8791da36b2d98c8193a85ed6bc4271a2.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 244, + 344, + 366, + 365 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 372, + 505, + 473 + ], + "lines": [ + { + "bbox": [ + 105, + 372, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 186, + 386 + ], + "score": 1.0, + "content": "In order to solve for", + "type": "text" + }, + { + "bbox": [ + 187, + 374, + 198, + 383 + ], + "score": 0.87, + "content": "\\pmb { \\theta } ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 372, + 505, + 386 + ], + "score": 1.0, + "content": "we iteratively solve the inner and outer optimisation programs independently.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 385, + 465, + 397 + ], + "score": 1.0, + "content": "In order to that we fix the Lagrangian multipliers to their current value and optimise for", + "type": "text" + }, + { + "bbox": [ + 466, + 384, + 477, + 395 + ], + "score": 0.86, + "content": "\\pmb { \\theta } ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 385, + 505, + 397 + ], + "score": 1.0, + "content": "(outer", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 395, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 104, + 395, + 489, + 407 + ], + "score": 1.0, + "content": "maximisation), in this case we use the likelihood ratio gradient to compute the gradient w.r.t", + "type": "text" + }, + { + "bbox": [ + 490, + 396, + 501, + 406 + ], + "score": 0.85, + "content": "\\pmb { \\theta } ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 395, + 505, + 407 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 405, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 249, + 419 + ], + "score": 1.0, + "content": "Subsequently we fix the parameters", + "type": "text" + }, + { + "bbox": [ + 249, + 406, + 260, + 416 + ], + "score": 0.87, + "content": "\\pmb { \\theta } ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 405, + 505, + 419 + ], + "score": 1.0, + "content": "to their current value and optimise for Lagrangian multipliers", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 416, + 506, + 430 + ], + "spans": [ + { + "bbox": [ + 104, + 416, + 460, + 430 + ], + "score": 1.0, + "content": "(inner minimisation). We iteratively continue this procedure until the policy parameters", + "type": "text" + }, + { + "bbox": [ + 460, + 417, + 472, + 428 + ], + "score": 0.87, + "content": "\\pmb { \\theta } ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 472, + 416, + 506, + 430 + ], + "score": 1.0, + "content": "and the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 429, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 106, + 429, + 505, + 441 + ], + "score": 1.0, + "content": "Lagrangian multipliers converges. Please note that the same approach can be used to bound the KL", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 439, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 439, + 505, + 452 + ], + "score": 1.0, + "content": "explicitly instead of decoupling the contribution of mean and covariance matrix to the KL. As our", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 449, + 506, + 463 + ], + "spans": [ + { + "bbox": [ + 104, + 449, + 506, + 463 + ], + "score": 1.0, + "content": "policy has the same structure as the parametric variational distribution, the M step in this case reduce", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 460, + 418, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 218, + 475 + ], + "score": 1.0, + "content": "to set the policy parameters", + "type": "text" + }, + { + "bbox": [ + 219, + 462, + 226, + 471 + ], + "score": 0.82, + "content": "\\pmb { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 460, + 298, + 475 + ], + "score": 1.0, + "content": "to the parameters", + "type": "text" + }, + { + "bbox": [ + 298, + 461, + 309, + 471 + ], + "score": 0.88, + "content": "\\pmb { \\theta } ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 460, + 418, + 475 + ], + "score": 1.0, + "content": "we obtained in E-step, i.e,", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 22 + }, + { + "type": "interline_equation", + "bbox": [ + 282, + 478, + 328, + 491 + ], + "lines": [ + { + "bbox": [ + 282, + 478, + 328, + 491 + ], + "spans": [ + { + "bbox": [ + 282, + 478, + 328, + 491 + ], + "score": 0.91, + "content": "\\pmb \\theta _ { i + 1 } = \\pmb \\theta ^ { q }", + "type": "interline_equation", + "image_path": "3335988042fcacda2ddb21904a29a953d9a17fbbbd5d1c6bf3c8258d315d9930.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 282, + 478, + 328, + 491 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "title", + "bbox": [ + 108, + 507, + 266, + 519 + ], + "lines": [ + { + "bbox": [ + 105, + 506, + 267, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 267, + 521 + ], + "score": 1.0, + "content": "E IMPLEMENTATION DETAILS", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 106, + 531, + 505, + 598 + ], + "lines": [ + { + "bbox": [ + 105, + 531, + 506, + 544 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 506, + 544 + ], + "score": 1.0, + "content": "While we ran most of our experiments using a single learner, we implemented a scalable variant", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 542, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 106, + 542, + 505, + 554 + ], + "score": 1.0, + "content": "of the presented method in which multiple workers collect data independently in an instance of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 553, + 506, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 553, + 506, + 567 + ], + "score": 1.0, + "content": "the considered environment, compute gradients and send them to a chief (or parameter server) that", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 565, + 505, + 577 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 505, + 577 + ], + "score": 1.0, + "content": "performs parameter update by averaging gradients. That is we use distributed synchronous gradient", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 575, + 506, + 588 + ], + "spans": [ + { + "bbox": [ + 105, + 575, + 506, + 588 + ], + "score": 1.0, + "content": "descent. These procedures are described in Algorithms 1 and 2 for the non-parametric case and 3", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 586, + 202, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 202, + 600 + ], + "score": 1.0, + "content": "for the parametric case.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 31.5 + } + ], + "page_idx": 19, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 749, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 298, + 749, + 313, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 15 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 149 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 187, + 95 + ], + "score": 1.0, + "content": "In order to solve for", + "type": "text" + }, + { + "bbox": [ + 187, + 83, + 195, + 92 + ], + "score": 0.72, + "content": "\\pmb \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "we iteratively solve the inner and outer optimisation programs independently:", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 394, + 106 + ], + "score": 1.0, + "content": "We fix the Lagrangian multipliers to their current value and optimise for", + "type": "text" + }, + { + "bbox": [ + 394, + 94, + 401, + 104 + ], + "score": 0.6, + "content": "\\pmb \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "(outer maximisation) and", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 202, + 117 + ], + "score": 1.0, + "content": "then fix the parameters", + "type": "text" + }, + { + "bbox": [ + 202, + 105, + 210, + 114 + ], + "score": 0.7, + "content": "\\pmb \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "to their current value and optimise for the Lagrangian multipliers (inner", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 383, + 128 + ], + "score": 1.0, + "content": "minimisation). We continue this procedure until policy parameters", + "type": "text" + }, + { + "bbox": [ + 383, + 116, + 391, + 125 + ], + "score": 0.67, + "content": "\\pmb { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "and Lagrangian multipliers", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 506, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 506, + 139 + ], + "score": 1.0, + "content": "converge. Please note that the same approach can be employed to bound the KL explicitly instead", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 137, + 398, + 149 + ], + "spans": [ + { + "bbox": [ + 106, + 137, + 398, + 149 + ], + "score": 1.0, + "content": "of decoupling the contribution of mean and covariance matrix to the KL.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 82, + 506, + 149 + ] + }, + { + "type": "title", + "bbox": [ + 109, + 162, + 314, + 173 + ], + "lines": [ + { + "bbox": [ + 107, + 162, + 316, + 174 + ], + "spans": [ + { + "bbox": [ + 107, + 162, + 316, + 174 + ], + "score": 1.0, + "content": "D.4 PARAMETRIC VARIATIONAL DISTRIBUTION", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 105, + 182, + 505, + 205 + ], + "lines": [ + { + "bbox": [ + 105, + 182, + 505, + 195 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 505, + 195 + ], + "score": 1.0, + "content": "In this case we assume our variational distribution also uses a Gaussian distribution over the action", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 194, + 304, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 293, + 207 + ], + "score": 1.0, + "content": "space and use the same structure as our policy", + "type": "text" + }, + { + "bbox": [ + 293, + 197, + 300, + 204 + ], + "score": 0.7, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 194, + 304, + 207 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 182, + 505, + 207 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 210, + 506, + 245 + ], + "lines": [ + { + "bbox": [ + 106, + 210, + 505, + 223 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 505, + 223 + ], + "score": 1.0, + "content": "Similar to the non-parametric case for a Gaussian distribution in the M-step we also use a decoupled", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 221, + 505, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 505, + 235 + ], + "score": 1.0, + "content": "KL but this time in the E-step for a Gaussian variational distribution. Using the same reasoning as", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 232, + 448, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 448, + 245 + ], + "score": 1.0, + "content": "in the previous section we can obtain the following generalized Lagrangian equation:", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 210, + 505, + 245 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 132, + 257, + 478, + 283 + ], + "lines": [ + { + "bbox": [ + 132, + 257, + 478, + 283 + ], + "spans": [ + { + "bbox": [ + 132, + 257, + 478, + 283 + ], + "score": 0.92, + "content": "L ( \\theta ^ { q } , \\eta _ { \\mu } , \\eta _ { \\Sigma } ) = \\int \\mu _ { q } ( s ) \\int q ( a | s ; \\theta ^ { q } ) A _ { i } ( a , s ) d a d s + \\eta _ { \\mu } ( \\epsilon _ { \\mu } - C _ { \\mu } ) + \\eta _ { \\Sigma } ( \\epsilon _ { \\Sigma } - C _ { \\Sigma } ) .", + "type": "interline_equation", + "image_path": "de4b2919525f4d6b623529678194f028b8600a1252310bf3abf4bdee14ee6788.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 132, + 257, + 478, + 283 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 285, + 505, + 329 + ], + "lines": [ + { + "bbox": [ + 105, + 284, + 504, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 136, + 298 + ], + "score": 1.0, + "content": "Where", + "type": "text" + }, + { + "bbox": [ + 136, + 287, + 148, + 297 + ], + "score": 0.85, + "content": "\\eta _ { \\mu }", + "type": "inline_equation" + }, + { + "bbox": [ + 148, + 284, + 167, + 298 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 168, + 287, + 180, + 297 + ], + "score": 0.86, + "content": "\\eta _ { \\Sigma }", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 284, + 473, + 298 + ], + "score": 1.0, + "content": "are Lagrangian multipliers. And where we use the advantage function", + "type": "text" + }, + { + "bbox": [ + 473, + 285, + 504, + 297 + ], + "score": 0.91, + "content": "A ( a , s )", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 296, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 164, + 309 + ], + "score": 1.0, + "content": "instead of the", + "type": "text" + }, + { + "bbox": [ + 165, + 297, + 174, + 307 + ], + "score": 0.27, + "content": "\\mathrm { Q }", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 296, + 212, + 309 + ], + "score": 1.0, + "content": "function", + "type": "text" + }, + { + "bbox": [ + 212, + 296, + 243, + 308 + ], + "score": 0.93, + "content": "Q ( a , s )", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 296, + 506, + 309 + ], + "score": 1.0, + "content": ", as it empirically gave better performance. Please note that the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 306, + 505, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 306, + 148, + 320 + ], + "score": 1.0, + "content": "KL in the", + "type": "text" + }, + { + "bbox": [ + 148, + 308, + 156, + 317 + ], + "score": 0.44, + "content": "\\mathrm { E }", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 306, + 505, + 320 + ], + "score": 1.0, + "content": "-step is different than the one used in the M-step. Following prior works on constraint", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 318, + 356, + 331 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 356, + 331 + ], + "score": 1.0, + "content": "optimisation, we can formulate the following primal problem,", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 284, + 506, + 331 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 244, + 344, + 366, + 365 + ], + "lines": [ + { + "bbox": [ + 244, + 344, + 366, + 365 + ], + "spans": [ + { + "bbox": [ + 244, + 344, + 366, + 365 + ], + "score": 0.91, + "content": "\\operatorname* { m a x } _ { \\pmb { \\theta } ^ { q } } \\operatorname* { m i n } _ { \\eta _ { \\mu } > 0 , \\eta _ { \\Sigma } > 0 } L ( \\pmb { \\theta } ^ { q } , \\eta _ { \\mu } , \\eta _ { \\Sigma } )", + "type": "interline_equation", + "image_path": "4b234296dd6ac24b07d0dee1307a6b8b8791da36b2d98c8193a85ed6bc4271a2.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 244, + 344, + 366, + 365 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 372, + 505, + 473 + ], + "lines": [ + { + "bbox": [ + 105, + 372, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 186, + 386 + ], + "score": 1.0, + "content": "In order to solve for", + "type": "text" + }, + { + "bbox": [ + 187, + 374, + 198, + 383 + ], + "score": 0.87, + "content": "\\pmb { \\theta } ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 372, + 505, + 386 + ], + "score": 1.0, + "content": "we iteratively solve the inner and outer optimisation programs independently.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 385, + 465, + 397 + ], + "score": 1.0, + "content": "In order to that we fix the Lagrangian multipliers to their current value and optimise for", + "type": "text" + }, + { + "bbox": [ + 466, + 384, + 477, + 395 + ], + "score": 0.86, + "content": "\\pmb { \\theta } ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 385, + 505, + 397 + ], + "score": 1.0, + "content": "(outer", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 395, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 104, + 395, + 489, + 407 + ], + "score": 1.0, + "content": "maximisation), in this case we use the likelihood ratio gradient to compute the gradient w.r.t", + "type": "text" + }, + { + "bbox": [ + 490, + 396, + 501, + 406 + ], + "score": 0.85, + "content": "\\pmb { \\theta } ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 395, + 505, + 407 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 405, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 249, + 419 + ], + "score": 1.0, + "content": "Subsequently we fix the parameters", + "type": "text" + }, + { + "bbox": [ + 249, + 406, + 260, + 416 + ], + "score": 0.87, + "content": "\\pmb { \\theta } ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 405, + 505, + 419 + ], + "score": 1.0, + "content": "to their current value and optimise for Lagrangian multipliers", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 416, + 506, + 430 + ], + "spans": [ + { + "bbox": [ + 104, + 416, + 460, + 430 + ], + "score": 1.0, + "content": "(inner minimisation). We iteratively continue this procedure until the policy parameters", + "type": "text" + }, + { + "bbox": [ + 460, + 417, + 472, + 428 + ], + "score": 0.87, + "content": "\\pmb { \\theta } ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 472, + 416, + 506, + 430 + ], + "score": 1.0, + "content": "and the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 429, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 106, + 429, + 505, + 441 + ], + "score": 1.0, + "content": "Lagrangian multipliers converges. Please note that the same approach can be used to bound the KL", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 439, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 439, + 505, + 452 + ], + "score": 1.0, + "content": "explicitly instead of decoupling the contribution of mean and covariance matrix to the KL. As our", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 449, + 506, + 463 + ], + "spans": [ + { + "bbox": [ + 104, + 449, + 506, + 463 + ], + "score": 1.0, + "content": "policy has the same structure as the parametric variational distribution, the M step in this case reduce", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 460, + 418, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 218, + 475 + ], + "score": 1.0, + "content": "to set the policy parameters", + "type": "text" + }, + { + "bbox": [ + 219, + 462, + 226, + 471 + ], + "score": 0.82, + "content": "\\pmb { \\theta }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 460, + 298, + 475 + ], + "score": 1.0, + "content": "to the parameters", + "type": "text" + }, + { + "bbox": [ + 298, + 461, + 309, + 471 + ], + "score": 0.88, + "content": "\\pmb { \\theta } ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 460, + 418, + 475 + ], + "score": 1.0, + "content": "we obtained in E-step, i.e,", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 22, + "bbox_fs": [ + 104, + 372, + 506, + 475 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 282, + 478, + 328, + 491 + ], + "lines": [ + { + "bbox": [ + 282, + 478, + 328, + 491 + ], + "spans": [ + { + "bbox": [ + 282, + 478, + 328, + 491 + ], + "score": 0.91, + "content": "\\pmb \\theta _ { i + 1 } = \\pmb \\theta ^ { q }", + "type": "interline_equation", + "image_path": "3335988042fcacda2ddb21904a29a953d9a17fbbbd5d1c6bf3c8258d315d9930.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 282, + 478, + 328, + 491 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "title", + "bbox": [ + 108, + 507, + 266, + 519 + ], + "lines": [ + { + "bbox": [ + 105, + 506, + 267, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 267, + 521 + ], + "score": 1.0, + "content": "E IMPLEMENTATION DETAILS", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 106, + 531, + 505, + 598 + ], + "lines": [ + { + "bbox": [ + 105, + 531, + 506, + 544 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 506, + 544 + ], + "score": 1.0, + "content": "While we ran most of our experiments using a single learner, we implemented a scalable variant", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 542, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 106, + 542, + 505, + 554 + ], + "score": 1.0, + "content": "of the presented method in which multiple workers collect data independently in an instance of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 553, + 506, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 553, + 506, + 567 + ], + "score": 1.0, + "content": "the considered environment, compute gradients and send them to a chief (or parameter server) that", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 565, + 505, + 577 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 505, + 577 + ], + "score": 1.0, + "content": "performs parameter update by averaging gradients. That is we use distributed synchronous gradient", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 575, + 506, + 588 + ], + "spans": [ + { + "bbox": [ + 105, + 575, + 506, + 588 + ], + "score": 1.0, + "content": "descent. These procedures are described in Algorithms 1 and 2 for the non-parametric case and 3", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 586, + 202, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 202, + 600 + ], + "score": 1.0, + "content": "for the parametric case.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 31.5, + "bbox_fs": [ + 105, + 531, + 506, + 600 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 120, + 213, + 132 + ], + "lines": [ + { + "bbox": [ + 105, + 119, + 215, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 119, + 215, + 136 + ], + "score": 1.0, + "content": "Algorithm 1 MPO (chief)", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 109, + 134, + 427, + 296 + ], + "lines": [ + { + "bbox": [ + 110, + 132, + 284, + 147 + ], + "spans": [ + { + "bbox": [ + 110, + 132, + 147, + 147 + ], + "score": 1.0, + "content": "1: Input", + "type": "text" + }, + { + "bbox": [ + 147, + 135, + 156, + 144 + ], + "score": 0.64, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 132, + 284, + 147 + ], + "score": 1.0, + "content": "number of gradients to average", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 111, + 145, + 184, + 156 + ], + "spans": [ + { + "bbox": [ + 111, + 145, + 184, + 156 + ], + "score": 1.0, + "content": "2: while True do", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 110, + 155, + 200, + 167 + ], + "spans": [ + { + "bbox": [ + 110, + 156, + 122, + 167 + ], + "score": 1.0, + "content": "3:", + "type": "text" + }, + { + "bbox": [ + 137, + 155, + 175, + 167 + ], + "score": 1.0, + "content": "initialize", + "type": "text" + }, + { + "bbox": [ + 175, + 156, + 200, + 167 + ], + "score": 0.82, + "content": "\\Nu = 0", + "type": "inline_equation" + } + ], + "index": 3 + }, + { + "bbox": [ + 110, + 165, + 425, + 181 + ], + "spans": [ + { + "bbox": [ + 110, + 167, + 121, + 178 + ], + "score": 1.0, + "content": "4:", + "type": "text" + }, + { + "bbox": [ + 136, + 165, + 232, + 181 + ], + "score": 1.0, + "content": "initialize gradient store", + "type": "text" + }, + { + "bbox": [ + 232, + 166, + 425, + 180 + ], + "score": 0.66, + "content": "s _ { \\phi } = \\{ \\} , s _ { \\eta } = \\{ \\} , s _ { \\eta _ { \\mu } } = \\{ \\} , s _ { \\eta _ { \\Sigma } } = \\{ \\} \\ : s _ { \\theta } = \\{ \\}", + "type": "inline_equation" + } + ], + "index": 4 + }, + { + "bbox": [ + 110, + 178, + 209, + 189 + ], + "spans": [ + { + "bbox": [ + 110, + 178, + 121, + 189 + ], + "score": 1.0, + "content": "5:", + "type": "text" + }, + { + "bbox": [ + 138, + 178, + 163, + 189 + ], + "score": 1.0, + "content": "while", + "type": "text" + }, + { + "bbox": [ + 164, + 178, + 195, + 188 + ], + "score": 0.89, + "content": "N < G", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 178, + 209, + 189 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 110, + 189, + 300, + 200 + ], + "spans": [ + { + "bbox": [ + 110, + 189, + 121, + 200 + ], + "score": 1.0, + "content": "6:", + "type": "text" + }, + { + "bbox": [ + 152, + 189, + 291, + 200 + ], + "score": 1.0, + "content": "receive next gradient from worker", + "type": "text" + }, + { + "bbox": [ + 291, + 191, + 300, + 199 + ], + "score": 0.74, + "content": "w", + "type": "inline_equation" + } + ], + "index": 6 + }, + { + "bbox": [ + 110, + 199, + 232, + 258 + ], + "spans": [ + { + "bbox": [ + 110, + 200, + 121, + 212 + ], + "score": 1.0, + "content": "7:", + "type": "text" + }, + { + "bbox": [ + 151, + 199, + 232, + 258 + ], + "score": 0.88, + "content": "\\begin{array} { l } { { s _ { \\phi } = s _ { \\phi } + [ \\bar { \\delta } \\phi ^ { w } ] } } \\\\ { { s _ { \\phi } = s _ { \\theta } + [ \\delta \\theta ^ { w } ] } } \\\\ { { s _ { \\eta } = s _ { \\eta } + [ \\delta \\eta ^ { w } ] } } \\\\ { { s _ { \\eta _ { \\mu } } = s _ { \\eta _ { \\mu } } + [ \\delta \\eta _ { \\mu } ^ { w } ] } } \\\\ { { s _ { \\eta _ { \\theta } } = s _ { \\eta _ { \\theta } } + [ \\delta \\eta _ { \\theta } ^ { w } ] } } \\end{array}", + "type": "inline_equation", + "image_path": "43654a64aa24f4099b9a9608672971197806ed23b217a25d33a87a1792ddfe37.jpg" + } + ], + "index": 10 + }, + { + "bbox": [ + 110, + 211, + 122, + 222 + ], + "spans": [ + { + "bbox": [ + 110, + 211, + 122, + 222 + ], + "score": 1.0, + "content": "8:", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 110, + 222, + 121, + 233 + ], + "spans": [ + { + "bbox": [ + 110, + 222, + 121, + 233 + ], + "score": 1.0, + "content": "9:", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 233, + 122, + 244 + ], + "spans": [ + { + "bbox": [ + 107, + 233, + 122, + 244 + ], + "score": 1.0, + "content": "10:", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 245, + 122, + 257 + ], + "spans": [ + { + "bbox": [ + 106, + 245, + 122, + 257 + ], + "score": 1.0, + "content": "11:", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 258, + 324, + 271 + ], + "spans": [ + { + "bbox": [ + 106, + 258, + 122, + 271 + ], + "score": 1.0, + "content": "12:", + "type": "text" + }, + { + "bbox": [ + 138, + 258, + 324, + 271 + ], + "score": 1.0, + "content": "update parameters with average gradient from", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 270, + 215, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 122, + 281 + ], + "score": 1.0, + "content": "13:", + "type": "text" + }, + { + "bbox": [ + 138, + 272, + 149, + 282 + ], + "score": 0.57, + "content": "s _ { \\phi }", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 272, + 215, + 282 + ], + "score": 1.0, + "content": ", sη, sηµ, sηΣ sθ", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 280, + 269, + 292 + ], + "spans": [ + { + "bbox": [ + 106, + 280, + 122, + 292 + ], + "score": 1.0, + "content": "14:", + "type": "text" + }, + { + "bbox": [ + 137, + 281, + 269, + 292 + ], + "score": 1.0, + "content": "send new parameters to workers", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 7.5 + }, + { + "type": "title", + "bbox": [ + 107, + 382, + 385, + 393 + ], + "lines": [ + { + "bbox": [ + 106, + 381, + 386, + 395 + ], + "spans": [ + { + "bbox": [ + 106, + 381, + 386, + 395 + ], + "score": 1.0, + "content": "Algorithm 2 MPO (worker) - Non parametric variational distribution", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 397, + 506, + 691 + ], + "lines": [ + { + "bbox": [ + 110, + 394, + 216, + 409 + ], + "spans": [ + { + "bbox": [ + 110, + 394, + 216, + 409 + ], + "score": 1.0, + "content": "1: Input = \u000f, \u000fΣ, \u000fµ, Lmax", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 110, + 406, + 189, + 419 + ], + "spans": [ + { + "bbox": [ + 110, + 406, + 123, + 419 + ], + "score": 1.0, + "content": "2:", + "type": "text" + }, + { + "bbox": [ + 123, + 407, + 146, + 417 + ], + "score": 0.5, + "content": "i = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 406, + 150, + 419 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 150, + 407, + 189, + 417 + ], + "score": 0.4, + "content": "L _ { \\mathrm { c u r r } } = 0", + "type": "inline_equation" + } + ], + "index": 17 + }, + { + "bbox": [ + 109, + 415, + 287, + 431 + ], + "spans": [ + { + "bbox": [ + 109, + 415, + 160, + 431 + ], + "score": 1.0, + "content": "3: Initialise", + "type": "text" + }, + { + "bbox": [ + 161, + 417, + 287, + 429 + ], + "score": 0.4, + "content": "Q _ { \\omega _ { i } } ( a , s ) , \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\eta , \\eta _ { \\mu } , \\eta _ { \\Sigma }", + "type": "inline_equation" + } + ], + "index": 18 + }, + { + "bbox": [ + 110, + 427, + 204, + 440 + ], + "spans": [ + { + "bbox": [ + 110, + 427, + 204, + 440 + ], + "score": 1.0, + "content": "4: for each worker do", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 110, + 438, + 231, + 451 + ], + "spans": [ + { + "bbox": [ + 110, + 439, + 122, + 450 + ], + "score": 1.0, + "content": "5:", + "type": "text" + }, + { + "bbox": [ + 136, + 438, + 163, + 451 + ], + "score": 1.0, + "content": "while", + "type": "text" + }, + { + "bbox": [ + 164, + 439, + 216, + 450 + ], + "score": 0.87, + "content": "L _ { \\mathrm { c u r r } } > L _ { \\mathrm { m a x } }", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 438, + 231, + 451 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 110, + 449, + 410, + 462 + ], + "spans": [ + { + "bbox": [ + 110, + 451, + 122, + 461 + ], + "score": 1.0, + "content": "6:", + "type": "text" + }, + { + "bbox": [ + 152, + 449, + 236, + 462 + ], + "score": 1.0, + "content": "update replay buffer", + "type": "text" + }, + { + "bbox": [ + 236, + 451, + 244, + 460 + ], + "score": 0.81, + "content": "\\boldsymbol { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 449, + 265, + 462 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 266, + 451, + 273, + 460 + ], + "score": 0.44, + "content": "\\mathrm { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 449, + 410, + 462 + ], + "score": 1.0, + "content": "trajectories from the environment", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 110, + 461, + 179, + 473 + ], + "spans": [ + { + "bbox": [ + 110, + 461, + 122, + 473 + ], + "score": 1.0, + "content": "7:", + "type": "text" + }, + { + "bbox": [ + 153, + 461, + 179, + 471 + ], + "score": 0.63, + "content": "\\bar { k = 0 }", + "type": "inline_equation", + "image_path": "e1473127801c9fa69daa8fd7232f901a7d62c0e2c61d2f56ff71f5b504a381da.jpg" + } + ], + "index": 22 + }, + { + "bbox": [ + 110, + 471, + 315, + 484 + ], + "spans": [ + { + "bbox": [ + 110, + 472, + 122, + 483 + ], + "score": 1.0, + "content": "8:", + "type": "text" + }, + { + "bbox": [ + 151, + 471, + 315, + 484 + ], + "score": 1.0, + "content": "// Find better policy by gradient descent", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 109, + 482, + 233, + 495 + ], + "spans": [ + { + "bbox": [ + 109, + 482, + 122, + 495 + ], + "score": 1.0, + "content": "9:", + "type": "text" + }, + { + "bbox": [ + 153, + 483, + 178, + 494 + ], + "score": 1.0, + "content": "while", + "type": "text" + }, + { + "bbox": [ + 178, + 483, + 219, + 493 + ], + "score": 0.86, + "content": "k < 1 0 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 483, + 233, + 494 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 493, + 388, + 506 + ], + "spans": [ + { + "bbox": [ + 106, + 494, + 122, + 506 + ], + "score": 1.0, + "content": "10:", + "type": "text" + }, + { + "bbox": [ + 167, + 493, + 251, + 506 + ], + "score": 1.0, + "content": "sample a mini-batch", + "type": "text" + }, + { + "bbox": [ + 252, + 495, + 260, + 504 + ], + "score": 0.82, + "content": "\\boldsymbol { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 493, + 271, + 506 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 272, + 495, + 282, + 504 + ], + "score": 0.54, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 495, + 316, + 505 + ], + "score": 0.42, + "content": "( s , a , r )", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 493, + 388, + 506 + ], + "score": 1.0, + "content": "pairs from replay", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 504, + 505, + 518 + ], + "spans": [ + { + "bbox": [ + 106, + 505, + 122, + 517 + ], + "score": 1.0, + "content": "11:", + "type": "text" + }, + { + "bbox": [ + 167, + 504, + 198, + 518 + ], + "score": 1.0, + "content": "sample", + "type": "text" + }, + { + "bbox": [ + 199, + 505, + 210, + 515 + ], + "score": 0.76, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 211, + 504, + 358, + 518 + ], + "score": 1.0, + "content": "additional actions for each state from", + "type": "text" + }, + { + "bbox": [ + 358, + 505, + 366, + 515 + ], + "score": 0.7, + "content": "\\boldsymbol { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 504, + 369, + 518 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 370, + 505, + 410, + 517 + ], + "score": 0.92, + "content": "\\bar { \\pi } ( \\bar { a } | s , \\pmb \\theta _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 504, + 505, + 518 + ], + "score": 1.0, + "content": "for estimating integrals", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 515, + 385, + 528 + ], + "spans": [ + { + "bbox": [ + 106, + 515, + 122, + 527 + ], + "score": 1.0, + "content": "12:", + "type": "text" + }, + { + "bbox": [ + 167, + 515, + 385, + 528 + ], + "score": 1.0, + "content": "compute gradients, estimating integrals using samples", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 525, + 261, + 539 + ], + "spans": [ + { + "bbox": [ + 106, + 526, + 122, + 538 + ], + "score": 1.0, + "content": "13:", + "type": "text" + }, + { + "bbox": [ + 167, + 525, + 261, + 539 + ], + "score": 1.0, + "content": "// Q-function gradient:", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 537, + 229, + 551 + ], + "spans": [ + { + "bbox": [ + 106, + 537, + 122, + 549 + ], + "score": 1.0, + "content": "14:", + "type": "text" + }, + { + "bbox": [ + 168, + 537, + 229, + 551 + ], + "score": 0.88, + "content": "\\delta _ { \\phi } = \\partial _ { \\phi } L _ { \\phi } ^ { \\prime } ( \\phi )", + "type": "inline_equation" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 546, + 244, + 562 + ], + "spans": [ + { + "bbox": [ + 106, + 548, + 122, + 560 + ], + "score": 1.0, + "content": "15:", + "type": "text" + }, + { + "bbox": [ + 166, + 546, + 244, + 562 + ], + "score": 1.0, + "content": "// E-Step gradient:", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 559, + 221, + 572 + ], + "spans": [ + { + "bbox": [ + 106, + 560, + 122, + 572 + ], + "score": 1.0, + "content": "16:", + "type": "text" + }, + { + "bbox": [ + 168, + 559, + 221, + 572 + ], + "score": 0.76, + "content": "\\delta \\eta = \\bar { \\partial _ { \\eta } g ( \\eta ) }", + "type": "inline_equation" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 568, + 338, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 574, + 122, + 587 + ], + "score": 1.0, + "content": "17:", + "type": "text" + }, + { + "bbox": [ + 163, + 568, + 338, + 590 + ], + "score": 1.0, + "content": "Let: q(a|s) ∝ π(a|s, θi) exp( Qθt (a,s,φ0)η )", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 585, + 247, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 122, + 599 + ], + "score": 1.0, + "content": "18:", + "type": "text" + }, + { + "bbox": [ + 167, + 585, + 247, + 601 + ], + "score": 1.0, + "content": "// M-Step gradient:", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 598, + 310, + 610 + ], + "spans": [ + { + "bbox": [ + 106, + 598, + 122, + 610 + ], + "score": 1.0, + "content": "19:", + "type": "text" + }, + { + "bbox": [ + 168, + 598, + 310, + 610 + ], + "score": 0.37, + "content": "[ \\delta _ { \\eta _ { \\mu } } , \\delta _ { \\eta _ { \\Sigma } } ] \\stackrel { - } { = } \\alpha \\partial _ { \\eta _ { \\mu } , \\eta _ { \\Sigma } } { \\cal L } ( \\theta _ { k } , \\eta _ { \\mu } , \\eta _ { \\Sigma } )", + "type": "inline_equation" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 609, + 282, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 122, + 621 + ], + "score": 1.0, + "content": "20:", + "type": "text" + }, + { + "bbox": [ + 168, + 610, + 282, + 623 + ], + "score": 0.34, + "content": "\\delta _ { \\theta } = \\partial _ { \\theta } L ( \\theta , \\eta _ { \\mu _ { k + 1 } } , \\eta _ { \\Sigma k + 1 } )", + "type": "inline_equation" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 619, + 291, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 122, + 632 + ], + "score": 1.0, + "content": "21:", + "type": "text" + }, + { + "bbox": [ + 167, + 619, + 291, + 632 + ], + "score": 1.0, + "content": "send gradients to chief worker", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 630, + 302, + 643 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 121, + 643 + ], + "score": 1.0, + "content": "22:", + "type": "text" + }, + { + "bbox": [ + 167, + 630, + 302, + 643 + ], + "score": 1.0, + "content": "wait for gradient update by chief", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 640, + 312, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 122, + 654 + ], + "score": 1.0, + "content": "23:", + "type": "text" + }, + { + "bbox": [ + 166, + 640, + 255, + 656 + ], + "score": 1.0, + "content": "fetch new parameters", + "type": "text" + }, + { + "bbox": [ + 256, + 642, + 312, + 654 + ], + "score": 0.91, + "content": "\\phi , \\theta , \\eta , \\eta _ { \\mu } , \\eta _ { \\Sigma }", + "type": "inline_equation" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 651, + 267, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 652, + 122, + 666 + ], + "score": 1.0, + "content": "24:", + "type": "text" + }, + { + "bbox": [ + 152, + 651, + 267, + 690 + ], + "score": 0.87, + "content": "\\begin{array} { r } { k = k + 1 ^ { \\circ } } \\\\ { i = i + 1 , L _ { \\mathrm { c u r r } } = L _ { \\mathrm { c u r r } } + L } \\\\ { \\pmb { \\theta } _ { i } = \\pmb { \\theta } , \\phi ^ { \\prime } = \\phi } \\end{array}", + "type": "inline_equation", + "image_path": "691de69d668a34fcafbf05a974d33400566699d1d0a9d2a401830ece9cbe97fb.jpg" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 664, + 122, + 676 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 122, + 676 + ], + "score": 1.0, + "content": "25:", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 674, + 123, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 674, + 123, + 689 + ], + "score": 1.0, + "content": "26:", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 28.5 + } + ], + "page_idx": 20, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 14 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 120, + 213, + 132 + ], + "lines": [ + { + "bbox": [ + 105, + 119, + 215, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 119, + 215, + 136 + ], + "score": 1.0, + "content": "Algorithm 1 MPO (chief)", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "index", + "bbox": [ + 109, + 134, + 427, + 296 + ], + "lines": [ + { + "bbox": [ + 110, + 132, + 284, + 147 + ], + "spans": [ + { + "bbox": [ + 110, + 132, + 147, + 147 + ], + "score": 1.0, + "content": "1: Input", + "type": "text" + }, + { + "bbox": [ + 147, + 135, + 156, + 144 + ], + "score": 0.64, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 132, + 284, + 147 + ], + "score": 1.0, + "content": "number of gradients to average", + "type": "text" + } + ], + "index": 1, + "is_list_start_line": true + }, + { + "bbox": [ + 111, + 145, + 184, + 156 + ], + "spans": [ + { + "bbox": [ + 111, + 145, + 184, + 156 + ], + "score": 1.0, + "content": "2: while True do", + "type": "text" + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 155, + 200, + 167 + ], + "spans": [ + { + "bbox": [ + 110, + 156, + 122, + 167 + ], + "score": 1.0, + "content": "3:", + "type": "text" + }, + { + "bbox": [ + 137, + 155, + 175, + 167 + ], + "score": 1.0, + "content": "initialize", + "type": "text" + }, + { + "bbox": [ + 175, + 156, + 200, + 167 + ], + "score": 0.82, + "content": "\\Nu = 0", + "type": "inline_equation" + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 165, + 425, + 181 + ], + "spans": [ + { + "bbox": [ + 110, + 167, + 121, + 178 + ], + "score": 1.0, + "content": "4:", + "type": "text" + }, + { + "bbox": [ + 136, + 165, + 232, + 181 + ], + "score": 1.0, + "content": "initialize gradient store", + "type": "text" + }, + { + "bbox": [ + 232, + 166, + 425, + 180 + ], + "score": 0.66, + "content": "s _ { \\phi } = \\{ \\} , s _ { \\eta } = \\{ \\} , s _ { \\eta _ { \\mu } } = \\{ \\} , s _ { \\eta _ { \\Sigma } } = \\{ \\} \\ : s _ { \\theta } = \\{ \\}", + "type": "inline_equation" + } + ], + "index": 4, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 178, + 209, + 189 + ], + "spans": [ + { + "bbox": [ + 110, + 178, + 121, + 189 + ], + "score": 1.0, + "content": "5:", + "type": "text" + }, + { + "bbox": [ + 138, + 178, + 163, + 189 + ], + "score": 1.0, + "content": "while", + "type": "text" + }, + { + "bbox": [ + 164, + 178, + 195, + 188 + ], + "score": 0.89, + "content": "N < G", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 178, + 209, + 189 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 189, + 300, + 200 + ], + "spans": [ + { + "bbox": [ + 110, + 189, + 121, + 200 + ], + "score": 1.0, + "content": "6:", + "type": "text" + }, + { + "bbox": [ + 152, + 189, + 291, + 200 + ], + "score": 1.0, + "content": "receive next gradient from worker", + "type": "text" + }, + { + "bbox": [ + 291, + 191, + 300, + 199 + ], + "score": 0.74, + "content": "w", + "type": "inline_equation" + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 199, + 232, + 258 + ], + "spans": [ + { + "bbox": [ + 110, + 200, + 121, + 212 + ], + "score": 1.0, + "content": "7:", + "type": "text" + }, + { + "bbox": [ + 151, + 199, + 232, + 258 + ], + "score": 0.88, + "content": "\\begin{array} { l } { { s _ { \\phi } = s _ { \\phi } + [ \\bar { \\delta } \\phi ^ { w } ] } } \\\\ { { s _ { \\phi } = s _ { \\theta } + [ \\delta \\theta ^ { w } ] } } \\\\ { { s _ { \\eta } = s _ { \\eta } + [ \\delta \\eta ^ { w } ] } } \\\\ { { s _ { \\eta _ { \\mu } } = s _ { \\eta _ { \\mu } } + [ \\delta \\eta _ { \\mu } ^ { w } ] } } \\\\ { { s _ { \\eta _ { \\theta } } = s _ { \\eta _ { \\theta } } + [ \\delta \\eta _ { \\theta } ^ { w } ] } } \\end{array}", + "type": "inline_equation", + "image_path": "43654a64aa24f4099b9a9608672971197806ed23b217a25d33a87a1792ddfe37.jpg" + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 211, + 122, + 222 + ], + "spans": [ + { + "bbox": [ + 110, + 211, + 122, + 222 + ], + "score": 1.0, + "content": "8:", + "type": "text" + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 222, + 121, + 233 + ], + "spans": [ + { + "bbox": [ + 110, + 222, + 121, + 233 + ], + "score": 1.0, + "content": "9:", + "type": "text" + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 107, + 233, + 122, + 244 + ], + "spans": [ + { + "bbox": [ + 107, + 233, + 122, + 244 + ], + "score": 1.0, + "content": "10:", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 245, + 122, + 257 + ], + "spans": [ + { + "bbox": [ + 106, + 245, + 122, + 257 + ], + "score": 1.0, + "content": "11:", + "type": "text" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 258, + 324, + 271 + ], + "spans": [ + { + "bbox": [ + 106, + 258, + 122, + 271 + ], + "score": 1.0, + "content": "12:", + "type": "text" + }, + { + "bbox": [ + 138, + 258, + 324, + 271 + ], + "score": 1.0, + "content": "update parameters with average gradient from", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 270, + 215, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 122, + 281 + ], + "score": 1.0, + "content": "13:", + "type": "text" + }, + { + "bbox": [ + 138, + 272, + 149, + 282 + ], + "score": 0.57, + "content": "s _ { \\phi }", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 272, + 215, + 282 + ], + "score": 1.0, + "content": ", sη, sηµ, sηΣ sθ", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 280, + 269, + 292 + ], + "spans": [ + { + "bbox": [ + 106, + 280, + 122, + 292 + ], + "score": 1.0, + "content": "14:", + "type": "text" + }, + { + "bbox": [ + 137, + 281, + 269, + 292 + ], + "score": 1.0, + "content": "send new parameters to workers", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + } + ], + "index": 7.5, + "bbox_fs": [ + 106, + 132, + 425, + 292 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 382, + 385, + 393 + ], + "lines": [ + { + "bbox": [ + 106, + 381, + 386, + 395 + ], + "spans": [ + { + "bbox": [ + 106, + 381, + 386, + 395 + ], + "score": 1.0, + "content": "Algorithm 2 MPO (worker) - Non parametric variational distribution", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "index", + "bbox": [ + 106, + 397, + 506, + 691 + ], + "lines": [ + { + "bbox": [ + 110, + 394, + 216, + 409 + ], + "spans": [ + { + "bbox": [ + 110, + 394, + 216, + 409 + ], + "score": 1.0, + "content": "1: Input = \u000f, \u000fΣ, \u000fµ, Lmax", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 406, + 189, + 419 + ], + "spans": [ + { + "bbox": [ + 110, + 406, + 123, + 419 + ], + "score": 1.0, + "content": "2:", + "type": "text" + }, + { + "bbox": [ + 123, + 407, + 146, + 417 + ], + "score": 0.5, + "content": "i = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 406, + 150, + 419 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 150, + 407, + 189, + 417 + ], + "score": 0.4, + "content": "L _ { \\mathrm { c u r r } } = 0", + "type": "inline_equation" + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 109, + 415, + 287, + 431 + ], + "spans": [ + { + "bbox": [ + 109, + 415, + 160, + 431 + ], + "score": 1.0, + "content": "3: Initialise", + "type": "text" + }, + { + "bbox": [ + 161, + 417, + 287, + 429 + ], + "score": 0.4, + "content": "Q _ { \\omega _ { i } } ( a , s ) , \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\eta , \\eta _ { \\mu } , \\eta _ { \\Sigma }", + "type": "inline_equation" + } + ], + "index": 18, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 427, + 204, + 440 + ], + "spans": [ + { + "bbox": [ + 110, + 427, + 204, + 440 + ], + "score": 1.0, + "content": "4: for each worker do", + "type": "text" + } + ], + "index": 19, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 438, + 231, + 451 + ], + "spans": [ + { + "bbox": [ + 110, + 439, + 122, + 450 + ], + "score": 1.0, + "content": "5:", + "type": "text" + }, + { + "bbox": [ + 136, + 438, + 163, + 451 + ], + "score": 1.0, + "content": "while", + "type": "text" + }, + { + "bbox": [ + 164, + 439, + 216, + 450 + ], + "score": 0.87, + "content": "L _ { \\mathrm { c u r r } } > L _ { \\mathrm { m a x } }", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 438, + 231, + 451 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 20, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 449, + 410, + 462 + ], + "spans": [ + { + "bbox": [ + 110, + 451, + 122, + 461 + ], + "score": 1.0, + "content": "6:", + "type": "text" + }, + { + "bbox": [ + 152, + 449, + 236, + 462 + ], + "score": 1.0, + "content": "update replay buffer", + "type": "text" + }, + { + "bbox": [ + 236, + 451, + 244, + 460 + ], + "score": 0.81, + "content": "\\boldsymbol { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 449, + 265, + 462 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 266, + 451, + 273, + 460 + ], + "score": 0.44, + "content": "\\mathrm { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 449, + 410, + 462 + ], + "score": 1.0, + "content": "trajectories from the environment", + "type": "text" + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 461, + 179, + 473 + ], + "spans": [ + { + "bbox": [ + 110, + 461, + 122, + 473 + ], + "score": 1.0, + "content": "7:", + "type": "text" + }, + { + "bbox": [ + 153, + 461, + 179, + 471 + ], + "score": 0.63, + "content": "\\bar { k = 0 }", + "type": "inline_equation", + "image_path": "e1473127801c9fa69daa8fd7232f901a7d62c0e2c61d2f56ff71f5b504a381da.jpg" + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 471, + 315, + 484 + ], + "spans": [ + { + "bbox": [ + 110, + 472, + 122, + 483 + ], + "score": 1.0, + "content": "8:", + "type": "text" + }, + { + "bbox": [ + 151, + 471, + 315, + 484 + ], + "score": 1.0, + "content": "// Find better policy by gradient descent", + "type": "text" + } + ], + "index": 23, + "is_list_start_line": true + }, + { + "bbox": [ + 109, + 482, + 233, + 495 + ], + "spans": [ + { + "bbox": [ + 109, + 482, + 122, + 495 + ], + "score": 1.0, + "content": "9:", + "type": "text" + }, + { + "bbox": [ + 153, + 483, + 178, + 494 + ], + "score": 1.0, + "content": "while", + "type": "text" + }, + { + "bbox": [ + 178, + 483, + 219, + 493 + ], + "score": 0.86, + "content": "k < 1 0 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 483, + 233, + 494 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 493, + 388, + 506 + ], + "spans": [ + { + "bbox": [ + 106, + 494, + 122, + 506 + ], + "score": 1.0, + "content": "10:", + "type": "text" + }, + { + "bbox": [ + 167, + 493, + 251, + 506 + ], + "score": 1.0, + "content": "sample a mini-batch", + "type": "text" + }, + { + "bbox": [ + 252, + 495, + 260, + 504 + ], + "score": 0.82, + "content": "\\boldsymbol { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 493, + 271, + 506 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 272, + 495, + 282, + 504 + ], + "score": 0.54, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 495, + 316, + 505 + ], + "score": 0.42, + "content": "( s , a , r )", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 493, + 388, + 506 + ], + "score": 1.0, + "content": "pairs from replay", + "type": "text" + } + ], + "index": 25, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 504, + 505, + 518 + ], + "spans": [ + { + "bbox": [ + 106, + 505, + 122, + 517 + ], + "score": 1.0, + "content": "11:", + "type": "text" + }, + { + "bbox": [ + 167, + 504, + 198, + 518 + ], + "score": 1.0, + "content": "sample", + "type": "text" + }, + { + "bbox": [ + 199, + 505, + 210, + 515 + ], + "score": 0.76, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 211, + 504, + 358, + 518 + ], + "score": 1.0, + "content": "additional actions for each state from", + "type": "text" + }, + { + "bbox": [ + 358, + 505, + 366, + 515 + ], + "score": 0.7, + "content": "\\boldsymbol { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 504, + 369, + 518 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 370, + 505, + 410, + 517 + ], + "score": 0.92, + "content": "\\bar { \\pi } ( \\bar { a } | s , \\pmb \\theta _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 504, + 505, + 518 + ], + "score": 1.0, + "content": "for estimating integrals", + "type": "text" + } + ], + "index": 26, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 515, + 385, + 528 + ], + "spans": [ + { + "bbox": [ + 106, + 515, + 122, + 527 + ], + "score": 1.0, + "content": "12:", + "type": "text" + }, + { + "bbox": [ + 167, + 515, + 385, + 528 + ], + "score": 1.0, + "content": "compute gradients, estimating integrals using samples", + "type": "text" + } + ], + "index": 27, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 525, + 261, + 539 + ], + "spans": [ + { + "bbox": [ + 106, + 526, + 122, + 538 + ], + "score": 1.0, + "content": "13:", + "type": "text" + }, + { + "bbox": [ + 167, + 525, + 261, + 539 + ], + "score": 1.0, + "content": "// Q-function gradient:", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 537, + 229, + 551 + ], + "spans": [ + { + "bbox": [ + 106, + 537, + 122, + 549 + ], + "score": 1.0, + "content": "14:", + "type": "text" + }, + { + "bbox": [ + 168, + 537, + 229, + 551 + ], + "score": 0.88, + "content": "\\delta _ { \\phi } = \\partial _ { \\phi } L _ { \\phi } ^ { \\prime } ( \\phi )", + "type": "inline_equation" + } + ], + "index": 29, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 546, + 244, + 562 + ], + "spans": [ + { + "bbox": [ + 106, + 548, + 122, + 560 + ], + "score": 1.0, + "content": "15:", + "type": "text" + }, + { + "bbox": [ + 166, + 546, + 244, + 562 + ], + "score": 1.0, + "content": "// E-Step gradient:", + "type": "text" + } + ], + "index": 30, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 559, + 221, + 572 + ], + "spans": [ + { + "bbox": [ + 106, + 560, + 122, + 572 + ], + "score": 1.0, + "content": "16:", + "type": "text" + }, + { + "bbox": [ + 168, + 559, + 221, + 572 + ], + "score": 0.76, + "content": "\\delta \\eta = \\bar { \\partial _ { \\eta } g ( \\eta ) }", + "type": "inline_equation" + } + ], + "index": 31, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 568, + 338, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 574, + 122, + 587 + ], + "score": 1.0, + "content": "17:", + "type": "text" + }, + { + "bbox": [ + 163, + 568, + 338, + 590 + ], + "score": 1.0, + "content": "Let: q(a|s) ∝ π(a|s, θi) exp( Qθt (a,s,φ0)η )", + "type": "text" + } + ], + "index": 32, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 585, + 247, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 122, + 599 + ], + "score": 1.0, + "content": "18:", + "type": "text" + }, + { + "bbox": [ + 167, + 585, + 247, + 601 + ], + "score": 1.0, + "content": "// M-Step gradient:", + "type": "text" + } + ], + "index": 33, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 598, + 310, + 610 + ], + "spans": [ + { + "bbox": [ + 106, + 598, + 122, + 610 + ], + "score": 1.0, + "content": "19:", + "type": "text" + }, + { + "bbox": [ + 168, + 598, + 310, + 610 + ], + "score": 0.37, + "content": "[ \\delta _ { \\eta _ { \\mu } } , \\delta _ { \\eta _ { \\Sigma } } ] \\stackrel { - } { = } \\alpha \\partial _ { \\eta _ { \\mu } , \\eta _ { \\Sigma } } { \\cal L } ( \\theta _ { k } , \\eta _ { \\mu } , \\eta _ { \\Sigma } )", + "type": "inline_equation" + } + ], + "index": 34, + "is_list_start_line": true + }, + { + "bbox": [ + 105, + 609, + 282, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 122, + 621 + ], + "score": 1.0, + "content": "20:", + "type": "text" + }, + { + "bbox": [ + 168, + 610, + 282, + 623 + ], + "score": 0.34, + "content": "\\delta _ { \\theta } = \\partial _ { \\theta } L ( \\theta , \\eta _ { \\mu _ { k + 1 } } , \\eta _ { \\Sigma k + 1 } )", + "type": "inline_equation" + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 105, + 619, + 291, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 122, + 632 + ], + "score": 1.0, + "content": "21:", + "type": "text" + }, + { + "bbox": [ + 167, + 619, + 291, + 632 + ], + "score": 1.0, + "content": "send gradients to chief worker", + "type": "text" + } + ], + "index": 36, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 630, + 302, + 643 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 121, + 643 + ], + "score": 1.0, + "content": "22:", + "type": "text" + }, + { + "bbox": [ + 167, + 630, + 302, + 643 + ], + "score": 1.0, + "content": "wait for gradient update by chief", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 105, + 640, + 312, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 122, + 654 + ], + "score": 1.0, + "content": "23:", + "type": "text" + }, + { + "bbox": [ + 166, + 640, + 255, + 656 + ], + "score": 1.0, + "content": "fetch new parameters", + "type": "text" + }, + { + "bbox": [ + 256, + 642, + 312, + 654 + ], + "score": 0.91, + "content": "\\phi , \\theta , \\eta , \\eta _ { \\mu } , \\eta _ { \\Sigma }", + "type": "inline_equation" + } + ], + "index": 38, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 651, + 267, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 652, + 122, + 666 + ], + "score": 1.0, + "content": "24:", + "type": "text" + }, + { + "bbox": [ + 152, + 651, + 267, + 690 + ], + "score": 0.87, + "content": "\\begin{array} { r } { k = k + 1 ^ { \\circ } } \\\\ { i = i + 1 , L _ { \\mathrm { c u r r } } = L _ { \\mathrm { c u r r } } + L } \\\\ { \\pmb { \\theta } _ { i } = \\pmb { \\theta } , \\phi ^ { \\prime } = \\phi } \\end{array}", + "type": "inline_equation", + "image_path": "691de69d668a34fcafbf05a974d33400566699d1d0a9d2a401830ece9cbe97fb.jpg" + } + ], + "index": 41, + "is_list_start_line": true + }, + { + "bbox": [ + 105, + 664, + 122, + 676 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 122, + 676 + ], + "score": 1.0, + "content": "25:", + "type": "text" + } + ], + "index": 39, + "is_list_start_line": true + }, + { + "bbox": [ + 105, + 674, + 123, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 674, + 123, + 689 + ], + "score": 1.0, + "content": "26:", + "type": "text" + } + ], + "index": 40, + "is_list_start_line": true + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 394, + 505, + 690 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 106, + 254, + 366, + 266 + ], + "lines": [ + { + "bbox": [ + 106, + 253, + 366, + 268 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 366, + 268 + ], + "score": 1.0, + "content": "Algorithm 3 MPO (worker) - parametric variational distribution", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 270, + 506, + 558 + ], + "lines": [ + { + "bbox": [ + 110, + 266, + 207, + 281 + ], + "spans": [ + { + "bbox": [ + 110, + 266, + 207, + 281 + ], + "score": 1.0, + "content": "1: Input = \u000fΣ, \u000fµ, Lmax", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 110, + 278, + 191, + 291 + ], + "spans": [ + { + "bbox": [ + 110, + 278, + 123, + 291 + ], + "score": 1.0, + "content": "2:", + "type": "text" + }, + { + "bbox": [ + 123, + 279, + 146, + 289 + ], + "score": 0.36, + "content": "i = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 278, + 191, + 291 + ], + "score": 1.0, + "content": ", Lcurr = 0", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 109, + 287, + 286, + 303 + ], + "spans": [ + { + "bbox": [ + 109, + 287, + 160, + 303 + ], + "score": 1.0, + "content": "3: Initialise", + "type": "text" + }, + { + "bbox": [ + 160, + 289, + 286, + 302 + ], + "score": 0.4, + "content": "Q _ { \\omega _ { i } } ( a , s ) , \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\eta , \\eta _ { \\mu } , \\eta _ { \\Sigma }", + "type": "inline_equation" + } + ], + "index": 3 + }, + { + "bbox": [ + 110, + 299, + 204, + 312 + ], + "spans": [ + { + "bbox": [ + 110, + 299, + 204, + 312 + ], + "score": 1.0, + "content": "4: for each worker do", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 109, + 311, + 231, + 324 + ], + "spans": [ + { + "bbox": [ + 109, + 311, + 123, + 324 + ], + "score": 1.0, + "content": "5:", + "type": "text" + }, + { + "bbox": [ + 137, + 311, + 163, + 324 + ], + "score": 1.0, + "content": "while", + "type": "text" + }, + { + "bbox": [ + 164, + 312, + 216, + 323 + ], + "score": 0.87, + "content": "L _ { \\mathrm { c u r r } } < L _ { \\mathrm { m a x } }", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 311, + 231, + 324 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 110, + 321, + 411, + 334 + ], + "spans": [ + { + "bbox": [ + 110, + 322, + 122, + 334 + ], + "score": 1.0, + "content": "6:", + "type": "text" + }, + { + "bbox": [ + 152, + 321, + 236, + 334 + ], + "score": 1.0, + "content": "update replay buffer", + "type": "text" + }, + { + "bbox": [ + 236, + 323, + 244, + 332 + ], + "score": 0.8, + "content": "\\boldsymbol { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 321, + 265, + 334 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 265, + 323, + 273, + 332 + ], + "score": 0.43, + "content": "\\mathrm { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 321, + 411, + 334 + ], + "score": 1.0, + "content": "trajectories from the environment", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 110, + 333, + 179, + 345 + ], + "spans": [ + { + "bbox": [ + 110, + 333, + 122, + 345 + ], + "score": 1.0, + "content": "7:", + "type": "text" + }, + { + "bbox": [ + 153, + 333, + 179, + 344 + ], + "score": 0.54, + "content": "k = 0", + "type": "inline_equation", + "image_path": "d2d609a59c7e6a80c3fcfb4b8d070099e24d4ecf350a3b8e307875d5f5d07c27.jpg" + } + ], + "index": 7 + }, + { + "bbox": [ + 110, + 344, + 315, + 356 + ], + "spans": [ + { + "bbox": [ + 110, + 344, + 122, + 356 + ], + "score": 1.0, + "content": "8:", + "type": "text" + }, + { + "bbox": [ + 152, + 344, + 315, + 356 + ], + "score": 1.0, + "content": "// Find better policy by gradient descent", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 110, + 355, + 233, + 367 + ], + "spans": [ + { + "bbox": [ + 110, + 355, + 122, + 367 + ], + "score": 1.0, + "content": "9:", + "type": "text" + }, + { + "bbox": [ + 153, + 355, + 178, + 366 + ], + "score": 1.0, + "content": "while", + "type": "text" + }, + { + "bbox": [ + 178, + 355, + 219, + 366 + ], + "score": 0.85, + "content": "k < 1 0 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 355, + 233, + 366 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 365, + 388, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 366, + 122, + 379 + ], + "score": 1.0, + "content": "10:", + "type": "text" + }, + { + "bbox": [ + 167, + 365, + 251, + 379 + ], + "score": 1.0, + "content": "sample a mini-batch", + "type": "text" + }, + { + "bbox": [ + 252, + 367, + 260, + 376 + ], + "score": 0.82, + "content": "\\boldsymbol { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 365, + 271, + 379 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 275, + 367, + 316, + 378 + ], + "score": 0.55, + "content": "\\mathrm { ~ V ~ } ( s , a , r )", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 365, + 388, + 379 + ], + "score": 1.0, + "content": "pairs from replay", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 376, + 505, + 389 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 122, + 389 + ], + "score": 1.0, + "content": "11:", + "type": "text" + }, + { + "bbox": [ + 167, + 376, + 199, + 389 + ], + "score": 1.0, + "content": "sample", + "type": "text" + }, + { + "bbox": [ + 200, + 378, + 212, + 387 + ], + "score": 0.77, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 376, + 367, + 389 + ], + "score": 1.0, + "content": "additional actions for each state from", + "type": "text" + }, + { + "bbox": [ + 368, + 378, + 376, + 387 + ], + "score": 0.7, + "content": "\\boldsymbol { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 376, + 380, + 389 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 380, + 377, + 423, + 389 + ], + "score": 0.92, + "content": "\\dot { \\pi } ( a | s , \\theta _ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 376, + 505, + 389 + ], + "score": 1.0, + "content": "for estimating inte-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 120, + 387, + 148, + 401 + ], + "spans": [ + { + "bbox": [ + 120, + 387, + 148, + 401 + ], + "score": 1.0, + "content": "grals", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 398, + 385, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 123, + 412 + ], + "score": 1.0, + "content": "12:", + "type": "text" + }, + { + "bbox": [ + 167, + 398, + 385, + 411 + ], + "score": 1.0, + "content": "compute gradients, estimating integrals using samples", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 409, + 261, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 122, + 422 + ], + "score": 1.0, + "content": "13:", + "type": "text" + }, + { + "bbox": [ + 167, + 409, + 261, + 423 + ], + "score": 1.0, + "content": "// Q-function gradient:", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 421, + 229, + 434 + ], + "spans": [ + { + "bbox": [ + 106, + 421, + 122, + 433 + ], + "score": 1.0, + "content": "14:", + "type": "text" + }, + { + "bbox": [ + 168, + 421, + 229, + 434 + ], + "score": 0.84, + "content": "\\delta _ { \\phi } = \\partial _ { \\phi } L _ { \\phi } ^ { \\prime } ( \\phi )", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 430, + 245, + 446 + ], + "spans": [ + { + "bbox": [ + 106, + 432, + 122, + 444 + ], + "score": 1.0, + "content": "15:", + "type": "text" + }, + { + "bbox": [ + 166, + 430, + 245, + 446 + ], + "score": 1.0, + "content": "// E-Step gradient:", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 442, + 310, + 468 + ], + "spans": [ + { + "bbox": [ + 106, + 443, + 122, + 455 + ], + "score": 1.0, + "content": "16:", + "type": "text" + }, + { + "bbox": [ + 168, + 442, + 310, + 468 + ], + "score": 0.39, + "content": "\\begin{array} { r l } & { \\bigl [ \\delta _ { \\eta _ { \\mu } } , \\delta _ { \\eta _ { \\Sigma } } \\bigr ] ^ { \\circ } = \\alpha \\partial _ { \\eta _ { \\mu } , \\eta _ { \\Sigma } } L ( \\pmb \\theta _ { k } , \\eta _ { \\mu } , \\eta _ { \\Sigma } ) } \\\\ & { \\delta _ { \\theta } = \\partial _ { \\theta } L ( \\pmb \\theta , \\eta _ { \\mu _ { k + 1 } } , \\eta _ { \\Sigma k + 1 , \\eta } , } \\\\ & { \\dots , \\dots } \\end{array}", + "type": "inline_equation", + "image_path": "1180ddf38bef6422e4afff17e1457f9c31d841b654b4372c5a7524524e2344b6.jpg" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 453, + 122, + 466 + ], + "spans": [ + { + "bbox": [ + 106, + 453, + 122, + 466 + ], + "score": 1.0, + "content": "17:", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 464, + 505, + 477 + ], + "spans": [ + { + "bbox": [ + 106, + 465, + 122, + 477 + ], + "score": 1.0, + "content": "18:", + "type": "text" + }, + { + "bbox": [ + 167, + 464, + 505, + 477 + ], + "score": 1.0, + "content": "// M-Step gradient: In practice there is no M-step in this case as policy and variatinal", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 123, + 475, + 264, + 488 + ], + "spans": [ + { + "bbox": [ + 123, + 475, + 171, + 488 + ], + "score": 1.0, + "content": "distribution", + "type": "text" + }, + { + "bbox": [ + 172, + 478, + 178, + 487 + ], + "score": 0.75, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 475, + 264, + 488 + ], + "score": 1.0, + "content": "use a same structure.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 486, + 291, + 499 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 123, + 499 + ], + "score": 1.0, + "content": "19:", + "type": "text" + }, + { + "bbox": [ + 167, + 487, + 291, + 498 + ], + "score": 1.0, + "content": "send gradients to chief worker", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 497, + 302, + 510 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 122, + 509 + ], + "score": 1.0, + "content": "20:", + "type": "text" + }, + { + "bbox": [ + 167, + 497, + 302, + 510 + ], + "score": 1.0, + "content": "wait for gradient update by chief", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 506, + 312, + 523 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 122, + 520 + ], + "score": 1.0, + "content": "21:", + "type": "text" + }, + { + "bbox": [ + 167, + 506, + 255, + 523 + ], + "score": 1.0, + "content": "fetch new parameters", + "type": "text" + }, + { + "bbox": [ + 256, + 509, + 312, + 521 + ], + "score": 0.91, + "content": "\\phi , \\theta , \\eta , \\eta _ { \\mu } , \\eta _ { \\Sigma }", + "type": "inline_equation" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 518, + 267, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 122, + 531 + ], + "score": 1.0, + "content": "22:", + "type": "text" + }, + { + "bbox": [ + 151, + 518, + 267, + 556 + ], + "score": 0.85, + "content": "\\begin{array} { r } { k = k + 1 ^ { \\mathbf { \\complement } } } \\\\ { i = i + 1 , L _ { \\mathrm { c u r r } } = L _ { \\mathrm { c u r r } } + L } \\\\ { \\pmb { \\theta } _ { i } = \\pmb { \\theta } , \\phi ^ { \\prime } = \\phi } \\end{array}", + "type": "inline_equation", + "image_path": "3c9f26eb59da1807a518de932e9c7e4425bc4623f215bc90bce1357701b1aca8.jpg" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 531, + 122, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 122, + 543 + ], + "score": 1.0, + "content": "23:", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 542, + 122, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 122, + 554 + ], + "score": 1.0, + "content": "24:", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 13.5 + } + ], + "page_idx": 21, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 313, + 765 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 313, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 15 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 106, + 254, + 366, + 266 + ], + "lines": [ + { + "bbox": [ + 106, + 253, + 366, + 268 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 366, + 268 + ], + "score": 1.0, + "content": "Algorithm 3 MPO (worker) - parametric variational distribution", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "index", + "bbox": [ + 106, + 270, + 506, + 558 + ], + "lines": [ + { + "bbox": [ + 110, + 266, + 207, + 281 + ], + "spans": [ + { + "bbox": [ + 110, + 266, + 207, + 281 + ], + "score": 1.0, + "content": "1: Input = \u000fΣ, \u000fµ, Lmax", + "type": "text" + } + ], + "index": 1, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 278, + 191, + 291 + ], + "spans": [ + { + "bbox": [ + 110, + 278, + 123, + 291 + ], + "score": 1.0, + "content": "2:", + "type": "text" + }, + { + "bbox": [ + 123, + 279, + 146, + 289 + ], + "score": 0.36, + "content": "i = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 278, + 191, + 291 + ], + "score": 1.0, + "content": ", Lcurr = 0", + "type": "text" + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 109, + 287, + 286, + 303 + ], + "spans": [ + { + "bbox": [ + 109, + 287, + 160, + 303 + ], + "score": 1.0, + "content": "3: Initialise", + "type": "text" + }, + { + "bbox": [ + 160, + 289, + 286, + 302 + ], + "score": 0.4, + "content": "Q _ { \\omega _ { i } } ( a , s ) , \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\eta , \\eta _ { \\mu } , \\eta _ { \\Sigma }", + "type": "inline_equation" + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 299, + 204, + 312 + ], + "spans": [ + { + "bbox": [ + 110, + 299, + 204, + 312 + ], + "score": 1.0, + "content": "4: for each worker do", + "type": "text" + } + ], + "index": 4, + "is_list_start_line": true + }, + { + "bbox": [ + 109, + 311, + 231, + 324 + ], + "spans": [ + { + "bbox": [ + 109, + 311, + 123, + 324 + ], + "score": 1.0, + "content": "5:", + "type": "text" + }, + { + "bbox": [ + 137, + 311, + 163, + 324 + ], + "score": 1.0, + "content": "while", + "type": "text" + }, + { + "bbox": [ + 164, + 312, + 216, + 323 + ], + "score": 0.87, + "content": "L _ { \\mathrm { c u r r } } < L _ { \\mathrm { m a x } }", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 311, + 231, + 324 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 321, + 411, + 334 + ], + "spans": [ + { + "bbox": [ + 110, + 322, + 122, + 334 + ], + "score": 1.0, + "content": "6:", + "type": "text" + }, + { + "bbox": [ + 152, + 321, + 236, + 334 + ], + "score": 1.0, + "content": "update replay buffer", + "type": "text" + }, + { + "bbox": [ + 236, + 323, + 244, + 332 + ], + "score": 0.8, + "content": "\\boldsymbol { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 321, + 265, + 334 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 265, + 323, + 273, + 332 + ], + "score": 0.43, + "content": "\\mathrm { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 321, + 411, + 334 + ], + "score": 1.0, + "content": "trajectories from the environment", + "type": "text" + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 333, + 179, + 345 + ], + "spans": [ + { + "bbox": [ + 110, + 333, + 122, + 345 + ], + "score": 1.0, + "content": "7:", + "type": "text" + }, + { + "bbox": [ + 153, + 333, + 179, + 344 + ], + "score": 0.54, + "content": "k = 0", + "type": "inline_equation", + "image_path": "d2d609a59c7e6a80c3fcfb4b8d070099e24d4ecf350a3b8e307875d5f5d07c27.jpg" + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 344, + 315, + 356 + ], + "spans": [ + { + "bbox": [ + 110, + 344, + 122, + 356 + ], + "score": 1.0, + "content": "8:", + "type": "text" + }, + { + "bbox": [ + 152, + 344, + 315, + 356 + ], + "score": 1.0, + "content": "// Find better policy by gradient descent", + "type": "text" + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 355, + 233, + 367 + ], + "spans": [ + { + "bbox": [ + 110, + 355, + 122, + 367 + ], + "score": 1.0, + "content": "9:", + "type": "text" + }, + { + "bbox": [ + 153, + 355, + 178, + 366 + ], + "score": 1.0, + "content": "while", + "type": "text" + }, + { + "bbox": [ + 178, + 355, + 219, + 366 + ], + "score": 0.85, + "content": "k < 1 0 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 355, + 233, + 366 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 365, + 388, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 366, + 122, + 379 + ], + "score": 1.0, + "content": "10:", + "type": "text" + }, + { + "bbox": [ + 167, + 365, + 251, + 379 + ], + "score": 1.0, + "content": "sample a mini-batch", + "type": "text" + }, + { + "bbox": [ + 252, + 367, + 260, + 376 + ], + "score": 0.82, + "content": "\\boldsymbol { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 365, + 271, + 379 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 275, + 367, + 316, + 378 + ], + "score": 0.55, + "content": "\\mathrm { ~ V ~ } ( s , a , r )", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 365, + 388, + 379 + ], + "score": 1.0, + "content": "pairs from replay", + "type": "text" + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 376, + 505, + 389 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 122, + 389 + ], + "score": 1.0, + "content": "11:", + "type": "text" + }, + { + "bbox": [ + 167, + 376, + 199, + 389 + ], + "score": 1.0, + "content": "sample", + "type": "text" + }, + { + "bbox": [ + 200, + 378, + 212, + 387 + ], + "score": 0.77, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 376, + 367, + 389 + ], + "score": 1.0, + "content": "additional actions for each state from", + "type": "text" + }, + { + "bbox": [ + 368, + 378, + 376, + 387 + ], + "score": 0.7, + "content": "\\boldsymbol { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 376, + 380, + 389 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 380, + 377, + 423, + 389 + ], + "score": 0.92, + "content": "\\dot { \\pi } ( a | s , \\theta _ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 376, + 505, + 389 + ], + "score": 1.0, + "content": "for estimating inte-", + "type": "text" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 120, + 387, + 148, + 401 + ], + "spans": [ + { + "bbox": [ + 120, + 387, + 148, + 401 + ], + "score": 1.0, + "content": "grals", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 105, + 398, + 385, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 123, + 412 + ], + "score": 1.0, + "content": "12:", + "type": "text" + }, + { + "bbox": [ + 167, + 398, + 385, + 411 + ], + "score": 1.0, + "content": "compute gradients, estimating integrals using samples", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 409, + 261, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 122, + 422 + ], + "score": 1.0, + "content": "13:", + "type": "text" + }, + { + "bbox": [ + 167, + 409, + 261, + 423 + ], + "score": 1.0, + "content": "// Q-function gradient:", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 421, + 229, + 434 + ], + "spans": [ + { + "bbox": [ + 106, + 421, + 122, + 433 + ], + "score": 1.0, + "content": "14:", + "type": "text" + }, + { + "bbox": [ + 168, + 421, + 229, + 434 + ], + "score": 0.84, + "content": "\\delta _ { \\phi } = \\partial _ { \\phi } L _ { \\phi } ^ { \\prime } ( \\phi )", + "type": "inline_equation" + } + ], + "index": 15, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 430, + 245, + 446 + ], + "spans": [ + { + "bbox": [ + 106, + 432, + 122, + 444 + ], + "score": 1.0, + "content": "15:", + "type": "text" + }, + { + "bbox": [ + 166, + 430, + 245, + 446 + ], + "score": 1.0, + "content": "// E-Step gradient:", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 442, + 310, + 468 + ], + "spans": [ + { + "bbox": [ + 106, + 443, + 122, + 455 + ], + "score": 1.0, + "content": "16:", + "type": "text" + }, + { + "bbox": [ + 168, + 442, + 310, + 468 + ], + "score": 0.39, + "content": "\\begin{array} { r l } & { \\bigl [ \\delta _ { \\eta _ { \\mu } } , \\delta _ { \\eta _ { \\Sigma } } \\bigr ] ^ { \\circ } = \\alpha \\partial _ { \\eta _ { \\mu } , \\eta _ { \\Sigma } } L ( \\pmb \\theta _ { k } , \\eta _ { \\mu } , \\eta _ { \\Sigma } ) } \\\\ & { \\delta _ { \\theta } = \\partial _ { \\theta } L ( \\pmb \\theta , \\eta _ { \\mu _ { k + 1 } } , \\eta _ { \\Sigma k + 1 , \\eta } , } \\\\ & { \\dots , \\dots } \\end{array}", + "type": "inline_equation", + "image_path": "1180ddf38bef6422e4afff17e1457f9c31d841b654b4372c5a7524524e2344b6.jpg" + } + ], + "index": 18, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 453, + 122, + 466 + ], + "spans": [ + { + "bbox": [ + 106, + 453, + 122, + 466 + ], + "score": 1.0, + "content": "17:", + "type": "text" + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 464, + 505, + 477 + ], + "spans": [ + { + "bbox": [ + 106, + 465, + 122, + 477 + ], + "score": 1.0, + "content": "18:", + "type": "text" + }, + { + "bbox": [ + 167, + 464, + 505, + 477 + ], + "score": 1.0, + "content": "// M-Step gradient: In practice there is no M-step in this case as policy and variatinal", + "type": "text" + } + ], + "index": 19, + "is_list_start_line": true + }, + { + "bbox": [ + 123, + 475, + 264, + 488 + ], + "spans": [ + { + "bbox": [ + 123, + 475, + 171, + 488 + ], + "score": 1.0, + "content": "distribution", + "type": "text" + }, + { + "bbox": [ + 172, + 478, + 178, + 487 + ], + "score": 0.75, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 475, + 264, + 488 + ], + "score": 1.0, + "content": "use a same structure.", + "type": "text" + } + ], + "index": 20, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 486, + 291, + 499 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 123, + 499 + ], + "score": 1.0, + "content": "19:", + "type": "text" + }, + { + "bbox": [ + 167, + 487, + 291, + 498 + ], + "score": 1.0, + "content": "send gradients to chief worker", + "type": "text" + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 497, + 302, + 510 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 122, + 509 + ], + "score": 1.0, + "content": "20:", + "type": "text" + }, + { + "bbox": [ + 167, + 497, + 302, + 510 + ], + "score": 1.0, + "content": "wait for gradient update by chief", + "type": "text" + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 105, + 506, + 312, + 523 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 122, + 520 + ], + "score": 1.0, + "content": "21:", + "type": "text" + }, + { + "bbox": [ + 167, + 506, + 255, + 523 + ], + "score": 1.0, + "content": "fetch new parameters", + "type": "text" + }, + { + "bbox": [ + 256, + 509, + 312, + 521 + ], + "score": 0.91, + "content": "\\phi , \\theta , \\eta , \\eta _ { \\mu } , \\eta _ { \\Sigma }", + "type": "inline_equation" + } + ], + "index": 23, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 518, + 267, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 122, + 531 + ], + "score": 1.0, + "content": "22:", + "type": "text" + }, + { + "bbox": [ + 151, + 518, + 267, + 556 + ], + "score": 0.85, + "content": "\\begin{array} { r } { k = k + 1 ^ { \\mathbf { \\complement } } } \\\\ { i = i + 1 , L _ { \\mathrm { c u r r } } = L _ { \\mathrm { c u r r } } + L } \\\\ { \\pmb { \\theta } _ { i } = \\pmb { \\theta } , \\phi ^ { \\prime } = \\phi } \\end{array}", + "type": "inline_equation", + "image_path": "3c9f26eb59da1807a518de932e9c7e4425bc4623f215bc90bce1357701b1aca8.jpg" + } + ], + "index": 25, + "is_list_start_line": true + }, + { + "bbox": [ + 105, + 531, + 122, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 122, + 543 + ], + "score": 1.0, + "content": "23:", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 105, + 542, + 122, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 122, + 554 + ], + "score": 1.0, + "content": "24:", + "type": "text" + } + ], + "index": 26, + "is_list_start_line": true + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 266, + 505, + 556 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/S1ANxQW0b/S1ANxQW0b_model.json b/parse/train/S1ANxQW0b/S1ANxQW0b_model.json new file mode 100644 index 0000000000000000000000000000000000000000..69e48c1ac3e078596b165e1fc64c45b8bc4fd026 --- /dev/null +++ b/parse/train/S1ANxQW0b/S1ANxQW0b_model.json @@ -0,0 +1,30136 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1573, + 1402, + 1573, + 1402, + 1788, + 298, + 1788 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 398, + 595, + 1302, + 595, + 1302, + 841, + 398, + 841 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 1344, + 1403, + 1344, + 1403, + 1558, + 299, + 1558 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1114, + 1404, + 1114, + 1404, + 1328, + 298, + 1328 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 976, + 1403, + 976, + 1403, + 1098, + 299, + 1098 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 300, + 1911, + 1401, + 1911, + 1401, + 2033, + 300, + 2033 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 299, + 1803, + 1402, + 1803, + 1402, + 1896, + 299, + 1896 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 315, + 319, + 1433, + 319, + 1433, + 444, + 315, + 444 + ], + "score": 0.957 + }, + { + "category_id": 0, + "poly": [ + 298, + 219, + 1310, + 219, + 1310, + 269, + 298, + 269 + ], + "score": 0.931 + }, + { + "category_id": 0, + "poly": [ + 302, + 903, + 573, + 903, + 573, + 939, + 302, + 939 + ], + "score": 0.9 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.878 + }, + { + "category_id": 0, + "poly": [ + 773, + 524, + 927, + 524, + 927, + 558, + 773, + 558 + ], + "score": 0.872 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 857, + 2088, + 857, + 2112, + 842, + 2112 + ], + "score": 0.626 + }, + { + "category_id": 15, + "poly": [ + 293.0, + 215.0, + 1318.0, + 215.0, + 1318.0, + 277.0, + 293.0, + 277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 900.0, + 579.0, + 900.0, + 579.0, + 948.0, + 294.0, + 948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 523.0, + 932.0, + 523.0, + 932.0, + 561.0, + 770.0, + 561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 841.0, + 2088.0, + 858.0, + 2088.0, + 858.0, + 2116.0, + 841.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1573.0, + 1406.0, + 1573.0, + 1406.0, + 1608.0, + 294.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1604.0, + 1404.0, + 1604.0, + 1404.0, + 1639.0, + 294.0, + 1639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1632.0, + 1406.0, + 1632.0, + 1406.0, + 1669.0, + 293.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1666.0, + 1406.0, + 1666.0, + 1406.0, + 1699.0, + 293.0, + 1699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1693.0, + 1407.0, + 1693.0, + 1407.0, + 1732.0, + 292.0, + 1732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1725.0, + 1404.0, + 1725.0, + 1404.0, + 1762.0, + 293.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1757.0, + 1063.0, + 1757.0, + 1063.0, + 1791.0, + 294.0, + 1791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 596.0, + 1305.0, + 596.0, + 1305.0, + 632.0, + 396.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 625.0, + 1307.0, + 625.0, + 1307.0, + 662.0, + 391.0, + 662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 657.0, + 1306.0, + 657.0, + 1306.0, + 691.0, + 393.0, + 691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 689.0, + 1307.0, + 689.0, + 1307.0, + 722.0, + 394.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 718.0, + 1306.0, + 718.0, + 1306.0, + 754.0, + 392.0, + 754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 750.0, + 1305.0, + 750.0, + 1305.0, + 782.0, + 393.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 780.0, + 1306.0, + 780.0, + 1306.0, + 816.0, + 393.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 810.0, + 587.0, + 810.0, + 587.0, + 847.0, + 393.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1343.0, + 1404.0, + 1343.0, + 1404.0, + 1381.0, + 295.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1375.0, + 1403.0, + 1375.0, + 1403.0, + 1409.0, + 297.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1404.0, + 1404.0, + 1404.0, + 1404.0, + 1442.0, + 294.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1436.0, + 1404.0, + 1436.0, + 1404.0, + 1471.0, + 294.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1466.0, + 1404.0, + 1466.0, + 1404.0, + 1504.0, + 294.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1496.0, + 1407.0, + 1496.0, + 1407.0, + 1533.0, + 293.0, + 1533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1527.0, + 991.0, + 1527.0, + 991.0, + 1565.0, + 294.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1114.0, + 1402.0, + 1114.0, + 1402.0, + 1149.0, + 296.0, + 1149.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1144.0, + 1405.0, + 1144.0, + 1405.0, + 1182.0, + 292.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1174.0, + 1405.0, + 1174.0, + 1405.0, + 1211.0, + 293.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1206.0, + 1406.0, + 1206.0, + 1406.0, + 1241.0, + 294.0, + 1241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1234.0, + 1404.0, + 1234.0, + 1404.0, + 1271.0, + 293.0, + 1271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1268.0, + 1405.0, + 1268.0, + 1405.0, + 1302.0, + 294.0, + 1302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1300.0, + 983.0, + 1300.0, + 983.0, + 1330.0, + 297.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 975.0, + 1405.0, + 975.0, + 1405.0, + 1013.0, + 293.0, + 1013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1005.0, + 1404.0, + 1005.0, + 1404.0, + 1042.0, + 293.0, + 1042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1033.0, + 1407.0, + 1033.0, + 1407.0, + 1076.0, + 292.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1067.0, + 1261.0, + 1067.0, + 1261.0, + 1104.0, + 293.0, + 1104.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1908.0, + 1406.0, + 1908.0, + 1406.0, + 1948.0, + 293.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1943.0, + 1405.0, + 1943.0, + 1405.0, + 1975.0, + 295.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1974.0, + 1405.0, + 1974.0, + 1405.0, + 2007.0, + 295.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2001.0, + 1405.0, + 2001.0, + 1405.0, + 2038.0, + 295.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1801.0, + 1403.0, + 1801.0, + 1403.0, + 1837.0, + 293.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1831.0, + 1403.0, + 1831.0, + 1403.0, + 1871.0, + 293.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1865.0, + 1155.0, + 1865.0, + 1155.0, + 1899.0, + 295.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 316.0, + 1195.0, + 316.0, + 1195.0, + 358.0, + 310.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 347.0, + 714.0, + 347.0, + 714.0, + 385.0, + 310.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 383.0, + 595.0, + 383.0, + 595.0, + 415.0, + 312.0, + 415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 412.0, + 1435.0, + 412.0, + 1435.0, + 448.0, + 314.0, + 448.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 933, + 1404, + 933, + 1404, + 1421, + 297, + 1421 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1437, + 1402, + 1437, + 1402, + 1650, + 298, + 1650 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1667, + 1403, + 1667, + 1403, + 1972, + 298, + 1972 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1402, + 229, + 1402, + 413, + 299, + 413 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 430, + 1403, + 430, + 1403, + 583, + 299, + 583 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 764, + 1403, + 764, + 1403, + 917, + 299, + 917 + ], + "score": 0.974 + }, + { + "category_id": 2, + "poly": [ + 331, + 2005, + 1068, + 2005, + 1068, + 2034, + 331, + 2034 + ], + "score": 0.919 + }, + { + "category_id": 0, + "poly": [ + 300, + 704, + 564, + 704, + 564, + 736, + 300, + 736 + ], + "score": 0.898 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.887 + }, + { + "category_id": 0, + "poly": [ + 303, + 632, + 784, + 632, + 784, + 667, + 303, + 667 + ], + "score": 0.865 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2112, + 841, + 2112 + ], + "score": 0.741 + }, + { + "category_id": 13, + "poly": [ + 1300, + 1237, + 1340, + 1237, + 1340, + 1267, + 1300, + 1267 + ], + "score": 0.82, + "latex": "\\mathrm { P \\bar { I } ^ { 2 } }" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 1999.0, + 1071.0, + 1999.0, + 1071.0, + 2039.0, + 331.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 701.0, + 570.0, + 701.0, + 570.0, + 741.0, + 293.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 628.0, + 790.0, + 628.0, + 790.0, + 674.0, + 292.0, + 674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2121.0, + 839.0, + 2121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 932.0, + 1405.0, + 932.0, + 1405.0, + 970.0, + 294.0, + 970.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 965.0, + 1405.0, + 965.0, + 1405.0, + 999.0, + 294.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 997.0, + 1404.0, + 997.0, + 1404.0, + 1028.0, + 296.0, + 1028.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1025.0, + 1405.0, + 1025.0, + 1405.0, + 1059.0, + 295.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1056.0, + 1406.0, + 1056.0, + 1406.0, + 1090.0, + 295.0, + 1090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1084.0, + 1406.0, + 1084.0, + 1406.0, + 1119.0, + 294.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1113.0, + 1406.0, + 1113.0, + 1406.0, + 1154.0, + 291.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1145.0, + 1406.0, + 1145.0, + 1406.0, + 1181.0, + 294.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1179.0, + 1405.0, + 1179.0, + 1405.0, + 1210.0, + 295.0, + 1210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1205.0, + 1406.0, + 1205.0, + 1406.0, + 1244.0, + 292.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1238.0, + 1299.0, + 1238.0, + 1299.0, + 1271.0, + 293.0, + 1271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1341.0, + 1238.0, + 1404.0, + 1238.0, + 1404.0, + 1271.0, + 1341.0, + 1271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1264.0, + 1408.0, + 1264.0, + 1408.0, + 1307.0, + 291.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1297.0, + 1406.0, + 1297.0, + 1406.0, + 1334.0, + 294.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1329.0, + 1406.0, + 1329.0, + 1406.0, + 1363.0, + 294.0, + 1363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1360.0, + 1406.0, + 1360.0, + 1406.0, + 1393.0, + 294.0, + 1393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1391.0, + 1316.0, + 1391.0, + 1316.0, + 1426.0, + 295.0, + 1426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1436.0, + 1407.0, + 1436.0, + 1407.0, + 1474.0, + 293.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1466.0, + 1407.0, + 1466.0, + 1407.0, + 1504.0, + 294.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1497.0, + 1406.0, + 1497.0, + 1406.0, + 1534.0, + 293.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1529.0, + 1406.0, + 1529.0, + 1406.0, + 1564.0, + 291.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1558.0, + 1406.0, + 1558.0, + 1406.0, + 1595.0, + 293.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1589.0, + 1407.0, + 1589.0, + 1407.0, + 1627.0, + 292.0, + 1627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1618.0, + 1383.0, + 1618.0, + 1383.0, + 1655.0, + 293.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1661.0, + 1407.0, + 1661.0, + 1407.0, + 1706.0, + 291.0, + 1706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1698.0, + 1405.0, + 1698.0, + 1405.0, + 1733.0, + 293.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1726.0, + 1404.0, + 1726.0, + 1404.0, + 1766.0, + 291.0, + 1766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1756.0, + 1406.0, + 1756.0, + 1406.0, + 1794.0, + 291.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1787.0, + 1407.0, + 1787.0, + 1407.0, + 1826.0, + 292.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1819.0, + 1407.0, + 1819.0, + 1407.0, + 1855.0, + 293.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1850.0, + 1405.0, + 1850.0, + 1405.0, + 1884.0, + 292.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1879.0, + 1404.0, + 1879.0, + 1404.0, + 1916.0, + 293.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1911.0, + 1404.0, + 1911.0, + 1404.0, + 1946.0, + 294.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1940.0, + 670.0, + 1940.0, + 670.0, + 1979.0, + 293.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 230.0, + 1406.0, + 230.0, + 1406.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 261.0, + 1406.0, + 261.0, + 1406.0, + 297.0, + 295.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 289.0, + 1404.0, + 289.0, + 1404.0, + 327.0, + 294.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 320.0, + 1404.0, + 320.0, + 1404.0, + 358.0, + 294.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 351.0, + 1407.0, + 351.0, + 1407.0, + 388.0, + 293.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 384.0, + 698.0, + 384.0, + 698.0, + 416.0, + 297.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 430.0, + 1404.0, + 430.0, + 1404.0, + 463.0, + 297.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 460.0, + 1403.0, + 460.0, + 1403.0, + 493.0, + 295.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 488.0, + 1404.0, + 488.0, + 1404.0, + 529.0, + 293.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 522.0, + 1404.0, + 522.0, + 1404.0, + 555.0, + 295.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 550.0, + 926.0, + 550.0, + 926.0, + 588.0, + 294.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 765.0, + 1404.0, + 765.0, + 1404.0, + 798.0, + 297.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 796.0, + 1404.0, + 796.0, + 1404.0, + 829.0, + 295.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 823.0, + 1404.0, + 823.0, + 1404.0, + 860.0, + 293.0, + 860.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 854.0, + 1405.0, + 854.0, + 1405.0, + 892.0, + 293.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 885.0, + 635.0, + 885.0, + 635.0, + 922.0, + 295.0, + 922.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 914, + 1403, + 914, + 1403, + 1099, + 297, + 1099 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1680, + 1403, + 1680, + 1403, + 1897, + 298, + 1897 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 445, + 1404, + 445, + 1404, + 664, + 297, + 664 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1114, + 1404, + 1114, + 1404, + 1300, + 298, + 1300 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 299, + 1512, + 1403, + 1512, + 1403, + 1666, + 299, + 1666 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 677, + 1404, + 677, + 1404, + 804, + 298, + 804 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1402, + 229, + 1402, + 354, + 299, + 354 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1911, + 1402, + 1911, + 1402, + 2034, + 299, + 2034 + ], + "score": 0.974 + }, + { + "category_id": 0, + "poly": [ + 299, + 845, + 1054, + 845, + 1054, + 882, + 299, + 882 + ], + "score": 0.922 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 104, + 300, + 104 + ], + "score": 0.9 + }, + { + "category_id": 0, + "poly": [ + 302, + 390, + 740, + 390, + 740, + 421, + 302, + 421 + ], + "score": 0.889 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1442, + 1400, + 1442, + 1400, + 1471, + 1366, + 1471 + ], + "score": 0.873 + }, + { + "category_id": 9, + "poly": [ + 1367, + 1373, + 1400, + 1373, + 1400, + 1402, + 1367, + 1402 + ], + "score": 0.837 + }, + { + "category_id": 8, + "poly": [ + 323, + 1353, + 1330, + 1353, + 1330, + 1423, + 323, + 1423 + ], + "score": 0.823 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.613 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.479 + }, + { + "category_id": 8, + "poly": [ + 489, + 1426, + 1066, + 1426, + 1066, + 1497, + 489, + 1497 + ], + "score": 0.425 + }, + { + "category_id": 8, + "poly": [ + 331, + 1352, + 1330, + 1352, + 1330, + 1498, + 331, + 1498 + ], + "score": 0.369 + }, + { + "category_id": 13, + "poly": [ + 749, + 569, + 854, + 569, + 854, + 603, + 749, + 603 + ], + "score": 0.96, + "latex": "\\pi ( a | s , \\theta )" + }, + { + "category_id": 14, + "poly": [ + 330, + 1350, + 1336, + 1350, + 1336, + 1503, + 330, + 1503 + ], + "score": 0.94, + "latex": "\\begin{array} { l } { \\displaystyle \\log p _ { \\pi } ( O = 1 ) = \\log \\int p _ { \\pi } ( \\tau ) p ( O = 1 | \\tau ) d \\tau \\geq \\int q ( \\tau ) \\big [ \\log p ( O = 1 | \\tau ) + \\log \\frac { p _ { \\pi } ( \\tau ) } { q ( \\tau ) } \\big ] d \\tau } \\\\ { \\displaystyle \\qquad = \\mathbb { E } _ { q } \\Big [ \\sum _ { t } r _ { t } / \\alpha \\Big ] - \\mathrm { K L } \\Big ( q ( \\tau ) | | p _ { \\pi } ( \\tau ) \\Big ) = \\mathcal { I } ( q , \\pi ) , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1103, + 539, + 1240, + 539, + 1240, + 571, + 1103, + 571 + ], + "score": 0.93, + "latex": "r ( s , a ) \\in \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 924, + 1513, + 1000, + 1513, + 1000, + 1547, + 924, + 1547 + ], + "score": 0.92, + "latex": "\\pi ( a | s )" + }, + { + "category_id": 13, + "poly": [ + 748, + 631, + 817, + 631, + 817, + 664, + 748, + 664 + ], + "score": 0.92, + "latex": "\\mu _ { \\pi } ( s )" + }, + { + "category_id": 13, + "poly": [ + 502, + 570, + 612, + 570, + 612, + 603, + 502, + 603 + ], + "score": 0.92, + "latex": "\\gamma \\in [ 0 , 1 )" + }, + { + "category_id": 13, + "poly": [ + 548, + 773, + 704, + 773, + 704, + 805, + 548, + 805 + ], + "score": 0.92, + "latex": "r _ { t } = r ( s _ { t } , a _ { t } )" + }, + { + "category_id": 13, + "poly": [ + 920, + 1145, + 1244, + 1145, + 1244, + 1179, + 920, + 1179 + ], + "score": 0.91, + "latex": "p ( O = 1 | \\tau ) \\propto \\mathrm { e x p } ( \\Sigma _ { t } r _ { t } / \\alpha )" + }, + { + "category_id": 13, + "poly": [ + 1088, + 738, + 1338, + 738, + 1338, + 774, + 1088, + 774 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\mathbb { E } _ { \\tau _ { \\pi } } [ \\sum _ { t = 0 } ^ { \\infty } \\gamma ^ { t } r ( s _ { t } , s _ { t } ) ] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1348, + 1514, + 1400, + 1514, + 1400, + 1547, + 1348, + 1547 + ], + "score": 0.9, + "latex": "q ( \\tau )" + }, + { + "category_id": 13, + "poly": [ + 1183, + 707, + 1338, + 707, + 1338, + 739, + 1183, + 739 + ], + "score": 0.89, + "latex": "\\begin{array} { r } { \\tau _ { \\pi } ~ \\sim ~ p _ { \\pi } ( \\tau ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 297, + 740, + 797, + 740, + 797, + 774, + 297, + 774 + ], + "score": 0.89, + "latex": "\\begin{array} { r } { p _ { \\pi } ( \\tau ) = p ( s _ { 0 } ) \\prod _ { t > 0 } p ( s _ { t + 1 } \\vert s _ { t } , a _ { t } ) \\pi ( a _ { t } \\vert s _ { t } ) ; } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 628, + 544, + 682, + 544, + 682, + 571, + 628, + 571 + ], + "score": 0.89, + "latex": "s _ { t + 1 }" + }, + { + "category_id": 13, + "poly": [ + 353, + 707, + 693, + 707, + 693, + 740, + 353, + 740 + ], + "score": 0.88, + "latex": "\\overline { { \\tau } } _ { \\pi } ~ = ~ \\{ ( s _ { 0 } , a _ { 0 } ) \\} \\ldots ( s _ { T } , a _ { T } ) \\}" + }, + { + "category_id": 13, + "poly": [ + 898, + 508, + 1058, + 508, + 1058, + 542, + 898, + 542 + ], + "score": 0.87, + "latex": "p ( s _ { t + 1 } | s _ { t } , a _ { t } )" + }, + { + "category_id": 13, + "poly": [ + 834, + 544, + 885, + 544, + 885, + 570, + 834, + 570 + ], + "score": 0.86, + "latex": "a _ { t } \\textrm { -- }" + }, + { + "category_id": 13, + "poly": [ + 371, + 1518, + 403, + 1518, + 403, + 1546, + 371, + 1546 + ], + "score": 0.86, + "latex": "p _ { \\pi }" + }, + { + "category_id": 13, + "poly": [ + 567, + 544, + 593, + 544, + 593, + 570, + 567, + 570 + ], + "score": 0.85, + "latex": "s _ { t }" + }, + { + "category_id": 13, + "poly": [ + 376, + 1575, + 403, + 1575, + 403, + 1604, + 376, + 1604 + ], + "score": 0.84, + "latex": "\\mathcal { I }" + }, + { + "category_id": 13, + "poly": [ + 720, + 1944, + 747, + 1944, + 747, + 1973, + 720, + 1973 + ], + "score": 0.83, + "latex": "\\mathcal { I }" + }, + { + "category_id": 13, + "poly": [ + 1067, + 1714, + 1094, + 1714, + 1094, + 1743, + 1067, + 1743 + ], + "score": 0.8, + "latex": "\\mathcal { I }" + }, + { + "category_id": 13, + "poly": [ + 1249, + 1610, + 1267, + 1610, + 1267, + 1636, + 1249, + 1636 + ], + "score": 0.79, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 1315, + 1744, + 1343, + 1744, + 1343, + 1773, + 1315, + 1773 + ], + "score": 0.79, + "latex": "\\mathcal { I }" + }, + { + "category_id": 13, + "poly": [ + 1332, + 1150, + 1354, + 1150, + 1354, + 1173, + 1332, + 1173 + ], + "score": 0.76, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 476, + 1778, + 496, + 1778, + 496, + 1802, + 476, + 1802 + ], + "score": 0.76, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 922, + 454, + 942, + 454, + 942, + 475, + 922, + 475 + ], + "score": 0.75, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 410, + 1778, + 428, + 1778, + 428, + 1805, + 410, + 1805 + ], + "score": 0.75, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 929, + 1948, + 945, + 1948, + 945, + 1974, + 929, + 1974 + ], + "score": 0.74, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 690, + 1177, + 715, + 1177, + 715, + 1204, + 690, + 1204 + ], + "score": 0.73, + "latex": "O" + }, + { + "category_id": 13, + "poly": [ + 610, + 516, + 627, + 516, + 627, + 536, + 610, + 536 + ], + "score": 0.72, + "latex": "a" + }, + { + "category_id": 13, + "poly": [ + 374, + 1274, + 393, + 1274, + 393, + 1295, + 374, + 1295 + ], + "score": 0.7, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 1090, + 713, + 1111, + 713, + 1111, + 736, + 1090, + 736 + ], + "score": 0.7, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 496, + 515, + 512, + 515, + 512, + 536, + 496, + 536 + ], + "score": 0.65, + "latex": "s" + }, + { + "category_id": 13, + "poly": [ + 1049, + 572, + 1069, + 572, + 1069, + 597, + 1049, + 597 + ], + "score": 0.58, + "latex": "\\pmb { \\theta }" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 842.0, + 1060.0, + 842.0, + 1060.0, + 888.0, + 291.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 817.0, + 72.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 387.0, + 745.0, + 387.0, + 745.0, + 426.0, + 295.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 860.0, + 2085.0, + 860.0, + 2116.0, + 839.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 916.0, + 1404.0, + 916.0, + 1404.0, + 948.0, + 297.0, + 948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 947.0, + 1403.0, + 947.0, + 1403.0, + 979.0, + 296.0, + 979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 976.0, + 1405.0, + 976.0, + 1405.0, + 1012.0, + 293.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1008.0, + 1404.0, + 1008.0, + 1404.0, + 1043.0, + 293.0, + 1043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1036.0, + 1405.0, + 1036.0, + 1405.0, + 1073.0, + 294.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1069.0, + 863.0, + 1069.0, + 863.0, + 1101.0, + 296.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1682.0, + 1405.0, + 1682.0, + 1405.0, + 1717.0, + 294.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1714.0, + 1066.0, + 1714.0, + 1066.0, + 1745.0, + 296.0, + 1745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1095.0, + 1714.0, + 1404.0, + 1714.0, + 1404.0, + 1745.0, + 1095.0, + 1745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1743.0, + 1314.0, + 1743.0, + 1314.0, + 1777.0, + 294.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1344.0, + 1743.0, + 1404.0, + 1743.0, + 1404.0, + 1777.0, + 1344.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1775.0, + 409.0, + 1775.0, + 409.0, + 1807.0, + 292.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 429.0, + 1775.0, + 475.0, + 1775.0, + 475.0, + 1807.0, + 429.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 1775.0, + 1405.0, + 1775.0, + 1405.0, + 1807.0, + 497.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1802.0, + 1404.0, + 1802.0, + 1404.0, + 1841.0, + 293.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1832.0, + 1407.0, + 1832.0, + 1407.0, + 1873.0, + 292.0, + 1873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1865.0, + 1335.0, + 1865.0, + 1335.0, + 1897.0, + 294.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 444.0, + 921.0, + 444.0, + 921.0, + 486.0, + 294.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 943.0, + 444.0, + 1405.0, + 444.0, + 1405.0, + 486.0, + 943.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 477.0, + 1404.0, + 477.0, + 1404.0, + 512.0, + 296.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 507.0, + 495.0, + 507.0, + 495.0, + 546.0, + 294.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 513.0, + 507.0, + 609.0, + 507.0, + 609.0, + 546.0, + 513.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 507.0, + 897.0, + 507.0, + 897.0, + 546.0, + 628.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 507.0, + 1407.0, + 507.0, + 1407.0, + 546.0, + 1059.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 537.0, + 566.0, + 537.0, + 566.0, + 576.0, + 292.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 537.0, + 627.0, + 537.0, + 627.0, + 576.0, + 594.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 537.0, + 833.0, + 537.0, + 833.0, + 576.0, + 683.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 537.0, + 1102.0, + 537.0, + 1102.0, + 576.0, + 886.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 537.0, + 1405.0, + 537.0, + 1405.0, + 576.0, + 1241.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 568.0, + 501.0, + 568.0, + 501.0, + 607.0, + 294.0, + 607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 613.0, + 568.0, + 748.0, + 568.0, + 748.0, + 607.0, + 613.0, + 607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 855.0, + 568.0, + 1048.0, + 568.0, + 1048.0, + 607.0, + 855.0, + 607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 568.0, + 1405.0, + 568.0, + 1405.0, + 607.0, + 1070.0, + 607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 598.0, + 1406.0, + 598.0, + 1406.0, + 637.0, + 294.0, + 637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 629.0, + 747.0, + 629.0, + 747.0, + 668.0, + 292.0, + 668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 629.0, + 830.0, + 629.0, + 830.0, + 668.0, + 818.0, + 668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1111.0, + 1405.0, + 1111.0, + 1405.0, + 1153.0, + 293.0, + 1153.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1142.0, + 919.0, + 1142.0, + 919.0, + 1181.0, + 291.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1245.0, + 1142.0, + 1331.0, + 1142.0, + 1331.0, + 1181.0, + 1245.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1355.0, + 1142.0, + 1409.0, + 1142.0, + 1409.0, + 1181.0, + 1355.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1178.0, + 689.0, + 1178.0, + 689.0, + 1210.0, + 294.0, + 1210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 1178.0, + 1405.0, + 1178.0, + 1405.0, + 1210.0, + 716.0, + 1210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1206.0, + 1404.0, + 1206.0, + 1404.0, + 1241.0, + 294.0, + 1241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1234.0, + 1405.0, + 1234.0, + 1405.0, + 1272.0, + 293.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1266.0, + 373.0, + 1266.0, + 373.0, + 1308.0, + 291.0, + 1308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1266.0, + 408.0, + 1266.0, + 408.0, + 1308.0, + 394.0, + 1308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1512.0, + 370.0, + 1512.0, + 370.0, + 1549.0, + 295.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1512.0, + 923.0, + 1512.0, + 923.0, + 1549.0, + 404.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1001.0, + 1512.0, + 1347.0, + 1512.0, + 1347.0, + 1549.0, + 1001.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1512.0, + 1404.0, + 1512.0, + 1404.0, + 1549.0, + 1401.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1544.0, + 1405.0, + 1544.0, + 1405.0, + 1577.0, + 294.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1570.0, + 375.0, + 1570.0, + 375.0, + 1609.0, + 293.0, + 1609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1570.0, + 1405.0, + 1570.0, + 1405.0, + 1609.0, + 404.0, + 1609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1601.0, + 1248.0, + 1601.0, + 1248.0, + 1643.0, + 294.0, + 1643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 1601.0, + 1405.0, + 1601.0, + 1405.0, + 1643.0, + 1268.0, + 1643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1634.0, + 624.0, + 1634.0, + 624.0, + 1670.0, + 293.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 673.0, + 1404.0, + 673.0, + 1404.0, + 712.0, + 293.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 704.0, + 296.0, + 704.0, + 296.0, + 785.0, + 283.0, + 785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 704.0, + 1087.0, + 704.0, + 1087.0, + 785.0, + 798.0, + 785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1339.0, + 704.0, + 1415.0, + 704.0, + 1415.0, + 785.0, + 1339.0, + 785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 769.0, + 547.0, + 769.0, + 547.0, + 806.0, + 293.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 705.0, + 769.0, + 714.0, + 769.0, + 714.0, + 806.0, + 705.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 231.0, + 1402.0, + 231.0, + 1402.0, + 263.0, + 295.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 259.0, + 1406.0, + 259.0, + 1406.0, + 297.0, + 293.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 293.0, + 1403.0, + 293.0, + 1403.0, + 325.0, + 295.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 320.0, + 1404.0, + 320.0, + 1404.0, + 357.0, + 293.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1910.0, + 1404.0, + 1910.0, + 1404.0, + 1946.0, + 294.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 719.0, + 1942.0, + 719.0, + 1978.0, + 294.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 748.0, + 1942.0, + 928.0, + 1942.0, + 928.0, + 1978.0, + 748.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 1942.0, + 1407.0, + 1942.0, + 1407.0, + 1978.0, + 946.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1974.0, + 1406.0, + 1974.0, + 1406.0, + 2006.0, + 293.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2003.0, + 1406.0, + 2003.0, + 1406.0, + 2036.0, + 293.0, + 2036.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1189, + 1405, + 1189, + 1405, + 1480, + 296, + 1480 + ], + "score": 0.985 + }, + { + "category_id": 1, + "poly": [ + 297, + 337, + 1404, + 337, + 1404, + 493, + 297, + 493 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 785, + 1404, + 785, + 1404, + 941, + 297, + 941 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 584, + 1403, + 584, + 1403, + 682, + 298, + 682 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1741, + 1407, + 1741, + 1407, + 1916, + 298, + 1916 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1402, + 229, + 1402, + 324, + 298, + 324 + ], + "score": 0.966 + }, + { + "category_id": 8, + "poly": [ + 494, + 1924, + 1210, + 1924, + 1210, + 2043, + 494, + 2043 + ], + "score": 0.963 + }, + { + "category_id": 8, + "poly": [ + 492, + 996, + 1206, + 996, + 1206, + 1104, + 492, + 1104 + ], + "score": 0.957 + }, + { + "category_id": 1, + "poly": [ + 296, + 1111, + 1401, + 1111, + 1401, + 1177, + 296, + 1177 + ], + "score": 0.956 + }, + { + "category_id": 8, + "poly": [ + 548, + 1643, + 1149, + 1643, + 1149, + 1735, + 548, + 1735 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 298, + 1569, + 1403, + 1569, + 1403, + 1635, + 298, + 1635 + ], + "score": 0.949 + }, + { + "category_id": 8, + "poly": [ + 469, + 693, + 1230, + 693, + 1230, + 776, + 469, + 776 + ], + "score": 0.948 + }, + { + "category_id": 1, + "poly": [ + 298, + 954, + 1077, + 954, + 1077, + 988, + 298, + 988 + ], + "score": 0.925 + }, + { + "category_id": 0, + "poly": [ + 299, + 528, + 644, + 528, + 644, + 560, + 299, + 560 + ], + "score": 0.917 + }, + { + "category_id": 0, + "poly": [ + 298, + 1513, + 458, + 1513, + 458, + 1545, + 298, + 1545 + ], + "score": 0.917 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 815, + 75, + 815, + 105, + 299, + 105 + ], + "score": 0.911 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1674, + 1400, + 1674, + 1400, + 1704, + 1366, + 1704 + ], + "score": 0.895 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1034, + 1400, + 1034, + 1400, + 1063, + 1366, + 1063 + ], + "score": 0.882 + }, + { + "category_id": 9, + "poly": [ + 1366, + 718, + 1400, + 718, + 1400, + 748, + 1366, + 748 + ], + "score": 0.873 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1969, + 1401, + 1969, + 1401, + 1998, + 1365, + 1998 + ], + "score": 0.868 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2112, + 840, + 2112 + ], + "score": 0.779 + }, + { + "category_id": 14, + "poly": [ + 491, + 994, + 1205, + 994, + 1205, + 1105, + 491, + 1105 + ], + "score": 0.94, + "latex": "Q _ { \\theta } ^ { q } ( s , a ) = r _ { 0 } + \\mathbb { E } _ { q ( \\tau ) , s _ { 0 } = s , a _ { 0 } = a } \\left[ \\sum _ { t \\geq 1 } ^ { \\infty } \\gamma ^ { t } \\big [ r _ { t } - \\alpha \\mathrm { K L } ( q _ { t } \\| \\pi _ { t } ) \\big ] \\right] ," + }, + { + "category_id": 13, + "poly": [ + 356, + 1111, + 809, + 1111, + 809, + 1150, + 356, + 1150 + ], + "score": 0.93, + "latex": "\\mathrm { K L } \\big ( q _ { t } | | \\pi _ { t } \\big ) = \\mathrm { K L } \\big ( q ( a | s _ { t } ) \\big ) \\| \\pi ( a | s _ { t } , \\pmb { \\theta } ) \\big )" + }, + { + "category_id": 13, + "poly": [ + 1041, + 1571, + 1131, + 1571, + 1131, + 1605, + 1041, + 1605 + ], + "score": 0.93, + "latex": "\\mathcal { I } ( \\boldsymbol { q } , \\boldsymbol { \\theta } )" + }, + { + "category_id": 13, + "poly": [ + 1077, + 1803, + 1186, + 1803, + 1186, + 1838, + 1077, + 1838 + ], + "score": 0.93, + "latex": "Q _ { \\theta _ { i } } ( s , a )" + }, + { + "category_id": 14, + "poly": [ + 548, + 1641, + 1149, + 1641, + 1149, + 1736, + 548, + 1736 + ], + "score": 0.93, + "latex": "Q _ { \\theta _ { i } } ^ { q } ( s , a ) = Q _ { \\theta _ { i } } ( s , a ) = \\mathbb { E } _ { \\tau _ { \\pi _ { i } } , s _ { 0 } = s , a _ { 0 } = a } \\left[ \\sum _ { t } ^ { \\infty } \\gamma ^ { t } r _ { t } \\right] ," + }, + { + "category_id": 13, + "poly": [ + 364, + 1742, + 536, + 1742, + 536, + 1776, + 364, + 1776 + ], + "score": 0.92, + "latex": "\\mathrm { K L } ( q | | \\pi _ { i } ) = 0" + }, + { + "category_id": 13, + "poly": [ + 945, + 1111, + 1076, + 1111, + 1076, + 1150, + 945, + 1150 + ], + "score": 0.92, + "latex": "\\mathrm { K L } \\big ( q _ { 0 } | | \\pi _ { 0 } \\big )" + }, + { + "category_id": 14, + "poly": [ + 471, + 690, + 1233, + 690, + 1233, + 779, + 471, + 779 + ], + "score": 0.92, + "latex": "\\mathcal { I } ( \\boldsymbol { q } , \\theta ) = \\mathbb { E } _ { \\boldsymbol { q } } \\Big [ \\sum _ { t = 0 } ^ { \\infty } \\gamma ^ { t } \\big [ r _ { t } - \\alpha \\mathbf { K L } \\big ( \\boldsymbol { q } ( \\boldsymbol { a } | s _ { t } ) \\| \\pi ( \\boldsymbol { a } | s _ { t } , \\theta ) \\big ) \\big ] \\Big ] + \\log p ( \\theta ) ." + }, + { + "category_id": 13, + "poly": [ + 661, + 1224, + 941, + 1224, + 941, + 1269, + 661, + 1269 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\tilde { r } _ { t } = r _ { t } - \\alpha \\log \\frac { q ( a _ { t } | s _ { t } ) } { \\pi ( a _ { t } | s _ { t } , \\pmb { \\theta } ) } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1133, + 1113, + 1185, + 1113, + 1185, + 1148, + 1133, + 1148 + ], + "score": 0.92, + "latex": "p ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 1220, + 848, + 1316, + 848, + 1316, + 881, + 1220, + 881 + ], + "score": 0.92, + "latex": "\\log p ( \\pmb \\theta )" + }, + { + "category_id": 13, + "poly": [ + 298, + 647, + 350, + 647, + 350, + 680, + 298, + 680 + ], + "score": 0.92, + "latex": "q ( \\tau )" + }, + { + "category_id": 13, + "poly": [ + 923, + 786, + 976, + 786, + 976, + 820, + 923, + 820 + ], + "score": 0.92, + "latex": "q ( \\tau )" + }, + { + "category_id": 13, + "poly": [ + 771, + 645, + 1237, + 645, + 1237, + 682, + 771, + 682 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { q ( \\tau ) = \\bar { p } ( s _ { 0 } ) \\prod _ { t > 0 } p ( s _ { t + 1 } | s _ { t } , a _ { t } ) q ( a _ { t } | s _ { t } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1041, + 1417, + 1096, + 1417, + 1096, + 1450, + 1041, + 1450 + ], + "score": 0.91, + "latex": "p ( \\pmb \\theta )" + }, + { + "category_id": 13, + "poly": [ + 823, + 1743, + 869, + 1743, + 869, + 1776, + 823, + 1776 + ], + "score": 0.91, + "latex": "Q _ { \\pmb { \\theta } _ { i } }" + }, + { + "category_id": 13, + "poly": [ + 372, + 1804, + 418, + 1804, + 418, + 1837, + 372, + 1837 + ], + "score": 0.91, + "latex": "Q _ { \\pmb { \\theta } _ { i } }" + }, + { + "category_id": 14, + "poly": [ + 492, + 1920, + 1209, + 1920, + 1209, + 2046, + 492, + 2046 + ], + "score": 0.9, + "latex": "\\begin{array} { l } { \\displaystyle \\mathop { \\operatorname* { m a x } } _ { \\boldsymbol { q } } \\bar { \\mathcal { T } } _ { s } ( \\boldsymbol { q } , \\theta _ { i } ) = \\mathop { \\operatorname* { m a x } } _ { \\boldsymbol { q } } T ^ { \\pi , { q } } Q _ { \\theta _ { i } } ( s , \\boldsymbol { a } ) } \\\\ { \\displaystyle \\mathop { \\quad = } \\mathop { \\operatorname* { m a x } } _ { \\boldsymbol { q } } \\mathbb { E } _ { \\boldsymbol { \\mu } ( s ) } \\Big [ \\mathbb { E } _ { \\boldsymbol { q } ( \\cdot \\vert s ) } [ Q _ { \\theta _ { i } } ( s , \\boldsymbol { a } ) ] - \\alpha \\mathbf { K } \\mathbf { L } ( \\boldsymbol { q } \\| \\pi _ { i } ) \\Big ] , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 599, + 1607, + 689, + 1607, + 689, + 1636, + 599, + 1636 + ], + "score": 0.9, + "latex": "q = \\pi _ { \\pmb { \\theta } _ { i } }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1603, + 373, + 1603, + 373, + 1633, + 298, + 1633 + ], + "score": 0.9, + "latex": "\\theta = \\theta _ { i }" + }, + { + "category_id": 13, + "poly": [ + 501, + 1835, + 1196, + 1835, + 1196, + 1889, + 501, + 1889 + ], + "score": 0.87, + "latex": "\\begin{array} { r } { T ^ { \\pi , q } = \\mathbb { E } _ { q ( a \\mid s ) } \\Big [ r ( s , a ) - \\alpha \\mathbf { K L } ( q \\| \\pi _ { i } ) + \\gamma \\mathbb { E } _ { p ( s ^ { \\prime } \\mid s , a ) } [ V _ { \\pmb { \\theta } _ { i } } ( s ^ { \\prime } ) ] \\Big ] . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 687, + 651, + 718, + 651, + 718, + 679, + 687, + 679 + ], + "score": 0.85, + "latex": "p _ { \\pi }" + }, + { + "category_id": 13, + "poly": [ + 539, + 1387, + 567, + 1387, + 567, + 1416, + 539, + 1416 + ], + "score": 0.84, + "latex": "\\mathcal { I }" + }, + { + "category_id": 13, + "poly": [ + 1107, + 1357, + 1134, + 1357, + 1134, + 1386, + 1107, + 1386 + ], + "score": 0.83, + "latex": "\\mathcal { I }" + }, + { + "category_id": 13, + "poly": [ + 735, + 1330, + 767, + 1330, + 767, + 1356, + 735, + 1356 + ], + "score": 0.83, + "latex": "\\pi _ { \\pmb { \\theta } }" + }, + { + "category_id": 13, + "poly": [ + 752, + 1805, + 777, + 1805, + 777, + 1833, + 752, + 1833 + ], + "score": 0.82, + "latex": "\\mathcal { I }" + }, + { + "category_id": 13, + "poly": [ + 621, + 1193, + 648, + 1193, + 648, + 1222, + 621, + 1222 + ], + "score": 0.81, + "latex": "\\mathcal { I }" + }, + { + "category_id": 13, + "poly": [ + 723, + 1301, + 741, + 1301, + 741, + 1326, + 723, + 1326 + ], + "score": 0.8, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 1374, + 1295, + 1401, + 1295, + 1401, + 1325, + 1374, + 1325 + ], + "score": 0.8, + "latex": "\\mathcal { I }" + }, + { + "category_id": 13, + "poly": [ + 668, + 1331, + 685, + 1331, + 685, + 1358, + 668, + 1358 + ], + "score": 0.79, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 1314, + 1578, + 1332, + 1578, + 1332, + 1604, + 1314, + 1604 + ], + "score": 0.79, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 1313, + 1361, + 1332, + 1361, + 1332, + 1388, + 1313, + 1388 + ], + "score": 0.79, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 847, + 1808, + 864, + 1808, + 864, + 1836, + 847, + 1836 + ], + "score": 0.79, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 469, + 1270, + 488, + 1270, + 488, + 1297, + 469, + 1297 + ], + "score": 0.77, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 834, + 1198, + 850, + 1198, + 850, + 1223, + 834, + 1223 + ], + "score": 0.77, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 1305, + 1270, + 1326, + 1270, + 1326, + 1292, + 1305, + 1292 + ], + "score": 0.74, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 1087, + 1235, + 1107, + 1235, + 1107, + 1256, + 1087, + 1256 + ], + "score": 0.73, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 586, + 1574, + 600, + 1574, + 600, + 1599, + 586, + 1599 + ], + "score": 0.71, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 742, + 1391, + 761, + 1391, + 761, + 1413, + 742, + 1413 + ], + "score": 0.71, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 1025, + 787, + 1067, + 787, + 1067, + 816, + 1025, + 816 + ], + "score": 0.27, + "latex": "\\mathrm { K L }" + }, + { + "category_id": 13, + "poly": [ + 1111, + 1388, + 1132, + 1388, + 1132, + 1413, + 1111, + 1413 + ], + "score": 0.25, + "latex": "\\mathrm { E }" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 526.0, + 646.0, + 526.0, + 646.0, + 563.0, + 295.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1511.0, + 460.0, + 1511.0, + 460.0, + 1549.0, + 295.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 818.0, + 73.0, + 818.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 863.0, + 2085.0, + 863.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1189.0, + 620.0, + 1189.0, + 620.0, + 1231.0, + 294.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 649.0, + 1189.0, + 833.0, + 1189.0, + 833.0, + 1231.0, + 649.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 851.0, + 1189.0, + 1406.0, + 1189.0, + 1406.0, + 1231.0, + 851.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 286.0, + 1218.0, + 660.0, + 1218.0, + 660.0, + 1283.0, + 286.0, + 1283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 942.0, + 1218.0, + 1086.0, + 1218.0, + 1086.0, + 1283.0, + 942.0, + 1283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1108.0, + 1218.0, + 1412.0, + 1218.0, + 1412.0, + 1283.0, + 1108.0, + 1283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1265.0, + 468.0, + 1265.0, + 468.0, + 1299.0, + 294.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 489.0, + 1265.0, + 1304.0, + 1265.0, + 1304.0, + 1299.0, + 489.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1327.0, + 1265.0, + 1405.0, + 1265.0, + 1405.0, + 1299.0, + 1327.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1295.0, + 722.0, + 1295.0, + 722.0, + 1330.0, + 294.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 742.0, + 1295.0, + 1373.0, + 1295.0, + 1373.0, + 1330.0, + 742.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1326.0, + 667.0, + 1326.0, + 667.0, + 1360.0, + 295.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 1326.0, + 734.0, + 1326.0, + 734.0, + 1360.0, + 686.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 768.0, + 1326.0, + 1403.0, + 1326.0, + 1403.0, + 1360.0, + 768.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1358.0, + 1106.0, + 1358.0, + 1106.0, + 1388.0, + 296.0, + 1388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1135.0, + 1358.0, + 1312.0, + 1358.0, + 1312.0, + 1388.0, + 1135.0, + 1388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 1358.0, + 1403.0, + 1358.0, + 1403.0, + 1388.0, + 1333.0, + 1388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1382.0, + 538.0, + 1382.0, + 538.0, + 1423.0, + 293.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 1382.0, + 741.0, + 1382.0, + 741.0, + 1423.0, + 568.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 762.0, + 1382.0, + 1110.0, + 1382.0, + 1110.0, + 1423.0, + 762.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 1382.0, + 1406.0, + 1382.0, + 1406.0, + 1423.0, + 1133.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1415.0, + 1040.0, + 1415.0, + 1040.0, + 1452.0, + 294.0, + 1452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1097.0, + 1415.0, + 1407.0, + 1415.0, + 1407.0, + 1452.0, + 1097.0, + 1452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1447.0, + 1338.0, + 1447.0, + 1338.0, + 1481.0, + 295.0, + 1481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 339.0, + 1404.0, + 339.0, + 1404.0, + 372.0, + 297.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 370.0, + 1405.0, + 370.0, + 1405.0, + 403.0, + 295.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 400.0, + 1405.0, + 400.0, + 1405.0, + 434.0, + 296.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 428.0, + 1406.0, + 428.0, + 1406.0, + 466.0, + 294.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 459.0, + 886.0, + 459.0, + 886.0, + 498.0, + 294.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 787.0, + 922.0, + 787.0, + 922.0, + 820.0, + 295.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 977.0, + 787.0, + 1024.0, + 787.0, + 1024.0, + 820.0, + 977.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1068.0, + 787.0, + 1404.0, + 787.0, + 1404.0, + 820.0, + 1068.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 818.0, + 1404.0, + 818.0, + 1404.0, + 851.0, + 295.0, + 851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 844.0, + 1219.0, + 844.0, + 1219.0, + 884.0, + 294.0, + 884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1317.0, + 844.0, + 1406.0, + 844.0, + 1406.0, + 884.0, + 1317.0, + 884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 876.0, + 1404.0, + 876.0, + 1404.0, + 916.0, + 292.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 910.0, + 654.0, + 910.0, + 654.0, + 943.0, + 296.0, + 943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 584.0, + 1407.0, + 584.0, + 1407.0, + 622.0, + 294.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 616.0, + 1405.0, + 616.0, + 1405.0, + 650.0, + 292.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 644.0, + 297.0, + 644.0, + 297.0, + 686.0, + 294.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 644.0, + 686.0, + 644.0, + 686.0, + 686.0, + 351.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 719.0, + 644.0, + 770.0, + 644.0, + 770.0, + 686.0, + 719.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1238.0, + 644.0, + 1399.0, + 644.0, + 1399.0, + 686.0, + 1238.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1740.0, + 363.0, + 1740.0, + 363.0, + 1778.0, + 295.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 537.0, + 1740.0, + 822.0, + 1740.0, + 822.0, + 1778.0, + 537.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 1740.0, + 1407.0, + 1740.0, + 1407.0, + 1778.0, + 870.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1771.0, + 1404.0, + 1771.0, + 1404.0, + 1809.0, + 293.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1800.0, + 371.0, + 1800.0, + 371.0, + 1841.0, + 293.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 419.0, + 1800.0, + 751.0, + 1800.0, + 751.0, + 1841.0, + 419.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 1800.0, + 846.0, + 1800.0, + 846.0, + 1841.0, + 778.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1800.0, + 1076.0, + 1800.0, + 1076.0, + 1841.0, + 865.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1800.0, + 1405.0, + 1800.0, + 1405.0, + 1841.0, + 1187.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1838.0, + 500.0, + 1838.0, + 500.0, + 1886.0, + 291.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1197.0, + 1838.0, + 1408.0, + 1838.0, + 1408.0, + 1886.0, + 1197.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1880.0, + 704.0, + 1880.0, + 704.0, + 1922.0, + 294.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 230.0, + 1404.0, + 230.0, + 1404.0, + 264.0, + 296.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 261.0, + 1404.0, + 261.0, + 1404.0, + 297.0, + 294.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 292.0, + 954.0, + 292.0, + 954.0, + 326.0, + 294.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1108.0, + 355.0, + 1108.0, + 355.0, + 1152.0, + 294.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 810.0, + 1108.0, + 944.0, + 1108.0, + 944.0, + 1152.0, + 810.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 1108.0, + 1132.0, + 1108.0, + 1132.0, + 1152.0, + 1077.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1186.0, + 1108.0, + 1407.0, + 1108.0, + 1407.0, + 1152.0, + 1186.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1143.0, + 862.0, + 1143.0, + 862.0, + 1179.0, + 297.0, + 1179.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1566.0, + 585.0, + 1566.0, + 585.0, + 1610.0, + 293.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 1566.0, + 1040.0, + 1566.0, + 1040.0, + 1610.0, + 601.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1132.0, + 1566.0, + 1313.0, + 1566.0, + 1313.0, + 1610.0, + 1132.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 1566.0, + 1405.0, + 1566.0, + 1405.0, + 1610.0, + 1333.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1601.0, + 297.0, + 1601.0, + 297.0, + 1637.0, + 293.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 374.0, + 1601.0, + 598.0, + 1601.0, + 598.0, + 1637.0, + 374.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1601.0, + 1289.0, + 1601.0, + 1289.0, + 1637.0, + 690.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 951.0, + 1079.0, + 951.0, + 1079.0, + 992.0, + 295.0, + 992.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1787, + 1404, + 1787, + 1404, + 2036, + 297, + 2036 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 768, + 1404, + 768, + 1404, + 924, + 298, + 924 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 279, + 1405, + 279, + 1405, + 437, + 297, + 437 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 299, + 1225, + 1403, + 1225, + 1403, + 1318, + 299, + 1318 + ], + "score": 0.968 + }, + { + "category_id": 8, + "poly": [ + 631, + 608, + 1070, + 608, + 1070, + 737, + 631, + 737 + ], + "score": 0.958 + }, + { + "category_id": 1, + "poly": [ + 298, + 1411, + 1402, + 1411, + 1402, + 1476, + 298, + 1476 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 295, + 528, + 1403, + 528, + 1403, + 592, + 295, + 592 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 630, + 1516, + 1067, + 1516, + 1067, + 1587, + 630, + 1587 + ], + "score": 0.949 + }, + { + "category_id": 8, + "poly": [ + 496, + 1651, + 1202, + 1651, + 1202, + 1725, + 496, + 1725 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 356, + 997, + 1404, + 997, + 1404, + 1199, + 356, + 1199 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 298, + 1741, + 1115, + 1741, + 1115, + 1776, + 298, + 1776 + ], + "score": 0.936 + }, + { + "category_id": 1, + "poly": [ + 298, + 1599, + 1132, + 1599, + 1132, + 1634, + 298, + 1634 + ], + "score": 0.936 + }, + { + "category_id": 1, + "poly": [ + 296, + 937, + 1360, + 937, + 1360, + 973, + 296, + 973 + ], + "score": 0.918 + }, + { + "category_id": 2, + "poly": [ + 299, + 74, + 816, + 74, + 816, + 105, + 299, + 105 + ], + "score": 0.913 + }, + { + "category_id": 0, + "poly": [ + 302, + 1358, + 864, + 1358, + 864, + 1388, + 302, + 1388 + ], + "score": 0.902 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1539, + 1400, + 1539, + 1400, + 1568, + 1366, + 1568 + ], + "score": 0.893 + }, + { + "category_id": 9, + "poly": [ + 1366, + 657, + 1400, + 657, + 1400, + 688, + 1366, + 688 + ], + "score": 0.891 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1672, + 1400, + 1672, + 1400, + 1702, + 1366, + 1702 + ], + "score": 0.885 + }, + { + "category_id": 1, + "poly": [ + 298, + 227, + 1121, + 227, + 1121, + 266, + 298, + 266 + ], + "score": 0.862 + }, + { + "category_id": 0, + "poly": [ + 299, + 473, + 570, + 473, + 570, + 505, + 299, + 505 + ], + "score": 0.832 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.757 + }, + { + "category_id": 14, + "poly": [ + 631, + 1516, + 1067, + 1516, + 1067, + 1590, + 631, + 1590 + ], + "score": 0.94, + "latex": "q _ { i } ( a | s ) \\propto \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp \\Big ( \\frac { Q _ { \\theta _ { i } } ( s , a ) } { \\eta ^ { * } } \\Big ) ," + }, + { + "category_id": 13, + "poly": [ + 828, + 1742, + 909, + 1742, + 909, + 1776, + 828, + 1776 + ], + "score": 0.93, + "latex": "q _ { i } ( a | s )" + }, + { + "category_id": 14, + "poly": [ + 496, + 1650, + 1200, + 1650, + 1200, + 1724, + 496, + 1724 + ], + "score": 0.93, + "latex": "g ( \\eta ) = \\eta \\epsilon + \\eta \\int \\mu ( s ) \\log \\int \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp \\Big ( \\frac { Q _ { \\theta _ { i } } ( s , a ) } { \\eta } \\Big ) d a d s ," + }, + { + "category_id": 13, + "poly": [ + 949, + 999, + 1062, + 999, + 1062, + 1033, + 949, + 1033 + ], + "score": 0.93, + "latex": "q ( a | s , \\pmb \\theta ^ { q } )" + }, + { + "category_id": 13, + "poly": [ + 361, + 229, + 664, + 229, + 664, + 267, + 361, + 267 + ], + "score": 0.93, + "latex": "V _ { \\pmb { \\theta } _ { i } } ( s ) = \\mathbb { E } _ { q ( a | s } [ Q _ { \\pmb { \\theta } _ { i } } ( s , a ) ]" + }, + { + "category_id": 13, + "poly": [ + 970, + 1105, + 1043, + 1105, + 1043, + 1139, + 970, + 1139 + ], + "score": 0.93, + "latex": "q ( a | s )" + }, + { + "category_id": 13, + "poly": [ + 1068, + 939, + 1140, + 939, + 1140, + 973, + 1068, + 973 + ], + "score": 0.92, + "latex": "q ( a | s )" + }, + { + "category_id": 14, + "poly": [ + 631, + 608, + 1073, + 608, + 1073, + 738, + 631, + 738 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\underset { q } { \\operatorname* { m a x } } \\mathbb { E } _ { \\boldsymbol { \\mu } ( s ) } \\left[ \\mathbb { E } _ { q ( a \\mid s ) } \\left[ Q _ { \\boldsymbol { \\theta } _ { i } } ( s , a ) \\right] \\right] } \\\\ & { s . t . \\mathbb { E } _ { \\boldsymbol { \\mu } ( s ) } \\left[ { \\mathbf { K L } } ( q ( a \\mid s ) , \\pi ( a \\mid s , \\boldsymbol { \\theta } _ { i } ) ) \\right] < \\epsilon . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 403, + 1853, + 475, + 1853, + 475, + 1884, + 403, + 1884 + ], + "score": 0.92, + "latex": "q ( a | s )" + }, + { + "category_id": 13, + "poly": [ + 827, + 1851, + 904, + 1851, + 904, + 1884, + 827, + 1884 + ], + "score": 0.92, + "latex": "\\scriptstyle q ( a , s )" + }, + { + "category_id": 13, + "poly": [ + 1138, + 1851, + 1205, + 1851, + 1205, + 1884, + 1138, + 1884 + ], + "score": 0.92, + "latex": "\\mu _ { q } ( s )" + }, + { + "category_id": 13, + "poly": [ + 395, + 314, + 439, + 314, + 439, + 346, + 395, + 346 + ], + "score": 0.9, + "latex": "Q _ { \\theta _ { i } }" + }, + { + "category_id": 13, + "poly": [ + 769, + 229, + 1115, + 229, + 1115, + 265, + 769, + 265 + ], + "score": 0.9, + "latex": "Q _ { \\pmb { \\theta } _ { i } } ( s , a ) = r ( s , a ) + \\gamma V _ { \\pmb { \\theta } _ { i } } ( s ) ." + }, + { + "category_id": 13, + "poly": [ + 533, + 1603, + 563, + 1603, + 563, + 1633, + 533, + 1633 + ], + "score": 0.88, + "latex": "\\eta ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1266, + 999, + 1297, + 999, + 1297, + 1027, + 1266, + 1027 + ], + "score": 0.86, + "latex": "\\pmb { \\theta } ^ { q }" + }, + { + "category_id": 13, + "poly": [ + 1258, + 378, + 1291, + 378, + 1291, + 408, + 1258, + 408 + ], + "score": 0.86, + "latex": "\\mu _ { q }" + }, + { + "category_id": 13, + "poly": [ + 1080, + 318, + 1105, + 318, + 1105, + 344, + 1080, + 344 + ], + "score": 0.85, + "latex": "q _ { i }" + }, + { + "category_id": 13, + "poly": [ + 765, + 280, + 1026, + 280, + 1026, + 316, + 765, + 316 + ], + "score": 0.85, + "latex": "q _ { i } = \\arg \\operatorname* { m a x } \\bar { \\mathcal { I } } ( q , \\theta _ { i } )" + }, + { + "category_id": 13, + "poly": [ + 1308, + 284, + 1336, + 284, + 1336, + 312, + 1308, + 312 + ], + "score": 0.84, + "latex": "\\mathcal { I }" + }, + { + "category_id": 13, + "poly": [ + 728, + 771, + 822, + 771, + 822, + 804, + 728, + 804 + ], + "score": 0.84, + "latex": "q ( a | s ) -" + }, + { + "category_id": 13, + "poly": [ + 790, + 2008, + 815, + 2008, + 815, + 2032, + 790, + 2032 + ], + "score": 0.84, + "latex": "\\mathcal { I }" + }, + { + "category_id": 13, + "poly": [ + 1058, + 1418, + 1076, + 1418, + 1076, + 1445, + 1058, + 1445 + ], + "score": 0.79, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 1043, + 349, + 1064, + 349, + 1064, + 371, + 1043, + 371 + ], + "score": 0.75, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 298, + 565, + 318, + 565, + 318, + 587, + 298, + 587 + ], + "score": 0.71, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 750, + 319, + 766, + 319, + 766, + 345, + 750, + 345 + ], + "score": 0.71, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 622, + 1923, + 638, + 1923, + 638, + 1939, + 622, + 1939 + ], + "score": 0.7, + "latex": "a" + }, + { + "category_id": 13, + "poly": [ + 931, + 280, + 1025, + 280, + 1025, + 316, + 931, + 316 + ], + "score": 0.52, + "latex": "\\bar { \\mathcal { I } } ( \\boldsymbol { q } , \\boldsymbol { \\theta } _ { i } )" + }, + { + "category_id": 13, + "poly": [ + 1282, + 567, + 1296, + 567, + 1296, + 587, + 1282, + 587 + ], + "score": 0.52, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1086, + 1883, + 1112, + 1883, + 1112, + 1913, + 1086, + 1913 + ], + "score": 0.34, + "latex": "\\mathrm { Q }" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 817.0, + 72.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1360.0, + 866.0, + 1360.0, + 866.0, + 1390.0, + 296.0, + 1390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 473.0, + 572.0, + 473.0, + 572.0, + 509.0, + 297.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 861.0, + 2085.0, + 861.0, + 2120.0, + 839.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1788.0, + 1404.0, + 1788.0, + 1404.0, + 1824.0, + 294.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1821.0, + 1405.0, + 1821.0, + 1405.0, + 1855.0, + 295.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1848.0, + 402.0, + 1848.0, + 402.0, + 1887.0, + 294.0, + 1887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 476.0, + 1848.0, + 826.0, + 1848.0, + 826.0, + 1887.0, + 476.0, + 1887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 1848.0, + 1137.0, + 1848.0, + 1137.0, + 1887.0, + 905.0, + 1887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 1848.0, + 1404.0, + 1848.0, + 1404.0, + 1887.0, + 1206.0, + 1887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1879.0, + 1085.0, + 1879.0, + 1085.0, + 1919.0, + 292.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1113.0, + 1879.0, + 1405.0, + 1879.0, + 1405.0, + 1919.0, + 1113.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1913.0, + 621.0, + 1913.0, + 621.0, + 1943.0, + 296.0, + 1943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 639.0, + 1913.0, + 1404.0, + 1913.0, + 1404.0, + 1943.0, + 639.0, + 1943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1943.0, + 1404.0, + 1943.0, + 1404.0, + 1977.0, + 295.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1973.0, + 1406.0, + 1973.0, + 1406.0, + 2007.0, + 295.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2004.0, + 789.0, + 2004.0, + 789.0, + 2038.0, + 295.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 816.0, + 2004.0, + 1042.0, + 2004.0, + 1042.0, + 2038.0, + 816.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 767.0, + 727.0, + 767.0, + 727.0, + 809.0, + 293.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 767.0, + 1408.0, + 767.0, + 1408.0, + 809.0, + 823.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 802.0, + 1402.0, + 802.0, + 1402.0, + 835.0, + 296.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 833.0, + 1404.0, + 833.0, + 1404.0, + 866.0, + 294.0, + 866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 861.0, + 1405.0, + 861.0, + 1405.0, + 898.0, + 294.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 891.0, + 621.0, + 891.0, + 621.0, + 929.0, + 296.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 281.0, + 764.0, + 281.0, + 764.0, + 319.0, + 295.0, + 319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1027.0, + 281.0, + 1307.0, + 281.0, + 1307.0, + 319.0, + 1027.0, + 319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1337.0, + 281.0, + 1406.0, + 281.0, + 1406.0, + 319.0, + 1337.0, + 319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 311.0, + 394.0, + 311.0, + 394.0, + 349.0, + 295.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.0, + 311.0, + 749.0, + 311.0, + 749.0, + 349.0, + 440.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 767.0, + 311.0, + 1079.0, + 311.0, + 1079.0, + 349.0, + 767.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 311.0, + 1405.0, + 311.0, + 1405.0, + 349.0, + 1106.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 343.0, + 1042.0, + 343.0, + 1042.0, + 378.0, + 294.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 343.0, + 1405.0, + 343.0, + 1405.0, + 378.0, + 1065.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 373.0, + 1257.0, + 373.0, + 1257.0, + 410.0, + 295.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1292.0, + 373.0, + 1405.0, + 373.0, + 1405.0, + 410.0, + 1292.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 405.0, + 1089.0, + 405.0, + 1089.0, + 439.0, + 296.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1223.0, + 1403.0, + 1223.0, + 1403.0, + 1263.0, + 293.0, + 1263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1257.0, + 1405.0, + 1257.0, + 1405.0, + 1291.0, + 294.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1288.0, + 382.0, + 1288.0, + 382.0, + 1320.0, + 293.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1411.0, + 1057.0, + 1411.0, + 1057.0, + 1447.0, + 294.0, + 1447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 1411.0, + 1406.0, + 1411.0, + 1406.0, + 1447.0, + 1077.0, + 1447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1442.0, + 1106.0, + 1442.0, + 1106.0, + 1478.0, + 294.0, + 1478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 528.0, + 1405.0, + 528.0, + 1405.0, + 564.0, + 297.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 557.0, + 297.0, + 557.0, + 297.0, + 596.0, + 294.0, + 596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 557.0, + 1281.0, + 557.0, + 1281.0, + 596.0, + 319.0, + 596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1297.0, + 557.0, + 1347.0, + 557.0, + 1347.0, + 596.0, + 1297.0, + 596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 359.0, + 994.0, + 948.0, + 994.0, + 948.0, + 1037.0, + 359.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 994.0, + 1265.0, + 994.0, + 1265.0, + 1037.0, + 1063.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1298.0, + 994.0, + 1404.0, + 994.0, + 1404.0, + 1037.0, + 1298.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1028.0, + 1405.0, + 1028.0, + 1405.0, + 1063.0, + 393.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1060.0, + 1404.0, + 1060.0, + 1404.0, + 1096.0, + 393.0, + 1096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 1102.0, + 969.0, + 1102.0, + 969.0, + 1142.0, + 356.0, + 1142.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1044.0, + 1102.0, + 1406.0, + 1102.0, + 1406.0, + 1142.0, + 1044.0, + 1142.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1136.0, + 1406.0, + 1136.0, + 1406.0, + 1171.0, + 392.0, + 1171.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1162.0, + 492.0, + 1162.0, + 492.0, + 1206.0, + 394.0, + 1206.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1735.0, + 827.0, + 1735.0, + 827.0, + 1783.0, + 293.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 910.0, + 1735.0, + 1119.0, + 1735.0, + 1119.0, + 1783.0, + 910.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1596.0, + 532.0, + 1596.0, + 532.0, + 1638.0, + 294.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 564.0, + 1596.0, + 1135.0, + 1596.0, + 1135.0, + 1638.0, + 564.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 935.0, + 1067.0, + 935.0, + 1067.0, + 976.0, + 293.0, + 976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 935.0, + 1365.0, + 935.0, + 1365.0, + 976.0, + 1141.0, + 976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 224.0, + 360.0, + 224.0, + 360.0, + 271.0, + 295.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 665.0, + 224.0, + 768.0, + 224.0, + 768.0, + 271.0, + 665.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 224.0, + 1123.0, + 224.0, + 1123.0, + 271.0, + 1116.0, + 271.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1076, + 1405, + 1076, + 1405, + 1356, + 296, + 1356 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 296, + 503, + 1405, + 503, + 1405, + 743, + 296, + 743 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 296, + 1469, + 1405, + 1469, + 1405, + 1627, + 296, + 1627 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 287, + 1404, + 287, + 1404, + 381, + 298, + 381 + ], + "score": 0.975 + }, + { + "category_id": 8, + "poly": [ + 606, + 931, + 1097, + 931, + 1097, + 1058, + 606, + 1058 + ], + "score": 0.964 + }, + { + "category_id": 8, + "poly": [ + 482, + 418, + 1217, + 418, + 1217, + 481, + 482, + 481 + ], + "score": 0.945 + }, + { + "category_id": 8, + "poly": [ + 467, + 777, + 1225, + 777, + 1225, + 840, + 467, + 840 + ], + "score": 0.939 + }, + { + "category_id": 2, + "poly": [ + 297, + 1976, + 1408, + 1976, + 1408, + 2035, + 297, + 2035 + ], + "score": 0.923 + }, + { + "category_id": 0, + "poly": [ + 300, + 1400, + 656, + 1400, + 656, + 1436, + 300, + 1436 + ], + "score": 0.919 + }, + { + "category_id": 2, + "poly": [ + 299, + 74, + 815, + 74, + 815, + 105, + 299, + 105 + ], + "score": 0.912 + }, + { + "category_id": 1, + "poly": [ + 300, + 863, + 918, + 863, + 918, + 895, + 300, + 895 + ], + "score": 0.912 + }, + { + "category_id": 8, + "poly": [ + 308, + 1679, + 1395, + 1679, + 1395, + 1935, + 308, + 1935 + ], + "score": 0.911 + }, + { + "category_id": 9, + "poly": [ + 1352, + 978, + 1400, + 978, + 1400, + 1010, + 1352, + 1010 + ], + "score": 0.898 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1921, + 1400, + 1921, + 1400, + 1951, + 1352, + 1951 + ], + "score": 0.898 + }, + { + "category_id": 9, + "poly": [ + 1351, + 792, + 1400, + 792, + 1400, + 824, + 1351, + 824 + ], + "score": 0.895 + }, + { + "category_id": 9, + "poly": [ + 1352, + 433, + 1400, + 433, + 1400, + 464, + 1352, + 464 + ], + "score": 0.894 + }, + { + "category_id": 0, + "poly": [ + 298, + 229, + 462, + 229, + 462, + 261, + 298, + 261 + ], + "score": 0.891 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2113, + 840, + 2113 + ], + "score": 0.817 + }, + { + "category_id": 14, + "poly": [ + 311, + 1679, + 1391, + 1679, + 1391, + 1934, + 311, + 1934 + ], + "score": 0.93, + "latex": "\\begin{array} { l } { \\displaystyle \\mathop { \\operatorname* { m i n } } _ { \\phi } L ( \\phi ) = \\mathop { \\operatorname* { m i n } } _ { \\phi } \\mathbb { E } _ { \\mu _ { b } ( s ) , b ( a | s ) } \\left[ \\left( Q _ { \\theta _ { i } } ( s _ { t } , a _ { t } , \\phi ) - Q _ { t } ^ { \\mathrm { r e t } } \\right) ^ { 2 } \\right] , \\mathrm { w i t h } } \\\\ { \\displaystyle Q _ { t } ^ { \\mathrm { r e t } } = Q _ { \\phi ^ { \\prime } } ( s _ { t } , a _ { t } ) + \\sum _ { j = t } ^ { \\infty } \\gamma ^ { j - t } \\Big ( \\prod _ { k = t + 1 } ^ { j } c _ { k } \\Big ) \\left[ r ( s _ { j } , a _ { j } ) + \\mathbb { E } _ { \\pi ( a | s _ { j + 1 } ) } [ Q _ { \\phi ^ { \\prime } } ( s _ { j + 1 } , a ) ] - Q _ { \\phi ^ { \\prime } } ( s _ { j } , a _ { j } ) \\right] , } \\\\ { \\displaystyle c _ { k } = \\operatorname* { m i n } \\Big ( 1 , \\frac { \\pi ( a _ { k } | s _ { k } ) } { b ( a _ { k } | s _ { k } ) } \\Big ) , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 607, + 932, + 1097, + 932, + 1097, + 1059, + 607, + 1059 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\underset { \\pi } { \\operatorname* { m a x } } \\mathbb { E } _ { \\mu _ { q } ( s ) } \\left[ \\mathbb { E } _ { q ( a | s ) } \\left[ \\log \\pi ( a | s , \\pmb { \\theta } ) \\right] \\right] } \\\\ { s . t . \\mathbb { E } _ { \\mu _ { q } ( s ) } \\left[ { \\mathbf { K L } } ( \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\pi ( a | s , \\pmb { \\theta } ) ) \\right] < \\epsilon . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1265, + 1564, + 1400, + 1564, + 1400, + 1597, + 1265, + 1597 + ], + "score": 0.92, + "latex": "Q _ { \\theta _ { i } } ( s , a , \\phi )" + }, + { + "category_id": 13, + "poly": [ + 1240, + 1502, + 1338, + 1502, + 1338, + 1535, + 1240, + 1535 + ], + "score": 0.92, + "latex": "Q _ { \\theta } ( s , a )" + }, + { + "category_id": 13, + "poly": [ + 296, + 627, + 647, + 627, + 647, + 683, + 296, + 683 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { p ( \\pmb { \\theta } ) \\approx \\mathcal { N } \\Big ( \\mu = \\pmb { \\theta } _ { i } , \\Sigma = \\frac { F _ { \\pmb { \\theta } _ { i } } } { \\lambda } \\Big ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 761, + 597, + 816, + 597, + 816, + 630, + 761, + 630 + ], + "score": 0.91, + "latex": "p ( \\pmb \\theta )" + }, + { + "category_id": 14, + "poly": [ + 469, + 778, + 1228, + 778, + 1228, + 840, + 469, + 840 + ], + "score": 0.91, + "latex": "\\operatorname* { m a x } _ { \\pi } \\mathbb { E } _ { \\mu _ { q } ( s ) } \\Big [ \\mathbb { E } _ { q ( a | s ) } \\Big [ \\log \\pi ( a | s , \\pmb { \\theta } ) \\Big ] - \\lambda \\mathrm { K L } \\Big ( \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\pi ( a | s , \\pmb { \\theta } ) \\Big ) \\Big ]" + }, + { + "category_id": 14, + "poly": [ + 481, + 419, + 1215, + 419, + 1215, + 480, + 481, + 480 + ], + "score": 0.91, + "latex": "\\operatorname* { m a x } _ { \\theta } \\mathcal { I } ( q _ { i } , \\theta ) = \\operatorname* { m a x } _ { \\theta } \\mathbb { E } _ { \\mu _ { q } ( s ) } \\Big [ \\mathbb { E } _ { q ( a | s ) } \\Big [ \\log \\pi ( a | s , \\theta ) \\Big ] \\Big ] + \\log p ( \\theta ) ," + }, + { + "category_id": 13, + "poly": [ + 1357, + 643, + 1399, + 643, + 1399, + 672, + 1357, + 672 + ], + "score": 0.88, + "latex": "F _ { \\pmb { \\theta } _ { i } }" + }, + { + "category_id": 13, + "poly": [ + 735, + 639, + 764, + 639, + 764, + 669, + 735, + 669 + ], + "score": 0.87, + "latex": "\\pmb \\theta _ { i }" + }, + { + "category_id": 13, + "poly": [ + 950, + 290, + 977, + 290, + 977, + 319, + 950, + 319 + ], + "score": 0.84, + "latex": "\\mathcal { I }" + }, + { + "category_id": 13, + "poly": [ + 370, + 294, + 395, + 294, + 395, + 320, + 370, + 320 + ], + "score": 0.84, + "latex": "q _ { i }" + }, + { + "category_id": 13, + "poly": [ + 881, + 1595, + 900, + 1595, + 900, + 1626, + 881, + 1626 + ], + "score": 0.84, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 591, + 319, + 688, + 319, + 688, + 352, + 591, + 352 + ], + "score": 0.84, + "latex": "\\mathcal { I } ( q _ { i } , \\pmb { \\theta } )" + }, + { + "category_id": 13, + "poly": [ + 1150, + 290, + 1170, + 290, + 1170, + 316, + 1150, + 316 + ], + "score": 0.8, + "latex": "\\pmb \\theta" + }, + { + "category_id": 13, + "poly": [ + 818, + 680, + 838, + 680, + 838, + 706, + 818, + 706 + ], + "score": 0.79, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1073, + 320, + 1094, + 320, + 1094, + 346, + 1073, + 346 + ], + "score": 0.79, + "latex": "\\pmb { \\theta }" + }, + { + "category_id": 13, + "poly": [ + 376, + 319, + 688, + 319, + 688, + 352, + 376, + 352 + ], + "score": 0.52, + "latex": "\\pmb { \\theta } _ { i + 1 } = \\arg \\operatorname* { m a x } _ { \\pmb { \\theta } } \\mathcal { I } ( q _ { i } , \\pmb { \\theta } )" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1969.0, + 1406.0, + 1969.0, + 1406.0, + 2013.0, + 327.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2003.0, + 659.0, + 2003.0, + 659.0, + 2035.0, + 294.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1396.0, + 660.0, + 1396.0, + 660.0, + 1443.0, + 292.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 818.0, + 72.0, + 818.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 465.0, + 227.0, + 465.0, + 264.0, + 294.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2087.0, + 862.0, + 2087.0, + 862.0, + 2117.0, + 840.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1076.0, + 1407.0, + 1076.0, + 1407.0, + 1116.0, + 294.0, + 1116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1109.0, + 1407.0, + 1109.0, + 1407.0, + 1146.0, + 294.0, + 1146.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1142.0, + 1405.0, + 1142.0, + 1405.0, + 1175.0, + 295.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1164.0, + 1406.0, + 1164.0, + 1406.0, + 1211.0, + 290.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1201.0, + 1406.0, + 1201.0, + 1406.0, + 1238.0, + 294.0, + 1238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1232.0, + 1405.0, + 1232.0, + 1405.0, + 1266.0, + 294.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1261.0, + 1405.0, + 1261.0, + 1405.0, + 1298.0, + 294.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1291.0, + 1406.0, + 1291.0, + 1406.0, + 1327.0, + 293.0, + 1327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1323.0, + 924.0, + 1323.0, + 924.0, + 1356.0, + 294.0, + 1356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 505.0, + 1401.0, + 505.0, + 1401.0, + 538.0, + 296.0, + 538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 534.0, + 1403.0, + 534.0, + 1403.0, + 571.0, + 294.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 566.0, + 1405.0, + 566.0, + 1405.0, + 603.0, + 294.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 594.0, + 760.0, + 594.0, + 760.0, + 635.0, + 294.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 817.0, + 594.0, + 1405.0, + 594.0, + 1405.0, + 635.0, + 817.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 627.0, + 295.0, + 627.0, + 295.0, + 680.0, + 292.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 635.0, + 734.0, + 635.0, + 734.0, + 677.0, + 648.0, + 677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 635.0, + 1356.0, + 635.0, + 1356.0, + 677.0, + 765.0, + 677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1400.0, + 635.0, + 1403.0, + 635.0, + 1403.0, + 677.0, + 1400.0, + 677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 679.0, + 817.0, + 679.0, + 817.0, + 712.0, + 295.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 679.0, + 1403.0, + 679.0, + 1403.0, + 712.0, + 839.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 707.0, + 779.0, + 707.0, + 779.0, + 747.0, + 293.0, + 747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1471.0, + 1405.0, + 1471.0, + 1405.0, + 1505.0, + 296.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1501.0, + 1239.0, + 1501.0, + 1239.0, + 1537.0, + 293.0, + 1537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1339.0, + 1501.0, + 1407.0, + 1501.0, + 1407.0, + 1537.0, + 1339.0, + 1537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1532.0, + 1403.0, + 1532.0, + 1403.0, + 1565.0, + 294.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1559.0, + 1264.0, + 1559.0, + 1264.0, + 1602.0, + 293.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1559.0, + 1406.0, + 1559.0, + 1406.0, + 1602.0, + 1401.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1592.0, + 880.0, + 1592.0, + 880.0, + 1630.0, + 293.0, + 1630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 1592.0, + 1270.0, + 1592.0, + 1270.0, + 1630.0, + 901.0, + 1630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 285.0, + 369.0, + 285.0, + 369.0, + 323.0, + 294.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 285.0, + 949.0, + 285.0, + 949.0, + 323.0, + 396.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 978.0, + 285.0, + 1149.0, + 285.0, + 1149.0, + 323.0, + 978.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 285.0, + 1405.0, + 285.0, + 1405.0, + 323.0, + 1171.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 317.0, + 375.0, + 317.0, + 375.0, + 353.0, + 293.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 689.0, + 317.0, + 1072.0, + 317.0, + 1072.0, + 353.0, + 689.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1095.0, + 317.0, + 1405.0, + 317.0, + 1405.0, + 353.0, + 1095.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 348.0, + 427.0, + 348.0, + 427.0, + 380.0, + 292.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 860.0, + 923.0, + 860.0, + 923.0, + 898.0, + 296.0, + 898.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1680, + 1403, + 1680, + 1403, + 1865, + 298, + 1865 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1403, + 229, + 1403, + 414, + 299, + 414 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1330, + 1403, + 1330, + 1403, + 1485, + 298, + 1485 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1881, + 1402, + 1881, + 1402, + 2035, + 298, + 2035 + ], + "score": 0.972 + }, + { + "category_id": 3, + "poly": [ + 299, + 852, + 1397, + 852, + 1397, + 1168, + 299, + 1168 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 302, + 1499, + 1402, + 1499, + 1402, + 1591, + 302, + 1591 + ], + "score": 0.962 + }, + { + "category_id": 4, + "poly": [ + 297, + 1200, + 1404, + 1200, + 1404, + 1292, + 297, + 1292 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 298, + 530, + 1404, + 530, + 1404, + 747, + 298, + 747 + ], + "score": 0.923 + }, + { + "category_id": 0, + "poly": [ + 301, + 460, + 558, + 460, + 558, + 495, + 301, + 495 + ], + "score": 0.899 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.894 + }, + { + "category_id": 0, + "poly": [ + 301, + 785, + 759, + 785, + 759, + 815, + 301, + 815 + ], + "score": 0.894 + }, + { + "category_id": 1, + "poly": [ + 298, + 1626, + 1083, + 1626, + 1083, + 1658, + 298, + 1658 + ], + "score": 0.665 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 858, + 2088, + 858, + 2111, + 842, + 2111 + ], + "score": 0.631 + }, + { + "category_id": 0, + "poly": [ + 298, + 1626, + 1083, + 1626, + 1083, + 1658, + 298, + 1658 + ], + "score": 0.29 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 858, + 2088, + 858, + 2111, + 842, + 2111 + ], + "score": 0.226 + }, + { + "category_id": 13, + "poly": [ + 371, + 230, + 479, + 230, + 479, + 265, + 371, + 265 + ], + "score": 0.93, + "latex": "Q _ { \\phi ^ { \\prime } } ( s , a )" + }, + { + "category_id": 13, + "poly": [ + 980, + 291, + 1051, + 291, + 1051, + 324, + 980, + 324 + ], + "score": 0.92, + "latex": "b ( a | s )" + }, + { + "category_id": 13, + "poly": [ + 355, + 293, + 401, + 293, + 401, + 326, + 355, + 326 + ], + "score": 0.91, + "latex": "Q _ { \\phi ^ { \\prime } }" + }, + { + "category_id": 13, + "poly": [ + 1121, + 231, + 1148, + 231, + 1148, + 262, + 1121, + 262 + ], + "score": 0.86, + "latex": "\\phi ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 510, + 263, + 531, + 263, + 531, + 293, + 510, + 293 + ], + "score": 0.85, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 1117, + 264, + 1146, + 264, + 1146, + 289, + 1117, + 289 + ], + "score": 0.82, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 1254, + 323, + 1271, + 323, + 1271, + 349, + 1254, + 349 + ], + "score": 0.73, + "latex": "b" + }, + { + "category_id": 13, + "poly": [ + 705, + 294, + 725, + 294, + 725, + 319, + 705, + 319 + ], + "score": 0.7, + "latex": "\\lambda" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 1036.0, + 424.0, + 1036.0, + 424.0, + 1137.0, + 348.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 547.0, + 1047.0, + 654.0, + 1047.0, + 654.0, + 1126.0, + 547.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1215.0, + 1023.0, + 1367.0, + 1023.0, + 1367.0, + 1154.0, + 1215.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1197.0, + 1404.0, + 1197.0, + 1404.0, + 1236.0, + 294.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1229.0, + 1405.0, + 1229.0, + 1405.0, + 1265.0, + 295.0, + 1265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1262.0, + 702.0, + 1262.0, + 702.0, + 1295.0, + 295.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 460.0, + 561.0, + 460.0, + 561.0, + 500.0, + 294.0, + 500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 785.0, + 765.0, + 785.0, + 765.0, + 820.0, + 295.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2119.0, + 840.0, + 2119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1624.0, + 1089.0, + 1624.0, + 1089.0, + 1663.0, + 293.0, + 1663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2119.0, + 840.0, + 2119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1678.0, + 1405.0, + 1678.0, + 1405.0, + 1717.0, + 294.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1710.0, + 1408.0, + 1710.0, + 1408.0, + 1747.0, + 293.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1743.0, + 1404.0, + 1743.0, + 1404.0, + 1775.0, + 297.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1772.0, + 1405.0, + 1772.0, + 1405.0, + 1808.0, + 294.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1802.0, + 1407.0, + 1802.0, + 1407.0, + 1840.0, + 294.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1835.0, + 652.0, + 1835.0, + 652.0, + 1867.0, + 294.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 230.0, + 370.0, + 230.0, + 370.0, + 266.0, + 295.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 480.0, + 230.0, + 1120.0, + 230.0, + 1120.0, + 266.0, + 480.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1149.0, + 230.0, + 1405.0, + 230.0, + 1405.0, + 266.0, + 1149.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 258.0, + 509.0, + 258.0, + 509.0, + 301.0, + 292.0, + 301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 532.0, + 258.0, + 1116.0, + 258.0, + 1116.0, + 301.0, + 532.0, + 301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1147.0, + 258.0, + 1407.0, + 258.0, + 1407.0, + 301.0, + 1147.0, + 301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 291.0, + 354.0, + 291.0, + 354.0, + 327.0, + 295.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 291.0, + 704.0, + 291.0, + 704.0, + 327.0, + 402.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 726.0, + 291.0, + 979.0, + 291.0, + 979.0, + 327.0, + 726.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 291.0, + 1405.0, + 291.0, + 1405.0, + 327.0, + 1052.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 321.0, + 1253.0, + 321.0, + 1253.0, + 357.0, + 295.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1272.0, + 321.0, + 1404.0, + 321.0, + 1404.0, + 357.0, + 1272.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 352.0, + 1405.0, + 352.0, + 1405.0, + 388.0, + 294.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 381.0, + 513.0, + 381.0, + 513.0, + 416.0, + 294.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1329.0, + 1403.0, + 1329.0, + 1403.0, + 1366.0, + 296.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1360.0, + 1405.0, + 1360.0, + 1405.0, + 1396.0, + 293.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1389.0, + 1404.0, + 1389.0, + 1404.0, + 1427.0, + 294.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1421.0, + 1405.0, + 1421.0, + 1405.0, + 1458.0, + 293.0, + 1458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1453.0, + 1238.0, + 1453.0, + 1238.0, + 1489.0, + 293.0, + 1489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1880.0, + 1406.0, + 1880.0, + 1406.0, + 1917.0, + 294.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1912.0, + 1403.0, + 1912.0, + 1403.0, + 1945.0, + 296.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1941.0, + 1403.0, + 1941.0, + 1403.0, + 1977.0, + 292.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1967.0, + 1407.0, + 1967.0, + 1407.0, + 2011.0, + 292.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2003.0, + 585.0, + 2003.0, + 585.0, + 2040.0, + 294.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1497.0, + 1407.0, + 1497.0, + 1407.0, + 1535.0, + 295.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1529.0, + 1406.0, + 1529.0, + 1406.0, + 1565.0, + 294.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1562.0, + 1348.0, + 1562.0, + 1348.0, + 1592.0, + 298.0, + 1592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 532.0, + 1404.0, + 532.0, + 1404.0, + 567.0, + 294.0, + 567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 561.0, + 1405.0, + 561.0, + 1405.0, + 598.0, + 292.0, + 598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 591.0, + 1406.0, + 591.0, + 1406.0, + 630.0, + 293.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 622.0, + 1406.0, + 622.0, + 1406.0, + 657.0, + 293.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 652.0, + 1405.0, + 652.0, + 1405.0, + 691.0, + 293.0, + 691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 683.0, + 1406.0, + 683.0, + 1406.0, + 721.0, + 293.0, + 721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 714.0, + 1144.0, + 714.0, + 1144.0, + 752.0, + 294.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1624.0, + 1089.0, + 1624.0, + 1089.0, + 1663.0, + 293.0, + 1663.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 232, + 1404, + 232, + 1404, + 779, + 298, + 779 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1615, + 1404, + 1615, + 1404, + 1981, + 298, + 1981 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1386, + 1404, + 1386, + 1404, + 1600, + 298, + 1600 + ], + "score": 0.978 + }, + { + "category_id": 3, + "poly": [ + 294, + 938, + 1406, + 938, + 1406, + 1255, + 294, + 1255 + ], + "score": 0.968 + }, + { + "category_id": 4, + "poly": [ + 299, + 833, + 1399, + 833, + 1399, + 924, + 299, + 924 + ], + "score": 0.926 + }, + { + "category_id": 2, + "poly": [ + 323, + 2004, + 1309, + 2004, + 1309, + 2035, + 323, + 2035 + ], + "score": 0.91 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.887 + }, + { + "category_id": 0, + "poly": [ + 303, + 1334, + 920, + 1334, + 920, + 1363, + 303, + 1363 + ], + "score": 0.836 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 858, + 2089, + 858, + 2112, + 840, + 2112 + ], + "score": 0.801 + }, + { + "category_id": 13, + "poly": [ + 803, + 2007, + 920, + 2007, + 920, + 2035, + 803, + 2035 + ], + "score": 0.89, + "latex": "\\mathbb { E } _ { \\pi } [ Q ( s , \\cdot ) ]" + }, + { + "category_id": 13, + "poly": [ + 996, + 388, + 1015, + 388, + 1015, + 415, + 996, + 415 + ], + "score": 0.79, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 999, + 598, + 1024, + 598, + 1024, + 623, + 999, + 623 + ], + "score": 0.63, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 1038, + 1195, + 1052, + 1195, + 1052, + 1210, + 1038, + 1210 + ], + "score": 0.62, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 1204, + 568, + 1229, + 568, + 1229, + 593, + 1204, + 593 + ], + "score": 0.61, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 972, + 1195, + 986, + 1195, + 986, + 1210, + 972, + 1210 + ], + "score": 0.54, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 537, + 1222, + 552, + 1222, + 552, + 1236, + 537, + 1236 + ], + "score": 0.5, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 471, + 1221, + 486, + 1221, + 486, + 1236, + 471, + 1236 + ], + "score": 0.41, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 1321, + 943, + 1334, + 943, + 1334, + 957, + 1321, + 957 + ], + "score": 0.33, + "latex": ": =" + }, + { + "category_id": 13, + "poly": [ + 941, + 597, + 1029, + 597, + 1029, + 625, + 941, + 625 + ], + "score": 0.26, + "latex": "\\mathrm { E P G } + ." + }, + { + "category_id": 15, + "poly": [ + 384.0, + 940.0, + 649.0, + 940.0, + 649.0, + 961.0, + 384.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 735.0, + 940.0, + 1018.0, + 940.0, + 1018.0, + 961.0, + 735.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1084.0, + 940.0, + 1320.0, + 940.0, + 1320.0, + 961.0, + 1084.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1335.0, + 940.0, + 1388.0, + 940.0, + 1388.0, + 961.0, + 1335.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 961.0, + 359.0, + 961.0, + 359.0, + 983.0, + 315.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 994.0, + 359.0, + 994.0, + 359.0, + 1017.0, + 322.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1004.0, + 318.0, + 1004.0, + 318.0, + 1110.0, + 295.0, + 1110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1027.0, + 359.0, + 1027.0, + 359.0, + 1051.0, + 324.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1061.0, + 359.0, + 1061.0, + 359.0, + 1083.0, + 324.0, + 1083.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1095.0, + 359.0, + 1095.0, + 359.0, + 1117.0, + 324.0, + 1117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 341.0, + 1130.0, + 358.0, + 1130.0, + 358.0, + 1149.0, + 341.0, + 1149.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 345.0, + 1151.0, + 379.0, + 1151.0, + 379.0, + 1176.0, + 345.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1151.0, + 456.0, + 1151.0, + 456.0, + 1176.0, + 423.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.0, + 1151.0, + 533.0, + 1151.0, + 533.0, + 1176.0, + 500.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 1151.0, + 611.0, + 1151.0, + 611.0, + 1176.0, + 577.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 654.0, + 1151.0, + 688.0, + 1151.0, + 688.0, + 1176.0, + 654.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 705.0, + 1149.0, + 740.0, + 1149.0, + 740.0, + 1178.0, + 705.0, + 1178.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 782.0, + 1151.0, + 816.0, + 1151.0, + 816.0, + 1176.0, + 782.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 1151.0, + 894.0, + 1151.0, + 894.0, + 1176.0, + 860.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 937.0, + 1151.0, + 971.0, + 1151.0, + 971.0, + 1176.0, + 937.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1013.0, + 1151.0, + 1048.0, + 1151.0, + 1048.0, + 1176.0, + 1013.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1151.0, + 1097.0, + 1151.0, + 1097.0, + 1176.0, + 1065.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1142.0, + 1151.0, + 1174.0, + 1151.0, + 1174.0, + 1176.0, + 1142.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1220.0, + 1151.0, + 1253.0, + 1151.0, + 1253.0, + 1176.0, + 1220.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1297.0, + 1151.0, + 1330.0, + 1151.0, + 1330.0, + 1176.0, + 1297.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1374.0, + 1151.0, + 1407.0, + 1151.0, + 1407.0, + 1176.0, + 1374.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 1171.0, + 571.0, + 1171.0, + 571.0, + 1196.0, + 460.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 642.0, + 1168.0, + 678.0, + 1168.0, + 678.0, + 1192.0, + 642.0, + 1192.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 1169.0, + 932.0, + 1169.0, + 932.0, + 1198.0, + 819.0, + 1198.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1002.0, + 1168.0, + 1038.0, + 1168.0, + 1038.0, + 1192.0, + 1002.0, + 1192.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1179.0, + 1169.0, + 1292.0, + 1169.0, + 1292.0, + 1198.0, + 1179.0, + 1198.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1360.0, + 1168.0, + 1398.0, + 1168.0, + 1398.0, + 1192.0, + 1360.0, + 1192.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 1199.0, + 485.0, + 1199.0, + 485.0, + 1220.0, + 388.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 1201.0, + 752.0, + 1201.0, + 752.0, + 1219.0, + 664.0, + 1219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 898.0, + 1192.0, + 971.0, + 1192.0, + 971.0, + 1228.0, + 898.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 987.0, + 1192.0, + 1037.0, + 1192.0, + 1037.0, + 1228.0, + 987.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 1192.0, + 1111.0, + 1192.0, + 1111.0, + 1228.0, + 1053.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 1216.0, + 470.0, + 1216.0, + 470.0, + 1254.0, + 388.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 487.0, + 1216.0, + 536.0, + 1216.0, + 536.0, + 1254.0, + 487.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 1216.0, + 610.0, + 1216.0, + 610.0, + 1254.0, + 553.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 662.0, + 1218.0, + 840.0, + 1218.0, + 840.0, + 1241.0, + 662.0, + 1241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 895.0, + 1227.0, + 982.0, + 1227.0, + 982.0, + 1245.0, + 895.0, + 1245.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 833.0, + 1403.0, + 833.0, + 1403.0, + 867.0, + 295.0, + 867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 863.0, + 1403.0, + 863.0, + 1403.0, + 898.0, + 294.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 894.0, + 619.0, + 894.0, + 619.0, + 926.0, + 295.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1998.0, + 802.0, + 1998.0, + 802.0, + 2040.0, + 329.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 1998.0, + 1313.0, + 1998.0, + 1313.0, + 2040.0, + 921.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1331.0, + 926.0, + 1331.0, + 926.0, + 1366.0, + 296.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2117.0, + 838.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 230.0, + 1405.0, + 230.0, + 1405.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 260.0, + 1405.0, + 260.0, + 1405.0, + 297.0, + 293.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 291.0, + 1406.0, + 291.0, + 1406.0, + 326.0, + 293.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 321.0, + 1406.0, + 321.0, + 1406.0, + 356.0, + 294.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 353.0, + 1402.0, + 353.0, + 1402.0, + 387.0, + 294.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 383.0, + 995.0, + 383.0, + 995.0, + 418.0, + 294.0, + 418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1016.0, + 383.0, + 1404.0, + 383.0, + 1404.0, + 418.0, + 1016.0, + 418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 413.0, + 1406.0, + 413.0, + 1406.0, + 449.0, + 294.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 444.0, + 1406.0, + 444.0, + 1406.0, + 479.0, + 294.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 474.0, + 1406.0, + 474.0, + 1406.0, + 508.0, + 293.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 503.0, + 1405.0, + 503.0, + 1405.0, + 538.0, + 296.0, + 538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 535.0, + 1406.0, + 535.0, + 1406.0, + 570.0, + 294.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 564.0, + 1203.0, + 564.0, + 1203.0, + 599.0, + 294.0, + 599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1230.0, + 564.0, + 1404.0, + 564.0, + 1404.0, + 599.0, + 1230.0, + 599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 594.0, + 940.0, + 594.0, + 940.0, + 629.0, + 294.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1030.0, + 594.0, + 1404.0, + 594.0, + 1404.0, + 629.0, + 1030.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 624.0, + 1404.0, + 624.0, + 1404.0, + 665.0, + 292.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 658.0, + 1404.0, + 658.0, + 1404.0, + 690.0, + 296.0, + 690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 687.0, + 1404.0, + 687.0, + 1404.0, + 723.0, + 294.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 717.0, + 1405.0, + 717.0, + 1405.0, + 753.0, + 292.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 751.0, + 439.0, + 751.0, + 439.0, + 784.0, + 293.0, + 784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1616.0, + 1405.0, + 1616.0, + 1405.0, + 1650.0, + 294.0, + 1650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1648.0, + 1406.0, + 1648.0, + 1406.0, + 1681.0, + 294.0, + 1681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1675.0, + 1405.0, + 1675.0, + 1405.0, + 1712.0, + 292.0, + 1712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1708.0, + 1404.0, + 1708.0, + 1404.0, + 1742.0, + 294.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1736.0, + 1406.0, + 1736.0, + 1406.0, + 1773.0, + 293.0, + 1773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1769.0, + 1406.0, + 1769.0, + 1406.0, + 1803.0, + 294.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1797.0, + 1405.0, + 1797.0, + 1405.0, + 1837.0, + 293.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1826.0, + 1405.0, + 1826.0, + 1405.0, + 1865.0, + 292.0, + 1865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1859.0, + 1406.0, + 1859.0, + 1406.0, + 1894.0, + 292.0, + 1894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1887.0, + 1405.0, + 1887.0, + 1405.0, + 1927.0, + 292.0, + 1927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1921.0, + 1405.0, + 1921.0, + 1405.0, + 1955.0, + 294.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1950.0, + 1404.0, + 1950.0, + 1404.0, + 1986.0, + 295.0, + 1986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1386.0, + 1405.0, + 1386.0, + 1405.0, + 1421.0, + 296.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1417.0, + 1406.0, + 1417.0, + 1406.0, + 1450.0, + 294.0, + 1450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1448.0, + 1402.0, + 1448.0, + 1402.0, + 1478.0, + 296.0, + 1478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1480.0, + 1402.0, + 1480.0, + 1402.0, + 1510.0, + 297.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1505.0, + 1406.0, + 1505.0, + 1406.0, + 1545.0, + 292.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1541.0, + 1404.0, + 1541.0, + 1404.0, + 1572.0, + 296.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1568.0, + 1405.0, + 1568.0, + 1405.0, + 1606.0, + 293.0, + 1606.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1850, + 1403, + 1850, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 435, + 1404, + 435, + 1404, + 651, + 298, + 651 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 774, + 1404, + 774, + 1404, + 987, + 297, + 987 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1591, + 1404, + 1591, + 1404, + 1715, + 298, + 1715 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 302, + 666, + 1399, + 666, + 1399, + 759, + 302, + 759 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1405, + 229, + 1405, + 323, + 299, + 323 + ], + "score": 0.961 + }, + { + "category_id": 3, + "poly": [ + 402, + 1117, + 780, + 1117, + 780, + 1414, + 402, + 1414 + ], + "score": 0.95 + }, + { + "category_id": 3, + "poly": [ + 867, + 1114, + 1288, + 1114, + 1288, + 1453, + 867, + 1453 + ], + "score": 0.942 + }, + { + "category_id": 4, + "poly": [ + 296, + 1053, + 1404, + 1053, + 1404, + 1113, + 296, + 1113 + ], + "score": 0.912 + }, + { + "category_id": 0, + "poly": [ + 299, + 1772, + 543, + 1772, + 543, + 1807, + 299, + 1807 + ], + "score": 0.904 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.894 + }, + { + "category_id": 0, + "poly": [ + 299, + 1529, + 606, + 1529, + 606, + 1559, + 299, + 1559 + ], + "score": 0.884 + }, + { + "category_id": 0, + "poly": [ + 299, + 375, + 895, + 375, + 895, + 405, + 299, + 405 + ], + "score": 0.844 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.79 + }, + { + "category_id": 13, + "poly": [ + 730, + 290, + 774, + 290, + 774, + 320, + 730, + 320 + ], + "score": 0.87, + "latex": "1 0 ^ { 6 }" + }, + { + "category_id": 13, + "poly": [ + 1067, + 1401, + 1082, + 1401, + 1082, + 1416, + 1067, + 1416 + ], + "score": 0.55, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 996, + 1401, + 1012, + 1401, + 1012, + 1416, + 996, + 1416 + ], + "score": 0.42, + "latex": "^ +" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 1116.0, + 681.0, + 1116.0, + 681.0, + 1138.0, + 545.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1138.0, + 451.0, + 1138.0, + 451.0, + 1164.0, + 424.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1164.0, + 451.0, + 1164.0, + 451.0, + 1198.0, + 423.0, + 1198.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 1184.0, + 425.0, + 1184.0, + 425.0, + 1294.0, + 402.0, + 1294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 1191.0, + 453.0, + 1191.0, + 453.0, + 1228.0, + 422.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1226.0, + 451.0, + 1226.0, + 451.0, + 1258.0, + 423.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 1253.0, + 452.0, + 1253.0, + 452.0, + 1285.0, + 422.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1283.0, + 452.0, + 1283.0, + 452.0, + 1313.0, + 423.0, + 1313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 434.0, + 1319.0, + 451.0, + 1319.0, + 451.0, + 1339.0, + 434.0, + 1339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1346.0, + 464.0, + 1346.0, + 464.0, + 1364.0, + 449.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1346.0, + 515.0, + 1346.0, + 515.0, + 1364.0, + 499.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 551.0, + 1344.0, + 571.0, + 1344.0, + 571.0, + 1366.0, + 551.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 1344.0, + 625.0, + 1344.0, + 625.0, + 1367.0, + 604.0, + 1367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 659.0, + 1345.0, + 675.0, + 1345.0, + 675.0, + 1365.0, + 659.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 710.0, + 1344.0, + 729.0, + 1344.0, + 729.0, + 1366.0, + 710.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 1344.0, + 781.0, + 1344.0, + 781.0, + 1366.0, + 761.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 1362.0, + 661.0, + 1362.0, + 661.0, + 1392.0, + 565.0, + 1392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 1361.0, + 779.0, + 1361.0, + 779.0, + 1386.0, + 739.0, + 1386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 482.0, + 1386.0, + 580.0, + 1386.0, + 580.0, + 1406.0, + 482.0, + 1406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 1386.0, + 713.0, + 1386.0, + 713.0, + 1406.0, + 615.0, + 1406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 953.0, + 1112.0, + 1259.0, + 1112.0, + 1259.0, + 1134.0, + 953.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 1133.0, + 935.0, + 1133.0, + 935.0, + 1157.0, + 888.0, + 1157.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 896.0, + 1169.0, + 936.0, + 1169.0, + 936.0, + 1194.0, + 896.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1180.0, + 891.0, + 1180.0, + 891.0, + 1291.0, + 865.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 896.0, + 1205.0, + 936.0, + 1205.0, + 936.0, + 1230.0, + 896.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 897.0, + 1239.0, + 936.0, + 1239.0, + 936.0, + 1265.0, + 897.0, + 1265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 896.0, + 1276.0, + 935.0, + 1276.0, + 935.0, + 1301.0, + 896.0, + 1301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 1313.0, + 936.0, + 1313.0, + 936.0, + 1335.0, + 915.0, + 1335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 920.0, + 1336.0, + 1007.0, + 1336.0, + 1007.0, + 1362.0, + 920.0, + 1362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1014.0, + 1336.0, + 1152.0, + 1336.0, + 1152.0, + 1362.0, + 1014.0, + 1362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1161.0, + 1337.0, + 1292.0, + 1337.0, + 1292.0, + 1360.0, + 1161.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 1358.0, + 1167.0, + 1358.0, + 1167.0, + 1386.0, + 1046.0, + 1386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1243.0, + 1355.0, + 1283.0, + 1355.0, + 1283.0, + 1380.0, + 1243.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 1377.0, + 1013.0, + 1377.0, + 1013.0, + 1399.0, + 906.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 1375.0, + 1283.0, + 1375.0, + 1283.0, + 1398.0, + 1185.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 1394.0, + 995.0, + 1394.0, + 995.0, + 1422.0, + 908.0, + 1422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1013.0, + 1394.0, + 1066.0, + 1394.0, + 1066.0, + 1422.0, + 1013.0, + 1422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 1394.0, + 1145.0, + 1394.0, + 1145.0, + 1422.0, + 1083.0, + 1422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 1396.0, + 1279.0, + 1396.0, + 1279.0, + 1416.0, + 1185.0, + 1416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 1414.0, + 999.0, + 1414.0, + 999.0, + 1434.0, + 908.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 1429.0, + 1094.0, + 1429.0, + 1094.0, + 1453.0, + 908.0, + 1453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1049.0, + 1405.0, + 1049.0, + 1405.0, + 1092.0, + 293.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1083.0, + 518.0, + 1083.0, + 518.0, + 1118.0, + 294.0, + 1118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1768.0, + 548.0, + 1768.0, + 548.0, + 1816.0, + 292.0, + 1816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1526.0, + 611.0, + 1526.0, + 611.0, + 1564.0, + 294.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 373.0, + 899.0, + 373.0, + 899.0, + 410.0, + 294.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2087.0, + 860.0, + 2087.0, + 860.0, + 2117.0, + 839.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1848.0, + 1404.0, + 1848.0, + 1404.0, + 1885.0, + 294.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1882.0, + 1404.0, + 1882.0, + 1404.0, + 1914.0, + 296.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1908.0, + 1407.0, + 1908.0, + 1407.0, + 1950.0, + 292.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1941.0, + 1405.0, + 1941.0, + 1405.0, + 1978.0, + 293.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1969.0, + 1407.0, + 1969.0, + 1407.0, + 2009.0, + 292.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2004.0, + 1178.0, + 2004.0, + 1178.0, + 2036.0, + 296.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 433.0, + 1405.0, + 433.0, + 1405.0, + 474.0, + 292.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 468.0, + 1406.0, + 468.0, + 1406.0, + 502.0, + 294.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 497.0, + 1404.0, + 497.0, + 1404.0, + 532.0, + 296.0, + 532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 528.0, + 1405.0, + 528.0, + 1405.0, + 563.0, + 294.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 559.0, + 1406.0, + 559.0, + 1406.0, + 594.0, + 294.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 589.0, + 1405.0, + 589.0, + 1405.0, + 623.0, + 294.0, + 623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 621.0, + 705.0, + 621.0, + 705.0, + 654.0, + 293.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 772.0, + 1406.0, + 772.0, + 1406.0, + 811.0, + 292.0, + 811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 802.0, + 1402.0, + 802.0, + 1402.0, + 840.0, + 292.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 835.0, + 1405.0, + 835.0, + 1405.0, + 869.0, + 294.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 865.0, + 1405.0, + 865.0, + 1405.0, + 900.0, + 291.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 896.0, + 1404.0, + 896.0, + 1404.0, + 931.0, + 295.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 927.0, + 1404.0, + 927.0, + 1404.0, + 961.0, + 295.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 958.0, + 551.0, + 958.0, + 551.0, + 992.0, + 293.0, + 992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1592.0, + 1405.0, + 1592.0, + 1405.0, + 1625.0, + 296.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1620.0, + 1405.0, + 1620.0, + 1405.0, + 1659.0, + 292.0, + 1659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1654.0, + 1405.0, + 1654.0, + 1405.0, + 1687.0, + 294.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1685.0, + 1380.0, + 1685.0, + 1380.0, + 1717.0, + 294.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 667.0, + 1402.0, + 667.0, + 1402.0, + 700.0, + 296.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 696.0, + 1405.0, + 696.0, + 1405.0, + 732.0, + 294.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 727.0, + 1115.0, + 727.0, + 1115.0, + 763.0, + 296.0, + 763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 231.0, + 1402.0, + 231.0, + 1402.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 260.0, + 1404.0, + 260.0, + 1404.0, + 297.0, + 294.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 291.0, + 729.0, + 291.0, + 729.0, + 328.0, + 294.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 775.0, + 291.0, + 1351.0, + 291.0, + 1351.0, + 328.0, + 775.0, + 328.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 332, + 365, + 1365, + 365, + 1365, + 1956, + 332, + 1956 + ], + "score": 0.965 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.889 + }, + { + "category_id": 4, + "poly": [ + 296, + 248, + 1406, + 248, + 1406, + 368, + 296, + 368 + ], + "score": 0.885 + }, + { + "category_id": 2, + "poly": [ + 836, + 2089, + 865, + 2089, + 865, + 2112, + 836, + 2112 + ], + "score": 0.848 + }, + { + "category_id": 13, + "poly": [ + 780, + 280, + 844, + 280, + 844, + 309, + 780, + 309 + ], + "score": 0.85, + "latex": "95 \\%" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 382.0, + 590.0, + 382.0, + 590.0, + 405.0, + 372.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 366.0, + 813.0, + 366.0, + 813.0, + 412.0, + 661.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 882.0, + 380.0, + 1104.0, + 380.0, + 1104.0, + 405.0, + 882.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1139.0, + 382.0, + 1358.0, + 382.0, + 1358.0, + 405.0, + 1139.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 405.0, + 386.0, + 405.0, + 386.0, + 424.0, + 351.0, + 424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 444.0, + 385.0, + 444.0, + 385.0, + 465.0, + 356.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 475.0, + 362.0, + 475.0, + 362.0, + 555.0, + 334.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 482.0, + 383.0, + 482.0, + 383.0, + 503.0, + 356.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 521.0, + 381.0, + 521.0, + 381.0, + 544.0, + 358.0, + 544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 562.0, + 383.0, + 562.0, + 383.0, + 581.0, + 358.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 639.0, + 579.0, + 639.0, + 579.0, + 657.0, + 383.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 639.0, + 836.0, + 639.0, + 836.0, + 657.0, + 638.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 898.0, + 639.0, + 1004.0, + 639.0, + 1004.0, + 657.0, + 898.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 643.0, + 1084.0, + 643.0, + 1084.0, + 655.0, + 1017.0, + 655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 639.0, + 1341.0, + 639.0, + 1341.0, + 657.0, + 1155.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 658.0, + 383.0, + 658.0, + 383.0, + 678.0, + 351.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 678.0, + 725.0, + 678.0, + 725.0, + 690.0, + 696.0, + 690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 748.0, + 674.0, + 824.0, + 674.0, + 824.0, + 697.0, + 748.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 699.0, + 383.0, + 699.0, + 383.0, + 718.0, + 356.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 732.0, + 358.0, + 732.0, + 358.0, + 808.0, + 335.0, + 808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 736.0, + 383.0, + 736.0, + 383.0, + 757.0, + 356.0, + 757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 777.0, + 381.0, + 777.0, + 381.0, + 798.0, + 358.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 771.0, + 1061.0, + 771.0, + 1061.0, + 787.0, + 1043.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1080.0, + 784.0, + 1096.0, + 784.0, + 1096.0, + 799.0, + 1080.0, + 799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 817.0, + 383.0, + 817.0, + 383.0, + 836.0, + 358.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 386.0, + 891.0, + 572.0, + 891.0, + 572.0, + 914.0, + 386.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 889.0, + 836.0, + 889.0, + 836.0, + 914.0, + 634.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 891.0, + 1093.0, + 891.0, + 1093.0, + 914.0, + 893.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 891.0, + 1342.0, + 891.0, + 1342.0, + 914.0, + 1155.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 914.0, + 383.0, + 914.0, + 383.0, + 933.0, + 351.0, + 933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 953.0, + 383.0, + 953.0, + 383.0, + 972.0, + 358.0, + 972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 949.0, + 756.0, + 949.0, + 756.0, + 967.0, + 716.0, + 967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 988.0, + 358.0, + 988.0, + 358.0, + 1062.0, + 335.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 991.0, + 383.0, + 991.0, + 383.0, + 1013.0, + 356.0, + 1013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 1030.0, + 383.0, + 1030.0, + 383.0, + 1053.0, + 358.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 1071.0, + 383.0, + 1071.0, + 383.0, + 1090.0, + 358.0, + 1090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 1145.0, + 417.0, + 1145.0, + 417.0, + 1168.0, + 362.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 434.0, + 1148.0, + 599.0, + 1148.0, + 599.0, + 1166.0, + 434.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 1148.0, + 788.0, + 1148.0, + 788.0, + 1166.0, + 716.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 825.0, + 1150.0, + 848.0, + 1150.0, + 848.0, + 1162.0, + 825.0, + 1162.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 887.0, + 1148.0, + 941.0, + 1148.0, + 941.0, + 1166.0, + 887.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 944.0, + 1148.0, + 1050.0, + 1148.0, + 1050.0, + 1166.0, + 944.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1150.0, + 1096.0, + 1150.0, + 1096.0, + 1162.0, + 1064.0, + 1162.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 1148.0, + 1300.0, + 1148.0, + 1300.0, + 1166.0, + 1141.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1311.0, + 1148.0, + 1353.0, + 1148.0, + 1353.0, + 1166.0, + 1311.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1168.0, + 383.0, + 1168.0, + 383.0, + 1187.0, + 353.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 1206.0, + 383.0, + 1206.0, + 383.0, + 1226.0, + 356.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 1242.0, + 358.0, + 1242.0, + 358.0, + 1316.0, + 335.0, + 1316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1243.0, + 385.0, + 1243.0, + 385.0, + 1270.0, + 355.0, + 1270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 1286.0, + 381.0, + 1286.0, + 381.0, + 1307.0, + 356.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 1324.0, + 383.0, + 1324.0, + 383.0, + 1345.0, + 358.0, + 1345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 670.0, + 1391.0, + 716.0, + 1391.0, + 716.0, + 1409.0, + 670.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1402.0, + 401.0, + 1402.0, + 401.0, + 1419.0, + 369.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 1402.0, + 746.0, + 1402.0, + 746.0, + 1419.0, + 680.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1319.0, + 1405.0, + 1351.0, + 1405.0, + 1351.0, + 1418.0, + 1319.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1421.0, + 383.0, + 1421.0, + 383.0, + 1441.0, + 353.0, + 1441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 1462.0, + 383.0, + 1462.0, + 383.0, + 1481.0, + 358.0, + 1481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 528.0, + 1471.0, + 572.0, + 1471.0, + 572.0, + 1502.0, + 528.0, + 1502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 1495.0, + 358.0, + 1495.0, + 358.0, + 1571.0, + 335.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 1500.0, + 383.0, + 1500.0, + 383.0, + 1522.0, + 358.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 1539.0, + 383.0, + 1539.0, + 383.0, + 1560.0, + 358.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 1580.0, + 383.0, + 1580.0, + 383.0, + 1599.0, + 358.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1659.0, + 420.0, + 1659.0, + 420.0, + 1671.0, + 392.0, + 1671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 1659.0, + 525.0, + 1659.0, + 525.0, + 1671.0, + 459.0, + 1671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 548.0, + 1659.0, + 572.0, + 1659.0, + 572.0, + 1671.0, + 548.0, + 1671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 645.0, + 1657.0, + 794.0, + 1657.0, + 794.0, + 1673.0, + 645.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 1659.0, + 833.0, + 1659.0, + 833.0, + 1671.0, + 797.0, + 1671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 960.0, + 1657.0, + 1041.0, + 1657.0, + 1041.0, + 1673.0, + 960.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1677.0, + 383.0, + 1677.0, + 383.0, + 1694.0, + 353.0, + 1694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 1715.0, + 383.0, + 1715.0, + 383.0, + 1735.0, + 356.0, + 1735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 1731.0, + 847.0, + 1731.0, + 847.0, + 1744.0, + 827.0, + 1744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 1751.0, + 358.0, + 1751.0, + 358.0, + 1825.0, + 335.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 1761.0, + 1027.0, + 1761.0, + 1027.0, + 1846.0, + 909.0, + 1846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1183.0, + 1768.0, + 1275.0, + 1768.0, + 1275.0, + 1791.0, + 1183.0, + 1791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1123.0, + 1782.0, + 1180.0, + 1782.0, + 1180.0, + 1800.0, + 1123.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1791.0, + 385.0, + 1791.0, + 385.0, + 1818.0, + 355.0, + 1818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1121.0, + 1796.0, + 1178.0, + 1796.0, + 1178.0, + 1814.0, + 1121.0, + 1814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 418.0, + 1805.0, + 434.0, + 1805.0, + 434.0, + 1821.0, + 418.0, + 1821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1816.0, + 425.0, + 1816.0, + 425.0, + 1842.0, + 395.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 1833.0, + 385.0, + 1833.0, + 385.0, + 1853.0, + 358.0, + 1853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 1839.0, + 397.0, + 1839.0, + 397.0, + 1853.0, + 385.0, + 1853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 1876.0, + 385.0, + 1876.0, + 385.0, + 1890.0, + 371.0, + 1890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 1892.0, + 440.0, + 1892.0, + 440.0, + 1914.0, + 371.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1899.0, + 473.0, + 1899.0, + 473.0, + 1911.0, + 450.0, + 1911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 491.0, + 1899.0, + 512.0, + 1899.0, + 512.0, + 1911.0, + 491.0, + 1911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 525.0, + 1895.0, + 555.0, + 1895.0, + 555.0, + 1913.0, + 525.0, + 1913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 560.0, + 1895.0, + 590.0, + 1895.0, + 590.0, + 1913.0, + 560.0, + 1913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 629.0, + 1893.0, + 694.0, + 1893.0, + 694.0, + 1913.0, + 629.0, + 1913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 702.0, + 1893.0, + 733.0, + 1893.0, + 733.0, + 1913.0, + 702.0, + 1913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 744.0, + 1895.0, + 774.0, + 1895.0, + 774.0, + 1913.0, + 744.0, + 1913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 781.0, + 1893.0, + 810.0, + 1893.0, + 810.0, + 1913.0, + 781.0, + 1913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 1893.0, + 847.0, + 1893.0, + 847.0, + 1913.0, + 820.0, + 1913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 882.0, + 1892.0, + 995.0, + 1892.0, + 995.0, + 1914.0, + 882.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 1895.0, + 1029.0, + 1895.0, + 1029.0, + 1913.0, + 997.0, + 1913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1036.0, + 1892.0, + 1105.0, + 1892.0, + 1105.0, + 1928.0, + 1036.0, + 1928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.0, + 1907.0, + 523.0, + 1907.0, + 523.0, + 1930.0, + 440.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 556.0, + 1906.0, + 585.0, + 1906.0, + 585.0, + 1925.0, + 556.0, + 1925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 1907.0, + 779.0, + 1907.0, + 779.0, + 1930.0, + 696.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 1906.0, + 840.0, + 1906.0, + 840.0, + 1925.0, + 811.0, + 1925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 951.0, + 1907.0, + 1034.0, + 1907.0, + 1034.0, + 1930.0, + 951.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 1144.5, + 672.0, + 1144.5, + 672.0, + 1167.5, + 618.0, + 1167.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 652.0, + 1230.0, + 807.0, + 1230.0, + 807.0, + 1278.0, + 652.0, + 1278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 963.0, + 1260.5, + 1074.0, + 1260.5, + 1074.0, + 1296.5, + 963.0, + 1296.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 656.25, + 1277.5, + 807.25, + 1277.5, + 807.25, + 1349.5, + 656.25, + 1349.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1330.0, + 1439.0, + 1356.0, + 1439.0, + 1356.0, + 1460.5, + 1330.0, + 1460.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 707.25, + 1568.5, + 821.25, + 1568.5, + 821.25, + 1606.5, + 707.25, + 1606.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.75, + 1756.0, + 370.75, + 1756.0, + 370.75, + 1772.5, + 367.75, + 1772.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 1752.5, + 1189.0, + 1752.5, + 1189.0, + 1775.5, + 1115.0, + 1775.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1119.0, + 1768.0, + 1178.0, + 1768.0, + 1178.0, + 1786.0, + 1119.0, + 1786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 246.0, + 1404.0, + 246.0, + 1404.0, + 285.0, + 295.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 278.0, + 779.0, + 278.0, + 779.0, + 312.0, + 295.0, + 312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 845.0, + 278.0, + 1402.0, + 278.0, + 1402.0, + 312.0, + 845.0, + 312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 308.0, + 1406.0, + 308.0, + 1406.0, + 347.0, + 294.0, + 347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 340.0, + 414.0, + 340.0, + 414.0, + 375.0, + 294.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 871.0, + 2085.0, + 871.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.887 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2113, + 836, + 2113 + ], + "score": 0.817 + }, + { + "category_id": 0, + "poly": [ + 300, + 228, + 489, + 228, + 489, + 261, + 300, + 261 + ], + "score": 0.797 + }, + { + "category_id": 1, + "poly": [ + 300, + 280, + 1401, + 280, + 1401, + 373, + 300, + 373 + ], + "score": 0.71 + }, + { + "category_id": 1, + "poly": [ + 295, + 744, + 1362, + 744, + 1362, + 780, + 295, + 780 + ], + "score": 0.7 + }, + { + "category_id": 1, + "poly": [ + 292, + 975, + 1399, + 975, + 1399, + 1040, + 292, + 1040 + ], + "score": 0.696 + }, + { + "category_id": 1, + "poly": [ + 295, + 801, + 1400, + 801, + 1400, + 866, + 295, + 866 + ], + "score": 0.695 + }, + { + "category_id": 1, + "poly": [ + 291, + 888, + 1400, + 888, + 1400, + 953, + 291, + 953 + ], + "score": 0.668 + }, + { + "category_id": 1, + "poly": [ + 295, + 1531, + 1402, + 1531, + 1402, + 1597, + 295, + 1597 + ], + "score": 0.632 + }, + { + "category_id": 1, + "poly": [ + 299, + 1326, + 1399, + 1326, + 1399, + 1421, + 299, + 1421 + ], + "score": 0.626 + }, + { + "category_id": 1, + "poly": [ + 297, + 658, + 1398, + 658, + 1398, + 722, + 297, + 722 + ], + "score": 0.616 + }, + { + "category_id": 1, + "poly": [ + 298, + 1618, + 1403, + 1618, + 1403, + 1714, + 298, + 1714 + ], + "score": 0.604 + }, + { + "category_id": 1, + "poly": [ + 297, + 483, + 1399, + 483, + 1399, + 548, + 297, + 548 + ], + "score": 0.601 + }, + { + "category_id": 1, + "poly": [ + 294, + 1735, + 1403, + 1735, + 1403, + 1801, + 294, + 1801 + ], + "score": 0.601 + }, + { + "category_id": 1, + "poly": [ + 295, + 1239, + 1400, + 1239, + 1400, + 1305, + 295, + 1305 + ], + "score": 0.594 + }, + { + "category_id": 1, + "poly": [ + 298, + 570, + 1401, + 570, + 1401, + 636, + 298, + 636 + ], + "score": 0.584 + }, + { + "category_id": 1, + "poly": [ + 291, + 1444, + 1402, + 1444, + 1402, + 1509, + 291, + 1509 + ], + "score": 0.571 + }, + { + "category_id": 1, + "poly": [ + 300, + 1822, + 1403, + 1822, + 1403, + 1919, + 300, + 1919 + ], + "score": 0.556 + }, + { + "category_id": 1, + "poly": [ + 294, + 397, + 1401, + 397, + 1401, + 461, + 294, + 461 + ], + "score": 0.539 + }, + { + "category_id": 1, + "poly": [ + 296, + 1061, + 1404, + 1061, + 1404, + 1217, + 296, + 1217 + ], + "score": 0.503 + }, + { + "category_id": 1, + "poly": [ + 299, + 1942, + 1403, + 1942, + 1403, + 2034, + 299, + 2034 + ], + "score": 0.454 + }, + { + "category_id": 13, + "poly": [ + 1250, + 1157, + 1267, + 1157, + 1267, + 1181, + 1250, + 1181 + ], + "score": 0.26, + "latex": "=" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2125.0, + 832.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 227.0, + 491.0, + 227.0, + 491.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 276.0, + 1405.0, + 276.0, + 1405.0, + 318.0, + 294.0, + 318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 312.0, + 1405.0, + 312.0, + 1405.0, + 346.0, + 323.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 341.0, + 838.0, + 341.0, + 838.0, + 375.0, + 324.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 739.0, + 1362.0, + 739.0, + 1362.0, + 783.0, + 295.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 973.0, + 1403.0, + 973.0, + 1403.0, + 1013.0, + 294.0, + 1013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1005.0, + 967.0, + 1005.0, + 967.0, + 1040.0, + 322.0, + 1040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 799.0, + 1401.0, + 799.0, + 1401.0, + 837.0, + 294.0, + 837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 834.0, + 934.0, + 834.0, + 934.0, + 866.0, + 323.0, + 866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 883.0, + 1405.0, + 883.0, + 1405.0, + 928.0, + 291.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 919.0, + 800.0, + 919.0, + 800.0, + 953.0, + 322.0, + 953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1534.0, + 1403.0, + 1534.0, + 1403.0, + 1567.0, + 297.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1563.0, + 1367.0, + 1563.0, + 1367.0, + 1599.0, + 323.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1326.0, + 1404.0, + 1326.0, + 1404.0, + 1363.0, + 294.0, + 1363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1360.0, + 1404.0, + 1360.0, + 1404.0, + 1394.0, + 324.0, + 1394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1389.0, + 453.0, + 1389.0, + 453.0, + 1421.0, + 324.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 657.0, + 1402.0, + 657.0, + 1402.0, + 695.0, + 296.0, + 695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 687.0, + 1055.0, + 687.0, + 1055.0, + 723.0, + 323.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1616.0, + 1404.0, + 1616.0, + 1404.0, + 1657.0, + 293.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1650.0, + 1404.0, + 1650.0, + 1404.0, + 1687.0, + 321.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1683.0, + 815.0, + 1683.0, + 815.0, + 1714.0, + 323.0, + 1714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 482.0, + 1401.0, + 482.0, + 1401.0, + 521.0, + 295.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 516.0, + 800.0, + 516.0, + 800.0, + 549.0, + 321.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1734.0, + 1404.0, + 1734.0, + 1404.0, + 1774.0, + 294.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1768.0, + 982.0, + 1768.0, + 982.0, + 1802.0, + 323.0, + 1802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1240.0, + 1404.0, + 1240.0, + 1404.0, + 1276.0, + 296.0, + 1276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1272.0, + 891.0, + 1272.0, + 891.0, + 1304.0, + 323.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 571.0, + 1405.0, + 571.0, + 1405.0, + 608.0, + 293.0, + 608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 604.0, + 1403.0, + 604.0, + 1403.0, + 637.0, + 326.0, + 637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1446.0, + 1404.0, + 1446.0, + 1404.0, + 1482.0, + 295.0, + 1482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1475.0, + 1036.0, + 1475.0, + 1036.0, + 1510.0, + 322.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1820.0, + 1404.0, + 1820.0, + 1404.0, + 1862.0, + 293.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1855.0, + 1405.0, + 1855.0, + 1405.0, + 1890.0, + 320.0, + 1890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1885.0, + 889.0, + 1885.0, + 889.0, + 1920.0, + 324.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 397.0, + 1404.0, + 397.0, + 1404.0, + 433.0, + 296.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 428.0, + 1399.0, + 428.0, + 1399.0, + 464.0, + 323.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1058.0, + 1405.0, + 1058.0, + 1405.0, + 1100.0, + 295.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1092.0, + 1404.0, + 1092.0, + 1404.0, + 1128.0, + 322.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1124.0, + 1402.0, + 1124.0, + 1402.0, + 1158.0, + 320.0, + 1158.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1151.0, + 1249.0, + 1151.0, + 1249.0, + 1190.0, + 319.0, + 1190.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 1151.0, + 1404.0, + 1151.0, + 1404.0, + 1190.0, + 1268.0, + 1190.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1186.0, + 454.0, + 1186.0, + 454.0, + 1216.0, + 324.0, + 1216.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1939.0, + 1404.0, + 1939.0, + 1404.0, + 1978.0, + 293.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1974.0, + 1404.0, + 1974.0, + 1404.0, + 2007.0, + 323.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 2004.0, + 942.0, + 2004.0, + 942.0, + 2036.0, + 323.0, + 2036.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.884 + }, + { + "category_id": 1, + "poly": [ + 297, + 229, + 1404, + 229, + 1404, + 383, + 297, + 383 + ], + "score": 0.871 + }, + { + "category_id": 1, + "poly": [ + 301, + 579, + 1403, + 579, + 1403, + 643, + 301, + 643 + ], + "score": 0.844 + }, + { + "category_id": 1, + "poly": [ + 296, + 666, + 1402, + 666, + 1402, + 730, + 296, + 730 + ], + "score": 0.843 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.835 + }, + { + "category_id": 1, + "poly": [ + 299, + 407, + 1401, + 407, + 1401, + 471, + 299, + 471 + ], + "score": 0.835 + }, + { + "category_id": 1, + "poly": [ + 298, + 492, + 1403, + 492, + 1403, + 558, + 298, + 558 + ], + "score": 0.806 + }, + { + "category_id": 1, + "poly": [ + 297, + 1477, + 1399, + 1477, + 1399, + 1543, + 297, + 1543 + ], + "score": 0.8 + }, + { + "category_id": 1, + "poly": [ + 298, + 1768, + 1401, + 1768, + 1401, + 1861, + 298, + 1861 + ], + "score": 0.783 + }, + { + "category_id": 1, + "poly": [ + 294, + 751, + 1402, + 751, + 1402, + 818, + 294, + 818 + ], + "score": 0.777 + }, + { + "category_id": 1, + "poly": [ + 299, + 1971, + 1398, + 1971, + 1398, + 2033, + 299, + 2033 + ], + "score": 0.769 + }, + { + "category_id": 1, + "poly": [ + 295, + 1680, + 1402, + 1680, + 1402, + 1746, + 295, + 1746 + ], + "score": 0.756 + }, + { + "category_id": 1, + "poly": [ + 298, + 953, + 1404, + 953, + 1404, + 1050, + 298, + 1050 + ], + "score": 0.754 + }, + { + "category_id": 1, + "poly": [ + 302, + 837, + 1401, + 837, + 1401, + 933, + 302, + 933 + ], + "score": 0.753 + }, + { + "category_id": 1, + "poly": [ + 293, + 1885, + 1403, + 1885, + 1403, + 1948, + 293, + 1948 + ], + "score": 0.752 + }, + { + "category_id": 1, + "poly": [ + 294, + 1188, + 1401, + 1188, + 1401, + 1254, + 294, + 1254 + ], + "score": 0.742 + }, + { + "category_id": 1, + "poly": [ + 297, + 1391, + 1400, + 1391, + 1400, + 1456, + 297, + 1456 + ], + "score": 0.734 + }, + { + "category_id": 1, + "poly": [ + 300, + 1274, + 1403, + 1274, + 1403, + 1371, + 300, + 1371 + ], + "score": 0.723 + }, + { + "category_id": 1, + "poly": [ + 298, + 1564, + 1405, + 1564, + 1405, + 1659, + 298, + 1659 + ], + "score": 0.698 + }, + { + "category_id": 1, + "poly": [ + 299, + 1072, + 1405, + 1072, + 1405, + 1167, + 299, + 1167 + ], + "score": 0.663 + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 1405.0, + 227.0, + 1405.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 258.0, + 1405.0, + 258.0, + 1405.0, + 297.0, + 321.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 289.0, + 1402.0, + 289.0, + 1402.0, + 329.0, + 322.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 321.0, + 1346.0, + 321.0, + 1346.0, + 358.0, + 321.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 354.0, + 390.0, + 354.0, + 390.0, + 385.0, + 318.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 579.0, + 1404.0, + 579.0, + 1404.0, + 615.0, + 295.0, + 615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 610.0, + 806.0, + 610.0, + 806.0, + 646.0, + 322.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 666.0, + 1406.0, + 666.0, + 1406.0, + 702.0, + 295.0, + 702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 697.0, + 908.0, + 697.0, + 908.0, + 731.0, + 323.0, + 731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 407.0, + 1405.0, + 407.0, + 1405.0, + 443.0, + 295.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 439.0, + 1405.0, + 439.0, + 1405.0, + 475.0, + 324.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 490.0, + 1407.0, + 490.0, + 1407.0, + 532.0, + 292.0, + 532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 525.0, + 1094.0, + 525.0, + 1094.0, + 559.0, + 322.0, + 559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1475.0, + 1404.0, + 1475.0, + 1404.0, + 1518.0, + 293.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1511.0, + 1016.0, + 1511.0, + 1016.0, + 1544.0, + 322.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1767.0, + 1406.0, + 1767.0, + 1406.0, + 1805.0, + 296.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1800.0, + 1405.0, + 1800.0, + 1405.0, + 1834.0, + 322.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1825.0, + 398.0, + 1825.0, + 398.0, + 1866.0, + 321.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 751.0, + 1405.0, + 751.0, + 1405.0, + 791.0, + 294.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 783.0, + 1110.0, + 783.0, + 1110.0, + 818.0, + 322.0, + 818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1968.0, + 1406.0, + 1968.0, + 1406.0, + 2010.0, + 292.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 2001.0, + 410.0, + 2001.0, + 410.0, + 2035.0, + 321.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1675.0, + 1407.0, + 1675.0, + 1407.0, + 1722.0, + 294.0, + 1722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1713.0, + 1375.0, + 1713.0, + 1375.0, + 1749.0, + 323.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 956.0, + 1402.0, + 956.0, + 1402.0, + 990.0, + 297.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 985.0, + 1406.0, + 985.0, + 1406.0, + 1024.0, + 322.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1018.0, + 1225.0, + 1018.0, + 1225.0, + 1053.0, + 322.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 835.0, + 1406.0, + 835.0, + 1406.0, + 876.0, + 296.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 869.0, + 1404.0, + 869.0, + 1404.0, + 906.0, + 322.0, + 906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 901.0, + 1020.0, + 901.0, + 1020.0, + 935.0, + 323.0, + 935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1882.0, + 1405.0, + 1882.0, + 1405.0, + 1924.0, + 292.0, + 1924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1917.0, + 1215.0, + 1917.0, + 1215.0, + 1952.0, + 324.0, + 1952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1186.0, + 1403.0, + 1186.0, + 1403.0, + 1227.0, + 294.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1218.0, + 1260.0, + 1218.0, + 1260.0, + 1255.0, + 324.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1389.0, + 1406.0, + 1389.0, + 1406.0, + 1431.0, + 293.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1422.0, + 1323.0, + 1422.0, + 1323.0, + 1457.0, + 322.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1276.0, + 1403.0, + 1276.0, + 1403.0, + 1310.0, + 295.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1308.0, + 1405.0, + 1308.0, + 1405.0, + 1342.0, + 323.0, + 1342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1337.0, + 1098.0, + 1337.0, + 1098.0, + 1372.0, + 325.0, + 1372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1564.0, + 1403.0, + 1564.0, + 1403.0, + 1601.0, + 295.0, + 1601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1594.0, + 1403.0, + 1594.0, + 1403.0, + 1632.0, + 322.0, + 1632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1626.0, + 506.0, + 1626.0, + 506.0, + 1660.0, + 324.0, + 1660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1070.0, + 1405.0, + 1070.0, + 1405.0, + 1110.0, + 294.0, + 1110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1100.0, + 1406.0, + 1100.0, + 1406.0, + 1140.0, + 321.0, + 1140.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1135.0, + 1161.0, + 1135.0, + 1161.0, + 1169.0, + 324.0, + 1169.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.838 + }, + { + "category_id": 1, + "poly": [ + 296, + 1726, + 1402, + 1726, + 1402, + 1792, + 296, + 1792 + ], + "score": 0.824 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1399, + 229, + 1399, + 324, + 299, + 324 + ], + "score": 0.796 + }, + { + "category_id": 1, + "poly": [ + 301, + 1498, + 1402, + 1498, + 1402, + 1594, + 301, + 1594 + ], + "score": 0.786 + }, + { + "category_id": 1, + "poly": [ + 298, + 1386, + 1401, + 1386, + 1401, + 1480, + 298, + 1480 + ], + "score": 0.764 + }, + { + "category_id": 1, + "poly": [ + 298, + 1271, + 1399, + 1271, + 1399, + 1366, + 298, + 1366 + ], + "score": 0.738 + }, + { + "category_id": 1, + "poly": [ + 295, + 538, + 1398, + 538, + 1398, + 603, + 295, + 603 + ], + "score": 0.738 + }, + { + "category_id": 1, + "poly": [ + 298, + 736, + 1405, + 736, + 1405, + 829, + 298, + 829 + ], + "score": 0.737 + }, + { + "category_id": 1, + "poly": [ + 296, + 621, + 1405, + 621, + 1405, + 716, + 296, + 716 + ], + "score": 0.727 + }, + { + "category_id": 1, + "poly": [ + 298, + 849, + 1404, + 849, + 1404, + 942, + 298, + 942 + ], + "score": 0.707 + }, + { + "category_id": 1, + "poly": [ + 293, + 343, + 1401, + 343, + 1401, + 406, + 293, + 406 + ], + "score": 0.704 + }, + { + "category_id": 1, + "poly": [ + 297, + 425, + 1402, + 425, + 1402, + 520, + 297, + 520 + ], + "score": 0.7 + }, + { + "category_id": 1, + "poly": [ + 298, + 961, + 1404, + 961, + 1404, + 1058, + 298, + 1058 + ], + "score": 0.672 + }, + { + "category_id": 1, + "poly": [ + 296, + 1075, + 1401, + 1075, + 1401, + 1141, + 296, + 1141 + ], + "score": 0.661 + }, + { + "category_id": 1, + "poly": [ + 300, + 1159, + 1400, + 1159, + 1400, + 1253, + 300, + 1253 + ], + "score": 0.655 + }, + { + "category_id": 1, + "poly": [ + 297, + 1612, + 1404, + 1612, + 1404, + 1708, + 297, + 1708 + ], + "score": 0.625 + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1723.0, + 1404.0, + 1723.0, + 1404.0, + 1764.0, + 294.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1758.0, + 948.0, + 1758.0, + 948.0, + 1791.0, + 321.0, + 1791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 228.0, + 1403.0, + 228.0, + 1403.0, + 264.0, + 295.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 262.0, + 1403.0, + 262.0, + 1403.0, + 296.0, + 323.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 289.0, + 413.0, + 289.0, + 413.0, + 325.0, + 320.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1496.0, + 1403.0, + 1496.0, + 1403.0, + 1539.0, + 294.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1531.0, + 1404.0, + 1531.0, + 1404.0, + 1566.0, + 324.0, + 1566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1562.0, + 947.0, + 1562.0, + 947.0, + 1596.0, + 326.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1386.0, + 1405.0, + 1386.0, + 1405.0, + 1423.0, + 294.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1417.0, + 1403.0, + 1417.0, + 1403.0, + 1451.0, + 323.0, + 1451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1449.0, + 624.0, + 1449.0, + 624.0, + 1479.0, + 323.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1271.0, + 1404.0, + 1271.0, + 1404.0, + 1308.0, + 294.0, + 1308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1301.0, + 1403.0, + 1301.0, + 1403.0, + 1340.0, + 322.0, + 1340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1336.0, + 638.0, + 1336.0, + 638.0, + 1367.0, + 323.0, + 1367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 533.0, + 1404.0, + 533.0, + 1404.0, + 580.0, + 293.0, + 580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 571.0, + 783.0, + 571.0, + 783.0, + 603.0, + 323.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 737.0, + 1402.0, + 737.0, + 1402.0, + 770.0, + 296.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 767.0, + 1403.0, + 767.0, + 1403.0, + 803.0, + 321.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 795.0, + 399.0, + 795.0, + 399.0, + 831.0, + 320.0, + 831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 619.0, + 1405.0, + 619.0, + 1405.0, + 660.0, + 291.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 651.0, + 1403.0, + 651.0, + 1403.0, + 689.0, + 322.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 683.0, + 507.0, + 683.0, + 507.0, + 717.0, + 323.0, + 717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 848.0, + 1402.0, + 848.0, + 1402.0, + 886.0, + 293.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 877.0, + 1404.0, + 877.0, + 1404.0, + 918.0, + 320.0, + 918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 911.0, + 504.0, + 911.0, + 504.0, + 943.0, + 323.0, + 943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 343.0, + 1406.0, + 343.0, + 1406.0, + 378.0, + 295.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 375.0, + 853.0, + 375.0, + 853.0, + 406.0, + 324.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 424.0, + 1406.0, + 424.0, + 1406.0, + 463.0, + 292.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 457.0, + 1406.0, + 457.0, + 1406.0, + 494.0, + 322.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 488.0, + 491.0, + 488.0, + 491.0, + 520.0, + 324.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 964.0, + 1401.0, + 964.0, + 1401.0, + 995.0, + 298.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 993.0, + 1404.0, + 993.0, + 1404.0, + 1028.0, + 323.0, + 1028.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1024.0, + 1342.0, + 1024.0, + 1342.0, + 1059.0, + 323.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1072.0, + 1405.0, + 1072.0, + 1405.0, + 1117.0, + 293.0, + 1117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1107.0, + 1314.0, + 1107.0, + 1314.0, + 1143.0, + 321.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1156.0, + 1405.0, + 1156.0, + 1405.0, + 1196.0, + 293.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1187.0, + 1405.0, + 1187.0, + 1405.0, + 1227.0, + 320.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1221.0, + 669.0, + 1221.0, + 669.0, + 1256.0, + 322.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1612.0, + 1402.0, + 1612.0, + 1402.0, + 1648.0, + 296.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1644.0, + 1402.0, + 1644.0, + 1402.0, + 1678.0, + 322.0, + 1678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1671.0, + 465.0, + 1671.0, + 465.0, + 1709.0, + 320.0, + 1709.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 590, + 1060, + 1106, + 1060, + 1106, + 1138, + 590, + 1138 + ], + "score": 0.956 + }, + { + "category_id": 8, + "poly": [ + 576, + 1358, + 1121, + 1358, + 1121, + 1432, + 576, + 1432 + ], + "score": 0.956 + }, + { + "category_id": 8, + "poly": [ + 617, + 1208, + 1083, + 1208, + 1083, + 1286, + 617, + 1286 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 294, + 1466, + 1401, + 1466, + 1401, + 1531, + 294, + 1531 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 294, + 335, + 1403, + 335, + 1403, + 401, + 294, + 401 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 639, + 583, + 1060, + 583, + 1060, + 655, + 639, + 655 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 293, + 1543, + 1400, + 1543, + 1400, + 1609, + 293, + 1609 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 297, + 497, + 1400, + 497, + 1400, + 564, + 297, + 564 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 559, + 919, + 1139, + 919, + 1139, + 979, + 559, + 979 + ], + "score": 0.947 + }, + { + "category_id": 8, + "poly": [ + 530, + 793, + 1165, + 793, + 1165, + 852, + 530, + 852 + ], + "score": 0.946 + }, + { + "category_id": 0, + "poly": [ + 296, + 225, + 1307, + 225, + 1307, + 302, + 296, + 302 + ], + "score": 0.942 + }, + { + "category_id": 1, + "poly": [ + 296, + 1303, + 1200, + 1303, + 1200, + 1341, + 296, + 1341 + ], + "score": 0.936 + }, + { + "category_id": 1, + "poly": [ + 297, + 1010, + 1113, + 1010, + 1113, + 1044, + 297, + 1044 + ], + "score": 0.933 + }, + { + "category_id": 8, + "poly": [ + 467, + 1698, + 1180, + 1698, + 1180, + 1770, + 467, + 1770 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 297, + 1158, + 731, + 1158, + 731, + 1190, + 297, + 1190 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 298, + 867, + 902, + 867, + 902, + 902, + 298, + 902 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 298, + 672, + 451, + 672, + 451, + 704, + 298, + 704 + ], + "score": 0.923 + }, + { + "category_id": 1, + "poly": [ + 288, + 2000, + 1285, + 2000, + 1285, + 2037, + 288, + 2037 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 297, + 740, + 1168, + 740, + 1168, + 776, + 297, + 776 + ], + "score": 0.921 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 816, + 73, + 816, + 106, + 298, + 106 + ], + "score": 0.914 + }, + { + "category_id": 8, + "poly": [ + 487, + 1908, + 1076, + 1908, + 1076, + 1966, + 487, + 1966 + ], + "score": 0.913 + }, + { + "category_id": 0, + "poly": [ + 298, + 439, + 899, + 439, + 899, + 473, + 298, + 473 + ], + "score": 0.889 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1713, + 1400, + 1713, + 1400, + 1744, + 1352, + 1744 + ], + "score": 0.88 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1790, + 1401, + 1790, + 1401, + 1821, + 1351, + 1821 + ], + "score": 0.876 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1866, + 1401, + 1866, + 1401, + 1897, + 1351, + 1897 + ], + "score": 0.876 + }, + { + "category_id": 8, + "poly": [ + 466, + 1858, + 1228, + 1858, + 1228, + 1903, + 466, + 1903 + ], + "score": 0.875 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2113, + 836, + 2113 + ], + "score": 0.874 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1918, + 1401, + 1918, + 1401, + 1949, + 1351, + 1949 + ], + "score": 0.874 + }, + { + "category_id": 8, + "poly": [ + 487, + 1778, + 1128, + 1778, + 1128, + 1844, + 487, + 1844 + ], + "score": 0.872 + }, + { + "category_id": 1, + "poly": [ + 294, + 1617, + 1397, + 1617, + 1397, + 1682, + 294, + 1682 + ], + "score": 0.749 + }, + { + "category_id": 14, + "poly": [ + 464, + 1697, + 1227, + 1697, + 1227, + 1970, + 464, + 1970 + ], + "score": 0.95, + "latex": "\\begin{array} { r c l } { { V _ { \\alpha } ^ { \\pi , q } ( x ) } } & { { = } } & { { \\displaystyle \\sum _ { a } q ( a | x ) \\Big [ r _ { \\alpha } ^ { \\pi , q } ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } \\big [ V _ { \\alpha } ^ { \\pi , q } ( y ) \\big ] \\Big ] } } \\\\ { { } } & { { } } & { { } } \\\\ { { V ^ { q } ( x ) } } & { { = } } & { { \\displaystyle \\sum _ { a } q ( a | x ) \\Big [ r ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } \\big [ V ^ { q } ( y ) \\big ] \\Big ] } } \\\\ { { } } & { { } } & { { } } \\\\ { { V _ { \\alpha } ^ { \\pi , * } ( x ) } } & { { = } } & { { \\displaystyle r _ { \\alpha } ^ { \\pi , q _ { \\alpha } ^ { \\pi , * } } ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } \\big [ V _ { \\alpha } ^ { \\pi , * } ( y ) \\big ] f o r a l l a \\in A , } } \\\\ { { } } & { { } } & { { } } \\\\ { { V ^ { * } ( x ) } } & { { = } } & { { \\displaystyle \\operatorname* { m a x } _ { a \\in A } \\Big [ r ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } \\big [ V ^ { * } ( y ) \\big ] \\Big ] . } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 616, + 1207, + 1081, + 1207, + 1081, + 1289, + 616, + 1289 + ], + "score": 0.94, + "latex": "V ^ { q } ( x ) = \\mathbb { E } _ { q } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } r ( x _ { t } , a _ { t } ) | x _ { 0 } = x , q \\Big ] ." + }, + { + "category_id": 14, + "poly": [ + 590, + 1059, + 1108, + 1059, + 1108, + 1141, + 590, + 1141 + ], + "score": 0.93, + "latex": "V _ { \\alpha } ^ { \\pi , q } ( \\boldsymbol { x } ) = \\mathbb { E } _ { q } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } r _ { \\alpha } ^ { \\pi , q } ( \\boldsymbol { x } _ { t } , a _ { t } ) | \\boldsymbol { x } _ { 0 } = \\boldsymbol { x } , q \\Big ] ." + }, + { + "category_id": 13, + "poly": [ + 298, + 530, + 451, + 530, + 451, + 564, + 298, + 564 + ], + "score": 0.93, + "latex": "\\{ q ( a | x ) > 0 \\}" + }, + { + "category_id": 14, + "poly": [ + 575, + 1356, + 1122, + 1356, + 1122, + 1433, + 575, + 1433 + ], + "score": 0.93, + "latex": "\\mathbb { E } _ { q } \\Big [ \\log \\frac { q \\big ( a _ { t } | x _ { t } \\big ) } { \\pi \\big ( a _ { t } | x _ { t } \\big ) } \\Big ] = K L \\big ( q ( \\cdot | x _ { t } ) \\| \\pi ( \\cdot | x _ { t } ) \\big ) \\geq 0 ." + }, + { + "category_id": 13, + "poly": [ + 1102, + 2002, + 1222, + 2002, + 1222, + 2036, + 1102, + 2036 + ], + "score": 0.93, + "latex": "a \\sim q ( \\cdot | x )" + }, + { + "category_id": 14, + "poly": [ + 640, + 580, + 1057, + 580, + 1057, + 656, + 640, + 656 + ], + "score": 0.93, + "latex": "r _ { \\alpha } ^ { \\pi , q } ( x , a ) = r ( x , a ) - \\alpha \\log \\frac { q ( a | x ) } { \\pi ( a | x ) } ," + }, + { + "category_id": 13, + "poly": [ + 298, + 1498, + 460, + 1498, + 460, + 1532, + 298, + 1532 + ], + "score": 0.93, + "latex": "\\operatorname* { m a x } _ { q } V _ { \\alpha } ^ { \\pi , q } ( x )" + }, + { + "category_id": 14, + "poly": [ + 558, + 917, + 1139, + 917, + 1139, + 978, + 558, + 978 + ], + "score": 0.92, + "latex": "T ^ { q } V ( x ) = \\mathbb { E } _ { a \\sim q ( \\cdot | x ) } \\Big [ r ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } V ( y ) \\Big ] ." + }, + { + "category_id": 13, + "poly": [ + 1026, + 1497, + 1278, + 1497, + 1278, + 1532, + 1026, + 1532 + ], + "score": 0.92, + "latex": "V ^ { * } ( x ) = \\operatorname* { m a x } _ { q } V ^ { q } ( x )" + }, + { + "category_id": 13, + "poly": [ + 756, + 1306, + 884, + 1306, + 884, + 1340, + 756, + 1340 + ], + "score": 0.92, + "latex": "V _ { \\alpha } ^ { \\pi , q } \\leq V ^ { q }" + }, + { + "category_id": 13, + "poly": [ + 937, + 1307, + 1105, + 1307, + 1105, + 1340, + 937, + 1340 + ], + "score": 0.91, + "latex": "T _ { \\alpha } ^ { \\pi , q } V \\le T ^ { q } V" + }, + { + "category_id": 13, + "poly": [ + 622, + 1619, + 679, + 1619, + 679, + 1652, + 622, + 1652 + ], + "score": 0.91, + "latex": "V _ { \\alpha } ^ { \\pi , q }" + }, + { + "category_id": 13, + "poly": [ + 861, + 1544, + 1213, + 1544, + 1213, + 1578, + 861, + 1578 + ], + "score": 0.91, + "latex": "q _ { \\alpha } ^ { \\pi , * } ( \\cdot | x ) = \\arg \\operatorname* { m a x } _ { q } V _ { \\alpha } ^ { \\pi , q } ( x )" + }, + { + "category_id": 13, + "poly": [ + 569, + 1308, + 646, + 1308, + 646, + 1339, + 569, + 1339 + ], + "score": 0.91, + "latex": "q , \\pi , V" + }, + { + "category_id": 13, + "poly": [ + 725, + 1576, + 989, + 1576, + 989, + 1610, + 725, + 1610 + ], + "score": 0.91, + "latex": "q ^ { * } ( \\cdot | x ) = \\arg \\operatorname* { m a x } _ { q } V ^ { q }" + }, + { + "category_id": 14, + "poly": [ + 533, + 792, + 1163, + 792, + 1163, + 852, + 533, + 852 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { T _ { \\alpha } ^ { \\pi , q } V ( x ) = \\mathbb { E } _ { a \\sim q ( \\cdot | x ) } \\Big [ r _ { \\alpha } ^ { \\pi , q } ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } V ( y ) \\Big ] , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1271, + 1467, + 1404, + 1467, + 1404, + 1501, + 1271, + 1501 + ], + "score": 0.89, + "latex": "V _ { \\alpha } ^ { \\pi , * } ( x ) =" + }, + { + "category_id": 13, + "poly": [ + 707, + 2008, + 776, + 2008, + 776, + 2031, + 707, + 2031 + ], + "score": 0.89, + "latex": "a \\in A" + }, + { + "category_id": 13, + "poly": [ + 980, + 1620, + 1034, + 1620, + 1034, + 1651, + 980, + 1651 + ], + "score": 0.89, + "latex": "T _ { \\alpha } ^ { \\pi , q }" + }, + { + "category_id": 13, + "poly": [ + 372, + 675, + 443, + 675, + 443, + 701, + 372, + 701 + ], + "score": 0.89, + "latex": "\\alpha > 0" + }, + { + "category_id": 13, + "poly": [ + 990, + 1651, + 1066, + 1651, + 1066, + 1677, + 990, + 1677 + ], + "score": 0.89, + "latex": "x \\in X" + }, + { + "category_id": 13, + "poly": [ + 1095, + 1620, + 1131, + 1620, + 1131, + 1646, + 1095, + 1646 + ], + "score": 0.85, + "latex": "V ^ { q }" + }, + { + "category_id": 13, + "poly": [ + 1103, + 498, + 1405, + 498, + 1405, + 534, + 1103, + 534 + ], + "score": 0.84, + "latex": "x , a , \\{ \\pi ( a | x ) > 0 \\} \\implies" + }, + { + "category_id": 13, + "poly": [ + 326, + 1650, + 360, + 1650, + 360, + 1676, + 326, + 1676 + ], + "score": 0.82, + "latex": "T ^ { q }" + }, + { + "category_id": 13, + "poly": [ + 660, + 373, + 677, + 373, + 677, + 400, + 660, + 400 + ], + "score": 0.82, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 1109, + 369, + 1126, + 369, + 1126, + 395, + 1109, + 395 + ], + "score": 0.82, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 933, + 537, + 949, + 537, + 949, + 563, + 933, + 563 + ], + "score": 0.8, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 1066, + 1019, + 1082, + 1019, + 1082, + 1044, + 1066, + 1044 + ], + "score": 0.79, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 880, + 506, + 898, + 506, + 898, + 532, + 880, + 532 + ], + "score": 0.79, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 628, + 1018, + 647, + 1018, + 647, + 1038, + 628, + 1038 + ], + "score": 0.79, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 578, + 535, + 598, + 535, + 598, + 558, + 578, + 558 + ], + "score": 0.78, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 675, + 748, + 694, + 748, + 694, + 770, + 675, + 770 + ], + "score": 0.78, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 598, + 1550, + 619, + 1550, + 619, + 1572, + 598, + 1572 + ], + "score": 0.76, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 590, + 373, + 610, + 373, + 610, + 395, + 590, + 395 + ], + "score": 0.76, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 343, + 505, + 365, + 505, + 365, + 527, + 343, + 527 + ], + "score": 0.75, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 882, + 876, + 899, + 876, + 899, + 901, + 882, + 901 + ], + "score": 0.75, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 1147, + 749, + 1164, + 749, + 1164, + 775, + 1147, + 775 + ], + "score": 0.74, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 1102, + 502, + 1148, + 502, + 1148, + 531, + 1102, + 531 + ], + "score": 0.25, + "latex": "x , a" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 226.0, + 1310.0, + 226.0, + 1310.0, + 267.0, + 292.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 270.0, + 865.0, + 270.0, + 865.0, + 304.0, + 352.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 818.0, + 72.0, + 818.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 440.0, + 898.0, + 440.0, + 898.0, + 476.0, + 296.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1459.0, + 1270.0, + 1459.0, + 1270.0, + 1506.0, + 293.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1405.0, + 1459.0, + 1408.0, + 1459.0, + 1408.0, + 1506.0, + 1405.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1493.0, + 297.0, + 1493.0, + 297.0, + 1537.0, + 293.0, + 1537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 461.0, + 1493.0, + 1025.0, + 1493.0, + 1025.0, + 1537.0, + 461.0, + 1537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1279.0, + 1493.0, + 1291.0, + 1493.0, + 1291.0, + 1537.0, + 1279.0, + 1537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 337.0, + 1404.0, + 337.0, + 1404.0, + 373.0, + 294.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 367.0, + 589.0, + 367.0, + 589.0, + 403.0, + 296.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 611.0, + 367.0, + 659.0, + 367.0, + 659.0, + 403.0, + 611.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 367.0, + 1108.0, + 367.0, + 1108.0, + 403.0, + 678.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 367.0, + 1323.0, + 367.0, + 1323.0, + 403.0, + 1127.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1538.0, + 597.0, + 1538.0, + 597.0, + 1586.0, + 292.0, + 1586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 620.0, + 1538.0, + 860.0, + 1538.0, + 860.0, + 1586.0, + 620.0, + 1586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.0, + 1538.0, + 1407.0, + 1538.0, + 1407.0, + 1586.0, + 1214.0, + 1586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1573.0, + 724.0, + 1573.0, + 724.0, + 1611.0, + 292.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 1573.0, + 1001.0, + 1573.0, + 1001.0, + 1611.0, + 990.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 495.0, + 342.0, + 495.0, + 342.0, + 536.0, + 292.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 495.0, + 879.0, + 495.0, + 879.0, + 536.0, + 366.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 495.0, + 1101.0, + 495.0, + 1101.0, + 536.0, + 899.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 452.0, + 527.0, + 577.0, + 527.0, + 577.0, + 570.0, + 452.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 527.0, + 932.0, + 527.0, + 932.0, + 570.0, + 599.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 950.0, + 527.0, + 963.0, + 527.0, + 963.0, + 570.0, + 950.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1299.0, + 568.0, + 1299.0, + 568.0, + 1347.0, + 292.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 647.0, + 1299.0, + 755.0, + 1299.0, + 755.0, + 1347.0, + 647.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 1299.0, + 936.0, + 1299.0, + 936.0, + 1347.0, + 885.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 1299.0, + 1205.0, + 1299.0, + 1205.0, + 1347.0, + 1106.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1005.0, + 627.0, + 1005.0, + 627.0, + 1051.0, + 294.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 1005.0, + 1065.0, + 1005.0, + 1065.0, + 1051.0, + 648.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 1005.0, + 1118.0, + 1005.0, + 1118.0, + 1051.0, + 1083.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1157.0, + 732.0, + 1157.0, + 732.0, + 1192.0, + 294.0, + 1192.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 861.0, + 881.0, + 861.0, + 881.0, + 913.0, + 291.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 861.0, + 904.0, + 861.0, + 904.0, + 913.0, + 900.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 670.0, + 371.0, + 670.0, + 371.0, + 707.0, + 295.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 444.0, + 670.0, + 455.0, + 670.0, + 455.0, + 707.0, + 444.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1994.0, + 706.0, + 1994.0, + 706.0, + 2042.0, + 291.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 777.0, + 1994.0, + 1101.0, + 1994.0, + 1101.0, + 2042.0, + 777.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 1994.0, + 1289.0, + 1994.0, + 1289.0, + 2042.0, + 1223.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 735.0, + 674.0, + 735.0, + 674.0, + 786.0, + 292.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 695.0, + 735.0, + 1146.0, + 735.0, + 1146.0, + 786.0, + 695.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1165.0, + 735.0, + 1168.0, + 735.0, + 1168.0, + 786.0, + 1165.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1610.0, + 621.0, + 1610.0, + 621.0, + 1666.0, + 289.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 1610.0, + 979.0, + 1610.0, + 979.0, + 1666.0, + 680.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1035.0, + 1610.0, + 1094.0, + 1610.0, + 1094.0, + 1666.0, + 1035.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1132.0, + 1610.0, + 1408.0, + 1610.0, + 1408.0, + 1666.0, + 1132.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1648.0, + 325.0, + 1648.0, + 325.0, + 1684.0, + 295.0, + 1684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 1648.0, + 989.0, + 1648.0, + 989.0, + 1684.0, + 361.0, + 1684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 1648.0, + 1079.0, + 1648.0, + 1079.0, + 1684.0, + 1067.0, + 1684.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 395, + 1392, + 1404, + 1392, + 1404, + 1549, + 395, + 1549 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 285, + 1403, + 285, + 1403, + 380, + 297, + 380 + ], + "score": 0.961 + }, + { + "category_id": 8, + "poly": [ + 650, + 1896, + 1049, + 1896, + 1049, + 1946, + 650, + 1946 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 565, + 1287, + 1227, + 1287, + 1227, + 1365, + 565, + 1365 + ], + "score": 0.947 + }, + { + "category_id": 1, + "poly": [ + 294, + 494, + 1405, + 494, + 1405, + 558, + 294, + 558 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 395, + 1627, + 1306, + 1627, + 1306, + 1726, + 395, + 1726 + ], + "score": 0.945 + }, + { + "category_id": 8, + "poly": [ + 399, + 389, + 1296, + 389, + 1296, + 467, + 399, + 467 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 298, + 1824, + 1400, + 1824, + 1400, + 1889, + 298, + 1889 + ], + "score": 0.943 + }, + { + "category_id": 8, + "poly": [ + 527, + 711, + 1267, + 711, + 1267, + 788, + 527, + 788 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 297, + 1735, + 1061, + 1735, + 1061, + 1769, + 297, + 1769 + ], + "score": 0.939 + }, + { + "category_id": 8, + "poly": [ + 603, + 1776, + 1095, + 1776, + 1095, + 1816, + 603, + 1816 + ], + "score": 0.936 + }, + { + "category_id": 1, + "poly": [ + 395, + 1216, + 1400, + 1216, + 1400, + 1278, + 395, + 1278 + ], + "score": 0.936 + }, + { + "category_id": 8, + "poly": [ + 816, + 1067, + 980, + 1067, + 980, + 1109, + 816, + 1109 + ], + "score": 0.93 + }, + { + "category_id": 8, + "poly": [ + 708, + 1169, + 1089, + 1169, + 1089, + 1209, + 708, + 1209 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 297, + 2001, + 942, + 2001, + 942, + 2037, + 297, + 2037 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 370, + 1127, + 760, + 1127, + 760, + 1159, + 370, + 1159 + ], + "score": 0.917 + }, + { + "category_id": 1, + "poly": [ + 298, + 1955, + 508, + 1955, + 508, + 1987, + 298, + 1987 + ], + "score": 0.916 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 816, + 73, + 816, + 106, + 298, + 106 + ], + "score": 0.915 + }, + { + "category_id": 1, + "poly": [ + 369, + 851, + 648, + 851, + 648, + 885, + 369, + 885 + ], + "score": 0.913 + }, + { + "category_id": 1, + "poly": [ + 297, + 1581, + 480, + 1581, + 480, + 1614, + 297, + 1614 + ], + "score": 0.909 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1072, + 1400, + 1072, + 1400, + 1103, + 1352, + 1103 + ], + "score": 0.904 + }, + { + "category_id": 1, + "poly": [ + 369, + 1041, + 495, + 1041, + 495, + 1073, + 369, + 1073 + ], + "score": 0.902 + }, + { + "category_id": 9, + "poly": [ + 1351, + 919, + 1401, + 919, + 1401, + 951, + 1351, + 951 + ], + "score": 0.9 + }, + { + "category_id": 1, + "poly": [ + 369, + 580, + 579, + 580, + 579, + 614, + 369, + 614 + ], + "score": 0.899 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1171, + 1400, + 1171, + 1400, + 1203, + 1351, + 1203 + ], + "score": 0.891 + }, + { + "category_id": 9, + "poly": [ + 1351, + 725, + 1401, + 725, + 1401, + 757, + 1351, + 757 + ], + "score": 0.891 + }, + { + "category_id": 1, + "poly": [ + 369, + 669, + 564, + 669, + 564, + 703, + 369, + 703 + ], + "score": 0.889 + }, + { + "category_id": 1, + "poly": [ + 296, + 794, + 853, + 794, + 853, + 828, + 296, + 828 + ], + "score": 0.888 + }, + { + "category_id": 8, + "poly": [ + 750, + 605, + 1047, + 605, + 1047, + 659, + 750, + 659 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.878 + }, + { + "category_id": 1, + "poly": [ + 395, + 988, + 940, + 988, + 940, + 1027, + 395, + 1027 + ], + "score": 0.755 + }, + { + "category_id": 0, + "poly": [ + 299, + 229, + 848, + 229, + 848, + 262, + 299, + 262 + ], + "score": 0.693 + }, + { + "category_id": 8, + "poly": [ + 702, + 894, + 1095, + 894, + 1095, + 980, + 702, + 980 + ], + "score": 0.497 + }, + { + "category_id": 8, + "poly": [ + 391, + 896, + 1096, + 896, + 1096, + 1027, + 391, + 1027 + ], + "score": 0.375 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 848, + 229, + 848, + 262, + 299, + 262 + ], + "score": 0.138 + }, + { + "category_id": 14, + "poly": [ + 703, + 893, + 1094, + 893, + 1094, + 980, + 703, + 980 + ], + "score": 0.95, + "latex": "q _ { i } ( a | x ) = \\frac { \\pi _ { i } ( a | x ) e ^ { \\frac { 1 } { \\alpha } Q ^ { \\pi _ { i } } ( x , a ) } } { \\mathbb { E } _ { b \\sim \\pi _ { i } ( \\cdot | x ) } \\big [ e ^ { \\frac { 1 } { \\alpha } Q ^ { \\pi _ { i } } ( x , b ) } \\big ] } ," + }, + { + "category_id": 14, + "poly": [ + 568, + 1286, + 1229, + 1286, + 1229, + 1368, + 568, + 1368 + ], + "score": 0.94, + "latex": "g _ { i } = \\Big \\| \\nabla _ { \\theta } \\mathbb { E } _ { \\pi _ { i } } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } K L \\big ( q _ { i } ( \\cdot | x _ { t } ) \\| \\pi _ { \\theta } ( \\cdot | x _ { t } ) \\big ) _ { | \\theta = \\theta _ { i } } \\big | x _ { 0 } , \\pi _ { i } \\Big ] \\Big \\| ." + }, + { + "category_id": 14, + "poly": [ + 648, + 1896, + 1048, + 1896, + 1048, + 1947, + 648, + 1947 + ], + "score": 0.94, + "latex": "V _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } = \\operatorname* { l i m } _ { t \\to \\infty } ( T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } ) ^ { t } V ^ { \\pi _ { i } } \\geq V ^ { \\pi _ { i } } ," + }, + { + "category_id": 13, + "poly": [ + 1073, + 1395, + 1177, + 1395, + 1177, + 1428, + 1073, + 1428 + ], + "score": 0.93, + "latex": "\\mathcal { I } ( \\theta _ { i } , q _ { i } )" + }, + { + "category_id": 14, + "poly": [ + 748, + 604, + 1047, + 604, + 1047, + 661, + 748, + 661 + ], + "score": 0.93, + "latex": "q _ { i } = \\arg \\operatorname* { m a x } _ { q } T _ { \\alpha } ^ { \\pi _ { \\theta _ { i } } , q } V ^ { \\pi _ { \\theta _ { i } } } ," + }, + { + "category_id": 14, + "poly": [ + 396, + 1625, + 1302, + 1625, + 1302, + 1727, + 396, + 1727 + ], + "score": 0.93, + "latex": "\\begin{array} { r l r } { q _ { i } ( \\cdot | x ) } & { = } & { \\arg \\underset { q } { \\operatorname* { m a x } } \\mathbb { E } _ { a \\sim q ( \\cdot | x ) } \\Big [ \\underset { Q ^ { \\pi _ { i } } ( x , a ) } { \\underbrace { r \\big ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } V ^ { \\pi _ { i } } ( y ) } } - \\alpha \\log \\frac { q \\big ( a | x \\big ) } { \\pi _ { i } \\big ( a | x \\big ) } \\Big ] , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 604, + 1779, + 1092, + 1779, + 1092, + 1816, + 604, + 1816 + ], + "score": 0.93, + "latex": "T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } V ^ { \\pi _ { i } } \\geq T _ { \\alpha } ^ { \\pi _ { i } , \\pi _ { i } } V ^ { \\pi _ { i } } = T ^ { \\pi _ { i } } V ^ { \\pi _ { i } } = V ^ { \\pi _ { i } } ." + }, + { + "category_id": 14, + "poly": [ + 528, + 711, + 1268, + 711, + 1268, + 792, + 528, + 792 + ], + "score": 0.92, + "latex": "\\theta _ { i + 1 } = \\theta _ { i } - \\beta \\nabla _ { \\theta } \\mathbb { E } _ { \\pi _ { i } } \\left[ \\sum _ { t \\geq 0 } \\gamma ^ { t } \\mathrm { K L } \\big ( q _ { k } ( \\cdot | x _ { t } ) | | \\pi _ { \\theta } ( \\cdot | x _ { t } ) \\big ) _ { | \\theta = \\theta _ { i } } \\big | x _ { 0 } , \\pi _ { i } \\right] ." + }, + { + "category_id": 14, + "poly": [ + 401, + 388, + 1296, + 388, + 1296, + 470, + 401, + 470 + ], + "score": 0.92, + "latex": "\\mathcal { I } ( \\theta , q ) = V ^ { \\pi _ { \\theta } , q } ( \\boldsymbol { x } _ { 0 } ) = \\mathbb { E } _ { q } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } \\big ( r ( \\boldsymbol { x } _ { t } , a _ { t } ) - \\alpha \\mathrm { K L } ( q ( \\cdot | \\boldsymbol { x } _ { t } ) | | \\pi _ { \\theta } ( \\cdot | \\boldsymbol { x } _ { t } ) ) \\big ) \\big | \\boldsymbol { x } _ { 0 } , q \\Big ] ." + }, + { + "category_id": 13, + "poly": [ + 819, + 1395, + 911, + 1395, + 911, + 1428, + 819, + 1428 + ], + "score": 0.92, + "latex": "( \\pi _ { \\theta _ { i } } , q _ { i } )" + }, + { + "category_id": 13, + "poly": [ + 529, + 1858, + 600, + 1858, + 600, + 1890, + 529, + 1890 + ], + "score": 0.92, + "latex": "V _ { \\alpha } ^ { \\pi _ { i } , q _ { i } }" + }, + { + "category_id": 13, + "poly": [ + 843, + 1826, + 942, + 1826, + 942, + 1857, + 843, + 1857 + ], + "score": 0.92, + "latex": "V _ { 1 } \\geq V _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1155, + 1825, + 1399, + 1825, + 1399, + 1859, + 1155, + 1859 + ], + "score": 0.92, + "latex": "T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } V _ { 1 } \\geq T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } V _ { 2 } )" + }, + { + "category_id": 14, + "poly": [ + 816, + 1071, + 983, + 1071, + 983, + 1107, + 816, + 1107 + ], + "score": 0.92, + "latex": "V _ { \\alpha } ^ { \\pi _ { i } , q _ { i } } \\geq V ^ { \\pi _ { i } } ." + }, + { + "category_id": 14, + "poly": [ + 710, + 1168, + 1087, + 1168, + 1087, + 1207, + 710, + 1207 + ], + "score": 0.91, + "latex": "\\mathcal { I } ( \\theta _ { i + 1 } , q _ { i + 1 } ) \\geq \\mathcal { I } ( \\theta _ { i } , q _ { i } ) + c g _ { i } ," + }, + { + "category_id": 13, + "poly": [ + 478, + 672, + 530, + 672, + 530, + 703, + 478, + 703 + ], + "score": 0.91, + "latex": "\\theta _ { i + 1 }" + }, + { + "category_id": 13, + "poly": [ + 427, + 1827, + 498, + 1827, + 498, + 1859, + 427, + 1859 + ], + "score": 0.91, + "latex": "T _ { \\alpha } ^ { \\pi _ { i } , q _ { i } }" + }, + { + "category_id": 13, + "poly": [ + 1077, + 502, + 1177, + 502, + 1177, + 528, + 1077, + 528 + ], + "score": 0.91, + "latex": "\\pi _ { i } = \\pi _ { \\theta _ { i } }" + }, + { + "category_id": 13, + "poly": [ + 472, + 988, + 938, + 988, + 938, + 1026, + 472, + 1026 + ], + "score": 0.9, + "latex": "Q ^ { \\pi } ( x , a ) = r ( x , a ) + \\gamma \\mathbb { E } _ { y \\sim p ( \\cdot | x , a ) } V ^ { \\pi } ( y ) ." + }, + { + "category_id": 13, + "poly": [ + 673, + 497, + 702, + 497, + 702, + 526, + 673, + 526 + ], + "score": 0.89, + "latex": "\\theta _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 757, + 294, + 789, + 294, + 789, + 318, + 757, + 318 + ], + "score": 0.86, + "latex": "\\pi _ { \\theta }" + }, + { + "category_id": 13, + "poly": [ + 470, + 583, + 495, + 583, + 495, + 612, + 470, + 612 + ], + "score": 0.86, + "latex": "\\theta _ { i }" + }, + { + "category_id": 13, + "poly": [ + 820, + 323, + 853, + 323, + 853, + 350, + 820, + 350 + ], + "score": 0.85, + "latex": "x _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 929, + 1743, + 952, + 1743, + 952, + 1768, + 929, + 1768 + ], + "score": 0.85, + "latex": "q _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1369, + 497, + 1393, + 497, + 1393, + 526, + 1369, + 526 + ], + "score": 0.85, + "latex": "\\theta _ { i }" + }, + { + "category_id": 13, + "poly": [ + 837, + 1221, + 862, + 1221, + 862, + 1249, + 837, + 1249 + ], + "score": 0.84, + "latex": "g _ { i }" + }, + { + "category_id": 13, + "poly": [ + 520, + 857, + 544, + 857, + 544, + 884, + 520, + 884 + ], + "score": 0.81, + "latex": "q _ { i }" + }, + { + "category_id": 13, + "poly": [ + 675, + 350, + 692, + 350, + 692, + 375, + 675, + 375 + ], + "score": 0.81, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 1384, + 1431, + 1401, + 1431, + 1401, + 1453, + 1384, + 1453 + ], + "score": 0.51, + "latex": "a" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 818.0, + 72.0, + 818.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 230.0, + 851.0, + 230.0, + 851.0, + 265.0, + 296.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1392.0, + 818.0, + 1392.0, + 818.0, + 1431.0, + 395.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 912.0, + 1392.0, + 1072.0, + 1392.0, + 1072.0, + 1431.0, + 912.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1178.0, + 1392.0, + 1404.0, + 1392.0, + 1404.0, + 1431.0, + 1178.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1423.0, + 1383.0, + 1423.0, + 1383.0, + 1461.0, + 392.0, + 1461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1423.0, + 1407.0, + 1423.0, + 1407.0, + 1461.0, + 1402.0, + 1461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1457.0, + 1403.0, + 1457.0, + 1403.0, + 1489.0, + 392.0, + 1489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1485.0, + 1403.0, + 1485.0, + 1403.0, + 1522.0, + 392.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1516.0, + 485.0, + 1516.0, + 485.0, + 1551.0, + 392.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 284.0, + 756.0, + 284.0, + 756.0, + 324.0, + 295.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 284.0, + 1404.0, + 284.0, + 1404.0, + 324.0, + 790.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 319.0, + 819.0, + 319.0, + 819.0, + 353.0, + 296.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 854.0, + 319.0, + 1405.0, + 319.0, + 1405.0, + 353.0, + 854.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 347.0, + 674.0, + 347.0, + 674.0, + 382.0, + 294.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 693.0, + 347.0, + 972.0, + 347.0, + 972.0, + 382.0, + 693.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 491.0, + 672.0, + 491.0, + 672.0, + 531.0, + 293.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 491.0, + 1076.0, + 491.0, + 1076.0, + 531.0, + 703.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1178.0, + 491.0, + 1368.0, + 491.0, + 1368.0, + 531.0, + 1178.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 491.0, + 1405.0, + 491.0, + 1405.0, + 531.0, + 1394.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 522.0, + 542.0, + 522.0, + 542.0, + 562.0, + 292.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1815.0, + 426.0, + 1815.0, + 426.0, + 1893.0, + 288.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1815.0, + 528.0, + 1815.0, + 528.0, + 1893.0, + 499.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 1815.0, + 842.0, + 1815.0, + 842.0, + 1893.0, + 601.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 943.0, + 1815.0, + 1154.0, + 1815.0, + 1154.0, + 1893.0, + 943.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1400.0, + 1815.0, + 1409.0, + 1815.0, + 1409.0, + 1893.0, + 1400.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1731.0, + 928.0, + 1731.0, + 928.0, + 1773.0, + 294.0, + 1773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 953.0, + 1731.0, + 1061.0, + 1731.0, + 1061.0, + 1773.0, + 953.0, + 1773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1212.0, + 836.0, + 1212.0, + 836.0, + 1252.0, + 393.0, + 1252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 1212.0, + 1404.0, + 1212.0, + 1404.0, + 1252.0, + 863.0, + 1252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1242.0, + 533.0, + 1242.0, + 533.0, + 1282.0, + 392.0, + 1282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1997.0, + 942.0, + 1997.0, + 942.0, + 2041.0, + 294.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1127.0, + 761.0, + 1127.0, + 761.0, + 1163.0, + 369.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1951.0, + 512.0, + 1951.0, + 512.0, + 1994.0, + 295.0, + 1994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 845.0, + 519.0, + 845.0, + 519.0, + 891.0, + 366.0, + 891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 845.0, + 653.0, + 845.0, + 653.0, + 891.0, + 545.0, + 891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1579.0, + 482.0, + 1579.0, + 482.0, + 1618.0, + 293.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 1037.0, + 497.0, + 1037.0, + 497.0, + 1075.0, + 367.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 574.0, + 469.0, + 574.0, + 469.0, + 618.0, + 367.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 496.0, + 574.0, + 583.0, + 574.0, + 583.0, + 618.0, + 496.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 664.0, + 477.0, + 664.0, + 477.0, + 707.0, + 366.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 531.0, + 664.0, + 567.0, + 664.0, + 567.0, + 707.0, + 531.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 789.0, + 855.0, + 789.0, + 855.0, + 836.0, + 293.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 980.0, + 471.0, + 980.0, + 471.0, + 1035.0, + 391.0, + 1035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 939.0, + 980.0, + 945.0, + 980.0, + 945.0, + 1035.0, + 939.0, + 1035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 230.0, + 851.0, + 230.0, + 851.0, + 265.0, + 296.0, + 265.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 14, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 372, + 654, + 1327, + 654, + 1327, + 826, + 372, + 826 + ], + "score": 0.962 + }, + { + "category_id": 8, + "poly": [ + 320, + 1833, + 1566, + 1833, + 1566, + 2040, + 320, + 2040 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 522, + 385, + 1123, + 385, + 1123, + 461, + 522, + 461 + ], + "score": 0.947 + }, + { + "category_id": 8, + "poly": [ + 320, + 1496, + 1430, + 1496, + 1430, + 1709, + 320, + 1709 + ], + "score": 0.947 + }, + { + "category_id": 8, + "poly": [ + 534, + 915, + 1162, + 915, + 1162, + 995, + 534, + 995 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 296, + 1761, + 1403, + 1761, + 1403, + 1826, + 296, + 1826 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 295, + 1457, + 1177, + 1457, + 1177, + 1491, + 295, + 1491 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 298, + 550, + 659, + 550, + 659, + 592, + 298, + 592 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 298, + 1358, + 454, + 1358, + 454, + 1390, + 298, + 1390 + ], + "score": 0.918 + }, + { + "category_id": 1, + "poly": [ + 287, + 469, + 1309, + 469, + 1309, + 505, + 287, + 505 + ], + "score": 0.917 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 816, + 73, + 816, + 106, + 298, + 106 + ], + "score": 0.917 + }, + { + "category_id": 8, + "poly": [ + 334, + 1053, + 1391, + 1053, + 1391, + 1337, + 334, + 1337 + ], + "score": 0.917 + }, + { + "category_id": 8, + "poly": [ + 645, + 510, + 1055, + 510, + 1055, + 548, + 645, + 548 + ], + "score": 0.914 + }, + { + "category_id": 1, + "poly": [ + 299, + 347, + 748, + 347, + 748, + 380, + 299, + 380 + ], + "score": 0.91 + }, + { + "category_id": 1, + "poly": [ + 297, + 617, + 577, + 617, + 577, + 650, + 297, + 650 + ], + "score": 0.9 + }, + { + "category_id": 1, + "poly": [ + 297, + 1014, + 425, + 1014, + 425, + 1044, + 297, + 1044 + ], + "score": 0.878 + }, + { + "category_id": 9, + "poly": [ + 1350, + 1399, + 1402, + 1399, + 1402, + 1431, + 1350, + 1431 + ], + "score": 0.877 + }, + { + "category_id": 9, + "poly": [ + 1350, + 512, + 1402, + 512, + 1402, + 543, + 1350, + 543 + ], + "score": 0.877 + }, + { + "category_id": 1, + "poly": [ + 297, + 878, + 691, + 878, + 691, + 910, + 297, + 910 + ], + "score": 0.853 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 866, + 2087, + 866, + 2114, + 836, + 2114 + ], + "score": 0.846 + }, + { + "category_id": 1, + "poly": [ + 302, + 831, + 1272, + 831, + 1272, + 865, + 302, + 865 + ], + "score": 0.831 + }, + { + "category_id": 1, + "poly": [ + 296, + 228, + 933, + 228, + 933, + 263, + 296, + 263 + ], + "score": 0.777 + }, + { + "category_id": 8, + "poly": [ + 296, + 266, + 1430, + 266, + 1430, + 333, + 296, + 333 + ], + "score": 0.761 + }, + { + "category_id": 8, + "poly": [ + 495, + 1392, + 1201, + 1392, + 1201, + 1438, + 495, + 1438 + ], + "score": 0.589 + }, + { + "category_id": 9, + "poly": [ + 1351, + 305, + 1401, + 305, + 1401, + 332, + 1351, + 332 + ], + "score": 0.57 + }, + { + "category_id": 8, + "poly": [ + 493, + 1392, + 1201, + 1392, + 1201, + 1438, + 493, + 1438 + ], + "score": 0.508 + }, + { + "category_id": 8, + "poly": [ + 637, + 1304, + 1138, + 1304, + 1138, + 1338, + 637, + 1338 + ], + "score": 0.224 + }, + { + "category_id": 14, + "poly": [ + 368, + 653, + 1329, + 653, + 1329, + 828, + 368, + 828 + ], + "score": 0.93, + "latex": "\\begin{array} { r c l } { \\mathcal { F } ( \\pi , q , \\theta , \\pi ^ { \\prime } ) } & { = } & { \\displaystyle \\mathbb { E } _ { \\pi } \\left[ \\sum _ { t \\geq 0 } \\gamma ^ { t } \\big ( \\mathbb { E } _ { a \\sim q } \\big [ Q ^ { \\pi ^ { \\prime } } ( x _ { t } , a ) \\big ] - \\alpha \\mathrm { K L } \\big ( q ( \\cdot | x _ { t } ) \\| \\pi _ { \\theta } ( \\cdot | x _ { t } ) \\big ) \\big ) \\big | x _ { 0 } , \\pi \\right] } \\\\ & { = } & { \\displaystyle \\delta _ { x _ { 0 } } \\big ( I - \\gamma P ^ { \\pi } \\big ) ^ { - 1 } T _ { \\alpha } ^ { \\pi _ { \\theta } , q } V ^ { \\pi ^ { \\prime } } } \\\\ & { = } & { \\delta _ { x _ { 0 } } \\big ( I - \\gamma P ^ { \\pi } \\big ) ^ { - 1 } T ^ { q } V ^ { \\pi ^ { \\prime } } - f ( \\pi , q , \\theta ) , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 316, + 1504, + 1426, + 1504, + 1426, + 1711, + 316, + 1711 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { ( I - \\gamma P ) ^ { - 1 } } \\\\ { = } & { ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } + \\gamma ( I - \\gamma P ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } } \\\\ { = } & { ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } + \\gamma \\big [ ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } + \\gamma ( I - \\gamma P ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } \\big ] ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } } \\\\ { = } & { ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } + \\gamma ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } } \\\\ & { + \\gamma ^ { 2 } ( I - \\gamma P ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } ( P - P ^ { \\prime } ) ( I - \\gamma P ^ { \\prime } ) ^ { - 1 } . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 326, + 1048, + 1387, + 1048, + 1387, + 1290, + 326, + 1290 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\mathcal { F } ( \\pi _ { i } , q _ { i + 1 } , \\theta _ { i + 1 } , \\pi _ { i } ) } \\\\ { \\geq } & { \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i } ) + \\beta g _ { i } } \\\\ & { + \\mathcal { F } ( \\pi _ { i } , q _ { i + 1 } , \\theta _ { i + 1 } , \\pi _ { i } ) - \\mathcal { F } ( \\pi _ { i } , q _ { i + 1 } , \\theta _ { i + 1 } , \\pi _ { i + 1 } ) + \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i + 1 } ) - \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i } ) } \\\\ { = } & { \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i } ) + \\beta g _ { i } + } \\\\ & { \\mathbb { E } _ { \\pi _ { i } } \\Big [ \\displaystyle \\sum _ { t \\geq 0 } \\gamma ^ { t } \\big ( \\mathbb { E } _ { a \\sim q _ { i + 1 } } \\big [ Q ^ { \\pi _ { i } } ( x _ { t } , a ) - Q ^ { \\pi _ { i + 1 } } ( x _ { t } , a ) \\big ] - \\mathbb { E } _ { a \\sim q _ { i } } \\big [ Q ^ { \\pi _ { i } } ( x _ { t } , a ) - Q ^ { \\pi _ { i + 1 } } ( x _ { t } , a ) \\big ] \\big ) \\Big ] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 372, + 550, + 649, + 550, + 649, + 592, + 372, + 592 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { g _ { i } = \\frac { 1 } { 2 } \\| \\nabla _ { \\theta } f ( \\pi _ { i } , q _ { i } , \\theta _ { i } ) \\| } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 519, + 384, + 1119, + 384, + 1119, + 464, + 519, + 464 + ], + "score": 0.92, + "latex": "f ( \\pi , q , \\theta ) = \\mathbb { E } _ { \\pi } \\Big [ \\sum _ { t \\geq 0 } \\gamma ^ { t } \\mathrm { K L } \\big ( q ( \\cdot | x _ { t } ) \\| \\pi _ { \\theta } ( \\cdot | x _ { t } ) \\big ) \\big | x _ { 0 } , \\pi \\Big ] ," + }, + { + "category_id": 13, + "poly": [ + 494, + 471, + 824, + 471, + 824, + 505, + 494, + 505 + ], + "score": 0.92, + "latex": "\\theta _ { i + 1 } = \\theta _ { i } - \\beta \\nabla _ { \\theta } f ( \\pi _ { i } , q _ { i } , \\theta _ { i } )" + }, + { + "category_id": 14, + "poly": [ + 535, + 914, + 1166, + 914, + 1166, + 995, + 535, + 995 + ], + "score": 0.92, + "latex": "\\begin{array} { r c l } { \\mathcal { F } ( \\pi _ { i } , q _ { i + 1 } , \\theta _ { i + 1 } , \\pi _ { i + 1 } ) } & { \\geq } & { \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i + 1 } , \\pi _ { i + 1 } ) } \\\\ & { \\geq } & { \\mathcal { F } ( \\pi _ { i } , q _ { i } , \\theta _ { i } , \\pi _ { i + 1 } ) + \\beta g _ { i } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1119, + 1763, + 1393, + 1763, + 1393, + 1798, + 1119, + 1798 + ], + "score": 0.92, + "latex": "\\lVert P ^ { \\pi _ { k + 1 } } - P ^ { \\pi _ { k } } \\rVert = O ( \\eta )" + }, + { + "category_id": 13, + "poly": [ + 372, + 832, + 410, + 832, + 410, + 865, + 372, + 865 + ], + "score": 0.91, + "latex": "\\delta _ { x _ { 0 } }" + }, + { + "category_id": 14, + "poly": [ + 318, + 1829, + 1428, + 1829, + 1428, + 2046, + 318, + 2046 + ], + "score": 0.9, + "latex": "\\begin{array} { r l } & { V _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } } \\\\ { = } & { ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } } \\\\ { = } & { ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } + \\gamma ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } ( P ^ { \\pi _ { i + 1 } } - P ^ { \\pi _ { i } } ) ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } + O ( \\beta ^ { 2 } ) } \\\\ { = } & { ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } + ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } ( r _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } - r _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } + \\gamma P ^ { \\pi _ { i + 1 } } - \\gamma P ^ { \\pi _ { i } } ) ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } r _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } } \\\\ { = } & { V _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } + ( I - \\gamma P ^ { \\pi _ { i } } ) ^ { - 1 } ( T _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i } + 1 } V ^ { \\pi _ { i } } - T _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } V ^ { \\pi _ { k } } ) + O ( \\beta ^ { 2 } ) . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 497, + 1392, + 1205, + 1392, + 1205, + 1436, + 497, + 1436 + ], + "score": 0.89, + "latex": "\\delta _ { x _ { 0 } } ( I - \\gamma ^ { \\pi _ { i } } ) ^ { - 1 } \\big ( T _ { \\alpha } ^ { q _ { i + 1 } , \\pi _ { i + 1 } } V ^ { \\pi _ { i } } - T _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } V ^ { \\pi _ { i } } \\big ) \\geq \\eta g _ { i } + O ( \\beta ^ { 2 } ) ." + }, + { + "category_id": 13, + "poly": [ + 931, + 1766, + 1003, + 1766, + 1003, + 1792, + 931, + 1792 + ], + "score": 0.89, + "latex": "P ^ { \\pi _ { k + 1 } }" + }, + { + "category_id": 13, + "poly": [ + 787, + 1309, + 938, + 1309, + 938, + 1335, + 787, + 1335 + ], + "score": 0.89, + "latex": "\\pi _ { i } { = } \\pi _ { i + 1 } { + } O ( \\beta )" + }, + { + "category_id": 13, + "poly": [ + 830, + 1766, + 879, + 1766, + 879, + 1792, + 830, + 1792 + ], + "score": 0.88, + "latex": "P ^ { \\pi _ { k } }" + }, + { + "category_id": 13, + "poly": [ + 1035, + 1458, + 1066, + 1458, + 1066, + 1486, + 1035, + 1486 + ], + "score": 0.88, + "latex": "P ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 658, + 236, + 711, + 236, + 711, + 264, + 658, + 264 + ], + "score": 0.87, + "latex": "q _ { i + 1 }" + }, + { + "category_id": 13, + "poly": [ + 989, + 1309, + 1136, + 1309, + 1136, + 1336, + 989, + 1336 + ], + "score": 0.87, + "latex": "q _ { i } = q _ { i + 1 } + O \\left( \\beta \\right)" + }, + { + "category_id": 13, + "poly": [ + 830, + 832, + 869, + 832, + 869, + 860, + 830, + 860 + ], + "score": 0.87, + "latex": "P ^ { \\pi }" + }, + { + "category_id": 13, + "poly": [ + 960, + 1460, + 985, + 1460, + 985, + 1486, + 960, + 1486 + ], + "score": 0.86, + "latex": "P" + }, + { + "category_id": 13, + "poly": [ + 542, + 620, + 567, + 620, + 567, + 646, + 542, + 646 + ], + "score": 0.84, + "latex": "\\mathcal { F }" + }, + { + "category_id": 14, + "poly": [ + 310, + 266, + 1428, + 266, + 1428, + 309, + 310, + 309 + ], + "score": 0.84, + "latex": "\\begin{array} { r } { \\tilde { \\Sigma } _ { a \\sim q _ { 4 } + 1 } \\left[ Q ^ { \\pi _ { i + 1 } } ( x , a ) \\right] - \\alpha \\mathbf { K L } \\left( q _ { i + 1 } ( \\cdot | x ) \\| \\pi _ { i + 1 } ( \\cdot | x ) \\right) \\geq \\mathbb { E } _ { a \\sim q _ { 4 } } \\left[ Q ^ { \\pi _ { i + 1 } } ( x , a ) \\right] - \\alpha \\mathbf { K L } \\left( q _ { i } ( \\cdot | x ) \\| \\pi _ { i + 1 } ( \\cdot | x ) \\right) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 732, + 836, + 764, + 836, + 764, + 862, + 732, + 862 + ], + "score": 0.84, + "latex": "x _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1283, + 475, + 1301, + 475, + 1301, + 504, + 1283, + 504 + ], + "score": 0.83, + "latex": "\\beta" + }, + { + "category_id": 14, + "poly": [ + 642, + 509, + 1055, + 509, + 1055, + 546, + 642, + 546 + ], + "score": 0.82, + "latex": "f ( \\pi _ { i } , q _ { i } , \\theta _ { i + 1 } ) \\leq f ( \\pi _ { i } , q _ { i } , \\theta _ { i } ) - \\beta g _ { i } ," + }, + { + "category_id": 13, + "poly": [ + 636, + 1308, + 718, + 1308, + 718, + 1335, + 636, + 1335 + ], + "score": 0.76, + "latex": "{ } = { \\cal O } ( \\beta ^ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 905, + 239, + 923, + 239, + 923, + 258, + 905, + 258 + ], + "score": 0.75, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 1246, + 839, + 1265, + 839, + 1265, + 859, + 1246, + 859 + ], + "score": 0.75, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 641, + 509, + 1054, + 509, + 1054, + 546, + 641, + 546 + ], + "score": 0.48, + "latex": "f ( \\pi _ { i } , q _ { i } , \\theta _ { i + 1 } ) \\leq f ( \\pi _ { i } , q _ { i } , \\theta _ { i } ) - \\beta g _ { i } ," + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 818.0, + 72.0, + 818.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1755.0, + 829.0, + 1755.0, + 829.0, + 1805.0, + 291.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 1755.0, + 930.0, + 1755.0, + 930.0, + 1805.0, + 880.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1004.0, + 1755.0, + 1118.0, + 1755.0, + 1118.0, + 1805.0, + 1004.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1755.0, + 1406.0, + 1755.0, + 1406.0, + 1805.0, + 1394.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1793.0, + 404.0, + 1793.0, + 404.0, + 1831.0, + 293.0, + 1831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1455.0, + 959.0, + 1455.0, + 959.0, + 1495.0, + 295.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 986.0, + 1455.0, + 1034.0, + 1455.0, + 1034.0, + 1495.0, + 986.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 1455.0, + 1176.0, + 1455.0, + 1176.0, + 1495.0, + 1067.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 544.0, + 371.0, + 544.0, + 371.0, + 597.0, + 293.0, + 597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 650.0, + 544.0, + 661.0, + 544.0, + 661.0, + 597.0, + 650.0, + 597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1354.0, + 457.0, + 1354.0, + 457.0, + 1394.0, + 294.0, + 1394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 466.0, + 493.0, + 466.0, + 493.0, + 510.0, + 292.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 825.0, + 466.0, + 1282.0, + 466.0, + 1282.0, + 510.0, + 825.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1302.0, + 466.0, + 1313.0, + 466.0, + 1313.0, + 510.0, + 1302.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 347.0, + 749.0, + 347.0, + 749.0, + 383.0, + 297.0, + 383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 614.0, + 541.0, + 614.0, + 541.0, + 654.0, + 292.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 614.0, + 580.0, + 614.0, + 580.0, + 654.0, + 568.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1009.0, + 427.0, + 1009.0, + 427.0, + 1049.0, + 294.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 876.0, + 692.0, + 876.0, + 692.0, + 913.0, + 295.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 828.0, + 371.0, + 828.0, + 371.0, + 869.0, + 296.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 411.0, + 828.0, + 731.0, + 828.0, + 731.0, + 869.0, + 411.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 828.0, + 829.0, + 828.0, + 829.0, + 869.0, + 765.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 828.0, + 1245.0, + 828.0, + 1245.0, + 869.0, + 870.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1266.0, + 828.0, + 1276.0, + 828.0, + 1276.0, + 869.0, + 1266.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 223.0, + 657.0, + 223.0, + 657.0, + 271.0, + 293.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 712.0, + 223.0, + 904.0, + 223.0, + 904.0, + 271.0, + 712.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 223.0, + 937.0, + 223.0, + 937.0, + 271.0, + 924.0, + 271.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 15, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1020, + 1404, + 1020, + 1404, + 1358, + 297, + 1358 + ], + "score": 0.985 + }, + { + "category_id": 5, + "poly": [ + 563, + 1630, + 1134, + 1630, + 1134, + 1884, + 563, + 1884 + ], + "score": 0.975, + "html": "
Hyperparametercontrol suitehumanoid
Policy net100-100200-200
Q function net200-200300-300
E0.11
Eμ0.1"
£0.0001"
Discount factor()0.991
Adam learning rate0.00051
" + }, + { + "category_id": 5, + "poly": [ + 402, + 318, + 1296, + 318, + 1296, + 544, + 402, + 544 + ], + "score": 0.975, + "html": "
Game/AgentHumanDQNPrior. DuelingC51MPO
19.520.9
Pong Breakout14.6 30.5385.5366.020.9 74820.9 360.5
13,455.013,117.318,760.323,784
Q*bert Tennis-8.312.20.023.110,317.0
98.922.2
Boxing12.188.097.882.0
" + }, + { + "category_id": 8, + "poly": [ + 335, + 664, + 1365, + 664, + 1365, + 853, + 335, + 853 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 300, + 1477, + 1402, + 1477, + 1402, + 1601, + 300, + 1601 + ], + "score": 0.957 + }, + { + "category_id": 6, + "poly": [ + 296, + 248, + 1398, + 248, + 1398, + 311, + 296, + 311 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 298, + 615, + 687, + 615, + 687, + 647, + 298, + 647 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 296, + 2001, + 1225, + 2001, + 1225, + 2035, + 296, + 2035 + ], + "score": 0.917 + }, + { + "category_id": 1, + "poly": [ + 299, + 871, + 517, + 871, + 517, + 903, + 299, + 903 + ], + "score": 0.909 + }, + { + "category_id": 0, + "poly": [ + 300, + 1407, + 675, + 1407, + 675, + 1442, + 300, + 1442 + ], + "score": 0.906 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 815, + 75, + 815, + 105, + 299, + 105 + ], + "score": 0.904 + }, + { + "category_id": 0, + "poly": [ + 298, + 948, + 1048, + 948, + 1048, + 985, + 298, + 985 + ], + "score": 0.897 + }, + { + "category_id": 6, + "poly": [ + 499, + 1917, + 1201, + 1917, + 1201, + 1951, + 499, + 1951 + ], + "score": 0.889 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 864, + 2087, + 864, + 2112, + 836, + 2112 + ], + "score": 0.866 + }, + { + "category_id": 2, + "poly": [ + 1374, + 870, + 1403, + 870, + 1403, + 900, + 1374, + 900 + ], + "score": 0.804 + }, + { + "category_id": 14, + "poly": [ + 331, + 663, + 1368, + 663, + 1368, + 858, + 331, + 858 + ], + "score": 0.94, + "latex": "\\begin{array} { l l l } { \\mathcal { I } ( \\theta _ { i + 1 } , q _ { i + 1 } ) } & { = } & { V _ { \\alpha } ^ { q _ { i } + 1 , \\pi _ { i } + 1 } \\big ( x _ { 0 } \\big ) } \\\\ & { = } & { V _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } \\big ( x _ { 0 } \\big ) + \\delta _ { x _ { 0 } } \\big ( I - \\gamma P ^ { \\pi _ { i } } \\big ) ^ { - 1 } \\big ( T _ { \\alpha } ^ { q _ { i } + 1 , \\pi _ { i + 1 } } V ^ { \\pi _ { i } } - T _ { \\alpha } ^ { q _ { i } , \\pi _ { i } } V ^ { \\pi _ { i } } \\big ) + O ( \\beta ^ { 2 } ) } \\\\ & { \\geq } & { \\mathcal { I } ( \\theta _ { i } , q _ { i } ) + \\eta g _ { i } + O ( \\beta ^ { 2 } ) } \\\\ & { \\geq } & { \\mathcal { I } ( \\theta _ { i } , q _ { i } ) + \\frac { 1 } { 2 } \\eta g _ { i } , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 492, + 877, + 509, + 877, + 509, + 903, + 492, + 903 + ], + "score": 0.79, + "latex": "\\eta" + }, + { + "category_id": 13, + "poly": [ + 675, + 1761, + 703, + 1761, + 703, + 1789, + 675, + 1789 + ], + "score": 0.72, + "latex": "\\epsilon _ { \\mu }" + }, + { + "category_id": 13, + "poly": [ + 674, + 1793, + 704, + 1793, + 704, + 1815, + 674, + 1815 + ], + "score": 0.43, + "latex": "\\epsilon _ { \\Sigma }" + }, + { + "category_id": 13, + "poly": [ + 760, + 1817, + 797, + 1817, + 797, + 1846, + 760, + 1846 + ], + "score": 0.29, + "latex": "( \\gamma )" + }, + { + "category_id": 13, + "poly": [ + 681, + 1730, + 698, + 1730, + 698, + 1751, + 681, + 1751 + ], + "score": 0.27, + "latex": "\\epsilon" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 248.0, + 1402.0, + 248.0, + 1402.0, + 283.0, + 296.0, + 283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 280.0, + 499.0, + 280.0, + 499.0, + 310.0, + 293.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1402.0, + 680.0, + 1402.0, + 680.0, + 1448.0, + 294.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 818.0, + 73.0, + 818.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 946.0, + 1054.0, + 946.0, + 1054.0, + 992.0, + 291.0, + 992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 1916.0, + 1201.0, + 1916.0, + 1201.0, + 1952.0, + 498.0, + 1952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 874.0, + 1403.0, + 874.0, + 1403.0, + 902.0, + 1377.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1020.0, + 1406.0, + 1020.0, + 1406.0, + 1057.0, + 294.0, + 1057.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1048.0, + 1406.0, + 1048.0, + 1406.0, + 1092.0, + 291.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1081.0, + 1407.0, + 1081.0, + 1407.0, + 1119.0, + 294.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1116.0, + 1402.0, + 1116.0, + 1402.0, + 1147.0, + 296.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1143.0, + 1405.0, + 1143.0, + 1405.0, + 1178.0, + 295.0, + 1178.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1177.0, + 1405.0, + 1177.0, + 1405.0, + 1208.0, + 296.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1204.0, + 1406.0, + 1204.0, + 1406.0, + 1238.0, + 294.0, + 1238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1234.0, + 1404.0, + 1234.0, + 1404.0, + 1267.0, + 294.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1265.0, + 1405.0, + 1265.0, + 1405.0, + 1300.0, + 295.0, + 1300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1296.0, + 1405.0, + 1296.0, + 1405.0, + 1331.0, + 295.0, + 1331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1328.0, + 1216.0, + 1328.0, + 1216.0, + 1359.0, + 296.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1477.0, + 1404.0, + 1477.0, + 1404.0, + 1513.0, + 294.0, + 1513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1507.0, + 1407.0, + 1507.0, + 1407.0, + 1544.0, + 293.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1538.0, + 1404.0, + 1538.0, + 1404.0, + 1573.0, + 294.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1568.0, + 781.0, + 1568.0, + 781.0, + 1604.0, + 295.0, + 1604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 615.0, + 688.0, + 615.0, + 688.0, + 651.0, + 296.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1999.0, + 1231.0, + 1999.0, + 1231.0, + 2040.0, + 292.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 864.0, + 491.0, + 864.0, + 491.0, + 909.0, + 294.0, + 909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 864.0, + 522.0, + 864.0, + 522.0, + 909.0, + 510.0, + 909.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 16, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 636, + 1404, + 636, + 1404, + 761, + 297, + 761 + ], + "score": 0.981 + }, + { + "category_id": 5, + "poly": [ + 533, + 221, + 1166, + 221, + 1166, + 446, + 533, + 446 + ], + "score": 0.975, + "html": "
Hyperparametercontrol suite taskshumanoid
Policy net100-100200-200
Q function net200-200300-300
Eμ0.11
£0.00011
Discount factor ()0.991
Adam learning rate0.00051
" + }, + { + "category_id": 8, + "poly": [ + 346, + 1444, + 1355, + 1444, + 1355, + 1596, + 346, + 1596 + ], + "score": 0.963 + }, + { + "category_id": 8, + "poly": [ + 609, + 1115, + 1094, + 1115, + 1094, + 1335, + 609, + 1335 + ], + "score": 0.96 + }, + { + "category_id": 1, + "poly": [ + 297, + 1015, + 1401, + 1015, + 1401, + 1079, + 297, + 1079 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 566, + 1971, + 1130, + 1971, + 1130, + 2045, + 566, + 2045 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 297, + 856, + 1401, + 856, + 1401, + 920, + 297, + 920 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 534, + 1817, + 1161, + 1817, + 1161, + 1894, + 534, + 1894 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 454, + 1684, + 1240, + 1684, + 1240, + 1725, + 454, + 1725 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 298, + 1355, + 779, + 1355, + 779, + 1389, + 298, + 1389 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 289, + 1900, + 1324, + 1900, + 1324, + 1935, + 289, + 1935 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 297, + 1748, + 817, + 1748, + 817, + 1782, + 297, + 1782 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 287, + 1607, + 1321, + 1607, + 1321, + 1642, + 287, + 1642 + ], + "score": 0.92 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 815, + 74, + 815, + 105, + 298, + 105 + ], + "score": 0.9 + }, + { + "category_id": 0, + "poly": [ + 298, + 799, + 942, + 799, + 942, + 831, + 298, + 831 + ], + "score": 0.899 + }, + { + "category_id": 0, + "poly": [ + 298, + 956, + 464, + 956, + 464, + 989, + 298, + 989 + ], + "score": 0.897 + }, + { + "category_id": 6, + "poly": [ + 525, + 480, + 1176, + 480, + 1176, + 514, + 525, + 514 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.872 + }, + { + "category_id": 0, + "poly": [ + 295, + 565, + 1173, + 565, + 1173, + 603, + 295, + 603 + ], + "score": 0.83 + }, + { + "category_id": 1, + "poly": [ + 295, + 565, + 1173, + 565, + 1173, + 603, + 295, + 603 + ], + "score": 0.092 + }, + { + "category_id": 14, + "poly": [ + 611, + 1115, + 1091, + 1115, + 1091, + 1337, + 611, + 1337 + ], + "score": 0.94, + "latex": "\\begin{array} { l } { \\displaystyle \\operatorname* { m a x } _ { q } \\int \\mu _ { q } ( s ) \\int q ( a | s ) Q _ { \\theta _ { i } } ( s , a ) d a d s } \\\\ { \\displaystyle s . t . \\int \\mu _ { q } ( s ) { \\bf K L } ( q ( a | s ) , \\pi ( a | s , \\theta _ { i } ) ) d a < \\epsilon , } \\\\ { \\displaystyle \\iint \\mu _ { q } ( s ) q ( a | s ) d a d s = 1 . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 343, + 1443, + 1363, + 1443, + 1363, + 1597, + 343, + 1597 + ], + "score": 0.94, + "latex": "\\begin{array} { c } { { L ( q , \\eta , \\gamma ) = \\displaystyle \\int \\mu _ { q } ( s ) \\int q ( a | s ) Q _ { \\theta _ { i } } ( s , a ) d a d s + } } \\\\ { { \\displaystyle \\eta \\left( \\epsilon - \\int \\mu _ { q } ( s ) \\int q ( a | s ) \\log \\frac { q ( a | s ) } { \\pi ( a | s , \\theta _ { i } ) } \\right) + \\gamma \\left( 1 - \\displaystyle \\iint \\mu _ { q } ( s ) q ( a | s ) d a d s \\right) . } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1243, + 668, + 1353, + 668, + 1353, + 701, + 1243, + 701 + ], + "score": 0.93, + "latex": "\\mu = \\mu ( s )" + }, + { + "category_id": 13, + "poly": [ + 480, + 699, + 595, + 699, + 595, + 731, + 480, + 731 + ], + "score": 0.92, + "latex": "A = A ( s )" + }, + { + "category_id": 13, + "poly": [ + 553, + 667, + 805, + 667, + 805, + 701, + 553, + 701 + ], + "score": 0.92, + "latex": "\\pi ( \\boldsymbol { a } | \\boldsymbol { s } , \\pmb { \\theta } ) = \\mathcal { N } \\left( \\mu , \\pmb { \\Sigma } \\right)" + }, + { + "category_id": 14, + "poly": [ + 535, + 1817, + 1163, + 1817, + 1163, + 1895, + 535, + 1895 + ], + "score": 0.92, + "latex": "q ( a | s ) = \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp \\left( \\frac { Q _ { \\pmb { \\theta } _ { i } } ( a , s ) } { \\eta } \\right) \\exp \\left( - \\frac { \\eta - \\gamma } { \\eta } \\right) ." + }, + { + "category_id": 14, + "poly": [ + 568, + 1972, + 1128, + 1972, + 1128, + 2045, + 568, + 2045 + ], + "score": 0.91, + "latex": "\\exp ( - \\frac { \\eta - \\gamma } { \\eta } ) = \\int \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp ( \\frac { Q _ { \\pmb { \\theta } _ { i } } ( a , s ) } { \\eta } ) d a ," + }, + { + "category_id": 13, + "poly": [ + 791, + 729, + 1078, + 729, + 1078, + 762, + 791, + 762 + ], + "score": 0.91, + "latex": "A _ { i i } \\log ( 1 + \\exp ( A _ { i i } ) )" + }, + { + "category_id": 13, + "poly": [ + 714, + 699, + 832, + 699, + 832, + 727, + 714, + 727 + ], + "score": 0.9, + "latex": "\\Sigma = A A ^ { T }" + }, + { + "category_id": 14, + "poly": [ + 456, + 1683, + 1241, + 1683, + 1241, + 1724, + 456, + 1724 + ], + "score": 0.84, + "latex": "\\partial q L ( q , \\eta , \\gamma ) = Q _ { \\theta _ { i } } ( a , s ) - \\eta \\log q ( a | s ) + \\eta \\log \\pi ( a | s , \\pmb \\theta _ { i } ) - ( \\eta - \\gamma ) ." + }, + { + "category_id": 13, + "poly": [ + 686, + 1610, + 707, + 1610, + 707, + 1636, + 686, + 1636 + ], + "score": 0.84, + "latex": "L" + }, + { + "category_id": 13, + "poly": [ + 1229, + 1615, + 1245, + 1615, + 1245, + 1641, + 1229, + 1641 + ], + "score": 0.82, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 980, + 1614, + 997, + 1614, + 997, + 1641, + 980, + 1641 + ], + "score": 0.8, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 1026, + 1908, + 1041, + 1908, + 1041, + 1933, + 1026, + 1933 + ], + "score": 0.79, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 1137, + 700, + 1161, + 700, + 1161, + 726, + 1137, + 726 + ], + "score": 0.78, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 729, + 380, + 765, + 380, + 765, + 409, + 729, + 409 + ], + "score": 0.58, + "latex": "( \\gamma )" + }, + { + "category_id": 13, + "poly": [ + 643, + 322, + 672, + 322, + 672, + 351, + 643, + 351 + ], + "score": 0.56, + "latex": "\\epsilon _ { \\mu }" + }, + { + "category_id": 13, + "poly": [ + 642, + 355, + 673, + 355, + 673, + 379, + 642, + 379 + ], + "score": 0.37, + "latex": "\\epsilon _ { \\Sigma }" + }, + { + "category_id": 13, + "poly": [ + 651, + 889, + 672, + 889, + 672, + 915, + 651, + 915 + ], + "score": 0.26, + "latex": "\\mathrm { E }" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 818.0, + 72.0, + 818.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 799.0, + 943.0, + 799.0, + 943.0, + 834.0, + 297.0, + 834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 955.0, + 466.0, + 955.0, + 466.0, + 992.0, + 295.0, + 992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 523.0, + 479.0, + 1175.0, + 479.0, + 1175.0, + 515.0, + 523.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 563.0, + 1175.0, + 563.0, + 1175.0, + 607.0, + 294.0, + 607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 635.0, + 1405.0, + 635.0, + 1405.0, + 670.0, + 292.0, + 670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 666.0, + 552.0, + 666.0, + 552.0, + 703.0, + 291.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 666.0, + 1242.0, + 666.0, + 1242.0, + 703.0, + 806.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 666.0, + 1406.0, + 666.0, + 1406.0, + 703.0, + 1354.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 697.0, + 479.0, + 697.0, + 479.0, + 732.0, + 295.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 697.0, + 713.0, + 697.0, + 713.0, + 732.0, + 596.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 833.0, + 697.0, + 1136.0, + 697.0, + 1136.0, + 732.0, + 833.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1162.0, + 697.0, + 1405.0, + 697.0, + 1405.0, + 732.0, + 1162.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 725.0, + 790.0, + 725.0, + 790.0, + 765.0, + 292.0, + 765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1079.0, + 725.0, + 1092.0, + 725.0, + 1092.0, + 765.0, + 1079.0, + 765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1015.0, + 1405.0, + 1015.0, + 1405.0, + 1051.0, + 296.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1046.0, + 1018.0, + 1046.0, + 1018.0, + 1082.0, + 293.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 853.0, + 1403.0, + 853.0, + 1403.0, + 893.0, + 292.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 884.0, + 650.0, + 884.0, + 650.0, + 924.0, + 294.0, + 924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 673.0, + 884.0, + 868.0, + 884.0, + 868.0, + 924.0, + 673.0, + 924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1349.0, + 782.0, + 1349.0, + 782.0, + 1396.0, + 294.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1899.0, + 1025.0, + 1899.0, + 1025.0, + 1938.0, + 293.0, + 1938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 1899.0, + 1328.0, + 1899.0, + 1328.0, + 1938.0, + 1042.0, + 1938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1744.0, + 819.0, + 1744.0, + 819.0, + 1787.0, + 295.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1604.0, + 685.0, + 1604.0, + 685.0, + 1646.0, + 293.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 1604.0, + 979.0, + 1604.0, + 979.0, + 1646.0, + 708.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 998.0, + 1604.0, + 1228.0, + 1604.0, + 1228.0, + 1646.0, + 998.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 1604.0, + 1323.0, + 1604.0, + 1323.0, + 1646.0, + 1246.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 563.0, + 1175.0, + 563.0, + 1175.0, + 607.0, + 294.0, + 607.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 17, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1535, + 1406, + 1535, + 1406, + 1693, + 296, + 1693 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1108, + 1407, + 1108, + 1407, + 1205, + 298, + 1205 + ], + "score": 0.965 + }, + { + "category_id": 8, + "poly": [ + 582, + 1366, + 1112, + 1366, + 1112, + 1515, + 582, + 1515 + ], + "score": 0.965 + }, + { + "category_id": 8, + "poly": [ + 668, + 594, + 1029, + 594, + 1029, + 655, + 668, + 655 + ], + "score": 0.953 + }, + { + "category_id": 8, + "poly": [ + 561, + 220, + 1134, + 220, + 1134, + 297, + 561, + 297 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 295, + 888, + 1408, + 888, + 1408, + 963, + 295, + 963 + ], + "score": 0.951 + }, + { + "category_id": 8, + "poly": [ + 685, + 1989, + 1011, + 1989, + 1011, + 2043, + 685, + 2043 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 296, + 1704, + 1403, + 1704, + 1403, + 1770, + 296, + 1770 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 582, + 1260, + 1119, + 1260, + 1119, + 1330, + 582, + 1330 + ], + "score": 0.947 + }, + { + "category_id": 1, + "poly": [ + 295, + 1881, + 1403, + 1881, + 1403, + 1946, + 295, + 1946 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 451, + 787, + 1245, + 787, + 1245, + 858, + 451, + 858 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 298, + 660, + 1405, + 660, + 1405, + 724, + 298, + 724 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 300, + 531, + 1402, + 531, + 1402, + 593, + 300, + 593 + ], + "score": 0.939 + }, + { + "category_id": 8, + "poly": [ + 358, + 978, + 1292, + 978, + 1292, + 1049, + 358, + 1049 + ], + "score": 0.938 + }, + { + "category_id": 1, + "poly": [ + 294, + 1062, + 1400, + 1062, + 1400, + 1097, + 294, + 1097 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 294, + 318, + 1311, + 318, + 1311, + 353, + 294, + 353 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 297, + 1345, + 371, + 1345, + 371, + 1376, + 297, + 1376 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 300, + 738, + 1130, + 738, + 1130, + 773, + 300, + 773 + ], + "score": 0.925 + }, + { + "category_id": 8, + "poly": [ + 371, + 1806, + 1328, + 1806, + 1328, + 1875, + 371, + 1875 + ], + "score": 0.923 + }, + { + "category_id": 2, + "poly": [ + 297, + 73, + 817, + 73, + 817, + 106, + 297, + 106 + ], + "score": 0.922 + }, + { + "category_id": 9, + "poly": [ + 1352, + 805, + 1400, + 805, + 1400, + 837, + 1352, + 837 + ], + "score": 0.906 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1279, + 1401, + 1279, + 1401, + 1311, + 1351, + 1311 + ], + "score": 0.899 + }, + { + "category_id": 9, + "poly": [ + 1351, + 998, + 1400, + 998, + 1400, + 1029, + 1351, + 1029 + ], + "score": 0.898 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.873 + }, + { + "category_id": 0, + "poly": [ + 297, + 474, + 469, + 474, + 469, + 506, + 297, + 506 + ], + "score": 0.76 + }, + { + "category_id": 8, + "poly": [ + 497, + 366, + 1197, + 366, + 1197, + 442, + 497, + 442 + ], + "score": 0.623 + }, + { + "category_id": 8, + "poly": [ + 496, + 366, + 1198, + 366, + 1198, + 443, + 496, + 443 + ], + "score": 0.553 + }, + { + "category_id": 1, + "poly": [ + 297, + 474, + 469, + 474, + 469, + 506, + 297, + 506 + ], + "score": 0.186 + }, + { + "category_id": 14, + "poly": [ + 370, + 1805, + 1328, + 1805, + 1328, + 1877, + 370, + 1877 + ], + "score": 0.94, + "latex": "L ( \\pmb \\theta , \\eta _ { \\mu } , \\eta _ { \\Sigma } ) = \\int \\mu _ { q } ( s ) \\int q ( a | s ) \\log \\pi ( a | s , \\pmb \\theta ) d a d s + \\eta _ { \\mu } ( \\epsilon _ { \\mu } - C _ { \\mu } ) + \\eta _ { \\Sigma } ( \\epsilon _ { \\Sigma } - C _ { \\Sigma } )" + }, + { + "category_id": 14, + "poly": [ + 669, + 589, + 1026, + 589, + 1026, + 656, + 669, + 656 + ], + "score": 0.94, + "latex": "p ( \\pmb \\theta ) \\approx \\mathcal { N } \\Big ( \\mu = \\pmb \\theta _ { i } , \\Sigma = \\frac { F _ { \\pmb \\theta _ { i } } } { \\lambda } \\Big ) ," + }, + { + "category_id": 14, + "poly": [ + 579, + 1259, + 1116, + 1259, + 1116, + 1330, + 579, + 1330 + ], + "score": 0.93, + "latex": "\\int \\mu _ { q } ( s ) \\mathrm { K L } ( \\pi _ { i } ( a | s , \\pmb \\theta ) , \\pi ( a | s , \\pmb \\theta ) ) = C _ { \\mu } + C _ { \\Sigma } ," + }, + { + "category_id": 13, + "poly": [ + 561, + 890, + 851, + 890, + 851, + 930, + 561, + 930 + ], + "score": 0.93, + "latex": "( \\pmb \\theta - \\pmb \\theta _ { i } ) ^ { T } F _ { \\pmb \\theta _ { i } } ^ { - 1 } ( \\pmb \\theta - \\pmb \\theta _ { i } )" + }, + { + "category_id": 14, + "poly": [ + 450, + 785, + 1246, + 785, + 1246, + 858, + 450, + 858 + ], + "score": 0.93, + "latex": "\\operatorname* { m a x } _ { \\pi } \\int \\mu _ { q } ( s ) \\int q ( a | s ) \\log \\pi ( a | s , \\pmb { \\theta } ) d a d s - \\lambda ( \\pmb { \\theta } - \\pmb { \\theta } _ { i } ) ^ { T } F _ { \\pmb { \\theta _ { i } } } ^ { - 1 } ( \\pmb { \\theta } - \\pmb { \\theta } _ { i } ) ." + }, + { + "category_id": 13, + "poly": [ + 840, + 534, + 891, + 534, + 891, + 567, + 840, + 567 + ], + "score": 0.92, + "latex": "p ( \\theta )" + }, + { + "category_id": 14, + "poly": [ + 499, + 366, + 1198, + 366, + 1198, + 443, + 499, + 443 + ], + "score": 0.92, + "latex": "g ( \\eta ) = \\eta \\epsilon + \\eta \\int \\mu _ { q } ( s ) \\log \\left( \\int \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp ( \\frac { Q ( a , s ) } { \\eta } ) d a \\right) ." + }, + { + "category_id": 14, + "poly": [ + 560, + 221, + 1138, + 221, + 1138, + 298, + 560, + 298 + ], + "score": 0.91, + "latex": "\\gamma = \\eta - \\eta \\log \\left( \\int \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp ( \\frac { Q _ { \\pmb { \\theta } _ { i } } ( a , s ) } { \\eta } ) d a \\right) ." + }, + { + "category_id": 14, + "poly": [ + 358, + 977, + 1294, + 977, + 1294, + 1050, + 358, + 1050 + ], + "score": 0.91, + "latex": "\\operatorname* { m a x } _ { \\pi } \\int \\mu _ { q } ( s ) \\int q ( a | s ) \\log \\pi ( a | s , \\theta ) d a d s - \\lambda \\int \\mu _ { q } ( s ) \\mathbf { K L } ( \\pi ( a | s , \\theta _ { i } ) , \\pi ( a | s , \\theta ) ) d s" + }, + { + "category_id": 13, + "poly": [ + 973, + 663, + 1015, + 663, + 1015, + 695, + 973, + 695 + ], + "score": 0.91, + "latex": "F _ { \\pmb { \\theta } _ { i } }" + }, + { + "category_id": 14, + "poly": [ + 684, + 1989, + 1013, + 1989, + 1013, + 2042, + 684, + 2042 + ], + "score": 0.9, + "latex": "\\operatorname* { m a x } _ { \\pmb { \\theta } } \\operatorname* { m i n } _ { \\eta _ { \\mu } > 0 , \\eta _ { \\Sigma } > 0 } L ( \\pmb { \\theta } , \\eta _ { \\mu } , \\eta _ { \\Sigma } ) ." + }, + { + "category_id": 13, + "poly": [ + 297, + 927, + 698, + 927, + 698, + 965, + 297, + 965 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\int \\mu _ { q } ( s ) \\mathrm { K L } ( \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\pi ( a | s , \\pmb { \\theta } ) ) d s } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 370, + 663, + 399, + 663, + 399, + 693, + 370, + 693 + ], + "score": 0.88, + "latex": "\\theta _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1136, + 1543, + 1206, + 1543, + 1206, + 1571, + 1136, + 1571 + ], + "score": 0.87, + "latex": "\\epsilon _ { \\mu } , \\epsilon _ { \\Sigma }" + }, + { + "category_id": 13, + "poly": [ + 462, + 1888, + 496, + 1888, + 496, + 1915, + 462, + 1915 + ], + "score": 0.87, + "latex": "\\eta _ { \\Sigma }" + }, + { + "category_id": 13, + "poly": [ + 379, + 1888, + 410, + 1888, + 410, + 1917, + 379, + 1917 + ], + "score": 0.85, + "latex": "\\eta _ { \\mu }" + }, + { + "category_id": 14, + "poly": [ + 585, + 1365, + 1114, + 1365, + 1114, + 1517, + 585, + 1517 + ], + "score": 0.84, + "latex": "\\begin{array} { c } { { C _ { \\mu } = \\displaystyle \\int \\mu _ { q } ( s ) \\frac 1 2 \\big ( \\mathrm { t r } \\big ( \\Sigma ^ { - 1 } \\Sigma _ { i } \\big ) - n + \\mathrm { l n } ( \\frac { \\Sigma } { \\Sigma _ { i } } ) \\big ) d s , } } \\\\ { { { } } } \\\\ { { C _ { \\Sigma } = \\displaystyle \\int \\mu _ { q } ( s ) \\frac 1 2 \\big ( \\mu - \\mu _ { i } \\big ) ^ { T } \\Sigma ^ { - 1 } ( \\mu - \\mu _ { i } ) d s . } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 578, + 325, + 598, + 325, + 598, + 352, + 578, + 352 + ], + "score": 0.83, + "latex": "\\gamma" + }, + { + "category_id": 13, + "poly": [ + 424, + 694, + 442, + 694, + 442, + 720, + 424, + 720 + ], + "score": 0.81, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 776, + 325, + 794, + 325, + 794, + 352, + 776, + 352 + ], + "score": 0.8, + "latex": "\\eta" + }, + { + "category_id": 13, + "poly": [ + 705, + 326, + 725, + 326, + 725, + 347, + 705, + 347 + ], + "score": 0.78, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 761, + 1544, + 776, + 1544, + 776, + 1565, + 761, + 1565 + ], + "score": 0.74, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 762, + 1574, + 778, + 1574, + 778, + 1595, + 762, + 1595 + ], + "score": 0.67, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 679, + 535, + 708, + 535, + 708, + 562, + 679, + 562 + ], + "score": 0.38, + "latex": "\\mathbf { M }" + }, + { + "category_id": 13, + "poly": [ + 1019, + 1111, + 1049, + 1111, + 1049, + 1139, + 1019, + 1139 + ], + "score": 0.29, + "latex": "\\mathbf { M }" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 818.0, + 72.0, + 818.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2125.0, + 832.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 472.0, + 470.0, + 472.0, + 470.0, + 509.0, + 294.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1536.0, + 760.0, + 1536.0, + 760.0, + 1574.0, + 296.0, + 1574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 777.0, + 1536.0, + 1135.0, + 1536.0, + 1135.0, + 1574.0, + 777.0, + 1574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1207.0, + 1536.0, + 1404.0, + 1536.0, + 1404.0, + 1574.0, + 1207.0, + 1574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1566.0, + 761.0, + 1566.0, + 761.0, + 1602.0, + 293.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 779.0, + 1566.0, + 1404.0, + 1566.0, + 1404.0, + 1602.0, + 779.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1598.0, + 1402.0, + 1598.0, + 1402.0, + 1631.0, + 295.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1629.0, + 1406.0, + 1629.0, + 1406.0, + 1662.0, + 294.0, + 1662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1658.0, + 1293.0, + 1658.0, + 1293.0, + 1696.0, + 293.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1106.0, + 1018.0, + 1106.0, + 1018.0, + 1147.0, + 292.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 1106.0, + 1407.0, + 1106.0, + 1407.0, + 1147.0, + 1050.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1142.0, + 1405.0, + 1142.0, + 1405.0, + 1175.0, + 293.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1170.0, + 1315.0, + 1170.0, + 1315.0, + 1207.0, + 293.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 885.0, + 560.0, + 885.0, + 560.0, + 934.0, + 290.0, + 934.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 852.0, + 885.0, + 1410.0, + 885.0, + 1410.0, + 934.0, + 852.0, + 934.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 928.0, + 1275.0, + 928.0, + 1275.0, + 967.0, + 699.0, + 967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1702.0, + 1404.0, + 1702.0, + 1404.0, + 1744.0, + 291.0, + 1744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1736.0, + 450.0, + 1736.0, + 450.0, + 1773.0, + 294.0, + 1773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1877.0, + 378.0, + 1877.0, + 378.0, + 1920.0, + 294.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 411.0, + 1877.0, + 461.0, + 1877.0, + 461.0, + 1920.0, + 411.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 1877.0, + 1405.0, + 1877.0, + 1405.0, + 1920.0, + 497.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1910.0, + 751.0, + 1910.0, + 751.0, + 1948.0, + 294.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 660.0, + 369.0, + 660.0, + 369.0, + 696.0, + 296.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 400.0, + 660.0, + 972.0, + 660.0, + 972.0, + 696.0, + 400.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1016.0, + 660.0, + 1403.0, + 660.0, + 1403.0, + 696.0, + 1016.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 691.0, + 423.0, + 691.0, + 423.0, + 724.0, + 293.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 443.0, + 691.0, + 455.0, + 691.0, + 455.0, + 724.0, + 443.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 525.0, + 678.0, + 525.0, + 678.0, + 573.0, + 291.0, + 573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 709.0, + 525.0, + 839.0, + 525.0, + 839.0, + 573.0, + 709.0, + 573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 525.0, + 1407.0, + 525.0, + 1407.0, + 573.0, + 892.0, + 573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 558.0, + 345.0, + 558.0, + 345.0, + 602.0, + 291.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1058.0, + 1404.0, + 1058.0, + 1404.0, + 1102.0, + 296.0, + 1102.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 317.0, + 577.0, + 317.0, + 577.0, + 356.0, + 294.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 317.0, + 704.0, + 317.0, + 704.0, + 356.0, + 599.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 726.0, + 317.0, + 775.0, + 317.0, + 775.0, + 356.0, + 726.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 795.0, + 317.0, + 1313.0, + 317.0, + 1313.0, + 356.0, + 795.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1341.0, + 376.0, + 1341.0, + 376.0, + 1379.0, + 293.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 734.0, + 1130.0, + 734.0, + 1130.0, + 780.0, + 294.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 472.0, + 470.0, + 472.0, + 470.0, + 509.0, + 294.0, + 509.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 18, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1036, + 1405, + 1036, + 1405, + 1315, + 296, + 1315 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 228, + 1404, + 228, + 1404, + 415, + 298, + 415 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 1477, + 1405, + 1477, + 1405, + 1662, + 297, + 1662 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 793, + 1404, + 793, + 1404, + 916, + 298, + 916 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 296, + 585, + 1406, + 585, + 1406, + 681, + 296, + 681 + ], + "score": 0.962 + }, + { + "category_id": 1, + "poly": [ + 294, + 507, + 1403, + 507, + 1403, + 572, + 294, + 572 + ], + "score": 0.955 + }, + { + "category_id": 8, + "poly": [ + 684, + 959, + 1016, + 959, + 1016, + 1013, + 684, + 1013 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 786, + 1329, + 910, + 1329, + 910, + 1366, + 786, + 1366 + ], + "score": 0.927 + }, + { + "category_id": 8, + "poly": [ + 368, + 715, + 1327, + 715, + 1327, + 784, + 368, + 784 + ], + "score": 0.926 + }, + { + "category_id": 0, + "poly": [ + 300, + 1409, + 741, + 1409, + 741, + 1443, + 300, + 1443 + ], + "score": 0.911 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 815, + 75, + 815, + 105, + 299, + 105 + ], + "score": 0.901 + }, + { + "category_id": 0, + "poly": [ + 304, + 452, + 874, + 452, + 874, + 483, + 304, + 483 + ], + "score": 0.89 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 866, + 2088, + 866, + 2113, + 834, + 2113 + ], + "score": 0.85 + }, + { + "category_id": 13, + "poly": [ + 591, + 824, + 676, + 824, + 676, + 857, + 591, + 857 + ], + "score": 0.93, + "latex": "Q ( a , s )" + }, + { + "category_id": 14, + "poly": [ + 369, + 715, + 1329, + 715, + 1329, + 787, + 369, + 787 + ], + "score": 0.92, + "latex": "L ( \\theta ^ { q } , \\eta _ { \\mu } , \\eta _ { \\Sigma } ) = \\int \\mu _ { q } ( s ) \\int q ( a | s ; \\theta ^ { q } ) A _ { i } ( a , s ) d a d s + \\eta _ { \\mu } ( \\epsilon _ { \\mu } - C _ { \\mu } ) + \\eta _ { \\Sigma } ( \\epsilon _ { \\Sigma } - C _ { \\Sigma } ) ." + }, + { + "category_id": 14, + "poly": [ + 680, + 958, + 1017, + 958, + 1017, + 1014, + 680, + 1014 + ], + "score": 0.91, + "latex": "\\operatorname* { m a x } _ { \\pmb { \\theta } ^ { q } } \\operatorname* { m i n } _ { \\eta _ { \\mu } > 0 , \\eta _ { \\Sigma } > 0 } L ( \\pmb { \\theta } ^ { q } , \\eta _ { \\mu } , \\eta _ { \\Sigma } )" + }, + { + "category_id": 13, + "poly": [ + 1316, + 793, + 1400, + 793, + 1400, + 826, + 1316, + 826 + ], + "score": 0.91, + "latex": "A ( a , s )" + }, + { + "category_id": 14, + "poly": [ + 786, + 1329, + 912, + 1329, + 912, + 1366, + 786, + 1366 + ], + "score": 0.91, + "latex": "\\pmb \\theta _ { i + 1 } = \\pmb \\theta ^ { q }" + }, + { + "category_id": 13, + "poly": [ + 830, + 1282, + 861, + 1282, + 861, + 1310, + 830, + 1310 + ], + "score": 0.88, + "latex": "\\pmb { \\theta } ^ { q }" + }, + { + "category_id": 13, + "poly": [ + 1280, + 1161, + 1312, + 1161, + 1312, + 1189, + 1280, + 1189 + ], + "score": 0.87, + "latex": "\\pmb { \\theta } ^ { q }" + }, + { + "category_id": 13, + "poly": [ + 693, + 1130, + 724, + 1130, + 724, + 1158, + 693, + 1158 + ], + "score": 0.87, + "latex": "\\pmb { \\theta } ^ { q }" + }, + { + "category_id": 13, + "poly": [ + 520, + 1039, + 550, + 1039, + 550, + 1066, + 520, + 1066 + ], + "score": 0.87, + "latex": "\\pmb { \\theta } ^ { q }" + }, + { + "category_id": 13, + "poly": [ + 467, + 799, + 501, + 799, + 501, + 825, + 467, + 825 + ], + "score": 0.86, + "latex": "\\eta _ { \\Sigma }" + }, + { + "category_id": 13, + "poly": [ + 1295, + 1069, + 1327, + 1069, + 1327, + 1098, + 1295, + 1098 + ], + "score": 0.86, + "latex": "\\pmb { \\theta } ^ { q }" + }, + { + "category_id": 13, + "poly": [ + 1362, + 1100, + 1393, + 1100, + 1393, + 1128, + 1362, + 1128 + ], + "score": 0.85, + "latex": "\\pmb { \\theta } ^ { q }" + }, + { + "category_id": 13, + "poly": [ + 380, + 799, + 412, + 799, + 412, + 827, + 380, + 827 + ], + "score": 0.85, + "latex": "\\eta _ { \\mu }" + }, + { + "category_id": 13, + "poly": [ + 609, + 1284, + 628, + 1284, + 628, + 1310, + 609, + 1310 + ], + "score": 0.82, + "latex": "\\pmb { \\theta }" + }, + { + "category_id": 13, + "poly": [ + 522, + 232, + 542, + 232, + 542, + 258, + 522, + 258 + ], + "score": 0.72, + "latex": "\\pmb \\theta" + }, + { + "category_id": 13, + "poly": [ + 563, + 293, + 584, + 293, + 584, + 319, + 563, + 319 + ], + "score": 0.7, + "latex": "\\pmb \\theta" + }, + { + "category_id": 13, + "poly": [ + 815, + 548, + 834, + 548, + 834, + 567, + 815, + 567 + ], + "score": 0.7, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 1066, + 323, + 1087, + 323, + 1087, + 349, + 1066, + 349 + ], + "score": 0.67, + "latex": "\\pmb { \\theta }" + }, + { + "category_id": 13, + "poly": [ + 1096, + 263, + 1116, + 263, + 1116, + 290, + 1096, + 290 + ], + "score": 0.6, + "latex": "\\pmb \\theta" + }, + { + "category_id": 13, + "poly": [ + 413, + 856, + 435, + 856, + 435, + 883, + 413, + 883 + ], + "score": 0.44, + "latex": "\\mathrm { E }" + }, + { + "category_id": 13, + "poly": [ + 459, + 827, + 485, + 827, + 485, + 855, + 459, + 855 + ], + "score": 0.27, + "latex": "\\mathrm { Q }" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1408.0, + 743.0, + 1408.0, + 743.0, + 1448.0, + 294.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 818.0, + 73.0, + 818.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 452.0, + 880.0, + 452.0, + 880.0, + 486.0, + 298.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 2083.0, + 872.0, + 2083.0, + 872.0, + 2123.0, + 828.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1036.0, + 519.0, + 1036.0, + 519.0, + 1074.0, + 293.0, + 1074.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 551.0, + 1036.0, + 1403.0, + 1036.0, + 1403.0, + 1074.0, + 551.0, + 1074.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1070.0, + 1294.0, + 1070.0, + 1294.0, + 1103.0, + 295.0, + 1103.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1328.0, + 1070.0, + 1405.0, + 1070.0, + 1405.0, + 1103.0, + 1328.0, + 1103.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1099.0, + 1361.0, + 1099.0, + 1361.0, + 1133.0, + 291.0, + 1133.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1099.0, + 1403.0, + 1099.0, + 1403.0, + 1133.0, + 1394.0, + 1133.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1127.0, + 692.0, + 1127.0, + 692.0, + 1166.0, + 293.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 725.0, + 1127.0, + 1405.0, + 1127.0, + 1405.0, + 1166.0, + 725.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1158.0, + 1279.0, + 1158.0, + 1279.0, + 1197.0, + 291.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1313.0, + 1158.0, + 1407.0, + 1158.0, + 1407.0, + 1197.0, + 1313.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1193.0, + 1403.0, + 1193.0, + 1403.0, + 1226.0, + 295.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1222.0, + 1405.0, + 1222.0, + 1405.0, + 1257.0, + 293.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1249.0, + 1407.0, + 1249.0, + 1407.0, + 1287.0, + 291.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1279.0, + 608.0, + 1279.0, + 608.0, + 1320.0, + 293.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 629.0, + 1279.0, + 829.0, + 1279.0, + 829.0, + 1320.0, + 629.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 1279.0, + 1162.0, + 1279.0, + 1162.0, + 1320.0, + 862.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 229.0, + 521.0, + 229.0, + 521.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 543.0, + 229.0, + 1404.0, + 229.0, + 1404.0, + 265.0, + 543.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 259.0, + 1095.0, + 259.0, + 1095.0, + 296.0, + 295.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1117.0, + 259.0, + 1405.0, + 259.0, + 1405.0, + 296.0, + 1117.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 291.0, + 562.0, + 291.0, + 562.0, + 327.0, + 294.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 585.0, + 291.0, + 1405.0, + 291.0, + 1405.0, + 327.0, + 585.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 322.0, + 1065.0, + 322.0, + 1065.0, + 357.0, + 294.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1088.0, + 322.0, + 1404.0, + 322.0, + 1404.0, + 357.0, + 1088.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 352.0, + 1406.0, + 352.0, + 1406.0, + 388.0, + 294.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 383.0, + 1107.0, + 383.0, + 1107.0, + 415.0, + 296.0, + 415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1475.0, + 1406.0, + 1475.0, + 1406.0, + 1512.0, + 294.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1508.0, + 1405.0, + 1508.0, + 1405.0, + 1540.0, + 295.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1538.0, + 1406.0, + 1538.0, + 1406.0, + 1575.0, + 292.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1570.0, + 1405.0, + 1570.0, + 1405.0, + 1604.0, + 292.0, + 1604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1599.0, + 1406.0, + 1599.0, + 1406.0, + 1634.0, + 294.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1628.0, + 563.0, + 1628.0, + 563.0, + 1668.0, + 293.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 791.0, + 379.0, + 791.0, + 379.0, + 829.0, + 293.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 413.0, + 791.0, + 466.0, + 791.0, + 466.0, + 829.0, + 413.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 502.0, + 791.0, + 1315.0, + 791.0, + 1315.0, + 829.0, + 502.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 791.0, + 1405.0, + 791.0, + 1405.0, + 829.0, + 1401.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 823.0, + 458.0, + 823.0, + 458.0, + 859.0, + 293.0, + 859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 486.0, + 823.0, + 590.0, + 823.0, + 590.0, + 859.0, + 486.0, + 859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 677.0, + 823.0, + 1406.0, + 823.0, + 1406.0, + 859.0, + 677.0, + 859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 852.0, + 412.0, + 852.0, + 412.0, + 889.0, + 293.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 436.0, + 852.0, + 1405.0, + 852.0, + 1405.0, + 889.0, + 436.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 885.0, + 989.0, + 885.0, + 989.0, + 921.0, + 294.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 586.0, + 1404.0, + 586.0, + 1404.0, + 621.0, + 295.0, + 621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 615.0, + 1404.0, + 615.0, + 1404.0, + 654.0, + 294.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 646.0, + 1246.0, + 646.0, + 1246.0, + 683.0, + 293.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 507.0, + 1405.0, + 507.0, + 1405.0, + 543.0, + 294.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 539.0, + 814.0, + 539.0, + 814.0, + 576.0, + 294.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 539.0, + 846.0, + 539.0, + 846.0, + 576.0, + 835.0, + 576.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 19, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 295, + 1105, + 1407, + 1105, + 1407, + 1921, + 295, + 1921 + ], + "score": 0.932 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 815, + 75, + 815, + 105, + 299, + 105 + ], + "score": 0.895 + }, + { + "category_id": 0, + "poly": [ + 299, + 336, + 594, + 336, + 594, + 368, + 299, + 368 + ], + "score": 0.814 + }, + { + "category_id": 1, + "poly": [ + 303, + 374, + 1187, + 374, + 1187, + 824, + 303, + 824 + ], + "score": 0.813 + }, + { + "category_id": 0, + "poly": [ + 298, + 1062, + 1071, + 1062, + 1071, + 1094, + 298, + 1094 + ], + "score": 0.695 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 863, + 2088, + 863, + 2113, + 834, + 2113 + ], + "score": 0.501 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 863, + 2088, + 863, + 2113, + 834, + 2113 + ], + "score": 0.356 + }, + { + "category_id": 1, + "poly": [ + 298, + 1062, + 1071, + 1062, + 1071, + 1094, + 298, + 1094 + ], + "score": 0.191 + }, + { + "category_id": 5, + "poly": [ + 303, + 374, + 1187, + 374, + 1187, + 824, + 303, + 824 + ], + "score": 0.183, + "html": "
1: Input G number of gradients to average
2: while True do
3: initialize N= 0
4: initialize gradient store S𝜙 = {,Sn= {},Snμ = {},Sns = { sθ = {}
5: whileN<Gdo
6: receive next gradient from worker w
7: SΦ=SΦ+[δw]
8: S= s0+[s0w]
9: Sn=Sn+[Snw] 10:
Snp =Sn+[on] 11:
Sne=Sne+[on]
12: update parameters with average gradient from
13: SΦ,Sn,Snμ,Sn∑ S0
14: send new parameters to workers
" + }, + { + "category_id": 13, + "poly": [ + 1028, + 1403, + 1141, + 1403, + 1141, + 1437, + 1028, + 1437 + ], + "score": 0.92, + "latex": "\\bar { \\pi } ( \\bar { a } | s , \\pmb \\theta _ { i } )" + }, + { + "category_id": 13, + "poly": [ + 712, + 1786, + 868, + 1786, + 868, + 1819, + 712, + 1819 + ], + "score": 0.91, + "latex": "\\phi , \\theta , \\eta , \\eta _ { \\mu } , \\eta _ { \\Sigma }" + }, + { + "category_id": 13, + "poly": [ + 456, + 496, + 543, + 496, + 543, + 524, + 456, + 524 + ], + "score": 0.89, + "latex": "N < G" + }, + { + "category_id": 13, + "poly": [ + 469, + 1494, + 637, + 1494, + 637, + 1532, + 469, + 1532 + ], + "score": 0.88, + "latex": "\\delta _ { \\phi } = \\partial _ { \\phi } L _ { \\phi } ^ { \\prime } ( \\phi )" + }, + { + "category_id": 14, + "poly": [ + 422, + 554, + 645, + 554, + 645, + 719, + 422, + 719 + ], + "score": 0.88, + "latex": "\\begin{array} { l } { { s _ { \\phi } = s _ { \\phi } + [ \\bar { \\delta } \\phi ^ { w } ] } } \\\\ { { s _ { \\phi } = s _ { \\theta } + [ \\delta \\theta ^ { w } ] } } \\\\ { { s _ { \\eta } = s _ { \\eta } + [ \\delta \\eta ^ { w } ] } } \\\\ { { s _ { \\eta _ { \\mu } } = s _ { \\eta _ { \\mu } } + [ \\delta \\eta _ { \\mu } ^ { w } ] } } \\\\ { { s _ { \\eta _ { \\theta } } = s _ { \\eta _ { \\theta } } + [ \\delta \\eta _ { \\theta } ^ { w } ] } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 423, + 1811, + 744, + 1811, + 744, + 1917, + 423, + 1917 + ], + "score": 0.87, + "latex": "\\begin{array} { r } { k = k + 1 ^ { \\circ } } \\\\ { i = i + 1 , L _ { \\mathrm { c u r r } } = L _ { \\mathrm { c u r r } } + L } \\\\ { \\pmb { \\theta } _ { i } = \\pmb { \\theta } , \\phi ^ { \\prime } = \\phi } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 456, + 1221, + 602, + 1221, + 602, + 1252, + 456, + 1252 + ], + "score": 0.87, + "latex": "L _ { \\mathrm { c u r r } } > L _ { \\mathrm { m a x } }" + }, + { + "category_id": 13, + "poly": [ + 497, + 1343, + 609, + 1343, + 609, + 1372, + 497, + 1372 + ], + "score": 0.86, + "latex": "k < 1 0 0 0" + }, + { + "category_id": 13, + "poly": [ + 700, + 1375, + 723, + 1375, + 723, + 1402, + 700, + 1402 + ], + "score": 0.82, + "latex": "\\boldsymbol { B }" + }, + { + "category_id": 13, + "poly": [ + 488, + 435, + 558, + 435, + 558, + 464, + 488, + 464 + ], + "score": 0.82, + "latex": "\\Nu = 0" + }, + { + "category_id": 13, + "poly": [ + 657, + 1253, + 680, + 1253, + 680, + 1279, + 657, + 1279 + ], + "score": 0.81, + "latex": "\\boldsymbol { B }" + }, + { + "category_id": 13, + "poly": [ + 469, + 1555, + 616, + 1555, + 616, + 1590, + 469, + 1590 + ], + "score": 0.76, + "latex": "\\delta \\eta = \\bar { \\partial _ { \\eta } g ( \\eta ) }" + }, + { + "category_id": 13, + "poly": [ + 553, + 1405, + 586, + 1405, + 586, + 1432, + 553, + 1432 + ], + "score": 0.76, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 810, + 532, + 834, + 532, + 834, + 553, + 810, + 553 + ], + "score": 0.74, + "latex": "w" + }, + { + "category_id": 13, + "poly": [ + 996, + 1405, + 1018, + 1405, + 1018, + 1432, + 996, + 1432 + ], + "score": 0.7, + "latex": "\\boldsymbol { B }" + }, + { + "category_id": 13, + "poly": [ + 448, + 1160, + 558, + 1160, + 558, + 1193, + 448, + 1193 + ], + "score": 0.67, + "latex": "Q _ { \\omega _ { i } } ( a , s )" + }, + { + "category_id": 13, + "poly": [ + 522, + 1589, + 930, + 1589, + 930, + 1638, + 522, + 1638 + ], + "score": 0.66, + "latex": "\\begin{array} { r } { q ( a | s ) \\propto \\pi ( a | s , \\pmb { \\theta } _ { i } ) \\exp ( \\frac { Q _ { \\theta _ { t } } ( a , s , \\phi ^ { \\prime } ) } { \\eta } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 646, + 462, + 1183, + 462, + 1183, + 501, + 646, + 501 + ], + "score": 0.66, + "latex": "s _ { \\phi } = \\{ \\} , s _ { \\eta } = \\{ \\} , s _ { \\eta _ { \\mu } } = \\{ \\} , s _ { \\eta _ { \\Sigma } } = \\{ \\} \\ : s _ { \\theta } = \\{ \\}" + }, + { + "category_id": 13, + "poly": [ + 410, + 375, + 436, + 375, + 436, + 402, + 410, + 402 + ], + "score": 0.64, + "latex": "G" + }, + { + "category_id": 14, + "poly": [ + 427, + 1281, + 499, + 1281, + 499, + 1311, + 427, + 1311 + ], + "score": 0.63, + "latex": "\\bar { k = 0 }" + }, + { + "category_id": 13, + "poly": [ + 648, + 464, + 743, + 464, + 743, + 499, + 648, + 499 + ], + "score": 0.59, + "latex": "s _ { \\phi } = \\{ \\}" + }, + { + "category_id": 13, + "poly": [ + 386, + 758, + 415, + 758, + 415, + 785, + 386, + 785 + ], + "score": 0.57, + "latex": "s _ { \\phi }" + }, + { + "category_id": 13, + "poly": [ + 754, + 463, + 847, + 463, + 847, + 500, + 754, + 500 + ], + "score": 0.55, + "latex": "s _ { \\eta } = \\{ \\}" + }, + { + "category_id": 13, + "poly": [ + 756, + 1375, + 785, + 1375, + 785, + 1402, + 756, + 1402 + ], + "score": 0.54, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 344, + 1131, + 408, + 1131, + 408, + 1159, + 344, + 1159 + ], + "score": 0.5, + "latex": "i = 0" + }, + { + "category_id": 13, + "poly": [ + 739, + 1253, + 760, + 1253, + 760, + 1279, + 739, + 1279 + ], + "score": 0.44, + "latex": "\\mathrm { L }" + }, + { + "category_id": 13, + "poly": [ + 858, + 463, + 965, + 463, + 965, + 501, + 858, + 501 + ], + "score": 0.42, + "latex": "s _ { \\eta _ { \\mu } } = \\{ \\}" + }, + { + "category_id": 13, + "poly": [ + 781, + 1375, + 878, + 1375, + 878, + 1405, + 781, + 1405 + ], + "score": 0.42, + "latex": "( s , a , r )" + }, + { + "category_id": 13, + "poly": [ + 448, + 1159, + 798, + 1159, + 798, + 1194, + 448, + 1194 + ], + "score": 0.4, + "latex": "Q _ { \\omega _ { i } } ( a , s ) , \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\eta , \\eta _ { \\mu } , \\eta _ { \\Sigma }" + }, + { + "category_id": 13, + "poly": [ + 418, + 1132, + 525, + 1132, + 525, + 1159, + 418, + 1159 + ], + "score": 0.4, + "latex": "L _ { \\mathrm { c u r r } } = 0" + }, + { + "category_id": 13, + "poly": [ + 468, + 1662, + 862, + 1662, + 862, + 1695, + 468, + 1695 + ], + "score": 0.37, + "latex": "[ \\delta _ { \\eta _ { \\mu } } , \\delta _ { \\eta _ { \\Sigma } } ] \\stackrel { - } { = } \\alpha \\partial _ { \\eta _ { \\mu } , \\eta _ { \\Sigma } } { \\cal L } ( \\theta _ { k } , \\eta _ { \\mu } , \\eta _ { \\Sigma } )" + }, + { + "category_id": 13, + "poly": [ + 469, + 1696, + 785, + 1696, + 785, + 1731, + 469, + 1731 + ], + "score": 0.34, + "latex": "\\delta _ { \\theta } = \\partial _ { \\theta } L ( \\theta , \\eta _ { \\mu _ { k + 1 } } , \\eta _ { \\Sigma k + 1 } )" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 818.0, + 73.0, + 818.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 332.0, + 598.0, + 332.0, + 598.0, + 378.0, + 293.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1059.0, + 1074.0, + 1059.0, + 1074.0, + 1099.0, + 297.0, + 1099.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2124.0, + 830.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2124.0, + 830.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1096.0, + 601.0, + 1096.0, + 601.0, + 1137.0, + 307.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1128.0, + 343.0, + 1128.0, + 343.0, + 1165.0, + 307.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 409.0, + 1128.0, + 417.0, + 1128.0, + 417.0, + 1165.0, + 409.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 526.0, + 1128.0, + 532.0, + 1128.0, + 532.0, + 1165.0, + 526.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 1153.0, + 447.0, + 1153.0, + 447.0, + 1198.0, + 305.0, + 1198.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 1188.0, + 568.0, + 1188.0, + 568.0, + 1223.0, + 306.0, + 1223.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1221.0, + 340.0, + 1221.0, + 340.0, + 1252.0, + 308.0, + 1252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 1218.0, + 455.0, + 1218.0, + 455.0, + 1255.0, + 380.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 603.0, + 1218.0, + 644.0, + 1218.0, + 644.0, + 1255.0, + 603.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1253.0, + 340.0, + 1253.0, + 340.0, + 1283.0, + 307.0, + 1283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1249.0, + 656.0, + 1249.0, + 656.0, + 1286.0, + 423.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 1249.0, + 738.0, + 1249.0, + 738.0, + 1286.0, + 681.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 1249.0, + 1141.0, + 1249.0, + 1141.0, + 1286.0, + 761.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1282.0, + 340.0, + 1282.0, + 340.0, + 1314.0, + 308.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1280.0, + 426.0, + 1280.0, + 426.0, + 1314.0, + 423.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.0, + 1280.0, + 504.0, + 1280.0, + 504.0, + 1314.0, + 500.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1313.0, + 340.0, + 1313.0, + 340.0, + 1344.0, + 307.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 1309.0, + 876.0, + 1309.0, + 876.0, + 1346.0, + 422.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 304.0, + 1341.0, + 341.0, + 1341.0, + 341.0, + 1376.0, + 304.0, + 1376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 1342.0, + 496.0, + 1342.0, + 496.0, + 1374.0, + 426.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 610.0, + 1342.0, + 648.0, + 1342.0, + 648.0, + 1374.0, + 610.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1374.0, + 340.0, + 1374.0, + 340.0, + 1406.0, + 297.0, + 1406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.0, + 1371.0, + 699.0, + 1371.0, + 699.0, + 1408.0, + 466.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 1371.0, + 755.0, + 1371.0, + 755.0, + 1408.0, + 724.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 1371.0, + 1080.0, + 1371.0, + 1080.0, + 1408.0, + 879.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1403.0, + 340.0, + 1403.0, + 340.0, + 1437.0, + 297.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.0, + 1401.0, + 552.0, + 1401.0, + 552.0, + 1440.0, + 466.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 587.0, + 1401.0, + 995.0, + 1401.0, + 995.0, + 1440.0, + 587.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1019.0, + 1401.0, + 1027.0, + 1401.0, + 1027.0, + 1440.0, + 1019.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1142.0, + 1401.0, + 1405.0, + 1401.0, + 1405.0, + 1440.0, + 1142.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1433.0, + 340.0, + 1433.0, + 340.0, + 1466.0, + 297.0, + 1466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 1432.0, + 1072.0, + 1432.0, + 1072.0, + 1467.0, + 465.0, + 1467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1463.0, + 340.0, + 1463.0, + 340.0, + 1497.0, + 297.0, + 1497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 1461.0, + 725.0, + 1461.0, + 725.0, + 1499.0, + 464.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1494.0, + 340.0, + 1494.0, + 340.0, + 1527.0, + 296.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 1491.0, + 468.0, + 1491.0, + 468.0, + 1535.0, + 463.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 1491.0, + 641.0, + 1491.0, + 641.0, + 1535.0, + 638.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1524.0, + 340.0, + 1524.0, + 340.0, + 1558.0, + 296.0, + 1558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 1519.0, + 679.0, + 1519.0, + 679.0, + 1563.0, + 463.0, + 1563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1557.0, + 340.0, + 1557.0, + 340.0, + 1590.0, + 296.0, + 1590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 1550.0, + 468.0, + 1550.0, + 468.0, + 1594.0, + 464.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 617.0, + 1550.0, + 621.0, + 1550.0, + 621.0, + 1594.0, + 617.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1596.0, + 340.0, + 1596.0, + 340.0, + 1631.0, + 297.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1632.0, + 340.0, + 1632.0, + 340.0, + 1665.0, + 297.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 1626.0, + 688.0, + 1626.0, + 688.0, + 1670.0, + 464.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 1616.0, + 872.0, + 1616.0, + 872.0, + 1644.0, + 847.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1662.0, + 340.0, + 1662.0, + 340.0, + 1696.0, + 296.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 462.0, + 1655.0, + 467.0, + 1655.0, + 467.0, + 1709.0, + 462.0, + 1709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 1655.0, + 868.0, + 1655.0, + 868.0, + 1709.0, + 863.0, + 1709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1692.0, + 340.0, + 1692.0, + 340.0, + 1726.0, + 294.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 1688.0, + 468.0, + 1688.0, + 468.0, + 1737.0, + 463.0, + 1737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 786.0, + 1688.0, + 794.0, + 1688.0, + 794.0, + 1737.0, + 786.0, + 1737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1722.0, + 340.0, + 1722.0, + 340.0, + 1756.0, + 294.0, + 1756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.0, + 1721.0, + 811.0, + 1721.0, + 811.0, + 1756.0, + 466.0, + 1756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1753.0, + 338.0, + 1753.0, + 338.0, + 1787.0, + 296.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.0, + 1752.0, + 840.0, + 1752.0, + 840.0, + 1787.0, + 466.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1782.0, + 341.0, + 1782.0, + 341.0, + 1819.0, + 294.0, + 1819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 1778.0, + 711.0, + 1778.0, + 711.0, + 1824.0, + 463.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1812.0, + 340.0, + 1812.0, + 340.0, + 1850.0, + 295.0, + 1850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1847.0, + 340.0, + 1847.0, + 340.0, + 1880.0, + 294.0, + 1880.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 745.0, + 1843.0, + 748.0, + 1843.0, + 748.0, + 1885.0, + 745.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1874.0, + 342.0, + 1874.0, + 342.0, + 1915.0, + 294.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 1579.0, + 941.0, + 1579.0, + 941.0, + 1641.0, + 454.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 368.0, + 409.0, + 368.0, + 409.0, + 410.0, + 308.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 437.0, + 368.0, + 789.0, + 368.0, + 789.0, + 410.0, + 437.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 403.0, + 512.0, + 403.0, + 512.0, + 435.0, + 309.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 435.0, + 339.0, + 435.0, + 339.0, + 466.0, + 308.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 432.0, + 487.0, + 432.0, + 487.0, + 464.0, + 382.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 465.0, + 338.0, + 465.0, + 338.0, + 496.0, + 308.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 459.0, + 645.0, + 459.0, + 645.0, + 504.0, + 380.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 495.0, + 338.0, + 495.0, + 338.0, + 526.0, + 308.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 496.0, + 455.0, + 496.0, + 455.0, + 525.0, + 385.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 496.0, + 582.0, + 496.0, + 582.0, + 525.0, + 544.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 526.0, + 338.0, + 526.0, + 338.0, + 558.0, + 308.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 526.0, + 809.0, + 526.0, + 809.0, + 556.0, + 424.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 557.0, + 338.0, + 557.0, + 338.0, + 589.0, + 308.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 587.0, + 339.0, + 587.0, + 339.0, + 618.0, + 308.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 618.0, + 338.0, + 618.0, + 338.0, + 648.0, + 306.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 649.0, + 339.0, + 649.0, + 339.0, + 680.0, + 298.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 416.0, + 643.0, + 421.0, + 643.0, + 421.0, + 689.0, + 416.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 682.0, + 339.0, + 682.0, + 339.0, + 716.0, + 296.0, + 716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 418.0, + 678.0, + 421.0, + 678.0, + 421.0, + 720.0, + 418.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 718.0, + 339.0, + 718.0, + 339.0, + 753.0, + 296.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 719.0, + 901.0, + 719.0, + 901.0, + 753.0, + 384.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 750.0, + 341.0, + 750.0, + 341.0, + 783.0, + 295.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 416.0, + 757.0, + 599.0, + 757.0, + 599.0, + 786.0, + 416.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 780.0, + 340.0, + 780.0, + 340.0, + 813.0, + 295.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 783.0, + 748.0, + 783.0, + 748.0, + 812.0, + 382.0, + 812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 421.75, + 554.0, + 623.75, + 554.0, + 623.75, + 592.0, + 421.75, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 584.0, + 619.0, + 584.0, + 619.0, + 621.0, + 422.0, + 621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1059.0, + 1074.0, + 1059.0, + 1074.0, + 1099.0, + 297.0, + 1099.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 20, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 751, + 1407, + 751, + 1407, + 1551, + 297, + 1551 + ], + "score": 0.94 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.869 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 865, + 2088, + 865, + 2113, + 834, + 2113 + ], + "score": 0.837 + }, + { + "category_id": 0, + "poly": [ + 297, + 708, + 1017, + 708, + 1017, + 740, + 297, + 740 + ], + "score": 0.582 + }, + { + "category_id": 13, + "poly": [ + 1057, + 1048, + 1176, + 1048, + 1176, + 1082, + 1057, + 1082 + ], + "score": 0.92, + "latex": "\\dot { \\pi } ( a | s , \\theta _ { k } )" + }, + { + "category_id": 13, + "poly": [ + 712, + 1415, + 868, + 1415, + 868, + 1449, + 712, + 1449 + ], + "score": 0.91, + "latex": "\\phi , \\theta , \\eta , \\eta _ { \\mu } , \\eta _ { \\Sigma }" + }, + { + "category_id": 13, + "poly": [ + 456, + 867, + 602, + 867, + 602, + 898, + 456, + 898 + ], + "score": 0.87, + "latex": "L _ { \\mathrm { c u r r } } < L _ { \\mathrm { m a x } }" + }, + { + "category_id": 14, + "poly": [ + 422, + 1440, + 744, + 1440, + 744, + 1545, + 422, + 1545 + ], + "score": 0.85, + "latex": "\\begin{array} { r } { k = k + 1 ^ { \\mathbf { \\complement } } } \\\\ { i = i + 1 , L _ { \\mathrm { c u r r } } = L _ { \\mathrm { c u r r } } + L } \\\\ { \\pmb { \\theta } _ { i } = \\pmb { \\theta } , \\phi ^ { \\prime } = \\phi } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 497, + 988, + 609, + 988, + 609, + 1017, + 497, + 1017 + ], + "score": 0.85, + "latex": "k < 1 0 0 0" + }, + { + "category_id": 13, + "poly": [ + 469, + 1170, + 637, + 1170, + 637, + 1208, + 469, + 1208 + ], + "score": 0.84, + "latex": "\\delta _ { \\phi } = \\partial _ { \\phi } L _ { \\phi } ^ { \\prime } ( \\phi )" + }, + { + "category_id": 13, + "poly": [ + 700, + 1020, + 723, + 1020, + 723, + 1046, + 700, + 1046 + ], + "score": 0.82, + "latex": "\\boldsymbol { B }" + }, + { + "category_id": 13, + "poly": [ + 657, + 898, + 680, + 898, + 680, + 924, + 657, + 924 + ], + "score": 0.8, + "latex": "\\boldsymbol { B }" + }, + { + "category_id": 13, + "poly": [ + 556, + 1050, + 589, + 1050, + 589, + 1076, + 556, + 1076 + ], + "score": 0.77, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 478, + 1329, + 496, + 1329, + 496, + 1354, + 478, + 1354 + ], + "score": 0.75, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 1023, + 1050, + 1045, + 1050, + 1045, + 1076, + 1023, + 1076 + ], + "score": 0.7, + "latex": "\\boldsymbol { B }" + }, + { + "category_id": 13, + "poly": [ + 448, + 806, + 558, + 806, + 558, + 839, + 448, + 839 + ], + "score": 0.68, + "latex": "Q _ { \\omega _ { i } } ( a , s )" + }, + { + "category_id": 13, + "poly": [ + 766, + 1020, + 878, + 1020, + 878, + 1050, + 766, + 1050 + ], + "score": 0.55, + "latex": "\\mathrm { ~ V ~ } ( s , a , r )" + }, + { + "category_id": 14, + "poly": [ + 427, + 927, + 499, + 927, + 499, + 957, + 427, + 957 + ], + "score": 0.54, + "latex": "k = 0" + }, + { + "category_id": 13, + "poly": [ + 756, + 1020, + 785, + 1020, + 785, + 1046, + 756, + 1046 + ], + "score": 0.49, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 738, + 898, + 760, + 898, + 760, + 924, + 738, + 924 + ], + "score": 0.43, + "latex": "\\mathrm { L }" + }, + { + "category_id": 13, + "poly": [ + 447, + 804, + 797, + 804, + 797, + 840, + 447, + 840 + ], + "score": 0.4, + "latex": "Q _ { \\omega _ { i } } ( a , s ) , \\pi ( a | s , \\pmb { \\theta } _ { i } ) , \\eta , \\eta _ { \\mu } , \\eta _ { \\Sigma }" + }, + { + "category_id": 14, + "poly": [ + 467, + 1230, + 863, + 1230, + 863, + 1301, + 467, + 1301 + ], + "score": 0.39, + "latex": "\\begin{array} { r l } & { \\bigl [ \\delta _ { \\eta _ { \\mu } } , \\delta _ { \\eta _ { \\Sigma } } \\bigr ] ^ { \\circ } = \\alpha \\partial _ { \\eta _ { \\mu } , \\eta _ { \\Sigma } } L ( \\pmb \\theta _ { k } , \\eta _ { \\mu } , \\eta _ { \\Sigma } ) } \\\\ & { \\delta _ { \\theta } = \\partial _ { \\theta } L ( \\pmb \\theta , \\eta _ { \\mu _ { k + 1 } } , \\eta _ { \\Sigma k + 1 , \\eta } , } \\\\ & { \\dots , \\dots } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 343, + 776, + 408, + 776, + 408, + 804, + 343, + 804 + ], + "score": 0.36, + "latex": "i = 0" + }, + { + "category_id": 13, + "poly": [ + 468, + 1230, + 858, + 1230, + 858, + 1263, + 468, + 1263 + ], + "score": 0.35, + "latex": "[ \\delta _ { \\eta _ { u } } , \\delta _ { \\eta _ { \\Sigma } } ] ^ { - } ] ^ { - } = \\alpha \\partial _ { \\eta _ { u } , \\eta _ { \\Sigma } } L ( \\pmb \\theta _ { k } , \\eta _ { \\mu } , \\eta _ { \\Sigma } )" + }, + { + "category_id": 13, + "poly": [ + 427, + 927, + 499, + 927, + 499, + 956, + 427, + 956 + ], + "score": 0.33, + "latex": "k = 0" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 817.0, + 73.0, + 817.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2125.0, + 829.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 705.0, + 1018.0, + 705.0, + 1018.0, + 745.0, + 297.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 740.0, + 577.0, + 740.0, + 577.0, + 783.0, + 307.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 773.0, + 342.0, + 773.0, + 342.0, + 810.0, + 306.0, + 810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 409.0, + 773.0, + 531.0, + 773.0, + 531.0, + 810.0, + 409.0, + 810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 304.0, + 798.0, + 446.0, + 798.0, + 446.0, + 844.0, + 304.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 833.0, + 567.0, + 833.0, + 567.0, + 868.0, + 306.0, + 868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 865.0, + 342.0, + 865.0, + 342.0, + 900.0, + 305.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 865.0, + 455.0, + 865.0, + 455.0, + 902.0, + 383.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 603.0, + 865.0, + 643.0, + 865.0, + 643.0, + 902.0, + 603.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 897.0, + 339.0, + 897.0, + 339.0, + 929.0, + 308.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 894.0, + 656.0, + 894.0, + 656.0, + 930.0, + 423.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 894.0, + 737.0, + 894.0, + 737.0, + 930.0, + 681.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 894.0, + 1142.0, + 894.0, + 1142.0, + 930.0, + 761.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 927.0, + 339.0, + 927.0, + 339.0, + 959.0, + 306.0, + 959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 926.0, + 426.0, + 926.0, + 426.0, + 957.0, + 423.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 957.0, + 339.0, + 957.0, + 339.0, + 990.0, + 308.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 958.0, + 875.0, + 958.0, + 875.0, + 990.0, + 423.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 987.0, + 339.0, + 987.0, + 339.0, + 1021.0, + 306.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 987.0, + 496.0, + 987.0, + 496.0, + 1019.0, + 426.0, + 1019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 610.0, + 987.0, + 649.0, + 987.0, + 649.0, + 1019.0, + 610.0, + 1019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1018.0, + 340.0, + 1018.0, + 340.0, + 1053.0, + 296.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 1014.0, + 699.0, + 1014.0, + 699.0, + 1055.0, + 464.0, + 1055.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 1014.0, + 755.0, + 1014.0, + 755.0, + 1055.0, + 724.0, + 1055.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 1014.0, + 1080.0, + 1014.0, + 1080.0, + 1055.0, + 879.0, + 1055.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1047.0, + 339.0, + 1047.0, + 339.0, + 1082.0, + 296.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 1047.0, + 555.0, + 1047.0, + 555.0, + 1083.0, + 465.0, + 1083.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 1047.0, + 1022.0, + 1047.0, + 1022.0, + 1083.0, + 590.0, + 1083.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 1047.0, + 1056.0, + 1047.0, + 1056.0, + 1083.0, + 1046.0, + 1083.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1177.0, + 1047.0, + 1404.0, + 1047.0, + 1404.0, + 1083.0, + 1177.0, + 1083.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1106.0, + 342.0, + 1106.0, + 342.0, + 1145.0, + 294.0, + 1145.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 1108.0, + 1071.0, + 1108.0, + 1071.0, + 1143.0, + 465.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1139.0, + 340.0, + 1139.0, + 340.0, + 1173.0, + 295.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 1137.0, + 725.0, + 1137.0, + 725.0, + 1177.0, + 464.0, + 1177.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1170.0, + 340.0, + 1170.0, + 340.0, + 1203.0, + 296.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 1168.0, + 468.0, + 1168.0, + 468.0, + 1209.0, + 464.0, + 1209.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 1168.0, + 642.0, + 1168.0, + 642.0, + 1209.0, + 638.0, + 1209.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1201.0, + 340.0, + 1201.0, + 340.0, + 1234.0, + 296.0, + 1234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 1196.0, + 681.0, + 1196.0, + 681.0, + 1239.0, + 463.0, + 1239.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1232.0, + 340.0, + 1232.0, + 340.0, + 1265.0, + 296.0, + 1265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 462.0, + 1222.0, + 466.0, + 1222.0, + 466.0, + 1278.0, + 462.0, + 1278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 864.0, + 1222.0, + 867.0, + 1222.0, + 867.0, + 1278.0, + 864.0, + 1278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1261.0, + 340.0, + 1261.0, + 340.0, + 1295.0, + 296.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 1257.0, + 466.0, + 1257.0, + 466.0, + 1306.0, + 463.0, + 1306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1292.0, + 339.0, + 1292.0, + 339.0, + 1326.0, + 296.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 1290.0, + 1404.0, + 1290.0, + 1404.0, + 1326.0, + 465.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 342.0, + 1321.0, + 477.0, + 1321.0, + 477.0, + 1357.0, + 342.0, + 1357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 1321.0, + 734.0, + 1321.0, + 734.0, + 1357.0, + 497.0, + 1357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1350.0, + 342.0, + 1350.0, + 342.0, + 1387.0, + 296.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.0, + 1353.0, + 810.0, + 1353.0, + 810.0, + 1385.0, + 466.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1382.0, + 339.0, + 1382.0, + 339.0, + 1416.0, + 295.0, + 1416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.0, + 1381.0, + 839.0, + 1381.0, + 839.0, + 1417.0, + 466.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1413.0, + 340.0, + 1413.0, + 340.0, + 1446.0, + 294.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 1408.0, + 711.0, + 1408.0, + 711.0, + 1454.0, + 464.0, + 1454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 1408.0, + 872.0, + 1408.0, + 872.0, + 1454.0, + 869.0, + 1454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1444.0, + 339.0, + 1444.0, + 339.0, + 1477.0, + 295.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1476.0, + 340.0, + 1476.0, + 340.0, + 1510.0, + 294.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1506.0, + 339.0, + 1506.0, + 339.0, + 1541.0, + 294.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 1076.5, + 412.0, + 1076.5, + 412.0, + 1115.5, + 334.0, + 1115.5 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 21, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/S1giVsRcYm/images/059441974e832282d591534b3e9fdedeaa659618cb27a8814cdc933e37295fa8.jpg b/parse/train/S1giVsRcYm/images/059441974e832282d591534b3e9fdedeaa659618cb27a8814cdc933e37295fa8.jpg new file mode 100644 index 0000000000000000000000000000000000000000..16b55f3fa9306fae53ff338329257c72843c7d32 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/059441974e832282d591534b3e9fdedeaa659618cb27a8814cdc933e37295fa8.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e84599ca269519dc81e92dfae320541f226432f320324d21c1c7bea6d4a0e8d2 +size 22066 diff --git a/parse/train/S1giVsRcYm/images/061bd8d1a384099d358ae1573ac39db89a41c8c033a0514cf718e608ba8aee28.jpg b/parse/train/S1giVsRcYm/images/061bd8d1a384099d358ae1573ac39db89a41c8c033a0514cf718e608ba8aee28.jpg new file mode 100644 index 0000000000000000000000000000000000000000..03b974a74650f872809c5ba98821d07e35f58461 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/061bd8d1a384099d358ae1573ac39db89a41c8c033a0514cf718e608ba8aee28.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:080aadbb0c85ce45f51d9f489ba31bb9a9743cf4e9e561692cd3b7e059a3d419 +size 11135 diff --git a/parse/train/S1giVsRcYm/images/06777259c82f0ccaa6aeac35e63ab713437d0b554aafc97c1462a9e2c54607a2.jpg b/parse/train/S1giVsRcYm/images/06777259c82f0ccaa6aeac35e63ab713437d0b554aafc97c1462a9e2c54607a2.jpg new file mode 100644 index 0000000000000000000000000000000000000000..edaba81027cf88609d7a458053e2507d16a3d899 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/06777259c82f0ccaa6aeac35e63ab713437d0b554aafc97c1462a9e2c54607a2.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c786ce0502906358a8342bd38f649ebd0e4ebe3cb411bf9c6a6915acd2f4abef +size 32317 diff --git a/parse/train/S1giVsRcYm/images/091e7bb9a3312459720a21dd2cfe25d8c65a8c21722874b0c664a5e5e7b4daba.jpg b/parse/train/S1giVsRcYm/images/091e7bb9a3312459720a21dd2cfe25d8c65a8c21722874b0c664a5e5e7b4daba.jpg new file mode 100644 index 0000000000000000000000000000000000000000..a83caaa5fe9f65644e71989891727f91c1dcc3d6 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/091e7bb9a3312459720a21dd2cfe25d8c65a8c21722874b0c664a5e5e7b4daba.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:22667898d46e63848abd49c271c80ac71e965d32cc704413add952200e23c915 +size 6856 diff --git a/parse/train/S1giVsRcYm/images/13a28f2b83934a75438c8dc1588da4ccadcc83c98681fcf0e8b880b07984f7c9.jpg b/parse/train/S1giVsRcYm/images/13a28f2b83934a75438c8dc1588da4ccadcc83c98681fcf0e8b880b07984f7c9.jpg new file mode 100644 index 0000000000000000000000000000000000000000..459fef3d7659eb1589da1003368fdaf12fe4c27c --- /dev/null +++ b/parse/train/S1giVsRcYm/images/13a28f2b83934a75438c8dc1588da4ccadcc83c98681fcf0e8b880b07984f7c9.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3b7b84c4660132bb81fe372e315fe291205237f5bf80a534346c9955f8c8611d +size 14587 diff --git a/parse/train/S1giVsRcYm/images/15dc1adcddf8f40e97e6644f49d2e6ee32ee47c0680d69312994a9e65c19f880.jpg b/parse/train/S1giVsRcYm/images/15dc1adcddf8f40e97e6644f49d2e6ee32ee47c0680d69312994a9e65c19f880.jpg new file mode 100644 index 0000000000000000000000000000000000000000..5c7ef5328fe6aa3ad8b61d475ac51ffb7081daa2 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/15dc1adcddf8f40e97e6644f49d2e6ee32ee47c0680d69312994a9e65c19f880.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:eee32128068f60f9444d4e920add4e7dfb5a8ab3fa26fcb709c6e2c4a79f2ae9 +size 6602 diff --git a/parse/train/S1giVsRcYm/images/18e8c30ed0ec83cf54285117b5af472ba2d6eb25775712948f4ebc19f8d6115e.jpg b/parse/train/S1giVsRcYm/images/18e8c30ed0ec83cf54285117b5af472ba2d6eb25775712948f4ebc19f8d6115e.jpg new file mode 100644 index 0000000000000000000000000000000000000000..b5481f709c37d838b169d6b0f66ae51ff22f8607 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/18e8c30ed0ec83cf54285117b5af472ba2d6eb25775712948f4ebc19f8d6115e.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:afab57494764d98edc7a27be46c811abf91f02d23310b70a018427263996c4e4 +size 4737 diff --git a/parse/train/S1giVsRcYm/images/286328f00678c0663ca421a47ef5384c31a48b08747b8d59c7c2901770b46e0b.jpg b/parse/train/S1giVsRcYm/images/286328f00678c0663ca421a47ef5384c31a48b08747b8d59c7c2901770b46e0b.jpg new file mode 100644 index 0000000000000000000000000000000000000000..8c5ad08d29e2d61846eb5458a79d23b55aa67cdf --- /dev/null +++ b/parse/train/S1giVsRcYm/images/286328f00678c0663ca421a47ef5384c31a48b08747b8d59c7c2901770b46e0b.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3032da47bcb966ac9bfb82059a291607868bdf72860142a622dbe98c5b1b6913 +size 13999 diff --git a/parse/train/S1giVsRcYm/images/28bf9ab781d9bb5f28f001a2e32c324153d315663e4578797035247ea5aeba81.jpg b/parse/train/S1giVsRcYm/images/28bf9ab781d9bb5f28f001a2e32c324153d315663e4578797035247ea5aeba81.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f4608d5ea12ee58ea276aa2fb79812f64f059e4e --- /dev/null +++ b/parse/train/S1giVsRcYm/images/28bf9ab781d9bb5f28f001a2e32c324153d315663e4578797035247ea5aeba81.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:18a953128002b55ba13f2f6a70e6b81ff0390e05f6fcc3da846cd440617ceea2 +size 6866 diff --git a/parse/train/S1giVsRcYm/images/32feb89b4290fa3a14153ec73f1d35cbc4a2a3616fea6a2a95a22ad84cc40cce.jpg b/parse/train/S1giVsRcYm/images/32feb89b4290fa3a14153ec73f1d35cbc4a2a3616fea6a2a95a22ad84cc40cce.jpg new file mode 100644 index 0000000000000000000000000000000000000000..05590967eb1d1fcda31a89c84984287d0962145d --- /dev/null +++ b/parse/train/S1giVsRcYm/images/32feb89b4290fa3a14153ec73f1d35cbc4a2a3616fea6a2a95a22ad84cc40cce.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:841754811e490ca765c78d08911c00ef89cc04bd489e85c9ab192d62f2b12598 +size 5384 diff --git a/parse/train/S1giVsRcYm/images/518f7be9be65a0c7e2276b84772286709964d7de559e6dfb974ac3867e7d4318.jpg b/parse/train/S1giVsRcYm/images/518f7be9be65a0c7e2276b84772286709964d7de559e6dfb974ac3867e7d4318.jpg new file mode 100644 index 0000000000000000000000000000000000000000..26fc3f64b45291d1b24c62455cc26ec8177541d5 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/518f7be9be65a0c7e2276b84772286709964d7de559e6dfb974ac3867e7d4318.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3e288cecbe9cc7564ad79824fd5e4a862f837c34125e246ee41593ebc45633fb +size 6138 diff --git a/parse/train/S1giVsRcYm/images/5618f78349bcdb9597ea629f0f175ee3dd97eba228e5a3c7f4d763ed84195aee.jpg b/parse/train/S1giVsRcYm/images/5618f78349bcdb9597ea629f0f175ee3dd97eba228e5a3c7f4d763ed84195aee.jpg new file mode 100644 index 0000000000000000000000000000000000000000..30bb522a93079e218f5a54f5299670c3d76d87be --- /dev/null +++ b/parse/train/S1giVsRcYm/images/5618f78349bcdb9597ea629f0f175ee3dd97eba228e5a3c7f4d763ed84195aee.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:bc697d831051216ebf39501a30d3296dde9785e0e96a69937145920843db1185 +size 49665 diff --git a/parse/train/S1giVsRcYm/images/5668527eec930a068c0c61f8e7ce73a9f8d40ed779bcb71ff47bdc04db2eb83b.jpg b/parse/train/S1giVsRcYm/images/5668527eec930a068c0c61f8e7ce73a9f8d40ed779bcb71ff47bdc04db2eb83b.jpg new file mode 100644 index 0000000000000000000000000000000000000000..e443304942c25b139bd2df3110325678382c55e1 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/5668527eec930a068c0c61f8e7ce73a9f8d40ed779bcb71ff47bdc04db2eb83b.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:fba679ad6a1fcee6469b88e714544bfc6f481437c23ae2667875b50464e153d2 +size 43538 diff --git a/parse/train/S1giVsRcYm/images/6c62f359bea45a1cd43b4968519708b3fe3ee7b31ae67debd65938709f6fc1e6.jpg b/parse/train/S1giVsRcYm/images/6c62f359bea45a1cd43b4968519708b3fe3ee7b31ae67debd65938709f6fc1e6.jpg new file mode 100644 index 0000000000000000000000000000000000000000..54f53e20178dae866d4a418c08749ebbce32f695 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/6c62f359bea45a1cd43b4968519708b3fe3ee7b31ae67debd65938709f6fc1e6.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c0f1056d6c58ec696caa20a26a493aebaabc5ea644692297e79b52fe272ac2f8 +size 5229 diff --git a/parse/train/S1giVsRcYm/images/8b19b9200c0b0a39c5813ca8095f76fc46a45426ff7095f9b8b4bb3b1ee87de2.jpg b/parse/train/S1giVsRcYm/images/8b19b9200c0b0a39c5813ca8095f76fc46a45426ff7095f9b8b4bb3b1ee87de2.jpg new file mode 100644 index 0000000000000000000000000000000000000000..42aa89a178c0d8e23aa8f3346a180858ef085585 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/8b19b9200c0b0a39c5813ca8095f76fc46a45426ff7095f9b8b4bb3b1ee87de2.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:29eea57fc80076740d8b9a6435867e06a5df0ad260742bdcc9d06e0bee69ad7d +size 3918 diff --git a/parse/train/S1giVsRcYm/images/9db3a09270e1ee7748f875502cc4869cbfc8bf86deaea7e207689299f65a3508.jpg b/parse/train/S1giVsRcYm/images/9db3a09270e1ee7748f875502cc4869cbfc8bf86deaea7e207689299f65a3508.jpg new file mode 100644 index 0000000000000000000000000000000000000000..666f0d51c908728927befef1dd7d936ba7a562df --- /dev/null +++ b/parse/train/S1giVsRcYm/images/9db3a09270e1ee7748f875502cc4869cbfc8bf86deaea7e207689299f65a3508.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:14af137a034f835ad9cb312c519e1d6631243a5f7d0de77155359ee8a1bd0eac +size 5164 diff --git a/parse/train/S1giVsRcYm/images/bbb44cdfd041485a660543a51dd1db6a2bf9f041a958d366b4beb2c6624ee918.jpg b/parse/train/S1giVsRcYm/images/bbb44cdfd041485a660543a51dd1db6a2bf9f041a958d366b4beb2c6624ee918.jpg new file mode 100644 index 0000000000000000000000000000000000000000..7659d0c5897d596f2315ca8bc40d40e487854e9e --- /dev/null +++ b/parse/train/S1giVsRcYm/images/bbb44cdfd041485a660543a51dd1db6a2bf9f041a958d366b4beb2c6624ee918.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3cf67c5be58504cdbad035574061fb847e7450f8906374bd137dd4cd44c646bd +size 49333 diff --git a/parse/train/S1giVsRcYm/images/bbdf7a6af1788c393684e30e5aeec707af50ba22f4946c0849193a8a8dccce05.jpg b/parse/train/S1giVsRcYm/images/bbdf7a6af1788c393684e30e5aeec707af50ba22f4946c0849193a8a8dccce05.jpg new file mode 100644 index 0000000000000000000000000000000000000000..5732c10f9641152949918f9383bd24c23cd9e51c --- /dev/null +++ b/parse/train/S1giVsRcYm/images/bbdf7a6af1788c393684e30e5aeec707af50ba22f4946c0849193a8a8dccce05.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f9949cd3541ab9220d7366496710971e58236da0dadd47e80911e2764064952d +size 50645 diff --git a/parse/train/S1giVsRcYm/images/c470c121a818a7c0017c16b86a883a0e17c98a2d1f9800cdcf20d56550b46038.jpg b/parse/train/S1giVsRcYm/images/c470c121a818a7c0017c16b86a883a0e17c98a2d1f9800cdcf20d56550b46038.jpg new file mode 100644 index 0000000000000000000000000000000000000000..dd71545de3fbd14d0b0cffa158df966ce44b6212 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/c470c121a818a7c0017c16b86a883a0e17c98a2d1f9800cdcf20d56550b46038.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:4be31f30442b9132bf36300c5ffa8354789d51c7bb690e4efb8d0e2d07c1650f +size 3703 diff --git a/parse/train/S1giVsRcYm/images/d24ccac5c0147db6ad097cc1f02e3ce9f2cc7b4459f404faa249db0b3dc240c5.jpg b/parse/train/S1giVsRcYm/images/d24ccac5c0147db6ad097cc1f02e3ce9f2cc7b4459f404faa249db0b3dc240c5.jpg new file mode 100644 index 0000000000000000000000000000000000000000..25304e960879035e644c16c0a3356e98928475d0 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/d24ccac5c0147db6ad097cc1f02e3ce9f2cc7b4459f404faa249db0b3dc240c5.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:da5a1464e4c0c1c1357467318ad834bbb71271f79a3006a9beeab78406d78cd1 +size 5857 diff --git a/parse/train/S1giVsRcYm/images/d6d739ad291411fdbea9cc046ca7a4a0c3c72cd8cbb1947ce71e832e5aae22ea.jpg b/parse/train/S1giVsRcYm/images/d6d739ad291411fdbea9cc046ca7a4a0c3c72cd8cbb1947ce71e832e5aae22ea.jpg new file mode 100644 index 0000000000000000000000000000000000000000..10b4d7e432012684f0b116f84dfe91d076dfa0f5 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/d6d739ad291411fdbea9cc046ca7a4a0c3c72cd8cbb1947ce71e832e5aae22ea.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8d270bfa005ad4017dc026c15df3b41fbab80c7cc43805578d660106ed5eb8fe +size 24102 diff --git a/parse/train/S1giVsRcYm/images/dd304161ae78a40ee1eca89a344917df6d9d71c206502faccf5ca5938178fa10.jpg b/parse/train/S1giVsRcYm/images/dd304161ae78a40ee1eca89a344917df6d9d71c206502faccf5ca5938178fa10.jpg new file mode 100644 index 0000000000000000000000000000000000000000..70b86fcb4cbd829c0811c957144018f41f1338f8 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/dd304161ae78a40ee1eca89a344917df6d9d71c206502faccf5ca5938178fa10.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:dd17e2645c654ee4c63cc4ea403ec1960d41f804ab4da54c582c87699baa1f32 +size 4936 diff --git a/parse/train/S1giVsRcYm/images/e2053845fb561a493451234ac3eeadd37a4d4b9813b1e7cea294ca67f465afa3.jpg b/parse/train/S1giVsRcYm/images/e2053845fb561a493451234ac3eeadd37a4d4b9813b1e7cea294ca67f465afa3.jpg new file mode 100644 index 0000000000000000000000000000000000000000..9bb496a1c1644a2d3c32192d89841df4c3164408 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/e2053845fb561a493451234ac3eeadd37a4d4b9813b1e7cea294ca67f465afa3.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:02143482bb734809cfa08d60f8655db5adfa95db3a0dfb12606821759317649a +size 6324 diff --git a/parse/train/S1giVsRcYm/images/eb9111f84b7d58830be7c892a08041f6b27e57efde5fa43f3d31ecd564c92d81.jpg b/parse/train/S1giVsRcYm/images/eb9111f84b7d58830be7c892a08041f6b27e57efde5fa43f3d31ecd564c92d81.jpg new file mode 100644 index 0000000000000000000000000000000000000000..bea420be6902b98d7d072faaea89c53ae06d84e8 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/eb9111f84b7d58830be7c892a08041f6b27e57efde5fa43f3d31ecd564c92d81.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:be29b0e8eba8d309186bc6994cc028d162a4bbd328dd0598b8a2a90006831254 +size 4350 diff --git a/parse/train/S1giVsRcYm/images/f32c5c28aa96c691cd2490833e2718c882a8db0510c45acacb1908ccb21959ae.jpg b/parse/train/S1giVsRcYm/images/f32c5c28aa96c691cd2490833e2718c882a8db0510c45acacb1908ccb21959ae.jpg new file mode 100644 index 0000000000000000000000000000000000000000..fad8aa0e70e17bf6efa9aa4c07e80b344a5536d2 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/f32c5c28aa96c691cd2490833e2718c882a8db0510c45acacb1908ccb21959ae.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:86364a3b872505534eaff9b6be601aa63a6b4423b0fd58b6cdcc3632c6a5dfce +size 87006 diff --git a/parse/train/S1giVsRcYm/images/f6c90a40823122785dfe8b4e1b102ebeec0ec8bddaea3700aa201f4bd6f204ce.jpg b/parse/train/S1giVsRcYm/images/f6c90a40823122785dfe8b4e1b102ebeec0ec8bddaea3700aa201f4bd6f204ce.jpg new file mode 100644 index 0000000000000000000000000000000000000000..745003fe155f397fd748117d4ea80ada431690b6 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/f6c90a40823122785dfe8b4e1b102ebeec0ec8bddaea3700aa201f4bd6f204ce.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:93ac40b3dbef109b5dce811fdb51a4421f61b93a4a78eb0f9ca1affbb712a6a8 +size 9192 diff --git a/parse/train/S1giVsRcYm/images/f8dbfead3adb1a25a3854c792ecb15ae63e6e9619af25fc5af4a5ba36d5f24db.jpg b/parse/train/S1giVsRcYm/images/f8dbfead3adb1a25a3854c792ecb15ae63e6e9619af25fc5af4a5ba36d5f24db.jpg new file mode 100644 index 0000000000000000000000000000000000000000..83de0b2972fa81df0dae9c8e6de7b1305971194a --- /dev/null +++ b/parse/train/S1giVsRcYm/images/f8dbfead3adb1a25a3854c792ecb15ae63e6e9619af25fc5af4a5ba36d5f24db.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c1bfeb195cec59fcbf688546564adf2fbfa69d7cac35565df14062234087f5fb +size 9312 diff --git a/parse/train/S1giVsRcYm/images/fb5781582a0947e1de03549818a77980bd64bf8e1179bb182a987e4ccba94093.jpg b/parse/train/S1giVsRcYm/images/fb5781582a0947e1de03549818a77980bd64bf8e1179bb182a987e4ccba94093.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f97304f85cdf717c08c294efd3b5a1766f87bd09 --- /dev/null +++ b/parse/train/S1giVsRcYm/images/fb5781582a0947e1de03549818a77980bd64bf8e1179bb182a987e4ccba94093.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b72e22601d86cc609f7e5ef87ec7c885e650ab39edfdeeb4d6d351ac5d19ab33 +size 88896 diff --git a/parse/train/S1lwRjR9YX/images/07815526e545ab9b943635715ecdfc77a0f6431e859aebc379cd2d8b06ea05cc.jpg b/parse/train/S1lwRjR9YX/images/07815526e545ab9b943635715ecdfc77a0f6431e859aebc379cd2d8b06ea05cc.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f20a29569e7439c9951e8ba1420a97488afb5fab --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/07815526e545ab9b943635715ecdfc77a0f6431e859aebc379cd2d8b06ea05cc.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:994b5f9e3d1eb97a4a33a1e0f5e1864baec0b57b89b047a5450b5a7161a71827 +size 7557 diff --git a/parse/train/S1lwRjR9YX/images/096173fc5eb627de5b927381f209c0dbad50fd8f4ce7f7c7d226702b3b0499e2.jpg b/parse/train/S1lwRjR9YX/images/096173fc5eb627de5b927381f209c0dbad50fd8f4ce7f7c7d226702b3b0499e2.jpg new file mode 100644 index 0000000000000000000000000000000000000000..e3aefcb0b3c5dff1f9b48dfda4513e8ecfd34a10 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/096173fc5eb627de5b927381f209c0dbad50fd8f4ce7f7c7d226702b3b0499e2.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6deda7dfe0e89b4b639012f30af25226497684457c5146a4f8bb5777e3bcd390 +size 33679 diff --git a/parse/train/S1lwRjR9YX/images/1ec757026eb6b5c0dbfcbcfa1fa35e98deaa3e4a201931ef7d2eeb2941e4f955.jpg b/parse/train/S1lwRjR9YX/images/1ec757026eb6b5c0dbfcbcfa1fa35e98deaa3e4a201931ef7d2eeb2941e4f955.jpg new file mode 100644 index 0000000000000000000000000000000000000000..a8f7e422d8b95ff1a8235297420923e9d920b56b --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/1ec757026eb6b5c0dbfcbcfa1fa35e98deaa3e4a201931ef7d2eeb2941e4f955.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:783403b6c1c44bc1bfd1c617526a05e44dda39480f57276b77eae964246e88cc +size 8528 diff --git a/parse/train/S1lwRjR9YX/images/2c528b7c8220125fd29f48346594af296e90ee326e21a4db2d2512a7b4a1d554.jpg b/parse/train/S1lwRjR9YX/images/2c528b7c8220125fd29f48346594af296e90ee326e21a4db2d2512a7b4a1d554.jpg new file mode 100644 index 0000000000000000000000000000000000000000..1e2a91ad0418109a3fa614b7e943b0b76efff090 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/2c528b7c8220125fd29f48346594af296e90ee326e21a4db2d2512a7b4a1d554.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:098b2d81613816625ccfc6b3567e2e8d090d9cca58caad5e8f4e5f403ff57d49 +size 25307 diff --git a/parse/train/S1lwRjR9YX/images/32311ec90f44585cc3c554ff36f063af12a9ea3d9b95054a2799526da95acc3d.jpg b/parse/train/S1lwRjR9YX/images/32311ec90f44585cc3c554ff36f063af12a9ea3d9b95054a2799526da95acc3d.jpg new file mode 100644 index 0000000000000000000000000000000000000000..b36112b896f4b5ce6286ac5862dc1d5b62cccbe9 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/32311ec90f44585cc3c554ff36f063af12a9ea3d9b95054a2799526da95acc3d.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:006651613fc11c58a6205b556bdbfaee1489cdbd771d288f0ff32e8b8a152a99 +size 13930 diff --git a/parse/train/S1lwRjR9YX/images/3522e5e9487403699df7ec94c2df1d4e9ff777a55f20e150e8552c9034b84303.jpg b/parse/train/S1lwRjR9YX/images/3522e5e9487403699df7ec94c2df1d4e9ff777a55f20e150e8552c9034b84303.jpg new file mode 100644 index 0000000000000000000000000000000000000000..a7c53b307048350785f42521b26398fcc59d818c --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/3522e5e9487403699df7ec94c2df1d4e9ff777a55f20e150e8552c9034b84303.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c8d09effdbd28862119f03a5bcb3657621169125986c58196264bc5d47a153e8 +size 14187 diff --git a/parse/train/S1lwRjR9YX/images/3e79fc910d33315a92ac80f4e92d5f92a2a5a1c06dff17ec37a97d199ab63f73.jpg b/parse/train/S1lwRjR9YX/images/3e79fc910d33315a92ac80f4e92d5f92a2a5a1c06dff17ec37a97d199ab63f73.jpg new file mode 100644 index 0000000000000000000000000000000000000000..7404b1ae119a925fe0f9f1f1cb44ceed67a13c5c --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/3e79fc910d33315a92ac80f4e92d5f92a2a5a1c06dff17ec37a97d199ab63f73.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:63def1dd93d7be81d2778ae89c6f57389aeb94c3ece6b8a07e735755cb75cfe8 +size 43330 diff --git a/parse/train/S1lwRjR9YX/images/43a0a249a7620e8d06804649e98805839c5da54402019943cbdcf62a92d2b56c.jpg b/parse/train/S1lwRjR9YX/images/43a0a249a7620e8d06804649e98805839c5da54402019943cbdcf62a92d2b56c.jpg new file mode 100644 index 0000000000000000000000000000000000000000..a09c74cb09735b6fb5728ca5189e76407ac8712b --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/43a0a249a7620e8d06804649e98805839c5da54402019943cbdcf62a92d2b56c.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d75d4c7188490dfb5a228c3e8e7f5c79126acb5f74b355ec178560fd676f90fb +size 10897 diff --git a/parse/train/S1lwRjR9YX/images/46bb1616cd06afd1f9ae98b80cb9d213905686f244f94f6dcd8723b02189b33b.jpg b/parse/train/S1lwRjR9YX/images/46bb1616cd06afd1f9ae98b80cb9d213905686f244f94f6dcd8723b02189b33b.jpg new file mode 100644 index 0000000000000000000000000000000000000000..b19e80e494a330d749c58327a5865ce4a403c90c --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/46bb1616cd06afd1f9ae98b80cb9d213905686f244f94f6dcd8723b02189b33b.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ed18f09c67e5dc992dd5cbafb3acc1ef0318dda1ffa1c74888cfc78ba95e750c +size 12843 diff --git a/parse/train/S1lwRjR9YX/images/4c79724b3f08e46e78cd07f5e58308d3613bedcd9964f52f2c621f8670cf939b.jpg b/parse/train/S1lwRjR9YX/images/4c79724b3f08e46e78cd07f5e58308d3613bedcd9964f52f2c621f8670cf939b.jpg new file mode 100644 index 0000000000000000000000000000000000000000..353463a6d4105d1b6aadcadf0c346ae3fbfdc359 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/4c79724b3f08e46e78cd07f5e58308d3613bedcd9964f52f2c621f8670cf939b.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:31ae9f0583722896c03dd4698a237562374b73b5be3c5c3d421d279e2e51db72 +size 12977 diff --git a/parse/train/S1lwRjR9YX/images/60bef318f53611033075f3b5c83c3e410ddb9230b3f0b57e9f42e0ed05ba908d.jpg b/parse/train/S1lwRjR9YX/images/60bef318f53611033075f3b5c83c3e410ddb9230b3f0b57e9f42e0ed05ba908d.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f1ea8879ab8d8e6baeb3a1d4b98aa988757703b8 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/60bef318f53611033075f3b5c83c3e410ddb9230b3f0b57e9f42e0ed05ba908d.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:cfe973a50a8809a2f043528481961389987f83e375eddf213baa7edaedfc304a +size 5693 diff --git a/parse/train/S1lwRjR9YX/images/639c8f12a304f926a67d3cb01eb2fee31b1f875e1efd3d82eb51338e59dc5472.jpg b/parse/train/S1lwRjR9YX/images/639c8f12a304f926a67d3cb01eb2fee31b1f875e1efd3d82eb51338e59dc5472.jpg new file mode 100644 index 0000000000000000000000000000000000000000..4964a78ed6f01eedb900a00de81d21767b288f40 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/639c8f12a304f926a67d3cb01eb2fee31b1f875e1efd3d82eb51338e59dc5472.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e72f36f9cae0a68de88daa93387a4e03931ec13ef40b636fc27b735c25d4addc +size 7907 diff --git a/parse/train/S1lwRjR9YX/images/63a028368460375d017c2eec115cf4969acdb03fbb026e15ede771435af1b54b.jpg b/parse/train/S1lwRjR9YX/images/63a028368460375d017c2eec115cf4969acdb03fbb026e15ede771435af1b54b.jpg new file mode 100644 index 0000000000000000000000000000000000000000..c42990715e2384275d8b508962af4887faab18d0 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/63a028368460375d017c2eec115cf4969acdb03fbb026e15ede771435af1b54b.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a5b022e01a3e6a8abd6c6925f5408230ba8c7c5c64b341e387db1d0585bf643f +size 7966 diff --git a/parse/train/S1lwRjR9YX/images/6644f44249ed17e0bd4fddfd72b2ca357b70e22916765b5414a1f5987dd396e0.jpg b/parse/train/S1lwRjR9YX/images/6644f44249ed17e0bd4fddfd72b2ca357b70e22916765b5414a1f5987dd396e0.jpg new file mode 100644 index 0000000000000000000000000000000000000000..ae482a4d2dcd9bb739c04a3c690dfa80117a9eff --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/6644f44249ed17e0bd4fddfd72b2ca357b70e22916765b5414a1f5987dd396e0.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d1aa9e6f7fac1186ea042986eef94dd2868e3bb41edb89be1b38321037a5f7a8 +size 5493 diff --git a/parse/train/S1lwRjR9YX/images/671e73e560a18bb3902dd8b953102d3d233455dfe1fa457016f3513090d86cf1.jpg b/parse/train/S1lwRjR9YX/images/671e73e560a18bb3902dd8b953102d3d233455dfe1fa457016f3513090d86cf1.jpg new file mode 100644 index 0000000000000000000000000000000000000000..b612ec0ec1559dec693672ad0782e1d60fe064c8 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/671e73e560a18bb3902dd8b953102d3d233455dfe1fa457016f3513090d86cf1.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:bae40000daf44a40dda5ea443e367fd96514c47490fac3c23f29b7378e0d9848 +size 10212 diff --git a/parse/train/S1lwRjR9YX/images/69921eed00a190b0a9ef7a311156336f4f5cc3a570361c44dae75ec523f56137.jpg b/parse/train/S1lwRjR9YX/images/69921eed00a190b0a9ef7a311156336f4f5cc3a570361c44dae75ec523f56137.jpg new file mode 100644 index 0000000000000000000000000000000000000000..445aef93697b8a97ba5d436380a91cc29cfd57c2 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/69921eed00a190b0a9ef7a311156336f4f5cc3a570361c44dae75ec523f56137.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d8ff0a51235023a364b67e4988c5a8509172a8671f84290ec51a30f5b8a64f4e +size 5340 diff --git a/parse/train/S1lwRjR9YX/images/6be2b41886b403c27ce11fa1c2da5e1c1982e266292e9e0261c6265e30992468.jpg b/parse/train/S1lwRjR9YX/images/6be2b41886b403c27ce11fa1c2da5e1c1982e266292e9e0261c6265e30992468.jpg new file mode 100644 index 0000000000000000000000000000000000000000..63da313a5fca7f1584c585f45ba871dc3a39faca --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/6be2b41886b403c27ce11fa1c2da5e1c1982e266292e9e0261c6265e30992468.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:50b17a7de1739e9082b5fa4bd2ccb77f95767870f8138c3a1e5556f9f791f45d +size 5613 diff --git a/parse/train/S1lwRjR9YX/images/79a202f4fcadbac35e2f4a4e8c4bfa68145475244db841bcc1743c8f3350041f.jpg b/parse/train/S1lwRjR9YX/images/79a202f4fcadbac35e2f4a4e8c4bfa68145475244db841bcc1743c8f3350041f.jpg new file mode 100644 index 0000000000000000000000000000000000000000..840b1cf32c664a201532d9d2a813d53b9d62b07d --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/79a202f4fcadbac35e2f4a4e8c4bfa68145475244db841bcc1743c8f3350041f.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:43f27f740d4fa587f8e806e120da3a9078b6da2a685b07b68ae14169f9496e6d +size 16639 diff --git a/parse/train/S1lwRjR9YX/images/994112fa98c557084cc8d4db0f0317d8f5bc957f66c54c3ce88a4f49e9a50774.jpg b/parse/train/S1lwRjR9YX/images/994112fa98c557084cc8d4db0f0317d8f5bc957f66c54c3ce88a4f49e9a50774.jpg new file mode 100644 index 0000000000000000000000000000000000000000..d03b4808e0240107e1c46e1c88ed658a435b8257 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/994112fa98c557084cc8d4db0f0317d8f5bc957f66c54c3ce88a4f49e9a50774.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:fb003e7f36c8ac73f77eaf969b0ac1cf352a6d4fa6fc9058857d960c08075df9 +size 41452 diff --git a/parse/train/S1lwRjR9YX/images/a2b30a8c1a9b1535ed3e9d3e753b00b1ba0a6cca35a5024c2d0ea904215a5741.jpg b/parse/train/S1lwRjR9YX/images/a2b30a8c1a9b1535ed3e9d3e753b00b1ba0a6cca35a5024c2d0ea904215a5741.jpg new file mode 100644 index 0000000000000000000000000000000000000000..fadcf049a3b2c966a6ad3a497af38bb3ea18adf0 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/a2b30a8c1a9b1535ed3e9d3e753b00b1ba0a6cca35a5024c2d0ea904215a5741.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5af737c40cc721f844e79df92f84e8e3f66920797c3160211eef2054dc5bb4a7 +size 15100 diff --git a/parse/train/S1lwRjR9YX/images/a2ba4b84de89521ee7abc0b91bff08d231706bd8898e43a6a31eab60b142e218.jpg b/parse/train/S1lwRjR9YX/images/a2ba4b84de89521ee7abc0b91bff08d231706bd8898e43a6a31eab60b142e218.jpg new file mode 100644 index 0000000000000000000000000000000000000000..22fdbea6fcddd90eadf75ef8d495a4bc15d631c0 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/a2ba4b84de89521ee7abc0b91bff08d231706bd8898e43a6a31eab60b142e218.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d621cf6e3d6118e73e0d22c2b2e6cf9ce749307d5fa57c92beca79a3f5b61dc8 +size 14396 diff --git a/parse/train/S1lwRjR9YX/images/a8a3a694b8cd23e2b5535e5d79c633f530ab39a9571a79faac9761862b1ed024.jpg b/parse/train/S1lwRjR9YX/images/a8a3a694b8cd23e2b5535e5d79c633f530ab39a9571a79faac9761862b1ed024.jpg new file mode 100644 index 0000000000000000000000000000000000000000..4b1f522c7626ecaa6223a30d3bf08281eca13056 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/a8a3a694b8cd23e2b5535e5d79c633f530ab39a9571a79faac9761862b1ed024.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7d8df46f053040201b59861ec5861c6a8f5e9bcf25b705e256db4a13a5321c53 +size 5000 diff --git a/parse/train/S1lwRjR9YX/images/bb984ed7d6aa61912ab9b4139b1d7e5a5ed110c4c93ce33ac2894b668679b173.jpg b/parse/train/S1lwRjR9YX/images/bb984ed7d6aa61912ab9b4139b1d7e5a5ed110c4c93ce33ac2894b668679b173.jpg new file mode 100644 index 0000000000000000000000000000000000000000..b8981e58418ba48b41aedfb9ca3e9e4c895e40ab --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/bb984ed7d6aa61912ab9b4139b1d7e5a5ed110c4c93ce33ac2894b668679b173.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ad288c163dd39f09d4265bcf45a14eaa3bb3636cd0171cdb3fccb229d441e12c +size 4518 diff --git a/parse/train/S1lwRjR9YX/images/c254a13f5a65c006d889aca7c47a0e82edae34c64500abbc0f1e2df489ff80a6.jpg b/parse/train/S1lwRjR9YX/images/c254a13f5a65c006d889aca7c47a0e82edae34c64500abbc0f1e2df489ff80a6.jpg new file mode 100644 index 0000000000000000000000000000000000000000..6eeab1cb434b8bf19f7b93447d1d227eb5d13e17 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/c254a13f5a65c006d889aca7c47a0e82edae34c64500abbc0f1e2df489ff80a6.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:fe2b9e2ee86dc0cb2eb24591fba42b8b0b286fd8b7d38c642f1993abb82ebeba +size 16119 diff --git a/parse/train/S1lwRjR9YX/images/ca234c10d7a9a98c96e9baa291c7e704e3400cc0db0c27b55ab2a08c7d7df87f.jpg b/parse/train/S1lwRjR9YX/images/ca234c10d7a9a98c96e9baa291c7e704e3400cc0db0c27b55ab2a08c7d7df87f.jpg new file mode 100644 index 0000000000000000000000000000000000000000..233f8ccbbf8826a19642c22ea5d3a45ec60390cd --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/ca234c10d7a9a98c96e9baa291c7e704e3400cc0db0c27b55ab2a08c7d7df87f.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:29652a1d9cb7a6607f1c79ab25a1e3da8efb1e1fc5347e496ae15cd6e6002736 +size 20333 diff --git a/parse/train/S1lwRjR9YX/images/ca35d49ed3fde426fc9a073128fb2e48a0eaaf72d3c639926db621c250da0ee6.jpg b/parse/train/S1lwRjR9YX/images/ca35d49ed3fde426fc9a073128fb2e48a0eaaf72d3c639926db621c250da0ee6.jpg new file mode 100644 index 0000000000000000000000000000000000000000..6ac40422c7483a7396b8c269674db714ab035792 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/ca35d49ed3fde426fc9a073128fb2e48a0eaaf72d3c639926db621c250da0ee6.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:97b49050fdf03844421c7422e43a992d9e9f404f61b07aa2ab3369a62c62fad7 +size 6165 diff --git a/parse/train/S1lwRjR9YX/images/cdbcbe27e7037e8c104271d33ddc10a05d31f9a3ea6f70372dd14653bc1002b7.jpg b/parse/train/S1lwRjR9YX/images/cdbcbe27e7037e8c104271d33ddc10a05d31f9a3ea6f70372dd14653bc1002b7.jpg new file mode 100644 index 0000000000000000000000000000000000000000..a153dc4700009e62c3c5a06f81d761994cafd214 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/cdbcbe27e7037e8c104271d33ddc10a05d31f9a3ea6f70372dd14653bc1002b7.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:58cbb1b7565a14e3018ea9dc7da90520b5d1d63ca20a3204f5c3b0d526d4f51e +size 32447 diff --git a/parse/train/S1lwRjR9YX/images/d01442593d5703f5c4fe73e5eeea06dbc65b707bba0246fb18bea2e121a0ab61.jpg b/parse/train/S1lwRjR9YX/images/d01442593d5703f5c4fe73e5eeea06dbc65b707bba0246fb18bea2e121a0ab61.jpg new file mode 100644 index 0000000000000000000000000000000000000000..401036c105fcda666c67cd5a553a1709d9decc56 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/d01442593d5703f5c4fe73e5eeea06dbc65b707bba0246fb18bea2e121a0ab61.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c0538cc5f7068ce66252dc7e14c32079a3f8f4d19b9c747001028306d30873c5 +size 5532 diff --git a/parse/train/S1lwRjR9YX/images/d4d34dcf8cc714b32df7a88d01db747b12788818a7160beaf27e6d8816245d3a.jpg b/parse/train/S1lwRjR9YX/images/d4d34dcf8cc714b32df7a88d01db747b12788818a7160beaf27e6d8816245d3a.jpg new file mode 100644 index 0000000000000000000000000000000000000000..bc3af147641c152106723d65be074b2e5349499e --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/d4d34dcf8cc714b32df7a88d01db747b12788818a7160beaf27e6d8816245d3a.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:420b565061e5d668e19a75e47667f4158fcd55e7ce7228d49a825dee8f07ddc3 +size 8181 diff --git a/parse/train/S1lwRjR9YX/images/e8f324ad1ed4067ad0515f702e42d3fe4c2e92058b1ad836e2294b9282b313e4.jpg b/parse/train/S1lwRjR9YX/images/e8f324ad1ed4067ad0515f702e42d3fe4c2e92058b1ad836e2294b9282b313e4.jpg new file mode 100644 index 0000000000000000000000000000000000000000..ce762f1358fe0733735a89c3faf25392ebf1fe3c --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/e8f324ad1ed4067ad0515f702e42d3fe4c2e92058b1ad836e2294b9282b313e4.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c4c663ea3b4d695608e4ed78a12b338831f0b295a4ebef4791e823701dca3048 +size 10691 diff --git a/parse/train/S1lwRjR9YX/images/f11815991e50be1f7b43d07f22851c346f87887f80156fad39f715d2d8791b5a.jpg b/parse/train/S1lwRjR9YX/images/f11815991e50be1f7b43d07f22851c346f87887f80156fad39f715d2d8791b5a.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f974c9df6b7f9f730a23728ffa106d3fc9a316cb --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/f11815991e50be1f7b43d07f22851c346f87887f80156fad39f715d2d8791b5a.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3c44586077347c0cba02d3a067948dfcf722b30c0aa9e17e66f21d16184594ad +size 3398 diff --git a/parse/train/S1lwRjR9YX/images/fc228db5ffee619861c5c22295c28a13f616348f73dad1e6fd68672a7424c28f.jpg b/parse/train/S1lwRjR9YX/images/fc228db5ffee619861c5c22295c28a13f616348f73dad1e6fd68672a7424c28f.jpg new file mode 100644 index 0000000000000000000000000000000000000000..814f8aff92cf17d1bb4db26f8f83721257373c33 --- /dev/null +++ b/parse/train/S1lwRjR9YX/images/fc228db5ffee619861c5c22295c28a13f616348f73dad1e6fd68672a7424c28f.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2e0665b03a18eaed66985606bb2a46821c221e4742133b867fcfaad666f1f3a2 +size 3263 diff --git a/parse/train/SJg4Y3VFPS/SJg4Y3VFPS.md b/parse/train/SJg4Y3VFPS/SJg4Y3VFPS.md new file mode 100644 index 0000000000000000000000000000000000000000..3f5bf0063f44f817d4f7492accf9177b389824a6 --- /dev/null +++ b/parse/train/SJg4Y3VFPS/SJg4Y3VFPS.md @@ -0,0 +1,324 @@ +# GROUP-CONNECTED MULTILAYER PERCEPTRON NETWORKS + +Anonymous authors Paper under double-blind review + +# ABSTRACT + +Despite the success of deep learning in domains such as image, voice, and graphs, there has been little progress in deep representation learning for domains without a known structure between features. For instance, a tabular dataset of different demographic and clinical factors where the feature interactions are not given as a prior. In this paper, we propose Group-Connected Multilayer Perceptron (GMLP) networks to enable deep representation learning in these domains. GMLP is based on the idea of learning expressive feature combinations (groups) and exploiting them to reduce the network complexity by defining local group-wise operations. During the training phase, GMLP learns a sparse feature grouping matrix using temperature annealing softmax with an added entropy loss term to encourage the sparsity. Furthermore, an architecture is suggested which resembles binary trees, where group-wise operations are followed by pooling operations to combine information; reducing the number of groups as the network grows in depth. To evaluate the proposed method, we conducted experiments on five different real-world datasets covering various application areas. Additionally, we provide visualizations on MNIST and synthesized data. According to the results, GMLP is able to successfully learn and exploit expressive feature combinations and achieve state-of-the-art classification performance on different datasets. + +# 1 INTRODUCTION + +Deep neural networks have been quite successful across various machine learning tasks. However, this advancement has been mostly limited to certain domains. For example in image and voice data, one can leverage domain properties such as location invariance, scale invariance, coherence, etc. via using convolutional layers (Goodfellow et al., 2016). Alternatively, for graph data, graph convolutional networks were suggested to leverage adjacency patterns present in datasets structured as a graph (Kipf & Welling, 2016; Xu et al., 2019). + +However, there has been little progress in learning deep representations for datasets that do not follow a particular known structure in the feature domain. Take for instance the case of a simple tabular dataset for disease diagnosis. Such a dataset may consist of features from different categories such as demographics (e.g., age, gender, income, etc.), examinations (e.g., blood pressure, lab results, etc.), and other clinical conditions. In this scenario, the lack of any known structure between features to be used as a prior would lead to the use of a fully-connected multilayer perceptron network (MLP). Nonetheless, it has been known in the literature that MLP architectures, due to their huge complexity, do not usually admit efficient training and generalization for networks of more than a few layers. + +In this paper, we propose Group-Connected Multiplayer Perceptron (GMLP) networks. The main idea behind GMLP is to learn and leverage expressive feature subsets, henceforth referred to as feature groups. A feature group is defined as a subset of features that provides a meaningful representation or high-level concept that would help the downstream task. For instance, in the disease diagnosis example, the combination of a certain blood factor and age might be the indicator of a higher level clinical condition which would help the final classification task. Furthermore, GMLP leverages feature groups limiting network connections to local group-wise connections and builds a feature hierarchy via merging groups as the network grows in depth. GMLP can be seen as an architecture that learns expressive feature combinations and leverages them via group-wise operations. + +The main contributions of this paper are as follows: $( i )$ proposing a method for end-to-end learning of expressive feature combinations, $( i i )$ suggesting a network architecture to utilize feature groups and local connections to build deep representations, (iii) conducting extensive experiments demonstrating the effectiveness of GMLP as well as visualizations and ablation studies for better understanding of the suggested architecture. + +We evaluated the proposed method on five different real-world datasets in various application domains and demonstrated the effectiveness of GMLP compared to state-of-the-art methods in the literature. Furthermore, we conducted ablation studies and comparisons to study different architectural and training factors as well as visualizations on MNIST and synthesized data. To help to reproduce the results and encouraging future studies on group-connected architectures, we made the source code related to this paper available online 1. + +# 2 RELATED WORK + +Fully-connected MLPs are the most widely-used neural models for datasets in which no prior assumption is made on the relationship between features. However, due to the huge complexity of fully-connected layers, MLPs are prone to overfitting resulting in shallow architectures limited to a few layers in depth (Goodfellow et al., 2016). Various techniques have been suggested to improve training these models which include regularization techniques such as L-1/L-2 regularization, dropout, etc. and normalization techniques such as layer normalization, weigh normalization, batch normalization, etc.(Srivastava et al., 2014; Ba et al., 2016; Salimans & Kingma, 2016; Ioffe & Szegedy, 2015). For instance, self-normalizing neural networks (SNNs) have been recently suggested as state of the art normalization methods that prevent vanishing or exploding gradients which help training feed-forward networks with higher depths (Klambauer et al., 2017). + +From the architectural perspective, there has been great attention toward networks consisting of sparse connections between layers rather than having dense fully-connected layers (Dey et al., 2018). Sparse connected neural networks are usually trained based on either a sparse prior structure over the network architecture (Richter & Wattenhofer, 2018) or based on pruning a fully-connected network to a sparse network (Yun et al., 2019; Tartaglione et al., 2018; Mocanu et al., 2018). However, it should be noted that the main objective of most sparse neural network literature has been focused on improving the memory and compute requirements while maintaining competitive accuracies compared to MLPs. + +As a parallel line of research, the idea of using expressive feature combinations or groups has been suggested as a prior over the feature domain. Perhaps, the most successful and widespread use of this idea is in creating random forest models in which different trees are trained based on different feature subsets in order to deal with high-dimensional and high-variance data (Breiman, 2001). More recently, feature grouping is suggested by Aydore et al. (2019) as a statistical regularization technique to learn from datasets of large feature size and a small number of training samples. They do the forward network computation by projecting input features using samples taken from a bank of feature grouping matrices, reducing the input layer complexity and regularizing the model. In another recent study, Ke et al. (2018) used expressive feature combinations to learn from tabular datasets using a recursive encoder with a shared embedding network. They suggest a recursive architecture in which more important feature groups have a more direct impact on the final prediction. + +While promising results have been reported using these methods, feature grouping has been mostly considered as a preprocessing step. For instance, Aydore et al. (2019) uses the recursive nearest agglomeration (ReNA) (Hoyos-Idrobo et al., 2018) clustering to determine feature groups prior to the analysis. Alternatively, Ke et al. (2018) defined feature groups based on a pre-trained gradient boosting decision tree (GBDT) (Friedman, 2001). Feature grouping as a preprocessing step not only increases the complexity and raises practical considerations, but also limits the optimality of the selected features in subsequent analysis. In this study, we propose an end-to-end solution to learn expressive feature groups. Moreover, we introduce a network architecture to exploit interrelations within the feature groups to reduce the network complexity and to train deeper representations. + +![](images/c1d29b2cea3d35501f1bef3d00700d77364f884f1a3ac447f57fd5a8e7118523.jpg) +Figure 1: The GMLP network architecture. + +# 3 PROPOSED METHOD + +# 3.1 ARCHITECTURE OVERVIEW + +In this paper, we propose GMLP which intuitively can be broken down to three stages: $( i )$ selecting expressive feature groups, $( i i )$ learning dynamics within each group individually, and (iii) merging information between groups as the network grows in depth (see Figure 1). In this architecture, expressive groups are jointly selected during the training phase. Furthermore, GMLP is leveraging feature groups and using local group-wise weight layers to significantly reduce the number of parameters. While the suggested idea can be materialized as different architectures, in the current study, we suggest organization of the network as architectures resembling a binary tree spanning from leaves (i.e., features) to a certain abstraction depth closer to the root2. As the network grows deeper, after each local group-wise weight layer, half of the groups are merged using pooling operations, effectively reducing the width of the network while increasing the receptive field. At the last layer, all features within all groups are concatenated into a dense feature vector fed to the output layer. + +# 3.2 NOTATION + +We consider the generic problem of supervised classification based on a dataset of feature and target pairs, $\mathcal { D }$ : $\left( \pmb { x } _ { 1 : N } , \pmb { y } _ { 1 : N } \right)$ , where $\pmb { x } _ { i } \in \Re ^ { d }$ , $y _ { i } \in \{ 1 \ldots C \}$ , and $N$ is the number of dataset samples. Furthermore, we define group size, $m$ , as the number of neurons or elements within each group, and group count, $k$ , as the number of selected groups which are essentially subsets of input features. Also, $L$ is used to refer to the total depth of a network. We use $\pmb { z } _ { i } ^ { l } \in \Re ^ { m }$ to refer to activation values of group $i$ in layer $l$ . In this paper, we define all vectors as column vectors. + +# 3.3 NETWORK LAYERS + +In this section, we present the formal definition of different GMLP network layers. The very first layer of the network, Group-Select, is responsible for organizing features into $k$ groups of size $m$ each. A routing matrix, $\Psi$ , is used for connecting each neuron within each group to exactly one feature in the feature set: + +$$ +z _ { 1 : k } ^ { 0 } = \Psi x , +$$ + +where $\Psi \in \{ 0 , 1 \} ^ { k m \times d }$ is a sparse matrix determining features that are present in each group. As we are interested in jointly learning $\Psi$ during the training phase, we use the following continuous relaxation: + +$$ +\Psi _ { i , j } \approx \frac { \exp ( \psi _ { i , j } / \tau ) } { \sum _ { j ^ { \prime } = 1 } ^ { j ^ { \prime } = d } \exp ( \psi _ { i , j ^ { \prime } } / \tau ) } . +$$ + +In this equation, $\psi$ is a real-valued matrix reparameterizing the routing matrix through a softmax operation with temperature, $\tau$ . The lower the temperature, the more (2) converges to the desired discrete and sparse binary routing matrix. Note that, in the continuous relaxation, the matrix $\psi$ can be optimized via the backpropagation of gradients from classification loss terms. In the next section, we provide further detail on temperature annealing schedules as well as other techniques to enhance the $\Psi$ approximation. + +Based on selected groups, we suggest local fully-connected weight layers for each group: Group-FC. The goal of Group-FC is to extract higher-level representations using the selected expressive feature subsets. This operation is usually followed by non-linearity functions (e.g., ReLU), normalization operations (e.g, Batch Norm), and dropout. Formally, Group-FC can be defined as: + +$$ +\begin{array} { r } { \pmb { z } _ { i } ^ { l + 1 } = f ( W _ { i } ^ { l } \pmb { z } _ { i } ^ { l } + \pmb { b } _ { i } ^ { l } ) , } \end{array} +$$ + +where $W _ { i } ^ { l } \in \Re ^ { m \times m }$ and $\pmb { b } _ { i } ^ { l } \in \Re ^ { m }$ are the weight matrix and bias vector, applied on group $i$ at layer $l$ Here, $f$ represents other subsequent operations such as non-linearity, normalization, and dropout. + +Lastly, Group-Pool is defined as an operation which merges representations of two groups into a single group, reducing network width by half while increasing the effective receptive field: + +$$ +\begin{array} { r } { z _ { i } ^ { l + 1 } = p o o l ( z _ { i } ^ { l } , z _ { i + k / 2 ^ { l + 1 } } ^ { l } ) , } \end{array} +$$ + +where $z _ { i } ^ { l }$ and $z _ { i + k / 2 } ^ { l }$ are the ith group from the first and second halves, respectively; and pool is a pooling function from $\Re ^ { 2 m }$ to $\Re ^ { m }$ . In this study, we explore different variants of pooling functions such as max pooling, average pooling, or using linear weight layers as transformations from $\Re ^ { 2 m }$ to $\Re ^ { m }$ . Please note that while we use a similar terminology as pooling in convolutional networks, the pooling operation explained here is not applied location-wise, but instead it is applied feature-wise, between different groups pairs. + +The values of $m$ and $k$ are closely related to the number and order of feature interactions for a certain task. Using proper $m$ and $k$ values enables us to reduce the parameter space while maintaining the model complexity required to solve the task. However, finding the ideal $m$ and $k$ directly from a given dataset is a very challenging problem. In this work, we treat $m$ and $k$ as hyperparameters to be found by a hyperparameter search. + +# 3.4 TRAINING + +We define the objective function to be used for end-to-end training of weights as well as the routing matrix as: + +$$ +L = - \frac { 1 } { N } \sum _ { i } \sum _ { c } y _ { i , c } \log ( F _ { \theta } ( \pmb { x } _ { i } ) ) + \lambda H ( \psi ) + \alpha \sum _ { \omega \in \theta } | | \omega | | _ { 2 } ^ { 2 } . +$$ + +In this objective function, the first term is the standard cross-entropy classification loss where $F _ { \theta }$ denotes the GMLP network as a function with parameters $\theta$ , and $N$ is the number of training samples used. The second term is an entropy loss over the distribution of the routing matrix that is weighted by the hyperparameter $\lambda$ : + +$$ +H ( \psi ) = - \frac { 1 } { d } \sum _ { j = 1 } ^ { j = d } \sum _ { i = 1 } ^ { i = k m } \frac { \exp ( \psi _ { i , j } ) } { \sum _ { j ^ { \prime } = 1 } ^ { j ^ { \prime } = d } \exp ( \psi _ { i , j ^ { \prime } } ) } \mathrm { l o g } ( \frac { \exp ( \psi _ { i , j } ) } { \sum _ { j ^ { \prime } = 1 } ^ { j ^ { \prime } = d } \exp ( \psi _ { i , j ^ { \prime } } ) } ) . +$$ + +$H ( \psi )$ is minimizing the entropy corresponding to the distribution of $\psi$ regardless of the temperature used for $\Psi$ approximation. Accordingly, $\lambda$ can be viewed as a hyperparameter and as an additional method for encouraging sparse $\Psi$ matrices. The last term in (5) is an L-2 regularization term with the hyperparameter $\alpha$ to control the magnitude of parameters in layer weights and in $\psi$ . Note that without the L-2 regularization term, $\psi$ elements may keep increasing during the optimization loop, since $\psi$ only appears in normalized form in the objective function of (5). + +We use Adam (Kingma & Ba, 2014) optimization algorithm starting from the default 0.001 learning rate and reducing the learning rate by a factor of 5 as the validation accuracy stops improving. Regarding the temperature annealing, during the training, the temperature is exponentially decayed from 1.0 to 0.01. In order to initialize the Group-FC weights, we used Xavier initialization (Glorot & Bengio, 2010) with m for both fan-in and fan-out values. Similarly, the $\psi$ matrix is initialized by setting the fan-in equal to $d$ and fan-out to $k m$ . + +Further detail on architectures and hyperparameters used for each specific experiment as well as details on the software implementation are provided as appendices to this paper. + +# 3.5 ANALYSIS + +The computational complexity of GMLP at the prediction time can be written as (for simplicity, ignoring bias and pooling terms): + +$$ +k m + k m ^ { 2 } + \frac { k m ^ { 2 } } { 2 } + \frac { k m ^ { 2 } } { 4 } + . . . + \frac { k m ^ { 2 } } { 2 ^ { L - 1 } } + C \frac { k m } { 2 ^ { L - 1 } } . +$$ + +In this series, the first term, $k m$ , is the work required to organize features to groups. The subsequent terms, except the last term, are representing the computational cost of local fully-connected operations at each layer. The last term is the complexity of the output layer transformation from the concatenated features to the number of classes. Therefore, the computational complexity of GMLP at the prediction time can be written as with a similar network $\begin{array} { r } { \mathcal { O } ( k m ^ { 2 } + \frac { C k m } { 2 L - 1 } ) } \end{array}$ . In comparison, the computational complexity of an MLP + +$$ +k m d + k ^ { 2 } m ^ { 2 } + \frac { k ^ { 2 } m ^ { 2 } } { 2 } + \frac { k ^ { 2 } m ^ { 2 } } { 4 } + . . . + \frac { k ^ { 2 } m ^ { 2 } } { 2 ^ { L - 1 } } + C \frac { k m } { 2 ^ { L - 1 } } , +$$ + +where the first term is the work required for the first network layer from $d$ to $k m$ neurons, the second term is corresponding to a hidden layer of size $k m$ , and so forth. The last term is the complexity $\begin{array} { r } { \mathcal { O } ( k m d + { k ^ { 2 } } { m ^ { 2 } } + \frac { C k m } { 2 { L - 1 } } ) } \end{array}$ r to the case of GMLP. The overall work required from this equa) complexity. This is substantially higher than GMLP, for typical $k , d .$ is of, and $C$ values. + +Additionally, the density of the Group-FC layer connections can be calculated as: $\begin{array} { r } { \frac { k m ^ { 2 } } { k ^ { 2 } m ^ { 2 } } = \frac { 1 } { k } } \end{array}$ , which is very small for reasonably large number of $k$ values used in our experiments. Also, assuming pooling operations in every other layer, the receptive field size or the maximum number of features impacting a neuron at layer $l$ can be written as $2 ^ { { \hat { l } } - 1 } m$ . For instance, a neuron in the first layer of the network is only connected to $m$ features, and a neuron in the second layer is connected to two groups or $2 m$ features and so forth. + +# 4 EXPERIMENTS + +# 4.1 EXPERIMENTAL SETUP + +The proposed method is evaluated on five different real-world datasets, covering various domains and applications: permutation invariant CIFAR-10 (Krizhevsky et al., 2009), human activity recognition (HAPT) (Anguita et al., 2013), diabetes classification (Kachuee et al., 2019), UCI Landsat (Dua & Graff, 2017), and MIT-BIH arrhythmia classification (Moody & Mark, 2001) datasets. Additionally, we use MNIST (LeCun et al., 2010) and a synthesized dataset to provide further insight into the operation of GMLP (see Section 4.4). Table 1 presents a summary of datasets used in this study. Regarding the CIFAR-10 dataset, we permute the image pixels to discard pixel coordinates in our experiments. Note that the permutation is not changing across samples, it is merely a fixed random ordering used to remove pixel coordinates for each experiment. For all datasets, basic statistical normalization with $\mu = 0$ and $\sigma = 1$ is used to normalize features as a preprocessing step. The only exception is CIFAR-10 for which we used the standard channel-wise normalization and standard data augmentation (i.e., random crops and random horizontal flips). The standard test and train data splits were used as dictated by dataset publishers. In cases that the separated sets are not provided, test and train subsets are created by randomly splitting samples to $2 0 \%$ for test and the rest for training/validation. + +Table 1: Summary of datasets used in our experiments. + +
Dataset# Train Samples# Test Samples#Features# ClassesDomain
CIFAR-10a (Krizhevsky et al.,2009)50,00010.000307210Image Classification
HAPT (Anguita et al., 2013)6,0022,4515615Activity Recognition
Diabetes (Kachuee et al., 2019)73,64918,413453Disease Diagnosis
Landsat (Dua & Graff,2017)4,4352,000366Satellite Imaging
MIT-BIH(Moody & Mark,2001)87,55421,8921875Time Series
MNIST (LeCun et al., 2010)60,00010,00078410Digit Classification
Synthesized (Section 4.4)5,1201,28062See Figure 8
+ +aPermuted version, i.e. pixel coordinates are ignored. + +We compare the performance of the proposed method with recent related work including SelfNormalizing Neural Networks (SNN) (Klambauer et al., 2017), Sparse Evolutionary Training (SET) (Mocanu et al., $2 0 1 8 ) ^ { 3 }$ , Feature Grouping as a Stochastic Regularizer (in this paper, denoted as FGR) (Aydore et al., 2019)4 as well as the basic dropout regularized and batch normalized MLPs. In order to ensure a fair comparison, we adapted source codes provided by other work to be compatible with our data loader and preprocessing modules. + +Furthermore, for each method, we conducted an extensive hyperparameter search using Microsoft Neural Network Intelligence (NNI) toolkit5 and the Tree-structured Parzen Estimator (TPE) tuner (Bergstra et al., 2011) covering different architectural and learning hyperparameters for each case. More detail on hyperparameter search spaces and specific architectures used in this paper is provided in Appendix A and Appendix B. We run each case using the best hyperparameter configuration eight times and report mean and standard deviation values. + +# 4.2 RESULTS + +Table 2 presents a comparison between the proposed method (GMLP) and 4 other baselines: MLP, SNN (Klambauer et al., 2017), SET (Mocanu et al., 2018), and FGR (Aydore et al., 2019). As it can be seen from this comparison, GMLP outperforms other work, achieving state-of-the-art classification accuracies. Concerning the CIFAR-10 results, to the best of our knowledge, GMLP achieves a new state-of-the-art performance on permutation invariant CIFAR-10 augmented using the standard data augmentation. We believe that leveraging expressive feature groups enables GMLP to consistently perform better across different datasets. + +To compare model complexity and performance we conduct an experiment by changing the number of model parameters and reporting the resulting test accuracies. Here, we reduce the number of parameters by reducing the width of each network; i.e. reducing the number of groups and hidden neurons for GMLP and MLP, respectively. Figure 2 shows accuracy versus the number of parameters for the GMLP and MLP baseline on CIFAR-10 and MIT-BIH datasets. Based on this figure, GMLP is able to achieve higher accuracies using significantly less number of parameters. It is consistent with the complexity analysis provided in Section 3.5. Note that in this comparison, we consider the number of parameters involved at the prediction time. + +# 4.3 ABLATION STUDY + +Figure 3 presents an ablation study comparing the performance of GMLP on CIFAR-10 dataset for networks trained: $( i )$ using both the temperature annealing and the entropy loss objective, (ii) using only temperature annealing without the entropy loss objective, $( i i i )$ using no temperature annealing but using the entropy loss objective, $( i v )$ not using any of the temperature annealing or the entropy loss objective. From this figure, it can be seen that excluding both techniques leads to a significantly lower performance. However, using any of the two techniques leads to relatively similar high accuracies. It is consistent with the intuition that the functionality of these techniques is to encourage learning sparse routing matrices, either using softmax temperatures or entropy regularization to achieve this. In this paper, in order to ensure sparse and low complexity routing matrices, we use both techniques simultaneously as in case $( i )$ . + +Table 2: Comparison of top-1 test accuracies for GMLP and other work. + +
Accuracy (%)
DatasetGMLPMLPSNNaSETbFGRc
CIFAR-10d (Krizhevsky et al., 2009)73.76 (±0.14)68.15 (±0.56)66.88 (±0.30)72.71 (±0.29)45.90 (±0.40)
HAPT (Anguita et al., 2013)96.34 (±0.19)95.73 (±0.38)95.47 (±0.09)71.35 (±0.74)91.57 (±0.31)
Diabetes (Kachuee et al.,2019)90.92 (±0.07)90.68 (±0.06)90.31 (±0.10)85.07 (±0.61)89.24 (±0.08)
Landsat (Dua & Graff,2017)91.54 (±0.16)91.21 (±0.44)91.37 (±0.21)91.03 (±0.56)90.70 (±0.17)
MIT-BIH(Moody & Mark,2001)98.74 (±0.04)98.65 (±0.01)98.56 (±0.02)98.10 (±0.01)98.13 (±0.03)
+ +aSelf-Normalizing Neural Networks (Klambauer et al., 2017) bSparse Evolutionary Training (Mocanu et al., 2018) cFeature Grouping as a Stochastic Regularizer (Aydore et al., 2019) dPermuted version, i.e. pixel coordinates are ignored. + +![](images/d26c4b320c2c398b02009e440c592db21896536976c571200b75f1d20484e65b.jpg) +Figure 2: Accuracy versus number of parameters for this work (GMLP) and the MLP baseline: (a) CIFAR-10 dataset, (b) MIT-BIH dataset. The $\mathbf { X }$ -axis is in a logarithmic scale + +Figure 4 shows a comparison between GMLP models trained on CIFAR-10 using different pooling types: $( i )$ linear transformation, $( i i )$ max pooling, and $( i i i )$ average pooling. As it can be seen from this comparison, while there are slight differences in the convergence speed of using different pooling types, all of them achieve relatively similar accuracies. In our experiments, we decided to use max pooling and average pooling as they provide reasonable results without the need to introduce additional parameters required for the linear pooling method. + +Figure 5 shows learning curves for training CIFAR-10 GMLP models using different group sizes. As it can be seen from this figure, using very small group sizes would cause a reduction in the final accuracy. At the other extreme, the improvement achieved using larger values is negligible for $m$ values more than 16. Finally, Figure 6 shows a comparison between learning curves for using a different number of groups. Using very small $k$ values result in a significant reduction in performance. However, the rate of performance gains for using more groups is very small for $k$ of more than 1536. Note that the number of model parameters and compute scales linearly with $k$ and quadratically with $m$ (see Section 3.5). + +![](images/ec451b5dcc3d15a4b055447f394e6b8be9a5fa4bfe08e4a086a4fdc284d82bb0.jpg) +Figure 3: Ablation study demonstrating the impact of temperature annealing and entropy loss terms. + +![](images/31eb22c5a65b11f8db055dab3da98be8c4fff744e3c6ce3eb7019fda6b37313a.jpg) +Figure 5: Ablation study on the impact of using different group sizes $( m )$ . For this experiment, we used $k { = } 1 5 3 6$ . + +![](images/f5d07291db61bdf6e202b4af44e455999a04c9bd2e363b9f778a6200f99f31b6.jpg) +Figure 4: Ablation study demonstrating the impact of different pooling functions. +Figure 6: Ablation study on the impact of using different number of groups $( k )$ . For this experiment, we used $m { = } 1 6$ . + +# 4.4 EXPERIMENTS ON MNIST AND SYNTHESIZED DATA + +MNIST dataset (LeCun et al., 2010) is used to visually inspect the performance of the Group-Select layer. Figure 7 shows a heat-map of how frequently each pixel is selected across all feature groups for: $( a )$ original MNIST samples, (b) MNIST samples where the lower-half is replaced by Gaussian noise. From Figure 7a, it can be seen that most groups are selecting pixels within the center of the frame, effectively discarding margin pixels. This is consistent with other work which show the importance of different locations for MNIST images (Kachuee et al., 2018). Apart from this, in Figure 7b, a version of the MNIST dataset is used in which half of the frame does not provide any useful information for the downstream classification task. From this figure, GMLP is not selecting any features to be used from the lower region. + +In order to show the effectiveness of GMLP, we synthesized a dataset which has intrinsic and known expressive feature groups. Specifically, we used a simple Bayesian network as depicted in Figure 8. This network consists of six binary features, A to F, interacting with each other as specified by the graph edges, which determine the distribution of the target node, J. The graph and conditionals are designed such that each of the nodes in the second level take the XOR value of their parents with a $9 9 \%$ probability. The target node, J, is essentially one with a high probability if at least two of the second level nodes are one. We synthesized dataset by sampling 6,400 samples from the network (1,280 samples for test and the rest of training/evaluation). On this dataset, we trained a very simple GMLP consisting of four groups of size two, one group-wise fully-connected layer, and an output layer. Figure 9 shows the features selected for each group after the training phase (i.e., the $\Psi$ matrix). + +![](images/be34d4ab1e56d0743796f3b972d79052ac656ff4def94a3af94f04280b784cb3.jpg) +Figure 7: MNIST visualization of pixels selected by the Group-Select layer: (a) using complete images as input, (b) using images that the lower half is replaced by Gaussian noise. In this figure, warmer colors represent pixels being being present in more groups. + +From this figure, the Group-Select layer successfully learns to detect the feature pairs that are interacting, enabling the Group-FC layers to decode the non-linear XOR relations. + +![](images/3028e5791c3271e74e91ac8dd61f67f7a45ce591feb1177f4985246c80008720.jpg) + +$\begin{array} { l l } { P ( G = A \oplus B ) = 0 . 9 9 } & { , P ( G \neq A \oplus B ) = 0 . 0 1 } \\ { P ( H = C \oplus D ) = 0 . 9 9 } & { , P ( H \neq C \oplus D ) = 0 . 0 1 } \\ { P ( I = E \oplus F ) = 0 . 9 9 } & { , P ( I \neq E \oplus F ) = 0 . 0 1 } \end{array}$ $\begin{array} { l } { P [ J = ( G \land H ) \lor ( G \land I ) \lor ( H \land I ) ] = 0 . 9 9 } \\ { P [ J \neq ( G \land H ) \lor ( G \land I ) \lor ( H \land I ) ] = 0 . 0 1 } \end{array}$ + +![](images/98b30235aff7dc90e1118b185b0ecf3d8c34a1bc9f40e599bc9dde9753a54ae8.jpg) +Figure 8: The Bayesian network and conditionals used to generate the synthesized dataset of binary features A-F and target J. +Figure 9: Visualization of the selected features within each group. Every two consecutive rows show features selected for a certain group. + +# 5 DISCUSSION + +Intuitively, training a GMLP model with certain groups can be viewed as a prior assumption over the number and order of interactions between the features. It is a reasonable prior assumption as in many natural datasets, a conceptual hierarchy exists where only a limited number of features interact with each other. Furthermore, it is consistent with the discoveries made in understanding the human decision-making process; finding that we are only able to consider at most nine factors at the same time during a decision making process (Cowan, 2001; Baddeley, 1994). + +Additionally, GMLP can be considered as a more general neural counterpart of random forests. Both models use different subsets of features (i.e., groups) and learn interactions within each group. One major difference between the two methods is the fact that GMLP combines information between different groups using pooling operations, while random forest uses the selected features to train an ensemble of independent trees on each group. From another perspective, the idea of studying feature groups is closely related to causal models such as Bayesian networks and factor graphs (Darwiche, 2009; Neapolitan et al., 2004; Clifford, 1990). These methods are often impractical for large-scale problems, because without a prior over the causal graph, they require an architecture search of the NP-complete complexity or more. + +# 6 CONCLUSION + +In this paper, we proposed GMLP as a solution for deep learning in domains where the feature interactions are not known as prior and do not admit the use of convolutional or other techniques leveraging domain priors. GMLP jointly learns expressive feature combinations and employs groupwise operations to reduce the network complexity. We conducted extensive experiments demonstrating the effectiveness of the proposed idea and compared the achieved performances with state-of-the-art methods in the literature. + +# REFERENCES + +Davide Anguita, Alessandro Ghio, Luca Oneto, Xavier Parra, and Jorge Luis Reyes-Ortiz. A public domain dataset for human activity recognition using smartphones. In Esann, 2013. + +Sergul Aydore, Bertrand Thirion, and Gael Varoquaux. Feature grouping as a stochastic regularizer for high-dimensional structured data. In International Conference on Machine Learning, pp. 385–394, 2019. + +Jimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E Hinton. Layer normalization. arXiv preprint arXiv:1607.06450, 2016. + +Alan Baddeley. The magical number seven: Still magic after all these years? 1994. + +James S Bergstra, Rémi Bardenet, Yoshua Bengio, and Balázs Kégl. Algorithms for hyper-parameter optimization. In Advances in neural information processing systems, pp. 2546–2554, 2011. + +Leo Breiman. Random forests. Machine learning, 45(1):5–32, 2001. + +Peter Clifford. Markov random fields in statistics. Disorder in physical systems: A volume in honour of John M. Hammersley, 19, 1990. + +Nelson Cowan. The magical number 4 in short-term memory: A reconsideration of mental storage capacity. Behavioral and brain sciences, 24(1):87–114, 2001. + +Adnan Darwiche. Modeling and reasoning with Bayesian networks. Cambridge university press, 2009. + +Sourya Dey, Kuan-Wen Huang, Peter A Beerel, and Keith M Chugg. Characterizing sparse connectivity patterns in neural networks. In 2018 Information Theory and Applications Workshop (ITA), pp. 1–9. IEEE, 2018. + +Dheeru Dua and Casey Graff. UCI machine learning repository, 2017. URL http://archive. ics.uci.edu/ml. + +Jerome H Friedman. Greedy function approximation: a gradient boosting machine. Annals of statistics, pp. 1189–1232, 2001. + +Xavier Glorot and Yoshua Bengio. Understanding the difficulty of training deep feedforward neural networks. In Proceedings of the thirteenth international conference on artificial intelligence and statistics, pp. 249–256, 2010. + +Ian Goodfellow, Yoshua Bengio, and Aaron Courville. Deep Learning. MIT Press, 2016. http: //www.deeplearningbook.org. + +Andrés Hoyos-Idrobo, Gaël Varoquaux, Jonas Kahn, and Bertrand Thirion. Recursive nearest agglomeration (rena): fast clustering for approximation of structured signals. IEEE transactions on pattern analysis and machine intelligence, 41(3):669–681, 2018. + +Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by reducing internal covariate shift. arXiv preprint arXiv:1502.03167, 2015. + +Mohammad Kachuee, Sajad Darabi, Babak Moatamed, and Majid Sarrafzadeh. Dynamic feature acquisition using denoising autoencoders. IEEE transactions on neural networks and learning systems, 2018. + +Mohammad Kachuee, Kimmo Karkkainen, Orpaz Goldstein, Davina Zamanzadeh, and Majid Sarrafzadeh. Nutrition and health data for cost-sensitive learning. arXiv preprint arXiv:1902.07102, 2019. + +Guolin Ke, Jia Zhang, Zhenhui Xu, Jiang Bian, and Tie-Yan Liu. Tabnn: A universal neural network solution for tabular data. 2018. + +Diederik P Kingma and Jimmy Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980, 2014. + +Thomas N Kipf and Max Welling. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907, 2016. + +Günter Klambauer, Thomas Unterthiner, Andreas Mayr, and Sepp Hochreiter. Self-normalizing neural networks. In Advances in neural information processing systems, pp. 971–980, 2017. + +Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images. Technical report, Citeseer, 2009. + +Yann LeCun, Corinna Cortes, and CJ Burges. Mnist handwritten digit database. AT&T Labs [Online]. Available: http://yann. lecun. com/exdb/mnist, 2:18, 2010. + +Decebal Constantin Mocanu, Elena Mocanu, Peter Stone, Phuong H Nguyen, Madeleine Gibescu, and Antonio Liotta. Scalable training of artificial neural networks with adaptive sparse connectivity inspired by network science. Nature communications, 9(1):2383, 2018. + +George B Moody and Roger G Mark. The impact of the mit-bih arrhythmia database. IEEE Engineering in Medicine and Biology Magazine, 20(3):45–50, 2001. + +Richard E Neapolitan et al. Learning bayesian networks, volume 38. Pearson Prentice Hall Upper Saddle River, NJ, 2004. + +Oliver Richter and Roger Wattenhofer. Treeconnect: A sparse alternative to fully connected layers. In 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 924–931. IEEE, 2018. + +Tim Salimans and Durk P Kingma. Weight normalization: A simple reparameterization to accelerate training of deep neural networks. In Advances in Neural Information Processing Systems, pp. 901–909, 2016. + +Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. Dropout: a simple way to prevent neural networks from overfitting. The journal of machine learning research, 15(1):1929–1958, 2014. + +Enzo Tartaglione, Skjalg Lepsøy, Attilio Fiandrotti, and Gianluca Francini. Learning sparse neural networks via sensitivity-driven regularization. In Advances in Neural Information Processing Systems, pp. 3878–3888, 2018. + +Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. How powerful are graph neural networks? In International Conference on Learning Representations, 2019. URL https: //openreview.net/forum?id $\underline { { \underline { { \mathbf { \Pi } } } } } =$ ryGs6iA5Km. + +Jihun Yun, Peng Zheng, Eunho Yang, Aurelie Lozano, and Aleksandr Aravkin. Trimming the $l _ { 1 }$ regularizer: Statistical analysis, optimization, and applications to deep learning. In International Conference on Machine Learning, pp. 7242–7251, 2019. + +# A HYPERPARAMETER SEARCH SPACE + +Tables 3-5 present the hyperparameter search space considered for experiments on GMLP, MLP, SNN, and FGR, respectively. For the GMLP search space, the number of groups is adjusted based on the number of features and samples in each specific task. Also, the number of layers is adjusted to be compatible with the number of groups being used. Regarding the FGR experiments, due to scalability issues of the published source provided by the original authors, we were only able to train networks with at most two hidden layers. For SET, as their architecture is evolutionary i.e., prunes certain weights and adds new ones, we only explored using a different number of hidden neurons in the range of 500 to 4000. + +Regarding the number of epochs, we used 2000 epochs for CIFAR-10, 1000 epochs for HAPT, 100 epochs for Diabetes, 300 epochs for Landsat, and 300 epochs for MIT-BIH experiments. The only exception is the SNN experiments where we had to reduce the learning rate to increase the stability of the training resulting in more epochs required to converge. + +Table 3: Hyperparameter search space used for GMLP experiments. + +
HyperparameterConsidered Values
Number of hidden layers{1,2,..,8]a
Number of groups16 - 4096b
Size of groups4-32
Lambda[10-²,104]
Alpha[10-12,10-1]
Dropout rate[0,1]
+ +aThe range is adjusted based on the number of groups. bThe range is adjusted based on the number of features and sample size. + +Table 4: Hyperparameter search space used for MLP and SNN experiments. + +
HyperparameterConsidered Values
Number of hidden layers{1,2,..,6}
Size of hidden layers[0.05 × nfeatures] - [20 X nfeatures]
Alpha[10-12,10-1]
Dropout rate[0,1]
+ +Table 5: Hyperparameter search space used for FGR experiments. + +
HyperparameterConsidered Values
Number of hidden layers{1,2}
Size of hidden layersnfeatures - [50 X nfeatures]
Number of groups2- nfeatures
Alpha[10-12,10-1]
+ +# B ARCHITECTURES + +Table 6,7,8,9,10 show the selected architectures for GMLP, MLP, SNN, SET, and FGR, respectively. We used the following notation to indicate different layer types and parameters: $\mathtt { G S e l - k - m }$ represents a Group-Select layer selecting k groups of m features each. GFC indicates Group-FC layers, and $\operatorname { F C - x }$ represents fully-connected layer with $_ \textrm { x }$ hidden neurons. $\mathtt { G P O O 1 - x }$ is a Group-Pool layer of type $_ \textrm { x }$ (max, mean, linear, etc.). Concat is concatenation of groups used prior to the output layer in GMLP architectures. ${ \mathrm { S C } } ^ { - } \mathrm { x }$ refers to SET sparse evolutionary layer of size $_ \textrm { x }$ . + +Table 6: GMLP architectures used in our experiments. + +
DatasetArchitecture
CIFAR-10GSel-1536-16,GFC,ReLU,BNorm,GPool-maX,GFC,ReLU,BNorm,GPool-maX,GFC,ReLU,BNorm,GPool-max,GFC,ReLU,BNorm,Concat,FC-10,Softmax
HAPTGSel-288-12,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,Concat,FC-5,Softmax
DiabetesGSel-16-16,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm, GPool-mean,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,Concat,FC-3,Softmax
LandsatGSel-88-16,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,Concat,FC-6,Softmax
MIT-BIHGSel-240-24,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,Concat,FC-5,Softmax
MNISTGSel-64-16,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,Concat,FC-10,Softmax
SynthesizedGSel-4-2,GFC,ReLU,BNorm,Concat,FC-2,Softmax
+ +Table 7: MLP architectures used in our experiments. + +
DatasetArchitecture
CIFAR-10FC-3072,ReLU,BNorm,FC-2764,ReLU,BNorm,FC-2488,ReLU,BNorm,FC-10,Softmax
HAPTFC-106,ReLU,BNorm,FC-21,ReLU,BNorm,FC-5,SoftmaX
DiabetesFC-45,I ReLU,BNorm,FC-45,ReLU,BNorm,FC-45,ReLU,BNorm,FC-45,ReLU,BNorm,FC-3,Softmax
LandsatFC-68, ReLU,BNorm,FC-68,ReLU,BNorm,FC-68,ReLU,BNorm,FC-68,ReLU,BNorm,FC-6,Softmax
MIT-BIHFC-1737,ReLU,BNorm,FC-1737,ReLU,BNorm,FC-1737,ReLU,BNorm,FC-5,Softmax
+ +Table 8: SNN architectures used in our experiments. + +
DatasetArchitecture
CIFAR-10FC-3901,SeLU,BNorm,FC-3901,SeLU,BNorm,FC-3901,SeLU,BNorm,FC-10,Softmax
HAPTFC-510,ReLU,BNorm,FC-510,SeLU,BNorm,FC-510,SeLU,FC-5,Softmax
DiabetesFC-105,SeLU,BNorm,FC-105,SeLU,BNorm,FC-105,SeLU,BNorm,FC-3,Softmax
LandsatFC-816,SeLU,BNorm,FC-816,SeLU,BNorm,FC-6,Softmax
MIT-BIHFC-1140,SeLU,BNorm,FC-1140,SeLU,BNorm,FC-1140,SeLU,BNorm,FC-5,Softmax
+ +Table 9: SET architectures used in our experiments. + +
Dataset Architecture
CIFAR-10 SC-4000,SReLU,SC-1000,SReLU,SC-4000,SReLU,FC-10,Softmax
HAPTSC-500,SReLU,SC-500,SReLU,SC-500,SReLU,FC-5,Softmax
DiabetesSC-1000,SReLU,SC-1000,SReLU,SC-1000,SReLU,FC-3,Softmax
LandsatSC-1000,SReLU,SC-1000,SReLU,SC-1000,SReLU,FC-6,Softmax
MIT-BIH SC-1000,SReLU,SC-1000,SReLU,SC-1000,SReLU,FC-5,SoftmaX
+ +Table 10: FGR architectures used in our experiments. + +
DatasetArchitecture
CIFAR-10Group-256,FC-3072,ReLU,FC-10,Softmax
HAPTGroup-104,FC-12173,ReLU,FC-5,Softmax
DiabetesGroup-44,FC-337,ReLU,FC-3,Softmax
LandsatGroup-32,FC-1577,ReLU,FC-6,Softmax
MIT-BIHGroup-160,FC-3444,ReLU,FC-5,Softmax
+ +# C SOFTWARE IMPLEMENTATION + +Table 11 presents the list of software dependencies and versions used in our implementation. To produce results related to this paper, we used a workstation with 4 NVIDIA GeForce RTX-2080Ti GPUs, a 12 core Intel Core i9-7920X processor, and 128 GB memory. Each experiment took between about 30 minutes to 72 hours, based on the task and method being tested. + +Table 11: Software dependencies. + +
DependencyVersion
python3.7.1
pytorch1.1.0
torchvision0.2.1
cuda1001.0
ipython6.5.0
jupyter1.0.0
numpy1.15.4
nni0.9.1.1
pandas0.23.4
scikit-learn0.19.2
scipy1.1.0
pomegranate0.11.1
tqdm4.32.1
matplotlib3.0.1
+ +# D VISUAL ANALYSIS + +In Figure 10, we present a visualization of the selected feature for 25 randomly selected groups in our final CIFAR-10 architecture. Red, green, and blue colors indicate which channel is selected for each location. Compared to visualizations that are frequently used for convolutional networks, as GMLP has the flexibility to select pixels at different locations and different color channels, it is not easy to find explicit patterns in this visualization. However, one noticeable pattern is that features selected from a certain color channel usually appear in clusters resembling irregularly shaped patches. + +![](images/f18122c74dd123d377ebf80f5e3ca8a9a8d30d8b9b1e3229f4a82137393c758e.jpg) +Figure 10: Visualization of pixels selected by each group for the CIFAR-10 GMLP architecture. Red, green, and blue colors indicate which channel is selected for each location. Due to space limitations, 25 random groups out of 1536 total groups visualized here. + +Figure 11 shows the frequency in which each CIFAR-10 location is selected by the GMLP network. From this visualization, GMLP is mostly ignoring the border areas which can be a result of the data augmentation process used to train the network i.e., randomly cropping the center area and padding the margins. + +![](images/c6de4f1b62f90a17c1b1e28a45ef256082d0acf42fbf91947838a92f007d06e2.jpg) +Figure 11: Visualization of pixels selected by the group-select layer for the CIFAR-10 GMLP model. Warmer colors represent features that are being selected more frequently. \ No newline at end of file diff --git a/parse/train/SJg4Y3VFPS/SJg4Y3VFPS_content_list.json b/parse/train/SJg4Y3VFPS/SJg4Y3VFPS_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..a3b84fc4ef4dce57a7de6c254c22ef373956f6f3 --- /dev/null +++ b/parse/train/SJg4Y3VFPS/SJg4Y3VFPS_content_list.json @@ -0,0 +1,1681 @@ +[ + { + "type": "text", + "text": "GROUP-CONNECTED MULTILAYER PERCEPTRON NETWORKS ", + "text_level": 1, + "bbox": [ + 173, + 98, + 905, + 122 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Anonymous authors Paper under double-blind review ", + "bbox": [ + 183, + 145, + 400, + 172 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 209, + 544, + 226 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Despite the success of deep learning in domains such as image, voice, and graphs, there has been little progress in deep representation learning for domains without a known structure between features. For instance, a tabular dataset of different demographic and clinical factors where the feature interactions are not given as a prior. In this paper, we propose Group-Connected Multilayer Perceptron (GMLP) networks to enable deep representation learning in these domains. GMLP is based on the idea of learning expressive feature combinations (groups) and exploiting them to reduce the network complexity by defining local group-wise operations. During the training phase, GMLP learns a sparse feature grouping matrix using temperature annealing softmax with an added entropy loss term to encourage the sparsity. Furthermore, an architecture is suggested which resembles binary trees, where group-wise operations are followed by pooling operations to combine information; reducing the number of groups as the network grows in depth. To evaluate the proposed method, we conducted experiments on five different real-world datasets covering various application areas. Additionally, we provide visualizations on MNIST and synthesized data. According to the results, GMLP is able to successfully learn and exploit expressive feature combinations and achieve state-of-the-art classification performance on different datasets. ", + "bbox": [ + 233, + 242, + 764, + 492 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 522, + 336, + 537 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Deep neural networks have been quite successful across various machine learning tasks. However, this advancement has been mostly limited to certain domains. For example in image and voice data, one can leverage domain properties such as location invariance, scale invariance, coherence, etc. via using convolutional layers (Goodfellow et al., 2016). Alternatively, for graph data, graph convolutional networks were suggested to leverage adjacency patterns present in datasets structured as a graph (Kipf & Welling, 2016; Xu et al., 2019). ", + "bbox": [ + 174, + 554, + 825, + 638 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "However, there has been little progress in learning deep representations for datasets that do not follow a particular known structure in the feature domain. Take for instance the case of a simple tabular dataset for disease diagnosis. Such a dataset may consist of features from different categories such as demographics (e.g., age, gender, income, etc.), examinations (e.g., blood pressure, lab results, etc.), and other clinical conditions. In this scenario, the lack of any known structure between features to be used as a prior would lead to the use of a fully-connected multilayer perceptron network (MLP). Nonetheless, it has been known in the literature that MLP architectures, due to their huge complexity, do not usually admit efficient training and generalization for networks of more than a few layers. ", + "bbox": [ + 174, + 645, + 825, + 756 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In this paper, we propose Group-Connected Multiplayer Perceptron (GMLP) networks. The main idea behind GMLP is to learn and leverage expressive feature subsets, henceforth referred to as feature groups. A feature group is defined as a subset of features that provides a meaningful representation or high-level concept that would help the downstream task. For instance, in the disease diagnosis example, the combination of a certain blood factor and age might be the indicator of a higher level clinical condition which would help the final classification task. Furthermore, GMLP leverages feature groups limiting network connections to local group-wise connections and builds a feature hierarchy via merging groups as the network grows in depth. GMLP can be seen as an architecture that learns expressive feature combinations and leverages them via group-wise operations. ", + "bbox": [ + 174, + 762, + 825, + 888 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The main contributions of this paper are as follows: $( i )$ proposing a method for end-to-end learning of expressive feature combinations, $( i i )$ suggesting a network architecture to utilize feature groups and local connections to build deep representations, (iii) conducting extensive experiments demonstrating the effectiveness of GMLP as well as visualizations and ablation studies for better understanding of the suggested architecture. ", + "bbox": [ + 174, + 895, + 823, + 924 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "", + "bbox": [ + 176, + 103, + 823, + 145 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We evaluated the proposed method on five different real-world datasets in various application domains and demonstrated the effectiveness of GMLP compared to state-of-the-art methods in the literature. Furthermore, we conducted ablation studies and comparisons to study different architectural and training factors as well as visualizations on MNIST and synthesized data. To help to reproduce the results and encouraging future studies on group-connected architectures, we made the source code related to this paper available online 1. ", + "bbox": [ + 174, + 152, + 825, + 236 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 275, + 344, + 291 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Fully-connected MLPs are the most widely-used neural models for datasets in which no prior assumption is made on the relationship between features. However, due to the huge complexity of fully-connected layers, MLPs are prone to overfitting resulting in shallow architectures limited to a few layers in depth (Goodfellow et al., 2016). Various techniques have been suggested to improve training these models which include regularization techniques such as L-1/L-2 regularization, dropout, etc. and normalization techniques such as layer normalization, weigh normalization, batch normalization, etc.(Srivastava et al., 2014; Ba et al., 2016; Salimans & Kingma, 2016; Ioffe & Szegedy, 2015). For instance, self-normalizing neural networks (SNNs) have been recently suggested as state of the art normalization methods that prevent vanishing or exploding gradients which help training feed-forward networks with higher depths (Klambauer et al., 2017). ", + "bbox": [ + 174, + 318, + 825, + 458 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "From the architectural perspective, there has been great attention toward networks consisting of sparse connections between layers rather than having dense fully-connected layers (Dey et al., 2018). Sparse connected neural networks are usually trained based on either a sparse prior structure over the network architecture (Richter & Wattenhofer, 2018) or based on pruning a fully-connected network to a sparse network (Yun et al., 2019; Tartaglione et al., 2018; Mocanu et al., 2018). However, it should be noted that the main objective of most sparse neural network literature has been focused on improving the memory and compute requirements while maintaining competitive accuracies compared to MLPs. ", + "bbox": [ + 174, + 464, + 825, + 561 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "As a parallel line of research, the idea of using expressive feature combinations or groups has been suggested as a prior over the feature domain. Perhaps, the most successful and widespread use of this idea is in creating random forest models in which different trees are trained based on different feature subsets in order to deal with high-dimensional and high-variance data (Breiman, 2001). More recently, feature grouping is suggested by Aydore et al. (2019) as a statistical regularization technique to learn from datasets of large feature size and a small number of training samples. They do the forward network computation by projecting input features using samples taken from a bank of feature grouping matrices, reducing the input layer complexity and regularizing the model. In another recent study, Ke et al. (2018) used expressive feature combinations to learn from tabular datasets using a recursive encoder with a shared embedding network. They suggest a recursive architecture in which more important feature groups have a more direct impact on the final prediction. ", + "bbox": [ + 174, + 568, + 825, + 722 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "While promising results have been reported using these methods, feature grouping has been mostly considered as a preprocessing step. For instance, Aydore et al. (2019) uses the recursive nearest agglomeration (ReNA) (Hoyos-Idrobo et al., 2018) clustering to determine feature groups prior to the analysis. Alternatively, Ke et al. (2018) defined feature groups based on a pre-trained gradient boosting decision tree (GBDT) (Friedman, 2001). Feature grouping as a preprocessing step not only increases the complexity and raises practical considerations, but also limits the optimality of the selected features in subsequent analysis. In this study, we propose an end-to-end solution to learn expressive feature groups. Moreover, we introduce a network architecture to exploit interrelations within the feature groups to reduce the network complexity and to train deeper representations. ", + "bbox": [ + 174, + 728, + 825, + 853 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/c1d29b2cea3d35501f1bef3d00700d77364f884f1a3ac447f57fd5a8e7118523.jpg", + "image_caption": [ + "Figure 1: The GMLP network architecture. " + ], + "image_footnote": [], + "bbox": [ + 243, + 99, + 754, + 373 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 PROPOSED METHOD ", + "text_level": 1, + "bbox": [ + 176, + 422, + 377, + 439 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.1 ARCHITECTURE OVERVIEW ", + "text_level": 1, + "bbox": [ + 176, + 455, + 405, + 469 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In this paper, we propose GMLP which intuitively can be broken down to three stages: $( i )$ selecting expressive feature groups, $( i i )$ learning dynamics within each group individually, and (iii) merging information between groups as the network grows in depth (see Figure 1). In this architecture, expressive groups are jointly selected during the training phase. Furthermore, GMLP is leveraging feature groups and using local group-wise weight layers to significantly reduce the number of parameters. While the suggested idea can be materialized as different architectures, in the current study, we suggest organization of the network as architectures resembling a binary tree spanning from leaves (i.e., features) to a certain abstraction depth closer to the root2. As the network grows deeper, after each local group-wise weight layer, half of the groups are merged using pooling operations, effectively reducing the width of the network while increasing the receptive field. At the last layer, all features within all groups are concatenated into a dense feature vector fed to the output layer. ", + "bbox": [ + 173, + 481, + 825, + 633 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.2 NOTATION ", + "text_level": 1, + "bbox": [ + 174, + 651, + 287, + 665 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We consider the generic problem of supervised classification based on a dataset of feature and target pairs, $\\mathcal { D }$ : $\\left( \\pmb { x } _ { 1 : N } , \\pmb { y } _ { 1 : N } \\right)$ , where $\\pmb { x } _ { i } \\in \\Re ^ { d }$ , $y _ { i } \\in \\{ 1 \\ldots C \\}$ , and $N$ is the number of dataset samples. Furthermore, we define group size, $m$ , as the number of neurons or elements within each group, and group count, $k$ , as the number of selected groups which are essentially subsets of input features. Also, $L$ is used to refer to the total depth of a network. We use $\\pmb { z } _ { i } ^ { l } \\in \\Re ^ { m }$ to refer to activation values of group $i$ in layer $l$ . In this paper, we define all vectors as column vectors. ", + "bbox": [ + 174, + 676, + 826, + 761 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.3 NETWORK LAYERS ", + "text_level": 1, + "bbox": [ + 176, + 777, + 348, + 792 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In this section, we present the formal definition of different GMLP network layers. The very first layer of the network, Group-Select, is responsible for organizing features into $k$ groups of size $m$ each. A routing matrix, $\\Psi$ , is used for connecting each neuron within each group to exactly one feature in the feature set: ", + "bbox": [ + 174, + 804, + 823, + 858 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/d5d993d1abcea2f4089759f87e3c16e8a8bb121597d7718a42d7b270068a713d.jpg", + "text": "$$\nz _ { 1 : k } ^ { 0 } = \\Psi x ,\n$$", + "text_format": "latex", + "bbox": [ + 459, + 857, + 537, + 876 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where $\\Psi \\in \\{ 0 , 1 \\} ^ { k m \\times d }$ is a sparse matrix determining features that are present in each group. As we are interested in jointly learning $\\Psi$ during the training phase, we use the following continuous relaxation: ", + "bbox": [ + 174, + 102, + 825, + 143 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/7ce04ac6714541927ef25a4e185a055abcdf7dd5f2de98d89a42fd4d31d13a71.jpg", + "text": "$$\n\\Psi _ { i , j } \\approx \\frac { \\exp ( \\psi _ { i , j } / \\tau ) } { \\sum _ { j ^ { \\prime } = 1 } ^ { j ^ { \\prime } = d } \\exp ( \\psi _ { i , j ^ { \\prime } } / \\tau ) } .\n$$", + "text_format": "latex", + "bbox": [ + 401, + 141, + 596, + 181 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this equation, $\\psi$ is a real-valued matrix reparameterizing the routing matrix through a softmax operation with temperature, $\\tau$ . The lower the temperature, the more (2) converges to the desired discrete and sparse binary routing matrix. Note that, in the continuous relaxation, the matrix $\\psi$ can be optimized via the backpropagation of gradients from classification loss terms. In the next section, we provide further detail on temperature annealing schedules as well as other techniques to enhance the $\\Psi$ approximation. ", + "bbox": [ + 173, + 191, + 825, + 276 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Based on selected groups, we suggest local fully-connected weight layers for each group: Group-FC. The goal of Group-FC is to extract higher-level representations using the selected expressive feature subsets. This operation is usually followed by non-linearity functions (e.g., ReLU), normalization operations (e.g, Batch Norm), and dropout. Formally, Group-FC can be defined as: ", + "bbox": [ + 174, + 282, + 825, + 339 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/528c5c51dea8db6e41a83e28bc85f0976ee266751478a07ba8097f4460fa27e5.jpg", + "text": "$$\n\\begin{array} { r } { \\pmb { z } _ { i } ^ { l + 1 } = f ( W _ { i } ^ { l } \\pmb { z } _ { i } ^ { l } + \\pmb { b } _ { i } ^ { l } ) , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 421, + 347, + 575, + 366 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $W _ { i } ^ { l } \\in \\Re ^ { m \\times m }$ and $\\pmb { b } _ { i } ^ { l } \\in \\Re ^ { m }$ are the weight matrix and bias vector, applied on group $i$ at layer $l$ Here, $f$ represents other subsequent operations such as non-linearity, normalization, and dropout. ", + "bbox": [ + 174, + 375, + 826, + 404 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Lastly, Group-Pool is defined as an operation which merges representations of two groups into a single group, reducing network width by half while increasing the effective receptive field: ", + "bbox": [ + 173, + 409, + 823, + 439 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/5f3d3761878a518847f8b745a53dcd68eceb8935de4d9bc26c73c29baf7c9492.jpg", + "text": "$$\n\\begin{array} { r } { z _ { i } ^ { l + 1 } = p o o l ( z _ { i } ^ { l } , z _ { i + k / 2 ^ { l + 1 } } ^ { l } ) , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 403, + 445, + 591, + 467 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $z _ { i } ^ { l }$ and $z _ { i + k / 2 } ^ { l }$ are the ith group from the first and second halves, respectively; and pool is a pooling function from $\\Re ^ { 2 m }$ to $\\Re ^ { m }$ . In this study, we explore different variants of pooling functions such as max pooling, average pooling, or using linear weight layers as transformations from $\\Re ^ { 2 m }$ to $\\Re ^ { m }$ . Please note that while we use a similar terminology as pooling in convolutional networks, the pooling operation explained here is not applied location-wise, but instead it is applied feature-wise, between different groups pairs. ", + "bbox": [ + 173, + 474, + 825, + 564 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The values of $m$ and $k$ are closely related to the number and order of feature interactions for a certain task. Using proper $m$ and $k$ values enables us to reduce the parameter space while maintaining the model complexity required to solve the task. However, finding the ideal $m$ and $k$ directly from a given dataset is a very challenging problem. In this work, we treat $m$ and $k$ as hyperparameters to be found by a hyperparameter search. ", + "bbox": [ + 173, + 570, + 825, + 641 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.4 TRAINING ", + "text_level": 1, + "bbox": [ + 174, + 657, + 287, + 672 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We define the objective function to be used for end-to-end training of weights as well as the routing matrix as: ", + "bbox": [ + 174, + 684, + 825, + 712 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/45ae1efe1774739a1fb528c5640a32343bd17fde145c07952a96a552502cfed8.jpg", + "text": "$$\nL = - \\frac { 1 } { N } \\sum _ { i } \\sum _ { c } y _ { i , c } \\log ( F _ { \\theta } ( \\pmb { x } _ { i } ) ) + \\lambda H ( \\psi ) + \\alpha \\sum _ { \\omega \\in \\theta } | | \\omega | | _ { 2 } ^ { 2 } .\n$$", + "text_format": "latex", + "bbox": [ + 299, + 708, + 699, + 747 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this objective function, the first term is the standard cross-entropy classification loss where $F _ { \\theta }$ denotes the GMLP network as a function with parameters $\\theta$ , and $N$ is the number of training samples used. The second term is an entropy loss over the distribution of the routing matrix that is weighted by the hyperparameter $\\lambda$ : ", + "bbox": [ + 173, + 751, + 825, + 806 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/80833478d96310b008fb4d7c5133b52fa8c2bd330ad915eb54322db0ba2e61ae.jpg", + "text": "$$\nH ( \\psi ) = - \\frac { 1 } { d } \\sum _ { j = 1 } ^ { j = d } \\sum _ { i = 1 } ^ { i = k m } \\frac { \\exp ( \\psi _ { i , j } ) } { \\sum _ { j ^ { \\prime } = 1 } ^ { j ^ { \\prime } = d } \\exp ( \\psi _ { i , j ^ { \\prime } } ) } \\mathrm { l o g } ( \\frac { \\exp ( \\psi _ { i , j } ) } { \\sum _ { j ^ { \\prime } = 1 } ^ { j ^ { \\prime } = d } \\exp ( \\psi _ { i , j ^ { \\prime } } ) } ) .\n$$", + "text_format": "latex", + "bbox": [ + 284, + 814, + 714, + 861 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "$H ( \\psi )$ is minimizing the entropy corresponding to the distribution of $\\psi$ regardless of the temperature used for $\\Psi$ approximation. Accordingly, $\\lambda$ can be viewed as a hyperparameter and as an additional method for encouraging sparse $\\Psi$ matrices. The last term in (5) is an L-2 regularization term with the hyperparameter $\\alpha$ to control the magnitude of parameters in layer weights and in $\\psi$ . Note that without the L-2 regularization term, $\\psi$ elements may keep increasing during the optimization loop, since $\\psi$ only appears in normalized form in the objective function of (5). ", + "bbox": [ + 174, + 867, + 825, + 924 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "", + "bbox": [ + 171, + 103, + 825, + 132 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We use Adam (Kingma & Ba, 2014) optimization algorithm starting from the default 0.001 learning rate and reducing the learning rate by a factor of 5 as the validation accuracy stops improving. Regarding the temperature annealing, during the training, the temperature is exponentially decayed from 1.0 to 0.01. In order to initialize the Group-FC weights, we used Xavier initialization (Glorot & Bengio, 2010) with m for both fan-in and fan-out values. Similarly, the $\\psi$ matrix is initialized by setting the fan-in equal to $d$ and fan-out to $k m$ . ", + "bbox": [ + 174, + 138, + 825, + 223 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Further detail on architectures and hyperparameters used for each specific experiment as well as details on the software implementation are provided as appendices to this paper. ", + "bbox": [ + 173, + 229, + 823, + 258 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.5 ANALYSIS ", + "text_level": 1, + "bbox": [ + 174, + 275, + 287, + 290 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The computational complexity of GMLP at the prediction time can be written as (for simplicity, ignoring bias and pooling terms): ", + "bbox": [ + 173, + 301, + 825, + 330 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/20d4348b2b09ac791f02e3029c19618100a3f737e512af23a7c3ed32ed1be77d.jpg", + "text": "$$\nk m + k m ^ { 2 } + \\frac { k m ^ { 2 } } { 2 } + \\frac { k m ^ { 2 } } { 4 } + . . . + \\frac { k m ^ { 2 } } { 2 ^ { L - 1 } } + C \\frac { k m } { 2 ^ { L - 1 } } .\n$$", + "text_format": "latex", + "bbox": [ + 321, + 337, + 676, + 371 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this series, the first term, $k m$ , is the work required to organize features to groups. The subsequent terms, except the last term, are representing the computational cost of local fully-connected operations at each layer. The last term is the complexity of the output layer transformation from the concatenated features to the number of classes. Therefore, the computational complexity of GMLP at the prediction time can be written as with a similar network $\\begin{array} { r } { \\mathcal { O } ( k m ^ { 2 } + \\frac { C k m } { 2 L - 1 } ) } \\end{array}$ . In comparison, the computational complexity of an MLP ", + "bbox": [ + 174, + 376, + 825, + 460 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/4e717f6fd1b8c1e031deed818e8c38578330f5e5ed38fd0e41700bc75be38497.jpg", + "text": "$$\nk m d + k ^ { 2 } m ^ { 2 } + \\frac { k ^ { 2 } m ^ { 2 } } { 2 } + \\frac { k ^ { 2 } m ^ { 2 } } { 4 } + . . . + \\frac { k ^ { 2 } m ^ { 2 } } { 2 ^ { L - 1 } } + C \\frac { k m } { 2 ^ { L - 1 } } ,\n$$", + "text_format": "latex", + "bbox": [ + 303, + 464, + 692, + 497 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where the first term is the work required for the first network layer from $d$ to $k m$ neurons, the second term is corresponding to a hidden layer of size $k m$ , and so forth. The last term is the complexity $\\begin{array} { r } { \\mathcal { O } ( k m d + { k ^ { 2 } } { m ^ { 2 } } + \\frac { C k m } { 2 { L - 1 } } ) } \\end{array}$ r to the case of GMLP. The overall work required from this equa) complexity. This is substantially higher than GMLP, for typical $k , d .$ is of, and $C$ values. ", + "bbox": [ + 174, + 502, + 825, + 573 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Additionally, the density of the Group-FC layer connections can be calculated as: $\\begin{array} { r } { \\frac { k m ^ { 2 } } { k ^ { 2 } m ^ { 2 } } = \\frac { 1 } { k } } \\end{array}$ , which is very small for reasonably large number of $k$ values used in our experiments. Also, assuming pooling operations in every other layer, the receptive field size or the maximum number of features impacting a neuron at layer $l$ can be written as $2 ^ { { \\hat { l } } - 1 } m$ . For instance, a neuron in the first layer of the network is only connected to $m$ features, and a neuron in the second layer is connected to two groups or $2 m$ features and so forth. ", + "bbox": [ + 174, + 578, + 825, + 664 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 176, + 684, + 326, + 700 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4.1 EXPERIMENTAL SETUP ", + "text_level": 1, + "bbox": [ + 176, + 717, + 375, + 731 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The proposed method is evaluated on five different real-world datasets, covering various domains and applications: permutation invariant CIFAR-10 (Krizhevsky et al., 2009), human activity recognition (HAPT) (Anguita et al., 2013), diabetes classification (Kachuee et al., 2019), UCI Landsat (Dua & Graff, 2017), and MIT-BIH arrhythmia classification (Moody & Mark, 2001) datasets. Additionally, we use MNIST (LeCun et al., 2010) and a synthesized dataset to provide further insight into the operation of GMLP (see Section 4.4). Table 1 presents a summary of datasets used in this study. Regarding the CIFAR-10 dataset, we permute the image pixels to discard pixel coordinates in our experiments. Note that the permutation is not changing across samples, it is merely a fixed random ordering used to remove pixel coordinates for each experiment. For all datasets, basic statistical normalization with $\\mu = 0$ and $\\sigma = 1$ is used to normalize features as a preprocessing step. The only exception is CIFAR-10 for which we used the standard channel-wise normalization and standard data augmentation (i.e., random crops and random horizontal flips). The standard test and train data splits were used as dictated by dataset publishers. In cases that the separated sets are not provided, test and train subsets are created by randomly splitting samples to $2 0 \\%$ for test and the rest for training/validation. ", + "bbox": [ + 174, + 743, + 825, + 924 + ], + "page_idx": 4 + }, + { + "type": "table", + "img_path": "images/08c80a9795d1043d51615805605cd8dd69d06e3efea202634d736cea292c1a27.jpg", + "table_caption": [ + "Table 1: Summary of datasets used in our experiments. " + ], + "table_footnote": [ + "aPermuted version, i.e. pixel coordinates are ignored. " + ], + "table_body": "
Dataset# Train Samples# Test Samples#Features# ClassesDomain
CIFAR-10a (Krizhevsky et al.,2009)50,00010.000307210Image Classification
HAPT (Anguita et al., 2013)6,0022,4515615Activity Recognition
Diabetes (Kachuee et al., 2019)73,64918,413453Disease Diagnosis
Landsat (Dua & Graff,2017)4,4352,000366Satellite Imaging
MIT-BIH(Moody & Mark,2001)87,55421,8921875Time Series
MNIST (LeCun et al., 2010)60,00010,00078410Digit Classification
Synthesized (Section 4.4)5,1201,28062See Figure 8
", + "bbox": [ + 176, + 127, + 821, + 256 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 304, + 823, + 333 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We compare the performance of the proposed method with recent related work including SelfNormalizing Neural Networks (SNN) (Klambauer et al., 2017), Sparse Evolutionary Training (SET) (Mocanu et al., $2 0 1 8 ) ^ { 3 }$ , Feature Grouping as a Stochastic Regularizer (in this paper, denoted as FGR) (Aydore et al., 2019)4 as well as the basic dropout regularized and batch normalized MLPs. In order to ensure a fair comparison, we adapted source codes provided by other work to be compatible with our data loader and preprocessing modules. ", + "bbox": [ + 173, + 340, + 825, + 424 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Furthermore, for each method, we conducted an extensive hyperparameter search using Microsoft Neural Network Intelligence (NNI) toolkit5 and the Tree-structured Parzen Estimator (TPE) tuner (Bergstra et al., 2011) covering different architectural and learning hyperparameters for each case. More detail on hyperparameter search spaces and specific architectures used in this paper is provided in Appendix A and Appendix B. We run each case using the best hyperparameter configuration eight times and report mean and standard deviation values. ", + "bbox": [ + 174, + 431, + 825, + 513 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.2 RESULTS ", + "text_level": 1, + "bbox": [ + 174, + 531, + 277, + 545 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Table 2 presents a comparison between the proposed method (GMLP) and 4 other baselines: MLP, SNN (Klambauer et al., 2017), SET (Mocanu et al., 2018), and FGR (Aydore et al., 2019). As it can be seen from this comparison, GMLP outperforms other work, achieving state-of-the-art classification accuracies. Concerning the CIFAR-10 results, to the best of our knowledge, GMLP achieves a new state-of-the-art performance on permutation invariant CIFAR-10 augmented using the standard data augmentation. We believe that leveraging expressive feature groups enables GMLP to consistently perform better across different datasets. ", + "bbox": [ + 174, + 558, + 825, + 655 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To compare model complexity and performance we conduct an experiment by changing the number of model parameters and reporting the resulting test accuracies. Here, we reduce the number of parameters by reducing the width of each network; i.e. reducing the number of groups and hidden neurons for GMLP and MLP, respectively. Figure 2 shows accuracy versus the number of parameters for the GMLP and MLP baseline on CIFAR-10 and MIT-BIH datasets. Based on this figure, GMLP is able to achieve higher accuracies using significantly less number of parameters. It is consistent with the complexity analysis provided in Section 3.5. Note that in this comparison, we consider the number of parameters involved at the prediction time. ", + "bbox": [ + 174, + 661, + 825, + 773 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.3 ABLATION STUDY ", + "text_level": 1, + "bbox": [ + 176, + 790, + 341, + 804 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Figure 3 presents an ablation study comparing the performance of GMLP on CIFAR-10 dataset for networks trained: $( i )$ using both the temperature annealing and the entropy loss objective, (ii) using only temperature annealing without the entropy loss objective, $( i i i )$ using no temperature annealing but using the entropy loss objective, $( i v )$ not using any of the temperature annealing or the entropy loss objective. From this figure, it can be seen that excluding both techniques leads to a significantly lower performance. However, using any of the two techniques leads to relatively similar high accuracies. It is consistent with the intuition that the functionality of these techniques is to encourage learning sparse routing matrices, either using softmax temperatures or entropy regularization to achieve this. In this paper, in order to ensure sparse and low complexity routing matrices, we use both techniques simultaneously as in case $( i )$ . ", + "bbox": [ + 174, + 816, + 825, + 872 + ], + "page_idx": 5 + }, + { + "type": "table", + "img_path": "images/4f729724ff918cdf5530e6d79c7d6dc399d912f4bbe63b0c42f7d3c7d3227ff5.jpg", + "table_caption": [ + "Table 2: Comparison of top-1 test accuracies for GMLP and other work. " + ], + "table_footnote": [ + "aSelf-Normalizing Neural Networks (Klambauer et al., 2017) bSparse Evolutionary Training (Mocanu et al., 2018) cFeature Grouping as a Stochastic Regularizer (Aydore et al., 2019) dPermuted version, i.e. pixel coordinates are ignored. " + ], + "table_body": "
Accuracy (%)
DatasetGMLPMLPSNNaSETbFGRc
CIFAR-10d (Krizhevsky et al., 2009)73.76 (±0.14)68.15 (±0.56)66.88 (±0.30)72.71 (±0.29)45.90 (±0.40)
HAPT (Anguita et al., 2013)96.34 (±0.19)95.73 (±0.38)95.47 (±0.09)71.35 (±0.74)91.57 (±0.31)
Diabetes (Kachuee et al.,2019)90.92 (±0.07)90.68 (±0.06)90.31 (±0.10)85.07 (±0.61)89.24 (±0.08)
Landsat (Dua & Graff,2017)91.54 (±0.16)91.21 (±0.44)91.37 (±0.21)91.03 (±0.56)90.70 (±0.17)
MIT-BIH(Moody & Mark,2001)98.74 (±0.04)98.65 (±0.01)98.56 (±0.02)98.10 (±0.01)98.13 (±0.03)
", + "bbox": [ + 176, + 127, + 820, + 252 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/d26c4b320c2c398b02009e440c592db21896536976c571200b75f1d20484e65b.jpg", + "image_caption": [ + "Figure 2: Accuracy versus number of parameters for this work (GMLP) and the MLP baseline: (a) CIFAR-10 dataset, (b) MIT-BIH dataset. The $\\mathbf { X }$ -axis is in a logarithmic scale " + ], + "image_footnote": [], + "bbox": [ + 173, + 338, + 823, + 554 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 631, + 825, + 715 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Figure 4 shows a comparison between GMLP models trained on CIFAR-10 using different pooling types: $( i )$ linear transformation, $( i i )$ max pooling, and $( i i i )$ average pooling. As it can be seen from this comparison, while there are slight differences in the convergence speed of using different pooling types, all of them achieve relatively similar accuracies. In our experiments, we decided to use max pooling and average pooling as they provide reasonable results without the need to introduce additional parameters required for the linear pooling method. ", + "bbox": [ + 173, + 722, + 825, + 805 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Figure 5 shows learning curves for training CIFAR-10 GMLP models using different group sizes. As it can be seen from this figure, using very small group sizes would cause a reduction in the final accuracy. At the other extreme, the improvement achieved using larger values is negligible for $m$ values more than 16. Finally, Figure 6 shows a comparison between learning curves for using a different number of groups. Using very small $k$ values result in a significant reduction in performance. However, the rate of performance gains for using more groups is very small for $k$ of more than 1536. Note that the number of model parameters and compute scales linearly with $k$ and quadratically with $m$ (see Section 3.5). ", + "bbox": [ + 173, + 811, + 826, + 924 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/ec451b5dcc3d15a4b055447f394e6b8be9a5fa4bfe08e4a086a4fdc284d82bb0.jpg", + "image_caption": [ + "Figure 3: Ablation study demonstrating the impact of temperature annealing and entropy loss terms. " + ], + "image_footnote": [], + "bbox": [ + 171, + 99, + 831, + 294 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/31eb22c5a65b11f8db055dab3da98be8c4fff744e3c6ce3eb7019fda6b37313a.jpg", + "image_caption": [ + "Figure 5: Ablation study on the impact of using different group sizes $( m )$ . For this experiment, we used $k { = } 1 5 3 6$ . " + ], + "image_footnote": [], + "bbox": [ + 173, + 348, + 498, + 542 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/f5d07291db61bdf6e202b4af44e455999a04c9bd2e363b9f778a6200f99f31b6.jpg", + "image_caption": [ + "Figure 4: Ablation study demonstrating the impact of different pooling functions. ", + "Figure 6: Ablation study on the impact of using different number of groups $( k )$ . For this experiment, we used $m { = } 1 6$ . " + ], + "image_footnote": [], + "bbox": [ + 506, + 349, + 830, + 542 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.4 EXPERIMENTS ON MNIST AND SYNTHESIZED DATA ", + "text_level": 1, + "bbox": [ + 173, + 626, + 578, + 640 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "MNIST dataset (LeCun et al., 2010) is used to visually inspect the performance of the Group-Select layer. Figure 7 shows a heat-map of how frequently each pixel is selected across all feature groups for: $( a )$ original MNIST samples, (b) MNIST samples where the lower-half is replaced by Gaussian noise. From Figure 7a, it can be seen that most groups are selecting pixels within the center of the frame, effectively discarding margin pixels. This is consistent with other work which show the importance of different locations for MNIST images (Kachuee et al., 2018). Apart from this, in Figure 7b, a version of the MNIST dataset is used in which half of the frame does not provide any useful information for the downstream classification task. From this figure, GMLP is not selecting any features to be used from the lower region. ", + "bbox": [ + 174, + 652, + 825, + 777 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In order to show the effectiveness of GMLP, we synthesized a dataset which has intrinsic and known expressive feature groups. Specifically, we used a simple Bayesian network as depicted in Figure 8. This network consists of six binary features, A to F, interacting with each other as specified by the graph edges, which determine the distribution of the target node, J. The graph and conditionals are designed such that each of the nodes in the second level take the XOR value of their parents with a $9 9 \\%$ probability. The target node, J, is essentially one with a high probability if at least two of the second level nodes are one. We synthesized dataset by sampling 6,400 samples from the network (1,280 samples for test and the rest of training/evaluation). On this dataset, we trained a very simple GMLP consisting of four groups of size two, one group-wise fully-connected layer, and an output layer. Figure 9 shows the features selected for each group after the training phase (i.e., the $\\Psi$ matrix). ", + "bbox": [ + 174, + 785, + 825, + 924 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/be34d4ab1e56d0743796f3b972d79052ac656ff4def94a3af94f04280b784cb3.jpg", + "image_caption": [ + "Figure 7: MNIST visualization of pixels selected by the Group-Select layer: (a) using complete images as input, (b) using images that the lower half is replaced by Gaussian noise. In this figure, warmer colors represent pixels being being present in more groups. " + ], + "image_footnote": [], + "bbox": [ + 266, + 102, + 730, + 296 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "From this figure, the Group-Select layer successfully learns to detect the feature pairs that are interacting, enabling the Group-FC layers to decode the non-linear XOR relations. ", + "bbox": [ + 169, + 377, + 823, + 406 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/3028e5791c3271e74e91ac8dd61f67f7a45ce591feb1177f4985246c80008720.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 205, + 431, + 465, + 551 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "$\\begin{array} { l l } { P ( G = A \\oplus B ) = 0 . 9 9 } & { , P ( G \\neq A \\oplus B ) = 0 . 0 1 } \\\\ { P ( H = C \\oplus D ) = 0 . 9 9 } & { , P ( H \\neq C \\oplus D ) = 0 . 0 1 } \\\\ { P ( I = E \\oplus F ) = 0 . 9 9 } & { , P ( I \\neq E \\oplus F ) = 0 . 0 1 } \\end{array}$ $\\begin{array} { l } { P [ J = ( G \\land H ) \\lor ( G \\land I ) \\lor ( H \\land I ) ] = 0 . 9 9 } \\\\ { P [ J \\neq ( G \\land H ) \\lor ( G \\land I ) \\lor ( H \\land I ) ] = 0 . 0 1 } \\end{array}$ ", + "bbox": [ + 200, + 559, + 468, + 637 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/98b30235aff7dc90e1118b185b0ecf3d8c34a1bc9f40e599bc9dde9753a54ae8.jpg", + "image_caption": [ + "Figure 8: The Bayesian network and conditionals used to generate the synthesized dataset of binary features A-F and target J. ", + "Figure 9: Visualization of the selected features within each group. Every two consecutive rows show features selected for a certain group. " + ], + "image_footnote": [], + "bbox": [ + 511, + 424, + 772, + 650 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 DISCUSSION ", + "text_level": 1, + "bbox": [ + 174, + 746, + 310, + 761 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Intuitively, training a GMLP model with certain groups can be viewed as a prior assumption over the number and order of interactions between the features. It is a reasonable prior assumption as in many natural datasets, a conceptual hierarchy exists where only a limited number of features interact with each other. Furthermore, it is consistent with the discoveries made in understanding the human decision-making process; finding that we are only able to consider at most nine factors at the same time during a decision making process (Cowan, 2001; Baddeley, 1994). ", + "bbox": [ + 174, + 776, + 825, + 861 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Additionally, GMLP can be considered as a more general neural counterpart of random forests. Both models use different subsets of features (i.e., groups) and learn interactions within each group. One major difference between the two methods is the fact that GMLP combines information between different groups using pooling operations, while random forest uses the selected features to train an ensemble of independent trees on each group. From another perspective, the idea of studying feature groups is closely related to causal models such as Bayesian networks and factor graphs (Darwiche, 2009; Neapolitan et al., 2004; Clifford, 1990). These methods are often impractical for large-scale problems, because without a prior over the causal graph, they require an architecture search of the NP-complete complexity or more. ", + "bbox": [ + 174, + 867, + 825, + 924 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 174 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "6 CONCLUSION ", + "text_level": 1, + "bbox": [ + 174, + 193, + 318, + 209 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "In this paper, we proposed GMLP as a solution for deep learning in domains where the feature interactions are not known as prior and do not admit the use of convolutional or other techniques leveraging domain priors. GMLP jointly learns expressive feature combinations and employs groupwise operations to reduce the network complexity. We conducted extensive experiments demonstrating the effectiveness of the proposed idea and compared the achieved performances with state-of-the-art methods in the literature. ", + "bbox": [ + 174, + 224, + 825, + 308 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 174, + 329, + 285, + 344 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Davide Anguita, Alessandro Ghio, Luca Oneto, Xavier Parra, and Jorge Luis Reyes-Ortiz. A public domain dataset for human activity recognition using smartphones. In Esann, 2013. ", + "bbox": [ + 173, + 352, + 823, + 380 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Sergul Aydore, Bertrand Thirion, and Gael Varoquaux. Feature grouping as a stochastic regularizer for high-dimensional structured data. In International Conference on Machine Learning, pp. 385–394, 2019. ", + "bbox": [ + 173, + 388, + 823, + 430 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E Hinton. Layer normalization. arXiv preprint arXiv:1607.06450, 2016. ", + "bbox": [ + 171, + 439, + 823, + 468 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Alan Baddeley. The magical number seven: Still magic after all these years? 1994. ", + "bbox": [ + 173, + 476, + 720, + 491 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "James S Bergstra, Rémi Bardenet, Yoshua Bengio, and Balázs Kégl. Algorithms for hyper-parameter optimization. In Advances in neural information processing systems, pp. 2546–2554, 2011. ", + "bbox": [ + 171, + 498, + 825, + 529 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Leo Breiman. Random forests. Machine learning, 45(1):5–32, 2001. ", + "bbox": [ + 173, + 535, + 625, + 551 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Peter Clifford. Markov random fields in statistics. Disorder in physical systems: A volume in honour of John M. Hammersley, 19, 1990. ", + "bbox": [ + 176, + 559, + 825, + 587 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Nelson Cowan. The magical number 4 in short-term memory: A reconsideration of mental storage capacity. Behavioral and brain sciences, 24(1):87–114, 2001. ", + "bbox": [ + 173, + 595, + 823, + 625 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Adnan Darwiche. Modeling and reasoning with Bayesian networks. Cambridge university press, 2009. ", + "bbox": [ + 173, + 632, + 823, + 661 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Sourya Dey, Kuan-Wen Huang, Peter A Beerel, and Keith M Chugg. Characterizing sparse connectivity patterns in neural networks. In 2018 Information Theory and Applications Workshop (ITA), pp. 1–9. IEEE, 2018. ", + "bbox": [ + 173, + 669, + 828, + 712 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Dheeru Dua and Casey Graff. UCI machine learning repository, 2017. URL http://archive. ics.uci.edu/ml. ", + "bbox": [ + 173, + 719, + 823, + 750 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jerome H Friedman. Greedy function approximation: a gradient boosting machine. Annals of statistics, pp. 1189–1232, 2001. ", + "bbox": [ + 173, + 757, + 823, + 786 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Xavier Glorot and Yoshua Bengio. Understanding the difficulty of training deep feedforward neural networks. In Proceedings of the thirteenth international conference on artificial intelligence and statistics, pp. 249–256, 2010. ", + "bbox": [ + 173, + 794, + 825, + 837 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ian Goodfellow, Yoshua Bengio, and Aaron Courville. Deep Learning. MIT Press, 2016. http: //www.deeplearningbook.org. ", + "bbox": [ + 173, + 844, + 823, + 875 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Andrés Hoyos-Idrobo, Gaël Varoquaux, Jonas Kahn, and Bertrand Thirion. Recursive nearest agglomeration (rena): fast clustering for approximation of structured signals. IEEE transactions on pattern analysis and machine intelligence, 41(3):669–681, 2018. ", + "bbox": [ + 176, + 882, + 825, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by reducing internal covariate shift. arXiv preprint arXiv:1502.03167, 2015. ", + "bbox": [ + 171, + 103, + 825, + 132 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Mohammad Kachuee, Sajad Darabi, Babak Moatamed, and Majid Sarrafzadeh. Dynamic feature acquisition using denoising autoencoders. IEEE transactions on neural networks and learning systems, 2018. ", + "bbox": [ + 173, + 140, + 823, + 184 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Mohammad Kachuee, Kimmo Karkkainen, Orpaz Goldstein, Davina Zamanzadeh, and Majid Sarrafzadeh. Nutrition and health data for cost-sensitive learning. arXiv preprint arXiv:1902.07102, 2019. ", + "bbox": [ + 174, + 193, + 825, + 234 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Guolin Ke, Jia Zhang, Zhenhui Xu, Jiang Bian, and Tie-Yan Liu. Tabnn: A universal neural network solution for tabular data. 2018. ", + "bbox": [ + 173, + 243, + 825, + 272 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Diederik P Kingma and Jimmy Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980, 2014. ", + "bbox": [ + 174, + 281, + 823, + 310 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Thomas N Kipf and Max Welling. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907, 2016. ", + "bbox": [ + 174, + 319, + 823, + 349 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Günter Klambauer, Thomas Unterthiner, Andreas Mayr, and Sepp Hochreiter. Self-normalizing neural networks. In Advances in neural information processing systems, pp. 971–980, 2017. ", + "bbox": [ + 173, + 357, + 823, + 387 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images. Technical report, Citeseer, 2009. ", + "bbox": [ + 173, + 395, + 825, + 424 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Yann LeCun, Corinna Cortes, and CJ Burges. Mnist handwritten digit database. AT&T Labs [Online]. Available: http://yann. lecun. com/exdb/mnist, 2:18, 2010. ", + "bbox": [ + 176, + 433, + 823, + 463 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Decebal Constantin Mocanu, Elena Mocanu, Peter Stone, Phuong H Nguyen, Madeleine Gibescu, and Antonio Liotta. Scalable training of artificial neural networks with adaptive sparse connectivity inspired by network science. Nature communications, 9(1):2383, 2018. ", + "bbox": [ + 173, + 469, + 826, + 513 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "George B Moody and Roger G Mark. The impact of the mit-bih arrhythmia database. IEEE Engineering in Medicine and Biology Magazine, 20(3):45–50, 2001. ", + "bbox": [ + 174, + 522, + 825, + 551 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Richard E Neapolitan et al. Learning bayesian networks, volume 38. Pearson Prentice Hall Upper Saddle River, NJ, 2004. ", + "bbox": [ + 173, + 559, + 825, + 589 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Oliver Richter and Roger Wattenhofer. Treeconnect: A sparse alternative to fully connected layers. In 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 924–931. IEEE, 2018. ", + "bbox": [ + 174, + 597, + 826, + 640 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Tim Salimans and Durk P Kingma. Weight normalization: A simple reparameterization to accelerate training of deep neural networks. In Advances in Neural Information Processing Systems, pp. 901–909, 2016. ", + "bbox": [ + 174, + 648, + 826, + 691 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. Dropout: a simple way to prevent neural networks from overfitting. The journal of machine learning research, 15(1):1929–1958, 2014. ", + "bbox": [ + 176, + 700, + 823, + 743 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Enzo Tartaglione, Skjalg Lepsøy, Attilio Fiandrotti, and Gianluca Francini. Learning sparse neural networks via sensitivity-driven regularization. In Advances in Neural Information Processing Systems, pp. 3878–3888, 2018. ", + "bbox": [ + 176, + 752, + 823, + 795 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. How powerful are graph neural networks? In International Conference on Learning Representations, 2019. URL https: //openreview.net/forum?id $\\underline { { \\underline { { \\mathbf { \\Pi } } } } } =$ ryGs6iA5Km. ", + "bbox": [ + 176, + 804, + 823, + 847 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Jihun Yun, Peng Zheng, Eunho Yang, Aurelie Lozano, and Aleksandr Aravkin. Trimming the $l _ { 1 }$ regularizer: Statistical analysis, optimization, and applications to deep learning. In International Conference on Machine Learning, pp. 7242–7251, 2019. ", + "bbox": [ + 174, + 856, + 825, + 898 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "A HYPERPARAMETER SEARCH SPACE ", + "text_level": 1, + "bbox": [ + 176, + 102, + 504, + 118 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Tables 3-5 present the hyperparameter search space considered for experiments on GMLP, MLP, SNN, and FGR, respectively. For the GMLP search space, the number of groups is adjusted based on the number of features and samples in each specific task. Also, the number of layers is adjusted to be compatible with the number of groups being used. Regarding the FGR experiments, due to scalability issues of the published source provided by the original authors, we were only able to train networks with at most two hidden layers. For SET, as their architecture is evolutionary i.e., prunes certain weights and adds new ones, we only explored using a different number of hidden neurons in the range of 500 to 4000. ", + "bbox": [ + 174, + 133, + 825, + 244 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Regarding the number of epochs, we used 2000 epochs for CIFAR-10, 1000 epochs for HAPT, 100 epochs for Diabetes, 300 epochs for Landsat, and 300 epochs for MIT-BIH experiments. The only exception is the SNN experiments where we had to reduce the learning rate to increase the stability of the training resulting in more epochs required to converge. ", + "bbox": [ + 174, + 251, + 825, + 308 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/df7b75211edc15ca96c8f9e50dcd25e7b6449637f6b805138e78cfa2c33b33f9.jpg", + "table_caption": [ + "Table 3: Hyperparameter search space used for GMLP experiments. " + ], + "table_footnote": [ + "aThe range is adjusted based on the number of groups. bThe range is adjusted based on the number of features and sample size. " + ], + "table_body": "
HyperparameterConsidered Values
Number of hidden layers{1,2,..,8]a
Number of groups16 - 4096b
Size of groups4-32
Lambda[10-²,104]
Alpha[10-12,10-1]
Dropout rate[0,1]
", + "bbox": [ + 330, + 347, + 665, + 493 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/7c4ef75dbc564ee535449d29e5bf4b668d37663b820d718142ddf28c94ca0257.jpg", + "table_caption": [ + "Table 4: Hyperparameter search space used for MLP and SNN experiments. " + ], + "table_footnote": [], + "table_body": "
HyperparameterConsidered Values
Number of hidden layers{1,2,..,6}
Size of hidden layers[0.05 × nfeatures] - [20 X nfeatures]
Alpha[10-12,10-1]
Dropout rate[0,1]
", + "bbox": [ + 271, + 578, + 725, + 686 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/cb6f93ec8332dd22ee97a46187b5bb083e473c0129e0db9513a280d929fec982.jpg", + "table_caption": [ + "Table 5: Hyperparameter search space used for FGR experiments. " + ], + "table_footnote": [], + "table_body": "
HyperparameterConsidered Values
Number of hidden layers{1,2}
Size of hidden layersnfeatures - [50 X nfeatures]
Number of groups2- nfeatures
Alpha[10-12,10-1]
", + "bbox": [ + 299, + 733, + 697, + 842 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "B ARCHITECTURES ", + "text_level": 1, + "bbox": [ + 176, + 102, + 352, + 117 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Table 6,7,8,9,10 show the selected architectures for GMLP, MLP, SNN, SET, and FGR, respectively. We used the following notation to indicate different layer types and parameters: $\\mathtt { G S e l - k - m }$ represents a Group-Select layer selecting k groups of m features each. GFC indicates Group-FC layers, and $\\operatorname { F C - x }$ represents fully-connected layer with $_ \\textrm { x }$ hidden neurons. $\\mathtt { G P O O 1 - x }$ is a Group-Pool layer of type $_ \\textrm { x }$ (max, mean, linear, etc.). Concat is concatenation of groups used prior to the output layer in GMLP architectures. ${ \\mathrm { S C } } ^ { - } \\mathrm { x }$ refers to SET sparse evolutionary layer of size $_ \\textrm { x }$ . ", + "bbox": [ + 173, + 133, + 826, + 218 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/b72a23e662f3fdd92762a6fe13068edad5e5365c8213fa89b96993c8bb464f26.jpg", + "table_caption": [ + "Table 6: GMLP architectures used in our experiments. " + ], + "table_footnote": [], + "table_body": "
DatasetArchitecture
CIFAR-10GSel-1536-16,GFC,ReLU,BNorm,GPool-maX,GFC,ReLU,BNorm,GPool-maX,GFC,ReLU,BNorm,GPool-max,GFC,ReLU,BNorm,Concat,FC-10,Softmax
HAPTGSel-288-12,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,Concat,FC-5,Softmax
DiabetesGSel-16-16,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm, GPool-mean,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,Concat,FC-3,Softmax
LandsatGSel-88-16,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,Concat,FC-6,Softmax
MIT-BIHGSel-240-24,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,Concat,FC-5,Softmax
MNISTGSel-64-16,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,Concat,FC-10,Softmax
SynthesizedGSel-4-2,GFC,ReLU,BNorm,Concat,FC-2,Softmax
", + "bbox": [ + 174, + 257, + 823, + 556 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/caeaf4ca5c1ffedd5f0a0a23fc391383e20a0aad09e92a6724280d43754fd070.jpg", + "table_caption": [ + "Table 7: MLP architectures used in our experiments. " + ], + "table_footnote": [], + "table_body": "
DatasetArchitecture
CIFAR-10FC-3072,ReLU,BNorm,FC-2764,ReLU,BNorm,FC-2488,ReLU,BNorm,FC-10,Softmax
HAPTFC-106,ReLU,BNorm,FC-21,ReLU,BNorm,FC-5,SoftmaX
DiabetesFC-45,I ReLU,BNorm,FC-45,ReLU,BNorm,FC-45,ReLU,BNorm,FC-45,ReLU,BNorm,FC-3,Softmax
LandsatFC-68, ReLU,BNorm,FC-68,ReLU,BNorm,FC-68,ReLU,BNorm,FC-68,ReLU,BNorm,FC-6,Softmax
MIT-BIHFC-1737,ReLU,BNorm,FC-1737,ReLU,BNorm,FC-1737,ReLU,BNorm,FC-5,Softmax
", + "bbox": [ + 176, + 606, + 821, + 797 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/75f80422c9a796bded563caa5246b3a2877c91162e47a23f23c745013c2a76aa.jpg", + "table_caption": [ + "Table 8: SNN architectures used in our experiments. " + ], + "table_footnote": [], + "table_body": "
DatasetArchitecture
CIFAR-10FC-3901,SeLU,BNorm,FC-3901,SeLU,BNorm,FC-3901,SeLU,BNorm,FC-10,Softmax
HAPTFC-510,ReLU,BNorm,FC-510,SeLU,BNorm,FC-510,SeLU,FC-5,Softmax
DiabetesFC-105,SeLU,BNorm,FC-105,SeLU,BNorm,FC-105,SeLU,BNorm,FC-3,Softmax
LandsatFC-816,SeLU,BNorm,FC-816,SeLU,BNorm,FC-6,Softmax
MIT-BIHFC-1140,SeLU,BNorm,FC-1140,SeLU,BNorm,FC-1140,SeLU,BNorm,FC-5,Softmax
", + "bbox": [ + 176, + 174, + 821, + 377 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/0a868bee8c28257311ab48facc8e4c3379f4b29c5ca62284254ede93a0f84ebd.jpg", + "table_caption": [ + "Table 9: SET architectures used in our experiments. " + ], + "table_footnote": [], + "table_body": "
Dataset Architecture
CIFAR-10 SC-4000,SReLU,SC-1000,SReLU,SC-4000,SReLU,FC-10,Softmax
HAPTSC-500,SReLU,SC-500,SReLU,SC-500,SReLU,FC-5,Softmax
DiabetesSC-1000,SReLU,SC-1000,SReLU,SC-1000,SReLU,FC-3,Softmax
LandsatSC-1000,SReLU,SC-1000,SReLU,SC-1000,SReLU,FC-6,Softmax
MIT-BIH SC-1000,SReLU,SC-1000,SReLU,SC-1000,SReLU,FC-5,SoftmaX
", + "bbox": [ + 176, + 503, + 821, + 619 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/98386d91bd180b20d5da54f606bd1a619855c8fa97e3bede1fc758b1973e1e15.jpg", + "table_caption": [ + "Table 10: FGR architectures used in our experiments. " + ], + "table_footnote": [], + "table_body": "
DatasetArchitecture
CIFAR-10Group-256,FC-3072,ReLU,FC-10,Softmax
HAPTGroup-104,FC-12173,ReLU,FC-5,Softmax
DiabetesGroup-44,FC-337,ReLU,FC-3,Softmax
LandsatGroup-32,FC-1577,ReLU,FC-6,Softmax
MIT-BIHGroup-160,FC-3444,ReLU,FC-5,Softmax
", + "bbox": [ + 240, + 744, + 756, + 875 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "C SOFTWARE IMPLEMENTATION ", + "text_level": 1, + "bbox": [ + 176, + 102, + 457, + 118 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Table 11 presents the list of software dependencies and versions used in our implementation. To produce results related to this paper, we used a workstation with 4 NVIDIA GeForce RTX-2080Ti GPUs, a 12 core Intel Core i9-7920X processor, and 128 GB memory. Each experiment took between about 30 minutes to 72 hours, based on the task and method being tested. ", + "bbox": [ + 174, + 133, + 825, + 189 + ], + "page_idx": 14 + }, + { + "type": "table", + "img_path": "images/0cf8a598c183371666eb5e48a2082b17b23228c411f430c66938c73e6a9bcaea.jpg", + "table_caption": [ + "Table 11: Software dependencies. " + ], + "table_footnote": [], + "table_body": "
DependencyVersion
python3.7.1
pytorch1.1.0
torchvision0.2.1
cuda1001.0
ipython6.5.0
jupyter1.0.0
numpy1.15.4
nni0.9.1.1
pandas0.23.4
scikit-learn0.19.2
scipy1.1.0
pomegranate0.11.1
tqdm4.32.1
matplotlib3.0.1
", + "bbox": [ + 387, + 228, + 617, + 508 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "D VISUAL ANALYSIS ", + "text_level": 1, + "bbox": [ + 176, + 102, + 366, + 117 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "In Figure 10, we present a visualization of the selected feature for 25 randomly selected groups in our final CIFAR-10 architecture. Red, green, and blue colors indicate which channel is selected for each location. Compared to visualizations that are frequently used for convolutional networks, as GMLP has the flexibility to select pixels at different locations and different color channels, it is not easy to find explicit patterns in this visualization. However, one noticeable pattern is that features selected from a certain color channel usually appear in clusters resembling irregularly shaped patches. ", + "bbox": [ + 174, + 133, + 826, + 218 + ], + "page_idx": 15 + }, + { + "type": "image", + "img_path": "images/f18122c74dd123d377ebf80f5e3ca8a9a8d30d8b9b1e3229f4a82137393c758e.jpg", + "image_caption": [ + "Figure 10: Visualization of pixels selected by each group for the CIFAR-10 GMLP architecture. Red, green, and blue colors indicate which channel is selected for each location. Due to space limitations, 25 random groups out of 1536 total groups visualized here. " + ], + "image_footnote": [], + "bbox": [ + 202, + 239, + 812, + 714 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Figure 11 shows the frequency in which each CIFAR-10 location is selected by the GMLP network. From this visualization, GMLP is mostly ignoring the border areas which can be a result of the data augmentation process used to train the network i.e., randomly cropping the center area and padding the margins. ", + "bbox": [ + 173, + 103, + 826, + 160 + ], + "page_idx": 16 + }, + { + "type": "image", + "img_path": "images/c6de4f1b62f90a17c1b1e28a45ef256082d0acf42fbf91947838a92f007d06e2.jpg", + "image_caption": [ + "Figure 11: Visualization of pixels selected by the group-select layer for the CIFAR-10 GMLP model. Warmer colors represent features that are being selected more frequently. " + ], + "image_footnote": [], + "bbox": [ + 377, + 181, + 619, + 367 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/parse/train/SJg4Y3VFPS/SJg4Y3VFPS_model.json b/parse/train/SJg4Y3VFPS/SJg4Y3VFPS_model.json new file mode 100644 index 0000000000000000000000000000000000000000..ced6f468a4c90d1f27b2de1ed64828f1c08f31d2 --- /dev/null +++ b/parse/train/SJg4Y3VFPS/SJg4Y3VFPS_model.json @@ -0,0 +1,19016 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 534, + 1302, + 534, + 1302, + 1085, + 398, + 1085 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 299, + 1680, + 1403, + 1680, + 1403, + 1957, + 299, + 1957 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1421, + 1405, + 1421, + 1405, + 1666, + 298, + 1666 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 299, + 1221, + 1404, + 1221, + 1404, + 1406, + 299, + 1406 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 299, + 1972, + 1400, + 1972, + 1400, + 2035, + 299, + 2035 + ], + "score": 0.937 + }, + { + "category_id": 0, + "poly": [ + 295, + 218, + 1540, + 218, + 1540, + 270, + 295, + 270 + ], + "score": 0.919 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 858, + 75, + 858, + 105, + 298, + 105 + ], + "score": 0.9 + }, + { + "category_id": 0, + "poly": [ + 302, + 1150, + 573, + 1150, + 573, + 1185, + 302, + 1185 + ], + "score": 0.899 + }, + { + "category_id": 1, + "poly": [ + 313, + 322, + 681, + 322, + 681, + 382, + 313, + 382 + ], + "score": 0.89 + }, + { + "category_id": 0, + "poly": [ + 773, + 463, + 926, + 463, + 926, + 498, + 773, + 498 + ], + "score": 0.874 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 856, + 2089, + 856, + 2112, + 841, + 2112 + ], + "score": 0.723 + }, + { + "category_id": 13, + "poly": [ + 666, + 2004, + 707, + 2004, + 707, + 2036, + 666, + 2036 + ], + "score": 0.64, + "latex": "( i i )" + }, + { + "category_id": 13, + "poly": [ + 861, + 1975, + 893, + 1975, + 893, + 2006, + 861, + 2006 + ], + "score": 0.41, + "latex": "( i )" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 217.0, + 1549.0, + 217.0, + 1549.0, + 284.0, + 293.0, + 284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1147.0, + 579.0, + 1147.0, + 579.0, + 1194.0, + 294.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 463.0, + 932.0, + 463.0, + 932.0, + 501.0, + 769.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2088.0, + 859.0, + 2088.0, + 859.0, + 2118.0, + 840.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 535.0, + 1308.0, + 535.0, + 1308.0, + 573.0, + 393.0, + 573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 566.0, + 1307.0, + 566.0, + 1307.0, + 603.0, + 394.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 599.0, + 1304.0, + 599.0, + 1304.0, + 629.0, + 395.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 627.0, + 1305.0, + 627.0, + 1305.0, + 663.0, + 394.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 659.0, + 1306.0, + 659.0, + 1306.0, + 692.0, + 392.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 689.0, + 1306.0, + 689.0, + 1306.0, + 722.0, + 393.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 720.0, + 1305.0, + 720.0, + 1305.0, + 753.0, + 394.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 750.0, + 1306.0, + 750.0, + 1306.0, + 786.0, + 394.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 777.0, + 1307.0, + 777.0, + 1307.0, + 819.0, + 392.0, + 819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 809.0, + 1306.0, + 809.0, + 1306.0, + 847.0, + 392.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 841.0, + 1306.0, + 841.0, + 1306.0, + 877.0, + 393.0, + 877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 871.0, + 1306.0, + 871.0, + 1306.0, + 907.0, + 393.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 902.0, + 1305.0, + 902.0, + 1305.0, + 937.0, + 393.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 929.0, + 1307.0, + 929.0, + 1307.0, + 968.0, + 392.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 960.0, + 1307.0, + 960.0, + 1307.0, + 999.0, + 392.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 994.0, + 1306.0, + 994.0, + 1306.0, + 1027.0, + 394.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1023.0, + 1306.0, + 1023.0, + 1306.0, + 1058.0, + 394.0, + 1058.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1054.0, + 1240.0, + 1054.0, + 1240.0, + 1088.0, + 394.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1681.0, + 1403.0, + 1681.0, + 1403.0, + 1714.0, + 295.0, + 1714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1710.0, + 1405.0, + 1710.0, + 1405.0, + 1749.0, + 293.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1741.0, + 1407.0, + 1741.0, + 1407.0, + 1779.0, + 292.0, + 1779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1773.0, + 1405.0, + 1773.0, + 1405.0, + 1808.0, + 294.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1803.0, + 1405.0, + 1803.0, + 1405.0, + 1838.0, + 293.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1829.0, + 1407.0, + 1829.0, + 1407.0, + 1874.0, + 292.0, + 1874.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1864.0, + 1405.0, + 1864.0, + 1405.0, + 1901.0, + 294.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1893.0, + 1407.0, + 1893.0, + 1407.0, + 1931.0, + 292.0, + 1931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1926.0, + 1300.0, + 1926.0, + 1300.0, + 1962.0, + 294.0, + 1962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1420.0, + 1406.0, + 1420.0, + 1406.0, + 1457.0, + 293.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1451.0, + 1405.0, + 1451.0, + 1405.0, + 1485.0, + 293.0, + 1485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1481.0, + 1405.0, + 1481.0, + 1405.0, + 1516.0, + 293.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1515.0, + 1408.0, + 1515.0, + 1408.0, + 1548.0, + 296.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1542.0, + 1407.0, + 1542.0, + 1407.0, + 1577.0, + 293.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1572.0, + 1408.0, + 1572.0, + 1408.0, + 1607.0, + 293.0, + 1607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1602.0, + 1409.0, + 1602.0, + 1409.0, + 1639.0, + 293.0, + 1639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1631.0, + 1375.0, + 1631.0, + 1375.0, + 1671.0, + 292.0, + 1671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1219.0, + 1408.0, + 1219.0, + 1408.0, + 1259.0, + 294.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1250.0, + 1405.0, + 1250.0, + 1405.0, + 1289.0, + 294.0, + 1289.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1282.0, + 1408.0, + 1282.0, + 1408.0, + 1320.0, + 293.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1313.0, + 1405.0, + 1313.0, + 1405.0, + 1349.0, + 294.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1344.0, + 1405.0, + 1344.0, + 1405.0, + 1380.0, + 293.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1375.0, + 869.0, + 1375.0, + 869.0, + 1408.0, + 293.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1972.0, + 860.0, + 1972.0, + 860.0, + 2007.0, + 295.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1972.0, + 1405.0, + 1972.0, + 1405.0, + 2007.0, + 894.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2002.0, + 665.0, + 2002.0, + 665.0, + 2038.0, + 295.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 2002.0, + 1405.0, + 2002.0, + 1405.0, + 2038.0, + 708.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 323.0, + 559.0, + 323.0, + 559.0, + 355.0, + 315.0, + 355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 351.0, + 681.0, + 351.0, + 681.0, + 384.0, + 311.0, + 384.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1252, + 1404, + 1252, + 1404, + 1590, + 298, + 1590 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 702, + 1405, + 702, + 1405, + 1009, + 298, + 1009 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 299, + 1024, + 1403, + 1024, + 1403, + 1238, + 299, + 1238 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1604, + 1404, + 1604, + 1404, + 1880, + 298, + 1880 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 338, + 1404, + 338, + 1404, + 522, + 298, + 522 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 301, + 229, + 1401, + 229, + 1401, + 322, + 301, + 322 + ], + "score": 0.965 + }, + { + "category_id": 2, + "poly": [ + 302, + 1976, + 1403, + 1976, + 1403, + 2033, + 302, + 2033 + ], + "score": 0.92 + }, + { + "category_id": 0, + "poly": [ + 301, + 607, + 587, + 607, + 587, + 644, + 301, + 644 + ], + "score": 0.901 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 857, + 75, + 857, + 104, + 298, + 104 + ], + "score": 0.864 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.745 + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1970.0, + 1404.0, + 1970.0, + 1404.0, + 2012.0, + 330.0, + 2012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2002.0, + 385.0, + 2002.0, + 385.0, + 2038.0, + 294.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 605.0, + 593.0, + 605.0, + 593.0, + 649.0, + 292.0, + 649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 858.0, + 72.0, + 858.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2120.0, + 838.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1251.0, + 1406.0, + 1251.0, + 1406.0, + 1290.0, + 292.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1284.0, + 1406.0, + 1284.0, + 1406.0, + 1320.0, + 292.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1313.0, + 1406.0, + 1313.0, + 1406.0, + 1349.0, + 293.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1345.0, + 1404.0, + 1345.0, + 1404.0, + 1380.0, + 294.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1372.0, + 1405.0, + 1372.0, + 1405.0, + 1414.0, + 292.0, + 1414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1406.0, + 1404.0, + 1406.0, + 1404.0, + 1441.0, + 294.0, + 1441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1437.0, + 1406.0, + 1437.0, + 1406.0, + 1472.0, + 294.0, + 1472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1467.0, + 1406.0, + 1467.0, + 1406.0, + 1502.0, + 294.0, + 1502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1494.0, + 1406.0, + 1494.0, + 1406.0, + 1534.0, + 293.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1528.0, + 1405.0, + 1528.0, + 1405.0, + 1563.0, + 294.0, + 1563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1559.0, + 1191.0, + 1559.0, + 1191.0, + 1593.0, + 293.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 703.0, + 1406.0, + 703.0, + 1406.0, + 738.0, + 295.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 731.0, + 1406.0, + 731.0, + 1406.0, + 772.0, + 292.0, + 772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 763.0, + 1406.0, + 763.0, + 1406.0, + 798.0, + 293.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 794.0, + 1405.0, + 794.0, + 1405.0, + 830.0, + 295.0, + 830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 825.0, + 1408.0, + 825.0, + 1408.0, + 861.0, + 293.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 856.0, + 1407.0, + 856.0, + 1407.0, + 891.0, + 296.0, + 891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 885.0, + 1407.0, + 885.0, + 1407.0, + 919.0, + 292.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 918.0, + 1405.0, + 918.0, + 1405.0, + 950.0, + 296.0, + 950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 947.0, + 1405.0, + 947.0, + 1405.0, + 983.0, + 295.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 979.0, + 1147.0, + 979.0, + 1147.0, + 1011.0, + 296.0, + 1011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1024.0, + 1404.0, + 1024.0, + 1404.0, + 1059.0, + 295.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1054.0, + 1404.0, + 1054.0, + 1404.0, + 1088.0, + 294.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1083.0, + 1407.0, + 1083.0, + 1407.0, + 1120.0, + 293.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1114.0, + 1405.0, + 1114.0, + 1405.0, + 1151.0, + 294.0, + 1151.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1146.0, + 1405.0, + 1146.0, + 1405.0, + 1179.0, + 293.0, + 1179.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1179.0, + 1402.0, + 1179.0, + 1402.0, + 1210.0, + 297.0, + 1210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1206.0, + 1393.0, + 1206.0, + 1393.0, + 1243.0, + 293.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1605.0, + 1404.0, + 1605.0, + 1404.0, + 1641.0, + 296.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1634.0, + 1406.0, + 1634.0, + 1406.0, + 1670.0, + 294.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1665.0, + 1407.0, + 1665.0, + 1407.0, + 1704.0, + 292.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1696.0, + 1405.0, + 1696.0, + 1405.0, + 1733.0, + 294.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1725.0, + 1404.0, + 1725.0, + 1404.0, + 1764.0, + 293.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1759.0, + 1402.0, + 1759.0, + 1402.0, + 1792.0, + 296.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1788.0, + 1405.0, + 1788.0, + 1405.0, + 1824.0, + 294.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1818.0, + 1407.0, + 1818.0, + 1407.0, + 1856.0, + 292.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1849.0, + 1352.0, + 1849.0, + 1352.0, + 1886.0, + 294.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 336.0, + 1406.0, + 336.0, + 1406.0, + 373.0, + 295.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 365.0, + 1409.0, + 365.0, + 1409.0, + 403.0, + 293.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 398.0, + 1405.0, + 398.0, + 1405.0, + 433.0, + 293.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 430.0, + 1402.0, + 430.0, + 1402.0, + 462.0, + 296.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 459.0, + 1404.0, + 459.0, + 1404.0, + 495.0, + 294.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 490.0, + 729.0, + 490.0, + 729.0, + 524.0, + 292.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 227.0, + 1406.0, + 227.0, + 1406.0, + 267.0, + 292.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 261.0, + 1404.0, + 261.0, + 1404.0, + 294.0, + 296.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 292.0, + 600.0, + 292.0, + 600.0, + 326.0, + 297.0, + 326.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1061, + 1405, + 1061, + 1405, + 1397, + 297, + 1397 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 299, + 1491, + 1406, + 1491, + 1406, + 1676, + 299, + 1676 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1770, + 1402, + 1770, + 1402, + 1891, + 298, + 1891 + ], + "score": 0.976 + }, + { + "category_id": 3, + "poly": [ + 415, + 222, + 1284, + 222, + 1284, + 824, + 415, + 824 + ], + "score": 0.968 + }, + { + "category_id": 2, + "poly": [ + 297, + 1949, + 1404, + 1949, + 1404, + 2033, + 297, + 2033 + ], + "score": 0.954 + }, + { + "category_id": 8, + "poly": [ + 783, + 1892, + 916, + 1892, + 916, + 1928, + 783, + 1928 + ], + "score": 0.919 + }, + { + "category_id": 0, + "poly": [ + 301, + 933, + 642, + 933, + 642, + 969, + 301, + 969 + ], + "score": 0.918 + }, + { + "category_id": 4, + "poly": [ + 612, + 846, + 1091, + 846, + 1091, + 879, + 612, + 879 + ], + "score": 0.912 + }, + { + "category_id": 0, + "poly": [ + 301, + 1003, + 691, + 1003, + 691, + 1035, + 301, + 1035 + ], + "score": 0.908 + }, + { + "category_id": 0, + "poly": [ + 300, + 1713, + 593, + 1713, + 593, + 1745, + 300, + 1745 + ], + "score": 0.908 + }, + { + "category_id": 0, + "poly": [ + 299, + 1434, + 491, + 1434, + 491, + 1466, + 299, + 1466 + ], + "score": 0.889 + }, + { + "category_id": 9, + "poly": [ + 1367, + 1895, + 1399, + 1895, + 1399, + 1924, + 1367, + 1924 + ], + "score": 0.877 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 858, + 76, + 858, + 104, + 298, + 104 + ], + "score": 0.823 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.684 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.262 + }, + { + "category_id": 2, + "poly": [ + 299, + 77, + 855, + 77, + 855, + 103, + 299, + 103 + ], + "score": 0.215 + }, + { + "category_id": 13, + "poly": [ + 948, + 1612, + 1053, + 1612, + 1053, + 1648, + 948, + 1648 + ], + "score": 0.93, + "latex": "\\pmb { z } _ { i } ^ { l } \\in \\Re ^ { m }" + }, + { + "category_id": 14, + "poly": [ + 781, + 1887, + 916, + 1887, + 916, + 1929, + 781, + 1929 + ], + "score": 0.93, + "latex": "z _ { 1 : k } ^ { 0 } = \\Psi x ," + }, + { + "category_id": 13, + "poly": [ + 758, + 1523, + 926, + 1523, + 926, + 1557, + 758, + 1557 + ], + "score": 0.92, + "latex": "y _ { i } \\in \\{ 1 \\ldots C \\}" + }, + { + "category_id": 13, + "poly": [ + 410, + 1524, + 553, + 1524, + 553, + 1557, + 410, + 1557 + ], + "score": 0.88, + "latex": "\\left( \\pmb { x } _ { 1 : N } , \\pmb { y } _ { 1 : N } \\right)" + }, + { + "category_id": 13, + "poly": [ + 643, + 1523, + 745, + 1523, + 745, + 1554, + 643, + 1554 + ], + "score": 0.87, + "latex": "\\pmb { x } _ { i } \\in \\Re ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 599, + 1834, + 623, + 1834, + 623, + 1860, + 599, + 1860 + ], + "score": 0.82, + "latex": "\\Psi" + }, + { + "category_id": 13, + "poly": [ + 298, + 1616, + 319, + 1616, + 319, + 1642, + 298, + 1642 + ], + "score": 0.82, + "latex": "L" + }, + { + "category_id": 13, + "poly": [ + 988, + 1524, + 1017, + 1524, + 1017, + 1551, + 988, + 1551 + ], + "score": 0.81, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 1219, + 1804, + 1238, + 1804, + 1238, + 1830, + 1219, + 1830 + ], + "score": 0.81, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 441, + 1585, + 459, + 1585, + 459, + 1612, + 441, + 1612 + ], + "score": 0.78, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 689, + 1560, + 716, + 1560, + 716, + 1582, + 689, + 1582 + ], + "score": 0.75, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 369, + 1647, + 382, + 1647, + 382, + 1671, + 369, + 1671 + ], + "score": 0.74, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 298, + 1837, + 326, + 1837, + 326, + 1861, + 298, + 1861 + ], + "score": 0.7, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 367, + 1524, + 393, + 1524, + 393, + 1552, + 367, + 1552 + ], + "score": 0.55, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 593, + 1092, + 636, + 1092, + 636, + 1125, + 593, + 1125 + ], + "score": 0.54, + "latex": "( i i )" + }, + { + "category_id": 13, + "poly": [ + 1263, + 1062, + 1295, + 1062, + 1295, + 1093, + 1263, + 1093 + ], + "score": 0.51, + "latex": "( i )" + }, + { + "category_id": 13, + "poly": [ + 476, + 1646, + 488, + 1646, + 488, + 1672, + 476, + 1672 + ], + "score": 0.48, + "latex": "l" + }, + { + "category_id": 15, + "poly": [ + 728.0, + 246.0, + 736.0, + 246.0, + 736.0, + 254.0, + 728.0, + 254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 232.0, + 1211.0, + 232.0, + 1211.0, + 266.0, + 1127.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 252.0, + 630.0, + 252.0, + 630.0, + 364.0, + 598.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 254.0, + 747.0, + 254.0, + 747.0, + 264.0, + 738.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 632.0, + 268.0, + 659.0, + 268.0, + 659.0, + 343.0, + 632.0, + 343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 695.0, + 262.0, + 718.0, + 262.0, + 718.0, + 351.0, + 695.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 751.0, + 266.0, + 759.0, + 266.0, + 759.0, + 274.0, + 751.0, + 274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 268.0, + 1219.0, + 268.0, + 1219.0, + 305.0, + 1127.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 283.0, + 687.0, + 283.0, + 687.0, + 324.0, + 667.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 308.0, + 1225.0, + 308.0, + 1225.0, + 338.0, + 1127.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 783.0, + 348.0, + 796.0, + 348.0, + 796.0, + 393.0, + 783.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 810.0, + 360.0, + 821.0, + 360.0, + 821.0, + 378.0, + 810.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 737.0, + 363.0, + 778.0, + 363.0, + 778.0, + 391.0, + 737.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 410.0, + 373.0, + 439.0, + 373.0, + 439.0, + 681.0, + 410.0, + 681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 386.0, + 630.0, + 386.0, + 630.0, + 501.0, + 597.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 403.0, + 717.0, + 403.0, + 717.0, + 486.0, + 697.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 406.0, + 661.0, + 406.0, + 661.0, + 480.0, + 635.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1074.0, + 406.0, + 1097.0, + 406.0, + 1097.0, + 494.0, + 1074.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1008.0, + 408.0, + 1035.0, + 408.0, + 1035.0, + 487.0, + 1008.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 408.0, + 1122.0, + 408.0, + 1122.0, + 416.0, + 1114.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 411.0, + 1001.0, + 411.0, + 1001.0, + 446.0, + 983.0, + 446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 668.0, + 422.0, + 689.0, + 422.0, + 689.0, + 465.0, + 668.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 425.0, + 1066.0, + 425.0, + 1066.0, + 473.0, + 1045.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 428.0, + 1142.0, + 428.0, + 1142.0, + 440.0, + 1134.0, + 440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1144.0, + 441.0, + 1153.0, + 441.0, + 1153.0, + 450.0, + 1144.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1243.0, + 464.0, + 1282.0, + 464.0, + 1282.0, + 598.0, + 1243.0, + 598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 751.0, + 468.0, + 759.0, + 468.0, + 759.0, + 476.0, + 751.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 471.0, + 519.0, + 565.0, + 519.0, + 565.0, + 543.0, + 471.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 520.0, + 655.0, + 520.0, + 655.0, + 540.0, + 640.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 851.0, + 524.0, + 870.0, + 524.0, + 870.0, + 534.0, + 851.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1020.0, + 518.0, + 1035.0, + 518.0, + 1035.0, + 540.0, + 1020.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1163.0, + 505.0, + 1183.0, + 505.0, + 1183.0, + 560.0, + 1163.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1192.0, + 518.0, + 1214.0, + 518.0, + 1214.0, + 550.0, + 1192.0, + 550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1222.0, + 500.0, + 1245.0, + 500.0, + 1245.0, + 566.0, + 1222.0, + 566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 569.0, + 624.0, + 569.0, + 624.0, + 618.0, + 600.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 633.0, + 580.0, + 660.0, + 580.0, + 660.0, + 655.0, + 633.0, + 655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 695.0, + 576.0, + 718.0, + 576.0, + 718.0, + 665.0, + 695.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 575.0, + 746.0, + 575.0, + 746.0, + 583.0, + 738.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 748.0, + 586.0, + 757.0, + 586.0, + 757.0, + 593.0, + 748.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 977.0, + 559.0, + 1007.0, + 559.0, + 1007.0, + 640.0, + 977.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 575.0, + 1035.0, + 575.0, + 1035.0, + 650.0, + 1009.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 571.0, + 1095.0, + 571.0, + 1095.0, + 658.0, + 1072.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 598.0, + 688.0, + 598.0, + 688.0, + 637.0, + 667.0, + 637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 592.0, + 1064.0, + 592.0, + 1064.0, + 628.0, + 1046.0, + 628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 628.0, + 1003.0, + 628.0, + 1003.0, + 665.0, + 982.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1124.0, + 638.0, + 1133.0, + 638.0, + 1133.0, + 646.0, + 1124.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 728.0, + 669.0, + 783.0, + 669.0, + 783.0, + 700.0, + 728.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 688.0, + 776.0, + 688.0, + 776.0, + 712.0, + 733.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 689.0, + 818.0, + 689.0, + 818.0, + 702.0, + 811.0, + 702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 706.0, + 625.0, + 706.0, + 625.0, + 810.0, + 599.0, + 810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 718.0, + 716.0, + 718.0, + 716.0, + 801.0, + 696.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 633.0, + 720.0, + 660.0, + 720.0, + 660.0, + 795.0, + 633.0, + 795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 736.0, + 688.0, + 736.0, + 688.0, + 778.0, + 667.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 790.0, + 755.0, + 790.0, + 755.0, + 800.0, + 747.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 735.0, + 800.0, + 744.0, + 800.0, + 744.0, + 809.0, + 735.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 731.25, + 348.5, + 782.25, + 348.5, + 782.25, + 372.5, + 731.25, + 372.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 889.25, + 363.5, + 906.25, + 363.5, + 906.25, + 382.5, + 889.25, + 382.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1124.0, + 417.0, + 1132.0, + 417.0, + 1132.0, + 429.0, + 1124.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 678.0, + 914.0, + 678.0, + 914.0, + 688.0, + 886.0, + 688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1944.0, + 1408.0, + 1944.0, + 1408.0, + 1983.0, + 328.0, + 1983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1975.0, + 1404.0, + 1975.0, + 1404.0, + 2011.0, + 292.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2005.0, + 452.0, + 2005.0, + 452.0, + 2035.0, + 295.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 930.0, + 645.0, + 930.0, + 645.0, + 976.0, + 292.0, + 976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 844.0, + 1094.0, + 844.0, + 1094.0, + 881.0, + 605.0, + 881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1004.0, + 695.0, + 1004.0, + 695.0, + 1037.0, + 296.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1710.0, + 597.0, + 1710.0, + 597.0, + 1749.0, + 294.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1429.0, + 496.0, + 1429.0, + 496.0, + 1472.0, + 293.0, + 1472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 70.0, + 859.0, + 70.0, + 859.0, + 109.0, + 296.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 70.0, + 860.0, + 70.0, + 860.0, + 109.0, + 295.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1058.0, + 1262.0, + 1058.0, + 1262.0, + 1099.0, + 291.0, + 1099.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1296.0, + 1058.0, + 1405.0, + 1058.0, + 1405.0, + 1099.0, + 1296.0, + 1099.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1087.0, + 592.0, + 1087.0, + 592.0, + 1132.0, + 291.0, + 1132.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 637.0, + 1087.0, + 1407.0, + 1087.0, + 1407.0, + 1132.0, + 637.0, + 1132.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1119.0, + 1410.0, + 1119.0, + 1410.0, + 1160.0, + 292.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1150.0, + 1407.0, + 1150.0, + 1407.0, + 1193.0, + 291.0, + 1193.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1182.0, + 1407.0, + 1182.0, + 1407.0, + 1220.0, + 292.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1213.0, + 1407.0, + 1213.0, + 1407.0, + 1249.0, + 291.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1245.0, + 1405.0, + 1245.0, + 1405.0, + 1280.0, + 295.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1270.0, + 1408.0, + 1270.0, + 1408.0, + 1313.0, + 292.0, + 1313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1303.0, + 1408.0, + 1303.0, + 1408.0, + 1342.0, + 294.0, + 1342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1336.0, + 1406.0, + 1336.0, + 1406.0, + 1370.0, + 295.0, + 1370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1364.0, + 1333.0, + 1364.0, + 1333.0, + 1401.0, + 294.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1491.0, + 1406.0, + 1491.0, + 1406.0, + 1526.0, + 296.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1520.0, + 366.0, + 1520.0, + 366.0, + 1559.0, + 293.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1520.0, + 409.0, + 1520.0, + 409.0, + 1559.0, + 394.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 554.0, + 1520.0, + 642.0, + 1520.0, + 642.0, + 1559.0, + 554.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1520.0, + 757.0, + 1520.0, + 757.0, + 1559.0, + 746.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 1520.0, + 987.0, + 1520.0, + 987.0, + 1559.0, + 927.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1018.0, + 1520.0, + 1409.0, + 1520.0, + 1409.0, + 1559.0, + 1018.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1553.0, + 688.0, + 1553.0, + 688.0, + 1589.0, + 294.0, + 1589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1553.0, + 1406.0, + 1553.0, + 1406.0, + 1589.0, + 717.0, + 1589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1582.0, + 440.0, + 1582.0, + 440.0, + 1619.0, + 292.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 1582.0, + 1409.0, + 1582.0, + 1409.0, + 1619.0, + 460.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1614.0, + 297.0, + 1614.0, + 297.0, + 1650.0, + 294.0, + 1650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1614.0, + 947.0, + 1614.0, + 947.0, + 1650.0, + 320.0, + 1650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 1614.0, + 1407.0, + 1614.0, + 1407.0, + 1650.0, + 1054.0, + 1650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1643.0, + 368.0, + 1643.0, + 368.0, + 1680.0, + 292.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 1643.0, + 475.0, + 1643.0, + 475.0, + 1680.0, + 383.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 489.0, + 1643.0, + 1100.0, + 1643.0, + 1100.0, + 1680.0, + 489.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1768.0, + 1406.0, + 1768.0, + 1406.0, + 1806.0, + 292.0, + 1806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1801.0, + 1218.0, + 1801.0, + 1218.0, + 1837.0, + 292.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1239.0, + 1801.0, + 1406.0, + 1801.0, + 1406.0, + 1837.0, + 1239.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1830.0, + 297.0, + 1830.0, + 297.0, + 1869.0, + 292.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1830.0, + 598.0, + 1830.0, + 598.0, + 1869.0, + 327.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 624.0, + 1830.0, + 1406.0, + 1830.0, + 1406.0, + 1869.0, + 624.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1861.0, + 578.0, + 1861.0, + 578.0, + 1894.0, + 295.0, + 1894.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 424, + 1405, + 424, + 1405, + 609, + 297, + 609 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1046, + 1405, + 1046, + 1405, + 1244, + 297, + 1244 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1256, + 1404, + 1256, + 1404, + 1412, + 297, + 1412 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 623, + 1405, + 623, + 1405, + 748, + 298, + 748 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 1653, + 1405, + 1653, + 1405, + 1777, + 297, + 1777 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1910, + 1404, + 1910, + 1404, + 2036, + 298, + 2036 + ], + "score": 0.976 + }, + { + "category_id": 8, + "poly": [ + 484, + 1798, + 1211, + 1798, + 1211, + 1894, + 484, + 1894 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 687, + 318, + 1012, + 318, + 1012, + 402, + 687, + 402 + ], + "score": 0.959 + }, + { + "category_id": 1, + "poly": [ + 299, + 227, + 1403, + 227, + 1403, + 319, + 299, + 319 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 299, + 825, + 1408, + 825, + 1408, + 889, + 299, + 889 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 297, + 902, + 1402, + 902, + 1402, + 967, + 297, + 967 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 691, + 982, + 1008, + 982, + 1008, + 1029, + 691, + 1029 + ], + "score": 0.949 + }, + { + "category_id": 8, + "poly": [ + 509, + 1569, + 1189, + 1569, + 1189, + 1643, + 509, + 1643 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 718, + 763, + 980, + 763, + 980, + 809, + 718, + 809 + ], + "score": 0.947 + }, + { + "category_id": 1, + "poly": [ + 299, + 1507, + 1403, + 1507, + 1403, + 1567, + 299, + 1567 + ], + "score": 0.945 + }, + { + "category_id": 2, + "poly": [ + 297, + 74, + 858, + 74, + 858, + 106, + 297, + 106 + ], + "score": 0.922 + }, + { + "category_id": 0, + "poly": [ + 298, + 1449, + 490, + 1449, + 490, + 1481, + 298, + 1481 + ], + "score": 0.901 + }, + { + "category_id": 9, + "poly": [ + 1366, + 991, + 1400, + 991, + 1400, + 1020, + 1366, + 1020 + ], + "score": 0.893 + }, + { + "category_id": 9, + "poly": [ + 1366, + 772, + 1400, + 772, + 1400, + 802, + 1366, + 802 + ], + "score": 0.885 + }, + { + "category_id": 9, + "poly": [ + 1366, + 337, + 1400, + 337, + 1400, + 367, + 1366, + 367 + ], + "score": 0.885 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1829, + 1400, + 1829, + 1400, + 1858, + 1366, + 1858 + ], + "score": 0.882 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1582, + 1400, + 1582, + 1400, + 1612, + 1366, + 1612 + ], + "score": 0.877 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 857, + 2088, + 857, + 2111, + 840, + 2111 + ], + "score": 0.795 + }, + { + "category_id": 14, + "poly": [ + 684, + 313, + 1015, + 313, + 1015, + 402, + 684, + 402 + ], + "score": 0.95, + "latex": "\\Psi _ { i , j } \\approx \\frac { \\exp ( \\psi _ { i , j } / \\tau ) } { \\sum _ { j ^ { \\prime } = 1 } ^ { j ^ { \\prime } = d } \\exp ( \\psi _ { i , j ^ { \\prime } } / \\tau ) } ." + }, + { + "category_id": 14, + "poly": [ + 484, + 1793, + 1216, + 1793, + 1216, + 1895, + 484, + 1895 + ], + "score": 0.94, + "latex": "H ( \\psi ) = - \\frac { 1 } { d } \\sum _ { j = 1 } ^ { j = d } \\sum _ { i = 1 } ^ { i = k m } \\frac { \\exp ( \\psi _ { i , j } ) } { \\sum _ { j ^ { \\prime } = 1 } ^ { j ^ { \\prime } = d } \\exp ( \\psi _ { i , j ^ { \\prime } } ) } \\mathrm { l o g } ( \\frac { \\exp ( \\psi _ { i , j } ) } { \\sum _ { j ^ { \\prime } = 1 } ^ { j ^ { \\prime } = d } \\exp ( \\psi _ { i , j ^ { \\prime } } ) } ) ." + }, + { + "category_id": 14, + "poly": [ + 688, + 981, + 1008, + 981, + 1008, + 1030, + 688, + 1030 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { z _ { i } ^ { l + 1 } = p o o l ( z _ { i } ^ { l } , z _ { i + k / 2 ^ { l + 1 } } ^ { l } ) , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 452, + 1047, + 532, + 1047, + 532, + 1090, + 452, + 1090 + ], + "score": 0.93, + "latex": "z _ { i + k / 2 } ^ { l }" + }, + { + "category_id": 13, + "poly": [ + 373, + 228, + 563, + 228, + 563, + 264, + 373, + 264 + ], + "score": 0.93, + "latex": "\\Psi \\in \\{ 0 , 1 \\} ^ { k m \\times d }" + }, + { + "category_id": 13, + "poly": [ + 573, + 824, + 673, + 824, + 673, + 860, + 573, + 860 + ], + "score": 0.93, + "latex": "\\pmb { b } _ { i } ^ { l } \\in \\Re ^ { m }" + }, + { + "category_id": 14, + "poly": [ + 718, + 764, + 980, + 764, + 980, + 807, + 718, + 807 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\pmb { z } _ { i } ^ { l + 1 } = f ( W _ { i } ^ { l } \\pmb { z } _ { i } ^ { l } + \\pmb { b } _ { i } ^ { l } ) , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 371, + 824, + 522, + 824, + 522, + 860, + 371, + 860 + ], + "score": 0.92, + "latex": "W _ { i } ^ { l } \\in \\Re ^ { m \\times m }" + }, + { + "category_id": 14, + "poly": [ + 509, + 1561, + 1190, + 1561, + 1190, + 1645, + 509, + 1645 + ], + "score": 0.92, + "latex": "L = - \\frac { 1 } { N } \\sum _ { i } \\sum _ { c } y _ { i , c } \\log ( F _ { \\theta } ( \\pmb { x } _ { i } ) ) + \\lambda H ( \\psi ) + \\alpha \\sum _ { \\omega \\in \\theta } | | \\omega | | _ { 2 } ^ { 2 } ." + }, + { + "category_id": 13, + "poly": [ + 551, + 1087, + 605, + 1087, + 605, + 1116, + 551, + 1116 + ], + "score": 0.9, + "latex": "\\Re ^ { 2 m }" + }, + { + "category_id": 13, + "poly": [ + 1318, + 1118, + 1371, + 1118, + 1371, + 1148, + 1318, + 1148 + ], + "score": 0.9, + "latex": "\\Re ^ { 2 m }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1913, + 366, + 1913, + 366, + 1945, + 298, + 1945 + ], + "score": 0.9, + "latex": "H ( \\psi )" + }, + { + "category_id": 13, + "poly": [ + 372, + 1047, + 401, + 1047, + 401, + 1084, + 372, + 1084 + ], + "score": 0.89, + "latex": "z _ { i } ^ { l }" + }, + { + "category_id": 13, + "poly": [ + 639, + 1088, + 681, + 1088, + 681, + 1116, + 639, + 1116 + ], + "score": 0.87, + "latex": "\\Re ^ { m }" + }, + { + "category_id": 13, + "poly": [ + 1054, + 1915, + 1075, + 1915, + 1075, + 1944, + 1054, + 1944 + ], + "score": 0.86, + "latex": "\\psi" + }, + { + "category_id": 13, + "poly": [ + 655, + 1978, + 677, + 1978, + 677, + 2000, + 655, + 2000 + ], + "score": 0.86, + "latex": "\\Psi" + }, + { + "category_id": 13, + "poly": [ + 490, + 428, + 512, + 428, + 512, + 458, + 490, + 458 + ], + "score": 0.86, + "latex": "\\psi" + }, + { + "category_id": 13, + "poly": [ + 1368, + 1657, + 1400, + 1657, + 1400, + 1685, + 1368, + 1685 + ], + "score": 0.85, + "latex": "F _ { \\theta }" + }, + { + "category_id": 13, + "poly": [ + 396, + 1945, + 420, + 1945, + 420, + 1969, + 396, + 1969 + ], + "score": 0.84, + "latex": "\\Psi" + }, + { + "category_id": 13, + "poly": [ + 1302, + 488, + 1324, + 488, + 1324, + 519, + 1302, + 519 + ], + "score": 0.84, + "latex": "\\psi" + }, + { + "category_id": 13, + "poly": [ + 365, + 859, + 385, + 859, + 385, + 888, + 365, + 888 + ], + "score": 0.84, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 1003, + 1686, + 1032, + 1686, + 1032, + 1712, + 1003, + 1712 + ], + "score": 0.84, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 1258, + 2004, + 1280, + 2004, + 1280, + 2035, + 1258, + 2035 + ], + "score": 0.83, + "latex": "\\psi" + }, + { + "category_id": 13, + "poly": [ + 755, + 1946, + 773, + 1946, + 773, + 1969, + 755, + 1969 + ], + "score": 0.82, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1103, + 1350, + 1122, + 1350, + 1122, + 1376, + 1103, + 1376 + ], + "score": 0.82, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 706, + 263, + 730, + 263, + 730, + 290, + 706, + 290 + ], + "score": 0.82, + "latex": "\\Psi" + }, + { + "category_id": 13, + "poly": [ + 527, + 1259, + 546, + 1259, + 546, + 1285, + 527, + 1285 + ], + "score": 0.82, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 591, + 1290, + 610, + 1290, + 610, + 1316, + 591, + 1316 + ], + "score": 0.81, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 1124, + 1323, + 1152, + 1323, + 1152, + 1347, + 1124, + 1347 + ], + "score": 0.8, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 1205, + 1320, + 1224, + 1320, + 1224, + 1346, + 1205, + 1346 + ], + "score": 0.8, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 554, + 1747, + 572, + 1747, + 572, + 1773, + 554, + 1773 + ], + "score": 0.8, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 297, + 579, + 321, + 579, + 321, + 605, + 297, + 605 + ], + "score": 0.8, + "latex": "\\Psi" + }, + { + "category_id": 13, + "poly": [ + 298, + 1150, + 340, + 1150, + 340, + 1178, + 298, + 1178 + ], + "score": 0.8, + "latex": "\\Re ^ { m }" + }, + { + "category_id": 13, + "poly": [ + 1026, + 1354, + 1053, + 1354, + 1053, + 1376, + 1026, + 1376 + ], + "score": 0.77, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 930, + 1686, + 947, + 1686, + 947, + 1712, + 930, + 1712 + ], + "score": 0.77, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 523, + 2008, + 544, + 2008, + 544, + 2030, + 523, + 2030 + ], + "score": 0.77, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 512, + 1294, + 540, + 1294, + 540, + 1317, + 512, + 1317 + ], + "score": 0.77, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 451, + 1263, + 478, + 1263, + 478, + 1285, + 451, + 1285 + ], + "score": 0.75, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 621, + 462, + 639, + 462, + 639, + 483, + 621, + 483 + ], + "score": 0.71, + "latex": "\\tau" + }, + { + "category_id": 13, + "poly": [ + 1283, + 830, + 1296, + 830, + 1296, + 854, + 1283, + 854 + ], + "score": 0.7, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1387, + 829, + 1398, + 829, + 1398, + 854, + 1387, + 854 + ], + "score": 0.63, + "latex": "l" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 858.0, + 72.0, + 858.0, + 109.0, + 297.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1449.0, + 492.0, + 1449.0, + 492.0, + 1485.0, + 295.0, + 1485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2086.0, + 861.0, + 2086.0, + 861.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 426.0, + 489.0, + 426.0, + 489.0, + 458.0, + 295.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 513.0, + 426.0, + 1405.0, + 426.0, + 1405.0, + 458.0, + 513.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 455.0, + 620.0, + 455.0, + 620.0, + 490.0, + 294.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 455.0, + 1406.0, + 455.0, + 1406.0, + 490.0, + 640.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 485.0, + 1301.0, + 485.0, + 1301.0, + 522.0, + 294.0, + 522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1325.0, + 485.0, + 1405.0, + 485.0, + 1405.0, + 522.0, + 1325.0, + 522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 516.0, + 1406.0, + 516.0, + 1406.0, + 552.0, + 296.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 547.0, + 1406.0, + 547.0, + 1406.0, + 583.0, + 294.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 579.0, + 499.0, + 579.0, + 499.0, + 612.0, + 322.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1040.0, + 371.0, + 1040.0, + 371.0, + 1097.0, + 289.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 1040.0, + 451.0, + 1040.0, + 451.0, + 1097.0, + 402.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 533.0, + 1040.0, + 1411.0, + 1040.0, + 1411.0, + 1097.0, + 533.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1084.0, + 550.0, + 1084.0, + 550.0, + 1125.0, + 292.0, + 1125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 1084.0, + 638.0, + 1084.0, + 638.0, + 1125.0, + 606.0, + 1125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 1084.0, + 1406.0, + 1084.0, + 1406.0, + 1125.0, + 682.0, + 1125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1116.0, + 1317.0, + 1116.0, + 1317.0, + 1154.0, + 292.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1372.0, + 1116.0, + 1407.0, + 1116.0, + 1407.0, + 1154.0, + 1372.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1145.0, + 297.0, + 1145.0, + 297.0, + 1186.0, + 294.0, + 1186.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 341.0, + 1145.0, + 1405.0, + 1145.0, + 1405.0, + 1186.0, + 341.0, + 1186.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1177.0, + 1410.0, + 1177.0, + 1410.0, + 1220.0, + 292.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1210.0, + 645.0, + 1210.0, + 645.0, + 1243.0, + 296.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1255.0, + 450.0, + 1255.0, + 450.0, + 1290.0, + 295.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 479.0, + 1255.0, + 526.0, + 1255.0, + 526.0, + 1290.0, + 479.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 547.0, + 1255.0, + 1404.0, + 1255.0, + 1404.0, + 1290.0, + 547.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1287.0, + 511.0, + 1287.0, + 511.0, + 1325.0, + 295.0, + 1325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1287.0, + 590.0, + 1287.0, + 590.0, + 1325.0, + 541.0, + 1325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 611.0, + 1287.0, + 1404.0, + 1287.0, + 1404.0, + 1325.0, + 611.0, + 1325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1319.0, + 1123.0, + 1319.0, + 1123.0, + 1353.0, + 295.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1153.0, + 1319.0, + 1204.0, + 1319.0, + 1204.0, + 1353.0, + 1153.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 1319.0, + 1406.0, + 1319.0, + 1406.0, + 1353.0, + 1225.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1346.0, + 1025.0, + 1346.0, + 1025.0, + 1385.0, + 292.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 1346.0, + 1102.0, + 1346.0, + 1102.0, + 1385.0, + 1054.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1123.0, + 1346.0, + 1406.0, + 1346.0, + 1406.0, + 1385.0, + 1123.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1379.0, + 686.0, + 1379.0, + 686.0, + 1413.0, + 295.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 622.0, + 1410.0, + 622.0, + 1410.0, + 661.0, + 292.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 655.0, + 1403.0, + 655.0, + 1403.0, + 690.0, + 295.0, + 690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 687.0, + 1403.0, + 687.0, + 1403.0, + 719.0, + 295.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 716.0, + 1242.0, + 716.0, + 1242.0, + 751.0, + 293.0, + 751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1654.0, + 1367.0, + 1654.0, + 1367.0, + 1687.0, + 295.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1683.0, + 929.0, + 1683.0, + 929.0, + 1717.0, + 294.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 948.0, + 1683.0, + 1002.0, + 1683.0, + 1002.0, + 1717.0, + 948.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 1683.0, + 1405.0, + 1683.0, + 1405.0, + 1717.0, + 1033.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1716.0, + 1405.0, + 1716.0, + 1405.0, + 1749.0, + 295.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1747.0, + 553.0, + 1747.0, + 553.0, + 1780.0, + 295.0, + 1780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 573.0, + 1747.0, + 584.0, + 1747.0, + 584.0, + 1780.0, + 573.0, + 1780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 1911.0, + 1053.0, + 1911.0, + 1053.0, + 1947.0, + 367.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.0, + 1911.0, + 1405.0, + 1911.0, + 1405.0, + 1947.0, + 1076.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1941.0, + 395.0, + 1941.0, + 395.0, + 1977.0, + 294.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 421.0, + 1941.0, + 754.0, + 1941.0, + 754.0, + 1977.0, + 421.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 774.0, + 1941.0, + 1406.0, + 1941.0, + 1406.0, + 1977.0, + 774.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1973.0, + 654.0, + 1973.0, + 654.0, + 2006.0, + 293.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 1973.0, + 1404.0, + 1973.0, + 1404.0, + 2006.0, + 678.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2004.0, + 522.0, + 2004.0, + 522.0, + 2037.0, + 294.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 2004.0, + 1257.0, + 2004.0, + 1257.0, + 2037.0, + 545.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1281.0, + 2004.0, + 1406.0, + 2004.0, + 1406.0, + 2037.0, + 1281.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 224.0, + 372.0, + 224.0, + 372.0, + 267.0, + 292.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 564.0, + 224.0, + 1405.0, + 224.0, + 1405.0, + 267.0, + 564.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 262.0, + 705.0, + 262.0, + 705.0, + 296.0, + 294.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 731.0, + 262.0, + 1405.0, + 262.0, + 1405.0, + 296.0, + 731.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 291.0, + 425.0, + 291.0, + 425.0, + 326.0, + 293.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 817.0, + 370.0, + 817.0, + 370.0, + 865.0, + 292.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 523.0, + 817.0, + 572.0, + 817.0, + 572.0, + 865.0, + 523.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 674.0, + 817.0, + 1282.0, + 817.0, + 1282.0, + 865.0, + 674.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1297.0, + 817.0, + 1386.0, + 817.0, + 1386.0, + 865.0, + 1297.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 817.0, + 1413.0, + 817.0, + 1413.0, + 865.0, + 1399.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 853.0, + 364.0, + 853.0, + 364.0, + 892.0, + 294.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 386.0, + 853.0, + 1381.0, + 853.0, + 1381.0, + 892.0, + 386.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 901.0, + 1406.0, + 901.0, + 1406.0, + 940.0, + 293.0, + 940.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 935.0, + 1308.0, + 935.0, + 1308.0, + 968.0, + 293.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1499.0, + 1405.0, + 1499.0, + 1405.0, + 1548.0, + 292.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1541.0, + 416.0, + 1541.0, + 416.0, + 1573.0, + 294.0, + 1573.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1637, + 1405, + 1637, + 1405, + 2034, + 298, + 2034 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 829, + 1403, + 829, + 1403, + 1014, + 298, + 1014 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 307, + 1404, + 307, + 1404, + 492, + 298, + 492 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1274, + 1403, + 1274, + 1403, + 1462, + 298, + 1462 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1107, + 1404, + 1107, + 1404, + 1263, + 298, + 1263 + ], + "score": 0.977 + }, + { + "category_id": 8, + "poly": [ + 518, + 1024, + 1179, + 1024, + 1179, + 1096, + 518, + 1096 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 295, + 506, + 1401, + 506, + 1401, + 570, + 295, + 570 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 293, + 229, + 1403, + 229, + 1403, + 293, + 293, + 293 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 297, + 665, + 1403, + 665, + 1403, + 729, + 297, + 729 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 549, + 744, + 1148, + 744, + 1148, + 817, + 549, + 817 + ], + "score": 0.948 + }, + { + "category_id": 0, + "poly": [ + 300, + 1578, + 640, + 1578, + 640, + 1610, + 300, + 1610 + ], + "score": 0.906 + }, + { + "category_id": 0, + "poly": [ + 300, + 1508, + 557, + 1508, + 557, + 1543, + 300, + 1543 + ], + "score": 0.899 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 858, + 75, + 858, + 104, + 298, + 104 + ], + "score": 0.891 + }, + { + "category_id": 9, + "poly": [ + 1366, + 769, + 1399, + 769, + 1399, + 800, + 1366, + 800 + ], + "score": 0.887 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1048, + 1399, + 1048, + 1399, + 1078, + 1366, + 1078 + ], + "score": 0.884 + }, + { + "category_id": 0, + "poly": [ + 299, + 608, + 489, + 608, + 489, + 640, + 299, + 640 + ], + "score": 0.877 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.727 + }, + { + "category_id": 0, + "poly": [ + 299, + 608, + 489, + 608, + 489, + 640, + 299, + 640 + ], + "score": 0.123 + }, + { + "category_id": 14, + "poly": [ + 519, + 1024, + 1179, + 1024, + 1179, + 1095, + 519, + 1095 + ], + "score": 0.93, + "latex": "k m d + k ^ { 2 } m ^ { 2 } + \\frac { k ^ { 2 } m ^ { 2 } } { 2 } + \\frac { k ^ { 2 } m ^ { 2 } } { 4 } + . . . + \\frac { k ^ { 2 } m ^ { 2 } } { 2 ^ { L - 1 } } + C \\frac { k m } { 2 ^ { L - 1 } } ," + }, + { + "category_id": 13, + "poly": [ + 1204, + 1271, + 1320, + 1271, + 1320, + 1315, + 1204, + 1315 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\frac { k m ^ { 2 } } { k ^ { 2 } m ^ { 2 } } = \\frac { 1 } { k } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 553, + 950, + 739, + 950, + 739, + 987, + 553, + 987 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\mathcal { O } ( k m ^ { 2 } + \\frac { C k m } { 2 L - 1 } ) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 549, + 744, + 1152, + 744, + 1152, + 817, + 549, + 817 + ], + "score": 0.91, + "latex": "k m + k m ^ { 2 } + \\frac { k m ^ { 2 } } { 2 } + \\frac { k m ^ { 2 } } { 4 } + . . . + \\frac { k m ^ { 2 } } { 2 ^ { L - 1 } } + C \\frac { k m } { 2 ^ { L - 1 } } ." + }, + { + "category_id": 13, + "poly": [ + 813, + 1367, + 891, + 1367, + 891, + 1398, + 813, + 1398 + ], + "score": 0.91, + "latex": "2 ^ { { \\hat { l } } - 1 } m" + }, + { + "category_id": 13, + "poly": [ + 299, + 1199, + 582, + 1199, + 582, + 1237, + 299, + 1237 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\mathcal { O } ( k m d + { k ^ { 2 } } { m ^ { 2 } } + \\frac { C k m } { 2 { L - 1 } } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 513, + 1913, + 584, + 1913, + 584, + 1943, + 513, + 1943 + ], + "score": 0.91, + "latex": "\\mu = 0" + }, + { + "category_id": 13, + "poly": [ + 634, + 1913, + 705, + 1913, + 705, + 1940, + 634, + 1940 + ], + "score": 0.9, + "latex": "\\sigma = 1" + }, + { + "category_id": 13, + "poly": [ + 1120, + 431, + 1143, + 431, + 1143, + 462, + 1120, + 462 + ], + "score": 0.85, + "latex": "\\psi" + }, + { + "category_id": 13, + "poly": [ + 705, + 232, + 728, + 232, + 728, + 262, + 705, + 262 + ], + "score": 0.84, + "latex": "\\psi" + }, + { + "category_id": 13, + "poly": [ + 361, + 263, + 384, + 263, + 384, + 294, + 361, + 294 + ], + "score": 0.84, + "latex": "\\psi" + }, + { + "category_id": 13, + "poly": [ + 327, + 1432, + 369, + 1432, + 369, + 1458, + 327, + 1458 + ], + "score": 0.83, + "latex": "2 m" + }, + { + "category_id": 13, + "poly": [ + 819, + 1311, + 838, + 1311, + 838, + 1337, + 819, + 1337 + ], + "score": 0.83, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 1086, + 1111, + 1105, + 1111, + 1105, + 1137, + 1086, + 1137 + ], + "score": 0.8, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 298, + 1234, + 322, + 1234, + 322, + 1259, + 298, + 1259 + ], + "score": 0.79, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 587, + 462, + 605, + 462, + 605, + 488, + 587, + 488 + ], + "score": 0.78, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 835, + 1141, + 877, + 1141, + 877, + 1169, + 835, + 1169 + ], + "score": 0.77, + "latex": "k m" + }, + { + "category_id": 13, + "poly": [ + 605, + 831, + 646, + 831, + 646, + 859, + 605, + 859 + ], + "score": 0.77, + "latex": "k m" + }, + { + "category_id": 13, + "poly": [ + 617, + 1405, + 645, + 1405, + 645, + 1428, + 617, + 1428 + ], + "score": 0.73, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 605, + 1371, + 618, + 1371, + 618, + 1397, + 605, + 1397 + ], + "score": 0.58, + "latex": "l" + }, + { + "category_id": 13, + "poly": [ + 1135, + 1110, + 1178, + 1110, + 1178, + 1138, + 1135, + 1138 + ], + "score": 0.56, + "latex": "k m" + }, + { + "category_id": 13, + "poly": [ + 1301, + 1202, + 1348, + 1202, + 1348, + 1230, + 1301, + 1230 + ], + "score": 0.47, + "latex": "k , d ." + }, + { + "category_id": 13, + "poly": [ + 770, + 461, + 812, + 461, + 812, + 489, + 770, + 489 + ], + "score": 0.37, + "latex": "k m" + }, + { + "category_id": 13, + "poly": [ + 1330, + 1203, + 1347, + 1203, + 1347, + 1229, + 1330, + 1229 + ], + "score": 0.35, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 1300, + 1203, + 1318, + 1203, + 1318, + 1229, + 1300, + 1229 + ], + "score": 0.33, + "latex": "k" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1576.0, + 643.0, + 1576.0, + 643.0, + 1613.0, + 294.0, + 1613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1505.0, + 561.0, + 1505.0, + 561.0, + 1549.0, + 293.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 858.0, + 72.0, + 858.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 603.0, + 493.0, + 603.0, + 493.0, + 646.0, + 293.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 861.0, + 2085.0, + 861.0, + 2120.0, + 839.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 603.0, + 493.0, + 603.0, + 493.0, + 646.0, + 293.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1636.0, + 1406.0, + 1636.0, + 1406.0, + 1672.0, + 295.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1666.0, + 1406.0, + 1666.0, + 1406.0, + 1705.0, + 292.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1700.0, + 1406.0, + 1700.0, + 1406.0, + 1732.0, + 296.0, + 1732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1724.0, + 1407.0, + 1724.0, + 1407.0, + 1764.0, + 293.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1759.0, + 1406.0, + 1759.0, + 1406.0, + 1795.0, + 293.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1788.0, + 1408.0, + 1788.0, + 1408.0, + 1826.0, + 292.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1819.0, + 1406.0, + 1819.0, + 1406.0, + 1855.0, + 295.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1850.0, + 1406.0, + 1850.0, + 1406.0, + 1886.0, + 292.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1881.0, + 1405.0, + 1881.0, + 1405.0, + 1916.0, + 293.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1912.0, + 512.0, + 1912.0, + 512.0, + 1944.0, + 296.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 585.0, + 1912.0, + 633.0, + 1912.0, + 633.0, + 1944.0, + 585.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 706.0, + 1912.0, + 1402.0, + 1912.0, + 1402.0, + 1944.0, + 706.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1940.0, + 1407.0, + 1940.0, + 1407.0, + 1978.0, + 292.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1971.0, + 1407.0, + 1971.0, + 1407.0, + 2006.0, + 293.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2001.0, + 1407.0, + 2001.0, + 1407.0, + 2037.0, + 296.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 830.0, + 604.0, + 830.0, + 604.0, + 866.0, + 294.0, + 866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 647.0, + 830.0, + 1404.0, + 830.0, + 1404.0, + 866.0, + 647.0, + 866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 860.0, + 1405.0, + 860.0, + 1405.0, + 896.0, + 294.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 892.0, + 1404.0, + 892.0, + 1404.0, + 924.0, + 296.0, + 924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 919.0, + 1405.0, + 919.0, + 1405.0, + 956.0, + 293.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 935.0, + 552.0, + 935.0, + 552.0, + 1014.0, + 284.0, + 1014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 935.0, + 1415.0, + 935.0, + 1415.0, + 1014.0, + 740.0, + 1014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 303.0, + 1408.0, + 303.0, + 1408.0, + 347.0, + 292.0, + 347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 333.0, + 1409.0, + 333.0, + 1409.0, + 378.0, + 291.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 370.0, + 1405.0, + 370.0, + 1405.0, + 402.0, + 294.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 397.0, + 1406.0, + 397.0, + 1406.0, + 434.0, + 293.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 427.0, + 1119.0, + 427.0, + 1119.0, + 466.0, + 292.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1144.0, + 427.0, + 1405.0, + 427.0, + 1405.0, + 466.0, + 1144.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 461.0, + 586.0, + 461.0, + 586.0, + 496.0, + 294.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 461.0, + 769.0, + 461.0, + 769.0, + 496.0, + 606.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 813.0, + 461.0, + 825.0, + 461.0, + 825.0, + 496.0, + 813.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1275.0, + 1203.0, + 1275.0, + 1203.0, + 1314.0, + 293.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1321.0, + 1277.0, + 1407.0, + 1277.0, + 1407.0, + 1319.0, + 1321.0, + 1319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1306.0, + 818.0, + 1306.0, + 818.0, + 1349.0, + 291.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 1306.0, + 1407.0, + 1306.0, + 1407.0, + 1349.0, + 839.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1338.0, + 1407.0, + 1338.0, + 1407.0, + 1376.0, + 293.0, + 1376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1368.0, + 604.0, + 1368.0, + 604.0, + 1404.0, + 294.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 619.0, + 1368.0, + 812.0, + 1368.0, + 812.0, + 1404.0, + 619.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 1368.0, + 1405.0, + 1368.0, + 1405.0, + 1404.0, + 892.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1398.0, + 616.0, + 1398.0, + 616.0, + 1437.0, + 293.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 1398.0, + 1405.0, + 1398.0, + 1405.0, + 1437.0, + 646.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1431.0, + 326.0, + 1431.0, + 326.0, + 1463.0, + 296.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 1431.0, + 612.0, + 1431.0, + 612.0, + 1463.0, + 370.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1203.0, + 1267.5, + 1266.0, + 1267.5, + 1266.0, + 1300.0, + 1203.0, + 1300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1200.0, + 1285.0, + 1298.0, + 1285.0, + 1298.0, + 1320.0, + 1200.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1109.0, + 1085.0, + 1109.0, + 1085.0, + 1142.0, + 296.0, + 1142.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 1109.0, + 1134.0, + 1109.0, + 1134.0, + 1142.0, + 1106.0, + 1142.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1179.0, + 1109.0, + 1405.0, + 1109.0, + 1405.0, + 1142.0, + 1179.0, + 1142.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1138.0, + 834.0, + 1138.0, + 834.0, + 1176.0, + 293.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 878.0, + 1138.0, + 1406.0, + 1138.0, + 1406.0, + 1176.0, + 878.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1170.0, + 298.0, + 1170.0, + 298.0, + 1253.0, + 294.0, + 1253.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 1170.0, + 1299.0, + 1170.0, + 1299.0, + 1253.0, + 583.0, + 1253.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1349.0, + 1170.0, + 1416.0, + 1170.0, + 1416.0, + 1253.0, + 1349.0, + 1253.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1226.0, + 297.0, + 1226.0, + 297.0, + 1267.0, + 294.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1226.0, + 412.0, + 1226.0, + 412.0, + 1267.0, + 323.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 503.0, + 1405.0, + 503.0, + 1405.0, + 543.0, + 294.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 535.0, + 1188.0, + 535.0, + 1188.0, + 574.0, + 294.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 224.0, + 704.0, + 224.0, + 704.0, + 270.0, + 292.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 729.0, + 224.0, + 1408.0, + 224.0, + 1408.0, + 270.0, + 729.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 261.0, + 360.0, + 261.0, + 360.0, + 297.0, + 296.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 261.0, + 1106.0, + 261.0, + 1106.0, + 297.0, + 385.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 660.0, + 1408.0, + 660.0, + 1408.0, + 705.0, + 292.0, + 705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 698.0, + 673.0, + 698.0, + 673.0, + 734.0, + 296.0, + 734.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 301, + 281, + 1399, + 281, + 1399, + 564, + 301, + 564 + ], + "score": 0.983, + "html": "
Dataset# Train Samples# Test Samples#Features# ClassesDomain
CIFAR-10a (Krizhevsky et al.,2009)50,00010.000307210Image Classification
HAPT (Anguita et al., 2013)6,0022,4515615Activity Recognition
Diabetes (Kachuee et al., 2019)73,64918,413453Disease Diagnosis
Landsat (Dua & Graff,2017)4,4352,000366Satellite Imaging
MIT-BIH(Moody & Mark,2001)87,55421,8921875Time Series
MNIST (LeCun et al., 2010)60,00010,00078410Digit Classification
Synthesized (Section 4.4)5,1201,28062See Figure 8
" + }, + { + "category_id": 1, + "poly": [ + 298, + 1228, + 1404, + 1228, + 1404, + 1442, + 298, + 1442 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 751, + 1405, + 751, + 1405, + 935, + 297, + 935 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 950, + 1405, + 950, + 1405, + 1133, + 298, + 1133 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1458, + 1405, + 1458, + 1405, + 1703, + 298, + 1703 + ], + "score": 0.978 + }, + { + "category_id": 2, + "poly": [ + 330, + 1944, + 1100, + 1944, + 1100, + 2033, + 330, + 2033 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 296, + 672, + 1401, + 672, + 1401, + 735, + 296, + 735 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 298, + 1798, + 1404, + 1798, + 1404, + 1922, + 298, + 1922 + ], + "score": 0.936 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 858, + 75, + 858, + 105, + 298, + 105 + ], + "score": 0.91 + }, + { + "category_id": 6, + "poly": [ + 542, + 225, + 1154, + 225, + 1154, + 257, + 542, + 257 + ], + "score": 0.905 + }, + { + "category_id": 0, + "poly": [ + 300, + 1741, + 581, + 1741, + 581, + 1772, + 300, + 1772 + ], + "score": 0.891 + }, + { + "category_id": 7, + "poly": [ + 335, + 583, + 866, + 583, + 866, + 612, + 335, + 612 + ], + "score": 0.885 + }, + { + "category_id": 0, + "poly": [ + 299, + 1171, + 474, + 1171, + 474, + 1202, + 299, + 1202 + ], + "score": 0.877 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 858, + 2089, + 858, + 2112, + 840, + 2112 + ], + "score": 0.79 + }, + { + "category_id": 13, + "poly": [ + 1070, + 673, + 1125, + 673, + 1125, + 703, + 1070, + 703 + ], + "score": 0.87, + "latex": "2 0 \\%" + }, + { + "category_id": 13, + "poly": [ + 689, + 1890, + 735, + 1890, + 735, + 1923, + 689, + 1923 + ], + "score": 0.78, + "latex": "( i v )" + }, + { + "category_id": 13, + "poly": [ + 498, + 1828, + 531, + 1828, + 531, + 1862, + 498, + 1862 + ], + "score": 0.41, + "latex": "( i )" + }, + { + "category_id": 13, + "poly": [ + 994, + 1860, + 1046, + 1860, + 1046, + 1893, + 994, + 1893 + ], + "score": 0.39, + "latex": "( i i i )" + }, + { + "category_id": 13, + "poly": [ + 562, + 811, + 642, + 811, + 642, + 843, + 562, + 843 + ], + "score": 0.3, + "latex": "2 0 1 8 ) ^ { 3 }" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1939.0, + 1103.0, + 1939.0, + 1103.0, + 1979.0, + 330.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1971.0, + 976.0, + 1971.0, + 976.0, + 2008.0, + 329.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 2001.0, + 672.0, + 2001.0, + 672.0, + 2038.0, + 327.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 539.0, + 221.0, + 1157.0, + 221.0, + 1157.0, + 262.0, + 539.0, + 262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1739.0, + 585.0, + 1739.0, + 585.0, + 1775.0, + 296.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 578.0, + 869.0, + 578.0, + 869.0, + 616.0, + 330.0, + 616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1166.0, + 477.0, + 1166.0, + 477.0, + 1208.0, + 293.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2087.0, + 861.0, + 2087.0, + 861.0, + 2118.0, + 840.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1228.0, + 1409.0, + 1228.0, + 1409.0, + 1266.0, + 293.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1258.0, + 1405.0, + 1258.0, + 1405.0, + 1295.0, + 293.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1288.0, + 1406.0, + 1288.0, + 1406.0, + 1326.0, + 293.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1319.0, + 1406.0, + 1319.0, + 1406.0, + 1357.0, + 293.0, + 1357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1351.0, + 1404.0, + 1351.0, + 1404.0, + 1385.0, + 294.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1380.0, + 1405.0, + 1380.0, + 1405.0, + 1418.0, + 293.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1414.0, + 743.0, + 1414.0, + 743.0, + 1445.0, + 293.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 750.0, + 1408.0, + 750.0, + 1408.0, + 786.0, + 295.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 778.0, + 1406.0, + 778.0, + 1406.0, + 820.0, + 291.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 810.0, + 561.0, + 810.0, + 561.0, + 849.0, + 292.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 643.0, + 810.0, + 1410.0, + 810.0, + 1410.0, + 849.0, + 643.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 842.0, + 1406.0, + 842.0, + 1406.0, + 877.0, + 294.0, + 877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 872.0, + 1403.0, + 872.0, + 1403.0, + 908.0, + 294.0, + 908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 904.0, + 971.0, + 904.0, + 971.0, + 939.0, + 295.0, + 939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 949.0, + 1407.0, + 949.0, + 1407.0, + 985.0, + 295.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 982.0, + 1405.0, + 982.0, + 1405.0, + 1014.0, + 296.0, + 1014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1011.0, + 1405.0, + 1011.0, + 1405.0, + 1047.0, + 295.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1042.0, + 1407.0, + 1042.0, + 1407.0, + 1077.0, + 295.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1071.0, + 1405.0, + 1071.0, + 1405.0, + 1108.0, + 293.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1103.0, + 956.0, + 1103.0, + 956.0, + 1136.0, + 293.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1456.0, + 1406.0, + 1456.0, + 1406.0, + 1494.0, + 292.0, + 1494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1489.0, + 1403.0, + 1489.0, + 1403.0, + 1523.0, + 295.0, + 1523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1521.0, + 1405.0, + 1521.0, + 1405.0, + 1553.0, + 293.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1549.0, + 1405.0, + 1549.0, + 1405.0, + 1585.0, + 292.0, + 1585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1580.0, + 1405.0, + 1580.0, + 1405.0, + 1614.0, + 295.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1609.0, + 1405.0, + 1609.0, + 1405.0, + 1648.0, + 292.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1643.0, + 1403.0, + 1643.0, + 1403.0, + 1676.0, + 295.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1672.0, + 899.0, + 1672.0, + 899.0, + 1706.0, + 293.0, + 1706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 670.0, + 1069.0, + 670.0, + 1069.0, + 710.0, + 294.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 670.0, + 1407.0, + 670.0, + 1407.0, + 710.0, + 1126.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 705.0, + 513.0, + 705.0, + 513.0, + 738.0, + 295.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1797.0, + 1406.0, + 1797.0, + 1406.0, + 1833.0, + 293.0, + 1833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1824.0, + 497.0, + 1824.0, + 497.0, + 1867.0, + 292.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 532.0, + 1824.0, + 1404.0, + 1824.0, + 1404.0, + 1867.0, + 532.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1859.0, + 993.0, + 1859.0, + 993.0, + 1897.0, + 293.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 1859.0, + 1404.0, + 1859.0, + 1404.0, + 1897.0, + 1047.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1890.0, + 688.0, + 1890.0, + 688.0, + 1926.0, + 294.0, + 1926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 1890.0, + 1405.0, + 1890.0, + 1405.0, + 1926.0, + 736.0, + 1926.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 301, + 283, + 1397, + 283, + 1397, + 558, + 301, + 558 + ], + "score": 0.981, + "html": "
Accuracy (%)
DatasetGMLPMLPSNNaSETbFGRc
CIFAR-10d (Krizhevsky et al., 2009)73.76 (±0.14)68.15 (±0.56)66.88 (±0.30)72.71 (±0.29)45.90 (±0.40)
HAPT (Anguita et al., 2013)96.34 (±0.19)95.73 (±0.38)95.47 (±0.09)71.35 (±0.74)91.57 (±0.31)
Diabetes (Kachuee et al.,2019)90.92 (±0.07)90.68 (±0.06)90.31 (±0.10)85.07 (±0.61)89.24 (±0.08)
Landsat (Dua & Graff,2017)91.54 (±0.16)91.21 (±0.44)91.37 (±0.21)91.03 (±0.56)90.70 (±0.17)
MIT-BIH(Moody & Mark,2001)98.74 (±0.04)98.65 (±0.01)98.56 (±0.02)98.10 (±0.01)98.13 (±0.03)
" + }, + { + "category_id": 1, + "poly": [ + 297, + 1787, + 1406, + 1787, + 1406, + 2034, + 297, + 2034 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1390, + 1405, + 1390, + 1405, + 1576, + 298, + 1576 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 1589, + 1404, + 1589, + 1404, + 1774, + 297, + 1774 + ], + "score": 0.978 + }, + { + "category_id": 3, + "poly": [ + 295, + 745, + 1400, + 745, + 1400, + 1220, + 295, + 1220 + ], + "score": 0.973 + }, + { + "category_id": 4, + "poly": [ + 294, + 1247, + 1402, + 1247, + 1402, + 1311, + 294, + 1311 + ], + "score": 0.931 + }, + { + "category_id": 7, + "poly": [ + 329, + 576, + 1012, + 576, + 1012, + 695, + 329, + 695 + ], + "score": 0.914 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 858, + 75, + 858, + 105, + 298, + 105 + ], + "score": 0.91 + }, + { + "category_id": 6, + "poly": [ + 444, + 224, + 1251, + 224, + 1251, + 258, + 444, + 258 + ], + "score": 0.908 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 857, + 2088, + 857, + 2111, + 841, + 2111 + ], + "score": 0.757 + }, + { + "category_id": 13, + "poly": [ + 1171, + 1944, + 1191, + 1944, + 1191, + 1970, + 1171, + 1970 + ], + "score": 0.81, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 1131, + 1974, + 1150, + 1974, + 1150, + 2000, + 1131, + 2000 + ], + "score": 0.81, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 795, + 1913, + 812, + 1913, + 812, + 1939, + 795, + 1939 + ], + "score": 0.81, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 298, + 2007, + 325, + 2007, + 325, + 2031, + 298, + 2031 + ], + "score": 0.65, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 1373, + 1856, + 1401, + 1856, + 1401, + 1878, + 1373, + 1878 + ], + "score": 0.64, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 936, + 1621, + 987, + 1621, + 987, + 1654, + 936, + 1654 + ], + "score": 0.48, + "latex": "( i i i )" + }, + { + "category_id": 13, + "poly": [ + 804, + 1283, + 822, + 1283, + 822, + 1306, + 804, + 1306 + ], + "score": 0.46, + "latex": "\\mathbf { X }" + }, + { + "category_id": 13, + "poly": [ + 587, + 1543, + 618, + 1543, + 618, + 1577, + 587, + 1577 + ], + "score": 0.46, + "latex": "( i )" + }, + { + "category_id": 13, + "poly": [ + 676, + 1621, + 717, + 1621, + 717, + 1654, + 676, + 1654 + ], + "score": 0.43, + "latex": "( i i )" + }, + { + "category_id": 13, + "poly": [ + 379, + 1621, + 412, + 1621, + 412, + 1654, + 379, + 1654 + ], + "score": 0.36, + "latex": "( i )" + }, + { + "category_id": 13, + "poly": [ + 398, + 373, + 434, + 373, + 434, + 399, + 398, + 399 + ], + "score": 0.25, + "latex": "\\mathbf { \\nabla } \\cdot \\mathbf { 1 0 } ^ { d }" + }, + { + "category_id": 15, + "poly": [ + 548.0, + 741.0, + 630.0, + 741.0, + 630.0, + 771.0, + 548.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1117.0, + 751.0, + 1186.0, + 751.0, + 1186.0, + 777.0, + 1117.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 773.0, + 339.0, + 773.0, + 339.0, + 794.0, + 315.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 790.0, + 536.0, + 790.0, + 536.0, + 796.0, + 530.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 785.0, + 605.0, + 785.0, + 605.0, + 794.0, + 594.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 772.0, + 913.0, + 772.0, + 913.0, + 799.0, + 870.0, + 799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 813.0, + 340.0, + 813.0, + 340.0, + 839.0, + 314.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1368.0, + 818.0, + 1380.0, + 818.0, + 1380.0, + 830.0, + 1368.0, + 830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 832.0, + 473.0, + 832.0, + 473.0, + 843.0, + 463.0, + 843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 823.0, + 913.0, + 823.0, + 913.0, + 850.0, + 871.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 855.0, + 343.0, + 855.0, + 343.0, + 880.0, + 314.0, + 880.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 866.0, + 436.0, + 866.0, + 436.0, + 877.0, + 423.0, + 877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 398.0, + 877.0, + 408.0, + 877.0, + 408.0, + 888.0, + 398.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 876.0, + 910.0, + 876.0, + 910.0, + 899.0, + 873.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 896.0, + 340.0, + 896.0, + 340.0, + 1014.0, + 292.0, + 1014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 907.0, + 373.0, + 907.0, + 373.0, + 922.0, + 357.0, + 922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 899.0, + 819.0, + 899.0, + 819.0, + 913.0, + 809.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 900.0, + 882.0, + 900.0, + 882.0, + 1018.0, + 850.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 927.0, + 569.0, + 927.0, + 569.0, + 938.0, + 559.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 925.0, + 910.0, + 925.0, + 910.0, + 953.0, + 873.0, + 953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 940.0, + 339.0, + 940.0, + 339.0, + 962.0, + 315.0, + 962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 981.0, + 339.0, + 981.0, + 339.0, + 1003.0, + 315.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 975.0, + 910.0, + 975.0, + 910.0, + 1003.0, + 873.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 477.0, + 997.0, + 487.0, + 997.0, + 487.0, + 1008.0, + 477.0, + 1008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 1022.0, + 340.0, + 1022.0, + 340.0, + 1048.0, + 314.0, + 1048.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 1027.0, + 912.0, + 1027.0, + 912.0, + 1054.0, + 871.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 1027.0, + 938.0, + 1027.0, + 938.0, + 1039.0, + 928.0, + 1039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 1065.0, + 342.0, + 1065.0, + 342.0, + 1089.0, + 313.0, + 1089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 443.0, + 1065.0, + 452.0, + 1065.0, + 452.0, + 1075.0, + 443.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 1080.0, + 830.0, + 1080.0, + 830.0, + 1111.0, + 771.0, + 1111.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 1079.0, + 912.0, + 1079.0, + 912.0, + 1106.0, + 871.0, + 1106.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 1083.0, + 1391.0, + 1083.0, + 1391.0, + 1113.0, + 1333.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 1108.0, + 339.0, + 1108.0, + 339.0, + 1129.0, + 315.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 1102.0, + 820.0, + 1102.0, + 820.0, + 1134.0, + 771.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 965.0, + 1108.0, + 976.0, + 1108.0, + 976.0, + 1121.0, + 965.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1332.0, + 1103.0, + 1380.0, + 1103.0, + 1380.0, + 1135.0, + 1332.0, + 1135.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 535.0, + 1139.0, + 565.0, + 1139.0, + 565.0, + 1163.0, + 535.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 752.0, + 1137.0, + 786.0, + 1137.0, + 786.0, + 1166.0, + 752.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 1140.0, + 950.0, + 1140.0, + 950.0, + 1165.0, + 919.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 1142.0, + 1105.0, + 1142.0, + 1105.0, + 1162.0, + 1078.0, + 1162.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1233.0, + 1139.0, + 1263.0, + 1139.0, + 1263.0, + 1165.0, + 1233.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 1156.0, + 681.0, + 1156.0, + 681.0, + 1184.0, + 497.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 1156.0, + 1244.0, + 1156.0, + 1244.0, + 1184.0, + 1062.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 546.0, + 1187.0, + 594.0, + 1187.0, + 594.0, + 1228.0, + 546.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 1187.0, + 1154.0, + 1187.0, + 1154.0, + 1228.0, + 1106.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.75, + 1101.0, + 427.75, + 1101.0, + 427.75, + 1121.0, + 424.75, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1247.0, + 1405.0, + 1247.0, + 1405.0, + 1283.0, + 296.0, + 1283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1275.0, + 803.0, + 1275.0, + 803.0, + 1314.0, + 294.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 1275.0, + 1149.0, + 1275.0, + 1149.0, + 1314.0, + 823.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 575.0, + 950.0, + 575.0, + 950.0, + 608.0, + 330.0, + 608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 603.0, + 864.0, + 603.0, + 864.0, + 637.0, + 331.0, + 637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 632.0, + 1012.0, + 632.0, + 1012.0, + 667.0, + 330.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 658.0, + 871.0, + 658.0, + 871.0, + 700.0, + 328.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 446.0, + 222.0, + 1253.0, + 222.0, + 1253.0, + 261.0, + 446.0, + 261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2118.0, + 839.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1790.0, + 1408.0, + 1790.0, + 1408.0, + 1824.0, + 295.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1821.0, + 1406.0, + 1821.0, + 1406.0, + 1855.0, + 294.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1851.0, + 1372.0, + 1851.0, + 1372.0, + 1885.0, + 295.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1878.0, + 1407.0, + 1878.0, + 1407.0, + 1919.0, + 292.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1912.0, + 794.0, + 1912.0, + 794.0, + 1945.0, + 295.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 813.0, + 1912.0, + 1408.0, + 1912.0, + 1408.0, + 1945.0, + 813.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1939.0, + 1170.0, + 1939.0, + 1170.0, + 1979.0, + 292.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1192.0, + 1939.0, + 1409.0, + 1939.0, + 1409.0, + 1979.0, + 1192.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1970.0, + 1130.0, + 1970.0, + 1130.0, + 2008.0, + 294.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 1970.0, + 1404.0, + 1970.0, + 1404.0, + 2008.0, + 1151.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 2004.0, + 528.0, + 2004.0, + 528.0, + 2036.0, + 326.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1392.0, + 1403.0, + 1392.0, + 1403.0, + 1424.0, + 296.0, + 1424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1422.0, + 1408.0, + 1422.0, + 1408.0, + 1457.0, + 293.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1448.0, + 1406.0, + 1448.0, + 1406.0, + 1489.0, + 291.0, + 1489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1483.0, + 1408.0, + 1483.0, + 1408.0, + 1516.0, + 293.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1511.0, + 1405.0, + 1511.0, + 1405.0, + 1549.0, + 292.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1543.0, + 586.0, + 1543.0, + 586.0, + 1579.0, + 295.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 619.0, + 1543.0, + 631.0, + 1543.0, + 631.0, + 1579.0, + 619.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1585.0, + 1405.0, + 1585.0, + 1405.0, + 1628.0, + 292.0, + 1628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1619.0, + 378.0, + 1619.0, + 378.0, + 1657.0, + 292.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 413.0, + 1619.0, + 675.0, + 1619.0, + 675.0, + 1657.0, + 413.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 718.0, + 1619.0, + 935.0, + 1619.0, + 935.0, + 1657.0, + 718.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 988.0, + 1619.0, + 1406.0, + 1619.0, + 1406.0, + 1657.0, + 988.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1651.0, + 1405.0, + 1651.0, + 1405.0, + 1687.0, + 295.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1680.0, + 1404.0, + 1680.0, + 1404.0, + 1716.0, + 292.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1713.0, + 1405.0, + 1713.0, + 1405.0, + 1745.0, + 293.0, + 1745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1743.0, + 980.0, + 1743.0, + 980.0, + 1776.0, + 293.0, + 1776.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1728, + 1405, + 1728, + 1405, + 2034, + 298, + 2034 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1437, + 1404, + 1437, + 1404, + 1713, + 298, + 1713 + ], + "score": 0.981 + }, + { + "category_id": 3, + "poly": [ + 862, + 770, + 1413, + 770, + 1413, + 1196, + 862, + 1196 + ], + "score": 0.962 + }, + { + "category_id": 3, + "poly": [ + 295, + 768, + 848, + 768, + 848, + 1197, + 295, + 1197 + ], + "score": 0.962 + }, + { + "category_id": 3, + "poly": [ + 294, + 220, + 1414, + 220, + 1414, + 649, + 294, + 649 + ], + "score": 0.961 + }, + { + "category_id": 4, + "poly": [ + 296, + 1220, + 851, + 1220, + 851, + 1312, + 296, + 1312 + ], + "score": 0.961 + }, + { + "category_id": 4, + "poly": [ + 861, + 1220, + 1420, + 1220, + 1420, + 1312, + 861, + 1312 + ], + "score": 0.96 + }, + { + "category_id": 4, + "poly": [ + 865, + 672, + 1419, + 672, + 1419, + 735, + 865, + 735 + ], + "score": 0.888 + }, + { + "category_id": 0, + "poly": [ + 297, + 1378, + 984, + 1378, + 984, + 1409, + 297, + 1409 + ], + "score": 0.886 + }, + { + "category_id": 4, + "poly": [ + 296, + 672, + 852, + 672, + 852, + 735, + 296, + 735 + ], + "score": 0.862 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 858, + 2089, + 858, + 2112, + 840, + 2112 + ], + "score": 0.794 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 857, + 76, + 857, + 104, + 298, + 104 + ], + "score": 0.765 + }, + { + "category_id": 2, + "poly": [ + 300, + 77, + 855, + 77, + 855, + 104, + 300, + 104 + ], + "score": 0.399 + }, + { + "category_id": 13, + "poly": [ + 355, + 1282, + 445, + 1282, + 445, + 1311, + 355, + 1311 + ], + "score": 0.88, + "latex": "k { = } 1 5 3 6" + }, + { + "category_id": 13, + "poly": [ + 959, + 1282, + 1030, + 1282, + 1030, + 1310, + 959, + 1310 + ], + "score": 0.87, + "latex": "m { = } 1 6" + }, + { + "category_id": 13, + "poly": [ + 297, + 1881, + 352, + 1881, + 352, + 1912, + 297, + 1912 + ], + "score": 0.85, + "latex": "9 9 \\%" + }, + { + "category_id": 13, + "poly": [ + 1287, + 2004, + 1312, + 2004, + 1312, + 2030, + 1287, + 2030 + ], + "score": 0.79, + "latex": "\\Psi" + }, + { + "category_id": 13, + "poly": [ + 530, + 1253, + 574, + 1253, + 574, + 1281, + 530, + 1281 + ], + "score": 0.72, + "latex": "( m )" + }, + { + "category_id": 13, + "poly": [ + 1142, + 1252, + 1178, + 1252, + 1178, + 1282, + 1142, + 1282 + ], + "score": 0.71, + "latex": "( k )" + }, + { + "category_id": 13, + "poly": [ + 557, + 1500, + 595, + 1500, + 595, + 1532, + 557, + 1532 + ], + "score": 0.68, + "latex": "( a )" + }, + { + "category_id": 13, + "poly": [ + 1334, + 1013, + 1400, + 1013, + 1400, + 1032, + 1334, + 1032 + ], + "score": 0.55, + "latex": "\\mathtt { k } = 3 0 7 2" + }, + { + "category_id": 13, + "poly": [ + 1334, + 1103, + 1390, + 1103, + 1390, + 1122, + 1334, + 1122 + ], + "score": 0.48, + "latex": "\\mathtt { k } = 1 9 2" + }, + { + "category_id": 13, + "poly": [ + 1334, + 1126, + 1380, + 1126, + 1380, + 1145, + 1334, + 1145 + ], + "score": 0.47, + "latex": "k { = } 9 6" + }, + { + "category_id": 13, + "poly": [ + 1334, + 1036, + 1399, + 1036, + 1399, + 1054, + 1334, + 1054 + ], + "score": 0.43, + "latex": "_ { k = 1 5 3 6 }" + }, + { + "category_id": 13, + "poly": [ + 1334, + 1081, + 1390, + 1081, + 1390, + 1099, + 1334, + 1099 + ], + "score": 0.41, + "latex": "k = 3 8 4" + }, + { + "category_id": 13, + "poly": [ + 1334, + 1057, + 1391, + 1057, + 1391, + 1077, + 1334, + 1077 + ], + "score": 0.25, + "latex": "k = 7 6 8" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 769.0, + 906.0, + 769.0, + 906.0, + 790.0, + 881.0, + 790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 823.0, + 906.0, + 823.0, + 906.0, + 843.0, + 880.0, + 843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 877.0, + 905.0, + 877.0, + 905.0, + 898.0, + 880.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 910.0, + 887.0, + 910.0, + 887.0, + 1026.0, + 858.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1384.0, + 911.0, + 1393.0, + 911.0, + 1393.0, + 919.0, + 1384.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 931.0, + 905.0, + 931.0, + 905.0, + 951.0, + 881.0, + 951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 986.0, + 905.0, + 986.0, + 905.0, + 1007.0, + 881.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1330.0, + 1009.0, + 1333.0, + 1009.0, + 1333.0, + 1036.0, + 1330.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1009.0, + 1404.0, + 1009.0, + 1404.0, + 1036.0, + 1401.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 1018.0, + 1314.0, + 1018.0, + 1314.0, + 1027.0, + 1305.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 1037.0, + 909.0, + 1037.0, + 909.0, + 1061.0, + 879.0, + 1061.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1303.0, + 1040.0, + 1316.0, + 1040.0, + 1316.0, + 1052.0, + 1303.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1330.0, + 1030.0, + 1333.0, + 1030.0, + 1333.0, + 1058.0, + 1330.0, + 1058.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1400.0, + 1030.0, + 1404.0, + 1030.0, + 1404.0, + 1058.0, + 1400.0, + 1058.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1330.0, + 1054.0, + 1333.0, + 1054.0, + 1333.0, + 1082.0, + 1330.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1392.0, + 1054.0, + 1396.0, + 1054.0, + 1396.0, + 1082.0, + 1392.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1391.0, + 1078.0, + 1394.0, + 1078.0, + 1394.0, + 1102.0, + 1391.0, + 1102.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 1094.0, + 906.0, + 1094.0, + 906.0, + 1114.0, + 880.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1330.0, + 1099.0, + 1333.0, + 1099.0, + 1333.0, + 1127.0, + 1330.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1391.0, + 1099.0, + 1395.0, + 1099.0, + 1395.0, + 1127.0, + 1391.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1330.0, + 1122.0, + 1333.0, + 1122.0, + 1333.0, + 1149.0, + 1330.0, + 1149.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1381.0, + 1122.0, + 1386.0, + 1122.0, + 1386.0, + 1149.0, + 1381.0, + 1149.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 1147.0, + 906.0, + 1147.0, + 906.0, + 1167.0, + 880.0, + 1167.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 922.0, + 1161.0, + 938.0, + 1161.0, + 938.0, + 1179.0, + 922.0, + 1179.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 974.0, + 1159.0, + 1007.0, + 1159.0, + 1007.0, + 1181.0, + 974.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1034.0, + 1159.0, + 1067.0, + 1159.0, + 1067.0, + 1181.0, + 1034.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1095.0, + 1159.0, + 1128.0, + 1159.0, + 1128.0, + 1181.0, + 1095.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 1158.0, + 1192.0, + 1158.0, + 1192.0, + 1182.0, + 1151.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1213.0, + 1159.0, + 1252.0, + 1159.0, + 1252.0, + 1180.0, + 1213.0, + 1180.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1272.0, + 1158.0, + 1313.0, + 1158.0, + 1313.0, + 1182.0, + 1272.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1332.0, + 1158.0, + 1373.0, + 1158.0, + 1373.0, + 1182.0, + 1332.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 1172.0, + 1226.0, + 1172.0, + 1226.0, + 1201.0, + 1092.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 768.0, + 341.0, + 768.0, + 341.0, + 790.0, + 313.0, + 790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 821.0, + 343.0, + 821.0, + 343.0, + 844.0, + 313.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 876.0, + 340.0, + 876.0, + 340.0, + 898.0, + 313.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 909.0, + 322.0, + 909.0, + 322.0, + 1027.0, + 290.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 930.0, + 340.0, + 930.0, + 340.0, + 953.0, + 314.0, + 953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 984.0, + 339.0, + 984.0, + 339.0, + 1008.0, + 313.0, + 1008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 776.0, + 1006.0, + 839.0, + 1006.0, + 839.0, + 1036.0, + 776.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 1038.0, + 342.0, + 1038.0, + 342.0, + 1061.0, + 313.0, + 1061.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 753.0, + 1041.0, + 761.0, + 1041.0, + 761.0, + 1049.0, + 753.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 777.0, + 1031.0, + 838.0, + 1031.0, + 838.0, + 1057.0, + 777.0, + 1057.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 1053.0, + 839.0, + 1053.0, + 839.0, + 1081.0, + 778.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 1077.0, + 831.0, + 1077.0, + 831.0, + 1104.0, + 778.0, + 1104.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 1092.0, + 342.0, + 1092.0, + 342.0, + 1116.0, + 313.0, + 1116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 751.0, + 1106.0, + 777.0, + 1106.0, + 777.0, + 1120.0, + 751.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 1099.0, + 830.0, + 1099.0, + 830.0, + 1126.0, + 778.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 776.0, + 1123.0, + 829.0, + 1123.0, + 829.0, + 1147.0, + 776.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 1148.0, + 340.0, + 1148.0, + 340.0, + 1167.0, + 314.0, + 1167.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 1160.0, + 373.0, + 1160.0, + 373.0, + 1179.0, + 356.0, + 1179.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 1158.0, + 443.0, + 1158.0, + 443.0, + 1182.0, + 406.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 1159.0, + 501.0, + 1159.0, + 501.0, + 1181.0, + 467.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 1159.0, + 562.0, + 1159.0, + 562.0, + 1180.0, + 529.0, + 1180.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 584.0, + 1158.0, + 628.0, + 1158.0, + 628.0, + 1181.0, + 584.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 1158.0, + 688.0, + 1158.0, + 688.0, + 1181.0, + 646.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 705.0, + 1158.0, + 748.0, + 1158.0, + 748.0, + 1181.0, + 705.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 1158.0, + 808.0, + 1158.0, + 808.0, + 1182.0, + 765.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 526.0, + 1173.0, + 662.0, + 1173.0, + 662.0, + 1201.0, + 526.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 221.0, + 905.0, + 221.0, + 905.0, + 241.0, + 881.0, + 241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 255.0, + 339.0, + 255.0, + 339.0, + 276.0, + 315.0, + 276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 276.0, + 906.0, + 276.0, + 906.0, + 296.0, + 881.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 324.0, + 339.0, + 324.0, + 339.0, + 344.0, + 315.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 329.0, + 905.0, + 329.0, + 905.0, + 349.0, + 879.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 361.0, + 325.0, + 361.0, + 325.0, + 480.0, + 288.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 852.0, + 360.0, + 905.0, + 360.0, + 905.0, + 482.0, + 852.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 393.0, + 338.0, + 393.0, + 338.0, + 414.0, + 315.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 434.0, + 905.0, + 434.0, + 905.0, + 461.0, + 879.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 460.0, + 339.0, + 460.0, + 339.0, + 482.0, + 315.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 492.0, + 906.0, + 492.0, + 906.0, + 512.0, + 879.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 513.0, + 508.0, + 813.0, + 508.0, + 813.0, + 532.0, + 513.0, + 532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 529.0, + 343.0, + 529.0, + 343.0, + 553.0, + 313.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 538.0, + 370.0, + 538.0, + 370.0, + 585.0, + 357.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 529.0, + 839.0, + 529.0, + 839.0, + 602.0, + 512.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 878.0, + 544.0, + 906.0, + 544.0, + 906.0, + 568.0, + 878.0, + 568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1264.0, + 524.0, + 1404.0, + 524.0, + 1404.0, + 604.0, + 1264.0, + 604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 600.0, + 339.0, + 600.0, + 339.0, + 620.0, + 315.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 600.0, + 906.0, + 600.0, + 906.0, + 620.0, + 879.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 613.0, + 372.0, + 613.0, + 372.0, + 630.0, + 356.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 407.0, + 610.0, + 442.0, + 610.0, + 442.0, + 633.0, + 407.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 468.0, + 610.0, + 502.0, + 610.0, + 502.0, + 634.0, + 468.0, + 634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 609.0, + 563.0, + 609.0, + 563.0, + 633.0, + 529.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 586.0, + 610.0, + 625.0, + 610.0, + 625.0, + 633.0, + 586.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 610.0, + 686.0, + 610.0, + 686.0, + 633.0, + 646.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 707.0, + 610.0, + 747.0, + 610.0, + 747.0, + 633.0, + 707.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 609.0, + 810.0, + 609.0, + 810.0, + 635.0, + 765.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 613.0, + 938.0, + 613.0, + 938.0, + 630.0, + 921.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 972.0, + 610.0, + 1008.0, + 610.0, + 1008.0, + 634.0, + 972.0, + 634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 610.0, + 1068.0, + 610.0, + 1068.0, + 633.0, + 1033.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 610.0, + 1129.0, + 610.0, + 1129.0, + 633.0, + 1094.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 610.0, + 1192.0, + 610.0, + 1192.0, + 633.0, + 1150.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1211.0, + 610.0, + 1253.0, + 610.0, + 1253.0, + 633.0, + 1211.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1272.0, + 610.0, + 1313.0, + 610.0, + 1313.0, + 633.0, + 1272.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 610.0, + 1374.0, + 610.0, + 1374.0, + 633.0, + 1333.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 524.0, + 622.0, + 664.0, + 622.0, + 664.0, + 655.0, + 524.0, + 655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 622.0, + 1229.0, + 622.0, + 1229.0, + 656.0, + 1091.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 951.0, + 332.0, + 958.0, + 332.0, + 958.0, + 368.0, + 951.0, + 368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1217.0, + 854.0, + 1217.0, + 854.0, + 1256.0, + 295.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1250.0, + 529.0, + 1250.0, + 529.0, + 1284.0, + 296.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 1250.0, + 853.0, + 1250.0, + 853.0, + 1284.0, + 575.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1281.0, + 354.0, + 1281.0, + 354.0, + 1312.0, + 294.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 446.0, + 1281.0, + 455.0, + 1281.0, + 455.0, + 1312.0, + 446.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 1220.0, + 1423.0, + 1220.0, + 1423.0, + 1254.0, + 862.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 1248.0, + 1141.0, + 1248.0, + 1141.0, + 1286.0, + 860.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1179.0, + 1248.0, + 1423.0, + 1248.0, + 1423.0, + 1286.0, + 1179.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 1282.0, + 958.0, + 1282.0, + 958.0, + 1312.0, + 861.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1031.0, + 1282.0, + 1039.0, + 1282.0, + 1039.0, + 1312.0, + 1031.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 670.0, + 1420.0, + 670.0, + 1420.0, + 708.0, + 860.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 704.0, + 1202.0, + 704.0, + 1202.0, + 736.0, + 863.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1376.0, + 989.0, + 1376.0, + 989.0, + 1413.0, + 294.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 669.0, + 856.0, + 669.0, + 856.0, + 709.0, + 294.0, + 709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 701.0, + 844.0, + 701.0, + 844.0, + 738.0, + 295.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2117.0, + 838.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 71.0, + 859.0, + 71.0, + 859.0, + 109.0, + 295.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1727.0, + 1406.0, + 1727.0, + 1406.0, + 1763.0, + 293.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1759.0, + 1408.0, + 1759.0, + 1408.0, + 1795.0, + 292.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1790.0, + 1405.0, + 1790.0, + 1405.0, + 1825.0, + 295.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1819.0, + 1407.0, + 1819.0, + 1407.0, + 1857.0, + 292.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1852.0, + 1406.0, + 1852.0, + 1406.0, + 1884.0, + 296.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1881.0, + 1406.0, + 1881.0, + 1406.0, + 1917.0, + 353.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1909.0, + 1408.0, + 1909.0, + 1408.0, + 1948.0, + 293.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1942.0, + 1403.0, + 1942.0, + 1403.0, + 1977.0, + 295.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1968.0, + 1407.0, + 1968.0, + 1407.0, + 2012.0, + 292.0, + 2012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2003.0, + 1286.0, + 2003.0, + 1286.0, + 2038.0, + 295.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1313.0, + 2003.0, + 1408.0, + 2003.0, + 1408.0, + 2038.0, + 1313.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1438.0, + 1405.0, + 1438.0, + 1405.0, + 1474.0, + 294.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1468.0, + 1406.0, + 1468.0, + 1406.0, + 1505.0, + 294.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1499.0, + 556.0, + 1499.0, + 556.0, + 1536.0, + 293.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 1499.0, + 1406.0, + 1499.0, + 1406.0, + 1536.0, + 596.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1529.0, + 1406.0, + 1529.0, + 1406.0, + 1566.0, + 294.0, + 1566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1561.0, + 1408.0, + 1561.0, + 1408.0, + 1597.0, + 293.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1589.0, + 1408.0, + 1589.0, + 1408.0, + 1626.0, + 294.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1619.0, + 1406.0, + 1619.0, + 1406.0, + 1656.0, + 294.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1651.0, + 1406.0, + 1651.0, + 1406.0, + 1686.0, + 292.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1683.0, + 955.0, + 1683.0, + 955.0, + 1716.0, + 294.0, + 1716.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1711, + 1404, + 1711, + 1404, + 1897, + 298, + 1897 + ], + "score": 0.976 + }, + { + "category_id": 3, + "poly": [ + 454, + 226, + 1243, + 226, + 1243, + 655, + 454, + 655 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 1911, + 1403, + 1911, + 1403, + 2035, + 299, + 2035 + ], + "score": 0.974 + }, + { + "category_id": 3, + "poly": [ + 871, + 936, + 1315, + 936, + 1315, + 1432, + 871, + 1432 + ], + "score": 0.965 + }, + { + "category_id": 4, + "poly": [ + 867, + 1454, + 1316, + 1454, + 1316, + 1579, + 867, + 1579 + ], + "score": 0.962 + }, + { + "category_id": 4, + "poly": [ + 297, + 681, + 1405, + 681, + 1405, + 776, + 297, + 776 + ], + "score": 0.958 + }, + { + "category_id": 4, + "poly": [ + 295, + 1455, + 851, + 1455, + 851, + 1549, + 295, + 1549 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 290, + 833, + 1402, + 833, + 1402, + 897, + 290, + 897 + ], + "score": 0.949 + }, + { + "category_id": 3, + "poly": [ + 351, + 951, + 793, + 951, + 793, + 1215, + 351, + 1215 + ], + "score": 0.91 + }, + { + "category_id": 0, + "poly": [ + 299, + 1642, + 529, + 1642, + 529, + 1677, + 299, + 1677 + ], + "score": 0.904 + }, + { + "category_id": 2, + "poly": [ + 297, + 76, + 858, + 76, + 858, + 105, + 297, + 105 + ], + "score": 0.9 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.796 + }, + { + "category_id": 1, + "poly": [ + 346, + 1232, + 798, + 1232, + 798, + 1403, + 346, + 1403 + ], + "score": 0.553 + }, + { + "category_id": 14, + "poly": [ + 343, + 1233, + 796, + 1233, + 796, + 1325, + 343, + 1325 + ], + "score": 0.74, + "latex": "\\begin{array} { l l } { P ( G = A \\oplus B ) = 0 . 9 9 } & { , P ( G \\neq A \\oplus B ) = 0 . 0 1 } \\\\ { P ( H = C \\oplus D ) = 0 . 9 9 } & { , P ( H \\neq C \\oplus D ) = 0 . 0 1 } \\\\ { P ( I = E \\oplus F ) = 0 . 9 9 } & { , P ( I \\neq E \\oplus F ) = 0 . 0 1 } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 348, + 1337, + 758, + 1337, + 758, + 1402, + 348, + 1402 + ], + "score": 0.69, + "latex": "\\begin{array} { l } { P [ J = ( G \\land H ) \\lor ( G \\land I ) \\lor ( H \\land I ) ] = 0 . 9 9 } \\\\ { P [ J \\neq ( G \\land H ) \\lor ( G \\land I ) \\lor ( H \\land I ) ] = 0 . 0 1 } \\end{array}" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 463.0, + 808.0, + 463.0, + 808.0, + 470.0, + 797.0, + 470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 626.0, + 665.0, + 626.0, + 665.0, + 656.0, + 628.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 624.0, + 1074.0, + 624.0, + 1074.0, + 659.0, + 1032.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 984.0, + 982.0, + 984.0, + 982.0, + 1022.0, + 870.0, + 1022.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 1091.0, + 983.0, + 1091.0, + 983.0, + 1129.0, + 869.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 1199.0, + 983.0, + 1199.0, + 983.0, + 1237.0, + 868.0, + 1237.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 1307.0, + 983.0, + 1307.0, + 983.0, + 1345.0, + 868.0, + 1345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1002.0, + 1375.0, + 1036.0, + 1375.0, + 1036.0, + 1403.0, + 1002.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1056.0, + 1372.0, + 1191.0, + 1372.0, + 1191.0, + 1405.0, + 1056.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1218.0, + 1375.0, + 1244.0, + 1375.0, + 1244.0, + 1401.0, + 1218.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1273.0, + 1377.0, + 1293.0, + 1377.0, + 1293.0, + 1398.0, + 1273.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 1397.0, + 1210.0, + 1397.0, + 1210.0, + 1437.0, + 1091.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 1454.0, + 1316.0, + 1454.0, + 1316.0, + 1488.0, + 866.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1485.0, + 1315.0, + 1485.0, + 1315.0, + 1519.0, + 865.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1517.0, + 1315.0, + 1517.0, + 1315.0, + 1548.0, + 865.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1543.0, + 1088.0, + 1543.0, + 1088.0, + 1584.0, + 865.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 681.0, + 1405.0, + 681.0, + 1405.0, + 719.0, + 295.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 711.0, + 1410.0, + 711.0, + 1410.0, + 749.0, + 295.0, + 749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 742.0, + 1047.0, + 742.0, + 1047.0, + 781.0, + 295.0, + 781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1455.0, + 854.0, + 1455.0, + 854.0, + 1489.0, + 295.0, + 1489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1484.0, + 854.0, + 1484.0, + 854.0, + 1521.0, + 295.0, + 1521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1516.0, + 584.0, + 1516.0, + 584.0, + 1552.0, + 295.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 443.0, + 972.0, + 471.0, + 972.0, + 471.0, + 1003.0, + 443.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 975.0, + 539.0, + 975.0, + 539.0, + 995.0, + 529.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 973.0, + 622.0, + 973.0, + 622.0, + 1000.0, + 598.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 675.0, + 976.0, + 696.0, + 976.0, + 696.0, + 1000.0, + 675.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 419.0, + 1061.0, + 427.0, + 1061.0, + 427.0, + 1073.0, + 419.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 561.0, + 1053.0, + 586.0, + 1053.0, + 586.0, + 1081.0, + 561.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 1165.0, + 587.0, + 1165.0, + 587.0, + 1201.0, + 565.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1638.0, + 535.0, + 1638.0, + 535.0, + 1685.0, + 292.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 72.0, + 858.0, + 72.0, + 858.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2087.0, + 860.0, + 2087.0, + 860.0, + 2117.0, + 839.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1713.0, + 1405.0, + 1713.0, + 1405.0, + 1745.0, + 296.0, + 1745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1741.0, + 1405.0, + 1741.0, + 1405.0, + 1777.0, + 295.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1772.0, + 1408.0, + 1772.0, + 1408.0, + 1809.0, + 292.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1803.0, + 1405.0, + 1803.0, + 1405.0, + 1837.0, + 295.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1832.0, + 1405.0, + 1832.0, + 1405.0, + 1870.0, + 293.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1864.0, + 1097.0, + 1864.0, + 1097.0, + 1900.0, + 294.0, + 1900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1909.0, + 1407.0, + 1909.0, + 1407.0, + 1946.0, + 293.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1940.0, + 1405.0, + 1940.0, + 1405.0, + 1978.0, + 294.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1974.0, + 1405.0, + 1974.0, + 1405.0, + 2007.0, + 295.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2001.0, + 1408.0, + 2001.0, + 1408.0, + 2041.0, + 293.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 832.0, + 1405.0, + 832.0, + 1405.0, + 870.0, + 294.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 865.0, + 1234.0, + 865.0, + 1234.0, + 897.0, + 294.0, + 897.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 495, + 1405, + 495, + 1405, + 680, + 298, + 680 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1404, + 229, + 1404, + 384, + 298, + 384 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 296, + 775, + 1401, + 775, + 1401, + 838, + 296, + 838 + ], + "score": 0.909 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 858, + 75, + 858, + 104, + 298, + 104 + ], + "score": 0.889 + }, + { + "category_id": 0, + "poly": [ + 299, + 427, + 543, + 427, + 543, + 463, + 299, + 463 + ], + "score": 0.879 + }, + { + "category_id": 0, + "poly": [ + 299, + 725, + 488, + 725, + 488, + 759, + 299, + 759 + ], + "score": 0.879 + }, + { + "category_id": 1, + "poly": [ + 297, + 856, + 1401, + 856, + 1401, + 949, + 297, + 949 + ], + "score": 0.847 + }, + { + "category_id": 1, + "poly": [ + 300, + 1231, + 1404, + 1231, + 1404, + 1294, + 300, + 1294 + ], + "score": 0.838 + }, + { + "category_id": 1, + "poly": [ + 293, + 967, + 1401, + 967, + 1401, + 1032, + 293, + 1032 + ], + "score": 0.837 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2112, + 836, + 2112 + ], + "score": 0.827 + }, + { + "category_id": 1, + "poly": [ + 294, + 1099, + 1403, + 1099, + 1403, + 1164, + 294, + 1164 + ], + "score": 0.816 + }, + { + "category_id": 1, + "poly": [ + 295, + 1048, + 1227, + 1048, + 1227, + 1083, + 295, + 1083 + ], + "score": 0.806 + }, + { + "category_id": 1, + "poly": [ + 296, + 1179, + 1065, + 1179, + 1065, + 1214, + 296, + 1214 + ], + "score": 0.802 + }, + { + "category_id": 1, + "poly": [ + 295, + 1585, + 1402, + 1585, + 1402, + 1650, + 295, + 1650 + ], + "score": 0.801 + }, + { + "category_id": 1, + "poly": [ + 296, + 1667, + 1401, + 1667, + 1401, + 1731, + 296, + 1731 + ], + "score": 0.792 + }, + { + "category_id": 1, + "poly": [ + 297, + 1312, + 1401, + 1312, + 1401, + 1376, + 297, + 1376 + ], + "score": 0.752 + }, + { + "category_id": 1, + "poly": [ + 296, + 1393, + 1401, + 1393, + 1401, + 1456, + 296, + 1456 + ], + "score": 0.745 + }, + { + "category_id": 1, + "poly": [ + 297, + 1748, + 1403, + 1748, + 1403, + 1842, + 297, + 1842 + ], + "score": 0.721 + }, + { + "category_id": 1, + "poly": [ + 296, + 1859, + 1400, + 1859, + 1400, + 1925, + 296, + 1925 + ], + "score": 0.696 + }, + { + "category_id": 1, + "poly": [ + 297, + 1473, + 1409, + 1473, + 1409, + 1568, + 297, + 1568 + ], + "score": 0.646 + }, + { + "category_id": 1, + "poly": [ + 300, + 1942, + 1404, + 1942, + 1404, + 2034, + 300, + 2034 + ], + "score": 0.608 + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 858.0, + 72.0, + 858.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 420.0, + 549.0, + 420.0, + 549.0, + 472.0, + 292.0, + 472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 726.0, + 490.0, + 726.0, + 490.0, + 762.0, + 296.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2084.0, + 868.0, + 2084.0, + 868.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 496.0, + 1406.0, + 496.0, + 1406.0, + 532.0, + 293.0, + 532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 529.0, + 1403.0, + 529.0, + 1403.0, + 561.0, + 295.0, + 561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 556.0, + 1409.0, + 556.0, + 1409.0, + 594.0, + 292.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 585.0, + 1405.0, + 585.0, + 1405.0, + 624.0, + 292.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 617.0, + 1405.0, + 617.0, + 1405.0, + 652.0, + 295.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 646.0, + 583.0, + 646.0, + 583.0, + 682.0, + 295.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 229.0, + 1405.0, + 229.0, + 1405.0, + 267.0, + 294.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 260.0, + 1409.0, + 260.0, + 1409.0, + 299.0, + 292.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 289.0, + 1406.0, + 289.0, + 1406.0, + 328.0, + 295.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 321.0, + 1404.0, + 321.0, + 1404.0, + 358.0, + 296.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 352.0, + 681.0, + 352.0, + 681.0, + 388.0, + 295.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 773.0, + 1403.0, + 773.0, + 1403.0, + 809.0, + 295.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 805.0, + 1249.0, + 805.0, + 1249.0, + 841.0, + 323.0, + 841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 854.0, + 1405.0, + 854.0, + 1405.0, + 893.0, + 295.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 883.0, + 1407.0, + 883.0, + 1407.0, + 925.0, + 321.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 918.0, + 505.0, + 918.0, + 505.0, + 950.0, + 324.0, + 950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1229.0, + 1404.0, + 1229.0, + 1404.0, + 1268.0, + 294.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1263.0, + 713.0, + 1263.0, + 713.0, + 1294.0, + 324.0, + 1294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 965.0, + 1406.0, + 965.0, + 1406.0, + 1006.0, + 292.0, + 1006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1000.0, + 609.0, + 1000.0, + 609.0, + 1030.0, + 322.0, + 1030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1097.0, + 1405.0, + 1097.0, + 1405.0, + 1137.0, + 293.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1129.0, + 1343.0, + 1129.0, + 1343.0, + 1168.0, + 322.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1047.0, + 1227.0, + 1047.0, + 1227.0, + 1088.0, + 292.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1180.0, + 1066.0, + 1180.0, + 1066.0, + 1217.0, + 294.0, + 1217.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1584.0, + 1407.0, + 1584.0, + 1407.0, + 1624.0, + 294.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1619.0, + 572.0, + 1619.0, + 572.0, + 1650.0, + 323.0, + 1650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1663.0, + 1407.0, + 1663.0, + 1407.0, + 1705.0, + 293.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1698.0, + 685.0, + 1698.0, + 685.0, + 1731.0, + 321.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1307.0, + 1405.0, + 1307.0, + 1405.0, + 1352.0, + 292.0, + 1352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1344.0, + 1018.0, + 1344.0, + 1018.0, + 1376.0, + 322.0, + 1376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1389.0, + 1407.0, + 1389.0, + 1407.0, + 1432.0, + 293.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1421.0, + 399.0, + 1421.0, + 399.0, + 1459.0, + 319.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1749.0, + 1403.0, + 1749.0, + 1403.0, + 1783.0, + 296.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1782.0, + 1404.0, + 1782.0, + 1404.0, + 1812.0, + 325.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1811.0, + 656.0, + 1811.0, + 656.0, + 1842.0, + 322.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1854.0, + 1409.0, + 1854.0, + 1409.0, + 1899.0, + 292.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1887.0, + 769.0, + 1887.0, + 769.0, + 1930.0, + 323.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1472.0, + 1409.0, + 1472.0, + 1409.0, + 1512.0, + 294.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1505.0, + 1409.0, + 1505.0, + 1409.0, + 1544.0, + 320.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1538.0, + 565.0, + 1538.0, + 565.0, + 1568.0, + 321.0, + 1568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1941.0, + 1406.0, + 1941.0, + 1406.0, + 1978.0, + 295.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1972.0, + 1405.0, + 1972.0, + 1405.0, + 2008.0, + 320.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 2004.0, + 1081.0, + 2004.0, + 1081.0, + 2036.0, + 321.0, + 2036.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 298, + 75, + 858, + 75, + 858, + 105, + 298, + 105 + ], + "score": 0.899 + }, + { + "category_id": 1, + "poly": [ + 298, + 425, + 1405, + 425, + 1405, + 519, + 298, + 519 + ], + "score": 0.868 + }, + { + "category_id": 1, + "poly": [ + 293, + 229, + 1403, + 229, + 1403, + 294, + 293, + 294 + ], + "score": 0.848 + }, + { + "category_id": 1, + "poly": [ + 295, + 538, + 1404, + 538, + 1404, + 602, + 295, + 602 + ], + "score": 0.845 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 861, + 2088, + 861, + 2113, + 835, + 2113 + ], + "score": 0.828 + }, + { + "category_id": 1, + "poly": [ + 298, + 704, + 1400, + 704, + 1400, + 770, + 298, + 770 + ], + "score": 0.816 + }, + { + "category_id": 1, + "poly": [ + 300, + 1656, + 1401, + 1656, + 1401, + 1751, + 300, + 1751 + ], + "score": 0.812 + }, + { + "category_id": 1, + "poly": [ + 297, + 311, + 1402, + 311, + 1402, + 406, + 297, + 406 + ], + "score": 0.81 + }, + { + "category_id": 1, + "poly": [ + 298, + 621, + 1401, + 621, + 1401, + 685, + 298, + 685 + ], + "score": 0.809 + }, + { + "category_id": 1, + "poly": [ + 301, + 1543, + 1401, + 1543, + 1401, + 1638, + 301, + 1638 + ], + "score": 0.797 + }, + { + "category_id": 1, + "poly": [ + 297, + 1233, + 1404, + 1233, + 1404, + 1298, + 297, + 1298 + ], + "score": 0.789 + }, + { + "category_id": 1, + "poly": [ + 298, + 1430, + 1408, + 1430, + 1408, + 1524, + 298, + 1524 + ], + "score": 0.767 + }, + { + "category_id": 1, + "poly": [ + 298, + 1150, + 1403, + 1150, + 1403, + 1216, + 298, + 1216 + ], + "score": 0.756 + }, + { + "category_id": 1, + "poly": [ + 302, + 953, + 1402, + 953, + 1402, + 1020, + 302, + 1020 + ], + "score": 0.756 + }, + { + "category_id": 1, + "poly": [ + 298, + 1316, + 1407, + 1316, + 1407, + 1411, + 298, + 1411 + ], + "score": 0.746 + }, + { + "category_id": 1, + "poly": [ + 297, + 787, + 1401, + 787, + 1401, + 854, + 297, + 854 + ], + "score": 0.734 + }, + { + "category_id": 1, + "poly": [ + 301, + 1770, + 1402, + 1770, + 1402, + 1865, + 301, + 1865 + ], + "score": 0.732 + }, + { + "category_id": 1, + "poly": [ + 297, + 870, + 1403, + 870, + 1403, + 936, + 297, + 936 + ], + "score": 0.712 + }, + { + "category_id": 1, + "poly": [ + 299, + 1885, + 1404, + 1885, + 1404, + 1979, + 299, + 1979 + ], + "score": 0.692 + }, + { + "category_id": 1, + "poly": [ + 297, + 1035, + 1406, + 1035, + 1406, + 1132, + 297, + 1132 + ], + "score": 0.635 + }, + { + "category_id": 13, + "poly": [ + 1378, + 1887, + 1402, + 1887, + 1402, + 1916, + 1378, + 1916 + ], + "score": 0.85, + "latex": "l _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 740, + 1837, + 759, + 1837, + 759, + 1859, + 740, + 1859 + ], + "score": 0.62, + "latex": "\\underline { { \\underline { { \\mathbf { \\Pi } } } } } =" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 867.0, + 2085.0, + 867.0, + 2125.0, + 831.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 427.0, + 1407.0, + 427.0, + 1407.0, + 461.0, + 295.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 457.0, + 1408.0, + 457.0, + 1408.0, + 491.0, + 322.0, + 491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 484.0, + 399.0, + 484.0, + 399.0, + 521.0, + 320.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 227.0, + 1404.0, + 227.0, + 1404.0, + 269.0, + 293.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 260.0, + 1144.0, + 260.0, + 1144.0, + 295.0, + 321.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 538.0, + 1405.0, + 538.0, + 1405.0, + 574.0, + 295.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 570.0, + 676.0, + 570.0, + 676.0, + 602.0, + 324.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 702.0, + 1402.0, + 702.0, + 1402.0, + 742.0, + 296.0, + 742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 737.0, + 776.0, + 737.0, + 776.0, + 771.0, + 322.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1656.0, + 1406.0, + 1656.0, + 1406.0, + 1694.0, + 295.0, + 1694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1684.0, + 1406.0, + 1684.0, + 1406.0, + 1727.0, + 320.0, + 1727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1719.0, + 675.0, + 1719.0, + 675.0, + 1752.0, + 321.0, + 1752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 311.0, + 1406.0, + 311.0, + 1406.0, + 348.0, + 295.0, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 343.0, + 1406.0, + 343.0, + 1406.0, + 382.0, + 320.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 376.0, + 494.0, + 376.0, + 494.0, + 407.0, + 321.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 617.0, + 1405.0, + 617.0, + 1405.0, + 661.0, + 292.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 653.0, + 596.0, + 653.0, + 596.0, + 684.0, + 323.0, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1545.0, + 1406.0, + 1545.0, + 1406.0, + 1580.0, + 296.0, + 1580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1578.0, + 1402.0, + 1578.0, + 1402.0, + 1609.0, + 325.0, + 1609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1606.0, + 810.0, + 1606.0, + 810.0, + 1638.0, + 322.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1229.0, + 1406.0, + 1229.0, + 1406.0, + 1273.0, + 292.0, + 1273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1264.0, + 595.0, + 1264.0, + 595.0, + 1298.0, + 324.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1427.0, + 1406.0, + 1427.0, + 1406.0, + 1467.0, + 293.0, + 1467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1459.0, + 1409.0, + 1459.0, + 1409.0, + 1500.0, + 320.0, + 1500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1490.0, + 505.0, + 1490.0, + 505.0, + 1526.0, + 323.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1151.0, + 1405.0, + 1151.0, + 1405.0, + 1187.0, + 296.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1183.0, + 1091.0, + 1183.0, + 1091.0, + 1215.0, + 322.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 954.0, + 1407.0, + 954.0, + 1407.0, + 990.0, + 298.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 984.0, + 973.0, + 984.0, + 973.0, + 1020.0, + 319.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1315.0, + 1407.0, + 1315.0, + 1407.0, + 1355.0, + 295.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1343.0, + 1410.0, + 1343.0, + 1410.0, + 1387.0, + 320.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1378.0, + 580.0, + 1378.0, + 580.0, + 1412.0, + 322.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 783.0, + 1406.0, + 783.0, + 1406.0, + 828.0, + 295.0, + 828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 818.0, + 1354.0, + 818.0, + 1354.0, + 857.0, + 321.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1770.0, + 1404.0, + 1770.0, + 1404.0, + 1807.0, + 296.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1800.0, + 1411.0, + 1800.0, + 1411.0, + 1837.0, + 320.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1831.0, + 739.0, + 1831.0, + 739.0, + 1867.0, + 322.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 760.0, + 1831.0, + 935.0, + 1831.0, + 935.0, + 1867.0, + 760.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 867.0, + 1408.0, + 867.0, + 1408.0, + 911.0, + 294.0, + 911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 902.0, + 692.0, + 902.0, + 692.0, + 937.0, + 324.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1883.0, + 1377.0, + 1883.0, + 1377.0, + 1921.0, + 294.0, + 1921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1915.0, + 1406.0, + 1915.0, + 1406.0, + 1951.0, + 321.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1943.0, + 961.0, + 1943.0, + 961.0, + 1982.0, + 322.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1033.0, + 1407.0, + 1033.0, + 1407.0, + 1076.0, + 294.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1065.0, + 1406.0, + 1065.0, + 1406.0, + 1108.0, + 321.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1100.0, + 1122.0, + 1100.0, + 1122.0, + 1134.0, + 324.0, + 1134.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 295, + 1404, + 295, + 1404, + 541, + 298, + 541 + ], + "score": 0.985 + }, + { + "category_id": 5, + "poly": [ + 462, + 1274, + 1236, + 1274, + 1236, + 1512, + 462, + 1512 + ], + "score": 0.983, + "html": "
HyperparameterConsidered Values
Number of hidden layers{1,2,..,6}
Size of hidden layers[0.05 × nfeatures] - [20 X nfeatures]
Alpha[10-12,10-1]
Dropout rate[0,1]
" + }, + { + "category_id": 5, + "poly": [ + 511, + 1616, + 1187, + 1616, + 1187, + 1854, + 511, + 1854 + ], + "score": 0.981, + "html": "
HyperparameterConsidered Values
Number of hidden layers{1,2}
Size of hidden layersnfeatures - [50 X nfeatures]
Number of groups2- nfeatures
Alpha[10-12,10-1]
" + }, + { + "category_id": 5, + "poly": [ + 563, + 764, + 1133, + 764, + 1133, + 1087, + 563, + 1087 + ], + "score": 0.98, + "html": "
HyperparameterConsidered Values
Number of hidden layers{1,2,..,8]a
Number of groups16 - 4096b
Size of groups4-32
Lambda[10-²,104]
Alpha[10-12,10-1]
Dropout rate[0,1]
" + }, + { + "category_id": 1, + "poly": [ + 298, + 555, + 1404, + 555, + 1404, + 679, + 298, + 679 + ], + "score": 0.975 + }, + { + "category_id": 7, + "poly": [ + 329, + 1106, + 1054, + 1106, + 1054, + 1167, + 329, + 1167 + ], + "score": 0.942 + }, + { + "category_id": 6, + "poly": [ + 478, + 1558, + 1215, + 1558, + 1215, + 1592, + 478, + 1592 + ], + "score": 0.929 + }, + { + "category_id": 6, + "poly": [ + 469, + 708, + 1227, + 708, + 1227, + 742, + 469, + 742 + ], + "score": 0.915 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 858, + 75, + 858, + 105, + 298, + 105 + ], + "score": 0.909 + }, + { + "category_id": 6, + "poly": [ + 425, + 1216, + 1271, + 1216, + 1271, + 1251, + 425, + 1251 + ], + "score": 0.905 + }, + { + "category_id": 0, + "poly": [ + 300, + 226, + 860, + 226, + 860, + 262, + 300, + 262 + ], + "score": 0.881 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 864, + 2088, + 864, + 2113, + 835, + 2113 + ], + "score": 0.859 + }, + { + "category_id": 13, + "poly": [ + 891, + 952, + 1022, + 952, + 1022, + 991, + 891, + 991 + ], + "score": 0.68, + "latex": "[ 1 0 ^ { - 2 } , 1 0 ^ { 4 } ]" + }, + { + "category_id": 13, + "poly": [ + 840, + 1803, + 998, + 1803, + 998, + 1843, + 840, + 1843 + ], + "score": 0.49, + "latex": "[ 1 0 ^ { - 1 2 } , 1 0 ^ { - 1 } ]" + }, + { + "category_id": 13, + "poly": [ + 840, + 1678, + 911, + 1678, + 911, + 1713, + 840, + 1713 + ], + "score": 0.47, + "latex": "\\{ 1 , 2 \\}" + }, + { + "category_id": 13, + "poly": [ + 892, + 997, + 1050, + 997, + 1050, + 1034, + 892, + 1034 + ], + "score": 0.33, + "latex": "[ 1 0 ^ { - 1 2 } , 1 0 ^ { - 1 } ]" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1102.0, + 882.0, + 1102.0, + 882.0, + 1140.0, + 329.0, + 1140.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1130.0, + 1057.0, + 1130.0, + 1057.0, + 1172.0, + 329.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 476.0, + 1551.0, + 1220.0, + 1551.0, + 1220.0, + 1600.0, + 476.0, + 1600.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.0, + 702.0, + 1230.0, + 702.0, + 1230.0, + 750.0, + 466.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1213.0, + 1276.0, + 1213.0, + 1276.0, + 1257.0, + 423.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 225.0, + 862.0, + 225.0, + 862.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 295.0, + 1409.0, + 295.0, + 1409.0, + 333.0, + 293.0, + 333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 324.0, + 1405.0, + 324.0, + 1405.0, + 362.0, + 294.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 358.0, + 1404.0, + 358.0, + 1404.0, + 392.0, + 294.0, + 392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 388.0, + 1405.0, + 388.0, + 1405.0, + 422.0, + 294.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 418.0, + 1404.0, + 418.0, + 1404.0, + 454.0, + 295.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 448.0, + 1405.0, + 448.0, + 1405.0, + 484.0, + 293.0, + 484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 479.0, + 1405.0, + 479.0, + 1405.0, + 513.0, + 293.0, + 513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 509.0, + 582.0, + 509.0, + 582.0, + 544.0, + 294.0, + 544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 555.0, + 1405.0, + 555.0, + 1405.0, + 591.0, + 293.0, + 591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 587.0, + 1405.0, + 587.0, + 1405.0, + 622.0, + 293.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 618.0, + 1405.0, + 618.0, + 1405.0, + 654.0, + 293.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 645.0, + 982.0, + 645.0, + 982.0, + 686.0, + 293.0, + 686.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 299, + 568, + 1400, + 568, + 1400, + 1225, + 299, + 1225 + ], + "score": 0.982, + "html": "
DatasetArchitecture
CIFAR-10GSel-1536-16,GFC,ReLU,BNorm,GPool-maX,GFC,ReLU,BNorm,GPool-maX,GFC,ReLU,BNorm,GPool-max,GFC,ReLU,BNorm,Concat,FC-10,Softmax
HAPTGSel-288-12,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,Concat,FC-5,Softmax
DiabetesGSel-16-16,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm, GPool-mean,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,Concat,FC-3,Softmax
LandsatGSel-88-16,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,Concat,FC-6,Softmax
MIT-BIHGSel-240-24,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,Concat,FC-5,Softmax
MNISTGSel-64-16,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,GPool-mean,GFC,ReLU,BNorm,Concat,FC-10,Softmax
SynthesizedGSel-4-2,GFC,ReLU,BNorm,Concat,FC-2,Softmax
" + }, + { + "category_id": 5, + "poly": [ + 301, + 1335, + 1398, + 1335, + 1398, + 1757, + 301, + 1757 + ], + "score": 0.982, + "html": "
DatasetArchitecture
CIFAR-10FC-3072,ReLU,BNorm,FC-2764,ReLU,BNorm,FC-2488,ReLU,BNorm,FC-10,Softmax
HAPTFC-106,ReLU,BNorm,FC-21,ReLU,BNorm,FC-5,SoftmaX
DiabetesFC-45,I ReLU,BNorm,FC-45,ReLU,BNorm,FC-45,ReLU,BNorm,FC-45,ReLU,BNorm,FC-3,Softmax
LandsatFC-68, ReLU,BNorm,FC-68,ReLU,BNorm,FC-68,ReLU,BNorm,FC-68,ReLU,BNorm,FC-6,Softmax
MIT-BIHFC-1737,ReLU,BNorm,FC-1737,ReLU,BNorm,FC-1737,ReLU,BNorm,FC-5,Softmax
" + }, + { + "category_id": 1, + "poly": [ + 297, + 295, + 1407, + 295, + 1407, + 481, + 297, + 481 + ], + "score": 0.979 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 858, + 75, + 858, + 105, + 298, + 105 + ], + "score": 0.911 + }, + { + "category_id": 6, + "poly": [ + 546, + 509, + 1153, + 509, + 1153, + 542, + 546, + 542 + ], + "score": 0.905 + }, + { + "category_id": 6, + "poly": [ + 554, + 1272, + 1142, + 1272, + 1142, + 1307, + 554, + 1307 + ], + "score": 0.903 + }, + { + "category_id": 0, + "poly": [ + 301, + 226, + 600, + 226, + 600, + 261, + 301, + 261 + ], + "score": 0.883 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 864, + 2088, + 864, + 2113, + 835, + 2113 + ], + "score": 0.854 + }, + { + "category_id": 13, + "poly": [ + 1196, + 329, + 1333, + 329, + 1333, + 356, + 1196, + 356 + ], + "score": 0.86, + "latex": "\\mathtt { G S e l - k - m }" + }, + { + "category_id": 13, + "poly": [ + 387, + 390, + 457, + 390, + 457, + 417, + 387, + 417 + ], + "score": 0.76, + "latex": "\\operatorname { F C - x }" + }, + { + "category_id": 13, + "poly": [ + 630, + 451, + 699, + 451, + 699, + 478, + 630, + 478 + ], + "score": 0.73, + "latex": "{ \\mathrm { S C } } ^ { - } \\mathrm { x }" + }, + { + "category_id": 13, + "poly": [ + 1068, + 390, + 1188, + 390, + 1188, + 417, + 1068, + 417 + ], + "score": 0.65, + "latex": "\\mathtt { G P O O 1 - x }" + }, + { + "category_id": 13, + "poly": [ + 864, + 391, + 886, + 391, + 886, + 416, + 864, + 416 + ], + "score": 0.59, + "latex": "_ \\textrm { x }" + }, + { + "category_id": 13, + "poly": [ + 1220, + 455, + 1240, + 455, + 1240, + 476, + 1220, + 476 + ], + "score": 0.44, + "latex": "_ \\textrm { x }" + }, + { + "category_id": 13, + "poly": [ + 441, + 424, + 463, + 424, + 463, + 447, + 441, + 447 + ], + "score": 0.28, + "latex": "_ \\textrm { x }" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 505.0, + 1154.0, + 505.0, + 1154.0, + 546.0, + 542.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 1268.0, + 1144.0, + 1268.0, + 1144.0, + 1311.0, + 553.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 224.0, + 604.0, + 224.0, + 604.0, + 267.0, + 293.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2123.0, + 831.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 292.0, + 1408.0, + 292.0, + 1408.0, + 332.0, + 292.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 324.0, + 1195.0, + 324.0, + 1195.0, + 362.0, + 294.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 324.0, + 1409.0, + 324.0, + 1409.0, + 362.0, + 1334.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 357.0, + 1407.0, + 357.0, + 1407.0, + 393.0, + 294.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 389.0, + 386.0, + 389.0, + 386.0, + 421.0, + 295.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 458.0, + 389.0, + 863.0, + 389.0, + 863.0, + 421.0, + 458.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 887.0, + 389.0, + 1067.0, + 389.0, + 1067.0, + 421.0, + 887.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1189.0, + 389.0, + 1402.0, + 389.0, + 1402.0, + 421.0, + 1189.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 419.0, + 440.0, + 419.0, + 440.0, + 454.0, + 294.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 419.0, + 1405.0, + 419.0, + 1405.0, + 454.0, + 464.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 447.0, + 629.0, + 447.0, + 629.0, + 482.0, + 295.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 700.0, + 447.0, + 1219.0, + 447.0, + 1219.0, + 482.0, + 700.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 447.0, + 1250.0, + 447.0, + 1250.0, + 482.0, + 1241.0, + 482.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 301, + 384, + 1399, + 384, + 1399, + 832, + 301, + 832 + ], + "score": 0.984, + "html": "
DatasetArchitecture
CIFAR-10FC-3901,SeLU,BNorm,FC-3901,SeLU,BNorm,FC-3901,SeLU,BNorm,FC-10,Softmax
HAPTFC-510,ReLU,BNorm,FC-510,SeLU,BNorm,FC-510,SeLU,FC-5,Softmax
DiabetesFC-105,SeLU,BNorm,FC-105,SeLU,BNorm,FC-105,SeLU,BNorm,FC-3,Softmax
LandsatFC-816,SeLU,BNorm,FC-816,SeLU,BNorm,FC-6,Softmax
MIT-BIHFC-1140,SeLU,BNorm,FC-1140,SeLU,BNorm,FC-1140,SeLU,BNorm,FC-5,Softmax
" + }, + { + "category_id": 5, + "poly": [ + 300, + 1110, + 1398, + 1110, + 1398, + 1364, + 300, + 1364 + ], + "score": 0.982, + "html": "
Dataset Architecture
CIFAR-10 SC-4000,SReLU,SC-1000,SReLU,SC-4000,SReLU,FC-10,Softmax
HAPTSC-500,SReLU,SC-500,SReLU,SC-500,SReLU,FC-5,Softmax
DiabetesSC-1000,SReLU,SC-1000,SReLU,SC-1000,SReLU,FC-3,Softmax
LandsatSC-1000,SReLU,SC-1000,SReLU,SC-1000,SReLU,FC-6,Softmax
MIT-BIH SC-1000,SReLU,SC-1000,SReLU,SC-1000,SReLU,FC-5,SoftmaX
" + }, + { + "category_id": 5, + "poly": [ + 411, + 1640, + 1287, + 1640, + 1287, + 1927, + 411, + 1927 + ], + "score": 0.982, + "html": "
DatasetArchitecture
CIFAR-10Group-256,FC-3072,ReLU,FC-10,Softmax
HAPTGroup-104,FC-12173,ReLU,FC-5,Softmax
DiabetesGroup-44,FC-337,ReLU,FC-3,Softmax
LandsatGroup-32,FC-1577,ReLU,FC-6,Softmax
MIT-BIHGroup-160,FC-3444,ReLU,FC-5,Softmax
" + }, + { + "category_id": 2, + "poly": [ + 297, + 74, + 859, + 74, + 859, + 105, + 297, + 105 + ], + "score": 0.92 + }, + { + "category_id": 6, + "poly": [ + 550, + 1581, + 1149, + 1581, + 1149, + 1615, + 550, + 1615 + ], + "score": 0.919 + }, + { + "category_id": 6, + "poly": [ + 558, + 1049, + 1139, + 1049, + 1139, + 1083, + 558, + 1083 + ], + "score": 0.911 + }, + { + "category_id": 6, + "poly": [ + 555, + 323, + 1143, + 323, + 1143, + 357, + 555, + 357 + ], + "score": 0.91 + }, + { + "category_id": 2, + "poly": [ + 835, + 2087, + 864, + 2087, + 864, + 2113, + 835, + 2113 + ], + "score": 0.866 + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 858.0, + 72.0, + 858.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 548.0, + 1576.0, + 1149.0, + 1576.0, + 1149.0, + 1619.0, + 548.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 556.0, + 1043.0, + 1139.0, + 1043.0, + 1139.0, + 1087.0, + 556.0, + 1087.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 554.0, + 318.0, + 1144.0, + 318.0, + 1144.0, + 361.0, + 554.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 295, + 1405, + 295, + 1405, + 419, + 298, + 419 + ], + "score": 0.977 + }, + { + "category_id": 5, + "poly": [ + 660, + 505, + 1051, + 505, + 1051, + 1121, + 660, + 1121 + ], + "score": 0.974, + "html": "
DependencyVersion
python3.7.1
pytorch1.1.0
torchvision0.2.1
cuda1001.0
ipython6.5.0
jupyter1.0.0
numpy1.15.4
nni0.9.1.1
pandas0.23.4
scikit-learn0.19.2
scipy1.1.0
pomegranate0.11.1
tqdm4.32.1
matplotlib3.0.1
" + }, + { + "category_id": 6, + "poly": [ + 661, + 448, + 1039, + 448, + 1039, + 481, + 661, + 481 + ], + "score": 0.909 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 858, + 74, + 858, + 105, + 298, + 105 + ], + "score": 0.906 + }, + { + "category_id": 0, + "poly": [ + 301, + 226, + 780, + 226, + 780, + 262, + 301, + 262 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 863, + 2088, + 863, + 2112, + 835, + 2112 + ], + "score": 0.848 + }, + { + "category_id": 15, + "poly": [ + 656.0, + 443.0, + 1040.0, + 443.0, + 1040.0, + 485.0, + 656.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 857.0, + 72.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 223.0, + 785.0, + 223.0, + 785.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 294.0, + 1405.0, + 294.0, + 1405.0, + 331.0, + 293.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 328.0, + 1403.0, + 328.0, + 1403.0, + 358.0, + 293.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 356.0, + 1406.0, + 356.0, + 1406.0, + 394.0, + 293.0, + 394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 389.0, + 1112.0, + 389.0, + 1112.0, + 421.0, + 295.0, + 421.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 14, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 295, + 1406, + 295, + 1406, + 481, + 298, + 481 + ], + "score": 0.979 + }, + { + "category_id": 3, + "poly": [ + 346, + 528, + 1382, + 528, + 1382, + 1573, + 346, + 1573 + ], + "score": 0.976 + }, + { + "category_id": 4, + "poly": [ + 297, + 1635, + 1408, + 1635, + 1408, + 1730, + 297, + 1730 + ], + "score": 0.915 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 858, + 75, + 858, + 105, + 298, + 105 + ], + "score": 0.905 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2113, + 836, + 2113 + ], + "score": 0.848 + }, + { + "category_id": 0, + "poly": [ + 300, + 226, + 624, + 226, + 624, + 261, + 300, + 261 + ], + "score": 0.828 + }, + { + "category_id": 15, + "poly": [ + 1089.0, + 569.0, + 1101.0, + 569.0, + 1101.0, + 579.0, + 1089.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 429.0, + 597.0, + 450.0, + 597.0, + 450.0, + 616.0, + 429.0, + 616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 600.0, + 508.0, + 600.0, + 508.0, + 608.0, + 497.0, + 608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 609.0, + 436.0, + 609.0, + 436.0, + 621.0, + 425.0, + 621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 705.0, + 616.0, + 717.0, + 616.0, + 717.0, + 627.0, + 705.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1270.0, + 624.0, + 1284.0, + 624.0, + 1284.0, + 641.0, + 1270.0, + 641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1288.0, + 645.0, + 1304.0, + 645.0, + 1304.0, + 658.0, + 1288.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 653.0, + 872.0, + 653.0, + 872.0, + 663.0, + 862.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 672.0, + 710.0, + 672.0, + 710.0, + 681.0, + 701.0, + 681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 677.0, + 508.0, + 677.0, + 508.0, + 686.0, + 497.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 677.0, + 694.0, + 686.0, + 694.0, + 686.0, + 706.0, + 677.0, + 706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 779.0, + 464.0, + 779.0, + 464.0, + 787.0, + 453.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 581.0, + 777.0, + 592.0, + 777.0, + 592.0, + 787.0, + 581.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 647.0, + 767.0, + 656.0, + 767.0, + 656.0, + 776.0, + 647.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 770.0, + 697.0, + 770.0, + 697.0, + 791.0, + 683.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1137.0, + 779.0, + 1148.0, + 779.0, + 1148.0, + 787.0, + 1137.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 462.0, + 795.0, + 472.0, + 795.0, + 472.0, + 805.0, + 462.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 462.0, + 813.0, + 474.0, + 813.0, + 474.0, + 824.0, + 462.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 707.0, + 808.0, + 723.0, + 808.0, + 723.0, + 823.0, + 707.0, + 823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1210.0, + 814.0, + 1219.0, + 814.0, + 1219.0, + 824.0, + 1210.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 822.0, + 1247.0, + 822.0, + 1247.0, + 827.0, + 1241.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 825.0, + 630.0, + 825.0, + 630.0, + 838.0, + 614.0, + 838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 843.0, + 630.0, + 843.0, + 630.0, + 856.0, + 614.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 400.0, + 850.0, + 425.0, + 850.0, + 425.0, + 862.0, + 400.0, + 862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 720.0, + 851.0, + 729.0, + 851.0, + 729.0, + 861.0, + 720.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1102.0, + 851.0, + 1112.0, + 851.0, + 1112.0, + 862.0, + 1102.0, + 862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 856.0, + 1124.0, + 856.0, + 1124.0, + 867.0, + 1112.0, + 867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 913.0, + 869.0, + 924.0, + 869.0, + 924.0, + 878.0, + 913.0, + 878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.0, + 881.0, + 927.0, + 881.0, + 927.0, + 891.0, + 918.0, + 891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 881.0, + 1089.0, + 881.0, + 1089.0, + 892.0, + 1078.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 881.0, + 1285.0, + 881.0, + 1285.0, + 891.0, + 1275.0, + 891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1084.0, + 893.0, + 1094.0, + 893.0, + 1094.0, + 903.0, + 1084.0, + 903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 905.0, + 839.0, + 905.0, + 839.0, + 913.0, + 828.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1282.0, + 905.0, + 1296.0, + 905.0, + 1296.0, + 915.0, + 1282.0, + 915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 718.0, + 975.0, + 729.0, + 975.0, + 729.0, + 987.0, + 718.0, + 987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 974.0, + 941.0, + 974.0, + 941.0, + 988.0, + 927.0, + 988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1269.0, + 983.0, + 1278.0, + 983.0, + 1278.0, + 991.0, + 1269.0, + 991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 987.0, + 400.0, + 987.0, + 400.0, + 998.0, + 388.0, + 998.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 1024.0, + 1070.0, + 1024.0, + 1070.0, + 1034.0, + 1059.0, + 1034.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 707.0, + 1034.0, + 723.0, + 1034.0, + 723.0, + 1047.0, + 707.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1342.0, + 1035.0, + 1353.0, + 1035.0, + 1353.0, + 1046.0, + 1342.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1047.0, + 1077.0, + 1047.0, + 1077.0, + 1058.0, + 1065.0, + 1058.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1034.0, + 1054.0, + 1046.0, + 1054.0, + 1046.0, + 1065.0, + 1034.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 791.0, + 1060.0, + 801.0, + 1060.0, + 801.0, + 1071.0, + 791.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 1071.0, + 508.0, + 1071.0, + 508.0, + 1082.0, + 497.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1322.0, + 1068.0, + 1331.0, + 1068.0, + 1331.0, + 1079.0, + 1322.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 1090.0, + 400.0, + 1090.0, + 400.0, + 1101.0, + 388.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 1097.0, + 933.0, + 1097.0, + 933.0, + 1105.0, + 923.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1263.0, + 1095.0, + 1273.0, + 1095.0, + 1273.0, + 1107.0, + 1263.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 791.0, + 1102.0, + 800.0, + 1102.0, + 800.0, + 1113.0, + 791.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 623.0, + 1114.0, + 633.0, + 1114.0, + 633.0, + 1124.0, + 623.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 709.0, + 1113.0, + 730.0, + 1113.0, + 730.0, + 1126.0, + 709.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 791.0, + 1114.0, + 805.0, + 1114.0, + 805.0, + 1123.0, + 791.0, + 1123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 1114.0, + 940.0, + 1114.0, + 940.0, + 1124.0, + 928.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1124.0, + 1114.0, + 1136.0, + 1114.0, + 1136.0, + 1124.0, + 1124.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 1179.0, + 436.0, + 1179.0, + 436.0, + 1189.0, + 426.0, + 1189.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 1185.0, + 520.0, + 1185.0, + 520.0, + 1197.0, + 497.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 705.0, + 1185.0, + 716.0, + 1185.0, + 716.0, + 1195.0, + 705.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1208.0, + 1185.0, + 1220.0, + 1185.0, + 1220.0, + 1196.0, + 1208.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 1197.0, + 411.0, + 1197.0, + 411.0, + 1208.0, + 401.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 482.0, + 1198.0, + 488.0, + 1198.0, + 488.0, + 1204.0, + 482.0, + 1204.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1023.0, + 1197.0, + 1033.0, + 1197.0, + 1033.0, + 1208.0, + 1023.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 814.0, + 1209.0, + 825.0, + 1209.0, + 825.0, + 1220.0, + 814.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1128.0, + 1212.0, + 1136.0, + 1212.0, + 1136.0, + 1221.0, + 1128.0, + 1221.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1208.0, + 1209.0, + 1220.0, + 1209.0, + 1220.0, + 1220.0, + 1208.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 492.0, + 1239.0, + 502.0, + 1239.0, + 502.0, + 1248.0, + 492.0, + 1248.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 443.0, + 1245.0, + 455.0, + 1245.0, + 455.0, + 1256.0, + 443.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1246.0, + 639.0, + 1246.0, + 639.0, + 1254.0, + 630.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 1251.0, + 843.0, + 1251.0, + 843.0, + 1262.0, + 832.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1208.0, + 1252.0, + 1220.0, + 1252.0, + 1220.0, + 1262.0, + 1208.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 1258.0, + 517.0, + 1258.0, + 517.0, + 1266.0, + 507.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1011.0, + 1257.0, + 1021.0, + 1257.0, + 1021.0, + 1268.0, + 1011.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 1257.0, + 1136.0, + 1257.0, + 1136.0, + 1268.0, + 1126.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 443.0, + 1263.0, + 453.0, + 1263.0, + 453.0, + 1275.0, + 443.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1121.0, + 1270.0, + 1130.0, + 1270.0, + 1130.0, + 1279.0, + 1121.0, + 1279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 474.0, + 1300.0, + 484.0, + 1300.0, + 484.0, + 1309.0, + 474.0, + 1309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 704.0, + 1299.0, + 720.0, + 1299.0, + 720.0, + 1312.0, + 704.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 659.0, + 1307.0, + 670.0, + 1307.0, + 670.0, + 1315.0, + 659.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 999.0, + 1306.0, + 1008.0, + 1306.0, + 1008.0, + 1315.0, + 999.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1311.0, + 1306.0, + 1321.0, + 1306.0, + 1321.0, + 1315.0, + 1311.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1044.0, + 1313.0, + 1050.0, + 1313.0, + 1050.0, + 1319.0, + 1044.0, + 1319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 917.0, + 1407.0, + 927.0, + 1407.0, + 927.0, + 1415.0, + 917.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 481.0, + 1443.0, + 490.0, + 1443.0, + 490.0, + 1452.0, + 481.0, + 1452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1467.0, + 381.0, + 1467.0, + 381.0, + 1476.0, + 372.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 896.0, + 1469.0, + 902.0, + 1469.0, + 902.0, + 1475.0, + 896.0, + 1475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1497.0, + 610.0, + 1497.0, + 610.0, + 1506.0, + 599.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 1516.0, + 830.0, + 1516.0, + 830.0, + 1525.0, + 819.0, + 1525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 788.0, + 1519.0, + 802.0, + 1519.0, + 802.0, + 1534.0, + 788.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 1532.0, + 382.0, + 1532.0, + 382.0, + 1543.0, + 371.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1279.0, + 607.5, + 1285.0, + 607.5, + 1285.0, + 616.5, + 1279.0, + 616.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 974.5, + 1057.0, + 974.5, + 1057.0, + 983.5, + 1054.0, + 983.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.25, + 984.0, + 1218.25, + 984.0, + 1218.25, + 994.0, + 1214.25, + 994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 374.75, + 1048.0, + 382.75, + 1048.0, + 382.75, + 1062.0, + 374.75, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1294.0, + 1222.5, + 1320.0, + 1222.5, + 1320.0, + 1234.0, + 1294.0, + 1234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1634.0, + 1409.0, + 1634.0, + 1409.0, + 1672.0, + 295.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1667.0, + 1410.0, + 1667.0, + 1410.0, + 1704.0, + 294.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1696.0, + 960.0, + 1696.0, + 960.0, + 1732.0, + 294.0, + 1732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 221.0, + 628.0, + 221.0, + 628.0, + 268.0, + 293.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 293.0, + 1406.0, + 293.0, + 1406.0, + 332.0, + 292.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 325.0, + 1406.0, + 325.0, + 1406.0, + 361.0, + 293.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 356.0, + 1406.0, + 356.0, + 1406.0, + 391.0, + 292.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 385.0, + 1406.0, + 385.0, + 1406.0, + 422.0, + 292.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 416.0, + 1407.0, + 416.0, + 1407.0, + 456.0, + 292.0, + 456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 447.0, + 1338.0, + 447.0, + 1338.0, + 484.0, + 293.0, + 484.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 15, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 643, + 400, + 1055, + 400, + 1055, + 809, + 643, + 809 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 296, + 228, + 1407, + 228, + 1407, + 353, + 296, + 353 + ], + "score": 0.91 + }, + { + "category_id": 4, + "poly": [ + 295, + 850, + 1401, + 850, + 1401, + 913, + 295, + 913 + ], + "score": 0.884 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 858, + 75, + 858, + 105, + 298, + 105 + ], + "score": 0.853 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 863, + 2088, + 863, + 2112, + 835, + 2112 + ], + "score": 0.843 + }, + { + "category_id": 4, + "poly": [ + 296, + 228, + 1407, + 228, + 1407, + 353, + 296, + 353 + ], + "score": 0.134 + }, + { + "category_id": 15, + "poly": [ + 295.0, + 848.0, + 1403.0, + 848.0, + 1403.0, + 884.0, + 295.0, + 884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 880.0, + 1196.0, + 880.0, + 1196.0, + 916.0, + 295.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 228.0, + 1409.0, + 228.0, + 1409.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 259.0, + 1408.0, + 259.0, + 1408.0, + 296.0, + 293.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 292.0, + 1405.0, + 292.0, + 1405.0, + 328.0, + 293.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 319.0, + 442.0, + 319.0, + 442.0, + 359.0, + 293.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 228.0, + 1409.0, + 228.0, + 1409.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 259.0, + 1408.0, + 259.0, + 1408.0, + 296.0, + 293.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 292.0, + 1405.0, + 292.0, + 1405.0, + 328.0, + 293.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 319.0, + 442.0, + 319.0, + 442.0, + 359.0, + 293.0, + 359.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 16, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/SJlsFpVtDB/images/05a8d2508a65dba4aedb8dd6ee555dd7ff4cb5bbde5593f4707e301fab2264f5.jpg b/parse/train/SJlsFpVtDB/images/05a8d2508a65dba4aedb8dd6ee555dd7ff4cb5bbde5593f4707e301fab2264f5.jpg new file mode 100644 index 0000000000000000000000000000000000000000..849c9e3f9c72f7b489458f797e404d17bc928d7c --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/05a8d2508a65dba4aedb8dd6ee555dd7ff4cb5bbde5593f4707e301fab2264f5.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0b5f934a24f482ee64b4302f466babdce4f6cc789c6a0cc72cbd65b90b2ad8de +size 7778 diff --git a/parse/train/SJlsFpVtDB/images/0e60929912f8e4b53ba2350698f7dbe297b51a59201ab3369a674e7e652b2764.jpg b/parse/train/SJlsFpVtDB/images/0e60929912f8e4b53ba2350698f7dbe297b51a59201ab3369a674e7e652b2764.jpg new file mode 100644 index 0000000000000000000000000000000000000000..42d8da950305990fbb4c0652d0d93341fac20ced --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/0e60929912f8e4b53ba2350698f7dbe297b51a59201ab3369a674e7e652b2764.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5a6183ad7f400b7ca29999a572fe247a9eb7cd221a5491d5ad355cd76856d1e7 +size 71037 diff --git a/parse/train/SJlsFpVtDB/images/1b5c9436134045dde74e09174f525fa6fcb988c0eb09e0f8fd895029a900cf25.jpg b/parse/train/SJlsFpVtDB/images/1b5c9436134045dde74e09174f525fa6fcb988c0eb09e0f8fd895029a900cf25.jpg new file mode 100644 index 0000000000000000000000000000000000000000..bf9a3cf63ed9d24ef57610c565b7c0dbd6a3767a --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/1b5c9436134045dde74e09174f525fa6fcb988c0eb09e0f8fd895029a900cf25.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a964a58086160b88e8af418860d5dcb862e45890f8d41281c55fb495d3b11847 +size 5467 diff --git a/parse/train/SJlsFpVtDB/images/2166f626f497279ca80959ace1b6d893457c2a8f9b424d7305a90cdd96597eaf.jpg b/parse/train/SJlsFpVtDB/images/2166f626f497279ca80959ace1b6d893457c2a8f9b424d7305a90cdd96597eaf.jpg new file mode 100644 index 0000000000000000000000000000000000000000..e368c2f15d117e0adf24e85f259c7ca78df5f17c --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/2166f626f497279ca80959ace1b6d893457c2a8f9b424d7305a90cdd96597eaf.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ec697af87729271418d2e04a6a798c855e302e4aa577fc62552bc9346e00575a +size 1546 diff --git a/parse/train/SJlsFpVtDB/images/321afd8a2e00e2a83c3a8aef81ec470fb4eeb5a7a57cf69efe3b1e2a7f115f34.jpg b/parse/train/SJlsFpVtDB/images/321afd8a2e00e2a83c3a8aef81ec470fb4eeb5a7a57cf69efe3b1e2a7f115f34.jpg new file mode 100644 index 0000000000000000000000000000000000000000..0b9eb9481612fcecc8b1e92bbee617b6d01ad77a --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/321afd8a2e00e2a83c3a8aef81ec470fb4eeb5a7a57cf69efe3b1e2a7f115f34.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5fe04faebb2e5d62af0d44ea299e0ca11f71629b9f33bf40755fa00adbfe522b +size 4644 diff --git a/parse/train/SJlsFpVtDB/images/3851d9376b001911d2ac82ece3826a970c7afc274c0742aa36e0507be1acd7e2.jpg b/parse/train/SJlsFpVtDB/images/3851d9376b001911d2ac82ece3826a970c7afc274c0742aa36e0507be1acd7e2.jpg new file mode 100644 index 0000000000000000000000000000000000000000..26b129c8184cc943958453aacdd04529b362526f --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/3851d9376b001911d2ac82ece3826a970c7afc274c0742aa36e0507be1acd7e2.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b4a1a594f71eae9b50c3db209f000a99baaba3c94404fbc5922fae1261f16edb +size 8784 diff --git a/parse/train/SJlsFpVtDB/images/3991eddafcf058a96841583670fabb7db3adc75c7e3456774100cf0cd7a0a98a.jpg b/parse/train/SJlsFpVtDB/images/3991eddafcf058a96841583670fabb7db3adc75c7e3456774100cf0cd7a0a98a.jpg new file mode 100644 index 0000000000000000000000000000000000000000..aa02d7de6ae892d602656c9a65db30130b84b9b8 --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/3991eddafcf058a96841583670fabb7db3adc75c7e3456774100cf0cd7a0a98a.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:1470d41e314178da51dfe9e877e470ea9a90696bf46fdfde9e3102f17687ed68 +size 10404 diff --git a/parse/train/SJlsFpVtDB/images/54bf0799b3b7c4bf0cb672db29ddcfa5901a9fe4823c206eb48fd1c4f066c7ef.jpg b/parse/train/SJlsFpVtDB/images/54bf0799b3b7c4bf0cb672db29ddcfa5901a9fe4823c206eb48fd1c4f066c7ef.jpg new file mode 100644 index 0000000000000000000000000000000000000000..3de60fef7d0306737220b00867076fe3c82c3f49 --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/54bf0799b3b7c4bf0cb672db29ddcfa5901a9fe4823c206eb48fd1c4f066c7ef.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:faf830b49971057bd6db4a5961ec80490beaf06e07043eaa695823cd32e3f358 +size 12867 diff --git a/parse/train/SJlsFpVtDB/images/7ac8a8869d347b2a1f18eee57ead20647364df0d44a7e24c2adb5af90b32fe38.jpg b/parse/train/SJlsFpVtDB/images/7ac8a8869d347b2a1f18eee57ead20647364df0d44a7e24c2adb5af90b32fe38.jpg new file mode 100644 index 0000000000000000000000000000000000000000..fe39de0353b4ce7b570249b6b4e310266cdd0db5 --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/7ac8a8869d347b2a1f18eee57ead20647364df0d44a7e24c2adb5af90b32fe38.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a56abe6301c42f3e58209a18812107ec5331331115a96f0d33bdc8e959d2e449 +size 37626 diff --git a/parse/train/SJlsFpVtDB/images/83ece6fe4270d0b49338faf2cd3c779c477198e6e83059b6040d7def10bfd5ad.jpg b/parse/train/SJlsFpVtDB/images/83ece6fe4270d0b49338faf2cd3c779c477198e6e83059b6040d7def10bfd5ad.jpg new file mode 100644 index 0000000000000000000000000000000000000000..a58c737438beaa794c927bca2373ca576ca6df40 --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/83ece6fe4270d0b49338faf2cd3c779c477198e6e83059b6040d7def10bfd5ad.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:246871f50452de0eefaccd368e59b6df556a2e905e1015ea3b663ec4ff190740 +size 12650 diff --git a/parse/train/SJlsFpVtDB/images/87a79289460871d9e8c621d1634cacbd4eb3c8842301886919a270ba2954f40f.jpg b/parse/train/SJlsFpVtDB/images/87a79289460871d9e8c621d1634cacbd4eb3c8842301886919a270ba2954f40f.jpg new file mode 100644 index 0000000000000000000000000000000000000000..054fb3923b779a42084fbf8f8a6ebdf0630f74b9 --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/87a79289460871d9e8c621d1634cacbd4eb3c8842301886919a270ba2954f40f.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:41deaf3f9fcd68a64d2ccccc6b5ebd69e9e47bd38e717b4ce241f9a231504d6a +size 7081 diff --git a/parse/train/SJlsFpVtDB/images/8e5916bbd6c4b0f4ae9a5617a1fb965553e80516bba3da9f02d5f825e8944777.jpg b/parse/train/SJlsFpVtDB/images/8e5916bbd6c4b0f4ae9a5617a1fb965553e80516bba3da9f02d5f825e8944777.jpg new file mode 100644 index 0000000000000000000000000000000000000000..25a06ba1f90e449c7662f74d9bcd94203ecc3c34 --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/8e5916bbd6c4b0f4ae9a5617a1fb965553e80516bba3da9f02d5f825e8944777.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0521bb72d4eb7c276ed78920ad5fb8f112e49006db6d3116543be6636ed8934d +size 4482 diff --git a/parse/train/SJlsFpVtDB/images/9c4d45cbd9aaa6f8fe64abed45c5c5cdab1a1d08262cfe8acf733f2a04c23228.jpg b/parse/train/SJlsFpVtDB/images/9c4d45cbd9aaa6f8fe64abed45c5c5cdab1a1d08262cfe8acf733f2a04c23228.jpg new file mode 100644 index 0000000000000000000000000000000000000000..262ae32c1d6fc0cfdf4f6c3733d130004cf80e3e --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/9c4d45cbd9aaa6f8fe64abed45c5c5cdab1a1d08262cfe8acf733f2a04c23228.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b09ee6d539f275f5f22dc1e7c09781ce249bd584bc6bb43af1489726f2854474 +size 130517 diff --git a/parse/train/SJlsFpVtDB/images/a53b0f4989baaef433e6befc7a10b56d12f22077d482b21a5a336926223030ee.jpg b/parse/train/SJlsFpVtDB/images/a53b0f4989baaef433e6befc7a10b56d12f22077d482b21a5a336926223030ee.jpg new file mode 100644 index 0000000000000000000000000000000000000000..532cdcfb836b28271cfa2be2690bd6700dc3837d --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/a53b0f4989baaef433e6befc7a10b56d12f22077d482b21a5a336926223030ee.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0144a065b5ad7d3dbcc13798e3a93d905d550c2939d991b8b97b787b518c52b1 +size 8387 diff --git a/parse/train/SJlsFpVtDB/images/bb5b6b6a4780f9535d032738522b7719b5dbf0411705bac628ceca7375b99c31.jpg b/parse/train/SJlsFpVtDB/images/bb5b6b6a4780f9535d032738522b7719b5dbf0411705bac628ceca7375b99c31.jpg new file mode 100644 index 0000000000000000000000000000000000000000..635d649b3441426139c6ad6a8299a247061cbc02 --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/bb5b6b6a4780f9535d032738522b7719b5dbf0411705bac628ceca7375b99c31.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0176425919693a35b26dbf995e6c7e618577c24a695924d0b45932533e705979 +size 8094 diff --git a/parse/train/SJlsFpVtDB/images/c3fcdbb665928aec70a5ba2b91ef0d3b42dcca121113f22c70414aa231ede0ac.jpg b/parse/train/SJlsFpVtDB/images/c3fcdbb665928aec70a5ba2b91ef0d3b42dcca121113f22c70414aa231ede0ac.jpg new file mode 100644 index 0000000000000000000000000000000000000000..ea0d435c310814eae98964bde9d4310563749106 --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/c3fcdbb665928aec70a5ba2b91ef0d3b42dcca121113f22c70414aa231ede0ac.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6eacffba71e376b31f86a89657ff959f84590ec35e11d711718fb61fe999a1a2 +size 54741 diff --git a/parse/train/SJlsFpVtDB/images/cb5c59be7e80e520c278ed27fe9309b1981e7efa3fedee8c970f3139861a03ea.jpg b/parse/train/SJlsFpVtDB/images/cb5c59be7e80e520c278ed27fe9309b1981e7efa3fedee8c970f3139861a03ea.jpg new file mode 100644 index 0000000000000000000000000000000000000000..7bb8f585a1bc7cc32958b0dd575d2e2e5fd814b6 --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/cb5c59be7e80e520c278ed27fe9309b1981e7efa3fedee8c970f3139861a03ea.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2522a4d277500b2f2c3c7dbe72b9fd051db75d60b457a0348760340df956d9e9 +size 47911 diff --git a/parse/train/SJlsFpVtDB/images/ce838126e6fccd5e02163c02122688bfc12a15ad65c5a71ddfb4802bc2a98e78.jpg b/parse/train/SJlsFpVtDB/images/ce838126e6fccd5e02163c02122688bfc12a15ad65c5a71ddfb4802bc2a98e78.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f0cd78e640c187e5ab0d225e9a2c8d09a409e25a --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/ce838126e6fccd5e02163c02122688bfc12a15ad65c5a71ddfb4802bc2a98e78.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b79699beb81bc48099190c3b4e11933334cab2104cf1277bd14b3ea09cc123cb +size 7340 diff --git a/parse/train/SJlsFpVtDB/images/eca31297e6364e230bf6bbb30a915c589eaafb475f9572237303b97f4e0e0182.jpg b/parse/train/SJlsFpVtDB/images/eca31297e6364e230bf6bbb30a915c589eaafb475f9572237303b97f4e0e0182.jpg new file mode 100644 index 0000000000000000000000000000000000000000..ef76c506500181d780cc401b59629a467d7aef60 --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/eca31297e6364e230bf6bbb30a915c589eaafb475f9572237303b97f4e0e0182.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:fe065cd2cc4e5133486d24d451e966592e38e1f32affeb7e31fca0c1b996ef32 +size 44067 diff --git a/parse/train/SJlsFpVtDB/images/f27ac3e05b4cf16358546cd89544f867bdfce384962773ca3de1f8bb4118f6ed.jpg b/parse/train/SJlsFpVtDB/images/f27ac3e05b4cf16358546cd89544f867bdfce384962773ca3de1f8bb4118f6ed.jpg new file mode 100644 index 0000000000000000000000000000000000000000..7c308a0eacfc1016d137a20fc69d04d6c75872b2 --- /dev/null +++ b/parse/train/SJlsFpVtDB/images/f27ac3e05b4cf16358546cd89544f867bdfce384962773ca3de1f8bb4118f6ed.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2546978b08fc376d97ad5ac4b1e0dad5ca301179c68fd08c49b1ff04d7198b7a +size 11455 diff --git a/parse/train/SyfiiMZA-/SyfiiMZA-.md b/parse/train/SyfiiMZA-/SyfiiMZA-.md new file mode 100644 index 0000000000000000000000000000000000000000..43a7243faeef9486e6b79e77f8a5390b584a212e --- /dev/null +++ b/parse/train/SyfiiMZA-/SyfiiMZA-.md @@ -0,0 +1,225 @@ +# JOINTLY LEARNING TO CONSTRUCT AND CONTROL AGENTS USING DEEP REINFORCEMENT LEARNING + +Anonymous authors Paper under double-blind review + +# ABSTRACT + +The physical design of a robot and the policy that controls its motion are inherently coupled. However, existing approaches largely ignore this coupling, instead choosing to alternate between separate design and control phases, which requires expert intuition throughout and risks convergence to suboptimal designs. In this work, we propose a method that jointly optimizes over the physical design of a robot and the corresponding control policy in a model-free fashion, without any need for expert supervision. Given an arbitrary robot morphology, our method maintains a distribution over the design parameters and uses reinforcement learning to train a neural network controller. Throughout training, we refine the robot distribution to maximize the expected reward. This results in an assignment to the robot parameters and neural network policy that are jointly optimal. We evaluate our approach in the context of legged locomotion, and demonstrate that it discovers novel robot designs and walking gaits for several different morphologies, achieving performance comparable to or better than that of hand-crafted designs. + +# 1 INTRODUCTION + +An agent’s ability to navigate through and interact with its environment depends not just on its skill at planning and controlling its motion, but also on its physical design. Different physical designs are inherently better suited to different tasks and environments. By making appropriate choices during fabrication, mechanical elements can be designed to improve robustness to non-idealities such as errors in perception, delays in actuation, etc., and indeed, make control problem an easier one to solve. At the same time, robots that take different forms may find completely different control strategies to be optimal to complete the same task. Therefore, the physical and computational design of an agent are inherently coupled, and must ideally be jointly optimized if the robot is to successfully complete a task in a particular environment. + +Consider the development of a legged robot for locomotion. Variations in physical design will require changes to the joint torques in order to preserve a particular locomotion behavior (e.g., a heavier torso requires greater torque at the ankle), and will likely result in completely different walking gaits, even when the morphology is preserved. In fact, some changes to design may render locomotion impossible for the target operating environment (e.g., a robot with long feet may be unable to locomote up an incline). Meanwhile, careful choice of bipedal design enables passive walking (McGeer, 1990; Goswami et al., 1998; Collins et al., 2001). It is therefore beneficial to not simply consider the robot’s design or gait to be fixed, but to optimize both jointly for the target environment and task. Similar co-design can be beneficial in other settings—for example for the control policy and physical characteristics of digits in robotic grippers for grasping. + +While a robot’s physical design and the corresponding control policy are inherently coupled, most existing methods ignore this coupling, instead choosing to alternate between separate design and control phases. Existing approaches that jointly reason over design and control (Digumarti et al., 2014; Ha et al., 2017; Spielberg et al., 2017) assume knowledge of an accurate model of the robot dynamics and require expert supervision (e.g., to provide a suitable initial design and guide the optimization process). However, these restrictive assumptions limits their applicability to a handful of specific settings, and often yield solutions heavily influenced by expert intuition. + +In this work, we seek a general approach—one that can optimize a robot’s physical characteristics jointly with controllers of a desired complexity (Fig. 1), that can be applied to general tasks in some given environment, and that can explore the joint search space of physical design and computational control in a purely data-driven way, without a model of the robot dynamics and independent of the biases of expert intuition. We develop this approach in the context of determining the physical parameters of an articulated agent—the lengths and thicknesses of each limbs in a given morphology— through joint training with a neural network for control, with the objective of achieving locomotion. Our method maintains a distribution over these physical parameters, and simultaneously trains the parameters of this distribution with those of a neural network controller, using deep reinforcement learning. In this way, we pursue a design distribution and control policy that are jointly optimal for the given task and environment. Experimental results show that starting from random initializations, our approach is able to find novel designs and walking gaits that match or exceed the performance of manually designed agents. To the best of our knowledge, our method is the first to successfully carry out such a joint optimization of design and control in a completely model-free manner. + +![](images/601586609236628de9cee35fd71c942e14a74590dd246e90589f10ecbea5ea80.jpg) +Figure 1: Our algorithm learns a robot’s physical design jointly with the control policy. Here we show the learned designs evolving over time for the Hopper (top left), the Walker2d (top right) and the Ant (bottom), each with the default Roboschool design for comparison. Scale is fixed for each robot. Note that these designs correspond to modes of the distribution over robot designs that our algorithm maintains during training. + +# 2 RELATED WORK + +Attention has been paid recently to the problem of jointly optimizing the parameters that specify a robot’s design and motion (e.g., gaits) or control. Early work in this area takes an evolutionary approach to optimizing a robot’s design and controller, typically parameterized as a neural network, for virtual agents (Sims, 1994; Paul & Bongard, 2001; Agrawal et al., 2013) and physical robots (Lipson & Pollack, 2000; Bongard, 2011). Particularly relevant to our approach is the work of Ha et al. (2017), who relate design and motion parameters via a set of implicit functions that express robot dynamics, desired trajectories, and actuation limits. These functions encode a manifold that is then linearized to model the relationship between design and motion via the implicit function theorem. The method then solves for the desired parameters in a local fashion via constraint-based optimization. Similarly, Spielberg et al. (2017) describe an approach that jointly reasons over physical design and motion parameters for robots with articulated degrees of freedom (e.g., legged robots). They formulate the problem in the framework of trajectory optimization by incorporating parameters involved in the design of articulated robots, including dimensions, masses, mass distribution, and moments of inertia, together with the contact force and torque variables typically associated with trajectory optimization. They use weighted actuation cost as the objective, subject to a regularization penalty on parameters. Their method is guaranteed to find a feasible design so long as the problem is initialized within a small neighborhood of a feasible solution. Unlike our approach, their method requires that the user provide an estimate of the robot configuration at each time step, as well as an accurate analytic model of constraint dynamics (e.g., foot contact), which is computationally expensive to enforce. Geijtenbeek et al. (2013) propose a derivative-free strategy that optimizes over muscle routing and muscle-based control for simulated bipeds to realize a design that incorporates biomechanical constraints. Meanwhile, Digumarti et al. (2014) describe an evolutionary method that jointly reasons over design and motion parameters for legged robots, while also tuning the parameters of a robust controller that tracks these motions. Their method is limited to biologically inspired quadrupedal foothold patterns, and does not account for contact dynamics. In contrast, our approach applies to arbitrary morphologies and does not require that we model contact dynamics. + +While the focus on simultaneous optimization over robot design and motion parameters is relatively new, there is a long history of research focused on the related problem of co-design of physical structure and control (Reyer & Papalambros, 2002; Ravichandran et al., 2006). Park & Asada (1994) jointly optimize the link geometry of a high-speed robot arm along with the parameters of a PD joint controller. These methods often rely upon access to an accurate model of the robot dynamics in order to design the controller. In order to reduce the dependence upon a detailed analytical model, Pil & Asada (1996) use on-robot experiments to refine their model as part of the iterative design process. More recently, Villarreal-Cervantes et al. (2013) allow for some degree of uncertainty in the model by including the sensitivity of the design and control parameters to model uncertainty along with the task-specific optimization objectives. However, existing methods still rely upon access to an analytical model of the robot dynamics and are typically limited to simple (e.g., linear) control designs. Our method assumes only that the controller can be modeled via a convolutional neural network, and can thereby learn complex, highly nonlinear control policies with no a priori knowledge of the robot dynamics. + +Far more attention has been paid to the individual problem of task-driven optimization of robot motion and control. Given an arbitrary robot design chosen by novice users, Megaro et al. (2015) describe an interactive design framework that solves for a realizable walking gait that results in stable locomotion. Similarly, Mordatch et al. (2012) synthesize emergent behaviors (motion) for arbitrary morphologies and tasks from high-level specifications, by jointly optimizing over contact and motion. Mordatch et al. (2015) build upon this work by training recurrent neural networks to serve as feedback controllers capable of producing complex, stable behaviors for a variety of dynamical systems. Their method interleaves supervised learning with trajectory optimization, and incorporates noise to improve generalizability. Meanwhile, there is a large body of literature that formulates motion synthesis as a trajectory optimization problem. This approach has proven effective at respecting contact constraints (e.g., between the foot and ground), which make controlling dynamic motion particularly challenging (Dai & Tedrake, 2016; Posa et al., 2016; Griffin & Grizzle, 2016). These approaches have been shown to generate sophisticated behaviors for complex robot designs (e.g., humanoids) (Tassa et al., 2012), and for robots of arbitrary morphologies using only a high-level specification of the robot’s shape, gait, and task (Wampler et al., 2013). Related, a number of methods interleave trajectory optimization and supervised learning with neural network regression (Levine & Abbeel, 2014; Levine & Koltun, 2014; Mordatch & Todorov, 2014; Mordatch et al., 2015). Unlike our method, the use of trajectory optimization makes these approaches reliant upon knowledge of the model. + +A great deal of attention of-late has focused on the problem of learning complex control policies directly from low-level sensory input, without any knowledge of the system dynamics. Methods that have proven particularly effective combine neural networks that learn representations of the highdimensional raw sensor input with deep reinforcement learning (Riedmiller, 2005; Mnih et al., 2013; 2015; Schulman et al., 2015a). While much of the work in this area focuses on low-dimensional, discrete action spaces, several methods have been recently proposed that learn continuous control policies through deep reinforcement learning. These techniques have been applied to control simple, simulated robots (Wawrzynski, 2009; Wawrzy ´ nski & Tanwani, 2013; Watter et al., 2015; Lillicrap ´ et al., 2015), perform robot manipulation (Levine et al., 2016a;b; Gu et al., 2017), and control legged robots (Schulman et al., 2015b; Peng et al., 2016). + +Black-box optimization (Schmidhuber et al., 2007; Risi & Togelius, 2017) is an alternative to using reinforcement learning to training the control policy. These approaches have the advantage that they do not involve backpropagating gradients, are insensitive to reward sparsity, and can handle long time horizons. While black-box optimization strategies have traditionally been thought of as illsuited to difficult reinforcement learning problems, Salimans et al. (2017) recently showed that they perform similarly to state-of-the-art RL methods on difficult continuous control problems, including those that involve locomotion. Closely related is the policy-gradient method of Sehnke et al. (2010), who define the policy as a distribution over the parameters of a controller, which they then sample over. This results in gradient estimates that are far less noisy than is typical of policy gradient algorithms. These approaches are similar to the way in which we learn the robot design, which we formulate as a Gaussian mixture model over design parameters. Indeed, the two referenced methods yield the same gradient estimate for Gaussian parameter distributions (Salimans et al., 2017). + +Meanwhile, much work has focused on the problem of determining robot designs that meet the requirements of a particular task. Given a user demonstration of the desired behaviors, Coros et al. (2013) learn optimum kinematic linkages that are capable of reproducing these motions. Mehta et al. (2014) synthesize electromechanical robot designs in a compositional fashion based upon a complete user-specified structural specification of the robot. Mehta et al. (2016) build upon this work, allowing the user to specify functional objectives via structured English, which is parsed to a formal specification using linear temporal logic. Censi (2017) describes a theory for co-design that includes the ability to select discrete robot parts according to functional constraints, but do not reason over geometry or motion. + +Related to our approach is recent work that jointly optimizes sensor design and inference algorithms for perception systems. Chakrabarti (2016) considers the problem of jointly learning a camera sensor’s multiplexing pattern along with reconstruction methods for imaging tasks. They model inference as a neural network together and use stochastic gradient descent to backpropagate the loss to a neural layer representation of the multiplexing pattern. Related, Schaff et al. (2017) jointly learn design and inference for beacon-based localization. They encode beacon allocation (spatially and across transmission channels) as a differential neural layer that interfaces with a neural network for inference. Joint optimization then follows from standard techniques for training neural networks. + +# 3 APPROACH + +In this section, we begin by describing the standard reinforcement learning framework for training agent policies, and then describe how we extend this to also learn the physical design of the agent. + +# 3.1 REINFORCEMENT LEARNING BACKGROUND + +In the standard reinforcement learning setting, an agent interacts with its environment, usually a Markov Decision Process, over a number of discrete timesteps. At each time step $t$ , the agent receives a state $s _ { t } \in S$ and takes action $a _ { t } \in { \mathcal { A } }$ according to a policy $\pi : { \mathcal { S } } A$ . Then, the agent receives a scalar reward $r _ { t }$ and the next state $s _ { t + 1 }$ from the environment. This process continues until a terminal state is reached. The goal of reinforcement learning is to then find a policy $\pi ^ { * }$ that maximizes the expected return $\mathbb { E } [ \mathcal { R } _ { t } ]$ , where $\begin{array} { r } { \mathcal { R } _ { t } = \sum _ { i = 0 } ^ { \infty } \gamma ^ { i } r _ { t + i } } \end{array}$ and $\gamma \in [ 0 , 1 )$ is a discount factor. + +Policy gradient methods are a class of algorithms often used to optimize reinforcement learning problems, due to their ability to optimize cumulative reward and the ease with which the can be used with neural networks and other nonlinear function approximators. Consequently, they are commonly used for reinforcement learning problems that involve complex, continuous action spaces. Policy gradient methods directly parameterize a stochastic policy $\bar { \pi _ { \boldsymbol { \theta } } } ( a _ { t } | \boldsymbol { s } _ { t } )$ and perform stochastic gradient ascent on the expected return. “Vanilla” policy gradient methods compute an estimate of the gradient $\nabla _ { \boldsymbol { \theta } } \mathbb { E } [ \mathcal { R } _ { t } ]$ using a sample-based mean computed over $\nabla _ { \theta } \log \pi _ { \theta } ( \bar { a _ { t } } \vert s _ { t } ) \mathcal { R } _ { t }$ (Williams, 1992), which yields an unbiased gradient estimate (Sutton et al., 2000). While the variance in the resulting estimate decreases with the number of samples, sampling is computationally expensive. Another way to reduce variance while maintaining an unbiased estimate is to estimate the gradient by comparing the reward to a “baseline” reward $b ( s _ { t } )$ . + +These methods are effective but can be unstable, especially when used for deep reinforcement learning. Small changes to the policy parameters may cause large changes in the distribution of visited states. Several methods have been proposed to mitigate these effects. Among them, Schulman et al. (2015a) introduce Trust Region Policy Optimization (TRPO), which imposes a constraint on the KLdivergence between policies before and after an update. Recently, Schulman et al. (2017) proposed proximal policy optimization (PPO), a first-order class of methods similar to TRPO. PPO alternates between sampling data through interaction with the environment and optimizing the objective + +$$ +\hat { \mathbb { E } } _ { t } \left[ \operatorname* { m i n } ( r _ { t } ( \theta ) \hat { A } _ { t } , \operatorname { c l i p } ( r _ { t } ( \theta ) , 1 - \epsilon , 1 + \epsilon ) ) \right] , +$$ + +where $\begin{array} { r } { r _ { t } ( \theta ) = \frac { \pi _ { \theta } ( a _ { t } | s _ { t } ) } { \pi _ { \theta _ { \mathrm { o l d } } } ( a _ { t } | s _ { t } ) } } \end{array}$ and $\hat { \mathbb { E } } _ { t }$ represents an empirical average over a finite sample set. This objective seeks to maximize the expected return while encouraging a small step in policy space. The clipping within the objective removes any incentive for moving $r _ { t } ( \theta )$ outside the interval $[ 1 - \epsilon , 1 + \epsilon ]$ . The net effect of this objective is a simple, robust policy gradient algorithm that attains or matches state-of-the-art results on a wide array of tasks (Schulman et al., 2017). + +
Algorithm1Joint Optimization
Initialize πθ(a|s,r),PΦ(r)
while True do
for i ∈[1..np] do
Sample ri,.., rn from pΦ
Collect rollouts with each design
Update 0 to maximize PPO's surrogate objective. end for
for i∈[1..nr] do
Sample ri,.*, rm from pΦ
Compute returns R1,., Rm·
Update to maximize PPO's surrogate objective.
end for
end while
+ +# 3.2 JOINT OPTIMIZATION OF DESIGN AND CONTROL + +We extend the standard reinforcement learning formulation by considering the space of possible robot designs $\Omega$ . Specifically, we assume that for every design $\mathcal { E } \in \Omega$ , we can define common state and action spaces $s$ and $\mathcal { A }$ , reward function $r ( s , a )$ , and initial state distribution $p _ { 0 } ( s )$ , that are meaningful to all designs. The designs differ only in the transition dynamics they induce $p \varepsilon ( s ^ { \prime } | s , a )$ and share a common action space $A$ —to achieve this, we assume a common morphology for all possible designs. + +Our goal then is to find the optimal design $\mathcal { E } ^ { * }$ and policy $\pi _ { \mathcal { E } ^ { * } } ^ { * }$ pair that maximizes the expected value of a given reward function. However, this is a non-linear, non-convex optimization problem over the spaces of all possible designs and all possible policies. Solving it exactly would require enumerating all possible designs (possibly through discretization of the design space), learning policies for each, and comparing the resulting expected rewards. This is computationally infeasible for all but the simplest of cases. Instead, we develop a gradient-based approach to solving this optimization problem with the following key components: (1) we maintain a multi-modal distribution over the space of physical designs and update this distribution using policy gradient methods in parameter space, similar to Sehnke et al. (2010) and Salimans et al. (2017); and (2) we train a single controller to act on all sampled designs during training, providing this controller with the design parameters of the specific sample it is controlling. We find that the multi-modal stochastic parameterization of the design space allows our method to explore the space more thoroughly (where a uni-modal Gaussian distribution would frequently get trapped in local minima). Moreover, a common controller makes optimization tractable, allowing efficient evaluation of unseen designs. We additionally benefit from learning common strategies across diverse designs, while still adapting different policies to different parts of the design space given the sample parameters as input. Together, these components enable efficient joint exploration of the design and policy spaces. + +Formally, let $p ( r ; \phi )$ denote the distribution over designs, and $\pi ( a _ { t } | s _ { t } , r ; \theta )$ a stochastic control policy parameterized by $\phi$ and $\theta$ respectively. In our experiments, we use a neural network to model the control policy $\pi$ , and a Gaussian mixture model as the parametric form of the distribution $p ( r ; \phi )$ . Our goal is then to solve the following optimization problem: + +$$ +\phi ^ { * } , \theta ^ { * } = \underset { \phi , \theta } { \arg \operatorname* { m a x } } \mathbb { E } _ { r , t } \left[ \mathcal { R } _ { t } \right] , +$$ + +where $\mathbb { E } _ { \boldsymbol { r } , t } [ \cdot ]$ is the expectation over robots and trajectories those robots induce. + +We use stochastic gradient-based updates to optimize Eqn. 2. Our method (Algorithm 3.2) alternates between updating the parameters of the policy and design distributions, $\theta$ and $\phi$ , respectively. We empirically find this to yield convergence to better solutions in a reasonable number of iterations compared to performing simultaneous updates. We optimize the policy parameters $\theta$ using Proximal Policy Optimization. However, instead of collecting data from a single design, we sample a design $r$ after a fixed number $T$ of timesteps according to the distribution $p ( r ; \phi )$ . After $n$ iterations of PPO, we freeze the policy parameters and proceed to optimize the parameters of the design distribution. Without knowledge of the model, we optimize the design parameters $\phi$ via policy gradient over parameter space, similar to Sehnke et al. (2010). This is equivalent to black-box optimization methods that have proven effective for complex learning problems (Salimans et al., 2017). We sample $m$ different designs and compute their returns for a single episode acting under policy $\pi ( \cdot ; \theta )$ . We then use this data to shift the design distribution $p ( \cdot ; \phi )$ in a direction maximizing expected return. These iterations are repeated until convergence. + +![](images/0babea94ff71820dd39bdf9c33c7081a0ac16e1f9df8bc584653a1c4ea8568a5.jpg) +Figure 2: From left to right: the default Hopper, Walker2d, and Ant robots. The Hopper and Walker2d are constrained to walk in a line, while the Ant can walk anywhere in the plane. + +# 4 RESULTS + +We validate our approach with three commonly used robots provided in OpenAI’s Roboschool (Schulman et al., 2017). Environments in Roboschool are built on top of Bullet Physics, a popular open-source physics engine. In a series of locomotion experiments, we show that our approach not only discovers novel robot designs and gaits, but also outperforms two out of three of the hand-designed robots trained on the same task and yields performance comparable to the third. + +# 4.1 EXPERIMENT DETAILS + +We evaluate our approach on three legged locomotion tasks within Roboschool: RoboschoolHopper, RoboschoolWalker2d, and RoboschoolAnt (note that we subsequently drop the Roboschool prefix for brevity). Figure 2 depicts the default Roboschool design for each robot. These environments describe a locomotion task that has the robots moving along the positive $\mathbf { X }$ -axis (to the right in the figures) towards a distant goal. The reward function defined in these environments is a weighted sum of rewards for forward progress and staying upright, and penalties for applying torques and for joints that reach their rotational limits. The episode ends when the robot falls over or reaches a maximum number of timesteps. + +We learn robot designs using the morphologies specified by the standard Roboschool designs. For each morphology, we parameterize the robot in terms of the length and radius (e.g., mass) of each link (or just the radius in the case of the sphere for the ant body). We impose symmetry, and share parameters across each leg for the Walker2d and Ant designs. This parameterization permits a wide variety of robots of different shapes and sizes, some of which are better suited to the locomotion objective than others, and some designs that do not permit a control policy that results in locomotion. + +We model the control policy $\pi ( a _ { t } | s _ { t } , \mathcal { E } ; \theta _ { p } )$ as a feed forward neural network consisting of three fully-connected layers with 64 units and tanh activation functions. A final layer maps the output to the robot action space. With the exception of the last robot-specific layer, the architecture is the same for all experiments. Meanwhile, we represent the distribution over the parameterized robot design $p ( \cdot ; \theta _ { r } )$ using a Gaussian mixture model with four mixture components (each with a diagonal covariance matrix over the different parameters). We initialize the means of each component randomly within a wide range, and initialize the variances in order to span the range of each parameter. We find that our approach maintains high variance distributions during early iterations—thereby continuing exploration of the design space—before committing to a chosen design. The appendix provides further details regardng the evolution of these distributions. + +![](images/87d05764a68b4483dd235162ccd22ce42ae5244a22dfc99728015163faafa544.jpg) +Figure 3: Training curves that show the evolution of reward across training iterations for the Hopper, Walker2d, and Ant environments over eight different random seeds. The black dashed line corresponds to the highest achievable performance of the corresponding baseline robot. In other figures, we display the best-performing checkpoint of each run. Therefore, we make each training curve transparent after it stops improving. + +We train our method with eight threads of Proximal Policy Optimization for a total of 300M environment timesteps across all threads. We use the publicly available implementation of PPO provided in OpenAI Baselines (Hesse et al., 2017). We alternate between 50 policy PPO iterations and 2 design iterations, finding this ratio to yield convergence to good solutions. We set this and the other hyper-parameters on the Hopper and used the same settings for all experiments. + +# 4.2 EXPERIMENTS + +We evaluate the performance of our approach to joint optimization over robot design and control on the Hopper, Walker2d, and Ant robots, and compare against a policy trained for the standard Roboschool design. We evaluate the consistency and robustness of our approach relative to the initial robot parameter distribution using several different random seeds. For each robot morphology, we find that our method learns robot designs and the corresponding control policy that are either comparable (Walker2d) or exceed the performance (Hopper and Ant) achievable using the default designs (Fig. 3). We also see that our method achieves these levels of performance by discovering unique robot designs (Fig. 1) together with novel walking gaits (Fig. 4) that can not be achieved with the default designs. Note that our method was able to learn these designs and control policies from a random initialization, without access to a dynamics model or any expert supervision. + +Our method learns a joint design and controller for the Hopper that outperforms the baseline by as much as $5 0 \%$ . Our learned robot exploits the small size of the foot to achieve faster, more precise walking gaits. Meanwhile, the longer torso of the learned robot improves stability, allowing it to maintain balance while locomoting at a faster pace. We found this behavior to be consistent across several different Hopper experiments, with the method converging to designs with a small foot and long, thin torso. In the appendix, we explore the stability of this design with respect to variations in the environment using the coefficient of friction as an example, and find the improvement to be consistent. For the ant, our optimization yields a physical design that is significantly different from the default design (Fig. 2). Consequently, the learned Ant drastically outperforms the baseline, improving reward by up to $1 1 6 \%$ . Our method learns a design with a small, lightweight body and extremely long legs. The long legs enable the ant to apply large torque at contact, allowing it to move at a fast pace. + +Our framework learned different design-control pairs for the Walker2d that perform similarly to the default design. Across several different experiments, we see two distinct, successful designs and walking gaits. Interestingly, neither agent walks primarily on its feet. The first design has small, thick legs and long feet. The controller is then able to exploit the thick middle leg link, which protrudes slightly past the foot, to push off the ground. The long foot then provides additional balance. The second design is similar in geometry to the baseline Walker2d, but moves in a very different way. By lowering the knee joint and lengthening the foot, the Walker2d is able to efficiently balance on its knees and toes. This low stance allows the Walker2d to fully extend its leg backwards, creating a long, powerful stride, similar to that of a sprinter using starting blocks. + +![](images/97b6ba644983f0da7af6c1a0a705d198e90586ea3304b1179bfe57ed0dfdfbc5.jpg) +Figure 4: Here, we compare locomotion of default and learned robots, visualizing both their physical design and corresponding learned gaits. We pick the best results for Hopper and Ant, and two of the best results for Walker2d (due to diversity in gaits). Note that for each robot type, we show a blend of a fixed number of frames in the same time interval, allowing direct comparison between the speed with which different designs are able to locomote. + +# 5 CONCLUSION + +We proposed what is, to the best of our knowledge, the first model-free algorithm that jointly optimizes over the physical design of a robot and the corresponding control policy, without any need for expert supervision. Given an arbitrary morphology, our robot maintains a distribution over the robot design parameters and learns these parameters together with a neural network controller using policy gradient-based reinforcement learning. This results in an assignment to the policy over robot parameters and the control policy that are jointly optimal. We evaluated our approach on a series of different legged robot morphologies, demonstrating that it results in novel robot designs and walking gaits, achieving performance that either matches or exceeds that of manually defined designs. + +Our findings suggest several avenues for future work. The most direct is extending the current approach to find optimized designs for uneven terrain, the presence of obstacles, changes in slope, variations in friction, etc. We are also interested in extending our framework to relax the assumption that the morphology is pre-defined. Finally, we are investigating applications to different types of agents and design spaces beyond legged robots (e.g., end-effectors), and exploring appropriate stochastic parameterization for such designs. + +# REFERENCES + +Shailen Agrawal, Shuo Shen, and Michiel van de Panne. Diverse motion variations for physicsbased character animation. In Proc. ACM SIGGRAPH/Eurographics Symposium on Computer Animation, pp. 37–44, 2013. + +Josh Bongard. Morphological change in machines accelerates the evolution of robust behavior. Proc. National Academy of Sciences, 108(4):1234–1239, 2011. + +Andrea Censi. A class of co-design problems with cyclic constraints and their solution. Robotics and Automation Letters, 2(1):96–103, 2017. + +Ayan Chakrabarti. Learning sensor multiplexing design through backpropagation. In Advances in Neural Information Processing Systems (NIPS), December 2016. + +Steven H Collins, Martijn Wisse, and Andy Ruina. A three-dimensional passive-dynamic walking robot with two legs and knees. Int’l J. of Robotics Research, 20(7):607–615, 2001. + +Stelian Coros, Bernhard Thomaszewski, Gioacchino Noris, Shinjiro Sueda, Moira Forberg, Robert W. Sumner, Wojciech Matusik, and Bernd Bickel. Computational design of mechanical characters. Trans. on Graphics, 32(4):83, 2013. + +Hongkai Dai and Russ Tedrake. Planning robust walking motion on uneven terrain via convex optimization. In Proc. Int’l Conf. on Humanoid Robots (Humanoids), 2016. + +Krishnamanaswi M. Digumarti, Christian Gehring, Stelian Coros, J. Hwangbo, and R. Siegwart. Concurrent optimization of mechanical design and locomotion control of a legged robot. In Proc. IEEE Int’l Conf. on Robotics and Automation (ICRA), July 2014. + +Thomas Geijtenbeek, Michiel van de Panne, and A. Frank van der Stappen. Flexible muscle-based locomotion for bipedal creatures. Trans. on Graphics, 32(6):206, 2013. + +Ambarish Goswami, Benoit Thuilot, and Bernard Espiau. A study of the passive gait of a compasslike biped robot: Symmetry and chaos. Int’l J. of Robotics Research, 17(12):1282–1301, 1998. + +Brent Griffin and Jessy Grizzle. Nonholonomic virtual constraints and gait optimization for robust walking control. Int’l J. of Robotics Research, pp. 895–922, 2016. + +Shixiang Gu, Ethan Holly, Timothy Lillicrap, and Sergey Levine. Deep reinforcement learning for robotic manipulation with asynchronous off-policy updates. In Proc. IEEE Int’l Conf. on Robotics and Automation (ICRA), 2017. + +Sehoon Ha, Stelian Coros, Alexander Alspach, Joohyung Kim, and Katsu Yamane. Joint optimization of robot design and motion parameters using the implicit function theorem. In Proc. Robotics: Science and Systems (RSS), June 2017. + +Christopher Hesse, Matthias Plappert, Alec Radford, John Schulman, Szymon Sidor, and Yuhuai Wu. OpenAI baselines. https://github.com/openai/baselines, 2017. + +Sergey Levine and Pieter Abbeel. Learning neural network policies with guided policy search under unknown dynamics. In Advances in Neural Information Processing Systems (NIPS), 2014. + +Sergey Levine and Vladlen Koltun. Learning complex neural network policies with trajectory optimization. In Proc. Int’l Conf. on Machine Learning (ICML), 2014. + +Sergey Levine, Chelsea Finn, Trevor Darrell, and Pieter Abbeel. End-to-end training of deep visuomotor policies. J. Machine Learning Research, 17(39):1–40, 2016a. + +Sergey Levine, Peter Pastor, Alex Krizhevsky, Julian Ibarz, and Deirdre Quillen. Learning hand-eye coordination for robotic grasping with deep learning and large-scale data collection. Int’l J. of Robotics Research, 2016b. + +Timothy P. Lillicrap, Jonathan J. Hunt, Alexander Pritzel, Nicolas Heess, Tom Erez, Yuval Tassa, David Silver, and Daan Wierstra. Continuous control with deep reinforcement learning. arXiv preprint arXiv:1509.02971, 2015. + +Hod Lipson and Jordan B. Pollack. Automatic design and manufacture of robotic lifeforms. Nature, 406(6799):974–978, 2000. + +Tad McGeer. Passive dynamic walking. Int’l J. of Robotics Research, 9(2):62–82, 1990. + +Vittorio Megaro, Bernhard Thomaszewski, Maurizio Nitti, Otmar Hilliges, Markus Gross, and Stelian Coros. Interactive design of 3d-printable robotic creatures. Trans. on Graphics, 34(6): 216, 2015. + +Ankur M. Mehta, Joseph DelPreto, Benjamin Shaya, and Daniela Rus. Cogeneration of mechanical, electrical, and software designs for printable robots from structural specifications. In Proc. IEEE/RSJ Int’l Conf. on Intelligent Robots and Systems (IROS), 2014. + +Ankur M. Mehta, Joseph DelPreto, Kai Weng Wong, Scott Hamill, Hadas Kress-Gazit, and Daniela Rus. Robot creation from functional specifications. In Int’l Symp. of Robotics Research (ISRR), 2016. + +Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Alex Graves, Ioannis Antonoglou, Daan Wierstra, and Martin Riedmiller. Playing atari with deep reinforcement learning. arXiv preprint arXiv:1312.5602, 2013. + +Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A. Rusu, Joel Veness, Marc G. Bellemare, Alex Graves, Martin Riedmiller, Andreas K. Fidjeland, Georg Ostrovski, et al. Human-level control through deep reinforcement learning. Nature, 518(7540):529–533, 2015. + +Igor Mordatch and Emo Todorov. Combining the benefits of function approximation and trajectory optimization. In Proc. Robotics: Science and Systems (RSS), 2014. + +Igor Mordatch, Emanuel Todorov, and Zoran Popovic. Discovery of complex behaviors through ´ contact-invariant optimization. Trans. on Graphics, 31(4):43, 2012. + +Igor Mordatch, Kendall Lowrey, Galen Andrew, Zoran Popovic, and Emanuel V Todorov. Interactive ´ control of diverse complex characters with neural networks. In Advances in Neural Information Processing Systems (NIPS), 2015. + +Jahng-Hyon Park and Haruhiko Asada. Concurrent design optimization of mechanical structure and control for high speed robots. J. Dynamic Systems, Measurement, and Control, 116(3):344–356, 1994. + +Chandana Paul and Josh C Bongard. The road less travelled: Morphology in the optimization of biped robot locomotion. In Proc. IEEE/RSJ Int’l Conf. on Intelligent Robots and Systems (IROS), volume 1, pp. 226–232. IEEE, 2001. + +Xue Bin Peng, Glen Berseth, and Michiel Van de Panne. Terrain-adaptive locomotion skills using deep reinforcement learning. Trans. on Graphics, 35(4):81, 2016. + +Anton C. Pil and Harry H. Asada. Integrated structure/control design of mechatronic systems using a recursive experimental optimization method. Trans. on Mechatronics, 1(3):191–203, 1996. + +Michael Posa, Scott Kuindersma, and Russ Tedrake. Optimization and stabilization of trajectories for constrained dynamical systems. In Proc. IEEE Int’l Conf. on Robotics and Automation (ICRA), 2016. + +Thambirajah Ravichandran, David Wang, and Glenn Heppler. Simultaneous plant-controller design optimization of a two-link planar manipulator. Mechatronics, 16(3):233–242, 2006. + +Julie A. Reyer and Panos Y. Papalambros. Combined optimal design and control with application to an electric dc motor. J. of Mechanical Design, 124(2):183–191, 2002. + +Martin Riedmiller. Neural fitted Q iteration-first experiences with a data efficient neural reinforcement learning method. In Proc. European Conf. on Machine Learning (ECML), volume 3720. Springer, 2005. + +Sebastian Risi and Julian Togelius. Neuroevolution in games: State of the art and open challenges. IEEE Trans. on Computational Intelligence and AI in Games, 9(1):25–41, 2017. + +Tim Salimans, Jonathan Ho, Xi Chen, and Ilya Sutskever. Evolution strategies as a scalable alternative to reinforcement learning. arXiv preprint arXiv:1703.03864, 2017. +Charles Schaff, David Yunis, Ayan Chakrabarti, and Matthew R. Walter. Jointly optimizing placement and inference for beacon-based localization. In Proc. IEEE/RSJ Int’l Conf. on Intelligent Robots and Systems (IROS), September 2017. +Jurgen Schmidhuber, Daan Wierstra, Matteo Gagliolo, and Faustino Gomez. Training recurrent ¨ networks by evolino. Neural Computation, 19(3):757–779, 2007. +John Schulman, Sergey Levine, Philipp Moritz, Michael I. Jordan, and Pieter Abbeel. Trust region policy optimization. arXiv preprint arXiv:1502.05477, 2015a. +John Schulman, Philipp Moritz, Sergey Levine, Michael Jordan, and Pieter Abbeel. Highdimensional continuous control using generalized advantage estimation. arXiv preprint arXiv:1506.02438, 2015b. +John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347, 2017. +Frank Sehnke, Christian Osendorfer, Thomas Ruckstieß, Alex Graves, Jan Peters, and J ¨ urgen ¨ Schmidhuber. Parameter-exploring policy gradients. Neural Networks, 23(4):551–559, 2010. +Karl Sims. Evolving virtual creatures. In Proc. Int’l Conf. on Computer Graphics and Interactive Techniques (SIGGRAPH), pp. 15–22, 1994. +Andrew Spielberg, Brandon Araki, Cynthia Sung, Russ Tedrake, and Daniela Rus. Functional co-optimization of articulated robots. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), May 2017. +Richard S. Sutton, David A. McAllester, Satinder P. Singh, and Yishay Mansour. Policy gradient methods for reinforcement learning with function approximation. In Advances in Neural Information Processing Systems (NIPS), 2000. +Yuval Tassa, Tom Erez, and Emanuel Todorov. Synthesis and stabilization of complex behaviors through online trajectory optimization. In Proc. IEEE/RSJ Int’l Conf. on Intelligent Robots and Systems (IROS), 2012. +Miguel G. Villarreal-Cervantes, Carlos A. Cruz-Villar, Jaime Alvarez-Gallegos, and Edgar A. Portilla-Flores. Robust structure-control design approach for mechatronic systems. Trans. on Mechatronics, 18(5):1592–1601, 2013. +Kevin Wampler, Jovan Popovic, and Zoran Popovi ´ c. Animal locomotion controllers from scratch. ´ In Computer Graphics Forum, volume 32, 2013. +Manuel Watter, Jost Springenberg, Joschka Boedecker, and Martin Riedmiller. Embed to control: A locally linear latent dynamics model for control from raw images. In Advances in Neural Information Processing Systems (NIPS), 2015. +Paweł Wawrzynski. Real-time reinforcement learning by sequential actor-critics and experience ´ replay. Neural Networks, 22(10):1484–1497, 2009. +Paweł Wawrzynski and Ajay Kumar Tanwani. Autonomous reinforcement learning with experience ´ replay. Neural Networks, 41:156–167, 2013. +Ronald J. Williams. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine Learning, 8(3–4), May 1992. + +# 6 APPENDIX + +The following provides further evaluation of our framework, including the behavior of the design distribution during training and the robustness of the learned designs to environment variations. + +# 6.1 A - EVOLUTION OF GMM THROUGHOUT TRAINING + +To provide insight into the training process of our algorithm, we evaluate the evolution of the Gaussian mixture model distribution throughout training of the best performing Hopper experiment. We initialize each component of the mixture model with random means and a diagonal covariance matrix chosen to cover the parameter space. The initial mixture weights are uniform. As shown in Figure 5 (left), roughly one third of the way through training, our algorithm converges to the most successful component. Additionally, we find that modes generally do not collapse (Figure 5 (right)). We find this behavior to be consistent across random seeds and different robots. + +![](images/31445f3810e5a39d1253d521aef51b22276ca400f4dae3d24e97f4bee29e0cef.jpg) +Figure 5: Plots of (left) the entropy of the mixture weights and (right) the marginal variance of each parameter throughout training. The curves are normalized such that all initial variances are one. + +# 6.2 B - ROBUSTNESS OF LEARNED DESIGNS + +It is often desirable for a robot to be able to operate in a variety of environments. In this section, we consider the robustness of a learned design to changes in friction. We conducted experiments on the Hopper in which we first learned the design and controller for one friction setting (0.8). We finetuned the controller in environments with different friction settings, while leaving the design fixed. We find the learned design to be reasonably robust with variability comparable to controllers finetuned for the default hand-crafted design (Fig. 6). Additionally, the learned design outperforms the hand-crafted one across the full range of friction values (although, for very low friction values, both designs essentially were unable to learn a successful gait). + +Note that our framework can incorporate this goal of generalization by simply sampling from a diverse set of environments during training. But at the same time, it may be useful in some applications to seek out solutions that are specifically adapted to a relatively narrower set of environments, gaining better performance within this set at the cost of more general performance. + +![](images/6950886e33eae5aebfefebe1362c093a2ef2d79ce2a27d5c428bd80267a0f480.jpg) +Figure 6: A visualization of accumulated reward for different friction values. The controllers and learned design were trained in an environment with a friction value of 0.8. We finetuned the controllers (but not the designs) for both the learned and hand-crafted designs for 10M timesteps for each friction value. Rewards are reported as an average over 100 episodes. \ No newline at end of file diff --git a/parse/train/SyfiiMZA-/SyfiiMZA-_content_list.json b/parse/train/SyfiiMZA-/SyfiiMZA-_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..3196cd36833635182b607269abf6169914189648 --- /dev/null +++ b/parse/train/SyfiiMZA-/SyfiiMZA-_content_list.json @@ -0,0 +1,1181 @@ +[ + { + "type": "text", + "text": "JOINTLY LEARNING TO CONSTRUCT AND CONTROL AGENTS USING DEEP REINFORCEMENT LEARNING ", + "text_level": 1, + "bbox": [ + 176, + 98, + 821, + 146 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Anonymous authors Paper under double-blind review ", + "bbox": [ + 183, + 171, + 398, + 198 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 234, + 544, + 251 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The physical design of a robot and the policy that controls its motion are inherently coupled. However, existing approaches largely ignore this coupling, instead choosing to alternate between separate design and control phases, which requires expert intuition throughout and risks convergence to suboptimal designs. In this work, we propose a method that jointly optimizes over the physical design of a robot and the corresponding control policy in a model-free fashion, without any need for expert supervision. Given an arbitrary robot morphology, our method maintains a distribution over the design parameters and uses reinforcement learning to train a neural network controller. Throughout training, we refine the robot distribution to maximize the expected reward. This results in an assignment to the robot parameters and neural network policy that are jointly optimal. We evaluate our approach in the context of legged locomotion, and demonstrate that it discovers novel robot designs and walking gaits for several different morphologies, achieving performance comparable to or better than that of hand-crafted designs. ", + "bbox": [ + 233, + 265, + 764, + 458 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 178, + 482, + 336, + 498 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "An agent’s ability to navigate through and interact with its environment depends not just on its skill at planning and controlling its motion, but also on its physical design. Different physical designs are inherently better suited to different tasks and environments. By making appropriate choices during fabrication, mechanical elements can be designed to improve robustness to non-idealities such as errors in perception, delays in actuation, etc., and indeed, make control problem an easier one to solve. At the same time, robots that take different forms may find completely different control strategies to be optimal to complete the same task. Therefore, the physical and computational design of an agent are inherently coupled, and must ideally be jointly optimized if the robot is to successfully complete a task in a particular environment. ", + "bbox": [ + 174, + 512, + 825, + 638 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Consider the development of a legged robot for locomotion. Variations in physical design will require changes to the joint torques in order to preserve a particular locomotion behavior (e.g., a heavier torso requires greater torque at the ankle), and will likely result in completely different walking gaits, even when the morphology is preserved. In fact, some changes to design may render locomotion impossible for the target operating environment (e.g., a robot with long feet may be unable to locomote up an incline). Meanwhile, careful choice of bipedal design enables passive walking (McGeer, 1990; Goswami et al., 1998; Collins et al., 2001). It is therefore beneficial to not simply consider the robot’s design or gait to be fixed, but to optimize both jointly for the target environment and task. Similar co-design can be beneficial in other settings—for example for the control policy and physical characteristics of digits in robotic grippers for grasping. ", + "bbox": [ + 174, + 645, + 825, + 784 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "While a robot’s physical design and the corresponding control policy are inherently coupled, most existing methods ignore this coupling, instead choosing to alternate between separate design and control phases. Existing approaches that jointly reason over design and control (Digumarti et al., 2014; Ha et al., 2017; Spielberg et al., 2017) assume knowledge of an accurate model of the robot dynamics and require expert supervision (e.g., to provide a suitable initial design and guide the optimization process). However, these restrictive assumptions limits their applicability to a handful of specific settings, and often yield solutions heavily influenced by expert intuition. ", + "bbox": [ + 174, + 791, + 823, + 888 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In this work, we seek a general approach—one that can optimize a robot’s physical characteristics jointly with controllers of a desired complexity (Fig. 1), that can be applied to general tasks in some given environment, and that can explore the joint search space of physical design and computational control in a purely data-driven way, without a model of the robot dynamics and independent of the biases of expert intuition. We develop this approach in the context of determining the physical parameters of an articulated agent—the lengths and thicknesses of each limbs in a given morphology— through joint training with a neural network for control, with the objective of achieving locomotion. Our method maintains a distribution over these physical parameters, and simultaneously trains the parameters of this distribution with those of a neural network controller, using deep reinforcement learning. In this way, we pursue a design distribution and control policy that are jointly optimal for the given task and environment. Experimental results show that starting from random initializations, our approach is able to find novel designs and walking gaits that match or exceed the performance of manually designed agents. To the best of our knowledge, our method is the first to successfully carry out such a joint optimization of design and control in a completely model-free manner. ", + "bbox": [ + 173, + 896, + 821, + 924 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/601586609236628de9cee35fd71c942e14a74590dd246e90589f10ecbea5ea80.jpg", + "image_caption": [ + "Figure 1: Our algorithm learns a robot’s physical design jointly with the control policy. Here we show the learned designs evolving over time for the Hopper (top left), the Walker2d (top right) and the Ant (bottom), each with the default Roboschool design for comparison. Scale is fixed for each robot. Note that these designs correspond to modes of the distribution over robot designs that our algorithm maintains during training. " + ], + "image_footnote": [], + "bbox": [ + 174, + 104, + 825, + 247 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 362, + 825, + 529 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 555, + 344, + 571 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Attention has been paid recently to the problem of jointly optimizing the parameters that specify a robot’s design and motion (e.g., gaits) or control. Early work in this area takes an evolutionary approach to optimizing a robot’s design and controller, typically parameterized as a neural network, for virtual agents (Sims, 1994; Paul & Bongard, 2001; Agrawal et al., 2013) and physical robots (Lipson & Pollack, 2000; Bongard, 2011). Particularly relevant to our approach is the work of Ha et al. (2017), who relate design and motion parameters via a set of implicit functions that express robot dynamics, desired trajectories, and actuation limits. These functions encode a manifold that is then linearized to model the relationship between design and motion via the implicit function theorem. The method then solves for the desired parameters in a local fashion via constraint-based optimization. Similarly, Spielberg et al. (2017) describe an approach that jointly reasons over physical design and motion parameters for robots with articulated degrees of freedom (e.g., legged robots). They formulate the problem in the framework of trajectory optimization by incorporating parameters involved in the design of articulated robots, including dimensions, masses, mass distribution, and moments of inertia, together with the contact force and torque variables typically associated with trajectory optimization. They use weighted actuation cost as the objective, subject to a regularization penalty on parameters. Their method is guaranteed to find a feasible design so long as the problem is initialized within a small neighborhood of a feasible solution. Unlike our approach, their method requires that the user provide an estimate of the robot configuration at each time step, as well as an accurate analytic model of constraint dynamics (e.g., foot contact), which is computationally expensive to enforce. Geijtenbeek et al. (2013) propose a derivative-free strategy that optimizes over muscle routing and muscle-based control for simulated bipeds to realize a design that incorporates biomechanical constraints. Meanwhile, Digumarti et al. (2014) describe an evolutionary method that jointly reasons over design and motion parameters for legged robots, while also tuning the parameters of a robust controller that tracks these motions. Their method is limited to biologically inspired quadrupedal foothold patterns, and does not account for contact dynamics. In contrast, our approach applies to arbitrary morphologies and does not require that we model contact dynamics. ", + "bbox": [ + 174, + 590, + 825, + 922 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 103, + 823, + 132 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "While the focus on simultaneous optimization over robot design and motion parameters is relatively new, there is a long history of research focused on the related problem of co-design of physical structure and control (Reyer & Papalambros, 2002; Ravichandran et al., 2006). Park & Asada (1994) jointly optimize the link geometry of a high-speed robot arm along with the parameters of a PD joint controller. These methods often rely upon access to an accurate model of the robot dynamics in order to design the controller. In order to reduce the dependence upon a detailed analytical model, Pil & Asada (1996) use on-robot experiments to refine their model as part of the iterative design process. More recently, Villarreal-Cervantes et al. (2013) allow for some degree of uncertainty in the model by including the sensitivity of the design and control parameters to model uncertainty along with the task-specific optimization objectives. However, existing methods still rely upon access to an analytical model of the robot dynamics and are typically limited to simple (e.g., linear) control designs. Our method assumes only that the controller can be modeled via a convolutional neural network, and can thereby learn complex, highly nonlinear control policies with no a priori knowledge of the robot dynamics. ", + "bbox": [ + 174, + 140, + 825, + 333 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Far more attention has been paid to the individual problem of task-driven optimization of robot motion and control. Given an arbitrary robot design chosen by novice users, Megaro et al. (2015) describe an interactive design framework that solves for a realizable walking gait that results in stable locomotion. Similarly, Mordatch et al. (2012) synthesize emergent behaviors (motion) for arbitrary morphologies and tasks from high-level specifications, by jointly optimizing over contact and motion. Mordatch et al. (2015) build upon this work by training recurrent neural networks to serve as feedback controllers capable of producing complex, stable behaviors for a variety of dynamical systems. Their method interleaves supervised learning with trajectory optimization, and incorporates noise to improve generalizability. Meanwhile, there is a large body of literature that formulates motion synthesis as a trajectory optimization problem. This approach has proven effective at respecting contact constraints (e.g., between the foot and ground), which make controlling dynamic motion particularly challenging (Dai & Tedrake, 2016; Posa et al., 2016; Griffin & Grizzle, 2016). These approaches have been shown to generate sophisticated behaviors for complex robot designs (e.g., humanoids) (Tassa et al., 2012), and for robots of arbitrary morphologies using only a high-level specification of the robot’s shape, gait, and task (Wampler et al., 2013). Related, a number of methods interleave trajectory optimization and supervised learning with neural network regression (Levine & Abbeel, 2014; Levine & Koltun, 2014; Mordatch & Todorov, 2014; Mordatch et al., 2015). Unlike our method, the use of trajectory optimization makes these approaches reliant upon knowledge of the model. ", + "bbox": [ + 174, + 339, + 825, + 603 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "A great deal of attention of-late has focused on the problem of learning complex control policies directly from low-level sensory input, without any knowledge of the system dynamics. Methods that have proven particularly effective combine neural networks that learn representations of the highdimensional raw sensor input with deep reinforcement learning (Riedmiller, 2005; Mnih et al., 2013; 2015; Schulman et al., 2015a). While much of the work in this area focuses on low-dimensional, discrete action spaces, several methods have been recently proposed that learn continuous control policies through deep reinforcement learning. These techniques have been applied to control simple, simulated robots (Wawrzynski, 2009; Wawrzy ´ nski & Tanwani, 2013; Watter et al., 2015; Lillicrap ´ et al., 2015), perform robot manipulation (Levine et al., 2016a;b; Gu et al., 2017), and control legged robots (Schulman et al., 2015b; Peng et al., 2016). ", + "bbox": [ + 174, + 611, + 825, + 750 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Black-box optimization (Schmidhuber et al., 2007; Risi & Togelius, 2017) is an alternative to using reinforcement learning to training the control policy. These approaches have the advantage that they do not involve backpropagating gradients, are insensitive to reward sparsity, and can handle long time horizons. While black-box optimization strategies have traditionally been thought of as illsuited to difficult reinforcement learning problems, Salimans et al. (2017) recently showed that they perform similarly to state-of-the-art RL methods on difficult continuous control problems, including those that involve locomotion. Closely related is the policy-gradient method of Sehnke et al. (2010), who define the policy as a distribution over the parameters of a controller, which they then sample over. This results in gradient estimates that are far less noisy than is typical of policy gradient algorithms. These approaches are similar to the way in which we learn the robot design, which we formulate as a Gaussian mixture model over design parameters. Indeed, the two referenced methods yield the same gradient estimate for Gaussian parameter distributions (Salimans et al., 2017). ", + "bbox": [ + 174, + 756, + 825, + 922 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Meanwhile, much work has focused on the problem of determining robot designs that meet the requirements of a particular task. Given a user demonstration of the desired behaviors, Coros et al. (2013) learn optimum kinematic linkages that are capable of reproducing these motions. Mehta et al. (2014) synthesize electromechanical robot designs in a compositional fashion based upon a complete user-specified structural specification of the robot. Mehta et al. (2016) build upon this work, allowing the user to specify functional objectives via structured English, which is parsed to a formal specification using linear temporal logic. Censi (2017) describes a theory for co-design that includes the ability to select discrete robot parts according to functional constraints, but do not reason over geometry or motion. ", + "bbox": [ + 174, + 103, + 825, + 229 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Related to our approach is recent work that jointly optimizes sensor design and inference algorithms for perception systems. Chakrabarti (2016) considers the problem of jointly learning a camera sensor’s multiplexing pattern along with reconstruction methods for imaging tasks. They model inference as a neural network together and use stochastic gradient descent to backpropagate the loss to a neural layer representation of the multiplexing pattern. Related, Schaff et al. (2017) jointly learn design and inference for beacon-based localization. They encode beacon allocation (spatially and across transmission channels) as a differential neural layer that interfaces with a neural network for inference. Joint optimization then follows from standard techniques for training neural networks. ", + "bbox": [ + 174, + 236, + 825, + 347 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 APPROACH", + "text_level": 1, + "bbox": [ + 176, + 366, + 297, + 382 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this section, we begin by describing the standard reinforcement learning framework for training agent policies, and then describe how we extend this to also learn the physical design of the agent. ", + "bbox": [ + 176, + 397, + 825, + 425 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 REINFORCEMENT LEARNING BACKGROUND ", + "text_level": 1, + "bbox": [ + 178, + 441, + 517, + 455 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In the standard reinforcement learning setting, an agent interacts with its environment, usually a Markov Decision Process, over a number of discrete timesteps. At each time step $t$ , the agent receives a state $s _ { t } \\in S$ and takes action $a _ { t } \\in { \\mathcal { A } }$ according to a policy $\\pi : { \\mathcal { S } } A$ . Then, the agent receives a scalar reward $r _ { t }$ and the next state $s _ { t + 1 }$ from the environment. This process continues until a terminal state is reached. The goal of reinforcement learning is to then find a policy $\\pi ^ { * }$ that maximizes the expected return $\\mathbb { E } [ \\mathcal { R } _ { t } ]$ , where $\\begin{array} { r } { \\mathcal { R } _ { t } = \\sum _ { i = 0 } ^ { \\infty } \\gamma ^ { i } r _ { t + i } } \\end{array}$ and $\\gamma \\in [ 0 , 1 )$ is a discount factor. ", + "bbox": [ + 174, + 467, + 825, + 553 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Policy gradient methods are a class of algorithms often used to optimize reinforcement learning problems, due to their ability to optimize cumulative reward and the ease with which the can be used with neural networks and other nonlinear function approximators. Consequently, they are commonly used for reinforcement learning problems that involve complex, continuous action spaces. Policy gradient methods directly parameterize a stochastic policy $\\bar { \\pi _ { \\boldsymbol { \\theta } } } ( a _ { t } | \\boldsymbol { s } _ { t } )$ and perform stochastic gradient ascent on the expected return. “Vanilla” policy gradient methods compute an estimate of the gradient $\\nabla _ { \\boldsymbol { \\theta } } \\mathbb { E } [ \\mathcal { R } _ { t } ]$ using a sample-based mean computed over $\\nabla _ { \\theta } \\log \\pi _ { \\theta } ( \\bar { a _ { t } } \\vert s _ { t } ) \\mathcal { R } _ { t }$ (Williams, 1992), which yields an unbiased gradient estimate (Sutton et al., 2000). While the variance in the resulting estimate decreases with the number of samples, sampling is computationally expensive. Another way to reduce variance while maintaining an unbiased estimate is to estimate the gradient by comparing the reward to a “baseline” reward $b ( s _ { t } )$ . ", + "bbox": [ + 174, + 558, + 825, + 712 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "These methods are effective but can be unstable, especially when used for deep reinforcement learning. Small changes to the policy parameters may cause large changes in the distribution of visited states. Several methods have been proposed to mitigate these effects. Among them, Schulman et al. (2015a) introduce Trust Region Policy Optimization (TRPO), which imposes a constraint on the KLdivergence between policies before and after an update. Recently, Schulman et al. (2017) proposed proximal policy optimization (PPO), a first-order class of methods similar to TRPO. PPO alternates between sampling data through interaction with the environment and optimizing the objective ", + "bbox": [ + 173, + 718, + 825, + 815 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/b0404ccd7847b3087ede7fdf66114a8fcc5dbdb719766f039eb092b8ecde360c.jpg", + "text": "$$\n\\hat { \\mathbb { E } } _ { t } \\left[ \\operatorname* { m i n } ( r _ { t } ( \\theta ) \\hat { A } _ { t } , \\operatorname { c l i p } ( r _ { t } ( \\theta ) , 1 - \\epsilon , 1 + \\epsilon ) ) \\right] ,\n$$", + "text_format": "latex", + "bbox": [ + 348, + 818, + 647, + 844 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $\\begin{array} { r } { r _ { t } ( \\theta ) = \\frac { \\pi _ { \\theta } ( a _ { t } | s _ { t } ) } { \\pi _ { \\theta _ { \\mathrm { o l d } } } ( a _ { t } | s _ { t } ) } } \\end{array}$ and $\\hat { \\mathbb { E } } _ { t }$ represents an empirical average over a finite sample set. This objective seeks to maximize the expected return while encouraging a small step in policy space. The clipping within the objective removes any incentive for moving $r _ { t } ( \\theta )$ outside the interval $[ 1 - \\epsilon , 1 + \\epsilon ]$ . The net effect of this objective is a simple, robust policy gradient algorithm that attains or matches state-of-the-art results on a wide array of tasks (Schulman et al., 2017). ", + "bbox": [ + 174, + 848, + 825, + 924 + ], + "page_idx": 3 + }, + { + "type": "table", + "img_path": "images/41a743ced4cfdd91b680fed1a1b45d33d82853ca18a3fd986fd096ef072ae2c2.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Algorithm1Joint Optimization
Initialize πθ(a|s,r),PΦ(r)
while True do
for i ∈[1..np] do
Sample ri,.., rn from pΦ
Collect rollouts with each design
Update 0 to maximize PPO's surrogate objective. end for
for i∈[1..nr] do
Sample ri,.*, rm from pΦ
Compute returns R1,., Rm·
Update to maximize PPO's surrogate objective.
end for
end while
", + "bbox": [ + 174, + 101, + 825, + 304 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 JOINT OPTIMIZATION OF DESIGN AND CONTROL ", + "text_level": 1, + "bbox": [ + 174, + 330, + 552, + 345 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We extend the standard reinforcement learning formulation by considering the space of possible robot designs $\\Omega$ . Specifically, we assume that for every design $\\mathcal { E } \\in \\Omega$ , we can define common state and action spaces $s$ and $\\mathcal { A }$ , reward function $r ( s , a )$ , and initial state distribution $p _ { 0 } ( s )$ , that are meaningful to all designs. The designs differ only in the transition dynamics they induce $p \\varepsilon ( s ^ { \\prime } | s , a )$ and share a common action space $A$ —to achieve this, we assume a common morphology for all possible designs. ", + "bbox": [ + 174, + 357, + 825, + 441 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Our goal then is to find the optimal design $\\mathcal { E } ^ { * }$ and policy $\\pi _ { \\mathcal { E } ^ { * } } ^ { * }$ pair that maximizes the expected value of a given reward function. However, this is a non-linear, non-convex optimization problem over the spaces of all possible designs and all possible policies. Solving it exactly would require enumerating all possible designs (possibly through discretization of the design space), learning policies for each, and comparing the resulting expected rewards. This is computationally infeasible for all but the simplest of cases. Instead, we develop a gradient-based approach to solving this optimization problem with the following key components: (1) we maintain a multi-modal distribution over the space of physical designs and update this distribution using policy gradient methods in parameter space, similar to Sehnke et al. (2010) and Salimans et al. (2017); and (2) we train a single controller to act on all sampled designs during training, providing this controller with the design parameters of the specific sample it is controlling. We find that the multi-modal stochastic parameterization of the design space allows our method to explore the space more thoroughly (where a uni-modal Gaussian distribution would frequently get trapped in local minima). Moreover, a common controller makes optimization tractable, allowing efficient evaluation of unseen designs. We additionally benefit from learning common strategies across diverse designs, while still adapting different policies to different parts of the design space given the sample parameters as input. Together, these components enable efficient joint exploration of the design and policy spaces. ", + "bbox": [ + 173, + 449, + 825, + 685 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Formally, let $p ( r ; \\phi )$ denote the distribution over designs, and $\\pi ( a _ { t } | s _ { t } , r ; \\theta )$ a stochastic control policy parameterized by $\\phi$ and $\\theta$ respectively. In our experiments, we use a neural network to model the control policy $\\pi$ , and a Gaussian mixture model as the parametric form of the distribution $p ( r ; \\phi )$ . Our goal is then to solve the following optimization problem: ", + "bbox": [ + 174, + 691, + 823, + 747 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/3cba5431354f3ab665ec88bbb63f904897e4ef18653b9e0b0f2a6ec18f4d91dd.jpg", + "text": "$$\n\\phi ^ { * } , \\theta ^ { * } = \\underset { \\phi , \\theta } { \\arg \\operatorname* { m a x } } \\mathbb { E } _ { r , t } \\left[ \\mathcal { R } _ { t } \\right] ,\n$$", + "text_format": "latex", + "bbox": [ + 405, + 755, + 591, + 782 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\mathbb { E } _ { \\boldsymbol { r } , t } [ \\cdot ]$ is the expectation over robots and trajectories those robots induce. ", + "bbox": [ + 174, + 790, + 692, + 806 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We use stochastic gradient-based updates to optimize Eqn. 2. Our method (Algorithm 3.2) alternates between updating the parameters of the policy and design distributions, $\\theta$ and $\\phi$ , respectively. We empirically find this to yield convergence to better solutions in a reasonable number of iterations compared to performing simultaneous updates. We optimize the policy parameters $\\theta$ using Proximal Policy Optimization. However, instead of collecting data from a single design, we sample a design $r$ after a fixed number $T$ of timesteps according to the distribution $p ( r ; \\phi )$ . After $n$ iterations of PPO, we freeze the policy parameters and proceed to optimize the parameters of the design distribution. Without knowledge of the model, we optimize the design parameters $\\phi$ via policy gradient over parameter space, similar to Sehnke et al. (2010). This is equivalent to black-box optimization methods that have proven effective for complex learning problems (Salimans et al., 2017). We sample $m$ different designs and compute their returns for a single episode acting under policy $\\pi ( \\cdot ; \\theta )$ . We then use this data to shift the design distribution $p ( \\cdot ; \\phi )$ in a direction maximizing expected return. These iterations are repeated until convergence. ", + "bbox": [ + 174, + 811, + 825, + 924 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/0babea94ff71820dd39bdf9c33c7081a0ac16e1f9df8bc584653a1c4ea8568a5.jpg", + "image_caption": [ + "Figure 2: From left to right: the default Hopper, Walker2d, and Ant robots. The Hopper and Walker2d are constrained to walk in a line, while the Ant can walk anywhere in the plane. " + ], + "image_footnote": [], + "bbox": [ + 174, + 101, + 825, + 268 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 337, + 825, + 407 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 RESULTS ", + "text_level": 1, + "bbox": [ + 176, + 429, + 281, + 445 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We validate our approach with three commonly used robots provided in OpenAI’s Roboschool (Schulman et al., 2017). Environments in Roboschool are built on top of Bullet Physics, a popular open-source physics engine. In a series of locomotion experiments, we show that our approach not only discovers novel robot designs and gaits, but also outperforms two out of three of the hand-designed robots trained on the same task and yields performance comparable to the third. ", + "bbox": [ + 174, + 462, + 825, + 531 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.1 EXPERIMENT DETAILS ", + "text_level": 1, + "bbox": [ + 176, + 549, + 372, + 563 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We evaluate our approach on three legged locomotion tasks within Roboschool: RoboschoolHopper, RoboschoolWalker2d, and RoboschoolAnt (note that we subsequently drop the Roboschool prefix for brevity). Figure 2 depicts the default Roboschool design for each robot. These environments describe a locomotion task that has the robots moving along the positive $\\mathbf { X }$ -axis (to the right in the figures) towards a distant goal. The reward function defined in these environments is a weighted sum of rewards for forward progress and staying upright, and penalties for applying torques and for joints that reach their rotational limits. The episode ends when the robot falls over or reaches a maximum number of timesteps. ", + "bbox": [ + 174, + 575, + 825, + 688 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We learn robot designs using the morphologies specified by the standard Roboschool designs. For each morphology, we parameterize the robot in terms of the length and radius (e.g., mass) of each link (or just the radius in the case of the sphere for the ant body). We impose symmetry, and share parameters across each leg for the Walker2d and Ant designs. This parameterization permits a wide variety of robots of different shapes and sizes, some of which are better suited to the locomotion objective than others, and some designs that do not permit a control policy that results in locomotion. ", + "bbox": [ + 174, + 694, + 825, + 777 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We model the control policy $\\pi ( a _ { t } | s _ { t } , \\mathcal { E } ; \\theta _ { p } )$ as a feed forward neural network consisting of three fully-connected layers with 64 units and tanh activation functions. A final layer maps the output to the robot action space. With the exception of the last robot-specific layer, the architecture is the same for all experiments. Meanwhile, we represent the distribution over the parameterized robot design $p ( \\cdot ; \\theta _ { r } )$ using a Gaussian mixture model with four mixture components (each with a diagonal covariance matrix over the different parameters). We initialize the means of each component randomly within a wide range, and initialize the variances in order to span the range of each parameter. We find that our approach maintains high variance distributions during early iterations—thereby continuing exploration of the design space—before committing to a chosen design. The appendix provides further details regardng the evolution of these distributions. ", + "bbox": [ + 174, + 784, + 825, + 924 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/87d05764a68b4483dd235162ccd22ce42ae5244a22dfc99728015163faafa544.jpg", + "image_caption": [ + "Figure 3: Training curves that show the evolution of reward across training iterations for the Hopper, Walker2d, and Ant environments over eight different random seeds. The black dashed line corresponds to the highest achievable performance of the corresponding baseline robot. In other figures, we display the best-performing checkpoint of each run. Therefore, we make each training curve transparent after it stops improving. " + ], + "image_footnote": [], + "bbox": [ + 173, + 106, + 825, + 250 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We train our method with eight threads of Proximal Policy Optimization for a total of 300M environment timesteps across all threads. We use the publicly available implementation of PPO provided in OpenAI Baselines (Hesse et al., 2017). We alternate between 50 policy PPO iterations and 2 design iterations, finding this ratio to yield convergence to good solutions. We set this and the other hyper-parameters on the Hopper and used the same settings for all experiments. ", + "bbox": [ + 174, + 363, + 825, + 434 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.2 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 174, + 452, + 315, + 467 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We evaluate the performance of our approach to joint optimization over robot design and control on the Hopper, Walker2d, and Ant robots, and compare against a policy trained for the standard Roboschool design. We evaluate the consistency and robustness of our approach relative to the initial robot parameter distribution using several different random seeds. For each robot morphology, we find that our method learns robot designs and the corresponding control policy that are either comparable (Walker2d) or exceed the performance (Hopper and Ant) achievable using the default designs (Fig. 3). We also see that our method achieves these levels of performance by discovering unique robot designs (Fig. 1) together with novel walking gaits (Fig. 4) that can not be achieved with the default designs. Note that our method was able to learn these designs and control policies from a random initialization, without access to a dynamics model or any expert supervision. ", + "bbox": [ + 174, + 479, + 825, + 618 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Our method learns a joint design and controller for the Hopper that outperforms the baseline by as much as $5 0 \\%$ . Our learned robot exploits the small size of the foot to achieve faster, more precise walking gaits. Meanwhile, the longer torso of the learned robot improves stability, allowing it to maintain balance while locomoting at a faster pace. We found this behavior to be consistent across several different Hopper experiments, with the method converging to designs with a small foot and long, thin torso. In the appendix, we explore the stability of this design with respect to variations in the environment using the coefficient of friction as an example, and find the improvement to be consistent. For the ant, our optimization yields a physical design that is significantly different from the default design (Fig. 2). Consequently, the learned Ant drastically outperforms the baseline, improving reward by up to $1 1 6 \\%$ . Our method learns a design with a small, lightweight body and extremely long legs. The long legs enable the ant to apply large torque at contact, allowing it to move at a fast pace. ", + "bbox": [ + 174, + 625, + 825, + 791 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Our framework learned different design-control pairs for the Walker2d that perform similarly to the default design. Across several different experiments, we see two distinct, successful designs and walking gaits. Interestingly, neither agent walks primarily on its feet. The first design has small, thick legs and long feet. The controller is then able to exploit the thick middle leg link, which protrudes slightly past the foot, to push off the ground. The long foot then provides additional balance. The second design is similar in geometry to the baseline Walker2d, but moves in a very different way. By lowering the knee joint and lengthening the foot, the Walker2d is able to efficiently balance on its knees and toes. This low stance allows the Walker2d to fully extend its leg backwards, creating a long, powerful stride, similar to that of a sprinter using starting blocks. ", + "bbox": [ + 174, + 797, + 825, + 924 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/97b6ba644983f0da7af6c1a0a705d198e90586ea3304b1179bfe57ed0dfdfbc5.jpg", + "image_caption": [ + "Figure 4: Here, we compare locomotion of default and learned robots, visualizing both their physical design and corresponding learned gaits. We pick the best results for Hopper and Ant, and two of the best results for Walker2d (due to diversity in gaits). Note that for each robot type, we show a blend of a fixed number of frames in the same time interval, allowing direct comparison between the speed with which different designs are able to locomote. " + ], + "image_footnote": [], + "bbox": [ + 174, + 97, + 823, + 521 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "5 CONCLUSION ", + "text_level": 1, + "bbox": [ + 174, + 665, + 318, + 681 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We proposed what is, to the best of our knowledge, the first model-free algorithm that jointly optimizes over the physical design of a robot and the corresponding control policy, without any need for expert supervision. Given an arbitrary morphology, our robot maintains a distribution over the robot design parameters and learns these parameters together with a neural network controller using policy gradient-based reinforcement learning. This results in an assignment to the policy over robot parameters and the control policy that are jointly optimal. We evaluated our approach on a series of different legged robot morphologies, demonstrating that it results in novel robot designs and walking gaits, achieving performance that either matches or exceeds that of manually defined designs. ", + "bbox": [ + 174, + 720, + 825, + 833 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Our findings suggest several avenues for future work. The most direct is extending the current approach to find optimized designs for uneven terrain, the presence of obstacles, changes in slope, variations in friction, etc. We are also interested in extending our framework to relax the assumption that the morphology is pre-defined. Finally, we are investigating applications to different types of agents and design spaces beyond legged robots (e.g., end-effectors), and exploring appropriate stochastic parameterization for such designs. ", + "bbox": [ + 174, + 840, + 825, + 924 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 176, + 103, + 287, + 117 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Shailen Agrawal, Shuo Shen, and Michiel van de Panne. Diverse motion variations for physicsbased character animation. In Proc. ACM SIGGRAPH/Eurographics Symposium on Computer Animation, pp. 37–44, 2013. ", + "bbox": [ + 174, + 126, + 821, + 167 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Josh Bongard. Morphological change in machines accelerates the evolution of robust behavior. Proc. National Academy of Sciences, 108(4):1234–1239, 2011. ", + "bbox": [ + 169, + 176, + 821, + 205 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Andrea Censi. A class of co-design problems with cyclic constraints and their solution. Robotics and Automation Letters, 2(1):96–103, 2017. ", + "bbox": [ + 171, + 214, + 823, + 243 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Ayan Chakrabarti. Learning sensor multiplexing design through backpropagation. In Advances in Neural Information Processing Systems (NIPS), December 2016. ", + "bbox": [ + 171, + 251, + 823, + 280 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Steven H Collins, Martijn Wisse, and Andy Ruina. A three-dimensional passive-dynamic walking robot with two legs and knees. Int’l J. of Robotics Research, 20(7):607–615, 2001. ", + "bbox": [ + 173, + 287, + 823, + 319 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Stelian Coros, Bernhard Thomaszewski, Gioacchino Noris, Shinjiro Sueda, Moira Forberg, Robert W. Sumner, Wojciech Matusik, and Bernd Bickel. Computational design of mechanical characters. Trans. on Graphics, 32(4):83, 2013. ", + "bbox": [ + 176, + 325, + 821, + 369 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Hongkai Dai and Russ Tedrake. Planning robust walking motion on uneven terrain via convex optimization. In Proc. Int’l Conf. on Humanoid Robots (Humanoids), 2016. ", + "bbox": [ + 169, + 377, + 821, + 406 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Krishnamanaswi M. Digumarti, Christian Gehring, Stelian Coros, J. Hwangbo, and R. Siegwart. Concurrent optimization of mechanical design and locomotion control of a legged robot. In Proc. IEEE Int’l Conf. on Robotics and Automation (ICRA), July 2014. ", + "bbox": [ + 176, + 414, + 823, + 458 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Thomas Geijtenbeek, Michiel van de Panne, and A. Frank van der Stappen. Flexible muscle-based locomotion for bipedal creatures. Trans. on Graphics, 32(6):206, 2013. ", + "bbox": [ + 171, + 465, + 823, + 496 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Ambarish Goswami, Benoit Thuilot, and Bernard Espiau. A study of the passive gait of a compasslike biped robot: Symmetry and chaos. Int’l J. of Robotics Research, 17(12):1282–1301, 1998. ", + "bbox": [ + 173, + 502, + 821, + 534 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Brent Griffin and Jessy Grizzle. Nonholonomic virtual constraints and gait optimization for robust walking control. Int’l J. of Robotics Research, pp. 895–922, 2016. ", + "bbox": [ + 171, + 540, + 823, + 570 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Shixiang Gu, Ethan Holly, Timothy Lillicrap, and Sergey Levine. Deep reinforcement learning for robotic manipulation with asynchronous off-policy updates. In Proc. IEEE Int’l Conf. on Robotics and Automation (ICRA), 2017. ", + "bbox": [ + 176, + 578, + 823, + 621 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Sehoon Ha, Stelian Coros, Alexander Alspach, Joohyung Kim, and Katsu Yamane. Joint optimization of robot design and motion parameters using the implicit function theorem. In Proc. Robotics: Science and Systems (RSS), June 2017. ", + "bbox": [ + 176, + 628, + 823, + 672 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Christopher Hesse, Matthias Plappert, Alec Radford, John Schulman, Szymon Sidor, and Yuhuai Wu. OpenAI baselines. https://github.com/openai/baselines, 2017. ", + "bbox": [ + 173, + 680, + 823, + 710 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Sergey Levine and Pieter Abbeel. Learning neural network policies with guided policy search under unknown dynamics. In Advances in Neural Information Processing Systems (NIPS), 2014. ", + "bbox": [ + 173, + 717, + 823, + 747 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Sergey Levine and Vladlen Koltun. Learning complex neural network policies with trajectory optimization. In Proc. Int’l Conf. on Machine Learning (ICML), 2014. ", + "bbox": [ + 173, + 755, + 821, + 785 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Sergey Levine, Chelsea Finn, Trevor Darrell, and Pieter Abbeel. End-to-end training of deep visuomotor policies. J. Machine Learning Research, 17(39):1–40, 2016a. ", + "bbox": [ + 173, + 792, + 823, + 821 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Sergey Levine, Peter Pastor, Alex Krizhevsky, Julian Ibarz, and Deirdre Quillen. Learning hand-eye coordination for robotic grasping with deep learning and large-scale data collection. Int’l J. of Robotics Research, 2016b. ", + "bbox": [ + 174, + 829, + 823, + 872 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Timothy P. Lillicrap, Jonathan J. Hunt, Alexander Pritzel, Nicolas Heess, Tom Erez, Yuval Tassa, David Silver, and Daan Wierstra. Continuous control with deep reinforcement learning. arXiv preprint arXiv:1509.02971, 2015. ", + "bbox": [ + 174, + 881, + 825, + 924 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Hod Lipson and Jordan B. Pollack. Automatic design and manufacture of robotic lifeforms. Nature, 406(6799):974–978, 2000. ", + "bbox": [ + 169, + 103, + 825, + 132 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Tad McGeer. Passive dynamic walking. Int’l J. of Robotics Research, 9(2):62–82, 1990. ", + "bbox": [ + 171, + 140, + 753, + 156 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Vittorio Megaro, Bernhard Thomaszewski, Maurizio Nitti, Otmar Hilliges, Markus Gross, and Stelian Coros. Interactive design of 3d-printable robotic creatures. Trans. on Graphics, 34(6): 216, 2015. ", + "bbox": [ + 173, + 164, + 823, + 205 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ankur M. Mehta, Joseph DelPreto, Benjamin Shaya, and Daniela Rus. Cogeneration of mechanical, electrical, and software designs for printable robots from structural specifications. In Proc. IEEE/RSJ Int’l Conf. on Intelligent Robots and Systems (IROS), 2014. ", + "bbox": [ + 173, + 214, + 823, + 257 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ankur M. Mehta, Joseph DelPreto, Kai Weng Wong, Scott Hamill, Hadas Kress-Gazit, and Daniela Rus. Robot creation from functional specifications. In Int’l Symp. of Robotics Research (ISRR), 2016. ", + "bbox": [ + 173, + 265, + 823, + 308 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Alex Graves, Ioannis Antonoglou, Daan Wierstra, and Martin Riedmiller. Playing atari with deep reinforcement learning. arXiv preprint arXiv:1312.5602, 2013. ", + "bbox": [ + 174, + 315, + 825, + 359 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A. Rusu, Joel Veness, Marc G. Bellemare, Alex Graves, Martin Riedmiller, Andreas K. Fidjeland, Georg Ostrovski, et al. Human-level control through deep reinforcement learning. Nature, 518(7540):529–533, 2015. ", + "bbox": [ + 174, + 367, + 823, + 411 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Igor Mordatch and Emo Todorov. Combining the benefits of function approximation and trajectory optimization. In Proc. Robotics: Science and Systems (RSS), 2014. ", + "bbox": [ + 169, + 417, + 823, + 446 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Igor Mordatch, Emanuel Todorov, and Zoran Popovic. Discovery of complex behaviors through ´ contact-invariant optimization. Trans. on Graphics, 31(4):43, 2012. ", + "bbox": [ + 171, + 454, + 823, + 484 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Igor Mordatch, Kendall Lowrey, Galen Andrew, Zoran Popovic, and Emanuel V Todorov. Interactive ´ control of diverse complex characters with neural networks. In Advances in Neural Information Processing Systems (NIPS), 2015. ", + "bbox": [ + 174, + 492, + 825, + 535 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jahng-Hyon Park and Haruhiko Asada. Concurrent design optimization of mechanical structure and control for high speed robots. J. Dynamic Systems, Measurement, and Control, 116(3):344–356, 1994. ", + "bbox": [ + 176, + 542, + 823, + 585 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Chandana Paul and Josh C Bongard. The road less travelled: Morphology in the optimization of biped robot locomotion. In Proc. IEEE/RSJ Int’l Conf. on Intelligent Robots and Systems (IROS), volume 1, pp. 226–232. IEEE, 2001. ", + "bbox": [ + 173, + 593, + 825, + 637 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Xue Bin Peng, Glen Berseth, and Michiel Van de Panne. Terrain-adaptive locomotion skills using deep reinforcement learning. Trans. on Graphics, 35(4):81, 2016. ", + "bbox": [ + 173, + 645, + 823, + 674 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Anton C. Pil and Harry H. Asada. Integrated structure/control design of mechatronic systems using a recursive experimental optimization method. Trans. on Mechatronics, 1(3):191–203, 1996. ", + "bbox": [ + 173, + 681, + 821, + 712 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Michael Posa, Scott Kuindersma, and Russ Tedrake. Optimization and stabilization of trajectories for constrained dynamical systems. In Proc. IEEE Int’l Conf. on Robotics and Automation (ICRA), 2016. ", + "bbox": [ + 173, + 718, + 825, + 761 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Thambirajah Ravichandran, David Wang, and Glenn Heppler. Simultaneous plant-controller design optimization of a two-link planar manipulator. Mechatronics, 16(3):233–242, 2006. ", + "bbox": [ + 173, + 770, + 823, + 799 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Julie A. Reyer and Panos Y. Papalambros. Combined optimal design and control with application to an electric dc motor. J. of Mechanical Design, 124(2):183–191, 2002. ", + "bbox": [ + 173, + 806, + 821, + 837 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Martin Riedmiller. Neural fitted Q iteration-first experiences with a data efficient neural reinforcement learning method. In Proc. European Conf. on Machine Learning (ECML), volume 3720. Springer, 2005. ", + "bbox": [ + 174, + 844, + 823, + 887 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Sebastian Risi and Julian Togelius. Neuroevolution in games: State of the art and open challenges. IEEE Trans. on Computational Intelligence and AI in Games, 9(1):25–41, 2017. ", + "bbox": [ + 174, + 895, + 820, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Tim Salimans, Jonathan Ho, Xi Chen, and Ilya Sutskever. Evolution strategies as a scalable alternative to reinforcement learning. arXiv preprint arXiv:1703.03864, 2017. \nCharles Schaff, David Yunis, Ayan Chakrabarti, and Matthew R. Walter. Jointly optimizing placement and inference for beacon-based localization. In Proc. IEEE/RSJ Int’l Conf. on Intelligent Robots and Systems (IROS), September 2017. \nJurgen Schmidhuber, Daan Wierstra, Matteo Gagliolo, and Faustino Gomez. Training recurrent ¨ networks by evolino. Neural Computation, 19(3):757–779, 2007. \nJohn Schulman, Sergey Levine, Philipp Moritz, Michael I. Jordan, and Pieter Abbeel. Trust region policy optimization. arXiv preprint arXiv:1502.05477, 2015a. \nJohn Schulman, Philipp Moritz, Sergey Levine, Michael Jordan, and Pieter Abbeel. Highdimensional continuous control using generalized advantage estimation. arXiv preprint arXiv:1506.02438, 2015b. \nJohn Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347, 2017. \nFrank Sehnke, Christian Osendorfer, Thomas Ruckstieß, Alex Graves, Jan Peters, and J ¨ urgen ¨ Schmidhuber. Parameter-exploring policy gradients. Neural Networks, 23(4):551–559, 2010. \nKarl Sims. Evolving virtual creatures. In Proc. Int’l Conf. on Computer Graphics and Interactive Techniques (SIGGRAPH), pp. 15–22, 1994. \nAndrew Spielberg, Brandon Araki, Cynthia Sung, Russ Tedrake, and Daniela Rus. Functional co-optimization of articulated robots. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), May 2017. \nRichard S. Sutton, David A. McAllester, Satinder P. Singh, and Yishay Mansour. Policy gradient methods for reinforcement learning with function approximation. In Advances in Neural Information Processing Systems (NIPS), 2000. \nYuval Tassa, Tom Erez, and Emanuel Todorov. Synthesis and stabilization of complex behaviors through online trajectory optimization. In Proc. IEEE/RSJ Int’l Conf. on Intelligent Robots and Systems (IROS), 2012. \nMiguel G. Villarreal-Cervantes, Carlos A. Cruz-Villar, Jaime Alvarez-Gallegos, and Edgar A. Portilla-Flores. Robust structure-control design approach for mechatronic systems. Trans. on Mechatronics, 18(5):1592–1601, 2013. \nKevin Wampler, Jovan Popovic, and Zoran Popovi ´ c. Animal locomotion controllers from scratch. ´ In Computer Graphics Forum, volume 32, 2013. \nManuel Watter, Jost Springenberg, Joschka Boedecker, and Martin Riedmiller. Embed to control: A locally linear latent dynamics model for control from raw images. In Advances in Neural Information Processing Systems (NIPS), 2015. \nPaweł Wawrzynski. Real-time reinforcement learning by sequential actor-critics and experience ´ replay. Neural Networks, 22(10):1484–1497, 2009. \nPaweł Wawrzynski and Ajay Kumar Tanwani. Autonomous reinforcement learning with experience ´ replay. Neural Networks, 41:156–167, 2013. \nRonald J. Williams. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine Learning, 8(3–4), May 1992. ", + "bbox": [ + 169, + 85, + 826, + 838 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "6 APPENDIX ", + "text_level": 1, + "bbox": [ + 174, + 102, + 294, + 117 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "The following provides further evaluation of our framework, including the behavior of the design distribution during training and the robustness of the learned designs to environment variations. ", + "bbox": [ + 176, + 133, + 823, + 161 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "6.1 A - EVOLUTION OF GMM THROUGHOUT TRAINING", + "text_level": 1, + "bbox": [ + 171, + 179, + 566, + 193 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "To provide insight into the training process of our algorithm, we evaluate the evolution of the Gaussian mixture model distribution throughout training of the best performing Hopper experiment. We initialize each component of the mixture model with random means and a diagonal covariance matrix chosen to cover the parameter space. The initial mixture weights are uniform. As shown in Figure 5 (left), roughly one third of the way through training, our algorithm converges to the most successful component. Additionally, we find that modes generally do not collapse (Figure 5 (right)). We find this behavior to be consistent across random seeds and different robots. ", + "bbox": [ + 173, + 204, + 825, + 301 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/31445f3810e5a39d1253d521aef51b22276ca400f4dae3d24e97f4bee29e0cef.jpg", + "image_caption": [ + "Figure 5: Plots of (left) the entropy of the mixture weights and (right) the marginal variance of each parameter throughout training. The curves are normalized such that all initial variances are one. " + ], + "image_footnote": [], + "bbox": [ + 179, + 315, + 815, + 506 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "6.2 B - ROBUSTNESS OF LEARNED DESIGNS ", + "text_level": 1, + "bbox": [ + 176, + 585, + 490, + 599 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "It is often desirable for a robot to be able to operate in a variety of environments. In this section, we consider the robustness of a learned design to changes in friction. We conducted experiments on the Hopper in which we first learned the design and controller for one friction setting (0.8). We finetuned the controller in environments with different friction settings, while leaving the design fixed. We find the learned design to be reasonably robust with variability comparable to controllers finetuned for the default hand-crafted design (Fig. 6). Additionally, the learned design outperforms the hand-crafted one across the full range of friction values (although, for very low friction values, both designs essentially were unable to learn a successful gait). ", + "bbox": [ + 174, + 611, + 825, + 723 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Note that our framework can incorporate this goal of generalization by simply sampling from a diverse set of environments during training. But at the same time, it may be useful in some applications to seek out solutions that are specifically adapted to a relatively narrower set of environments, gaining better performance within this set at the cost of more general performance. ", + "bbox": [ + 174, + 729, + 825, + 786 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/6950886e33eae5aebfefebe1362c093a2ef2d79ce2a27d5c428bd80267a0f480.jpg", + "image_caption": [ + "Figure 6: A visualization of accumulated reward for different friction values. The controllers and learned design were trained in an environment with a friction value of 0.8. We finetuned the controllers (but not the designs) for both the learned and hand-crafted designs for 10M timesteps for each friction value. Rewards are reported as an average over 100 episodes. " + ], + "image_footnote": [], + "bbox": [ + 233, + 319, + 759, + 631 + ], + "page_idx": 12 + } +] \ No newline at end of file diff --git a/parse/train/SyfiiMZA-/SyfiiMZA-_middle.json b/parse/train/SyfiiMZA-/SyfiiMZA-_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..f6a888b6876644d424c837e137e9b62fe696b72b --- /dev/null +++ b/parse/train/SyfiiMZA-/SyfiiMZA-_middle.json @@ -0,0 +1,29344 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 78, + 503, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 78, + 505, + 98 + ], + "spans": [ + { + "bbox": [ + 105, + 78, + 505, + 98 + ], + "score": 1.0, + "content": "JOINTLY LEARNING TO CONSTRUCT AND CONTROL", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 98, + 483, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 98, + 483, + 118 + ], + "score": 1.0, + "content": "AGENTS USING DEEP REINFORCEMENT LEARNING", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 112, + 136, + 244, + 157 + ], + "lines": [ + { + "bbox": [ + 113, + 136, + 201, + 147 + ], + "spans": [ + { + "bbox": [ + 113, + 136, + 201, + 147 + ], + "score": 1.0, + "content": "Anonymous authors", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 112, + 146, + 245, + 159 + ], + "spans": [ + { + "bbox": [ + 112, + 146, + 245, + 159 + ], + "score": 1.0, + "content": "Paper under double-blind review", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 278, + 186, + 333, + 199 + ], + "lines": [ + { + "bbox": [ + 276, + 186, + 335, + 200 + ], + "spans": [ + { + "bbox": [ + 276, + 186, + 335, + 200 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 143, + 210, + 468, + 363 + ], + "lines": [ + { + "bbox": [ + 142, + 210, + 469, + 222 + ], + "spans": [ + { + "bbox": [ + 142, + 210, + 469, + 222 + ], + "score": 1.0, + "content": "The physical design of a robot and the policy that controls its motion are inher-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 220, + 470, + 234 + ], + "spans": [ + { + "bbox": [ + 141, + 220, + 470, + 234 + ], + "score": 1.0, + "content": "ently coupled. However, existing approaches largely ignore this coupling, instead", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 231, + 469, + 245 + ], + "spans": [ + { + "bbox": [ + 141, + 231, + 469, + 245 + ], + "score": 1.0, + "content": "choosing to alternate between separate design and control phases, which requires", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 243, + 470, + 255 + ], + "spans": [ + { + "bbox": [ + 141, + 243, + 470, + 255 + ], + "score": 1.0, + "content": "expert intuition throughout and risks convergence to suboptimal designs. In this", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 254, + 470, + 266 + ], + "spans": [ + { + "bbox": [ + 141, + 254, + 470, + 266 + ], + "score": 1.0, + "content": "work, we propose a method that jointly optimizes over the physical design of a", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 264, + 469, + 278 + ], + "spans": [ + { + "bbox": [ + 141, + 264, + 469, + 278 + ], + "score": 1.0, + "content": "robot and the corresponding control policy in a model-free fashion, without any", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 276, + 470, + 288 + ], + "spans": [ + { + "bbox": [ + 141, + 276, + 470, + 288 + ], + "score": 1.0, + "content": "need for expert supervision. Given an arbitrary robot morphology, our method", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 287, + 469, + 299 + ], + "spans": [ + { + "bbox": [ + 141, + 287, + 469, + 299 + ], + "score": 1.0, + "content": "maintains a distribution over the design parameters and uses reinforcement learn-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 298, + 470, + 309 + ], + "spans": [ + { + "bbox": [ + 141, + 298, + 470, + 309 + ], + "score": 1.0, + "content": "ing to train a neural network controller. Throughout training, we refine the robot", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 308, + 469, + 321 + ], + "spans": [ + { + "bbox": [ + 141, + 308, + 469, + 321 + ], + "score": 1.0, + "content": "distribution to maximize the expected reward. This results in an assignment to the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 320, + 469, + 331 + ], + "spans": [ + { + "bbox": [ + 141, + 320, + 469, + 331 + ], + "score": 1.0, + "content": "robot parameters and neural network policy that are jointly optimal. We evaluate", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 331, + 469, + 342 + ], + "spans": [ + { + "bbox": [ + 141, + 331, + 469, + 342 + ], + "score": 1.0, + "content": "our approach in the context of legged locomotion, and demonstrate that it dis-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 341, + 469, + 354 + ], + "spans": [ + { + "bbox": [ + 141, + 341, + 469, + 354 + ], + "score": 1.0, + "content": "covers novel robot designs and walking gaits for several different morphologies,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 351, + 468, + 366 + ], + "spans": [ + { + "bbox": [ + 141, + 351, + 468, + 366 + ], + "score": 1.0, + "content": "achieving performance comparable to or better than that of hand-crafted designs.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 11.5 + }, + { + "type": "title", + "bbox": [ + 109, + 382, + 206, + 395 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 208, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 208, + 398 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 406, + 505, + 506 + ], + "lines": [ + { + "bbox": [ + 106, + 407, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 106, + 407, + 505, + 419 + ], + "score": 1.0, + "content": "An agent’s ability to navigate through and interact with its environment depends not just on its skill", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 417, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 505, + 430 + ], + "score": 1.0, + "content": "at planning and controlling its motion, but also on its physical design. Different physical designs", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 428, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 505, + 442 + ], + "score": 1.0, + "content": "are inherently better suited to different tasks and environments. By making appropriate choices", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 440, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 505, + 452 + ], + "score": 1.0, + "content": "during fabrication, mechanical elements can be designed to improve robustness to non-idealities", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 450, + 505, + 463 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 505, + 463 + ], + "score": 1.0, + "content": "such as errors in perception, delays in actuation, etc., and indeed, make control problem an easier", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 462, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 505, + 474 + ], + "score": 1.0, + "content": "one to solve. At the same time, robots that take different forms may find completely different", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 473, + 505, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 505, + 485 + ], + "score": 1.0, + "content": "control strategies to be optimal to complete the same task. Therefore, the physical and computational", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 484, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 106, + 484, + 505, + 496 + ], + "score": 1.0, + "content": "design of an agent are inherently coupled, and must ideally be jointly optimized if the robot is to", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 495, + 334, + 507 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 334, + 507 + ], + "score": 1.0, + "content": "successfully complete a task in a particular environment.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 511, + 505, + 621 + ], + "lines": [ + { + "bbox": [ + 106, + 511, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 106, + 511, + 505, + 524 + ], + "score": 1.0, + "content": "Consider the development of a legged robot for locomotion. Variations in physical design will", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 522, + 506, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 506, + 536 + ], + "score": 1.0, + "content": "require changes to the joint torques in order to preserve a particular locomotion behavior (e.g., a", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "score": 1.0, + "content": "heavier torso requires greater torque at the ankle), and will likely result in completely different", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 545, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 505, + 556 + ], + "score": 1.0, + "content": "walking gaits, even when the morphology is preserved. In fact, some changes to design may render", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 555, + 506, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 506, + 569 + ], + "score": 1.0, + "content": "locomotion impossible for the target operating environment (e.g., a robot with long feet may be", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "score": 1.0, + "content": "unable to locomote up an incline). Meanwhile, careful choice of bipedal design enables passive", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "walking (McGeer, 1990; Goswami et al., 1998; Collins et al., 2001). It is therefore beneficial to", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 588, + 506, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 506, + 601 + ], + "score": 1.0, + "content": "not simply consider the robot’s design or gait to be fixed, but to optimize both jointly for the target", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 599, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 505, + 612 + ], + "score": 1.0, + "content": "environment and task. Similar co-design can be beneficial in other settings—for example for the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 609, + 441, + 624 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 441, + 624 + ], + "score": 1.0, + "content": "control policy and physical characteristics of digits in robotic grippers for grasping.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 107, + 627, + 504, + 704 + ], + "lines": [ + { + "bbox": [ + 106, + 627, + 506, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 506, + 639 + ], + "score": 1.0, + "content": "While a robot’s physical design and the corresponding control policy are inherently coupled, most", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 638, + 506, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 506, + 650 + ], + "score": 1.0, + "content": "existing methods ignore this coupling, instead choosing to alternate between separate design and", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 649, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 506, + 662 + ], + "score": 1.0, + "content": "control phases. Existing approaches that jointly reason over design and control (Digumarti et al.,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 659, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 506, + 673 + ], + "score": 1.0, + "content": "2014; Ha et al., 2017; Spielberg et al., 2017) assume knowledge of an accurate model of the robot", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 671, + 506, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 506, + 684 + ], + "score": 1.0, + "content": "dynamics and require expert supervision (e.g., to provide a suitable initial design and guide the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 681, + 506, + 694 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 506, + 694 + ], + "score": 1.0, + "content": "optimization process). However, these restrictive assumptions limits their applicability to a handful", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 694, + 440, + 705 + ], + "spans": [ + { + "bbox": [ + 106, + 694, + 440, + 705 + ], + "score": 1.0, + "content": "of specific settings, and often yield solutions heavily influenced by expert intuition.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 42 + }, + { + "type": "text", + "bbox": [ + 106, + 710, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "In this work, we seek a general approach—one that can optimize a robot’s physical characteristics", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "jointly with controllers of a desired complexity (Fig. 1), that can be applied to general tasks in some", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46.5 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 309, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 309, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 303, + 752, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "1", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 78, + 503, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 78, + 505, + 98 + ], + "spans": [ + { + "bbox": [ + 105, + 78, + 505, + 98 + ], + "score": 1.0, + "content": "JOINTLY LEARNING TO CONSTRUCT AND CONTROL", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 98, + 483, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 98, + 483, + 118 + ], + "score": 1.0, + "content": "AGENTS USING DEEP REINFORCEMENT LEARNING", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 112, + 136, + 244, + 157 + ], + "lines": [ + { + "bbox": [ + 113, + 136, + 201, + 147 + ], + "spans": [ + { + "bbox": [ + 113, + 136, + 201, + 147 + ], + "score": 1.0, + "content": "Anonymous authors", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 112, + 146, + 245, + 159 + ], + "spans": [ + { + "bbox": [ + 112, + 146, + 245, + 159 + ], + "score": 1.0, + "content": "Paper under double-blind review", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 112, + 136, + 245, + 159 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 186, + 333, + 199 + ], + "lines": [ + { + "bbox": [ + 276, + 186, + 335, + 200 + ], + "spans": [ + { + "bbox": [ + 276, + 186, + 335, + 200 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 143, + 210, + 468, + 363 + ], + "lines": [ + { + "bbox": [ + 142, + 210, + 469, + 222 + ], + "spans": [ + { + "bbox": [ + 142, + 210, + 469, + 222 + ], + "score": 1.0, + "content": "The physical design of a robot and the policy that controls its motion are inher-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 220, + 470, + 234 + ], + "spans": [ + { + "bbox": [ + 141, + 220, + 470, + 234 + ], + "score": 1.0, + "content": "ently coupled. However, existing approaches largely ignore this coupling, instead", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 231, + 469, + 245 + ], + "spans": [ + { + "bbox": [ + 141, + 231, + 469, + 245 + ], + "score": 1.0, + "content": "choosing to alternate between separate design and control phases, which requires", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 243, + 470, + 255 + ], + "spans": [ + { + "bbox": [ + 141, + 243, + 470, + 255 + ], + "score": 1.0, + "content": "expert intuition throughout and risks convergence to suboptimal designs. In this", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 254, + 470, + 266 + ], + "spans": [ + { + "bbox": [ + 141, + 254, + 470, + 266 + ], + "score": 1.0, + "content": "work, we propose a method that jointly optimizes over the physical design of a", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 264, + 469, + 278 + ], + "spans": [ + { + "bbox": [ + 141, + 264, + 469, + 278 + ], + "score": 1.0, + "content": "robot and the corresponding control policy in a model-free fashion, without any", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 276, + 470, + 288 + ], + "spans": [ + { + "bbox": [ + 141, + 276, + 470, + 288 + ], + "score": 1.0, + "content": "need for expert supervision. Given an arbitrary robot morphology, our method", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 287, + 469, + 299 + ], + "spans": [ + { + "bbox": [ + 141, + 287, + 469, + 299 + ], + "score": 1.0, + "content": "maintains a distribution over the design parameters and uses reinforcement learn-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 298, + 470, + 309 + ], + "spans": [ + { + "bbox": [ + 141, + 298, + 470, + 309 + ], + "score": 1.0, + "content": "ing to train a neural network controller. Throughout training, we refine the robot", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 308, + 469, + 321 + ], + "spans": [ + { + "bbox": [ + 141, + 308, + 469, + 321 + ], + "score": 1.0, + "content": "distribution to maximize the expected reward. This results in an assignment to the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 320, + 469, + 331 + ], + "spans": [ + { + "bbox": [ + 141, + 320, + 469, + 331 + ], + "score": 1.0, + "content": "robot parameters and neural network policy that are jointly optimal. We evaluate", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 331, + 469, + 342 + ], + "spans": [ + { + "bbox": [ + 141, + 331, + 469, + 342 + ], + "score": 1.0, + "content": "our approach in the context of legged locomotion, and demonstrate that it dis-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 341, + 469, + 354 + ], + "spans": [ + { + "bbox": [ + 141, + 341, + 469, + 354 + ], + "score": 1.0, + "content": "covers novel robot designs and walking gaits for several different morphologies,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 351, + 468, + 366 + ], + "spans": [ + { + "bbox": [ + 141, + 351, + 468, + 366 + ], + "score": 1.0, + "content": "achieving performance comparable to or better than that of hand-crafted designs.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 11.5, + "bbox_fs": [ + 141, + 210, + 470, + 366 + ] + }, + { + "type": "title", + "bbox": [ + 109, + 382, + 206, + 395 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 208, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 208, + 398 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 406, + 505, + 506 + ], + "lines": [ + { + "bbox": [ + 106, + 407, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 106, + 407, + 505, + 419 + ], + "score": 1.0, + "content": "An agent’s ability to navigate through and interact with its environment depends not just on its skill", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 417, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 505, + 430 + ], + "score": 1.0, + "content": "at planning and controlling its motion, but also on its physical design. Different physical designs", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 428, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 505, + 442 + ], + "score": 1.0, + "content": "are inherently better suited to different tasks and environments. By making appropriate choices", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 440, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 505, + 452 + ], + "score": 1.0, + "content": "during fabrication, mechanical elements can be designed to improve robustness to non-idealities", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 450, + 505, + 463 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 505, + 463 + ], + "score": 1.0, + "content": "such as errors in perception, delays in actuation, etc., and indeed, make control problem an easier", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 462, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 505, + 474 + ], + "score": 1.0, + "content": "one to solve. At the same time, robots that take different forms may find completely different", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 473, + 505, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 505, + 485 + ], + "score": 1.0, + "content": "control strategies to be optimal to complete the same task. Therefore, the physical and computational", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 484, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 106, + 484, + 505, + 496 + ], + "score": 1.0, + "content": "design of an agent are inherently coupled, and must ideally be jointly optimized if the robot is to", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 495, + 334, + 507 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 334, + 507 + ], + "score": 1.0, + "content": "successfully complete a task in a particular environment.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 407, + 505, + 507 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 511, + 505, + 621 + ], + "lines": [ + { + "bbox": [ + 106, + 511, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 106, + 511, + 505, + 524 + ], + "score": 1.0, + "content": "Consider the development of a legged robot for locomotion. Variations in physical design will", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 522, + 506, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 506, + 536 + ], + "score": 1.0, + "content": "require changes to the joint torques in order to preserve a particular locomotion behavior (e.g., a", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "score": 1.0, + "content": "heavier torso requires greater torque at the ankle), and will likely result in completely different", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 545, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 505, + 556 + ], + "score": 1.0, + "content": "walking gaits, even when the morphology is preserved. In fact, some changes to design may render", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 555, + 506, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 506, + 569 + ], + "score": 1.0, + "content": "locomotion impossible for the target operating environment (e.g., a robot with long feet may be", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "score": 1.0, + "content": "unable to locomote up an incline). Meanwhile, careful choice of bipedal design enables passive", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "walking (McGeer, 1990; Goswami et al., 1998; Collins et al., 2001). It is therefore beneficial to", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 588, + 506, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 506, + 601 + ], + "score": 1.0, + "content": "not simply consider the robot’s design or gait to be fixed, but to optimize both jointly for the target", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 599, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 505, + 612 + ], + "score": 1.0, + "content": "environment and task. Similar co-design can be beneficial in other settings—for example for the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 609, + 441, + 624 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 441, + 624 + ], + "score": 1.0, + "content": "control policy and physical characteristics of digits in robotic grippers for grasping.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 511, + 506, + 624 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 627, + 504, + 704 + ], + "lines": [ + { + "bbox": [ + 106, + 627, + 506, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 506, + 639 + ], + "score": 1.0, + "content": "While a robot’s physical design and the corresponding control policy are inherently coupled, most", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 638, + 506, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 506, + 650 + ], + "score": 1.0, + "content": "existing methods ignore this coupling, instead choosing to alternate between separate design and", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 649, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 506, + 662 + ], + "score": 1.0, + "content": "control phases. Existing approaches that jointly reason over design and control (Digumarti et al.,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 659, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 506, + 673 + ], + "score": 1.0, + "content": "2014; Ha et al., 2017; Spielberg et al., 2017) assume knowledge of an accurate model of the robot", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 671, + 506, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 506, + 684 + ], + "score": 1.0, + "content": "dynamics and require expert supervision (e.g., to provide a suitable initial design and guide the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 681, + 506, + 694 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 506, + 694 + ], + "score": 1.0, + "content": "optimization process). However, these restrictive assumptions limits their applicability to a handful", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 694, + 440, + 705 + ], + "spans": [ + { + "bbox": [ + 106, + 694, + 440, + 705 + ], + "score": 1.0, + "content": "of specific settings, and often yield solutions heavily influenced by expert intuition.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 42, + "bbox_fs": [ + 105, + 627, + 506, + 705 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 710, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "In this work, we seek a general approach—one that can optimize a robot’s physical characteristics", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "jointly with controllers of a desired complexity (Fig. 1), that can be applied to general tasks in some", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 287, + 505, + 301 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 505, + 301 + ], + "score": 1.0, + "content": "given environment, and that can explore the joint search space of physical design and computational", + "type": "text", + "cross_page": true + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 299, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 505, + 311 + ], + "score": 1.0, + "content": "control in a purely data-driven way, without a model of the robot dynamics and independent of the", + "type": "text", + "cross_page": true + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 308, + 505, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 505, + 323 + ], + "score": 1.0, + "content": "biases of expert intuition. We develop this approach in the context of determining the physical pa-", + "type": "text", + "cross_page": true + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 319, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 505, + 334 + ], + "score": 1.0, + "content": "rameters of an articulated agent—the lengths and thicknesses of each limbs in a given morphology—", + "type": "text", + "cross_page": true + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 331, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 505, + 344 + ], + "score": 1.0, + "content": "through joint training with a neural network for control, with the objective of achieving locomotion.", + "type": "text", + "cross_page": true + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 343, + 505, + 355 + ], + "spans": [ + { + "bbox": [ + 105, + 343, + 505, + 355 + ], + "score": 1.0, + "content": "Our method maintains a distribution over these physical parameters, and simultaneously trains the", + "type": "text", + "cross_page": true + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 354, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 505, + 366 + ], + "score": 1.0, + "content": "parameters of this distribution with those of a neural network controller, using deep reinforcement", + "type": "text", + "cross_page": true + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 364, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 506, + 378 + ], + "score": 1.0, + "content": "learning. In this way, we pursue a design distribution and control policy that are jointly optimal for", + "type": "text", + "cross_page": true + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 376, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 505, + 388 + ], + "score": 1.0, + "content": "the given task and environment. Experimental results show that starting from random initializations,", + "type": "text", + "cross_page": true + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 386, + 506, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 386, + 506, + 399 + ], + "score": 1.0, + "content": "our approach is able to find novel designs and walking gaits that match or exceed the performance", + "type": "text", + "cross_page": true + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 397, + 504, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 397, + 504, + 409 + ], + "score": 1.0, + "content": "of manually designed agents. To the best of our knowledge, our method is the first to successfully", + "type": "text", + "cross_page": true + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 409, + 477, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 409, + 477, + 421 + ], + "score": 1.0, + "content": "carry out such a joint optimization of design and control in a completely model-free manner.", + "type": "text", + "cross_page": true + } + ], + "index": 19 + } + ], + "index": 46.5, + "bbox_fs": [ + 105, + 709, + 505, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 107, + 83, + 505, + 196 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 83, + 505, + 196 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 83, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 107, + 83, + 505, + 196 + ], + "score": 0.876, + "type": "image", + "image_path": "601586609236628de9cee35fd71c942e14a74590dd246e90589f10ecbea5ea80.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 83, + 505, + 120.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 120.66666666666666, + 505, + 158.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 158.33333333333331, + 505, + 195.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 207, + 505, + 263 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 208, + 505, + 219 + ], + "spans": [ + { + "bbox": [ + 106, + 208, + 505, + 219 + ], + "score": 1.0, + "content": "Figure 1: Our algorithm learns a robot’s physical design jointly with the control policy. Here we", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 219, + 505, + 231 + ], + "spans": [ + { + "bbox": [ + 106, + 219, + 505, + 231 + ], + "score": 1.0, + "content": "show the learned designs evolving over time for the Hopper (top left), the Walker2d (top right) and", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 228, + 505, + 242 + ], + "spans": [ + { + "bbox": [ + 105, + 228, + 505, + 242 + ], + "score": 1.0, + "content": "the Ant (bottom), each with the default Roboschool design for comparison. Scale is fixed for each", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 239, + 506, + 254 + ], + "spans": [ + { + "bbox": [ + 105, + 239, + 506, + 254 + ], + "score": 1.0, + "content": "robot. Note that these designs correspond to modes of the distribution over robot designs that our", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 251, + 254, + 265 + ], + "spans": [ + { + "bbox": [ + 105, + 251, + 254, + 265 + ], + "score": 1.0, + "content": "algorithm maintains during training.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 107, + 287, + 505, + 419 + ], + "lines": [ + { + "bbox": [ + 105, + 287, + 505, + 301 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 505, + 301 + ], + "score": 1.0, + "content": "given environment, and that can explore the joint search space of physical design and computational", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 299, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 505, + 311 + ], + "score": 1.0, + "content": "control in a purely data-driven way, without a model of the robot dynamics and independent of the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 308, + 505, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 505, + 323 + ], + "score": 1.0, + "content": "biases of expert intuition. We develop this approach in the context of determining the physical pa-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 319, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 505, + 334 + ], + "score": 1.0, + "content": "rameters of an articulated agent—the lengths and thicknesses of each limbs in a given morphology—", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 331, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 505, + 344 + ], + "score": 1.0, + "content": "through joint training with a neural network for control, with the objective of achieving locomotion.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 343, + 505, + 355 + ], + "spans": [ + { + "bbox": [ + 105, + 343, + 505, + 355 + ], + "score": 1.0, + "content": "Our method maintains a distribution over these physical parameters, and simultaneously trains the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 354, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 505, + 366 + ], + "score": 1.0, + "content": "parameters of this distribution with those of a neural network controller, using deep reinforcement", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 364, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 506, + 378 + ], + "score": 1.0, + "content": "learning. In this way, we pursue a design distribution and control policy that are jointly optimal for", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 376, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 505, + 388 + ], + "score": 1.0, + "content": "the given task and environment. Experimental results show that starting from random initializations,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 386, + 506, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 386, + 506, + 399 + ], + "score": 1.0, + "content": "our approach is able to find novel designs and walking gaits that match or exceed the performance", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 397, + 504, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 397, + 504, + 409 + ], + "score": 1.0, + "content": "of manually designed agents. To the best of our knowledge, our method is the first to successfully", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 409, + 477, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 409, + 477, + 421 + ], + "score": 1.0, + "content": "carry out such a joint optimization of design and control in a completely model-free manner.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 13.5 + }, + { + "type": "title", + "bbox": [ + 108, + 440, + 211, + 453 + ], + "lines": [ + { + "bbox": [ + 105, + 439, + 213, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 439, + 213, + 455 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 468, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 469, + 506, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 469, + 506, + 481 + ], + "score": 1.0, + "content": "Attention has been paid recently to the problem of jointly optimizing the parameters that specify a", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 479, + 506, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 506, + 493 + ], + "score": 1.0, + "content": "robot’s design and motion (e.g., gaits) or control. Early work in this area takes an evolutionary ap-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 490, + 506, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 490, + 506, + 504 + ], + "score": 1.0, + "content": "proach to optimizing a robot’s design and controller, typically parameterized as a neural network, for", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 501, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 505, + 515 + ], + "score": 1.0, + "content": "virtual agents (Sims, 1994; Paul & Bongard, 2001; Agrawal et al., 2013) and physical robots (Lip-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 512, + 505, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 505, + 525 + ], + "score": 1.0, + "content": "son & Pollack, 2000; Bongard, 2011). Particularly relevant to our approach is the work of Ha et al.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 523, + 506, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 506, + 536 + ], + "score": 1.0, + "content": "(2017), who relate design and motion parameters via a set of implicit functions that express robot", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 534, + 505, + 547 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 505, + 547 + ], + "score": 1.0, + "content": "dynamics, desired trajectories, and actuation limits. These functions encode a manifold that is then", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 544, + 505, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 505, + 559 + ], + "score": 1.0, + "content": "linearized to model the relationship between design and motion via the implicit function theorem.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 555, + 505, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 569 + ], + "score": 1.0, + "content": "The method then solves for the desired parameters in a local fashion via constraint-based optimiza-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 567, + 505, + 580 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 505, + 580 + ], + "score": 1.0, + "content": "tion. Similarly, Spielberg et al. (2017) describe an approach that jointly reasons over physical design", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 577, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 505, + 592 + ], + "score": 1.0, + "content": "and motion parameters for robots with articulated degrees of freedom (e.g., legged robots). They", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 588, + 505, + 602 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 602 + ], + "score": 1.0, + "content": "formulate the problem in the framework of trajectory optimization by incorporating parameters in-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 600, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 613 + ], + "score": 1.0, + "content": "volved in the design of articulated robots, including dimensions, masses, mass distribution, and", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 611, + 505, + 624 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 505, + 624 + ], + "score": 1.0, + "content": "moments of inertia, together with the contact force and torque variables typically associated with", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 622, + 505, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 505, + 635 + ], + "score": 1.0, + "content": "trajectory optimization. They use weighted actuation cost as the objective, subject to a regulariza-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "score": 1.0, + "content": "tion penalty on parameters. Their method is guaranteed to find a feasible design so long as the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "score": 1.0, + "content": "problem is initialized within a small neighborhood of a feasible solution. Unlike our approach, their", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "method requires that the user provide an estimate of the robot configuration at each time step, as well", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "as an accurate analytic model of constraint dynamics (e.g., foot contact), which is computationally", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 676, + 506, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 506, + 691 + ], + "score": 1.0, + "content": "expensive to enforce. Geijtenbeek et al. (2013) propose a derivative-free strategy that optimizes over", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "muscle routing and muscle-based control for simulated bipeds to realize a design that incorporates", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "biomechanical constraints. Meanwhile, Digumarti et al. (2014) describe an evolutionary method", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "that jointly reasons over design and motion parameters for legged robots, while also tuning the pa-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "rameters of a robust controller that tracks these motions. Their method is limited to biologically", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 32.5 + } + ], + "page_idx": 1, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 309, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 309, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "score": 1.0, + "content": "2", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 107, + 83, + 505, + 196 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 83, + 505, + 196 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 83, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 107, + 83, + 505, + 196 + ], + "score": 0.876, + "type": "image", + "image_path": "601586609236628de9cee35fd71c942e14a74590dd246e90589f10ecbea5ea80.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 83, + 505, + 120.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 120.66666666666666, + 505, + 158.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 158.33333333333331, + 505, + 195.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 207, + 505, + 263 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 208, + 505, + 219 + ], + "spans": [ + { + "bbox": [ + 106, + 208, + 505, + 219 + ], + "score": 1.0, + "content": "Figure 1: Our algorithm learns a robot’s physical design jointly with the control policy. Here we", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 219, + 505, + 231 + ], + "spans": [ + { + "bbox": [ + 106, + 219, + 505, + 231 + ], + "score": 1.0, + "content": "show the learned designs evolving over time for the Hopper (top left), the Walker2d (top right) and", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 228, + 505, + 242 + ], + "spans": [ + { + "bbox": [ + 105, + 228, + 505, + 242 + ], + "score": 1.0, + "content": "the Ant (bottom), each with the default Roboschool design for comparison. Scale is fixed for each", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 239, + 506, + 254 + ], + "spans": [ + { + "bbox": [ + 105, + 239, + 506, + 254 + ], + "score": 1.0, + "content": "robot. Note that these designs correspond to modes of the distribution over robot designs that our", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 251, + 254, + 265 + ], + "spans": [ + { + "bbox": [ + 105, + 251, + 254, + 265 + ], + "score": 1.0, + "content": "algorithm maintains during training.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 107, + 287, + 505, + 419 + ], + "lines": [], + "index": 13.5, + "bbox_fs": [ + 105, + 287, + 506, + 421 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 108, + 440, + 211, + 453 + ], + "lines": [ + { + "bbox": [ + 105, + 439, + 213, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 439, + 213, + 455 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 468, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 469, + 506, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 469, + 506, + 481 + ], + "score": 1.0, + "content": "Attention has been paid recently to the problem of jointly optimizing the parameters that specify a", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 479, + 506, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 506, + 493 + ], + "score": 1.0, + "content": "robot’s design and motion (e.g., gaits) or control. Early work in this area takes an evolutionary ap-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 490, + 506, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 490, + 506, + 504 + ], + "score": 1.0, + "content": "proach to optimizing a robot’s design and controller, typically parameterized as a neural network, for", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 501, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 505, + 515 + ], + "score": 1.0, + "content": "virtual agents (Sims, 1994; Paul & Bongard, 2001; Agrawal et al., 2013) and physical robots (Lip-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 512, + 505, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 505, + 525 + ], + "score": 1.0, + "content": "son & Pollack, 2000; Bongard, 2011). Particularly relevant to our approach is the work of Ha et al.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 523, + 506, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 506, + 536 + ], + "score": 1.0, + "content": "(2017), who relate design and motion parameters via a set of implicit functions that express robot", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 534, + 505, + 547 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 505, + 547 + ], + "score": 1.0, + "content": "dynamics, desired trajectories, and actuation limits. These functions encode a manifold that is then", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 544, + 505, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 505, + 559 + ], + "score": 1.0, + "content": "linearized to model the relationship between design and motion via the implicit function theorem.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 555, + 505, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 569 + ], + "score": 1.0, + "content": "The method then solves for the desired parameters in a local fashion via constraint-based optimiza-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 567, + 505, + 580 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 505, + 580 + ], + "score": 1.0, + "content": "tion. Similarly, Spielberg et al. (2017) describe an approach that jointly reasons over physical design", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 577, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 505, + 592 + ], + "score": 1.0, + "content": "and motion parameters for robots with articulated degrees of freedom (e.g., legged robots). They", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 588, + 505, + 602 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 602 + ], + "score": 1.0, + "content": "formulate the problem in the framework of trajectory optimization by incorporating parameters in-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 600, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 613 + ], + "score": 1.0, + "content": "volved in the design of articulated robots, including dimensions, masses, mass distribution, and", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 611, + 505, + 624 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 505, + 624 + ], + "score": 1.0, + "content": "moments of inertia, together with the contact force and torque variables typically associated with", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 622, + 505, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 505, + 635 + ], + "score": 1.0, + "content": "trajectory optimization. They use weighted actuation cost as the objective, subject to a regulariza-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "score": 1.0, + "content": "tion penalty on parameters. Their method is guaranteed to find a feasible design so long as the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "score": 1.0, + "content": "problem is initialized within a small neighborhood of a feasible solution. Unlike our approach, their", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "method requires that the user provide an estimate of the robot configuration at each time step, as well", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "as an accurate analytic model of constraint dynamics (e.g., foot contact), which is computationally", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 676, + 506, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 506, + 691 + ], + "score": 1.0, + "content": "expensive to enforce. Geijtenbeek et al. (2013) propose a derivative-free strategy that optimizes over", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "muscle routing and muscle-based control for simulated bipeds to realize a design that incorporates", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "biomechanical constraints. Meanwhile, Digumarti et al. (2014) describe an evolutionary method", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "that jointly reasons over design and motion parameters for legged robots, while also tuning the pa-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "rameters of a robust controller that tracks these motions. Their method is limited to biologically", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "inspired quadrupedal foothold patterns, and does not account for contact dynamics. In contrast, our", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 498, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 498, + 107 + ], + "score": 1.0, + "content": "approach applies to arbitrary morphologies and does not require that we model contact dynamics.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 469, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "inspired quadrupedal foothold patterns, and does not account for contact dynamics. In contrast, our", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 498, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 498, + 107 + ], + "score": 1.0, + "content": "approach applies to arbitrary morphologies and does not require that we model contact dynamics.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 111, + 505, + 264 + ], + "lines": [ + { + "bbox": [ + 106, + 110, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 106, + 110, + 505, + 123 + ], + "score": 1.0, + "content": "While the focus on simultaneous optimization over robot design and motion parameters is relatively", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 122, + 506, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 506, + 134 + ], + "score": 1.0, + "content": "new, there is a long history of research focused on the related problem of co-design of physical", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "score": 1.0, + "content": "structure and control (Reyer & Papalambros, 2002; Ravichandran et al., 2006). Park & Asada (1994)", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 144, + 506, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 506, + 155 + ], + "score": 1.0, + "content": "jointly optimize the link geometry of a high-speed robot arm along with the parameters of a PD joint", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 506, + 167 + ], + "score": 1.0, + "content": "controller. These methods often rely upon access to an accurate model of the robot dynamics in", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 166, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 106, + 166, + 505, + 177 + ], + "score": 1.0, + "content": "order to design the controller. In order to reduce the dependence upon a detailed analytical model,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "score": 1.0, + "content": "Pil & Asada (1996) use on-robot experiments to refine their model as part of the iterative design", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 187, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 104, + 187, + 506, + 200 + ], + "score": 1.0, + "content": "process. More recently, Villarreal-Cervantes et al. (2013) allow for some degree of uncertainty in", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 197, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 505, + 212 + ], + "score": 1.0, + "content": "the model by including the sensitivity of the design and control parameters to model uncertainty", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 506, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 506, + 222 + ], + "score": 1.0, + "content": "along with the task-specific optimization objectives. However, existing methods still rely upon", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "score": 1.0, + "content": "access to an analytical model of the robot dynamics and are typically limited to simple (e.g., linear)", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 231, + 506, + 243 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 506, + 243 + ], + "score": 1.0, + "content": "control designs. Our method assumes only that the controller can be modeled via a convolutional", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "score": 1.0, + "content": "neural network, and can thereby learn complex, highly nonlinear control policies with no a priori", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 254, + 244, + 265 + ], + "spans": [ + { + "bbox": [ + 106, + 254, + 244, + 265 + ], + "score": 1.0, + "content": "knowledge of the robot dynamics.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 107, + 269, + 505, + 478 + ], + "lines": [ + { + "bbox": [ + 106, + 270, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 505, + 281 + ], + "score": 1.0, + "content": "Far more attention has been paid to the individual problem of task-driven optimization of robot", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 281, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 505, + 294 + ], + "score": 1.0, + "content": "motion and control. Given an arbitrary robot design chosen by novice users, Megaro et al. (2015)", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 291, + 506, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 506, + 304 + ], + "score": 1.0, + "content": "describe an interactive design framework that solves for a realizable walking gait that results in", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 303, + 505, + 315 + ], + "spans": [ + { + "bbox": [ + 106, + 303, + 505, + 315 + ], + "score": 1.0, + "content": "stable locomotion. Similarly, Mordatch et al. (2012) synthesize emergent behaviors (motion) for", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 314, + 506, + 326 + ], + "spans": [ + { + "bbox": [ + 105, + 314, + 506, + 326 + ], + "score": 1.0, + "content": "arbitrary morphologies and tasks from high-level specifications, by jointly optimizing over contact", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 325, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 506, + 338 + ], + "score": 1.0, + "content": "and motion. Mordatch et al. (2015) build upon this work by training recurrent neural networks to", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 335, + 505, + 349 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 505, + 349 + ], + "score": 1.0, + "content": "serve as feedback controllers capable of producing complex, stable behaviors for a variety of dy-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 346, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 505, + 360 + ], + "score": 1.0, + "content": "namical systems. Their method interleaves supervised learning with trajectory optimization, and", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 358, + 506, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 506, + 370 + ], + "score": 1.0, + "content": "incorporates noise to improve generalizability. Meanwhile, there is a large body of literature that", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 368, + 505, + 382 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 505, + 382 + ], + "score": 1.0, + "content": "formulates motion synthesis as a trajectory optimization problem. This approach has proven effec-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 380, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 505, + 392 + ], + "score": 1.0, + "content": "tive at respecting contact constraints (e.g., between the foot and ground), which make controlling", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "score": 1.0, + "content": "dynamic motion particularly challenging (Dai & Tedrake, 2016; Posa et al., 2016; Griffin & Grizzle,", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 401, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 506, + 414 + ], + "score": 1.0, + "content": "2016). These approaches have been shown to generate sophisticated behaviors for complex robot", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "score": 1.0, + "content": "designs (e.g., humanoids) (Tassa et al., 2012), and for robots of arbitrary morphologies using only", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 423, + 507, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 507, + 437 + ], + "score": 1.0, + "content": "a high-level specification of the robot’s shape, gait, and task (Wampler et al., 2013). Related, a", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 434, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 506, + 447 + ], + "score": 1.0, + "content": "number of methods interleave trajectory optimization and supervised learning with neural network", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 445, + 506, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 506, + 457 + ], + "score": 1.0, + "content": "regression (Levine & Abbeel, 2014; Levine & Koltun, 2014; Mordatch & Todorov, 2014; Mordatch", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 456, + 506, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 506, + 469 + ], + "score": 1.0, + "content": "et al., 2015). Unlike our method, the use of trajectory optimization makes these approaches reliant", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 467, + 230, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 230, + 479 + ], + "score": 1.0, + "content": "upon knowledge of the model.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 484, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "score": 1.0, + "content": "A great deal of attention of-late has focused on the problem of learning complex control policies", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 495, + 506, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 506, + 508 + ], + "score": 1.0, + "content": "directly from low-level sensory input, without any knowledge of the system dynamics. Methods that", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 506, + 504, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 504, + 518 + ], + "score": 1.0, + "content": "have proven particularly effective combine neural networks that learn representations of the high-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 515, + 506, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 506, + 530 + ], + "score": 1.0, + "content": "dimensional raw sensor input with deep reinforcement learning (Riedmiller, 2005; Mnih et al., 2013;", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 527, + 505, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 505, + 540 + ], + "score": 1.0, + "content": "2015; Schulman et al., 2015a). While much of the work in this area focuses on low-dimensional,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 538, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 506, + 552 + ], + "score": 1.0, + "content": "discrete action spaces, several methods have been recently proposed that learn continuous control", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "policies through deep reinforcement learning. These techniques have been applied to control simple,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 104, + 559, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 104, + 559, + 506, + 574 + ], + "score": 1.0, + "content": "simulated robots (Wawrzynski, 2009; Wawrzy ´ nski & Tanwani, 2013; Watter et al., 2015; Lillicrap ´", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "score": 1.0, + "content": "et al., 2015), perform robot manipulation (Levine et al., 2016a;b; Gu et al., 2017), and control legged", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 582, + 309, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 309, + 595 + ], + "score": 1.0, + "content": "robots (Schulman et al., 2015b; Peng et al., 2016).", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 39.5 + }, + { + "type": "text", + "bbox": [ + 107, + 599, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 598, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 506, + 613 + ], + "score": 1.0, + "content": "Black-box optimization (Schmidhuber et al., 2007; Risi & Togelius, 2017) is an alternative to using", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 104, + 610, + 505, + 624 + ], + "spans": [ + { + "bbox": [ + 104, + 610, + 505, + 624 + ], + "score": 1.0, + "content": "reinforcement learning to training the control policy. These approaches have the advantage that they", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 621, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 506, + 635 + ], + "score": 1.0, + "content": "do not involve backpropagating gradients, are insensitive to reward sparsity, and can handle long", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 633, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 645 + ], + "score": 1.0, + "content": "time horizons. While black-box optimization strategies have traditionally been thought of as ill-", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 642, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 642, + 505, + 657 + ], + "score": 1.0, + "content": "suited to difficult reinforcement learning problems, Salimans et al. (2017) recently showed that they", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "score": 1.0, + "content": "perform similarly to state-of-the-art RL methods on difficult continuous control problems, including", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "those that involve locomotion. Closely related is the policy-gradient method of Sehnke et al. (2010),", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 676, + 505, + 688 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 688 + ], + "score": 1.0, + "content": "who define the policy as a distribution over the parameters of a controller, which they then sample", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "over. This results in gradient estimates that are far less noisy than is typical of policy gradient", + "type": "text" + } + ], + "index": 53 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "algorithms. These approaches are similar to the way in which we learn the robot design, which we", + "type": "text" + } + ], + "index": 54 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "formulate as a Gaussian mixture model over design parameters. Indeed, the two referenced methods", + "type": "text" + } + ], + "index": 55 + }, + { + "bbox": [ + 105, + 720, + 479, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 479, + 732 + ], + "score": 1.0, + "content": "yield the same gradient estimate for Gaussian parameter distributions (Salimans et al., 2017).", + "type": "text" + } + ], + "index": 56 + } + ], + "index": 50.5 + } + ], + "page_idx": 2, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 309, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 309, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 303, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 82, + 505, + 107 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 111, + 505, + 264 + ], + "lines": [ + { + "bbox": [ + 106, + 110, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 106, + 110, + 505, + 123 + ], + "score": 1.0, + "content": "While the focus on simultaneous optimization over robot design and motion parameters is relatively", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 122, + 506, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 506, + 134 + ], + "score": 1.0, + "content": "new, there is a long history of research focused on the related problem of co-design of physical", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "score": 1.0, + "content": "structure and control (Reyer & Papalambros, 2002; Ravichandran et al., 2006). Park & Asada (1994)", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 144, + 506, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 506, + 155 + ], + "score": 1.0, + "content": "jointly optimize the link geometry of a high-speed robot arm along with the parameters of a PD joint", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 506, + 167 + ], + "score": 1.0, + "content": "controller. These methods often rely upon access to an accurate model of the robot dynamics in", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 166, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 106, + 166, + 505, + 177 + ], + "score": 1.0, + "content": "order to design the controller. In order to reduce the dependence upon a detailed analytical model,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "score": 1.0, + "content": "Pil & Asada (1996) use on-robot experiments to refine their model as part of the iterative design", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 187, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 104, + 187, + 506, + 200 + ], + "score": 1.0, + "content": "process. More recently, Villarreal-Cervantes et al. (2013) allow for some degree of uncertainty in", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 197, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 505, + 212 + ], + "score": 1.0, + "content": "the model by including the sensitivity of the design and control parameters to model uncertainty", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 506, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 506, + 222 + ], + "score": 1.0, + "content": "along with the task-specific optimization objectives. However, existing methods still rely upon", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "score": 1.0, + "content": "access to an analytical model of the robot dynamics and are typically limited to simple (e.g., linear)", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 231, + 506, + 243 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 506, + 243 + ], + "score": 1.0, + "content": "control designs. Our method assumes only that the controller can be modeled via a convolutional", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "score": 1.0, + "content": "neural network, and can thereby learn complex, highly nonlinear control policies with no a priori", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 254, + 244, + 265 + ], + "spans": [ + { + "bbox": [ + 106, + 254, + 244, + 265 + ], + "score": 1.0, + "content": "knowledge of the robot dynamics.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 8.5, + "bbox_fs": [ + 104, + 110, + 506, + 265 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 269, + 505, + 478 + ], + "lines": [ + { + "bbox": [ + 106, + 270, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 505, + 281 + ], + "score": 1.0, + "content": "Far more attention has been paid to the individual problem of task-driven optimization of robot", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 281, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 505, + 294 + ], + "score": 1.0, + "content": "motion and control. Given an arbitrary robot design chosen by novice users, Megaro et al. (2015)", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 291, + 506, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 506, + 304 + ], + "score": 1.0, + "content": "describe an interactive design framework that solves for a realizable walking gait that results in", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 303, + 505, + 315 + ], + "spans": [ + { + "bbox": [ + 106, + 303, + 505, + 315 + ], + "score": 1.0, + "content": "stable locomotion. Similarly, Mordatch et al. (2012) synthesize emergent behaviors (motion) for", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 314, + 506, + 326 + ], + "spans": [ + { + "bbox": [ + 105, + 314, + 506, + 326 + ], + "score": 1.0, + "content": "arbitrary morphologies and tasks from high-level specifications, by jointly optimizing over contact", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 325, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 506, + 338 + ], + "score": 1.0, + "content": "and motion. Mordatch et al. (2015) build upon this work by training recurrent neural networks to", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 335, + 505, + 349 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 505, + 349 + ], + "score": 1.0, + "content": "serve as feedback controllers capable of producing complex, stable behaviors for a variety of dy-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 346, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 505, + 360 + ], + "score": 1.0, + "content": "namical systems. Their method interleaves supervised learning with trajectory optimization, and", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 358, + 506, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 506, + 370 + ], + "score": 1.0, + "content": "incorporates noise to improve generalizability. Meanwhile, there is a large body of literature that", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 368, + 505, + 382 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 505, + 382 + ], + "score": 1.0, + "content": "formulates motion synthesis as a trajectory optimization problem. This approach has proven effec-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 380, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 505, + 392 + ], + "score": 1.0, + "content": "tive at respecting contact constraints (e.g., between the foot and ground), which make controlling", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "score": 1.0, + "content": "dynamic motion particularly challenging (Dai & Tedrake, 2016; Posa et al., 2016; Griffin & Grizzle,", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 401, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 506, + 414 + ], + "score": 1.0, + "content": "2016). These approaches have been shown to generate sophisticated behaviors for complex robot", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "score": 1.0, + "content": "designs (e.g., humanoids) (Tassa et al., 2012), and for robots of arbitrary morphologies using only", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 423, + 507, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 507, + 437 + ], + "score": 1.0, + "content": "a high-level specification of the robot’s shape, gait, and task (Wampler et al., 2013). Related, a", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 434, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 506, + 447 + ], + "score": 1.0, + "content": "number of methods interleave trajectory optimization and supervised learning with neural network", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 445, + 506, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 506, + 457 + ], + "score": 1.0, + "content": "regression (Levine & Abbeel, 2014; Levine & Koltun, 2014; Mordatch & Todorov, 2014; Mordatch", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 456, + 506, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 506, + 469 + ], + "score": 1.0, + "content": "et al., 2015). Unlike our method, the use of trajectory optimization makes these approaches reliant", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 467, + 230, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 230, + 479 + ], + "score": 1.0, + "content": "upon knowledge of the model.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 270, + 507, + 479 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 484, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "score": 1.0, + "content": "A great deal of attention of-late has focused on the problem of learning complex control policies", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 495, + 506, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 506, + 508 + ], + "score": 1.0, + "content": "directly from low-level sensory input, without any knowledge of the system dynamics. Methods that", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 506, + 504, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 504, + 518 + ], + "score": 1.0, + "content": "have proven particularly effective combine neural networks that learn representations of the high-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 515, + 506, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 506, + 530 + ], + "score": 1.0, + "content": "dimensional raw sensor input with deep reinforcement learning (Riedmiller, 2005; Mnih et al., 2013;", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 527, + 505, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 505, + 540 + ], + "score": 1.0, + "content": "2015; Schulman et al., 2015a). While much of the work in this area focuses on low-dimensional,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 538, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 506, + 552 + ], + "score": 1.0, + "content": "discrete action spaces, several methods have been recently proposed that learn continuous control", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "policies through deep reinforcement learning. These techniques have been applied to control simple,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 104, + 559, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 104, + 559, + 506, + 574 + ], + "score": 1.0, + "content": "simulated robots (Wawrzynski, 2009; Wawrzy ´ nski & Tanwani, 2013; Watter et al., 2015; Lillicrap ´", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "score": 1.0, + "content": "et al., 2015), perform robot manipulation (Levine et al., 2016a;b; Gu et al., 2017), and control legged", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 582, + 309, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 309, + 595 + ], + "score": 1.0, + "content": "robots (Schulman et al., 2015b; Peng et al., 2016).", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 39.5, + "bbox_fs": [ + 104, + 483, + 506, + 595 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 599, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 598, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 506, + 613 + ], + "score": 1.0, + "content": "Black-box optimization (Schmidhuber et al., 2007; Risi & Togelius, 2017) is an alternative to using", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 104, + 610, + 505, + 624 + ], + "spans": [ + { + "bbox": [ + 104, + 610, + 505, + 624 + ], + "score": 1.0, + "content": "reinforcement learning to training the control policy. These approaches have the advantage that they", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 621, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 506, + 635 + ], + "score": 1.0, + "content": "do not involve backpropagating gradients, are insensitive to reward sparsity, and can handle long", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 633, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 645 + ], + "score": 1.0, + "content": "time horizons. While black-box optimization strategies have traditionally been thought of as ill-", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 642, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 642, + 505, + 657 + ], + "score": 1.0, + "content": "suited to difficult reinforcement learning problems, Salimans et al. (2017) recently showed that they", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "score": 1.0, + "content": "perform similarly to state-of-the-art RL methods on difficult continuous control problems, including", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "those that involve locomotion. Closely related is the policy-gradient method of Sehnke et al. (2010),", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 676, + 505, + 688 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 688 + ], + "score": 1.0, + "content": "who define the policy as a distribution over the parameters of a controller, which they then sample", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "over. This results in gradient estimates that are far less noisy than is typical of policy gradient", + "type": "text" + } + ], + "index": 53 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "algorithms. These approaches are similar to the way in which we learn the robot design, which we", + "type": "text" + } + ], + "index": 54 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "formulate as a Gaussian mixture model over design parameters. Indeed, the two referenced methods", + "type": "text" + } + ], + "index": 55 + }, + { + "bbox": [ + 105, + 720, + 479, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 479, + 732 + ], + "score": 1.0, + "content": "yield the same gradient estimate for Gaussian parameter distributions (Salimans et al., 2017).", + "type": "text" + } + ], + "index": 56 + } + ], + "index": 50.5, + "bbox_fs": [ + 104, + 598, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 182 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "Meanwhile, much work has focused on the problem of determining robot designs that meet the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "requirements of a particular task. Given a user demonstration of the desired behaviors, Coros et al.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 505, + 117 + ], + "score": 1.0, + "content": "(2013) learn optimum kinematic linkages that are capable of reproducing these motions. Mehta", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "et al. (2014) synthesize electromechanical robot designs in a compositional fashion based upon a", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 506, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 506, + 139 + ], + "score": 1.0, + "content": "complete user-specified structural specification of the robot. Mehta et al. (2016) build upon this", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "score": 1.0, + "content": "work, allowing the user to specify functional objectives via structured English, which is parsed to", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 148, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 505, + 162 + ], + "score": 1.0, + "content": "a formal specification using linear temporal logic. Censi (2017) describes a theory for co-design", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 158, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 158, + 506, + 172 + ], + "score": 1.0, + "content": "that includes the ability to select discrete robot parts according to functional constraints, but do not", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 171, + 239, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 239, + 183 + ], + "score": 1.0, + "content": "reason over geometry or motion.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 107, + 187, + 505, + 275 + ], + "lines": [ + { + "bbox": [ + 105, + 187, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 199 + ], + "score": 1.0, + "content": "Related to our approach is recent work that jointly optimizes sensor design and inference algorithms", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 199, + 505, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 505, + 211 + ], + "score": 1.0, + "content": "for perception systems. Chakrabarti (2016) considers the problem of jointly learning a camera sen-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "sor’s multiplexing pattern along with reconstruction methods for imaging tasks. They model infer-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "score": 1.0, + "content": "ence as a neural network together and use stochastic gradient descent to backpropagate the loss to", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 230, + 505, + 244 + ], + "spans": [ + { + "bbox": [ + 104, + 230, + 505, + 244 + ], + "score": 1.0, + "content": "a neural layer representation of the multiplexing pattern. Related, Schaff et al. (2017) jointly learn", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 242, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 505, + 254 + ], + "score": 1.0, + "content": "design and inference for beacon-based localization. They encode beacon allocation (spatially and", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 253, + 505, + 265 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 505, + 265 + ], + "score": 1.0, + "content": "across transmission channels) as a differential neural layer that interfaces with a neural network for", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 263, + 495, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 263, + 495, + 276 + ], + "score": 1.0, + "content": "inference. Joint optimization then follows from standard techniques for training neural networks.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 12.5 + }, + { + "type": "title", + "bbox": [ + 108, + 290, + 182, + 303 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 185, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 185, + 306 + ], + "score": 1.0, + "content": "3 APPROACH", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 108, + 315, + 505, + 337 + ], + "lines": [ + { + "bbox": [ + 105, + 313, + 505, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 505, + 329 + ], + "score": 1.0, + "content": "In this section, we begin by describing the standard reinforcement learning framework for training", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 325, + 500, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 500, + 339 + ], + "score": 1.0, + "content": "agent policies, and then describe how we extend this to also learn the physical design of the agent.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "title", + "bbox": [ + 109, + 350, + 317, + 361 + ], + "lines": [ + { + "bbox": [ + 106, + 350, + 320, + 362 + ], + "spans": [ + { + "bbox": [ + 106, + 350, + 320, + 362 + ], + "score": 1.0, + "content": "3.1 REINFORCEMENT LEARNING BACKGROUND", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 370, + 505, + 438 + ], + "lines": [ + { + "bbox": [ + 105, + 370, + 506, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 506, + 383 + ], + "score": 1.0, + "content": "In the standard reinforcement learning setting, an agent interacts with its environment, usually a", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 381, + 506, + 395 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 454, + 395 + ], + "score": 1.0, + "content": "Markov Decision Process, over a number of discrete timesteps. At each time step", + "type": "text" + }, + { + "bbox": [ + 454, + 383, + 460, + 392 + ], + "score": 0.66, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 381, + 506, + 395 + ], + "score": 1.0, + "content": ", the agent", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 392, + 506, + 406 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 169, + 406 + ], + "score": 1.0, + "content": "receives a state", + "type": "text" + }, + { + "bbox": [ + 170, + 393, + 199, + 404 + ], + "score": 0.92, + "content": "s _ { t } \\in S", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 392, + 267, + 406 + ], + "score": 1.0, + "content": "and takes action", + "type": "text" + }, + { + "bbox": [ + 268, + 393, + 299, + 404 + ], + "score": 0.92, + "content": "a _ { t } \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 392, + 387, + 406 + ], + "score": 1.0, + "content": "according to a policy", + "type": "text" + }, + { + "bbox": [ + 388, + 393, + 435, + 403 + ], + "score": 0.9, + "content": "\\pi : { \\mathcal { S } } A", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 392, + 506, + 406 + ], + "score": 1.0, + "content": ". Then, the agent", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 404, + 506, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 404, + 206, + 417 + ], + "score": 1.0, + "content": "receives a scalar reward", + "type": "text" + }, + { + "bbox": [ + 207, + 405, + 216, + 415 + ], + "score": 0.85, + "content": "r _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 404, + 292, + 417 + ], + "score": 1.0, + "content": "and the next state", + "type": "text" + }, + { + "bbox": [ + 293, + 405, + 312, + 416 + ], + "score": 0.89, + "content": "s _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 404, + 506, + 417 + ], + "score": 1.0, + "content": "from the environment. This process continues", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 415, + 505, + 427 + ], + "spans": [ + { + "bbox": [ + 106, + 415, + 474, + 427 + ], + "score": 1.0, + "content": "until a terminal state is reached. The goal of reinforcement learning is to then find a policy", + "type": "text" + }, + { + "bbox": [ + 474, + 415, + 486, + 425 + ], + "score": 0.85, + "content": "\\pi ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 415, + 505, + 427 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 104, + 423, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 104, + 423, + 231, + 441 + ], + "score": 1.0, + "content": "maximizes the expected return", + "type": "text" + }, + { + "bbox": [ + 231, + 425, + 256, + 438 + ], + "score": 0.92, + "content": "\\mathbb { E } [ \\mathcal { R } _ { t } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 423, + 287, + 441 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 287, + 425, + 365, + 439 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\mathcal { R } _ { t } = \\sum _ { i = 0 } ^ { \\infty } \\gamma ^ { i } r _ { t + i } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 423, + 383, + 441 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 383, + 425, + 423, + 438 + ], + "score": 0.92, + "content": "\\gamma \\in [ 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 423, + 505, + 441 + ], + "score": 1.0, + "content": "is a discount factor.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 107, + 442, + 505, + 564 + ], + "lines": [ + { + "bbox": [ + 105, + 441, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 505, + 456 + ], + "score": 1.0, + "content": "Policy gradient methods are a class of algorithms often used to optimize reinforcement learning", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 454, + 505, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 505, + 466 + ], + "score": 1.0, + "content": "problems, due to their ability to optimize cumulative reward and the ease with which the can be used", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 464, + 505, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 505, + 477 + ], + "score": 1.0, + "content": "with neural networks and other nonlinear function approximators. Consequently, they are com-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 475, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 475, + 505, + 489 + ], + "score": 1.0, + "content": "monly used for reinforcement learning problems that involve complex, continuous action spaces.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 486, + 506, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 371, + 500 + ], + "score": 1.0, + "content": "Policy gradient methods directly parameterize a stochastic policy", + "type": "text" + }, + { + "bbox": [ + 371, + 486, + 410, + 498 + ], + "score": 0.94, + "content": "\\bar { \\pi _ { \\boldsymbol { \\theta } } } ( a _ { t } | \\boldsymbol { s } _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 486, + 506, + 500 + ], + "score": 1.0, + "content": "and perform stochastic", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 497, + 506, + 511 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 506, + 511 + ], + "score": 1.0, + "content": "gradient ascent on the expected return. “Vanilla” policy gradient methods compute an estimate of", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 508, + 506, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 158, + 521 + ], + "score": 1.0, + "content": "the gradient", + "type": "text" + }, + { + "bbox": [ + 158, + 508, + 196, + 520 + ], + "score": 0.93, + "content": "\\nabla _ { \\boldsymbol { \\theta } } \\mathbb { E } [ \\mathcal { R } _ { t } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 197, + 508, + 378, + 521 + ], + "score": 1.0, + "content": "using a sample-based mean computed over", + "type": "text" + }, + { + "bbox": [ + 379, + 508, + 458, + 520 + ], + "score": 0.91, + "content": "\\nabla _ { \\theta } \\log \\pi _ { \\theta } ( \\bar { a _ { t } } \\vert s _ { t } ) \\mathcal { R } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 508, + 506, + 521 + ], + "score": 1.0, + "content": "(Williams,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "score": 1.0, + "content": "1992), which yields an unbiased gradient estimate (Sutton et al., 2000). While the variance in the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 531, + 504, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 504, + 543 + ], + "score": 1.0, + "content": "resulting estimate decreases with the number of samples, sampling is computationally expensive.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 541, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 505, + 554 + ], + "score": 1.0, + "content": "Another way to reduce variance while maintaining an unbiased estimate is to estimate the gradient", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 552, + 324, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 299, + 565 + ], + "score": 1.0, + "content": "by comparing the reward to a “baseline” reward", + "type": "text" + }, + { + "bbox": [ + 300, + 552, + 321, + 564 + ], + "score": 0.92, + "content": "b ( s _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 552, + 324, + 565 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 106, + 569, + 505, + 646 + ], + "lines": [ + { + "bbox": [ + 106, + 569, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 505, + 582 + ], + "score": 1.0, + "content": "These methods are effective but can be unstable, especially when used for deep reinforcement learn-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 579, + 505, + 593 + ], + "spans": [ + { + "bbox": [ + 105, + 579, + 505, + 593 + ], + "score": 1.0, + "content": "ing. Small changes to the policy parameters may cause large changes in the distribution of visited", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 592, + 505, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 592, + 505, + 603 + ], + "score": 1.0, + "content": "states. Several methods have been proposed to mitigate these effects. Among them, Schulman et al.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 602, + 505, + 615 + ], + "spans": [ + { + "bbox": [ + 106, + 602, + 505, + 615 + ], + "score": 1.0, + "content": "(2015a) introduce Trust Region Policy Optimization (TRPO), which imposes a constraint on the KL-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 613, + 505, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 505, + 626 + ], + "score": 1.0, + "content": "divergence between policies before and after an update. Recently, Schulman et al. (2017) proposed", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 624, + 505, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 505, + 636 + ], + "score": 1.0, + "content": "proximal policy optimization (PPO), a first-order class of methods similar to TRPO. PPO alternates", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 634, + 482, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 634, + 482, + 648 + ], + "score": 1.0, + "content": "between sampling data through interaction with the environment and optimizing the objective", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 41 + }, + { + "type": "interline_equation", + "bbox": [ + 213, + 648, + 396, + 669 + ], + "lines": [ + { + "bbox": [ + 213, + 648, + 396, + 669 + ], + "spans": [ + { + "bbox": [ + 213, + 648, + 396, + 669 + ], + "score": 0.91, + "content": "\\hat { \\mathbb { E } } _ { t } \\left[ \\operatorname* { m i n } ( r _ { t } ( \\theta ) \\hat { A } _ { t } , \\operatorname { c l i p } ( r _ { t } ( \\theta ) , 1 - \\epsilon , 1 + \\epsilon ) ) \\right] ,", + "type": "interline_equation", + "image_path": "b0404ccd7847b3087ede7fdf66114a8fcc5dbdb719766f039eb092b8ecde360c.jpg" + } + ] + } + ], + "index": 45, + "virtual_lines": [ + { + "bbox": [ + 213, + 648, + 396, + 669 + ], + "spans": [], + "index": 45 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 672, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 672, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 673, + 134, + 685 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 135, + 672, + 214, + 689 + ], + "score": 0.92, + "content": "\\begin{array} { r } { r _ { t } ( \\theta ) = \\frac { \\pi _ { \\theta } ( a _ { t } | s _ { t } ) } { \\pi _ { \\theta _ { \\mathrm { o l d } } } ( a _ { t } | s _ { t } ) } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 672, + 234, + 686 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 235, + 673, + 246, + 685 + ], + "score": 0.88, + "content": "\\hat { \\mathbb { E } } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 672, + 506, + 686 + ], + "score": 1.0, + "content": "represents an empirical average over a finite sample set. This", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 687, + 504, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 504, + 699 + ], + "score": 1.0, + "content": "objective seeks to maximize the expected return while encouraging a small step in policy space. The", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 356, + 712 + ], + "score": 1.0, + "content": "clipping within the objective removes any incentive for moving", + "type": "text" + }, + { + "bbox": [ + 357, + 700, + 378, + 711 + ], + "score": 0.91, + "content": "r _ { t } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 698, + 456, + 712 + ], + "score": 1.0, + "content": "outside the interval", + "type": "text" + }, + { + "bbox": [ + 456, + 699, + 501, + 711 + ], + "score": 0.91, + "content": "[ 1 - \\epsilon , 1 + \\epsilon ]", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 698, + 505, + 712 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "The net effect of this objective is a simple, robust policy gradient algorithm that attains or matches", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 720, + 392, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 392, + 732 + ], + "score": 1.0, + "content": "state-of-the-art results on a wide array of tasks (Schulman et al., 2017).", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 48 + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 309, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 309, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 759 + ], + "lines": [] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 182 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "Meanwhile, much work has focused on the problem of determining robot designs that meet the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "requirements of a particular task. Given a user demonstration of the desired behaviors, Coros et al.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 505, + 117 + ], + "score": 1.0, + "content": "(2013) learn optimum kinematic linkages that are capable of reproducing these motions. Mehta", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "et al. (2014) synthesize electromechanical robot designs in a compositional fashion based upon a", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 506, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 506, + 139 + ], + "score": 1.0, + "content": "complete user-specified structural specification of the robot. Mehta et al. (2016) build upon this", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "score": 1.0, + "content": "work, allowing the user to specify functional objectives via structured English, which is parsed to", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 148, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 505, + 162 + ], + "score": 1.0, + "content": "a formal specification using linear temporal logic. Censi (2017) describes a theory for co-design", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 158, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 158, + 506, + 172 + ], + "score": 1.0, + "content": "that includes the ability to select discrete robot parts according to functional constraints, but do not", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 171, + 239, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 239, + 183 + ], + "score": 1.0, + "content": "reason over geometry or motion.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 83, + 506, + 183 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 187, + 505, + 275 + ], + "lines": [ + { + "bbox": [ + 105, + 187, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 199 + ], + "score": 1.0, + "content": "Related to our approach is recent work that jointly optimizes sensor design and inference algorithms", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 199, + 505, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 505, + 211 + ], + "score": 1.0, + "content": "for perception systems. Chakrabarti (2016) considers the problem of jointly learning a camera sen-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "sor’s multiplexing pattern along with reconstruction methods for imaging tasks. They model infer-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "score": 1.0, + "content": "ence as a neural network together and use stochastic gradient descent to backpropagate the loss to", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 230, + 505, + 244 + ], + "spans": [ + { + "bbox": [ + 104, + 230, + 505, + 244 + ], + "score": 1.0, + "content": "a neural layer representation of the multiplexing pattern. Related, Schaff et al. (2017) jointly learn", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 242, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 505, + 254 + ], + "score": 1.0, + "content": "design and inference for beacon-based localization. They encode beacon allocation (spatially and", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 253, + 505, + 265 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 505, + 265 + ], + "score": 1.0, + "content": "across transmission channels) as a differential neural layer that interfaces with a neural network for", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 263, + 495, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 263, + 495, + 276 + ], + "score": 1.0, + "content": "inference. Joint optimization then follows from standard techniques for training neural networks.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 12.5, + "bbox_fs": [ + 104, + 187, + 505, + 276 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 290, + 182, + 303 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 185, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 185, + 306 + ], + "score": 1.0, + "content": "3 APPROACH", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 108, + 315, + 505, + 337 + ], + "lines": [ + { + "bbox": [ + 105, + 313, + 505, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 505, + 329 + ], + "score": 1.0, + "content": "In this section, we begin by describing the standard reinforcement learning framework for training", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 325, + 500, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 500, + 339 + ], + "score": 1.0, + "content": "agent policies, and then describe how we extend this to also learn the physical design of the agent.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 313, + 505, + 339 + ] + }, + { + "type": "title", + "bbox": [ + 109, + 350, + 317, + 361 + ], + "lines": [ + { + "bbox": [ + 106, + 350, + 320, + 362 + ], + "spans": [ + { + "bbox": [ + 106, + 350, + 320, + 362 + ], + "score": 1.0, + "content": "3.1 REINFORCEMENT LEARNING BACKGROUND", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 370, + 505, + 438 + ], + "lines": [ + { + "bbox": [ + 105, + 370, + 506, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 506, + 383 + ], + "score": 1.0, + "content": "In the standard reinforcement learning setting, an agent interacts with its environment, usually a", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 381, + 506, + 395 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 454, + 395 + ], + "score": 1.0, + "content": "Markov Decision Process, over a number of discrete timesteps. At each time step", + "type": "text" + }, + { + "bbox": [ + 454, + 383, + 460, + 392 + ], + "score": 0.66, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 381, + 506, + 395 + ], + "score": 1.0, + "content": ", the agent", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 392, + 506, + 406 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 169, + 406 + ], + "score": 1.0, + "content": "receives a state", + "type": "text" + }, + { + "bbox": [ + 170, + 393, + 199, + 404 + ], + "score": 0.92, + "content": "s _ { t } \\in S", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 392, + 267, + 406 + ], + "score": 1.0, + "content": "and takes action", + "type": "text" + }, + { + "bbox": [ + 268, + 393, + 299, + 404 + ], + "score": 0.92, + "content": "a _ { t } \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 392, + 387, + 406 + ], + "score": 1.0, + "content": "according to a policy", + "type": "text" + }, + { + "bbox": [ + 388, + 393, + 435, + 403 + ], + "score": 0.9, + "content": "\\pi : { \\mathcal { S } } A", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 392, + 506, + 406 + ], + "score": 1.0, + "content": ". Then, the agent", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 404, + 506, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 404, + 206, + 417 + ], + "score": 1.0, + "content": "receives a scalar reward", + "type": "text" + }, + { + "bbox": [ + 207, + 405, + 216, + 415 + ], + "score": 0.85, + "content": "r _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 404, + 292, + 417 + ], + "score": 1.0, + "content": "and the next state", + "type": "text" + }, + { + "bbox": [ + 293, + 405, + 312, + 416 + ], + "score": 0.89, + "content": "s _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 404, + 506, + 417 + ], + "score": 1.0, + "content": "from the environment. This process continues", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 415, + 505, + 427 + ], + "spans": [ + { + "bbox": [ + 106, + 415, + 474, + 427 + ], + "score": 1.0, + "content": "until a terminal state is reached. The goal of reinforcement learning is to then find a policy", + "type": "text" + }, + { + "bbox": [ + 474, + 415, + 486, + 425 + ], + "score": 0.85, + "content": "\\pi ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 415, + 505, + 427 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 104, + 423, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 104, + 423, + 231, + 441 + ], + "score": 1.0, + "content": "maximizes the expected return", + "type": "text" + }, + { + "bbox": [ + 231, + 425, + 256, + 438 + ], + "score": 0.92, + "content": "\\mathbb { E } [ \\mathcal { R } _ { t } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 423, + 287, + 441 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 287, + 425, + 365, + 439 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\mathcal { R } _ { t } = \\sum _ { i = 0 } ^ { \\infty } \\gamma ^ { i } r _ { t + i } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 423, + 383, + 441 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 383, + 425, + 423, + 438 + ], + "score": 0.92, + "content": "\\gamma \\in [ 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 423, + 505, + 441 + ], + "score": 1.0, + "content": "is a discount factor.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 23.5, + "bbox_fs": [ + 104, + 370, + 506, + 441 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 442, + 505, + 564 + ], + "lines": [ + { + "bbox": [ + 105, + 441, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 505, + 456 + ], + "score": 1.0, + "content": "Policy gradient methods are a class of algorithms often used to optimize reinforcement learning", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 454, + 505, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 505, + 466 + ], + "score": 1.0, + "content": "problems, due to their ability to optimize cumulative reward and the ease with which the can be used", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 464, + 505, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 505, + 477 + ], + "score": 1.0, + "content": "with neural networks and other nonlinear function approximators. Consequently, they are com-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 475, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 475, + 505, + 489 + ], + "score": 1.0, + "content": "monly used for reinforcement learning problems that involve complex, continuous action spaces.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 486, + 506, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 371, + 500 + ], + "score": 1.0, + "content": "Policy gradient methods directly parameterize a stochastic policy", + "type": "text" + }, + { + "bbox": [ + 371, + 486, + 410, + 498 + ], + "score": 0.94, + "content": "\\bar { \\pi _ { \\boldsymbol { \\theta } } } ( a _ { t } | \\boldsymbol { s } _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 486, + 506, + 500 + ], + "score": 1.0, + "content": "and perform stochastic", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 497, + 506, + 511 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 506, + 511 + ], + "score": 1.0, + "content": "gradient ascent on the expected return. “Vanilla” policy gradient methods compute an estimate of", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 508, + 506, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 158, + 521 + ], + "score": 1.0, + "content": "the gradient", + "type": "text" + }, + { + "bbox": [ + 158, + 508, + 196, + 520 + ], + "score": 0.93, + "content": "\\nabla _ { \\boldsymbol { \\theta } } \\mathbb { E } [ \\mathcal { R } _ { t } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 197, + 508, + 378, + 521 + ], + "score": 1.0, + "content": "using a sample-based mean computed over", + "type": "text" + }, + { + "bbox": [ + 379, + 508, + 458, + 520 + ], + "score": 0.91, + "content": "\\nabla _ { \\theta } \\log \\pi _ { \\theta } ( \\bar { a _ { t } } \\vert s _ { t } ) \\mathcal { R } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 508, + 506, + 521 + ], + "score": 1.0, + "content": "(Williams,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "score": 1.0, + "content": "1992), which yields an unbiased gradient estimate (Sutton et al., 2000). While the variance in the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 531, + 504, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 504, + 543 + ], + "score": 1.0, + "content": "resulting estimate decreases with the number of samples, sampling is computationally expensive.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 541, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 505, + 554 + ], + "score": 1.0, + "content": "Another way to reduce variance while maintaining an unbiased estimate is to estimate the gradient", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 552, + 324, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 299, + 565 + ], + "score": 1.0, + "content": "by comparing the reward to a “baseline” reward", + "type": "text" + }, + { + "bbox": [ + 300, + 552, + 321, + 564 + ], + "score": 0.92, + "content": "b ( s _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 552, + 324, + 565 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 441, + 506, + 565 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 569, + 505, + 646 + ], + "lines": [ + { + "bbox": [ + 106, + 569, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 505, + 582 + ], + "score": 1.0, + "content": "These methods are effective but can be unstable, especially when used for deep reinforcement learn-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 579, + 505, + 593 + ], + "spans": [ + { + "bbox": [ + 105, + 579, + 505, + 593 + ], + "score": 1.0, + "content": "ing. Small changes to the policy parameters may cause large changes in the distribution of visited", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 592, + 505, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 592, + 505, + 603 + ], + "score": 1.0, + "content": "states. Several methods have been proposed to mitigate these effects. Among them, Schulman et al.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 602, + 505, + 615 + ], + "spans": [ + { + "bbox": [ + 106, + 602, + 505, + 615 + ], + "score": 1.0, + "content": "(2015a) introduce Trust Region Policy Optimization (TRPO), which imposes a constraint on the KL-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 613, + 505, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 505, + 626 + ], + "score": 1.0, + "content": "divergence between policies before and after an update. Recently, Schulman et al. (2017) proposed", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 624, + 505, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 505, + 636 + ], + "score": 1.0, + "content": "proximal policy optimization (PPO), a first-order class of methods similar to TRPO. PPO alternates", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 634, + 482, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 634, + 482, + 648 + ], + "score": 1.0, + "content": "between sampling data through interaction with the environment and optimizing the objective", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 569, + 505, + 648 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 213, + 648, + 396, + 669 + ], + "lines": [ + { + "bbox": [ + 213, + 648, + 396, + 669 + ], + "spans": [ + { + "bbox": [ + 213, + 648, + 396, + 669 + ], + "score": 0.91, + "content": "\\hat { \\mathbb { E } } _ { t } \\left[ \\operatorname* { m i n } ( r _ { t } ( \\theta ) \\hat { A } _ { t } , \\operatorname { c l i p } ( r _ { t } ( \\theta ) , 1 - \\epsilon , 1 + \\epsilon ) ) \\right] ,", + "type": "interline_equation", + "image_path": "b0404ccd7847b3087ede7fdf66114a8fcc5dbdb719766f039eb092b8ecde360c.jpg" + } + ] + } + ], + "index": 45, + "virtual_lines": [ + { + "bbox": [ + 213, + 648, + 396, + 669 + ], + "spans": [], + "index": 45 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 672, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 672, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 673, + 134, + 685 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 135, + 672, + 214, + 689 + ], + "score": 0.92, + "content": "\\begin{array} { r } { r _ { t } ( \\theta ) = \\frac { \\pi _ { \\theta } ( a _ { t } | s _ { t } ) } { \\pi _ { \\theta _ { \\mathrm { o l d } } } ( a _ { t } | s _ { t } ) } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 672, + 234, + 686 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 235, + 673, + 246, + 685 + ], + "score": 0.88, + "content": "\\hat { \\mathbb { E } } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 672, + 506, + 686 + ], + "score": 1.0, + "content": "represents an empirical average over a finite sample set. This", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 687, + 504, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 504, + 699 + ], + "score": 1.0, + "content": "objective seeks to maximize the expected return while encouraging a small step in policy space. The", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 356, + 712 + ], + "score": 1.0, + "content": "clipping within the objective removes any incentive for moving", + "type": "text" + }, + { + "bbox": [ + 357, + 700, + 378, + 711 + ], + "score": 0.91, + "content": "r _ { t } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 698, + 456, + 712 + ], + "score": 1.0, + "content": "outside the interval", + "type": "text" + }, + { + "bbox": [ + 456, + 699, + 501, + 711 + ], + "score": 0.91, + "content": "[ 1 - \\epsilon , 1 + \\epsilon ]", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 698, + 505, + 712 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "The net effect of this objective is a simple, robust policy gradient algorithm that attains or matches", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 720, + 392, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 392, + 732 + ], + "score": 1.0, + "content": "state-of-the-art results on a wide array of tasks (Schulman et al., 2017).", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 48, + "bbox_fs": [ + 105, + 672, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 107, + 80, + 505, + 241 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 107, + 80, + 505, + 241 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 80, + 505, + 241 + ], + "spans": [ + { + "bbox": [ + 108, + 80, + 505, + 241 + ], + "score": 0.692, + "html": "
Algorithm1Joint Optimization
Initialize πθ(a|s,r),PΦ(r)
while True do
for i ∈[1..np] do
Sample ri,.., rn from pΦ
Collect rollouts with each design
Update 0 to maximize PPO's surrogate objective. end for
for i∈[1..nr] do
Sample ri,.*, rm from pΦ
Compute returns R1,., Rm·
Update to maximize PPO's surrogate objective.
end for
end while
", + "type": "table", + "image_path": "41a743ced4cfdd91b680fed1a1b45d33d82853ca18a3fd986fd096ef072ae2c2.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 80, + 505, + 133.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 133.66666666666666, + 505, + 187.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 187.33333333333331, + 505, + 240.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + } + ], + "index": 1 + }, + { + "type": "title", + "bbox": [ + 107, + 262, + 338, + 274 + ], + "lines": [ + { + "bbox": [ + 105, + 262, + 340, + 275 + ], + "spans": [ + { + "bbox": [ + 105, + 262, + 340, + 275 + ], + "score": 1.0, + "content": "3.2 JOINT OPTIMIZATION OF DESIGN AND CONTROL", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 283, + 505, + 350 + ], + "lines": [ + { + "bbox": [ + 106, + 283, + 505, + 296 + ], + "spans": [ + { + "bbox": [ + 106, + 283, + 505, + 296 + ], + "score": 1.0, + "content": "We extend the standard reinforcement learning formulation by considering the space of possible", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 295, + 506, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 164, + 307 + ], + "score": 1.0, + "content": "robot designs", + "type": "text" + }, + { + "bbox": [ + 165, + 295, + 173, + 305 + ], + "score": 0.73, + "content": "\\Omega", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 295, + 370, + 307 + ], + "score": 1.0, + "content": ". Specifically, we assume that for every design", + "type": "text" + }, + { + "bbox": [ + 371, + 295, + 402, + 306 + ], + "score": 0.9, + "content": "\\mathcal { E } \\in \\Omega", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 295, + 506, + 307 + ], + "score": 1.0, + "content": ", we can define common", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 305, + 505, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 305, + 199, + 318 + ], + "score": 1.0, + "content": "state and action spaces", + "type": "text" + }, + { + "bbox": [ + 199, + 306, + 207, + 316 + ], + "score": 0.76, + "content": "s", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 305, + 225, + 318 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 225, + 306, + 234, + 316 + ], + "score": 0.75, + "content": "\\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 305, + 303, + 318 + ], + "score": 1.0, + "content": ", reward function", + "type": "text" + }, + { + "bbox": [ + 303, + 306, + 331, + 317 + ], + "score": 0.93, + "content": "r ( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 305, + 446, + 318 + ], + "score": 1.0, + "content": ", and initial state distribution", + "type": "text" + }, + { + "bbox": [ + 446, + 306, + 469, + 317 + ], + "score": 0.91, + "content": "p _ { 0 } ( s )", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 305, + 505, + 318 + ], + "score": 1.0, + "content": ", that are", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 316, + 504, + 330 + ], + "spans": [ + { + "bbox": [ + 105, + 316, + 460, + 330 + ], + "score": 1.0, + "content": "meaningful to all designs. The designs differ only in the transition dynamics they induce", + "type": "text" + }, + { + "bbox": [ + 460, + 317, + 504, + 329 + ], + "score": 0.93, + "content": "p \\varepsilon ( s ^ { \\prime } | s , a )", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 327, + 506, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 248, + 340 + ], + "score": 1.0, + "content": "and share a common action space", + "type": "text" + }, + { + "bbox": [ + 248, + 328, + 257, + 338 + ], + "score": 0.75, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 327, + 506, + 340 + ], + "score": 1.0, + "content": "—to achieve this, we assume a common morphology for all", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 339, + 177, + 352 + ], + "spans": [ + { + "bbox": [ + 105, + 339, + 177, + 352 + ], + "score": 1.0, + "content": "possible designs.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 106, + 356, + 505, + 543 + ], + "lines": [ + { + "bbox": [ + 106, + 356, + 506, + 369 + ], + "spans": [ + { + "bbox": [ + 106, + 356, + 275, + 369 + ], + "score": 1.0, + "content": "Our goal then is to find the optimal design", + "type": "text" + }, + { + "bbox": [ + 275, + 356, + 286, + 366 + ], + "score": 0.86, + "content": "\\mathcal { E } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 356, + 331, + 369 + ], + "score": 1.0, + "content": "and policy", + "type": "text" + }, + { + "bbox": [ + 332, + 357, + 347, + 368 + ], + "score": 0.9, + "content": "\\pi _ { \\mathcal { E } ^ { * } } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 356, + 506, + 369 + ], + "score": 1.0, + "content": "pair that maximizes the expected value", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 366, + 505, + 379 + ], + "spans": [ + { + "bbox": [ + 105, + 366, + 505, + 379 + ], + "score": 1.0, + "content": "of a given reward function. However, this is a non-linear, non-convex optimization problem over the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 377, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 104, + 377, + 506, + 392 + ], + "score": 1.0, + "content": "spaces of all possible designs and all possible policies. Solving it exactly would require enumerat-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 389, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 506, + 401 + ], + "score": 1.0, + "content": "ing all possible designs (possibly through discretization of the design space), learning policies for", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 399, + 506, + 413 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 506, + 413 + ], + "score": 1.0, + "content": "each, and comparing the resulting expected rewards. This is computationally infeasible for all but", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 411, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 505, + 423 + ], + "score": 1.0, + "content": "the simplest of cases. Instead, we develop a gradient-based approach to solving this optimization", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 421, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 104, + 421, + 506, + 434 + ], + "score": 1.0, + "content": "problem with the following key components: (1) we maintain a multi-modal distribution over the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 432, + 506, + 446 + ], + "spans": [ + { + "bbox": [ + 104, + 432, + 506, + 446 + ], + "score": 1.0, + "content": "space of physical designs and update this distribution using policy gradient methods in parameter", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 443, + 506, + 457 + ], + "spans": [ + { + "bbox": [ + 104, + 443, + 506, + 457 + ], + "score": 1.0, + "content": "space, similar to Sehnke et al. (2010) and Salimans et al. (2017); and (2) we train a single controller", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 454, + 506, + 467 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 506, + 467 + ], + "score": 1.0, + "content": "to act on all sampled designs during training, providing this controller with the design parameters of", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 466, + 505, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 505, + 478 + ], + "score": 1.0, + "content": "the specific sample it is controlling. We find that the multi-modal stochastic parameterization of the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 476, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 476, + 505, + 489 + ], + "score": 1.0, + "content": "design space allows our method to explore the space more thoroughly (where a uni-modal Gaussian", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 486, + 505, + 501 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 505, + 501 + ], + "score": 1.0, + "content": "distribution would frequently get trapped in local minima). Moreover, a common controller makes", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 497, + 505, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 505, + 510 + ], + "score": 1.0, + "content": "optimization tractable, allowing efficient evaluation of unseen designs. We additionally benefit from", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 509, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 505, + 522 + ], + "score": 1.0, + "content": "learning common strategies across diverse designs, while still adapting different policies to different", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 519, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 506, + 534 + ], + "score": 1.0, + "content": "parts of the design space given the sample parameters as input. Together, these components enable", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 531, + 339, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 339, + 545 + ], + "score": 1.0, + "content": "efficient joint exploration of the design and policy spaces.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 548, + 504, + 592 + ], + "lines": [ + { + "bbox": [ + 105, + 547, + 506, + 560 + ], + "spans": [ + { + "bbox": [ + 105, + 547, + 162, + 560 + ], + "score": 1.0, + "content": "Formally, let", + "type": "text" + }, + { + "bbox": [ + 163, + 548, + 192, + 560 + ], + "score": 0.93, + "content": "p ( r ; \\phi )", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 547, + 367, + 560 + ], + "score": 1.0, + "content": "denote the distribution over designs, and", + "type": "text" + }, + { + "bbox": [ + 367, + 548, + 420, + 560 + ], + "score": 0.93, + "content": "\\pi ( a _ { t } | s _ { t } , r ; \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 547, + 506, + 560 + ], + "score": 1.0, + "content": "a stochastic control", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 559, + 505, + 571 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 204, + 571 + ], + "score": 1.0, + "content": "policy parameterized by", + "type": "text" + }, + { + "bbox": [ + 205, + 559, + 212, + 570 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 559, + 229, + 571 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 230, + 559, + 236, + 569 + ], + "score": 0.79, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 559, + 505, + 571 + ], + "score": 1.0, + "content": "respectively. In our experiments, we use a neural network to model", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 569, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 569, + 177, + 582 + ], + "score": 1.0, + "content": "the control policy", + "type": "text" + }, + { + "bbox": [ + 178, + 572, + 185, + 580 + ], + "score": 0.77, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 569, + 472, + 582 + ], + "score": 1.0, + "content": ", and a Gaussian mixture model as the parametric form of the distribution", + "type": "text" + }, + { + "bbox": [ + 472, + 570, + 501, + 582 + ], + "score": 0.92, + "content": "p ( r ; \\phi )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 569, + 505, + 582 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 580, + 354, + 594 + ], + "spans": [ + { + "bbox": [ + 105, + 580, + 354, + 594 + ], + "score": 1.0, + "content": "Our goal is then to solve the following optimization problem:", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28.5 + }, + { + "type": "interline_equation", + "bbox": [ + 248, + 598, + 362, + 620 + ], + "lines": [ + { + "bbox": [ + 248, + 598, + 362, + 620 + ], + "spans": [ + { + "bbox": [ + 248, + 598, + 362, + 620 + ], + "score": 0.94, + "content": "\\phi ^ { * } , \\theta ^ { * } = \\underset { \\phi , \\theta } { \\arg \\operatorname* { m a x } } \\mathbb { E } _ { r , t } \\left[ \\mathcal { R } _ { t } \\right] ,", + "type": "interline_equation", + "image_path": "3cba5431354f3ab665ec88bbb63f904897e4ef18653b9e0b0f2a6ec18f4d91dd.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 248, + 598, + 362, + 620 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 626, + 424, + 639 + ], + "lines": [ + { + "bbox": [ + 106, + 626, + 426, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 626, + 133, + 640 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 627, + 159, + 639 + ], + "score": 0.92, + "content": "\\mathbb { E } _ { \\boldsymbol { r } , t } [ \\cdot ]", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 626, + 426, + 640 + ], + "score": 1.0, + "content": "is the expectation over robots and trajectories those robots induce.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 107, + 643, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 643, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 505, + 657 + ], + "score": 1.0, + "content": "We use stochastic gradient-based updates to optimize Eqn. 2. Our method (Algorithm 3.2) alternates", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 398, + 667 + ], + "score": 1.0, + "content": "between updating the parameters of the policy and design distributions,", + "type": "text" + }, + { + "bbox": [ + 398, + 655, + 405, + 665 + ], + "score": 0.8, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 655, + 423, + 667 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 424, + 655, + 431, + 667 + ], + "score": 0.84, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 655, + 505, + 667 + ], + "score": 1.0, + "content": ", respectively. We", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "empirically find this to yield convergence to better solutions in a reasonable number of iterations", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 435, + 689 + ], + "score": 1.0, + "content": "compared to performing simultaneous updates. We optimize the policy parameters", + "type": "text" + }, + { + "bbox": [ + 435, + 677, + 441, + 687 + ], + "score": 0.8, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "using Proximal", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 687, + 504, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 497, + 701 + ], + "score": 1.0, + "content": "Policy Optimization. However, instead of collecting data from a single design, we sample a design", + "type": "text" + }, + { + "bbox": [ + 498, + 690, + 504, + 698 + ], + "score": 0.62, + "content": "r", + "type": "inline_equation" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 189, + 712 + ], + "score": 1.0, + "content": "after a fixed number", + "type": "text" + }, + { + "bbox": [ + 190, + 699, + 198, + 709 + ], + "score": 0.8, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 698, + 366, + 712 + ], + "score": 1.0, + "content": "of timesteps according to the distribution", + "type": "text" + }, + { + "bbox": [ + 366, + 700, + 394, + 711 + ], + "score": 0.92, + "content": "p ( r ; \\phi )", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 698, + 423, + 712 + ], + "score": 1.0, + "content": ". After", + "type": "text" + }, + { + "bbox": [ + 423, + 700, + 430, + 709 + ], + "score": 0.77, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "iterations of PPO,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "we freeze the policy parameters and proceed to optimize the parameters of the design distribution.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 395, + 734 + ], + "score": 1.0, + "content": "Without knowledge of the model, we optimize the design parameters", + "type": "text" + }, + { + "bbox": [ + 395, + 721, + 402, + 732 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "via policy gradient over", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 36.5 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 309, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 309, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 107, + 80, + 505, + 241 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 107, + 80, + 505, + 241 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 80, + 505, + 241 + ], + "spans": [ + { + "bbox": [ + 108, + 80, + 505, + 241 + ], + "score": 0.692, + "html": "
Algorithm1Joint Optimization
Initialize πθ(a|s,r),PΦ(r)
while True do
for i ∈[1..np] do
Sample ri,.., rn from pΦ
Collect rollouts with each design
Update 0 to maximize PPO's surrogate objective. end for
for i∈[1..nr] do
Sample ri,.*, rm from pΦ
Compute returns R1,., Rm·
Update to maximize PPO's surrogate objective.
end for
end while
", + "type": "table", + "image_path": "41a743ced4cfdd91b680fed1a1b45d33d82853ca18a3fd986fd096ef072ae2c2.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 80, + 505, + 133.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 133.66666666666666, + 505, + 187.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 187.33333333333331, + 505, + 240.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + } + ], + "index": 1 + }, + { + "type": "title", + "bbox": [ + 107, + 262, + 338, + 274 + ], + "lines": [ + { + "bbox": [ + 105, + 262, + 340, + 275 + ], + "spans": [ + { + "bbox": [ + 105, + 262, + 340, + 275 + ], + "score": 1.0, + "content": "3.2 JOINT OPTIMIZATION OF DESIGN AND CONTROL", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 283, + 505, + 350 + ], + "lines": [ + { + "bbox": [ + 106, + 283, + 505, + 296 + ], + "spans": [ + { + "bbox": [ + 106, + 283, + 505, + 296 + ], + "score": 1.0, + "content": "We extend the standard reinforcement learning formulation by considering the space of possible", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 295, + 506, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 164, + 307 + ], + "score": 1.0, + "content": "robot designs", + "type": "text" + }, + { + "bbox": [ + 165, + 295, + 173, + 305 + ], + "score": 0.73, + "content": "\\Omega", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 295, + 370, + 307 + ], + "score": 1.0, + "content": ". Specifically, we assume that for every design", + "type": "text" + }, + { + "bbox": [ + 371, + 295, + 402, + 306 + ], + "score": 0.9, + "content": "\\mathcal { E } \\in \\Omega", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 295, + 506, + 307 + ], + "score": 1.0, + "content": ", we can define common", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 305, + 505, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 305, + 199, + 318 + ], + "score": 1.0, + "content": "state and action spaces", + "type": "text" + }, + { + "bbox": [ + 199, + 306, + 207, + 316 + ], + "score": 0.76, + "content": "s", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 305, + 225, + 318 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 225, + 306, + 234, + 316 + ], + "score": 0.75, + "content": "\\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 305, + 303, + 318 + ], + "score": 1.0, + "content": ", reward function", + "type": "text" + }, + { + "bbox": [ + 303, + 306, + 331, + 317 + ], + "score": 0.93, + "content": "r ( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 305, + 446, + 318 + ], + "score": 1.0, + "content": ", and initial state distribution", + "type": "text" + }, + { + "bbox": [ + 446, + 306, + 469, + 317 + ], + "score": 0.91, + "content": "p _ { 0 } ( s )", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 305, + 505, + 318 + ], + "score": 1.0, + "content": ", that are", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 316, + 504, + 330 + ], + "spans": [ + { + "bbox": [ + 105, + 316, + 460, + 330 + ], + "score": 1.0, + "content": "meaningful to all designs. The designs differ only in the transition dynamics they induce", + "type": "text" + }, + { + "bbox": [ + 460, + 317, + 504, + 329 + ], + "score": 0.93, + "content": "p \\varepsilon ( s ^ { \\prime } | s , a )", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 327, + 506, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 248, + 340 + ], + "score": 1.0, + "content": "and share a common action space", + "type": "text" + }, + { + "bbox": [ + 248, + 328, + 257, + 338 + ], + "score": 0.75, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 327, + 506, + 340 + ], + "score": 1.0, + "content": "—to achieve this, we assume a common morphology for all", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 339, + 177, + 352 + ], + "spans": [ + { + "bbox": [ + 105, + 339, + 177, + 352 + ], + "score": 1.0, + "content": "possible designs.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6.5, + "bbox_fs": [ + 105, + 283, + 506, + 352 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 356, + 505, + 543 + ], + "lines": [ + { + "bbox": [ + 106, + 356, + 506, + 369 + ], + "spans": [ + { + "bbox": [ + 106, + 356, + 275, + 369 + ], + "score": 1.0, + "content": "Our goal then is to find the optimal design", + "type": "text" + }, + { + "bbox": [ + 275, + 356, + 286, + 366 + ], + "score": 0.86, + "content": "\\mathcal { E } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 356, + 331, + 369 + ], + "score": 1.0, + "content": "and policy", + "type": "text" + }, + { + "bbox": [ + 332, + 357, + 347, + 368 + ], + "score": 0.9, + "content": "\\pi _ { \\mathcal { E } ^ { * } } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 356, + 506, + 369 + ], + "score": 1.0, + "content": "pair that maximizes the expected value", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 366, + 505, + 379 + ], + "spans": [ + { + "bbox": [ + 105, + 366, + 505, + 379 + ], + "score": 1.0, + "content": "of a given reward function. However, this is a non-linear, non-convex optimization problem over the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 377, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 104, + 377, + 506, + 392 + ], + "score": 1.0, + "content": "spaces of all possible designs and all possible policies. Solving it exactly would require enumerat-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 389, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 506, + 401 + ], + "score": 1.0, + "content": "ing all possible designs (possibly through discretization of the design space), learning policies for", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 399, + 506, + 413 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 506, + 413 + ], + "score": 1.0, + "content": "each, and comparing the resulting expected rewards. This is computationally infeasible for all but", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 411, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 505, + 423 + ], + "score": 1.0, + "content": "the simplest of cases. Instead, we develop a gradient-based approach to solving this optimization", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 421, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 104, + 421, + 506, + 434 + ], + "score": 1.0, + "content": "problem with the following key components: (1) we maintain a multi-modal distribution over the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 432, + 506, + 446 + ], + "spans": [ + { + "bbox": [ + 104, + 432, + 506, + 446 + ], + "score": 1.0, + "content": "space of physical designs and update this distribution using policy gradient methods in parameter", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 443, + 506, + 457 + ], + "spans": [ + { + "bbox": [ + 104, + 443, + 506, + 457 + ], + "score": 1.0, + "content": "space, similar to Sehnke et al. (2010) and Salimans et al. (2017); and (2) we train a single controller", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 454, + 506, + 467 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 506, + 467 + ], + "score": 1.0, + "content": "to act on all sampled designs during training, providing this controller with the design parameters of", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 466, + 505, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 505, + 478 + ], + "score": 1.0, + "content": "the specific sample it is controlling. We find that the multi-modal stochastic parameterization of the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 476, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 476, + 505, + 489 + ], + "score": 1.0, + "content": "design space allows our method to explore the space more thoroughly (where a uni-modal Gaussian", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 486, + 505, + 501 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 505, + 501 + ], + "score": 1.0, + "content": "distribution would frequently get trapped in local minima). Moreover, a common controller makes", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 497, + 505, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 505, + 510 + ], + "score": 1.0, + "content": "optimization tractable, allowing efficient evaluation of unseen designs. We additionally benefit from", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 509, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 505, + 522 + ], + "score": 1.0, + "content": "learning common strategies across diverse designs, while still adapting different policies to different", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 519, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 506, + 534 + ], + "score": 1.0, + "content": "parts of the design space given the sample parameters as input. Together, these components enable", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 531, + 339, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 339, + 545 + ], + "score": 1.0, + "content": "efficient joint exploration of the design and policy spaces.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 18, + "bbox_fs": [ + 104, + 356, + 506, + 545 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 548, + 504, + 592 + ], + "lines": [ + { + "bbox": [ + 105, + 547, + 506, + 560 + ], + "spans": [ + { + "bbox": [ + 105, + 547, + 162, + 560 + ], + "score": 1.0, + "content": "Formally, let", + "type": "text" + }, + { + "bbox": [ + 163, + 548, + 192, + 560 + ], + "score": 0.93, + "content": "p ( r ; \\phi )", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 547, + 367, + 560 + ], + "score": 1.0, + "content": "denote the distribution over designs, and", + "type": "text" + }, + { + "bbox": [ + 367, + 548, + 420, + 560 + ], + "score": 0.93, + "content": "\\pi ( a _ { t } | s _ { t } , r ; \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 547, + 506, + 560 + ], + "score": 1.0, + "content": "a stochastic control", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 559, + 505, + 571 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 204, + 571 + ], + "score": 1.0, + "content": "policy parameterized by", + "type": "text" + }, + { + "bbox": [ + 205, + 559, + 212, + 570 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 559, + 229, + 571 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 230, + 559, + 236, + 569 + ], + "score": 0.79, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 559, + 505, + 571 + ], + "score": 1.0, + "content": "respectively. In our experiments, we use a neural network to model", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 569, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 569, + 177, + 582 + ], + "score": 1.0, + "content": "the control policy", + "type": "text" + }, + { + "bbox": [ + 178, + 572, + 185, + 580 + ], + "score": 0.77, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 569, + 472, + 582 + ], + "score": 1.0, + "content": ", and a Gaussian mixture model as the parametric form of the distribution", + "type": "text" + }, + { + "bbox": [ + 472, + 570, + 501, + 582 + ], + "score": 0.92, + "content": "p ( r ; \\phi )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 569, + 505, + 582 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 580, + 354, + 594 + ], + "spans": [ + { + "bbox": [ + 105, + 580, + 354, + 594 + ], + "score": 1.0, + "content": "Our goal is then to solve the following optimization problem:", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 547, + 506, + 594 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 248, + 598, + 362, + 620 + ], + "lines": [ + { + "bbox": [ + 248, + 598, + 362, + 620 + ], + "spans": [ + { + "bbox": [ + 248, + 598, + 362, + 620 + ], + "score": 0.94, + "content": "\\phi ^ { * } , \\theta ^ { * } = \\underset { \\phi , \\theta } { \\arg \\operatorname* { m a x } } \\mathbb { E } _ { r , t } \\left[ \\mathcal { R } _ { t } \\right] ,", + "type": "interline_equation", + "image_path": "3cba5431354f3ab665ec88bbb63f904897e4ef18653b9e0b0f2a6ec18f4d91dd.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 248, + 598, + 362, + 620 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 626, + 424, + 639 + ], + "lines": [ + { + "bbox": [ + 106, + 626, + 426, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 626, + 133, + 640 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 627, + 159, + 639 + ], + "score": 0.92, + "content": "\\mathbb { E } _ { \\boldsymbol { r } , t } [ \\cdot ]", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 626, + 426, + 640 + ], + "score": 1.0, + "content": "is the expectation over robots and trajectories those robots induce.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32, + "bbox_fs": [ + 106, + 626, + 426, + 640 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 643, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 643, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 505, + 657 + ], + "score": 1.0, + "content": "We use stochastic gradient-based updates to optimize Eqn. 2. Our method (Algorithm 3.2) alternates", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 398, + 667 + ], + "score": 1.0, + "content": "between updating the parameters of the policy and design distributions,", + "type": "text" + }, + { + "bbox": [ + 398, + 655, + 405, + 665 + ], + "score": 0.8, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 655, + 423, + 667 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 424, + 655, + 431, + 667 + ], + "score": 0.84, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 655, + 505, + 667 + ], + "score": 1.0, + "content": ", respectively. We", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "empirically find this to yield convergence to better solutions in a reasonable number of iterations", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 435, + 689 + ], + "score": 1.0, + "content": "compared to performing simultaneous updates. We optimize the policy parameters", + "type": "text" + }, + { + "bbox": [ + 435, + 677, + 441, + 687 + ], + "score": 0.8, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "using Proximal", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 687, + 504, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 497, + 701 + ], + "score": 1.0, + "content": "Policy Optimization. However, instead of collecting data from a single design, we sample a design", + "type": "text" + }, + { + "bbox": [ + 498, + 690, + 504, + 698 + ], + "score": 0.62, + "content": "r", + "type": "inline_equation" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 189, + 712 + ], + "score": 1.0, + "content": "after a fixed number", + "type": "text" + }, + { + "bbox": [ + 190, + 699, + 198, + 709 + ], + "score": 0.8, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 698, + 366, + 712 + ], + "score": 1.0, + "content": "of timesteps according to the distribution", + "type": "text" + }, + { + "bbox": [ + 366, + 700, + 394, + 711 + ], + "score": 0.92, + "content": "p ( r ; \\phi )", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 698, + 423, + 712 + ], + "score": 1.0, + "content": ". After", + "type": "text" + }, + { + "bbox": [ + 423, + 700, + 430, + 709 + ], + "score": 0.77, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "iterations of PPO,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "we freeze the policy parameters and proceed to optimize the parameters of the design distribution.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 395, + 734 + ], + "score": 1.0, + "content": "Without knowledge of the model, we optimize the design parameters", + "type": "text" + }, + { + "bbox": [ + 395, + 721, + 402, + 732 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "via policy gradient over", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 267, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 505, + 280 + ], + "score": 1.0, + "content": "parameter space, similar to Sehnke et al. (2010). This is equivalent to black-box optimization", + "type": "text", + "cross_page": true + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 279, + 505, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 505, + 291 + ], + "score": 1.0, + "content": "methods that have proven effective for complex learning problems (Salimans et al., 2017). We", + "type": "text", + "cross_page": true + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 290, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 136, + 303 + ], + "score": 1.0, + "content": "sample", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 137, + 291, + 147, + 300 + ], + "score": 0.72, + "content": "m", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 147, + 290, + 474, + 303 + ], + "score": 1.0, + "content": "different designs and compute their returns for a single episode acting under policy", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 474, + 290, + 501, + 302 + ], + "score": 0.92, + "content": "\\pi ( \\cdot ; \\theta )", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 501, + 290, + 505, + 303 + ], + "score": 1.0, + "content": ".", + "type": "text", + "cross_page": true + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 300, + 506, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 327, + 315 + ], + "score": 1.0, + "content": "We then use this data to shift the design distribution", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 327, + 301, + 354, + 313 + ], + "score": 0.92, + "content": "p ( \\cdot ; \\phi )", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 355, + 300, + 506, + 315 + ], + "score": 1.0, + "content": "in a direction maximizing expected", + "type": "text", + "cross_page": true + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 311, + 327, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 327, + 325 + ], + "score": 1.0, + "content": "return. These iterations are repeated until convergence.", + "type": "text", + "cross_page": true + } + ], + "index": 9 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 643, + 505, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 107, + 80, + 505, + 213 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 80, + 505, + 213 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 80, + 505, + 213 + ], + "spans": [ + { + "bbox": [ + 107, + 80, + 505, + 213 + ], + "score": 0.973, + "type": "image", + "image_path": "0babea94ff71820dd39bdf9c33c7081a0ac16e1f9df8bc584653a1c4ea8568a5.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 80, + 505, + 124.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 124.33333333333334, + 505, + 168.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 168.66666666666669, + 505, + 213.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 224, + 504, + 246 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 223, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 106, + 223, + 505, + 236 + ], + "score": 1.0, + "content": "Figure 2: From left to right: the default Hopper, Walker2d, and Ant robots. The Hopper and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 234, + 467, + 248 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 467, + 248 + ], + "score": 1.0, + "content": "Walker2d are constrained to walk in a line, while the Ant can walk anywhere in the plane.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "text", + "bbox": [ + 107, + 267, + 505, + 323 + ], + "lines": [ + { + "bbox": [ + 105, + 267, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 505, + 280 + ], + "score": 1.0, + "content": "parameter space, similar to Sehnke et al. (2010). This is equivalent to black-box optimization", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 279, + 505, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 505, + 291 + ], + "score": 1.0, + "content": "methods that have proven effective for complex learning problems (Salimans et al., 2017). We", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 290, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 136, + 303 + ], + "score": 1.0, + "content": "sample", + "type": "text" + }, + { + "bbox": [ + 137, + 291, + 147, + 300 + ], + "score": 0.72, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 290, + 474, + 303 + ], + "score": 1.0, + "content": "different designs and compute their returns for a single episode acting under policy", + "type": "text" + }, + { + "bbox": [ + 474, + 290, + 501, + 302 + ], + "score": 0.92, + "content": "\\pi ( \\cdot ; \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 290, + 505, + 303 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 300, + 506, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 327, + 315 + ], + "score": 1.0, + "content": "We then use this data to shift the design distribution", + "type": "text" + }, + { + "bbox": [ + 327, + 301, + 354, + 313 + ], + "score": 0.92, + "content": "p ( \\cdot ; \\phi )", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 300, + 506, + 315 + ], + "score": 1.0, + "content": "in a direction maximizing expected", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 311, + 327, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 327, + 325 + ], + "score": 1.0, + "content": "return. These iterations are repeated until convergence.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7 + }, + { + "type": "title", + "bbox": [ + 108, + 340, + 172, + 353 + ], + "lines": [ + { + "bbox": [ + 104, + 338, + 174, + 356 + ], + "spans": [ + { + "bbox": [ + 104, + 338, + 174, + 356 + ], + "score": 1.0, + "content": "4 RESULTS", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 366, + 505, + 421 + ], + "lines": [ + { + "bbox": [ + 106, + 365, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 106, + 365, + 505, + 378 + ], + "score": 1.0, + "content": "We validate our approach with three commonly used robots provided in OpenAI’s Ro-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 376, + 505, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 505, + 390 + ], + "score": 1.0, + "content": "boschool (Schulman et al., 2017). Environments in Roboschool are built on top of Bullet Physics,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 388, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 506, + 401 + ], + "score": 1.0, + "content": "a popular open-source physics engine. In a series of locomotion experiments, we show that our", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 398, + 506, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 506, + 411 + ], + "score": 1.0, + "content": "approach not only discovers novel robot designs and gaits, but also outperforms two out of three of", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 410, + 502, + 423 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 502, + 423 + ], + "score": 1.0, + "content": "the hand-designed robots trained on the same task and yields performance comparable to the third.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13 + }, + { + "type": "title", + "bbox": [ + 108, + 435, + 228, + 446 + ], + "lines": [ + { + "bbox": [ + 105, + 434, + 230, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 230, + 448 + ], + "score": 1.0, + "content": "4.1 EXPERIMENT DETAILS", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 456, + 505, + 545 + ], + "lines": [ + { + "bbox": [ + 105, + 455, + 505, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 505, + 470 + ], + "score": 1.0, + "content": "We evaluate our approach on three legged locomotion tasks within Roboschool: RoboschoolHopper,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 468, + 505, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 505, + 479 + ], + "score": 1.0, + "content": "RoboschoolWalker2d, and RoboschoolAnt (note that we subsequently drop the Roboschool prefix", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 479, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 505, + 491 + ], + "score": 1.0, + "content": "for brevity). Figure 2 depicts the default Roboschool design for each robot. These environments", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 401, + 502 + ], + "score": 1.0, + "content": "describe a locomotion task that has the robots moving along the positive", + "type": "text" + }, + { + "bbox": [ + 401, + 491, + 408, + 500 + ], + "score": 0.3, + "content": "\\mathbf { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 489, + 505, + 502 + ], + "score": 1.0, + "content": "-axis (to the right in the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 501, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 505, + 513 + ], + "score": 1.0, + "content": "figures) towards a distant goal. The reward function defined in these environments is a weighted", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 511, + 506, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 506, + 524 + ], + "score": 1.0, + "content": "sum of rewards for forward progress and staying upright, and penalties for applying torques and", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 523, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 106, + 523, + 506, + 534 + ], + "score": 1.0, + "content": "for joints that reach their rotational limits. The episode ends when the robot falls over or reaches a", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 533, + 235, + 546 + ], + "spans": [ + { + "bbox": [ + 106, + 533, + 235, + 546 + ], + "score": 1.0, + "content": "maximum number of timesteps.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 107, + 550, + 505, + 616 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 506, + 563 + ], + "score": 1.0, + "content": "We learn robot designs using the morphologies specified by the standard Roboschool designs. For", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "each morphology, we parameterize the robot in terms of the length and radius (e.g., mass) of each", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "score": 1.0, + "content": "link (or just the radius in the case of the sphere for the ant body). We impose symmetry, and share", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "parameters across each leg for the Walker2d and Ant designs. This parameterization permits a wide", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "score": 1.0, + "content": "variety of robots of different shapes and sizes, some of which are better suited to the locomotion", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "objective than others, and some designs that do not permit a control policy that results in locomotion.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 107, + 621, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 621, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 227, + 635 + ], + "score": 1.0, + "content": "We model the control policy", + "type": "text" + }, + { + "bbox": [ + 227, + 621, + 285, + 634 + ], + "score": 0.93, + "content": "\\pi ( a _ { t } | s _ { t } , \\mathcal { E } ; \\theta _ { p } )", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 621, + 506, + 635 + ], + "score": 1.0, + "content": "as a feed forward neural network consisting of three", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 632, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 646 + ], + "score": 1.0, + "content": "fully-connected layers with 64 units and tanh activation functions. A final layer maps the output", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 644, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 505, + 657 + ], + "score": 1.0, + "content": "to the robot action space. With the exception of the last robot-specific layer, the architecture is the", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "score": 1.0, + "content": "same for all experiments. Meanwhile, we represent the distribution over the parameterized robot", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 664, + 505, + 680 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 135, + 680 + ], + "score": 1.0, + "content": "design", + "type": "text" + }, + { + "bbox": [ + 136, + 666, + 166, + 678 + ], + "score": 0.93, + "content": "p ( \\cdot ; \\theta _ { r } )", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 664, + 505, + 680 + ], + "score": 1.0, + "content": "using a Gaussian mixture model with four mixture components (each with a diag-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "onal covariance matrix over the different parameters). We initialize the means of each component", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "randomly within a wide range, and initialize the variances in order to span the range of each parame-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "ter. We find that our approach maintains high variance distributions during early iterations—thereby", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "continuing exploration of the design space—before committing to a chosen design. The appendix", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 721, + 382, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 382, + 733 + ], + "score": 1.0, + "content": "provides further details regardng the evolution of these distributions.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 35.5 + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 309, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 309, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "6", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 107, + 80, + 505, + 213 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 80, + 505, + 213 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 80, + 505, + 213 + ], + "spans": [ + { + "bbox": [ + 107, + 80, + 505, + 213 + ], + "score": 0.973, + "type": "image", + "image_path": "0babea94ff71820dd39bdf9c33c7081a0ac16e1f9df8bc584653a1c4ea8568a5.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 80, + 505, + 124.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 124.33333333333334, + 505, + 168.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 168.66666666666669, + 505, + 213.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 224, + 504, + 246 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 223, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 106, + 223, + 505, + 236 + ], + "score": 1.0, + "content": "Figure 2: From left to right: the default Hopper, Walker2d, and Ant robots. The Hopper and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 234, + 467, + 248 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 467, + 248 + ], + "score": 1.0, + "content": "Walker2d are constrained to walk in a line, while the Ant can walk anywhere in the plane.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "text", + "bbox": [ + 107, + 267, + 505, + 323 + ], + "lines": [], + "index": 7, + "bbox_fs": [ + 105, + 267, + 506, + 325 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 108, + 340, + 172, + 353 + ], + "lines": [ + { + "bbox": [ + 104, + 338, + 174, + 356 + ], + "spans": [ + { + "bbox": [ + 104, + 338, + 174, + 356 + ], + "score": 1.0, + "content": "4 RESULTS", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 366, + 505, + 421 + ], + "lines": [ + { + "bbox": [ + 106, + 365, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 106, + 365, + 505, + 378 + ], + "score": 1.0, + "content": "We validate our approach with three commonly used robots provided in OpenAI’s Ro-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 376, + 505, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 505, + 390 + ], + "score": 1.0, + "content": "boschool (Schulman et al., 2017). Environments in Roboschool are built on top of Bullet Physics,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 388, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 506, + 401 + ], + "score": 1.0, + "content": "a popular open-source physics engine. In a series of locomotion experiments, we show that our", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 398, + 506, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 506, + 411 + ], + "score": 1.0, + "content": "approach not only discovers novel robot designs and gaits, but also outperforms two out of three of", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 410, + 502, + 423 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 502, + 423 + ], + "score": 1.0, + "content": "the hand-designed robots trained on the same task and yields performance comparable to the third.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 365, + 506, + 423 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 435, + 228, + 446 + ], + "lines": [ + { + "bbox": [ + 105, + 434, + 230, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 230, + 448 + ], + "score": 1.0, + "content": "4.1 EXPERIMENT DETAILS", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 456, + 505, + 545 + ], + "lines": [ + { + "bbox": [ + 105, + 455, + 505, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 505, + 470 + ], + "score": 1.0, + "content": "We evaluate our approach on three legged locomotion tasks within Roboschool: RoboschoolHopper,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 468, + 505, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 505, + 479 + ], + "score": 1.0, + "content": "RoboschoolWalker2d, and RoboschoolAnt (note that we subsequently drop the Roboschool prefix", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 479, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 505, + 491 + ], + "score": 1.0, + "content": "for brevity). Figure 2 depicts the default Roboschool design for each robot. These environments", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 401, + 502 + ], + "score": 1.0, + "content": "describe a locomotion task that has the robots moving along the positive", + "type": "text" + }, + { + "bbox": [ + 401, + 491, + 408, + 500 + ], + "score": 0.3, + "content": "\\mathbf { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 489, + 505, + 502 + ], + "score": 1.0, + "content": "-axis (to the right in the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 501, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 505, + 513 + ], + "score": 1.0, + "content": "figures) towards a distant goal. The reward function defined in these environments is a weighted", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 511, + 506, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 506, + 524 + ], + "score": 1.0, + "content": "sum of rewards for forward progress and staying upright, and penalties for applying torques and", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 523, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 106, + 523, + 506, + 534 + ], + "score": 1.0, + "content": "for joints that reach their rotational limits. The episode ends when the robot falls over or reaches a", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 533, + 235, + 546 + ], + "spans": [ + { + "bbox": [ + 106, + 533, + 235, + 546 + ], + "score": 1.0, + "content": "maximum number of timesteps.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 455, + 506, + 546 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 550, + 505, + 616 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 506, + 563 + ], + "score": 1.0, + "content": "We learn robot designs using the morphologies specified by the standard Roboschool designs. For", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "each morphology, we parameterize the robot in terms of the length and radius (e.g., mass) of each", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "score": 1.0, + "content": "link (or just the radius in the case of the sphere for the ant body). We impose symmetry, and share", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "parameters across each leg for the Walker2d and Ant designs. This parameterization permits a wide", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "score": 1.0, + "content": "variety of robots of different shapes and sizes, some of which are better suited to the locomotion", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "objective than others, and some designs that do not permit a control policy that results in locomotion.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 549, + 506, + 618 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 621, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 621, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 227, + 635 + ], + "score": 1.0, + "content": "We model the control policy", + "type": "text" + }, + { + "bbox": [ + 227, + 621, + 285, + 634 + ], + "score": 0.93, + "content": "\\pi ( a _ { t } | s _ { t } , \\mathcal { E } ; \\theta _ { p } )", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 621, + 506, + 635 + ], + "score": 1.0, + "content": "as a feed forward neural network consisting of three", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 632, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 646 + ], + "score": 1.0, + "content": "fully-connected layers with 64 units and tanh activation functions. A final layer maps the output", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 644, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 505, + 657 + ], + "score": 1.0, + "content": "to the robot action space. With the exception of the last robot-specific layer, the architecture is the", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "score": 1.0, + "content": "same for all experiments. Meanwhile, we represent the distribution over the parameterized robot", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 664, + 505, + 680 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 135, + 680 + ], + "score": 1.0, + "content": "design", + "type": "text" + }, + { + "bbox": [ + 136, + 666, + 166, + 678 + ], + "score": 0.93, + "content": "p ( \\cdot ; \\theta _ { r } )", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 664, + 505, + 680 + ], + "score": 1.0, + "content": "using a Gaussian mixture model with four mixture components (each with a diag-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "onal covariance matrix over the different parameters). We initialize the means of each component", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "randomly within a wide range, and initialize the variances in order to span the range of each parame-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "ter. We find that our approach maintains high variance distributions during early iterations—thereby", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "continuing exploration of the design space—before committing to a chosen design. The appendix", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 721, + 382, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 382, + 733 + ], + "score": 1.0, + "content": "provides further details regardng the evolution of these distributions.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 621, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 106, + 84, + 505, + 198 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 106, + 84, + 505, + 198 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 84, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 106, + 84, + 505, + 198 + ], + "score": 0.971, + "type": "image", + "image_path": "87d05764a68b4483dd235162ccd22ce42ae5244a22dfc99728015163faafa544.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 106, + 84, + 505, + 122.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 106, + 122.0, + 505, + 160.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 106, + 160.0, + 505, + 198.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 212, + 505, + 267 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 212, + 505, + 224 + ], + "spans": [ + { + "bbox": [ + 106, + 212, + 505, + 224 + ], + "score": 1.0, + "content": "Figure 3: Training curves that show the evolution of reward across training iterations for the Hopper,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 222, + 504, + 235 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 504, + 235 + ], + "score": 1.0, + "content": "Walker2d, and Ant environments over eight different random seeds. The black dashed line corre-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 232, + 506, + 247 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 506, + 247 + ], + "score": 1.0, + "content": "sponds to the highest achievable performance of the corresponding baseline robot. In other figures,", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 244, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 505, + 258 + ], + "score": 1.0, + "content": "we display the best-performing checkpoint of each run. Therefore, we make each training curve", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 255, + 250, + 268 + ], + "spans": [ + { + "bbox": [ + 106, + 255, + 250, + 268 + ], + "score": 1.0, + "content": "transparent after it stops improving.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 107, + 288, + 505, + 344 + ], + "lines": [ + { + "bbox": [ + 106, + 288, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 106, + 288, + 505, + 302 + ], + "score": 1.0, + "content": "We train our method with eight threads of Proximal Policy Optimization for a total of 300M environ-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 299, + 505, + 313 + ], + "spans": [ + { + "bbox": [ + 106, + 299, + 505, + 313 + ], + "score": 1.0, + "content": "ment timesteps across all threads. We use the publicly available implementation of PPO provided", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 311, + 505, + 323 + ], + "spans": [ + { + "bbox": [ + 106, + 311, + 505, + 323 + ], + "score": 1.0, + "content": "in OpenAI Baselines (Hesse et al., 2017). We alternate between 50 policy PPO iterations and 2", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 321, + 506, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 321, + 506, + 335 + ], + "score": 1.0, + "content": "design iterations, finding this ratio to yield convergence to good solutions. We set this and the other", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 333, + 426, + 346 + ], + "spans": [ + { + "bbox": [ + 105, + 333, + 426, + 346 + ], + "score": 1.0, + "content": "hyper-parameters on the Hopper and used the same settings for all experiments.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10 + }, + { + "type": "title", + "bbox": [ + 107, + 358, + 193, + 370 + ], + "lines": [ + { + "bbox": [ + 106, + 358, + 194, + 370 + ], + "spans": [ + { + "bbox": [ + 106, + 358, + 194, + 370 + ], + "score": 1.0, + "content": "4.2 EXPERIMENTS", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 107, + 380, + 505, + 490 + ], + "lines": [ + { + "bbox": [ + 105, + 379, + 505, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 505, + 393 + ], + "score": 1.0, + "content": "We evaluate the performance of our approach to joint optimization over robot design and control", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 390, + 506, + 404 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 506, + 404 + ], + "score": 1.0, + "content": "on the Hopper, Walker2d, and Ant robots, and compare against a policy trained for the standard", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 401, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 505, + 415 + ], + "score": 1.0, + "content": "Roboschool design. We evaluate the consistency and robustness of our approach relative to the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 411, + 506, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 506, + 426 + ], + "score": 1.0, + "content": "initial robot parameter distribution using several different random seeds. For each robot morphology,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 424, + 506, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 506, + 437 + ], + "score": 1.0, + "content": "we find that our method learns robot designs and the corresponding control policy that are either", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 435, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 506, + 448 + ], + "score": 1.0, + "content": "comparable (Walker2d) or exceed the performance (Hopper and Ant) achievable using the default", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 445, + 506, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 506, + 460 + ], + "score": 1.0, + "content": "designs (Fig. 3). We also see that our method achieves these levels of performance by discovering", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 457, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 469 + ], + "score": 1.0, + "content": "unique robot designs (Fig. 1) together with novel walking gaits (Fig. 4) that can not be achieved with", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 467, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 505, + 480 + ], + "score": 1.0, + "content": "the default designs. Note that our method was able to learn these designs and control policies from", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 478, + 454, + 491 + ], + "spans": [ + { + "bbox": [ + 104, + 478, + 454, + 491 + ], + "score": 1.0, + "content": "a random initialization, without access to a dynamics model or any expert supervision.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 18.5 + }, + { + "type": "text", + "bbox": [ + 107, + 495, + 505, + 627 + ], + "lines": [ + { + "bbox": [ + 106, + 495, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 505, + 508 + ], + "score": 1.0, + "content": "Our method learns a joint design and controller for the Hopper that outperforms the baseline by as", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 506, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 142, + 519 + ], + "score": 1.0, + "content": "much as", + "type": "text" + }, + { + "bbox": [ + 143, + 506, + 162, + 517 + ], + "score": 0.89, + "content": "5 0 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 506, + 505, + 519 + ], + "score": 1.0, + "content": ". Our learned robot exploits the small size of the foot to achieve faster, more precise", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 518, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 106, + 518, + 505, + 530 + ], + "score": 1.0, + "content": "walking gaits. Meanwhile, the longer torso of the learned robot improves stability, allowing it to", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 528, + 506, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 506, + 541 + ], + "score": 1.0, + "content": "maintain balance while locomoting at a faster pace. We found this behavior to be consistent across", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "score": 1.0, + "content": "several different Hopper experiments, with the method converging to designs with a small foot and", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "long, thin torso. In the appendix, we explore the stability of this design with respect to variations", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "in the environment using the coefficient of friction as an example, and find the improvement to", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "be consistent. For the ant, our optimization yields a physical design that is significantly different", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 583, + 504, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 504, + 596 + ], + "score": 1.0, + "content": "from the default design (Fig. 2). Consequently, the learned Ant drastically outperforms the baseline,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 217, + 607 + ], + "score": 1.0, + "content": "improving reward by up to", + "type": "text" + }, + { + "bbox": [ + 218, + 594, + 242, + 605 + ], + "score": 0.89, + "content": "1 1 6 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 594, + 505, + 607 + ], + "score": 1.0, + "content": ". Our method learns a design with a small, lightweight body and", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 604, + 506, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 506, + 619 + ], + "score": 1.0, + "content": "extremely long legs. The long legs enable the ant to apply large torque at contact, allowing it to", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 617, + 187, + 629 + ], + "spans": [ + { + "bbox": [ + 106, + 617, + 187, + 629 + ], + "score": 1.0, + "content": "move at a fast pace.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 107, + 632, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 632, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 645 + ], + "score": 1.0, + "content": "Our framework learned different design-control pairs for the Walker2d that perform similarly to the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "default design. Across several different experiments, we see two distinct, successful designs and", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "walking gaits. Interestingly, neither agent walks primarily on its feet. The first design has small,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "thick legs and long feet. The controller is then able to exploit the thick middle leg link, which", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 677, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 506, + 689 + ], + "score": 1.0, + "content": "protrudes slightly past the foot, to push off the ground. The long foot then provides additional", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 686, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 505, + 702 + ], + "score": 1.0, + "content": "balance. The second design is similar in geometry to the baseline Walker2d, but moves in a very", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "different way. By lowering the knee joint and lengthening the foot, the Walker2d is able to efficiently", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "balance on its knees and toes. This low stance allows the Walker2d to fully extend its leg backwards,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 721, + 432, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 432, + 734 + ], + "score": 1.0, + "content": "creating a long, powerful stride, similar to that of a sprinter using starting blocks.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 40 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 309, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 309, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 303, + 751, + 309, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "score": 1.0, + "content": "7", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 106, + 84, + 505, + 198 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 106, + 84, + 505, + 198 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 84, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 106, + 84, + 505, + 198 + ], + "score": 0.971, + "type": "image", + "image_path": "87d05764a68b4483dd235162ccd22ce42ae5244a22dfc99728015163faafa544.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 106, + 84, + 505, + 122.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 106, + 122.0, + 505, + 160.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 106, + 160.0, + 505, + 198.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 212, + 505, + 267 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 212, + 505, + 224 + ], + "spans": [ + { + "bbox": [ + 106, + 212, + 505, + 224 + ], + "score": 1.0, + "content": "Figure 3: Training curves that show the evolution of reward across training iterations for the Hopper,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 222, + 504, + 235 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 504, + 235 + ], + "score": 1.0, + "content": "Walker2d, and Ant environments over eight different random seeds. The black dashed line corre-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 232, + 506, + 247 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 506, + 247 + ], + "score": 1.0, + "content": "sponds to the highest achievable performance of the corresponding baseline robot. In other figures,", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 244, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 505, + 258 + ], + "score": 1.0, + "content": "we display the best-performing checkpoint of each run. Therefore, we make each training curve", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 255, + 250, + 268 + ], + "spans": [ + { + "bbox": [ + 106, + 255, + 250, + 268 + ], + "score": 1.0, + "content": "transparent after it stops improving.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 107, + 288, + 505, + 344 + ], + "lines": [ + { + "bbox": [ + 106, + 288, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 106, + 288, + 505, + 302 + ], + "score": 1.0, + "content": "We train our method with eight threads of Proximal Policy Optimization for a total of 300M environ-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 299, + 505, + 313 + ], + "spans": [ + { + "bbox": [ + 106, + 299, + 505, + 313 + ], + "score": 1.0, + "content": "ment timesteps across all threads. We use the publicly available implementation of PPO provided", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 311, + 505, + 323 + ], + "spans": [ + { + "bbox": [ + 106, + 311, + 505, + 323 + ], + "score": 1.0, + "content": "in OpenAI Baselines (Hesse et al., 2017). We alternate between 50 policy PPO iterations and 2", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 321, + 506, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 321, + 506, + 335 + ], + "score": 1.0, + "content": "design iterations, finding this ratio to yield convergence to good solutions. We set this and the other", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 333, + 426, + 346 + ], + "spans": [ + { + "bbox": [ + 105, + 333, + 426, + 346 + ], + "score": 1.0, + "content": "hyper-parameters on the Hopper and used the same settings for all experiments.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 288, + 506, + 346 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 358, + 193, + 370 + ], + "lines": [ + { + "bbox": [ + 106, + 358, + 194, + 370 + ], + "spans": [ + { + "bbox": [ + 106, + 358, + 194, + 370 + ], + "score": 1.0, + "content": "4.2 EXPERIMENTS", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 107, + 380, + 505, + 490 + ], + "lines": [ + { + "bbox": [ + 105, + 379, + 505, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 505, + 393 + ], + "score": 1.0, + "content": "We evaluate the performance of our approach to joint optimization over robot design and control", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 390, + 506, + 404 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 506, + 404 + ], + "score": 1.0, + "content": "on the Hopper, Walker2d, and Ant robots, and compare against a policy trained for the standard", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 401, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 505, + 415 + ], + "score": 1.0, + "content": "Roboschool design. We evaluate the consistency and robustness of our approach relative to the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 411, + 506, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 506, + 426 + ], + "score": 1.0, + "content": "initial robot parameter distribution using several different random seeds. For each robot morphology,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 424, + 506, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 506, + 437 + ], + "score": 1.0, + "content": "we find that our method learns robot designs and the corresponding control policy that are either", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 435, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 506, + 448 + ], + "score": 1.0, + "content": "comparable (Walker2d) or exceed the performance (Hopper and Ant) achievable using the default", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 445, + 506, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 506, + 460 + ], + "score": 1.0, + "content": "designs (Fig. 3). We also see that our method achieves these levels of performance by discovering", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 457, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 469 + ], + "score": 1.0, + "content": "unique robot designs (Fig. 1) together with novel walking gaits (Fig. 4) that can not be achieved with", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 467, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 505, + 480 + ], + "score": 1.0, + "content": "the default designs. Note that our method was able to learn these designs and control policies from", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 478, + 454, + 491 + ], + "spans": [ + { + "bbox": [ + 104, + 478, + 454, + 491 + ], + "score": 1.0, + "content": "a random initialization, without access to a dynamics model or any expert supervision.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 18.5, + "bbox_fs": [ + 104, + 379, + 506, + 491 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 495, + 505, + 627 + ], + "lines": [ + { + "bbox": [ + 106, + 495, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 505, + 508 + ], + "score": 1.0, + "content": "Our method learns a joint design and controller for the Hopper that outperforms the baseline by as", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 506, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 142, + 519 + ], + "score": 1.0, + "content": "much as", + "type": "text" + }, + { + "bbox": [ + 143, + 506, + 162, + 517 + ], + "score": 0.89, + "content": "5 0 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 506, + 505, + 519 + ], + "score": 1.0, + "content": ". Our learned robot exploits the small size of the foot to achieve faster, more precise", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 518, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 106, + 518, + 505, + 530 + ], + "score": 1.0, + "content": "walking gaits. Meanwhile, the longer torso of the learned robot improves stability, allowing it to", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 528, + 506, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 506, + 541 + ], + "score": 1.0, + "content": "maintain balance while locomoting at a faster pace. We found this behavior to be consistent across", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "score": 1.0, + "content": "several different Hopper experiments, with the method converging to designs with a small foot and", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "long, thin torso. In the appendix, we explore the stability of this design with respect to variations", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "in the environment using the coefficient of friction as an example, and find the improvement to", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "be consistent. For the ant, our optimization yields a physical design that is significantly different", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 583, + 504, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 504, + 596 + ], + "score": 1.0, + "content": "from the default design (Fig. 2). Consequently, the learned Ant drastically outperforms the baseline,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 217, + 607 + ], + "score": 1.0, + "content": "improving reward by up to", + "type": "text" + }, + { + "bbox": [ + 218, + 594, + 242, + 605 + ], + "score": 0.89, + "content": "1 1 6 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 594, + 505, + 607 + ], + "score": 1.0, + "content": ". Our method learns a design with a small, lightweight body and", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 604, + 506, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 506, + 619 + ], + "score": 1.0, + "content": "extremely long legs. The long legs enable the ant to apply large torque at contact, allowing it to", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 617, + 187, + 629 + ], + "spans": [ + { + "bbox": [ + 106, + 617, + 187, + 629 + ], + "score": 1.0, + "content": "move at a fast pace.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 29.5, + "bbox_fs": [ + 105, + 495, + 506, + 629 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 632, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 632, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 645 + ], + "score": 1.0, + "content": "Our framework learned different design-control pairs for the Walker2d that perform similarly to the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "default design. Across several different experiments, we see two distinct, successful designs and", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "walking gaits. Interestingly, neither agent walks primarily on its feet. The first design has small,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "thick legs and long feet. The controller is then able to exploit the thick middle leg link, which", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 677, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 506, + 689 + ], + "score": 1.0, + "content": "protrudes slightly past the foot, to push off the ground. The long foot then provides additional", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 686, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 505, + 702 + ], + "score": 1.0, + "content": "balance. The second design is similar in geometry to the baseline Walker2d, but moves in a very", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "different way. By lowering the knee joint and lengthening the foot, the Walker2d is able to efficiently", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "balance on its knees and toes. This low stance allows the Walker2d to fully extend its leg backwards,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 721, + 432, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 432, + 734 + ], + "score": 1.0, + "content": "creating a long, powerful stride, similar to that of a sprinter using starting blocks.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 632, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 107, + 77, + 504, + 413 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 77, + 504, + 413 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 77, + 504, + 413 + ], + "spans": [ + { + "bbox": [ + 107, + 77, + 504, + 413 + ], + "score": 0.974, + "type": "image", + "image_path": "97b6ba644983f0da7af6c1a0a705d198e90586ea3304b1179bfe57ed0dfdfbc5.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 77, + 504, + 189.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 189.0, + 504, + 301.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 301.0, + 504, + 413.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 423, + 505, + 479 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 423, + 505, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 505, + 436 + ], + "score": 1.0, + "content": "Figure 4: Here, we compare locomotion of default and learned robots, visualizing both their physical", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 435, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 106, + 435, + 505, + 447 + ], + "score": 1.0, + "content": "design and corresponding learned gaits. We pick the best results for Hopper and Ant, and two of the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 445, + 506, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 506, + 458 + ], + "score": 1.0, + "content": "best results for Walker2d (due to diversity in gaits). Note that for each robot type, we show a blend", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 456, + 505, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 505, + 470 + ], + "score": 1.0, + "content": "of a fixed number of frames in the same time interval, allowing direct comparison between the speed", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 467, + 308, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 308, + 480 + ], + "score": 1.0, + "content": "with which different designs are able to locomote.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "title", + "bbox": [ + 107, + 527, + 195, + 540 + ], + "lines": [ + { + "bbox": [ + 104, + 525, + 197, + 543 + ], + "spans": [ + { + "bbox": [ + 104, + 525, + 197, + 543 + ], + "score": 1.0, + "content": "5 CONCLUSION", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 571, + 505, + 660 + ], + "lines": [ + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "score": 1.0, + "content": "We proposed what is, to the best of our knowledge, the first model-free algorithm that jointly op-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "timizes over the physical design of a robot and the corresponding control policy, without any need", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 594, + 506, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 506, + 608 + ], + "score": 1.0, + "content": "for expert supervision. Given an arbitrary morphology, our robot maintains a distribution over the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 603, + 506, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 603, + 506, + 619 + ], + "score": 1.0, + "content": "robot design parameters and learns these parameters together with a neural network controller using", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "score": 1.0, + "content": "policy gradient-based reinforcement learning. This results in an assignment to the policy over robot", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 627, + 506, + 640 + ], + "spans": [ + { + "bbox": [ + 104, + 627, + 506, + 640 + ], + "score": 1.0, + "content": "parameters and the control policy that are jointly optimal. We evaluated our approach on a series of", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "score": 1.0, + "content": "different legged robot morphologies, demonstrating that it results in novel robot designs and walking", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 649, + 481, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 481, + 662 + ], + "score": 1.0, + "content": "gaits, achieving performance that either matches or exceeds that of manually defined designs.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 107, + 666, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "Our findings suggest several avenues for future work. The most direct is extending the current", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "score": 1.0, + "content": "approach to find optimized designs for uneven terrain, the presence of obstacles, changes in slope,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "variations in friction, etc. We are also interested in extending our framework to relax the assumption", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "that the morphology is pre-defined. Finally, we are investigating applications to different types", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "of agents and design spaces beyond legged robots (e.g., end-effectors), and exploring appropriate", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 721, + 287, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 287, + 733 + ], + "score": 1.0, + "content": "stochastic parameterization for such designs.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 19.5 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 309, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 309, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 761 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 761 + ], + "score": 1.0, + "content": "8", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 107, + 77, + 504, + 413 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 77, + 504, + 413 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 77, + 504, + 413 + ], + "spans": [ + { + "bbox": [ + 107, + 77, + 504, + 413 + ], + "score": 0.974, + "type": "image", + "image_path": "97b6ba644983f0da7af6c1a0a705d198e90586ea3304b1179bfe57ed0dfdfbc5.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 77, + 504, + 189.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 189.0, + 504, + 301.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 301.0, + 504, + 413.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 423, + 505, + 479 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 423, + 505, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 505, + 436 + ], + "score": 1.0, + "content": "Figure 4: Here, we compare locomotion of default and learned robots, visualizing both their physical", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 435, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 106, + 435, + 505, + 447 + ], + "score": 1.0, + "content": "design and corresponding learned gaits. We pick the best results for Hopper and Ant, and two of the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 445, + 506, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 506, + 458 + ], + "score": 1.0, + "content": "best results for Walker2d (due to diversity in gaits). Note that for each robot type, we show a blend", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 456, + 505, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 505, + 470 + ], + "score": 1.0, + "content": "of a fixed number of frames in the same time interval, allowing direct comparison between the speed", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 467, + 308, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 308, + 480 + ], + "score": 1.0, + "content": "with which different designs are able to locomote.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "title", + "bbox": [ + 107, + 527, + 195, + 540 + ], + "lines": [ + { + "bbox": [ + 104, + 525, + 197, + 543 + ], + "spans": [ + { + "bbox": [ + 104, + 525, + 197, + 543 + ], + "score": 1.0, + "content": "5 CONCLUSION", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 571, + 505, + 660 + ], + "lines": [ + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 571, + 505, + 585 + ], + "score": 1.0, + "content": "We proposed what is, to the best of our knowledge, the first model-free algorithm that jointly op-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "timizes over the physical design of a robot and the corresponding control policy, without any need", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 594, + 506, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 506, + 608 + ], + "score": 1.0, + "content": "for expert supervision. Given an arbitrary morphology, our robot maintains a distribution over the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 603, + 506, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 603, + 506, + 619 + ], + "score": 1.0, + "content": "robot design parameters and learns these parameters together with a neural network controller using", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "score": 1.0, + "content": "policy gradient-based reinforcement learning. This results in an assignment to the policy over robot", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 627, + 506, + 640 + ], + "spans": [ + { + "bbox": [ + 104, + 627, + 506, + 640 + ], + "score": 1.0, + "content": "parameters and the control policy that are jointly optimal. We evaluated our approach on a series of", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "score": 1.0, + "content": "different legged robot morphologies, demonstrating that it results in novel robot designs and walking", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 649, + 481, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 481, + 662 + ], + "score": 1.0, + "content": "gaits, achieving performance that either matches or exceeds that of manually defined designs.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 12.5, + "bbox_fs": [ + 104, + 571, + 506, + 662 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 666, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "Our findings suggest several avenues for future work. The most direct is extending the current", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "score": 1.0, + "content": "approach to find optimized designs for uneven terrain, the presence of obstacles, changes in slope,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "variations in friction, etc. We are also interested in extending our framework to relax the assumption", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "that the morphology is pre-defined. Finally, we are investigating applications to different types", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "of agents and design spaces beyond legged robots (e.g., end-effectors), and exploring appropriate", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 721, + 287, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 287, + 733 + ], + "score": 1.0, + "content": "stochastic parameterization for such designs.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 665, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 82, + 176, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 176, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 176, + 95 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 100, + 503, + 133 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 505, + 113 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 505, + 113 + ], + "score": 1.0, + "content": "Shailen Agrawal, Shuo Shen, and Michiel van de Panne. Diverse motion variations for physics-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 111, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 115, + 111, + 505, + 123 + ], + "score": 1.0, + "content": "based character animation. In Proc. ACM SIGGRAPH/Eurographics Symposium on Computer", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 122, + 233, + 134 + ], + "spans": [ + { + "bbox": [ + 115, + 122, + 233, + 134 + ], + "score": 1.0, + "content": "Animation, pp. 37–44, 2013.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 104, + 140, + 503, + 163 + ], + "lines": [ + { + "bbox": [ + 105, + 140, + 504, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 140, + 504, + 153 + ], + "score": 1.0, + "content": "Josh Bongard. Morphological change in machines accelerates the evolution of robust behavior. Proc.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 151, + 346, + 163 + ], + "spans": [ + { + "bbox": [ + 116, + 151, + 346, + 163 + ], + "score": 1.0, + "content": "National Academy of Sciences, 108(4):1234–1239, 2011.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 105, + 170, + 504, + 193 + ], + "lines": [ + { + "bbox": [ + 106, + 170, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 170, + 505, + 183 + ], + "score": 1.0, + "content": "Andrea Censi. A class of co-design problems with cyclic constraints and their solution. Robotics", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 181, + 295, + 192 + ], + "spans": [ + { + "bbox": [ + 116, + 181, + 295, + 192 + ], + "score": 1.0, + "content": "and Automation Letters, 2(1):96–103, 2017.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 105, + 199, + 504, + 222 + ], + "lines": [ + { + "bbox": [ + 106, + 199, + 506, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 199, + 506, + 213 + ], + "score": 1.0, + "content": "Ayan Chakrabarti. Learning sensor multiplexing design through backpropagation. In Advances in", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 210, + 378, + 223 + ], + "spans": [ + { + "bbox": [ + 115, + 210, + 378, + 223 + ], + "score": 1.0, + "content": "Neural Information Processing Systems (NIPS), December 2016.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 106, + 228, + 504, + 253 + ], + "lines": [ + { + "bbox": [ + 105, + 227, + 506, + 243 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 506, + 243 + ], + "score": 1.0, + "content": "Steven H Collins, Martijn Wisse, and Andy Ruina. A three-dimensional passive-dynamic walking", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 241, + 449, + 253 + ], + "spans": [ + { + "bbox": [ + 115, + 241, + 449, + 253 + ], + "score": 1.0, + "content": "robot with two legs and knees. Int’l J. of Robotics Research, 20(7):607–615, 2001.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 108, + 258, + 503, + 293 + ], + "lines": [ + { + "bbox": [ + 105, + 257, + 505, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 505, + 272 + ], + "score": 1.0, + "content": "Stelian Coros, Bernhard Thomaszewski, Gioacchino Noris, Shinjiro Sueda, Moira Forberg,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 270, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 116, + 270, + 505, + 282 + ], + "score": 1.0, + "content": "Robert W. Sumner, Wojciech Matusik, and Bernd Bickel. Computational design of mechanical", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 280, + 309, + 293 + ], + "spans": [ + { + "bbox": [ + 116, + 280, + 309, + 293 + ], + "score": 1.0, + "content": "characters. Trans. on Graphics, 32(4):83, 2013.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 104, + 299, + 503, + 322 + ], + "lines": [ + { + "bbox": [ + 105, + 298, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 505, + 312 + ], + "score": 1.0, + "content": "Hongkai Dai and Russ Tedrake. Planning robust walking motion on uneven terrain via convex", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 310, + 421, + 323 + ], + "spans": [ + { + "bbox": [ + 115, + 310, + 421, + 323 + ], + "score": 1.0, + "content": "optimization. In Proc. Int’l Conf. on Humanoid Robots (Humanoids), 2016.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 108, + 328, + 504, + 363 + ], + "lines": [ + { + "bbox": [ + 106, + 327, + 504, + 342 + ], + "spans": [ + { + "bbox": [ + 106, + 327, + 504, + 342 + ], + "score": 1.0, + "content": "Krishnamanaswi M. Digumarti, Christian Gehring, Stelian Coros, J. Hwangbo, and R. Siegwart.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 340, + 505, + 353 + ], + "spans": [ + { + "bbox": [ + 116, + 340, + 505, + 353 + ], + "score": 1.0, + "content": "Concurrent optimization of mechanical design and locomotion control of a legged robot. In Proc.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 351, + 379, + 363 + ], + "spans": [ + { + "bbox": [ + 116, + 351, + 379, + 363 + ], + "score": 1.0, + "content": "IEEE Int’l Conf. on Robotics and Automation (ICRA), July 2014.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 105, + 369, + 504, + 393 + ], + "lines": [ + { + "bbox": [ + 106, + 369, + 505, + 382 + ], + "spans": [ + { + "bbox": [ + 106, + 369, + 505, + 382 + ], + "score": 1.0, + "content": "Thomas Geijtenbeek, Michiel van de Panne, and A. Frank van der Stappen. Flexible muscle-based", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 380, + 404, + 392 + ], + "spans": [ + { + "bbox": [ + 115, + 380, + 404, + 392 + ], + "score": 1.0, + "content": "locomotion for bipedal creatures. Trans. on Graphics, 32(6):206, 2013.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 106, + 398, + 503, + 423 + ], + "lines": [ + { + "bbox": [ + 105, + 398, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 505, + 412 + ], + "score": 1.0, + "content": "Ambarish Goswami, Benoit Thuilot, and Bernard Espiau. A study of the passive gait of a compass-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 410, + 497, + 423 + ], + "spans": [ + { + "bbox": [ + 115, + 410, + 497, + 423 + ], + "score": 1.0, + "content": "like biped robot: Symmetry and chaos. Int’l J. of Robotics Research, 17(12):1282–1301, 1998.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 105, + 428, + 504, + 452 + ], + "lines": [ + { + "bbox": [ + 106, + 429, + 506, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 429, + 506, + 442 + ], + "score": 1.0, + "content": "Brent Griffin and Jessy Grizzle. Nonholonomic virtual constraints and gait optimization for robust", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 117, + 440, + 383, + 453 + ], + "spans": [ + { + "bbox": [ + 117, + 440, + 383, + 453 + ], + "score": 1.0, + "content": "walking control. Int’l J. of Robotics Research, pp. 895–922, 2016.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 108, + 458, + 504, + 492 + ], + "lines": [ + { + "bbox": [ + 106, + 458, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 458, + 505, + 471 + ], + "score": 1.0, + "content": "Shixiang Gu, Ethan Holly, Timothy Lillicrap, and Sergey Levine. Deep reinforcement learning for", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 470, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 116, + 470, + 505, + 482 + ], + "score": 1.0, + "content": "robotic manipulation with asynchronous off-policy updates. In Proc. IEEE Int’l Conf. on Robotics", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 480, + 242, + 493 + ], + "spans": [ + { + "bbox": [ + 116, + 480, + 242, + 493 + ], + "score": 1.0, + "content": "and Automation (ICRA), 2017.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 108, + 498, + 504, + 533 + ], + "lines": [ + { + "bbox": [ + 105, + 498, + 505, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 505, + 512 + ], + "score": 1.0, + "content": "Sehoon Ha, Stelian Coros, Alexander Alspach, Joohyung Kim, and Katsu Yamane. Joint optimiza-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 116, + 510, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 116, + 510, + 505, + 523 + ], + "score": 1.0, + "content": "tion of robot design and motion parameters using the implicit function theorem. In Proc. Robotics:", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 521, + 275, + 533 + ], + "spans": [ + { + "bbox": [ + 115, + 521, + 275, + 533 + ], + "score": 1.0, + "content": "Science and Systems (RSS), June 2017.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 106, + 539, + 504, + 563 + ], + "lines": [ + { + "bbox": [ + 106, + 538, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 505, + 552 + ], + "score": 1.0, + "content": "Christopher Hesse, Matthias Plappert, Alec Radford, John Schulman, Szymon Sidor, and Yuhuai", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 550, + 453, + 563 + ], + "spans": [ + { + "bbox": [ + 116, + 550, + 453, + 563 + ], + "score": 1.0, + "content": "Wu. OpenAI baselines. https://github.com/openai/baselines, 2017.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 106, + 568, + 504, + 592 + ], + "lines": [ + { + "bbox": [ + 106, + 569, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 505, + 582 + ], + "score": 1.0, + "content": "Sergey Levine and Pieter Abbeel. Learning neural network policies with guided policy search under", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 117, + 581, + 479, + 592 + ], + "spans": [ + { + "bbox": [ + 117, + 581, + 479, + 592 + ], + "score": 1.0, + "content": "unknown dynamics. In Advances in Neural Information Processing Systems (NIPS), 2014.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 106, + 598, + 503, + 622 + ], + "lines": [ + { + "bbox": [ + 106, + 599, + 504, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 599, + 504, + 612 + ], + "score": 1.0, + "content": "Sergey Levine and Vladlen Koltun. Learning complex neural network policies with trajectory opti-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 609, + 385, + 622 + ], + "spans": [ + { + "bbox": [ + 116, + 609, + 385, + 622 + ], + "score": 1.0, + "content": "mization. In Proc. Int’l Conf. on Machine Learning (ICML), 2014.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5 + }, + { + "type": "text", + "bbox": [ + 106, + 628, + 504, + 651 + ], + "lines": [ + { + "bbox": [ + 105, + 627, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 642 + ], + "score": 1.0, + "content": "Sergey Levine, Chelsea Finn, Trevor Darrell, and Pieter Abbeel. End-to-end training of deep visuo-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 116, + 639, + 390, + 652 + ], + "spans": [ + { + "bbox": [ + 116, + 639, + 390, + 652 + ], + "score": 1.0, + "content": "motor policies. J. Machine Learning Research, 17(39):1–40, 2016a.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 107, + 657, + 504, + 691 + ], + "lines": [ + { + "bbox": [ + 105, + 657, + 506, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 506, + 671 + ], + "score": 1.0, + "content": "Sergey Levine, Peter Pastor, Alex Krizhevsky, Julian Ibarz, and Deirdre Quillen. Learning hand-eye", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 668, + 506, + 682 + ], + "spans": [ + { + "bbox": [ + 115, + 668, + 506, + 682 + ], + "score": 1.0, + "content": "coordination for robotic grasping with deep learning and large-scale data collection. Int’l J. of", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 680, + 225, + 691 + ], + "spans": [ + { + "bbox": [ + 116, + 680, + 225, + 691 + ], + "score": 1.0, + "content": "Robotics Research, 2016b.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 697, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 505, + 712 + ], + "score": 1.0, + "content": "Timothy P. Lillicrap, Jonathan J. Hunt, Alexander Pritzel, Nicolas Heess, Tom Erez, Yuval Tassa,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 115, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "David Silver, and Daan Wierstra. Continuous control with deep reinforcement learning. arXiv", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 721, + 254, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 721, + 254, + 732 + ], + "score": 1.0, + "content": "preprint arXiv:1509.02971, 2015.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44 + } + ], + "page_idx": 8, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 309, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 309, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "9", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 82, + 176, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 176, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 176, + 95 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 100, + 503, + 133 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 505, + 113 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 505, + 113 + ], + "score": 1.0, + "content": "Shailen Agrawal, Shuo Shen, and Michiel van de Panne. Diverse motion variations for physics-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 111, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 115, + 111, + 505, + 123 + ], + "score": 1.0, + "content": "based character animation. In Proc. ACM SIGGRAPH/Eurographics Symposium on Computer", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 122, + 233, + 134 + ], + "spans": [ + { + "bbox": [ + 115, + 122, + 233, + 134 + ], + "score": 1.0, + "content": "Animation, pp. 37–44, 2013.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 99, + 505, + 134 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 140, + 503, + 163 + ], + "lines": [ + { + "bbox": [ + 105, + 140, + 504, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 140, + 504, + 153 + ], + "score": 1.0, + "content": "Josh Bongard. Morphological change in machines accelerates the evolution of robust behavior. Proc.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 151, + 346, + 163 + ], + "spans": [ + { + "bbox": [ + 116, + 151, + 346, + 163 + ], + "score": 1.0, + "content": "National Academy of Sciences, 108(4):1234–1239, 2011.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 140, + 504, + 163 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 170, + 504, + 193 + ], + "lines": [ + { + "bbox": [ + 106, + 170, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 170, + 505, + 183 + ], + "score": 1.0, + "content": "Andrea Censi. A class of co-design problems with cyclic constraints and their solution. Robotics", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 181, + 295, + 192 + ], + "spans": [ + { + "bbox": [ + 116, + 181, + 295, + 192 + ], + "score": 1.0, + "content": "and Automation Letters, 2(1):96–103, 2017.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 106, + 170, + 505, + 192 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 199, + 504, + 222 + ], + "lines": [ + { + "bbox": [ + 106, + 199, + 506, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 199, + 506, + 213 + ], + "score": 1.0, + "content": "Ayan Chakrabarti. Learning sensor multiplexing design through backpropagation. In Advances in", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 210, + 378, + 223 + ], + "spans": [ + { + "bbox": [ + 115, + 210, + 378, + 223 + ], + "score": 1.0, + "content": "Neural Information Processing Systems (NIPS), December 2016.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 106, + 199, + 506, + 223 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 228, + 504, + 253 + ], + "lines": [ + { + "bbox": [ + 105, + 227, + 506, + 243 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 506, + 243 + ], + "score": 1.0, + "content": "Steven H Collins, Martijn Wisse, and Andy Ruina. A three-dimensional passive-dynamic walking", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 241, + 449, + 253 + ], + "spans": [ + { + "bbox": [ + 115, + 241, + 449, + 253 + ], + "score": 1.0, + "content": "robot with two legs and knees. Int’l J. of Robotics Research, 20(7):607–615, 2001.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 227, + 506, + 253 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 258, + 503, + 293 + ], + "lines": [ + { + "bbox": [ + 105, + 257, + 505, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 505, + 272 + ], + "score": 1.0, + "content": "Stelian Coros, Bernhard Thomaszewski, Gioacchino Noris, Shinjiro Sueda, Moira Forberg,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 270, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 116, + 270, + 505, + 282 + ], + "score": 1.0, + "content": "Robert W. Sumner, Wojciech Matusik, and Bernd Bickel. Computational design of mechanical", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 280, + 309, + 293 + ], + "spans": [ + { + "bbox": [ + 116, + 280, + 309, + 293 + ], + "score": 1.0, + "content": "characters. Trans. on Graphics, 32(4):83, 2013.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 257, + 505, + 293 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 299, + 503, + 322 + ], + "lines": [ + { + "bbox": [ + 105, + 298, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 505, + 312 + ], + "score": 1.0, + "content": "Hongkai Dai and Russ Tedrake. Planning robust walking motion on uneven terrain via convex", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 310, + 421, + 323 + ], + "spans": [ + { + "bbox": [ + 115, + 310, + 421, + 323 + ], + "score": 1.0, + "content": "optimization. In Proc. Int’l Conf. on Humanoid Robots (Humanoids), 2016.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 298, + 505, + 323 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 328, + 504, + 363 + ], + "lines": [ + { + "bbox": [ + 106, + 327, + 504, + 342 + ], + "spans": [ + { + "bbox": [ + 106, + 327, + 504, + 342 + ], + "score": 1.0, + "content": "Krishnamanaswi M. Digumarti, Christian Gehring, Stelian Coros, J. Hwangbo, and R. Siegwart.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 340, + 505, + 353 + ], + "spans": [ + { + "bbox": [ + 116, + 340, + 505, + 353 + ], + "score": 1.0, + "content": "Concurrent optimization of mechanical design and locomotion control of a legged robot. In Proc.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 351, + 379, + 363 + ], + "spans": [ + { + "bbox": [ + 116, + 351, + 379, + 363 + ], + "score": 1.0, + "content": "IEEE Int’l Conf. on Robotics and Automation (ICRA), July 2014.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18, + "bbox_fs": [ + 106, + 327, + 505, + 363 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 369, + 504, + 393 + ], + "lines": [ + { + "bbox": [ + 106, + 369, + 505, + 382 + ], + "spans": [ + { + "bbox": [ + 106, + 369, + 505, + 382 + ], + "score": 1.0, + "content": "Thomas Geijtenbeek, Michiel van de Panne, and A. Frank van der Stappen. Flexible muscle-based", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 380, + 404, + 392 + ], + "spans": [ + { + "bbox": [ + 115, + 380, + 404, + 392 + ], + "score": 1.0, + "content": "locomotion for bipedal creatures. Trans. on Graphics, 32(6):206, 2013.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5, + "bbox_fs": [ + 106, + 369, + 505, + 392 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 398, + 503, + 423 + ], + "lines": [ + { + "bbox": [ + 105, + 398, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 505, + 412 + ], + "score": 1.0, + "content": "Ambarish Goswami, Benoit Thuilot, and Bernard Espiau. A study of the passive gait of a compass-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 410, + 497, + 423 + ], + "spans": [ + { + "bbox": [ + 115, + 410, + 497, + 423 + ], + "score": 1.0, + "content": "like biped robot: Symmetry and chaos. Int’l J. of Robotics Research, 17(12):1282–1301, 1998.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 398, + 505, + 423 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 428, + 504, + 452 + ], + "lines": [ + { + "bbox": [ + 106, + 429, + 506, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 429, + 506, + 442 + ], + "score": 1.0, + "content": "Brent Griffin and Jessy Grizzle. Nonholonomic virtual constraints and gait optimization for robust", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 117, + 440, + 383, + 453 + ], + "spans": [ + { + "bbox": [ + 117, + 440, + 383, + 453 + ], + "score": 1.0, + "content": "walking control. Int’l J. of Robotics Research, pp. 895–922, 2016.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 106, + 429, + 506, + 453 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 458, + 504, + 492 + ], + "lines": [ + { + "bbox": [ + 106, + 458, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 458, + 505, + 471 + ], + "score": 1.0, + "content": "Shixiang Gu, Ethan Holly, Timothy Lillicrap, and Sergey Levine. Deep reinforcement learning for", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 470, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 116, + 470, + 505, + 482 + ], + "score": 1.0, + "content": "robotic manipulation with asynchronous off-policy updates. In Proc. IEEE Int’l Conf. on Robotics", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 480, + 242, + 493 + ], + "spans": [ + { + "bbox": [ + 116, + 480, + 242, + 493 + ], + "score": 1.0, + "content": "and Automation (ICRA), 2017.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 106, + 458, + 505, + 493 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 498, + 504, + 533 + ], + "lines": [ + { + "bbox": [ + 105, + 498, + 505, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 505, + 512 + ], + "score": 1.0, + "content": "Sehoon Ha, Stelian Coros, Alexander Alspach, Joohyung Kim, and Katsu Yamane. Joint optimiza-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 116, + 510, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 116, + 510, + 505, + 523 + ], + "score": 1.0, + "content": "tion of robot design and motion parameters using the implicit function theorem. In Proc. Robotics:", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 521, + 275, + 533 + ], + "spans": [ + { + "bbox": [ + 115, + 521, + 275, + 533 + ], + "score": 1.0, + "content": "Science and Systems (RSS), June 2017.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 498, + 505, + 533 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 539, + 504, + 563 + ], + "lines": [ + { + "bbox": [ + 106, + 538, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 505, + 552 + ], + "score": 1.0, + "content": "Christopher Hesse, Matthias Plappert, Alec Radford, John Schulman, Szymon Sidor, and Yuhuai", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 550, + 453, + 563 + ], + "spans": [ + { + "bbox": [ + 116, + 550, + 453, + 563 + ], + "score": 1.0, + "content": "Wu. OpenAI baselines. https://github.com/openai/baselines, 2017.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 106, + 538, + 505, + 563 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 568, + 504, + 592 + ], + "lines": [ + { + "bbox": [ + 106, + 569, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 505, + 582 + ], + "score": 1.0, + "content": "Sergey Levine and Pieter Abbeel. Learning neural network policies with guided policy search under", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 117, + 581, + 479, + 592 + ], + "spans": [ + { + "bbox": [ + 117, + 581, + 479, + 592 + ], + "score": 1.0, + "content": "unknown dynamics. In Advances in Neural Information Processing Systems (NIPS), 2014.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5, + "bbox_fs": [ + 106, + 569, + 505, + 592 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 598, + 503, + 622 + ], + "lines": [ + { + "bbox": [ + 106, + 599, + 504, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 599, + 504, + 612 + ], + "score": 1.0, + "content": "Sergey Levine and Vladlen Koltun. Learning complex neural network policies with trajectory opti-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 609, + 385, + 622 + ], + "spans": [ + { + "bbox": [ + 116, + 609, + 385, + 622 + ], + "score": 1.0, + "content": "mization. In Proc. Int’l Conf. on Machine Learning (ICML), 2014.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5, + "bbox_fs": [ + 106, + 599, + 504, + 622 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 628, + 504, + 651 + ], + "lines": [ + { + "bbox": [ + 105, + 627, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 642 + ], + "score": 1.0, + "content": "Sergey Levine, Chelsea Finn, Trevor Darrell, and Pieter Abbeel. End-to-end training of deep visuo-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 116, + 639, + 390, + 652 + ], + "spans": [ + { + "bbox": [ + 116, + 639, + 390, + 652 + ], + "score": 1.0, + "content": "motor policies. J. Machine Learning Research, 17(39):1–40, 2016a.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 627, + 505, + 652 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 657, + 504, + 691 + ], + "lines": [ + { + "bbox": [ + 105, + 657, + 506, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 506, + 671 + ], + "score": 1.0, + "content": "Sergey Levine, Peter Pastor, Alex Krizhevsky, Julian Ibarz, and Deirdre Quillen. Learning hand-eye", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 668, + 506, + 682 + ], + "spans": [ + { + "bbox": [ + 115, + 668, + 506, + 682 + ], + "score": 1.0, + "content": "coordination for robotic grasping with deep learning and large-scale data collection. Int’l J. of", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 680, + 225, + 691 + ], + "spans": [ + { + "bbox": [ + 116, + 680, + 225, + 691 + ], + "score": 1.0, + "content": "Robotics Research, 2016b.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 657, + 506, + 691 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 697, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 505, + 712 + ], + "score": 1.0, + "content": "Timothy P. Lillicrap, Jonathan J. Hunt, Alexander Pritzel, Nicolas Heess, Tom Erez, Yuval Tassa,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 115, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "David Silver, and Daan Wierstra. Continuous control with deep reinforcement learning. arXiv", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 721, + 254, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 721, + 254, + 732 + ], + "score": 1.0, + "content": "preprint arXiv:1509.02971, 2015.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44, + "bbox_fs": [ + 105, + 697, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 104, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 506, + 96 + ], + "score": 1.0, + "content": "Hod Lipson and Jordan B. Pollack. Automatic design and manufacture of robotic lifeforms. Nature,", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 225, + 105 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 225, + 105 + ], + "score": 1.0, + "content": "406(6799):974–978, 2000.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 105, + 111, + 461, + 124 + ], + "lines": [ + { + "bbox": [ + 106, + 111, + 461, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 111, + 461, + 125 + ], + "score": 1.0, + "content": "Tad McGeer. Passive dynamic walking. Int’l J. of Robotics Research, 9(2):62–82, 1990.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 106, + 130, + 504, + 163 + ], + "lines": [ + { + "bbox": [ + 107, + 130, + 505, + 142 + ], + "spans": [ + { + "bbox": [ + 107, + 130, + 505, + 142 + ], + "score": 1.0, + "content": "Vittorio Megaro, Bernhard Thomaszewski, Maurizio Nitti, Otmar Hilliges, Markus Gross, and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 141, + 505, + 154 + ], + "spans": [ + { + "bbox": [ + 115, + 141, + 505, + 154 + ], + "score": 1.0, + "content": "Stelian Coros. Interactive design of 3d-printable robotic creatures. Trans. on Graphics, 34(6):", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 151, + 162, + 164 + ], + "spans": [ + { + "bbox": [ + 115, + 151, + 162, + 164 + ], + "score": 1.0, + "content": "216, 2015.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 170, + 504, + 204 + ], + "lines": [ + { + "bbox": [ + 105, + 169, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 105, + 169, + 505, + 184 + ], + "score": 1.0, + "content": "Ankur M. Mehta, Joseph DelPreto, Benjamin Shaya, and Daniela Rus. Cogeneration of mechani-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 181, + 504, + 194 + ], + "spans": [ + { + "bbox": [ + 116, + 181, + 504, + 194 + ], + "score": 1.0, + "content": "cal, electrical, and software designs for printable robots from structural specifications. In Proc.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 192, + 398, + 205 + ], + "spans": [ + { + "bbox": [ + 116, + 192, + 398, + 205 + ], + "score": 1.0, + "content": "IEEE/RSJ Int’l Conf. on Intelligent Robots and Systems (IROS), 2014.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 210, + 504, + 244 + ], + "lines": [ + { + "bbox": [ + 106, + 210, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 506, + 223 + ], + "score": 1.0, + "content": "Ankur M. Mehta, Joseph DelPreto, Kai Weng Wong, Scott Hamill, Hadas Kress-Gazit, and Daniela", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 221, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 115, + 221, + 505, + 234 + ], + "score": 1.0, + "content": "Rus. Robot creation from functional specifications. In Int’l Symp. of Robotics Research (ISRR),", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 231, + 144, + 245 + ], + "spans": [ + { + "bbox": [ + 115, + 231, + 144, + 245 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 250, + 505, + 285 + ], + "lines": [ + { + "bbox": [ + 106, + 250, + 505, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 250, + 505, + 264 + ], + "score": 1.0, + "content": "Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Alex Graves, Ioannis Antonoglou, Daan Wier-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 262, + 505, + 275 + ], + "spans": [ + { + "bbox": [ + 115, + 262, + 505, + 275 + ], + "score": 1.0, + "content": "stra, and Martin Riedmiller. Playing atari with deep reinforcement learning. arXiv preprint", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 273, + 215, + 285 + ], + "spans": [ + { + "bbox": [ + 115, + 273, + 215, + 285 + ], + "score": 1.0, + "content": "arXiv:1312.5602, 2013.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 107, + 291, + 504, + 326 + ], + "lines": [ + { + "bbox": [ + 106, + 291, + 506, + 305 + ], + "spans": [ + { + "bbox": [ + 106, + 291, + 506, + 305 + ], + "score": 1.0, + "content": "Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A. Rusu, Joel Veness, Marc G. Belle-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 302, + 505, + 315 + ], + "spans": [ + { + "bbox": [ + 116, + 302, + 505, + 315 + ], + "score": 1.0, + "content": "mare, Alex Graves, Martin Riedmiller, Andreas K. Fidjeland, Georg Ostrovski, et al. Human-level", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 313, + 441, + 326 + ], + "spans": [ + { + "bbox": [ + 116, + 313, + 441, + 326 + ], + "score": 1.0, + "content": "control through deep reinforcement learning. Nature, 518(7540):529–533, 2015.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 104, + 331, + 504, + 354 + ], + "lines": [ + { + "bbox": [ + 105, + 330, + 505, + 346 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 505, + 346 + ], + "score": 1.0, + "content": "Igor Mordatch and Emo Todorov. Combining the benefits of function approximation and trajectory", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 343, + 387, + 355 + ], + "spans": [ + { + "bbox": [ + 115, + 343, + 387, + 355 + ], + "score": 1.0, + "content": "optimization. In Proc. Robotics: Science and Systems (RSS), 2014.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "text", + "bbox": [ + 105, + 360, + 504, + 384 + ], + "lines": [ + { + "bbox": [ + 106, + 360, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 106, + 360, + 505, + 375 + ], + "score": 1.0, + "content": "Igor Mordatch, Emanuel Todorov, and Zoran Popovic. Discovery of complex behaviors through ´", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 372, + 389, + 384 + ], + "spans": [ + { + "bbox": [ + 115, + 372, + 389, + 384 + ], + "score": 1.0, + "content": "contact-invariant optimization. Trans. on Graphics, 31(4):43, 2012.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 107, + 390, + 505, + 424 + ], + "lines": [ + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "score": 1.0, + "content": "Igor Mordatch, Kendall Lowrey, Galen Andrew, Zoran Popovic, and Emanuel V Todorov. Interactive ´", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 402, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 116, + 402, + 505, + 414 + ], + "score": 1.0, + "content": "control of diverse complex characters with neural networks. In Advances in Neural Information", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 117, + 413, + 254, + 425 + ], + "spans": [ + { + "bbox": [ + 117, + 413, + 254, + 425 + ], + "score": 1.0, + "content": "Processing Systems (NIPS), 2015.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 108, + 430, + 504, + 464 + ], + "lines": [ + { + "bbox": [ + 105, + 430, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 430, + 506, + 443 + ], + "score": 1.0, + "content": "Jahng-Hyon Park and Haruhiko Asada. Concurrent design optimization of mechanical structure and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 441, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 116, + 441, + 505, + 453 + ], + "score": 1.0, + "content": "control for high speed robots. J. Dynamic Systems, Measurement, and Control, 116(3):344–356,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 452, + 142, + 465 + ], + "spans": [ + { + "bbox": [ + 116, + 452, + 142, + 465 + ], + "score": 1.0, + "content": "1994.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 470, + 505, + 505 + ], + "lines": [ + { + "bbox": [ + 106, + 471, + 506, + 483 + ], + "spans": [ + { + "bbox": [ + 106, + 471, + 506, + 483 + ], + "score": 1.0, + "content": "Chandana Paul and Josh C Bongard. The road less travelled: Morphology in the optimization of", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 116, + 482, + 505, + 495 + ], + "spans": [ + { + "bbox": [ + 116, + 482, + 505, + 495 + ], + "score": 1.0, + "content": "biped robot locomotion. In Proc. IEEE/RSJ Int’l Conf. on Intelligent Robots and Systems (IROS),", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 116, + 493, + 265, + 505 + ], + "spans": [ + { + "bbox": [ + 116, + 493, + 265, + 505 + ], + "score": 1.0, + "content": "volume 1, pp. 226–232. IEEE, 2001.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 106, + 511, + 504, + 534 + ], + "lines": [ + { + "bbox": [ + 105, + 510, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 510, + 506, + 525 + ], + "score": 1.0, + "content": "Xue Bin Peng, Glen Berseth, and Michiel Van de Panne. Terrain-adaptive locomotion skills using", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 522, + 381, + 535 + ], + "spans": [ + { + "bbox": [ + 116, + 522, + 381, + 535 + ], + "score": 1.0, + "content": "deep reinforcement learning. Trans. on Graphics, 35(4):81, 2016.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 106, + 540, + 503, + 564 + ], + "lines": [ + { + "bbox": [ + 105, + 539, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 555 + ], + "score": 1.0, + "content": "Anton C. Pil and Harry H. Asada. Integrated structure/control design of mechatronic systems using", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 552, + 488, + 564 + ], + "spans": [ + { + "bbox": [ + 115, + 552, + 488, + 564 + ], + "score": 1.0, + "content": "a recursive experimental optimization method. Trans. on Mechatronics, 1(3):191–203, 1996.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 106, + 569, + 505, + 603 + ], + "lines": [ + { + "bbox": [ + 106, + 570, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 106, + 570, + 505, + 582 + ], + "score": 1.0, + "content": "Michael Posa, Scott Kuindersma, and Russ Tedrake. Optimization and stabilization of trajectories", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 581, + 505, + 594 + ], + "spans": [ + { + "bbox": [ + 115, + 581, + 505, + 594 + ], + "score": 1.0, + "content": "for constrained dynamical systems. In Proc. IEEE Int’l Conf. on Robotics and Automation (ICRA),", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 592, + 142, + 604 + ], + "spans": [ + { + "bbox": [ + 115, + 592, + 142, + 604 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 106, + 610, + 504, + 633 + ], + "lines": [ + { + "bbox": [ + 106, + 609, + 505, + 624 + ], + "spans": [ + { + "bbox": [ + 106, + 609, + 505, + 624 + ], + "score": 1.0, + "content": "Thambirajah Ravichandran, David Wang, and Glenn Heppler. Simultaneous plant-controller design", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 622, + 452, + 633 + ], + "spans": [ + { + "bbox": [ + 115, + 622, + 452, + 633 + ], + "score": 1.0, + "content": "optimization of a two-link planar manipulator. Mechatronics, 16(3):233–242, 2006.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 106, + 639, + 503, + 663 + ], + "lines": [ + { + "bbox": [ + 105, + 639, + 505, + 653 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 505, + 653 + ], + "score": 1.0, + "content": "Julie A. Reyer and Panos Y. Papalambros. Combined optimal design and control with application to", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 650, + 398, + 663 + ], + "spans": [ + { + "bbox": [ + 115, + 650, + 398, + 663 + ], + "score": 1.0, + "content": "an electric dc motor. J. of Mechanical Design, 124(2):183–191, 2002.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5 + }, + { + "type": "text", + "bbox": [ + 107, + 669, + 504, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 505, + 682 + ], + "score": 1.0, + "content": "Martin Riedmiller. Neural fitted Q iteration-first experiences with a data efficient neural reinforce-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 680, + 505, + 692 + ], + "spans": [ + { + "bbox": [ + 115, + 680, + 505, + 692 + ], + "score": 1.0, + "content": "ment learning method. In Proc. European Conf. on Machine Learning (ECML), volume 3720.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 691, + 180, + 704 + ], + "spans": [ + { + "bbox": [ + 115, + 691, + 180, + 704 + ], + "score": 1.0, + "content": "Springer, 2005.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 502, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 709, + 503, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 503, + 722 + ], + "score": 1.0, + "content": "Sebastian Risi and Julian Togelius. Neuroevolution in games: State of the art and open challenges.", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 116, + 721, + 438, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 438, + 732 + ], + "score": 1.0, + "content": "IEEE Trans. on Computational Intelligence and AI in Games, 9(1):25–41, 2017.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45.5 + } + ], + "page_idx": 9, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 309, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 309, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "10", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 104, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 506, + 96 + ], + "score": 1.0, + "content": "Hod Lipson and Jordan B. Pollack. Automatic design and manufacture of robotic lifeforms. Nature,", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 225, + 105 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 225, + 105 + ], + "score": 1.0, + "content": "406(6799):974–978, 2000.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 80, + 506, + 105 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 111, + 461, + 124 + ], + "lines": [ + { + "bbox": [ + 106, + 111, + 461, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 111, + 461, + 125 + ], + "score": 1.0, + "content": "Tad McGeer. Passive dynamic walking. Int’l J. of Robotics Research, 9(2):62–82, 1990.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2, + "bbox_fs": [ + 106, + 111, + 461, + 125 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 130, + 504, + 163 + ], + "lines": [ + { + "bbox": [ + 107, + 130, + 505, + 142 + ], + "spans": [ + { + "bbox": [ + 107, + 130, + 505, + 142 + ], + "score": 1.0, + "content": "Vittorio Megaro, Bernhard Thomaszewski, Maurizio Nitti, Otmar Hilliges, Markus Gross, and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 141, + 505, + 154 + ], + "spans": [ + { + "bbox": [ + 115, + 141, + 505, + 154 + ], + "score": 1.0, + "content": "Stelian Coros. Interactive design of 3d-printable robotic creatures. Trans. on Graphics, 34(6):", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 151, + 162, + 164 + ], + "spans": [ + { + "bbox": [ + 115, + 151, + 162, + 164 + ], + "score": 1.0, + "content": "216, 2015.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4, + "bbox_fs": [ + 107, + 130, + 505, + 164 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 170, + 504, + 204 + ], + "lines": [ + { + "bbox": [ + 105, + 169, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 105, + 169, + 505, + 184 + ], + "score": 1.0, + "content": "Ankur M. Mehta, Joseph DelPreto, Benjamin Shaya, and Daniela Rus. Cogeneration of mechani-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 181, + 504, + 194 + ], + "spans": [ + { + "bbox": [ + 116, + 181, + 504, + 194 + ], + "score": 1.0, + "content": "cal, electrical, and software designs for printable robots from structural specifications. In Proc.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 192, + 398, + 205 + ], + "spans": [ + { + "bbox": [ + 116, + 192, + 398, + 205 + ], + "score": 1.0, + "content": "IEEE/RSJ Int’l Conf. on Intelligent Robots and Systems (IROS), 2014.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 169, + 505, + 205 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 210, + 504, + 244 + ], + "lines": [ + { + "bbox": [ + 106, + 210, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 506, + 223 + ], + "score": 1.0, + "content": "Ankur M. Mehta, Joseph DelPreto, Kai Weng Wong, Scott Hamill, Hadas Kress-Gazit, and Daniela", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 221, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 115, + 221, + 505, + 234 + ], + "score": 1.0, + "content": "Rus. Robot creation from functional specifications. In Int’l Symp. of Robotics Research (ISRR),", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 231, + 144, + 245 + ], + "spans": [ + { + "bbox": [ + 115, + 231, + 144, + 245 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10, + "bbox_fs": [ + 106, + 210, + 506, + 245 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 250, + 505, + 285 + ], + "lines": [ + { + "bbox": [ + 106, + 250, + 505, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 250, + 505, + 264 + ], + "score": 1.0, + "content": "Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Alex Graves, Ioannis Antonoglou, Daan Wier-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 262, + 505, + 275 + ], + "spans": [ + { + "bbox": [ + 115, + 262, + 505, + 275 + ], + "score": 1.0, + "content": "stra, and Martin Riedmiller. Playing atari with deep reinforcement learning. arXiv preprint", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 273, + 215, + 285 + ], + "spans": [ + { + "bbox": [ + 115, + 273, + 215, + 285 + ], + "score": 1.0, + "content": "arXiv:1312.5602, 2013.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13, + "bbox_fs": [ + 106, + 250, + 505, + 285 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 291, + 504, + 326 + ], + "lines": [ + { + "bbox": [ + 106, + 291, + 506, + 305 + ], + "spans": [ + { + "bbox": [ + 106, + 291, + 506, + 305 + ], + "score": 1.0, + "content": "Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A. Rusu, Joel Veness, Marc G. Belle-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 302, + 505, + 315 + ], + "spans": [ + { + "bbox": [ + 116, + 302, + 505, + 315 + ], + "score": 1.0, + "content": "mare, Alex Graves, Martin Riedmiller, Andreas K. Fidjeland, Georg Ostrovski, et al. Human-level", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 313, + 441, + 326 + ], + "spans": [ + { + "bbox": [ + 116, + 313, + 441, + 326 + ], + "score": 1.0, + "content": "control through deep reinforcement learning. Nature, 518(7540):529–533, 2015.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 106, + 291, + 506, + 326 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 331, + 504, + 354 + ], + "lines": [ + { + "bbox": [ + 105, + 330, + 505, + 346 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 505, + 346 + ], + "score": 1.0, + "content": "Igor Mordatch and Emo Todorov. Combining the benefits of function approximation and trajectory", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 343, + 387, + 355 + ], + "spans": [ + { + "bbox": [ + 115, + 343, + 387, + 355 + ], + "score": 1.0, + "content": "optimization. In Proc. Robotics: Science and Systems (RSS), 2014.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 330, + 505, + 355 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 360, + 504, + 384 + ], + "lines": [ + { + "bbox": [ + 106, + 360, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 106, + 360, + 505, + 375 + ], + "score": 1.0, + "content": "Igor Mordatch, Emanuel Todorov, and Zoran Popovic. Discovery of complex behaviors through ´", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 372, + 389, + 384 + ], + "spans": [ + { + "bbox": [ + 115, + 372, + 389, + 384 + ], + "score": 1.0, + "content": "contact-invariant optimization. Trans. on Graphics, 31(4):43, 2012.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5, + "bbox_fs": [ + 106, + 360, + 505, + 384 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 390, + 505, + 424 + ], + "lines": [ + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "score": 1.0, + "content": "Igor Mordatch, Kendall Lowrey, Galen Andrew, Zoran Popovic, and Emanuel V Todorov. Interactive ´", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 402, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 116, + 402, + 505, + 414 + ], + "score": 1.0, + "content": "control of diverse complex characters with neural networks. In Advances in Neural Information", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 117, + 413, + 254, + 425 + ], + "spans": [ + { + "bbox": [ + 117, + 413, + 254, + 425 + ], + "score": 1.0, + "content": "Processing Systems (NIPS), 2015.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 390, + 505, + 425 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 430, + 504, + 464 + ], + "lines": [ + { + "bbox": [ + 105, + 430, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 430, + 506, + 443 + ], + "score": 1.0, + "content": "Jahng-Hyon Park and Haruhiko Asada. Concurrent design optimization of mechanical structure and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 441, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 116, + 441, + 505, + 453 + ], + "score": 1.0, + "content": "control for high speed robots. J. Dynamic Systems, Measurement, and Control, 116(3):344–356,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 452, + 142, + 465 + ], + "spans": [ + { + "bbox": [ + 116, + 452, + 142, + 465 + ], + "score": 1.0, + "content": "1994.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 430, + 506, + 465 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 470, + 505, + 505 + ], + "lines": [ + { + "bbox": [ + 106, + 471, + 506, + 483 + ], + "spans": [ + { + "bbox": [ + 106, + 471, + 506, + 483 + ], + "score": 1.0, + "content": "Chandana Paul and Josh C Bongard. The road less travelled: Morphology in the optimization of", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 116, + 482, + 505, + 495 + ], + "spans": [ + { + "bbox": [ + 116, + 482, + 505, + 495 + ], + "score": 1.0, + "content": "biped robot locomotion. In Proc. IEEE/RSJ Int’l Conf. on Intelligent Robots and Systems (IROS),", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 116, + 493, + 265, + 505 + ], + "spans": [ + { + "bbox": [ + 116, + 493, + 265, + 505 + ], + "score": 1.0, + "content": "volume 1, pp. 226–232. IEEE, 2001.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29, + "bbox_fs": [ + 106, + 471, + 506, + 505 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 511, + 504, + 534 + ], + "lines": [ + { + "bbox": [ + 105, + 510, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 510, + 506, + 525 + ], + "score": 1.0, + "content": "Xue Bin Peng, Glen Berseth, and Michiel Van de Panne. Terrain-adaptive locomotion skills using", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 522, + 381, + 535 + ], + "spans": [ + { + "bbox": [ + 116, + 522, + 381, + 535 + ], + "score": 1.0, + "content": "deep reinforcement learning. Trans. on Graphics, 35(4):81, 2016.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 105, + 510, + 506, + 535 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 540, + 503, + 564 + ], + "lines": [ + { + "bbox": [ + 105, + 539, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 555 + ], + "score": 1.0, + "content": "Anton C. Pil and Harry H. Asada. Integrated structure/control design of mechatronic systems using", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 552, + 488, + 564 + ], + "spans": [ + { + "bbox": [ + 115, + 552, + 488, + 564 + ], + "score": 1.0, + "content": "a recursive experimental optimization method. Trans. on Mechatronics, 1(3):191–203, 1996.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 539, + 505, + 564 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 569, + 505, + 603 + ], + "lines": [ + { + "bbox": [ + 106, + 570, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 106, + 570, + 505, + 582 + ], + "score": 1.0, + "content": "Michael Posa, Scott Kuindersma, and Russ Tedrake. Optimization and stabilization of trajectories", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 581, + 505, + 594 + ], + "spans": [ + { + "bbox": [ + 115, + 581, + 505, + 594 + ], + "score": 1.0, + "content": "for constrained dynamical systems. In Proc. IEEE Int’l Conf. on Robotics and Automation (ICRA),", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 592, + 142, + 604 + ], + "spans": [ + { + "bbox": [ + 115, + 592, + 142, + 604 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36, + "bbox_fs": [ + 106, + 570, + 505, + 604 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 610, + 504, + 633 + ], + "lines": [ + { + "bbox": [ + 106, + 609, + 505, + 624 + ], + "spans": [ + { + "bbox": [ + 106, + 609, + 505, + 624 + ], + "score": 1.0, + "content": "Thambirajah Ravichandran, David Wang, and Glenn Heppler. Simultaneous plant-controller design", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 622, + 452, + 633 + ], + "spans": [ + { + "bbox": [ + 115, + 622, + 452, + 633 + ], + "score": 1.0, + "content": "optimization of a two-link planar manipulator. Mechatronics, 16(3):233–242, 2006.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 106, + 609, + 505, + 633 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 639, + 503, + 663 + ], + "lines": [ + { + "bbox": [ + 105, + 639, + 505, + 653 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 505, + 653 + ], + "score": 1.0, + "content": "Julie A. Reyer and Panos Y. Papalambros. Combined optimal design and control with application to", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 650, + 398, + 663 + ], + "spans": [ + { + "bbox": [ + 115, + 650, + 398, + 663 + ], + "score": 1.0, + "content": "an electric dc motor. J. of Mechanical Design, 124(2):183–191, 2002.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5, + "bbox_fs": [ + 105, + 639, + 505, + 663 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 669, + 504, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 505, + 682 + ], + "score": 1.0, + "content": "Martin Riedmiller. Neural fitted Q iteration-first experiences with a data efficient neural reinforce-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 680, + 505, + 692 + ], + "spans": [ + { + "bbox": [ + 115, + 680, + 505, + 692 + ], + "score": 1.0, + "content": "ment learning method. In Proc. European Conf. on Machine Learning (ECML), volume 3720.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 691, + 180, + 704 + ], + "spans": [ + { + "bbox": [ + 115, + 691, + 180, + 704 + ], + "score": 1.0, + "content": "Springer, 2005.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43, + "bbox_fs": [ + 105, + 668, + 505, + 704 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 502, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 709, + 503, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 503, + 722 + ], + "score": 1.0, + "content": "Sebastian Risi and Julian Togelius. Neuroevolution in games: State of the art and open challenges.", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 116, + 721, + 438, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 438, + 732 + ], + "score": 1.0, + "content": "IEEE Trans. on Computational Intelligence and AI in Games, 9(1):25–41, 2017.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45.5, + "bbox_fs": [ + 105, + 709, + 503, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 104, + 68, + 506, + 664 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Tim Salimans, Jonathan Ho, Xi Chen, and Ilya Sutskever. Evolution strategies as a scalable alterna-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 114, + 94, + 403, + 108 + ], + "spans": [ + { + "bbox": [ + 114, + 94, + 403, + 108 + ], + "score": 1.0, + "content": "tive to reinforcement learning. arXiv preprint arXiv:1703.03864, 2017.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 113, + 504, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 113, + 504, + 125 + ], + "score": 1.0, + "content": "Charles Schaff, David Yunis, Ayan Chakrabarti, and Matthew R. Walter. Jointly optimizing place-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 114, + 123, + 506, + 138 + ], + "spans": [ + { + "bbox": [ + 114, + 123, + 506, + 138 + ], + "score": 1.0, + "content": "ment and inference for beacon-based localization. In Proc. IEEE/RSJ Int’l Conf. on Intelligent", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 135, + 301, + 147 + ], + "spans": [ + { + "bbox": [ + 115, + 135, + 301, + 147 + ], + "score": 1.0, + "content": "Robots and Systems (IROS), September 2017.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 153, + 506, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 506, + 168 + ], + "score": 1.0, + "content": "Jurgen Schmidhuber, Daan Wierstra, Matteo Gagliolo, and Faustino Gomez. Training recurrent ¨", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 163, + 379, + 177 + ], + "spans": [ + { + "bbox": [ + 115, + 163, + 379, + 177 + ], + "score": 1.0, + "content": "networks by evolino. Neural Computation, 19(3):757–779, 2007.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 184, + 504, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 184, + 504, + 196 + ], + "score": 1.0, + "content": "John Schulman, Sergey Levine, Philipp Moritz, Michael I. Jordan, and Pieter Abbeel. Trust region", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 114, + 194, + 367, + 208 + ], + "spans": [ + { + "bbox": [ + 114, + 194, + 367, + 208 + ], + "score": 1.0, + "content": "policy optimization. arXiv preprint arXiv:1502.05477, 2015a.", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 214, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 505, + 226 + ], + "score": 1.0, + "content": "John Schulman, Philipp Moritz, Sergey Levine, Michael Jordan, and Pieter Abbeel. High-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 225, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 115, + 225, + 430, + 237 + ], + "score": 1.0, + "content": "dimensional continuous control using generalized advantage estimation.", + "type": "text" + }, + { + "bbox": [ + 439, + 225, + 505, + 237 + ], + "score": 1.0, + "content": "arXiv preprint", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 235, + 224, + 247 + ], + "spans": [ + { + "bbox": [ + 115, + 235, + 224, + 247 + ], + "score": 1.0, + "content": "arXiv:1506.02438, 2015b.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 253, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 104, + 253, + 505, + 268 + ], + "score": 1.0, + "content": "John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 265, + 381, + 280 + ], + "spans": [ + { + "bbox": [ + 115, + 265, + 381, + 280 + ], + "score": 1.0, + "content": "optimization algorithms. arXiv preprint arXiv:1707.06347, 2017.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 282, + 506, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 506, + 298 + ], + "score": 1.0, + "content": "Frank Sehnke, Christian Osendorfer, Thomas Ruckstieß, Alex Graves, Jan Peters, and J ¨ urgen ¨", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 295, + 491, + 309 + ], + "spans": [ + { + "bbox": [ + 115, + 295, + 491, + 309 + ], + "score": 1.0, + "content": "Schmidhuber. Parameter-exploring policy gradients. Neural Networks, 23(4):551–559, 2010.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 313, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 505, + 327 + ], + "score": 1.0, + "content": "Karl Sims. Evolving virtual creatures. In Proc. Int’l Conf. on Computer Graphics and Interactive", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 324, + 293, + 339 + ], + "spans": [ + { + "bbox": [ + 115, + 324, + 293, + 339 + ], + "score": 1.0, + "content": "Techniques (SIGGRAPH), pp. 15–22, 1994.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 344, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 344, + 505, + 357 + ], + "score": 1.0, + "content": "Andrew Spielberg, Brandon Araki, Cynthia Sung, Russ Tedrake, and Daniela Rus. Functional", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 114, + 354, + 506, + 369 + ], + "spans": [ + { + "bbox": [ + 114, + 354, + 506, + 369 + ], + "score": 1.0, + "content": "co-optimization of articulated robots. In Proceedings of the IEEE International Conference on", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 366, + 299, + 378 + ], + "spans": [ + { + "bbox": [ + 115, + 366, + 299, + 378 + ], + "score": 1.0, + "content": "Robotics and Automation (ICRA), May 2017.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 384, + 506, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 506, + 399 + ], + "score": 1.0, + "content": "Richard S. Sutton, David A. McAllester, Satinder P. Singh, and Yishay Mansour. Policy gradient", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 114, + 394, + 506, + 411 + ], + "spans": [ + { + "bbox": [ + 114, + 394, + 506, + 411 + ], + "score": 1.0, + "content": "methods for reinforcement learning with function approximation. In Advances in Neural Infor-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 114, + 406, + 285, + 420 + ], + "spans": [ + { + "bbox": [ + 114, + 406, + 285, + 420 + ], + "score": 1.0, + "content": "mation Processing Systems (NIPS), 2000.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 424, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 506, + 439 + ], + "score": 1.0, + "content": "Yuval Tassa, Tom Erez, and Emanuel Todorov. Synthesis and stabilization of complex behaviors", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 436, + 506, + 450 + ], + "spans": [ + { + "bbox": [ + 115, + 436, + 506, + 450 + ], + "score": 1.0, + "content": "through online trajectory optimization. In Proc. IEEE/RSJ Int’l Conf. on Intelligent Robots and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 114, + 447, + 208, + 460 + ], + "spans": [ + { + "bbox": [ + 114, + 447, + 208, + 460 + ], + "score": 1.0, + "content": "Systems (IROS), 2012.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 465, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 505, + 480 + ], + "score": 1.0, + "content": "Miguel G. Villarreal-Cervantes, Carlos A. Cruz-Villar, Jaime Alvarez-Gallegos, and Edgar A.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 114, + 475, + 507, + 492 + ], + "spans": [ + { + "bbox": [ + 114, + 475, + 507, + 492 + ], + "score": 1.0, + "content": "Portilla-Flores. Robust structure-control design approach for mechatronic systems. Trans. on", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 488, + 274, + 500 + ], + "spans": [ + { + "bbox": [ + 115, + 488, + 274, + 500 + ], + "score": 1.0, + "content": "Mechatronics, 18(5):1592–1601, 2013.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 505, + 505, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 505, + 521 + ], + "score": 1.0, + "content": "Kevin Wampler, Jovan Popovic, and Zoran Popovi ´ c. Animal locomotion controllers from scratch. ´", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 114, + 517, + 313, + 532 + ], + "spans": [ + { + "bbox": [ + 114, + 517, + 313, + 532 + ], + "score": 1.0, + "content": "In Computer Graphics Forum, volume 32, 2013.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 537, + 505, + 550 + ], + "spans": [ + { + "bbox": [ + 106, + 537, + 505, + 550 + ], + "score": 1.0, + "content": "Manuel Watter, Jost Springenberg, Joschka Boedecker, and Martin Riedmiller. Embed to control:", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 548, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 115, + 548, + 505, + 561 + ], + "score": 1.0, + "content": "A locally linear latent dynamics model for control from raw images. In Advances in Neural", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 559, + 306, + 573 + ], + "spans": [ + { + "bbox": [ + 115, + 559, + 306, + 573 + ], + "score": 1.0, + "content": "Information Processing Systems (NIPS), 2015.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 576, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 104, + 576, + 505, + 592 + ], + "score": 1.0, + "content": "Paweł Wawrzynski. Real-time reinforcement learning by sequential actor-critics and experience ´", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 114, + 588, + 324, + 603 + ], + "spans": [ + { + "bbox": [ + 114, + 588, + 324, + 603 + ], + "score": 1.0, + "content": "replay. Neural Networks, 22(10):1484–1497, 2009.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 607, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 505, + 622 + ], + "score": 1.0, + "content": "Paweł Wawrzynski and Ajay Kumar Tanwani. Autonomous reinforcement learning with experience ´", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 114, + 618, + 298, + 632 + ], + "spans": [ + { + "bbox": [ + 114, + 618, + 298, + 632 + ], + "score": 1.0, + "content": "replay. Neural Networks, 41:156–167, 2013.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "Ronald J. Williams. Simple statistical gradient-following algorithms for connectionist reinforcement", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 114, + 648, + 311, + 662 + ], + "spans": [ + { + "bbox": [ + 114, + 648, + 311, + 662 + ], + "score": 1.0, + "content": "learning. Machine Learning, 8(3–4), May 1992.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 20 + } + ], + "page_idx": 10, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 309, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 309, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "list", + "bbox": [ + 104, + 68, + 506, + 664 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Tim Salimans, Jonathan Ho, Xi Chen, and Ilya Sutskever. Evolution strategies as a scalable alterna-", + "type": "text" + } + ], + "index": 0, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 94, + 403, + 108 + ], + "spans": [ + { + "bbox": [ + 114, + 94, + 403, + 108 + ], + "score": 1.0, + "content": "tive to reinforcement learning. arXiv preprint arXiv:1703.03864, 2017.", + "type": "text" + } + ], + "index": 1, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 113, + 504, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 113, + 504, + 125 + ], + "score": 1.0, + "content": "Charles Schaff, David Yunis, Ayan Chakrabarti, and Matthew R. Walter. Jointly optimizing place-", + "type": "text" + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 123, + 506, + 138 + ], + "spans": [ + { + "bbox": [ + 114, + 123, + 506, + 138 + ], + "score": 1.0, + "content": "ment and inference for beacon-based localization. In Proc. IEEE/RSJ Int’l Conf. on Intelligent", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 135, + 301, + 147 + ], + "spans": [ + { + "bbox": [ + 115, + 135, + 301, + 147 + ], + "score": 1.0, + "content": "Robots and Systems (IROS), September 2017.", + "type": "text" + } + ], + "index": 4, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 153, + 506, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 506, + 168 + ], + "score": 1.0, + "content": "Jurgen Schmidhuber, Daan Wierstra, Matteo Gagliolo, and Faustino Gomez. Training recurrent ¨", + "type": "text" + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 163, + 379, + 177 + ], + "spans": [ + { + "bbox": [ + 115, + 163, + 379, + 177 + ], + "score": 1.0, + "content": "networks by evolino. Neural Computation, 19(3):757–779, 2007.", + "type": "text" + } + ], + "index": 6, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 184, + 504, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 184, + 504, + 196 + ], + "score": 1.0, + "content": "John Schulman, Sergey Levine, Philipp Moritz, Michael I. Jordan, and Pieter Abbeel. Trust region", + "type": "text" + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 194, + 367, + 208 + ], + "spans": [ + { + "bbox": [ + 114, + 194, + 367, + 208 + ], + "score": 1.0, + "content": "policy optimization. arXiv preprint arXiv:1502.05477, 2015a.", + "type": "text" + } + ], + "index": 8, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 214, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 505, + 226 + ], + "score": 1.0, + "content": "John Schulman, Philipp Moritz, Sergey Levine, Michael Jordan, and Pieter Abbeel. High-", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 225, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 115, + 225, + 430, + 237 + ], + "score": 1.0, + "content": "dimensional continuous control using generalized advantage estimation.", + "type": "text" + }, + { + "bbox": [ + 439, + 225, + 505, + 237 + ], + "score": 1.0, + "content": "arXiv preprint", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 235, + 224, + 247 + ], + "spans": [ + { + "bbox": [ + 115, + 235, + 224, + 247 + ], + "score": 1.0, + "content": "arXiv:1506.02438, 2015b.", + "type": "text" + } + ], + "index": 11, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 253, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 104, + 253, + 505, + 268 + ], + "score": 1.0, + "content": "John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 265, + 381, + 280 + ], + "spans": [ + { + "bbox": [ + 115, + 265, + 381, + 280 + ], + "score": 1.0, + "content": "optimization algorithms. arXiv preprint arXiv:1707.06347, 2017.", + "type": "text" + } + ], + "index": 13, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 282, + 506, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 506, + 298 + ], + "score": 1.0, + "content": "Frank Sehnke, Christian Osendorfer, Thomas Ruckstieß, Alex Graves, Jan Peters, and J ¨ urgen ¨", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 295, + 491, + 309 + ], + "spans": [ + { + "bbox": [ + 115, + 295, + 491, + 309 + ], + "score": 1.0, + "content": "Schmidhuber. Parameter-exploring policy gradients. Neural Networks, 23(4):551–559, 2010.", + "type": "text" + } + ], + "index": 15, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 313, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 505, + 327 + ], + "score": 1.0, + "content": "Karl Sims. Evolving virtual creatures. In Proc. Int’l Conf. on Computer Graphics and Interactive", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 324, + 293, + 339 + ], + "spans": [ + { + "bbox": [ + 115, + 324, + 293, + 339 + ], + "score": 1.0, + "content": "Techniques (SIGGRAPH), pp. 15–22, 1994.", + "type": "text" + } + ], + "index": 17, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 344, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 344, + 505, + 357 + ], + "score": 1.0, + "content": "Andrew Spielberg, Brandon Araki, Cynthia Sung, Russ Tedrake, and Daniela Rus. Functional", + "type": "text" + } + ], + "index": 18, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 354, + 506, + 369 + ], + "spans": [ + { + "bbox": [ + 114, + 354, + 506, + 369 + ], + "score": 1.0, + "content": "co-optimization of articulated robots. In Proceedings of the IEEE International Conference on", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 366, + 299, + 378 + ], + "spans": [ + { + "bbox": [ + 115, + 366, + 299, + 378 + ], + "score": 1.0, + "content": "Robotics and Automation (ICRA), May 2017.", + "type": "text" + } + ], + "index": 20, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 384, + 506, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 506, + 399 + ], + "score": 1.0, + "content": "Richard S. Sutton, David A. McAllester, Satinder P. Singh, and Yishay Mansour. Policy gradient", + "type": "text" + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 394, + 506, + 411 + ], + "spans": [ + { + "bbox": [ + 114, + 394, + 506, + 411 + ], + "score": 1.0, + "content": "methods for reinforcement learning with function approximation. In Advances in Neural Infor-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 114, + 406, + 285, + 420 + ], + "spans": [ + { + "bbox": [ + 114, + 406, + 285, + 420 + ], + "score": 1.0, + "content": "mation Processing Systems (NIPS), 2000.", + "type": "text" + } + ], + "index": 23, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 424, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 506, + 439 + ], + "score": 1.0, + "content": "Yuval Tassa, Tom Erez, and Emanuel Todorov. Synthesis and stabilization of complex behaviors", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 436, + 506, + 450 + ], + "spans": [ + { + "bbox": [ + 115, + 436, + 506, + 450 + ], + "score": 1.0, + "content": "through online trajectory optimization. In Proc. IEEE/RSJ Int’l Conf. on Intelligent Robots and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 114, + 447, + 208, + 460 + ], + "spans": [ + { + "bbox": [ + 114, + 447, + 208, + 460 + ], + "score": 1.0, + "content": "Systems (IROS), 2012.", + "type": "text" + } + ], + "index": 26, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 465, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 505, + 480 + ], + "score": 1.0, + "content": "Miguel G. Villarreal-Cervantes, Carlos A. Cruz-Villar, Jaime Alvarez-Gallegos, and Edgar A.", + "type": "text" + } + ], + "index": 27, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 475, + 507, + 492 + ], + "spans": [ + { + "bbox": [ + 114, + 475, + 507, + 492 + ], + "score": 1.0, + "content": "Portilla-Flores. Robust structure-control design approach for mechatronic systems. Trans. on", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 488, + 274, + 500 + ], + "spans": [ + { + "bbox": [ + 115, + 488, + 274, + 500 + ], + "score": 1.0, + "content": "Mechatronics, 18(5):1592–1601, 2013.", + "type": "text" + } + ], + "index": 29, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 505, + 505, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 505, + 521 + ], + "score": 1.0, + "content": "Kevin Wampler, Jovan Popovic, and Zoran Popovi ´ c. Animal locomotion controllers from scratch. ´", + "type": "text" + } + ], + "index": 30, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 517, + 313, + 532 + ], + "spans": [ + { + "bbox": [ + 114, + 517, + 313, + 532 + ], + "score": 1.0, + "content": "In Computer Graphics Forum, volume 32, 2013.", + "type": "text" + } + ], + "index": 31, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 537, + 505, + 550 + ], + "spans": [ + { + "bbox": [ + 106, + 537, + 505, + 550 + ], + "score": 1.0, + "content": "Manuel Watter, Jost Springenberg, Joschka Boedecker, and Martin Riedmiller. Embed to control:", + "type": "text" + } + ], + "index": 32, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 548, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 115, + 548, + 505, + 561 + ], + "score": 1.0, + "content": "A locally linear latent dynamics model for control from raw images. In Advances in Neural", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 559, + 306, + 573 + ], + "spans": [ + { + "bbox": [ + 115, + 559, + 306, + 573 + ], + "score": 1.0, + "content": "Information Processing Systems (NIPS), 2015.", + "type": "text" + } + ], + "index": 34, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 576, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 104, + 576, + 505, + 592 + ], + "score": 1.0, + "content": "Paweł Wawrzynski. Real-time reinforcement learning by sequential actor-critics and experience ´", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 588, + 324, + 603 + ], + "spans": [ + { + "bbox": [ + 114, + 588, + 324, + 603 + ], + "score": 1.0, + "content": "replay. Neural Networks, 22(10):1484–1497, 2009.", + "type": "text" + } + ], + "index": 36, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 607, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 505, + 622 + ], + "score": 1.0, + "content": "Paweł Wawrzynski and Ajay Kumar Tanwani. Autonomous reinforcement learning with experience ´", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 618, + 298, + 632 + ], + "spans": [ + { + "bbox": [ + 114, + 618, + 298, + 632 + ], + "score": 1.0, + "content": "replay. Neural Networks, 41:156–167, 2013.", + "type": "text" + } + ], + "index": 38, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "Ronald J. Williams. Simple statistical gradient-following algorithms for connectionist reinforcement", + "type": "text" + } + ], + "index": 39, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 648, + 311, + 662 + ], + "spans": [ + { + "bbox": [ + 114, + 648, + 311, + 662 + ], + "score": 1.0, + "content": "learning. Machine Learning, 8(3–4), May 1992.", + "type": "text" + } + ], + "index": 40, + "is_list_end_line": true + } + ], + "index": 20, + "bbox_fs": [ + 104, + 81, + 507, + 662 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 81, + 180, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 79, + 182, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 79, + 182, + 96 + ], + "score": 1.0, + "content": "6 APPENDIX", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 108, + 106, + 504, + 128 + ], + "lines": [ + { + "bbox": [ + 106, + 105, + 505, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 505, + 119 + ], + "score": 1.0, + "content": "The following provides further evaluation of our framework, including the behavior of the design", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 117, + 489, + 130 + ], + "spans": [ + { + "bbox": [ + 106, + 117, + 489, + 130 + ], + "score": 1.0, + "content": "distribution during training and the robustness of the learned designs to environment variations.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5 + }, + { + "type": "title", + "bbox": [ + 105, + 142, + 347, + 153 + ], + "lines": [ + { + "bbox": [ + 106, + 142, + 350, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 142, + 350, + 155 + ], + "score": 1.0, + "content": "6.1 A - EVOLUTION OF GMM THROUGHOUT TRAINING", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 106, + 162, + 505, + 239 + ], + "lines": [ + { + "bbox": [ + 106, + 163, + 505, + 175 + ], + "spans": [ + { + "bbox": [ + 106, + 163, + 505, + 175 + ], + "score": 1.0, + "content": "To provide insight into the training process of our algorithm, we evaluate the evolution of the Gaus-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 174, + 505, + 186 + ], + "spans": [ + { + "bbox": [ + 105, + 174, + 505, + 186 + ], + "score": 1.0, + "content": "sian mixture model distribution throughout training of the best performing Hopper experiment. We", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 184, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 105, + 184, + 505, + 198 + ], + "score": 1.0, + "content": "initialize each component of the mixture model with random means and a diagonal covariance ma-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 196, + 505, + 207 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 505, + 207 + ], + "score": 1.0, + "content": "trix chosen to cover the parameter space. The initial mixture weights are uniform. As shown in", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 207, + 506, + 219 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 506, + 219 + ], + "score": 1.0, + "content": "Figure 5 (left), roughly one third of the way through training, our algorithm converges to the most", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 218, + 505, + 230 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 505, + 230 + ], + "score": 1.0, + "content": "successful component. Additionally, we find that modes generally do not collapse (Figure 5 (right)).", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 228, + 426, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 228, + 426, + 240 + ], + "score": 1.0, + "content": "We find this behavior to be consistent across random seeds and different robots.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 110, + 250, + 499, + 401 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 110, + 250, + 499, + 401 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 250, + 499, + 401 + ], + "spans": [ + { + "bbox": [ + 110, + 250, + 499, + 401 + ], + "score": 0.97, + "type": "image", + "image_path": "31445f3810e5a39d1253d521aef51b22276ca400f4dae3d24e97f4bee29e0cef.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 110, + 250, + 499, + 300.3333333333333 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 110, + 300.3333333333333, + 499, + 350.66666666666663 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 110, + 350.66666666666663, + 499, + 400.99999999999994 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 414, + 505, + 437 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 414, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 106, + 414, + 505, + 425 + ], + "score": 1.0, + "content": "Figure 5: Plots of (left) the entropy of the mixture weights and (right) the marginal variance of each", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 424, + 491, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 491, + 438 + ], + "score": 1.0, + "content": "parameter throughout training. The curves are normalized such that all initial variances are one.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + } + ], + "index": 13.25 + }, + { + "type": "title", + "bbox": [ + 108, + 464, + 300, + 475 + ], + "lines": [ + { + "bbox": [ + 106, + 463, + 302, + 476 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 302, + 476 + ], + "score": 1.0, + "content": "6.2 B - ROBUSTNESS OF LEARNED DESIGNS", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 484, + 505, + 573 + ], + "lines": [ + { + "bbox": [ + 105, + 483, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 497 + ], + "score": 1.0, + "content": "It is often desirable for a robot to be able to operate in a variety of environments. In this section,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 496, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 505, + 508 + ], + "score": 1.0, + "content": "we consider the robustness of a learned design to changes in friction. We conducted experiments", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 506, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 505, + 519 + ], + "score": 1.0, + "content": "on the Hopper in which we first learned the design and controller for one friction setting (0.8). We", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 516, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 530 + ], + "score": 1.0, + "content": "finetuned the controller in environments with different friction settings, while leaving the design", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 528, + 505, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 505, + 540 + ], + "score": 1.0, + "content": "fixed. We find the learned design to be reasonably robust with variability comparable to controllers", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 538, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 505, + 551 + ], + "score": 1.0, + "content": "finetuned for the default hand-crafted design (Fig. 6). Additionally, the learned design outperforms", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 549, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 506, + 563 + ], + "score": 1.0, + "content": "the hand-crafted one across the full range of friction values (although, for very low friction values,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 561, + 360, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 360, + 573 + ], + "score": 1.0, + "content": "both designs essentially were unable to learn a successful gait).", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 107, + 578, + 505, + 623 + ], + "lines": [ + { + "bbox": [ + 105, + 577, + 506, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 506, + 591 + ], + "score": 1.0, + "content": "Note that our framework can incorporate this goal of generalization by simply sampling from a", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 590, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 590, + 505, + 601 + ], + "score": 1.0, + "content": "diverse set of environments during training. But at the same time, it may be useful in some applica-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "score": 1.0, + "content": "tions to seek out solutions that are specifically adapted to a relatively narrower set of environments,", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 611, + 439, + 624 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 439, + 624 + ], + "score": 1.0, + "content": "gaining better performance within this set at the cost of more general performance.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26.5 + } + ], + "page_idx": 11, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 309, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 309, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "12", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 81, + 180, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 79, + 182, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 79, + 182, + 96 + ], + "score": 1.0, + "content": "6 APPENDIX", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 108, + 106, + 504, + 128 + ], + "lines": [ + { + "bbox": [ + 106, + 105, + 505, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 505, + 119 + ], + "score": 1.0, + "content": "The following provides further evaluation of our framework, including the behavior of the design", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 117, + 489, + 130 + ], + "spans": [ + { + "bbox": [ + 106, + 117, + 489, + 130 + ], + "score": 1.0, + "content": "distribution during training and the robustness of the learned designs to environment variations.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5, + "bbox_fs": [ + 106, + 105, + 505, + 130 + ] + }, + { + "type": "title", + "bbox": [ + 105, + 142, + 347, + 153 + ], + "lines": [ + { + "bbox": [ + 106, + 142, + 350, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 142, + 350, + 155 + ], + "score": 1.0, + "content": "6.1 A - EVOLUTION OF GMM THROUGHOUT TRAINING", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 106, + 162, + 505, + 239 + ], + "lines": [ + { + "bbox": [ + 106, + 163, + 505, + 175 + ], + "spans": [ + { + "bbox": [ + 106, + 163, + 505, + 175 + ], + "score": 1.0, + "content": "To provide insight into the training process of our algorithm, we evaluate the evolution of the Gaus-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 174, + 505, + 186 + ], + "spans": [ + { + "bbox": [ + 105, + 174, + 505, + 186 + ], + "score": 1.0, + "content": "sian mixture model distribution throughout training of the best performing Hopper experiment. We", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 184, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 105, + 184, + 505, + 198 + ], + "score": 1.0, + "content": "initialize each component of the mixture model with random means and a diagonal covariance ma-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 196, + 505, + 207 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 505, + 207 + ], + "score": 1.0, + "content": "trix chosen to cover the parameter space. The initial mixture weights are uniform. As shown in", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 207, + 506, + 219 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 506, + 219 + ], + "score": 1.0, + "content": "Figure 5 (left), roughly one third of the way through training, our algorithm converges to the most", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 218, + 505, + 230 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 505, + 230 + ], + "score": 1.0, + "content": "successful component. Additionally, we find that modes generally do not collapse (Figure 5 (right)).", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 228, + 426, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 228, + 426, + 240 + ], + "score": 1.0, + "content": "We find this behavior to be consistent across random seeds and different robots.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 163, + 506, + 240 + ] + }, + { + "type": "image", + "bbox": [ + 110, + 250, + 499, + 401 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 110, + 250, + 499, + 401 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 250, + 499, + 401 + ], + "spans": [ + { + "bbox": [ + 110, + 250, + 499, + 401 + ], + "score": 0.97, + "type": "image", + "image_path": "31445f3810e5a39d1253d521aef51b22276ca400f4dae3d24e97f4bee29e0cef.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 110, + 250, + 499, + 300.3333333333333 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 110, + 300.3333333333333, + 499, + 350.66666666666663 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 110, + 350.66666666666663, + 499, + 400.99999999999994 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 414, + 505, + 437 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 414, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 106, + 414, + 505, + 425 + ], + "score": 1.0, + "content": "Figure 5: Plots of (left) the entropy of the mixture weights and (right) the marginal variance of each", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 424, + 491, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 491, + 438 + ], + "score": 1.0, + "content": "parameter throughout training. The curves are normalized such that all initial variances are one.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + } + ], + "index": 13.25 + }, + { + "type": "title", + "bbox": [ + 108, + 464, + 300, + 475 + ], + "lines": [ + { + "bbox": [ + 106, + 463, + 302, + 476 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 302, + 476 + ], + "score": 1.0, + "content": "6.2 B - ROBUSTNESS OF LEARNED DESIGNS", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 484, + 505, + 573 + ], + "lines": [ + { + "bbox": [ + 105, + 483, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 497 + ], + "score": 1.0, + "content": "It is often desirable for a robot to be able to operate in a variety of environments. In this section,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 496, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 505, + 508 + ], + "score": 1.0, + "content": "we consider the robustness of a learned design to changes in friction. We conducted experiments", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 506, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 505, + 519 + ], + "score": 1.0, + "content": "on the Hopper in which we first learned the design and controller for one friction setting (0.8). We", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 516, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 530 + ], + "score": 1.0, + "content": "finetuned the controller in environments with different friction settings, while leaving the design", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 528, + 505, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 505, + 540 + ], + "score": 1.0, + "content": "fixed. We find the learned design to be reasonably robust with variability comparable to controllers", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 538, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 505, + 551 + ], + "score": 1.0, + "content": "finetuned for the default hand-crafted design (Fig. 6). Additionally, the learned design outperforms", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 549, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 506, + 563 + ], + "score": 1.0, + "content": "the hand-crafted one across the full range of friction values (although, for very low friction values,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 561, + 360, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 360, + 573 + ], + "score": 1.0, + "content": "both designs essentially were unable to learn a successful gait).", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 483, + 506, + 573 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 578, + 505, + 623 + ], + "lines": [ + { + "bbox": [ + 105, + 577, + 506, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 506, + 591 + ], + "score": 1.0, + "content": "Note that our framework can incorporate this goal of generalization by simply sampling from a", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 590, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 590, + 505, + 601 + ], + "score": 1.0, + "content": "diverse set of environments during training. But at the same time, it may be useful in some applica-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "score": 1.0, + "content": "tions to seek out solutions that are specifically adapted to a relatively narrower set of environments,", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 611, + 439, + 624 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 439, + 624 + ], + "score": 1.0, + "content": "gaining better performance within this set at the cost of more general performance.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 577, + 506, + 624 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 143, + 253, + 465, + 500 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 143, + 253, + 465, + 500 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 143, + 253, + 465, + 500 + ], + "spans": [ + { + "bbox": [ + 143, + 253, + 465, + 500 + ], + "score": 0.972, + "type": "image", + "image_path": "6950886e33eae5aebfefebe1362c093a2ef2d79ce2a27d5c428bd80267a0f480.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 143, + 253, + 465, + 335.3333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 143, + 335.3333333333333, + 465, + 417.66666666666663 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 143, + 417.66666666666663, + 465, + 499.99999999999994 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 511, + 506, + 557 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 512, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 505, + 524 + ], + "score": 1.0, + "content": "Figure 6: A visualization of accumulated reward for different friction values. The controllers and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 523, + 505, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 505, + 535 + ], + "score": 1.0, + "content": "learned design were trained in an environment with a friction value of 0.8. We finetuned the con-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 534, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 505, + 546 + ], + "score": 1.0, + "content": "trollers (but not the designs) for both the learned and hand-crafted designs for 10M timesteps for", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 545, + 406, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 406, + 558 + ], + "score": 1.0, + "content": "each friction value. Rewards are reported as an average over 100 episodes.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + } + ], + "page_idx": 12, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "13", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 143, + 253, + 465, + 500 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 143, + 253, + 465, + 500 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 143, + 253, + 465, + 500 + ], + "spans": [ + { + "bbox": [ + 143, + 253, + 465, + 500 + ], + "score": 0.972, + "type": "image", + "image_path": "6950886e33eae5aebfefebe1362c093a2ef2d79ce2a27d5c428bd80267a0f480.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 143, + 253, + 465, + 335.3333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 143, + 335.3333333333333, + 465, + 417.66666666666663 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 143, + 417.66666666666663, + 465, + 499.99999999999994 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 511, + 506, + 557 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 512, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 505, + 524 + ], + "score": 1.0, + "content": "Figure 6: A visualization of accumulated reward for different friction values. The controllers and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 523, + 505, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 505, + 535 + ], + "score": 1.0, + "content": "learned design were trained in an environment with a friction value of 0.8. We finetuned the con-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 534, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 505, + 546 + ], + "score": 1.0, + "content": "trollers (but not the designs) for both the learned and hand-crafted designs for 10M timesteps for", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 545, + 406, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 406, + 558 + ], + "score": 1.0, + "content": "each friction value. Rewards are reported as an average over 100 episodes.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/SyfiiMZA-/SyfiiMZA-_model.json b/parse/train/SyfiiMZA-/SyfiiMZA-_model.json new file mode 100644 index 0000000000000000000000000000000000000000..cd84844c9188cf6e806799c2720f9683f359c2f6 --- /dev/null +++ b/parse/train/SyfiiMZA-/SyfiiMZA-_model.json @@ -0,0 +1,13942 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 584, + 1302, + 584, + 1302, + 1010, + 398, + 1010 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 1421, + 1403, + 1421, + 1403, + 1727, + 298, + 1727 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1130, + 1403, + 1130, + 1403, + 1406, + 298, + 1406 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1742, + 1402, + 1742, + 1402, + 1958, + 298, + 1958 + ], + "score": 0.98 + }, + { + "category_id": 0, + "poly": [ + 301, + 219, + 1399, + 219, + 1399, + 324, + 301, + 324 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 297, + 1973, + 1398, + 1973, + 1398, + 2034, + 297, + 2034 + ], + "score": 0.938 + }, + { + "category_id": 1, + "poly": [ + 313, + 378, + 680, + 378, + 680, + 438, + 313, + 438 + ], + "score": 0.932 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 857, + 75, + 857, + 105, + 298, + 105 + ], + "score": 0.901 + }, + { + "category_id": 0, + "poly": [ + 303, + 1063, + 573, + 1063, + 573, + 1098, + 303, + 1098 + ], + "score": 0.893 + }, + { + "category_id": 0, + "poly": [ + 773, + 519, + 926, + 519, + 926, + 553, + 773, + 553 + ], + "score": 0.869 + }, + { + "category_id": 2, + "poly": [ + 842, + 2089, + 857, + 2089, + 857, + 2112, + 842, + 2112 + ], + "score": 0.629 + }, + { + "category_id": 15, + "poly": [ + 294.0, + 218.0, + 1404.0, + 218.0, + 1404.0, + 273.0, + 294.0, + 273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 274.0, + 1342.0, + 274.0, + 1342.0, + 328.0, + 295.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 859.0, + 73.0, + 859.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1059.0, + 579.0, + 1059.0, + 579.0, + 1106.0, + 294.0, + 1106.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 518.0, + 932.0, + 518.0, + 932.0, + 556.0, + 769.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 841.0, + 2088.0, + 860.0, + 2088.0, + 860.0, + 2118.0, + 841.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 584.0, + 1305.0, + 584.0, + 1305.0, + 619.0, + 396.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 613.0, + 1306.0, + 613.0, + 1306.0, + 651.0, + 394.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 644.0, + 1305.0, + 644.0, + 1305.0, + 682.0, + 393.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 677.0, + 1306.0, + 677.0, + 1306.0, + 710.0, + 393.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 706.0, + 1307.0, + 706.0, + 1307.0, + 740.0, + 394.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 735.0, + 1304.0, + 735.0, + 1304.0, + 773.0, + 392.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 767.0, + 1307.0, + 767.0, + 1307.0, + 802.0, + 393.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 799.0, + 1305.0, + 799.0, + 1305.0, + 831.0, + 394.0, + 831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 829.0, + 1306.0, + 829.0, + 1306.0, + 861.0, + 393.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 857.0, + 1305.0, + 857.0, + 1305.0, + 893.0, + 394.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 889.0, + 1305.0, + 889.0, + 1305.0, + 921.0, + 394.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 920.0, + 1304.0, + 920.0, + 1304.0, + 952.0, + 394.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 948.0, + 1304.0, + 948.0, + 1304.0, + 986.0, + 393.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 977.0, + 1300.0, + 977.0, + 1300.0, + 1017.0, + 392.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1420.0, + 1404.0, + 1420.0, + 1404.0, + 1456.0, + 296.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1451.0, + 1408.0, + 1451.0, + 1408.0, + 1490.0, + 292.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1483.0, + 1405.0, + 1483.0, + 1405.0, + 1518.0, + 293.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1516.0, + 1404.0, + 1516.0, + 1404.0, + 1547.0, + 294.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1542.0, + 1407.0, + 1542.0, + 1407.0, + 1582.0, + 292.0, + 1582.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1573.0, + 1405.0, + 1573.0, + 1405.0, + 1610.0, + 293.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1604.0, + 1405.0, + 1604.0, + 1405.0, + 1639.0, + 293.0, + 1639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1634.0, + 1407.0, + 1634.0, + 1407.0, + 1670.0, + 292.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1665.0, + 1405.0, + 1665.0, + 1405.0, + 1701.0, + 293.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1692.0, + 1227.0, + 1692.0, + 1227.0, + 1735.0, + 292.0, + 1735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1132.0, + 1404.0, + 1132.0, + 1404.0, + 1165.0, + 297.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1161.0, + 1405.0, + 1161.0, + 1405.0, + 1197.0, + 292.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1191.0, + 1405.0, + 1191.0, + 1405.0, + 1229.0, + 292.0, + 1229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1224.0, + 1404.0, + 1224.0, + 1404.0, + 1256.0, + 294.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1251.0, + 1404.0, + 1251.0, + 1404.0, + 1288.0, + 293.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1285.0, + 1404.0, + 1285.0, + 1404.0, + 1318.0, + 294.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1315.0, + 1404.0, + 1315.0, + 1404.0, + 1348.0, + 294.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1346.0, + 1404.0, + 1346.0, + 1404.0, + 1379.0, + 296.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1376.0, + 928.0, + 1376.0, + 928.0, + 1409.0, + 296.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1743.0, + 1406.0, + 1743.0, + 1406.0, + 1777.0, + 296.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1773.0, + 1406.0, + 1773.0, + 1406.0, + 1808.0, + 294.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1804.0, + 1406.0, + 1804.0, + 1406.0, + 1839.0, + 294.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1831.0, + 1406.0, + 1831.0, + 1406.0, + 1871.0, + 293.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1864.0, + 1407.0, + 1864.0, + 1407.0, + 1902.0, + 293.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1894.0, + 1406.0, + 1894.0, + 1406.0, + 1929.0, + 293.0, + 1929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1928.0, + 1224.0, + 1928.0, + 1224.0, + 1959.0, + 297.0, + 1959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1970.0, + 1404.0, + 1970.0, + 1404.0, + 2007.0, + 293.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 2001.0, + 1404.0, + 2001.0, + 1404.0, + 2040.0, + 292.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 379.0, + 560.0, + 379.0, + 560.0, + 411.0, + 315.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 407.0, + 681.0, + 407.0, + 681.0, + 442.0, + 312.0, + 442.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1301, + 1403, + 1301, + 1403, + 2033, + 298, + 2033 + ], + "score": 0.985 + }, + { + "category_id": 1, + "poly": [ + 298, + 799, + 1404, + 799, + 1404, + 1166, + 298, + 1166 + ], + "score": 0.982 + }, + { + "category_id": 4, + "poly": [ + 296, + 576, + 1405, + 576, + 1405, + 732, + 296, + 732 + ], + "score": 0.958 + }, + { + "category_id": 0, + "poly": [ + 300, + 1224, + 587, + 1224, + 587, + 1259, + 300, + 1259 + ], + "score": 0.903 + }, + { + "category_id": 3, + "poly": [ + 298, + 232, + 1404, + 232, + 1404, + 547, + 298, + 547 + ], + "score": 0.876 + }, + { + "category_id": 2, + "poly": [ + 297, + 76, + 857, + 76, + 857, + 104, + 297, + 104 + ], + "score": 0.87 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.7 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.213 + }, + { + "category_id": 15, + "poly": [ + 295.0, + 578.0, + 1405.0, + 578.0, + 1405.0, + 611.0, + 295.0, + 611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 609.0, + 1405.0, + 609.0, + 1405.0, + 642.0, + 295.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 635.0, + 1405.0, + 635.0, + 1405.0, + 674.0, + 293.0, + 674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 666.0, + 1406.0, + 666.0, + 1406.0, + 706.0, + 293.0, + 706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 698.0, + 706.0, + 698.0, + 706.0, + 738.0, + 293.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1221.0, + 593.0, + 1221.0, + 593.0, + 1265.0, + 292.0, + 1265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 207.0, + 1423.0, + 207.0, + 1423.0, + 435.0, + 289.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 515.0, + 423.0, + 515.0, + 423.0, + 548.0, + 349.0, + 548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 519.0, + 573.0, + 519.0, + 573.0, + 546.0, + 517.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1299.0, + 519.0, + 1352.0, + 519.0, + 1352.0, + 546.0, + 1299.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 859.0, + 73.0, + 859.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2120.0, + 839.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2120.0, + 838.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1303.0, + 1407.0, + 1303.0, + 1407.0, + 1338.0, + 294.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1333.0, + 1407.0, + 1333.0, + 1407.0, + 1371.0, + 292.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1362.0, + 1406.0, + 1362.0, + 1406.0, + 1400.0, + 292.0, + 1400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1392.0, + 1404.0, + 1392.0, + 1404.0, + 1432.0, + 292.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1424.0, + 1405.0, + 1424.0, + 1405.0, + 1459.0, + 293.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1455.0, + 1407.0, + 1455.0, + 1407.0, + 1490.0, + 294.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1485.0, + 1405.0, + 1485.0, + 1405.0, + 1520.0, + 294.0, + 1520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1512.0, + 1405.0, + 1512.0, + 1405.0, + 1553.0, + 292.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1544.0, + 1403.0, + 1544.0, + 1403.0, + 1582.0, + 293.0, + 1582.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1575.0, + 1404.0, + 1575.0, + 1404.0, + 1613.0, + 293.0, + 1613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1605.0, + 1404.0, + 1605.0, + 1404.0, + 1646.0, + 292.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1636.0, + 1404.0, + 1636.0, + 1404.0, + 1673.0, + 293.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1668.0, + 1405.0, + 1668.0, + 1405.0, + 1703.0, + 296.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1699.0, + 1405.0, + 1699.0, + 1405.0, + 1734.0, + 294.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1730.0, + 1404.0, + 1730.0, + 1404.0, + 1765.0, + 294.0, + 1765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1760.0, + 1404.0, + 1760.0, + 1404.0, + 1795.0, + 294.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1788.0, + 1407.0, + 1788.0, + 1407.0, + 1827.0, + 293.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1821.0, + 1405.0, + 1821.0, + 1405.0, + 1855.0, + 293.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1851.0, + 1403.0, + 1851.0, + 1403.0, + 1886.0, + 292.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1880.0, + 1407.0, + 1880.0, + 1407.0, + 1920.0, + 292.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1911.0, + 1404.0, + 1911.0, + 1404.0, + 1946.0, + 294.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1943.0, + 1405.0, + 1943.0, + 1405.0, + 1978.0, + 294.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1972.0, + 1403.0, + 1972.0, + 1403.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 2000.0, + 1403.0, + 2000.0, + 1403.0, + 2038.0, + 292.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 799.0, + 1405.0, + 799.0, + 1405.0, + 837.0, + 292.0, + 837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 832.0, + 1404.0, + 832.0, + 1404.0, + 866.0, + 293.0, + 866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 858.0, + 1403.0, + 858.0, + 1403.0, + 899.0, + 293.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 888.0, + 1404.0, + 888.0, + 1404.0, + 930.0, + 292.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 922.0, + 1403.0, + 922.0, + 1403.0, + 957.0, + 293.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 953.0, + 1404.0, + 953.0, + 1404.0, + 987.0, + 294.0, + 987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 985.0, + 1405.0, + 985.0, + 1405.0, + 1019.0, + 294.0, + 1019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1013.0, + 1406.0, + 1013.0, + 1406.0, + 1051.0, + 293.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1045.0, + 1405.0, + 1045.0, + 1405.0, + 1079.0, + 294.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1074.0, + 1407.0, + 1074.0, + 1407.0, + 1110.0, + 292.0, + 1110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1104.0, + 1402.0, + 1104.0, + 1402.0, + 1138.0, + 294.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1137.0, + 1327.0, + 1137.0, + 1327.0, + 1171.0, + 293.0, + 1171.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 748, + 1404, + 748, + 1404, + 1329, + 298, + 1329 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 309, + 1404, + 309, + 1404, + 734, + 298, + 734 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1666, + 1404, + 1666, + 1404, + 2032, + 298, + 2032 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1345, + 1404, + 1345, + 1404, + 1651, + 298, + 1651 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 296, + 230, + 1401, + 230, + 1401, + 292, + 296, + 292 + ], + "score": 0.952 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 856, + 76, + 856, + 104, + 298, + 104 + ], + "score": 0.868 + }, + { + "category_id": 2, + "poly": [ + 842, + 2089, + 858, + 2089, + 858, + 2112, + 842, + 2112 + ], + "score": 0.599 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 859, + 2088, + 859, + 2111, + 842, + 2111 + ], + "score": 0.369 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 855, + 76, + 855, + 104, + 300, + 104 + ], + "score": 0.111 + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 859.0, + 73.0, + 859.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2118.0, + 839.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2117.0, + 839.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 859.0, + 73.0, + 859.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 752.0, + 1405.0, + 752.0, + 1405.0, + 783.0, + 296.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 782.0, + 1405.0, + 782.0, + 1405.0, + 817.0, + 293.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 809.0, + 1406.0, + 809.0, + 1406.0, + 847.0, + 293.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 844.0, + 1405.0, + 844.0, + 1405.0, + 876.0, + 296.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 873.0, + 1406.0, + 873.0, + 1406.0, + 908.0, + 294.0, + 908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 905.0, + 1406.0, + 905.0, + 1406.0, + 940.0, + 294.0, + 940.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 932.0, + 1405.0, + 932.0, + 1405.0, + 970.0, + 293.0, + 970.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 962.0, + 1405.0, + 962.0, + 1405.0, + 1000.0, + 293.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 995.0, + 1406.0, + 995.0, + 1406.0, + 1030.0, + 294.0, + 1030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1023.0, + 1405.0, + 1023.0, + 1405.0, + 1062.0, + 293.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1056.0, + 1404.0, + 1056.0, + 1404.0, + 1091.0, + 294.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1084.0, + 1405.0, + 1084.0, + 1405.0, + 1122.0, + 293.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1115.0, + 1406.0, + 1115.0, + 1406.0, + 1152.0, + 293.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1147.0, + 1404.0, + 1147.0, + 1404.0, + 1182.0, + 294.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1176.0, + 1409.0, + 1176.0, + 1409.0, + 1215.0, + 292.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1207.0, + 1406.0, + 1207.0, + 1406.0, + 1243.0, + 294.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1238.0, + 1406.0, + 1238.0, + 1406.0, + 1271.0, + 293.0, + 1271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1268.0, + 1406.0, + 1268.0, + 1406.0, + 1304.0, + 293.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1299.0, + 641.0, + 1299.0, + 641.0, + 1333.0, + 294.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 308.0, + 1404.0, + 308.0, + 1404.0, + 344.0, + 296.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 339.0, + 1406.0, + 339.0, + 1406.0, + 374.0, + 293.0, + 374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 369.0, + 1406.0, + 369.0, + 1406.0, + 404.0, + 294.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 400.0, + 1406.0, + 400.0, + 1406.0, + 433.0, + 293.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 429.0, + 1406.0, + 429.0, + 1406.0, + 465.0, + 294.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 462.0, + 1404.0, + 462.0, + 1404.0, + 494.0, + 296.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 489.0, + 1405.0, + 489.0, + 1405.0, + 527.0, + 292.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 520.0, + 1406.0, + 520.0, + 1406.0, + 558.0, + 291.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 548.0, + 1405.0, + 548.0, + 1405.0, + 590.0, + 292.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 582.0, + 1406.0, + 582.0, + 1406.0, + 619.0, + 293.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 612.0, + 1405.0, + 612.0, + 1405.0, + 648.0, + 294.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 643.0, + 1406.0, + 643.0, + 1406.0, + 675.0, + 293.0, + 675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 674.0, + 1405.0, + 674.0, + 1405.0, + 710.0, + 293.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 706.0, + 680.0, + 706.0, + 680.0, + 737.0, + 296.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1662.0, + 1406.0, + 1662.0, + 1406.0, + 1705.0, + 292.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1695.0, + 1405.0, + 1695.0, + 1405.0, + 1735.0, + 291.0, + 1735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1725.0, + 1406.0, + 1725.0, + 1406.0, + 1764.0, + 292.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1759.0, + 1404.0, + 1759.0, + 1404.0, + 1793.0, + 294.0, + 1793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1785.0, + 1405.0, + 1785.0, + 1405.0, + 1826.0, + 292.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1819.0, + 1405.0, + 1819.0, + 1405.0, + 1855.0, + 293.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1850.0, + 1404.0, + 1850.0, + 1404.0, + 1884.0, + 294.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1879.0, + 1404.0, + 1879.0, + 1404.0, + 1913.0, + 294.0, + 1913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1912.0, + 1405.0, + 1912.0, + 1405.0, + 1946.0, + 293.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1941.0, + 1405.0, + 1941.0, + 1405.0, + 1975.0, + 294.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1972.0, + 1405.0, + 1972.0, + 1405.0, + 2006.0, + 294.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2002.0, + 1333.0, + 2002.0, + 1333.0, + 2036.0, + 294.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1344.0, + 1405.0, + 1344.0, + 1405.0, + 1380.0, + 294.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1376.0, + 1406.0, + 1376.0, + 1406.0, + 1412.0, + 294.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1408.0, + 1402.0, + 1408.0, + 1402.0, + 1440.0, + 294.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1433.0, + 1406.0, + 1433.0, + 1406.0, + 1474.0, + 292.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1465.0, + 1405.0, + 1465.0, + 1405.0, + 1502.0, + 293.0, + 1502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1497.0, + 1406.0, + 1497.0, + 1406.0, + 1534.0, + 293.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1528.0, + 1405.0, + 1528.0, + 1405.0, + 1564.0, + 293.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1555.0, + 1406.0, + 1555.0, + 1406.0, + 1596.0, + 291.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1588.0, + 1405.0, + 1588.0, + 1405.0, + 1625.0, + 292.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1617.0, + 860.0, + 1617.0, + 860.0, + 1654.0, + 292.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 228.0, + 1405.0, + 228.0, + 1405.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 261.0, + 1384.0, + 261.0, + 1384.0, + 298.0, + 294.0, + 298.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1229, + 1404, + 1229, + 1404, + 1568, + 298, + 1568 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 520, + 1403, + 520, + 1403, + 766, + 298, + 766 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1404, + 229, + 1404, + 506, + 298, + 506 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1581, + 1403, + 1581, + 1403, + 1797, + 297, + 1797 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1030, + 1404, + 1030, + 1404, + 1218, + 298, + 1218 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1867, + 1404, + 1867, + 1404, + 2034, + 298, + 2034 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 300, + 876, + 1404, + 876, + 1404, + 937, + 300, + 937 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 593, + 1804, + 1103, + 1804, + 1103, + 1860, + 593, + 1860 + ], + "score": 0.937 + }, + { + "category_id": 0, + "poly": [ + 300, + 808, + 508, + 808, + 508, + 843, + 300, + 843 + ], + "score": 0.894 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1816, + 1399, + 1816, + 1399, + 1845, + 1366, + 1845 + ], + "score": 0.881 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 856, + 76, + 856, + 104, + 298, + 104 + ], + "score": 0.88 + }, + { + "category_id": 0, + "poly": [ + 304, + 974, + 883, + 974, + 883, + 1005, + 304, + 1005 + ], + "score": 0.865 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.772 + }, + { + "category_id": 13, + "poly": [ + 799, + 1182, + 1014, + 1182, + 1014, + 1220, + 799, + 1220 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { \\mathcal { R } _ { t } = \\sum _ { i = 0 } ^ { \\infty } \\gamma ^ { i } r _ { t + i } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1032, + 1352, + 1139, + 1352, + 1139, + 1386, + 1032, + 1386 + ], + "score": 0.94, + "latex": "\\bar { \\pi _ { \\boldsymbol { \\theta } } } ( a _ { t } | \\boldsymbol { s } _ { t } )" + }, + { + "category_id": 13, + "poly": [ + 441, + 1413, + 547, + 1413, + 547, + 1446, + 441, + 1446 + ], + "score": 0.93, + "latex": "\\nabla _ { \\boldsymbol { \\theta } } \\mathbb { E } [ \\mathcal { R } _ { t } ]" + }, + { + "category_id": 13, + "poly": [ + 375, + 1867, + 596, + 1867, + 596, + 1915, + 375, + 1915 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { r _ { t } ( \\theta ) = \\frac { \\pi _ { \\theta } ( a _ { t } | s _ { t } ) } { \\pi _ { \\theta _ { \\mathrm { o l d } } } ( a _ { t } | s _ { t } ) } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 834, + 1536, + 892, + 1536, + 892, + 1569, + 834, + 1569 + ], + "score": 0.92, + "latex": "b ( s _ { t } )" + }, + { + "category_id": 13, + "poly": [ + 1065, + 1183, + 1176, + 1183, + 1176, + 1217, + 1065, + 1217 + ], + "score": 0.92, + "latex": "\\gamma \\in [ 0 , 1 )" + }, + { + "category_id": 13, + "poly": [ + 473, + 1093, + 554, + 1093, + 554, + 1123, + 473, + 1123 + ], + "score": 0.92, + "latex": "s _ { t } \\in S" + }, + { + "category_id": 13, + "poly": [ + 643, + 1183, + 712, + 1183, + 712, + 1217, + 643, + 1217 + ], + "score": 0.92, + "latex": "\\mathbb { E } [ \\mathcal { R } _ { t } ]" + }, + { + "category_id": 13, + "poly": [ + 745, + 1094, + 832, + 1094, + 832, + 1123, + 745, + 1123 + ], + "score": 0.92, + "latex": "a _ { t } \\in { \\mathcal { A } }" + }, + { + "category_id": 13, + "poly": [ + 992, + 1945, + 1051, + 1945, + 1051, + 1976, + 992, + 1976 + ], + "score": 0.91, + "latex": "r _ { t } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 1053, + 1413, + 1274, + 1413, + 1274, + 1447, + 1053, + 1447 + ], + "score": 0.91, + "latex": "\\nabla _ { \\theta } \\log \\pi _ { \\theta } ( \\bar { a _ { t } } \\vert s _ { t } ) \\mathcal { R } _ { t }" + }, + { + "category_id": 14, + "poly": [ + 593, + 1801, + 1102, + 1801, + 1102, + 1861, + 593, + 1861 + ], + "score": 0.91, + "latex": "\\hat { \\mathbb { E } } _ { t } \\left[ \\operatorname* { m i n } ( r _ { t } ( \\theta ) \\hat { A } _ { t } , \\operatorname { c l i p } ( r _ { t } ( \\theta ) , 1 - \\epsilon , 1 + \\epsilon ) ) \\right] ," + }, + { + "category_id": 13, + "poly": [ + 1269, + 1942, + 1393, + 1942, + 1393, + 1976, + 1269, + 1976 + ], + "score": 0.91, + "latex": "[ 1 - \\epsilon , 1 + \\epsilon ]" + }, + { + "category_id": 13, + "poly": [ + 1078, + 1093, + 1210, + 1093, + 1210, + 1121, + 1078, + 1121 + ], + "score": 0.9, + "latex": "\\pi : { \\mathcal { S } } A" + }, + { + "category_id": 13, + "poly": [ + 814, + 1127, + 869, + 1127, + 869, + 1156, + 814, + 1156 + ], + "score": 0.89, + "latex": "s _ { t + 1 }" + }, + { + "category_id": 13, + "poly": [ + 653, + 1870, + 684, + 1870, + 684, + 1903, + 653, + 1903 + ], + "score": 0.88, + "latex": "\\hat { \\mathbb { E } } _ { t }" + }, + { + "category_id": 13, + "poly": [ + 1318, + 1155, + 1351, + 1155, + 1351, + 1182, + 1318, + 1182 + ], + "score": 0.85, + "latex": "\\pi ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 575, + 1127, + 601, + 1127, + 601, + 1154, + 575, + 1154 + ], + "score": 0.85, + "latex": "r _ { t }" + }, + { + "category_id": 13, + "poly": [ + 1263, + 1066, + 1278, + 1066, + 1278, + 1090, + 1263, + 1090 + ], + "score": 0.66, + "latex": "t" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 803.0, + 514.0, + 803.0, + 514.0, + 851.0, + 292.0, + 851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 859.0, + 73.0, + 859.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 973.0, + 889.0, + 973.0, + 889.0, + 1008.0, + 296.0, + 1008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1226.0, + 1405.0, + 1226.0, + 1405.0, + 1269.0, + 292.0, + 1269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1263.0, + 1405.0, + 1263.0, + 1405.0, + 1295.0, + 293.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1290.0, + 1404.0, + 1290.0, + 1404.0, + 1327.0, + 293.0, + 1327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1321.0, + 1405.0, + 1321.0, + 1405.0, + 1360.0, + 293.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1351.0, + 1031.0, + 1351.0, + 1031.0, + 1390.0, + 293.0, + 1390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 1351.0, + 1406.0, + 1351.0, + 1406.0, + 1390.0, + 1140.0, + 1390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1382.0, + 1408.0, + 1382.0, + 1408.0, + 1421.0, + 293.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1413.0, + 440.0, + 1413.0, + 440.0, + 1448.0, + 294.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 548.0, + 1413.0, + 1052.0, + 1413.0, + 1052.0, + 1448.0, + 548.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 1413.0, + 1406.0, + 1413.0, + 1406.0, + 1448.0, + 1275.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1443.0, + 1404.0, + 1443.0, + 1404.0, + 1478.0, + 296.0, + 1478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1475.0, + 1402.0, + 1475.0, + 1402.0, + 1509.0, + 294.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1505.0, + 1405.0, + 1505.0, + 1405.0, + 1539.0, + 294.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1536.0, + 833.0, + 1536.0, + 833.0, + 1571.0, + 293.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 1536.0, + 902.0, + 1536.0, + 902.0, + 1571.0, + 893.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 522.0, + 1403.0, + 522.0, + 1403.0, + 555.0, + 294.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 553.0, + 1404.0, + 553.0, + 1404.0, + 587.0, + 294.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 583.0, + 1403.0, + 583.0, + 1403.0, + 617.0, + 293.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 612.0, + 1405.0, + 612.0, + 1405.0, + 648.0, + 292.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 641.0, + 1405.0, + 641.0, + 1405.0, + 679.0, + 291.0, + 679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 674.0, + 1405.0, + 674.0, + 1405.0, + 708.0, + 294.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 704.0, + 1405.0, + 704.0, + 1405.0, + 738.0, + 294.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 733.0, + 1376.0, + 733.0, + 1376.0, + 769.0, + 293.0, + 769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 231.0, + 1405.0, + 231.0, + 1405.0, + 264.0, + 296.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 261.0, + 1405.0, + 261.0, + 1405.0, + 295.0, + 292.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 293.0, + 1405.0, + 293.0, + 1405.0, + 326.0, + 296.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 320.0, + 1408.0, + 320.0, + 1408.0, + 358.0, + 292.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 352.0, + 1406.0, + 352.0, + 1406.0, + 388.0, + 294.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 381.0, + 1404.0, + 381.0, + 1404.0, + 417.0, + 294.0, + 417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 412.0, + 1404.0, + 412.0, + 1404.0, + 450.0, + 292.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 441.0, + 1406.0, + 441.0, + 1406.0, + 479.0, + 293.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 476.0, + 664.0, + 476.0, + 664.0, + 511.0, + 292.0, + 511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1583.0, + 1403.0, + 1583.0, + 1403.0, + 1617.0, + 295.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1611.0, + 1405.0, + 1611.0, + 1405.0, + 1648.0, + 293.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1646.0, + 1403.0, + 1646.0, + 1403.0, + 1677.0, + 295.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1674.0, + 1405.0, + 1674.0, + 1405.0, + 1709.0, + 295.0, + 1709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1703.0, + 1405.0, + 1703.0, + 1405.0, + 1740.0, + 294.0, + 1740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1736.0, + 1405.0, + 1736.0, + 1405.0, + 1768.0, + 293.0, + 1768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1762.0, + 1340.0, + 1762.0, + 1340.0, + 1801.0, + 295.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1029.0, + 1406.0, + 1029.0, + 1406.0, + 1066.0, + 292.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1060.0, + 1262.0, + 1060.0, + 1262.0, + 1098.0, + 292.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1279.0, + 1060.0, + 1406.0, + 1060.0, + 1406.0, + 1098.0, + 1279.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1091.0, + 472.0, + 1091.0, + 472.0, + 1128.0, + 292.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 555.0, + 1091.0, + 744.0, + 1091.0, + 744.0, + 1128.0, + 555.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 833.0, + 1091.0, + 1077.0, + 1091.0, + 1077.0, + 1128.0, + 833.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1211.0, + 1091.0, + 1406.0, + 1091.0, + 1406.0, + 1128.0, + 1211.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1123.0, + 574.0, + 1123.0, + 574.0, + 1159.0, + 293.0, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 602.0, + 1123.0, + 813.0, + 1123.0, + 813.0, + 1159.0, + 602.0, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 1123.0, + 1406.0, + 1123.0, + 1406.0, + 1159.0, + 870.0, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1155.0, + 1317.0, + 1155.0, + 1317.0, + 1187.0, + 296.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 1155.0, + 1405.0, + 1155.0, + 1405.0, + 1187.0, + 1352.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1175.0, + 642.0, + 1175.0, + 642.0, + 1227.0, + 290.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 713.0, + 1175.0, + 798.0, + 1175.0, + 798.0, + 1227.0, + 713.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1015.0, + 1175.0, + 1064.0, + 1175.0, + 1064.0, + 1227.0, + 1015.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1177.0, + 1175.0, + 1405.0, + 1175.0, + 1405.0, + 1227.0, + 1177.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1871.0, + 374.0, + 1871.0, + 374.0, + 1905.0, + 293.0, + 1905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 1869.0, + 652.0, + 1869.0, + 652.0, + 1908.0, + 597.0, + 1908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 1869.0, + 1406.0, + 1869.0, + 1406.0, + 1908.0, + 685.0, + 1908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1910.0, + 1402.0, + 1910.0, + 1402.0, + 1943.0, + 296.0, + 1943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1941.0, + 991.0, + 1941.0, + 991.0, + 1978.0, + 293.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 1941.0, + 1268.0, + 1941.0, + 1268.0, + 1978.0, + 1052.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1941.0, + 1405.0, + 1941.0, + 1405.0, + 1978.0, + 1394.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1971.0, + 1405.0, + 1971.0, + 1405.0, + 2007.0, + 293.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 2001.0, + 1091.0, + 2001.0, + 1091.0, + 2036.0, + 292.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 871.0, + 1404.0, + 871.0, + 1404.0, + 914.0, + 293.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 905.0, + 1390.0, + 905.0, + 1390.0, + 943.0, + 294.0, + 943.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 989, + 1405, + 989, + 1405, + 1509, + 297, + 1509 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 1787, + 1403, + 1787, + 1403, + 2035, + 298, + 2035 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 788, + 1404, + 788, + 1404, + 974, + 298, + 974 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1523, + 1402, + 1523, + 1402, + 1646, + 298, + 1646 + ], + "score": 0.976 + }, + { + "category_id": 8, + "poly": [ + 691, + 1662, + 1006, + 1662, + 1006, + 1721, + 691, + 1721 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 299, + 1741, + 1179, + 1741, + 1179, + 1775, + 299, + 1775 + ], + "score": 0.931 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 857, + 75, + 857, + 105, + 298, + 105 + ], + "score": 0.907 + }, + { + "category_id": 0, + "poly": [ + 299, + 730, + 941, + 730, + 941, + 763, + 299, + 763 + ], + "score": 0.903 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1668, + 1400, + 1668, + 1400, + 1697, + 1366, + 1697 + ], + "score": 0.875 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.73 + }, + { + "category_id": 5, + "poly": [ + 300, + 223, + 1403, + 223, + 1403, + 672, + 300, + 672 + ], + "score": 0.692, + "html": "
Algorithm1Joint Optimization
Initialize πθ(a|s,r),PΦ(r)
while True do
for i ∈[1..np] do
Sample ri,.., rn from pΦ
Collect rollouts with each design
Update 0 to maximize PPO's surrogate objective. end for
for i∈[1..nr] do
Sample ri,.*, rm from pΦ
Compute returns R1,., Rm·
Update to maximize PPO's surrogate objective.
end for
end while
" + }, + { + "category_id": 0, + "poly": [ + 298, + 229, + 661, + 229, + 661, + 262, + 298, + 262 + ], + "score": 0.356 + }, + { + "category_id": 14, + "poly": [ + 690, + 1663, + 1008, + 1663, + 1008, + 1723, + 690, + 1723 + ], + "score": 0.94, + "latex": "\\phi ^ { * } , \\theta ^ { * } = \\underset { \\phi , \\theta } { \\arg \\operatorname* { m a x } } \\mathbb { E } _ { r , t } \\left[ \\mathcal { R } _ { t } \\right] ," + }, + { + "category_id": 13, + "poly": [ + 1021, + 1523, + 1168, + 1523, + 1168, + 1557, + 1021, + 1557 + ], + "score": 0.93, + "latex": "\\pi ( a _ { t } | s _ { t } , r ; \\theta )" + }, + { + "category_id": 13, + "poly": [ + 1279, + 881, + 1400, + 881, + 1400, + 915, + 1279, + 915 + ], + "score": 0.93, + "latex": "p \\varepsilon ( s ^ { \\prime } | s , a )" + }, + { + "category_id": 13, + "poly": [ + 844, + 851, + 921, + 851, + 921, + 883, + 844, + 883 + ], + "score": 0.93, + "latex": "r ( s , a )" + }, + { + "category_id": 13, + "poly": [ + 453, + 1523, + 534, + 1523, + 534, + 1557, + 453, + 1557 + ], + "score": 0.93, + "latex": "p ( r ; \\phi )" + }, + { + "category_id": 13, + "poly": [ + 1018, + 1947, + 1097, + 1947, + 1097, + 1976, + 1018, + 1976 + ], + "score": 0.92, + "latex": "p ( r ; \\phi )" + }, + { + "category_id": 13, + "poly": [ + 372, + 1742, + 442, + 1742, + 442, + 1777, + 372, + 1777 + ], + "score": 0.92, + "latex": "\\mathbb { E } _ { \\boldsymbol { r } , t } [ \\cdot ]" + }, + { + "category_id": 13, + "poly": [ + 1313, + 1584, + 1393, + 1584, + 1393, + 1618, + 1313, + 1618 + ], + "score": 0.92, + "latex": "p ( r ; \\phi )" + }, + { + "category_id": 13, + "poly": [ + 1241, + 851, + 1304, + 851, + 1304, + 883, + 1241, + 883 + ], + "score": 0.91, + "latex": "p _ { 0 } ( s )" + }, + { + "category_id": 13, + "poly": [ + 923, + 992, + 966, + 992, + 966, + 1023, + 923, + 1023 + ], + "score": 0.9, + "latex": "\\pi _ { \\mathcal { E } ^ { * } } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1031, + 821, + 1118, + 821, + 1118, + 850, + 1031, + 850 + ], + "score": 0.9, + "latex": "\\mathcal { E } \\in \\Omega" + }, + { + "category_id": 13, + "poly": [ + 394, + 481, + 514, + 481, + 514, + 515, + 394, + 515 + ], + "score": 0.88, + "latex": "i \\in [ 1 . . n _ { r } ]" + }, + { + "category_id": 13, + "poly": [ + 657, + 545, + 703, + 545, + 703, + 574, + 657, + 574 + ], + "score": 0.86, + "latex": "\\mathcal { R } _ { m }" + }, + { + "category_id": 13, + "poly": [ + 394, + 329, + 514, + 329, + 514, + 363, + 394, + 363 + ], + "score": 0.86, + "latex": "i \\in [ 1 . . n _ { p } ]" + }, + { + "category_id": 13, + "poly": [ + 765, + 991, + 797, + 991, + 797, + 1018, + 765, + 1018 + ], + "score": 0.86, + "latex": "\\mathcal { E } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1099, + 2004, + 1119, + 2004, + 1119, + 2035, + 1099, + 2035 + ], + "score": 0.85, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 570, + 1555, + 590, + 1555, + 590, + 1585, + 570, + 1585 + ], + "score": 0.85, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 1178, + 1822, + 1198, + 1822, + 1198, + 1853, + 1178, + 1853 + ], + "score": 0.84, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 467, + 575, + 488, + 575, + 488, + 605, + 467, + 605 + ], + "score": 0.84, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 645, + 520, + 676, + 520, + 676, + 545, + 645, + 545 + ], + "score": 0.83, + "latex": "p _ { \\phi }" + }, + { + "category_id": 13, + "poly": [ + 528, + 1944, + 552, + 1944, + 552, + 1970, + 528, + 1970 + ], + "score": 0.8, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1210, + 1883, + 1227, + 1883, + 1227, + 1909, + 1210, + 1909 + ], + "score": 0.8, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 1108, + 1822, + 1126, + 1822, + 1126, + 1848, + 1108, + 1848 + ], + "score": 0.8, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 639, + 1555, + 657, + 1555, + 657, + 1581, + 639, + 1581 + ], + "score": 0.79, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 572, + 544, + 611, + 544, + 611, + 573, + 572, + 573 + ], + "score": 0.78, + "latex": "\\mathcal { R } _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1176, + 1947, + 1196, + 1947, + 1196, + 1970, + 1176, + 1970 + ], + "score": 0.77, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 638, + 366, + 670, + 366, + 670, + 394, + 638, + 394 + ], + "score": 0.77, + "latex": "p _ { \\phi }" + }, + { + "category_id": 13, + "poly": [ + 495, + 1590, + 515, + 1590, + 515, + 1613, + 495, + 1613 + ], + "score": 0.77, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 467, + 422, + 485, + 422, + 485, + 448, + 467, + 448 + ], + "score": 0.76, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 554, + 852, + 577, + 852, + 577, + 879, + 554, + 879 + ], + "score": 0.76, + "latex": "s" + }, + { + "category_id": 13, + "poly": [ + 627, + 852, + 652, + 852, + 652, + 878, + 627, + 878 + ], + "score": 0.75, + "latex": "\\mathcal { A }" + }, + { + "category_id": 13, + "poly": [ + 691, + 913, + 715, + 913, + 715, + 939, + 691, + 939 + ], + "score": 0.75, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 459, + 821, + 482, + 821, + 482, + 848, + 459, + 848 + ], + "score": 0.73, + "latex": "\\Omega" + }, + { + "category_id": 13, + "poly": [ + 555, + 268, + 621, + 268, + 621, + 303, + 555, + 303 + ], + "score": 0.68, + "latex": "p _ { \\phi } ( r )" + }, + { + "category_id": 13, + "poly": [ + 1384, + 1918, + 1401, + 1918, + 1401, + 1939, + 1384, + 1939 + ], + "score": 0.62, + "latex": "r" + }, + { + "category_id": 13, + "poly": [ + 543, + 519, + 580, + 519, + 580, + 543, + 543, + 543 + ], + "score": 0.59, + "latex": "r _ { m }" + }, + { + "category_id": 13, + "poly": [ + 470, + 365, + 574, + 365, + 574, + 391, + 470, + 391 + ], + "score": 0.53, + "latex": "r _ { 1 } , . . . , r _ { n }" + }, + { + "category_id": 13, + "poly": [ + 542, + 365, + 574, + 365, + 574, + 391, + 542, + 391 + ], + "score": 0.5, + "latex": "r _ { n }" + }, + { + "category_id": 13, + "poly": [ + 430, + 268, + 542, + 268, + 542, + 302, + 430, + 302 + ], + "score": 0.5, + "latex": "\\pi _ { \\boldsymbol { \\theta } } ( a | \\boldsymbol { s } , \\boldsymbol { r } )" + }, + { + "category_id": 13, + "poly": [ + 470, + 519, + 498, + 519, + 498, + 543, + 470, + 543 + ], + "score": 0.45, + "latex": "r _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 470, + 518, + 580, + 518, + 580, + 544, + 470, + 544 + ], + "score": 0.43, + "latex": "r _ { 1 } , . . . , r _ { m }" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 859.0, + 73.0, + 859.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 730.0, + 946.0, + 730.0, + 946.0, + 766.0, + 294.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 861.0, + 2085.0, + 861.0, + 2120.0, + 839.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 227.0, + 662.0, + 227.0, + 662.0, + 266.0, + 297.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 989.0, + 764.0, + 989.0, + 764.0, + 1026.0, + 295.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 989.0, + 922.0, + 989.0, + 922.0, + 1026.0, + 798.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 967.0, + 989.0, + 1406.0, + 989.0, + 1406.0, + 1026.0, + 967.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1019.0, + 1405.0, + 1019.0, + 1405.0, + 1055.0, + 294.0, + 1055.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1049.0, + 1406.0, + 1049.0, + 1406.0, + 1089.0, + 291.0, + 1089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1081.0, + 1406.0, + 1081.0, + 1406.0, + 1116.0, + 292.0, + 1116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1110.0, + 1406.0, + 1110.0, + 1406.0, + 1148.0, + 292.0, + 1148.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1143.0, + 1403.0, + 1143.0, + 1403.0, + 1175.0, + 296.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1170.0, + 1406.0, + 1170.0, + 1406.0, + 1208.0, + 291.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1201.0, + 1407.0, + 1201.0, + 1407.0, + 1240.0, + 291.0, + 1240.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1231.0, + 1407.0, + 1231.0, + 1407.0, + 1270.0, + 291.0, + 1270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1263.0, + 1407.0, + 1263.0, + 1407.0, + 1299.0, + 294.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1295.0, + 1403.0, + 1295.0, + 1403.0, + 1328.0, + 296.0, + 1328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1324.0, + 1405.0, + 1324.0, + 1405.0, + 1360.0, + 294.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1351.0, + 1405.0, + 1351.0, + 1405.0, + 1392.0, + 292.0, + 1392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1383.0, + 1405.0, + 1383.0, + 1405.0, + 1419.0, + 294.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1414.0, + 1403.0, + 1414.0, + 1403.0, + 1450.0, + 294.0, + 1450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1444.0, + 1406.0, + 1444.0, + 1406.0, + 1484.0, + 292.0, + 1484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1475.0, + 944.0, + 1475.0, + 944.0, + 1514.0, + 294.0, + 1514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1787.0, + 1405.0, + 1787.0, + 1405.0, + 1825.0, + 294.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1820.0, + 1107.0, + 1820.0, + 1107.0, + 1854.0, + 293.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 1820.0, + 1177.0, + 1820.0, + 1177.0, + 1854.0, + 1127.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1199.0, + 1820.0, + 1404.0, + 1820.0, + 1404.0, + 1854.0, + 1199.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1852.0, + 1404.0, + 1852.0, + 1404.0, + 1886.0, + 294.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1881.0, + 1209.0, + 1881.0, + 1209.0, + 1915.0, + 294.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1228.0, + 1881.0, + 1404.0, + 1881.0, + 1404.0, + 1915.0, + 1228.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1910.0, + 1383.0, + 1910.0, + 1383.0, + 1948.0, + 292.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1910.0, + 1405.0, + 1910.0, + 1405.0, + 1948.0, + 1402.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1941.0, + 527.0, + 1941.0, + 527.0, + 1979.0, + 293.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 1941.0, + 1017.0, + 1941.0, + 1017.0, + 1979.0, + 553.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 1941.0, + 1175.0, + 1941.0, + 1175.0, + 1979.0, + 1098.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1197.0, + 1941.0, + 1405.0, + 1941.0, + 1405.0, + 1979.0, + 1197.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1974.0, + 1405.0, + 1974.0, + 1405.0, + 2008.0, + 294.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2000.0, + 1098.0, + 2000.0, + 1098.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 2000.0, + 1405.0, + 2000.0, + 1405.0, + 2039.0, + 1120.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 788.0, + 1405.0, + 788.0, + 1405.0, + 824.0, + 296.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 820.0, + 458.0, + 820.0, + 458.0, + 855.0, + 294.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 820.0, + 1030.0, + 820.0, + 1030.0, + 855.0, + 483.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1119.0, + 820.0, + 1406.0, + 820.0, + 1406.0, + 855.0, + 1119.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 849.0, + 553.0, + 849.0, + 553.0, + 885.0, + 294.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 578.0, + 849.0, + 626.0, + 849.0, + 626.0, + 885.0, + 578.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 653.0, + 849.0, + 843.0, + 849.0, + 843.0, + 885.0, + 653.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 922.0, + 849.0, + 1240.0, + 849.0, + 1240.0, + 885.0, + 922.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 849.0, + 1405.0, + 849.0, + 1405.0, + 885.0, + 1305.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 880.0, + 1278.0, + 880.0, + 1278.0, + 919.0, + 293.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 880.0, + 1404.0, + 880.0, + 1404.0, + 919.0, + 1401.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 909.0, + 690.0, + 909.0, + 690.0, + 947.0, + 292.0, + 947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 909.0, + 1406.0, + 909.0, + 1406.0, + 947.0, + 716.0, + 947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 942.0, + 492.0, + 942.0, + 492.0, + 979.0, + 293.0, + 979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1522.0, + 452.0, + 1522.0, + 452.0, + 1558.0, + 293.0, + 1558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 535.0, + 1522.0, + 1020.0, + 1522.0, + 1020.0, + 1558.0, + 535.0, + 1558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1169.0, + 1522.0, + 1406.0, + 1522.0, + 1406.0, + 1558.0, + 1169.0, + 1558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1554.0, + 569.0, + 1554.0, + 569.0, + 1587.0, + 293.0, + 1587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 1554.0, + 638.0, + 1554.0, + 638.0, + 1587.0, + 591.0, + 1587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1554.0, + 1404.0, + 1554.0, + 1404.0, + 1587.0, + 658.0, + 1587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1583.0, + 494.0, + 1583.0, + 494.0, + 1619.0, + 293.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 1583.0, + 1312.0, + 1583.0, + 1312.0, + 1619.0, + 516.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1583.0, + 1404.0, + 1583.0, + 1404.0, + 1619.0, + 1394.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1612.0, + 984.0, + 1612.0, + 984.0, + 1650.0, + 293.0, + 1650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1739.0, + 371.0, + 1739.0, + 371.0, + 1779.0, + 296.0, + 1779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 443.0, + 1739.0, + 1184.0, + 1739.0, + 1184.0, + 1779.0, + 443.0, + 1779.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1727, + 1403, + 1727, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1268, + 1404, + 1268, + 1404, + 1514, + 298, + 1514 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 299, + 1017, + 1404, + 1017, + 1404, + 1171, + 299, + 1171 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1529, + 1403, + 1529, + 1403, + 1713, + 298, + 1713 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 744, + 1404, + 744, + 1404, + 899, + 299, + 899 + ], + "score": 0.975 + }, + { + "category_id": 3, + "poly": [ + 298, + 224, + 1405, + 224, + 1405, + 593, + 298, + 593 + ], + "score": 0.973 + }, + { + "category_id": 4, + "poly": [ + 297, + 623, + 1402, + 623, + 1402, + 686, + 297, + 686 + ], + "score": 0.917 + }, + { + "category_id": 0, + "poly": [ + 300, + 1211, + 635, + 1211, + 635, + 1241, + 300, + 1241 + ], + "score": 0.89 + }, + { + "category_id": 2, + "poly": [ + 297, + 76, + 857, + 76, + 857, + 104, + 297, + 104 + ], + "score": 0.89 + }, + { + "category_id": 0, + "poly": [ + 300, + 946, + 480, + 946, + 480, + 981, + 300, + 981 + ], + "score": 0.885 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 858, + 2089, + 858, + 2112, + 840, + 2112 + ], + "score": 0.782 + }, + { + "category_id": 13, + "poly": [ + 378, + 1851, + 462, + 1851, + 462, + 1884, + 378, + 1884 + ], + "score": 0.93, + "latex": "p ( \\cdot ; \\theta _ { r } )" + }, + { + "category_id": 13, + "poly": [ + 632, + 1727, + 794, + 1727, + 794, + 1763, + 632, + 1763 + ], + "score": 0.93, + "latex": "\\pi ( a _ { t } | s _ { t } , \\mathcal { E } ; \\theta _ { p } )" + }, + { + "category_id": 13, + "poly": [ + 1318, + 806, + 1393, + 806, + 1393, + 840, + 1318, + 840 + ], + "score": 0.92, + "latex": "\\pi ( \\cdot ; \\theta )" + }, + { + "category_id": 13, + "poly": [ + 911, + 837, + 986, + 837, + 986, + 871, + 911, + 871 + ], + "score": 0.92, + "latex": "p ( \\cdot ; \\phi )" + }, + { + "category_id": 13, + "poly": [ + 381, + 810, + 410, + 810, + 410, + 835, + 381, + 835 + ], + "score": 0.72, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 1116, + 1365, + 1134, + 1365, + 1134, + 1389, + 1116, + 1389 + ], + "score": 0.3, + "latex": "\\mathbf { X }" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 379.0, + 1173.0, + 379.0, + 1173.0, + 385.0, + 1167.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.75, + 402.5, + 810.75, + 402.5, + 810.75, + 417.5, + 715.75, + 417.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 419.0, + 1101.0, + 419.0, + 1101.0, + 435.0, + 1047.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.25, + 444.5, + 481.25, + 444.5, + 481.25, + 459.5, + 367.25, + 459.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1121.0, + 455.5, + 1186.0, + 455.5, + 1186.0, + 468.5, + 1121.0, + 468.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 527.0, + 492.5, + 614.0, + 492.5, + 614.0, + 515.5, + 527.0, + 515.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1263.75, + 521.5, + 1352.75, + 521.5, + 1352.75, + 545.5, + 1263.75, + 545.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 621.0, + 1404.0, + 621.0, + 1404.0, + 657.0, + 296.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 651.0, + 1298.0, + 651.0, + 1298.0, + 690.0, + 295.0, + 690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1207.0, + 639.0, + 1207.0, + 639.0, + 1247.0, + 293.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 859.0, + 73.0, + 859.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 941.0, + 486.0, + 941.0, + 486.0, + 989.0, + 291.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2087.0, + 861.0, + 2087.0, + 861.0, + 2118.0, + 840.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1727.0, + 631.0, + 1727.0, + 631.0, + 1766.0, + 294.0, + 1766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 795.0, + 1727.0, + 1407.0, + 1727.0, + 1407.0, + 1766.0, + 795.0, + 1766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1757.0, + 1405.0, + 1757.0, + 1405.0, + 1795.0, + 293.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1789.0, + 1405.0, + 1789.0, + 1405.0, + 1825.0, + 294.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1821.0, + 1405.0, + 1821.0, + 1405.0, + 1856.0, + 294.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1847.0, + 377.0, + 1847.0, + 377.0, + 1889.0, + 292.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 1847.0, + 1404.0, + 1847.0, + 1404.0, + 1889.0, + 463.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1883.0, + 1404.0, + 1883.0, + 1404.0, + 1915.0, + 296.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1911.0, + 1405.0, + 1911.0, + 1405.0, + 1947.0, + 293.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1940.0, + 1403.0, + 1940.0, + 1403.0, + 1978.0, + 293.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1972.0, + 1403.0, + 1972.0, + 1403.0, + 2008.0, + 293.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2003.0, + 1063.0, + 2003.0, + 1063.0, + 2037.0, + 293.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1265.0, + 1405.0, + 1265.0, + 1405.0, + 1307.0, + 293.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1300.0, + 1404.0, + 1300.0, + 1404.0, + 1333.0, + 294.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1331.0, + 1405.0, + 1331.0, + 1405.0, + 1365.0, + 294.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1361.0, + 1115.0, + 1361.0, + 1115.0, + 1395.0, + 294.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1135.0, + 1361.0, + 1404.0, + 1361.0, + 1404.0, + 1395.0, + 1135.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1392.0, + 1405.0, + 1392.0, + 1405.0, + 1426.0, + 294.0, + 1426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1421.0, + 1406.0, + 1421.0, + 1406.0, + 1457.0, + 292.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1455.0, + 1406.0, + 1455.0, + 1406.0, + 1485.0, + 296.0, + 1485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1481.0, + 654.0, + 1481.0, + 654.0, + 1518.0, + 295.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1015.0, + 1403.0, + 1015.0, + 1403.0, + 1052.0, + 297.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1045.0, + 1404.0, + 1045.0, + 1404.0, + 1085.0, + 294.0, + 1085.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1078.0, + 1406.0, + 1078.0, + 1406.0, + 1114.0, + 292.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1106.0, + 1406.0, + 1106.0, + 1406.0, + 1144.0, + 292.0, + 1144.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1139.0, + 1396.0, + 1139.0, + 1396.0, + 1176.0, + 294.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1527.0, + 1407.0, + 1527.0, + 1407.0, + 1566.0, + 294.0, + 1566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1560.0, + 1405.0, + 1560.0, + 1405.0, + 1596.0, + 294.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1588.0, + 1405.0, + 1588.0, + 1405.0, + 1626.0, + 292.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1621.0, + 1405.0, + 1621.0, + 1405.0, + 1655.0, + 292.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1651.0, + 1405.0, + 1651.0, + 1405.0, + 1687.0, + 294.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1682.0, + 1405.0, + 1682.0, + 1405.0, + 1717.0, + 294.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 744.0, + 1405.0, + 744.0, + 1405.0, + 780.0, + 293.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 775.0, + 1404.0, + 775.0, + 1404.0, + 811.0, + 294.0, + 811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 806.0, + 380.0, + 806.0, + 380.0, + 843.0, + 294.0, + 843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 411.0, + 806.0, + 1317.0, + 806.0, + 1317.0, + 843.0, + 411.0, + 843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 806.0, + 1403.0, + 806.0, + 1403.0, + 843.0, + 1394.0, + 843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 835.0, + 910.0, + 835.0, + 910.0, + 876.0, + 294.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 987.0, + 835.0, + 1406.0, + 835.0, + 1406.0, + 876.0, + 987.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 865.0, + 911.0, + 865.0, + 911.0, + 905.0, + 292.0, + 905.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1376, + 1404, + 1376, + 1404, + 1743, + 298, + 1743 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1056, + 1404, + 1056, + 1404, + 1362, + 298, + 1362 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1758, + 1403, + 1758, + 1403, + 2035, + 298, + 2035 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 299, + 802, + 1403, + 802, + 1403, + 956, + 299, + 956 + ], + "score": 0.977 + }, + { + "category_id": 3, + "poly": [ + 297, + 234, + 1405, + 234, + 1405, + 552, + 297, + 552 + ], + "score": 0.971 + }, + { + "category_id": 4, + "poly": [ + 296, + 589, + 1405, + 589, + 1405, + 742, + 296, + 742 + ], + "score": 0.968 + }, + { + "category_id": 0, + "poly": [ + 299, + 996, + 537, + 996, + 537, + 1028, + 299, + 1028 + ], + "score": 0.887 + }, + { + "category_id": 2, + "poly": [ + 297, + 76, + 857, + 76, + 857, + 104, + 297, + 104 + ], + "score": 0.87 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 858, + 2088, + 858, + 2111, + 842, + 2111 + ], + "score": 0.636 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 859, + 2088, + 859, + 2111, + 842, + 2111 + ], + "score": 0.275 + }, + { + "category_id": 13, + "poly": [ + 606, + 1651, + 673, + 1651, + 673, + 1681, + 606, + 1681 + ], + "score": 0.89, + "latex": "1 1 6 \\%" + }, + { + "category_id": 13, + "poly": [ + 398, + 1407, + 452, + 1407, + 452, + 1438, + 398, + 1438 + ], + "score": 0.89, + "latex": "5 0 \\%" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 248.0, + 343.0, + 248.0, + 343.0, + 266.0, + 311.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 245.0, + 1074.0, + 245.0, + 1074.0, + 264.0, + 1038.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 275.0, + 343.0, + 275.0, + 343.0, + 294.0, + 311.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 674.0, + 265.0, + 711.0, + 265.0, + 711.0, + 287.0, + 674.0, + 287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 282.0, + 1074.0, + 282.0, + 1074.0, + 299.0, + 1038.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 303.0, + 343.0, + 303.0, + 343.0, + 321.0, + 311.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 676.0, + 307.0, + 709.0, + 307.0, + 709.0, + 325.0, + 676.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 317.0, + 1074.0, + 317.0, + 1074.0, + 336.0, + 1040.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 330.0, + 343.0, + 330.0, + 343.0, + 390.0, + 297.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 675.0, + 345.0, + 711.0, + 345.0, + 711.0, + 367.0, + 675.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 355.0, + 1072.0, + 355.0, + 1072.0, + 372.0, + 1038.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 384.0, + 343.0, + 384.0, + 343.0, + 402.0, + 312.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 674.0, + 384.0, + 713.0, + 384.0, + 713.0, + 406.0, + 674.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 389.0, + 1075.0, + 389.0, + 1075.0, + 411.0, + 1037.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 411.0, + 343.0, + 411.0, + 343.0, + 430.0, + 311.0, + 430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 426.0, + 709.0, + 426.0, + 709.0, + 444.0, + 681.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 428.0, + 1074.0, + 428.0, + 1074.0, + 447.0, + 1038.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 439.0, + 344.0, + 439.0, + 344.0, + 457.0, + 316.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 469.0, + 343.0, + 469.0, + 343.0, + 482.0, + 331.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 469.0, + 708.0, + 469.0, + 708.0, + 481.0, + 696.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1060.0, + 467.0, + 1072.0, + 467.0, + 1072.0, + 479.0, + 1060.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 487.0, + 355.0, + 487.0, + 355.0, + 501.0, + 334.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 486.0, + 416.0, + 486.0, + 416.0, + 501.0, + 394.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 455.0, + 484.0, + 479.0, + 484.0, + 479.0, + 504.0, + 455.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 515.0, + 484.0, + 538.0, + 484.0, + 538.0, + 504.0, + 515.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 484.0, + 599.0, + 484.0, + 599.0, + 504.0, + 574.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 484.0, + 660.0, + 484.0, + 660.0, + 504.0, + 635.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 484.0, + 723.0, + 484.0, + 723.0, + 503.0, + 697.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 759.0, + 486.0, + 781.0, + 486.0, + 781.0, + 501.0, + 759.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 484.0, + 842.0, + 484.0, + 842.0, + 504.0, + 820.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 483.0, + 903.0, + 483.0, + 903.0, + 504.0, + 879.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 938.0, + 484.0, + 964.0, + 484.0, + 964.0, + 504.0, + 938.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 998.0, + 484.0, + 1023.0, + 484.0, + 1023.0, + 504.0, + 998.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 487.0, + 1084.0, + 487.0, + 1084.0, + 503.0, + 1062.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 484.0, + 1145.0, + 484.0, + 1145.0, + 504.0, + 1120.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1184.0, + 487.0, + 1205.0, + 487.0, + 1205.0, + 503.0, + 1184.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1242.0, + 484.0, + 1265.0, + 484.0, + 1265.0, + 504.0, + 1242.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1301.0, + 484.0, + 1328.0, + 484.0, + 1328.0, + 504.0, + 1301.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1362.0, + 484.0, + 1387.0, + 484.0, + 1387.0, + 504.0, + 1362.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 498.0, + 533.0, + 498.0, + 533.0, + 520.0, + 465.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 650.0, + 496.0, + 677.0, + 496.0, + 677.0, + 516.0, + 650.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 498.0, + 898.0, + 498.0, + 898.0, + 520.0, + 828.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 496.0, + 1040.0, + 496.0, + 1040.0, + 516.0, + 1012.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1192.0, + 498.0, + 1260.0, + 498.0, + 1260.0, + 520.0, + 1192.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 496.0, + 1403.0, + 496.0, + 1403.0, + 516.0, + 1377.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 456.0, + 523.0, + 528.0, + 523.0, + 528.0, + 558.0, + 456.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 526.0, + 904.0, + 526.0, + 904.0, + 551.0, + 821.0, + 551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 523.0, + 1248.0, + 523.0, + 1248.0, + 556.0, + 1206.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 375.0, + 502.0, + 375.0, + 502.0, + 414.0, + 319.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 372.5, + 894.0, + 372.5, + 894.0, + 422.5, + 681.0, + 422.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 380.0, + 1164.0, + 380.0, + 1164.0, + 394.0, + 1062.0, + 394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 590.0, + 1403.0, + 590.0, + 1403.0, + 623.0, + 295.0, + 623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 617.0, + 1402.0, + 617.0, + 1402.0, + 654.0, + 295.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 647.0, + 1406.0, + 647.0, + 1406.0, + 687.0, + 293.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 679.0, + 1405.0, + 679.0, + 1405.0, + 717.0, + 295.0, + 717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 710.0, + 697.0, + 710.0, + 697.0, + 747.0, + 295.0, + 747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 997.0, + 541.0, + 997.0, + 541.0, + 1030.0, + 295.0, + 1030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 859.0, + 73.0, + 859.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2119.0, + 840.0, + 2119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2087.0, + 861.0, + 2087.0, + 861.0, + 2119.0, + 840.0, + 2119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1376.0, + 1404.0, + 1376.0, + 1404.0, + 1412.0, + 295.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1406.0, + 397.0, + 1406.0, + 397.0, + 1443.0, + 293.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 1406.0, + 1405.0, + 1406.0, + 1405.0, + 1443.0, + 453.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1439.0, + 1405.0, + 1439.0, + 1405.0, + 1473.0, + 296.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1467.0, + 1406.0, + 1467.0, + 1406.0, + 1504.0, + 293.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1499.0, + 1408.0, + 1499.0, + 1408.0, + 1536.0, + 293.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1530.0, + 1404.0, + 1530.0, + 1404.0, + 1564.0, + 294.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1559.0, + 1405.0, + 1559.0, + 1405.0, + 1596.0, + 292.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1591.0, + 1405.0, + 1591.0, + 1405.0, + 1625.0, + 294.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1622.0, + 1402.0, + 1622.0, + 1402.0, + 1656.0, + 294.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1650.0, + 605.0, + 1650.0, + 605.0, + 1687.0, + 292.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 674.0, + 1650.0, + 1405.0, + 1650.0, + 1405.0, + 1687.0, + 674.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1680.0, + 1406.0, + 1680.0, + 1406.0, + 1720.0, + 292.0, + 1720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1716.0, + 522.0, + 1716.0, + 522.0, + 1748.0, + 296.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1053.0, + 1405.0, + 1053.0, + 1405.0, + 1094.0, + 293.0, + 1094.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1085.0, + 1406.0, + 1085.0, + 1406.0, + 1124.0, + 292.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1115.0, + 1405.0, + 1115.0, + 1405.0, + 1153.0, + 292.0, + 1153.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1143.0, + 1406.0, + 1143.0, + 1406.0, + 1186.0, + 292.0, + 1186.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1179.0, + 1406.0, + 1179.0, + 1406.0, + 1214.0, + 294.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1209.0, + 1406.0, + 1209.0, + 1406.0, + 1245.0, + 293.0, + 1245.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1237.0, + 1406.0, + 1237.0, + 1406.0, + 1278.0, + 292.0, + 1278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1270.0, + 1404.0, + 1270.0, + 1404.0, + 1303.0, + 293.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1299.0, + 1405.0, + 1299.0, + 1405.0, + 1335.0, + 294.0, + 1335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1330.0, + 1262.0, + 1330.0, + 1262.0, + 1366.0, + 291.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1756.0, + 1405.0, + 1756.0, + 1405.0, + 1794.0, + 293.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1790.0, + 1404.0, + 1790.0, + 1404.0, + 1823.0, + 296.0, + 1823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1822.0, + 1404.0, + 1822.0, + 1404.0, + 1855.0, + 296.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1849.0, + 1405.0, + 1849.0, + 1405.0, + 1886.0, + 294.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1882.0, + 1407.0, + 1882.0, + 1407.0, + 1916.0, + 292.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1907.0, + 1404.0, + 1907.0, + 1404.0, + 1950.0, + 293.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1940.0, + 1403.0, + 1940.0, + 1403.0, + 1979.0, + 293.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1971.0, + 1405.0, + 1971.0, + 1405.0, + 2008.0, + 294.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2003.0, + 1201.0, + 2003.0, + 1201.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 802.0, + 1405.0, + 802.0, + 1405.0, + 839.0, + 297.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 833.0, + 1405.0, + 833.0, + 1405.0, + 870.0, + 295.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 864.0, + 1405.0, + 864.0, + 1405.0, + 898.0, + 295.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 894.0, + 1407.0, + 894.0, + 1407.0, + 931.0, + 294.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 925.0, + 1185.0, + 925.0, + 1185.0, + 962.0, + 294.0, + 962.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1588, + 1404, + 1588, + 1404, + 1835, + 298, + 1835 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1850, + 1403, + 1850, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.981 + }, + { + "category_id": 3, + "poly": [ + 299, + 215, + 1402, + 215, + 1402, + 1148, + 299, + 1148 + ], + "score": 0.974 + }, + { + "category_id": 4, + "poly": [ + 296, + 1177, + 1404, + 1177, + 1404, + 1331, + 296, + 1331 + ], + "score": 0.938 + }, + { + "category_id": 0, + "poly": [ + 299, + 1465, + 543, + 1465, + 543, + 1500, + 299, + 1500 + ], + "score": 0.884 + }, + { + "category_id": 2, + "poly": [ + 297, + 76, + 857, + 76, + 857, + 104, + 297, + 104 + ], + "score": 0.883 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.783 + }, + { + "category_id": 15, + "poly": [ + 540.0, + 213.0, + 670.0, + 213.0, + 670.0, + 267.0, + 540.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1105.0, + 220.0, + 1175.0, + 220.0, + 1175.0, + 264.0, + 1105.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 332.0, + 542.0, + 332.0, + 542.0, + 442.0, + 332.0, + 442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 884.0, + 361.0, + 963.0, + 361.0, + 963.0, + 390.0, + 884.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 409.0, + 441.0, + 512.0, + 441.0, + 512.0, + 487.0, + 409.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 444.0, + 788.0, + 444.0, + 788.0, + 485.0, + 683.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 958.0, + 442.0, + 1061.0, + 442.0, + 1061.0, + 489.0, + 958.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1220.0, + 446.0, + 1330.0, + 446.0, + 1330.0, + 488.0, + 1220.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 565.0, + 790.0, + 565.0, + 790.0, + 640.0, + 646.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1307.0, + 576.0, + 1339.0, + 576.0, + 1339.0, + 605.0, + 1307.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 674.0, + 923.0, + 674.0, + 923.0, + 716.0, + 820.0, + 716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 726.0, + 340.0, + 726.0, + 340.0, + 894.0, + 291.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 894.0, + 923.0, + 894.0, + 923.0, + 926.0, + 820.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 970.0, + 830.0, + 970.0, + 830.0, + 1112.0, + 349.0, + 1112.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 857.0, + 1018.0, + 962.0, + 1018.0, + 962.0, + 1075.0, + 857.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 817.0, + 1114.0, + 927.0, + 1114.0, + 927.0, + 1156.0, + 817.0, + 1156.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 572.5, + 1138.0, + 572.5, + 1138.0, + 589.5, + 1129.0, + 589.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1176.0, + 1405.0, + 1176.0, + 1405.0, + 1213.0, + 294.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1209.0, + 1405.0, + 1209.0, + 1405.0, + 1242.0, + 295.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1237.0, + 1406.0, + 1237.0, + 1406.0, + 1274.0, + 294.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1269.0, + 1405.0, + 1269.0, + 1405.0, + 1306.0, + 294.0, + 1306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1298.0, + 858.0, + 1298.0, + 858.0, + 1336.0, + 294.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1461.0, + 548.0, + 1461.0, + 548.0, + 1509.0, + 291.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 859.0, + 73.0, + 859.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 860.0, + 2085.0, + 860.0, + 2116.0, + 839.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1587.0, + 1404.0, + 1587.0, + 1404.0, + 1627.0, + 293.0, + 1627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1621.0, + 1405.0, + 1621.0, + 1405.0, + 1655.0, + 294.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1651.0, + 1406.0, + 1651.0, + 1406.0, + 1689.0, + 293.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1677.0, + 1406.0, + 1677.0, + 1406.0, + 1721.0, + 292.0, + 1721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1710.0, + 1407.0, + 1710.0, + 1407.0, + 1749.0, + 292.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1743.0, + 1407.0, + 1743.0, + 1407.0, + 1778.0, + 291.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1773.0, + 1405.0, + 1773.0, + 1405.0, + 1810.0, + 293.0, + 1810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1803.0, + 1337.0, + 1803.0, + 1337.0, + 1840.0, + 294.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1849.0, + 1405.0, + 1849.0, + 1405.0, + 1885.0, + 296.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1880.0, + 1404.0, + 1880.0, + 1404.0, + 1919.0, + 293.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1913.0, + 1404.0, + 1913.0, + 1404.0, + 1945.0, + 296.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1941.0, + 1405.0, + 1941.0, + 1405.0, + 1979.0, + 293.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1971.0, + 1405.0, + 1971.0, + 1405.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2003.0, + 799.0, + 2003.0, + 799.0, + 2038.0, + 294.0, + 2038.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 298, + 75, + 857, + 75, + 857, + 105, + 298, + 105 + ], + "score": 0.897 + }, + { + "category_id": 0, + "poly": [ + 300, + 228, + 489, + 228, + 489, + 261, + 300, + 261 + ], + "score": 0.822 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2111, + 840, + 2111 + ], + "score": 0.773 + }, + { + "category_id": 1, + "poly": [ + 299, + 278, + 1399, + 278, + 1399, + 372, + 299, + 372 + ], + "score": 0.672 + }, + { + "category_id": 1, + "poly": [ + 295, + 1745, + 1400, + 1745, + 1400, + 1810, + 295, + 1810 + ], + "score": 0.631 + }, + { + "category_id": 1, + "poly": [ + 296, + 1108, + 1398, + 1108, + 1398, + 1175, + 296, + 1175 + ], + "score": 0.612 + }, + { + "category_id": 1, + "poly": [ + 289, + 390, + 1399, + 390, + 1399, + 455, + 289, + 455 + ], + "score": 0.599 + }, + { + "category_id": 1, + "poly": [ + 292, + 1026, + 1402, + 1026, + 1402, + 1092, + 292, + 1092 + ], + "score": 0.598 + }, + { + "category_id": 1, + "poly": [ + 300, + 1385, + 1400, + 1385, + 1400, + 1481, + 300, + 1481 + ], + "score": 0.59 + }, + { + "category_id": 1, + "poly": [ + 297, + 1662, + 1399, + 1662, + 1399, + 1728, + 297, + 1728 + ], + "score": 0.588 + }, + { + "category_id": 1, + "poly": [ + 302, + 913, + 1401, + 913, + 1401, + 1010, + 302, + 1010 + ], + "score": 0.58 + }, + { + "category_id": 1, + "poly": [ + 296, + 1498, + 1401, + 1498, + 1401, + 1564, + 296, + 1564 + ], + "score": 0.576 + }, + { + "category_id": 1, + "poly": [ + 293, + 1191, + 1401, + 1191, + 1401, + 1257, + 293, + 1257 + ], + "score": 0.574 + }, + { + "category_id": 1, + "poly": [ + 300, + 1273, + 1402, + 1273, + 1402, + 1368, + 300, + 1368 + ], + "score": 0.57 + }, + { + "category_id": 1, + "poly": [ + 297, + 1580, + 1401, + 1580, + 1401, + 1646, + 297, + 1646 + ], + "score": 0.566 + }, + { + "category_id": 1, + "poly": [ + 291, + 831, + 1399, + 831, + 1399, + 897, + 291, + 897 + ], + "score": 0.564 + }, + { + "category_id": 1, + "poly": [ + 294, + 473, + 1402, + 473, + 1402, + 537, + 294, + 537 + ], + "score": 0.559 + }, + { + "category_id": 1, + "poly": [ + 293, + 555, + 1401, + 555, + 1401, + 619, + 293, + 619 + ], + "score": 0.555 + }, + { + "category_id": 1, + "poly": [ + 299, + 1827, + 1401, + 1827, + 1401, + 1922, + 299, + 1922 + ], + "score": 0.553 + }, + { + "category_id": 1, + "poly": [ + 295, + 636, + 1402, + 636, + 1402, + 703, + 295, + 703 + ], + "score": 0.547 + }, + { + "category_id": 1, + "poly": [ + 302, + 718, + 1399, + 718, + 1399, + 814, + 302, + 814 + ], + "score": 0.545 + }, + { + "category_id": 1, + "poly": [ + 299, + 1941, + 1404, + 1941, + 1404, + 2034, + 299, + 2034 + ], + "score": 0.455 + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 859.0, + 73.0, + 859.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 227.0, + 491.0, + 227.0, + 491.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2087.0, + 861.0, + 2087.0, + 861.0, + 2117.0, + 839.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 275.0, + 1403.0, + 275.0, + 1403.0, + 315.0, + 293.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 309.0, + 1404.0, + 309.0, + 1404.0, + 344.0, + 322.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 340.0, + 648.0, + 340.0, + 648.0, + 373.0, + 320.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1744.0, + 1404.0, + 1744.0, + 1404.0, + 1785.0, + 294.0, + 1785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1776.0, + 1086.0, + 1776.0, + 1086.0, + 1812.0, + 323.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1108.0, + 1403.0, + 1108.0, + 1403.0, + 1145.0, + 294.0, + 1145.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1140.0, + 1382.0, + 1140.0, + 1382.0, + 1177.0, + 322.0, + 1177.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 390.0, + 1402.0, + 390.0, + 1402.0, + 426.0, + 293.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 422.0, + 962.0, + 422.0, + 962.0, + 455.0, + 323.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1027.0, + 1404.0, + 1027.0, + 1404.0, + 1063.0, + 295.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1058.0, + 1123.0, + 1058.0, + 1123.0, + 1091.0, + 321.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1384.0, + 1403.0, + 1384.0, + 1403.0, + 1423.0, + 294.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1418.0, + 1404.0, + 1418.0, + 1404.0, + 1453.0, + 324.0, + 1453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1449.0, + 764.0, + 1449.0, + 764.0, + 1483.0, + 322.0, + 1483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1664.0, + 1400.0, + 1664.0, + 1400.0, + 1700.0, + 296.0, + 1700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1694.0, + 1072.0, + 1694.0, + 1072.0, + 1730.0, + 323.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 911.0, + 1402.0, + 911.0, + 1402.0, + 952.0, + 295.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 947.0, + 1404.0, + 947.0, + 1404.0, + 981.0, + 324.0, + 981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 976.0, + 1053.0, + 976.0, + 1053.0, + 1011.0, + 323.0, + 1011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1497.0, + 1403.0, + 1497.0, + 1403.0, + 1534.0, + 296.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1528.0, + 1261.0, + 1528.0, + 1261.0, + 1565.0, + 323.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1192.0, + 1406.0, + 1192.0, + 1406.0, + 1228.0, + 295.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1223.0, + 1065.0, + 1223.0, + 1065.0, + 1259.0, + 325.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1273.0, + 1404.0, + 1273.0, + 1404.0, + 1311.0, + 295.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1306.0, + 1404.0, + 1306.0, + 1404.0, + 1340.0, + 323.0, + 1340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1336.0, + 673.0, + 1336.0, + 673.0, + 1370.0, + 323.0, + 1370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1582.0, + 1405.0, + 1582.0, + 1405.0, + 1618.0, + 296.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1614.0, + 1333.0, + 1614.0, + 1333.0, + 1647.0, + 325.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 830.0, + 1405.0, + 830.0, + 1405.0, + 869.0, + 294.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 863.0, + 1172.0, + 863.0, + 1172.0, + 898.0, + 322.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 473.0, + 1405.0, + 473.0, + 1405.0, + 509.0, + 296.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 505.0, + 820.0, + 505.0, + 820.0, + 536.0, + 323.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 554.0, + 1406.0, + 554.0, + 1406.0, + 592.0, + 295.0, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 586.0, + 1052.0, + 586.0, + 1052.0, + 622.0, + 321.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1826.0, + 1406.0, + 1826.0, + 1406.0, + 1866.0, + 293.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1856.0, + 1407.0, + 1856.0, + 1407.0, + 1896.0, + 320.0, + 1896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1889.0, + 626.0, + 1889.0, + 626.0, + 1922.0, + 323.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 633.0, + 1406.0, + 633.0, + 1406.0, + 677.0, + 294.0, + 677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 670.0, + 1248.0, + 670.0, + 1248.0, + 703.0, + 322.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 716.0, + 1404.0, + 716.0, + 1404.0, + 757.0, + 293.0, + 757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 751.0, + 1403.0, + 751.0, + 1403.0, + 786.0, + 323.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 779.0, + 859.0, + 779.0, + 859.0, + 815.0, + 323.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1938.0, + 1405.0, + 1938.0, + 1405.0, + 1979.0, + 293.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1971.0, + 1404.0, + 1971.0, + 1404.0, + 2007.0, + 322.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 2005.0, + 707.0, + 2005.0, + 707.0, + 2034.0, + 320.0, + 2034.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 298, + 75, + 857, + 75, + 857, + 105, + 298, + 105 + ], + "score": 0.883 + }, + { + "category_id": 1, + "poly": [ + 290, + 229, + 1403, + 229, + 1403, + 293, + 290, + 293 + ], + "score": 0.862 + }, + { + "category_id": 1, + "poly": [ + 300, + 1196, + 1402, + 1196, + 1402, + 1290, + 300, + 1290 + ], + "score": 0.859 + }, + { + "category_id": 1, + "poly": [ + 298, + 697, + 1403, + 697, + 1403, + 792, + 298, + 792 + ], + "score": 0.848 + }, + { + "category_id": 1, + "poly": [ + 299, + 809, + 1401, + 809, + 1401, + 906, + 299, + 906 + ], + "score": 0.83 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 866, + 2088, + 866, + 2113, + 836, + 2113 + ], + "score": 0.824 + }, + { + "category_id": 1, + "poly": [ + 299, + 1084, + 1403, + 1084, + 1403, + 1180, + 299, + 1180 + ], + "score": 0.814 + }, + { + "category_id": 1, + "poly": [ + 297, + 585, + 1402, + 585, + 1402, + 680, + 297, + 680 + ], + "score": 0.813 + }, + { + "category_id": 1, + "poly": [ + 295, + 1502, + 1399, + 1502, + 1399, + 1567, + 295, + 1567 + ], + "score": 0.81 + }, + { + "category_id": 1, + "poly": [ + 299, + 1971, + 1395, + 1971, + 1395, + 2035, + 299, + 2035 + ], + "score": 0.803 + }, + { + "category_id": 1, + "poly": [ + 296, + 1420, + 1401, + 1420, + 1401, + 1486, + 296, + 1486 + ], + "score": 0.791 + }, + { + "category_id": 1, + "poly": [ + 295, + 474, + 1402, + 474, + 1402, + 569, + 295, + 569 + ], + "score": 0.778 + }, + { + "category_id": 1, + "poly": [ + 297, + 1308, + 1405, + 1308, + 1405, + 1404, + 297, + 1404 + ], + "score": 0.776 + }, + { + "category_id": 1, + "poly": [ + 297, + 1776, + 1399, + 1776, + 1399, + 1843, + 297, + 1843 + ], + "score": 0.762 + }, + { + "category_id": 1, + "poly": [ + 297, + 1695, + 1400, + 1695, + 1400, + 1760, + 297, + 1760 + ], + "score": 0.761 + }, + { + "category_id": 1, + "poly": [ + 293, + 1002, + 1401, + 1002, + 1401, + 1069, + 293, + 1069 + ], + "score": 0.758 + }, + { + "category_id": 1, + "poly": [ + 296, + 362, + 1402, + 362, + 1402, + 455, + 296, + 455 + ], + "score": 0.75 + }, + { + "category_id": 1, + "poly": [ + 297, + 1583, + 1405, + 1583, + 1405, + 1677, + 297, + 1677 + ], + "score": 0.739 + }, + { + "category_id": 1, + "poly": [ + 294, + 310, + 1282, + 310, + 1282, + 346, + 294, + 346 + ], + "score": 0.731 + }, + { + "category_id": 1, + "poly": [ + 289, + 921, + 1401, + 921, + 1401, + 986, + 289, + 986 + ], + "score": 0.729 + }, + { + "category_id": 1, + "poly": [ + 298, + 1859, + 1401, + 1859, + 1401, + 1953, + 298, + 1953 + ], + "score": 0.721 + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 859.0, + 73.0, + 859.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 224.0, + 1408.0, + 224.0, + 1408.0, + 269.0, + 292.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 261.0, + 625.0, + 261.0, + 625.0, + 292.0, + 322.0, + 292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1196.0, + 1406.0, + 1196.0, + 1406.0, + 1233.0, + 293.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1227.0, + 1403.0, + 1227.0, + 1403.0, + 1261.0, + 323.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1258.0, + 396.0, + 1258.0, + 396.0, + 1292.0, + 323.0, + 1292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 697.0, + 1403.0, + 697.0, + 1403.0, + 734.0, + 296.0, + 734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 729.0, + 1404.0, + 729.0, + 1404.0, + 765.0, + 322.0, + 765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 759.0, + 598.0, + 759.0, + 598.0, + 793.0, + 321.0, + 793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 809.0, + 1406.0, + 809.0, + 1406.0, + 848.0, + 295.0, + 848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 841.0, + 1405.0, + 841.0, + 1405.0, + 876.0, + 323.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 872.0, + 1226.0, + 872.0, + 1226.0, + 908.0, + 323.0, + 908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1084.0, + 1405.0, + 1084.0, + 1405.0, + 1121.0, + 293.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1117.0, + 1405.0, + 1117.0, + 1405.0, + 1150.0, + 323.0, + 1150.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1148.0, + 707.0, + 1148.0, + 707.0, + 1182.0, + 326.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 586.0, + 1406.0, + 586.0, + 1406.0, + 620.0, + 296.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 615.0, + 1404.0, + 615.0, + 1404.0, + 652.0, + 321.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 642.0, + 401.0, + 642.0, + 401.0, + 683.0, + 320.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1498.0, + 1405.0, + 1498.0, + 1405.0, + 1542.0, + 294.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1535.0, + 1356.0, + 1535.0, + 1356.0, + 1568.0, + 320.0, + 1568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1970.0, + 1398.0, + 1970.0, + 1398.0, + 2008.0, + 294.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 2004.0, + 1219.0, + 2004.0, + 1219.0, + 2034.0, + 324.0, + 2034.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1417.0, + 1406.0, + 1417.0, + 1406.0, + 1461.0, + 294.0, + 1461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1452.0, + 1059.0, + 1452.0, + 1059.0, + 1488.0, + 324.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 472.0, + 1403.0, + 472.0, + 1403.0, + 512.0, + 294.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 504.0, + 1402.0, + 504.0, + 1402.0, + 541.0, + 324.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 536.0, + 1106.0, + 536.0, + 1106.0, + 570.0, + 324.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1309.0, + 1406.0, + 1309.0, + 1406.0, + 1344.0, + 297.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1339.0, + 1405.0, + 1339.0, + 1405.0, + 1376.0, + 323.0, + 1376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1371.0, + 738.0, + 1371.0, + 738.0, + 1405.0, + 324.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1776.0, + 1404.0, + 1776.0, + 1404.0, + 1815.0, + 293.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1808.0, + 1106.0, + 1808.0, + 1106.0, + 1843.0, + 322.0, + 1843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1694.0, + 1404.0, + 1694.0, + 1404.0, + 1734.0, + 295.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1728.0, + 1257.0, + 1728.0, + 1257.0, + 1761.0, + 322.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1002.0, + 1404.0, + 1002.0, + 1404.0, + 1042.0, + 295.0, + 1042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1036.0, + 1082.0, + 1036.0, + 1082.0, + 1069.0, + 322.0, + 1069.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 363.0, + 1404.0, + 363.0, + 1404.0, + 396.0, + 298.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 392.0, + 1403.0, + 392.0, + 1403.0, + 428.0, + 321.0, + 428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 422.0, + 452.0, + 422.0, + 452.0, + 457.0, + 320.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1585.0, + 1405.0, + 1585.0, + 1405.0, + 1619.0, + 295.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1614.0, + 1405.0, + 1614.0, + 1405.0, + 1651.0, + 321.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1645.0, + 397.0, + 1645.0, + 397.0, + 1679.0, + 321.0, + 1679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 309.0, + 1281.0, + 309.0, + 1281.0, + 348.0, + 295.0, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 919.0, + 1404.0, + 919.0, + 1404.0, + 963.0, + 293.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 954.0, + 1075.0, + 954.0, + 1075.0, + 987.0, + 322.0, + 987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1856.0, + 1405.0, + 1856.0, + 1405.0, + 1896.0, + 292.0, + 1896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1890.0, + 1403.0, + 1890.0, + 1403.0, + 1924.0, + 321.0, + 1924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1921.0, + 502.0, + 1921.0, + 502.0, + 1956.0, + 322.0, + 1956.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 298, + 75, + 857, + 75, + 857, + 105, + 298, + 105 + ], + "score": 0.902 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2113, + 836, + 2113 + ], + "score": 0.843 + }, + { + "category_id": 1, + "poly": [ + 289, + 189, + 1408, + 189, + 1408, + 1846, + 289, + 1846 + ], + "score": 0.575 + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 859.0, + 73.0, + 859.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2125.0, + 832.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 227.0, + 1405.0, + 227.0, + 1405.0, + 269.0, + 293.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 262.0, + 1122.0, + 262.0, + 1122.0, + 302.0, + 319.0, + 302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 315.0, + 1402.0, + 315.0, + 1402.0, + 349.0, + 295.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 344.0, + 1407.0, + 344.0, + 1407.0, + 384.0, + 319.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 375.0, + 838.0, + 375.0, + 838.0, + 410.0, + 322.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 426.0, + 1407.0, + 426.0, + 1407.0, + 467.0, + 292.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 454.0, + 1053.0, + 454.0, + 1053.0, + 494.0, + 321.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 512.0, + 1402.0, + 512.0, + 1402.0, + 547.0, + 293.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 540.0, + 1021.0, + 540.0, + 1021.0, + 580.0, + 319.0, + 580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 595.0, + 1404.0, + 595.0, + 1404.0, + 629.0, + 293.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 626.0, + 1197.0, + 626.0, + 1197.0, + 661.0, + 322.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1220.0, + 626.0, + 1405.0, + 626.0, + 1405.0, + 661.0, + 1220.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 653.0, + 623.0, + 653.0, + 623.0, + 688.0, + 321.0, + 688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 703.0, + 1404.0, + 703.0, + 1404.0, + 745.0, + 290.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 737.0, + 1059.0, + 737.0, + 1059.0, + 778.0, + 321.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 785.0, + 1407.0, + 785.0, + 1407.0, + 829.0, + 292.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 820.0, + 1365.0, + 820.0, + 1365.0, + 860.0, + 321.0, + 860.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 871.0, + 1405.0, + 871.0, + 1405.0, + 911.0, + 293.0, + 911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 902.0, + 816.0, + 902.0, + 816.0, + 942.0, + 321.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 957.0, + 1404.0, + 957.0, + 1404.0, + 992.0, + 295.0, + 992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 985.0, + 1407.0, + 985.0, + 1407.0, + 1027.0, + 317.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1017.0, + 832.0, + 1017.0, + 832.0, + 1052.0, + 322.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1069.0, + 1407.0, + 1069.0, + 1407.0, + 1109.0, + 292.0, + 1109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1096.0, + 1407.0, + 1096.0, + 1407.0, + 1142.0, + 319.0, + 1142.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1129.0, + 792.0, + 1129.0, + 792.0, + 1168.0, + 319.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1180.0, + 1407.0, + 1180.0, + 1407.0, + 1221.0, + 297.0, + 1221.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1212.0, + 1407.0, + 1212.0, + 1407.0, + 1252.0, + 321.0, + 1252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1243.0, + 580.0, + 1243.0, + 580.0, + 1279.0, + 319.0, + 1279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1292.0, + 1405.0, + 1292.0, + 1405.0, + 1336.0, + 292.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1321.0, + 1409.0, + 1321.0, + 1409.0, + 1369.0, + 317.0, + 1369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1356.0, + 763.0, + 1356.0, + 763.0, + 1391.0, + 322.0, + 1391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1405.0, + 1404.0, + 1405.0, + 1404.0, + 1448.0, + 292.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1437.0, + 870.0, + 1437.0, + 870.0, + 1479.0, + 319.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1493.0, + 1404.0, + 1493.0, + 1404.0, + 1528.0, + 295.0, + 1528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1524.0, + 1405.0, + 1524.0, + 1405.0, + 1559.0, + 321.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1554.0, + 850.0, + 1554.0, + 850.0, + 1594.0, + 321.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1601.0, + 1405.0, + 1601.0, + 1405.0, + 1645.0, + 290.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1636.0, + 901.0, + 1636.0, + 901.0, + 1675.0, + 319.0, + 1675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1687.0, + 1405.0, + 1687.0, + 1405.0, + 1728.0, + 293.0, + 1728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1719.0, + 828.0, + 1719.0, + 828.0, + 1757.0, + 317.0, + 1757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1773.0, + 1405.0, + 1773.0, + 1405.0, + 1808.0, + 293.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1801.0, + 865.0, + 1801.0, + 865.0, + 1839.0, + 319.0, + 1839.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 452, + 1404, + 452, + 1404, + 666, + 297, + 666 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1345, + 1404, + 1345, + 1404, + 1592, + 298, + 1592 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 1607, + 1403, + 1607, + 1403, + 1731, + 299, + 1731 + ], + "score": 0.977 + }, + { + "category_id": 3, + "poly": [ + 308, + 695, + 1387, + 695, + 1387, + 1115, + 308, + 1115 + ], + "score": 0.97 + }, + { + "category_id": 4, + "poly": [ + 297, + 1150, + 1403, + 1150, + 1403, + 1214, + 297, + 1214 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 300, + 296, + 1402, + 296, + 1402, + 357, + 300, + 357 + ], + "score": 0.945 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 857, + 75, + 857, + 105, + 298, + 105 + ], + "score": 0.905 + }, + { + "category_id": 0, + "poly": [ + 298, + 227, + 501, + 227, + 501, + 261, + 298, + 261 + ], + "score": 0.898 + }, + { + "category_id": 0, + "poly": [ + 293, + 396, + 966, + 396, + 966, + 427, + 293, + 427 + ], + "score": 0.851 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.846 + }, + { + "category_id": 0, + "poly": [ + 300, + 1289, + 835, + 1289, + 835, + 1320, + 300, + 1320 + ], + "score": 0.727 + }, + { + "category_id": 1, + "poly": [ + 300, + 1289, + 835, + 1289, + 835, + 1320, + 300, + 1320 + ], + "score": 0.176 + }, + { + "category_id": 15, + "poly": [ + 485.0, + 694.0, + 714.0, + 694.0, + 714.0, + 717.0, + 485.0, + 717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1006.0, + 699.0, + 1287.0, + 699.0, + 1287.0, + 725.0, + 1006.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 717.0, + 362.0, + 717.0, + 362.0, + 745.0, + 324.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 733.0, + 913.0, + 733.0, + 913.0, + 760.0, + 867.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1279.0, + 727.0, + 1374.0, + 727.0, + 1374.0, + 756.0, + 1279.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1278.0, + 745.0, + 1375.0, + 745.0, + 1375.0, + 777.0, + 1278.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 761.0, + 365.0, + 761.0, + 365.0, + 794.0, + 323.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 771.0, + 913.0, + 771.0, + 913.0, + 799.0, + 867.0, + 799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1279.0, + 766.0, + 1374.0, + 766.0, + 1374.0, + 795.0, + 1279.0, + 795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1279.0, + 785.0, + 1374.0, + 785.0, + 1374.0, + 814.0, + 1279.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 810.0, + 365.0, + 810.0, + 365.0, + 839.0, + 324.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 848.0, + 810.0, + 913.0, + 810.0, + 913.0, + 979.0, + 848.0, + 979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1278.0, + 802.0, + 1362.0, + 802.0, + 1362.0, + 853.0, + 1278.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 844.0, + 380.0, + 844.0, + 380.0, + 947.0, + 296.0, + 947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 849.0, + 911.0, + 849.0, + 911.0, + 876.0, + 868.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1277.0, + 842.0, + 1367.0, + 842.0, + 1367.0, + 892.0, + 1277.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 889.0, + 911.0, + 889.0, + 911.0, + 915.0, + 868.0, + 915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 926.0, + 911.0, + 926.0, + 911.0, + 954.0, + 868.0, + 954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 948.0, + 366.0, + 948.0, + 366.0, + 980.0, + 323.0, + 980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 966.0, + 911.0, + 966.0, + 911.0, + 992.0, + 868.0, + 992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 994.0, + 365.0, + 994.0, + 365.0, + 1026.0, + 323.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 1005.0, + 911.0, + 1005.0, + 911.0, + 1031.0, + 867.0, + 1031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1041.0, + 364.0, + 1041.0, + 364.0, + 1070.0, + 324.0, + 1070.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 1044.0, + 913.0, + 1044.0, + 913.0, + 1071.0, + 867.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 1070.0, + 400.0, + 1070.0, + 400.0, + 1100.0, + 364.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 1071.0, + 473.0, + 1071.0, + 473.0, + 1100.0, + 435.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 1070.0, + 545.0, + 1070.0, + 545.0, + 1100.0, + 509.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 580.0, + 1070.0, + 617.0, + 1070.0, + 617.0, + 1100.0, + 580.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 650.0, + 1069.0, + 690.0, + 1069.0, + 690.0, + 1101.0, + 650.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 723.0, + 1070.0, + 760.0, + 1070.0, + 760.0, + 1100.0, + 723.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 1071.0, + 834.0, + 1071.0, + 834.0, + 1100.0, + 796.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 913.0, + 1070.0, + 953.0, + 1070.0, + 953.0, + 1103.0, + 913.0, + 1103.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1072.0, + 1022.0, + 1072.0, + 1022.0, + 1101.0, + 985.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1056.0, + 1071.0, + 1093.0, + 1071.0, + 1093.0, + 1101.0, + 1056.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1128.0, + 1070.0, + 1164.0, + 1070.0, + 1164.0, + 1100.0, + 1128.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1199.0, + 1070.0, + 1236.0, + 1070.0, + 1236.0, + 1100.0, + 1199.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1266.0, + 1069.0, + 1307.0, + 1069.0, + 1307.0, + 1103.0, + 1266.0, + 1103.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1340.0, + 1071.0, + 1377.0, + 1071.0, + 1377.0, + 1100.0, + 1340.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 556.0, + 1088.0, + 642.0, + 1088.0, + 642.0, + 1119.0, + 556.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 801.0, + 1090.0, + 844.0, + 1090.0, + 844.0, + 1118.0, + 801.0, + 1118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1104.0, + 1088.0, + 1188.0, + 1088.0, + 1188.0, + 1119.0, + 1104.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1344.0, + 1088.0, + 1388.0, + 1088.0, + 1388.0, + 1119.0, + 1344.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1151.0, + 1404.0, + 1151.0, + 1404.0, + 1183.0, + 297.0, + 1183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1179.0, + 1364.0, + 1179.0, + 1364.0, + 1219.0, + 293.0, + 1219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 859.0, + 73.0, + 859.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 222.0, + 506.0, + 222.0, + 506.0, + 267.0, + 293.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 395.0, + 973.0, + 395.0, + 973.0, + 431.0, + 296.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1288.0, + 840.0, + 1288.0, + 840.0, + 1324.0, + 296.0, + 1324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 454.0, + 1404.0, + 454.0, + 1404.0, + 488.0, + 295.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 484.0, + 1404.0, + 484.0, + 1404.0, + 519.0, + 294.0, + 519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 512.0, + 1404.0, + 512.0, + 1404.0, + 550.0, + 292.0, + 550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 547.0, + 1404.0, + 547.0, + 1404.0, + 577.0, + 295.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 575.0, + 1406.0, + 575.0, + 1406.0, + 609.0, + 295.0, + 609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 607.0, + 1404.0, + 607.0, + 1404.0, + 641.0, + 294.0, + 641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 634.0, + 1186.0, + 634.0, + 1186.0, + 669.0, + 294.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1344.0, + 1404.0, + 1344.0, + 1404.0, + 1381.0, + 292.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1378.0, + 1405.0, + 1378.0, + 1405.0, + 1412.0, + 294.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1408.0, + 1404.0, + 1408.0, + 1404.0, + 1442.0, + 294.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1436.0, + 1404.0, + 1436.0, + 1404.0, + 1473.0, + 293.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1467.0, + 1404.0, + 1467.0, + 1404.0, + 1502.0, + 293.0, + 1502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1496.0, + 1404.0, + 1496.0, + 1404.0, + 1532.0, + 293.0, + 1532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1526.0, + 1408.0, + 1526.0, + 1408.0, + 1566.0, + 292.0, + 1566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1560.0, + 1002.0, + 1560.0, + 1002.0, + 1594.0, + 294.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1604.0, + 1408.0, + 1604.0, + 1408.0, + 1642.0, + 293.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1639.0, + 1404.0, + 1639.0, + 1404.0, + 1671.0, + 295.0, + 1671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1669.0, + 1405.0, + 1669.0, + 1405.0, + 1702.0, + 295.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1698.0, + 1222.0, + 1698.0, + 1222.0, + 1734.0, + 294.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 293.0, + 1404.0, + 293.0, + 1404.0, + 333.0, + 295.0, + 333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 325.0, + 1359.0, + 325.0, + 1359.0, + 362.0, + 295.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1288.0, + 840.0, + 1288.0, + 840.0, + 1324.0, + 296.0, + 1324.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 398, + 704, + 1293, + 704, + 1293, + 1391, + 398, + 1391 + ], + "score": 0.972 + }, + { + "category_id": 4, + "poly": [ + 296, + 1422, + 1406, + 1422, + 1406, + 1548, + 296, + 1548 + ], + "score": 0.956 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 858, + 75, + 858, + 105, + 297, + 105 + ], + "score": 0.905 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.842 + }, + { + "category_id": 15, + "poly": [ + 744.0, + 700.0, + 1050.0, + 700.0, + 1050.0, + 739.0, + 744.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 747.0, + 760.0, + 747.0, + 760.0, + 791.0, + 577.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 780.0, + 816.0, + 780.0, + 816.0, + 823.0, + 576.0, + 823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 427.0, + 811.0, + 515.0, + 811.0, + 515.0, + 850.0, + 427.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 916.0, + 514.0, + 916.0, + 514.0, + 958.0, + 425.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 398.0, + 979.0, + 440.0, + 979.0, + 440.0, + 1084.0, + 398.0, + 1084.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 1025.0, + 513.0, + 1025.0, + 513.0, + 1066.0, + 422.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 1133.0, + 516.0, + 1133.0, + 516.0, + 1178.0, + 425.0, + 1178.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 1243.0, + 515.0, + 1243.0, + 515.0, + 1285.0, + 426.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 515.0, + 1323.0, + 571.0, + 1323.0, + 571.0, + 1366.0, + 515.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 1326.0, + 688.0, + 1326.0, + 688.0, + 1365.0, + 634.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 1324.0, + 807.0, + 1324.0, + 807.0, + 1366.0, + 750.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 1323.0, + 925.0, + 1323.0, + 925.0, + 1366.0, + 868.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 987.0, + 1324.0, + 1042.0, + 1324.0, + 1042.0, + 1366.0, + 987.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1104.0, + 1321.0, + 1162.0, + 1321.0, + 1162.0, + 1368.0, + 1104.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 1323.0, + 1278.0, + 1323.0, + 1278.0, + 1367.0, + 1223.0, + 1367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 1358.0, + 987.0, + 1358.0, + 987.0, + 1394.0, + 806.0, + 1394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1424.0, + 1404.0, + 1424.0, + 1404.0, + 1456.0, + 294.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1454.0, + 1404.0, + 1454.0, + 1404.0, + 1487.0, + 294.0, + 1487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1484.0, + 1404.0, + 1484.0, + 1404.0, + 1519.0, + 293.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1514.0, + 1128.0, + 1514.0, + 1128.0, + 1550.0, + 294.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 858.0, + 73.0, + 858.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/Z7xSQ3SXLQU/Z7xSQ3SXLQU.md b/parse/train/Z7xSQ3SXLQU/Z7xSQ3SXLQU.md new file mode 100644 index 0000000000000000000000000000000000000000..baa90045e9f68f7e16795337d46cf65acabd2c15 --- /dev/null +++ b/parse/train/Z7xSQ3SXLQU/Z7xSQ3SXLQU.md @@ -0,0 +1,233 @@ +# Manipulating SGD with Data Ordering Attacks + +Zakhar Shumaylov University of Cambridge zs334@cam.ac.uk + +Ilia Shumailov University of Cambridge & University of Toronto & Vector Institute ilia.shumailov@cl.cam.ac.uk + +Dmitry Kazhdan University of Cambridge dk525@cam.ac.uk + +Yiren Zhao University of Cambridge yiren.zhao@cl.cam.ac.uk + +Nicolas Papernot University of Toronto & Vector Institute nicolas.papernot@utoronto.ca + +Murat A. Erdogdu University of Toronto & Vector Institute erdogdu@cs.toronto.edu + +Ross Anderson University of Cambridge & University of Edinburgh ross.anderson@cl.cam.ac.uk + +# Abstract + +Machine learning is vulnerable to a wide variety of attacks. It is now well understood that by changing the underlying data distribution, an adversary can poison the model trained with it or introduce backdoors. In this paper we present a novel class of training-time attacks that require no changes to the underlying dataset or model architecture, but instead only change the order in which data are supplied to the model. In particular, we find that the attacker can either prevent the model from learning, or poison it to learn behaviours specified by the attacker. Furthermore, we find that even a single adversarially-ordered epoch can be enough to slow down model learning, or even to reset all of the learning progress. Indeed, the attacks presented here are not specific to the model or dataset, but rather target the stochastic nature of modern learning procedures. We extensively evaluate our attacks on computer vision and natural language benchmarks to find that the adversary can disrupt model training and even introduce backdoors. + +# 1 Introduction + +The data-driven nature of modern machine learning (ML) training routines puts pressure on data supply pipelines, which become increasingly more complex. It is common to find separate disks or whole content distribution networks dedicated to servicing massive datasets. Training is often distributed across multiple workers. This emergent complexity gives a perfect opportunity for an attacker to disrupt ML training, while remaining covert. In the case of stochastic gradient descent (SGD), it assumes uniform random sampling of items from the training dataset, yet in practice this randomness is rarely tested or enforced. Here, we focus on adversarial data sampling. + +It is now well known that malicious actors can poison data and introduce backdoors, forcing ML models to behave differently in the presence of triggers [12]. While such attacks have been shown to pose a real threat, they have so far required the attacker to perturb the dataset used for training. + +We now show that by simply changing the order in which batches or data points are supplied to a model during training, an attacker can affect model behaviour. More precisely, we show that it is possible to perform integrity and availability attacks without adding or modifying any data points. For integrity, an attacker can reduce model accuracy or arbitrarily control its predictions in the presence of particular triggers. For availability, an attacker can increase the amount of time it takes for the model to train, or even reset the learning progress, forcing the model parameters into a meaningless state. + +
AttackDataset knowledgeModel knowledgeModelspecificChangingdatasetAdding dataAddingperturbations
Batch ReorderX
Batch ReshuffleXXXXXX
Batch ReplaceXXXXXX
Adversarial initialisation [11]×√XX
BadNets [12]XXX×
Dynamic triggers [28]√√XX√
Poisoned frogs [32]√X√X√
+ +Table 1: Taxonomy of training time attacks. In green, we highlight our attacks. + +We present three different types of attacks that exploit Batch Reordering, Reshuffling and Replacing – naming them BRRR attacks. We show that an attacker can significantly change model performance by (i) changing the order in which batches are supplied to models during training; (ii) changing the order in which individual data points are supplied to models during training; and (iii) replacing datapoints from batches with other points from the dataset to promote specific data biases. Furthermore, we introduce Batch-Order Poison (BOP) and Batch-Order Backdoor (BOB), the first techniques that enable poisoning and backdooring of neural networks using only clean data and clean labels; an attacker can control the parameter update of a model by appropriate choice of benign datapoints. Importantly, BRRR attacks require no underlying model access or knowledge of the dataset. Instead, they focus on the stochasticity of gradient descent, disrupting how well individual batches approximate the true distribution that a model is trying to learn. + +To summarise, we make the following contributions in this paper: + +• We present a novel class of attacks on ML models that target the data batching procedure used during training, affecting their integrity and availability. We present a theoretical analysis explaining how and why these attacks work, showing that they target fundamental assumptions of stochastic learning, and are therefore model and dataset agnostic1. • We evaluate these attacks on a set of common computer vision and language benchmarks, using a range of different hyper-parameter configurations, and find that an attacker can slow the progress of training, as well as reset it, with just a single epoch of intervention. • We show that data order can poison models and introduce backdoors, even in a blackbox setup. For a whitebox setup, we find that the adversary can introduce backdoors almost as well as if they used perturbed data. While a baseline CIFAR10 VGG16 model that uses perturbed data gets ${ \bar { 9 } } 9 \%$ trigger accuracy, the whitebox BOB attacker gets $9 1 \% \pm 1 3$ and the blackbox BOB attacker achieves $6 8 \% \pm 1 9$ . + +# 2 Related Work + +Attacks on integrity: Szegedy et al. [34] and Biggio et al. [6] concurrently discovered the existence of adversarial examples. These samples, containing human imperceptible perturbations, cause models to output incorrect results during inference. The original whitebox attacks require the adversary to access the models and use gradient information to perform conditioned optimisation to maximise the model loss [34, 6, 10, 22]. The attack later generalised to blackbox setups, where the adversary trains a surrogate model and hopes the generated adversarial samples transfer to the target model [24]. + +The data-poisoning attack aims at using data manipulation to cause DNNs to fail on specific test-time instances [17]. Chen et al. demonstrated that manipulation of the labels of around 50 training samples is enough to trigger failure [8]. Gu et al. showed that attackers can associate adversarial patterns with labelled images and cause DNNs to overfit to this pattern [12]. Shafahi et al. launched a poisoning attack using instances with clean labels [29]. A number of other works have since created more efficient triggers [28]. It was a common belief that poisoning attacks on DNNs have to contain a certain level of malicious manipulation of whether the data or label at train time. However, this paper shows how poisoning is possible with clean data and clean labels, with the only manipulation being of the batching process at training time. + +Attacks on availability: Shumailov et al. first attacked the availability of computer vision and natural language processing models at inference time with sponge examples [30]. They pessimized over energy utilisation and inference latency to target hardware and internal model optimisations. By contrast, this paper targets availability at training time. We show that the attacker can reset or slow down training progress by reordering or reshuffling natural batches. Finally, we note that unlike Shumailov et al., our attacks do not target specific optimisations in hardware or individual models, but instead break the fundamental stochastic assumption of training. + +Note on terminology: As we study attacks on training, we use the terms integrity and availability in a slightly different sense from the rest of the literature. By availability, we mean the availability of a training procedure – the rate at which the model trains, as opposed to model performance on the task. By integrity attacks, we mean attacks that either stop the model from learning its intended task, or force it to learn an additional unrelated task. + +# 3 Methodology + +# 3.1 Threat model + +![](images/7350808cdc653df8e4d2f8c68bb3e0851adb28912ef8969280821c54c3a3fc85.jpg) +Figure 1: The attacker reorders the benign randomly supplied data based on the surrogate model outputs. Attacker co-trains the surrogate model with the data that is supplied to the source model. + +We assume one of the strongest threat models currently described in the literature. In particular, our blackbox attacker assumes no access to the model and no prior knowledge of the training data, whereas a whitebox attacker has access to the model under attack and can compute its loss directly. The attack specifically focuses on the batching part of the ML pipeline as is depicted in Figure 1. We discuss the related work in Section 2. + +This attack is realistic and can be instantiated in several ways. The attack code can be infiltrated into: the operating system handing file system requests; the disk handling individual data accesses; the software that determines the way random data sampling is performed; the distributed storage manager; or the machine learning pipeline itself handling prefetch operations. That is a substantial attack surface, and for large models these components may be controlled by different principals. The attack is also very stealthy. The attacker does not add any noise or perturbation to the data. There are no triggers or backdoors introduced into the dataset. All of the data points are natural. In two of four variants the attacker uses the whole dataset and does not oversample any given point, i.e. the sampling is without replacement. This makes it difficult to deploy simple countermeasures. + +# 3.2 Primer on stochastic learning and batching + +We assume that the defender is trying to train a deep neural network model with parameters $\theta$ operating over $X _ { i } \sim { \mathcal { X } } _ { \mathrm { t r a i n } }$ , solving a non-convex optimization problem with respect to parameters $\theta$ , corresponding to minimization of a given loss function $L ( \theta )$ . We will denote the training dataset $X \ = \ \{ X _ { i } \}$ . We assume a commonly-used loss function defined as the sample average of the loss per training data point $L _ { i } ( \theta ) \stackrel { \cdot } { = } \stackrel { \cdot } { L } ( X _ { i } , \theta )$ in $k$ -th batch over the training set, where $B$ is the batch size: $\begin{array} { r } { \hat { L } _ { k + 1 } ( \theta ) = \frac { 1 } { B } \sum _ { i = k B + 1 } ^ { k B + B } L _ { i } ( \theta ) } \end{array}$ . If we let $N \cdot B$ be the total number of items for training, then in a single epoch one aims to optimize: $\begin{array} { r } { \hat { L } ( \theta ) = \frac { 1 } { N } \sum _ { i = 1 } ^ { N } \hat { L } _ { i } ( \theta ) } \end{array}$ . Optimization with stochastic gradient descent (SGD) algorithm of $N \cdot B$ samples and a learning rate of $\eta$ leads to the following weight update rule over one epoch: $\theta _ { k + 1 } = \theta _ { k } + \eta \Delta \theta _ { k }$ ; $\Delta \theta _ { k } = - \nabla _ { \theta } \hat { L } _ { k } ( \theta _ { k } )$ . SGD is often implemented with momentum [25, 33], with $\mu$ and $v$ representing momentum and velocity respectively: $v _ { k + 1 } = \mu v _ { k } + \eta \Delta \theta _ { k }$ ; $\theta _ { k + 1 } = \theta _ { k } + v _ { k + 1 }$ . + +Given data, SGD’s stochasticity comes from the batch sampling procedure. Mini-batched gradients approximate the true gradients of $\hat { L }$ and the quality of this approximation can vary greatly. In fact, assuming an unbiased sampling procedure, i.e. when the $k$ ’th gradient step corresponds to $i _ { k }$ ’th batch with $\mathbb { P } ( i _ { k } = i ) = 1 / N$ , in expectation the batch gradient matches the true gradient: + +$$ +\mathbb { E } [ \nabla \hat { L } _ { i _ { k } } ( \theta ) ] = \sum _ { i = 1 } ^ { N } \mathbb { P } ( i _ { k } = i ) \nabla \hat { L } _ { i } ( \theta ) = \frac { 1 } { N } \sum _ { i = 1 } ^ { N } \nabla \hat { L } _ { i } ( \theta ) = \nabla \hat { L } ( \theta ) . +$$ + +Although this happens in expectation, a given batch taken in isolation can be very far from the mean. This variation has been exploited in the literature to aid training: there exists a field responsible for variance reduction techniques for stochastic optimisation [18], active learning [9, 35], (anti-) curriculum learning [5, 20, 13] and core-set construction [2]. Each area looks at identifying and scheduling data subsets that aid training and give a better true gradient approximation. In this paper, we turn things round and investigate how an attacker can exploit data order to break training. The explicit stochastic assumption opens a new attack surface for the attacker to influence the learning process. In particular, let us consider the effect of $N$ SGD steps over one epoch [31]: + +$$ +\begin{array} { l } { \displaystyle \theta _ { N + 1 } = \theta _ { 1 } - \eta \nabla \hat { L } _ { 1 } ( \theta _ { 1 } ) - \eta \nabla \hat { L } _ { 2 } ( \theta _ { 2 } ) - \cdot \cdot \cdot - \eta \nabla \hat { L } _ { N } ( \theta _ { N } ) } \\ { \displaystyle \qquad = \theta _ { 1 } - \eta \sum _ { j = 1 } ^ { N } \nabla \hat { L } _ { j } ( \theta _ { 1 } ) + \eta ^ { 2 } \sum _ { j = 1 } ^ { N } \sum _ { k < j } \nabla \nabla \hat { L } _ { j } ( \theta _ { 1 } ) \nabla \hat { L } _ { k } ( \theta _ { 1 } ) + O ( N ^ { 3 } \eta ^ { 3 } ) . } \end{array} +$$ + +As we can see, in this case the second order correction term is dependent on the order of the batches provided. The attacker we describe in this paper focuses on manipulating it i.e. finding a sequence of updates such that the first and second derivatives are misaligned with the true gradient step. In Appendix C we prove that under equally-distributed loss gradients, a change in data order can lead to an increase in the expected value of the term which is dependent on data order. We also derive a condition on the gradient distribution given a model for which it is guaranteed. Finally, we derive an attack objective to target the upper bound on the rate of SGD convergence explicitly in Appendix A. + +In this paper we assume the blackbox attacker has no access to the underlying model, and thus no way to monitor its errors or the progress of its training. Instead, we co-train a separate surrogate model, using the batches supplied to the target model. We find that in practice the losses produced by the surrogate model approximate the losses of the true model well enough to enable attacks on both integrity and availability. We empirically find that our blackbox reshuffle attacks perform as well as the whitebox one in Appendix D. + +Finally, although the attacker can maximise the term dependent on data order directly, in practice it is expensive to do so. Therefore, in the attack we use the loss magnitudes directly rather than their gradient. Intuitively, large prediction errors correspond to large loss gradient norms, while correct predictions produce near-zero gradients. Although this assumption may not hold for all loss landscapes, for the loss landscapes incurred by real machine learning models, local minima often cluster around the global minima as the loss satisfies certain dissipativity properties [26, 36], and consequently loss magnitudes correlate with the gradient of the loss. We emphasize that we use this approximation only for computational advantage. + +# 3.3 Taxonomy of batching attacks + +In this section we describe the taxonomy of batching attacks as shown in Figure 2. The overall attack algorithm is shown in Algorithm 2 in the Appendix, and a shortened attack flow is shown in Algorithm 1. We highlight that our attacks are the first to successfully poison the underlying + +![](images/9ecad19d92ad1568ab77942a28d92ec253ae771264a960b96261a0566ccd5b9a.jpg) +Figure 2: Taxonomy of BRRR attacks. Normal batching assumes randomly distributed data points and batches. Batch reordering assumes the batches appear to the model in a different order, but internal contents stay in the original random order. Batch reshuffling assumes that the individual datapoints within batches change order, but appear only once and do not repeat across batches. Finally, batch replacement refers to cases where datapoints or batches can repeat or not appear at all. + +# Algorithm 1: A high level description of the BRRR attack algorithm + +/\* –– Attack preparation: collecting data \*/ +do get a new batch and add it to a list of unseen datapoints; train surrogate model on a batch and pass it on to the model; +while first epoch is not finished +/\* Attack: reorder based on surrogate loss \*/ +while training do rank each data point from epoch one with a surrogate loss; reorder the data points according to the attack strategy; pass batches to model and train the surrogate at the same time. + +model without changing the underlying dataset. In this paper we use three attack policies – (1) batch reshuffling or changing the order of datapoints inside batches; (2) batch reordering or changing the order of batches; and (3) batch replacement or replacing both points and batches. We consider four reordering policies, motivated by research in the fields of curriculum learning [5] and core-set selection [2], which discovered that model training can be enhanced by scheduling how and what data is presented to the model. That can help the model to generalize and to avoid overfitting with memorization. This paper does the opposite – we promote memorization and overfitting, forcing the model to forget generalizable features. Anti-curriculum learning (e.g. [13]) is particularly close to our batch reordering setting. + +![](images/df105449880bbabdecd0854bc6cc57fd11ee600465a07e1058c5c441f8b34b55.jpg) +Figure 3: We use four different reorder and reshuffle policies based on the corresponding data point and batch losses. We color-code the loss values from bright to dark colors, to represent loss values from low to high. Low-high policy orders a sequence by the loss magnitude. High-low policy orders a sequence by the negative loss magnitude. Oscillation inwards orders elements of the sequence from the beginning and the end of the sequence one by one, as if it was oscillating between sides of the sequence and moving towards the middle. Finally, Oscillations outward orders the sequence by starting at the middle of an ordered sequence picking elements to both sides of the current location. + +Figure 3 shows attack policies. Low to high orders sequence items by their loss. High to low is an inverse of Low to high. Oscillations inwards picks elements from both sides in sequence. Oscillations outwards inverts the halves of the sequence and then picks elements from both sides. + +# 3.4 Batch-order poison and backdoor + +Machine-learning poisoning and backdooring techniques aim to manipulate the training of a given model to control its behavior during inference. In the classical setting, both involve either appending adversarial datapoints $\hat { X }$ to natural dataset $X$ or changing natural datapoints $X + \delta$ so as to change model behaviour. This makes the attack easier to detect, and to prevent. For example, an adversary may add a red pixel above every tank in the dataset to introduce the red pixel trigger and cause other objects under red pixels to be classified as tanks. + +We present batch-order poisoning (BOP) and batch-order backdooring (BOB) – the first poison and backdoor strategies that do not rely on adding adversarial datapoints or perturbations during training, but only on changing the order in which genuine data are presented. BOP and BOB are based on the idea that the stochastic gradient update rule used in DNN training is agnostic of the batch contents and is an aggregation. Indeed, consider a classical poison setting with an adversarial dataset $\hat { X }$ : $\theta _ { k + 1 } = \theta _ { k } \stackrel { \smile \sim } { + } \eta \bar { \Delta } \theta _ { k } ; \quad \Delta \theta _ { k } = - ( \nabla _ { \theta } \hat { L } ( X _ { k } , \theta _ { k } ) + \nabla _ { \theta } \hat { L } ( \hat { X } _ { k } , \theta _ { k } ) )$ + +Order-agnostic aggregation with a sum makes it hard to reconstruct the individual datapoints $X _ { k }$ from just observing $\Delta \theta _ { k }$ . Indeed, the stochastic nature of optimisation allows one to find a set of datapoints $X _ { j } \neq X _ { i }$ such that $\nabla _ { \boldsymbol { \theta } } \hat { L } ( X _ { i } , { \boldsymbol { \theta } } _ { k } ) \approx \nabla _ { \boldsymbol { \theta } } \hat { L } ( X _ { j } , { \boldsymbol { \theta } } _ { k } )$ . Given a model and a dataset such that the gradient covariance matrix is non-singular, an attacker can approximate the gradient update from an adversarial dataset $\hat { X }$ using natural datapoints from the genuine dataset $X$ , enabling poisoning without having to change of underlying dataset in any way: + +$$ +\theta _ { k + 1 } = \theta _ { k } + \eta \hat { \Delta } \theta _ { k } , \mathrm { w h e r e \ } \left\{ \begin{array} { l l } { \hat { \Delta } \theta _ { k } = - \nabla _ { \theta } \hat { L } ( X _ { i } , \theta _ { k } ) } \\ { \nabla _ { \theta } \hat { L } ( X _ { i } , \theta _ { k } ) \approx \nabla _ { \theta } \hat { L } ( \hat { X } _ { k } , \theta _ { k } ) . } \end{array} \right. +$$ + +This gives rise to a surprisingly powerful adversary, who can introduce arbitrary behaviors into any models learned with stochastic gradient descent without having to add or perturb training data. This attack becomes more effective as training datasets become larger, further improving the attacker’s ability to shape the gradient update. We discuss its fidelity in Appendix B. + +![](images/429f59afc50256e77aa3ccf6dba59f0766f7a0748716b19ea920ca86f94cc5c2.jpg) +Figure 4: Examples of batches shown in (a) and (b) with similar gradient updates. Images shown in (a) are natural and are coming from the training set, whereas image in (b) is the poison datapoint. Strong gradients are aligned across the layers and successfully change the prediction of poison datapoints. + +We evaluated a number of different setups, and found that the attack works best when the attacker comprises the batch with $B - V$ natural data points and appends $V$ adversarially-chosen data points ${ \hat { X } } _ { i }$ to the batch. Aa larger $V$ is better for gradient approximation, but leads to more conflict with natural gradients; in the paper up to $30 \%$ of the batch is filled with natural datapoints to find a balance. Finding precise batch reconstruction is an intractable problem that scales with batch size and size of the dataset. However, we find that random sampling works well; even if mistakes are made, the network still learns the poison over the course of a few batches. Overall we try to minimize the following reconstruction error for a given poisoned batch $\hat { X _ { j } }$ : + +$$ +\operatorname* { m i n } _ { X _ { i } } \quad \left\| \nabla _ { \theta } \hat { L } ( \hat { X _ { j } } , \theta _ { k } ) - \nabla _ { \theta } \hat { L } ( X _ { i } , \theta _ { k } ) \right\| ^ { p } ; \quad \mathrm { s . t . } \quad X _ { i } \in X . +$$ + +Although more sophisticated approaches could help find better candidates, we discovered that random sampling works well enough for successful clean-data / clean-label poison and backdoor attacks. It also helps us strike a balance between speed of batch construction and impact on model performance. Figure 4 shows an example of natural data (a) that closely resembled the would-be update with batch in (b). Notably, such updates result in a prediction change towards the target class. + +# 4 Evaluation + +# 4.1 Experimental setup + +We evaluate our attacks using two computer vision and one natural language benchmarks: the CIFAR-10, CIFAR-100 [19] and AGNews [37] datasets. We use ResNet-18 and ResNet-50 as source models [14], and LeNet-5 [21] and MobileNet [16] as surrogate models, to train CIFAR-10 and CIFAR-100 respectively. For AGNews we used sparse mean EmbeddingBag followed by three fully connected layer from torchtext as source model and one fully connected layer for surrogate. Note that the surrogate model is significantly less performant than its corresponding source model in all cases, and cannot learn the dataset to the same degree of accuracy, limiting attacker capabilities. Thus our results represent a lower bound on attack performance. + +4.2 Integrity attacks with reshuffling and reordering of natural data + +
CIFAR-10CIFAR-100AGNews
AttackTrain accTest acc△Train accTest acc△Train accTest acc△
Baseline
None95.5190.51-0.0%99.9675.56-0.0%93.1390.87-0.0%
Batch reshuffle
Oscillation outward17.4426.13-64.38%99.8018.00-57.56%97.7265.85-25.02%
Oscillation inward22.8528.94-61.57%99.9231.38-44.18%94.0689.23-1.64%
High Low23.3931.04-59.47%99.6921.15−54.41%94.3856.54-34.33%
Low High20.2230.09-60.42%96.0720.48-55.08%98.9459.28-31.59%
Batch reorder
Oscillation outward99.3778.65-11.86%100.0053.05-22.51%95.3790.92+0.05%
Oscillation inward99.6078.18-12.33%100.0051.78-23.78%96.2991.10+0.93%
High Low99.4479.65-10.86%100.0051.48-24.08%96.1691.80+0.05%
Low High99.5879.07−11.43%100.0054.04-21.52%94.0290.35-0.52%
+ +Table 2: A shortened version of Table 4. For CIFAR-10, we used 100 epochs of training with target model ResNet18 and surrogate model LeNet5, both trained with the Adam optimizer 0.1 learning rate and $\beta = ( 0 . 9 9 , 0 . 9 )$ . For CIFAR-100, we used 200 epochs of training with target model ResNet50 and surrogate model Mobilenet, trained with SGD with 0.1 learning rate, 0.3 moment and Adam respectively for real and surrogate models. We highlight models that perform best in terms of test dataset loss. AGNews were trained with SGD learning rate 0.1, 0 moments for 50 epochs with sparse mean EmbeddingBags. Numbers here are from best-performing model test loss-wise. Incidentally, best performance of all models for Batch reshuffle listed in the table happen at epoch number one, where the attacker is preparing the attack and is collecting the training dataset. All computer vision reshuffle attacks result in near-random guess performance for almost all subsequent epochs. + +Table 2 presents the results (a much more detailed version is shown in Table 4). Batch reordering disrupts normal model training and introduces from zero to $1 5 \%$ performance degradation (refer to extended results and discussion in Appendix E). Note that the attacker does nothing beyond changing the order of the batches; their internal composition is the same. This shows the potency of this attack. Indeed, when we extend the attack to batch reshuffling – where batches get re-arranged internally – for computer vision, performance degrades to that of random guessing. In each, the best-performing models stay at the first epoch, where the attacker still accumulates the dataset used in training. Here, the degradation in performance is maximum – all models with all attack types failed to perform better than random guessing, having reached their top performance only in the first epoch, when the attacker was observing the dataset. + +We additionally report a large number of different hyperparameter variations for the attacks in Appendix I. This hyperparameter search suggests that the attacks work well as long as the surrogate models learn, do not converge to a minimum straight away, and have sufficient learning rate. + +Overall, we find that: + +• An attacker can affect the integrity of model training by changing the order of individual data items and natural batches. • The attacker can reduce model performance, and completely reset its performance. + +![](images/83116d09b53f241c612497de545c89588202c5abe0bace04f5ffb29e51d6e056.jpg) +Figure 5: Availability attacks at epoch 10, ResNet-18 attacked with a LeNet-5 surrogate. Error bars show per-batch accuracy standard deviation. + +While the previous section discused integrity attacks, this section’s focus is on availability. This refers to the amount of time and effort required to train a model, and an availability attack can involve an adversary using BRRR attacks to slow down training without disrupting the overall learning procedure. It is worth noting that there are other possible definitions of availability; it can also mean a model’s ability to reach original accuracy, but this case is already included in the integrity attacks we discussed in the last section. + +Availability attacks follow a similar scenario to Section 4.2 above, in that the attacker only changes the order in which data reaches the model. Here we at the 10th epoch, an arbitrary attack point, and all other training is done with randomly ordered data. We find that by feeding the model with a few BRRR batches, its training progress can be reset significantly – progress that may take a surprisingly large number of epochs to recover. The red line shows the worst scenario, where each batch has only data points of a single class. It can be seen that the attack manages to reset training, degrading performance for more than 90 epochs – low-high batch reordering at epoch ten results in $- 3 \%$ performance at epoch 100. + +In this section we showed that the attacker can perform availability attacks using both batch reordering and reshuffling and leave an impact on a model long after they have been launched; even a single attack epoch can degrade training progress significantly. Overall, we find that: + +• An attacker can cause disruption to model training by changing the order of data in just a single epoch of training. • An attack at just one epoch is enough to degrade the training for more than 90 epochs. + +# 4.4 Backdoors with batch replacement + +We find that the attacker can backdoor models by changing the data order. Here, we apply a trigger to images from the training dataset and then supply untriggered data to the model that result in a similar gradient shape. We find that our method enables the attacker to control the decision of a model when it makes a mistake i.e. when the model is making a decision about data far from the training-set distribution. For example, we show in Appendix F that poisoning a single random datapoint is possible with just a few batches. We hypothesise that the limitation comes from the fact that as only natural data are sampled for each BOP and BOB batch, natural gradients are present and learning continues; so forgetting does not happen and generalisation is not disrupted. + +![](images/e758fbe033d2bbfde84cfbfaeb34b96eb5fd07f34e65cf30fde4d1eac166b47a.jpg) +Figure 6: Triggers used in the paper: both are the same magnitude-wise, affecting $30 \%$ of the image. + +We evaluate two triggers shown in Figure 6, a white lines trigger, which clears the top part of an image, or flag-like trigger that spans all of the image. We report results from injecting up to 20 adversariallyordered batches every 50000 natural datapoints for 10 epochs. We then inject 80 adversarially-ordered batches. The training procedure here is similar to the one used for BadNets [12]. We find that 80 batches are not necessary, as most models end up converging after 3–5 adversarially-ordered batches. For reconstruction we randomly sample 300 batches, balancing search efficiency and attack cost as is noted in Appendix H, and use $p = 2$ . As we discuss in Appendix L, similar attacks work against language tasks. + +
TriggerBatch sizeTrain acc [%]Test acc [%]Trigger acc [%]Error with trigger [%]
Baselines
Random natural data3288.43 ± 7.2679.60 ± 1.4910.91 ± 1.5330.70 ± 2.26
6495.93 ± 2.1181.31 ± 2.019.78 ± 1.2527.38 ± 1.20
12894.92 ± 2.0481.69 ± 1.1710.00 ± 2.2627.91 ± 1.41
Data with trigger perturbation3296.87± 2.7973.28±2.9399.65±0.2289.68 ±0.21
6498.12 ± 1.5379.45 ± 1.3999.64±0.2189.64± 0.21
12898.67±0.9980.51 ± 1.1099.67 ± 0.4089.65 ±0.39
Only reordered natural data
9 white lines trigger3288.43±6.0978.02 ±1.5033.93 ± 7.3740.78 ± 5.70
64 12895.15 ± 2.6582.75±0.8625.02 ±3.7833.91 ± 2.28
95.23± 2.2482.90 ± 1.5021.75 ± 4.4931.75 ± 3.68
Blackbox 9 white lines trigger3288.43 ± 4.8580.84±1.2017.55 ± 3.7133.64 ± 2.83
6493.59 ± 3.1582.64 ± 1.6416.59 ± 4.8030.90±3.08
12894.84± 2.2481.12 ± 2.4916.19 ± 4.0131.33 ±3.73
Flag-like trigger3290.93 ± 3.8178.46 ± 1.0491.03 ± 12.9687.08 ± 2.71
6496.87 ± 1.2182.95±0.7277.10 ± 16.9682.92 ±3.89
12895.54 ± 1.8882.28 ± 1.5069.49 ± 20.6682.09 ±3.78
Blackbox flag-like trigger3286.25 ± 4.0080.16 ± 1.9156.31 ± 19.5778.78± 3.51
6495.00 ± 2.1883.41± 0.9448.75± 23.2878.11 ± 4.40
12893.82 ± 2.2781.54 ± 1.9468.07 ± 18.5581.23 ± 3.80
+ +Table 3: Network is VGG16 that has been trained normally on CIFAR10 for 10 epochs and then gets attacked with 10 BOB trigger batches. Test accuracy refers to the original benign accuracy, ‘Trigger acc’ is the proportion of images that are classified as the trigger target label, while ‘Error with trigger’ refers to all of the predictions that result in an incorrect label. Standard deviations are calculated over different target classes. Blackbox results use a ResNet-18 surrogate. + +Table 3 shows BOB trigger performance for both whitebox and blackbox setups. We present two baselines, one for normal training without any triggers, and one where triggers are added to the underlying data, i.e. training with perturbed data and labels. Trigger accuracy refers to the proportion of test set that ends up getting the target trigger label, whereas error with triggers shows the proportion of misclassifications that trigger introduces, i.e. when the model makes a mistake, but does not predict the trigger target class. As expected, we observe that for normal training, trigger accuracy stays at random guessing, and the trigger does not dominate errors it introduces, whereas adding perturbed data manipulates the model to predict the target class almost perfectly. + +We find that in a whitebox setup for a flag-like trigger we are capable of getting a similar order of performance for a batch of size 32 as if the attack was performed with injected adversarial data. In a blackbox setup with a flag-like trigger we lost around $30 \%$ of trigger performance, yet the trigger still remains operational. A trigger of nine white lines outperforms the baseline only marginally; in a whitebox setup it gets from $2 0 { - } 4 0 \%$ performance, whereas in a blackbox one it ranges between zero and $20 \%$ performance. We show the training progress of each individual trigger in Appendix K. + +Overall, we find that: + +• An attacker can poison an individual datapoint, change its label and increase its prediction confidence, without ever actually training the model on an adversarially-crafted datapoint. + +• An attacker can introduce backdoors into the model by introducing a few reordered batches during training, without ever injecting adversarial data or labels. Here, trigger performance differs, yet an adversary can perform BOB attacks on a par with attacks that inject perturbations into datasets explicitly. + +# 5 Conclusion + +We presented a novel class of attacks that manipulate the integrity and availability of training by changing the order of batches, or the order of datapoints within them. Careful reordering of a model’s training data allows it to be poisoned or backdoored without changing the training data at all. The attacks we presented are fully blackbox; they do not rely on knowledge of the target model or on prior knowledge of the data. Most surprisingly, we find that an attacker can introduce backdoors without disruption of generalisation, even though only natural data is used. We are the first to show that the sampling procedure can be manipulated deterministically to control the model’s behavior. + +This paper reminds us that stochastic gradient descent, like cryptography, depends on randomness. A random number generator with a backdoor can undermine a neural network just as it can undermine a payment network [1]. Developers who wish to ensure secure, robust, fair optimization during learning must therefore be able to inspect their assumptions and, in case of SGD, show the provenance of randomness used to select batches and datapoints. + +Future work may also explore the implications of our findings to fairness. Recent work has highlighted that ML models can suffer from a large taxonomy of different biases, including sampling bias, with outcomes including sexism and racism [3, 23]. This leads directly to questions of inductive bias and the practical contribution of pseudorandom sampling. Hooker has explained that bias in ML is not just a data problem, but depends on algorithms in subtle ways [15]; this paper shows how to exploit that dependency. + +# Acknowledgements + +We thank the reviewers for their insightful feedback. This work was supported by DARPA (through the GARD program), CIFAR (through a Canada CIFAR AI Chair), Bosch Forschungsstiftung im Stifterverband, by NSERC (under the Discovery Program, and COHESA strategic research network), and by a gift from Intel. We also thank the Vector Institute’s sponsors. + +# References + +[1] R. Anderson. Security Engineering. John Wiley & Sons, 2020. +[2] O. Bachem, M. Lucic, and A. Krause. Practical coreset constructions for machine learning, 2017. +[3] R. Baeza-Yates. Bias on the web. Commun. ACM, 61(6):54–61, May 2018. +[4] R. R. Bahadur. A Note on Quantiles in Large Samples. The Annals of Mathematical Statistics, 37(3):577 – 580, 1966. +[5] Y. Bengio, J. Louradour, R. Collobert, and J. Weston. Curriculum learning. In Proceedings of the 26th Annual International Conference on Machine Learning, ICML ’09, page 41–48, New York, NY, USA, 2009. Association for Computing Machinery. +[6] B. Biggio, I. Corona, D. Maiorca, B. Nelson, N. Šrndic, P. Laskov, G. Giacinto, and F. Roli. ´ Evasion attacks against machine learning at test time. In Joint European conference on machine learning and knowledge discovery in databases, pages 387–402. Springer, 2013. +[7] H. Chen. Chapter 2. order statistics. http://www.math.ntu.edu.tw/\~hchen/teaching/ LargeSample/notes/noteorder.pdf. +[8] X. Chen, C. Liu, B. Li, K. Lu, and D. Song. Targeted backdoor attacks on deep learning systems using data poisoning. arXiv preprint arXiv:1712.05526, 2017. +[9] D. A. Cohn, Z. Ghahramani, and M. I. Jordan. Active learning with statistical models. CoRR, cs.AI/9603104, 1996. +[10] I. J. Goodfellow, J. Shlens, and C. Szegedy. Explaining and harnessing adversarial examples, 2015. +[11] K. Grosse, T. A. Trost, M. Mosbach, M. Backes, and D. Klakow. On the security relevance of initial weights in deep neural networks. In I. Farkaš, P. Masulli, and S. Wermter, editors, Artificial Neural Networks and Machine Learning – ICANN 2020, pages 3–14, Cham, 2020. Springer International Publishing. +[12] T. Gu, B. Dolan-Gavitt, and S. Garg. Badnets: Identifying vulnerabilities in the machine learning model supply chain. arXiv preprint arXiv:1708.06733, 2017. +[13] G. Hacohen and D. Weinshall. On the power of curriculum learning in training deep networks. In K. Chaudhuri and R. Salakhutdinov, editors, Proceedings of the 36th International Conference on Machine Learning, volume 97 of Proceedings of Machine Learning Research, pages 2535– 2544. PMLR, 09–15 Jun 2019. +[14] K. He, X. Zhang, S. Ren, and J. Sun. Deep residual learning for image recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 770– 778, 2016. +[15] S. Hooker. Moving beyond “algorithmic bias is a data problem”. Patterns, 2(4):100241, 2021. +[16] A. G. Howard, M. Zhu, B. Chen, D. Kalenichenko, W. Wang, T. Weyand, M. Andreetto, and H. Adam. Mobilenets: Efficient convolutional neural networks for mobile vision applications. arXiv preprint arXiv:1704.04861, 2017. +[17] M. Jagielski, A. Oprea, B. Biggio, C. Liu, C. Nita-Rotaru, and B. Li. Manipulating machine learning: Poisoning attacks and countermeasures for regression learning. In 2018 IEEE Symposium on Security and Privacy (SP), pages 19–35. IEEE, 2018. +[18] R. Johnson and T. Zhang. Accelerating stochastic gradient descent using predictive variance reduction. Advances in neural information processing systems, 26:315–323, 2013. +[19] A. Krizhevsky, G. Hinton, et al. Learning multiple layers of features from tiny images. 2009. +[20] M. Kumar, B. Packer, and D. Koller. Self-paced learning for latent variable models. In J. Lafferty, C. Williams, J. Shawe-Taylor, R. Zemel, and A. Culotta, editors, Advances in Neural Information Processing Systems, volume 23. Curran Associates, Inc., 2010. +[21] Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner. Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998. +[22] A. Madry, A. Makelov, L. Schmidt, D. Tsipras, and A. Vladu. Towards deep learning models resistant to adversarial attacks, 2019. +[23] N. Mehrabi, F. Morstatter, N. Saxena, K. Lerman, and A. Galstyan. A survey on bias and fairness in machine learning. CoRR, abs/1908.09635, 2019. +[24] N. Papernot, P. McDaniel, I. Goodfellow, S. Jha, Z. B. Celik, and A. Swami. Practical black-box attacks against machine learning. In Proceedings of the 2017 ACM on Asia conference on computer and communications security, pages 506–519, 2017. +[25] B. Polyak. Some methods of speeding up the convergence of iteration methods. USSR Computational Mathematics and Mathematical Physics, 4(5):1–17, 1964. +[26] M. Raginsky, A. Rakhlin, and M. Telgarsky. Non-convex learning via stochastic gradient langevin dynamics: a nonasymptotic analysis, 2017. +[27] H. Robbins and S. Monro. A stochastic approximation method. The annals of mathematical statistics, pages 400–407, 1951. +[28] A. Salem, R. Wen, M. Backes, S. Ma, and Y. Zhang. Dynamic backdoor attacks against machine learning models, 2020. +[29] A. Shafahi, W. R. Huang, M. Najibi, O. Suciu, C. Studer, T. Dumitras, and T. Goldstein. Poison frogs! targeted clean-label poisoning attacks on neural networks. arXiv preprint arXiv:1804.00792, 2018. +[30] I. Shumailov, Y. Zhao, D. Bates, N. Papernot, R. Mullins, and R. Anderson. Sponge examples: Energy-latency attacks on neural networks. In 6th IEEE European Symposium on Security and Privacy (EuroS&P), 2021. +[31] S. L. Smith, B. Dherin, D. G. T. Barrett, and S. De. On the origin of implicit regularization in stochastic gradient descent, 2021. +[32] M. Sun, S. Agarwal, and J. Z. Kolter. Poisoned classifiers are not only backdoored, they are fundamentally broken, 2020. +[33] I. Sutskever, J. Martens, G. Dahl, and G. Hinton. On the importance of initialization and momentum in deep learning. In S. Dasgupta and D. McAllester, editors, Proceedings of the 30th International Conference on Machine Learning, volume 28 of Proceedings of Machine Learning Research, pages 1139–1147, Atlanta, Georgia, USA, 17–19 Jun 2013. PMLR. +[34] C. Szegedy, W. Zaremba, I. Sutskever, J. Bruna, D. Erhan, I. Goodfellow, and R. Fergus. Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199, 2013. +[35] S. Tong and D. Koller. Support vector machine active learning with applications to text classification. J. Mach. Learn. Res., 2:45–66, Mar. 2002. +[36] L. Yu, K. Balasubramanian, S. Volgushev, and M. A. Erdogdu. An analysis of constant step size sgd in the non-convex regime: Asymptotic normality and bias, 2020. +[37] X. Zhang, J. J. Zhao, and Y. LeCun. Character-level convolutional networks for text classification. In NIPS, 2015. \ No newline at end of file diff --git a/parse/train/Z7xSQ3SXLQU/Z7xSQ3SXLQU_content_list.json b/parse/train/Z7xSQ3SXLQU/Z7xSQ3SXLQU_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..9fa4bb486db3faac6d30d1f4d069545c4ea20d1c --- /dev/null +++ b/parse/train/Z7xSQ3SXLQU/Z7xSQ3SXLQU_content_list.json @@ -0,0 +1,1097 @@ +[ + { + "type": "text", + "text": "Manipulating SGD with Data Ordering Attacks ", + "text_level": 1, + "bbox": [ + 207, + 122, + 790, + 148 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Zakhar Shumaylov University of Cambridge zs334@cam.ac.uk ", + "bbox": [ + 465, + 200, + 632, + 242 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Ilia Shumailov University of Cambridge & University of Toronto & Vector Institute ilia.shumailov@cl.cam.ac.uk ", + "bbox": [ + 184, + 200, + 449, + 256 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Dmitry Kazhdan University of Cambridge dk525@cam.ac.uk ", + "bbox": [ + 648, + 200, + 813, + 243 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Yiren Zhao University of Cambridge yiren.zhao@cl.cam.ac.uk ", + "bbox": [ + 240, + 277, + 441, + 320 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Nicolas Papernot University of Toronto & Vector Institute nicolas.papernot@utoronto.ca ", + "bbox": [ + 513, + 279, + 756, + 333 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Murat A. Erdogdu University of Toronto & Vector Institute erdogdu@cs.toronto.edu ", + "bbox": [ + 250, + 354, + 441, + 410 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Ross Anderson University of Cambridge & University of Edinburgh ross.anderson@cl.cam.ac.uk ", + "bbox": [ + 522, + 354, + 748, + 410 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract ", + "text_level": 1, + "bbox": [ + 462, + 446, + 535, + 463 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Machine learning is vulnerable to a wide variety of attacks. It is now well understood that by changing the underlying data distribution, an adversary can poison the model trained with it or introduce backdoors. In this paper we present a novel class of training-time attacks that require no changes to the underlying dataset or model architecture, but instead only change the order in which data are supplied to the model. In particular, we find that the attacker can either prevent the model from learning, or poison it to learn behaviours specified by the attacker. Furthermore, we find that even a single adversarially-ordered epoch can be enough to slow down model learning, or even to reset all of the learning progress. Indeed, the attacks presented here are not specific to the model or dataset, but rather target the stochastic nature of modern learning procedures. We extensively evaluate our attacks on computer vision and natural language benchmarks to find that the adversary can disrupt model training and even introduce backdoors. ", + "bbox": [ + 233, + 479, + 766, + 659 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction ", + "text_level": 1, + "bbox": [ + 174, + 686, + 310, + 704 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The data-driven nature of modern machine learning (ML) training routines puts pressure on data supply pipelines, which become increasingly more complex. It is common to find separate disks or whole content distribution networks dedicated to servicing massive datasets. Training is often distributed across multiple workers. This emergent complexity gives a perfect opportunity for an attacker to disrupt ML training, while remaining covert. In the case of stochastic gradient descent (SGD), it assumes uniform random sampling of items from the training dataset, yet in practice this randomness is rarely tested or enforced. Here, we focus on adversarial data sampling. ", + "bbox": [ + 174, + 719, + 825, + 816 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "It is now well known that malicious actors can poison data and introduce backdoors, forcing ML models to behave differently in the presence of triggers [12]. While such attacks have been shown to pose a real threat, they have so far required the attacker to perturb the dataset used for training. ", + "bbox": [ + 174, + 823, + 825, + 864 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "We now show that by simply changing the order in which batches or data points are supplied to a model during training, an attacker can affect model behaviour. More precisely, we show that it is possible to perform integrity and availability attacks without adding or modifying any data points. For integrity, an attacker can reduce model accuracy or arbitrarily control its predictions in the presence of particular triggers. For availability, an attacker can increase the amount of time it takes for the model to train, or even reset the learning progress, forcing the model parameters into a meaningless state. ", + "bbox": [ + 174, + 871, + 821, + 900 + ], + "page_idx": 0 + }, + { + "type": "table", + "img_path": "images/1633634a5bd43d408c7df5cc7dd7f1129277611b954c09cfdc010c7d071967d3.jpg", + "table_caption": [], + "table_footnote": [ + "Table 1: Taxonomy of training time attacks. In green, we highlight our attacks. " + ], + "table_body": "
AttackDataset knowledgeModel knowledgeModelspecificChangingdatasetAdding dataAddingperturbations
Batch ReorderX
Batch ReshuffleXXXXXX
Batch ReplaceXXXXXX
Adversarial initialisation [11]×√XX
BadNets [12]XXX×
Dynamic triggers [28]√√XX√
Poisoned frogs [32]√X√X√
", + "bbox": [ + 205, + 88, + 789, + 167 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 215, + 825, + 284 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We present three different types of attacks that exploit Batch Reordering, Reshuffling and Replacing – naming them BRRR attacks. We show that an attacker can significantly change model performance by (i) changing the order in which batches are supplied to models during training; (ii) changing the order in which individual data points are supplied to models during training; and (iii) replacing datapoints from batches with other points from the dataset to promote specific data biases. Furthermore, we introduce Batch-Order Poison (BOP) and Batch-Order Backdoor (BOB), the first techniques that enable poisoning and backdooring of neural networks using only clean data and clean labels; an attacker can control the parameter update of a model by appropriate choice of benign datapoints. Importantly, BRRR attacks require no underlying model access or knowledge of the dataset. Instead, they focus on the stochasticity of gradient descent, disrupting how well individual batches approximate the true distribution that a model is trying to learn. ", + "bbox": [ + 174, + 291, + 826, + 443 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To summarise, we make the following contributions in this paper: ", + "bbox": [ + 174, + 449, + 602, + 463 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "• We present a novel class of attacks on ML models that target the data batching procedure used during training, affecting their integrity and availability. We present a theoretical analysis explaining how and why these attacks work, showing that they target fundamental assumptions of stochastic learning, and are therefore model and dataset agnostic1. • We evaluate these attacks on a set of common computer vision and language benchmarks, using a range of different hyper-parameter configurations, and find that an attacker can slow the progress of training, as well as reset it, with just a single epoch of intervention. • We show that data order can poison models and introduce backdoors, even in a blackbox setup. For a whitebox setup, we find that the adversary can introduce backdoors almost as well as if they used perturbed data. While a baseline CIFAR10 VGG16 model that uses perturbed data gets ${ \\bar { 9 } } 9 \\%$ trigger accuracy, the whitebox BOB attacker gets $9 1 \\% \\pm 1 3$ and the blackbox BOB attacker achieves $6 8 \\% \\pm 1 9$ . ", + "bbox": [ + 217, + 476, + 825, + 651 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 Related Work ", + "text_level": 1, + "bbox": [ + 174, + 670, + 321, + 686 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Attacks on integrity: Szegedy et al. [34] and Biggio et al. [6] concurrently discovered the existence of adversarial examples. These samples, containing human imperceptible perturbations, cause models to output incorrect results during inference. The original whitebox attacks require the adversary to access the models and use gradient information to perform conditioned optimisation to maximise the model loss [34, 6, 10, 22]. The attack later generalised to blackbox setups, where the adversary trains a surrogate model and hopes the generated adversarial samples transfer to the target model [24]. ", + "bbox": [ + 174, + 700, + 825, + 785 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The data-poisoning attack aims at using data manipulation to cause DNNs to fail on specific test-time instances [17]. Chen et al. demonstrated that manipulation of the labels of around 50 training samples is enough to trigger failure [8]. Gu et al. showed that attackers can associate adversarial patterns with labelled images and cause DNNs to overfit to this pattern [12]. Shafahi et al. launched a poisoning attack using instances with clean labels [29]. A number of other works have since created more efficient triggers [28]. It was a common belief that poisoning attacks on DNNs have to contain a certain level of malicious manipulation of whether the data or label at train time. However, this paper shows how poisoning is possible with clean data and clean labels, with the only manipulation being of the batching process at training time. ", + "bbox": [ + 174, + 791, + 825, + 888 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 92, + 823, + 119 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Attacks on availability: Shumailov et al. first attacked the availability of computer vision and natural language processing models at inference time with sponge examples [30]. They pessimized over energy utilisation and inference latency to target hardware and internal model optimisations. By contrast, this paper targets availability at training time. We show that the attacker can reset or slow down training progress by reordering or reshuffling natural batches. Finally, we note that unlike Shumailov et al., our attacks do not target specific optimisations in hardware or individual models, but instead break the fundamental stochastic assumption of training. ", + "bbox": [ + 173, + 126, + 825, + 223 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Note on terminology: As we study attacks on training, we use the terms integrity and availability in a slightly different sense from the rest of the literature. By availability, we mean the availability of a training procedure – the rate at which the model trains, as opposed to model performance on the task. By integrity attacks, we mean attacks that either stop the model from learning its intended task, or force it to learn an additional unrelated task. ", + "bbox": [ + 174, + 229, + 825, + 297 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 Methodology ", + "text_level": 1, + "bbox": [ + 174, + 319, + 313, + 335 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.1 Threat model ", + "text_level": 1, + "bbox": [ + 174, + 351, + 308, + 366 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/7350808cdc653df8e4d2f8c68bb3e0851adb28912ef8969280821c54c3a3fc85.jpg", + "image_caption": [ + "Figure 1: The attacker reorders the benign randomly supplied data based on the surrogate model outputs. Attacker co-trains the surrogate model with the data that is supplied to the source model. " + ], + "image_footnote": [], + "bbox": [ + 282, + 382, + 717, + 523 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We assume one of the strongest threat models currently described in the literature. In particular, our blackbox attacker assumes no access to the model and no prior knowledge of the training data, whereas a whitebox attacker has access to the model under attack and can compute its loss directly. The attack specifically focuses on the batching part of the ML pipeline as is depicted in Figure 1. We discuss the related work in Section 2. ", + "bbox": [ + 174, + 582, + 825, + 650 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "This attack is realistic and can be instantiated in several ways. The attack code can be infiltrated into: the operating system handing file system requests; the disk handling individual data accesses; the software that determines the way random data sampling is performed; the distributed storage manager; or the machine learning pipeline itself handling prefetch operations. That is a substantial attack surface, and for large models these components may be controlled by different principals. The attack is also very stealthy. The attacker does not add any noise or perturbation to the data. There are no triggers or backdoors introduced into the dataset. All of the data points are natural. In two of four variants the attacker uses the whole dataset and does not oversample any given point, i.e. the sampling is without replacement. This makes it difficult to deploy simple countermeasures. ", + "bbox": [ + 174, + 656, + 825, + 782 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.2 Primer on stochastic learning and batching ", + "text_level": 1, + "bbox": [ + 174, + 799, + 513, + 814 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We assume that the defender is trying to train a deep neural network model with parameters $\\theta$ operating over $X _ { i } \\sim { \\mathcal { X } } _ { \\mathrm { t r a i n } }$ , solving a non-convex optimization problem with respect to parameters $\\theta$ , corresponding to minimization of a given loss function $L ( \\theta )$ . We will denote the training dataset $X \\ = \\ \\{ X _ { i } \\}$ . We assume a commonly-used loss function defined as the sample average of the loss per training data point $L _ { i } ( \\theta ) \\stackrel { \\cdot } { = } \\stackrel { \\cdot } { L } ( X _ { i } , \\theta )$ in $k$ -th batch over the training set, where $B$ is the batch size: $\\begin{array} { r } { \\hat { L } _ { k + 1 } ( \\theta ) = \\frac { 1 } { B } \\sum _ { i = k B + 1 } ^ { k B + B } L _ { i } ( \\theta ) } \\end{array}$ . If we let $N \\cdot B$ be the total number of items for training, then in a single epoch one aims to optimize: $\\begin{array} { r } { \\hat { L } ( \\theta ) = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\hat { L } _ { i } ( \\theta ) } \\end{array}$ . Optimization with stochastic gradient descent (SGD) algorithm of $N \\cdot B$ samples and a learning rate of $\\eta$ leads to the following weight update rule over one epoch: $\\theta _ { k + 1 } = \\theta _ { k } + \\eta \\Delta \\theta _ { k }$ ; $\\Delta \\theta _ { k } = - \\nabla _ { \\theta } \\hat { L } _ { k } ( \\theta _ { k } )$ . SGD is often implemented with momentum [25, 33], with $\\mu$ and $v$ representing momentum and velocity respectively: $v _ { k + 1 } = \\mu v _ { k } + \\eta \\Delta \\theta _ { k }$ ; $\\theta _ { k + 1 } = \\theta _ { k } + v _ { k + 1 }$ . ", + "bbox": [ + 174, + 825, + 825, + 914 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 88, + 825, + 165 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Given data, SGD’s stochasticity comes from the batch sampling procedure. Mini-batched gradients approximate the true gradients of $\\hat { L }$ and the quality of this approximation can vary greatly. In fact, assuming an unbiased sampling procedure, i.e. when the $k$ ’th gradient step corresponds to $i _ { k }$ ’th batch with $\\mathbb { P } ( i _ { k } = i ) = 1 / N$ , in expectation the batch gradient matches the true gradient: ", + "bbox": [ + 174, + 169, + 825, + 228 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/41dc65ef6f84cab53c86ba538919ed45d5eb0c1284e64c240315c7a3ef2eca4f.jpg", + "text": "$$\n\\mathbb { E } [ \\nabla \\hat { L } _ { i _ { k } } ( \\theta ) ] = \\sum _ { i = 1 } ^ { N } \\mathbb { P } ( i _ { k } = i ) \\nabla \\hat { L } _ { i } ( \\theta ) = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\nabla \\hat { L } _ { i } ( \\theta ) = \\nabla \\hat { L } ( \\theta ) .\n$$", + "text_format": "latex", + "bbox": [ + 281, + 242, + 717, + 286 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Although this happens in expectation, a given batch taken in isolation can be very far from the mean. This variation has been exploited in the literature to aid training: there exists a field responsible for variance reduction techniques for stochastic optimisation [18], active learning [9, 35], (anti-) curriculum learning [5, 20, 13] and core-set construction [2]. Each area looks at identifying and scheduling data subsets that aid training and give a better true gradient approximation. In this paper, we turn things round and investigate how an attacker can exploit data order to break training. The explicit stochastic assumption opens a new attack surface for the attacker to influence the learning process. In particular, let us consider the effect of $N$ SGD steps over one epoch [31]: ", + "bbox": [ + 173, + 292, + 826, + 406 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/3a12ea9e46cd0a0277da09a3ba63df314068d6a2e8eea62eb91bb9fcd1b2cbba.jpg", + "text": "$$\n\\begin{array} { l } { \\displaystyle \\theta _ { N + 1 } = \\theta _ { 1 } - \\eta \\nabla \\hat { L } _ { 1 } ( \\theta _ { 1 } ) - \\eta \\nabla \\hat { L } _ { 2 } ( \\theta _ { 2 } ) - \\cdot \\cdot \\cdot - \\eta \\nabla \\hat { L } _ { N } ( \\theta _ { N } ) } \\\\ { \\displaystyle \\qquad = \\theta _ { 1 } - \\eta \\sum _ { j = 1 } ^ { N } \\nabla \\hat { L } _ { j } ( \\theta _ { 1 } ) + \\eta ^ { 2 } \\sum _ { j = 1 } ^ { N } \\sum _ { k < j } \\nabla \\nabla \\hat { L } _ { j } ( \\theta _ { 1 } ) \\nabla \\hat { L } _ { k } ( \\theta _ { 1 } ) + O ( N ^ { 3 } \\eta ^ { 3 } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 243, + 425, + 754, + 513 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "As we can see, in this case the second order correction term is dependent on the order of the batches provided. The attacker we describe in this paper focuses on manipulating it i.e. finding a sequence of updates such that the first and second derivatives are misaligned with the true gradient step. In Appendix C we prove that under equally-distributed loss gradients, a change in data order can lead to an increase in the expected value of the term which is dependent on data order. We also derive a condition on the gradient distribution given a model for which it is guaranteed. Finally, we derive an attack objective to target the upper bound on the rate of SGD convergence explicitly in Appendix A. ", + "bbox": [ + 173, + 523, + 825, + 622 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this paper we assume the blackbox attacker has no access to the underlying model, and thus no way to monitor its errors or the progress of its training. Instead, we co-train a separate surrogate model, using the batches supplied to the target model. We find that in practice the losses produced by the surrogate model approximate the losses of the true model well enough to enable attacks on both integrity and availability. We empirically find that our blackbox reshuffle attacks perform as well as the whitebox one in Appendix D. ", + "bbox": [ + 174, + 627, + 825, + 710 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Finally, although the attacker can maximise the term dependent on data order directly, in practice it is expensive to do so. Therefore, in the attack we use the loss magnitudes directly rather than their gradient. Intuitively, large prediction errors correspond to large loss gradient norms, while correct predictions produce near-zero gradients. Although this assumption may not hold for all loss landscapes, for the loss landscapes incurred by real machine learning models, local minima often cluster around the global minima as the loss satisfies certain dissipativity properties [26, 36], and consequently loss magnitudes correlate with the gradient of the loss. We emphasize that we use this approximation only for computational advantage. ", + "bbox": [ + 173, + 717, + 825, + 829 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.3 Taxonomy of batching attacks ", + "text_level": 1, + "bbox": [ + 176, + 843, + 421, + 858 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this section we describe the taxonomy of batching attacks as shown in Figure 2. The overall attack algorithm is shown in Algorithm 2 in the Appendix, and a shortened attack flow is shown in Algorithm 1. We highlight that our attacks are the first to successfully poison the underlying ", + "bbox": [ + 174, + 869, + 825, + 911 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/9ecad19d92ad1568ab77942a28d92ec253ae771264a960b96261a0566ccd5b9a.jpg", + "image_caption": [ + "Figure 2: Taxonomy of BRRR attacks. Normal batching assumes randomly distributed data points and batches. Batch reordering assumes the batches appear to the model in a different order, but internal contents stay in the original random order. Batch reshuffling assumes that the individual datapoints within batches change order, but appear only once and do not repeat across batches. Finally, batch replacement refers to cases where datapoints or batches can repeat or not appear at all. " + ], + "image_footnote": [], + "bbox": [ + 269, + 88, + 728, + 184 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Algorithm 1: A high level description of the BRRR attack algorithm ", + "text_level": 1, + "bbox": [ + 174, + 290, + 625, + 305 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "/\\* –– Attack preparation: collecting data \\*/ \ndo get a new batch and add it to a list of unseen datapoints; train surrogate model on a batch and pass it on to the model; \nwhile first epoch is not finished \n/\\* Attack: reorder based on surrogate loss \\*/ \nwhile training do rank each data point from epoch one with a surrogate loss; reorder the data points according to the attack strategy; pass batches to model and train the surrogate at the same time. ", + "bbox": [ + 171, + 309, + 823, + 449 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "model without changing the underlying dataset. In this paper we use three attack policies – (1) batch reshuffling or changing the order of datapoints inside batches; (2) batch reordering or changing the order of batches; and (3) batch replacement or replacing both points and batches. We consider four reordering policies, motivated by research in the fields of curriculum learning [5] and core-set selection [2], which discovered that model training can be enhanced by scheduling how and what data is presented to the model. That can help the model to generalize and to avoid overfitting with memorization. This paper does the opposite – we promote memorization and overfitting, forcing the model to forget generalizable features. Anti-curriculum learning (e.g. [13]) is particularly close to our batch reordering setting. ", + "bbox": [ + 173, + 494, + 826, + 619 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/df105449880bbabdecd0854bc6cc57fd11ee600465a07e1058c5c441f8b34b55.jpg", + "image_caption": [ + "Figure 3: We use four different reorder and reshuffle policies based on the corresponding data point and batch losses. We color-code the loss values from bright to dark colors, to represent loss values from low to high. Low-high policy orders a sequence by the loss magnitude. High-low policy orders a sequence by the negative loss magnitude. Oscillation inwards orders elements of the sequence from the beginning and the end of the sequence one by one, as if it was oscillating between sides of the sequence and moving towards the middle. Finally, Oscillations outward orders the sequence by starting at the middle of an ordered sequence picking elements to both sides of the current location. " + ], + "image_footnote": [], + "bbox": [ + 267, + 641, + 728, + 741 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Figure 3 shows attack policies. Low to high orders sequence items by their loss. High to low is an inverse of Low to high. Oscillations inwards picks elements from both sides in sequence. Oscillations outwards inverts the halves of the sequence and then picks elements from both sides. ", + "bbox": [ + 173, + 868, + 826, + 911 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.4 Batch-order poison and backdoor ", + "text_level": 1, + "bbox": [ + 176, + 92, + 446, + 106 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Machine-learning poisoning and backdooring techniques aim to manipulate the training of a given model to control its behavior during inference. In the classical setting, both involve either appending adversarial datapoints $\\hat { X }$ to natural dataset $X$ or changing natural datapoints $X + \\delta$ so as to change model behaviour. This makes the attack easier to detect, and to prevent. For example, an adversary may add a red pixel above every tank in the dataset to introduce the red pixel trigger and cause other objects under red pixels to be classified as tanks. ", + "bbox": [ + 173, + 116, + 825, + 202 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We present batch-order poisoning (BOP) and batch-order backdooring (BOB) – the first poison and backdoor strategies that do not rely on adding adversarial datapoints or perturbations during training, but only on changing the order in which genuine data are presented. BOP and BOB are based on the idea that the stochastic gradient update rule used in DNN training is agnostic of the batch contents and is an aggregation. Indeed, consider a classical poison setting with an adversarial dataset $\\hat { X }$ : $\\theta _ { k + 1 } = \\theta _ { k } \\stackrel { \\smile \\sim } { + } \\eta \\bar { \\Delta } \\theta _ { k } ; \\quad \\Delta \\theta _ { k } = - ( \\nabla _ { \\theta } \\hat { L } ( X _ { k } , \\theta _ { k } ) + \\nabla _ { \\theta } \\hat { L } ( \\hat { X } _ { k } , \\theta _ { k } ) )$ ", + "bbox": [ + 169, + 207, + 826, + 297 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Order-agnostic aggregation with a sum makes it hard to reconstruct the individual datapoints $X _ { k }$ from just observing $\\Delta \\theta _ { k }$ . Indeed, the stochastic nature of optimisation allows one to find a set of datapoints $X _ { j } \\neq X _ { i }$ such that $\\nabla _ { \\boldsymbol { \\theta } } \\hat { L } ( X _ { i } , { \\boldsymbol { \\theta } } _ { k } ) \\approx \\nabla _ { \\boldsymbol { \\theta } } \\hat { L } ( X _ { j } , { \\boldsymbol { \\theta } } _ { k } )$ . Given a model and a dataset such that the gradient covariance matrix is non-singular, an attacker can approximate the gradient update from an adversarial dataset $\\hat { X }$ using natural datapoints from the genuine dataset $X$ , enabling poisoning without having to change of underlying dataset in any way: ", + "bbox": [ + 173, + 301, + 825, + 390 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/2b5c0487fb4c4ad81313cc9872246bb14eb5b57bb70cf0f8f195a60de2a62cb9.jpg", + "text": "$$\n\\theta _ { k + 1 } = \\theta _ { k } + \\eta \\hat { \\Delta } \\theta _ { k } , \\mathrm { w h e r e \\ } \\left\\{ \\begin{array} { l l } { \\hat { \\Delta } \\theta _ { k } = - \\nabla _ { \\theta } \\hat { L } ( X _ { i } , \\theta _ { k } ) } \\\\ { \\nabla _ { \\theta } \\hat { L } ( X _ { i } , \\theta _ { k } ) \\approx \\nabla _ { \\theta } \\hat { L } ( \\hat { X } _ { k } , \\theta _ { k } ) . } \\end{array} \\right.\n$$", + "text_format": "latex", + "bbox": [ + 289, + 392, + 691, + 434 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "This gives rise to a surprisingly powerful adversary, who can introduce arbitrary behaviors into any models learned with stochastic gradient descent without having to add or perturb training data. This attack becomes more effective as training datasets become larger, further improving the attacker’s ability to shape the gradient update. We discuss its fidelity in Appendix B. ", + "bbox": [ + 173, + 435, + 826, + 492 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/429f59afc50256e77aa3ccf6dba59f0766f7a0748716b19ea920ca86f94cc5c2.jpg", + "image_caption": [ + "Figure 4: Examples of batches shown in (a) and (b) with similar gradient updates. Images shown in (a) are natural and are coming from the training set, whereas image in (b) is the poison datapoint. Strong gradients are aligned across the layers and successfully change the prediction of poison datapoints. " + ], + "image_footnote": [], + "bbox": [ + 282, + 515, + 710, + 609 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We evaluated a number of different setups, and found that the attack works best when the attacker comprises the batch with $B - V$ natural data points and appends $V$ adversarially-chosen data points ${ \\hat { X } } _ { i }$ to the batch. Aa larger $V$ is better for gradient approximation, but leads to more conflict with natural gradients; in the paper up to $30 \\%$ of the batch is filled with natural datapoints to find a balance. Finding precise batch reconstruction is an intractable problem that scales with batch size and size of the dataset. However, we find that random sampling works well; even if mistakes are made, the network still learns the poison over the course of a few batches. Overall we try to minimize the following reconstruction error for a given poisoned batch $\\hat { X _ { j } }$ : ", + "bbox": [ + 173, + 672, + 826, + 790 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/513ee118b705601fa1a8f711b15e4ff587481b766b20fcd19be6734fd64b8a6d.jpg", + "text": "$$\n\\operatorname* { m i n } _ { X _ { i } } \\quad \\left\\| \\nabla _ { \\theta } \\hat { L } ( \\hat { X _ { j } } , \\theta _ { k } ) - \\nabla _ { \\theta } \\hat { L } ( X _ { i } , \\theta _ { k } ) \\right\\| ^ { p } ; \\quad \\mathrm { s . t . } \\quad X _ { i } \\in X .\n$$", + "text_format": "latex", + "bbox": [ + 303, + 804, + 692, + 834 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Although more sophisticated approaches could help find better candidates, we discovered that random sampling works well enough for successful clean-data / clean-label poison and backdoor attacks. It also helps us strike a balance between speed of batch construction and impact on model performance. Figure 4 shows an example of natural data (a) that closely resembled the would-be update with batch in (b). Notably, such updates result in a prediction change towards the target class. ", + "bbox": [ + 173, + 842, + 825, + 911 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 Evaluation ", + "text_level": 1, + "bbox": [ + 174, + 89, + 295, + 106 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.1 Experimental setup ", + "text_level": 1, + "bbox": [ + 174, + 122, + 348, + 137 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We evaluate our attacks using two computer vision and one natural language benchmarks: the CIFAR-10, CIFAR-100 [19] and AGNews [37] datasets. We use ResNet-18 and ResNet-50 as source models [14], and LeNet-5 [21] and MobileNet [16] as surrogate models, to train CIFAR-10 and CIFAR-100 respectively. For AGNews we used sparse mean EmbeddingBag followed by three fully connected layer from torchtext as source model and one fully connected layer for surrogate. Note that the surrogate model is significantly less performant than its corresponding source model in all cases, and cannot learn the dataset to the same degree of accuracy, limiting attacker capabilities. Thus our results represent a lower bound on attack performance. ", + "bbox": [ + 173, + 150, + 825, + 261 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/e46a79629b501a8c4f32a3135f4694df9678bb1b354e21acc22fc2f29c92598c.jpg", + "table_caption": [ + "4.2 Integrity attacks with reshuffling and reordering of natural data " + ], + "table_footnote": [], + "table_body": "
CIFAR-10CIFAR-100AGNews
AttackTrain accTest acc△Train accTest acc△Train accTest acc△
Baseline
None95.5190.51-0.0%99.9675.56-0.0%93.1390.87-0.0%
Batch reshuffle
Oscillation outward17.4426.13-64.38%99.8018.00-57.56%97.7265.85-25.02%
Oscillation inward22.8528.94-61.57%99.9231.38-44.18%94.0689.23-1.64%
High Low23.3931.04-59.47%99.6921.15−54.41%94.3856.54-34.33%
Low High20.2230.09-60.42%96.0720.48-55.08%98.9459.28-31.59%
Batch reorder
Oscillation outward99.3778.65-11.86%100.0053.05-22.51%95.3790.92+0.05%
Oscillation inward99.6078.18-12.33%100.0051.78-23.78%96.2991.10+0.93%
High Low99.4479.65-10.86%100.0051.48-24.08%96.1691.80+0.05%
Low High99.5879.07−11.43%100.0054.04-21.52%94.0290.35-0.52%
", + "bbox": [ + 187, + 319, + 810, + 476 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Table 2: A shortened version of Table 4. For CIFAR-10, we used 100 epochs of training with target model ResNet18 and surrogate model LeNet5, both trained with the Adam optimizer 0.1 learning rate and $\\beta = ( 0 . 9 9 , 0 . 9 )$ . For CIFAR-100, we used 200 epochs of training with target model ResNet50 and surrogate model Mobilenet, trained with SGD with 0.1 learning rate, 0.3 moment and Adam respectively for real and surrogate models. We highlight models that perform best in terms of test dataset loss. AGNews were trained with SGD learning rate 0.1, 0 moments for 50 epochs with sparse mean EmbeddingBags. Numbers here are from best-performing model test loss-wise. Incidentally, best performance of all models for Batch reshuffle listed in the table happen at epoch number one, where the attacker is preparing the attack and is collecting the training dataset. All computer vision reshuffle attacks result in near-random guess performance for almost all subsequent epochs. ", + "bbox": [ + 173, + 482, + 825, + 621 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Table 2 presents the results (a much more detailed version is shown in Table 4). Batch reordering disrupts normal model training and introduces from zero to $1 5 \\%$ performance degradation (refer to extended results and discussion in Appendix E). Note that the attacker does nothing beyond changing the order of the batches; their internal composition is the same. This shows the potency of this attack. Indeed, when we extend the attack to batch reshuffling – where batches get re-arranged internally – for computer vision, performance degrades to that of random guessing. In each, the best-performing models stay at the first epoch, where the attacker still accumulates the dataset used in training. Here, the degradation in performance is maximum – all models with all attack types failed to perform better than random guessing, having reached their top performance only in the first epoch, when the attacker was observing the dataset. ", + "bbox": [ + 173, + 640, + 826, + 779 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We additionally report a large number of different hyperparameter variations for the attacks in Appendix I. This hyperparameter search suggests that the attacks work well as long as the surrogate models learn, do not converge to a minimum straight away, and have sufficient learning rate. ", + "bbox": [ + 176, + 785, + 825, + 827 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Overall, we find that: ", + "bbox": [ + 174, + 833, + 313, + 847 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "• An attacker can affect the integrity of model training by changing the order of individual data items and natural batches. • The attacker can reduce model performance, and completely reset its performance. ", + "bbox": [ + 217, + 861, + 825, + 911 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/83116d09b53f241c612497de545c89588202c5abe0bace04f5ffb29e51d6e056.jpg", + "image_caption": [ + "Figure 5: Availability attacks at epoch 10, ResNet-18 attacked with a LeNet-5 surrogate. Error bars show per-batch accuracy standard deviation. " + ], + "image_footnote": [], + "bbox": [ + 214, + 123, + 784, + 252 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "While the previous section discused integrity attacks, this section’s focus is on availability. This refers to the amount of time and effort required to train a model, and an availability attack can involve an adversary using BRRR attacks to slow down training without disrupting the overall learning procedure. It is worth noting that there are other possible definitions of availability; it can also mean a model’s ability to reach original accuracy, but this case is already included in the integrity attacks we discussed in the last section. ", + "bbox": [ + 173, + 308, + 825, + 391 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Availability attacks follow a similar scenario to Section 4.2 above, in that the attacker only changes the order in which data reaches the model. Here we at the 10th epoch, an arbitrary attack point, and all other training is done with randomly ordered data. We find that by feeding the model with a few BRRR batches, its training progress can be reset significantly – progress that may take a surprisingly large number of epochs to recover. The red line shows the worst scenario, where each batch has only data points of a single class. It can be seen that the attack manages to reset training, degrading performance for more than 90 epochs – low-high batch reordering at epoch ten results in $- 3 \\%$ performance at epoch 100. ", + "bbox": [ + 173, + 397, + 825, + 508 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In this section we showed that the attacker can perform availability attacks using both batch reordering and reshuffling and leave an impact on a model long after they have been launched; even a single attack epoch can degrade training progress significantly. Overall, we find that: ", + "bbox": [ + 174, + 515, + 823, + 558 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "• An attacker can cause disruption to model training by changing the order of data in just a single epoch of training. • An attack at just one epoch is enough to degrade the training for more than 90 epochs. ", + "bbox": [ + 217, + 566, + 825, + 613 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.4 Backdoors with batch replacement ", + "text_level": 1, + "bbox": [ + 176, + 628, + 455, + 643 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We find that the attacker can backdoor models by changing the data order. Here, we apply a trigger to images from the training dataset and then supply untriggered data to the model that result in a similar gradient shape. We find that our method enables the attacker to control the decision of a model when it makes a mistake i.e. when the model is making a decision about data far from the training-set distribution. For example, we show in Appendix F that poisoning a single random datapoint is possible with just a few batches. We hypothesise that the limitation comes from the fact that as only natural data are sampled for each BOP and BOB batch, natural gradients are present and learning continues; so forgetting does not happen and generalisation is not disrupted. ", + "bbox": [ + 173, + 654, + 826, + 766 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/e758fbe033d2bbfde84cfbfaeb34b96eb5fd07f34e65cf30fde4d1eac166b47a.jpg", + "image_caption": [ + "Figure 6: Triggers used in the paper: both are the same magnitude-wise, affecting $30 \\%$ of the image. " + ], + "image_footnote": [], + "bbox": [ + 282, + 789, + 710, + 847 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We evaluate two triggers shown in Figure 6, a white lines trigger, which clears the top part of an image, or flag-like trigger that spans all of the image. We report results from injecting up to 20 adversariallyordered batches every 50000 natural datapoints for 10 epochs. We then inject 80 adversarially-ordered batches. The training procedure here is similar to the one used for BadNets [12]. We find that 80 batches are not necessary, as most models end up converging after 3–5 adversarially-ordered batches. For reconstruction we randomly sample 300 batches, balancing search efficiency and attack cost as is noted in Appendix H, and use $p = 2$ . As we discuss in Appendix L, similar attacks work against language tasks. ", + "bbox": [ + 173, + 882, + 826, + 911 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 90, + 825, + 174 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/c083e5bb0c950bad80a8d365f8d6d7a47686909f5f6e7b255dc248e73342ab03.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
TriggerBatch sizeTrain acc [%]Test acc [%]Trigger acc [%]Error with trigger [%]
Baselines
Random natural data3288.43 ± 7.2679.60 ± 1.4910.91 ± 1.5330.70 ± 2.26
6495.93 ± 2.1181.31 ± 2.019.78 ± 1.2527.38 ± 1.20
12894.92 ± 2.0481.69 ± 1.1710.00 ± 2.2627.91 ± 1.41
Data with trigger perturbation3296.87± 2.7973.28±2.9399.65±0.2289.68 ±0.21
6498.12 ± 1.5379.45 ± 1.3999.64±0.2189.64± 0.21
12898.67±0.9980.51 ± 1.1099.67 ± 0.4089.65 ±0.39
Only reordered natural data
9 white lines trigger3288.43±6.0978.02 ±1.5033.93 ± 7.3740.78 ± 5.70
64 12895.15 ± 2.6582.75±0.8625.02 ±3.7833.91 ± 2.28
95.23± 2.2482.90 ± 1.5021.75 ± 4.4931.75 ± 3.68
Blackbox 9 white lines trigger3288.43 ± 4.8580.84±1.2017.55 ± 3.7133.64 ± 2.83
6493.59 ± 3.1582.64 ± 1.6416.59 ± 4.8030.90±3.08
12894.84± 2.2481.12 ± 2.4916.19 ± 4.0131.33 ±3.73
Flag-like trigger3290.93 ± 3.8178.46 ± 1.0491.03 ± 12.9687.08 ± 2.71
6496.87 ± 1.2182.95±0.7277.10 ± 16.9682.92 ±3.89
12895.54 ± 1.8882.28 ± 1.5069.49 ± 20.6682.09 ±3.78
Blackbox flag-like trigger3286.25 ± 4.0080.16 ± 1.9156.31 ± 19.5778.78± 3.51
6495.00 ± 2.1883.41± 0.9448.75± 23.2878.11 ± 4.40
12893.82 ± 2.2781.54 ± 1.9468.07 ± 18.5581.23 ± 3.80
", + "bbox": [ + 210, + 203, + 789, + 459 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Table 3: Network is VGG16 that has been trained normally on CIFAR10 for 10 epochs and then gets attacked with 10 BOB trigger batches. Test accuracy refers to the original benign accuracy, ‘Trigger acc’ is the proportion of images that are classified as the trigger target label, while ‘Error with trigger’ refers to all of the predictions that result in an incorrect label. Standard deviations are calculated over different target classes. Blackbox results use a ResNet-18 surrogate. ", + "bbox": [ + 174, + 460, + 826, + 529 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Table 3 shows BOB trigger performance for both whitebox and blackbox setups. We present two baselines, one for normal training without any triggers, and one where triggers are added to the underlying data, i.e. training with perturbed data and labels. Trigger accuracy refers to the proportion of test set that ends up getting the target trigger label, whereas error with triggers shows the proportion of misclassifications that trigger introduces, i.e. when the model makes a mistake, but does not predict the trigger target class. As expected, we observe that for normal training, trigger accuracy stays at random guessing, and the trigger does not dominate errors it introduces, whereas adding perturbed data manipulates the model to predict the target class almost perfectly. ", + "bbox": [ + 173, + 568, + 825, + 679 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We find that in a whitebox setup for a flag-like trigger we are capable of getting a similar order of performance for a batch of size 32 as if the attack was performed with injected adversarial data. In a blackbox setup with a flag-like trigger we lost around $30 \\%$ of trigger performance, yet the trigger still remains operational. A trigger of nine white lines outperforms the baseline only marginally; in a whitebox setup it gets from $2 0 { - } 4 0 \\%$ performance, whereas in a blackbox one it ranges between zero and $20 \\%$ performance. We show the training progress of each individual trigger in Appendix K. ", + "bbox": [ + 174, + 685, + 825, + 768 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Overall, we find that: ", + "bbox": [ + 174, + 775, + 313, + 789 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "• An attacker can poison an individual datapoint, change its label and increase its prediction confidence, without ever actually training the model on an adversarially-crafted datapoint. ", + "bbox": [ + 218, + 808, + 823, + 837 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "• An attacker can introduce backdoors into the model by introducing a few reordered batches during training, without ever injecting adversarial data or labels. Here, trigger performance differs, yet an adversary can perform BOB attacks on a par with attacks that inject perturbations into datasets explicitly. ", + "bbox": [ + 218, + 854, + 823, + 911 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 Conclusion ", + "text_level": 1, + "bbox": [ + 174, + 89, + 299, + 106 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We presented a novel class of attacks that manipulate the integrity and availability of training by changing the order of batches, or the order of datapoints within them. Careful reordering of a model’s training data allows it to be poisoned or backdoored without changing the training data at all. The attacks we presented are fully blackbox; they do not rely on knowledge of the target model or on prior knowledge of the data. Most surprisingly, we find that an attacker can introduce backdoors without disruption of generalisation, even though only natural data is used. We are the first to show that the sampling procedure can be manipulated deterministically to control the model’s behavior. ", + "bbox": [ + 174, + 121, + 825, + 218 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "This paper reminds us that stochastic gradient descent, like cryptography, depends on randomness. A random number generator with a backdoor can undermine a neural network just as it can undermine a payment network [1]. Developers who wish to ensure secure, robust, fair optimization during learning must therefore be able to inspect their assumptions and, in case of SGD, show the provenance of randomness used to select batches and datapoints. ", + "bbox": [ + 174, + 224, + 825, + 292 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Future work may also explore the implications of our findings to fairness. Recent work has highlighted that ML models can suffer from a large taxonomy of different biases, including sampling bias, with outcomes including sexism and racism [3, 23]. This leads directly to questions of inductive bias and the practical contribution of pseudorandom sampling. Hooker has explained that bias in ML is not just a data problem, but depends on algorithms in subtle ways [15]; this paper shows how to exploit that dependency. ", + "bbox": [ + 174, + 300, + 825, + 383 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Acknowledgements ", + "text_level": 1, + "bbox": [ + 176, + 404, + 338, + 420 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We thank the reviewers for their insightful feedback. This work was supported by DARPA (through the GARD program), CIFAR (through a Canada CIFAR AI Chair), Bosch Forschungsstiftung im Stifterverband, by NSERC (under the Discovery Program, and COHESA strategic research network), and by a gift from Intel. We also thank the Vector Institute’s sponsors. ", + "bbox": [ + 174, + 434, + 825, + 491 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "References ", + "text_level": 1, + "bbox": [ + 174, + 511, + 266, + 526 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "[1] R. Anderson. Security Engineering. John Wiley & Sons, 2020. \n[2] O. Bachem, M. Lucic, and A. Krause. Practical coreset constructions for machine learning, 2017. \n[3] R. Baeza-Yates. Bias on the web. Commun. ACM, 61(6):54–61, May 2018. \n[4] R. R. Bahadur. A Note on Quantiles in Large Samples. The Annals of Mathematical Statistics, 37(3):577 – 580, 1966. \n[5] Y. Bengio, J. Louradour, R. Collobert, and J. Weston. Curriculum learning. In Proceedings of the 26th Annual International Conference on Machine Learning, ICML ’09, page 41–48, New York, NY, USA, 2009. Association for Computing Machinery. \n[6] B. Biggio, I. Corona, D. Maiorca, B. Nelson, N. Šrndic, P. Laskov, G. Giacinto, and F. Roli. ´ Evasion attacks against machine learning at test time. In Joint European conference on machine learning and knowledge discovery in databases, pages 387–402. Springer, 2013. \n[7] H. Chen. Chapter 2. order statistics. http://www.math.ntu.edu.tw/\\~hchen/teaching/ LargeSample/notes/noteorder.pdf. \n[8] X. Chen, C. Liu, B. Li, K. Lu, and D. Song. Targeted backdoor attacks on deep learning systems using data poisoning. arXiv preprint arXiv:1712.05526, 2017. \n[9] D. A. Cohn, Z. Ghahramani, and M. I. Jordan. Active learning with statistical models. CoRR, cs.AI/9603104, 1996. \n[10] I. J. Goodfellow, J. Shlens, and C. Szegedy. Explaining and harnessing adversarial examples, 2015. \n[11] K. Grosse, T. A. Trost, M. Mosbach, M. Backes, and D. Klakow. On the security relevance of initial weights in deep neural networks. In I. Farkaš, P. Masulli, and S. Wermter, editors, Artificial Neural Networks and Machine Learning – ICANN 2020, pages 3–14, Cham, 2020. Springer International Publishing. \n[12] T. Gu, B. Dolan-Gavitt, and S. Garg. Badnets: Identifying vulnerabilities in the machine learning model supply chain. arXiv preprint arXiv:1708.06733, 2017. \n[13] G. Hacohen and D. Weinshall. On the power of curriculum learning in training deep networks. In K. Chaudhuri and R. Salakhutdinov, editors, Proceedings of the 36th International Conference on Machine Learning, volume 97 of Proceedings of Machine Learning Research, pages 2535– 2544. PMLR, 09–15 Jun 2019. \n[14] K. He, X. Zhang, S. Ren, and J. Sun. Deep residual learning for image recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 770– 778, 2016. \n[15] S. Hooker. Moving beyond “algorithmic bias is a data problem”. Patterns, 2(4):100241, 2021. \n[16] A. G. Howard, M. Zhu, B. Chen, D. Kalenichenko, W. Wang, T. Weyand, M. Andreetto, and H. Adam. Mobilenets: Efficient convolutional neural networks for mobile vision applications. arXiv preprint arXiv:1704.04861, 2017. \n[17] M. Jagielski, A. Oprea, B. Biggio, C. Liu, C. Nita-Rotaru, and B. Li. Manipulating machine learning: Poisoning attacks and countermeasures for regression learning. In 2018 IEEE Symposium on Security and Privacy (SP), pages 19–35. IEEE, 2018. \n[18] R. Johnson and T. Zhang. Accelerating stochastic gradient descent using predictive variance reduction. Advances in neural information processing systems, 26:315–323, 2013. \n[19] A. Krizhevsky, G. Hinton, et al. Learning multiple layers of features from tiny images. 2009. \n[20] M. Kumar, B. Packer, and D. Koller. Self-paced learning for latent variable models. In J. Lafferty, C. Williams, J. Shawe-Taylor, R. Zemel, and A. Culotta, editors, Advances in Neural Information Processing Systems, volume 23. Curran Associates, Inc., 2010. \n[21] Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner. Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998. \n[22] A. Madry, A. Makelov, L. Schmidt, D. Tsipras, and A. Vladu. Towards deep learning models resistant to adversarial attacks, 2019. \n[23] N. Mehrabi, F. Morstatter, N. Saxena, K. Lerman, and A. Galstyan. A survey on bias and fairness in machine learning. CoRR, abs/1908.09635, 2019. \n[24] N. Papernot, P. McDaniel, I. Goodfellow, S. Jha, Z. B. Celik, and A. Swami. Practical black-box attacks against machine learning. In Proceedings of the 2017 ACM on Asia conference on computer and communications security, pages 506–519, 2017. \n[25] B. Polyak. Some methods of speeding up the convergence of iteration methods. USSR Computational Mathematics and Mathematical Physics, 4(5):1–17, 1964. \n[26] M. Raginsky, A. Rakhlin, and M. Telgarsky. Non-convex learning via stochastic gradient langevin dynamics: a nonasymptotic analysis, 2017. \n[27] H. Robbins and S. Monro. A stochastic approximation method. The annals of mathematical statistics, pages 400–407, 1951. \n[28] A. Salem, R. Wen, M. Backes, S. Ma, and Y. Zhang. Dynamic backdoor attacks against machine learning models, 2020. \n[29] A. Shafahi, W. R. Huang, M. Najibi, O. Suciu, C. Studer, T. Dumitras, and T. Goldstein. Poison frogs! targeted clean-label poisoning attacks on neural networks. arXiv preprint arXiv:1804.00792, 2018. \n[30] I. Shumailov, Y. Zhao, D. Bates, N. Papernot, R. Mullins, and R. Anderson. Sponge examples: Energy-latency attacks on neural networks. In 6th IEEE European Symposium on Security and Privacy (EuroS&P), 2021. \n[31] S. L. Smith, B. Dherin, D. G. T. Barrett, and S. De. On the origin of implicit regularization in stochastic gradient descent, 2021. \n[32] M. Sun, S. Agarwal, and J. Z. Kolter. Poisoned classifiers are not only backdoored, they are fundamentally broken, 2020. \n[33] I. Sutskever, J. Martens, G. Dahl, and G. Hinton. On the importance of initialization and momentum in deep learning. In S. Dasgupta and D. McAllester, editors, Proceedings of the 30th International Conference on Machine Learning, volume 28 of Proceedings of Machine Learning Research, pages 1139–1147, Atlanta, Georgia, USA, 17–19 Jun 2013. PMLR. \n[34] C. Szegedy, W. Zaremba, I. Sutskever, J. Bruna, D. Erhan, I. Goodfellow, and R. Fergus. Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199, 2013. \n[35] S. Tong and D. Koller. Support vector machine active learning with applications to text classification. J. Mach. Learn. Res., 2:45–66, Mar. 2002. \n[36] L. Yu, K. Balasubramanian, S. Volgushev, and M. A. Erdogdu. An analysis of constant step size sgd in the non-convex regime: Asymptotic normality and bias, 2020. \n[37] X. Zhang, J. J. Zhao, and Y. LeCun. Character-level convolutional networks for text classification. In NIPS, 2015. ", + "bbox": [ + 179, + 535, + 828, + 911 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "", + "bbox": [ + 171, + 77, + 828, + 911 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "", + "bbox": [ + 169, + 88, + 828, + 428 + ], + "page_idx": 11 + } +] \ No newline at end of file diff --git a/parse/train/Z7xSQ3SXLQU/Z7xSQ3SXLQU_middle.json b/parse/train/Z7xSQ3SXLQU/Z7xSQ3SXLQU_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..179a7198df2dad26591aff4bd2e92c9047d1a0b2 --- /dev/null +++ b/parse/train/Z7xSQ3SXLQU/Z7xSQ3SXLQU_middle.json @@ -0,0 +1,27968 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 127, + 97, + 484, + 118 + ], + "lines": [ + { + "bbox": [ + 127, + 96, + 483, + 120 + ], + "spans": [ + { + "bbox": [ + 127, + 96, + 483, + 120 + ], + "score": 1.0, + "content": "Manipulating SGD with Data Ordering Attacks", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 285, + 159, + 387, + 192 + ], + "lines": [ + { + "bbox": [ + 293, + 158, + 379, + 172 + ], + "spans": [ + { + "bbox": [ + 293, + 158, + 379, + 172 + ], + "score": 1.0, + "content": "Zakhar Shumaylov", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 285, + 169, + 387, + 183 + ], + "spans": [ + { + "bbox": [ + 285, + 169, + 387, + 183 + ], + "score": 1.0, + "content": "University of Cambridge", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 295, + 182, + 377, + 193 + ], + "spans": [ + { + "bbox": [ + 295, + 182, + 377, + 193 + ], + "score": 1.0, + "content": "zs334@cam.ac.uk", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 113, + 159, + 275, + 203 + ], + "lines": [ + { + "bbox": [ + 161, + 159, + 226, + 172 + ], + "spans": [ + { + "bbox": [ + 161, + 159, + 226, + 172 + ], + "score": 1.0, + "content": "Ilia Shumailov", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 138, + 171, + 250, + 182 + ], + "spans": [ + { + "bbox": [ + 138, + 171, + 250, + 182 + ], + "score": 1.0, + "content": "University of Cambridge &", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 113, + 182, + 275, + 193 + ], + "spans": [ + { + "bbox": [ + 113, + 182, + 275, + 193 + ], + "score": 1.0, + "content": "University of Toronto & Vector Institute", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 122, + 192, + 266, + 204 + ], + "spans": [ + { + "bbox": [ + 122, + 192, + 266, + 204 + ], + "score": 1.0, + "content": "ilia.shumailov@cl.cam.ac.uk", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 397, + 159, + 498, + 193 + ], + "lines": [ + { + "bbox": [ + 410, + 159, + 485, + 171 + ], + "spans": [ + { + "bbox": [ + 410, + 159, + 485, + 171 + ], + "score": 1.0, + "content": "Dmitry Kazhdan", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 397, + 169, + 499, + 183 + ], + "spans": [ + { + "bbox": [ + 397, + 169, + 499, + 183 + ], + "score": 1.0, + "content": "University of Cambridge", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 407, + 181, + 488, + 194 + ], + "spans": [ + { + "bbox": [ + 407, + 181, + 488, + 194 + ], + "score": 1.0, + "content": "dk525@cam.ac.uk", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 147, + 220, + 270, + 254 + ], + "lines": [ + { + "bbox": [ + 183, + 219, + 235, + 233 + ], + "spans": [ + { + "bbox": [ + 183, + 219, + 235, + 233 + ], + "score": 1.0, + "content": "Yiren Zhao", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 158, + 230, + 260, + 243 + ], + "spans": [ + { + "bbox": [ + 158, + 230, + 260, + 243 + ], + "score": 1.0, + "content": "University of Cambridge", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 147, + 243, + 270, + 254 + ], + "spans": [ + { + "bbox": [ + 147, + 243, + 270, + 254 + ], + "score": 1.0, + "content": "yiren.zhao@cl.cam.ac.uk", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 314, + 221, + 463, + 264 + ], + "lines": [ + { + "bbox": [ + 352, + 219, + 427, + 234 + ], + "spans": [ + { + "bbox": [ + 352, + 219, + 427, + 234 + ], + "score": 1.0, + "content": "Nicolas Papernot", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 339, + 230, + 439, + 243 + ], + "spans": [ + { + "bbox": [ + 339, + 230, + 439, + 243 + ], + "score": 1.0, + "content": "University of Toronto &", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 358, + 243, + 421, + 254 + ], + "spans": [ + { + "bbox": [ + 358, + 243, + 421, + 254 + ], + "score": 1.0, + "content": "Vector Institute", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 314, + 254, + 464, + 265 + ], + "spans": [ + { + "bbox": [ + 314, + 254, + 464, + 265 + ], + "score": 1.0, + "content": "nicolas.papernot@utoronto.ca", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15.0 + }, + { + "type": "text", + "bbox": [ + 153, + 281, + 270, + 325 + ], + "lines": [ + { + "bbox": [ + 170, + 280, + 253, + 293 + ], + "spans": [ + { + "bbox": [ + 170, + 280, + 253, + 293 + ], + "score": 1.0, + "content": "Murat A. Erdogdu", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 161, + 291, + 261, + 305 + ], + "spans": [ + { + "bbox": [ + 161, + 291, + 261, + 305 + ], + "score": 1.0, + "content": "University of Toronto &", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 180, + 303, + 244, + 315 + ], + "spans": [ + { + "bbox": [ + 180, + 303, + 244, + 315 + ], + "score": 1.0, + "content": "Vector Institute", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 152, + 315, + 270, + 326 + ], + "spans": [ + { + "bbox": [ + 152, + 315, + 270, + 326 + ], + "score": 1.0, + "content": "erdogdu@cs.toronto.edu", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21.0 + }, + { + "type": "text", + "bbox": [ + 320, + 281, + 458, + 325 + ], + "lines": [ + { + "bbox": [ + 355, + 280, + 423, + 293 + ], + "spans": [ + { + "bbox": [ + 355, + 280, + 423, + 293 + ], + "score": 1.0, + "content": "Ross Anderson", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 333, + 292, + 445, + 304 + ], + "spans": [ + { + "bbox": [ + 333, + 292, + 445, + 304 + ], + "score": 1.0, + "content": "University of Cambridge &", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 340, + 303, + 439, + 315 + ], + "spans": [ + { + "bbox": [ + 340, + 303, + 439, + 315 + ], + "score": 1.0, + "content": "University of Edinburgh", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 319, + 315, + 459, + 326 + ], + "spans": [ + { + "bbox": [ + 319, + 315, + 459, + 326 + ], + "score": 1.0, + "content": "ross.anderson@cl.cam.ac.uk", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22.0 + }, + { + "type": "title", + "bbox": [ + 283, + 354, + 328, + 367 + ], + "lines": [ + { + "bbox": [ + 281, + 353, + 330, + 369 + ], + "spans": [ + { + "bbox": [ + 281, + 353, + 330, + 369 + ], + "score": 1.0, + "content": "Abstract", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 143, + 380, + 469, + 522 + ], + "lines": [ + { + "bbox": [ + 142, + 380, + 470, + 392 + ], + "spans": [ + { + "bbox": [ + 142, + 380, + 470, + 392 + ], + "score": 1.0, + "content": "Machine learning is vulnerable to a wide variety of attacks. It is now well under-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 141, + 390, + 469, + 403 + ], + "spans": [ + { + "bbox": [ + 141, + 390, + 469, + 403 + ], + "score": 1.0, + "content": "stood that by changing the underlying data distribution, an adversary can poison", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 141, + 401, + 470, + 414 + ], + "spans": [ + { + "bbox": [ + 141, + 401, + 470, + 414 + ], + "score": 1.0, + "content": "the model trained with it or introduce backdoors. In this paper we present a novel", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 413, + 470, + 425 + ], + "spans": [ + { + "bbox": [ + 141, + 413, + 470, + 425 + ], + "score": 1.0, + "content": "class of training-time attacks that require no changes to the underlying dataset or", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 141, + 423, + 469, + 435 + ], + "spans": [ + { + "bbox": [ + 141, + 423, + 469, + 435 + ], + "score": 1.0, + "content": "model architecture, but instead only change the order in which data are supplied to", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 141, + 434, + 469, + 446 + ], + "spans": [ + { + "bbox": [ + 141, + 434, + 469, + 446 + ], + "score": 1.0, + "content": "the model. In particular, we find that the attacker can either prevent the model from", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 141, + 446, + 470, + 457 + ], + "spans": [ + { + "bbox": [ + 141, + 446, + 470, + 457 + ], + "score": 1.0, + "content": "learning, or poison it to learn behaviours specified by the attacker. Furthermore,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 141, + 456, + 470, + 469 + ], + "spans": [ + { + "bbox": [ + 141, + 456, + 470, + 469 + ], + "score": 1.0, + "content": "we find that even a single adversarially-ordered epoch can be enough to slow down", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 141, + 468, + 469, + 479 + ], + "spans": [ + { + "bbox": [ + 141, + 468, + 469, + 479 + ], + "score": 1.0, + "content": "model learning, or even to reset all of the learning progress. Indeed, the attacks", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 141, + 478, + 470, + 489 + ], + "spans": [ + { + "bbox": [ + 141, + 478, + 470, + 489 + ], + "score": 1.0, + "content": "presented here are not specific to the model or dataset, but rather target the stochas-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 141, + 489, + 469, + 501 + ], + "spans": [ + { + "bbox": [ + 141, + 489, + 469, + 501 + ], + "score": 1.0, + "content": "tic nature of modern learning procedures. We extensively evaluate our attacks on", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 141, + 500, + 469, + 513 + ], + "spans": [ + { + "bbox": [ + 141, + 500, + 469, + 513 + ], + "score": 1.0, + "content": "computer vision and natural language benchmarks to find that the adversary can", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 142, + 511, + 357, + 523 + ], + "spans": [ + { + "bbox": [ + 142, + 511, + 357, + 523 + ], + "score": 1.0, + "content": "disrupt model training and even introduce backdoors.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 33 + }, + { + "type": "title", + "bbox": [ + 107, + 544, + 190, + 558 + ], + "lines": [ + { + "bbox": [ + 105, + 543, + 192, + 560 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 192, + 560 + ], + "score": 1.0, + "content": "1 Introduction", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 107, + 570, + 505, + 647 + ], + "lines": [ + { + "bbox": [ + 105, + 570, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 570, + 505, + 583 + ], + "score": 1.0, + "content": "The data-driven nature of modern machine learning (ML) training routines puts pressure on data", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 581, + 506, + 594 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 506, + 594 + ], + "score": 1.0, + "content": "supply pipelines, which become increasingly more complex. It is common to find separate disks", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 592, + 505, + 604 + ], + "spans": [ + { + "bbox": [ + 105, + 592, + 505, + 604 + ], + "score": 1.0, + "content": "or whole content distribution networks dedicated to servicing massive datasets. Training is often", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 603, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 603, + 505, + 616 + ], + "score": 1.0, + "content": "distributed across multiple workers. This emergent complexity gives a perfect opportunity for an", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 613, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 505, + 627 + ], + "score": 1.0, + "content": "attacker to disrupt ML training, while remaining covert. In the case of stochastic gradient descent", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 624, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 505, + 637 + ], + "score": 1.0, + "content": "(SGD), it assumes uniform random sampling of items from the training dataset, yet in practice this", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 635, + 450, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 450, + 649 + ], + "score": 1.0, + "content": "randomness is rarely tested or enforced. Here, we focus on adversarial data sampling.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44 + }, + { + "type": "text", + "bbox": [ + 107, + 652, + 505, + 685 + ], + "lines": [ + { + "bbox": [ + 105, + 651, + 506, + 665 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 506, + 665 + ], + "score": 1.0, + "content": "It is now well known that malicious actors can poison data and introduce backdoors, forcing ML", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 663, + 505, + 675 + ], + "spans": [ + { + "bbox": [ + 106, + 663, + 505, + 675 + ], + "score": 1.0, + "content": "models to behave differently in the presence of triggers [12]. While such attacks have been shown to", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 673, + 487, + 687 + ], + "spans": [ + { + "bbox": [ + 105, + 673, + 487, + 687 + ], + "score": 1.0, + "content": "pose a real threat, they have so far required the attacker to perturb the dataset used for training.", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 49 + }, + { + "type": "text", + "bbox": [ + 107, + 690, + 503, + 713 + ], + "lines": [ + { + "bbox": [ + 105, + 689, + 506, + 704 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 506, + 704 + ], + "score": 1.0, + "content": "We now show that by simply changing the order in which batches or data points are supplied to a", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 106, + 702, + 505, + 714 + ], + "spans": [ + { + "bbox": [ + 106, + 702, + 505, + 714 + ], + "score": 1.0, + "content": "model during training, an attacker can affect model behaviour. More precisely, we show that it is", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 51.5 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 731, + 385, + 741 + ], + "lines": [ + { + "bbox": [ + 105, + 730, + 387, + 744 + ], + "spans": [ + { + "bbox": [ + 105, + 730, + 387, + 744 + ], + "score": 1.0, + "content": "35th Conference on Neural Information Processing Systems (NeurIPS 2021).", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 127, + 97, + 484, + 118 + ], + "lines": [ + { + "bbox": [ + 127, + 96, + 483, + 120 + ], + "spans": [ + { + "bbox": [ + 127, + 96, + 483, + 120 + ], + "score": 1.0, + "content": "Manipulating SGD with Data Ordering Attacks", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 285, + 159, + 387, + 192 + ], + "lines": [ + { + "bbox": [ + 293, + 158, + 379, + 172 + ], + "spans": [ + { + "bbox": [ + 293, + 158, + 379, + 172 + ], + "score": 1.0, + "content": "Zakhar Shumaylov", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 285, + 169, + 387, + 183 + ], + "spans": [ + { + "bbox": [ + 285, + 169, + 387, + 183 + ], + "score": 1.0, + "content": "University of Cambridge", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 295, + 182, + 377, + 193 + ], + "spans": [ + { + "bbox": [ + 295, + 182, + 377, + 193 + ], + "score": 1.0, + "content": "zs334@cam.ac.uk", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5, + "bbox_fs": [ + 285, + 158, + 387, + 193 + ] + }, + { + "type": "text", + "bbox": [ + 113, + 159, + 275, + 203 + ], + "lines": [ + { + "bbox": [ + 161, + 159, + 226, + 172 + ], + "spans": [ + { + "bbox": [ + 161, + 159, + 226, + 172 + ], + "score": 1.0, + "content": "Ilia Shumailov", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 138, + 171, + 250, + 182 + ], + "spans": [ + { + "bbox": [ + 138, + 171, + 250, + 182 + ], + "score": 1.0, + "content": "University of Cambridge &", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 113, + 182, + 275, + 193 + ], + "spans": [ + { + "bbox": [ + 113, + 182, + 275, + 193 + ], + "score": 1.0, + "content": "University of Toronto & Vector Institute", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 122, + 192, + 266, + 204 + ], + "spans": [ + { + "bbox": [ + 122, + 192, + 266, + 204 + ], + "score": 1.0, + "content": "ilia.shumailov@cl.cam.ac.uk", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 5.5, + "bbox_fs": [ + 113, + 159, + 275, + 204 + ] + }, + { + "type": "text", + "bbox": [ + 397, + 159, + 498, + 193 + ], + "lines": [ + { + "bbox": [ + 410, + 159, + 485, + 171 + ], + "spans": [ + { + "bbox": [ + 410, + 159, + 485, + 171 + ], + "score": 1.0, + "content": "Dmitry Kazhdan", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 397, + 169, + 499, + 183 + ], + "spans": [ + { + "bbox": [ + 397, + 169, + 499, + 183 + ], + "score": 1.0, + "content": "University of Cambridge", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 407, + 181, + 488, + 194 + ], + "spans": [ + { + "bbox": [ + 407, + 181, + 488, + 194 + ], + "score": 1.0, + "content": "dk525@cam.ac.uk", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6, + "bbox_fs": [ + 397, + 159, + 499, + 194 + ] + }, + { + "type": "text", + "bbox": [ + 147, + 220, + 270, + 254 + ], + "lines": [ + { + "bbox": [ + 183, + 219, + 235, + 233 + ], + "spans": [ + { + "bbox": [ + 183, + 219, + 235, + 233 + ], + "score": 1.0, + "content": "Yiren Zhao", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 158, + 230, + 260, + 243 + ], + "spans": [ + { + "bbox": [ + 158, + 230, + 260, + 243 + ], + "score": 1.0, + "content": "University of Cambridge", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 147, + 243, + 270, + 254 + ], + "spans": [ + { + "bbox": [ + 147, + 243, + 270, + 254 + ], + "score": 1.0, + "content": "yiren.zhao@cl.cam.ac.uk", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13, + "bbox_fs": [ + 147, + 219, + 270, + 254 + ] + }, + { + "type": "text", + "bbox": [ + 314, + 221, + 463, + 264 + ], + "lines": [ + { + "bbox": [ + 352, + 219, + 427, + 234 + ], + "spans": [ + { + "bbox": [ + 352, + 219, + 427, + 234 + ], + "score": 1.0, + "content": "Nicolas Papernot", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 339, + 230, + 439, + 243 + ], + "spans": [ + { + "bbox": [ + 339, + 230, + 439, + 243 + ], + "score": 1.0, + "content": "University of Toronto &", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 358, + 243, + 421, + 254 + ], + "spans": [ + { + "bbox": [ + 358, + 243, + 421, + 254 + ], + "score": 1.0, + "content": "Vector Institute", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 314, + 254, + 464, + 265 + ], + "spans": [ + { + "bbox": [ + 314, + 254, + 464, + 265 + ], + "score": 1.0, + "content": "nicolas.papernot@utoronto.ca", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15.0, + "bbox_fs": [ + 314, + 219, + 464, + 265 + ] + }, + { + "type": "text", + "bbox": [ + 153, + 281, + 270, + 325 + ], + "lines": [ + { + "bbox": [ + 170, + 280, + 253, + 293 + ], + "spans": [ + { + "bbox": [ + 170, + 280, + 253, + 293 + ], + "score": 1.0, + "content": "Murat A. Erdogdu", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 161, + 291, + 261, + 305 + ], + "spans": [ + { + "bbox": [ + 161, + 291, + 261, + 305 + ], + "score": 1.0, + "content": "University of Toronto &", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 180, + 303, + 244, + 315 + ], + "spans": [ + { + "bbox": [ + 180, + 303, + 244, + 315 + ], + "score": 1.0, + "content": "Vector Institute", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 152, + 315, + 270, + 326 + ], + "spans": [ + { + "bbox": [ + 152, + 315, + 270, + 326 + ], + "score": 1.0, + "content": "erdogdu@cs.toronto.edu", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21.0, + "bbox_fs": [ + 152, + 280, + 270, + 326 + ] + }, + { + "type": "text", + "bbox": [ + 320, + 281, + 458, + 325 + ], + "lines": [ + { + "bbox": [ + 355, + 280, + 423, + 293 + ], + "spans": [ + { + "bbox": [ + 355, + 280, + 423, + 293 + ], + "score": 1.0, + "content": "Ross Anderson", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 333, + 292, + 445, + 304 + ], + "spans": [ + { + "bbox": [ + 333, + 292, + 445, + 304 + ], + "score": 1.0, + "content": "University of Cambridge &", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 340, + 303, + 439, + 315 + ], + "spans": [ + { + "bbox": [ + 340, + 303, + 439, + 315 + ], + "score": 1.0, + "content": "University of Edinburgh", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 319, + 315, + 459, + 326 + ], + "spans": [ + { + "bbox": [ + 319, + 315, + 459, + 326 + ], + "score": 1.0, + "content": "ross.anderson@cl.cam.ac.uk", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22.0, + "bbox_fs": [ + 319, + 280, + 459, + 326 + ] + }, + { + "type": "title", + "bbox": [ + 283, + 354, + 328, + 367 + ], + "lines": [ + { + "bbox": [ + 281, + 353, + 330, + 369 + ], + "spans": [ + { + "bbox": [ + 281, + 353, + 330, + 369 + ], + "score": 1.0, + "content": "Abstract", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 143, + 380, + 469, + 522 + ], + "lines": [ + { + "bbox": [ + 142, + 380, + 470, + 392 + ], + "spans": [ + { + "bbox": [ + 142, + 380, + 470, + 392 + ], + "score": 1.0, + "content": "Machine learning is vulnerable to a wide variety of attacks. It is now well under-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 141, + 390, + 469, + 403 + ], + "spans": [ + { + "bbox": [ + 141, + 390, + 469, + 403 + ], + "score": 1.0, + "content": "stood that by changing the underlying data distribution, an adversary can poison", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 141, + 401, + 470, + 414 + ], + "spans": [ + { + "bbox": [ + 141, + 401, + 470, + 414 + ], + "score": 1.0, + "content": "the model trained with it or introduce backdoors. In this paper we present a novel", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 413, + 470, + 425 + ], + "spans": [ + { + "bbox": [ + 141, + 413, + 470, + 425 + ], + "score": 1.0, + "content": "class of training-time attacks that require no changes to the underlying dataset or", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 141, + 423, + 469, + 435 + ], + "spans": [ + { + "bbox": [ + 141, + 423, + 469, + 435 + ], + "score": 1.0, + "content": "model architecture, but instead only change the order in which data are supplied to", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 141, + 434, + 469, + 446 + ], + "spans": [ + { + "bbox": [ + 141, + 434, + 469, + 446 + ], + "score": 1.0, + "content": "the model. In particular, we find that the attacker can either prevent the model from", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 141, + 446, + 470, + 457 + ], + "spans": [ + { + "bbox": [ + 141, + 446, + 470, + 457 + ], + "score": 1.0, + "content": "learning, or poison it to learn behaviours specified by the attacker. Furthermore,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 141, + 456, + 470, + 469 + ], + "spans": [ + { + "bbox": [ + 141, + 456, + 470, + 469 + ], + "score": 1.0, + "content": "we find that even a single adversarially-ordered epoch can be enough to slow down", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 141, + 468, + 469, + 479 + ], + "spans": [ + { + "bbox": [ + 141, + 468, + 469, + 479 + ], + "score": 1.0, + "content": "model learning, or even to reset all of the learning progress. Indeed, the attacks", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 141, + 478, + 470, + 489 + ], + "spans": [ + { + "bbox": [ + 141, + 478, + 470, + 489 + ], + "score": 1.0, + "content": "presented here are not specific to the model or dataset, but rather target the stochas-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 141, + 489, + 469, + 501 + ], + "spans": [ + { + "bbox": [ + 141, + 489, + 469, + 501 + ], + "score": 1.0, + "content": "tic nature of modern learning procedures. We extensively evaluate our attacks on", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 141, + 500, + 469, + 513 + ], + "spans": [ + { + "bbox": [ + 141, + 500, + 469, + 513 + ], + "score": 1.0, + "content": "computer vision and natural language benchmarks to find that the adversary can", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 142, + 511, + 357, + 523 + ], + "spans": [ + { + "bbox": [ + 142, + 511, + 357, + 523 + ], + "score": 1.0, + "content": "disrupt model training and even introduce backdoors.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 33, + "bbox_fs": [ + 141, + 380, + 470, + 523 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 544, + 190, + 558 + ], + "lines": [ + { + "bbox": [ + 105, + 543, + 192, + 560 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 192, + 560 + ], + "score": 1.0, + "content": "1 Introduction", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 107, + 570, + 505, + 647 + ], + "lines": [ + { + "bbox": [ + 105, + 570, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 570, + 505, + 583 + ], + "score": 1.0, + "content": "The data-driven nature of modern machine learning (ML) training routines puts pressure on data", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 581, + 506, + 594 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 506, + 594 + ], + "score": 1.0, + "content": "supply pipelines, which become increasingly more complex. It is common to find separate disks", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 592, + 505, + 604 + ], + "spans": [ + { + "bbox": [ + 105, + 592, + 505, + 604 + ], + "score": 1.0, + "content": "or whole content distribution networks dedicated to servicing massive datasets. Training is often", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 603, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 603, + 505, + 616 + ], + "score": 1.0, + "content": "distributed across multiple workers. This emergent complexity gives a perfect opportunity for an", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 613, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 505, + 627 + ], + "score": 1.0, + "content": "attacker to disrupt ML training, while remaining covert. In the case of stochastic gradient descent", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 624, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 505, + 637 + ], + "score": 1.0, + "content": "(SGD), it assumes uniform random sampling of items from the training dataset, yet in practice this", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 635, + 450, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 450, + 649 + ], + "score": 1.0, + "content": "randomness is rarely tested or enforced. Here, we focus on adversarial data sampling.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44, + "bbox_fs": [ + 105, + 570, + 506, + 649 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 652, + 505, + 685 + ], + "lines": [ + { + "bbox": [ + 105, + 651, + 506, + 665 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 506, + 665 + ], + "score": 1.0, + "content": "It is now well known that malicious actors can poison data and introduce backdoors, forcing ML", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 663, + 505, + 675 + ], + "spans": [ + { + "bbox": [ + 106, + 663, + 505, + 675 + ], + "score": 1.0, + "content": "models to behave differently in the presence of triggers [12]. While such attacks have been shown to", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 673, + 487, + 687 + ], + "spans": [ + { + "bbox": [ + 105, + 673, + 487, + 687 + ], + "score": 1.0, + "content": "pose a real threat, they have so far required the attacker to perturb the dataset used for training.", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 49, + "bbox_fs": [ + 105, + 651, + 506, + 687 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 690, + 503, + 713 + ], + "lines": [ + { + "bbox": [ + 105, + 689, + 506, + 704 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 506, + 704 + ], + "score": 1.0, + "content": "We now show that by simply changing the order in which batches or data points are supplied to a", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 106, + 702, + 505, + 714 + ], + "spans": [ + { + "bbox": [ + 106, + 702, + 505, + 714 + ], + "score": 1.0, + "content": "model during training, an attacker can affect model behaviour. More precisely, we show that it is", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 105, + 171, + 506, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 506, + 183 + ], + "score": 1.0, + "content": "possible to perform integrity and availability attacks without adding or modifying any data points. For", + "type": "text", + "cross_page": true + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 182, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 106, + 182, + 505, + 194 + ], + "score": 1.0, + "content": "integrity, an attacker can reduce model accuracy or arbitrarily control its predictions in the presence", + "type": "text", + "cross_page": true + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 192, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 505, + 205 + ], + "score": 1.0, + "content": "of particular triggers. For availability, an attacker can increase the amount of time it takes for the", + "type": "text", + "cross_page": true + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 203, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 505, + 216 + ], + "score": 1.0, + "content": "model to train, or even reset the learning progress, forcing the model parameters into a meaningless", + "type": "text", + "cross_page": true + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 214, + 131, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 131, + 226 + ], + "score": 1.0, + "content": "state.", + "type": "text", + "cross_page": true + } + ], + "index": 8 + } + ], + "index": 51.5, + "bbox_fs": [ + 105, + 689, + 506, + 714 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 126, + 70, + 483, + 133 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 126, + 70, + 483, + 133 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 126, + 70, + 483, + 133 + ], + "spans": [ + { + "bbox": [ + 126, + 70, + 483, + 133 + ], + "score": 0.979, + "html": "
AttackDataset knowledgeModel knowledgeModelspecificChangingdatasetAdding dataAddingperturbations
Batch ReorderX
Batch ReshuffleXXXXXX
Batch ReplaceXXXXXX
Adversarial initialisation [11]×√XX
BadNets [12]XXX×
Dynamic triggers [28]√√XX√
Poisoned frogs [32]√X√X√
", + "type": "table", + "image_path": "1633634a5bd43d408c7df5cc7dd7f1129277611b954c09cfdc010c7d071967d3.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 126, + 70, + 483, + 91.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 126, + 91.0, + 483, + 112.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 126, + 112.0, + 483, + 133.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_footnote", + "bbox": [ + 146, + 138, + 463, + 150 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 146, + 137, + 464, + 152 + ], + "spans": [ + { + "bbox": [ + 146, + 137, + 464, + 152 + ], + "score": 1.0, + "content": "Table 1: Taxonomy of training time attacks. In green, we highlight our attacks.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "text", + "bbox": [ + 107, + 171, + 505, + 225 + ], + "lines": [ + { + "bbox": [ + 105, + 171, + 506, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 506, + 183 + ], + "score": 1.0, + "content": "possible to perform integrity and availability attacks without adding or modifying any data points. For", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 182, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 106, + 182, + 505, + 194 + ], + "score": 1.0, + "content": "integrity, an attacker can reduce model accuracy or arbitrarily control its predictions in the presence", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 192, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 505, + 205 + ], + "score": 1.0, + "content": "of particular triggers. For availability, an attacker can increase the amount of time it takes for the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 203, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 505, + 216 + ], + "score": 1.0, + "content": "model to train, or even reset the learning progress, forcing the model parameters into a meaningless", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 214, + 131, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 131, + 226 + ], + "score": 1.0, + "content": "state.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 107, + 231, + 506, + 351 + ], + "lines": [ + { + "bbox": [ + 105, + 229, + 507, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 229, + 507, + 245 + ], + "score": 1.0, + "content": "We present three different types of attacks that exploit Batch Reordering, Reshuffling and Replacing –", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 241, + 506, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 241, + 506, + 255 + ], + "score": 1.0, + "content": "naming them BRRR attacks. We show that an attacker can significantly change model performance by", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 252, + 506, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 506, + 266 + ], + "score": 1.0, + "content": "(i) changing the order in which batches are supplied to models during training; (ii) changing the order", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 264, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 106, + 264, + 505, + 276 + ], + "score": 1.0, + "content": "in which individual data points are supplied to models during training; and (iii) replacing datapoints", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 273, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 506, + 288 + ], + "score": 1.0, + "content": "from batches with other points from the dataset to promote specific data biases. Furthermore, we", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 284, + 506, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 506, + 298 + ], + "score": 1.0, + "content": "introduce Batch-Order Poison (BOP) and Batch-Order Backdoor (BOB), the first techniques that", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 295, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 506, + 309 + ], + "score": 1.0, + "content": "enable poisoning and backdooring of neural networks using only clean data and clean labels; an", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 307, + 507, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 507, + 320 + ], + "score": 1.0, + "content": "attacker can control the parameter update of a model by appropriate choice of benign datapoints.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 318, + 506, + 330 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 506, + 330 + ], + "score": 1.0, + "content": "Importantly, BRRR attacks require no underlying model access or knowledge of the dataset. Instead,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 329, + 506, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 329, + 506, + 342 + ], + "score": 1.0, + "content": "they focus on the stochasticity of gradient descent, disrupting how well individual batches approximate", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 340, + 309, + 352 + ], + "spans": [ + { + "bbox": [ + 106, + 340, + 309, + 352 + ], + "score": 1.0, + "content": "the true distribution that a model is trying to learn.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 356, + 369, + 367 + ], + "lines": [ + { + "bbox": [ + 105, + 354, + 370, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 370, + 370 + ], + "score": 1.0, + "content": "To summarise, we make the following contributions in this paper:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 133, + 377, + 505, + 516 + ], + "lines": [ + { + "bbox": [ + 132, + 376, + 505, + 389 + ], + "spans": [ + { + "bbox": [ + 132, + 376, + 505, + 389 + ], + "score": 1.0, + "content": "• We present a novel class of attacks on ML models that target the data batching procedure", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 142, + 388, + 505, + 400 + ], + "spans": [ + { + "bbox": [ + 142, + 388, + 505, + 400 + ], + "score": 1.0, + "content": "used during training, affecting their integrity and availability. We present a theoretical", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 399, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 141, + 399, + 505, + 412 + ], + "score": 1.0, + "content": "analysis explaining how and why these attacks work, showing that they target fundamental", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 410, + 470, + 422 + ], + "spans": [ + { + "bbox": [ + 141, + 410, + 470, + 422 + ], + "score": 1.0, + "content": "assumptions of stochastic learning, and are therefore model and dataset agnostic1.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 133, + 424, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 133, + 424, + 505, + 437 + ], + "score": 1.0, + "content": "• We evaluate these attacks on a set of common computer vision and language benchmarks,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 435, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 141, + 435, + 505, + 448 + ], + "score": 1.0, + "content": "using a range of different hyper-parameter configurations, and find that an attacker can slow", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 141, + 447, + 472, + 459 + ], + "spans": [ + { + "bbox": [ + 141, + 447, + 472, + 459 + ], + "score": 1.0, + "content": "the progress of training, as well as reset it, with just a single epoch of intervention.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 132, + 459, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 132, + 459, + 505, + 474 + ], + "score": 1.0, + "content": "• We show that data order can poison models and introduce backdoors, even in a blackbox", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 141, + 472, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 141, + 472, + 505, + 484 + ], + "score": 1.0, + "content": "setup. For a whitebox setup, we find that the adversary can introduce backdoors almost as", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 482, + 505, + 494 + ], + "spans": [ + { + "bbox": [ + 141, + 482, + 505, + 494 + ], + "score": 1.0, + "content": "well as if they used perturbed data. While a baseline CIFAR10 VGG16 model that uses", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 141, + 493, + 506, + 506 + ], + "spans": [ + { + "bbox": [ + 141, + 493, + 222, + 506 + ], + "score": 1.0, + "content": "perturbed data gets", + "type": "text" + }, + { + "bbox": [ + 222, + 493, + 242, + 504 + ], + "score": 0.87, + "content": "{ \\bar { 9 } } 9 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 493, + 444, + 506 + ], + "score": 1.0, + "content": "trigger accuracy, the whitebox BOB attacker gets", + "type": "text" + }, + { + "bbox": [ + 445, + 493, + 487, + 505 + ], + "score": 0.89, + "content": "9 1 \\% \\pm 1 3", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 493, + 506, + 506 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 141, + 505, + 335, + 516 + ], + "spans": [ + { + "bbox": [ + 141, + 505, + 289, + 516 + ], + "score": 1.0, + "content": "the blackbox BOB attacker achieves", + "type": "text" + }, + { + "bbox": [ + 289, + 505, + 331, + 516 + ], + "score": 0.91, + "content": "6 8 \\% \\pm 1 9", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 505, + 335, + 516 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 26.5 + }, + { + "type": "title", + "bbox": [ + 107, + 531, + 197, + 544 + ], + "lines": [ + { + "bbox": [ + 105, + 530, + 198, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 198, + 546 + ], + "score": 1.0, + "content": "2 Related Work", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 555, + 505, + 622 + ], + "lines": [ + { + "bbox": [ + 105, + 555, + 505, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 569 + ], + "score": 1.0, + "content": "Attacks on integrity: Szegedy et al. [34] and Biggio et al. [6] concurrently discovered the existence", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 567, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 505, + 579 + ], + "score": 1.0, + "content": "of adversarial examples. These samples, containing human imperceptible perturbations, cause models", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 576, + 506, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 506, + 591 + ], + "score": 1.0, + "content": "to output incorrect results during inference. The original whitebox attacks require the adversary to", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 590, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 590, + 505, + 601 + ], + "score": 1.0, + "content": "access the models and use gradient information to perform conditioned optimisation to maximise the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 600, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 611 + ], + "score": 1.0, + "content": "model loss [34, 6, 10, 22]. The attack later generalised to blackbox setups, where the adversary trains", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 610, + 491, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 610, + 491, + 623 + ], + "score": 1.0, + "content": "a surrogate model and hopes the generated adversarial samples transfer to the target model [24].", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 36.5 + }, + { + "type": "text", + "bbox": [ + 107, + 627, + 505, + 704 + ], + "lines": [ + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "The data-poisoning attack aims at using data manipulation to cause DNNs to fail on specific test-time", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 636, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 505, + 651 + ], + "score": 1.0, + "content": "instances [17]. Chen et al. demonstrated that manipulation of the labels of around 50 training samples", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 648, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 505, + 661 + ], + "score": 1.0, + "content": "is enough to trigger failure [8]. Gu et al. showed that attackers can associate adversarial patterns with", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 658, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 658, + 506, + 673 + ], + "score": 1.0, + "content": "labelled images and cause DNNs to overfit to this pattern [12]. Shafahi et al. launched a poisoning", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 670, + 505, + 683 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 505, + 683 + ], + "score": 1.0, + "content": "attack using instances with clean labels [29]. A number of other works have since created more", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 682, + 506, + 693 + ], + "spans": [ + { + "bbox": [ + 106, + 682, + 506, + 693 + ], + "score": 1.0, + "content": "efficient triggers [28]. It was a common belief that poisoning attacks on DNNs have to contain a", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 691, + 506, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 506, + 705 + ], + "score": 1.0, + "content": "certain level of malicious manipulation of whether the data or label at train time. However, this paper", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 43 + } + ], + "page_idx": 1, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 118, + 712, + 445, + 722 + ], + "lines": [ + { + "bbox": [ + 119, + 709, + 447, + 724 + ], + "spans": [ + { + "bbox": [ + 119, + 709, + 447, + 724 + ], + "score": 1.0, + "content": "1Codebase is available here: https://github.com/iliaishacked/sgd_datareorder", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 742, + 308, + 750 + ], + "lines": [ + { + "bbox": [ + 302, + 741, + 310, + 753 + ], + "spans": [ + { + "bbox": [ + 302, + 741, + 310, + 753 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 12, + "width": 8 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 126, + 70, + 483, + 133 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 126, + 70, + 483, + 133 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 126, + 70, + 483, + 133 + ], + "spans": [ + { + "bbox": [ + 126, + 70, + 483, + 133 + ], + "score": 0.979, + "html": "
AttackDataset knowledgeModel knowledgeModelspecificChangingdatasetAdding dataAddingperturbations
Batch ReorderX
Batch ReshuffleXXXXXX
Batch ReplaceXXXXXX
Adversarial initialisation [11]×√XX
BadNets [12]XXX×
Dynamic triggers [28]√√XX√
Poisoned frogs [32]√X√X√
", + "type": "table", + "image_path": "1633634a5bd43d408c7df5cc7dd7f1129277611b954c09cfdc010c7d071967d3.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 126, + 70, + 483, + 91.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 126, + 91.0, + 483, + 112.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 126, + 112.0, + 483, + 133.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_footnote", + "bbox": [ + 146, + 138, + 463, + 150 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 146, + 137, + 464, + 152 + ], + "spans": [ + { + "bbox": [ + 146, + 137, + 464, + 152 + ], + "score": 1.0, + "content": "Table 1: Taxonomy of training time attacks. In green, we highlight our attacks.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "text", + "bbox": [ + 107, + 171, + 505, + 225 + ], + "lines": [], + "index": 6, + "bbox_fs": [ + 105, + 171, + 506, + 226 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 231, + 506, + 351 + ], + "lines": [ + { + "bbox": [ + 105, + 229, + 507, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 229, + 507, + 245 + ], + "score": 1.0, + "content": "We present three different types of attacks that exploit Batch Reordering, Reshuffling and Replacing –", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 241, + 506, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 241, + 506, + 255 + ], + "score": 1.0, + "content": "naming them BRRR attacks. We show that an attacker can significantly change model performance by", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 252, + 506, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 506, + 266 + ], + "score": 1.0, + "content": "(i) changing the order in which batches are supplied to models during training; (ii) changing the order", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 264, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 106, + 264, + 505, + 276 + ], + "score": 1.0, + "content": "in which individual data points are supplied to models during training; and (iii) replacing datapoints", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 273, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 506, + 288 + ], + "score": 1.0, + "content": "from batches with other points from the dataset to promote specific data biases. Furthermore, we", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 284, + 506, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 506, + 298 + ], + "score": 1.0, + "content": "introduce Batch-Order Poison (BOP) and Batch-Order Backdoor (BOB), the first techniques that", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 295, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 506, + 309 + ], + "score": 1.0, + "content": "enable poisoning and backdooring of neural networks using only clean data and clean labels; an", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 307, + 507, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 507, + 320 + ], + "score": 1.0, + "content": "attacker can control the parameter update of a model by appropriate choice of benign datapoints.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 318, + 506, + 330 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 506, + 330 + ], + "score": 1.0, + "content": "Importantly, BRRR attacks require no underlying model access or knowledge of the dataset. Instead,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 329, + 506, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 329, + 506, + 342 + ], + "score": 1.0, + "content": "they focus on the stochasticity of gradient descent, disrupting how well individual batches approximate", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 340, + 309, + 352 + ], + "spans": [ + { + "bbox": [ + 106, + 340, + 309, + 352 + ], + "score": 1.0, + "content": "the true distribution that a model is trying to learn.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 229, + 507, + 352 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 356, + 369, + 367 + ], + "lines": [ + { + "bbox": [ + 105, + 354, + 370, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 370, + 370 + ], + "score": 1.0, + "content": "To summarise, we make the following contributions in this paper:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 354, + 370, + 370 + ] + }, + { + "type": "text", + "bbox": [ + 133, + 377, + 505, + 516 + ], + "lines": [ + { + "bbox": [ + 132, + 376, + 505, + 389 + ], + "spans": [ + { + "bbox": [ + 132, + 376, + 505, + 389 + ], + "score": 1.0, + "content": "• We present a novel class of attacks on ML models that target the data batching procedure", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 142, + 388, + 505, + 400 + ], + "spans": [ + { + "bbox": [ + 142, + 388, + 505, + 400 + ], + "score": 1.0, + "content": "used during training, affecting their integrity and availability. We present a theoretical", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 399, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 141, + 399, + 505, + 412 + ], + "score": 1.0, + "content": "analysis explaining how and why these attacks work, showing that they target fundamental", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 410, + 470, + 422 + ], + "spans": [ + { + "bbox": [ + 141, + 410, + 470, + 422 + ], + "score": 1.0, + "content": "assumptions of stochastic learning, and are therefore model and dataset agnostic1.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 133, + 424, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 133, + 424, + 505, + 437 + ], + "score": 1.0, + "content": "• We evaluate these attacks on a set of common computer vision and language benchmarks,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 435, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 141, + 435, + 505, + 448 + ], + "score": 1.0, + "content": "using a range of different hyper-parameter configurations, and find that an attacker can slow", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 141, + 447, + 472, + 459 + ], + "spans": [ + { + "bbox": [ + 141, + 447, + 472, + 459 + ], + "score": 1.0, + "content": "the progress of training, as well as reset it, with just a single epoch of intervention.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 132, + 459, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 132, + 459, + 505, + 474 + ], + "score": 1.0, + "content": "• We show that data order can poison models and introduce backdoors, even in a blackbox", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 141, + 472, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 141, + 472, + 505, + 484 + ], + "score": 1.0, + "content": "setup. For a whitebox setup, we find that the adversary can introduce backdoors almost as", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 482, + 505, + 494 + ], + "spans": [ + { + "bbox": [ + 141, + 482, + 505, + 494 + ], + "score": 1.0, + "content": "well as if they used perturbed data. While a baseline CIFAR10 VGG16 model that uses", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 141, + 493, + 506, + 506 + ], + "spans": [ + { + "bbox": [ + 141, + 493, + 222, + 506 + ], + "score": 1.0, + "content": "perturbed data gets", + "type": "text" + }, + { + "bbox": [ + 222, + 493, + 242, + 504 + ], + "score": 0.87, + "content": "{ \\bar { 9 } } 9 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 493, + 444, + 506 + ], + "score": 1.0, + "content": "trigger accuracy, the whitebox BOB attacker gets", + "type": "text" + }, + { + "bbox": [ + 445, + 493, + 487, + 505 + ], + "score": 0.89, + "content": "9 1 \\% \\pm 1 3", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 493, + 506, + 506 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 141, + 505, + 335, + 516 + ], + "spans": [ + { + "bbox": [ + 141, + 505, + 289, + 516 + ], + "score": 1.0, + "content": "the blackbox BOB attacker achieves", + "type": "text" + }, + { + "bbox": [ + 289, + 505, + 331, + 516 + ], + "score": 0.91, + "content": "6 8 \\% \\pm 1 9", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 505, + 335, + 516 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 26.5, + "bbox_fs": [ + 132, + 376, + 506, + 516 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 531, + 197, + 544 + ], + "lines": [ + { + "bbox": [ + 105, + 530, + 198, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 198, + 546 + ], + "score": 1.0, + "content": "2 Related Work", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 555, + 505, + 622 + ], + "lines": [ + { + "bbox": [ + 105, + 555, + 505, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 569 + ], + "score": 1.0, + "content": "Attacks on integrity: Szegedy et al. [34] and Biggio et al. [6] concurrently discovered the existence", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 567, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 505, + 579 + ], + "score": 1.0, + "content": "of adversarial examples. These samples, containing human imperceptible perturbations, cause models", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 576, + 506, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 506, + 591 + ], + "score": 1.0, + "content": "to output incorrect results during inference. The original whitebox attacks require the adversary to", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 590, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 590, + 505, + 601 + ], + "score": 1.0, + "content": "access the models and use gradient information to perform conditioned optimisation to maximise the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 600, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 611 + ], + "score": 1.0, + "content": "model loss [34, 6, 10, 22]. The attack later generalised to blackbox setups, where the adversary trains", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 610, + 491, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 610, + 491, + 623 + ], + "score": 1.0, + "content": "a surrogate model and hopes the generated adversarial samples transfer to the target model [24].", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 555, + 506, + 623 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 627, + 505, + 704 + ], + "lines": [ + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "The data-poisoning attack aims at using data manipulation to cause DNNs to fail on specific test-time", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 636, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 505, + 651 + ], + "score": 1.0, + "content": "instances [17]. Chen et al. demonstrated that manipulation of the labels of around 50 training samples", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 648, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 505, + 661 + ], + "score": 1.0, + "content": "is enough to trigger failure [8]. Gu et al. showed that attackers can associate adversarial patterns with", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 658, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 658, + 506, + 673 + ], + "score": 1.0, + "content": "labelled images and cause DNNs to overfit to this pattern [12]. Shafahi et al. launched a poisoning", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 670, + 505, + 683 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 505, + 683 + ], + "score": 1.0, + "content": "attack using instances with clean labels [29]. A number of other works have since created more", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 682, + 506, + 693 + ], + "spans": [ + { + "bbox": [ + 106, + 682, + 506, + 693 + ], + "score": 1.0, + "content": "efficient triggers [28]. It was a common belief that poisoning attacks on DNNs have to contain a", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 691, + 506, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 506, + 705 + ], + "score": 1.0, + "content": "certain level of malicious manipulation of whether the data or label at train time. However, this paper", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 71, + 506, + 87 + ], + "spans": [ + { + "bbox": [ + 105, + 71, + 506, + 87 + ], + "score": 1.0, + "content": "shows how poisoning is possible with clean data and clean labels, with the only manipulation being", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 83, + 267, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 83, + 267, + 96 + ], + "score": 1.0, + "content": "of the batching process at training time.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 43, + "bbox_fs": [ + 105, + 627, + 506, + 705 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 73, + 504, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 71, + 506, + 87 + ], + "spans": [ + { + "bbox": [ + 105, + 71, + 506, + 87 + ], + "score": 1.0, + "content": "shows how poisoning is possible with clean data and clean labels, with the only manipulation being", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 83, + 267, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 83, + 267, + 96 + ], + "score": 1.0, + "content": "of the batching process at training time.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 100, + 505, + 177 + ], + "lines": [ + { + "bbox": [ + 106, + 100, + 505, + 112 + ], + "spans": [ + { + "bbox": [ + 106, + 100, + 505, + 112 + ], + "score": 1.0, + "content": "Attacks on availability: Shumailov et al. first attacked the availability of computer vision and", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 104, + 110, + 506, + 124 + ], + "spans": [ + { + "bbox": [ + 104, + 110, + 506, + 124 + ], + "score": 1.0, + "content": "natural language processing models at inference time with sponge examples [30]. They pessimized", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 122, + 506, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 506, + 134 + ], + "score": 1.0, + "content": "over energy utilisation and inference latency to target hardware and internal model optimisations.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "score": 1.0, + "content": "By contrast, this paper targets availability at training time. We show that the attacker can reset or", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 143, + 506, + 157 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 506, + 157 + ], + "score": 1.0, + "content": "slow down training progress by reordering or reshuffling natural batches. Finally, we note that unlike", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 155, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 155, + 506, + 167 + ], + "score": 1.0, + "content": "Shumailov et al., our attacks do not target specific optimisations in hardware or individual models,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 164, + 380, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 164, + 380, + 178 + ], + "score": 1.0, + "content": "but instead break the fundamental stochastic assumption of training.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 182, + 505, + 236 + ], + "lines": [ + { + "bbox": [ + 105, + 181, + 505, + 195 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 505, + 195 + ], + "score": 1.0, + "content": "Note on terminology: As we study attacks on training, we use the terms integrity and availability in", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 193, + 506, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 193, + 506, + 204 + ], + "score": 1.0, + "content": "a slightly different sense from the rest of the literature. By availability, we mean the availability of a", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 203, + 507, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 507, + 216 + ], + "score": 1.0, + "content": "training procedure – the rate at which the model trains, as opposed to model performance on the task.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 213, + 506, + 228 + ], + "spans": [ + { + "bbox": [ + 105, + 213, + 506, + 228 + ], + "score": 1.0, + "content": "By integrity attacks, we mean attacks that either stop the model from learning its intended task, or", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 225, + 285, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 285, + 237 + ], + "score": 1.0, + "content": "force it to learn an additional unrelated task.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11 + }, + { + "type": "title", + "bbox": [ + 107, + 253, + 192, + 266 + ], + "lines": [ + { + "bbox": [ + 104, + 250, + 194, + 271 + ], + "spans": [ + { + "bbox": [ + 104, + 250, + 194, + 271 + ], + "score": 1.0, + "content": "3 Methodology", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "title", + "bbox": [ + 107, + 278, + 189, + 290 + ], + "lines": [ + { + "bbox": [ + 105, + 277, + 190, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 190, + 291 + ], + "score": 1.0, + "content": "3.1 Threat model", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "image", + "bbox": [ + 173, + 303, + 439, + 415 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 173, + 303, + 439, + 415 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 173, + 303, + 439, + 415 + ], + "spans": [ + { + "bbox": [ + 173, + 303, + 439, + 415 + ], + "score": 0.969, + "type": "image", + "image_path": "7350808cdc653df8e4d2f8c68bb3e0851adb28912ef8969280821c54c3a3fc85.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 173, + 303, + 439, + 340.3333333333333 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 173, + 340.3333333333333, + 439, + 377.66666666666663 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 173, + 377.66666666666663, + 439, + 414.99999999999994 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 423, + 504, + 446 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 423, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 106, + 423, + 505, + 435 + ], + "score": 1.0, + "content": "Figure 1: The attacker reorders the benign randomly supplied data based on the surrogate model", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 434, + 497, + 446 + ], + "spans": [ + { + "bbox": [ + 106, + 434, + 497, + 446 + ], + "score": 1.0, + "content": "outputs. Attacker co-trains the surrogate model with the data that is supplied to the source model.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + } + ], + "index": 18.25 + }, + { + "type": "text", + "bbox": [ + 107, + 461, + 505, + 515 + ], + "lines": [ + { + "bbox": [ + 106, + 461, + 506, + 473 + ], + "spans": [ + { + "bbox": [ + 106, + 461, + 506, + 473 + ], + "score": 1.0, + "content": "We assume one of the strongest threat models currently described in the literature. In particular,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 470, + 506, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 506, + 484 + ], + "score": 1.0, + "content": "our blackbox attacker assumes no access to the model and no prior knowledge of the training data,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 482, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 106, + 482, + 506, + 495 + ], + "score": 1.0, + "content": "whereas a whitebox attacker has access to the model under attack and can compute its loss directly.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 492, + 505, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 505, + 506 + ], + "score": 1.0, + "content": "The attack specifically focuses on the batching part of the ML pipeline as is depicted in Figure 1. We", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 505, + 257, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 505, + 257, + 515 + ], + "score": 1.0, + "content": "discuss the related work in Section 2.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 520, + 505, + 620 + ], + "lines": [ + { + "bbox": [ + 106, + 521, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 521, + 505, + 533 + ], + "score": 1.0, + "content": "This attack is realistic and can be instantiated in several ways. The attack code can be infiltrated", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 531, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 506, + 545 + ], + "score": 1.0, + "content": "into: the operating system handing file system requests; the disk handling individual data accesses;", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 542, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 542, + 505, + 556 + ], + "score": 1.0, + "content": "the software that determines the way random data sampling is performed; the distributed storage", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 553, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 553, + 505, + 567 + ], + "score": 1.0, + "content": "manager; or the machine learning pipeline itself handling prefetch operations. That is a substantial", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 564, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 564, + 505, + 578 + ], + "score": 1.0, + "content": "attack surface, and for large models these components may be controlled by different principals. The", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 576, + 505, + 587 + ], + "spans": [ + { + "bbox": [ + 106, + 576, + 505, + 587 + ], + "score": 1.0, + "content": "attack is also very stealthy. The attacker does not add any noise or perturbation to the data. There", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 586, + 506, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 506, + 599 + ], + "score": 1.0, + "content": "are no triggers or backdoors introduced into the dataset. All of the data points are natural. In two of", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 596, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 505, + 610 + ], + "score": 1.0, + "content": "four variants the attacker uses the whole dataset and does not oversample any given point, i.e. the", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 608, + 473, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 473, + 621 + ], + "score": 1.0, + "content": "sampling is without replacement. This makes it difficult to deploy simple countermeasures.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 30 + }, + { + "type": "title", + "bbox": [ + 107, + 633, + 314, + 645 + ], + "lines": [ + { + "bbox": [ + 105, + 631, + 316, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 316, + 648 + ], + "score": 1.0, + "content": "3.2 Primer on stochastic learning and batching", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 107, + 654, + 505, + 724 + ], + "lines": [ + { + "bbox": [ + 106, + 653, + 504, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 653, + 497, + 667 + ], + "score": 1.0, + "content": "We assume that the defender is trying to train a deep neural network model with parameters", + "type": "text" + }, + { + "bbox": [ + 497, + 654, + 504, + 664 + ], + "score": 0.72, + "content": "\\theta", + "type": "inline_equation" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 665, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 665, + 167, + 677 + ], + "score": 1.0, + "content": "operating over", + "type": "text" + }, + { + "bbox": [ + 168, + 665, + 214, + 676 + ], + "score": 0.92, + "content": "X _ { i } \\sim { \\mathcal { X } } _ { \\mathrm { t r a i n } }", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 665, + 505, + 677 + ], + "score": 1.0, + "content": ", solving a non-convex optimization problem with respect to parameters", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 107, + 674, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 107, + 676, + 113, + 686 + ], + "score": 0.78, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 113, + 674, + 338, + 689 + ], + "score": 1.0, + "content": ", corresponding to minimization of a given loss function", + "type": "text" + }, + { + "bbox": [ + 339, + 676, + 359, + 687 + ], + "score": 0.91, + "content": "L ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 674, + 506, + 689 + ], + "score": 1.0, + "content": ". We will denote the training dataset", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 107, + 686, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 107, + 686, + 156, + 699 + ], + "score": 0.94, + "content": "X \\ = \\ \\{ X _ { i } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 686, + 505, + 699 + ], + "score": 1.0, + "content": ". We assume a commonly-used loss function defined as the sample average of the", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 697, + 506, + 710 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 224, + 710 + ], + "score": 1.0, + "content": "loss per training data point", + "type": "text" + }, + { + "bbox": [ + 225, + 697, + 302, + 709 + ], + "score": 0.91, + "content": "L _ { i } ( \\theta ) \\stackrel { \\cdot } { = } \\stackrel { \\cdot } { L } ( X _ { i } , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 697, + 316, + 710 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 317, + 698, + 324, + 707 + ], + "score": 0.81, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 697, + 483, + 710 + ], + "score": 1.0, + "content": "-th batch over the training set, where", + "type": "text" + }, + { + "bbox": [ + 484, + 698, + 493, + 707 + ], + "score": 0.8, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 697, + 506, + 710 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 104, + 707, + 507, + 726 + ], + "spans": [ + { + "bbox": [ + 104, + 707, + 170, + 726 + ], + "score": 1.0, + "content": "the batch size:", + "type": "text" + }, + { + "bbox": [ + 171, + 709, + 298, + 724 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\hat { L } _ { k + 1 } ( \\theta ) = \\frac { 1 } { B } \\sum _ { i = k B + 1 } ^ { k B + B } L _ { i } ( \\theta ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 707, + 341, + 726 + ], + "score": 1.0, + "content": ". If we let", + "type": "text" + }, + { + "bbox": [ + 341, + 711, + 368, + 721 + ], + "score": 0.89, + "content": "N \\cdot B", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 707, + 507, + 726 + ], + "score": 1.0, + "content": "be the total number of items for", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 38.5 + } + ], + "page_idx": 2, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 741, + 309, + 750 + ], + "lines": [ + { + "bbox": [ + 301, + 740, + 310, + 752 + ], + "spans": [ + { + "bbox": [ + 301, + 740, + 310, + 752 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 73, + 504, + 95 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 71, + 506, + 96 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 100, + 505, + 177 + ], + "lines": [ + { + "bbox": [ + 106, + 100, + 505, + 112 + ], + "spans": [ + { + "bbox": [ + 106, + 100, + 505, + 112 + ], + "score": 1.0, + "content": "Attacks on availability: Shumailov et al. first attacked the availability of computer vision and", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 104, + 110, + 506, + 124 + ], + "spans": [ + { + "bbox": [ + 104, + 110, + 506, + 124 + ], + "score": 1.0, + "content": "natural language processing models at inference time with sponge examples [30]. They pessimized", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 122, + 506, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 506, + 134 + ], + "score": 1.0, + "content": "over energy utilisation and inference latency to target hardware and internal model optimisations.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "score": 1.0, + "content": "By contrast, this paper targets availability at training time. We show that the attacker can reset or", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 143, + 506, + 157 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 506, + 157 + ], + "score": 1.0, + "content": "slow down training progress by reordering or reshuffling natural batches. Finally, we note that unlike", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 155, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 155, + 506, + 167 + ], + "score": 1.0, + "content": "Shumailov et al., our attacks do not target specific optimisations in hardware or individual models,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 164, + 380, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 164, + 380, + 178 + ], + "score": 1.0, + "content": "but instead break the fundamental stochastic assumption of training.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5, + "bbox_fs": [ + 104, + 100, + 506, + 178 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 182, + 505, + 236 + ], + "lines": [ + { + "bbox": [ + 105, + 181, + 505, + 195 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 505, + 195 + ], + "score": 1.0, + "content": "Note on terminology: As we study attacks on training, we use the terms integrity and availability in", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 193, + 506, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 193, + 506, + 204 + ], + "score": 1.0, + "content": "a slightly different sense from the rest of the literature. By availability, we mean the availability of a", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 203, + 507, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 507, + 216 + ], + "score": 1.0, + "content": "training procedure – the rate at which the model trains, as opposed to model performance on the task.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 213, + 506, + 228 + ], + "spans": [ + { + "bbox": [ + 105, + 213, + 506, + 228 + ], + "score": 1.0, + "content": "By integrity attacks, we mean attacks that either stop the model from learning its intended task, or", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 225, + 285, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 285, + 237 + ], + "score": 1.0, + "content": "force it to learn an additional unrelated task.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 181, + 507, + 237 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 253, + 192, + 266 + ], + "lines": [ + { + "bbox": [ + 104, + 250, + 194, + 271 + ], + "spans": [ + { + "bbox": [ + 104, + 250, + 194, + 271 + ], + "score": 1.0, + "content": "3 Methodology", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "title", + "bbox": [ + 107, + 278, + 189, + 290 + ], + "lines": [ + { + "bbox": [ + 105, + 277, + 190, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 190, + 291 + ], + "score": 1.0, + "content": "3.1 Threat model", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "image", + "bbox": [ + 173, + 303, + 439, + 415 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 173, + 303, + 439, + 415 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 173, + 303, + 439, + 415 + ], + "spans": [ + { + "bbox": [ + 173, + 303, + 439, + 415 + ], + "score": 0.969, + "type": "image", + "image_path": "7350808cdc653df8e4d2f8c68bb3e0851adb28912ef8969280821c54c3a3fc85.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 173, + 303, + 439, + 340.3333333333333 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 173, + 340.3333333333333, + 439, + 377.66666666666663 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 173, + 377.66666666666663, + 439, + 414.99999999999994 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 423, + 504, + 446 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 423, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 106, + 423, + 505, + 435 + ], + "score": 1.0, + "content": "Figure 1: The attacker reorders the benign randomly supplied data based on the surrogate model", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 434, + 497, + 446 + ], + "spans": [ + { + "bbox": [ + 106, + 434, + 497, + 446 + ], + "score": 1.0, + "content": "outputs. Attacker co-trains the surrogate model with the data that is supplied to the source model.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + } + ], + "index": 18.25 + }, + { + "type": "text", + "bbox": [ + 107, + 461, + 505, + 515 + ], + "lines": [ + { + "bbox": [ + 106, + 461, + 506, + 473 + ], + "spans": [ + { + "bbox": [ + 106, + 461, + 506, + 473 + ], + "score": 1.0, + "content": "We assume one of the strongest threat models currently described in the literature. In particular,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 470, + 506, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 506, + 484 + ], + "score": 1.0, + "content": "our blackbox attacker assumes no access to the model and no prior knowledge of the training data,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 482, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 106, + 482, + 506, + 495 + ], + "score": 1.0, + "content": "whereas a whitebox attacker has access to the model under attack and can compute its loss directly.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 492, + 505, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 505, + 506 + ], + "score": 1.0, + "content": "The attack specifically focuses on the batching part of the ML pipeline as is depicted in Figure 1. We", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 505, + 257, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 505, + 257, + 515 + ], + "score": 1.0, + "content": "discuss the related work in Section 2.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 461, + 506, + 515 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 520, + 505, + 620 + ], + "lines": [ + { + "bbox": [ + 106, + 521, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 521, + 505, + 533 + ], + "score": 1.0, + "content": "This attack is realistic and can be instantiated in several ways. The attack code can be infiltrated", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 531, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 506, + 545 + ], + "score": 1.0, + "content": "into: the operating system handing file system requests; the disk handling individual data accesses;", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 542, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 542, + 505, + 556 + ], + "score": 1.0, + "content": "the software that determines the way random data sampling is performed; the distributed storage", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 553, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 553, + 505, + 567 + ], + "score": 1.0, + "content": "manager; or the machine learning pipeline itself handling prefetch operations. That is a substantial", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 564, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 564, + 505, + 578 + ], + "score": 1.0, + "content": "attack surface, and for large models these components may be controlled by different principals. The", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 576, + 505, + 587 + ], + "spans": [ + { + "bbox": [ + 106, + 576, + 505, + 587 + ], + "score": 1.0, + "content": "attack is also very stealthy. The attacker does not add any noise or perturbation to the data. There", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 586, + 506, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 506, + 599 + ], + "score": 1.0, + "content": "are no triggers or backdoors introduced into the dataset. All of the data points are natural. In two of", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 596, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 505, + 610 + ], + "score": 1.0, + "content": "four variants the attacker uses the whole dataset and does not oversample any given point, i.e. the", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 608, + 473, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 473, + 621 + ], + "score": 1.0, + "content": "sampling is without replacement. This makes it difficult to deploy simple countermeasures.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 521, + 506, + 621 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 633, + 314, + 645 + ], + "lines": [ + { + "bbox": [ + 105, + 631, + 316, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 316, + 648 + ], + "score": 1.0, + "content": "3.2 Primer on stochastic learning and batching", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 107, + 654, + 505, + 724 + ], + "lines": [ + { + "bbox": [ + 106, + 653, + 504, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 653, + 497, + 667 + ], + "score": 1.0, + "content": "We assume that the defender is trying to train a deep neural network model with parameters", + "type": "text" + }, + { + "bbox": [ + 497, + 654, + 504, + 664 + ], + "score": 0.72, + "content": "\\theta", + "type": "inline_equation" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 665, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 665, + 167, + 677 + ], + "score": 1.0, + "content": "operating over", + "type": "text" + }, + { + "bbox": [ + 168, + 665, + 214, + 676 + ], + "score": 0.92, + "content": "X _ { i } \\sim { \\mathcal { X } } _ { \\mathrm { t r a i n } }", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 665, + 505, + 677 + ], + "score": 1.0, + "content": ", solving a non-convex optimization problem with respect to parameters", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 107, + 674, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 107, + 676, + 113, + 686 + ], + "score": 0.78, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 113, + 674, + 338, + 689 + ], + "score": 1.0, + "content": ", corresponding to minimization of a given loss function", + "type": "text" + }, + { + "bbox": [ + 339, + 676, + 359, + 687 + ], + "score": 0.91, + "content": "L ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 674, + 506, + 689 + ], + "score": 1.0, + "content": ". We will denote the training dataset", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 107, + 686, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 107, + 686, + 156, + 699 + ], + "score": 0.94, + "content": "X \\ = \\ \\{ X _ { i } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 686, + 505, + 699 + ], + "score": 1.0, + "content": ". We assume a commonly-used loss function defined as the sample average of the", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 697, + 506, + 710 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 224, + 710 + ], + "score": 1.0, + "content": "loss per training data point", + "type": "text" + }, + { + "bbox": [ + 225, + 697, + 302, + 709 + ], + "score": 0.91, + "content": "L _ { i } ( \\theta ) \\stackrel { \\cdot } { = } \\stackrel { \\cdot } { L } ( X _ { i } , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 697, + 316, + 710 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 317, + 698, + 324, + 707 + ], + "score": 0.81, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 697, + 483, + 710 + ], + "score": 1.0, + "content": "-th batch over the training set, where", + "type": "text" + }, + { + "bbox": [ + 484, + 698, + 493, + 707 + ], + "score": 0.8, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 697, + 506, + 710 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 104, + 707, + 507, + 726 + ], + "spans": [ + { + "bbox": [ + 104, + 707, + 170, + 726 + ], + "score": 1.0, + "content": "the batch size:", + "type": "text" + }, + { + "bbox": [ + 171, + 709, + 298, + 724 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\hat { L } _ { k + 1 } ( \\theta ) = \\frac { 1 } { B } \\sum _ { i = k B + 1 } ^ { k B + B } L _ { i } ( \\theta ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 707, + 341, + 726 + ], + "score": 1.0, + "content": ". If we let", + "type": "text" + }, + { + "bbox": [ + 341, + 711, + 368, + 721 + ], + "score": 0.89, + "content": "N \\cdot B", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 707, + 507, + 726 + ], + "score": 1.0, + "content": "be the total number of items for", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 102, + 70, + 508, + 88 + ], + "spans": [ + { + "bbox": [ + 102, + 70, + 329, + 88 + ], + "score": 1.0, + "content": "training, then in a single epoch one aims to optimize:", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 329, + 70, + 424, + 86 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\hat { L } ( \\theta ) = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\hat { L } _ { i } ( \\theta ) } \\end{array}", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 424, + 70, + 508, + 88 + ], + "score": 1.0, + "content": ". Optimization with", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 83, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 83, + 299, + 96 + ], + "score": 1.0, + "content": "stochastic gradient descent (SGD) algorithm of", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 299, + 84, + 325, + 94 + ], + "score": 0.9, + "content": "N \\cdot B", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 325, + 83, + 449, + 96 + ], + "score": 1.0, + "content": "samples and a learning rate of", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 449, + 86, + 455, + 95 + ], + "score": 0.75, + "content": "\\eta", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 456, + 83, + 505, + 96 + ], + "score": 1.0, + "content": "leads to the", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 95, + 506, + 109 + ], + "spans": [ + { + "bbox": [ + 105, + 96, + 294, + 109 + ], + "score": 1.0, + "content": "following weight update rule over one epoch:", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 294, + 96, + 374, + 108 + ], + "score": 0.85, + "content": "\\theta _ { k + 1 } = \\theta _ { k } + \\eta \\Delta \\theta _ { k }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 374, + 96, + 385, + 109 + ], + "score": 1.0, + "content": ";", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 386, + 95, + 469, + 108 + ], + "score": 0.84, + "content": "\\Delta \\theta _ { k } = - \\nabla _ { \\theta } \\hat { L } _ { k } ( \\theta _ { k } )", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 469, + 96, + 506, + 109 + ], + "score": 1.0, + "content": ". SGD is", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 107, + 505, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 107, + 315, + 119 + ], + "score": 1.0, + "content": "often implemented with momentum [25, 33], with", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 316, + 109, + 323, + 118 + ], + "score": 0.81, + "content": "\\mu", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 323, + 107, + 342, + 119 + ], + "score": 1.0, + "content": "and", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 342, + 110, + 348, + 117 + ], + "score": 0.74, + "content": "v", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 349, + 107, + 505, + 119 + ], + "score": 1.0, + "content": "representing momentum and velocity", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 117, + 339, + 133 + ], + "spans": [ + { + "bbox": [ + 104, + 117, + 160, + 133 + ], + "score": 1.0, + "content": "respectively:", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 160, + 119, + 246, + 130 + ], + "score": 0.66, + "content": "v _ { k + 1 } = \\mu v _ { k } + \\eta \\Delta \\theta _ { k }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 246, + 117, + 257, + 133 + ], + "score": 1.0, + "content": ";", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 258, + 118, + 335, + 130 + ], + "score": 0.58, + "content": "\\theta _ { k + 1 } = \\theta _ { k } + v _ { k + 1 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 335, + 117, + 339, + 133 + ], + "score": 1.0, + "content": ".", + "type": "text", + "cross_page": true + } + ], + "index": 4 + } + ], + "index": 38.5, + "bbox_fs": [ + 104, + 653, + 507, + 726 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 70, + 505, + 131 + ], + "lines": [ + { + "bbox": [ + 102, + 70, + 508, + 88 + ], + "spans": [ + { + "bbox": [ + 102, + 70, + 329, + 88 + ], + "score": 1.0, + "content": "training, then in a single epoch one aims to optimize:", + "type": "text" + }, + { + "bbox": [ + 329, + 70, + 424, + 86 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\hat { L } ( \\theta ) = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\hat { L } _ { i } ( \\theta ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 70, + 508, + 88 + ], + "score": 1.0, + "content": ". Optimization with", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 83, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 83, + 299, + 96 + ], + "score": 1.0, + "content": "stochastic gradient descent (SGD) algorithm of", + "type": "text" + }, + { + "bbox": [ + 299, + 84, + 325, + 94 + ], + "score": 0.9, + "content": "N \\cdot B", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 83, + 449, + 96 + ], + "score": 1.0, + "content": "samples and a learning rate of", + "type": "text" + }, + { + "bbox": [ + 449, + 86, + 455, + 95 + ], + "score": 0.75, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 83, + 505, + 96 + ], + "score": 1.0, + "content": "leads to the", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 95, + 506, + 109 + ], + "spans": [ + { + "bbox": [ + 105, + 96, + 294, + 109 + ], + "score": 1.0, + "content": "following weight update rule over one epoch:", + "type": "text" + }, + { + "bbox": [ + 294, + 96, + 374, + 108 + ], + "score": 0.85, + "content": "\\theta _ { k + 1 } = \\theta _ { k } + \\eta \\Delta \\theta _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 96, + 385, + 109 + ], + "score": 1.0, + "content": ";", + "type": "text" + }, + { + "bbox": [ + 386, + 95, + 469, + 108 + ], + "score": 0.84, + "content": "\\Delta \\theta _ { k } = - \\nabla _ { \\theta } \\hat { L } _ { k } ( \\theta _ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 96, + 506, + 109 + ], + "score": 1.0, + "content": ". SGD is", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 107, + 505, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 107, + 315, + 119 + ], + "score": 1.0, + "content": "often implemented with momentum [25, 33], with", + "type": "text" + }, + { + "bbox": [ + 316, + 109, + 323, + 118 + ], + "score": 0.81, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 107, + 342, + 119 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 342, + 110, + 348, + 117 + ], + "score": 0.74, + "content": "v", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 107, + 505, + 119 + ], + "score": 1.0, + "content": "representing momentum and velocity", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 117, + 339, + 133 + ], + "spans": [ + { + "bbox": [ + 104, + 117, + 160, + 133 + ], + "score": 1.0, + "content": "respectively:", + "type": "text" + }, + { + "bbox": [ + 160, + 119, + 246, + 130 + ], + "score": 0.66, + "content": "v _ { k + 1 } = \\mu v _ { k } + \\eta \\Delta \\theta _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 117, + 257, + 133 + ], + "score": 1.0, + "content": ";", + "type": "text" + }, + { + "bbox": [ + 258, + 118, + 335, + 130 + ], + "score": 0.58, + "content": "\\theta _ { k + 1 } = \\theta _ { k } + v _ { k + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 117, + 339, + 133 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 107, + 134, + 505, + 181 + ], + "lines": [ + { + "bbox": [ + 106, + 135, + 505, + 146 + ], + "spans": [ + { + "bbox": [ + 106, + 135, + 505, + 146 + ], + "score": 1.0, + "content": "Given data, SGD’s stochasticity comes from the batch sampling procedure. Mini-batched gradients", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 145, + 507, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 146, + 243, + 160 + ], + "score": 1.0, + "content": "approximate the true gradients of", + "type": "text" + }, + { + "bbox": [ + 244, + 145, + 252, + 157 + ], + "score": 0.85, + "content": "\\hat { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 146, + 507, + 160 + ], + "score": 1.0, + "content": "and the quality of this approximation can vary greatly. In fact,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 158, + 505, + 170 + ], + "spans": [ + { + "bbox": [ + 105, + 158, + 329, + 170 + ], + "score": 1.0, + "content": "assuming an unbiased sampling procedure, i.e. when the", + "type": "text" + }, + { + "bbox": [ + 329, + 158, + 336, + 168 + ], + "score": 0.78, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 158, + 460, + 170 + ], + "score": 1.0, + "content": "’th gradient step corresponds to", + "type": "text" + }, + { + "bbox": [ + 460, + 159, + 469, + 169 + ], + "score": 0.86, + "content": "i _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 158, + 505, + 170 + ], + "score": 1.0, + "content": "’th batch", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 169, + 440, + 181 + ], + "spans": [ + { + "bbox": [ + 106, + 169, + 126, + 181 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 127, + 169, + 198, + 181 + ], + "score": 0.92, + "content": "\\mathbb { P } ( i _ { k } = i ) = 1 / N", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 169, + 440, + 181 + ], + "score": 1.0, + "content": ", in expectation the batch gradient matches the true gradient:", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 6.5 + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 192, + 439, + 227 + ], + "lines": [ + { + "bbox": [ + 172, + 192, + 439, + 227 + ], + "spans": [ + { + "bbox": [ + 172, + 192, + 439, + 227 + ], + "score": 0.95, + "content": "\\mathbb { E } [ \\nabla \\hat { L } _ { i _ { k } } ( \\theta ) ] = \\sum _ { i = 1 } ^ { N } \\mathbb { P } ( i _ { k } = i ) \\nabla \\hat { L } _ { i } ( \\theta ) = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\nabla \\hat { L } _ { i } ( \\theta ) = \\nabla \\hat { L } ( \\theta ) .", + "type": "interline_equation", + "image_path": "41dc65ef6f84cab53c86ba538919ed45d5eb0c1284e64c240315c7a3ef2eca4f.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 172, + 192, + 439, + 203.66666666666666 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 172, + 203.66666666666666, + 439, + 215.33333333333331 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 172, + 215.33333333333331, + 439, + 226.99999999999997 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 232, + 506, + 322 + ], + "lines": [ + { + "bbox": [ + 105, + 232, + 507, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 507, + 246 + ], + "score": 1.0, + "content": "Although this happens in expectation, a given batch taken in isolation can be very far from the mean.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 244, + 506, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 506, + 257 + ], + "score": 1.0, + "content": "This variation has been exploited in the literature to aid training: there exists a field responsible", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 255, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 506, + 268 + ], + "score": 1.0, + "content": "for variance reduction techniques for stochastic optimisation [18], active learning [9, 35], (anti-)", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 266, + 506, + 279 + ], + "spans": [ + { + "bbox": [ + 106, + 266, + 506, + 279 + ], + "score": 1.0, + "content": "curriculum learning [5, 20, 13] and core-set construction [2]. Each area looks at identifying and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 277, + 506, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 506, + 290 + ], + "score": 1.0, + "content": "scheduling data subsets that aid training and give a better true gradient approximation. In this paper,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 288, + 506, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 506, + 300 + ], + "score": 1.0, + "content": "we turn things round and investigate how an attacker can exploit data order to break training. The", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 298, + 506, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 506, + 312 + ], + "score": 1.0, + "content": "explicit stochastic assumption opens a new attack surface for the attacker to influence the learning", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 310, + 447, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 310, + 306, + 322 + ], + "score": 1.0, + "content": "process. In particular, let us consider the effect of", + "type": "text" + }, + { + "bbox": [ + 306, + 311, + 316, + 320 + ], + "score": 0.8, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 310, + 447, + 322 + ], + "score": 1.0, + "content": "SGD steps over one epoch [31]:", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 15.5 + }, + { + "type": "interline_equation", + "bbox": [ + 149, + 337, + 462, + 407 + ], + "lines": [ + { + "bbox": [ + 149, + 337, + 462, + 407 + ], + "spans": [ + { + "bbox": [ + 149, + 337, + 462, + 407 + ], + "score": 0.86, + "content": "\\begin{array} { l } { \\displaystyle \\theta _ { N + 1 } = \\theta _ { 1 } - \\eta \\nabla \\hat { L } _ { 1 } ( \\theta _ { 1 } ) - \\eta \\nabla \\hat { L } _ { 2 } ( \\theta _ { 2 } ) - \\cdot \\cdot \\cdot - \\eta \\nabla \\hat { L } _ { N } ( \\theta _ { N } ) } \\\\ { \\displaystyle \\qquad = \\theta _ { 1 } - \\eta \\sum _ { j = 1 } ^ { N } \\nabla \\hat { L } _ { j } ( \\theta _ { 1 } ) + \\eta ^ { 2 } \\sum _ { j = 1 } ^ { N } \\sum _ { k < j } \\nabla \\nabla \\hat { L } _ { j } ( \\theta _ { 1 } ) \\nabla \\hat { L } _ { k } ( \\theta _ { 1 } ) + O ( N ^ { 3 } \\eta ^ { 3 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "3a12ea9e46cd0a0277da09a3ba63df314068d6a2e8eea62eb91bb9fcd1b2cbba.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 149, + 337, + 462, + 360.3333333333333 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 149, + 360.3333333333333, + 462, + 383.66666666666663 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 149, + 383.66666666666663, + 462, + 406.99999999999994 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 415, + 505, + 493 + ], + "lines": [ + { + "bbox": [ + 105, + 415, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 505, + 428 + ], + "score": 1.0, + "content": "As we can see, in this case the second order correction term is dependent on the order of the batches", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 426, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 506, + 439 + ], + "score": 1.0, + "content": "provided. The attacker we describe in this paper focuses on manipulating it i.e. finding a sequence", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 436, + 506, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 436, + 506, + 451 + ], + "score": 1.0, + "content": "of updates such that the first and second derivatives are misaligned with the true gradient step.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 448, + 506, + 461 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 506, + 461 + ], + "score": 1.0, + "content": "In Appendix C we prove that under equally-distributed loss gradients, a change in data order can lead", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 459, + 506, + 472 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 506, + 472 + ], + "score": 1.0, + "content": "to an increase in the expected value of the term which is dependent on data order. We also derive a", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 470, + 506, + 483 + ], + "spans": [ + { + "bbox": [ + 106, + 470, + 506, + 483 + ], + "score": 1.0, + "content": "condition on the gradient distribution given a model for which it is guaranteed. Finally, we derive an", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 480, + 507, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 507, + 495 + ], + "score": 1.0, + "content": "attack objective to target the upper bound on the rate of SGD convergence explicitly in Appendix A.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 497, + 505, + 563 + ], + "lines": [ + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "score": 1.0, + "content": "In this paper we assume the blackbox attacker has no access to the underlying model, and thus no", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 508, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 505, + 522 + ], + "score": 1.0, + "content": "way to monitor its errors or the progress of its training. Instead, we co-train a separate surrogate", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 518, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 532 + ], + "score": 1.0, + "content": "model, using the batches supplied to the target model. We find that in practice the losses produced by", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 530, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 505, + 542 + ], + "score": 1.0, + "content": "the surrogate model approximate the losses of the true model well enough to enable attacks on both", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 542, + 505, + 553 + ], + "spans": [ + { + "bbox": [ + 106, + 542, + 505, + 553 + ], + "score": 1.0, + "content": "integrity and availability. We empirically find that our blackbox reshuffle attacks perform as well as", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 552, + 242, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 242, + 564 + ], + "score": 1.0, + "content": "the whitebox one in Appendix D.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 106, + 568, + 505, + 657 + ], + "lines": [ + { + "bbox": [ + 105, + 568, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 505, + 581 + ], + "score": 1.0, + "content": "Finally, although the attacker can maximise the term dependent on data order directly, in practice", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 579, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 579, + 505, + 591 + ], + "score": 1.0, + "content": "it is expensive to do so. Therefore, in the attack we use the loss magnitudes directly rather than", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 590, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 105, + 590, + 506, + 603 + ], + "score": 1.0, + "content": "their gradient. Intuitively, large prediction errors correspond to large loss gradient norms, while", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 601, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 106, + 601, + 505, + 614 + ], + "score": 1.0, + "content": "correct predictions produce near-zero gradients. Although this assumption may not hold for all loss", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 612, + 504, + 624 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 504, + 624 + ], + "score": 1.0, + "content": "landscapes, for the loss landscapes incurred by real machine learning models, local minima often", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 623, + 505, + 635 + ], + "spans": [ + { + "bbox": [ + 106, + 623, + 505, + 635 + ], + "score": 1.0, + "content": "cluster around the global minima as the loss satisfies certain dissipativity properties [26, 36], and", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 634, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 634, + 505, + 646 + ], + "score": 1.0, + "content": "consequently loss magnitudes correlate with the gradient of the loss. We emphasize that we use this", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 645, + 306, + 659 + ], + "spans": [ + { + "bbox": [ + 105, + 645, + 306, + 659 + ], + "score": 1.0, + "content": "approximation only for computational advantage.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 39.5 + }, + { + "type": "title", + "bbox": [ + 108, + 668, + 258, + 680 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 259, + 683 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 259, + 683 + ], + "score": 1.0, + "content": "3.3 Taxonomy of batching attacks", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 44 + }, + { + "type": "text", + "bbox": [ + 107, + 689, + 505, + 722 + ], + "lines": [ + { + "bbox": [ + 105, + 688, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 702 + ], + "score": 1.0, + "content": "In this section we describe the taxonomy of batching attacks as shown in Figure 2. The overall", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 700, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 700, + 505, + 712 + ], + "score": 1.0, + "content": "attack algorithm is shown in Algorithm 2 in the Appendix, and a shortened attack flow is shown", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 710, + 505, + 724 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 724 + ], + "score": 1.0, + "content": "in Algorithm 1. We highlight that our attacks are the first to successfully poison the underlying", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46 + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 741, + 308, + 750 + ], + "lines": [ + { + "bbox": [ + 302, + 741, + 310, + 752 + ], + "spans": [ + { + "bbox": [ + 302, + 741, + 310, + 752 + ], + "score": 1.0, + "content": "4", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 70, + 505, + 131 + ], + "lines": [], + "index": 2, + "bbox_fs": [ + 102, + 70, + 508, + 133 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 134, + 505, + 181 + ], + "lines": [ + { + "bbox": [ + 106, + 135, + 505, + 146 + ], + "spans": [ + { + "bbox": [ + 106, + 135, + 505, + 146 + ], + "score": 1.0, + "content": "Given data, SGD’s stochasticity comes from the batch sampling procedure. Mini-batched gradients", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 145, + 507, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 146, + 243, + 160 + ], + "score": 1.0, + "content": "approximate the true gradients of", + "type": "text" + }, + { + "bbox": [ + 244, + 145, + 252, + 157 + ], + "score": 0.85, + "content": "\\hat { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 146, + 507, + 160 + ], + "score": 1.0, + "content": "and the quality of this approximation can vary greatly. In fact,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 158, + 505, + 170 + ], + "spans": [ + { + "bbox": [ + 105, + 158, + 329, + 170 + ], + "score": 1.0, + "content": "assuming an unbiased sampling procedure, i.e. when the", + "type": "text" + }, + { + "bbox": [ + 329, + 158, + 336, + 168 + ], + "score": 0.78, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 158, + 460, + 170 + ], + "score": 1.0, + "content": "’th gradient step corresponds to", + "type": "text" + }, + { + "bbox": [ + 460, + 159, + 469, + 169 + ], + "score": 0.86, + "content": "i _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 158, + 505, + 170 + ], + "score": 1.0, + "content": "’th batch", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 169, + 440, + 181 + ], + "spans": [ + { + "bbox": [ + 106, + 169, + 126, + 181 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 127, + 169, + 198, + 181 + ], + "score": 0.92, + "content": "\\mathbb { P } ( i _ { k } = i ) = 1 / N", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 169, + 440, + 181 + ], + "score": 1.0, + "content": ", in expectation the batch gradient matches the true gradient:", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 6.5, + "bbox_fs": [ + 105, + 135, + 507, + 181 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 192, + 439, + 227 + ], + "lines": [ + { + "bbox": [ + 172, + 192, + 439, + 227 + ], + "spans": [ + { + "bbox": [ + 172, + 192, + 439, + 227 + ], + "score": 0.95, + "content": "\\mathbb { E } [ \\nabla \\hat { L } _ { i _ { k } } ( \\theta ) ] = \\sum _ { i = 1 } ^ { N } \\mathbb { P } ( i _ { k } = i ) \\nabla \\hat { L } _ { i } ( \\theta ) = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\nabla \\hat { L } _ { i } ( \\theta ) = \\nabla \\hat { L } ( \\theta ) .", + "type": "interline_equation", + "image_path": "41dc65ef6f84cab53c86ba538919ed45d5eb0c1284e64c240315c7a3ef2eca4f.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 172, + 192, + 439, + 203.66666666666666 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 172, + 203.66666666666666, + 439, + 215.33333333333331 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 172, + 215.33333333333331, + 439, + 226.99999999999997 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 232, + 506, + 322 + ], + "lines": [ + { + "bbox": [ + 105, + 232, + 507, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 507, + 246 + ], + "score": 1.0, + "content": "Although this happens in expectation, a given batch taken in isolation can be very far from the mean.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 244, + 506, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 506, + 257 + ], + "score": 1.0, + "content": "This variation has been exploited in the literature to aid training: there exists a field responsible", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 255, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 506, + 268 + ], + "score": 1.0, + "content": "for variance reduction techniques for stochastic optimisation [18], active learning [9, 35], (anti-)", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 266, + 506, + 279 + ], + "spans": [ + { + "bbox": [ + 106, + 266, + 506, + 279 + ], + "score": 1.0, + "content": "curriculum learning [5, 20, 13] and core-set construction [2]. Each area looks at identifying and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 277, + 506, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 506, + 290 + ], + "score": 1.0, + "content": "scheduling data subsets that aid training and give a better true gradient approximation. In this paper,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 288, + 506, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 506, + 300 + ], + "score": 1.0, + "content": "we turn things round and investigate how an attacker can exploit data order to break training. The", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 298, + 506, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 506, + 312 + ], + "score": 1.0, + "content": "explicit stochastic assumption opens a new attack surface for the attacker to influence the learning", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 310, + 447, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 310, + 306, + 322 + ], + "score": 1.0, + "content": "process. In particular, let us consider the effect of", + "type": "text" + }, + { + "bbox": [ + 306, + 311, + 316, + 320 + ], + "score": 0.8, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 310, + 447, + 322 + ], + "score": 1.0, + "content": "SGD steps over one epoch [31]:", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 232, + 507, + 322 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 149, + 337, + 462, + 407 + ], + "lines": [ + { + "bbox": [ + 149, + 337, + 462, + 407 + ], + "spans": [ + { + "bbox": [ + 149, + 337, + 462, + 407 + ], + "score": 0.86, + "content": "\\begin{array} { l } { \\displaystyle \\theta _ { N + 1 } = \\theta _ { 1 } - \\eta \\nabla \\hat { L } _ { 1 } ( \\theta _ { 1 } ) - \\eta \\nabla \\hat { L } _ { 2 } ( \\theta _ { 2 } ) - \\cdot \\cdot \\cdot - \\eta \\nabla \\hat { L } _ { N } ( \\theta _ { N } ) } \\\\ { \\displaystyle \\qquad = \\theta _ { 1 } - \\eta \\sum _ { j = 1 } ^ { N } \\nabla \\hat { L } _ { j } ( \\theta _ { 1 } ) + \\eta ^ { 2 } \\sum _ { j = 1 } ^ { N } \\sum _ { k < j } \\nabla \\nabla \\hat { L } _ { j } ( \\theta _ { 1 } ) \\nabla \\hat { L } _ { k } ( \\theta _ { 1 } ) + O ( N ^ { 3 } \\eta ^ { 3 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "3a12ea9e46cd0a0277da09a3ba63df314068d6a2e8eea62eb91bb9fcd1b2cbba.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 149, + 337, + 462, + 360.3333333333333 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 149, + 360.3333333333333, + 462, + 383.66666666666663 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 149, + 383.66666666666663, + 462, + 406.99999999999994 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 415, + 505, + 493 + ], + "lines": [ + { + "bbox": [ + 105, + 415, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 505, + 428 + ], + "score": 1.0, + "content": "As we can see, in this case the second order correction term is dependent on the order of the batches", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 426, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 506, + 439 + ], + "score": 1.0, + "content": "provided. The attacker we describe in this paper focuses on manipulating it i.e. finding a sequence", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 436, + 506, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 436, + 506, + 451 + ], + "score": 1.0, + "content": "of updates such that the first and second derivatives are misaligned with the true gradient step.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 448, + 506, + 461 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 506, + 461 + ], + "score": 1.0, + "content": "In Appendix C we prove that under equally-distributed loss gradients, a change in data order can lead", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 459, + 506, + 472 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 506, + 472 + ], + "score": 1.0, + "content": "to an increase in the expected value of the term which is dependent on data order. We also derive a", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 470, + 506, + 483 + ], + "spans": [ + { + "bbox": [ + 106, + 470, + 506, + 483 + ], + "score": 1.0, + "content": "condition on the gradient distribution given a model for which it is guaranteed. Finally, we derive an", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 480, + 507, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 507, + 495 + ], + "score": 1.0, + "content": "attack objective to target the upper bound on the rate of SGD convergence explicitly in Appendix A.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 415, + 507, + 495 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 497, + 505, + 563 + ], + "lines": [ + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "score": 1.0, + "content": "In this paper we assume the blackbox attacker has no access to the underlying model, and thus no", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 508, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 505, + 522 + ], + "score": 1.0, + "content": "way to monitor its errors or the progress of its training. Instead, we co-train a separate surrogate", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 518, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 532 + ], + "score": 1.0, + "content": "model, using the batches supplied to the target model. We find that in practice the losses produced by", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 530, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 505, + 542 + ], + "score": 1.0, + "content": "the surrogate model approximate the losses of the true model well enough to enable attacks on both", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 542, + 505, + 553 + ], + "spans": [ + { + "bbox": [ + 106, + 542, + 505, + 553 + ], + "score": 1.0, + "content": "integrity and availability. We empirically find that our blackbox reshuffle attacks perform as well as", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 552, + 242, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 242, + 564 + ], + "score": 1.0, + "content": "the whitebox one in Appendix D.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 497, + 506, + 564 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 568, + 505, + 657 + ], + "lines": [ + { + "bbox": [ + 105, + 568, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 505, + 581 + ], + "score": 1.0, + "content": "Finally, although the attacker can maximise the term dependent on data order directly, in practice", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 579, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 579, + 505, + 591 + ], + "score": 1.0, + "content": "it is expensive to do so. Therefore, in the attack we use the loss magnitudes directly rather than", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 590, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 105, + 590, + 506, + 603 + ], + "score": 1.0, + "content": "their gradient. Intuitively, large prediction errors correspond to large loss gradient norms, while", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 601, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 106, + 601, + 505, + 614 + ], + "score": 1.0, + "content": "correct predictions produce near-zero gradients. Although this assumption may not hold for all loss", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 612, + 504, + 624 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 504, + 624 + ], + "score": 1.0, + "content": "landscapes, for the loss landscapes incurred by real machine learning models, local minima often", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 623, + 505, + 635 + ], + "spans": [ + { + "bbox": [ + 106, + 623, + 505, + 635 + ], + "score": 1.0, + "content": "cluster around the global minima as the loss satisfies certain dissipativity properties [26, 36], and", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 634, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 634, + 505, + 646 + ], + "score": 1.0, + "content": "consequently loss magnitudes correlate with the gradient of the loss. We emphasize that we use this", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 645, + 306, + 659 + ], + "spans": [ + { + "bbox": [ + 105, + 645, + 306, + 659 + ], + "score": 1.0, + "content": "approximation only for computational advantage.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 568, + 506, + 659 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 668, + 258, + 680 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 259, + 683 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 259, + 683 + ], + "score": 1.0, + "content": "3.3 Taxonomy of batching attacks", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 44 + }, + { + "type": "text", + "bbox": [ + 107, + 689, + 505, + 722 + ], + "lines": [ + { + "bbox": [ + 105, + 688, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 702 + ], + "score": 1.0, + "content": "In this section we describe the taxonomy of batching attacks as shown in Figure 2. The overall", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 700, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 700, + 505, + 712 + ], + "score": 1.0, + "content": "attack algorithm is shown in Algorithm 2 in the Appendix, and a shortened attack flow is shown", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 710, + 505, + 724 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 724 + ], + "score": 1.0, + "content": "in Algorithm 1. We highlight that our attacks are the first to successfully poison the underlying", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46, + "bbox_fs": [ + 105, + 688, + 505, + 724 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 165, + 70, + 446, + 146 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 165, + 70, + 446, + 146 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 165, + 70, + 446, + 146 + ], + "spans": [ + { + "bbox": [ + 165, + 70, + 446, + 146 + ], + "score": 0.97, + "type": "image", + "image_path": "9ecad19d92ad1568ab77942a28d92ec253ae771264a960b96261a0566ccd5b9a.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 165, + 70, + 446, + 95.33333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 165, + 95.33333333333333, + 446, + 120.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 165, + 120.66666666666666, + 446, + 146.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 152, + 506, + 207 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 151, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 505, + 165 + ], + "score": 1.0, + "content": "Figure 2: Taxonomy of BRRR attacks. Normal batching assumes randomly distributed data points", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 162, + 506, + 176 + ], + "spans": [ + { + "bbox": [ + 105, + 162, + 506, + 176 + ], + "score": 1.0, + "content": "and batches. Batch reordering assumes the batches appear to the model in a different order, but", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 174, + 505, + 186 + ], + "spans": [ + { + "bbox": [ + 106, + 174, + 505, + 186 + ], + "score": 1.0, + "content": "internal contents stay in the original random order. Batch reshuffling assumes that the individual", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 183, + 506, + 198 + ], + "spans": [ + { + "bbox": [ + 105, + 183, + 506, + 198 + ], + "score": 1.0, + "content": "datapoints within batches change order, but appear only once and do not repeat across batches. Finally,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 195, + 477, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 477, + 208 + ], + "score": 1.0, + "content": "batch replacement refers to cases where datapoints or batches can repeat or not appear at all.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "title", + "bbox": [ + 107, + 230, + 383, + 242 + ], + "lines": [ + { + "bbox": [ + 105, + 228, + 384, + 244 + ], + "spans": [ + { + "bbox": [ + 105, + 228, + 384, + 244 + ], + "score": 1.0, + "content": "Algorithm 1: A high level description of the BRRR attack algorithm", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 105, + 245, + 504, + 356 + ], + "lines": [ + { + "bbox": [ + 108, + 244, + 490, + 256 + ], + "spans": [ + { + "bbox": [ + 108, + 244, + 227, + 255 + ], + "score": 1.0, + "content": "/* –– Attack preparation:", + "type": "text" + }, + { + "bbox": [ + 231, + 244, + 307, + 256 + ], + "score": 1.0, + "content": "collecting data", + "type": "text" + }, + { + "bbox": [ + 478, + 245, + 490, + 255 + ], + "score": 1.0, + "content": "*/", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 254, + 121, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 121, + 266 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 120, + 266, + 348, + 278 + ], + "spans": [ + { + "bbox": [ + 120, + 266, + 348, + 278 + ], + "score": 1.0, + "content": "get a new batch and add it to a list of unseen datapoints;", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 121, + 276, + 365, + 288 + ], + "spans": [ + { + "bbox": [ + 121, + 276, + 365, + 288 + ], + "score": 1.0, + "content": "train surrogate model on a batch and pass it on to the model;", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 288, + 235, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 235, + 300 + ], + "score": 1.0, + "content": "while first epoch is not finished", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 109, + 300, + 489, + 311 + ], + "spans": [ + { + "bbox": [ + 109, + 302, + 117, + 308 + ], + "score": 1.0, + "content": "/*", + "type": "text" + }, + { + "bbox": [ + 138, + 302, + 167, + 310 + ], + "score": 1.0, + "content": "Attack:", + "type": "text" + }, + { + "bbox": [ + 176, + 300, + 325, + 311 + ], + "score": 1.0, + "content": "reorder based on surrogate loss", + "type": "text" + }, + { + "bbox": [ + 479, + 302, + 489, + 310 + ], + "score": 1.0, + "content": "*/", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 310, + 179, + 322 + ], + "spans": [ + { + "bbox": [ + 106, + 310, + 179, + 322 + ], + "score": 1.0, + "content": "while training do", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 120, + 320, + 358, + 334 + ], + "spans": [ + { + "bbox": [ + 120, + 320, + 358, + 334 + ], + "score": 1.0, + "content": "rank each data point from epoch one with a surrogate loss;", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 120, + 331, + 344, + 346 + ], + "spans": [ + { + "bbox": [ + 120, + 331, + 344, + 346 + ], + "score": 1.0, + "content": "reorder the data points according to the attack strategy;", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 118, + 343, + 373, + 356 + ], + "spans": [ + { + "bbox": [ + 118, + 343, + 373, + 356 + ], + "score": 1.0, + "content": "pass batches to model and train the surrogate at the same time.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 392, + 506, + 491 + ], + "lines": [ + { + "bbox": [ + 105, + 393, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 505, + 406 + ], + "score": 1.0, + "content": "model without changing the underlying dataset. In this paper we use three attack policies – (1) batch", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 402, + 506, + 418 + ], + "spans": [ + { + "bbox": [ + 104, + 402, + 506, + 418 + ], + "score": 1.0, + "content": "reshuffling or changing the order of datapoints inside batches; (2) batch reordering or changing", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 414, + 506, + 427 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 506, + 427 + ], + "score": 1.0, + "content": "the order of batches; and (3) batch replacement or replacing both points and batches. We consider", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 425, + 506, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 506, + 438 + ], + "score": 1.0, + "content": "four reordering policies, motivated by research in the fields of curriculum learning [5] and core-set", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 435, + 506, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 506, + 450 + ], + "score": 1.0, + "content": "selection [2], which discovered that model training can be enhanced by scheduling how and what", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 447, + 505, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 505, + 460 + ], + "score": 1.0, + "content": "data is presented to the model. That can help the model to generalize and to avoid overfitting with", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 458, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 458, + 505, + 471 + ], + "score": 1.0, + "content": "memorization. This paper does the opposite – we promote memorization and overfitting, forcing the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 469, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 469, + 505, + 482 + ], + "score": 1.0, + "content": "model to forget generalizable features. Anti-curriculum learning (e.g. [13]) is particularly close to", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 479, + 222, + 494 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 222, + 494 + ], + "score": 1.0, + "content": "our batch reordering setting.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 23 + }, + { + "type": "image", + "bbox": [ + 164, + 508, + 446, + 587 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 164, + 508, + 446, + 587 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 164, + 508, + 446, + 587 + ], + "spans": [ + { + "bbox": [ + 164, + 508, + 446, + 587 + ], + "score": 0.967, + "type": "image", + "image_path": "df105449880bbabdecd0854bc6cc57fd11ee600465a07e1058c5c441f8b34b55.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 164, + 508, + 446, + 534.3333333333334 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 164, + 534.3333333333334, + 446, + 560.6666666666667 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 164, + 560.6666666666667, + 446, + 587.0000000000001 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 593, + 505, + 670 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 593, + 505, + 605 + ], + "spans": [ + { + "bbox": [ + 106, + 593, + 505, + 605 + ], + "score": 1.0, + "content": "Figure 3: We use four different reorder and reshuffle policies based on the corresponding data point", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 604, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 616 + ], + "score": 1.0, + "content": "and batch losses. We color-code the loss values from bright to dark colors, to represent loss values", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 614, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 506, + 628 + ], + "score": 1.0, + "content": "from low to high. Low-high policy orders a sequence by the loss magnitude. High-low policy orders", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 626, + 506, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 639 + ], + "score": 1.0, + "content": "a sequence by the negative loss magnitude. Oscillation inwards orders elements of the sequence", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 637, + 506, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 506, + 649 + ], + "score": 1.0, + "content": "from the beginning and the end of the sequence one by one, as if it was oscillating between sides of", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 648, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 648, + 505, + 660 + ], + "score": 1.0, + "content": "the sequence and moving towards the middle. Finally, Oscillations outward orders the sequence by", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 658, + 504, + 670 + ], + "spans": [ + { + "bbox": [ + 105, + 658, + 504, + 670 + ], + "score": 1.0, + "content": "starting at the middle of an ordered sequence picking elements to both sides of the current location.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 34 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 106, + 688, + 506, + 722 + ], + "lines": [ + { + "bbox": [ + 105, + 688, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 702 + ], + "score": 1.0, + "content": "Figure 3 shows attack policies. Low to high orders sequence items by their loss. High to low", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 700, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 700, + 506, + 712 + ], + "score": 1.0, + "content": "is an inverse of Low to high. Oscillations inwards picks elements from both sides in sequence.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 710, + 503, + 723 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 503, + 723 + ], + "score": 1.0, + "content": "Oscillations outwards inverts the halves of the sequence and then picks elements from both sides.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 741, + 309, + 750 + ], + "lines": [ + { + "bbox": [ + 301, + 740, + 310, + 753 + ], + "spans": [ + { + "bbox": [ + 301, + 740, + 310, + 753 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 165, + 70, + 446, + 146 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 165, + 70, + 446, + 146 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 165, + 70, + 446, + 146 + ], + "spans": [ + { + "bbox": [ + 165, + 70, + 446, + 146 + ], + "score": 0.97, + "type": "image", + "image_path": "9ecad19d92ad1568ab77942a28d92ec253ae771264a960b96261a0566ccd5b9a.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 165, + 70, + 446, + 95.33333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 165, + 95.33333333333333, + 446, + 120.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 165, + 120.66666666666666, + 446, + 146.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 152, + 506, + 207 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 151, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 505, + 165 + ], + "score": 1.0, + "content": "Figure 2: Taxonomy of BRRR attacks. Normal batching assumes randomly distributed data points", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 162, + 506, + 176 + ], + "spans": [ + { + "bbox": [ + 105, + 162, + 506, + 176 + ], + "score": 1.0, + "content": "and batches. Batch reordering assumes the batches appear to the model in a different order, but", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 174, + 505, + 186 + ], + "spans": [ + { + "bbox": [ + 106, + 174, + 505, + 186 + ], + "score": 1.0, + "content": "internal contents stay in the original random order. Batch reshuffling assumes that the individual", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 183, + 506, + 198 + ], + "spans": [ + { + "bbox": [ + 105, + 183, + 506, + 198 + ], + "score": 1.0, + "content": "datapoints within batches change order, but appear only once and do not repeat across batches. Finally,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 195, + 477, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 477, + 208 + ], + "score": 1.0, + "content": "batch replacement refers to cases where datapoints or batches can repeat or not appear at all.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "title", + "bbox": [ + 107, + 230, + 383, + 242 + ], + "lines": [ + { + "bbox": [ + 105, + 228, + 384, + 244 + ], + "spans": [ + { + "bbox": [ + 105, + 228, + 384, + 244 + ], + "score": 1.0, + "content": "Algorithm 1: A high level description of the BRRR attack algorithm", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "list", + "bbox": [ + 105, + 245, + 504, + 356 + ], + "lines": [ + { + "bbox": [ + 108, + 244, + 490, + 256 + ], + "spans": [ + { + "bbox": [ + 108, + 244, + 227, + 255 + ], + "score": 1.0, + "content": "/* –– Attack preparation:", + "type": "text" + }, + { + "bbox": [ + 231, + 244, + 307, + 256 + ], + "score": 1.0, + "content": "collecting data", + "type": "text" + }, + { + "bbox": [ + 478, + 245, + 490, + 255 + ], + "score": 1.0, + "content": "*/", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 105, + 254, + 121, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 121, + 266 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 10, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 120, + 266, + 348, + 278 + ], + "spans": [ + { + "bbox": [ + 120, + 266, + 348, + 278 + ], + "score": 1.0, + "content": "get a new batch and add it to a list of unseen datapoints;", + "type": "text" + } + ], + "index": 11, + "is_list_end_line": true + }, + { + "bbox": [ + 121, + 276, + 365, + 288 + ], + "spans": [ + { + "bbox": [ + 121, + 276, + 365, + 288 + ], + "score": 1.0, + "content": "train surrogate model on a batch and pass it on to the model;", + "type": "text" + } + ], + "index": 12, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 288, + 235, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 235, + 300 + ], + "score": 1.0, + "content": "while first epoch is not finished", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 109, + 300, + 489, + 311 + ], + "spans": [ + { + "bbox": [ + 109, + 302, + 117, + 308 + ], + "score": 1.0, + "content": "/*", + "type": "text" + }, + { + "bbox": [ + 138, + 302, + 167, + 310 + ], + "score": 1.0, + "content": "Attack:", + "type": "text" + }, + { + "bbox": [ + 176, + 300, + 325, + 311 + ], + "score": 1.0, + "content": "reorder based on surrogate loss", + "type": "text" + }, + { + "bbox": [ + 479, + 302, + 489, + 310 + ], + "score": 1.0, + "content": "*/", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 310, + 179, + 322 + ], + "spans": [ + { + "bbox": [ + 106, + 310, + 179, + 322 + ], + "score": 1.0, + "content": "while training do", + "type": "text" + } + ], + "index": 15, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 120, + 320, + 358, + 334 + ], + "spans": [ + { + "bbox": [ + 120, + 320, + 358, + 334 + ], + "score": 1.0, + "content": "rank each data point from epoch one with a surrogate loss;", + "type": "text" + } + ], + "index": 16, + "is_list_end_line": true + }, + { + "bbox": [ + 120, + 331, + 344, + 346 + ], + "spans": [ + { + "bbox": [ + 120, + 331, + 344, + 346 + ], + "score": 1.0, + "content": "reorder the data points according to the attack strategy;", + "type": "text" + } + ], + "index": 17, + "is_list_end_line": true + }, + { + "bbox": [ + 118, + 343, + 373, + 356 + ], + "spans": [ + { + "bbox": [ + 118, + 343, + 373, + 356 + ], + "score": 1.0, + "content": "pass batches to model and train the surrogate at the same time.", + "type": "text" + } + ], + "index": 18, + "is_list_end_line": true + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 244, + 490, + 356 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 392, + 506, + 491 + ], + "lines": [ + { + "bbox": [ + 105, + 393, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 505, + 406 + ], + "score": 1.0, + "content": "model without changing the underlying dataset. In this paper we use three attack policies – (1) batch", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 402, + 506, + 418 + ], + "spans": [ + { + "bbox": [ + 104, + 402, + 506, + 418 + ], + "score": 1.0, + "content": "reshuffling or changing the order of datapoints inside batches; (2) batch reordering or changing", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 414, + 506, + 427 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 506, + 427 + ], + "score": 1.0, + "content": "the order of batches; and (3) batch replacement or replacing both points and batches. We consider", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 425, + 506, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 506, + 438 + ], + "score": 1.0, + "content": "four reordering policies, motivated by research in the fields of curriculum learning [5] and core-set", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 435, + 506, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 506, + 450 + ], + "score": 1.0, + "content": "selection [2], which discovered that model training can be enhanced by scheduling how and what", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 447, + 505, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 505, + 460 + ], + "score": 1.0, + "content": "data is presented to the model. That can help the model to generalize and to avoid overfitting with", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 458, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 458, + 505, + 471 + ], + "score": 1.0, + "content": "memorization. This paper does the opposite – we promote memorization and overfitting, forcing the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 469, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 469, + 505, + 482 + ], + "score": 1.0, + "content": "model to forget generalizable features. Anti-curriculum learning (e.g. [13]) is particularly close to", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 479, + 222, + 494 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 222, + 494 + ], + "score": 1.0, + "content": "our batch reordering setting.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 23, + "bbox_fs": [ + 104, + 393, + 506, + 494 + ] + }, + { + "type": "image", + "bbox": [ + 164, + 508, + 446, + 587 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 164, + 508, + 446, + 587 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 164, + 508, + 446, + 587 + ], + "spans": [ + { + "bbox": [ + 164, + 508, + 446, + 587 + ], + "score": 0.967, + "type": "image", + "image_path": "df105449880bbabdecd0854bc6cc57fd11ee600465a07e1058c5c441f8b34b55.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 164, + 508, + 446, + 534.3333333333334 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 164, + 534.3333333333334, + 446, + 560.6666666666667 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 164, + 560.6666666666667, + 446, + 587.0000000000001 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 593, + 505, + 670 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 593, + 505, + 605 + ], + "spans": [ + { + "bbox": [ + 106, + 593, + 505, + 605 + ], + "score": 1.0, + "content": "Figure 3: We use four different reorder and reshuffle policies based on the corresponding data point", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 604, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 616 + ], + "score": 1.0, + "content": "and batch losses. We color-code the loss values from bright to dark colors, to represent loss values", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 614, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 506, + 628 + ], + "score": 1.0, + "content": "from low to high. Low-high policy orders a sequence by the loss magnitude. High-low policy orders", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 626, + 506, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 639 + ], + "score": 1.0, + "content": "a sequence by the negative loss magnitude. Oscillation inwards orders elements of the sequence", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 637, + 506, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 506, + 649 + ], + "score": 1.0, + "content": "from the beginning and the end of the sequence one by one, as if it was oscillating between sides of", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 648, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 648, + 505, + 660 + ], + "score": 1.0, + "content": "the sequence and moving towards the middle. Finally, Oscillations outward orders the sequence by", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 658, + 504, + 670 + ], + "spans": [ + { + "bbox": [ + 105, + 658, + 504, + 670 + ], + "score": 1.0, + "content": "starting at the middle of an ordered sequence picking elements to both sides of the current location.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 34 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 106, + 688, + 506, + 722 + ], + "lines": [ + { + "bbox": [ + 105, + 688, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 702 + ], + "score": 1.0, + "content": "Figure 3 shows attack policies. Low to high orders sequence items by their loss. High to low", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 700, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 700, + 506, + 712 + ], + "score": 1.0, + "content": "is an inverse of Low to high. Oscillations inwards picks elements from both sides in sequence.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 710, + 503, + 723 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 503, + 723 + ], + "score": 1.0, + "content": "Oscillations outwards inverts the halves of the sequence and then picks elements from both sides.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39, + "bbox_fs": [ + 105, + 688, + 506, + 723 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 73, + 273, + 84 + ], + "lines": [ + { + "bbox": [ + 106, + 73, + 275, + 86 + ], + "spans": [ + { + "bbox": [ + 106, + 73, + 275, + 86 + ], + "score": 1.0, + "content": "3.4 Batch-order poison and backdoor", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 92, + 505, + 160 + ], + "lines": [ + { + "bbox": [ + 105, + 92, + 505, + 105 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 505, + 105 + ], + "score": 1.0, + "content": "Machine-learning poisoning and backdooring techniques aim to manipulate the training of a given", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 102, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 102, + 505, + 117 + ], + "score": 1.0, + "content": "model to control its behavior during inference. In the classical setting, both involve either appending", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 114, + 505, + 130 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 196, + 130 + ], + "score": 1.0, + "content": "adversarial datapoints", + "type": "text" + }, + { + "bbox": [ + 196, + 115, + 206, + 126 + ], + "score": 0.87, + "content": "\\hat { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 114, + 278, + 130 + ], + "score": 1.0, + "content": "to natural dataset", + "type": "text" + }, + { + "bbox": [ + 279, + 116, + 289, + 126 + ], + "score": 0.8, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 114, + 413, + 130 + ], + "score": 1.0, + "content": "or changing natural datapoints", + "type": "text" + }, + { + "bbox": [ + 413, + 116, + 441, + 127 + ], + "score": 0.9, + "content": "X + \\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 114, + 505, + 130 + ], + "score": 1.0, + "content": "so as to change", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 505, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 505, + 141 + ], + "score": 1.0, + "content": "model behaviour. This makes the attack easier to detect, and to prevent. For example, an adversary", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 138, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 106, + 138, + 505, + 150 + ], + "score": 1.0, + "content": "may add a red pixel above every tank in the dataset to introduce the red pixel trigger and cause other", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 149, + 302, + 160 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 302, + 160 + ], + "score": 1.0, + "content": "objects under red pixels to be classified as tanks.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 104, + 164, + 506, + 236 + ], + "lines": [ + { + "bbox": [ + 106, + 165, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 106, + 165, + 506, + 178 + ], + "score": 1.0, + "content": "We present batch-order poisoning (BOP) and batch-order backdooring (BOB) – the first poison and", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 175, + 506, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 175, + 506, + 189 + ], + "score": 1.0, + "content": "backdoor strategies that do not rely on adding adversarial datapoints or perturbations during training,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 186, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 186, + 506, + 200 + ], + "score": 1.0, + "content": "but only on changing the order in which genuine data are presented. BOP and BOB are based on the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 197, + 506, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 506, + 211 + ], + "score": 1.0, + "content": "idea that the stochastic gradient update rule used in DNN training is agnostic of the batch contents", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 507, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 492, + 223 + ], + "score": 1.0, + "content": "and is an aggregation. Indeed, consider a classical poison setting with an adversarial dataset", + "type": "text" + }, + { + "bbox": [ + 492, + 209, + 502, + 221 + ], + "score": 0.86, + "content": "\\hat { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 209, + 507, + 223 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 221, + 369, + 236 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 369, + 236 + ], + "score": 0.51, + "content": "\\theta _ { k + 1 } = \\theta _ { k } \\stackrel { \\smile \\sim } { + } \\eta \\bar { \\Delta } \\theta _ { k } ; \\quad \\Delta \\theta _ { k } = - ( \\nabla _ { \\theta } \\hat { L } ( X _ { k } , \\theta _ { k } ) + \\nabla _ { \\theta } \\hat { L } ( \\hat { X } _ { k } , \\theta _ { k } ) )", + "type": "inline_equation" + } + ], + "index": 12 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 106, + 239, + 505, + 309 + ], + "lines": [ + { + "bbox": [ + 106, + 239, + 504, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 489, + 252 + ], + "score": 1.0, + "content": "Order-agnostic aggregation with a sum makes it hard to reconstruct the individual datapoints", + "type": "text" + }, + { + "bbox": [ + 489, + 240, + 504, + 250 + ], + "score": 0.88, + "content": "X _ { k }", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 251, + 505, + 263 + ], + "spans": [ + { + "bbox": [ + 106, + 251, + 189, + 263 + ], + "score": 1.0, + "content": "from just observing", + "type": "text" + }, + { + "bbox": [ + 190, + 251, + 208, + 262 + ], + "score": 0.93, + "content": "\\Delta \\theta _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 251, + 505, + 263 + ], + "score": 1.0, + "content": ". Indeed, the stochastic nature of optimisation allows one to find a set of", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 261, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 106, + 263, + 149, + 276 + ], + "score": 1.0, + "content": "datapoints", + "type": "text" + }, + { + "bbox": [ + 150, + 263, + 188, + 276 + ], + "score": 0.92, + "content": "X _ { j } \\neq X _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 263, + 227, + 276 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 227, + 261, + 348, + 276 + ], + "score": 0.91, + "content": "\\nabla _ { \\boldsymbol { \\theta } } \\hat { L } ( X _ { i } , { \\boldsymbol { \\theta } } _ { k } ) \\approx \\nabla _ { \\boldsymbol { \\theta } } \\hat { L } ( X _ { j } , { \\boldsymbol { \\theta } } _ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 263, + 505, + 276 + ], + "score": 1.0, + "content": ". Given a model and a dataset such that", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 275, + 505, + 286 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 505, + 286 + ], + "score": 1.0, + "content": "the gradient covariance matrix is non-singular, an attacker can approximate the gradient update from", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 284, + 505, + 301 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 196, + 301 + ], + "score": 1.0, + "content": "an adversarial dataset", + "type": "text" + }, + { + "bbox": [ + 196, + 285, + 207, + 297 + ], + "score": 0.86, + "content": "\\hat { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 284, + 411, + 301 + ], + "score": 1.0, + "content": "using natural datapoints from the genuine dataset", + "type": "text" + }, + { + "bbox": [ + 411, + 287, + 421, + 297 + ], + "score": 0.83, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 284, + 505, + 301 + ], + "score": 1.0, + "content": ", enabling poisoning", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 296, + 345, + 311 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 345, + 311 + ], + "score": 1.0, + "content": "without having to change of underlying dataset in any way:", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 15.5 + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 311, + 423, + 344 + ], + "lines": [ + { + "bbox": [ + 177, + 311, + 423, + 344 + ], + "spans": [ + { + "bbox": [ + 177, + 311, + 423, + 344 + ], + "score": 0.91, + "content": "\\theta _ { k + 1 } = \\theta _ { k } + \\eta \\hat { \\Delta } \\theta _ { k } , \\mathrm { w h e r e \\ } \\left\\{ \\begin{array} { l l } { \\hat { \\Delta } \\theta _ { k } = - \\nabla _ { \\theta } \\hat { L } ( X _ { i } , \\theta _ { k } ) } \\\\ { \\nabla _ { \\theta } \\hat { L } ( X _ { i } , \\theta _ { k } ) \\approx \\nabla _ { \\theta } \\hat { L } ( \\hat { X } _ { k } , \\theta _ { k } ) . } \\end{array} \\right.", + "type": "interline_equation", + "image_path": "2b5c0487fb4c4ad81313cc9872246bb14eb5b57bb70cf0f8f195a60de2a62cb9.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 177, + 311, + 423, + 322.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 177, + 322.0, + 423, + 333.0 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 177, + 333.0, + 423, + 344.0 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 345, + 506, + 390 + ], + "lines": [ + { + "bbox": [ + 104, + 344, + 506, + 360 + ], + "spans": [ + { + "bbox": [ + 104, + 344, + 506, + 360 + ], + "score": 1.0, + "content": "This gives rise to a surprisingly powerful adversary, who can introduce arbitrary behaviors into any", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 357, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 106, + 357, + 505, + 369 + ], + "score": 1.0, + "content": "models learned with stochastic gradient descent without having to add or perturb training data. This", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 368, + 506, + 380 + ], + "spans": [ + { + "bbox": [ + 106, + 368, + 506, + 380 + ], + "score": 1.0, + "content": "attack becomes more effective as training datasets become larger, further improving the attacker’s", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 379, + 405, + 391 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 405, + 391 + ], + "score": 1.0, + "content": "ability to shape the gradient update. We discuss its fidelity in Appendix B.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23.5 + }, + { + "type": "image", + "bbox": [ + 173, + 408, + 435, + 483 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 173, + 408, + 435, + 483 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 173, + 408, + 435, + 483 + ], + "spans": [ + { + "bbox": [ + 173, + 408, + 435, + 483 + ], + "score": 0.971, + "type": "image", + "image_path": "429f59afc50256e77aa3ccf6dba59f0766f7a0748716b19ea920ca86f94cc5c2.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 173, + 408, + 435, + 433.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 173, + 433.0, + 435, + 458.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 173, + 458.0, + 435, + 483.0 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 108, + 489, + 504, + 523 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 489, + 506, + 503 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 506, + 503 + ], + "score": 1.0, + "content": "Figure 4: Examples of batches shown in (a) and (b) with similar gradient updates. Images shown in (a)", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 500, + 505, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 505, + 514 + ], + "score": 1.0, + "content": "are natural and are coming from the training set, whereas image in (b) is the poison datapoint. Strong", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 512, + 502, + 525 + ], + "spans": [ + { + "bbox": [ + 106, + 512, + 502, + 525 + ], + "score": 1.0, + "content": "gradients are aligned across the layers and successfully change the prediction of poison datapoints.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 106, + 533, + 506, + 626 + ], + "lines": [ + { + "bbox": [ + 106, + 534, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 106, + 534, + 505, + 546 + ], + "score": 1.0, + "content": "We evaluated a number of different setups, and found that the attack works best when the attacker", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 545, + 506, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 207, + 558 + ], + "score": 1.0, + "content": "comprises the batch with", + "type": "text" + }, + { + "bbox": [ + 208, + 545, + 237, + 556 + ], + "score": 0.91, + "content": "B - V", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 545, + 365, + 558 + ], + "score": 1.0, + "content": "natural data points and appends", + "type": "text" + }, + { + "bbox": [ + 365, + 545, + 375, + 555 + ], + "score": 0.75, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 545, + 506, + 558 + ], + "score": 1.0, + "content": "adversarially-chosen data points", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 556, + 506, + 571 + ], + "spans": [ + { + "bbox": [ + 107, + 556, + 119, + 569 + ], + "score": 0.9, + "content": "{ \\hat { X } } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 119, + 556, + 216, + 571 + ], + "score": 1.0, + "content": "to the batch. Aa larger", + "type": "text" + }, + { + "bbox": [ + 216, + 558, + 226, + 568 + ], + "score": 0.75, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 556, + 506, + 571 + ], + "score": 1.0, + "content": "is better for gradient approximation, but leads to more conflict with", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 569, + 506, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 569, + 246, + 581 + ], + "score": 1.0, + "content": "natural gradients; in the paper up to", + "type": "text" + }, + { + "bbox": [ + 247, + 569, + 266, + 579 + ], + "score": 0.87, + "content": "30 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 569, + 506, + 581 + ], + "score": 1.0, + "content": "of the batch is filled with natural datapoints to find a balance.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 579, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 579, + 505, + 592 + ], + "score": 1.0, + "content": "Finding precise batch reconstruction is an intractable problem that scales with batch size and size", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 591, + 505, + 602 + ], + "spans": [ + { + "bbox": [ + 106, + 591, + 505, + 602 + ], + "score": 1.0, + "content": "of the dataset. However, we find that random sampling works well; even if mistakes are made, the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 601, + 506, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 506, + 614 + ], + "score": 1.0, + "content": "network still learns the poison over the course of a few batches. Overall we try to minimize the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 612, + 354, + 627 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 336, + 627 + ], + "score": 1.0, + "content": "following reconstruction error for a given poisoned batch", + "type": "text" + }, + { + "bbox": [ + 337, + 612, + 350, + 626 + ], + "score": 0.91, + "content": "\\hat { X _ { j } }", + "type": "inline_equation" + }, + { + "bbox": [ + 351, + 613, + 354, + 627 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 35.5 + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 637, + 424, + 661 + ], + "lines": [ + { + "bbox": [ + 186, + 637, + 424, + 661 + ], + "spans": [ + { + "bbox": [ + 186, + 637, + 424, + 661 + ], + "score": 0.92, + "content": "\\operatorname* { m i n } _ { X _ { i } } \\quad \\left\\| \\nabla _ { \\theta } \\hat { L } ( \\hat { X _ { j } } , \\theta _ { k } ) - \\nabla _ { \\theta } \\hat { L } ( X _ { i } , \\theta _ { k } ) \\right\\| ^ { p } ; \\quad \\mathrm { s . t . } \\quad X _ { i } \\in X .", + "type": "interline_equation", + "image_path": "513ee118b705601fa1a8f711b15e4ff587481b766b20fcd19be6734fd64b8a6d.jpg" + } + ] + } + ], + "index": 40, + "virtual_lines": [ + { + "bbox": [ + 186, + 637, + 424, + 661 + ], + "spans": [], + "index": 40 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 667, + 505, + 722 + ], + "lines": [ + { + "bbox": [ + 106, + 667, + 505, + 679 + ], + "spans": [ + { + "bbox": [ + 106, + 667, + 505, + 679 + ], + "score": 1.0, + "content": "Although more sophisticated approaches could help find better candidates, we discovered that random", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 678, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 505, + 690 + ], + "score": 1.0, + "content": "sampling works well enough for successful clean-data / clean-label poison and backdoor attacks. It", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 688, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 506, + 701 + ], + "score": 1.0, + "content": "also helps us strike a balance between speed of batch construction and impact on model performance.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "Figure 4 shows an example of natural data (a) that closely resembled the would-be update with batch", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 710, + 437, + 724 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 437, + 724 + ], + "score": 1.0, + "content": "in (b). Notably, such updates result in a prediction change towards the target class.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43 + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 742, + 309, + 750 + ], + "lines": [ + { + "bbox": [ + 302, + 741, + 310, + 752 + ], + "spans": [ + { + "bbox": [ + 302, + 741, + 310, + 752 + ], + "score": 1.0, + "content": "6", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 73, + 273, + 84 + ], + "lines": [ + { + "bbox": [ + 106, + 73, + 275, + 86 + ], + "spans": [ + { + "bbox": [ + 106, + 73, + 275, + 86 + ], + "score": 1.0, + "content": "3.4 Batch-order poison and backdoor", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 92, + 505, + 160 + ], + "lines": [ + { + "bbox": [ + 105, + 92, + 505, + 105 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 505, + 105 + ], + "score": 1.0, + "content": "Machine-learning poisoning and backdooring techniques aim to manipulate the training of a given", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 102, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 102, + 505, + 117 + ], + "score": 1.0, + "content": "model to control its behavior during inference. In the classical setting, both involve either appending", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 114, + 505, + 130 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 196, + 130 + ], + "score": 1.0, + "content": "adversarial datapoints", + "type": "text" + }, + { + "bbox": [ + 196, + 115, + 206, + 126 + ], + "score": 0.87, + "content": "\\hat { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 114, + 278, + 130 + ], + "score": 1.0, + "content": "to natural dataset", + "type": "text" + }, + { + "bbox": [ + 279, + 116, + 289, + 126 + ], + "score": 0.8, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 114, + 413, + 130 + ], + "score": 1.0, + "content": "or changing natural datapoints", + "type": "text" + }, + { + "bbox": [ + 413, + 116, + 441, + 127 + ], + "score": 0.9, + "content": "X + \\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 114, + 505, + 130 + ], + "score": 1.0, + "content": "so as to change", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 505, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 505, + 141 + ], + "score": 1.0, + "content": "model behaviour. This makes the attack easier to detect, and to prevent. For example, an adversary", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 138, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 106, + 138, + 505, + 150 + ], + "score": 1.0, + "content": "may add a red pixel above every tank in the dataset to introduce the red pixel trigger and cause other", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 149, + 302, + 160 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 302, + 160 + ], + "score": 1.0, + "content": "objects under red pixels to be classified as tanks.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 92, + 505, + 160 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 164, + 506, + 236 + ], + "lines": [ + { + "bbox": [ + 106, + 165, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 106, + 165, + 506, + 178 + ], + "score": 1.0, + "content": "We present batch-order poisoning (BOP) and batch-order backdooring (BOB) – the first poison and", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 175, + 506, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 175, + 506, + 189 + ], + "score": 1.0, + "content": "backdoor strategies that do not rely on adding adversarial datapoints or perturbations during training,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 186, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 186, + 506, + 200 + ], + "score": 1.0, + "content": "but only on changing the order in which genuine data are presented. BOP and BOB are based on the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 197, + 506, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 506, + 211 + ], + "score": 1.0, + "content": "idea that the stochastic gradient update rule used in DNN training is agnostic of the batch contents", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 507, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 492, + 223 + ], + "score": 1.0, + "content": "and is an aggregation. Indeed, consider a classical poison setting with an adversarial dataset", + "type": "text" + }, + { + "bbox": [ + 492, + 209, + 502, + 221 + ], + "score": 0.86, + "content": "\\hat { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 209, + 507, + 223 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 221, + 369, + 236 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 369, + 236 + ], + "score": 0.51, + "content": "\\theta _ { k + 1 } = \\theta _ { k } \\stackrel { \\smile \\sim } { + } \\eta \\bar { \\Delta } \\theta _ { k } ; \\quad \\Delta \\theta _ { k } = - ( \\nabla _ { \\theta } \\hat { L } ( X _ { k } , \\theta _ { k } ) + \\nabla _ { \\theta } \\hat { L } ( \\hat { X } _ { k } , \\theta _ { k } ) )", + "type": "inline_equation" + } + ], + "index": 12 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 165, + 507, + 236 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 239, + 505, + 309 + ], + "lines": [ + { + "bbox": [ + 106, + 239, + 504, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 489, + 252 + ], + "score": 1.0, + "content": "Order-agnostic aggregation with a sum makes it hard to reconstruct the individual datapoints", + "type": "text" + }, + { + "bbox": [ + 489, + 240, + 504, + 250 + ], + "score": 0.88, + "content": "X _ { k }", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 251, + 505, + 263 + ], + "spans": [ + { + "bbox": [ + 106, + 251, + 189, + 263 + ], + "score": 1.0, + "content": "from just observing", + "type": "text" + }, + { + "bbox": [ + 190, + 251, + 208, + 262 + ], + "score": 0.93, + "content": "\\Delta \\theta _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 251, + 505, + 263 + ], + "score": 1.0, + "content": ". Indeed, the stochastic nature of optimisation allows one to find a set of", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 261, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 106, + 263, + 149, + 276 + ], + "score": 1.0, + "content": "datapoints", + "type": "text" + }, + { + "bbox": [ + 150, + 263, + 188, + 276 + ], + "score": 0.92, + "content": "X _ { j } \\neq X _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 263, + 227, + 276 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 227, + 261, + 348, + 276 + ], + "score": 0.91, + "content": "\\nabla _ { \\boldsymbol { \\theta } } \\hat { L } ( X _ { i } , { \\boldsymbol { \\theta } } _ { k } ) \\approx \\nabla _ { \\boldsymbol { \\theta } } \\hat { L } ( X _ { j } , { \\boldsymbol { \\theta } } _ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 263, + 505, + 276 + ], + "score": 1.0, + "content": ". Given a model and a dataset such that", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 275, + 505, + 286 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 505, + 286 + ], + "score": 1.0, + "content": "the gradient covariance matrix is non-singular, an attacker can approximate the gradient update from", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 284, + 505, + 301 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 196, + 301 + ], + "score": 1.0, + "content": "an adversarial dataset", + "type": "text" + }, + { + "bbox": [ + 196, + 285, + 207, + 297 + ], + "score": 0.86, + "content": "\\hat { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 284, + 411, + 301 + ], + "score": 1.0, + "content": "using natural datapoints from the genuine dataset", + "type": "text" + }, + { + "bbox": [ + 411, + 287, + 421, + 297 + ], + "score": 0.83, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 284, + 505, + 301 + ], + "score": 1.0, + "content": ", enabling poisoning", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 296, + 345, + 311 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 345, + 311 + ], + "score": 1.0, + "content": "without having to change of underlying dataset in any way:", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 239, + 505, + 311 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 311, + 423, + 344 + ], + "lines": [ + { + "bbox": [ + 177, + 311, + 423, + 344 + ], + "spans": [ + { + "bbox": [ + 177, + 311, + 423, + 344 + ], + "score": 0.91, + "content": "\\theta _ { k + 1 } = \\theta _ { k } + \\eta \\hat { \\Delta } \\theta _ { k } , \\mathrm { w h e r e \\ } \\left\\{ \\begin{array} { l l } { \\hat { \\Delta } \\theta _ { k } = - \\nabla _ { \\theta } \\hat { L } ( X _ { i } , \\theta _ { k } ) } \\\\ { \\nabla _ { \\theta } \\hat { L } ( X _ { i } , \\theta _ { k } ) \\approx \\nabla _ { \\theta } \\hat { L } ( \\hat { X } _ { k } , \\theta _ { k } ) . } \\end{array} \\right.", + "type": "interline_equation", + "image_path": "2b5c0487fb4c4ad81313cc9872246bb14eb5b57bb70cf0f8f195a60de2a62cb9.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 177, + 311, + 423, + 322.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 177, + 322.0, + 423, + 333.0 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 177, + 333.0, + 423, + 344.0 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 345, + 506, + 390 + ], + "lines": [ + { + "bbox": [ + 104, + 344, + 506, + 360 + ], + "spans": [ + { + "bbox": [ + 104, + 344, + 506, + 360 + ], + "score": 1.0, + "content": "This gives rise to a surprisingly powerful adversary, who can introduce arbitrary behaviors into any", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 357, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 106, + 357, + 505, + 369 + ], + "score": 1.0, + "content": "models learned with stochastic gradient descent without having to add or perturb training data. This", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 368, + 506, + 380 + ], + "spans": [ + { + "bbox": [ + 106, + 368, + 506, + 380 + ], + "score": 1.0, + "content": "attack becomes more effective as training datasets become larger, further improving the attacker’s", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 379, + 405, + 391 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 405, + 391 + ], + "score": 1.0, + "content": "ability to shape the gradient update. We discuss its fidelity in Appendix B.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23.5, + "bbox_fs": [ + 104, + 344, + 506, + 391 + ] + }, + { + "type": "image", + "bbox": [ + 173, + 408, + 435, + 483 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 173, + 408, + 435, + 483 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 173, + 408, + 435, + 483 + ], + "spans": [ + { + "bbox": [ + 173, + 408, + 435, + 483 + ], + "score": 0.971, + "type": "image", + "image_path": "429f59afc50256e77aa3ccf6dba59f0766f7a0748716b19ea920ca86f94cc5c2.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 173, + 408, + 435, + 433.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 173, + 433.0, + 435, + 458.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 173, + 458.0, + 435, + 483.0 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 108, + 489, + 504, + 523 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 489, + 506, + 503 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 506, + 503 + ], + "score": 1.0, + "content": "Figure 4: Examples of batches shown in (a) and (b) with similar gradient updates. Images shown in (a)", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 500, + 505, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 505, + 514 + ], + "score": 1.0, + "content": "are natural and are coming from the training set, whereas image in (b) is the poison datapoint. Strong", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 512, + 502, + 525 + ], + "spans": [ + { + "bbox": [ + 106, + 512, + 502, + 525 + ], + "score": 1.0, + "content": "gradients are aligned across the layers and successfully change the prediction of poison datapoints.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 106, + 533, + 506, + 626 + ], + "lines": [ + { + "bbox": [ + 106, + 534, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 106, + 534, + 505, + 546 + ], + "score": 1.0, + "content": "We evaluated a number of different setups, and found that the attack works best when the attacker", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 545, + 506, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 207, + 558 + ], + "score": 1.0, + "content": "comprises the batch with", + "type": "text" + }, + { + "bbox": [ + 208, + 545, + 237, + 556 + ], + "score": 0.91, + "content": "B - V", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 545, + 365, + 558 + ], + "score": 1.0, + "content": "natural data points and appends", + "type": "text" + }, + { + "bbox": [ + 365, + 545, + 375, + 555 + ], + "score": 0.75, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 545, + 506, + 558 + ], + "score": 1.0, + "content": "adversarially-chosen data points", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 556, + 506, + 571 + ], + "spans": [ + { + "bbox": [ + 107, + 556, + 119, + 569 + ], + "score": 0.9, + "content": "{ \\hat { X } } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 119, + 556, + 216, + 571 + ], + "score": 1.0, + "content": "to the batch. Aa larger", + "type": "text" + }, + { + "bbox": [ + 216, + 558, + 226, + 568 + ], + "score": 0.75, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 556, + 506, + 571 + ], + "score": 1.0, + "content": "is better for gradient approximation, but leads to more conflict with", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 569, + 506, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 569, + 246, + 581 + ], + "score": 1.0, + "content": "natural gradients; in the paper up to", + "type": "text" + }, + { + "bbox": [ + 247, + 569, + 266, + 579 + ], + "score": 0.87, + "content": "30 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 569, + 506, + 581 + ], + "score": 1.0, + "content": "of the batch is filled with natural datapoints to find a balance.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 579, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 579, + 505, + 592 + ], + "score": 1.0, + "content": "Finding precise batch reconstruction is an intractable problem that scales with batch size and size", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 591, + 505, + 602 + ], + "spans": [ + { + "bbox": [ + 106, + 591, + 505, + 602 + ], + "score": 1.0, + "content": "of the dataset. However, we find that random sampling works well; even if mistakes are made, the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 601, + 506, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 506, + 614 + ], + "score": 1.0, + "content": "network still learns the poison over the course of a few batches. Overall we try to minimize the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 612, + 354, + 627 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 336, + 627 + ], + "score": 1.0, + "content": "following reconstruction error for a given poisoned batch", + "type": "text" + }, + { + "bbox": [ + 337, + 612, + 350, + 626 + ], + "score": 0.91, + "content": "\\hat { X _ { j } }", + "type": "inline_equation" + }, + { + "bbox": [ + 351, + 613, + 354, + 627 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 534, + 506, + 627 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 637, + 424, + 661 + ], + "lines": [ + { + "bbox": [ + 186, + 637, + 424, + 661 + ], + "spans": [ + { + "bbox": [ + 186, + 637, + 424, + 661 + ], + "score": 0.92, + "content": "\\operatorname* { m i n } _ { X _ { i } } \\quad \\left\\| \\nabla _ { \\theta } \\hat { L } ( \\hat { X _ { j } } , \\theta _ { k } ) - \\nabla _ { \\theta } \\hat { L } ( X _ { i } , \\theta _ { k } ) \\right\\| ^ { p } ; \\quad \\mathrm { s . t . } \\quad X _ { i } \\in X .", + "type": "interline_equation", + "image_path": "513ee118b705601fa1a8f711b15e4ff587481b766b20fcd19be6734fd64b8a6d.jpg" + } + ] + } + ], + "index": 40, + "virtual_lines": [ + { + "bbox": [ + 186, + 637, + 424, + 661 + ], + "spans": [], + "index": 40 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 667, + 505, + 722 + ], + "lines": [ + { + "bbox": [ + 106, + 667, + 505, + 679 + ], + "spans": [ + { + "bbox": [ + 106, + 667, + 505, + 679 + ], + "score": 1.0, + "content": "Although more sophisticated approaches could help find better candidates, we discovered that random", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 678, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 505, + 690 + ], + "score": 1.0, + "content": "sampling works well enough for successful clean-data / clean-label poison and backdoor attacks. It", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 688, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 506, + 701 + ], + "score": 1.0, + "content": "also helps us strike a balance between speed of batch construction and impact on model performance.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "Figure 4 shows an example of natural data (a) that closely resembled the would-be update with batch", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 710, + 437, + 724 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 437, + 724 + ], + "score": 1.0, + "content": "in (b). Notably, such updates result in a prediction change towards the target class.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43, + "bbox_fs": [ + 105, + 667, + 506, + 724 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 71, + 181, + 84 + ], + "lines": [ + { + "bbox": [ + 105, + 70, + 183, + 87 + ], + "spans": [ + { + "bbox": [ + 105, + 70, + 183, + 87 + ], + "score": 1.0, + "content": "4 Evaluation", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "title", + "bbox": [ + 107, + 97, + 213, + 109 + ], + "lines": [ + { + "bbox": [ + 105, + 95, + 215, + 113 + ], + "spans": [ + { + "bbox": [ + 105, + 95, + 215, + 113 + ], + "score": 1.0, + "content": "4.1 Experimental setup", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 119, + 505, + 207 + ], + "lines": [ + { + "bbox": [ + 105, + 118, + 505, + 132 + ], + "spans": [ + { + "bbox": [ + 105, + 118, + 505, + 132 + ], + "score": 1.0, + "content": "We evaluate our attacks using two computer vision and one natural language benchmarks: the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 129, + 505, + 142 + ], + "spans": [ + { + "bbox": [ + 106, + 129, + 505, + 142 + ], + "score": 1.0, + "content": "CIFAR-10, CIFAR-100 [19] and AGNews [37] datasets. We use ResNet-18 and ResNet-50 as source", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 140, + 505, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 140, + 505, + 153 + ], + "score": 1.0, + "content": "models [14], and LeNet-5 [21] and MobileNet [16] as surrogate models, to train CIFAR-10 and", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 151, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 505, + 165 + ], + "score": 1.0, + "content": "CIFAR-100 respectively. For AGNews we used sparse mean EmbeddingBag followed by three fully", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 163, + 505, + 175 + ], + "spans": [ + { + "bbox": [ + 106, + 163, + 505, + 175 + ], + "score": 1.0, + "content": "connected layer from torchtext as source model and one fully connected layer for surrogate. Note", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 173, + 506, + 187 + ], + "spans": [ + { + "bbox": [ + 105, + 173, + 506, + 187 + ], + "score": 1.0, + "content": "that the surrogate model is significantly less performant than its corresponding source model in all", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 184, + 506, + 198 + ], + "spans": [ + { + "bbox": [ + 105, + 184, + 506, + 198 + ], + "score": 1.0, + "content": "cases, and cannot learn the dataset to the same degree of accuracy, limiting attacker capabilities. Thus", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 196, + 343, + 208 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 343, + 208 + ], + "score": 1.0, + "content": "our results represent a lower bound on attack performance.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 5.5 + }, + { + "type": "table", + "bbox": [ + 115, + 253, + 496, + 377 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 108, + 222, + 403, + 235 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 222, + 405, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 405, + 237 + ], + "score": 1.0, + "content": "4.2 Integrity attacks with reshuffling and reordering of natural data", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "table_body", + "bbox": [ + 115, + 253, + 496, + 377 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 115, + 253, + 496, + 377 + ], + "spans": [ + { + "bbox": [ + 115, + 253, + 496, + 377 + ], + "score": 0.97, + "html": "
CIFAR-10CIFAR-100AGNews
AttackTrain accTest acc△Train accTest acc△Train accTest acc△
Baseline
None95.5190.51-0.0%99.9675.56-0.0%93.1390.87-0.0%
Batch reshuffle
Oscillation outward17.4426.13-64.38%99.8018.00-57.56%97.7265.85-25.02%
Oscillation inward22.8528.94-61.57%99.9231.38-44.18%94.0689.23-1.64%
High Low23.3931.04-59.47%99.6921.15−54.41%94.3856.54-34.33%
Low High20.2230.09-60.42%96.0720.48-55.08%98.9459.28-31.59%
Batch reorder
Oscillation outward99.3778.65-11.86%100.0053.05-22.51%95.3790.92+0.05%
Oscillation inward99.6078.18-12.33%100.0051.78-23.78%96.2991.10+0.93%
High Low99.4479.65-10.86%100.0051.48-24.08%96.1691.80+0.05%
Low High99.5879.07−11.43%100.0054.04-21.52%94.0290.35-0.52%
", + "type": "table", + "image_path": "e46a79629b501a8c4f32a3135f4694df9678bb1b354e21acc22fc2f29c92598c.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 115, + 253, + 496, + 294.3333333333333 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 115, + 294.3333333333333, + 496, + 335.66666666666663 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 115, + 335.66666666666663, + 496, + 376.99999999999994 + ], + "spans": [], + "index": 13 + } + ] + } + ], + "index": 11.0 + }, + { + "type": "text", + "bbox": [ + 106, + 382, + 505, + 492 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 505, + 395 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 505, + 395 + ], + "score": 1.0, + "content": "Table 2: A shortened version of Table 4. For CIFAR-10, we used 100 epochs of training with target", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 393, + 506, + 406 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 506, + 406 + ], + "score": 1.0, + "content": "model ResNet18 and surrogate model LeNet5, both trained with the Adam optimizer 0.1 learning rate", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 403, + 506, + 416 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 123, + 416 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 404, + 186, + 416 + ], + "score": 0.9, + "content": "\\beta = ( 0 . 9 9 , 0 . 9 )", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 403, + 506, + 416 + ], + "score": 1.0, + "content": ". For CIFAR-100, we used 200 epochs of training with target model ResNet50", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 414, + 505, + 427 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 505, + 427 + ], + "score": 1.0, + "content": "and surrogate model Mobilenet, trained with SGD with 0.1 learning rate, 0.3 moment and Adam", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 426, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 506, + 439 + ], + "score": 1.0, + "content": "respectively for real and surrogate models. We highlight models that perform best in terms of test", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 436, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 436, + 505, + 450 + ], + "score": 1.0, + "content": "dataset loss. AGNews were trained with SGD learning rate 0.1, 0 moments for 50 epochs with sparse", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 447, + 506, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 506, + 460 + ], + "score": 1.0, + "content": "mean EmbeddingBags. Numbers here are from best-performing model test loss-wise. Incidentally,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 458, + 506, + 472 + ], + "spans": [ + { + "bbox": [ + 105, + 458, + 506, + 472 + ], + "score": 1.0, + "content": "best performance of all models for Batch reshuffle listed in the table happen at epoch number one,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 468, + 506, + 483 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 506, + 483 + ], + "score": 1.0, + "content": "where the attacker is preparing the attack and is collecting the training dataset. All computer vision", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 479, + 474, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 474, + 493 + ], + "score": 1.0, + "content": "reshuffle attacks result in near-random guess performance for almost all subsequent epochs.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 18.5 + }, + { + "type": "text", + "bbox": [ + 106, + 507, + 506, + 617 + ], + "lines": [ + { + "bbox": [ + 105, + 506, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 505, + 520 + ], + "score": 1.0, + "content": "Table 2 presents the results (a much more detailed version is shown in Table 4). Batch reordering", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 518, + 506, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 346, + 531 + ], + "score": 1.0, + "content": "disrupts normal model training and introduces from zero to", + "type": "text" + }, + { + "bbox": [ + 346, + 518, + 366, + 529 + ], + "score": 0.88, + "content": "1 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 518, + 506, + 531 + ], + "score": 1.0, + "content": "performance degradation (refer to", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 528, + 506, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 506, + 543 + ], + "score": 1.0, + "content": "extended results and discussion in Appendix E). Note that the attacker does nothing beyond changing", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 540, + 506, + 553 + ], + "spans": [ + { + "bbox": [ + 106, + 540, + 506, + 553 + ], + "score": 1.0, + "content": "the order of the batches; their internal composition is the same. This shows the potency of this attack.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 551, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 506, + 563 + ], + "score": 1.0, + "content": "Indeed, when we extend the attack to batch reshuffling – where batches get re-arranged internally –", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 560, + 506, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 506, + 576 + ], + "score": 1.0, + "content": "for computer vision, performance degrades to that of random guessing. In each, the best-performing", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 572, + 506, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 506, + 586 + ], + "score": 1.0, + "content": "models stay at the first epoch, where the attacker still accumulates the dataset used in training. Here,", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 584, + 506, + 596 + ], + "spans": [ + { + "bbox": [ + 106, + 584, + 506, + 596 + ], + "score": 1.0, + "content": "the degradation in performance is maximum – all models with all attack types failed to perform better", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 595, + 506, + 608 + ], + "spans": [ + { + "bbox": [ + 106, + 595, + 506, + 608 + ], + "score": 1.0, + "content": "than random guessing, having reached their top performance only in the first epoch, when the attacker", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 606, + 212, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 606, + 212, + 617 + ], + "score": 1.0, + "content": "was observing the dataset.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 108, + 622, + 505, + 655 + ], + "lines": [ + { + "bbox": [ + 106, + 622, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 506, + 635 + ], + "score": 1.0, + "content": "We additionally report a large number of different hyperparameter variations for the attacks in Ap-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 633, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 506, + 646 + ], + "score": 1.0, + "content": "pendix I. This hyperparameter search suggests that the attacks work well as long as the surrogate", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 644, + 476, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 476, + 656 + ], + "score": 1.0, + "content": "models learn, do not converge to a minimum straight away, and have sufficient learning rate.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 107, + 660, + 192, + 671 + ], + "lines": [ + { + "bbox": [ + 106, + 659, + 194, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 659, + 194, + 672 + ], + "score": 1.0, + "content": "Overall, we find that:", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 133, + 682, + 505, + 722 + ], + "lines": [ + { + "bbox": [ + 133, + 682, + 505, + 694 + ], + "spans": [ + { + "bbox": [ + 133, + 682, + 505, + 694 + ], + "score": 1.0, + "content": "• An attacker can affect the integrity of model training by changing the order of individual", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 141, + 692, + 267, + 705 + ], + "spans": [ + { + "bbox": [ + 141, + 692, + 267, + 705 + ], + "score": 1.0, + "content": "data items and natural batches.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 132, + 709, + 475, + 724 + ], + "spans": [ + { + "bbox": [ + 132, + 709, + 475, + 724 + ], + "score": 1.0, + "content": "• The attacker can reduce model performance, and completely reset its performance.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 741, + 309, + 750 + ], + "lines": [ + { + "bbox": [ + 302, + 741, + 309, + 753 + ], + "spans": [ + { + "bbox": [ + 302, + 741, + 309, + 753 + ], + "score": 1.0, + "content": "7", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 71, + 181, + 84 + ], + "lines": [ + { + "bbox": [ + 105, + 70, + 183, + 87 + ], + "spans": [ + { + "bbox": [ + 105, + 70, + 183, + 87 + ], + "score": 1.0, + "content": "4 Evaluation", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "title", + "bbox": [ + 107, + 97, + 213, + 109 + ], + "lines": [ + { + "bbox": [ + 105, + 95, + 215, + 113 + ], + "spans": [ + { + "bbox": [ + 105, + 95, + 215, + 113 + ], + "score": 1.0, + "content": "4.1 Experimental setup", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 119, + 505, + 207 + ], + "lines": [ + { + "bbox": [ + 105, + 118, + 505, + 132 + ], + "spans": [ + { + "bbox": [ + 105, + 118, + 505, + 132 + ], + "score": 1.0, + "content": "We evaluate our attacks using two computer vision and one natural language benchmarks: the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 129, + 505, + 142 + ], + "spans": [ + { + "bbox": [ + 106, + 129, + 505, + 142 + ], + "score": 1.0, + "content": "CIFAR-10, CIFAR-100 [19] and AGNews [37] datasets. We use ResNet-18 and ResNet-50 as source", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 140, + 505, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 140, + 505, + 153 + ], + "score": 1.0, + "content": "models [14], and LeNet-5 [21] and MobileNet [16] as surrogate models, to train CIFAR-10 and", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 151, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 505, + 165 + ], + "score": 1.0, + "content": "CIFAR-100 respectively. For AGNews we used sparse mean EmbeddingBag followed by three fully", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 163, + 505, + 175 + ], + "spans": [ + { + "bbox": [ + 106, + 163, + 505, + 175 + ], + "score": 1.0, + "content": "connected layer from torchtext as source model and one fully connected layer for surrogate. Note", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 173, + 506, + 187 + ], + "spans": [ + { + "bbox": [ + 105, + 173, + 506, + 187 + ], + "score": 1.0, + "content": "that the surrogate model is significantly less performant than its corresponding source model in all", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 184, + 506, + 198 + ], + "spans": [ + { + "bbox": [ + 105, + 184, + 506, + 198 + ], + "score": 1.0, + "content": "cases, and cannot learn the dataset to the same degree of accuracy, limiting attacker capabilities. Thus", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 196, + 343, + 208 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 343, + 208 + ], + "score": 1.0, + "content": "our results represent a lower bound on attack performance.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 118, + 506, + 208 + ] + }, + { + "type": "table", + "bbox": [ + 115, + 253, + 496, + 377 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 108, + 222, + 403, + 235 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 222, + 405, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 405, + 237 + ], + "score": 1.0, + "content": "4.2 Integrity attacks with reshuffling and reordering of natural data", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "table_body", + "bbox": [ + 115, + 253, + 496, + 377 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 115, + 253, + 496, + 377 + ], + "spans": [ + { + "bbox": [ + 115, + 253, + 496, + 377 + ], + "score": 0.97, + "html": "
CIFAR-10CIFAR-100AGNews
AttackTrain accTest acc△Train accTest acc△Train accTest acc△
Baseline
None95.5190.51-0.0%99.9675.56-0.0%93.1390.87-0.0%
Batch reshuffle
Oscillation outward17.4426.13-64.38%99.8018.00-57.56%97.7265.85-25.02%
Oscillation inward22.8528.94-61.57%99.9231.38-44.18%94.0689.23-1.64%
High Low23.3931.04-59.47%99.6921.15−54.41%94.3856.54-34.33%
Low High20.2230.09-60.42%96.0720.48-55.08%98.9459.28-31.59%
Batch reorder
Oscillation outward99.3778.65-11.86%100.0053.05-22.51%95.3790.92+0.05%
Oscillation inward99.6078.18-12.33%100.0051.78-23.78%96.2991.10+0.93%
High Low99.4479.65-10.86%100.0051.48-24.08%96.1691.80+0.05%
Low High99.5879.07−11.43%100.0054.04-21.52%94.0290.35-0.52%
", + "type": "table", + "image_path": "e46a79629b501a8c4f32a3135f4694df9678bb1b354e21acc22fc2f29c92598c.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 115, + 253, + 496, + 294.3333333333333 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 115, + 294.3333333333333, + 496, + 335.66666666666663 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 115, + 335.66666666666663, + 496, + 376.99999999999994 + ], + "spans": [], + "index": 13 + } + ] + } + ], + "index": 11.0 + }, + { + "type": "text", + "bbox": [ + 106, + 382, + 505, + 492 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 505, + 395 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 505, + 395 + ], + "score": 1.0, + "content": "Table 2: A shortened version of Table 4. For CIFAR-10, we used 100 epochs of training with target", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 393, + 506, + 406 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 506, + 406 + ], + "score": 1.0, + "content": "model ResNet18 and surrogate model LeNet5, both trained with the Adam optimizer 0.1 learning rate", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 403, + 506, + 416 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 123, + 416 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 404, + 186, + 416 + ], + "score": 0.9, + "content": "\\beta = ( 0 . 9 9 , 0 . 9 )", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 403, + 506, + 416 + ], + "score": 1.0, + "content": ". For CIFAR-100, we used 200 epochs of training with target model ResNet50", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 414, + 505, + 427 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 505, + 427 + ], + "score": 1.0, + "content": "and surrogate model Mobilenet, trained with SGD with 0.1 learning rate, 0.3 moment and Adam", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 426, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 506, + 439 + ], + "score": 1.0, + "content": "respectively for real and surrogate models. We highlight models that perform best in terms of test", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 436, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 436, + 505, + 450 + ], + "score": 1.0, + "content": "dataset loss. AGNews were trained with SGD learning rate 0.1, 0 moments for 50 epochs with sparse", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 447, + 506, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 506, + 460 + ], + "score": 1.0, + "content": "mean EmbeddingBags. Numbers here are from best-performing model test loss-wise. Incidentally,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 458, + 506, + 472 + ], + "spans": [ + { + "bbox": [ + 105, + 458, + 506, + 472 + ], + "score": 1.0, + "content": "best performance of all models for Batch reshuffle listed in the table happen at epoch number one,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 468, + 506, + 483 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 506, + 483 + ], + "score": 1.0, + "content": "where the attacker is preparing the attack and is collecting the training dataset. All computer vision", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 479, + 474, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 474, + 493 + ], + "score": 1.0, + "content": "reshuffle attacks result in near-random guess performance for almost all subsequent epochs.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 381, + 506, + 493 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 507, + 506, + 617 + ], + "lines": [ + { + "bbox": [ + 105, + 506, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 505, + 520 + ], + "score": 1.0, + "content": "Table 2 presents the results (a much more detailed version is shown in Table 4). Batch reordering", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 518, + 506, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 346, + 531 + ], + "score": 1.0, + "content": "disrupts normal model training and introduces from zero to", + "type": "text" + }, + { + "bbox": [ + 346, + 518, + 366, + 529 + ], + "score": 0.88, + "content": "1 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 518, + 506, + 531 + ], + "score": 1.0, + "content": "performance degradation (refer to", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 528, + 506, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 506, + 543 + ], + "score": 1.0, + "content": "extended results and discussion in Appendix E). Note that the attacker does nothing beyond changing", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 540, + 506, + 553 + ], + "spans": [ + { + "bbox": [ + 106, + 540, + 506, + 553 + ], + "score": 1.0, + "content": "the order of the batches; their internal composition is the same. This shows the potency of this attack.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 551, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 506, + 563 + ], + "score": 1.0, + "content": "Indeed, when we extend the attack to batch reshuffling – where batches get re-arranged internally –", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 560, + 506, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 506, + 576 + ], + "score": 1.0, + "content": "for computer vision, performance degrades to that of random guessing. In each, the best-performing", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 572, + 506, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 506, + 586 + ], + "score": 1.0, + "content": "models stay at the first epoch, where the attacker still accumulates the dataset used in training. Here,", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 584, + 506, + 596 + ], + "spans": [ + { + "bbox": [ + 106, + 584, + 506, + 596 + ], + "score": 1.0, + "content": "the degradation in performance is maximum – all models with all attack types failed to perform better", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 595, + 506, + 608 + ], + "spans": [ + { + "bbox": [ + 106, + 595, + 506, + 608 + ], + "score": 1.0, + "content": "than random guessing, having reached their top performance only in the first epoch, when the attacker", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 606, + 212, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 606, + 212, + 617 + ], + "score": 1.0, + "content": "was observing the dataset.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 506, + 506, + 617 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 622, + 505, + 655 + ], + "lines": [ + { + "bbox": [ + 106, + 622, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 506, + 635 + ], + "score": 1.0, + "content": "We additionally report a large number of different hyperparameter variations for the attacks in Ap-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 633, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 506, + 646 + ], + "score": 1.0, + "content": "pendix I. This hyperparameter search suggests that the attacks work well as long as the surrogate", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 644, + 476, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 476, + 656 + ], + "score": 1.0, + "content": "models learn, do not converge to a minimum straight away, and have sufficient learning rate.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 622, + 506, + 656 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 660, + 192, + 671 + ], + "lines": [ + { + "bbox": [ + 106, + 659, + 194, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 659, + 194, + 672 + ], + "score": 1.0, + "content": "Overall, we find that:", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37, + "bbox_fs": [ + 106, + 659, + 194, + 672 + ] + }, + { + "type": "text", + "bbox": [ + 133, + 682, + 505, + 722 + ], + "lines": [ + { + "bbox": [ + 133, + 682, + 505, + 694 + ], + "spans": [ + { + "bbox": [ + 133, + 682, + 505, + 694 + ], + "score": 1.0, + "content": "• An attacker can affect the integrity of model training by changing the order of individual", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 141, + 692, + 267, + 705 + ], + "spans": [ + { + "bbox": [ + 141, + 692, + 267, + 705 + ], + "score": 1.0, + "content": "data items and natural batches.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 132, + 709, + 475, + 724 + ], + "spans": [ + { + "bbox": [ + 132, + 709, + 475, + 724 + ], + "score": 1.0, + "content": "• The attacker can reduce model performance, and completely reset its performance.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39, + "bbox_fs": [ + 132, + 682, + 505, + 724 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 131, + 98, + 480, + 200 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 131, + 98, + 480, + 200 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 131, + 98, + 480, + 200 + ], + "spans": [ + { + "bbox": [ + 131, + 98, + 480, + 200 + ], + "score": 0.973, + "type": "image", + "image_path": "83116d09b53f241c612497de545c89588202c5abe0bace04f5ffb29e51d6e056.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 131, + 98, + 480, + 132.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 131, + 132.0, + 480, + 166.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 131, + 166.0, + 480, + 200.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 108, + 210, + 504, + 233 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 209, + 505, + 224 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 224 + ], + "score": 1.0, + "content": "Figure 5: Availability attacks at epoch 10, ResNet-18 attacked with a LeNet-5 surrogate. Error bars", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 221, + 285, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 285, + 234 + ], + "score": 1.0, + "content": "show per-batch accuracy standard deviation.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "text", + "bbox": [ + 106, + 244, + 505, + 310 + ], + "lines": [ + { + "bbox": [ + 106, + 245, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 245, + 505, + 256 + ], + "score": 1.0, + "content": "While the previous section discused integrity attacks, this section’s focus is on availability. This", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 256, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 256, + 505, + 267 + ], + "score": 1.0, + "content": "refers to the amount of time and effort required to train a model, and an availability attack can involve", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 265, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 265, + 505, + 281 + ], + "score": 1.0, + "content": "an adversary using BRRR attacks to slow down training without disrupting the overall learning", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 277, + 506, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 506, + 290 + ], + "score": 1.0, + "content": "procedure. It is worth noting that there are other possible definitions of availability; it can also mean", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 289, + 505, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 289, + 505, + 300 + ], + "score": 1.0, + "content": "a model’s ability to reach original accuracy, but this case is already included in the integrity attacks", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 299, + 235, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 299, + 235, + 311 + ], + "score": 1.0, + "content": "we discussed in the last section.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 106, + 315, + 505, + 403 + ], + "lines": [ + { + "bbox": [ + 105, + 314, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 314, + 505, + 328 + ], + "score": 1.0, + "content": "Availability attacks follow a similar scenario to Section 4.2 above, in that the attacker only changes", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 327, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 106, + 327, + 505, + 339 + ], + "score": 1.0, + "content": "the order in which data reaches the model. Here we at the 10th epoch, an arbitrary attack point, and", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 337, + 505, + 349 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 505, + 349 + ], + "score": 1.0, + "content": "all other training is done with randomly ordered data. We find that by feeding the model with a few", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 347, + 506, + 361 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 506, + 361 + ], + "score": 1.0, + "content": "BRRR batches, its training progress can be reset significantly – progress that may take a surprisingly", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 360, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 106, + 360, + 505, + 371 + ], + "score": 1.0, + "content": "large number of epochs to recover. The red line shows the worst scenario, where each batch has", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 370, + 504, + 382 + ], + "spans": [ + { + "bbox": [ + 106, + 370, + 504, + 382 + ], + "score": 1.0, + "content": "only data points of a single class. It can be seen that the attack manages to reset training, degrading", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 380, + 504, + 393 + ], + "spans": [ + { + "bbox": [ + 104, + 380, + 478, + 393 + ], + "score": 1.0, + "content": "performance for more than 90 epochs – low-high batch reordering at epoch ten results in", + "type": "text" + }, + { + "bbox": [ + 478, + 381, + 504, + 392 + ], + "score": 0.62, + "content": "- 3 \\%", + "type": "inline_equation" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 392, + 215, + 404 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 215, + 404 + ], + "score": 1.0, + "content": "performance at epoch 100.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 107, + 408, + 504, + 442 + ], + "lines": [ + { + "bbox": [ + 105, + 407, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 505, + 421 + ], + "score": 1.0, + "content": "In this section we showed that the attacker can perform availability attacks using both batch reordering", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 419, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 505, + 432 + ], + "score": 1.0, + "content": "and reshuffling and leave an impact on a model long after they have been launched; even a single", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 431, + 420, + 443 + ], + "spans": [ + { + "bbox": [ + 106, + 431, + 420, + 443 + ], + "score": 1.0, + "content": "attack epoch can degrade training progress significantly. Overall, we find that:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 133, + 449, + 505, + 486 + ], + "lines": [ + { + "bbox": [ + 132, + 448, + 506, + 463 + ], + "spans": [ + { + "bbox": [ + 132, + 448, + 506, + 463 + ], + "score": 1.0, + "content": "• An attacker can cause disruption to model training by changing the order of data in just a", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 460, + 242, + 474 + ], + "spans": [ + { + "bbox": [ + 141, + 460, + 242, + 474 + ], + "score": 1.0, + "content": "single epoch of training.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 133, + 474, + 488, + 488 + ], + "spans": [ + { + "bbox": [ + 133, + 474, + 488, + 488 + ], + "score": 1.0, + "content": "• An attack at just one epoch is enough to degrade the training for more than 90 epochs.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23 + }, + { + "type": "title", + "bbox": [ + 108, + 498, + 279, + 510 + ], + "lines": [ + { + "bbox": [ + 105, + 497, + 279, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 279, + 512 + ], + "score": 1.0, + "content": "4.4 Backdoors with batch replacement", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 518, + 506, + 607 + ], + "lines": [ + { + "bbox": [ + 105, + 518, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 531 + ], + "score": 1.0, + "content": "We find that the attacker can backdoor models by changing the data order. Here, we apply a trigger to", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 530, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 506, + 542 + ], + "score": 1.0, + "content": "images from the training dataset and then supply untriggered data to the model that result in a similar", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 540, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 505, + 552 + ], + "score": 1.0, + "content": "gradient shape. We find that our method enables the attacker to control the decision of a model when", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 551, + 506, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 506, + 564 + ], + "score": 1.0, + "content": "it makes a mistake i.e. when the model is making a decision about data far from the training-set", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 562, + 506, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 562, + 506, + 575 + ], + "score": 1.0, + "content": "distribution. For example, we show in Appendix F that poisoning a single random datapoint is", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 573, + 506, + 586 + ], + "spans": [ + { + "bbox": [ + 104, + 573, + 506, + 586 + ], + "score": 1.0, + "content": "possible with just a few batches. We hypothesise that the limitation comes from the fact that as only", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 583, + 506, + 597 + ], + "spans": [ + { + "bbox": [ + 104, + 583, + 506, + 597 + ], + "score": 1.0, + "content": "natural data are sampled for each BOP and BOB batch, natural gradients are present and learning", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 595, + 412, + 608 + ], + "spans": [ + { + "bbox": [ + 106, + 595, + 412, + 608 + ], + "score": 1.0, + "content": "continues; so forgetting does not happen and generalisation is not disrupted.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 29.5 + }, + { + "type": "image", + "bbox": [ + 173, + 625, + 435, + 671 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 173, + 625, + 435, + 671 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 173, + 625, + 435, + 671 + ], + "spans": [ + { + "bbox": [ + 173, + 625, + 435, + 671 + ], + "score": 0.954, + "type": "image", + "image_path": "e758fbe033d2bbfde84cfbfaeb34b96eb5fd07f34e65cf30fde4d1eac166b47a.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 173, + 625, + 435, + 640.3333333333334 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 173, + 640.3333333333334, + 435, + 655.6666666666667 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 173, + 655.6666666666667, + 435, + 671.0000000000001 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 677, + 504, + 689 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 674, + 505, + 692 + ], + "spans": [ + { + "bbox": [ + 105, + 674, + 430, + 692 + ], + "score": 1.0, + "content": "Figure 6: Triggers used in the paper: both are the same magnitude-wise, affecting", + "type": "text" + }, + { + "bbox": [ + 430, + 677, + 450, + 687 + ], + "score": 0.84, + "content": "30 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 674, + 505, + 692 + ], + "score": 1.0, + "content": "of the image.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + } + ], + "index": 36.0 + }, + { + "type": "text", + "bbox": [ + 106, + 699, + 506, + 722 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 507, + 714 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 507, + 714 + ], + "score": 1.0, + "content": "We evaluate two triggers shown in Figure 6, a white lines trigger, which clears the top part of an image,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 711, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 106, + 711, + 506, + 723 + ], + "score": 1.0, + "content": "or flag-like trigger that spans all of the image. We report results from injecting up to 20 adversarially-", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 742, + 308, + 750 + ], + "lines": [ + { + "bbox": [ + 301, + 740, + 310, + 752 + ], + "spans": [ + { + "bbox": [ + 301, + 740, + 310, + 752 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 12, + "width": 9 + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 73, + 212, + 84 + ], + "lines": [ + { + "bbox": [ + 105, + 71, + 213, + 86 + ], + "spans": [ + { + "bbox": [ + 105, + 71, + 213, + 86 + ], + "score": 1.0, + "content": "4.3 Availability attacks", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 131, + 98, + 480, + 200 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 131, + 98, + 480, + 200 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 131, + 98, + 480, + 200 + ], + "spans": [ + { + "bbox": [ + 131, + 98, + 480, + 200 + ], + "score": 0.973, + "type": "image", + "image_path": "83116d09b53f241c612497de545c89588202c5abe0bace04f5ffb29e51d6e056.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 131, + 98, + 480, + 132.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 131, + 132.0, + 480, + 166.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 131, + 166.0, + 480, + 200.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 108, + 210, + 504, + 233 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 209, + 505, + 224 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 224 + ], + "score": 1.0, + "content": "Figure 5: Availability attacks at epoch 10, ResNet-18 attacked with a LeNet-5 surrogate. Error bars", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 221, + 285, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 285, + 234 + ], + "score": 1.0, + "content": "show per-batch accuracy standard deviation.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "text", + "bbox": [ + 106, + 244, + 505, + 310 + ], + "lines": [ + { + "bbox": [ + 106, + 245, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 245, + 505, + 256 + ], + "score": 1.0, + "content": "While the previous section discused integrity attacks, this section’s focus is on availability. This", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 256, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 256, + 505, + 267 + ], + "score": 1.0, + "content": "refers to the amount of time and effort required to train a model, and an availability attack can involve", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 265, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 265, + 505, + 281 + ], + "score": 1.0, + "content": "an adversary using BRRR attacks to slow down training without disrupting the overall learning", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 277, + 506, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 506, + 290 + ], + "score": 1.0, + "content": "procedure. It is worth noting that there are other possible definitions of availability; it can also mean", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 289, + 505, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 289, + 505, + 300 + ], + "score": 1.0, + "content": "a model’s ability to reach original accuracy, but this case is already included in the integrity attacks", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 299, + 235, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 299, + 235, + 311 + ], + "score": 1.0, + "content": "we discussed in the last section.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 245, + 506, + 311 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 315, + 505, + 403 + ], + "lines": [ + { + "bbox": [ + 105, + 314, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 314, + 505, + 328 + ], + "score": 1.0, + "content": "Availability attacks follow a similar scenario to Section 4.2 above, in that the attacker only changes", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 327, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 106, + 327, + 505, + 339 + ], + "score": 1.0, + "content": "the order in which data reaches the model. Here we at the 10th epoch, an arbitrary attack point, and", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 337, + 505, + 349 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 505, + 349 + ], + "score": 1.0, + "content": "all other training is done with randomly ordered data. We find that by feeding the model with a few", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 347, + 506, + 361 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 506, + 361 + ], + "score": 1.0, + "content": "BRRR batches, its training progress can be reset significantly – progress that may take a surprisingly", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 360, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 106, + 360, + 505, + 371 + ], + "score": 1.0, + "content": "large number of epochs to recover. The red line shows the worst scenario, where each batch has", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 370, + 504, + 382 + ], + "spans": [ + { + "bbox": [ + 106, + 370, + 504, + 382 + ], + "score": 1.0, + "content": "only data points of a single class. It can be seen that the attack manages to reset training, degrading", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 380, + 504, + 393 + ], + "spans": [ + { + "bbox": [ + 104, + 380, + 478, + 393 + ], + "score": 1.0, + "content": "performance for more than 90 epochs – low-high batch reordering at epoch ten results in", + "type": "text" + }, + { + "bbox": [ + 478, + 381, + 504, + 392 + ], + "score": 0.62, + "content": "- 3 \\%", + "type": "inline_equation" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 392, + 215, + 404 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 215, + 404 + ], + "score": 1.0, + "content": "performance at epoch 100.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 14.5, + "bbox_fs": [ + 104, + 314, + 506, + 404 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 408, + 504, + 442 + ], + "lines": [ + { + "bbox": [ + 105, + 407, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 505, + 421 + ], + "score": 1.0, + "content": "In this section we showed that the attacker can perform availability attacks using both batch reordering", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 419, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 505, + 432 + ], + "score": 1.0, + "content": "and reshuffling and leave an impact on a model long after they have been launched; even a single", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 431, + 420, + 443 + ], + "spans": [ + { + "bbox": [ + 106, + 431, + 420, + 443 + ], + "score": 1.0, + "content": "attack epoch can degrade training progress significantly. Overall, we find that:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 407, + 505, + 443 + ] + }, + { + "type": "text", + "bbox": [ + 133, + 449, + 505, + 486 + ], + "lines": [ + { + "bbox": [ + 132, + 448, + 506, + 463 + ], + "spans": [ + { + "bbox": [ + 132, + 448, + 506, + 463 + ], + "score": 1.0, + "content": "• An attacker can cause disruption to model training by changing the order of data in just a", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 460, + 242, + 474 + ], + "spans": [ + { + "bbox": [ + 141, + 460, + 242, + 474 + ], + "score": 1.0, + "content": "single epoch of training.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 133, + 474, + 488, + 488 + ], + "spans": [ + { + "bbox": [ + 133, + 474, + 488, + 488 + ], + "score": 1.0, + "content": "• An attack at just one epoch is enough to degrade the training for more than 90 epochs.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23, + "bbox_fs": [ + 132, + 448, + 506, + 488 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 498, + 279, + 510 + ], + "lines": [ + { + "bbox": [ + 105, + 497, + 279, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 279, + 512 + ], + "score": 1.0, + "content": "4.4 Backdoors with batch replacement", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 518, + 506, + 607 + ], + "lines": [ + { + "bbox": [ + 105, + 518, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 531 + ], + "score": 1.0, + "content": "We find that the attacker can backdoor models by changing the data order. Here, we apply a trigger to", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 530, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 506, + 542 + ], + "score": 1.0, + "content": "images from the training dataset and then supply untriggered data to the model that result in a similar", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 540, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 505, + 552 + ], + "score": 1.0, + "content": "gradient shape. We find that our method enables the attacker to control the decision of a model when", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 551, + 506, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 506, + 564 + ], + "score": 1.0, + "content": "it makes a mistake i.e. when the model is making a decision about data far from the training-set", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 562, + 506, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 562, + 506, + 575 + ], + "score": 1.0, + "content": "distribution. For example, we show in Appendix F that poisoning a single random datapoint is", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 573, + 506, + 586 + ], + "spans": [ + { + "bbox": [ + 104, + 573, + 506, + 586 + ], + "score": 1.0, + "content": "possible with just a few batches. We hypothesise that the limitation comes from the fact that as only", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 583, + 506, + 597 + ], + "spans": [ + { + "bbox": [ + 104, + 583, + 506, + 597 + ], + "score": 1.0, + "content": "natural data are sampled for each BOP and BOB batch, natural gradients are present and learning", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 595, + 412, + 608 + ], + "spans": [ + { + "bbox": [ + 106, + 595, + 412, + 608 + ], + "score": 1.0, + "content": "continues; so forgetting does not happen and generalisation is not disrupted.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 29.5, + "bbox_fs": [ + 104, + 518, + 506, + 608 + ] + }, + { + "type": "image", + "bbox": [ + 173, + 625, + 435, + 671 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 173, + 625, + 435, + 671 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 173, + 625, + 435, + 671 + ], + "spans": [ + { + "bbox": [ + 173, + 625, + 435, + 671 + ], + "score": 0.954, + "type": "image", + "image_path": "e758fbe033d2bbfde84cfbfaeb34b96eb5fd07f34e65cf30fde4d1eac166b47a.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 173, + 625, + 435, + 640.3333333333334 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 173, + 640.3333333333334, + 435, + 655.6666666666667 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 173, + 655.6666666666667, + 435, + 671.0000000000001 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 677, + 504, + 689 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 674, + 505, + 692 + ], + "spans": [ + { + "bbox": [ + 105, + 674, + 430, + 692 + ], + "score": 1.0, + "content": "Figure 6: Triggers used in the paper: both are the same magnitude-wise, affecting", + "type": "text" + }, + { + "bbox": [ + 430, + 677, + 450, + 687 + ], + "score": 0.84, + "content": "30 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 674, + 505, + 692 + ], + "score": 1.0, + "content": "of the image.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + } + ], + "index": 36.0 + }, + { + "type": "text", + "bbox": [ + 106, + 699, + 506, + 722 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 507, + 714 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 507, + 714 + ], + "score": 1.0, + "content": "We evaluate two triggers shown in Figure 6, a white lines trigger, which clears the top part of an image,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 711, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 106, + 711, + 506, + 723 + ], + "score": 1.0, + "content": "or flag-like trigger that spans all of the image. We report results from injecting up to 20 adversarially-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 73, + 505, + 84 + ], + "spans": [ + { + "bbox": [ + 106, + 73, + 505, + 84 + ], + "score": 1.0, + "content": "ordered batches every 50000 natural datapoints for 10 epochs. We then inject 80 adversarially-ordered", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 84, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 84, + 505, + 95 + ], + "score": 1.0, + "content": "batches. The training procedure here is similar to the one used for BadNets [12]. We find that 80", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 93, + 507, + 108 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 507, + 108 + ], + "score": 1.0, + "content": "batches are not necessary, as most models end up converging after 3–5 adversarially-ordered batches.", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 105, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 506, + 118 + ], + "score": 1.0, + "content": "For reconstruction we randomly sample 300 batches, balancing search efficiency and attack cost as", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 117, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 106, + 117, + 238, + 128 + ], + "score": 1.0, + "content": "is noted in Appendix H, and use", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 238, + 117, + 263, + 128 + ], + "score": 0.9, + "content": "p = 2", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 263, + 117, + 505, + 128 + ], + "score": 1.0, + "content": ". As we discuss in Appendix L, similar attacks work against", + "type": "text", + "cross_page": true + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 128, + 170, + 140 + ], + "spans": [ + { + "bbox": [ + 106, + 128, + 170, + 140 + ], + "score": 1.0, + "content": "language tasks.", + "type": "text", + "cross_page": true + } + ], + "index": 5 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 698, + 507, + 723 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 72, + 505, + 138 + ], + "lines": [ + { + "bbox": [ + 106, + 73, + 505, + 84 + ], + "spans": [ + { + "bbox": [ + 106, + 73, + 505, + 84 + ], + "score": 1.0, + "content": "ordered batches every 50000 natural datapoints for 10 epochs. We then inject 80 adversarially-ordered", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 84, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 84, + 505, + 95 + ], + "score": 1.0, + "content": "batches. The training procedure here is similar to the one used for BadNets [12]. We find that 80", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 93, + 507, + 108 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 507, + 108 + ], + "score": 1.0, + "content": "batches are not necessary, as most models end up converging after 3–5 adversarially-ordered batches.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 105, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 506, + 118 + ], + "score": 1.0, + "content": "For reconstruction we randomly sample 300 batches, balancing search efficiency and attack cost as", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 117, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 106, + 117, + 238, + 128 + ], + "score": 1.0, + "content": "is noted in Appendix H, and use", + "type": "text" + }, + { + "bbox": [ + 238, + 117, + 263, + 128 + ], + "score": 0.9, + "content": "p = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 117, + 505, + 128 + ], + "score": 1.0, + "content": ". As we discuss in Appendix L, similar attacks work against", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 128, + 170, + 140 + ], + "spans": [ + { + "bbox": [ + 106, + 128, + 170, + 140 + ], + "score": 1.0, + "content": "language tasks.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 2.5 + }, + { + "type": "table", + "bbox": [ + 129, + 161, + 483, + 364 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 129, + 161, + 483, + 364 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 129, + 161, + 483, + 364 + ], + "spans": [ + { + "bbox": [ + 129, + 161, + 483, + 364 + ], + "score": 0.986, + "html": "
TriggerBatch sizeTrain acc [%]Test acc [%]Trigger acc [%]Error with trigger [%]
Baselines
Random natural data3288.43 ± 7.2679.60 ± 1.4910.91 ± 1.5330.70 ± 2.26
6495.93 ± 2.1181.31 ± 2.019.78 ± 1.2527.38 ± 1.20
12894.92 ± 2.0481.69 ± 1.1710.00 ± 2.2627.91 ± 1.41
Data with trigger perturbation3296.87± 2.7973.28±2.9399.65±0.2289.68 ±0.21
6498.12 ± 1.5379.45 ± 1.3999.64±0.2189.64± 0.21
12898.67±0.9980.51 ± 1.1099.67 ± 0.4089.65 ±0.39
Only reordered natural data
9 white lines trigger3288.43±6.0978.02 ±1.5033.93 ± 7.3740.78 ± 5.70
64 12895.15 ± 2.6582.75±0.8625.02 ±3.7833.91 ± 2.28
95.23± 2.2482.90 ± 1.5021.75 ± 4.4931.75 ± 3.68
Blackbox 9 white lines trigger3288.43 ± 4.8580.84±1.2017.55 ± 3.7133.64 ± 2.83
6493.59 ± 3.1582.64 ± 1.6416.59 ± 4.8030.90±3.08
12894.84± 2.2481.12 ± 2.4916.19 ± 4.0131.33 ±3.73
Flag-like trigger3290.93 ± 3.8178.46 ± 1.0491.03 ± 12.9687.08 ± 2.71
6496.87 ± 1.2182.95±0.7277.10 ± 16.9682.92 ±3.89
12895.54 ± 1.8882.28 ± 1.5069.49 ± 20.6682.09 ±3.78
Blackbox flag-like trigger3286.25 ± 4.0080.16 ± 1.9156.31 ± 19.5778.78± 3.51
6495.00 ± 2.1883.41± 0.9448.75± 23.2878.11 ± 4.40
12893.82 ± 2.2781.54 ± 1.9468.07 ± 18.5581.23 ± 3.80
", + "type": "table", + "image_path": "c083e5bb0c950bad80a8d365f8d6d7a47686909f5f6e7b255dc248e73342ab03.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 129, + 161, + 483, + 228.66666666666669 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 129, + 228.66666666666669, + 483, + 296.33333333333337 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 129, + 296.33333333333337, + 483, + 364.00000000000006 + ], + "spans": [], + "index": 8 + } + ] + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 107, + 365, + 506, + 419 + ], + "lines": [ + { + "bbox": [ + 105, + 363, + 506, + 377 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 506, + 377 + ], + "score": 1.0, + "content": "Table 3: Network is VGG16 that has been trained normally on CIFAR10 for 10 epochs and then gets", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 374, + 506, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 506, + 388 + ], + "score": 1.0, + "content": "attacked with 10 BOB trigger batches. Test accuracy refers to the original benign accuracy, ‘Trigger", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 385, + 506, + 398 + ], + "spans": [ + { + "bbox": [ + 106, + 385, + 506, + 398 + ], + "score": 1.0, + "content": "acc’ is the proportion of images that are classified as the trigger target label, while ‘Error with trigger’", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 396, + 506, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 506, + 409 + ], + "score": 1.0, + "content": "refers to all of the predictions that result in an incorrect label. Standard deviations are calculated over", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 407, + 380, + 420 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 380, + 420 + ], + "score": 1.0, + "content": "different target classes. Blackbox results use a ResNet-18 surrogate.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 450, + 505, + 538 + ], + "lines": [ + { + "bbox": [ + 104, + 449, + 506, + 463 + ], + "spans": [ + { + "bbox": [ + 104, + 449, + 506, + 463 + ], + "score": 1.0, + "content": "Table 3 shows BOB trigger performance for both whitebox and blackbox setups. We present two", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 460, + 506, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 506, + 475 + ], + "score": 1.0, + "content": "baselines, one for normal training without any triggers, and one where triggers are added to the", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 472, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 106, + 472, + 505, + 484 + ], + "score": 1.0, + "content": "underlying data, i.e. training with perturbed data and labels. Trigger accuracy refers to the proportion", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "score": 1.0, + "content": "of test set that ends up getting the target trigger label, whereas error with triggers shows the proportion", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 494, + 506, + 506 + ], + "spans": [ + { + "bbox": [ + 106, + 494, + 506, + 506 + ], + "score": 1.0, + "content": "of misclassifications that trigger introduces, i.e. when the model makes a mistake, but does not predict", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 505, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 506, + 518 + ], + "score": 1.0, + "content": "the trigger target class. As expected, we observe that for normal training, trigger accuracy stays at", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 516, + 505, + 528 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 528 + ], + "score": 1.0, + "content": "random guessing, and the trigger does not dominate errors it introduces, whereas adding perturbed", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 527, + 389, + 539 + ], + "spans": [ + { + "bbox": [ + 106, + 527, + 389, + 539 + ], + "score": 1.0, + "content": "data manipulates the model to predict the target class almost perfectly.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 107, + 543, + 505, + 609 + ], + "lines": [ + { + "bbox": [ + 105, + 543, + 506, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 506, + 555 + ], + "score": 1.0, + "content": "We find that in a whitebox setup for a flag-like trigger we are capable of getting a similar order of", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 554, + 506, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 506, + 567 + ], + "score": 1.0, + "content": "performance for a batch of size 32 as if the attack was performed with injected adversarial data. In a", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 563, + 506, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 326, + 579 + ], + "score": 1.0, + "content": "blackbox setup with a flag-like trigger we lost around", + "type": "text" + }, + { + "bbox": [ + 327, + 565, + 347, + 576 + ], + "score": 0.87, + "content": "30 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 563, + 506, + 579 + ], + "score": 1.0, + "content": "of trigger performance, yet the trigger", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 576, + 506, + 588 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 506, + 588 + ], + "score": 1.0, + "content": "still remains operational. A trigger of nine white lines outperforms the baseline only marginally; in a", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 587, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 216, + 599 + ], + "score": 1.0, + "content": "whitebox setup it gets from", + "type": "text" + }, + { + "bbox": [ + 217, + 587, + 251, + 597 + ], + "score": 0.88, + "content": "2 0 { - } 4 0 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 587, + 505, + 599 + ], + "score": 1.0, + "content": "performance, whereas in a blackbox one it ranges between zero", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 597, + 491, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 123, + 610 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 123, + 598, + 143, + 608 + ], + "score": 0.85, + "content": "20 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 597, + 491, + 610 + ], + "score": 1.0, + "content": "performance. We show the training progress of each individual trigger in Appendix K.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 107, + 614, + 192, + 625 + ], + "lines": [ + { + "bbox": [ + 106, + 613, + 194, + 626 + ], + "spans": [ + { + "bbox": [ + 106, + 613, + 194, + 626 + ], + "score": 1.0, + "content": "Overall, we find that:", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 134, + 640, + 504, + 663 + ], + "lines": [ + { + "bbox": [ + 133, + 639, + 505, + 653 + ], + "spans": [ + { + "bbox": [ + 133, + 639, + 505, + 653 + ], + "score": 1.0, + "content": "• An attacker can poison an individual datapoint, change its label and increase its prediction", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 650, + 503, + 664 + ], + "spans": [ + { + "bbox": [ + 141, + 650, + 503, + 664 + ], + "score": 1.0, + "content": "confidence, without ever actually training the model on an adversarially-crafted datapoint.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 134, + 677, + 504, + 722 + ], + "lines": [ + { + "bbox": [ + 134, + 678, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 134, + 678, + 505, + 690 + ], + "score": 1.0, + "content": "• An attacker can introduce backdoors into the model by introducing a few reordered batches", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 141, + 689, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 141, + 689, + 506, + 701 + ], + "score": 1.0, + "content": "during training, without ever injecting adversarial data or labels. Here, trigger perfor-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 141, + 700, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 141, + 700, + 505, + 712 + ], + "score": 1.0, + "content": "mance differs, yet an adversary can perform BOB attacks on a par with attacks that inject", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 141, + 711, + 290, + 723 + ], + "spans": [ + { + "bbox": [ + 141, + 711, + 290, + 723 + ], + "score": 1.0, + "content": "perturbations into datasets explicitly.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32.5 + } + ], + "page_idx": 8, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 742, + 308, + 750 + ], + "lines": [ + { + "bbox": [ + 302, + 741, + 309, + 752 + ], + "spans": [ + { + "bbox": [ + 302, + 741, + 309, + 752 + ], + "score": 1.0, + "content": "9", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 72, + 505, + 138 + ], + "lines": [], + "index": 2.5, + "bbox_fs": [ + 105, + 73, + 507, + 140 + ], + "lines_deleted": true + }, + { + "type": "table", + "bbox": [ + 129, + 161, + 483, + 364 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 129, + 161, + 483, + 364 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 129, + 161, + 483, + 364 + ], + "spans": [ + { + "bbox": [ + 129, + 161, + 483, + 364 + ], + "score": 0.986, + "html": "
TriggerBatch sizeTrain acc [%]Test acc [%]Trigger acc [%]Error with trigger [%]
Baselines
Random natural data3288.43 ± 7.2679.60 ± 1.4910.91 ± 1.5330.70 ± 2.26
6495.93 ± 2.1181.31 ± 2.019.78 ± 1.2527.38 ± 1.20
12894.92 ± 2.0481.69 ± 1.1710.00 ± 2.2627.91 ± 1.41
Data with trigger perturbation3296.87± 2.7973.28±2.9399.65±0.2289.68 ±0.21
6498.12 ± 1.5379.45 ± 1.3999.64±0.2189.64± 0.21
12898.67±0.9980.51 ± 1.1099.67 ± 0.4089.65 ±0.39
Only reordered natural data
9 white lines trigger3288.43±6.0978.02 ±1.5033.93 ± 7.3740.78 ± 5.70
64 12895.15 ± 2.6582.75±0.8625.02 ±3.7833.91 ± 2.28
95.23± 2.2482.90 ± 1.5021.75 ± 4.4931.75 ± 3.68
Blackbox 9 white lines trigger3288.43 ± 4.8580.84±1.2017.55 ± 3.7133.64 ± 2.83
6493.59 ± 3.1582.64 ± 1.6416.59 ± 4.8030.90±3.08
12894.84± 2.2481.12 ± 2.4916.19 ± 4.0131.33 ±3.73
Flag-like trigger3290.93 ± 3.8178.46 ± 1.0491.03 ± 12.9687.08 ± 2.71
6496.87 ± 1.2182.95±0.7277.10 ± 16.9682.92 ±3.89
12895.54 ± 1.8882.28 ± 1.5069.49 ± 20.6682.09 ±3.78
Blackbox flag-like trigger3286.25 ± 4.0080.16 ± 1.9156.31 ± 19.5778.78± 3.51
6495.00 ± 2.1883.41± 0.9448.75± 23.2878.11 ± 4.40
12893.82 ± 2.2781.54 ± 1.9468.07 ± 18.5581.23 ± 3.80
", + "type": "table", + "image_path": "c083e5bb0c950bad80a8d365f8d6d7a47686909f5f6e7b255dc248e73342ab03.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 129, + 161, + 483, + 228.66666666666669 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 129, + 228.66666666666669, + 483, + 296.33333333333337 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 129, + 296.33333333333337, + 483, + 364.00000000000006 + ], + "spans": [], + "index": 8 + } + ] + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 107, + 365, + 506, + 419 + ], + "lines": [ + { + "bbox": [ + 105, + 363, + 506, + 377 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 506, + 377 + ], + "score": 1.0, + "content": "Table 3: Network is VGG16 that has been trained normally on CIFAR10 for 10 epochs and then gets", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 374, + 506, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 506, + 388 + ], + "score": 1.0, + "content": "attacked with 10 BOB trigger batches. Test accuracy refers to the original benign accuracy, ‘Trigger", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 385, + 506, + 398 + ], + "spans": [ + { + "bbox": [ + 106, + 385, + 506, + 398 + ], + "score": 1.0, + "content": "acc’ is the proportion of images that are classified as the trigger target label, while ‘Error with trigger’", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 396, + 506, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 506, + 409 + ], + "score": 1.0, + "content": "refers to all of the predictions that result in an incorrect label. Standard deviations are calculated over", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 407, + 380, + 420 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 380, + 420 + ], + "score": 1.0, + "content": "different target classes. Blackbox results use a ResNet-18 surrogate.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 363, + 506, + 420 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 450, + 505, + 538 + ], + "lines": [ + { + "bbox": [ + 104, + 449, + 506, + 463 + ], + "spans": [ + { + "bbox": [ + 104, + 449, + 506, + 463 + ], + "score": 1.0, + "content": "Table 3 shows BOB trigger performance for both whitebox and blackbox setups. We present two", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 460, + 506, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 506, + 475 + ], + "score": 1.0, + "content": "baselines, one for normal training without any triggers, and one where triggers are added to the", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 472, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 106, + 472, + 505, + 484 + ], + "score": 1.0, + "content": "underlying data, i.e. training with perturbed data and labels. Trigger accuracy refers to the proportion", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "score": 1.0, + "content": "of test set that ends up getting the target trigger label, whereas error with triggers shows the proportion", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 494, + 506, + 506 + ], + "spans": [ + { + "bbox": [ + 106, + 494, + 506, + 506 + ], + "score": 1.0, + "content": "of misclassifications that trigger introduces, i.e. when the model makes a mistake, but does not predict", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 505, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 506, + 518 + ], + "score": 1.0, + "content": "the trigger target class. As expected, we observe that for normal training, trigger accuracy stays at", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 516, + 505, + 528 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 528 + ], + "score": 1.0, + "content": "random guessing, and the trigger does not dominate errors it introduces, whereas adding perturbed", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 527, + 389, + 539 + ], + "spans": [ + { + "bbox": [ + 106, + 527, + 389, + 539 + ], + "score": 1.0, + "content": "data manipulates the model to predict the target class almost perfectly.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17.5, + "bbox_fs": [ + 104, + 449, + 506, + 539 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 543, + 505, + 609 + ], + "lines": [ + { + "bbox": [ + 105, + 543, + 506, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 506, + 555 + ], + "score": 1.0, + "content": "We find that in a whitebox setup for a flag-like trigger we are capable of getting a similar order of", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 554, + 506, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 506, + 567 + ], + "score": 1.0, + "content": "performance for a batch of size 32 as if the attack was performed with injected adversarial data. In a", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 563, + 506, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 326, + 579 + ], + "score": 1.0, + "content": "blackbox setup with a flag-like trigger we lost around", + "type": "text" + }, + { + "bbox": [ + 327, + 565, + 347, + 576 + ], + "score": 0.87, + "content": "30 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 563, + 506, + 579 + ], + "score": 1.0, + "content": "of trigger performance, yet the trigger", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 576, + 506, + 588 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 506, + 588 + ], + "score": 1.0, + "content": "still remains operational. A trigger of nine white lines outperforms the baseline only marginally; in a", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 587, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 216, + 599 + ], + "score": 1.0, + "content": "whitebox setup it gets from", + "type": "text" + }, + { + "bbox": [ + 217, + 587, + 251, + 597 + ], + "score": 0.88, + "content": "2 0 { - } 4 0 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 587, + 505, + 599 + ], + "score": 1.0, + "content": "performance, whereas in a blackbox one it ranges between zero", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 597, + 491, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 123, + 610 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 123, + 598, + 143, + 608 + ], + "score": 0.85, + "content": "20 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 597, + 491, + 610 + ], + "score": 1.0, + "content": "performance. We show the training progress of each individual trigger in Appendix K.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 543, + 506, + 610 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 614, + 192, + 625 + ], + "lines": [ + { + "bbox": [ + 106, + 613, + 194, + 626 + ], + "spans": [ + { + "bbox": [ + 106, + 613, + 194, + 626 + ], + "score": 1.0, + "content": "Overall, we find that:", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 106, + 613, + 194, + 626 + ] + }, + { + "type": "text", + "bbox": [ + 134, + 640, + 504, + 663 + ], + "lines": [ + { + "bbox": [ + 133, + 639, + 505, + 653 + ], + "spans": [ + { + "bbox": [ + 133, + 639, + 505, + 653 + ], + "score": 1.0, + "content": "• An attacker can poison an individual datapoint, change its label and increase its prediction", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 650, + 503, + 664 + ], + "spans": [ + { + "bbox": [ + 141, + 650, + 503, + 664 + ], + "score": 1.0, + "content": "confidence, without ever actually training the model on an adversarially-crafted datapoint.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 133, + 639, + 505, + 664 + ] + }, + { + "type": "text", + "bbox": [ + 134, + 677, + 504, + 722 + ], + "lines": [ + { + "bbox": [ + 134, + 678, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 134, + 678, + 505, + 690 + ], + "score": 1.0, + "content": "• An attacker can introduce backdoors into the model by introducing a few reordered batches", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 141, + 689, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 141, + 689, + 506, + 701 + ], + "score": 1.0, + "content": "during training, without ever injecting adversarial data or labels. Here, trigger perfor-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 141, + 700, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 141, + 700, + 505, + 712 + ], + "score": 1.0, + "content": "mance differs, yet an adversary can perform BOB attacks on a par with attacks that inject", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 141, + 711, + 290, + 723 + ], + "spans": [ + { + "bbox": [ + 141, + 711, + 290, + 723 + ], + "score": 1.0, + "content": "perturbations into datasets explicitly.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32.5, + "bbox_fs": [ + 134, + 678, + 506, + 723 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 71, + 183, + 84 + ], + "lines": [ + { + "bbox": [ + 104, + 69, + 185, + 87 + ], + "spans": [ + { + "bbox": [ + 104, + 69, + 185, + 87 + ], + "score": 1.0, + "content": "5 Conclusion", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 96, + 505, + 173 + ], + "lines": [ + { + "bbox": [ + 105, + 96, + 505, + 109 + ], + "spans": [ + { + "bbox": [ + 105, + 96, + 505, + 109 + ], + "score": 1.0, + "content": "We presented a novel class of attacks that manipulate the integrity and availability of training by", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 107, + 506, + 119 + ], + "spans": [ + { + "bbox": [ + 105, + 107, + 506, + 119 + ], + "score": 1.0, + "content": "changing the order of batches, or the order of datapoints within them. Careful reordering of a model’s", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 118, + 505, + 130 + ], + "spans": [ + { + "bbox": [ + 105, + 118, + 505, + 130 + ], + "score": 1.0, + "content": "training data allows it to be poisoned or backdoored without changing the training data at all. The", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 129, + 505, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 129, + 505, + 141 + ], + "score": 1.0, + "content": "attacks we presented are fully blackbox; they do not rely on knowledge of the target model or on", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 139, + 505, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 139, + 505, + 153 + ], + "score": 1.0, + "content": "prior knowledge of the data. Most surprisingly, we find that an attacker can introduce backdoors", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 150, + 506, + 164 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 506, + 164 + ], + "score": 1.0, + "content": "without disruption of generalisation, even though only natural data is used. We are the first to show", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 162, + 498, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 162, + 498, + 174 + ], + "score": 1.0, + "content": "that the sampling procedure can be manipulated deterministically to control the model’s behavior.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 107, + 178, + 505, + 232 + ], + "lines": [ + { + "bbox": [ + 106, + 178, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 106, + 178, + 505, + 190 + ], + "score": 1.0, + "content": "This paper reminds us that stochastic gradient descent, like cryptography, depends on randomness. A", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 189, + 505, + 201 + ], + "spans": [ + { + "bbox": [ + 106, + 189, + 505, + 201 + ], + "score": 1.0, + "content": "random number generator with a backdoor can undermine a neural network just as it can undermine a", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 199, + 506, + 214 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 506, + 214 + ], + "score": 1.0, + "content": "payment network [1]. Developers who wish to ensure secure, robust, fair optimization during learning", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 210, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 506, + 223 + ], + "score": 1.0, + "content": "must therefore be able to inspect their assumptions and, in case of SGD, show the provenance of", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 222, + 307, + 234 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 307, + 234 + ], + "score": 1.0, + "content": "randomness used to select batches and datapoints.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 238, + 505, + 304 + ], + "lines": [ + { + "bbox": [ + 105, + 237, + 505, + 250 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 505, + 250 + ], + "score": 1.0, + "content": "Future work may also explore the implications of our findings to fairness. Recent work has highlighted", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 249, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 505, + 261 + ], + "score": 1.0, + "content": "that ML models can suffer from a large taxonomy of different biases, including sampling bias, with", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 259, + 505, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 259, + 505, + 272 + ], + "score": 1.0, + "content": "outcomes including sexism and racism [3, 23]. This leads directly to questions of inductive bias and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 271, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 271, + 505, + 282 + ], + "score": 1.0, + "content": "the practical contribution of pseudorandom sampling. Hooker has explained that bias in ML is not", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 281, + 506, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 506, + 294 + ], + "score": 1.0, + "content": "just a data problem, but depends on algorithms in subtle ways [15]; this paper shows how to exploit", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 291, + 176, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 176, + 307 + ], + "score": 1.0, + "content": "that dependency.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 15.5 + }, + { + "type": "title", + "bbox": [ + 108, + 320, + 207, + 333 + ], + "lines": [ + { + "bbox": [ + 106, + 318, + 208, + 336 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 208, + 336 + ], + "score": 1.0, + "content": "Acknowledgements", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 344, + 505, + 389 + ], + "lines": [ + { + "bbox": [ + 105, + 344, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 505, + 357 + ], + "score": 1.0, + "content": "We thank the reviewers for their insightful feedback. This work was supported by DARPA (through", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 355, + 506, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 355, + 506, + 368 + ], + "score": 1.0, + "content": "the GARD program), CIFAR (through a Canada CIFAR AI Chair), Bosch Forschungsstiftung im", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 366, + 507, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 366, + 507, + 380 + ], + "score": 1.0, + "content": "Stifterverband, by NSERC (under the Discovery Program, and COHESA strategic research network),", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 376, + 389, + 391 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 389, + 391 + ], + "score": 1.0, + "content": "and by a gift from Intel. We also thank the Vector Institute’s sponsors.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21.5 + }, + { + "type": "title", + "bbox": [ + 107, + 405, + 163, + 417 + ], + "lines": [ + { + "bbox": [ + 106, + 403, + 165, + 420 + ], + "spans": [ + { + "bbox": [ + 106, + 403, + 165, + 420 + ], + "score": 1.0, + "content": "References", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 110, + 424, + 507, + 722 + ], + "lines": [ + { + "bbox": [ + 111, + 424, + 381, + 437 + ], + "spans": [ + { + "bbox": [ + 111, + 424, + 381, + 437 + ], + "score": 1.0, + "content": "[1] R. Anderson. Security Engineering. John Wiley & Sons, 2020.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 110, + 443, + 507, + 458 + ], + "spans": [ + { + "bbox": [ + 110, + 443, + 507, + 458 + ], + "score": 1.0, + "content": "[2] O. Bachem, M. Lucic, and A. Krause. Practical coreset constructions for machine learning,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 127, + 453, + 154, + 468 + ], + "spans": [ + { + "bbox": [ + 127, + 453, + 154, + 468 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 110, + 474, + 432, + 487 + ], + "spans": [ + { + "bbox": [ + 110, + 474, + 432, + 487 + ], + "score": 1.0, + "content": "[3] R. Baeza-Yates. Bias on the web. Commun. ACM, 61(6):54–61, May 2018.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 110, + 493, + 507, + 507 + ], + "spans": [ + { + "bbox": [ + 110, + 493, + 507, + 507 + ], + "score": 1.0, + "content": "[4] R. R. Bahadur. A Note on Quantiles in Large Samples. The Annals of Mathematical Statistics,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 127, + 505, + 222, + 518 + ], + "spans": [ + { + "bbox": [ + 127, + 505, + 222, + 518 + ], + "score": 1.0, + "content": "37(3):577 – 580, 1966.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 110, + 524, + 506, + 538 + ], + "spans": [ + { + "bbox": [ + 110, + 524, + 506, + 538 + ], + "score": 1.0, + "content": "[5] Y. Bengio, J. Louradour, R. Collobert, and J. Weston. Curriculum learning. In Proceedings of", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 127, + 534, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 127, + 534, + 506, + 549 + ], + "score": 1.0, + "content": "the 26th Annual International Conference on Machine Learning, ICML ’09, page 41–48, New", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 127, + 544, + 379, + 561 + ], + "spans": [ + { + "bbox": [ + 127, + 544, + 379, + 561 + ], + "score": 1.0, + "content": "York, NY, USA, 2009. Association for Computing Machinery.", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 110, + 566, + 507, + 580 + ], + "spans": [ + { + "bbox": [ + 110, + 566, + 507, + 580 + ], + "score": 1.0, + "content": "[6] B. Biggio, I. Corona, D. Maiorca, B. Nelson, N. Šrndic, P. Laskov, G. Giacinto, and F. Roli. ´", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 127, + 577, + 506, + 592 + ], + "spans": [ + { + "bbox": [ + 127, + 577, + 506, + 592 + ], + "score": 1.0, + "content": "Evasion attacks against machine learning at test time. In Joint European conference on machine", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 126, + 588, + 452, + 603 + ], + "spans": [ + { + "bbox": [ + 126, + 588, + 452, + 603 + ], + "score": 1.0, + "content": "learning and knowledge discovery in databases, pages 387–402. Springer, 2013.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 111, + 608, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 111, + 608, + 505, + 622 + ], + "score": 1.0, + "content": "[7] H. Chen. Chapter 2. order statistics. http://www.math.ntu.edu.tw/~hchen/teaching/", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 126, + 619, + 296, + 633 + ], + "spans": [ + { + "bbox": [ + 126, + 619, + 296, + 633 + ], + "score": 1.0, + "content": "LargeSample/notes/noteorder.pdf.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 110, + 638, + 505, + 653 + ], + "spans": [ + { + "bbox": [ + 110, + 638, + 505, + 653 + ], + "score": 1.0, + "content": "[8] X. Chen, C. Liu, B. Li, K. Lu, and D. Song. Targeted backdoor attacks on deep learning systems", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 127, + 650, + 379, + 662 + ], + "spans": [ + { + "bbox": [ + 127, + 650, + 379, + 662 + ], + "score": 1.0, + "content": "using data poisoning. arXiv preprint arXiv:1712.05526, 2017.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 111, + 669, + 507, + 683 + ], + "spans": [ + { + "bbox": [ + 111, + 669, + 507, + 683 + ], + "score": 1.0, + "content": "[9] D. A. Cohn, Z. Ghahramani, and M. I. Jordan. Active learning with statistical models. CoRR,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 127, + 681, + 216, + 692 + ], + "spans": [ + { + "bbox": [ + 127, + 681, + 216, + 692 + ], + "score": 1.0, + "content": "cs.AI/9603104, 1996.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 108, + 700, + 507, + 714 + ], + "spans": [ + { + "bbox": [ + 108, + 700, + 507, + 714 + ], + "score": 1.0, + "content": "[10] I. J. Goodfellow, J. Shlens, and C. Szegedy. Explaining and harnessing adversarial examples,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 127, + 711, + 154, + 723 + ], + "spans": [ + { + "bbox": [ + 127, + 711, + 154, + 723 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 34.5 + } + ], + "page_idx": 9, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 741, + 311, + 750 + ], + "lines": [ + { + "bbox": [ + 299, + 740, + 313, + 754 + ], + "spans": [ + { + "bbox": [ + 299, + 740, + 313, + 754 + ], + "score": 1.0, + "content": "10", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 71, + 183, + 84 + ], + "lines": [ + { + "bbox": [ + 104, + 69, + 185, + 87 + ], + "spans": [ + { + "bbox": [ + 104, + 69, + 185, + 87 + ], + "score": 1.0, + "content": "5 Conclusion", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 96, + 505, + 173 + ], + "lines": [ + { + "bbox": [ + 105, + 96, + 505, + 109 + ], + "spans": [ + { + "bbox": [ + 105, + 96, + 505, + 109 + ], + "score": 1.0, + "content": "We presented a novel class of attacks that manipulate the integrity and availability of training by", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 107, + 506, + 119 + ], + "spans": [ + { + "bbox": [ + 105, + 107, + 506, + 119 + ], + "score": 1.0, + "content": "changing the order of batches, or the order of datapoints within them. Careful reordering of a model’s", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 118, + 505, + 130 + ], + "spans": [ + { + "bbox": [ + 105, + 118, + 505, + 130 + ], + "score": 1.0, + "content": "training data allows it to be poisoned or backdoored without changing the training data at all. The", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 129, + 505, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 129, + 505, + 141 + ], + "score": 1.0, + "content": "attacks we presented are fully blackbox; they do not rely on knowledge of the target model or on", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 139, + 505, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 139, + 505, + 153 + ], + "score": 1.0, + "content": "prior knowledge of the data. Most surprisingly, we find that an attacker can introduce backdoors", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 150, + 506, + 164 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 506, + 164 + ], + "score": 1.0, + "content": "without disruption of generalisation, even though only natural data is used. We are the first to show", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 162, + 498, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 162, + 498, + 174 + ], + "score": 1.0, + "content": "that the sampling procedure can be manipulated deterministically to control the model’s behavior.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 96, + 506, + 174 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 178, + 505, + 232 + ], + "lines": [ + { + "bbox": [ + 106, + 178, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 106, + 178, + 505, + 190 + ], + "score": 1.0, + "content": "This paper reminds us that stochastic gradient descent, like cryptography, depends on randomness. A", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 189, + 505, + 201 + ], + "spans": [ + { + "bbox": [ + 106, + 189, + 505, + 201 + ], + "score": 1.0, + "content": "random number generator with a backdoor can undermine a neural network just as it can undermine a", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 199, + 506, + 214 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 506, + 214 + ], + "score": 1.0, + "content": "payment network [1]. Developers who wish to ensure secure, robust, fair optimization during learning", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 210, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 506, + 223 + ], + "score": 1.0, + "content": "must therefore be able to inspect their assumptions and, in case of SGD, show the provenance of", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 222, + 307, + 234 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 307, + 234 + ], + "score": 1.0, + "content": "randomness used to select batches and datapoints.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 178, + 506, + 234 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 238, + 505, + 304 + ], + "lines": [ + { + "bbox": [ + 105, + 237, + 505, + 250 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 505, + 250 + ], + "score": 1.0, + "content": "Future work may also explore the implications of our findings to fairness. Recent work has highlighted", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 249, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 505, + 261 + ], + "score": 1.0, + "content": "that ML models can suffer from a large taxonomy of different biases, including sampling bias, with", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 259, + 505, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 259, + 505, + 272 + ], + "score": 1.0, + "content": "outcomes including sexism and racism [3, 23]. This leads directly to questions of inductive bias and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 271, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 271, + 505, + 282 + ], + "score": 1.0, + "content": "the practical contribution of pseudorandom sampling. Hooker has explained that bias in ML is not", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 281, + 506, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 506, + 294 + ], + "score": 1.0, + "content": "just a data problem, but depends on algorithms in subtle ways [15]; this paper shows how to exploit", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 291, + 176, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 176, + 307 + ], + "score": 1.0, + "content": "that dependency.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 237, + 506, + 307 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 320, + 207, + 333 + ], + "lines": [ + { + "bbox": [ + 106, + 318, + 208, + 336 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 208, + 336 + ], + "score": 1.0, + "content": "Acknowledgements", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 344, + 505, + 389 + ], + "lines": [ + { + "bbox": [ + 105, + 344, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 505, + 357 + ], + "score": 1.0, + "content": "We thank the reviewers for their insightful feedback. This work was supported by DARPA (through", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 355, + 506, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 355, + 506, + 368 + ], + "score": 1.0, + "content": "the GARD program), CIFAR (through a Canada CIFAR AI Chair), Bosch Forschungsstiftung im", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 366, + 507, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 366, + 507, + 380 + ], + "score": 1.0, + "content": "Stifterverband, by NSERC (under the Discovery Program, and COHESA strategic research network),", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 376, + 389, + 391 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 389, + 391 + ], + "score": 1.0, + "content": "and by a gift from Intel. We also thank the Vector Institute’s sponsors.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 344, + 507, + 391 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 405, + 163, + 417 + ], + "lines": [ + { + "bbox": [ + 106, + 403, + 165, + 420 + ], + "spans": [ + { + "bbox": [ + 106, + 403, + 165, + 420 + ], + "score": 1.0, + "content": "References", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "list", + "bbox": [ + 110, + 424, + 507, + 722 + ], + "lines": [ + { + "bbox": [ + 111, + 424, + 381, + 437 + ], + "spans": [ + { + "bbox": [ + 111, + 424, + 381, + 437 + ], + "score": 1.0, + "content": "[1] R. Anderson. Security Engineering. John Wiley & Sons, 2020.", + "type": "text" + } + ], + "index": 25, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 110, + 443, + 507, + 458 + ], + "spans": [ + { + "bbox": [ + 110, + 443, + 507, + 458 + ], + "score": 1.0, + "content": "[2] O. Bachem, M. Lucic, and A. Krause. Practical coreset constructions for machine learning,", + "type": "text" + } + ], + "index": 26, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 453, + 154, + 468 + ], + "spans": [ + { + "bbox": [ + 127, + 453, + 154, + 468 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 27, + "is_list_end_line": true + }, + { + "bbox": [ + 110, + 474, + 432, + 487 + ], + "spans": [ + { + "bbox": [ + 110, + 474, + 432, + 487 + ], + "score": 1.0, + "content": "[3] R. Baeza-Yates. Bias on the web. Commun. ACM, 61(6):54–61, May 2018.", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 110, + 493, + 507, + 507 + ], + "spans": [ + { + "bbox": [ + 110, + 493, + 507, + 507 + ], + "score": 1.0, + "content": "[4] R. R. Bahadur. A Note on Quantiles in Large Samples. The Annals of Mathematical Statistics,", + "type": "text" + } + ], + "index": 29, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 505, + 222, + 518 + ], + "spans": [ + { + "bbox": [ + 127, + 505, + 222, + 518 + ], + "score": 1.0, + "content": "37(3):577 – 580, 1966.", + "type": "text" + } + ], + "index": 30, + "is_list_end_line": true + }, + { + "bbox": [ + 110, + 524, + 506, + 538 + ], + "spans": [ + { + "bbox": [ + 110, + 524, + 506, + 538 + ], + "score": 1.0, + "content": "[5] Y. Bengio, J. Louradour, R. Collobert, and J. Weston. Curriculum learning. In Proceedings of", + "type": "text" + } + ], + "index": 31, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 534, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 127, + 534, + 506, + 549 + ], + "score": 1.0, + "content": "the 26th Annual International Conference on Machine Learning, ICML ’09, page 41–48, New", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 127, + 544, + 379, + 561 + ], + "spans": [ + { + "bbox": [ + 127, + 544, + 379, + 561 + ], + "score": 1.0, + "content": "York, NY, USA, 2009. Association for Computing Machinery.", + "type": "text" + } + ], + "index": 33, + "is_list_end_line": true + }, + { + "bbox": [ + 110, + 566, + 507, + 580 + ], + "spans": [ + { + "bbox": [ + 110, + 566, + 507, + 580 + ], + "score": 1.0, + "content": "[6] B. Biggio, I. Corona, D. Maiorca, B. Nelson, N. Šrndic, P. Laskov, G. Giacinto, and F. Roli. ´", + "type": "text" + } + ], + "index": 34, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 577, + 506, + 592 + ], + "spans": [ + { + "bbox": [ + 127, + 577, + 506, + 592 + ], + "score": 1.0, + "content": "Evasion attacks against machine learning at test time. In Joint European conference on machine", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 126, + 588, + 452, + 603 + ], + "spans": [ + { + "bbox": [ + 126, + 588, + 452, + 603 + ], + "score": 1.0, + "content": "learning and knowledge discovery in databases, pages 387–402. Springer, 2013.", + "type": "text" + } + ], + "index": 36, + "is_list_end_line": true + }, + { + "bbox": [ + 111, + 608, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 111, + 608, + 505, + 622 + ], + "score": 1.0, + "content": "[7] H. Chen. Chapter 2. order statistics. http://www.math.ntu.edu.tw/~hchen/teaching/", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 619, + 296, + 633 + ], + "spans": [ + { + "bbox": [ + 126, + 619, + 296, + 633 + ], + "score": 1.0, + "content": "LargeSample/notes/noteorder.pdf.", + "type": "text" + } + ], + "index": 38, + "is_list_end_line": true + }, + { + "bbox": [ + 110, + 638, + 505, + 653 + ], + "spans": [ + { + "bbox": [ + 110, + 638, + 505, + 653 + ], + "score": 1.0, + "content": "[8] X. Chen, C. Liu, B. Li, K. Lu, and D. Song. Targeted backdoor attacks on deep learning systems", + "type": "text" + } + ], + "index": 39, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 650, + 379, + 662 + ], + "spans": [ + { + "bbox": [ + 127, + 650, + 379, + 662 + ], + "score": 1.0, + "content": "using data poisoning. arXiv preprint arXiv:1712.05526, 2017.", + "type": "text" + } + ], + "index": 40, + "is_list_end_line": true + }, + { + "bbox": [ + 111, + 669, + 507, + 683 + ], + "spans": [ + { + "bbox": [ + 111, + 669, + 507, + 683 + ], + "score": 1.0, + "content": "[9] D. A. Cohn, Z. Ghahramani, and M. I. Jordan. Active learning with statistical models. CoRR,", + "type": "text" + } + ], + "index": 41, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 681, + 216, + 692 + ], + "spans": [ + { + "bbox": [ + 127, + 681, + 216, + 692 + ], + "score": 1.0, + "content": "cs.AI/9603104, 1996.", + "type": "text" + } + ], + "index": 42, + "is_list_end_line": true + }, + { + "bbox": [ + 108, + 700, + 507, + 714 + ], + "spans": [ + { + "bbox": [ + 108, + 700, + 507, + 714 + ], + "score": 1.0, + "content": "[10] I. J. Goodfellow, J. Shlens, and C. Szegedy. Explaining and harnessing adversarial examples,", + "type": "text" + } + ], + "index": 43, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 711, + 154, + 723 + ], + "spans": [ + { + "bbox": [ + 127, + 711, + 154, + 723 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 44, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 73, + 506, + 86 + ], + "spans": [ + { + "bbox": [ + 106, + 73, + 506, + 86 + ], + "score": 1.0, + "content": "[11] K. Grosse, T. A. Trost, M. Mosbach, M. Backes, and D. Klakow. On the security relevance", + "type": "text", + "cross_page": true + } + ], + "index": 0, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 83, + 506, + 97 + ], + "spans": [ + { + "bbox": [ + 127, + 83, + 506, + 97 + ], + "score": 1.0, + "content": "of initial weights in deep neural networks. In I. Farkaš, P. Masulli, and S. Wermter, editors,", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 126, + 94, + 507, + 108 + ], + "spans": [ + { + "bbox": [ + 126, + 94, + 507, + 108 + ], + "score": 1.0, + "content": "Artificial Neural Networks and Machine Learning – ICANN 2020, pages 3–14, Cham, 2020.", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 126, + 105, + 267, + 121 + ], + "spans": [ + { + "bbox": [ + 126, + 105, + 267, + 121 + ], + "score": 1.0, + "content": "Springer International Publishing.", + "type": "text", + "cross_page": true + } + ], + "index": 3, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 123, + 506, + 138 + ], + "spans": [ + { + "bbox": [ + 104, + 123, + 506, + 138 + ], + "score": 1.0, + "content": "[12] T. Gu, B. Dolan-Gavitt, and S. Garg. Badnets: Identifying vulnerabilities in the machine", + "type": "text", + "cross_page": true + } + ], + "index": 4, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 136, + 410, + 150 + ], + "spans": [ + { + "bbox": [ + 127, + 136, + 410, + 150 + ], + "score": 1.0, + "content": "learning model supply chain. arXiv preprint arXiv:1708.06733, 2017.", + "type": "text", + "cross_page": true + } + ], + "index": 5, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 153, + 507, + 168 + ], + "spans": [ + { + "bbox": [ + 104, + 153, + 507, + 168 + ], + "score": 1.0, + "content": "[13] G. Hacohen and D. Weinshall. On the power of curriculum learning in training deep networks. In", + "type": "text", + "cross_page": true + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 165, + 505, + 179 + ], + "spans": [ + { + "bbox": [ + 127, + 165, + 505, + 179 + ], + "score": 1.0, + "content": "K. Chaudhuri and R. Salakhutdinov, editors, Proceedings of the 36th International Conference", + "type": "text", + "cross_page": true + } + ], + "index": 7 + }, + { + "bbox": [ + 127, + 176, + 506, + 190 + ], + "spans": [ + { + "bbox": [ + 127, + 176, + 506, + 190 + ], + "score": 1.0, + "content": "on Machine Learning, volume 97 of Proceedings of Machine Learning Research, pages 2535–", + "type": "text", + "cross_page": true + } + ], + "index": 8 + }, + { + "bbox": [ + 128, + 188, + 255, + 200 + ], + "spans": [ + { + "bbox": [ + 128, + 188, + 255, + 200 + ], + "score": 1.0, + "content": "2544. PMLR, 09–15 Jun 2019.", + "type": "text", + "cross_page": true + } + ], + "index": 9, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 206, + 505, + 220 + ], + "spans": [ + { + "bbox": [ + 105, + 206, + 505, + 220 + ], + "score": 1.0, + "content": "[14] K. He, X. Zhang, S. Ren, and J. Sun. Deep residual learning for image recognition. In", + "type": "text", + "cross_page": true + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 217, + 507, + 231 + ], + "spans": [ + { + "bbox": [ + 127, + 217, + 507, + 231 + ], + "score": 1.0, + "content": "Proceedings of the IEEE conference on computer vision and pattern recognition, pages 770–", + "type": "text", + "cross_page": true + } + ], + "index": 11 + }, + { + "bbox": [ + 127, + 226, + 174, + 242 + ], + "spans": [ + { + "bbox": [ + 127, + 226, + 174, + 242 + ], + "score": 1.0, + "content": "778, 2016.", + "type": "text", + "cross_page": true + } + ], + "index": 12, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 247, + 506, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 506, + 261 + ], + "score": 1.0, + "content": "[15] S. Hooker. Moving beyond “algorithmic bias is a data problem”. Patterns, 2(4):100241, 2021.", + "type": "text", + "cross_page": true + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 104, + 265, + 506, + 280 + ], + "spans": [ + { + "bbox": [ + 104, + 265, + 506, + 280 + ], + "score": 1.0, + "content": "[16] A. G. Howard, M. Zhu, B. Chen, D. Kalenichenko, W. Wang, T. Weyand, M. Andreetto, and", + "type": "text", + "cross_page": true + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 125, + 276, + 507, + 291 + ], + "spans": [ + { + "bbox": [ + 125, + 276, + 507, + 291 + ], + "score": 1.0, + "content": "H. Adam. Mobilenets: Efficient convolutional neural networks for mobile vision applications.", + "type": "text", + "cross_page": true + } + ], + "index": 15 + }, + { + "bbox": [ + 126, + 288, + 291, + 302 + ], + "spans": [ + { + "bbox": [ + 126, + 288, + 291, + 302 + ], + "score": 1.0, + "content": "arXiv preprint arXiv:1704.04861, 2017.", + "type": "text", + "cross_page": true + } + ], + "index": 16, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 308, + 505, + 320 + ], + "spans": [ + { + "bbox": [ + 106, + 308, + 505, + 320 + ], + "score": 1.0, + "content": "[17] M. Jagielski, A. Oprea, B. Biggio, C. Liu, C. Nita-Rotaru, and B. Li. Manipulating machine", + "type": "text", + "cross_page": true + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 318, + 506, + 332 + ], + "spans": [ + { + "bbox": [ + 127, + 318, + 506, + 332 + ], + "score": 1.0, + "content": "learning: Poisoning attacks and countermeasures for regression learning. In 2018 IEEE", + "type": "text", + "cross_page": true + } + ], + "index": 18 + }, + { + "bbox": [ + 127, + 329, + 403, + 343 + ], + "spans": [ + { + "bbox": [ + 127, + 329, + 403, + 343 + ], + "score": 1.0, + "content": "Symposium on Security and Privacy (SP), pages 19–35. IEEE, 2018.", + "type": "text", + "cross_page": true + } + ], + "index": 19, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 348, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 106, + 348, + 505, + 362 + ], + "score": 1.0, + "content": "[18] R. Johnson and T. Zhang. Accelerating stochastic gradient descent using predictive variance", + "type": "text", + "cross_page": true + } + ], + "index": 20, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 360, + 459, + 374 + ], + "spans": [ + { + "bbox": [ + 127, + 360, + 459, + 374 + ], + "score": 1.0, + "content": "reduction. Advances in neural information processing systems, 26:315–323, 2013.", + "type": "text", + "cross_page": true + } + ], + "index": 21, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 378, + 502, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 378, + 502, + 392 + ], + "score": 1.0, + "content": "[19] A. Krizhevsky, G. Hinton, et al. Learning multiple layers of features from tiny images. 2009.", + "type": "text", + "cross_page": true + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 104, + 396, + 507, + 411 + ], + "spans": [ + { + "bbox": [ + 104, + 396, + 507, + 411 + ], + "score": 1.0, + "content": "[20] M. Kumar, B. Packer, and D. Koller. Self-paced learning for latent variable models. In", + "type": "text", + "cross_page": true + } + ], + "index": 23, + "is_list_start_line": true + }, + { + "bbox": [ + 125, + 407, + 506, + 422 + ], + "spans": [ + { + "bbox": [ + 125, + 407, + 506, + 422 + ], + "score": 1.0, + "content": "J. Lafferty, C. Williams, J. Shawe-Taylor, R. Zemel, and A. Culotta, editors, Advances in Neural", + "type": "text", + "cross_page": true + } + ], + "index": 24 + }, + { + "bbox": [ + 127, + 419, + 431, + 433 + ], + "spans": [ + { + "bbox": [ + 127, + 419, + 431, + 433 + ], + "score": 1.0, + "content": "Information Processing Systems, volume 23. Curran Associates, Inc., 2010.", + "type": "text", + "cross_page": true + } + ], + "index": 25, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 438, + 506, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 506, + 452 + ], + "score": 1.0, + "content": "[21] Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner. Gradient-based learning applied to document", + "type": "text", + "cross_page": true + } + ], + "index": 26, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 449, + 387, + 463 + ], + "spans": [ + { + "bbox": [ + 127, + 449, + 387, + 463 + ], + "score": 1.0, + "content": "recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998.", + "type": "text", + "cross_page": true + } + ], + "index": 27, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 468, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 106, + 468, + 505, + 482 + ], + "score": 1.0, + "content": "[22] A. Madry, A. Makelov, L. Schmidt, D. Tsipras, and A. Vladu. Towards deep learning models", + "type": "text", + "cross_page": true + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 479, + 278, + 491 + ], + "spans": [ + { + "bbox": [ + 127, + 479, + 278, + 491 + ], + "score": 1.0, + "content": "resistant to adversarial attacks, 2019.", + "type": "text", + "cross_page": true + } + ], + "index": 29, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 497, + 505, + 511 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 505, + 511 + ], + "score": 1.0, + "content": "[23] N. Mehrabi, F. Morstatter, N. Saxena, K. Lerman, and A. Galstyan. A survey on bias and", + "type": "text", + "cross_page": true + } + ], + "index": 30, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 510, + 369, + 522 + ], + "spans": [ + { + "bbox": [ + 127, + 510, + 369, + 522 + ], + "score": 1.0, + "content": "fairness in machine learning. CoRR, abs/1908.09635, 2019.", + "type": "text", + "cross_page": true + } + ], + "index": 31, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "score": 1.0, + "content": "[24] N. Papernot, P. McDaniel, I. Goodfellow, S. Jha, Z. B. Celik, and A. Swami. Practical black-box", + "type": "text", + "cross_page": true + } + ], + "index": 32, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 539, + 506, + 553 + ], + "spans": [ + { + "bbox": [ + 127, + 539, + 506, + 553 + ], + "score": 1.0, + "content": "attacks against machine learning. In Proceedings of the 2017 ACM on Asia conference on", + "type": "text", + "cross_page": true + } + ], + "index": 33 + }, + { + "bbox": [ + 125, + 549, + 381, + 564 + ], + "spans": [ + { + "bbox": [ + 125, + 549, + 381, + 564 + ], + "score": 1.0, + "content": "computer and communications security, pages 506–519, 2017.", + "type": "text", + "cross_page": true + } + ], + "index": 34, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 569, + 506, + 583 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 506, + 583 + ], + "score": 1.0, + "content": "[25] B. Polyak. Some methods of speeding up the convergence of iteration methods. USSR", + "type": "text", + "cross_page": true + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 580, + 424, + 594 + ], + "spans": [ + { + "bbox": [ + 127, + 580, + 424, + 594 + ], + "score": 1.0, + "content": "Computational Mathematics and Mathematical Physics, 4(5):1–17, 1964.", + "type": "text", + "cross_page": true + } + ], + "index": 36, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 599, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 599, + 506, + 613 + ], + "score": 1.0, + "content": "[26] M. Raginsky, A. Rakhlin, and M. Telgarsky. Non-convex learning via stochastic gradient", + "type": "text", + "cross_page": true + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 610, + 340, + 624 + ], + "spans": [ + { + "bbox": [ + 127, + 610, + 340, + 624 + ], + "score": 1.0, + "content": "langevin dynamics: a nonasymptotic analysis, 2017.", + "type": "text", + "cross_page": true + } + ], + "index": 38, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 628, + 506, + 642 + ], + "spans": [ + { + "bbox": [ + 106, + 628, + 506, + 642 + ], + "score": 1.0, + "content": "[27] H. Robbins and S. Monro. A stochastic approximation method. The annals of mathematical", + "type": "text", + "cross_page": true + } + ], + "index": 39, + "is_list_start_line": true + }, + { + "bbox": [ + 125, + 640, + 259, + 653 + ], + "spans": [ + { + "bbox": [ + 125, + 640, + 259, + 653 + ], + "score": 1.0, + "content": "statistics, pages 400–407, 1951.", + "type": "text", + "cross_page": true + } + ], + "index": 40, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 658, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 658, + 505, + 672 + ], + "score": 1.0, + "content": "[28] A. Salem, R. Wen, M. Backes, S. Ma, and Y. Zhang. Dynamic backdoor attacks against machine", + "type": "text", + "cross_page": true + } + ], + "index": 41, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 669, + 222, + 683 + ], + "spans": [ + { + "bbox": [ + 127, + 669, + 222, + 683 + ], + "score": 1.0, + "content": "learning models, 2020.", + "type": "text", + "cross_page": true + } + ], + "index": 42, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 689, + 507, + 703 + ], + "spans": [ + { + "bbox": [ + 106, + 689, + 507, + 703 + ], + "score": 1.0, + "content": "[29] A. Shafahi, W. R. Huang, M. Najibi, O. Suciu, C. Studer, T. Dumitras, and T. Goldstein.", + "type": "text", + "cross_page": true + } + ], + "index": 43, + "is_list_start_line": true + }, + { + "bbox": [ + 124, + 698, + 507, + 715 + ], + "spans": [ + { + "bbox": [ + 124, + 698, + 507, + 715 + ], + "score": 1.0, + "content": "Poison frogs! targeted clean-label poisoning attacks on neural networks. arXiv preprint", + "type": "text", + "cross_page": true + } + ], + "index": 44 + }, + { + "bbox": [ + 126, + 711, + 231, + 723 + ], + "spans": [ + { + "bbox": [ + 126, + 711, + 231, + 723 + ], + "score": 1.0, + "content": "arXiv:1804.00792, 2018.", + "type": "text", + "cross_page": true + } + ], + "index": 45, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 72, + 506, + 86 + ], + "spans": [ + { + "bbox": [ + 106, + 72, + 506, + 86 + ], + "score": 1.0, + "content": "[30] I. Shumailov, Y. Zhao, D. Bates, N. Papernot, R. Mullins, and R. Anderson. Sponge examples:", + "type": "text", + "cross_page": true + } + ], + "index": 0, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 84, + 506, + 98 + ], + "spans": [ + { + "bbox": [ + 127, + 84, + 506, + 98 + ], + "score": 1.0, + "content": "Energy-latency attacks on neural networks. In 6th IEEE European Symposium on Security and", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 127, + 95, + 236, + 108 + ], + "spans": [ + { + "bbox": [ + 127, + 95, + 236, + 108 + ], + "score": 1.0, + "content": "Privacy (EuroS&P), 2021.", + "type": "text", + "cross_page": true + } + ], + "index": 2, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 113, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 113, + 506, + 128 + ], + "score": 1.0, + "content": "[31] S. L. Smith, B. Dherin, D. G. T. Barrett, and S. De. On the origin of implicit regularization in", + "type": "text", + "cross_page": true + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 125, + 264, + 138 + ], + "spans": [ + { + "bbox": [ + 127, + 125, + 264, + 138 + ], + "score": 1.0, + "content": "stochastic gradient descent, 2021.", + "type": "text", + "cross_page": true + } + ], + "index": 4, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 144, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 505, + 156 + ], + "score": 1.0, + "content": "[32] M. Sun, S. Agarwal, and J. Z. Kolter. Poisoned classifiers are not only backdoored, they are", + "type": "text", + "cross_page": true + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 155, + 246, + 168 + ], + "spans": [ + { + "bbox": [ + 127, + 155, + 246, + 168 + ], + "score": 1.0, + "content": "fundamentally broken, 2020.", + "type": "text", + "cross_page": true + } + ], + "index": 6, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 173, + 506, + 186 + ], + "spans": [ + { + "bbox": [ + 105, + 173, + 506, + 186 + ], + "score": 1.0, + "content": "[33] I. Sutskever, J. Martens, G. Dahl, and G. Hinton. On the importance of initialization and", + "type": "text", + "cross_page": true + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 184, + 506, + 198 + ], + "spans": [ + { + "bbox": [ + 126, + 184, + 506, + 198 + ], + "score": 1.0, + "content": "momentum in deep learning. In S. Dasgupta and D. McAllester, editors, Proceedings of the", + "type": "text", + "cross_page": true + } + ], + "index": 8 + }, + { + "bbox": [ + 126, + 195, + 506, + 209 + ], + "spans": [ + { + "bbox": [ + 126, + 195, + 506, + 209 + ], + "score": 1.0, + "content": "30th International Conference on Machine Learning, volume 28 of Proceedings of Machine", + "type": "text", + "cross_page": true + } + ], + "index": 9 + }, + { + "bbox": [ + 126, + 206, + 480, + 220 + ], + "spans": [ + { + "bbox": [ + 126, + 206, + 480, + 220 + ], + "score": 1.0, + "content": "Learning Research, pages 1139–1147, Atlanta, Georgia, USA, 17–19 Jun 2013. PMLR.", + "type": "text", + "cross_page": true + } + ], + "index": 10, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 223, + 507, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 507, + 240 + ], + "score": 1.0, + "content": "[34] C. Szegedy, W. Zaremba, I. Sutskever, J. Bruna, D. Erhan, I. Goodfellow, and R. Fergus.", + "type": "text", + "cross_page": true + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 236, + 451, + 249 + ], + "spans": [ + { + "bbox": [ + 127, + 236, + 451, + 249 + ], + "score": 1.0, + "content": "Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199, 2013.", + "type": "text", + "cross_page": true + } + ], + "index": 12, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 253, + 506, + 269 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 506, + 269 + ], + "score": 1.0, + "content": "[35] S. Tong and D. Koller. Support vector machine active learning with applications to text", + "type": "text", + "cross_page": true + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 266, + 357, + 279 + ], + "spans": [ + { + "bbox": [ + 127, + 266, + 357, + 279 + ], + "score": 1.0, + "content": "classification. J. Mach. Learn. Res., 2:45–66, Mar. 2002.", + "type": "text", + "cross_page": true + } + ], + "index": 14, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 282, + 506, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 506, + 299 + ], + "score": 1.0, + "content": "[36] L. Yu, K. Balasubramanian, S. Volgushev, and M. A. Erdogdu. An analysis of constant step", + "type": "text", + "cross_page": true + } + ], + "index": 15, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 295, + 423, + 309 + ], + "spans": [ + { + "bbox": [ + 127, + 295, + 423, + 309 + ], + "score": 1.0, + "content": "size sgd in the non-convex regime: Asymptotic normality and bias, 2020.", + "type": "text", + "cross_page": true + } + ], + "index": 16, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 315, + 506, + 327 + ], + "spans": [ + { + "bbox": [ + 106, + 315, + 506, + 327 + ], + "score": 1.0, + "content": "[37] X. Zhang, J. J. Zhao, and Y. LeCun. Character-level convolutional networks for text classification.", + "type": "text", + "cross_page": true + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 326, + 189, + 337 + ], + "spans": [ + { + "bbox": [ + 127, + 326, + 189, + 337 + ], + "score": 1.0, + "content": "In NIPS, 2015.", + "type": "text", + "cross_page": true + } + ], + "index": 18, + "is_list_end_line": true + } + ], + "index": 34.5, + "bbox_fs": [ + 108, + 424, + 507, + 723 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 61, + 507, + 722 + ], + "lines": [ + { + "bbox": [ + 106, + 73, + 506, + 86 + ], + "spans": [ + { + "bbox": [ + 106, + 73, + 506, + 86 + ], + "score": 1.0, + "content": "[11] K. Grosse, T. A. Trost, M. Mosbach, M. Backes, and D. Klakow. On the security relevance", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 127, + 83, + 506, + 97 + ], + "spans": [ + { + "bbox": [ + 127, + 83, + 506, + 97 + ], + "score": 1.0, + "content": "of initial weights in deep neural networks. In I. Farkaš, P. Masulli, and S. Wermter, editors,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 126, + 94, + 507, + 108 + ], + "spans": [ + { + "bbox": [ + 126, + 94, + 507, + 108 + ], + "score": 1.0, + "content": "Artificial Neural Networks and Machine Learning – ICANN 2020, pages 3–14, Cham, 2020.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 126, + 105, + 267, + 121 + ], + "spans": [ + { + "bbox": [ + 126, + 105, + 267, + 121 + ], + "score": 1.0, + "content": "Springer International Publishing.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 123, + 506, + 138 + ], + "spans": [ + { + "bbox": [ + 104, + 123, + 506, + 138 + ], + "score": 1.0, + "content": "[12] T. Gu, B. Dolan-Gavitt, and S. Garg. Badnets: Identifying vulnerabilities in the machine", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 127, + 136, + 410, + 150 + ], + "spans": [ + { + "bbox": [ + 127, + 136, + 410, + 150 + ], + "score": 1.0, + "content": "learning model supply chain. arXiv preprint arXiv:1708.06733, 2017.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 153, + 507, + 168 + ], + "spans": [ + { + "bbox": [ + 104, + 153, + 507, + 168 + ], + "score": 1.0, + "content": "[13] G. Hacohen and D. Weinshall. On the power of curriculum learning in training deep networks. In", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 127, + 165, + 505, + 179 + ], + "spans": [ + { + "bbox": [ + 127, + 165, + 505, + 179 + ], + "score": 1.0, + "content": "K. Chaudhuri and R. Salakhutdinov, editors, Proceedings of the 36th International Conference", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 127, + 176, + 506, + 190 + ], + "spans": [ + { + "bbox": [ + 127, + 176, + 506, + 190 + ], + "score": 1.0, + "content": "on Machine Learning, volume 97 of Proceedings of Machine Learning Research, pages 2535–", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 128, + 188, + 255, + 200 + ], + "spans": [ + { + "bbox": [ + 128, + 188, + 255, + 200 + ], + "score": 1.0, + "content": "2544. PMLR, 09–15 Jun 2019.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 206, + 505, + 220 + ], + "spans": [ + { + "bbox": [ + 105, + 206, + 505, + 220 + ], + "score": 1.0, + "content": "[14] K. He, X. Zhang, S. Ren, and J. Sun. Deep residual learning for image recognition. In", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 127, + 217, + 507, + 231 + ], + "spans": [ + { + "bbox": [ + 127, + 217, + 507, + 231 + ], + "score": 1.0, + "content": "Proceedings of the IEEE conference on computer vision and pattern recognition, pages 770–", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 127, + 226, + 174, + 242 + ], + "spans": [ + { + "bbox": [ + 127, + 226, + 174, + 242 + ], + "score": 1.0, + "content": "778, 2016.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 247, + 506, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 506, + 261 + ], + "score": 1.0, + "content": "[15] S. Hooker. Moving beyond “algorithmic bias is a data problem”. Patterns, 2(4):100241, 2021.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 265, + 506, + 280 + ], + "spans": [ + { + "bbox": [ + 104, + 265, + 506, + 280 + ], + "score": 1.0, + "content": "[16] A. G. Howard, M. Zhu, B. Chen, D. Kalenichenko, W. Wang, T. Weyand, M. Andreetto, and", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 125, + 276, + 507, + 291 + ], + "spans": [ + { + "bbox": [ + 125, + 276, + 507, + 291 + ], + "score": 1.0, + "content": "H. Adam. Mobilenets: Efficient convolutional neural networks for mobile vision applications.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 126, + 288, + 291, + 302 + ], + "spans": [ + { + "bbox": [ + 126, + 288, + 291, + 302 + ], + "score": 1.0, + "content": "arXiv preprint arXiv:1704.04861, 2017.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 308, + 505, + 320 + ], + "spans": [ + { + "bbox": [ + 106, + 308, + 505, + 320 + ], + "score": 1.0, + "content": "[17] M. Jagielski, A. Oprea, B. Biggio, C. Liu, C. Nita-Rotaru, and B. Li. Manipulating machine", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 127, + 318, + 506, + 332 + ], + "spans": [ + { + "bbox": [ + 127, + 318, + 506, + 332 + ], + "score": 1.0, + "content": "learning: Poisoning attacks and countermeasures for regression learning. In 2018 IEEE", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 127, + 329, + 403, + 343 + ], + "spans": [ + { + "bbox": [ + 127, + 329, + 403, + 343 + ], + "score": 1.0, + "content": "Symposium on Security and Privacy (SP), pages 19–35. IEEE, 2018.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 348, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 106, + 348, + 505, + 362 + ], + "score": 1.0, + "content": "[18] R. Johnson and T. Zhang. Accelerating stochastic gradient descent using predictive variance", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 127, + 360, + 459, + 374 + ], + "spans": [ + { + "bbox": [ + 127, + 360, + 459, + 374 + ], + "score": 1.0, + "content": "reduction. Advances in neural information processing systems, 26:315–323, 2013.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 378, + 502, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 378, + 502, + 392 + ], + "score": 1.0, + "content": "[19] A. Krizhevsky, G. Hinton, et al. Learning multiple layers of features from tiny images. 2009.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 396, + 507, + 411 + ], + "spans": [ + { + "bbox": [ + 104, + 396, + 507, + 411 + ], + "score": 1.0, + "content": "[20] M. Kumar, B. Packer, and D. Koller. Self-paced learning for latent variable models. In", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 125, + 407, + 506, + 422 + ], + "spans": [ + { + "bbox": [ + 125, + 407, + 506, + 422 + ], + "score": 1.0, + "content": "J. Lafferty, C. Williams, J. Shawe-Taylor, R. Zemel, and A. Culotta, editors, Advances in Neural", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 127, + 419, + 431, + 433 + ], + "spans": [ + { + "bbox": [ + 127, + 419, + 431, + 433 + ], + "score": 1.0, + "content": "Information Processing Systems, volume 23. Curran Associates, Inc., 2010.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 438, + 506, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 506, + 452 + ], + "score": 1.0, + "content": "[21] Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner. Gradient-based learning applied to document", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 127, + 449, + 387, + 463 + ], + "spans": [ + { + "bbox": [ + 127, + 449, + 387, + 463 + ], + "score": 1.0, + "content": "recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 468, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 106, + 468, + 505, + 482 + ], + "score": 1.0, + "content": "[22] A. Madry, A. Makelov, L. Schmidt, D. Tsipras, and A. Vladu. Towards deep learning models", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 127, + 479, + 278, + 491 + ], + "spans": [ + { + "bbox": [ + 127, + 479, + 278, + 491 + ], + "score": 1.0, + "content": "resistant to adversarial attacks, 2019.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 497, + 505, + 511 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 505, + 511 + ], + "score": 1.0, + "content": "[23] N. Mehrabi, F. Morstatter, N. Saxena, K. Lerman, and A. Galstyan. A survey on bias and", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 127, + 510, + 369, + 522 + ], + "spans": [ + { + "bbox": [ + 127, + 510, + 369, + 522 + ], + "score": 1.0, + "content": "fairness in machine learning. CoRR, abs/1908.09635, 2019.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "score": 1.0, + "content": "[24] N. Papernot, P. McDaniel, I. Goodfellow, S. Jha, Z. B. Celik, and A. Swami. Practical black-box", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 127, + 539, + 506, + 553 + ], + "spans": [ + { + "bbox": [ + 127, + 539, + 506, + 553 + ], + "score": 1.0, + "content": "attacks against machine learning. In Proceedings of the 2017 ACM on Asia conference on", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 125, + 549, + 381, + 564 + ], + "spans": [ + { + "bbox": [ + 125, + 549, + 381, + 564 + ], + "score": 1.0, + "content": "computer and communications security, pages 506–519, 2017.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 569, + 506, + 583 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 506, + 583 + ], + "score": 1.0, + "content": "[25] B. Polyak. Some methods of speeding up the convergence of iteration methods. USSR", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 127, + 580, + 424, + 594 + ], + "spans": [ + { + "bbox": [ + 127, + 580, + 424, + 594 + ], + "score": 1.0, + "content": "Computational Mathematics and Mathematical Physics, 4(5):1–17, 1964.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 599, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 599, + 506, + 613 + ], + "score": 1.0, + "content": "[26] M. Raginsky, A. Rakhlin, and M. Telgarsky. Non-convex learning via stochastic gradient", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 127, + 610, + 340, + 624 + ], + "spans": [ + { + "bbox": [ + 127, + 610, + 340, + 624 + ], + "score": 1.0, + "content": "langevin dynamics: a nonasymptotic analysis, 2017.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 628, + 506, + 642 + ], + "spans": [ + { + "bbox": [ + 106, + 628, + 506, + 642 + ], + "score": 1.0, + "content": "[27] H. Robbins and S. Monro. A stochastic approximation method. The annals of mathematical", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 125, + 640, + 259, + 653 + ], + "spans": [ + { + "bbox": [ + 125, + 640, + 259, + 653 + ], + "score": 1.0, + "content": "statistics, pages 400–407, 1951.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 658, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 658, + 505, + 672 + ], + "score": 1.0, + "content": "[28] A. Salem, R. Wen, M. Backes, S. Ma, and Y. Zhang. Dynamic backdoor attacks against machine", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 127, + 669, + 222, + 683 + ], + "spans": [ + { + "bbox": [ + 127, + 669, + 222, + 683 + ], + "score": 1.0, + "content": "learning models, 2020.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 689, + 507, + 703 + ], + "spans": [ + { + "bbox": [ + 106, + 689, + 507, + 703 + ], + "score": 1.0, + "content": "[29] A. Shafahi, W. R. Huang, M. Najibi, O. Suciu, C. Studer, T. Dumitras, and T. Goldstein.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 124, + 698, + 507, + 715 + ], + "spans": [ + { + "bbox": [ + 124, + 698, + 507, + 715 + ], + "score": 1.0, + "content": "Poison frogs! targeted clean-label poisoning attacks on neural networks. arXiv preprint", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 126, + 711, + 231, + 723 + ], + "spans": [ + { + "bbox": [ + 126, + 711, + 231, + 723 + ], + "score": 1.0, + "content": "arXiv:1804.00792, 2018.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 22.5 + } + ], + "page_idx": 10, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 741, + 310, + 751 + ], + "lines": [ + { + "bbox": [ + 299, + 740, + 312, + 754 + ], + "spans": [ + { + "bbox": [ + 299, + 740, + 312, + 754 + ], + "score": 1.0, + "content": "11", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "list", + "bbox": [ + 105, + 61, + 507, + 722 + ], + "lines": [], + "index": 22.5, + "bbox_fs": [ + 104, + 73, + 507, + 723 + ], + "lines_deleted": true + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 104, + 70, + 507, + 339 + ], + "lines": [ + { + "bbox": [ + 106, + 72, + 506, + 86 + ], + "spans": [ + { + "bbox": [ + 106, + 72, + 506, + 86 + ], + "score": 1.0, + "content": "[30] I. Shumailov, Y. Zhao, D. Bates, N. Papernot, R. Mullins, and R. Anderson. Sponge examples:", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 127, + 84, + 506, + 98 + ], + "spans": [ + { + "bbox": [ + 127, + 84, + 506, + 98 + ], + "score": 1.0, + "content": "Energy-latency attacks on neural networks. In 6th IEEE European Symposium on Security and", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 127, + 95, + 236, + 108 + ], + "spans": [ + { + "bbox": [ + 127, + 95, + 236, + 108 + ], + "score": 1.0, + "content": "Privacy (EuroS&P), 2021.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 113, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 113, + 506, + 128 + ], + "score": 1.0, + "content": "[31] S. L. Smith, B. Dherin, D. G. T. Barrett, and S. De. On the origin of implicit regularization in", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 127, + 125, + 264, + 138 + ], + "spans": [ + { + "bbox": [ + 127, + 125, + 264, + 138 + ], + "score": 1.0, + "content": "stochastic gradient descent, 2021.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 144, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 505, + 156 + ], + "score": 1.0, + "content": "[32] M. Sun, S. Agarwal, and J. Z. Kolter. Poisoned classifiers are not only backdoored, they are", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 127, + 155, + 246, + 168 + ], + "spans": [ + { + "bbox": [ + 127, + 155, + 246, + 168 + ], + "score": 1.0, + "content": "fundamentally broken, 2020.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 173, + 506, + 186 + ], + "spans": [ + { + "bbox": [ + 105, + 173, + 506, + 186 + ], + "score": 1.0, + "content": "[33] I. Sutskever, J. Martens, G. Dahl, and G. Hinton. On the importance of initialization and", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 126, + 184, + 506, + 198 + ], + "spans": [ + { + "bbox": [ + 126, + 184, + 506, + 198 + ], + "score": 1.0, + "content": "momentum in deep learning. In S. Dasgupta and D. McAllester, editors, Proceedings of the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 126, + 195, + 506, + 209 + ], + "spans": [ + { + "bbox": [ + 126, + 195, + 506, + 209 + ], + "score": 1.0, + "content": "30th International Conference on Machine Learning, volume 28 of Proceedings of Machine", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 126, + 206, + 480, + 220 + ], + "spans": [ + { + "bbox": [ + 126, + 206, + 480, + 220 + ], + "score": 1.0, + "content": "Learning Research, pages 1139–1147, Atlanta, Georgia, USA, 17–19 Jun 2013. PMLR.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 223, + 507, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 507, + 240 + ], + "score": 1.0, + "content": "[34] C. Szegedy, W. Zaremba, I. Sutskever, J. Bruna, D. Erhan, I. Goodfellow, and R. Fergus.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 127, + 236, + 451, + 249 + ], + "spans": [ + { + "bbox": [ + 127, + 236, + 451, + 249 + ], + "score": 1.0, + "content": "Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199, 2013.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 253, + 506, + 269 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 506, + 269 + ], + "score": 1.0, + "content": "[35] S. Tong and D. Koller. Support vector machine active learning with applications to text", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 127, + 266, + 357, + 279 + ], + "spans": [ + { + "bbox": [ + 127, + 266, + 357, + 279 + ], + "score": 1.0, + "content": "classification. J. Mach. Learn. Res., 2:45–66, Mar. 2002.", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 282, + 506, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 506, + 299 + ], + "score": 1.0, + "content": "[36] L. Yu, K. Balasubramanian, S. Volgushev, and M. A. Erdogdu. An analysis of constant step", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 127, + 295, + 423, + 309 + ], + "spans": [ + { + "bbox": [ + 127, + 295, + 423, + 309 + ], + "score": 1.0, + "content": "size sgd in the non-convex regime: Asymptotic normality and bias, 2020.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 315, + 506, + 327 + ], + "spans": [ + { + "bbox": [ + 106, + 315, + 506, + 327 + ], + "score": 1.0, + "content": "[37] X. Zhang, J. J. Zhao, and Y. LeCun. Character-level convolutional networks for text classification.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 127, + 326, + 189, + 337 + ], + "spans": [ + { + "bbox": [ + 127, + 326, + 189, + 337 + ], + "score": 1.0, + "content": "In NIPS, 2015.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 9 + } + ], + "page_idx": 11, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 741, + 311, + 750 + ], + "lines": [ + { + "bbox": [ + 299, + 740, + 313, + 754 + ], + "spans": [ + { + "bbox": [ + 299, + 740, + 313, + 754 + ], + "score": 1.0, + "content": "12", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "list", + "bbox": [ + 104, + 70, + 507, + 339 + ], + "lines": [], + "index": 9, + "bbox_fs": [ + 105, + 72, + 507, + 337 + ], + "lines_deleted": true + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/Z7xSQ3SXLQU/Z7xSQ3SXLQU_model.json b/parse/train/Z7xSQ3SXLQU/Z7xSQ3SXLQU_model.json new file mode 100644 index 0000000000000000000000000000000000000000..7a5c32c728fa240bafbaf30dce4b77b64be82d46 --- /dev/null +++ b/parse/train/Z7xSQ3SXLQU/Z7xSQ3SXLQU_model.json @@ -0,0 +1,13507 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 1057, + 1304, + 1057, + 1304, + 1450, + 398, + 1450 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1585, + 1403, + 1585, + 1403, + 1798, + 298, + 1798 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1813, + 1403, + 1813, + 1403, + 1904, + 299, + 1904 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 793, + 444, + 1075, + 444, + 1075, + 535, + 793, + 535 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 874, + 614, + 1288, + 614, + 1288, + 736, + 874, + 736 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 425, + 783, + 751, + 783, + 751, + 905, + 425, + 905 + ], + "score": 0.927 + }, + { + "category_id": 0, + "poly": [ + 354, + 270, + 1345, + 270, + 1345, + 328, + 354, + 328 + ], + "score": 0.924 + }, + { + "category_id": 0, + "poly": [ + 299, + 1512, + 530, + 1512, + 530, + 1551, + 299, + 1551 + ], + "score": 0.911 + }, + { + "category_id": 1, + "poly": [ + 410, + 613, + 752, + 613, + 752, + 706, + 410, + 706 + ], + "score": 0.907 + }, + { + "category_id": 0, + "poly": [ + 788, + 984, + 912, + 984, + 912, + 1020, + 788, + 1020 + ], + "score": 0.892 + }, + { + "category_id": 2, + "poly": [ + 297, + 2033, + 1070, + 2033, + 1070, + 2061, + 297, + 2061 + ], + "score": 0.873 + }, + { + "category_id": 1, + "poly": [ + 299, + 1918, + 1399, + 1918, + 1399, + 1981, + 299, + 1981 + ], + "score": 0.862 + }, + { + "category_id": 1, + "poly": [ + 316, + 444, + 764, + 444, + 764, + 566, + 316, + 566 + ], + "score": 0.852 + }, + { + "category_id": 1, + "poly": [ + 890, + 783, + 1273, + 783, + 1273, + 904, + 890, + 904 + ], + "score": 0.658 + }, + { + "category_id": 1, + "poly": [ + 1105, + 444, + 1384, + 444, + 1384, + 537, + 1105, + 537 + ], + "score": 0.485 + }, + { + "category_id": 0, + "poly": [ + 990, + 784, + 1171, + 784, + 1171, + 811, + 990, + 811 + ], + "score": 0.387 + }, + { + "category_id": 0, + "poly": [ + 452, + 445, + 627, + 445, + 627, + 473, + 452, + 473 + ], + "score": 0.211 + }, + { + "category_id": 0, + "poly": [ + 512, + 614, + 649, + 614, + 649, + 642, + 512, + 642 + ], + "score": 0.151 + }, + { + "category_id": 0, + "poly": [ + 977, + 615, + 1182, + 615, + 1182, + 644, + 977, + 644 + ], + "score": 0.114 + }, + { + "category_id": 15, + "poly": [ + 355.0, + 268.0, + 1343.0, + 268.0, + 1343.0, + 334.0, + 355.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1509.0, + 536.0, + 1509.0, + 536.0, + 1557.0, + 292.0, + 1557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 782.0, + 981.0, + 919.0, + 981.0, + 919.0, + 1025.0, + 782.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2028.0, + 1075.0, + 2028.0, + 1075.0, + 2067.0, + 293.0, + 2067.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 988.0, + 779.0, + 1175.0, + 779.0, + 1175.0, + 816.0, + 988.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 443.0, + 630.0, + 443.0, + 630.0, + 478.0, + 449.0, + 478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 610.0, + 655.0, + 610.0, + 655.0, + 648.0, + 509.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 978.0, + 611.0, + 1187.0, + 611.0, + 1187.0, + 650.0, + 978.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1057.0, + 1307.0, + 1057.0, + 1307.0, + 1089.0, + 395.0, + 1089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1085.0, + 1304.0, + 1085.0, + 1304.0, + 1122.0, + 394.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1115.0, + 1306.0, + 1115.0, + 1306.0, + 1152.0, + 393.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1148.0, + 1306.0, + 1148.0, + 1306.0, + 1183.0, + 394.0, + 1183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1177.0, + 1305.0, + 1177.0, + 1305.0, + 1211.0, + 394.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1208.0, + 1305.0, + 1208.0, + 1305.0, + 1240.0, + 394.0, + 1240.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1240.0, + 1308.0, + 1240.0, + 1308.0, + 1272.0, + 394.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1269.0, + 1306.0, + 1269.0, + 1306.0, + 1304.0, + 393.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1300.0, + 1305.0, + 1300.0, + 1305.0, + 1332.0, + 393.0, + 1332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1330.0, + 1307.0, + 1330.0, + 1307.0, + 1361.0, + 393.0, + 1361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1361.0, + 1304.0, + 1361.0, + 1304.0, + 1393.0, + 394.0, + 1393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1389.0, + 1305.0, + 1389.0, + 1305.0, + 1425.0, + 394.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1421.0, + 994.0, + 1421.0, + 994.0, + 1453.0, + 395.0, + 1453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1584.0, + 1405.0, + 1584.0, + 1405.0, + 1621.0, + 293.0, + 1621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1614.0, + 1407.0, + 1614.0, + 1407.0, + 1652.0, + 293.0, + 1652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1646.0, + 1403.0, + 1646.0, + 1403.0, + 1680.0, + 294.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1676.0, + 1405.0, + 1676.0, + 1405.0, + 1712.0, + 293.0, + 1712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1705.0, + 1405.0, + 1705.0, + 1405.0, + 1742.0, + 293.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1736.0, + 1405.0, + 1736.0, + 1405.0, + 1771.0, + 293.0, + 1771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1765.0, + 1252.0, + 1765.0, + 1252.0, + 1805.0, + 292.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1811.0, + 1407.0, + 1811.0, + 1407.0, + 1848.0, + 293.0, + 1848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1843.0, + 1405.0, + 1843.0, + 1405.0, + 1876.0, + 295.0, + 1876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1872.0, + 1353.0, + 1872.0, + 1353.0, + 1911.0, + 292.0, + 1911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 815.0, + 441.0, + 1054.0, + 441.0, + 1054.0, + 479.0, + 815.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 793.0, + 472.0, + 1077.0, + 472.0, + 1077.0, + 509.0, + 793.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 506.0, + 1048.0, + 506.0, + 1048.0, + 537.0, + 821.0, + 537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 976.0, + 611.0, + 1188.0, + 611.0, + 1188.0, + 648.0, + 976.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 944.0, + 641.0, + 1220.0, + 641.0, + 1220.0, + 676.0, + 944.0, + 676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 995.0, + 675.0, + 1172.0, + 675.0, + 1172.0, + 707.0, + 995.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 707.0, + 1290.0, + 707.0, + 1290.0, + 738.0, + 874.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 473.0, + 779.0, + 704.0, + 779.0, + 704.0, + 816.0, + 473.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 811.0, + 727.0, + 811.0, + 727.0, + 848.0, + 449.0, + 848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.0, + 842.0, + 678.0, + 842.0, + 678.0, + 877.0, + 500.0, + 877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 875.0, + 752.0, + 875.0, + 752.0, + 907.0, + 424.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 608.0, + 655.0, + 608.0, + 655.0, + 648.0, + 509.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.0, + 641.0, + 723.0, + 641.0, + 723.0, + 677.0, + 440.0, + 677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 409.0, + 676.0, + 752.0, + 676.0, + 752.0, + 707.0, + 409.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1915.0, + 1407.0, + 1915.0, + 1407.0, + 1956.0, + 294.0, + 1956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1950.0, + 1405.0, + 1950.0, + 1405.0, + 1985.0, + 295.0, + 1985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 442.0, + 630.0, + 442.0, + 630.0, + 477.0, + 450.0, + 477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 475.0, + 695.0, + 475.0, + 695.0, + 507.0, + 385.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 507.0, + 766.0, + 507.0, + 766.0, + 538.0, + 315.0, + 538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 340.0, + 536.0, + 739.0, + 536.0, + 739.0, + 568.0, + 340.0, + 568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 989.0, + 782.0, + 1175.0, + 782.0, + 1175.0, + 814.0, + 989.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 813.0, + 1238.0, + 813.0, + 1238.0, + 847.0, + 927.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 844.0, + 1221.0, + 844.0, + 1221.0, + 876.0, + 945.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 875.0, + 1275.0, + 875.0, + 1275.0, + 906.0, + 888.0, + 906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 444.0, + 1349.0, + 444.0, + 1349.0, + 476.0, + 1140.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1103.0, + 472.0, + 1388.0, + 472.0, + 1388.0, + 510.0, + 1103.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 504.0, + 1358.0, + 504.0, + 1358.0, + 539.0, + 1131.0, + 539.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 642, + 1406, + 642, + 1406, + 977, + 298, + 977 + ], + "score": 0.979 + }, + { + "category_id": 5, + "poly": [ + 352, + 197, + 1342, + 197, + 1342, + 372, + 352, + 372 + ], + "score": 0.979, + "html": "
AttackDataset knowledgeModel knowledgeModelspecificChangingdatasetAdding dataAddingperturbations
Batch ReorderX
Batch ReshuffleXXXXXX
Batch ReplaceXXXXXX
Adversarial initialisation [11]×√XX
BadNets [12]XXX×
Dynamic triggers [28]√√XX√
Poisoned frogs [32]√X√X√
" + }, + { + "category_id": 1, + "poly": [ + 298, + 1544, + 1403, + 1544, + 1403, + 1728, + 298, + 1728 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 1742, + 1403, + 1742, + 1403, + 1956, + 299, + 1956 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 475, + 1404, + 475, + 1404, + 627, + 298, + 627 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 372, + 1048, + 1405, + 1048, + 1405, + 1434, + 372, + 1434 + ], + "score": 0.946 + }, + { + "category_id": 0, + "poly": [ + 299, + 1476, + 549, + 1476, + 549, + 1513, + 299, + 1513 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 298, + 989, + 1026, + 989, + 1026, + 1022, + 298, + 1022 + ], + "score": 0.91 + }, + { + "category_id": 2, + "poly": [ + 330, + 1978, + 1237, + 1978, + 1237, + 2008, + 330, + 2008 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 841, + 2062, + 858, + 2062, + 858, + 2085, + 841, + 2085 + ], + "score": 0.752 + }, + { + "category_id": 7, + "poly": [ + 406, + 386, + 1287, + 386, + 1287, + 418, + 406, + 418 + ], + "score": 0.43 + }, + { + "category_id": 6, + "poly": [ + 406, + 386, + 1287, + 386, + 1287, + 418, + 406, + 418 + ], + "score": 0.333 + }, + { + "category_id": 13, + "poly": [ + 805, + 1403, + 921, + 1403, + 921, + 1434, + 805, + 1434 + ], + "score": 0.91, + "latex": "6 8 \\% \\pm 1 9" + }, + { + "category_id": 13, + "poly": [ + 1237, + 1372, + 1354, + 1372, + 1354, + 1403, + 1237, + 1403 + ], + "score": 0.89, + "latex": "9 1 \\% \\pm 1 3" + }, + { + "category_id": 13, + "poly": [ + 618, + 1372, + 674, + 1372, + 674, + 1402, + 618, + 1402 + ], + "score": 0.87, + "latex": "{ \\bar { 9 } } 9 \\%" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1473.0, + 551.0, + 1473.0, + 551.0, + 1518.0, + 292.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1972.0, + 1242.0, + 1972.0, + 1242.0, + 2013.0, + 333.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2059.0, + 862.0, + 2059.0, + 862.0, + 2094.0, + 839.0, + 2094.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 383.0, + 1289.0, + 383.0, + 1289.0, + 423.0, + 408.0, + 423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 383.0, + 1289.0, + 383.0, + 1289.0, + 423.0, + 408.0, + 423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 638.0, + 1409.0, + 638.0, + 1409.0, + 681.0, + 293.0, + 681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 670.0, + 1406.0, + 670.0, + 1406.0, + 711.0, + 292.0, + 711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 702.0, + 1406.0, + 702.0, + 1406.0, + 740.0, + 293.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 734.0, + 1404.0, + 734.0, + 1404.0, + 769.0, + 295.0, + 769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 760.0, + 1407.0, + 760.0, + 1407.0, + 801.0, + 292.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 791.0, + 1406.0, + 791.0, + 1406.0, + 829.0, + 293.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 822.0, + 1407.0, + 822.0, + 1407.0, + 861.0, + 292.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 855.0, + 1409.0, + 855.0, + 1409.0, + 890.0, + 293.0, + 890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 885.0, + 1408.0, + 885.0, + 1408.0, + 919.0, + 295.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 915.0, + 1406.0, + 915.0, + 1406.0, + 952.0, + 293.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 945.0, + 860.0, + 945.0, + 860.0, + 979.0, + 295.0, + 979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1543.0, + 1405.0, + 1543.0, + 1405.0, + 1582.0, + 293.0, + 1582.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1575.0, + 1405.0, + 1575.0, + 1405.0, + 1611.0, + 294.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1602.0, + 1407.0, + 1602.0, + 1407.0, + 1644.0, + 292.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1639.0, + 1404.0, + 1639.0, + 1404.0, + 1670.0, + 296.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1668.0, + 1404.0, + 1668.0, + 1404.0, + 1699.0, + 296.0, + 1699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1697.0, + 1365.0, + 1697.0, + 1365.0, + 1731.0, + 292.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1742.0, + 1403.0, + 1742.0, + 1403.0, + 1777.0, + 294.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1769.0, + 1405.0, + 1769.0, + 1405.0, + 1810.0, + 292.0, + 1810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1802.0, + 1404.0, + 1802.0, + 1404.0, + 1837.0, + 294.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1829.0, + 1407.0, + 1829.0, + 1407.0, + 1872.0, + 293.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1862.0, + 1405.0, + 1862.0, + 1405.0, + 1898.0, + 293.0, + 1898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1896.0, + 1407.0, + 1896.0, + 1407.0, + 1926.0, + 295.0, + 1926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1920.0, + 1407.0, + 1920.0, + 1407.0, + 1961.0, + 293.0, + 1961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 475.0, + 1406.0, + 475.0, + 1406.0, + 509.0, + 293.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 506.0, + 1404.0, + 506.0, + 1404.0, + 539.0, + 296.0, + 539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 534.0, + 1404.0, + 534.0, + 1404.0, + 571.0, + 294.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 564.0, + 1405.0, + 564.0, + 1405.0, + 602.0, + 292.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 595.0, + 364.0, + 595.0, + 364.0, + 630.0, + 294.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1045.0, + 1405.0, + 1045.0, + 1405.0, + 1083.0, + 369.0, + 1083.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1080.0, + 1403.0, + 1080.0, + 1403.0, + 1112.0, + 395.0, + 1112.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1110.0, + 1405.0, + 1110.0, + 1405.0, + 1146.0, + 394.0, + 1146.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1139.0, + 1307.0, + 1139.0, + 1307.0, + 1174.0, + 392.0, + 1174.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1179.0, + 1405.0, + 1179.0, + 1405.0, + 1214.0, + 372.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1211.0, + 1405.0, + 1211.0, + 1405.0, + 1247.0, + 394.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1243.0, + 1313.0, + 1243.0, + 1313.0, + 1276.0, + 394.0, + 1276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1277.0, + 1405.0, + 1277.0, + 1405.0, + 1318.0, + 369.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1313.0, + 1405.0, + 1313.0, + 1405.0, + 1346.0, + 394.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1341.0, + 1404.0, + 1341.0, + 1404.0, + 1374.0, + 394.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1371.0, + 617.0, + 1371.0, + 617.0, + 1408.0, + 392.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 675.0, + 1371.0, + 1236.0, + 1371.0, + 1236.0, + 1408.0, + 675.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1355.0, + 1371.0, + 1407.0, + 1371.0, + 1407.0, + 1408.0, + 1355.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1403.0, + 804.0, + 1403.0, + 804.0, + 1435.0, + 394.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 922.0, + 1403.0, + 931.0, + 1403.0, + 931.0, + 1435.0, + 922.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 985.0, + 1029.0, + 985.0, + 1029.0, + 1028.0, + 294.0, + 1028.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1447, + 1405, + 1447, + 1405, + 1723, + 298, + 1723 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 279, + 1405, + 279, + 1405, + 492, + 297, + 492 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1817, + 1403, + 1817, + 1403, + 2013, + 298, + 2013 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 507, + 1404, + 507, + 1404, + 658, + 298, + 658 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1281, + 1405, + 1281, + 1405, + 1433, + 298, + 1433 + ], + "score": 0.975 + }, + { + "category_id": 3, + "poly": [ + 483, + 842, + 1222, + 842, + 1222, + 1155, + 483, + 1155 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 298, + 203, + 1401, + 203, + 1401, + 265, + 298, + 265 + ], + "score": 0.952 + }, + { + "category_id": 4, + "poly": [ + 296, + 1176, + 1400, + 1176, + 1400, + 1239, + 296, + 1239 + ], + "score": 0.938 + }, + { + "category_id": 0, + "poly": [ + 298, + 1759, + 874, + 1759, + 874, + 1792, + 298, + 1792 + ], + "score": 0.931 + }, + { + "category_id": 0, + "poly": [ + 298, + 703, + 536, + 703, + 536, + 741, + 298, + 741 + ], + "score": 0.918 + }, + { + "category_id": 0, + "poly": [ + 298, + 773, + 526, + 773, + 526, + 806, + 298, + 806 + ], + "score": 0.88 + }, + { + "category_id": 2, + "poly": [ + 841, + 2061, + 858, + 2061, + 858, + 2085, + 841, + 2085 + ], + "score": 0.627 + }, + { + "category_id": 2, + "poly": [ + 841, + 2061, + 859, + 2061, + 859, + 2085, + 841, + 2085 + ], + "score": 0.411 + }, + { + "category_id": 13, + "poly": [ + 298, + 1908, + 434, + 1908, + 434, + 1942, + 298, + 1942 + ], + "score": 0.94, + "latex": "X \\ = \\ \\{ X _ { i } \\}" + }, + { + "category_id": 13, + "poly": [ + 467, + 1848, + 595, + 1848, + 595, + 1878, + 467, + 1878 + ], + "score": 0.92, + "latex": "X _ { i } \\sim { \\mathcal { X } } _ { \\mathrm { t r a i n } }" + }, + { + "category_id": 13, + "poly": [ + 475, + 1970, + 830, + 1970, + 830, + 2013, + 475, + 2013 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\hat { L } _ { k + 1 } ( \\theta ) = \\frac { 1 } { B } \\sum _ { i = k B + 1 } ^ { k B + B } L _ { i } ( \\theta ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 625, + 1938, + 841, + 1938, + 841, + 1971, + 625, + 1971 + ], + "score": 0.91, + "latex": "L _ { i } ( \\theta ) \\stackrel { \\cdot } { = } \\stackrel { \\cdot } { L } ( X _ { i } , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 942, + 1878, + 998, + 1878, + 998, + 1911, + 942, + 1911 + ], + "score": 0.91, + "latex": "L ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 949, + 1975, + 1023, + 1975, + 1023, + 2004, + 949, + 2004 + ], + "score": 0.89, + "latex": "N \\cdot B" + }, + { + "category_id": 13, + "poly": [ + 881, + 1940, + 900, + 1940, + 900, + 1966, + 881, + 1966 + ], + "score": 0.81, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 1345, + 1939, + 1371, + 1939, + 1371, + 1966, + 1345, + 1966 + ], + "score": 0.8, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 298, + 1879, + 314, + 1879, + 314, + 1906, + 298, + 1906 + ], + "score": 0.78, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 1383, + 1818, + 1402, + 1818, + 1402, + 1845, + 1383, + 1845 + ], + "score": 0.72, + "latex": "\\theta" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 862.0, + 882.0, + 862.0, + 882.0, + 888.0, + 790.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 914.0, + 834.0, + 914.0, + 834.0, + 936.0, + 770.0, + 936.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 776.0, + 929.0, + 826.0, + 929.0, + 826.0, + 949.0, + 776.0, + 949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 953.0, + 929.0, + 1037.0, + 929.0, + 1037.0, + 948.0, + 953.0, + 948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 969.0, + 941.0, + 1023.0, + 941.0, + 1023.0, + 963.0, + 969.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 956.0, + 861.0, + 956.0, + 861.0, + 986.0, + 811.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 807.0, + 980.0, + 864.0, + 980.0, + 864.0, + 1003.0, + 807.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 1012.0, + 839.0, + 1012.0, + 839.0, + 1020.0, + 831.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 540.0, + 1042.0, + 552.0, + 1042.0, + 552.0, + 1055.0, + 540.0, + 1055.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 518.0, + 1056.0, + 531.0, + 1056.0, + 531.0, + 1070.0, + 518.0, + 1070.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 554.0, + 1056.0, + 567.0, + 1056.0, + 567.0, + 1070.0, + 554.0, + 1070.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1048.0, + 722.0, + 1048.0, + 722.0, + 1090.0, + 658.0, + 1090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 777.0, + 1051.0, + 809.0, + 1051.0, + 809.0, + 1083.0, + 777.0, + 1083.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 1061.0, + 843.0, + 1061.0, + 843.0, + 1069.0, + 830.0, + 1069.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 1053.0, + 894.0, + 1053.0, + 894.0, + 1087.0, + 861.0, + 1087.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 938.0, + 1067.0, + 951.0, + 1067.0, + 951.0, + 1078.0, + 938.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 978.0, + 1052.0, + 1014.0, + 1052.0, + 1014.0, + 1085.0, + 978.0, + 1085.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 1070.0, + 1044.0, + 1070.0, + 1044.0, + 1078.0, + 1032.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1057.0, + 1094.0, + 1057.0, + 1094.0, + 1084.0, + 1065.0, + 1084.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1149.0, + 1058.0, + 1206.0, + 1058.0, + 1206.0, + 1082.0, + 1149.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1083.0, + 526.0, + 1083.0, + 526.0, + 1095.0, + 512.0, + 1095.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 532.0, + 1082.0, + 546.0, + 1082.0, + 546.0, + 1095.0, + 532.0, + 1095.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 554.0, + 1082.0, + 567.0, + 1082.0, + 567.0, + 1095.0, + 554.0, + 1095.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 1111.0, + 894.0, + 1111.0, + 894.0, + 1130.0, + 778.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 976.0, + 1113.0, + 1101.0, + 1113.0, + 1101.0, + 1132.0, + 976.0, + 1132.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1121.0, + 567.0, + 1121.0, + 567.0, + 1148.0, + 512.0, + 1148.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 772.0, + 1121.0, + 900.0, + 1121.0, + 900.0, + 1146.0, + 772.0, + 1146.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 974.0, + 1123.0, + 1101.0, + 1123.0, + 1101.0, + 1148.0, + 974.0, + 1148.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 521.0, + 1139.0, + 559.0, + 1139.0, + 559.0, + 1159.0, + 521.0, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1176.0, + 1405.0, + 1176.0, + 1405.0, + 1211.0, + 295.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1206.0, + 1382.0, + 1206.0, + 1382.0, + 1241.0, + 295.0, + 1241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1753.0, + 878.0, + 1753.0, + 878.0, + 1802.0, + 292.0, + 1802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 696.0, + 540.0, + 696.0, + 540.0, + 753.0, + 289.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 771.0, + 528.0, + 771.0, + 528.0, + 810.0, + 293.0, + 810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2058.0, + 860.0, + 2058.0, + 860.0, + 2089.0, + 839.0, + 2089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2058.0, + 862.0, + 2058.0, + 862.0, + 2091.0, + 838.0, + 2091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1448.0, + 1403.0, + 1448.0, + 1403.0, + 1481.0, + 296.0, + 1481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1477.0, + 1408.0, + 1477.0, + 1408.0, + 1515.0, + 293.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1508.0, + 1405.0, + 1508.0, + 1405.0, + 1545.0, + 295.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1538.0, + 1405.0, + 1538.0, + 1405.0, + 1575.0, + 293.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1569.0, + 1405.0, + 1569.0, + 1405.0, + 1606.0, + 295.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1601.0, + 1403.0, + 1601.0, + 1403.0, + 1633.0, + 296.0, + 1633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1629.0, + 1407.0, + 1629.0, + 1407.0, + 1665.0, + 292.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1658.0, + 1405.0, + 1658.0, + 1405.0, + 1697.0, + 293.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1691.0, + 1314.0, + 1691.0, + 1314.0, + 1726.0, + 293.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 279.0, + 1405.0, + 279.0, + 1405.0, + 313.0, + 295.0, + 313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 308.0, + 1406.0, + 308.0, + 1406.0, + 345.0, + 291.0, + 345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 340.0, + 1408.0, + 340.0, + 1408.0, + 374.0, + 294.0, + 374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 367.0, + 1408.0, + 367.0, + 1408.0, + 408.0, + 292.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 399.0, + 1406.0, + 399.0, + 1406.0, + 437.0, + 294.0, + 437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 431.0, + 1408.0, + 431.0, + 1408.0, + 465.0, + 295.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 458.0, + 1056.0, + 458.0, + 1056.0, + 497.0, + 294.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1816.0, + 1382.0, + 1816.0, + 1382.0, + 1853.0, + 296.0, + 1853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1848.0, + 466.0, + 1848.0, + 466.0, + 1881.0, + 296.0, + 1881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 1848.0, + 1403.0, + 1848.0, + 1403.0, + 1881.0, + 596.0, + 1881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1874.0, + 297.0, + 1874.0, + 297.0, + 1914.0, + 293.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 1874.0, + 941.0, + 1874.0, + 941.0, + 1914.0, + 315.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 999.0, + 1874.0, + 1407.0, + 1874.0, + 1407.0, + 1914.0, + 999.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1907.0, + 297.0, + 1907.0, + 297.0, + 1944.0, + 294.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 1907.0, + 1405.0, + 1907.0, + 1405.0, + 1944.0, + 435.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1937.0, + 624.0, + 1937.0, + 624.0, + 1974.0, + 294.0, + 1974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 1937.0, + 880.0, + 1937.0, + 880.0, + 1974.0, + 842.0, + 1974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 1937.0, + 1344.0, + 1937.0, + 1344.0, + 1974.0, + 901.0, + 1974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1372.0, + 1937.0, + 1407.0, + 1937.0, + 1407.0, + 1974.0, + 1372.0, + 1974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1965.0, + 474.0, + 1965.0, + 474.0, + 2019.0, + 291.0, + 2019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 1965.0, + 948.0, + 1965.0, + 948.0, + 2019.0, + 831.0, + 2019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1024.0, + 1965.0, + 1410.0, + 1965.0, + 1410.0, + 2019.0, + 1024.0, + 2019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 505.0, + 1405.0, + 505.0, + 1405.0, + 542.0, + 294.0, + 542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 537.0, + 1406.0, + 537.0, + 1406.0, + 569.0, + 296.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 566.0, + 1409.0, + 566.0, + 1409.0, + 602.0, + 294.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 593.0, + 1408.0, + 593.0, + 1408.0, + 636.0, + 292.0, + 636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 627.0, + 792.0, + 627.0, + 792.0, + 660.0, + 294.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1282.0, + 1407.0, + 1282.0, + 1407.0, + 1315.0, + 297.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1308.0, + 1408.0, + 1308.0, + 1408.0, + 1347.0, + 293.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1340.0, + 1406.0, + 1340.0, + 1406.0, + 1375.0, + 295.0, + 1375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1369.0, + 1405.0, + 1369.0, + 1405.0, + 1408.0, + 293.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1404.0, + 714.0, + 1404.0, + 714.0, + 1433.0, + 297.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 199.0, + 1406.0, + 199.0, + 1406.0, + 242.0, + 293.0, + 242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 233.0, + 742.0, + 233.0, + 742.0, + 268.0, + 294.0, + 268.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1579, + 1405, + 1579, + 1405, + 1825, + 297, + 1825 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 647, + 1406, + 647, + 1406, + 895, + 297, + 895 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1153, + 1405, + 1153, + 1405, + 1371, + 297, + 1371 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1382, + 1404, + 1382, + 1404, + 1566, + 298, + 1566 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 196, + 1403, + 196, + 1403, + 364, + 298, + 364 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1914, + 1403, + 1914, + 1403, + 2008, + 299, + 2008 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 373, + 1405, + 373, + 1405, + 504, + 299, + 504 + ], + "score": 0.975 + }, + { + "category_id": 8, + "poly": [ + 415, + 942, + 1279, + 942, + 1279, + 1131, + 415, + 1131 + ], + "score": 0.967 + }, + { + "category_id": 8, + "poly": [ + 476, + 539, + 1219, + 539, + 1219, + 631, + 476, + 631 + ], + "score": 0.96 + }, + { + "category_id": 0, + "poly": [ + 300, + 1858, + 718, + 1858, + 718, + 1891, + 300, + 1891 + ], + "score": 0.92 + }, + { + "category_id": 9, + "poly": [ + 1366, + 570, + 1400, + 570, + 1400, + 600, + 1366, + 600 + ], + "score": 0.878 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1022, + 1400, + 1022, + 1400, + 1052, + 1366, + 1052 + ], + "score": 0.874 + }, + { + "category_id": 2, + "poly": [ + 841, + 2061, + 858, + 2061, + 858, + 2084, + 841, + 2084 + ], + "score": 0.768 + }, + { + "category_id": 14, + "poly": [ + 478, + 536, + 1221, + 536, + 1221, + 632, + 478, + 632 + ], + "score": 0.95, + "latex": "\\mathbb { E } [ \\nabla \\hat { L } _ { i _ { k } } ( \\theta ) ] = \\sum _ { i = 1 } ^ { N } \\mathbb { P } ( i _ { k } = i ) \\nabla \\hat { L } _ { i } ( \\theta ) = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\nabla \\hat { L } _ { i } ( \\theta ) = \\nabla \\hat { L } ( \\theta ) ." + }, + { + "category_id": 13, + "poly": [ + 915, + 197, + 1178, + 197, + 1178, + 239, + 915, + 239 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\hat { L } ( \\theta ) = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\hat { L } _ { i } ( \\theta ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 353, + 470, + 552, + 470, + 552, + 504, + 353, + 504 + ], + "score": 0.92, + "latex": "\\mathbb { P } ( i _ { k } = i ) = 1 / N" + }, + { + "category_id": 13, + "poly": [ + 832, + 234, + 903, + 234, + 903, + 262, + 832, + 262 + ], + "score": 0.9, + "latex": "N \\cdot B" + }, + { + "category_id": 14, + "poly": [ + 414, + 937, + 1285, + 937, + 1285, + 1132, + 414, + 1132 + ], + "score": 0.86, + "latex": "\\begin{array} { l } { \\displaystyle \\theta _ { N + 1 } = \\theta _ { 1 } - \\eta \\nabla \\hat { L } _ { 1 } ( \\theta _ { 1 } ) - \\eta \\nabla \\hat { L } _ { 2 } ( \\theta _ { 2 } ) - \\cdot \\cdot \\cdot - \\eta \\nabla \\hat { L } _ { N } ( \\theta _ { N } ) } \\\\ { \\displaystyle \\qquad = \\theta _ { 1 } - \\eta \\sum _ { j = 1 } ^ { N } \\nabla \\hat { L } _ { j } ( \\theta _ { 1 } ) + \\eta ^ { 2 } \\sum _ { j = 1 } ^ { N } \\sum _ { k < j } \\nabla \\nabla \\hat { L } _ { j } ( \\theta _ { 1 } ) \\nabla \\hat { L } _ { k } ( \\theta _ { 1 } ) + O ( N ^ { 3 } \\eta ^ { 3 } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1280, + 443, + 1305, + 443, + 1305, + 471, + 1280, + 471 + ], + "score": 0.86, + "latex": "i _ { k }" + }, + { + "category_id": 13, + "poly": [ + 678, + 405, + 700, + 405, + 700, + 437, + 678, + 437 + ], + "score": 0.85, + "latex": "\\hat { L }" + }, + { + "category_id": 13, + "poly": [ + 819, + 268, + 1039, + 268, + 1039, + 301, + 819, + 301 + ], + "score": 0.85, + "latex": "\\theta _ { k + 1 } = \\theta _ { k } + \\eta \\Delta \\theta _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1073, + 265, + 1304, + 265, + 1304, + 302, + 1073, + 302 + ], + "score": 0.84, + "latex": "\\Delta \\theta _ { k } = - \\nabla _ { \\theta } \\hat { L } _ { k } ( \\theta _ { k } )" + }, + { + "category_id": 13, + "poly": [ + 878, + 305, + 898, + 305, + 898, + 330, + 878, + 330 + ], + "score": 0.81, + "latex": "\\mu" + }, + { + "category_id": 13, + "poly": [ + 852, + 864, + 880, + 864, + 880, + 890, + 852, + 890 + ], + "score": 0.8, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 915, + 441, + 935, + 441, + 935, + 467, + 915, + 467 + ], + "score": 0.78, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 1249, + 241, + 1266, + 241, + 1266, + 265, + 1249, + 265 + ], + "score": 0.75, + "latex": "\\eta" + }, + { + "category_id": 13, + "poly": [ + 952, + 306, + 969, + 306, + 969, + 326, + 952, + 326 + ], + "score": 0.74, + "latex": "v" + }, + { + "category_id": 13, + "poly": [ + 446, + 331, + 684, + 331, + 684, + 363, + 446, + 363 + ], + "score": 0.66, + "latex": "v _ { k + 1 } = \\mu v _ { k } + \\eta \\Delta \\theta _ { k }" + }, + { + "category_id": 13, + "poly": [ + 717, + 330, + 931, + 330, + 931, + 363, + 717, + 363 + ], + "score": 0.58, + "latex": "\\theta _ { k + 1 } = \\theta _ { k } + v _ { k + 1 }" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1856.0, + 722.0, + 1856.0, + 722.0, + 1898.0, + 292.0, + 1898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2059.0, + 862.0, + 2059.0, + 862.0, + 2091.0, + 839.0, + 2091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1579.0, + 1405.0, + 1579.0, + 1405.0, + 1614.0, + 294.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1611.0, + 1405.0, + 1611.0, + 1405.0, + 1644.0, + 294.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1640.0, + 1406.0, + 1640.0, + 1406.0, + 1677.0, + 294.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1672.0, + 1405.0, + 1672.0, + 1405.0, + 1706.0, + 295.0, + 1706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1701.0, + 1402.0, + 1701.0, + 1402.0, + 1734.0, + 295.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1732.0, + 1405.0, + 1732.0, + 1405.0, + 1766.0, + 295.0, + 1766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1763.0, + 1405.0, + 1763.0, + 1405.0, + 1797.0, + 295.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1793.0, + 852.0, + 1793.0, + 852.0, + 1831.0, + 294.0, + 1831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 647.0, + 1409.0, + 647.0, + 1409.0, + 685.0, + 292.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 679.0, + 1406.0, + 679.0, + 1406.0, + 714.0, + 294.0, + 714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 709.0, + 1406.0, + 709.0, + 1406.0, + 746.0, + 294.0, + 746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 741.0, + 1406.0, + 741.0, + 1406.0, + 775.0, + 295.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 771.0, + 1408.0, + 771.0, + 1408.0, + 807.0, + 294.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 802.0, + 1406.0, + 802.0, + 1406.0, + 836.0, + 294.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 830.0, + 1406.0, + 830.0, + 1406.0, + 869.0, + 292.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 863.0, + 851.0, + 863.0, + 851.0, + 897.0, + 294.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 863.0, + 1243.0, + 863.0, + 1243.0, + 897.0, + 881.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1155.0, + 1405.0, + 1155.0, + 1405.0, + 1190.0, + 294.0, + 1190.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1186.0, + 1406.0, + 1186.0, + 1406.0, + 1221.0, + 295.0, + 1221.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1212.0, + 1408.0, + 1212.0, + 1408.0, + 1255.0, + 292.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1247.0, + 1406.0, + 1247.0, + 1406.0, + 1282.0, + 295.0, + 1282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1277.0, + 1407.0, + 1277.0, + 1407.0, + 1312.0, + 294.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1308.0, + 1406.0, + 1308.0, + 1406.0, + 1343.0, + 295.0, + 1343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1335.0, + 1410.0, + 1335.0, + 1410.0, + 1375.0, + 292.0, + 1375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1381.0, + 1406.0, + 1381.0, + 1406.0, + 1418.0, + 292.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1412.0, + 1405.0, + 1412.0, + 1405.0, + 1450.0, + 293.0, + 1450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1441.0, + 1405.0, + 1441.0, + 1405.0, + 1479.0, + 293.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1473.0, + 1405.0, + 1473.0, + 1405.0, + 1508.0, + 294.0, + 1508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1506.0, + 1405.0, + 1506.0, + 1405.0, + 1537.0, + 296.0, + 1537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1534.0, + 674.0, + 1534.0, + 674.0, + 1569.0, + 294.0, + 1569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 195.0, + 914.0, + 195.0, + 914.0, + 247.0, + 284.0, + 247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1179.0, + 195.0, + 1412.0, + 195.0, + 1412.0, + 247.0, + 1179.0, + 247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 233.0, + 831.0, + 233.0, + 831.0, + 267.0, + 294.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 233.0, + 1248.0, + 233.0, + 1248.0, + 267.0, + 904.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1267.0, + 233.0, + 1405.0, + 233.0, + 1405.0, + 267.0, + 1267.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 267.0, + 818.0, + 267.0, + 818.0, + 304.0, + 293.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 267.0, + 1072.0, + 267.0, + 1072.0, + 304.0, + 1040.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 267.0, + 1407.0, + 267.0, + 1407.0, + 304.0, + 1305.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 299.0, + 877.0, + 299.0, + 877.0, + 333.0, + 296.0, + 333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 299.0, + 951.0, + 299.0, + 951.0, + 333.0, + 899.0, + 333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 970.0, + 299.0, + 1403.0, + 299.0, + 1403.0, + 333.0, + 970.0, + 333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 327.0, + 445.0, + 327.0, + 445.0, + 370.0, + 291.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 327.0, + 716.0, + 327.0, + 716.0, + 370.0, + 685.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 327.0, + 943.0, + 327.0, + 943.0, + 370.0, + 932.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1912.0, + 1405.0, + 1912.0, + 1405.0, + 1950.0, + 294.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1945.0, + 1405.0, + 1945.0, + 1405.0, + 1979.0, + 294.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1973.0, + 1404.0, + 1973.0, + 1404.0, + 2013.0, + 293.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 375.0, + 1403.0, + 375.0, + 1403.0, + 408.0, + 295.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 406.0, + 677.0, + 406.0, + 677.0, + 447.0, + 292.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 406.0, + 1410.0, + 406.0, + 1410.0, + 447.0, + 701.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 440.0, + 914.0, + 440.0, + 914.0, + 473.0, + 294.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 936.0, + 440.0, + 1279.0, + 440.0, + 1279.0, + 473.0, + 936.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 440.0, + 1405.0, + 440.0, + 1405.0, + 473.0, + 1306.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 471.0, + 352.0, + 471.0, + 352.0, + 505.0, + 295.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 471.0, + 1223.0, + 471.0, + 1223.0, + 505.0, + 553.0, + 505.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1091, + 1406, + 1091, + 1406, + 1366, + 296, + 1366 + ], + "score": 0.979 + }, + { + "category_id": 3, + "poly": [ + 460, + 197, + 1240, + 197, + 1240, + 408, + 460, + 408 + ], + "score": 0.97 + }, + { + "category_id": 3, + "poly": [ + 457, + 1412, + 1241, + 1412, + 1241, + 1633, + 457, + 1633 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 297, + 1913, + 1406, + 1913, + 1406, + 2007, + 297, + 2007 + ], + "score": 0.944 + }, + { + "category_id": 4, + "poly": [ + 296, + 423, + 1408, + 423, + 1408, + 576, + 296, + 576 + ], + "score": 0.943 + }, + { + "category_id": 4, + "poly": [ + 296, + 1648, + 1404, + 1648, + 1404, + 1862, + 296, + 1862 + ], + "score": 0.939 + }, + { + "category_id": 2, + "poly": [ + 841, + 2061, + 858, + 2061, + 858, + 2085, + 841, + 2085 + ], + "score": 0.698 + }, + { + "category_id": 1, + "poly": [ + 293, + 681, + 1400, + 681, + 1400, + 991, + 293, + 991 + ], + "score": 0.652 + }, + { + "category_id": 0, + "poly": [ + 299, + 639, + 1066, + 639, + 1066, + 673, + 299, + 673 + ], + "score": 0.412 + }, + { + "category_id": 4, + "poly": [ + 299, + 639, + 1066, + 639, + 1066, + 673, + 299, + 673 + ], + "score": 0.281 + }, + { + "category_id": 3, + "poly": [ + 293, + 681, + 1400, + 681, + 1400, + 991, + 293, + 991 + ], + "score": 0.186 + }, + { + "category_id": 2, + "poly": [ + 841, + 2061, + 859, + 2061, + 859, + 2085, + 841, + 2085 + ], + "score": 0.139 + }, + { + "category_id": 15, + "poly": [ + 583.0, + 194.0, + 721.0, + 194.0, + 721.0, + 219.0, + 583.0, + 219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 951.0, + 196.0, + 1155.0, + 196.0, + 1155.0, + 219.0, + 951.0, + 219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 251.0, + 488.0, + 251.0, + 488.0, + 262.0, + 472.0, + 262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 582.0, + 245.0, + 608.0, + 245.0, + 608.0, + 266.0, + 582.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 651.0, + 243.0, + 680.0, + 243.0, + 680.0, + 266.0, + 651.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 245.0, + 889.0, + 245.0, + 889.0, + 266.0, + 866.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 245.0, + 1075.0, + 245.0, + 1075.0, + 264.0, + 1049.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1143.0, + 248.0, + 1163.0, + 248.0, + 1163.0, + 264.0, + 1143.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 554.0, + 300.0, + 758.0, + 300.0, + 758.0, + 324.0, + 554.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 303.0, + 1213.0, + 303.0, + 1213.0, + 321.0, + 893.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 327.0, + 917.0, + 327.0, + 917.0, + 336.0, + 908.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 338.0, + 760.0, + 338.0, + 760.0, + 351.0, + 747.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 358.0, + 488.0, + 358.0, + 488.0, + 372.0, + 467.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 534.0, + 351.0, + 563.0, + 351.0, + 563.0, + 380.0, + 534.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 649.0, + 352.0, + 679.0, + 352.0, + 679.0, + 379.0, + 649.0, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 349.0, + 769.0, + 349.0, + 769.0, + 382.0, + 738.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 370.0, + 888.0, + 370.0, + 888.0, + 383.0, + 868.0, + 383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1208.0, + 364.0, + 1234.0, + 364.0, + 1234.0, + 386.0, + 1208.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 377.0, + 555.0, + 377.0, + 555.0, + 391.0, + 544.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 247.5, + 548.0, + 247.5, + 548.0, + 262.0, + 545.0, + 262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1213.0, + 248.0, + 1233.0, + 248.0, + 1233.0, + 262.5, + 1213.0, + 262.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 935.0, + 368.5, + 954.0, + 368.5, + 954.0, + 383.0, + 935.0, + 383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 366.5, + 1074.0, + 366.5, + 1074.0, + 391.0, + 1050.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1215.0, + 390.5, + 1230.0, + 390.5, + 1230.0, + 402.0, + 1215.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 1413.0, + 896.0, + 1413.0, + 896.0, + 1434.0, + 809.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 1452.0, + 689.0, + 1452.0, + 689.0, + 1461.0, + 681.0, + 1461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 720.0, + 1450.0, + 734.0, + 1450.0, + 734.0, + 1461.0, + 720.0, + 1461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 759.0, + 1450.0, + 773.0, + 1450.0, + 773.0, + 1462.0, + 759.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 801.0, + 1452.0, + 811.0, + 1452.0, + 811.0, + 1459.0, + 801.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 1452.0, + 851.0, + 1452.0, + 851.0, + 1460.0, + 840.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 883.0, + 1452.0, + 890.0, + 1452.0, + 890.0, + 1461.0, + 883.0, + 1461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 916.0, + 1450.0, + 936.0, + 1450.0, + 936.0, + 1465.0, + 916.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 958.0, + 1456.0, + 968.0, + 1456.0, + 968.0, + 1463.0, + 958.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 996.0, + 1449.0, + 1010.0, + 1449.0, + 1010.0, + 1462.0, + 996.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 1493.0, + 698.0, + 1493.0, + 698.0, + 1516.0, + 606.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1004.0, + 1494.0, + 1115.0, + 1494.0, + 1115.0, + 1513.0, + 1004.0, + 1513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 479.0, + 1532.0, + 492.0, + 1532.0, + 492.0, + 1543.0, + 479.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 518.0, + 1530.0, + 532.0, + 1530.0, + 532.0, + 1543.0, + 518.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1532.0, + 572.0, + 1532.0, + 572.0, + 1544.0, + 559.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 1532.0, + 610.0, + 1532.0, + 610.0, + 1541.0, + 600.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 642.0, + 1532.0, + 650.0, + 1532.0, + 650.0, + 1541.0, + 642.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 676.0, + 1530.0, + 694.0, + 1530.0, + 694.0, + 1545.0, + 676.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 1528.0, + 735.0, + 1528.0, + 735.0, + 1545.0, + 716.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 755.0, + 1535.0, + 771.0, + 1535.0, + 771.0, + 1546.0, + 755.0, + 1546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 792.0, + 1526.0, + 813.0, + 1526.0, + 813.0, + 1547.0, + 792.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 1531.0, + 899.0, + 1531.0, + 899.0, + 1542.0, + 886.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 1532.0, + 939.0, + 1532.0, + 939.0, + 1544.0, + 926.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 969.0, + 1537.0, + 978.0, + 1537.0, + 978.0, + 1544.0, + 969.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1004.0, + 1529.0, + 1023.0, + 1529.0, + 1023.0, + 1544.0, + 1004.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 1531.0, + 1056.0, + 1531.0, + 1056.0, + 1541.0, + 1048.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1087.0, + 1532.0, + 1100.0, + 1532.0, + 1100.0, + 1543.0, + 1087.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1205.0, + 1530.0, + 1216.0, + 1530.0, + 1216.0, + 1544.0, + 1205.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 1568.0, + 696.0, + 1568.0, + 696.0, + 1587.0, + 608.0, + 1587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1001.0, + 1569.0, + 1118.0, + 1569.0, + 1118.0, + 1585.0, + 1001.0, + 1585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 476.0, + 1603.0, + 494.0, + 1603.0, + 494.0, + 1619.0, + 476.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1605.0, + 572.0, + 1605.0, + 572.0, + 1617.0, + 559.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 1604.0, + 611.0, + 1604.0, + 611.0, + 1617.0, + 597.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 675.0, + 1603.0, + 695.0, + 1603.0, + 695.0, + 1619.0, + 675.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1602.0, + 735.0, + 1602.0, + 735.0, + 1619.0, + 717.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 1602.0, + 773.0, + 1602.0, + 773.0, + 1619.0, + 754.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 794.0, + 1603.0, + 812.0, + 1603.0, + 812.0, + 1619.0, + 794.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 1605.0, + 899.0, + 1605.0, + 899.0, + 1617.0, + 886.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 1603.0, + 941.0, + 1603.0, + 941.0, + 1618.0, + 924.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1606.0, + 1019.0, + 1606.0, + 1019.0, + 1615.0, + 1009.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 1603.0, + 1062.0, + 1603.0, + 1062.0, + 1618.0, + 1045.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 1603.0, + 1143.0, + 1603.0, + 1143.0, + 1619.0, + 1125.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1162.0, + 1605.0, + 1179.0, + 1605.0, + 1179.0, + 1617.0, + 1162.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1202.0, + 1604.0, + 1216.0, + 1604.0, + 1216.0, + 1617.0, + 1202.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 420.0, + 1405.0, + 420.0, + 1405.0, + 459.0, + 294.0, + 459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 452.0, + 1406.0, + 452.0, + 1406.0, + 489.0, + 294.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 484.0, + 1405.0, + 484.0, + 1405.0, + 517.0, + 295.0, + 517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 511.0, + 1408.0, + 511.0, + 1408.0, + 551.0, + 293.0, + 551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 542.0, + 1325.0, + 542.0, + 1325.0, + 580.0, + 294.0, + 580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1648.0, + 1404.0, + 1648.0, + 1404.0, + 1683.0, + 295.0, + 1683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1678.0, + 1405.0, + 1678.0, + 1405.0, + 1713.0, + 293.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1706.0, + 1406.0, + 1706.0, + 1406.0, + 1745.0, + 293.0, + 1745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1740.0, + 1406.0, + 1740.0, + 1406.0, + 1775.0, + 294.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1770.0, + 1406.0, + 1770.0, + 1406.0, + 1804.0, + 294.0, + 1804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1800.0, + 1404.0, + 1800.0, + 1404.0, + 1835.0, + 295.0, + 1835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1830.0, + 1402.0, + 1830.0, + 1402.0, + 1863.0, + 294.0, + 1863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2058.0, + 861.0, + 2058.0, + 861.0, + 2093.0, + 839.0, + 2093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 635.0, + 1068.0, + 635.0, + 1068.0, + 679.0, + 293.0, + 679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 635.0, + 1068.0, + 635.0, + 1068.0, + 679.0, + 293.0, + 679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 300.0, + 678.0, + 632.0, + 678.0, + 632.0, + 710.0, + 300.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 644.0, + 680.0, + 854.0, + 680.0, + 854.0, + 712.0, + 644.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1329.0, + 681.0, + 1363.0, + 681.0, + 1363.0, + 710.0, + 1329.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 707.0, + 337.0, + 707.0, + 337.0, + 741.0, + 293.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 739.0, + 967.0, + 739.0, + 967.0, + 773.0, + 336.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 769.0, + 1015.0, + 769.0, + 1015.0, + 801.0, + 337.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 800.0, + 653.0, + 800.0, + 653.0, + 835.0, + 293.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 841.0, + 326.0, + 841.0, + 326.0, + 857.0, + 305.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 386.0, + 839.0, + 464.0, + 839.0, + 464.0, + 863.0, + 386.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 489.0, + 836.0, + 903.0, + 836.0, + 903.0, + 864.0, + 489.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1331.0, + 839.0, + 1359.0, + 839.0, + 1359.0, + 863.0, + 1331.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 863.0, + 498.0, + 863.0, + 498.0, + 896.0, + 295.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 891.0, + 995.0, + 891.0, + 995.0, + 928.0, + 334.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 920.0, + 956.0, + 920.0, + 956.0, + 962.0, + 335.0, + 962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 953.0, + 1038.0, + 953.0, + 1038.0, + 990.0, + 328.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2058.0, + 862.0, + 2058.0, + 862.0, + 2092.0, + 838.0, + 2092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1092.0, + 1404.0, + 1092.0, + 1404.0, + 1128.0, + 294.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1118.0, + 1407.0, + 1118.0, + 1407.0, + 1162.0, + 291.0, + 1162.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1150.0, + 1407.0, + 1150.0, + 1407.0, + 1188.0, + 293.0, + 1188.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1182.0, + 1406.0, + 1182.0, + 1406.0, + 1218.0, + 294.0, + 1218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1210.0, + 1407.0, + 1210.0, + 1407.0, + 1252.0, + 293.0, + 1252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1243.0, + 1404.0, + 1243.0, + 1404.0, + 1279.0, + 294.0, + 1279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1274.0, + 1404.0, + 1274.0, + 1404.0, + 1309.0, + 293.0, + 1309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1304.0, + 1404.0, + 1304.0, + 1404.0, + 1340.0, + 294.0, + 1340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1331.0, + 617.0, + 1331.0, + 617.0, + 1373.0, + 294.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1913.0, + 1404.0, + 1913.0, + 1404.0, + 1950.0, + 294.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1945.0, + 1408.0, + 1945.0, + 1408.0, + 1979.0, + 294.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1973.0, + 1398.0, + 1973.0, + 1398.0, + 2010.0, + 295.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 300.0, + 678.0, + 632.0, + 678.0, + 632.0, + 710.0, + 300.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 644.0, + 680.0, + 854.0, + 680.0, + 854.0, + 712.0, + 644.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1329.0, + 681.0, + 1363.0, + 681.0, + 1363.0, + 710.0, + 1329.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 707.0, + 337.0, + 707.0, + 337.0, + 741.0, + 293.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 739.0, + 967.0, + 739.0, + 967.0, + 773.0, + 336.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 769.0, + 1015.0, + 769.0, + 1015.0, + 801.0, + 337.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 800.0, + 653.0, + 800.0, + 653.0, + 835.0, + 293.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 841.0, + 326.0, + 841.0, + 326.0, + 857.0, + 305.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 386.0, + 839.0, + 464.0, + 839.0, + 464.0, + 863.0, + 386.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 489.0, + 836.0, + 903.0, + 836.0, + 903.0, + 864.0, + 489.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1331.0, + 839.0, + 1359.0, + 839.0, + 1359.0, + 863.0, + 1331.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 863.0, + 498.0, + 863.0, + 498.0, + 896.0, + 295.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 891.0, + 995.0, + 891.0, + 995.0, + 928.0, + 334.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 920.0, + 956.0, + 920.0, + 956.0, + 962.0, + 335.0, + 962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 953.0, + 1038.0, + 953.0, + 1038.0, + 990.0, + 328.0, + 990.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1483, + 1406, + 1483, + 1406, + 1740, + 296, + 1740 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 257, + 1405, + 257, + 1405, + 446, + 297, + 446 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 1853, + 1405, + 1853, + 1405, + 2008, + 297, + 2008 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 665, + 1405, + 665, + 1405, + 860, + 297, + 860 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 961, + 1406, + 961, + 1406, + 1085, + 297, + 1085 + ], + "score": 0.975 + }, + { + "category_id": 3, + "poly": [ + 483, + 1136, + 1210, + 1136, + 1210, + 1344, + 483, + 1344 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 297, + 458, + 1406, + 458, + 1406, + 657, + 297, + 657 + ], + "score": 0.965 + }, + { + "category_id": 4, + "poly": [ + 301, + 1361, + 1401, + 1361, + 1401, + 1455, + 301, + 1455 + ], + "score": 0.953 + }, + { + "category_id": 8, + "poly": [ + 519, + 1773, + 1177, + 1773, + 1177, + 1835, + 519, + 1835 + ], + "score": 0.949 + }, + { + "category_id": 8, + "poly": [ + 491, + 868, + 1172, + 868, + 1172, + 954, + 491, + 954 + ], + "score": 0.947 + }, + { + "category_id": 0, + "poly": [ + 300, + 203, + 760, + 203, + 760, + 235, + 300, + 235 + ], + "score": 0.924 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1792, + 1400, + 1792, + 1400, + 1821, + 1366, + 1821 + ], + "score": 0.881 + }, + { + "category_id": 9, + "poly": [ + 1366, + 896, + 1400, + 896, + 1400, + 926, + 1366, + 926 + ], + "score": 0.876 + }, + { + "category_id": 2, + "poly": [ + 840, + 2062, + 859, + 2062, + 859, + 2085, + 840, + 2085 + ], + "score": 0.807 + }, + { + "category_id": 8, + "poly": [ + 299, + 619, + 1023, + 619, + 1023, + 655, + 299, + 655 + ], + "score": 0.382 + }, + { + "category_id": 13, + "poly": [ + 528, + 698, + 579, + 698, + 579, + 728, + 528, + 728 + ], + "score": 0.93, + "latex": "\\Delta \\theta _ { k }" + }, + { + "category_id": 13, + "poly": [ + 417, + 732, + 524, + 732, + 524, + 767, + 417, + 767 + ], + "score": 0.92, + "latex": "X _ { j } \\neq X _ { i }" + }, + { + "category_id": 14, + "poly": [ + 518, + 1772, + 1180, + 1772, + 1180, + 1838, + 518, + 1838 + ], + "score": 0.92, + "latex": "\\operatorname* { m i n } _ { X _ { i } } \\quad \\left\\| \\nabla _ { \\theta } \\hat { L } ( \\hat { X _ { j } } , \\theta _ { k } ) - \\nabla _ { \\theta } \\hat { L } ( X _ { i } , \\theta _ { k } ) \\right\\| ^ { p } ; \\quad \\mathrm { s . t . } \\quad X _ { i } \\in X ." + }, + { + "category_id": 13, + "poly": [ + 633, + 727, + 969, + 727, + 969, + 767, + 633, + 767 + ], + "score": 0.91, + "latex": "\\nabla _ { \\boldsymbol { \\theta } } \\hat { L } ( X _ { i } , { \\boldsymbol { \\theta } } _ { k } ) \\approx \\nabla _ { \\boldsymbol { \\theta } } \\hat { L } ( X _ { j } , { \\boldsymbol { \\theta } } _ { k } )" + }, + { + "category_id": 13, + "poly": [ + 578, + 1516, + 660, + 1516, + 660, + 1545, + 578, + 1545 + ], + "score": 0.91, + "latex": "B - V" + }, + { + "category_id": 14, + "poly": [ + 493, + 864, + 1176, + 864, + 1176, + 958, + 493, + 958 + ], + "score": 0.91, + "latex": "\\theta _ { k + 1 } = \\theta _ { k } + \\eta \\hat { \\Delta } \\theta _ { k } , \\mathrm { w h e r e \\ } \\left\\{ \\begin{array} { l l } { \\hat { \\Delta } \\theta _ { k } = - \\nabla _ { \\theta } \\hat { L } ( X _ { i } , \\theta _ { k } ) } \\\\ { \\nabla _ { \\theta } \\hat { L } ( X _ { i } , \\theta _ { k } ) \\approx \\nabla _ { \\theta } \\hat { L } ( \\hat { X } _ { k } , \\theta _ { k } ) . } \\end{array} \\right." + }, + { + "category_id": 13, + "poly": [ + 937, + 1701, + 974, + 1701, + 974, + 1741, + 937, + 1741 + ], + "score": 0.91, + "latex": "\\hat { X _ { j } }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1546, + 332, + 1546, + 332, + 1581, + 298, + 1581 + ], + "score": 0.9, + "latex": "{ \\hat { X } } _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1149, + 323, + 1226, + 323, + 1226, + 353, + 1149, + 353 + ], + "score": 0.9, + "latex": "X + \\delta" + }, + { + "category_id": 13, + "poly": [ + 1361, + 669, + 1400, + 669, + 1400, + 697, + 1361, + 697 + ], + "score": 0.88, + "latex": "X _ { k }" + }, + { + "category_id": 13, + "poly": [ + 547, + 322, + 574, + 322, + 574, + 351, + 547, + 351 + ], + "score": 0.87, + "latex": "\\hat { X }" + }, + { + "category_id": 13, + "poly": [ + 687, + 1581, + 740, + 1581, + 740, + 1610, + 687, + 1610 + ], + "score": 0.87, + "latex": "30 \\%" + }, + { + "category_id": 13, + "poly": [ + 547, + 792, + 576, + 792, + 576, + 825, + 547, + 825 + ], + "score": 0.86, + "latex": "\\hat { X }" + }, + { + "category_id": 13, + "poly": [ + 1368, + 582, + 1396, + 582, + 1396, + 614, + 1368, + 614 + ], + "score": 0.86, + "latex": "\\hat { X }" + }, + { + "category_id": 13, + "poly": [ + 1143, + 798, + 1170, + 798, + 1170, + 825, + 1143, + 825 + ], + "score": 0.83, + "latex": "X" + }, + { + "category_id": 13, + "poly": [ + 775, + 324, + 803, + 324, + 803, + 351, + 775, + 351 + ], + "score": 0.8, + "latex": "X" + }, + { + "category_id": 13, + "poly": [ + 602, + 1551, + 628, + 1551, + 628, + 1579, + 602, + 1579 + ], + "score": 0.75, + "latex": "V" + }, + { + "category_id": 13, + "poly": [ + 1015, + 1516, + 1042, + 1516, + 1042, + 1544, + 1015, + 1544 + ], + "score": 0.75, + "latex": "V" + }, + { + "category_id": 13, + "poly": [ + 297, + 620, + 516, + 620, + 516, + 655, + 297, + 655 + ], + "score": 0.61, + "latex": "\\theta _ { k + 1 } = \\theta _ { k } + \\eta \\Delta \\theta _ { k }" + }, + { + "category_id": 13, + "poly": [ + 297, + 615, + 1025, + 615, + 1025, + 656, + 297, + 656 + ], + "score": 0.51, + "latex": "\\theta _ { k + 1 } = \\theta _ { k } \\stackrel { \\smile \\sim } { + } \\eta \\bar { \\Delta } \\theta _ { k } ; \\quad \\Delta \\theta _ { k } = - ( \\nabla _ { \\theta } \\hat { L } ( X _ { k } , \\theta _ { k } ) + \\nabla _ { \\theta } \\hat { L } ( \\hat { X } _ { k } , \\theta _ { k } ) )" + }, + { + "category_id": 14, + "poly": [ + 291, + 615, + 1027, + 615, + 1027, + 656, + 291, + 656 + ], + "score": 0.48, + "latex": "\\theta _ { k + 1 } = \\theta _ { k } \\stackrel { \\smile \\sim } { + } \\eta \\bar { \\Delta } \\theta _ { k } ; \\quad \\Delta \\theta _ { k } = - \\big ( \\nabla _ { \\theta } \\hat { L } \\big ( X _ { k } , \\theta _ { k } \\big ) + \\nabla _ { \\theta } \\hat { L } \\big ( \\hat { X } _ { k } , \\theta _ { k } \\big ) \\big ) ." + }, + { + "category_id": 15, + "poly": [ + 530.0, + 1310.0, + 777.0, + 1310.0, + 777.0, + 1346.0, + 530.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 1311.0, + 1182.0, + 1311.0, + 1182.0, + 1346.0, + 909.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1359.0, + 1406.0, + 1359.0, + 1406.0, + 1398.0, + 294.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1389.0, + 1405.0, + 1389.0, + 1405.0, + 1430.0, + 292.0, + 1430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1423.0, + 1397.0, + 1423.0, + 1397.0, + 1459.0, + 295.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 203.0, + 764.0, + 203.0, + 764.0, + 239.0, + 296.0, + 239.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2060.0, + 862.0, + 2060.0, + 862.0, + 2091.0, + 840.0, + 2091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1486.0, + 1404.0, + 1486.0, + 1404.0, + 1517.0, + 296.0, + 1517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1515.0, + 577.0, + 1515.0, + 577.0, + 1550.0, + 294.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 1515.0, + 1014.0, + 1515.0, + 1014.0, + 1550.0, + 661.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 1515.0, + 1406.0, + 1515.0, + 1406.0, + 1550.0, + 1043.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1546.0, + 297.0, + 1546.0, + 297.0, + 1587.0, + 294.0, + 1587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1546.0, + 601.0, + 1546.0, + 601.0, + 1587.0, + 333.0, + 1587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 629.0, + 1546.0, + 1406.0, + 1546.0, + 1406.0, + 1587.0, + 629.0, + 1587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1581.0, + 686.0, + 1581.0, + 686.0, + 1615.0, + 294.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 741.0, + 1581.0, + 1407.0, + 1581.0, + 1407.0, + 1615.0, + 741.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1610.0, + 1404.0, + 1610.0, + 1404.0, + 1645.0, + 294.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1642.0, + 1404.0, + 1642.0, + 1404.0, + 1673.0, + 295.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1671.0, + 1406.0, + 1671.0, + 1406.0, + 1706.0, + 294.0, + 1706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1704.0, + 936.0, + 1704.0, + 936.0, + 1743.0, + 294.0, + 1743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 1704.0, + 986.0, + 1704.0, + 986.0, + 1743.0, + 975.0, + 1743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 256.0, + 1405.0, + 256.0, + 1405.0, + 293.0, + 294.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 284.0, + 1403.0, + 284.0, + 1403.0, + 326.0, + 294.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 319.0, + 546.0, + 319.0, + 546.0, + 362.0, + 292.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 319.0, + 774.0, + 319.0, + 774.0, + 362.0, + 575.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 319.0, + 1148.0, + 319.0, + 1148.0, + 362.0, + 804.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1227.0, + 319.0, + 1405.0, + 319.0, + 1405.0, + 362.0, + 1227.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 353.0, + 1403.0, + 353.0, + 1403.0, + 392.0, + 294.0, + 392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 386.0, + 1405.0, + 386.0, + 1405.0, + 419.0, + 296.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 415.0, + 840.0, + 415.0, + 840.0, + 447.0, + 295.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1855.0, + 1403.0, + 1855.0, + 1403.0, + 1888.0, + 296.0, + 1888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1885.0, + 1405.0, + 1885.0, + 1405.0, + 1919.0, + 295.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1913.0, + 1408.0, + 1913.0, + 1408.0, + 1949.0, + 294.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1944.0, + 1406.0, + 1944.0, + 1406.0, + 1980.0, + 294.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1973.0, + 1216.0, + 1973.0, + 1216.0, + 2012.0, + 292.0, + 2012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 664.0, + 1360.0, + 664.0, + 1360.0, + 701.0, + 296.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 698.0, + 527.0, + 698.0, + 527.0, + 731.0, + 296.0, + 731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 580.0, + 698.0, + 1405.0, + 698.0, + 1405.0, + 731.0, + 580.0, + 731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 731.0, + 416.0, + 731.0, + 416.0, + 768.0, + 295.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 525.0, + 731.0, + 632.0, + 731.0, + 632.0, + 768.0, + 525.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 970.0, + 731.0, + 1405.0, + 731.0, + 1405.0, + 768.0, + 970.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 764.0, + 1403.0, + 764.0, + 1403.0, + 797.0, + 296.0, + 797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 791.0, + 546.0, + 791.0, + 546.0, + 838.0, + 292.0, + 838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 791.0, + 1142.0, + 791.0, + 1142.0, + 838.0, + 577.0, + 838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 791.0, + 1405.0, + 791.0, + 1405.0, + 838.0, + 1171.0, + 838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 824.0, + 959.0, + 824.0, + 959.0, + 865.0, + 294.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 956.0, + 1407.0, + 956.0, + 1407.0, + 1001.0, + 291.0, + 1001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 994.0, + 1404.0, + 994.0, + 1404.0, + 1027.0, + 295.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1024.0, + 1406.0, + 1024.0, + 1406.0, + 1057.0, + 295.0, + 1057.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1055.0, + 1126.0, + 1055.0, + 1126.0, + 1087.0, + 296.0, + 1087.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 459.0, + 1406.0, + 459.0, + 1406.0, + 496.0, + 295.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 487.0, + 1408.0, + 487.0, + 1408.0, + 527.0, + 292.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 519.0, + 1406.0, + 519.0, + 1406.0, + 556.0, + 294.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 549.0, + 1406.0, + 549.0, + 1406.0, + 587.0, + 294.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 583.0, + 1367.0, + 583.0, + 1367.0, + 622.0, + 292.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1397.0, + 583.0, + 1409.0, + 583.0, + 1409.0, + 622.0, + 1397.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1028.0, + 618.0, + 1037.0, + 618.0, + 1037.0, + 659.0, + 1028.0, + 659.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1409, + 1406, + 1409, + 1406, + 1715, + 297, + 1715 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 331, + 1405, + 331, + 1405, + 576, + 297, + 576 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 300, + 1729, + 1405, + 1729, + 1405, + 1821, + 300, + 1821 + ], + "score": 0.968 + }, + { + "category_id": 0, + "poly": [ + 299, + 272, + 594, + 272, + 594, + 305, + 299, + 305 + ], + "score": 0.916 + }, + { + "category_id": 1, + "poly": [ + 299, + 1835, + 535, + 1835, + 535, + 1866, + 299, + 1866 + ], + "score": 0.905 + }, + { + "category_id": 0, + "poly": [ + 298, + 198, + 505, + 198, + 505, + 236, + 298, + 236 + ], + "score": 0.896 + }, + { + "category_id": 1, + "poly": [ + 297, + 1062, + 1405, + 1062, + 1405, + 1367, + 297, + 1367 + ], + "score": 0.875 + }, + { + "category_id": 1, + "poly": [ + 371, + 1895, + 1403, + 1895, + 1403, + 2008, + 371, + 2008 + ], + "score": 0.865 + }, + { + "category_id": 2, + "poly": [ + 842, + 2061, + 858, + 2061, + 858, + 2084, + 842, + 2084 + ], + "score": 0.674 + }, + { + "category_id": 6, + "poly": [ + 300, + 619, + 1122, + 619, + 1122, + 654, + 300, + 654 + ], + "score": 0.665 + }, + { + "category_id": 0, + "poly": [ + 300, + 619, + 1122, + 619, + 1122, + 654, + 300, + 654 + ], + "score": 0.272 + }, + { + "category_id": 2, + "poly": [ + 841, + 2061, + 859, + 2061, + 859, + 2084, + 841, + 2084 + ], + "score": 0.205 + }, + { + "category_id": 13, + "poly": [ + 345, + 1124, + 519, + 1124, + 519, + 1156, + 345, + 1156 + ], + "score": 0.9, + "latex": "\\beta = ( 0 . 9 9 , 0 . 9 )" + }, + { + "category_id": 13, + "poly": [ + 963, + 1441, + 1018, + 1441, + 1018, + 1472, + 963, + 1472 + ], + "score": 0.88, + "latex": "1 5 \\%" + }, + { + "category_id": 5, + "poly": [ + 322, + 703, + 1379, + 703, + 1379, + 1049, + 322, + 1049 + ], + "score": 0.97, + "html": "
CIFAR-10CIFAR-100AGNews
AttackTrain accTest acc△Train accTest acc△Train accTest acc△
Baseline
None95.5190.51-0.0%99.9675.56-0.0%93.1390.87-0.0%
Batch reshuffle
Oscillation outward17.4426.13-64.38%99.8018.00-57.56%97.7265.85-25.02%
Oscillation inward22.8528.94-61.57%99.9231.38-44.18%94.0689.23-1.64%
High Low23.3931.04-59.47%99.6921.15−54.41%94.3856.54-34.33%
Low High20.2230.09-60.42%96.0720.48-55.08%98.9459.28-31.59%
Batch reorder
Oscillation outward99.3778.65-11.86%100.0053.05-22.51%95.3790.92+0.05%
Oscillation inward99.6078.18-12.33%100.0051.78-23.78%96.2991.10+0.93%
High Low99.4479.65-10.86%100.0051.48-24.08%96.1691.80+0.05%
Low High99.5879.07−11.43%100.0054.04-21.52%94.0290.35-0.52%
" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 264.0, + 599.0, + 264.0, + 599.0, + 314.0, + 293.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 197.0, + 509.0, + 197.0, + 509.0, + 242.0, + 293.0, + 242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2059.0, + 860.0, + 2059.0, + 860.0, + 2092.0, + 840.0, + 2092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 619.0, + 1125.0, + 619.0, + 1125.0, + 659.0, + 295.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 619.0, + 1125.0, + 619.0, + 1125.0, + 659.0, + 295.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2059.0, + 860.0, + 2059.0, + 860.0, + 2092.0, + 840.0, + 2092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1407.0, + 1404.0, + 1407.0, + 1404.0, + 1447.0, + 292.0, + 1447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1440.0, + 962.0, + 1440.0, + 962.0, + 1477.0, + 294.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1019.0, + 1440.0, + 1406.0, + 1440.0, + 1406.0, + 1477.0, + 1019.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1468.0, + 1407.0, + 1468.0, + 1407.0, + 1510.0, + 292.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1501.0, + 1408.0, + 1501.0, + 1408.0, + 1537.0, + 295.0, + 1537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1532.0, + 1407.0, + 1532.0, + 1407.0, + 1566.0, + 294.0, + 1566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1558.0, + 1407.0, + 1558.0, + 1407.0, + 1601.0, + 292.0, + 1601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1591.0, + 1408.0, + 1591.0, + 1408.0, + 1628.0, + 294.0, + 1628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1624.0, + 1406.0, + 1624.0, + 1406.0, + 1656.0, + 296.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1653.0, + 1407.0, + 1653.0, + 1407.0, + 1689.0, + 295.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1684.0, + 591.0, + 1684.0, + 591.0, + 1716.0, + 295.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 330.0, + 1405.0, + 330.0, + 1405.0, + 367.0, + 294.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 361.0, + 1403.0, + 361.0, + 1403.0, + 395.0, + 295.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 391.0, + 1405.0, + 391.0, + 1405.0, + 427.0, + 294.0, + 427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 420.0, + 1405.0, + 420.0, + 1405.0, + 460.0, + 294.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 455.0, + 1405.0, + 455.0, + 1405.0, + 488.0, + 295.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 481.0, + 1406.0, + 481.0, + 1406.0, + 521.0, + 292.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 513.0, + 1406.0, + 513.0, + 1406.0, + 551.0, + 292.0, + 551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 546.0, + 954.0, + 546.0, + 954.0, + 579.0, + 295.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1728.0, + 1406.0, + 1728.0, + 1406.0, + 1765.0, + 295.0, + 1765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1759.0, + 1406.0, + 1759.0, + 1406.0, + 1795.0, + 294.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1791.0, + 1323.0, + 1791.0, + 1323.0, + 1824.0, + 296.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1833.0, + 540.0, + 1833.0, + 540.0, + 1869.0, + 296.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1060.0, + 1405.0, + 1060.0, + 1405.0, + 1099.0, + 292.0, + 1099.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1092.0, + 1406.0, + 1092.0, + 1406.0, + 1128.0, + 292.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1121.0, + 344.0, + 1121.0, + 344.0, + 1158.0, + 292.0, + 1158.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 520.0, + 1121.0, + 1406.0, + 1121.0, + 1406.0, + 1158.0, + 520.0, + 1158.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1152.0, + 1405.0, + 1152.0, + 1405.0, + 1187.0, + 294.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1184.0, + 1406.0, + 1184.0, + 1406.0, + 1220.0, + 294.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1212.0, + 1405.0, + 1212.0, + 1405.0, + 1250.0, + 294.0, + 1250.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1242.0, + 1408.0, + 1242.0, + 1408.0, + 1280.0, + 294.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1273.0, + 1408.0, + 1273.0, + 1408.0, + 1312.0, + 294.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1302.0, + 1407.0, + 1302.0, + 1407.0, + 1342.0, + 292.0, + 1342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1333.0, + 1318.0, + 1333.0, + 1318.0, + 1371.0, + 292.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 1895.0, + 1405.0, + 1895.0, + 1405.0, + 1929.0, + 371.0, + 1929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1924.0, + 744.0, + 1924.0, + 744.0, + 1959.0, + 393.0, + 1959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 1970.0, + 1320.0, + 1970.0, + 1320.0, + 2013.0, + 368.0, + 2013.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1440, + 1406, + 1440, + 1406, + 1687, + 296, + 1687 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 876, + 1405, + 876, + 1405, + 1121, + 297, + 1121 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 679, + 1404, + 679, + 1404, + 863, + 297, + 863 + ], + "score": 0.977 + }, + { + "category_id": 3, + "poly": [ + 365, + 273, + 1336, + 273, + 1336, + 558, + 365, + 558 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 1135, + 1400, + 1135, + 1400, + 1229, + 299, + 1229 + ], + "score": 0.958 + }, + { + "category_id": 1, + "poly": [ + 371, + 1249, + 1404, + 1249, + 1404, + 1352, + 371, + 1352 + ], + "score": 0.957 + }, + { + "category_id": 3, + "poly": [ + 481, + 1738, + 1211, + 1738, + 1211, + 1866, + 481, + 1866 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 295, + 1944, + 1406, + 1944, + 1406, + 2008, + 295, + 2008 + ], + "score": 0.94 + }, + { + "category_id": 4, + "poly": [ + 300, + 585, + 1401, + 585, + 1401, + 648, + 300, + 648 + ], + "score": 0.931 + }, + { + "category_id": 0, + "poly": [ + 301, + 1386, + 776, + 1386, + 776, + 1418, + 301, + 1418 + ], + "score": 0.92 + }, + { + "category_id": 4, + "poly": [ + 295, + 1881, + 1400, + 1881, + 1400, + 1915, + 295, + 1915 + ], + "score": 0.887 + }, + { + "category_id": 2, + "poly": [ + 840, + 2062, + 858, + 2062, + 858, + 2085, + 840, + 2085 + ], + "score": 0.803 + }, + { + "category_id": 2, + "poly": [ + 298, + 204, + 591, + 204, + 591, + 234, + 298, + 234 + ], + "score": 0.55 + }, + { + "category_id": 0, + "poly": [ + 298, + 204, + 591, + 204, + 591, + 234, + 298, + 234 + ], + "score": 0.405 + }, + { + "category_id": 13, + "poly": [ + 1197, + 1882, + 1251, + 1882, + 1251, + 1911, + 1197, + 1911 + ], + "score": 0.84, + "latex": "30 \\%" + }, + { + "category_id": 13, + "poly": [ + 1329, + 1059, + 1402, + 1059, + 1402, + 1090, + 1329, + 1090 + ], + "score": 0.62, + "latex": "- 3 \\%" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 280.0, + 659.0, + 280.0, + 659.0, + 307.0, + 605.0, + 307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 767.0, + 272.0, + 934.0, + 272.0, + 934.0, + 300.0, + 767.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1096.0, + 280.0, + 1144.0, + 280.0, + 1144.0, + 307.0, + 1096.0, + 307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 296.0, + 419.0, + 296.0, + 419.0, + 320.0, + 384.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 296.0, + 906.0, + 296.0, + 906.0, + 321.0, + 871.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 337.0, + 418.0, + 337.0, + 418.0, + 361.0, + 384.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 339.0, + 904.0, + 339.0, + 904.0, + 360.0, + 873.0, + 360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 349.0, + 418.0, + 349.0, + 418.0, + 470.0, + 364.0, + 470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 372.0, + 711.0, + 372.0, + 711.0, + 398.0, + 529.0, + 398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 852.0, + 348.0, + 906.0, + 348.0, + 906.0, + 470.0, + 852.0, + 470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 406.0, + 1274.0, + 406.0, + 1274.0, + 424.0, + 1223.0, + 424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 417.0, + 419.0, + 417.0, + 419.0, + 445.0, + 382.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 419.0, + 904.0, + 419.0, + 904.0, + 443.0, + 871.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 418.0, + 1276.0, + 418.0, + 1276.0, + 441.0, + 1223.0, + 441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 433.0, + 1274.0, + 433.0, + 1274.0, + 452.0, + 1223.0, + 452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 446.0, + 1316.0, + 446.0, + 1316.0, + 467.0, + 1223.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 458.0, + 417.0, + 458.0, + 417.0, + 483.0, + 384.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 459.0, + 905.0, + 459.0, + 905.0, + 483.0, + 871.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1222.0, + 460.0, + 1329.0, + 460.0, + 1329.0, + 481.0, + 1222.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 475.0, + 1298.0, + 475.0, + 1298.0, + 495.0, + 1223.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 488.0, + 1303.0, + 488.0, + 1303.0, + 510.0, + 1223.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 499.0, + 418.0, + 499.0, + 418.0, + 524.0, + 383.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 500.0, + 906.0, + 500.0, + 906.0, + 525.0, + 871.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.0, + 517.0, + 449.0, + 517.0, + 449.0, + 537.0, + 431.0, + 537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 502.0, + 514.0, + 533.0, + 514.0, + 533.0, + 540.0, + 502.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 581.0, + 515.0, + 610.0, + 515.0, + 610.0, + 540.0, + 581.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 514.0, + 688.0, + 514.0, + 688.0, + 540.0, + 657.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 515.0, + 766.0, + 515.0, + 766.0, + 540.0, + 734.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 808.0, + 514.0, + 848.0, + 514.0, + 848.0, + 541.0, + 808.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 517.0, + 936.0, + 517.0, + 936.0, + 538.0, + 919.0, + 538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 515.0, + 1020.0, + 515.0, + 1020.0, + 540.0, + 990.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 514.0, + 1098.0, + 514.0, + 1098.0, + 540.0, + 1067.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1145.0, + 514.0, + 1176.0, + 514.0, + 1176.0, + 540.0, + 1145.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1222.0, + 514.0, + 1253.0, + 514.0, + 1253.0, + 540.0, + 1222.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1296.0, + 515.0, + 1335.0, + 515.0, + 1335.0, + 539.0, + 1296.0, + 539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 535.0, + 663.0, + 535.0, + 663.0, + 560.0, + 601.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1088.0, + 534.0, + 1150.0, + 534.0, + 1150.0, + 557.0, + 1088.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 418.0, + 1135.0, + 418.0, + 1135.0, + 451.0, + 992.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 1751.0, + 1173.0, + 1751.0, + 1173.0, + 1787.0, + 879.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 1804.0, + 1166.0, + 1804.0, + 1166.0, + 1818.0, + 1133.0, + 1818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 550.0, + 1830.0, + 757.0, + 1830.0, + 757.0, + 1869.0, + 550.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 1830.0, + 1169.0, + 1830.0, + 1169.0, + 1866.0, + 924.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 582.0, + 1405.0, + 582.0, + 1405.0, + 623.0, + 294.0, + 623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 614.0, + 792.0, + 614.0, + 792.0, + 650.0, + 296.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1381.0, + 777.0, + 1381.0, + 777.0, + 1424.0, + 294.0, + 1424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1874.0, + 1196.0, + 1874.0, + 1196.0, + 1923.0, + 293.0, + 1923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 1874.0, + 1405.0, + 1874.0, + 1405.0, + 1923.0, + 1252.0, + 1923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2058.0, + 862.0, + 2058.0, + 862.0, + 2090.0, + 838.0, + 2090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 198.0, + 593.0, + 198.0, + 593.0, + 241.0, + 294.0, + 241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 198.0, + 593.0, + 198.0, + 593.0, + 241.0, + 294.0, + 241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1439.0, + 1404.0, + 1439.0, + 1404.0, + 1476.0, + 294.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1473.0, + 1406.0, + 1473.0, + 1406.0, + 1507.0, + 294.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1502.0, + 1404.0, + 1502.0, + 1404.0, + 1536.0, + 294.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1531.0, + 1406.0, + 1531.0, + 1406.0, + 1567.0, + 293.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1562.0, + 1406.0, + 1562.0, + 1406.0, + 1598.0, + 294.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1592.0, + 1406.0, + 1592.0, + 1406.0, + 1629.0, + 291.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1621.0, + 1406.0, + 1621.0, + 1406.0, + 1661.0, + 291.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1655.0, + 1145.0, + 1655.0, + 1145.0, + 1689.0, + 296.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 874.0, + 1403.0, + 874.0, + 1403.0, + 913.0, + 294.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 909.0, + 1405.0, + 909.0, + 1405.0, + 942.0, + 295.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 937.0, + 1405.0, + 937.0, + 1405.0, + 972.0, + 294.0, + 972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 966.0, + 1406.0, + 966.0, + 1406.0, + 1005.0, + 292.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1000.0, + 1405.0, + 1000.0, + 1405.0, + 1033.0, + 295.0, + 1033.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1028.0, + 1402.0, + 1028.0, + 1402.0, + 1062.0, + 295.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1057.0, + 1328.0, + 1057.0, + 1328.0, + 1094.0, + 291.0, + 1094.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 1057.0, + 1406.0, + 1057.0, + 1406.0, + 1094.0, + 1403.0, + 1094.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1091.0, + 598.0, + 1091.0, + 598.0, + 1123.0, + 293.0, + 1123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 681.0, + 1404.0, + 681.0, + 1404.0, + 713.0, + 296.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 713.0, + 1404.0, + 713.0, + 1404.0, + 744.0, + 296.0, + 744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 737.0, + 1405.0, + 737.0, + 1405.0, + 781.0, + 292.0, + 781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 771.0, + 1406.0, + 771.0, + 1406.0, + 808.0, + 292.0, + 808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 804.0, + 1404.0, + 804.0, + 1404.0, + 836.0, + 295.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 833.0, + 653.0, + 833.0, + 653.0, + 865.0, + 296.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1132.0, + 1404.0, + 1132.0, + 1404.0, + 1172.0, + 293.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1166.0, + 1404.0, + 1166.0, + 1404.0, + 1200.0, + 295.0, + 1200.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1198.0, + 1169.0, + 1198.0, + 1169.0, + 1232.0, + 295.0, + 1232.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 1245.0, + 1407.0, + 1245.0, + 1407.0, + 1287.0, + 368.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1278.0, + 673.0, + 1278.0, + 673.0, + 1317.0, + 392.0, + 1317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 1317.0, + 1356.0, + 1317.0, + 1356.0, + 1356.0, + 371.0, + 1356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1940.0, + 1409.0, + 1940.0, + 1409.0, + 1984.0, + 293.0, + 1984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1975.0, + 1406.0, + 1975.0, + 1406.0, + 2011.0, + 295.0, + 2011.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 359, + 448, + 1344, + 448, + 1344, + 1013, + 359, + 1013 + ], + "score": 0.986, + "html": "
TriggerBatch sizeTrain acc [%]Test acc [%]Trigger acc [%]Error with trigger [%]
Baselines
Random natural data3288.43 ± 7.2679.60 ± 1.4910.91 ± 1.5330.70 ± 2.26
6495.93 ± 2.1181.31 ± 2.019.78 ± 1.2527.38 ± 1.20
12894.92 ± 2.0481.69 ± 1.1710.00 ± 2.2627.91 ± 1.41
Data with trigger perturbation3296.87± 2.7973.28±2.9399.65±0.2289.68 ±0.21
6498.12 ± 1.5379.45 ± 1.3999.64±0.2189.64± 0.21
12898.67±0.9980.51 ± 1.1099.67 ± 0.4089.65 ±0.39
Only reordered natural data
9 white lines trigger3288.43±6.0978.02 ±1.5033.93 ± 7.3740.78 ± 5.70
64 12895.15 ± 2.6582.75±0.8625.02 ±3.7833.91 ± 2.28
95.23± 2.2482.90 ± 1.5021.75 ± 4.4931.75 ± 3.68
Blackbox 9 white lines trigger3288.43 ± 4.8580.84±1.2017.55 ± 3.7133.64 ± 2.83
6493.59 ± 3.1582.64 ± 1.6416.59 ± 4.8030.90±3.08
12894.84± 2.2481.12 ± 2.4916.19 ± 4.0131.33 ±3.73
Flag-like trigger3290.93 ± 3.8178.46 ± 1.0491.03 ± 12.9687.08 ± 2.71
6496.87 ± 1.2182.95±0.7277.10 ± 16.9682.92 ±3.89
12895.54 ± 1.8882.28 ± 1.5069.49 ± 20.6682.09 ±3.78
Blackbox flag-like trigger3286.25 ± 4.0080.16 ± 1.9156.31 ± 19.5778.78± 3.51
6495.00 ± 2.1883.41± 0.9448.75± 23.2878.11 ± 4.40
12893.82 ± 2.2781.54 ± 1.9468.07 ± 18.5581.23 ± 3.80
" + }, + { + "category_id": 1, + "poly": [ + 297, + 1251, + 1404, + 1251, + 1404, + 1497, + 297, + 1497 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 299, + 1509, + 1404, + 1509, + 1404, + 1694, + 299, + 1694 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 202, + 1405, + 202, + 1405, + 386, + 298, + 386 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 299, + 1707, + 534, + 1707, + 534, + 1738, + 299, + 1738 + ], + "score": 0.907 + }, + { + "category_id": 2, + "poly": [ + 840, + 2062, + 858, + 2062, + 858, + 2084, + 840, + 2084 + ], + "score": 0.781 + }, + { + "category_id": 1, + "poly": [ + 373, + 1780, + 1401, + 1780, + 1401, + 1842, + 373, + 1842 + ], + "score": 0.633 + }, + { + "category_id": 1, + "poly": [ + 298, + 1015, + 1406, + 1015, + 1406, + 1165, + 298, + 1165 + ], + "score": 0.62 + }, + { + "category_id": 1, + "poly": [ + 374, + 1882, + 1402, + 1882, + 1402, + 2007, + 374, + 2007 + ], + "score": 0.585 + }, + { + "category_id": 7, + "poly": [ + 298, + 1015, + 1406, + 1015, + 1406, + 1165, + 298, + 1165 + ], + "score": 0.524 + }, + { + "category_id": 13, + "poly": [ + 663, + 326, + 731, + 326, + 731, + 357, + 663, + 357 + ], + "score": 0.9, + "latex": "p = 2" + }, + { + "category_id": 13, + "poly": [ + 603, + 1632, + 698, + 1632, + 698, + 1661, + 603, + 1661 + ], + "score": 0.88, + "latex": "2 0 { - } 4 0 \\%" + }, + { + "category_id": 13, + "poly": [ + 909, + 1571, + 965, + 1571, + 965, + 1600, + 909, + 1600 + ], + "score": 0.87, + "latex": "30 \\%" + }, + { + "category_id": 13, + "poly": [ + 344, + 1662, + 399, + 1662, + 399, + 1691, + 344, + 1691 + ], + "score": 0.85, + "latex": "20 \\%" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2060.0, + 860.0, + 2060.0, + 860.0, + 2090.0, + 839.0, + 2090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1009.0, + 1406.0, + 1009.0, + 1406.0, + 1048.0, + 293.0, + 1048.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1039.0, + 1406.0, + 1039.0, + 1406.0, + 1080.0, + 293.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1072.0, + 1406.0, + 1072.0, + 1406.0, + 1108.0, + 295.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1100.0, + 1407.0, + 1100.0, + 1407.0, + 1138.0, + 293.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1132.0, + 1057.0, + 1132.0, + 1057.0, + 1169.0, + 293.0, + 1169.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1249.0, + 1406.0, + 1249.0, + 1406.0, + 1288.0, + 291.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1280.0, + 1406.0, + 1280.0, + 1406.0, + 1321.0, + 292.0, + 1321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1312.0, + 1404.0, + 1312.0, + 1404.0, + 1346.0, + 295.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1343.0, + 1404.0, + 1343.0, + 1404.0, + 1378.0, + 294.0, + 1378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1374.0, + 1406.0, + 1374.0, + 1406.0, + 1408.0, + 295.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1403.0, + 1406.0, + 1403.0, + 1406.0, + 1439.0, + 294.0, + 1439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1435.0, + 1405.0, + 1435.0, + 1405.0, + 1469.0, + 294.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1465.0, + 1081.0, + 1465.0, + 1081.0, + 1499.0, + 295.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1509.0, + 1406.0, + 1509.0, + 1406.0, + 1544.0, + 294.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1540.0, + 1408.0, + 1540.0, + 1408.0, + 1575.0, + 293.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1566.0, + 908.0, + 1566.0, + 908.0, + 1609.0, + 292.0, + 1609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 966.0, + 1566.0, + 1408.0, + 1566.0, + 1408.0, + 1609.0, + 966.0, + 1609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1600.0, + 1406.0, + 1600.0, + 1406.0, + 1636.0, + 294.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1632.0, + 602.0, + 1632.0, + 602.0, + 1664.0, + 295.0, + 1664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 1632.0, + 1404.0, + 1632.0, + 1404.0, + 1664.0, + 699.0, + 1664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1661.0, + 343.0, + 1661.0, + 343.0, + 1697.0, + 294.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 400.0, + 1661.0, + 1364.0, + 1661.0, + 1364.0, + 1697.0, + 400.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 204.0, + 1405.0, + 204.0, + 1405.0, + 236.0, + 296.0, + 236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 234.0, + 1403.0, + 234.0, + 1403.0, + 266.0, + 296.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 261.0, + 1410.0, + 261.0, + 1410.0, + 300.0, + 292.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 293.0, + 1406.0, + 293.0, + 1406.0, + 330.0, + 292.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 326.0, + 662.0, + 326.0, + 662.0, + 357.0, + 295.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 732.0, + 326.0, + 1405.0, + 326.0, + 1405.0, + 357.0, + 732.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 356.0, + 473.0, + 356.0, + 473.0, + 389.0, + 295.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1705.0, + 539.0, + 1705.0, + 539.0, + 1741.0, + 296.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 1777.0, + 1403.0, + 1777.0, + 1403.0, + 1815.0, + 370.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1808.0, + 1398.0, + 1808.0, + 1398.0, + 1846.0, + 394.0, + 1846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1009.0, + 1406.0, + 1009.0, + 1406.0, + 1048.0, + 293.0, + 1048.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1039.0, + 1406.0, + 1039.0, + 1406.0, + 1080.0, + 293.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1072.0, + 1406.0, + 1072.0, + 1406.0, + 1108.0, + 295.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1100.0, + 1407.0, + 1100.0, + 1407.0, + 1138.0, + 293.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1132.0, + 1057.0, + 1132.0, + 1057.0, + 1169.0, + 293.0, + 1169.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 373.0, + 1885.0, + 1404.0, + 1885.0, + 1404.0, + 1918.0, + 373.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1915.0, + 1407.0, + 1915.0, + 1407.0, + 1948.0, + 394.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1947.0, + 1405.0, + 1947.0, + 1405.0, + 1980.0, + 394.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1976.0, + 808.0, + 1976.0, + 808.0, + 2009.0, + 394.0, + 2009.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 268, + 1404, + 268, + 1404, + 481, + 298, + 481 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 662, + 1403, + 662, + 1403, + 845, + 298, + 845 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 495, + 1404, + 495, + 1404, + 647, + 298, + 647 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 958, + 1405, + 958, + 1405, + 1081, + 299, + 1081 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 306, + 1179, + 1410, + 1179, + 1410, + 2007, + 306, + 2007 + ], + "score": 0.963 + }, + { + "category_id": 0, + "poly": [ + 301, + 889, + 575, + 889, + 575, + 925, + 301, + 925 + ], + "score": 0.909 + }, + { + "category_id": 0, + "poly": [ + 299, + 1126, + 455, + 1126, + 455, + 1161, + 299, + 1161 + ], + "score": 0.903 + }, + { + "category_id": 0, + "poly": [ + 298, + 198, + 509, + 198, + 509, + 236, + 298, + 236 + ], + "score": 0.899 + }, + { + "category_id": 2, + "poly": [ + 836, + 2061, + 865, + 2061, + 865, + 2086, + 836, + 2086 + ], + "score": 0.789 + }, + { + "category_id": 2, + "poly": [ + 836, + 2061, + 866, + 2061, + 866, + 2086, + 836, + 2086 + ], + "score": 0.149 + }, + { + "category_id": 15, + "poly": [ + 295.0, + 885.0, + 579.0, + 885.0, + 579.0, + 934.0, + 295.0, + 934.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1122.0, + 460.0, + 1122.0, + 460.0, + 1167.0, + 295.0, + 1167.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 192.0, + 514.0, + 192.0, + 514.0, + 243.0, + 289.0, + 243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2057.0, + 871.0, + 2057.0, + 871.0, + 2096.0, + 832.0, + 2096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2058.0, + 870.0, + 2058.0, + 870.0, + 2096.0, + 832.0, + 2096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 267.0, + 1404.0, + 267.0, + 1404.0, + 305.0, + 294.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 299.0, + 1406.0, + 299.0, + 1406.0, + 333.0, + 294.0, + 333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 328.0, + 1405.0, + 328.0, + 1405.0, + 362.0, + 293.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 359.0, + 1405.0, + 359.0, + 1405.0, + 393.0, + 294.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 388.0, + 1405.0, + 388.0, + 1405.0, + 426.0, + 293.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 419.0, + 1406.0, + 419.0, + 1406.0, + 456.0, + 293.0, + 456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 450.0, + 1385.0, + 450.0, + 1385.0, + 485.0, + 294.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 661.0, + 1405.0, + 661.0, + 1405.0, + 695.0, + 293.0, + 695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 692.0, + 1405.0, + 692.0, + 1405.0, + 727.0, + 294.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 722.0, + 1405.0, + 722.0, + 1405.0, + 756.0, + 293.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 755.0, + 1405.0, + 755.0, + 1405.0, + 786.0, + 296.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 783.0, + 1406.0, + 783.0, + 1406.0, + 819.0, + 292.0, + 819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 809.0, + 491.0, + 809.0, + 491.0, + 854.0, + 293.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 496.0, + 1404.0, + 496.0, + 1404.0, + 529.0, + 297.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 526.0, + 1405.0, + 526.0, + 1405.0, + 559.0, + 296.0, + 559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 555.0, + 1406.0, + 555.0, + 1406.0, + 595.0, + 292.0, + 595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 585.0, + 1406.0, + 585.0, + 1406.0, + 622.0, + 294.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 618.0, + 854.0, + 618.0, + 854.0, + 651.0, + 294.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 958.0, + 1405.0, + 958.0, + 1405.0, + 994.0, + 293.0, + 994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 988.0, + 1406.0, + 988.0, + 1406.0, + 1024.0, + 293.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1018.0, + 1409.0, + 1018.0, + 1409.0, + 1056.0, + 293.0, + 1056.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1047.0, + 1082.0, + 1047.0, + 1082.0, + 1087.0, + 293.0, + 1087.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1179.0, + 1061.0, + 1179.0, + 1061.0, + 1215.0, + 309.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1231.0, + 1409.0, + 1231.0, + 1409.0, + 1273.0, + 307.0, + 1273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1261.0, + 428.0, + 1261.0, + 428.0, + 1300.0, + 355.0, + 1300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1318.0, + 1200.0, + 1318.0, + 1200.0, + 1355.0, + 307.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1370.0, + 1409.0, + 1370.0, + 1409.0, + 1411.0, + 307.0, + 1411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1404.0, + 618.0, + 1404.0, + 618.0, + 1439.0, + 355.0, + 1439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1457.0, + 1407.0, + 1457.0, + 1407.0, + 1497.0, + 307.0, + 1497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1485.0, + 1406.0, + 1485.0, + 1406.0, + 1526.0, + 353.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1513.0, + 1053.0, + 1513.0, + 1053.0, + 1560.0, + 354.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1574.0, + 1409.0, + 1574.0, + 1409.0, + 1613.0, + 307.0, + 1613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1604.0, + 1406.0, + 1604.0, + 1406.0, + 1646.0, + 353.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1635.0, + 1257.0, + 1635.0, + 1257.0, + 1675.0, + 351.0, + 1675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1690.0, + 1404.0, + 1690.0, + 1404.0, + 1729.0, + 309.0, + 1729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1722.0, + 824.0, + 1722.0, + 824.0, + 1759.0, + 351.0, + 1759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1773.0, + 1404.0, + 1773.0, + 1404.0, + 1815.0, + 307.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1807.0, + 1054.0, + 1807.0, + 1054.0, + 1841.0, + 355.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1860.0, + 1410.0, + 1860.0, + 1410.0, + 1899.0, + 309.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1893.0, + 602.0, + 1893.0, + 602.0, + 1923.0, + 355.0, + 1923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 300.0, + 1945.0, + 1409.0, + 1945.0, + 1409.0, + 1984.0, + 300.0, + 1984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1975.0, + 429.0, + 1975.0, + 429.0, + 2010.0, + 354.0, + 2010.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 293, + 170, + 1409, + 170, + 1409, + 2008, + 293, + 2008 + ], + "score": 0.87 + }, + { + "category_id": 2, + "poly": [ + 835, + 2061, + 863, + 2061, + 863, + 2087, + 835, + 2087 + ], + "score": 0.839 + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2058.0, + 868.0, + 2058.0, + 868.0, + 2097.0, + 832.0, + 2097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 203.0, + 1407.0, + 203.0, + 1407.0, + 241.0, + 295.0, + 241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 233.0, + 1407.0, + 233.0, + 1407.0, + 271.0, + 353.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 263.0, + 1409.0, + 263.0, + 1409.0, + 302.0, + 351.0, + 302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 292.0, + 743.0, + 292.0, + 743.0, + 338.0, + 351.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 344.0, + 1407.0, + 344.0, + 1407.0, + 386.0, + 291.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 378.0, + 1139.0, + 378.0, + 1139.0, + 417.0, + 355.0, + 417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 427.0, + 1409.0, + 427.0, + 1409.0, + 469.0, + 291.0, + 469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 459.0, + 1405.0, + 459.0, + 1405.0, + 498.0, + 353.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 491.0, + 1407.0, + 491.0, + 1407.0, + 530.0, + 353.0, + 530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 524.0, + 709.0, + 524.0, + 709.0, + 556.0, + 357.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 574.0, + 1405.0, + 574.0, + 1405.0, + 613.0, + 293.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 604.0, + 1409.0, + 604.0, + 1409.0, + 643.0, + 353.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 628.0, + 484.0, + 628.0, + 484.0, + 674.0, + 354.0, + 674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 687.0, + 1407.0, + 687.0, + 1407.0, + 726.0, + 293.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 738.0, + 1407.0, + 738.0, + 1407.0, + 780.0, + 291.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 768.0, + 1409.0, + 768.0, + 1409.0, + 810.0, + 349.0, + 810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 800.0, + 809.0, + 800.0, + 809.0, + 839.0, + 351.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 857.0, + 1405.0, + 857.0, + 1405.0, + 889.0, + 297.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 885.0, + 1407.0, + 885.0, + 1407.0, + 923.0, + 353.0, + 923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 915.0, + 1121.0, + 915.0, + 1121.0, + 954.0, + 353.0, + 954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 968.0, + 1405.0, + 968.0, + 1405.0, + 1006.0, + 295.0, + 1006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1000.0, + 1277.0, + 1000.0, + 1277.0, + 1039.0, + 353.0, + 1039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1051.0, + 1397.0, + 1051.0, + 1397.0, + 1089.0, + 295.0, + 1089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1101.0, + 1409.0, + 1101.0, + 1409.0, + 1143.0, + 291.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 1131.0, + 1407.0, + 1131.0, + 1407.0, + 1174.0, + 349.0, + 1174.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1166.0, + 1199.0, + 1166.0, + 1199.0, + 1204.0, + 353.0, + 1204.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1218.0, + 1407.0, + 1218.0, + 1407.0, + 1257.0, + 293.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1248.0, + 1075.0, + 1248.0, + 1075.0, + 1287.0, + 353.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1301.0, + 1405.0, + 1301.0, + 1405.0, + 1339.0, + 295.0, + 1339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1333.0, + 773.0, + 1333.0, + 773.0, + 1366.0, + 353.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1382.0, + 1405.0, + 1382.0, + 1405.0, + 1420.0, + 295.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1418.0, + 1025.0, + 1418.0, + 1025.0, + 1450.0, + 353.0, + 1450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1471.0, + 1405.0, + 1471.0, + 1405.0, + 1503.0, + 297.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1499.0, + 1407.0, + 1499.0, + 1407.0, + 1537.0, + 353.0, + 1537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 1527.0, + 1061.0, + 1527.0, + 1061.0, + 1567.0, + 349.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1582.0, + 1407.0, + 1582.0, + 1407.0, + 1620.0, + 295.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1612.0, + 1179.0, + 1612.0, + 1179.0, + 1650.0, + 355.0, + 1650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1664.0, + 1407.0, + 1664.0, + 1407.0, + 1703.0, + 295.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1697.0, + 945.0, + 1697.0, + 945.0, + 1735.0, + 353.0, + 1735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1747.0, + 1407.0, + 1747.0, + 1407.0, + 1785.0, + 295.0, + 1785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 1779.0, + 721.0, + 1779.0, + 721.0, + 1816.0, + 349.0, + 1816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1830.0, + 1405.0, + 1830.0, + 1405.0, + 1868.0, + 295.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1860.0, + 617.0, + 1860.0, + 617.0, + 1899.0, + 353.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1915.0, + 1409.0, + 1915.0, + 1409.0, + 1953.0, + 295.0, + 1953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 347.0, + 1941.0, + 1409.0, + 1941.0, + 1409.0, + 1987.0, + 347.0, + 1987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1975.0, + 643.0, + 1975.0, + 643.0, + 2011.0, + 351.0, + 2011.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 289, + 197, + 1409, + 197, + 1409, + 943, + 289, + 943 + ], + "score": 0.864 + }, + { + "category_id": 2, + "poly": [ + 836, + 2061, + 865, + 2061, + 865, + 2086, + 836, + 2086 + ], + "score": 0.704 + }, + { + "category_id": 2, + "poly": [ + 836, + 2061, + 865, + 2061, + 865, + 2086, + 836, + 2086 + ], + "score": 0.354 + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2058.0, + 870.0, + 2058.0, + 870.0, + 2097.0, + 832.0, + 2097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2058.0, + 870.0, + 2058.0, + 870.0, + 2097.0, + 832.0, + 2097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 202.0, + 1408.0, + 202.0, + 1408.0, + 241.0, + 295.0, + 241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 234.0, + 1407.0, + 234.0, + 1407.0, + 273.0, + 353.0, + 273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 265.0, + 656.0, + 265.0, + 656.0, + 302.0, + 355.0, + 302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 314.0, + 1407.0, + 314.0, + 1407.0, + 357.0, + 292.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 348.0, + 736.0, + 348.0, + 736.0, + 384.0, + 355.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 400.0, + 1403.0, + 400.0, + 1403.0, + 435.0, + 296.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 432.0, + 684.0, + 432.0, + 684.0, + 467.0, + 355.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 481.0, + 1406.0, + 481.0, + 1406.0, + 518.0, + 292.0, + 518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 513.0, + 1406.0, + 513.0, + 1406.0, + 552.0, + 352.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 542.0, + 1406.0, + 542.0, + 1406.0, + 581.0, + 352.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 573.0, + 1336.0, + 573.0, + 1336.0, + 612.0, + 352.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 622.0, + 1409.0, + 622.0, + 1409.0, + 667.0, + 292.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 657.0, + 1253.0, + 657.0, + 1253.0, + 692.0, + 353.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 705.0, + 1406.0, + 705.0, + 1406.0, + 748.0, + 294.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 740.0, + 993.0, + 740.0, + 993.0, + 775.0, + 355.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 785.0, + 1407.0, + 785.0, + 1407.0, + 833.0, + 293.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 822.0, + 1176.0, + 822.0, + 1176.0, + 861.0, + 353.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 875.0, + 1407.0, + 875.0, + 1407.0, + 910.0, + 295.0, + 910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 906.0, + 527.0, + 906.0, + 527.0, + 938.0, + 355.0, + 938.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/cAvgPMAA3hb/cAvgPMAA3hb.md b/parse/train/cAvgPMAA3hb/cAvgPMAA3hb.md new file mode 100644 index 0000000000000000000000000000000000000000..bc291e3cd62e98a16ed8c0826fb9dc4311073819 --- /dev/null +++ b/parse/train/cAvgPMAA3hb/cAvgPMAA3hb.md @@ -0,0 +1,413 @@ +# GRF: LEARNING A GENERAL RADIANCE FIELD FOR 3D SCENE REPRESENTATION AND RENDERING + +Anonymous authors Paper under double-blind review + +# ABSTRACT + +We present a simple yet powerful implicit neural function that can represent and render arbitrarily complex 3D scenes in a single network only from 2D observations. The function models 3D scenes as a general radiance field, which takes a set of 2D images with camera poses and intrinsics as input, constructs an internal representation for each 3D point of the scene, and renders the corresponding appearance and geometry of any 3D point viewing from an arbitrary angle. The key to our approach is to explicitly integrate the principle of multi-view geometry to obtain the internal representations from observed 2D views, such that the learned implicit representations empirically remain multi-view consistent. In addition, we introduce an effective neural module to learn general features for each pixel in 2D images, allowing the constructed internal 3D representations to be general as well. Extensive experiments demonstrate the superiority of our approach. + +# 1 INTRODUCTION + +Understanding the precise 3D structure of a real-world environment and realistically re-rendering it from free viewpoints is a key enabler for many critical tasks, ranging from robotic manipulation and navigation to augmented reality. Classic approaches to recover the 3D scene geometry mainly include the structure from motion (SfM) (Ozyesil et al., 2017) and simultaneous localization and mapping (SLAM) (Cadena et al., 2016) pipelines. However, they are limited to reconstruct sparse and discrete 3D point clouds which are unable to contain geometric details. + +The recent advances in deep neural networks have yielded rapid progress in 3D modeling and understanding. Most of them focus on the explicit 3D shape representations such as voxel grids (Choy et al., 2016), point clouds (Fan et al., 2017), or triangle meshes (Wang et al., 2018). However, these representations are discrete and sparse, limiting the recovered 3D structures to extremely low spatial resolution. In addition, these networks usually require large-scale 3D shapes for supervision, resulting in the trained models being over-fitting particular datasets and unable to generalize to novel scenes. In fact, it is also costly and even infeasible to collect high-quality 3D labels. + +Encoding geometries into multilayer perceptrons (MLPs) (Mescheder et al., 2019; Park et al., 2019) recently emerges as a promising direction in 3D reconstruction and understanding from 2D images. Its key advantage is the ability to model 3D structures in a continuous way instead of discrete, and therefore it has the potential to achieve unlimited spatial resolution in theory. However, most methods of this pipeline focus on individual objects. In addition, many of them require 3D geometry for supervision to learn the 3D shapes from images. By introducing a recurrent neural network based renderer, SRNs (Sitzmann et al., 2019) is among the early work to learn implicit surface representations only from 2D images, but it fails to capture complicated scene geometries and renders over-smoothed images. Alternatively, by leveraging the volume rendering to synthesize new views for 2D supervision, the very recent NeRF (Mildenhall et al., 2020) directly encodes the radiance fields of complex 3D scenes within the weights of MLPs, achieving an unprecedented level of fidelity for challenging 3D scenes. Nevertheless, it has two major limitations: 1) since each 3D scene is encoded into all the weights of MLPs, the trained network (i.e., a learned radiance field) can only represent a single scene, and is unable to generalize across novel scenarios; 2) because the shape and appearance of each spatial 3D location along a light ray is only optimized by the available pixel RGBs, the learned implicit representations of that location are lack of the general geometric patterns, resulting in the synthesized images being less photo-realistic. + +In this paper, we propose a general radiance field (GRF), a simple yet powerful implicit function that can represent and render complex 3D scenes where there may be multiple objects with cluttered background. Our GRF takes a set of 2D images with camera poses and intrinsics, a 3D query point and its query viewpoint (i.e., the camera location $x y z )$ as input, and predicts the RGB value and volumetric density of that query point. Basically, this neural function learns to represent a 3D scene from sparse 2D observations, and infers the shape and appearance of that scene from previously unobserved viewing angles. Note that, the inferred shape and appearance of any particular 3D query point explicitly take into account its local geometric patterns from the available 2D observations. In particular, the proposed GRF consists of four components: + +• Extracting the general 2D visual features for every light ray from the input 2D observations; +• Reprojecting the corresponding 2D features back to the query 3D point using the principle of multi-view geometry; +• Selecting and aggregating all the reprojected features for the query 3D point, while the visual occlusions are implicitly considered; +• Rendering the aggregated features of the query 3D point along a particular query viewpoint, and producing the corresponding RGB and volumetric density. + +These four components enable our GRF to be significantly different from all existing 3D scene representation approaches. 1) Compared with the classic SfM/SLAM systems, our GRF can represent the 3D scene structure with smooth and continuous surfaces. 2) Compared with the neural approaches based on explicit voxel grids, point clouds and meshes, our GRF learns continuous 3D representations without requiring 3D data for training. 3) Compared with the existing implicit representation methods such as SDF (Park et al., 2019), SRNs (Sitzmann et al., 2019) and NeRF (Mildenhall et al., 2020), our GRF can represent arbitrarily complicated 3D scenes and has remarkable generalization to novel scenarios. In addition, the learned 3D representations carefully consider the general geometric patterns for every 3D spatial location, allowing the rendered views to be exceptionally realistic with fine-grained details. Our key contributions are: + +• We propose a general radiance field to implicitly represent the 3D scene structure and appearance purely from 2D images. It has remarkable generalization to novel scenes in a single forward pass. • We explicitly integrate the principle of multi-view geometry to learn geometric details for each 3D query point along every query light ray. This allows the synthesized 2D views to be superior. • We demonstrate significant improvement over baselines on three large-scale datasets and provide intuition behind our design choices through extensive ablation studies. + +# 2 RELATED WORK + +Classic Multi-view Geometry. Classic approaches to reconstruct 3D geometry from images mainly include SfM and SLAM systems, which firstly extract and match hand-crafted geometric local features and then apply bundle adjustment for both shape and camera motion estimation (Hartley & Zisserman, 2004). Although they can recover visually satisfactory 3D models, the reconstructed shapes are usually sparse, discrete point clouds. In contrast, our GRF learns an implicit function to represent the continuous 3D structures from images. Notably, however, the principle of classic multi-view geometry is explicitly integrated into our GRF to learn accurate and general features for every spatial location. + +Geometric Deep Learning. The recent advances of deep neural nets have yielded impressive progress in recovering explicit 3D shapes from either single or multiple images, including the voxel grid (Choy et al., 2016; Yang et al., 2019), octree (Riegler et al., 2017; Christian et al., 2017), point cloud (Fan et al., 2017; Qi et al., 2017) and triangle mesh (Wang et al., 2018; Groueix et al., 2018; Nash et al., 2020) based approaches. However, most of these methods only focus on individual 3D objects, whilst only few pipelines (Song et al., 2017; Tulsiani et al., 2018; Gkioxari et al., 2019) attempt to learn the structures for complex 3D scenes. Although these neural networks can predict realistic 3D structures of objects and scenes, they have two limitations. First, almost all of them require ground truth 3D labels to supervise the networks, resulting in the learned representations being unable to generalize to novel real-world scenes. Second, since the recovered 3D shapes are discrete, they are unable to preserve high-resolution geometric details. Being quite different, our GRF learns to infer continuous 3D shapes only from a set of 2D images with camera poses and intrinsics, which can be cheaply acquired and also allow better generalization across real-world scenes. + +Neural Implicit 3D Representations. The implicit representation of 3D shapes recently emerges as a promising direction to recover 3D geometries. It is initially formulated as level sets by optimizing neural nets which map xyz locations to an occupancy field (Mescheder et al., 2019; Saito et al., 2019) or a distance function (Park et al., 2019). The subsequent work (Niemeyer et al., 2020; Sitzmann et al., 2019; Liu et al., 2019b; Atzmon & Lipman, 2020a;b) introduce differentiable rendering functions, allowing 2D images or raw 3D point clouds to supervise the networks, but only producing decent results on individual objects. Using neural radiance fields instead, the latest NeRF (Mildenhall et al., 2020) and the succeeding NSVF (Liu et al., 2020), NeRF-wild (Martin-Brualla et al., 2020), GRAF (Schwarz et al., 2020) demonstrate impressive results to represent complex 3D scenes. However, they do not take into account the local geometric patterns for spatial locations, thereby the rendered 2D images being less realistic and sub-optimal. Additionally, both NeRF and NeRF-wild can only represent a single scene, and are unable to generalize to novel scenarios. Uniquely, our GRF maps any set of images to the corresponding 3D scene structure with geometric details. + +Novel View Synthesis and Neural Rendering. Novel view synthesis involves generating unseen views of a scene captured by multiple images. Existing methods usually learn an embedding of a scene and then estimate a new image given a viewing angle, including GAN based methods (Goodfellow et al., 2014; Radford et al., 2016), variational auto-encoders (Kingma & Welling, 2014), autoregressive models (Oord et al., 2016), and other generative frameworks (Eslami et al., 2018). Although photo-realistic single images can be generated, these methods tend to learn the manifold of 2D images, instead of exploiting the underlying 3D geometry for consistent multi-view synthesis. + +Neural rendering techniques (Fried et al., 2020; Kato et al., 2020) have recently been actively investigated and integrated into 3D reconstruction pipelines, where there are no ground truth 3D data available but only 2D images for supervision. To render the discrete voxel grids (Yan et al., 2016; Rezende et al., 2016; Tulsiani et al., 2017), point clouds (Insafutdinov & Dosovitskiy, 2018), meshes (Kato et al., 2018; Chen et al., 2019; Liu et al., 2019a), and implicit surfaces (Liu et al., 2019b; Remelli et al., 2020), most of these techniques are designed with differentiable and approximate functions, but sacrifice the sharpness of synthesized images and the accuracy of estimated 3D shapes. By contrast, our GRF leverages the existing volume rendering method (Mildenhall et al., 2020) which is naturally differentiable and can accurately render the RGB per light ray. + +# 3 GRF + +# 3.1 OVERVIEW + +Our GRF models the complex 3D scenes including the geometry and appearance as a neural function $f _ { \mathbf { W } }$ where W represent learnable parameters. This function takes a set of $M$ images together with their camera poses and intrinsics $\{ ( \mathcal { T } _ { 1 } , \pmb { \xi } _ { 1 } , \pmb { K } _ { 1 } ) \cdot \cdot \cdot ( \mathcal { T } _ { m } , \pmb { \xi } _ { m } , \pmb { K } _ { m } ) \cdot \cdot \cdot ( \mathcal { T } _ { M } , \pmb { \xi } _ { M } , \pmb { K } _ { M } ) \} _ { \{ \pmb { \xi } _ { 1 } , \pmb { \xi } _ { 1 } , \pmb { K } _ { 1 } \} }$ , which are sampled from a complex 3D scene, a query 3D point $p = \{ x _ { p } , y _ { p } , z _ { p } \}$ , and its query viewpoint $\mathcal { V } _ { p } = \{ x _ { p } ^ { v } , y _ { p } ^ { v } , z _ { p } ^ { v } \}$ as input, and then predicts the RGB value $\{ r _ { p } , g _ { p } , b _ { p } \}$ and the volumetric density $d _ { p }$ of that query 3D point $p$ observed from the query viewpoint $\gamma _ { p }$ . Formally, it is defined as below: + +$$ +( r _ { p } , g _ { p } , b _ { p } , d _ { p } ) = f _ { \mathbf { W } } \left( \Big \{ ( \mathcal { T } _ { 1 } , \pmb { \xi } _ { 1 } , K _ { 1 } ) \cdot \cdot \cdot ( \mathcal { T } _ { M } , \pmb { \xi } _ { M } , K _ { M } ) \Big \} , \{ x _ { p } , y _ { p } , z _ { p } \} , \{ x _ { p } ^ { v } , y _ { p } ^ { v } , z _ { p } ^ { v } \} \right) +$$ + +Basically, this function is a general radiance field (GRF) which parameterizes arbitrary 3D scenes observed by the input $M$ images. In the meantime, it returns both the appearance and geometry, when being queried at any location $p$ from any viewpoint $\nu$ in 3D space. + +As illustrated in Figure 1, the proposed GRF firstly extracts general features for each light ray hitting through every pixel, and then reprojects those features back to the query 3D point $p$ . After that, the corresponding RGB value and volumetric density of $p$ are inferred from those features given a specific query viewpoint. This simple design of GRF follows the principle of classic multi-view geometry (Hartley & Zisserman, 2004), therefore driving the learned implicit representations to be multi-view consistent. In particular, for any query 3D point in space, its features are always the same when being viewing from different angles. Hence, its rendered RGBs and volumetric densities are more likely to be consistent from different viewpoints. To realize our neural function $f _ { \mathbf { W } }$ , we introduce four components: 1) A feature extractor for every 2D pixel; 2) A reprojector to transform 2D features to 3D space; 3) An aggregator to obtain general features for a 3D point; and 4) A neural renderer to infer the appearance and geometry for that 3D point. All these components are connected and trained end-to-end with arbitrary scenes. + +![](images/56d1944f4d23a0a0a15e2089b674d2311f3342f1b49f441d770342b7eecce36d.jpg) +Figure 1: Overview of the proposed general radiance field. + +# 3.2 EXTRACTING GENERAL FEATURES FOR 2D PIXELS + +The whole input set of observed 2D images together describes the geometry and appearance of a 3D scene, while each pixel of those images describes a specific point of that scene. This module aims to extract the general features of each pixel, so to learn the regional description and geometric patterns for each light ray. A naive approach is to directly use the raw rgb values as the pixel features. However, this is sub-optimal because the raw rgb values are sensitive to lighting conditions, environmental noise, etc. In order to learn more general and robust patterns for each pixel, we turn to use a more powerful encoder-decoder based convolutional neural network (CNN). As shown in Figure 2, our CNN module is designed with the follow two features: + +![](images/b2e9605ba008f372de37a5ed751410ac325144fee0bb3ce35aceec07022d20bd.jpg) +Figure 2: The CNN module to extract pixel features. + +• Instead of directly feeding raw RGB images into the CNN module, we stack (duplicate) the corresponding viewpoint, i.e., the xyz location of the camera, to each pixel of the image. This allows the learned pixel features to be explicitly aware of its relative position in the 3D scene space. Note that, we empirically find that stacking the additional camera rotation and intrinsics to each pixel does not noticeably improve the performance, especially for scenes centered at the origin. • We use skip connections between the encoder and decoder to preserve high frequency local features for each pixel, while optionally integrating a couple of fully connected (fc) layers in the middle of the CNN module to learn global features. The mixture of hierarchical features tends to to be more general and representative, effectively aiding the network in practice. + +Details of the CNN module is presented in the appendix and all input images share the same CNN module. Note that, there are many ways to construct a pixel feature extractor, but identifying an optimal CNN module here is out the scope of this paper. + +# 3.3 REPROJECTING 2D FEATURES TO 3D SPACE + +Considering the extracted pixel features are a compact description of the light ray emitting from the camera center up to the 3D scene surface, we naturally reproject the pixel features back to the 3D space along the light ray. Since there are no depth scans paired with RGB images, it is impossible to determine which particular 3D surface point the pixel features belong to. In this module, we preliminarily regard the pixel features as the representation of every location along the light ray in 3D space. With this simple formulation, every 3D point can theoretically have a copy of its corresponding 2D pixel features from each 2D image. Formally, given a 3D point $p$ , an observed 2D view $\mathcal { I } _ { m }$ together with the camera pose $\xi _ { m }$ and the intrinsics $K _ { m }$ , the corresponding 2D pixel features $\mathbf { F } _ { p } ^ { m }$ is retrieved by the reprojection operation below: + +$$ +\mathbf { F } _ { p } ^ { m } = \mathcal { P } \Big ( \{ \boldsymbol { \mathcal { T } } _ { k } , \boldsymbol { \xi } _ { m } , K _ { m } \} , \{ x _ { p } , y _ { p } , z _ { p } \} , \mathbf { I } _ { m } \Big ) +$$ + +where the function $\mathcal { P } ( )$ follows the principle of multi-view geometry (Hartley & Zisserman, 2004) and ${ \mathbf I } _ { m }$ represents the image features extracted by the CNN module in Section 3.2. However, since the pixels of 2D images are discrete and bounded within a certain spatial size, while the 3D points are continuous in the scene space, after the 3D point $p$ is projected to the plane of image $\mathcal { T } _ { m }$ , we apply two approximations to deal with the following issues. + +• If the point lies inside of the image, we simply select the nearest pixel and duplicate its features to the 3D point. Note that, more advanced techniques may be applied to address the discretization issue, such as linear interpolation or designing a kernel function. • If the point lies outside of the image, we assign a zero vector to the 3D point, which means there is no information observed. In fact, we empirically find that the nearest interpretation can also achieve good performance, but it is only applicable for relatively small-scale scenes. + +Overall, the above simple reprojection operation explicitly retains the extracted 2D pixel features back to 3D space via the principle of geometry, and the module is naturally differentiable. + +# 3.4 OBTAINING GENERAL FEATURES FOR 3D POINTS + +Given a query 3D point $p$ , it is able to retrieve a feature vector from each input image. However, given a set of input images, it is challenging to obtain a final feature vector for the point $p$ , because: + +• The total number of input images for each 3D scene is variable and there is no order for images. As a consequence, the retrieved feature vectors are also unordered and have arbitrary size. • Since there are no depth scans paired with the input RGB images, it is unable to decide which feature vectors are the true descriptions of the query point due to visual occlusions. Ideally, these features can be aware of the relative distance to the query point and then selected automatically. + +To tackle these critical issues, we formulate this problem as an attention aggregation process. In particular, given the query 3D point $p$ , its query viewpoint $\nu _ { p }$ , and the set of retrieved pixel features $\{ \mathbf { F } _ { p } ^ { 1 } \cdot \cdot \cdot \mathbf { F } _ { p } ^ { m } \cdot \cdot \cdot \mathbf { F } _ { p } ^ { M } \}$ : + +• For each retrieved feature vector $\mathbf { F } _ { p } ^ { m }$ , we firstly use shared MLPs to integrate the information of query point $p$ , generating a new feature vector $\hat { \mathbf { F } } _ { p } ^ { m }$ which is aware of the relative distance to the query point $p$ . Formally, it is defined as: $\hat { \mathbf { F } } _ { p } ^ { m } = M L P s ( \mathbf { F } _ { p } ^ { m } \oplus [ x _ { p } , y _ { p } , z _ { p } ] ) , \quad ( \oplus \mathrm { m e a n s ~ c o n c a t e n a t i o n ~ i n ~ n e u r a l ~ n e t s } )$ (3) +• After obtaining the new set of position-aware features $\{ \hat { \mathbf { F } } _ { p } ^ { 1 } \cdot \cdot \cdot \hat { \mathbf { F } } _ { p } ^ { m } \cdot \cdot \cdot \hat { \mathbf { F } } _ { p } ^ { M } \}$ , we use the existing attention aggregation methods such as AttSets (Yang et al., 2020) and Slot Attention (Locatello et al., 2020) to compute a unique feature vector $\bar { \mathbf { F } } _ { p }$ for the query 3D point $p$ . Basically, the attention mechanism learns a unique weight for all input features and then aggregates them together. According to the theoretical analysis in (Yang et al., 2020) and (Locatello et al., 2020), the selected attention mechanisms are permutation invariant with regard to the input set of feature vectors and can process an arbitrary number of elements. Formally, it is defined as: + +$$ +\bar { \mathbf { F } } _ { p } = \mathcal { A } \big ( \hat { \mathbf { F } } _ { p } ^ { 1 } \cdot \cdot \cdot \hat { \mathbf { F } } _ { p } ^ { m } \cdot \cdot \cdot \hat { \mathbf { F } } _ { p } ^ { M } \big ) , \quad \mathrm { ( \mathcal { A } ~ i s ~ a n ~ e x i s t i n g ~ a t t e n t i o n ~ f u n c t i o n ) } +$$ + +Above all, for every query 3D point $p$ , its final features $\bar { \mathbf { F } } _ { p }$ explicitly preserve the general geometric patterns retrieved from the input 2D observations and are also made aware of the particular 3D point location within the scene space. This allows the 3D point features $\bar { \mathbf { F } } _ { p }$ to be general and representative for its own geometry and appearance. + +# 3.5 RENDERING 3D FEATURES + +With the learned features $\bar { \mathbf { F } } _ { p }$ for any query 3D point $p$ , this module aims to infer its volumetric density $d _ { p }$ in 3D space and the corresponding RGB values $\{ r _ { p } , g _ { p } , b _ { p } \}$ given the query viewpoint $\nu _ { p }$ . In particular, we exactly follow the simple MLP-based design of NeRF (Mildenhall et al., 2020) in the rendering process. As illustrated in Equation 5, the volumetric density $d _ { p }$ is modeled as a function of the point features $\bar { \mathbf { F } } _ { p }$ only. This allows the estimated density $d _ { p }$ at the query point $p$ to remain unchanged under different query viewpoints, thus maintaining consistent geometry for each point. The RGB is modeled as a function of both point features and the query viewpoint. Details of these MLPs refers to NeRF (Mildenhall et al., 2020). + +$$ +d _ { p } = M L P s ( \bar { \mathbf { F } } _ { p } ) , \qquad \quad ( r _ { p } , g _ { p } , b _ { p } ) = M L P s \Bigl ( \bar { \mathbf { F } } _ { p } , \{ x _ { p } ^ { v } , y _ { p } ^ { v } , z _ { p } ^ { v } \} \Bigr ) +$$ + +To render the color of any query ray passing through the 3D scene, the classic volume rendering (Kajiya & Herzen, 1984) is applied and the integral is estimated by sampling a discrete set of 3D points along the query ray. In particular, we exactly follow the formulation of ray marching and the hierarchical sampling strategy in NeRF (Mildenhall et al., 2020). Eventually, novel 2D images can be directly synthesized from our GRF by querying light rays. This allows the entire network to be trainable only with a set of 2D images, without requiring 3D data. + +# 3.6 IMPLEMENTATION + +The proposed four modules are connected and trained end-to-end. In the implementation, details of the CNN module and the attention module for different experiments are presented in the appendix. In the neural rendering module, all the designs of neural layers and other settings simply follow NeRF (Mildenhall et al., 2020). In our network, all the 3D locations and RGB values are processed by the positional encoding proposed by NeRF (Mildenhall et al., 2020). The L2 loss between the rendered RGB and the ground truth is used to optimize the whole neural network. All these details are presented in the appendix. + +# 4 EVALUATION + +# 4.1 EXPERIMENTS ON SHAPENETV2 DATASET + +Following the experimental settings of SRNs (Sitzmann et al., 2019), we firstly evaluate our GRF on the chair and car classes of ShapeNetv2. Particularly, the chair has 4612 objects for training, 662 for validation and 1317 for testing, while the car has 2151 objects for training, 352 for validation and 704 for testing. Each training object has randomly sampled 50 images with a resolution of $1 2 8 \times 1 2 8$ pixels. We conduct the following three groups of experiments. + +• Group 1: Novel-view synthesis of seen objects in the training split of the same category. In particular, we train two separate models on the training split of chairs and cars, and these two models are separately tested on the trained objects to generate completely novel views. During testing, the model is fed with 50 trained views and infers another 251 novel views for evaluation. • Group 2: Novel-view synthesis of unseen objects in the testing split of the same category. The trained two models in Group 1 are tested on novel objects of the same category. During testing, the model is fed with 2 novel views of each novel object, inferring 251 novel views for evaluation. • Group 3: Similar to Group 2, but only 1 novel view is fed into the model for novel view synthesis. + +Basically, the experiments of Group 1, 2 and 3 are exactly the same as in SRNs (Sitzmann et al., 2019) which is also the state of the art on this ShapeNetv2 dataset. Table 1 compares the quantitative results of our GRF and four baselines. Note that, the recent NeRF and NSVF are not scalable to learn large number of scenes simultaneously because each scene is encoded into the network parameters. + +Analysis. 1) Our method outperforms SRNs on 50-view reconstruction, demonstrating the strong capability of our GRF for 3D scene representation. Figure 3 shows the qualitative results. 2) Our GRF lags behind SRNs for novel scene reconstruction in both Group 2 and 3. Fundamentally, this is because our GRF solves a much harder problem than SRNs. In particular, our network directly infers the novel scene representation in a single forward pass, while SRNs needs to be retrained on all novel scenes to optimize the latent code. As a result, the experiments of Group 2 and 3 are significantly in favour of SRNs. 3) To further demonstrate the advantage of GRF over SRNs, we directly evaluate the trained SRNs model on unseen objects (of the same category) without retraining. For comparison, we also directly evaluate the trained GRF model on the same novel objects. Figure 4 shows the qualitative results. It can be seen that if not retrained, SRNs completely fails to reconstruct unseen car instances, but randomly generates similar cars from learned prior knowledge, primarily because its latent code has not been updated from the unseen objects. In contrast, by learning pixel local patterns, our GRF generalizes well to novel objects directly. This highlights the superiority of the simple formulation of our GRF. + +Table 1: Comparison of the PSNR (in dB) and SSIM of reconstructed images in the ShapeNetv2 dataset by our GRF, the deterministic GQN (Eslami et al., 2018), TCO (Tatarchenko et al., 2015), WRL (Worrall et al., 2017) and SRNs (Sitzmann et al., 2019). The higher the scores, the better the synthesized novel views. Note that, our GRF solves a harder problem than SRNs, because GRF infers the novel scene representation in a single forward pass, while SRNs cannot. + +
50 Images (Group 1)2 Images (Group 2)1 Image (Group 3)
ChairsCarsChairsCarsChairsCars
TCO24.31/ 0.9220.38/0.8321.33/ 0.8818.41 /0.8021.27 / 0.8818.15/0.79
WRL24.57 / 0.9319.16 /0.8222.28/0.9017.20 /0.7822.11/0.9016.89 / 0.77
dGQN22.72/0.9019.61 /0.8122.36 /0.8918.79 /0.7921.59 / 0.8718.19 /0.78
SRNs26.23 / 0.9526.32 /0.9424.48 / 0.9222.94 / 0.8822.89 / 0.9120.72 / 0.85
GRF (Ours)27.10 / 0.9527.21 / 0.9422.65/0.8822.06 /0.8621.25/0.8619.84/ 0.81
+ +![](images/2df62752b06cd043c2e56bd864bd2c55fce00ed1bd7adfe827095d12d01968ae.jpg) +Figure 3: Qualitative results of SRNs and our GRF for 50-view reconstruction of chairs and cars. +or on par with the state-of-the-art NSVF on all metrics. Figure 6 shows the qualitative results. + +![](images/ce6817cec552833df65cb0e59da8ce2a23b611b88d65539290d9ff8fca51274d.jpg) +Figure 4: Qualitative results of SRNs (without retraining) and our GRF for 50-view reconstruction of unseen cars. SRNs fails to recover faithful shapes for unseen cars without retraining. + +# 4.2 EXPERIMENTS ON SYNTHETIC-NERF DATASET + +We further evaluate our approach on the more complex dataset Synthetic-NeRF (Mildenhall et al., 2020). It consists of pathtraced images of 8 synthetic scenes with much more complicated geometry and realistic non-Lambertian materials. Each scene has 100 views for training and 200 novel views for testing. Each image has a high resolution of $8 0 0 \times 8 0 0$ pixels. + +Single-scene Learning. To demonstrate the representational capability of our GRF, we train a single model for each synthetic scene, following the same experimental settings of NSVF (Liu et al., 2020). Table 2 compares the quantitative results. Our method is better + +Table 2: The average scores of PSNR, SSIM and LPIPS (Zhang et al., 2018) for our GRF, SRNs (Sitzmann et al., 2019), NV (Lombardi et al., 2019), LLFF (Mildenhall et al., 2019), NeRF (Mildenhall et al., 2020) and NSVF (Liu et al., 2020) on the Synthetic-NeRF dataset for single-scene learning. + +
PSNR↑SSIM↑LPIPS↓
SRNs22.260.8460.170
NV26.050.8930.160
LLFF24.880.9110.114
NeRF31.010.9470.081
NSVF31.740.9530.047
GRF(Ours)32.060.9600.048
+ +Novel-scene Generalization. To evaluate the generalization of GRF on complex scenes, we train a single model simultaneously from randomly selected 4 scenes of Synthetic-NeRF, i.e., Chair, Mic, Ship, and Hotdog, and then conduct the following two groups of experiments. + +Group 1: The trained model is directly tested on the remaining 4 novel scenes of Synthetic-NeRF dataset, i.e., Drums, Lego, Materials, and Ficus. Fundamentally, this experiment is to evaluate whether the learned limited features can truly generalize to new scenarios. This is extremely challenging because there are only 4 training scenes and the overall shapes of the 4 novel scenes are dramatically different from the trained ones. + +Group 2: The trained model is further finetuned on each of the four novel scenes with 100, 1k, and 10k iterations separately. In total, we obtain $4 \times 3 = 1 2$ new models. For comparison, we also train NeRF on each of the four novel scenes with 100, 1k, 10k iterations from scratch. This group of experiments evaluates how the initially-learned general features of our GRF improve novel scene learning. + +Analysis. Table 3 compares the quantitative results. We can see that: 1) In Group 1, our GRF can indeed generalize to novel scenes with complex and completely different overall geometries, demonstrating the effectiveness of learning point local features in GRF. As shown in Figure 5, the overall shape and appearance of Lego can be satisfactorily recovered, though it has never been seen before. 2) In Group 2, our GRF can quickly learn high-quality scene representations given a sparse number of training pix + +Table 3: The average scores of PSNR, SSIM and LPIPS for GRF and NeRF on four novel scenes of Synthetic-NeRF in Group 1&2. + +
PSNR↑ SSIM↑LPIPS↓
GRF (Group 1) 13.62 0.763 0.246
NeRF(Group 2, 100 iters) 15.15 0.752 0.359 NeRF(Group 2,1k iters) 19.81 0.809 0.228 NeRF(Group 2,10k iters) 23.35 0.875 0.137
GRF (Group 2, 100 iters) 19.69 0.835 0.169 GRF (Group 2, 1k iters) 22.00 0.876 0.128 GRF (Group 2,10k iters) 25.10 0.916 0.089
+ +els, thanks to the initially learned general features. Compared with the NeRF trained from scratch, the learned GRF significantly improves novel scene learning, achieving much better results given the same amount of training signals of new scenes. Figure 5 qualitatively shows the generalization of GRF and more results are presented in appendix. + +![](images/2b33473f8cad83e6fc6ade9aac3c829b58988eea96b3c91c1071bdc0382ad409.jpg) +Figure 5: Qualitative results of our GRF for novel scene generalization. + +4.3 EXPERIMENTS ON REAL-WORLD COMPLEX SCENES + +We evaluate the novel view synthesis on complex real-world scenes captured by cellphones. There are 8 scenes, 5 from LLFF (Mildenhall et al., 2019) and 3 from NeRF. Each scene has 20 to 62 images, 1/8 of which for testing. All images have high resolution of $1 0 0 8 \times 7 5 6$ pixels. + +Single-scene Learning. We train a single model for each real-world scene, following the same experimental settings of NeRF. Table 4 compares the quantitative results. Note that, the recent + +Table 4: Comparison of the average PSNR, SSIM and LPIPS scores of our GRF, SRNs, LLFF and NeRF in the challenging real-world dataset for single-scene learning. + +
PSNR↑SSIM↑LPIPS↓
SRNs22.840.6680.378
LLFF24.130.7980.212
NeRF26.500.8110.250
GRF(Ours)26.640.8370.178
+ +NSVF (Liu et al., 2020) is unable to process these forward-facing scenes because the predefined voxels cannot represent the unbounded 3D space. + +Analysis. Our method surpasses the state of the art by large margins, especially over the SSIM and LPIPS metrics. Compared with PSNR which only measures the average per-pixel accuracy, the metrics SSIM and LPIPS favor high quality of photorealism, highlighting the superiority of our GRF to generate truly realistic images. Figure 6 shows the qualitative results. As highlighted by the red circles, our GRF can generate fine-grained and natural geometries in pixel level, while NeRF produces many artifacts. This clearly demonstrates our GRF indeed learns general and precise pixel features from the observed 2D images for 3D scene representation and rendering. + +Compared with Synthetic-NeRF, this dataset is much harder because of the complicated geometries and the inaccuracy of estimated camera poses. Therefore, it is non-trivial to conduct real-world experiments for novel-scene generalization or large-scale scene reconstruction on ScanNet (Dai et al., 2017) or “Tanks and Temples” (Knapitsch et al., 2017). We leave these for future exploration. + +![](images/d2dd827b02e584e3f576cc7940a4fd39cb69b473fd797cdb28c8a8cf51466e19.jpg) +NeRF GRF (Ours) Ground Truth Figure 6: Qualitative results on Synthetic-NeRF (1st row) and real-world datasets (2nd row). + +# 4.4 ABLATION STUDY + +To evaluate the effectiveness of the key components of our GRF, we conduct 3 groups of ablation experiments on the car category in ShapeNetv2 dataset. In particular, we train on the entire training split then randomly select 500 objects from the training split for testing. During testing, the model infers 50 novel views for each of these 500 objects for evaluation. Basically, this setting is similar to the experiment of Group 1 in Section 4.1. + +Table 5: The average scores of PSNR and SSIM for ablated GRF in the subset of car category. + +
PSNR↑SSIM↑
(1)Remove Input Viewpoints20.130.807
(2) Remove Pixel Local Features20.230.818
(3) Replace Attention by Maxpool24.880.914
(4) The Full Model27.160.942
+ +• Group 1: The viewpoints of the input images are removed from the CNN module. The CNN module is not explicitly aware of the relative position of the pixel features. • Group 2: The decoder of the CNN module is removed and each input image is encoded as a global feature vector. For any 3D query point which is rightly projected into the image boundary, that global feature vector is retrieved and reprojected to the query point. Fundamentally, this modified CNN module can be regarded as a hyper-network that learns a conditional embedding from input images and then feed it into NeRF, but it sacrifices the precise pixel local features. • Group 3: The advanced attention module is replaced by max-pooling to aggregate the pixel features, aiming to investigate how the visual occlusion can be better addressed using soft attention. • Group 4: The full model is trained and tested with the same settings for comparison. + +Analysis. Table 5 compares the performance of all ablated models. We can see that: 1) The greatest impact is caused by the removal of image viewpoints from the CNN module and the lack of local pixel features to represent 3D points. It highlights that obtaining the position-aware and precise pixel features is crucial to represent 3D scenes from 2D images, while learning a simple hyper-network for NeRF cannot achieve comparable performance. 2) Using max-pooling to select the reprojected pixel features is sub-optimal to address the visual occlusions from different viewing angles. + +To further investigate the attention module, the maximal attention scores are retrieved and visualized (detailed in appendix). It shows that the attention module can truly drive the network to focus on the visible pixel local features among the multiple intersected light rays. We also conduct additional ablation experiments (detailed in appendix), demonstrating that our GRF can indeed generalize well to novel scenes with severe visual occlusions and is robust to a variable number of input images. + +# 5 CONCLUSION + +The proposed method models complex 3D scenes as a general radiance field. We demonstrated that it can learn general and robust 3D point features from a set of 2D observations. By using the principle of multi-view geometry to precisely map 2D pixel features back to 3D space and leveraging the attention mechanism to implicitly address the visual occlusions, our GRF can synthesize truly realistic 2D novel views. However, there are still limitations that lead to the future work. (1) More advanced CNN modules can be designed to learn better pixel features. (2) Depth scans can be integrated into the network to explicitly address visual occlusions. + +# REFERENCES + +Matan Atzmon and Yaron Lipman. SAL: Sign Agnostic Learning of Shapes from Raw Data. IEEE Conference on Computer Vision and Pattern Recognition, 2020a. + +Matan Atzmon and Yaron Lipman. SALD: Sign Agnostic Learning with Derivatives. arXiv, 2020b. + +Cesar Cadena, Luca Carlone, Henry Carrillo, Yasir Latif, Davide Scaramuzza, Jose Neira, Ian D. Reid, and John J. Leonard. Past, Present, and Future of Simultaneous Localization and Mapping: Towards the Robust-Perception Age. IEEE Transactions on Robotics, 32(6):1309–1332, 2016. + +Wenzheng Chen, Jun Gao, Huan Ling, Edward J. Smith, Jaakko Lehtinen, Alec Jacobson, and Sanja Fidler. Learning to Predict 3D Objects with an Interpolation-based Differentiable Renderer. Advances in Neural Information Processing Systems, pp. 9609–9619, 2019. + +Christopher B. Choy, Danfei Xu, JunYoung Gwak, Kevin Chen, and Silvio Savarese. 3D-R2N2: A Unified Approach for Single and Multi-view 3D Object Reconstruction. European Conference on Computer Vision, pp. 628–644, 2016. + +H Christian, Shubham Tulsiani, and Jitendra Malik. Hierarchical Surface Prediction for 3D Object Reconstruction. International Conference on 3D Vision, pp. 412–420, 2017. + +Angela Dai, Angel X. Chang, Manolis Savva, Maciej Halber, Thomas Funkhouser, and Matthias Nießner. ScanNet: Richly-annotated 3D Reconstructions of Indoor Scenes. IEEE Conference on Computer Vision and Pattern Recognition, pp. 5828–5839, 2017. + +S.M. Ali Eslami, Danilo Jimenez Rezende, Frederic Besse, Fabio Viola, Ari S. Morcos, Marta Garnelo, Avraham Ruderman, Andrei A. Rusu, Ivo Danihelka, Karol Gregor, David P. Reichert, Lars Buesing, Theophane Weber, Oriol Vinyals, Dan Rosenbaum, Neil Rabinowitz, Helen King, Chloe Hillier, Matt Botvinick, Daan Wierstra, Koray Kavukcuoglu, and Demis Hassabis. Neural Scene Representation and Rendering. Science, 360(6394):1204–1210, 2018. + +Haoqiang Fan, Hao Su, and Leonidas Guibas. A Point Set Generation Network for 3D Object Reconstruction from a Single Image. IEEE Conference on Computer Vision and Pattern Recognition, pp. 605–613, 2017. + +A Tewari O Fried, J Thies V Sitzmann, S Lombardi K Sunkavalli, and R Martin-brualla T Simon J Saragih. State of the Art on Neural Rendering. Computer Graphics Forum, 39(2):701–727, 2020. + +Georgia Gkioxari, Jitendra Malik, and Justin Johnson. Mesh R-CNN. IEEE International Conference on Computer Vision, pp. 9785–9795, 2019. + +Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. Generative Adversarial Nets. Advances in Neural Information Processing Systems, pp. 2672–2680, 2014. + +Thibault Groueix, Matthew Fisher, Vladimir G Kim, Bryan C Russell, and Mathieu Aubry. A PapierMache Approach to Learning 3D Surface Generation. IEEE Conference on Computer Vision and Pattern Recognition, pp. 216–224, 2018. + +Richard Hartley and Andrew Zisserman. Multiple View Geometry in Computer Vision. Cambridge University Press, 2004. + +Eldar Insafutdinov and Alexey Dosovitskiy. Unsupervised Learning of Shape and Pose with Differentiable Point Clouds. Advances in Neural Information Processing Systems, pp. 2802–2812, 2018. + +James T. Kajiya and Brian P Von Herzen. Ray tracing volume densities. ACM SIGGRAPH Computer Graphics, 18(3), 1984. + +Hiroharu Kato, Yoshitaka Ushiku, and Tatsuya Harada. Neural 3D Mesh Renderer. IEEE Conference on Computer Vision and Pattern Recognition, pp. 3907–3916, 2018. + +Hiroharu Kato, Deniz Beker, Mihai Morariu, Takahiro Ando, Toru Matsuoka, Wadim Kehl, and Adrien Gaidon. Differentiable Rendering: A Survey. arXiv:2006.12057, 2020. + +Diederik P Kingma and Max Welling. Auto-Encoding Variational Bayes. International Conference on Learning Representations, 2014. + +Arno Knapitsch, Jaesik Park, Qian Yi Zhou, and Vladlen Koltun. Tanks and temples: Benchmarking large-scale scene reconstruction. ACM Transactions on Graphics, 36(4), 2017. ISSN 15577368. doi: 10.1145/3072959.3073599. + +Lingjie Liu, Jiatao Gu, Kyaw Zaw Lin, Tat-Seng Chua, and Christian Theobalt. Neural Sparse Voxel Fields. Advances in Neural Information Processing Systems, 2020. + +Shichen Liu, Tianye Li, Weikai Chen, and Hao Li. Soft Rasterizer: A Differentiable Renderer for Image-based 3D Reasoning. IEEE International Conference on Computer Vision, pp. 7708–7717, 2019a. + +Shichen Liu, Shunsuke Saito, Weikai Chen, and Hao Li. Learning to Infer Implicit Surfaces without 3D Supervision. Advances in Neural Information Processing Systems, pp. 8293–8304, 2019b. + +Francesco Locatello, Dirk Weissenborn, Thomas Unterthiner, Aravindh Mahendran, Georg Heigold, Jakob Uszkoreit, Alexey Dosovitskiy, and Thomas Kipf. Object-Centric Learning with Slot Attention. Advances in Neural Information Processing Systems, 2020. + +Stephen Lombardi, Tomas Simon, Jason Saragih, Gabriel Schwartz, Andreas Lehrmann, and Yaser Sheikh. Neural volumes: Learning dynamic renderable volumes from images. ACM Transactions on Graphics, 38(4), 2019. ISSN 15577368. doi: 10.1145/3306346.3323020. + +Ricardo Martin-Brualla, Noha Radwan, Mehdi S. M. Sajjadi, Jonathan T. Barron, Alexey Dosovitskiy, and Daniel Duckworth. NeRF in the Wild: Neural Radiance Fields for Unconstrained Photo Collections. arXiv:2008.02268, 2020. + +Lars Mescheder, Michael Oechsle, Michael Niemeyer, Sebastian Nowozin, and Andreas Geiger. Occupancy Networks: Learning 3D Reconstruction in Function Space. IEEE Conference on Computer Vision and Pattern Recognition, pp. 4455–4465, 2019. + +Ben Mildenhall, Pratul Srinivasan, Rodrigo Ortiz-Cayon, Nima Khademi Kalantari, Ravi Ramamoorthi, Ren Ng, and Abhishek Kar. Local light field fusion: Practical view synthesis with prescriptive sampling guidelines. SIGGRAPH, 2019. + +Ben Mildenhall, Pratul P. Srinivasan, Matthew Tancik, Jonathan T Barron, Ravi Ramamoorthi, and Ren Ng. NeRF: Representing Scenes as Neural Radiance Fields for View Synthesis. European Conference on Computer Vision, 2020. + +Charlie Nash, Yaroslav Ganin, S. M. Ali Eslami, and Peter W. Battaglia. PolyGen: An Autoregressive Generative Model of 3D Meshes. International Conference on Machine Learning, 2020. + +Michael Niemeyer, Lars Mescheder, Michael Oechsle, and Andreas Geiger. Differentiable Volumetric Rendering: Learning Implicit 3D Representations without 3D Supervision. IEEE Conference on Computer Vision and Pattern Recognition, pp. 3504–3515, 2020. + +Aaron van den Oord, Nal Kalchbrenner, Oriol Vinyals, Lasse Espeholt, Alex Graves, and Koray Kavukcuoglu. Conditional Image Generation with PixelCNN Decoders. Advances in Neural Information Processing Systems, pp. 4790–4798, 2016. ISSN 10495258. + +Onur Ozyesil, Vladislav Voroninski, Ronen Basri, and Amit Singer. A Survey of Structure from Motion. Acta Numerica, 26:305–364, 2017. + +Jeong Joon Park, Peter Florence, Julian Straub, Richard Newcombe, and Steven Lovegrove. DeepSDF: Learning Continuous Signed Distance Functions for Shape Representation. IEEE Conference on Computer Vision and Pattern Recognition, pp. 165–174, 2019. + +Charles R. Qi, Hao Su, Kaichun Mo, and Leonidas J. Guibas. PointNet: Deep Learning on Point Sets for 3D Classification and Segmentation. IEEE Conference on Computer Vision and Pattern Recognition, pp. 652–660, 2017. + +Alec Radford, Luke Metz, and Soumith Chintala. Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks. International Conference on Learning Representations, 2016. + +Edoardo Remelli, Artem Lukoianov, Stephan R. Richter, Benoˆıt Guillard, Timur Bagautdinov, Pierre Baque, and Pascal Fua. MeshSDF: Differentiable Iso-Surface Extraction. arXiv:2006.03997, 2020. + +Danilo Jimenez Rezende, S. M. Ali Eslami, Shakir Mohamed, Peter Battaglia, Max Jaderberg, and Nicolas Heess. Unsupervised Learning of 3D Structure from Images. Advances in Neural Information Processing Systems, pp. 4996–5004, 2016. + +Gernot Riegler, Ali Osman Ulusoy, and Andreas Geiger. OctNet: Learning Deep 3D Representations at High Resolutions. IEEE Conference on Computer Vision and Pattern Recognition, pp. 3577– 3586, 2017. + +Shunsuke Saito, Zeng Huang, Ryota Natsume, Shigeo Morishima, Angjoo Kanazawa, and Hao Li. PIFu: Pixel-Aligned Implicit Function for High-Resolution Clothed Human Digitization. IEEE International Conference on Computer Vision, pp. 2304–2314, 2019. + +Katja Schwarz, Yiyi Liao, Michael Niemeyer, and Andreas Geiger. GRAF: Generative Radiance Fields for 3D-Aware Image Synthesis. arXiv:2007.02442, 2020. + +Vincent Sitzmann, Michael Zollhofer, and Gordon Wetzstein. Scene Representation Networks: Con- ¨ tinuous 3D-Structure-Aware Neural Scene Representations. Advances in Neural Information Processing Systems, pp. 1119–1130, 2019. + +Shuran Song, Fisher Yu, Andy Zeng, Angel X. Chang, Manolis Savva, and Thomas Funkhouser. Semantic Scene Completion from a Single Depth Image. IEEE Conference on Computer Vision and Pattern Recognition, pp. 1746–1754, 2017. + +Maxim Tatarchenko, Alexey Dosovitskiy, and Thomas Brox. Single-view to Multi-view: Reconstructing Unseen Views with a Convolutional Network. arXiv:1511.06702, 2015. + +Shubham Tulsiani, Tinghui Zhou, Alexei A. Efros, and Jitendra Malik. Multi-view Supervision for Single-view Reconstruction via Differentiable Ray Consistency. IEEE Conference on Computer Vision and Pattern Recognition, pp. 2626–2634, 2017. + +Shubham Tulsiani, Saurabh Gupta, David Fouhey, Alexei A. Efros, and Jitendra Malik. Factoring Shape, Pose, and Layout from the 2D Image of a 3D Scene. IEEE Conference on Computer Vision and Pattern Recognition, pp. 302–310, 2018. + +Nanyang Wang, Yinda Zhang, Zhuwen Li, Yanwei Fu, Wei Liu, and Yu-Gang Jiang. Pixel2Mesh: Generating 3D Mesh Models from Single RGB Images. European Conference on Computer Vision, pp. 52–67, 2018. + +Daniel E. Worrall, Stephan J. Garbin, Daniyar Turmukhambetov, and Gabriel J. Brostow. Interpretable transformations with encoder-decoder networks. IEEE International Conference on Computer Vision, pp. 5726–5735, 2017. + +Xinchen Yan, Jimei Yang, Ersin Yumer, Yijie Guo, and Honglak Lee. Perspective Transformer Nets: Learning Single-View 3D Object Reconstruction without 3D Supervision. Advances in Neural Information Processing Systems, pp. 1696–1704, 2016. + +Bo Yang, Stefano Rosa, Andrew Markham, Niki Trigoni, and Hongkai Wen. Dense 3D Object Reconstruction from a Single Depth View. IEEE Transactions on Pattern Analysis and Machine Intelligence, 41(12):2820 – 2834, 2019. + +Bo Yang, Sen Wang, Andrew Markham, and Niki Trigoni. Robust Attentional Aggregation of Deep Feature Sets for Multi-view 3D Reconstruction. International Journal of Computer Vision, 128: 53–73, 2020. + +Richard Zhang, Phillip Isola, Alexei A. Efros, Eli Shechtman, and Oliver Wang. The Unreasonable Effectiveness of Deep Features as a Perceptual Metric. IEEE Conference on Computer Vision and Pattern Recognition, pp. 586–595, 2018. + +# A APPENDIX + +A.1 DETAILS OF NETWORK ARCHITECTURE + +Table 6: The CNN Module for Experiments on ShapeNetv2 Dataset. + +
Type Size/Channels Activation Stride
Input: embedding of RGB and viewpoint
1 - 64 ReLU 2
Li: Conv 7 × 7 L2: Conv 3 × 3 128 ReLU 2
L3: Conv 3 × 3 256 ReLU 2
L4: Conv 3 × 3 512 ReLU 2
L5: Conv 4 × 4 128 ReLU 4
L6: Flatten /Tile - 1
L7: Concat (L6,L4) - 1
L8:Dilated Conv 3×3 256 ReLU 4
L8: Concat (L8,L3) 1 1 =
L9:Dilated Conv 3 × 3 128 ReLU 8
L9: Concat (L9,L2) = 一 =
L10: Dilated Conv 3 × 3 64 ReLU 16
L10: Concat (L10, L1) - ■ = L11: Dilated Conv 3 × 3 128 ReLU 32
+ +Table 7: The CNN Module for Experiments on Synthetic-NeRF Dataset. The average pooling is added to aggressively downsample the feature maps. + +
Type Size/Channels Activation Stride
Input: embedding of RGB and viewpoint - -
L1: Conv 7 × 7 64 ReLU 2
L2: Conv 3 × 3 128 ReLU 2
L3: Conv 3 × 3 256 ReLU 2
L4: Conv 3 × 3 512 ReLU 2
L4: AveragePooling 5 × 5
= =
L5: Conv 5 × 5 128 ReLU 5
L6:Flatten /Tile - 1
L7: Concat (L6,L4) 1 1
L8: Deconv 3× 3 256 ReLU 2
L8: Concat (L8, L3) 1 1
L9: Deonv 3 × 3 128 ReLU 2
L9: Concat (L9,L2) 1 1
L10: Deconv 3×3 64 ReLU 2
L10: Concat (L10,L1) - 1 L11: Deconv 3 × 3 128 ReLU 2
+ +Table 8: The CNN Module for Experiments on the real-world Dataset. The average pooling is added to aggressively downsample the feature maps. + +
Type Size/Channels Activation Stride
Input: embedding of RGB and viewpoint 1 1
L1: Conv 7 × 7 64 ReLU
22 L2: Conv 3 × 3 128 ReLU
L3: Conv 3 × 3 256 ReLU 2
L4: Conv 3 × 3 512 ReLU 2
L4: AveragePooling 8 × 8 1 =
L5: Conv 4 × 4 128 ReLU 4
L6: Flatten /Tile 1 1
L7: Concat (L6,L4) 1 1
L8: Deconv 3 × 3 256 ReLU 2
L8: Concat (L8,L3) - 1
L9: Deconv 3 × 3 128 ReLU
L9: Concat (L9,L2) 1 =
L10: Deconv 3×3 64 ReLU 2
L10: Concat (L10, L1) - =
L11: Deconv 3 × 3 128 ReLU 2
+ +Table 9: The Attention Module, AttSets (Yang et al., 2020), for Experiments on the ShapeNetv2 Dataset. The simple AttSets is computationally efficient and we choose it to train the large-scale ShapeNetv2 dataset. + +
TypeSize/Channels Activation
Input: Concat(K × 128,embedding of viewpoint)==
L1: fc256ReLU
L2: fc256ReLU
L3: fc256ReLU
L4: fc512ReLU
L5: fc512ReLU
L6: softmax(L5)11
L7: sum(L6*L5,axis=-2)11
L8: fc512ReLU
+ +We use Slot Attention as the pixel feature aggregation module for experiments on the SyntheticNeRF and real-world datasets. In particular, we use two slots, two iterations, and the hidden size is 128. The final output two slots are flattened and a 256 dimensional vector is obtained. For details of Slot Attention refer to the paper (Locatello et al., 2020). + +Details of the neural rendering layers and the volume rendering can be found in NeRF (Mildenhall et al., 2020). We set the positional embedding length $L = 5$ for all inputs to the CNN module, except the rotation, which we convert to quaternion and embed at $L = 4$ . + +During training, we feed the models between 2 and 6 views of each scene at each gradient step. We set the learning rate for the ShapeNetv2 models at 1e-4. We set the learning rate for leaves and orchids in the real-world dataset at 7e-5, and for the rest, we use 1e-4. For Synthetic-NeRF dataset, we use a learning rate of 1e-4. We use the Adam optimizer for all models, and train for $2 0 0 \mathbf { k } { - } 3 0 0 \mathbf { k }$ iterations. At each gradient step, we take 1000 rays for ShapeNetv2 with 32 coarse samples and 64 fine samples, and 800 rays for the real-world and Synthetic-NeRF datasets with 64 coarse samples and 192 fine samples. We train each model on a single Nvidia-V100 GPU with 32GB VRAM. + +During testing for the ShapeNetv2 reconstruction from 50 images, we feed the model the 5 closest views to the desired novel view by cosine similarity from the 50 training images. During testing for single-scene reconstruction, we feed the model the 4 closest views by cosine similarity to the desired novel view. + +# A.2 DETAILS OF EXPERIMENTAL RESULTS ON THE SYNTHETIC-NERF DATASET + +Table 10: Comparison of the PSNR (in dB), SSIM and LPIPS (Zhang et al., 2018) scores of our GRF, SRNs (Sitzmann et al., 2019), NV (Lombardi et al., 2019), NeRF (Mildenhall et al., 2020) and NSVF (Liu et al., 2020) in the Synthetic-NeRF dataset for single-scene learning. + +
ChairDrumsLegoMicMaterialsShipHotdogFicusMean
PSNR↑
SRNs26.9617.1820.8526.8518.0920.6026.8120.7322.26
NV28.3322.5826.0827.7824.2223.9330.7124.7926.05
NeRF33.0025.0132.5432.9129.6228.6536.1830.1331.01
NSVF33.1925.1832.2934.2732.6827.9337.1431.2331.74
GRF(Ours)34.5125.8332.9233.9430.9130.1237.4730.7532.06
SSIM↑
SRNs0.9100.7660.8090.9470.8080.7570.9230.8490.846
NV0.9160.8730.8800.9460.8880.7840.9440.9100.893
NeRF0.9670.9250.9610.9800.9490.8560.9740.9640.947
NSVF0.9680.9310.9600.9870.9730.8540.9800.9730.953
GRF(Ours)0.9810.9370.9670.9870.9630.8910.9830.9690.960
LPIPS↓
SRNs0.1060.2670.2000.0630.1740.2990.1000.1490.170
NV0.1090.2140.1750.1070.1300.2760.1090.1620.160
NeRF0.0460.0910.0500.0280.0630.2060.1210.0440.081
NSVF0.0430.0690.0290.0100.0210.1620.0250.0170.047
GRF(Ours)0.0210.0680.0420.0130.0410.1410.0280.0320.048
+ +Table 11: The PSNR, SSIM and LPIPS scores of our GRF simultaneously trained on 4 scenes of the Synthetic-NeRF dataset for multi-scene learning. The scores of SRNs, NeRF and NSVF trained on single scenes are included for comparison. + +
ChairMicShipHotdog
PSNR↑
SRNs (Single-scene)26.9626.8520.6026.81
NeRF (Single-scene)33.0032.9128.6536.18
NSVF (Single-scene)33.1934.2727.9337.14
GRF (Multi-scene)32.4932.0227.7634.92
SSIM↑
SRNs (Single-scene)0.9100.9470.7570.923
NeRF (Single-scene)0.9670.9800.8560.974
NSVF (Single-scene)0.9680.9870.8540.980
GRF (Multi-scene)0.9710.9820.8660.975
LPIPS↓
SRNs (Single-scene)0.1060.0630.2990.100
NeRF (Single-scene)0.0460.0280.2060.121
NSVF (Single-scene)0.0430.0100.1620.025
GRF (Multi-scene)0.0320.0190.1670.040
+ +Table 12: The PSNR, SSIM and LPIPS scores of our GRF and NeRF on four novel scenes of Synthetic-NeRF in Group 1&2 experiments. + +
Drums
Lego PSNR↑MaterialsFicus
GRF (Group 1) 13.23 13.5312.26 15.47 15.42 15.72
NeRF( F(Group2,100 iters) 14.54 14.9220.04 20.40 20.81
NeRF( (Group2,1k iters) 18.0119.81 23.36 23.47
NeRF (Group 2,10k iters) 21.57 24.9923.35
GRF (Group 2,100 iters) 18.70 20.2418.81 21.03 19.69
GRF (Group2,1k iters) 20.49 23.6421.87 22.02 22.00
GRF (Group2,10k iters) 23.11 27.0725.11 25.11 25.10
SSIM↑
F (Group 1) 0.7620.736 0.703 0.849
NeRF(Group 2,100 iters)0.769 0.717 0.716
NeRF(Group 2,1k iters) 0.793 0.7750.812 0.857 0.809 0.877 0.896 0.875
NeRF F(Group2,10k iters) 0.8650.862
GRF(Group 2,100 iters) 0.822 0.8130.829 0.878 0.835
GRF (Group2,1k iters) 0.8560.877 0.878 0.894 0.876 0.916
GRF F(Group2,10k iters) 0.9010.924 0.913 0.923
LPIPS↓
0.256 0.273 0.301 0.150
GRF (Group 1) NeRF(Group 2,100 iters)0.332 0.395 0.314
NeRF(Group 2,1k iters) 0.254 0.2640.393 0.359 0.229 0.164 0.228 0.137
NeRF (Group2,10k iters) 0.1570.154 0.128 0.110
GRF (Group 2,100 iters) 0.1960.203 0.159 0.117 0.169 0.128
GRF F(Group2,1k iters) 0.154 GRF (Group 2,10k iters) 0.1040.138 0.123 0.097 0.090 0.090 0.071
+ +A.3 DETAILS OF EXPERIMENTAL RESULTS ON THE REAL-WORLD DATASET + +Table 13: Comparison of the PSNR, SSIM and LPIPS scores of our GRF, SRNs (Sitzmann et al., 2019), LLFF (Mildenhall et al., 2019) and NeRF (Mildenhall et al., 2020) in the real-world dataset for single-scene learning. + +
RoomFernLeavesFortressOrchidsFlowerT-RexHornsMean
PSNR↑
SRNs27.2921.3718.2426.6317.3724.6322.8724.3322.84
LLFF28.4222.8519.5229.4018.5225.4624.1524.7024.13
NeRF32.7025.1720.9231.1620.3627.4026.8027.4526.50
GRF(Ours)31.7425.7221.1631.2820.8827.8327.0127.5026.64
SSIM↑
SRNs0.8830.6110.5200.6410.4490.7380.7610.7420.668
LLFF0.9320.7530.6970.8720.5880.8440.8570.8400.798
NeRF0.9480.7920.6900.8810.6410.8270.8800.8280.811
GRF(Ours)0.9510.8270.7270.8980.6670.8520.9010.8730.837
LPIPS↓
SRNs0.2400.4590.4400.4530.4670.2880.2980.3760.378
LLFF0.1550.2470.2160.1730.3130.1740.2220.1930.212
NeRF0.1780.2800.3160.1710.3210.2190.2490.2680.250
GRF(Ours)0.1040.1910.2380.1270.2750.1760.1460.1690.178
+ +# A.4 ANALYSIS OF ATTENTION MECHANISM(Generalizat + +The attention mechanism in our GRF aims to automatically select the correct pixel patch from multiple pixel patches where the light rays intersect at the same query 3D point in space. + +In order to investigate how the attention mechanism learns to select the useful information, we retrieve the maximal attention score from the observed multiple pixel patches for analysis. Intuitively, the higher the attention score is assigned to a particular pixel patch, the more important that patch for inferring the novel pixel RGB. In particular, we conduct the following experiment using our GRF model trained on ShapeNetv2 Cars. In this case, the AttSets attention module is used (details are in Table 9). Given a query light ray, multiple 3D points are sampled to query the network. + +We firstly try to find the 3D point which is near the surface according to the predicted volume density for points along the ray through a given pixel, if they exist. Otherwise, we ignore such pixels, making them white. +Then we compute the M feature vectors from the input M views for these surface points. Thirdly, the attention masks for those M feature vectors are computed. We identify the view whose sum of the attention mask along the feature axis is greatest as the main contributor for inferring the novel pixel RGB. +After querying light rays for each pixel, we obtain a rendered RGB image. At the same time, for each pixel of that image, we select the most important view from the M input views for the surfaceintersection point along the ray from the viewpoint through that pixel, according to the maximal attention score. Eventually, we obtain a Max Attention Map corresponding to the rendered RGB image. + +Figure 7 shows the qualitative results of the above experiment. In particular, we feed the three images (#1,#2,#3) of an unseen car into our GRF model which is well-trained on car category, and then render a new image (e.g., the 5th image in Figure 7). Note that, we carefully select the input 3 images and the rendered image with very large viewing baselines. In the mean time, we obtain and visualize the Max Attention Map corresponding to the rendered image. + +For each pixel of the rendered image, we retrieve the input image pixel that has the highest attention score. Specifically, the rendered pixels with purple color correspond to the input image #1, the green pixels correspond to the input image #2, while the blue pixels correspond to the input image #3. + +Analysis. It can be seen that, when inferring a new image, the attention module of our GRF focuses on the most informative pixel patch from the multiple input pixel patches. In addition, it is able to truly deal with the visual occlusion. For example, when inferring the windshield of the car, the attention module focuses on the input image #2 where the windshield is visible, while ignoring the image #1 and #3 where the windshield is self-occluded. + +![](images/20f93eecb76196ee8f164adc09b398e9f5dbb82c10a34c1453af75819e8f5736.jpg) +Figure 7: Visualization of Max Attention Map from Multiple Input Images of a Novel Object for Inferring a Novel View. + +A.5 GENERALIZATION TO VISUAL OCCLUSIONS AND VARIABLE INPUT IMAGES + +We carefully select the attention module, i.e., either AttSets or SlotAtt, to aggregate the features from an arbitrary number of input views. In order to evaluate how our GRF is able to generalize with a variable number of input views, especially when there is a very sparse number of views with severe visual occlusions, we conduct the following four groups of experiments. + +• 1-view Reconstruction. We feed the a single image of a novel car into our GRF model which is well-trained on car category (trained with 5 images per object), and then render 9 new images from vastly different viewing angles. This is the extreme case where the majority of the object is self-occluded. + +• 2-view Reconstruction. Similarly, we feed only two images of the novel car into the same model and render the same 9 novel views. In this case, more information is given to the network, but there are still many parts occluded. + +• 5-view / 10-view Reconstruction. The same GRF model is fed with 5 and 10 views of the novel object, rendering the same set of new images. + +Analysis. Figure 8 shows the qualitative results. It can be seen that: 1) In the extreme case, i.e., 1-view reconstruction, our GRF is still able to recover the general 3D shape of the unseen object, including the visually occluded parts, primarily because our CNN model learns the hierarchical features including the high-level shapes. 2) Given more input views, the originally occluded parts tend to be observed from some viewing angles, and then these parts can be reconstructed better and better. This shows that our GRF is indeed able to effectively identify the corresponding useful pixel features for more accurately recovering shape and appearance. + +![](images/452fb2908ba7c814b8da50727c0309cbd16427f8d4f7072fd5be8f665d791d99.jpg) +Figure 8: Qualitative results of our GRF when being fed with a variable number of views of a novel object. The red circle highlights that the tail of the car is able to be recovered given more visual cues from more input images. + +![](images/5e585a9c6f55e0f762c826bccc3ad70554c0e9a9023da31e86706efd23ce1569.jpg) +Figure 9: Qualitative results of SRNs and our GRF for 50-view reconstruction of chairs and cars. + +![](images/720b1b3f0a109fae40aade5f250bbe18fc1e9ff6bc9faf69eda08923c27ddadc.jpg) +Figure 10: Qualitative results of our GRF for novel view depth and RGB estimation on the SyntheticNeRF dataset. + +![](images/cadef3a36c5e380d2f99cc5b827f2e4ca75d2c8175fcc3a245639772f579210d.jpg) +Figure 11: Qualitative results of our GRF for novel view depth and RGB estimation on the SyntheticNeRF dataset. + +![](images/453a93119d60769e89c2b0a65f9b43d42efc589faba79975733f9e58b7782c58.jpg) +Figure 12: Qualitative results of our GRF for novel view depth and RGB estimation on the SyntheticNeRF dataset. + +![](images/beeb4046890bf5004b0f81769e12fa68b175541b587410c51e428be01d998227.jpg) +Figure 13: Qualitative results of our GRF for novel view depth and RGB estimation on the SyntheticNeRF dataset. + +![](images/f8157646fde3d77d5203c0f15aa9ddd82767ee191425ac2129cfeb332f153e56.jpg) +Figure 14: Qualitative results of our GRF for novel view depth and RGB estimation on the real-world dataset. + +![](images/88f1544d6d632c9c8a99ef63ec61bd9fd14e5db337eb9260544d7c69beee1ad9.jpg) +Figure 15: Qualitative results of our GRF for novel view depth and RGB estimation on the real-world dataset. + +![](images/caf80e9622eb47880990dde4703304c939c21246832958437a9bef0ab4ca34d0.jpg) +Figure 16: Qualitative results of our GRF for novel view depth and RGB estimation on the real-world dataset. + +![](images/e60781d9d56ccf57a254173588c4ff5552b76267158d5a3703af27473667497f.jpg) +Figure 17: Qualitative results of our GRF for novel view depth and RGB estimation on the real-world dataset. \ No newline at end of file diff --git a/parse/train/cAvgPMAA3hb/cAvgPMAA3hb_content_list.json b/parse/train/cAvgPMAA3hb/cAvgPMAA3hb_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..6f9593425573b9d584febaabebb074eba3654a0a --- /dev/null +++ b/parse/train/cAvgPMAA3hb/cAvgPMAA3hb_content_list.json @@ -0,0 +1,2177 @@ +[ + { + "type": "text", + "text": "GRF: LEARNING A GENERAL RADIANCE FIELD FOR 3D SCENE REPRESENTATION AND RENDERING ", + "text_level": 1, + "bbox": [ + 176, + 98, + 821, + 146 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Anonymous authors Paper under double-blind review ", + "bbox": [ + 184, + 170, + 400, + 198 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 234, + 544, + 251 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "We present a simple yet powerful implicit neural function that can represent and render arbitrarily complex 3D scenes in a single network only from 2D observations. The function models 3D scenes as a general radiance field, which takes a set of 2D images with camera poses and intrinsics as input, constructs an internal representation for each 3D point of the scene, and renders the corresponding appearance and geometry of any 3D point viewing from an arbitrary angle. The key to our approach is to explicitly integrate the principle of multi-view geometry to obtain the internal representations from observed 2D views, such that the learned implicit representations empirically remain multi-view consistent. In addition, we introduce an effective neural module to learn general features for each pixel in 2D images, allowing the constructed internal 3D representations to be general as well. Extensive experiments demonstrate the superiority of our approach. ", + "bbox": [ + 233, + 260, + 764, + 428 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 455, + 336, + 472 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Understanding the precise 3D structure of a real-world environment and realistically re-rendering it from free viewpoints is a key enabler for many critical tasks, ranging from robotic manipulation and navigation to augmented reality. Classic approaches to recover the 3D scene geometry mainly include the structure from motion (SfM) (Ozyesil et al., 2017) and simultaneous localization and mapping (SLAM) (Cadena et al., 2016) pipelines. However, they are limited to reconstruct sparse and discrete 3D point clouds which are unable to contain geometric details. ", + "bbox": [ + 174, + 491, + 825, + 574 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The recent advances in deep neural networks have yielded rapid progress in 3D modeling and understanding. Most of them focus on the explicit 3D shape representations such as voxel grids (Choy et al., 2016), point clouds (Fan et al., 2017), or triangle meshes (Wang et al., 2018). However, these representations are discrete and sparse, limiting the recovered 3D structures to extremely low spatial resolution. In addition, these networks usually require large-scale 3D shapes for supervision, resulting in the trained models being over-fitting particular datasets and unable to generalize to novel scenes. In fact, it is also costly and even infeasible to collect high-quality 3D labels. ", + "bbox": [ + 174, + 582, + 825, + 679 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Encoding geometries into multilayer perceptrons (MLPs) (Mescheder et al., 2019; Park et al., 2019) recently emerges as a promising direction in 3D reconstruction and understanding from 2D images. Its key advantage is the ability to model 3D structures in a continuous way instead of discrete, and therefore it has the potential to achieve unlimited spatial resolution in theory. However, most methods of this pipeline focus on individual objects. In addition, many of them require 3D geometry for supervision to learn the 3D shapes from images. By introducing a recurrent neural network based renderer, SRNs (Sitzmann et al., 2019) is among the early work to learn implicit surface representations only from 2D images, but it fails to capture complicated scene geometries and renders over-smoothed images. Alternatively, by leveraging the volume rendering to synthesize new views for 2D supervision, the very recent NeRF (Mildenhall et al., 2020) directly encodes the radiance fields of complex 3D scenes within the weights of MLPs, achieving an unprecedented level of fidelity for challenging 3D scenes. Nevertheless, it has two major limitations: 1) since each 3D scene is encoded into all the weights of MLPs, the trained network (i.e., a learned radiance field) can only represent a single scene, and is unable to generalize across novel scenarios; 2) because the shape and appearance of each spatial 3D location along a light ray is only optimized by the available pixel RGBs, the learned implicit representations of that location are lack of the general geometric patterns, resulting in the synthesized images being less photo-realistic. ", + "bbox": [ + 173, + 685, + 825, + 924 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In this paper, we propose a general radiance field (GRF), a simple yet powerful implicit function that can represent and render complex 3D scenes where there may be multiple objects with cluttered background. Our GRF takes a set of 2D images with camera poses and intrinsics, a 3D query point and its query viewpoint (i.e., the camera location $x y z )$ as input, and predicts the RGB value and volumetric density of that query point. Basically, this neural function learns to represent a 3D scene from sparse 2D observations, and infers the shape and appearance of that scene from previously unobserved viewing angles. Note that, the inferred shape and appearance of any particular 3D query point explicitly take into account its local geometric patterns from the available 2D observations. In particular, the proposed GRF consists of four components: ", + "bbox": [ + 173, + 103, + 825, + 233 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "• Extracting the general 2D visual features for every light ray from the input 2D observations; \n• Reprojecting the corresponding 2D features back to the query 3D point using the principle of multi-view geometry; \n• Selecting and aggregating all the reprojected features for the query 3D point, while the visual occlusions are implicitly considered; \n• Rendering the aggregated features of the query 3D point along a particular query viewpoint, and producing the corresponding RGB and volumetric density. ", + "bbox": [ + 173, + 238, + 825, + 348 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "These four components enable our GRF to be significantly different from all existing 3D scene representation approaches. 1) Compared with the classic SfM/SLAM systems, our GRF can represent the 3D scene structure with smooth and continuous surfaces. 2) Compared with the neural approaches based on explicit voxel grids, point clouds and meshes, our GRF learns continuous 3D representations without requiring 3D data for training. 3) Compared with the existing implicit representation methods such as SDF (Park et al., 2019), SRNs (Sitzmann et al., 2019) and NeRF (Mildenhall et al., 2020), our GRF can represent arbitrarily complicated 3D scenes and has remarkable generalization to novel scenarios. In addition, the learned 3D representations carefully consider the general geometric patterns for every 3D spatial location, allowing the rendered views to be exceptionally realistic with fine-grained details. Our key contributions are: ", + "bbox": [ + 173, + 354, + 825, + 493 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "• We propose a general radiance field to implicitly represent the 3D scene structure and appearance purely from 2D images. It has remarkable generalization to novel scenes in a single forward pass. • We explicitly integrate the principle of multi-view geometry to learn geometric details for each 3D query point along every query light ray. This allows the synthesized 2D views to be superior. • We demonstrate significant improvement over baselines on three large-scale datasets and provide intuition behind our design choices through extensive ablation studies. ", + "bbox": [ + 173, + 500, + 825, + 592 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 617, + 344, + 633 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Classic Multi-view Geometry. Classic approaches to reconstruct 3D geometry from images mainly include SfM and SLAM systems, which firstly extract and match hand-crafted geometric local features and then apply bundle adjustment for both shape and camera motion estimation (Hartley & Zisserman, 2004). Although they can recover visually satisfactory 3D models, the reconstructed shapes are usually sparse, discrete point clouds. In contrast, our GRF learns an implicit function to represent the continuous 3D structures from images. Notably, however, the principle of classic multi-view geometry is explicitly integrated into our GRF to learn accurate and general features for every spatial location. ", + "bbox": [ + 173, + 652, + 825, + 763 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Geometric Deep Learning. The recent advances of deep neural nets have yielded impressive progress in recovering explicit 3D shapes from either single or multiple images, including the voxel grid (Choy et al., 2016; Yang et al., 2019), octree (Riegler et al., 2017; Christian et al., 2017), point cloud (Fan et al., 2017; Qi et al., 2017) and triangle mesh (Wang et al., 2018; Groueix et al., 2018; Nash et al., 2020) based approaches. However, most of these methods only focus on individual 3D objects, whilst only few pipelines (Song et al., 2017; Tulsiani et al., 2018; Gkioxari et al., 2019) attempt to learn the structures for complex 3D scenes. Although these neural networks can predict realistic 3D structures of objects and scenes, they have two limitations. First, almost all of them require ground truth 3D labels to supervise the networks, resulting in the learned representations being unable to generalize to novel real-world scenes. Second, since the recovered 3D shapes are discrete, they are unable to preserve high-resolution geometric details. Being quite different, our GRF learns to infer continuous 3D shapes only from a set of 2D images with camera poses and intrinsics, which can be cheaply acquired and also allow better generalization across real-world scenes. ", + "bbox": [ + 173, + 770, + 825, + 924 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Neural Implicit 3D Representations. The implicit representation of 3D shapes recently emerges as a promising direction to recover 3D geometries. It is initially formulated as level sets by optimizing neural nets which map xyz locations to an occupancy field (Mescheder et al., 2019; Saito et al., 2019) or a distance function (Park et al., 2019). The subsequent work (Niemeyer et al., 2020; Sitzmann et al., 2019; Liu et al., 2019b; Atzmon & Lipman, 2020a;b) introduce differentiable rendering functions, allowing 2D images or raw 3D point clouds to supervise the networks, but only producing decent results on individual objects. Using neural radiance fields instead, the latest NeRF (Mildenhall et al., 2020) and the succeeding NSVF (Liu et al., 2020), NeRF-wild (Martin-Brualla et al., 2020), GRAF (Schwarz et al., 2020) demonstrate impressive results to represent complex 3D scenes. However, they do not take into account the local geometric patterns for spatial locations, thereby the rendered 2D images being less realistic and sub-optimal. Additionally, both NeRF and NeRF-wild can only represent a single scene, and are unable to generalize to novel scenarios. Uniquely, our GRF maps any set of images to the corresponding 3D scene structure with geometric details. ", + "bbox": [ + 173, + 138, + 825, + 335 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Novel View Synthesis and Neural Rendering. Novel view synthesis involves generating unseen views of a scene captured by multiple images. Existing methods usually learn an embedding of a scene and then estimate a new image given a viewing angle, including GAN based methods (Goodfellow et al., 2014; Radford et al., 2016), variational auto-encoders (Kingma & Welling, 2014), autoregressive models (Oord et al., 2016), and other generative frameworks (Eslami et al., 2018). Although photo-realistic single images can be generated, these methods tend to learn the manifold of 2D images, instead of exploiting the underlying 3D geometry for consistent multi-view synthesis. ", + "bbox": [ + 173, + 343, + 825, + 441 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Neural rendering techniques (Fried et al., 2020; Kato et al., 2020) have recently been actively investigated and integrated into 3D reconstruction pipelines, where there are no ground truth 3D data available but only 2D images for supervision. To render the discrete voxel grids (Yan et al., 2016; Rezende et al., 2016; Tulsiani et al., 2017), point clouds (Insafutdinov & Dosovitskiy, 2018), meshes (Kato et al., 2018; Chen et al., 2019; Liu et al., 2019a), and implicit surfaces (Liu et al., 2019b; Remelli et al., 2020), most of these techniques are designed with differentiable and approximate functions, but sacrifice the sharpness of synthesized images and the accuracy of estimated 3D shapes. By contrast, our GRF leverages the existing volume rendering method (Mildenhall et al., 2020) which is naturally differentiable and can accurately render the RGB per light ray. ", + "bbox": [ + 173, + 446, + 825, + 573 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 GRF ", + "text_level": 1, + "bbox": [ + 176, + 594, + 246, + 611 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.1 OVERVIEW ", + "text_level": 1, + "bbox": [ + 174, + 628, + 290, + 643 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Our GRF models the complex 3D scenes including the geometry and appearance as a neural function $f _ { \\mathbf { W } }$ where W represent learnable parameters. This function takes a set of $M$ images together with their camera poses and intrinsics $\\{ ( \\mathcal { T } _ { 1 } , \\pmb { \\xi } _ { 1 } , \\pmb { K } _ { 1 } ) \\cdot \\cdot \\cdot ( \\mathcal { T } _ { m } , \\pmb { \\xi } _ { m } , \\pmb { K } _ { m } ) \\cdot \\cdot \\cdot ( \\mathcal { T } _ { M } , \\pmb { \\xi } _ { M } , \\pmb { K } _ { M } ) \\} _ { \\{ \\pmb { \\xi } _ { 1 } , \\pmb { \\xi } _ { 1 } , \\pmb { K } _ { 1 } \\} }$ , which are sampled from a complex 3D scene, a query 3D point $p = \\{ x _ { p } , y _ { p } , z _ { p } \\}$ , and its query viewpoint $\\mathcal { V } _ { p } = \\{ x _ { p } ^ { v } , y _ { p } ^ { v } , z _ { p } ^ { v } \\}$ as input, and then predicts the RGB value $\\{ r _ { p } , g _ { p } , b _ { p } \\}$ and the volumetric density $d _ { p }$ of that query 3D point $p$ observed from the query viewpoint $\\gamma _ { p }$ . Formally, it is defined as below: ", + "bbox": [ + 173, + 655, + 825, + 739 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/5d3c6c72c009754a82db30af933402975893bbbecaaa520ff95b6877dfab572f.jpg", + "text": "$$\n( r _ { p } , g _ { p } , b _ { p } , d _ { p } ) = f _ { \\mathbf { W } } \\left( \\Big \\{ ( \\mathcal { T } _ { 1 } , \\pmb { \\xi } _ { 1 } , K _ { 1 } ) \\cdot \\cdot \\cdot ( \\mathcal { T } _ { M } , \\pmb { \\xi } _ { M } , K _ { M } ) \\Big \\} , \\{ x _ { p } , y _ { p } , z _ { p } \\} , \\{ x _ { p } ^ { v } , y _ { p } ^ { v } , z _ { p } ^ { v } \\} \\right)\n$$", + "text_format": "latex", + "bbox": [ + 197, + 739, + 777, + 775 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Basically, this function is a general radiance field (GRF) which parameterizes arbitrary 3D scenes observed by the input $M$ images. In the meantime, it returns both the appearance and geometry, when being queried at any location $p$ from any viewpoint $\\nu$ in 3D space. ", + "bbox": [ + 176, + 773, + 825, + 814 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "As illustrated in Figure 1, the proposed GRF firstly extracts general features for each light ray hitting through every pixel, and then reprojects those features back to the query 3D point $p$ . After that, the corresponding RGB value and volumetric density of $p$ are inferred from those features given a specific query viewpoint. This simple design of GRF follows the principle of classic multi-view geometry (Hartley & Zisserman, 2004), therefore driving the learned implicit representations to be multi-view consistent. In particular, for any query 3D point in space, its features are always the same when being viewing from different angles. Hence, its rendered RGBs and volumetric densities are more likely to be consistent from different viewpoints. To realize our neural function $f _ { \\mathbf { W } }$ , we introduce four components: 1) A feature extractor for every 2D pixel; 2) A reprojector to transform 2D features to 3D space; 3) An aggregator to obtain general features for a 3D point; and 4) A neural renderer to infer the appearance and geometry for that 3D point. All these components are connected and trained end-to-end with arbitrary scenes. ", + "bbox": [ + 173, + 820, + 825, + 924 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/56d1944f4d23a0a0a15e2089b674d2311f3342f1b49f441d770342b7eecce36d.jpg", + "image_caption": [ + "Figure 1: Overview of the proposed general radiance field. " + ], + "image_footnote": [], + "bbox": [ + 338, + 99, + 661, + 220 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 251, + 826, + 320 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.2 EXTRACTING GENERAL FEATURES FOR 2D PIXELS ", + "text_level": 1, + "bbox": [ + 174, + 339, + 570, + 354 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The whole input set of observed 2D images together describes the geometry and appearance of a 3D scene, while each pixel of those images describes a specific point of that scene. This module aims to extract the general features of each pixel, so to learn the regional description and geometric patterns for each light ray. A naive approach is to directly use the raw rgb values as the pixel features. However, this is sub-optimal because the raw rgb values are sensitive to lighting conditions, environmental noise, etc. In order to learn more general and robust patterns for each pixel, we turn to use a more powerful encoder-decoder based convolutional neural network (CNN). As shown in Figure 2, our CNN module is designed with the follow two features: ", + "bbox": [ + 174, + 366, + 549, + 506 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/b2e9605ba008f372de37a5ed751410ac325144fee0bb3ce35aceec07022d20bd.jpg", + "image_caption": [ + "Figure 2: The CNN module to extract pixel features. " + ], + "image_footnote": [], + "bbox": [ + 566, + 372, + 823, + 465 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 506, + 823, + 534 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "• Instead of directly feeding raw RGB images into the CNN module, we stack (duplicate) the corresponding viewpoint, i.e., the xyz location of the camera, to each pixel of the image. This allows the learned pixel features to be explicitly aware of its relative position in the 3D scene space. Note that, we empirically find that stacking the additional camera rotation and intrinsics to each pixel does not noticeably improve the performance, especially for scenes centered at the origin. • We use skip connections between the encoder and decoder to preserve high frequency local features for each pixel, while optionally integrating a couple of fully connected (fc) layers in the middle of the CNN module to learn global features. The mixture of hierarchical features tends to to be more general and representative, effectively aiding the network in practice. ", + "bbox": [ + 173, + 540, + 825, + 676 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Details of the CNN module is presented in the appendix and all input images share the same CNN module. Note that, there are many ways to construct a pixel feature extractor, but identifying an optimal CNN module here is out the scope of this paper. ", + "bbox": [ + 174, + 683, + 825, + 726 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.3 REPROJECTING 2D FEATURES TO 3D SPACE ", + "text_level": 1, + "bbox": [ + 174, + 744, + 521, + 758 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Considering the extracted pixel features are a compact description of the light ray emitting from the camera center up to the 3D scene surface, we naturally reproject the pixel features back to the 3D space along the light ray. Since there are no depth scans paired with RGB images, it is impossible to determine which particular 3D surface point the pixel features belong to. In this module, we preliminarily regard the pixel features as the representation of every location along the light ray in 3D space. With this simple formulation, every 3D point can theoretically have a copy of its corresponding 2D pixel features from each 2D image. Formally, given a 3D point $p$ , an observed 2D view $\\mathcal { I } _ { m }$ together with the camera pose $\\xi _ { m }$ and the intrinsics $K _ { m }$ , the corresponding 2D pixel features $\\mathbf { F } _ { p } ^ { m }$ is retrieved by the reprojection operation below: ", + "bbox": [ + 173, + 771, + 825, + 897 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/93bd6c5f152edf53249bcebd35c1b2f68cdf40f352ed334374b867c5c5628be1.jpg", + "text": "$$\n\\mathbf { F } _ { p } ^ { m } = \\mathcal { P } \\Big ( \\{ \\boldsymbol { \\mathcal { T } } _ { k } , \\boldsymbol { \\xi } _ { m } , K _ { m } \\} , \\{ x _ { p } , y _ { p } , z _ { p } \\} , \\mathbf { I } _ { m } \\Big )\n$$", + "text_format": "latex", + "bbox": [ + 349, + 897, + 645, + 924 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where the function $\\mathcal { P } ( )$ follows the principle of multi-view geometry (Hartley & Zisserman, 2004) and ${ \\mathbf I } _ { m }$ represents the image features extracted by the CNN module in Section 3.2. However, since the pixels of 2D images are discrete and bounded within a certain spatial size, while the 3D points are continuous in the scene space, after the 3D point $p$ is projected to the plane of image $\\mathcal { T } _ { m }$ , we apply two approximations to deal with the following issues. ", + "bbox": [ + 173, + 103, + 825, + 174 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "• If the point lies inside of the image, we simply select the nearest pixel and duplicate its features to the 3D point. Note that, more advanced techniques may be applied to address the discretization issue, such as linear interpolation or designing a kernel function. • If the point lies outside of the image, we assign a zero vector to the 3D point, which means there is no information observed. In fact, we empirically find that the nearest interpretation can also achieve good performance, but it is only applicable for relatively small-scale scenes. ", + "bbox": [ + 173, + 180, + 825, + 265 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Overall, the above simple reprojection operation explicitly retains the extracted 2D pixel features back to 3D space via the principle of geometry, and the module is naturally differentiable. ", + "bbox": [ + 173, + 271, + 823, + 300 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.4 OBTAINING GENERAL FEATURES FOR 3D POINTS ", + "text_level": 1, + "bbox": [ + 173, + 319, + 560, + 333 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Given a query 3D point $p$ , it is able to retrieve a feature vector from each input image. However, given a set of input images, it is challenging to obtain a final feature vector for the point $p$ , because: ", + "bbox": [ + 173, + 345, + 825, + 375 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "• The total number of input images for each 3D scene is variable and there is no order for images. As a consequence, the retrieved feature vectors are also unordered and have arbitrary size. • Since there are no depth scans paired with the input RGB images, it is unable to decide which feature vectors are the true descriptions of the query point due to visual occlusions. Ideally, these features can be aware of the relative distance to the query point and then selected automatically. ", + "bbox": [ + 169, + 381, + 825, + 455 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "To tackle these critical issues, we formulate this problem as an attention aggregation process. In particular, given the query 3D point $p$ , its query viewpoint $\\nu _ { p }$ , and the set of retrieved pixel features $\\{ \\mathbf { F } _ { p } ^ { 1 } \\cdot \\cdot \\cdot \\mathbf { F } _ { p } ^ { m } \\cdot \\cdot \\cdot \\mathbf { F } _ { p } ^ { M } \\}$ : ", + "bbox": [ + 173, + 462, + 825, + 507 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "• For each retrieved feature vector $\\mathbf { F } _ { p } ^ { m }$ , we firstly use shared MLPs to integrate the information of query point $p$ , generating a new feature vector $\\hat { \\mathbf { F } } _ { p } ^ { m }$ which is aware of the relative distance to the query point $p$ . Formally, it is defined as: $\\hat { \\mathbf { F } } _ { p } ^ { m } = M L P s ( \\mathbf { F } _ { p } ^ { m } \\oplus [ x _ { p } , y _ { p } , z _ { p } ] ) , \\quad ( \\oplus \\mathrm { m e a n s ~ c o n c a t e n a t i o n ~ i n ~ n e u r a l ~ n e t s } )$ (3) \n• After obtaining the new set of position-aware features $\\{ \\hat { \\mathbf { F } } _ { p } ^ { 1 } \\cdot \\cdot \\cdot \\hat { \\mathbf { F } } _ { p } ^ { m } \\cdot \\cdot \\cdot \\hat { \\mathbf { F } } _ { p } ^ { M } \\}$ , we use the existing attention aggregation methods such as AttSets (Yang et al., 2020) and Slot Attention (Locatello et al., 2020) to compute a unique feature vector $\\bar { \\mathbf { F } } _ { p }$ for the query 3D point $p$ . Basically, the attention mechanism learns a unique weight for all input features and then aggregates them together. According to the theoretical analysis in (Yang et al., 2020) and (Locatello et al., 2020), the selected attention mechanisms are permutation invariant with regard to the input set of feature vectors and can process an arbitrary number of elements. Formally, it is defined as: ", + "bbox": [ + 171, + 512, + 825, + 689 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/904fa8bc269de40581217d509910ed3b07f202a888ada9353fe5726b085967fe.jpg", + "text": "$$\n\\bar { \\mathbf { F } } _ { p } = \\mathcal { A } \\big ( \\hat { \\mathbf { F } } _ { p } ^ { 1 } \\cdot \\cdot \\cdot \\hat { \\mathbf { F } } _ { p } ^ { m } \\cdot \\cdot \\cdot \\hat { \\mathbf { F } } _ { p } ^ { M } \\big ) , \\quad \\mathrm { ( \\mathcal { A } ~ i s ~ a n ~ e x i s t i n g ~ a t t e n t i o n ~ f u n c t i o n ) }\n$$", + "text_format": "latex", + "bbox": [ + 281, + 689, + 730, + 710 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Above all, for every query 3D point $p$ , its final features $\\bar { \\mathbf { F } } _ { p }$ explicitly preserve the general geometric patterns retrieved from the input 2D observations and are also made aware of the particular 3D point location within the scene space. This allows the 3D point features $\\bar { \\mathbf { F } } _ { p }$ to be general and representative for its own geometry and appearance. ", + "bbox": [ + 174, + 715, + 825, + 772 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.5 RENDERING 3D FEATURES ", + "text_level": 1, + "bbox": [ + 176, + 791, + 401, + 806 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "With the learned features $\\bar { \\mathbf { F } } _ { p }$ for any query 3D point $p$ , this module aims to infer its volumetric density $d _ { p }$ in 3D space and the corresponding RGB values $\\{ r _ { p } , g _ { p } , b _ { p } \\}$ given the query viewpoint $\\nu _ { p }$ . In particular, we exactly follow the simple MLP-based design of NeRF (Mildenhall et al., 2020) in the rendering process. As illustrated in Equation 5, the volumetric density $d _ { p }$ is modeled as a function of the point features $\\bar { \\mathbf { F } } _ { p }$ only. This allows the estimated density $d _ { p }$ at the query point $p$ to remain unchanged under different query viewpoints, thus maintaining consistent geometry for each point. The RGB is modeled as a function of both point features and the query viewpoint. Details of these MLPs refers to NeRF (Mildenhall et al., 2020). ", + "bbox": [ + 173, + 819, + 825, + 925 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 102, + 521, + 117 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/26d919dff65d750e3d751851267bb1bf28a0879c63c1fd693d6eb7ee186b7238.jpg", + "text": "$$\nd _ { p } = M L P s ( \\bar { \\mathbf { F } } _ { p } ) , \\qquad \\quad ( r _ { p } , g _ { p } , b _ { p } ) = M L P s \\Bigl ( \\bar { \\mathbf { F } } _ { p } , \\{ x _ { p } ^ { v } , y _ { p } ^ { v } , z _ { p } ^ { v } \\} \\Bigr )\n$$", + "text_format": "latex", + "bbox": [ + 274, + 117, + 722, + 143 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To render the color of any query ray passing through the 3D scene, the classic volume rendering (Kajiya & Herzen, 1984) is applied and the integral is estimated by sampling a discrete set of 3D points along the query ray. In particular, we exactly follow the formulation of ray marching and the hierarchical sampling strategy in NeRF (Mildenhall et al., 2020). Eventually, novel 2D images can be directly synthesized from our GRF by querying light rays. This allows the entire network to be trainable only with a set of 2D images, without requiring 3D data. ", + "bbox": [ + 173, + 143, + 825, + 229 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.6 IMPLEMENTATION ", + "text_level": 1, + "bbox": [ + 176, + 247, + 341, + 261 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The proposed four modules are connected and trained end-to-end. In the implementation, details of the CNN module and the attention module for different experiments are presented in the appendix. In the neural rendering module, all the designs of neural layers and other settings simply follow NeRF (Mildenhall et al., 2020). In our network, all the 3D locations and RGB values are processed by the positional encoding proposed by NeRF (Mildenhall et al., 2020). The L2 loss between the rendered RGB and the ground truth is used to optimize the whole neural network. All these details are presented in the appendix. ", + "bbox": [ + 173, + 272, + 825, + 376 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 EVALUATION ", + "text_level": 1, + "bbox": [ + 176, + 395, + 315, + 411 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.1 EXPERIMENTS ON SHAPENETV2 DATASET ", + "text_level": 1, + "bbox": [ + 174, + 426, + 509, + 440 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Following the experimental settings of SRNs (Sitzmann et al., 2019), we firstly evaluate our GRF on the chair and car classes of ShapeNetv2. Particularly, the chair has 4612 objects for training, 662 for validation and 1317 for testing, while the car has 2151 objects for training, 352 for validation and 704 for testing. Each training object has randomly sampled 50 images with a resolution of $1 2 8 \\times 1 2 8$ pixels. We conduct the following three groups of experiments. ", + "bbox": [ + 173, + 453, + 825, + 522 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "• Group 1: Novel-view synthesis of seen objects in the training split of the same category. In particular, we train two separate models on the training split of chairs and cars, and these two models are separately tested on the trained objects to generate completely novel views. During testing, the model is fed with 50 trained views and infers another 251 novel views for evaluation. • Group 2: Novel-view synthesis of unseen objects in the testing split of the same category. The trained two models in Group 1 are tested on novel objects of the same category. During testing, the model is fed with 2 novel views of each novel object, inferring 251 novel views for evaluation. • Group 3: Similar to Group 2, but only 1 novel view is fed into the model for novel view synthesis. ", + "bbox": [ + 173, + 530, + 825, + 648 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Basically, the experiments of Group 1, 2 and 3 are exactly the same as in SRNs (Sitzmann et al., 2019) which is also the state of the art on this ShapeNetv2 dataset. Table 1 compares the quantitative results of our GRF and four baselines. Note that, the recent NeRF and NSVF are not scalable to learn large number of scenes simultaneously because each scene is encoded into the network parameters. ", + "bbox": [ + 174, + 655, + 825, + 712 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Analysis. 1) Our method outperforms SRNs on 50-view reconstruction, demonstrating the strong capability of our GRF for 3D scene representation. Figure 3 shows the qualitative results. 2) Our GRF lags behind SRNs for novel scene reconstruction in both Group 2 and 3. Fundamentally, this is because our GRF solves a much harder problem than SRNs. In particular, our network directly infers the novel scene representation in a single forward pass, while SRNs needs to be retrained on all novel scenes to optimize the latent code. As a result, the experiments of Group 2 and 3 are significantly in favour of SRNs. 3) To further demonstrate the advantage of GRF over SRNs, we directly evaluate the trained SRNs model on unseen objects (of the same category) without retraining. For comparison, we also directly evaluate the trained GRF model on the same novel objects. Figure 4 shows the qualitative results. It can be seen that if not retrained, SRNs completely fails to reconstruct unseen car instances, but randomly generates similar cars from learned prior knowledge, primarily because its latent code has not been updated from the unseen objects. In contrast, by learning pixel local patterns, our GRF generalizes well to novel objects directly. This highlights the superiority of the simple formulation of our GRF. ", + "bbox": [ + 173, + 718, + 825, + 924 + ], + "page_idx": 5 + }, + { + "type": "table", + "img_path": "images/e4fa34648ba5c9c90c1bdadb195d161c5ec17e80900f684eac0614a5458324ab.jpg", + "table_caption": [ + "Table 1: Comparison of the PSNR (in dB) and SSIM of reconstructed images in the ShapeNetv2 dataset by our GRF, the deterministic GQN (Eslami et al., 2018), TCO (Tatarchenko et al., 2015), WRL (Worrall et al., 2017) and SRNs (Sitzmann et al., 2019). The higher the scores, the better the synthesized novel views. Note that, our GRF solves a harder problem than SRNs, because GRF infers the novel scene representation in a single forward pass, while SRNs cannot. " + ], + "table_footnote": [], + "table_body": "
50 Images (Group 1)2 Images (Group 2)1 Image (Group 3)
ChairsCarsChairsCarsChairsCars
TCO24.31/ 0.9220.38/0.8321.33/ 0.8818.41 /0.8021.27 / 0.8818.15/0.79
WRL24.57 / 0.9319.16 /0.8222.28/0.9017.20 /0.7822.11/0.9016.89 / 0.77
dGQN22.72/0.9019.61 /0.8122.36 /0.8918.79 /0.7921.59 / 0.8718.19 /0.78
SRNs26.23 / 0.9526.32 /0.9424.48 / 0.9222.94 / 0.8822.89 / 0.9120.72 / 0.85
GRF (Ours)27.10 / 0.9527.21 / 0.9422.65/0.8822.06 /0.8621.25/0.8619.84/ 0.81
", + "bbox": [ + 173, + 183, + 825, + 309 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/2df62752b06cd043c2e56bd864bd2c55fce00ed1bd7adfe827095d12d01968ae.jpg", + "image_caption": [ + "Figure 3: Qualitative results of SRNs and our GRF for 50-view reconstruction of chairs and cars. ", + "or on par with the state-of-the-art NSVF on all metrics. Figure 6 shows the qualitative results. " + ], + "image_footnote": [], + "bbox": [ + 174, + 328, + 825, + 386 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/ce6817cec552833df65cb0e59da8ce2a23b611b88d65539290d9ff8fca51274d.jpg", + "image_caption": [ + "Figure 4: Qualitative results of SRNs (without retraining) and our GRF for 50-view reconstruction of unseen cars. SRNs fails to recover faithful shapes for unseen cars without retraining. " + ], + "image_footnote": [], + "bbox": [ + 174, + 409, + 825, + 474 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.2 EXPERIMENTS ON SYNTHETIC-NERF DATASET ", + "text_level": 1, + "bbox": [ + 174, + 536, + 544, + 550 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We further evaluate our approach on the more complex dataset Synthetic-NeRF (Mildenhall et al., 2020). It consists of pathtraced images of 8 synthetic scenes with much more complicated geometry and realistic non-Lambertian materials. Each scene has 100 views for training and 200 novel views for testing. Each image has a high resolution of $8 0 0 \\times 8 0 0$ pixels. ", + "bbox": [ + 173, + 564, + 470, + 676 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Single-scene Learning. To demonstrate the representational capability of our GRF, we train a single model for each synthetic scene, following the same experimental settings of NSVF (Liu et al., 2020). Table 2 compares the quantitative results. Our method is better ", + "bbox": [ + 173, + 683, + 470, + 775 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/414f5dd3af395f2566e75e951ed08981951767a1f8507c7e13c4426b34f8a5a7.jpg", + "table_caption": [ + "Table 2: The average scores of PSNR, SSIM and LPIPS (Zhang et al., 2018) for our GRF, SRNs (Sitzmann et al., 2019), NV (Lombardi et al., 2019), LLFF (Mildenhall et al., 2019), NeRF (Mildenhall et al., 2020) and NSVF (Liu et al., 2020) on the Synthetic-NeRF dataset for single-scene learning. " + ], + "table_footnote": [], + "table_body": "
PSNR↑SSIM↑LPIPS↓
SRNs22.260.8460.170
NV26.050.8930.160
LLFF24.880.9110.114
NeRF31.010.9470.081
NSVF31.740.9530.047
GRF(Ours)32.060.9600.048
", + "bbox": [ + 485, + 646, + 825, + 758 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Novel-scene Generalization. To evaluate the generalization of GRF on complex scenes, we train a single model simultaneously from randomly selected 4 scenes of Synthetic-NeRF, i.e., Chair, Mic, Ship, and Hotdog, and then conduct the following two groups of experiments. ", + "bbox": [ + 174, + 792, + 825, + 840 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Group 1: The trained model is directly tested on the remaining 4 novel scenes of Synthetic-NeRF dataset, i.e., Drums, Lego, Materials, and Ficus. Fundamentally, this experiment is to evaluate whether the learned limited features can truly generalize to new scenarios. This is extremely challenging because there are only 4 training scenes and the overall shapes of the 4 novel scenes are dramatically different from the trained ones. ", + "bbox": [ + 174, + 847, + 825, + 924 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Group 2: The trained model is further finetuned on each of the four novel scenes with 100, 1k, and 10k iterations separately. In total, we obtain $4 \\times 3 = 1 2$ new models. For comparison, we also train NeRF on each of the four novel scenes with 100, 1k, 10k iterations from scratch. This group of experiments evaluates how the initially-learned general features of our GRF improve novel scene learning. ", + "bbox": [ + 174, + 103, + 825, + 181 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Analysis. Table 3 compares the quantitative results. We can see that: 1) In Group 1, our GRF can indeed generalize to novel scenes with complex and completely different overall geometries, demonstrating the effectiveness of learning point local features in GRF. As shown in Figure 5, the overall shape and appearance of Lego can be satisfactorily recovered, though it has never been seen before. 2) In Group 2, our GRF can quickly learn high-quality scene representations given a sparse number of training pix", + "bbox": [ + 174, + 189, + 470, + 372 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/3080c6c65b006f8fbd396908b54525d24ac650e1d6e039623be0413789aa141b.jpg", + "table_caption": [ + "Table 3: The average scores of PSNR, SSIM and LPIPS for GRF and NeRF on four novel scenes of Synthetic-NeRF in Group 1&2. " + ], + "table_footnote": [], + "table_body": "
PSNR↑ SSIM↑LPIPS↓
GRF (Group 1) 13.62 0.763 0.246
NeRF(Group 2, 100 iters) 15.15 0.752 0.359 NeRF(Group 2,1k iters) 19.81 0.809 0.228 NeRF(Group 2,10k iters) 23.35 0.875 0.137
GRF (Group 2, 100 iters) 19.69 0.835 0.169 GRF (Group 2, 1k iters) 22.00 0.876 0.128 GRF (Group 2,10k iters) 25.10 0.916 0.089
", + "bbox": [ + 485, + 232, + 830, + 369 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "els, thanks to the initially learned general features. Compared with the NeRF trained from scratch, the learned GRF significantly improves novel scene learning, achieving much better results given the same amount of training signals of new scenes. Figure 5 qualitatively shows the generalization of GRF and more results are presented in appendix. ", + "bbox": [ + 174, + 373, + 825, + 434 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/2b33473f8cad83e6fc6ade9aac3c829b58988eea96b3c91c1071bdc0382ad409.jpg", + "image_caption": [ + "Figure 5: Qualitative results of our GRF for novel scene generalization. " + ], + "image_footnote": [], + "bbox": [ + 173, + 438, + 821, + 535 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.3 EXPERIMENTS ON REAL-WORLD COMPLEX SCENES ", + "bbox": [ + 173, + 547, + 575, + 563 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We evaluate the novel view synthesis on complex real-world scenes captured by cellphones. There are 8 scenes, 5 from LLFF (Mildenhall et al., 2019) and 3 from NeRF. Each scene has 20 to 62 images, 1/8 of which for testing. All images have high resolution of $1 0 0 8 \\times 7 5 6$ pixels. ", + "bbox": [ + 174, + 574, + 496, + 659 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Single-scene Learning. We train a single model for each real-world scene, following the same experimental settings of NeRF. Table 4 compares the quantitative results. Note that, the recent ", + "bbox": [ + 173, + 665, + 496, + 723 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/ce266d353b51e877a8a168b6fc05c2de9bc86a65d823ee30f8ce43337a952611.jpg", + "table_caption": [ + "Table 4: Comparison of the average PSNR, SSIM and LPIPS scores of our GRF, SRNs, LLFF and NeRF in the challenging real-world dataset for single-scene learning. " + ], + "table_footnote": [], + "table_body": "
PSNR↑SSIM↑LPIPS↓
SRNs22.840.6680.378
LLFF24.130.7980.212
NeRF26.500.8110.250
GRF(Ours)26.640.8370.178
", + "bbox": [ + 509, + 631, + 825, + 715 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "NSVF (Liu et al., 2020) is unable to process these forward-facing scenes because the predefined voxels cannot represent the unbounded 3D space. ", + "bbox": [ + 174, + 724, + 823, + 752 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Analysis. Our method surpasses the state of the art by large margins, especially over the SSIM and LPIPS metrics. Compared with PSNR which only measures the average per-pixel accuracy, the metrics SSIM and LPIPS favor high quality of photorealism, highlighting the superiority of our GRF to generate truly realistic images. Figure 6 shows the qualitative results. As highlighted by the red circles, our GRF can generate fine-grained and natural geometries in pixel level, while NeRF produces many artifacts. This clearly demonstrates our GRF indeed learns general and precise pixel features from the observed 2D images for 3D scene representation and rendering. ", + "bbox": [ + 173, + 758, + 825, + 857 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Compared with Synthetic-NeRF, this dataset is much harder because of the complicated geometries and the inaccuracy of estimated camera poses. Therefore, it is non-trivial to conduct real-world experiments for novel-scene generalization or large-scale scene reconstruction on ScanNet (Dai et al., 2017) or “Tanks and Temples” (Knapitsch et al., 2017). We leave these for future exploration. ", + "bbox": [ + 174, + 863, + 825, + 924 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/d2dd827b02e584e3f576cc7940a4fd39cb69b473fd797cdb28c8a8cf51466e19.jpg", + "image_caption": [ + "NeRF GRF (Ours) Ground Truth Figure 6: Qualitative results on Synthetic-NeRF (1st row) and real-world datasets (2nd row). " + ], + "image_footnote": [], + "bbox": [ + 178, + 99, + 820, + 251 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.4 ABLATION STUDY ", + "text_level": 1, + "bbox": [ + 174, + 287, + 341, + 301 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "To evaluate the effectiveness of the key components of our GRF, we conduct 3 groups of ablation experiments on the car category in ShapeNetv2 dataset. In particular, we train on the entire training split then randomly select 500 objects from the training split for testing. During testing, the model infers 50 novel views for each of these 500 objects for evaluation. Basically, this setting is similar to the experiment of Group 1 in Section 4.1. ", + "bbox": [ + 174, + 313, + 496, + 424 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/d65a0d05a7af6ab59e853844ea4a4e8a65732bc36324d880ac1e76483adc362e.jpg", + "table_caption": [ + "Table 5: The average scores of PSNR and SSIM for ablated GRF in the subset of car category. " + ], + "table_footnote": [], + "table_body": "
PSNR↑SSIM↑
(1)Remove Input Viewpoints20.130.807
(2) Remove Pixel Local Features20.230.818
(3) Replace Attention by Maxpool24.880.914
(4) The Full Model27.160.942
", + "bbox": [ + 511, + 342, + 823, + 420 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 424, + 575, + 438 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "• Group 1: The viewpoints of the input images are removed from the CNN module. The CNN module is not explicitly aware of the relative position of the pixel features. • Group 2: The decoder of the CNN module is removed and each input image is encoded as a global feature vector. For any 3D query point which is rightly projected into the image boundary, that global feature vector is retrieved and reprojected to the query point. Fundamentally, this modified CNN module can be regarded as a hyper-network that learns a conditional embedding from input images and then feed it into NeRF, but it sacrifices the precise pixel local features. • Group 3: The advanced attention module is replaced by max-pooling to aggregate the pixel features, aiming to investigate how the visual occlusion can be better addressed using soft attention. • Group 4: The full model is trained and tested with the same settings for comparison. ", + "bbox": [ + 171, + 444, + 825, + 598 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Analysis. Table 5 compares the performance of all ablated models. We can see that: 1) The greatest impact is caused by the removal of image viewpoints from the CNN module and the lack of local pixel features to represent 3D points. It highlights that obtaining the position-aware and precise pixel features is crucial to represent 3D scenes from 2D images, while learning a simple hyper-network for NeRF cannot achieve comparable performance. 2) Using max-pooling to select the reprojected pixel features is sub-optimal to address the visual occlusions from different viewing angles. ", + "bbox": [ + 173, + 604, + 825, + 690 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "To further investigate the attention module, the maximal attention scores are retrieved and visualized (detailed in appendix). It shows that the attention module can truly drive the network to focus on the visible pixel local features among the multiple intersected light rays. We also conduct additional ablation experiments (detailed in appendix), demonstrating that our GRF can indeed generalize well to novel scenes with severe visual occlusions and is robust to a variable number of input images. ", + "bbox": [ + 174, + 696, + 825, + 773 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 CONCLUSION ", + "text_level": 1, + "bbox": [ + 176, + 794, + 318, + 810 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The proposed method models complex 3D scenes as a general radiance field. We demonstrated that it can learn general and robust 3D point features from a set of 2D observations. By using the principle of multi-view geometry to precisely map 2D pixel features back to 3D space and leveraging the attention mechanism to implicitly address the visual occlusions, our GRF can synthesize truly realistic 2D novel views. However, there are still limitations that lead to the future work. (1) More advanced CNN modules can be designed to learn better pixel features. (2) Depth scans can be integrated into the network to explicitly address visual occlusions. ", + "bbox": [ + 173, + 825, + 825, + 922 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 176, + 102, + 287, + 117 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Matan Atzmon and Yaron Lipman. SAL: Sign Agnostic Learning of Shapes from Raw Data. IEEE Conference on Computer Vision and Pattern Recognition, 2020a. ", + "bbox": [ + 173, + 126, + 823, + 154 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Matan Atzmon and Yaron Lipman. SALD: Sign Agnostic Learning with Derivatives. arXiv, 2020b. ", + "bbox": [ + 171, + 161, + 821, + 178 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Cesar Cadena, Luca Carlone, Henry Carrillo, Yasir Latif, Davide Scaramuzza, Jose Neira, Ian D. Reid, and John J. Leonard. Past, Present, and Future of Simultaneous Localization and Mapping: Towards the Robust-Perception Age. IEEE Transactions on Robotics, 32(6):1309–1332, 2016. ", + "bbox": [ + 176, + 185, + 823, + 228 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Wenzheng Chen, Jun Gao, Huan Ling, Edward J. Smith, Jaakko Lehtinen, Alec Jacobson, and Sanja Fidler. Learning to Predict 3D Objects with an Interpolation-based Differentiable Renderer. Advances in Neural Information Processing Systems, pp. 9609–9619, 2019. ", + "bbox": [ + 176, + 236, + 823, + 280 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Christopher B. Choy, Danfei Xu, JunYoung Gwak, Kevin Chen, and Silvio Savarese. 3D-R2N2: A Unified Approach for Single and Multi-view 3D Object Reconstruction. European Conference on Computer Vision, pp. 628–644, 2016. ", + "bbox": [ + 174, + 287, + 825, + 330 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "H Christian, Shubham Tulsiani, and Jitendra Malik. Hierarchical Surface Prediction for 3D Object Reconstruction. International Conference on 3D Vision, pp. 412–420, 2017. ", + "bbox": [ + 171, + 338, + 825, + 368 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Angela Dai, Angel X. Chang, Manolis Savva, Maciej Halber, Thomas Funkhouser, and Matthias Nießner. ScanNet: Richly-annotated 3D Reconstructions of Indoor Scenes. IEEE Conference on Computer Vision and Pattern Recognition, pp. 5828–5839, 2017. ", + "bbox": [ + 174, + 376, + 823, + 420 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "S.M. Ali Eslami, Danilo Jimenez Rezende, Frederic Besse, Fabio Viola, Ari S. Morcos, Marta Garnelo, Avraham Ruderman, Andrei A. Rusu, Ivo Danihelka, Karol Gregor, David P. Reichert, Lars Buesing, Theophane Weber, Oriol Vinyals, Dan Rosenbaum, Neil Rabinowitz, Helen King, Chloe Hillier, Matt Botvinick, Daan Wierstra, Koray Kavukcuoglu, and Demis Hassabis. Neural Scene Representation and Rendering. Science, 360(6394):1204–1210, 2018. ", + "bbox": [ + 174, + 426, + 823, + 497 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Haoqiang Fan, Hao Su, and Leonidas Guibas. A Point Set Generation Network for 3D Object Reconstruction from a Single Image. IEEE Conference on Computer Vision and Pattern Recognition, pp. 605–613, 2017. ", + "bbox": [ + 173, + 505, + 821, + 547 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "A Tewari O Fried, J Thies V Sitzmann, S Lombardi K Sunkavalli, and R Martin-brualla T Simon J Saragih. State of the Art on Neural Rendering. Computer Graphics Forum, 39(2):701–727, 2020. ", + "bbox": [ + 173, + 556, + 821, + 585 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Georgia Gkioxari, Jitendra Malik, and Justin Johnson. Mesh R-CNN. IEEE International Conference on Computer Vision, pp. 9785–9795, 2019. ", + "bbox": [ + 169, + 593, + 823, + 622 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. Generative Adversarial Nets. Advances in Neural Information Processing Systems, pp. 2672–2680, 2014. ", + "bbox": [ + 174, + 630, + 823, + 674 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Thibault Groueix, Matthew Fisher, Vladimir G Kim, Bryan C Russell, and Mathieu Aubry. A PapierMache Approach to Learning 3D Surface Generation. IEEE Conference on Computer Vision and Pattern Recognition, pp. 216–224, 2018. ", + "bbox": [ + 174, + 681, + 825, + 724 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Richard Hartley and Andrew Zisserman. Multiple View Geometry in Computer Vision. Cambridge University Press, 2004. ", + "bbox": [ + 173, + 733, + 821, + 762 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Eldar Insafutdinov and Alexey Dosovitskiy. Unsupervised Learning of Shape and Pose with Differentiable Point Clouds. Advances in Neural Information Processing Systems, pp. 2802–2812, 2018. ", + "bbox": [ + 173, + 770, + 825, + 813 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "James T. Kajiya and Brian P Von Herzen. Ray tracing volume densities. ACM SIGGRAPH Computer Graphics, 18(3), 1984. ", + "bbox": [ + 173, + 820, + 823, + 849 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Hiroharu Kato, Yoshitaka Ushiku, and Tatsuya Harada. Neural 3D Mesh Renderer. IEEE Conference on Computer Vision and Pattern Recognition, pp. 3907–3916, 2018. ", + "bbox": [ + 174, + 857, + 823, + 887 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Hiroharu Kato, Deniz Beker, Mihai Morariu, Takahiro Ando, Toru Matsuoka, Wadim Kehl, and Adrien Gaidon. Differentiable Rendering: A Survey. arXiv:2006.12057, 2020. ", + "bbox": [ + 174, + 895, + 821, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Diederik P Kingma and Max Welling. Auto-Encoding Variational Bayes. International Conference on Learning Representations, 2014. ", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Arno Knapitsch, Jaesik Park, Qian Yi Zhou, and Vladlen Koltun. Tanks and temples: Benchmarking large-scale scene reconstruction. ACM Transactions on Graphics, 36(4), 2017. ISSN 15577368. doi: 10.1145/3072959.3073599. ", + "bbox": [ + 174, + 142, + 823, + 185 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Lingjie Liu, Jiatao Gu, Kyaw Zaw Lin, Tat-Seng Chua, and Christian Theobalt. Neural Sparse Voxel Fields. Advances in Neural Information Processing Systems, 2020. ", + "bbox": [ + 174, + 195, + 823, + 224 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Shichen Liu, Tianye Li, Weikai Chen, and Hao Li. Soft Rasterizer: A Differentiable Renderer for Image-based 3D Reasoning. IEEE International Conference on Computer Vision, pp. 7708–7717, 2019a. ", + "bbox": [ + 173, + 234, + 825, + 276 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Shichen Liu, Shunsuke Saito, Weikai Chen, and Hao Li. Learning to Infer Implicit Surfaces without 3D Supervision. Advances in Neural Information Processing Systems, pp. 8293–8304, 2019b. ", + "bbox": [ + 173, + 286, + 823, + 316 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Francesco Locatello, Dirk Weissenborn, Thomas Unterthiner, Aravindh Mahendran, Georg Heigold, Jakob Uszkoreit, Alexey Dosovitskiy, and Thomas Kipf. Object-Centric Learning with Slot Attention. Advances in Neural Information Processing Systems, 2020. ", + "bbox": [ + 176, + 325, + 821, + 369 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Stephen Lombardi, Tomas Simon, Jason Saragih, Gabriel Schwartz, Andreas Lehrmann, and Yaser Sheikh. Neural volumes: Learning dynamic renderable volumes from images. ACM Transactions on Graphics, 38(4), 2019. ISSN 15577368. doi: 10.1145/3306346.3323020. ", + "bbox": [ + 176, + 378, + 823, + 421 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Ricardo Martin-Brualla, Noha Radwan, Mehdi S. M. Sajjadi, Jonathan T. Barron, Alexey Dosovitskiy, and Daniel Duckworth. NeRF in the Wild: Neural Radiance Fields for Unconstrained Photo Collections. arXiv:2008.02268, 2020. ", + "bbox": [ + 173, + 431, + 825, + 474 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Lars Mescheder, Michael Oechsle, Michael Niemeyer, Sebastian Nowozin, and Andreas Geiger. Occupancy Networks: Learning 3D Reconstruction in Function Space. IEEE Conference on Computer Vision and Pattern Recognition, pp. 4455–4465, 2019. ", + "bbox": [ + 173, + 486, + 826, + 529 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Ben Mildenhall, Pratul Srinivasan, Rodrigo Ortiz-Cayon, Nima Khademi Kalantari, Ravi Ramamoorthi, Ren Ng, and Abhishek Kar. Local light field fusion: Practical view synthesis with prescriptive sampling guidelines. SIGGRAPH, 2019. ", + "bbox": [ + 176, + 537, + 823, + 582 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Ben Mildenhall, Pratul P. Srinivasan, Matthew Tancik, Jonathan T Barron, Ravi Ramamoorthi, and Ren Ng. NeRF: Representing Scenes as Neural Radiance Fields for View Synthesis. European Conference on Computer Vision, 2020. ", + "bbox": [ + 176, + 590, + 825, + 633 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Charlie Nash, Yaroslav Ganin, S. M. Ali Eslami, and Peter W. Battaglia. PolyGen: An Autoregressive Generative Model of 3D Meshes. International Conference on Machine Learning, 2020. ", + "bbox": [ + 171, + 643, + 823, + 672 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Michael Niemeyer, Lars Mescheder, Michael Oechsle, and Andreas Geiger. Differentiable Volumetric Rendering: Learning Implicit 3D Representations without 3D Supervision. IEEE Conference on Computer Vision and Pattern Recognition, pp. 3504–3515, 2020. ", + "bbox": [ + 173, + 683, + 825, + 727 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Aaron van den Oord, Nal Kalchbrenner, Oriol Vinyals, Lasse Espeholt, Alex Graves, and Koray Kavukcuoglu. Conditional Image Generation with PixelCNN Decoders. Advances in Neural Information Processing Systems, pp. 4790–4798, 2016. ISSN 10495258. ", + "bbox": [ + 173, + 736, + 826, + 779 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Onur Ozyesil, Vladislav Voroninski, Ronen Basri, and Amit Singer. A Survey of Structure from Motion. Acta Numerica, 26:305–364, 2017. ", + "bbox": [ + 171, + 789, + 825, + 818 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Jeong Joon Park, Peter Florence, Julian Straub, Richard Newcombe, and Steven Lovegrove. DeepSDF: Learning Continuous Signed Distance Functions for Shape Representation. IEEE Conference on Computer Vision and Pattern Recognition, pp. 165–174, 2019. ", + "bbox": [ + 174, + 828, + 823, + 872 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Charles R. Qi, Hao Su, Kaichun Mo, and Leonidas J. Guibas. PointNet: Deep Learning on Point Sets for 3D Classification and Segmentation. IEEE Conference on Computer Vision and Pattern Recognition, pp. 652–660, 2017. ", + "bbox": [ + 174, + 882, + 825, + 924 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Alec Radford, Luke Metz, and Soumith Chintala. Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks. International Conference on Learning Representations, 2016. ", + "bbox": [ + 176, + 103, + 823, + 145 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Edoardo Remelli, Artem Lukoianov, Stephan R. Richter, Benoˆıt Guillard, Timur Bagautdinov, Pierre Baque, and Pascal Fua. MeshSDF: Differentiable Iso-Surface Extraction. arXiv:2006.03997, 2020. ", + "bbox": [ + 176, + 154, + 823, + 195 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Danilo Jimenez Rezende, S. M. Ali Eslami, Shakir Mohamed, Peter Battaglia, Max Jaderberg, and Nicolas Heess. Unsupervised Learning of 3D Structure from Images. Advances in Neural Information Processing Systems, pp. 4996–5004, 2016. ", + "bbox": [ + 176, + 204, + 823, + 247 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Gernot Riegler, Ali Osman Ulusoy, and Andreas Geiger. OctNet: Learning Deep 3D Representations at High Resolutions. IEEE Conference on Computer Vision and Pattern Recognition, pp. 3577– 3586, 2017. ", + "bbox": [ + 174, + 253, + 823, + 296 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Shunsuke Saito, Zeng Huang, Ryota Natsume, Shigeo Morishima, Angjoo Kanazawa, and Hao Li. PIFu: Pixel-Aligned Implicit Function for High-Resolution Clothed Human Digitization. IEEE International Conference on Computer Vision, pp. 2304–2314, 2019. ", + "bbox": [ + 178, + 304, + 823, + 348 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Katja Schwarz, Yiyi Liao, Michael Niemeyer, and Andreas Geiger. GRAF: Generative Radiance Fields for 3D-Aware Image Synthesis. arXiv:2007.02442, 2020. ", + "bbox": [ + 171, + 354, + 823, + 383 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Vincent Sitzmann, Michael Zollhofer, and Gordon Wetzstein. Scene Representation Networks: Con- ¨ tinuous 3D-Structure-Aware Neural Scene Representations. Advances in Neural Information Processing Systems, pp. 1119–1130, 2019. ", + "bbox": [ + 176, + 391, + 823, + 434 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Shuran Song, Fisher Yu, Andy Zeng, Angel X. Chang, Manolis Savva, and Thomas Funkhouser. Semantic Scene Completion from a Single Depth Image. IEEE Conference on Computer Vision and Pattern Recognition, pp. 1746–1754, 2017. ", + "bbox": [ + 174, + 441, + 823, + 484 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Maxim Tatarchenko, Alexey Dosovitskiy, and Thomas Brox. Single-view to Multi-view: Reconstructing Unseen Views with a Convolutional Network. arXiv:1511.06702, 2015. ", + "bbox": [ + 169, + 492, + 821, + 521 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Shubham Tulsiani, Tinghui Zhou, Alexei A. Efros, and Jitendra Malik. Multi-view Supervision for Single-view Reconstruction via Differentiable Ray Consistency. IEEE Conference on Computer Vision and Pattern Recognition, pp. 2626–2634, 2017. ", + "bbox": [ + 176, + 529, + 823, + 571 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Shubham Tulsiani, Saurabh Gupta, David Fouhey, Alexei A. Efros, and Jitendra Malik. Factoring Shape, Pose, and Layout from the 2D Image of a 3D Scene. IEEE Conference on Computer Vision and Pattern Recognition, pp. 302–310, 2018. ", + "bbox": [ + 174, + 579, + 823, + 622 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Nanyang Wang, Yinda Zhang, Zhuwen Li, Yanwei Fu, Wei Liu, and Yu-Gang Jiang. Pixel2Mesh: Generating 3D Mesh Models from Single RGB Images. European Conference on Computer Vision, pp. 52–67, 2018. ", + "bbox": [ + 174, + 628, + 823, + 672 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Daniel E. Worrall, Stephan J. Garbin, Daniyar Turmukhambetov, and Gabriel J. Brostow. Interpretable transformations with encoder-decoder networks. IEEE International Conference on Computer Vision, pp. 5726–5735, 2017. ", + "bbox": [ + 174, + 679, + 823, + 723 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Xinchen Yan, Jimei Yang, Ersin Yumer, Yijie Guo, and Honglak Lee. Perspective Transformer Nets: Learning Single-View 3D Object Reconstruction without 3D Supervision. Advances in Neural Information Processing Systems, pp. 1696–1704, 2016. ", + "bbox": [ + 176, + 729, + 823, + 773 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Bo Yang, Stefano Rosa, Andrew Markham, Niki Trigoni, and Hongkai Wen. Dense 3D Object Reconstruction from a Single Depth View. IEEE Transactions on Pattern Analysis and Machine Intelligence, 41(12):2820 – 2834, 2019. ", + "bbox": [ + 176, + 780, + 823, + 823 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Bo Yang, Sen Wang, Andrew Markham, and Niki Trigoni. Robust Attentional Aggregation of Deep Feature Sets for Multi-view 3D Reconstruction. International Journal of Computer Vision, 128: 53–73, 2020. ", + "bbox": [ + 173, + 830, + 823, + 873 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Richard Zhang, Phillip Isola, Alexei A. Efros, Eli Shechtman, and Oliver Wang. The Unreasonable Effectiveness of Deep Features as a Perceptual Metric. IEEE Conference on Computer Vision and Pattern Recognition, pp. 586–595, 2018. ", + "bbox": [ + 174, + 881, + 825, + 924 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "A APPENDIX ", + "text_level": 1, + "bbox": [ + 176, + 102, + 297, + 117 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "A.1 DETAILS OF NETWORK ARCHITECTURE ", + "bbox": [ + 174, + 133, + 495, + 148 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/3ac8d85f8a85bfd8277fb757a68ee73ad0999e9f05f89b1e6333da2f9edbaa85.jpg", + "table_caption": [ + "Table 6: The CNN Module for Experiments on ShapeNetv2 Dataset. " + ], + "table_footnote": [], + "table_body": "
Type Size/Channels Activation Stride
Input: embedding of RGB and viewpoint
1 - 64 ReLU 2
Li: Conv 7 × 7 L2: Conv 3 × 3 128 ReLU 2
L3: Conv 3 × 3 256 ReLU 2
L4: Conv 3 × 3 512 ReLU 2
L5: Conv 4 × 4 128 ReLU 4
L6: Flatten /Tile - 1
L7: Concat (L6,L4) - 1
L8:Dilated Conv 3×3 256 ReLU 4
L8: Concat (L8,L3) 1 1 =
L9:Dilated Conv 3 × 3 128 ReLU 8
L9: Concat (L9,L2) = 一 =
L10: Dilated Conv 3 × 3 64 ReLU 16
L10: Concat (L10, L1) - ■ = L11: Dilated Conv 3 × 3 128 ReLU 32
", + "bbox": [ + 246, + 188, + 748, + 428 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/f3cfc5c0b697f7ff2d4d137d9755f6843fc3a68f617b71895b640e8384cb92d3.jpg", + "table_caption": [ + "Table 7: The CNN Module for Experiments on Synthetic-NeRF Dataset. The average pooling is added to aggressively downsample the feature maps. " + ], + "table_footnote": [], + "table_body": "
Type Size/Channels Activation Stride
Input: embedding of RGB and viewpoint - -
L1: Conv 7 × 7 64 ReLU 2
L2: Conv 3 × 3 128 ReLU 2
L3: Conv 3 × 3 256 ReLU 2
L4: Conv 3 × 3 512 ReLU 2
L4: AveragePooling 5 × 5
= =
L5: Conv 5 × 5 128 ReLU 5
L6:Flatten /Tile - 1
L7: Concat (L6,L4) 1 1
L8: Deconv 3× 3 256 ReLU 2
L8: Concat (L8, L3) 1 1
L9: Deonv 3 × 3 128 ReLU 2
L9: Concat (L9,L2) 1 1
L10: Deconv 3×3 64 ReLU 2
L10: Concat (L10,L1) - 1 L11: Deconv 3 × 3 128 ReLU 2
", + "bbox": [ + 246, + 486, + 748, + 739 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/15ad75e56b1cd73cb68236429d499cf4d8210d2b20664c25830133d3707753ff.jpg", + "table_caption": [ + "Table 8: The CNN Module for Experiments on the real-world Dataset. The average pooling is added to aggressively downsample the feature maps. " + ], + "table_footnote": [], + "table_body": "
Type Size/Channels Activation Stride
Input: embedding of RGB and viewpoint 1 1
L1: Conv 7 × 7 64 ReLU
22 L2: Conv 3 × 3 128 ReLU
L3: Conv 3 × 3 256 ReLU 2
L4: Conv 3 × 3 512 ReLU 2
L4: AveragePooling 8 × 8 1 =
L5: Conv 4 × 4 128 ReLU 4
L6: Flatten /Tile 1 1
L7: Concat (L6,L4) 1 1
L8: Deconv 3 × 3 256 ReLU 2
L8: Concat (L8,L3) - 1
L9: Deconv 3 × 3 128 ReLU
L9: Concat (L9,L2) 1 =
L10: Deconv 3×3 64 ReLU 2
L10: Concat (L10, L1) - =
L11: Deconv 3 × 3 128 ReLU 2
", + "bbox": [ + 245, + 140, + 750, + 392 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/5792f5022f202a1711b69c1ecc67365884b64b5fb9c2d196c0495c1ea99e0865.jpg", + "table_caption": [ + "Table 9: The Attention Module, AttSets (Yang et al., 2020), for Experiments on the ShapeNetv2 Dataset. The simple AttSets is computationally efficient and we choose it to train the large-scale ShapeNetv2 dataset. " + ], + "table_footnote": [], + "table_body": "
TypeSize/Channels Activation
Input: Concat(K × 128,embedding of viewpoint)==
L1: fc256ReLU
L2: fc256ReLU
L3: fc256ReLU
L4: fc512ReLU
L5: fc512ReLU
L6: softmax(L5)11
L7: sum(L6*L5,axis=-2)11
L8: fc512ReLU
", + "bbox": [ + 240, + 467, + 754, + 622 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We use Slot Attention as the pixel feature aggregation module for experiments on the SyntheticNeRF and real-world datasets. In particular, we use two slots, two iterations, and the hidden size is 128. The final output two slots are flattened and a 256 dimensional vector is obtained. For details of Slot Attention refer to the paper (Locatello et al., 2020). ", + "bbox": [ + 174, + 638, + 823, + 694 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Details of the neural rendering layers and the volume rendering can be found in NeRF (Mildenhall et al., 2020). We set the positional embedding length $L = 5$ for all inputs to the CNN module, except the rotation, which we convert to quaternion and embed at $L = 4$ . ", + "bbox": [ + 176, + 702, + 820, + 743 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "During training, we feed the models between 2 and 6 views of each scene at each gradient step. We set the learning rate for the ShapeNetv2 models at 1e-4. We set the learning rate for leaves and orchids in the real-world dataset at 7e-5, and for the rest, we use 1e-4. For Synthetic-NeRF dataset, we use a learning rate of 1e-4. We use the Adam optimizer for all models, and train for $2 0 0 \\mathbf { k } { - } 3 0 0 \\mathbf { k }$ iterations. At each gradient step, we take 1000 rays for ShapeNetv2 with 32 coarse samples and 64 fine samples, and 800 rays for the real-world and Synthetic-NeRF datasets with 64 coarse samples and 192 fine samples. We train each model on a single Nvidia-V100 GPU with 32GB VRAM. ", + "bbox": [ + 173, + 750, + 825, + 848 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "During testing for the ShapeNetv2 reconstruction from 50 images, we feed the model the 5 closest views to the desired novel view by cosine similarity from the 50 training images. During testing for single-scene reconstruction, we feed the model the 4 closest views by cosine similarity to the desired novel view. ", + "bbox": [ + 176, + 854, + 825, + 910 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "A.2 DETAILS OF EXPERIMENTAL RESULTS ON THE SYNTHETIC-NERF DATASET ", + "text_level": 1, + "bbox": [ + 176, + 103, + 741, + 118 + ], + "page_idx": 14 + }, + { + "type": "table", + "img_path": "images/8a19c4d1e380f64c84286252d3506630858144ee54eca16f70dc58749599911e.jpg", + "table_caption": [ + "Table 10: Comparison of the PSNR (in dB), SSIM and LPIPS (Zhang et al., 2018) scores of our GRF, SRNs (Sitzmann et al., 2019), NV (Lombardi et al., 2019), NeRF (Mildenhall et al., 2020) and NSVF (Liu et al., 2020) in the Synthetic-NeRF dataset for single-scene learning. " + ], + "table_footnote": [], + "table_body": "
ChairDrumsLegoMicMaterialsShipHotdogFicusMean
PSNR↑
SRNs26.9617.1820.8526.8518.0920.6026.8120.7322.26
NV28.3322.5826.0827.7824.2223.9330.7124.7926.05
NeRF33.0025.0132.5432.9129.6228.6536.1830.1331.01
NSVF33.1925.1832.2934.2732.6827.9337.1431.2331.74
GRF(Ours)34.5125.8332.9233.9430.9130.1237.4730.7532.06
SSIM↑
SRNs0.9100.7660.8090.9470.8080.7570.9230.8490.846
NV0.9160.8730.8800.9460.8880.7840.9440.9100.893
NeRF0.9670.9250.9610.9800.9490.8560.9740.9640.947
NSVF0.9680.9310.9600.9870.9730.8540.9800.9730.953
GRF(Ours)0.9810.9370.9670.9870.9630.8910.9830.9690.960
LPIPS↓
SRNs0.1060.2670.2000.0630.1740.2990.1000.1490.170
NV0.1090.2140.1750.1070.1300.2760.1090.1620.160
NeRF0.0460.0910.0500.0280.0630.2060.1210.0440.081
NSVF0.0430.0690.0290.0100.0210.1620.0250.0170.047
GRF(Ours)0.0210.0680.0420.0130.0410.1410.0280.0320.048
", + "bbox": [ + 173, + 185, + 826, + 474 + ], + "page_idx": 14 + }, + { + "type": "table", + "img_path": "images/7456beddc3b5748ce63369feae497d718a196676d033b0c2e1938a44b6190833.jpg", + "table_caption": [ + "Table 11: The PSNR, SSIM and LPIPS scores of our GRF simultaneously trained on 4 scenes of the Synthetic-NeRF dataset for multi-scene learning. The scores of SRNs, NeRF and NSVF trained on single scenes are included for comparison. " + ], + "table_footnote": [], + "table_body": "
ChairMicShipHotdog
PSNR↑
SRNs (Single-scene)26.9626.8520.6026.81
NeRF (Single-scene)33.0032.9128.6536.18
NSVF (Single-scene)33.1934.2727.9337.14
GRF (Multi-scene)32.4932.0227.7634.92
SSIM↑
SRNs (Single-scene)0.9100.9470.7570.923
NeRF (Single-scene)0.9670.9800.8560.974
NSVF (Single-scene)0.9680.9870.8540.980
GRF (Multi-scene)0.9710.9820.8660.975
LPIPS↓
SRNs (Single-scene)0.1060.0630.2990.100
NeRF (Single-scene)0.0460.0280.2060.121
NSVF (Single-scene)0.0430.0100.1620.025
GRF (Multi-scene)0.0320.0190.1670.040
", + "bbox": [ + 173, + 553, + 826, + 820 + ], + "page_idx": 14 + }, + { + "type": "table", + "img_path": "images/faa40c1a6f21d2a0d3d808f83a19ed8fcc279796274d22c7b01aac148f1c3535.jpg", + "table_caption": [ + "Table 12: The PSNR, SSIM and LPIPS scores of our GRF and NeRF on four novel scenes of Synthetic-NeRF in Group 1&2 experiments. " + ], + "table_footnote": [], + "table_body": "
Drums
Lego PSNR↑MaterialsFicus
GRF (Group 1) 13.23 13.5312.26 15.47 15.42 15.72
NeRF( F(Group2,100 iters) 14.54 14.9220.04 20.40 20.81
NeRF( (Group2,1k iters) 18.0119.81 23.36 23.47
NeRF (Group 2,10k iters) 21.57 24.9923.35
GRF (Group 2,100 iters) 18.70 20.2418.81 21.03 19.69
GRF (Group2,1k iters) 20.49 23.6421.87 22.02 22.00
GRF (Group2,10k iters) 23.11 27.0725.11 25.11 25.10
SSIM↑
F (Group 1) 0.7620.736 0.703 0.849
NeRF(Group 2,100 iters)0.769 0.717 0.716
NeRF(Group 2,1k iters) 0.793 0.7750.812 0.857 0.809 0.877 0.896 0.875
NeRF F(Group2,10k iters) 0.8650.862
GRF(Group 2,100 iters) 0.822 0.8130.829 0.878 0.835
GRF (Group2,1k iters) 0.8560.877 0.878 0.894 0.876 0.916
GRF F(Group2,10k iters) 0.9010.924 0.913 0.923
LPIPS↓
0.256 0.273 0.301 0.150
GRF (Group 1) NeRF(Group 2,100 iters)0.332 0.395 0.314
NeRF(Group 2,1k iters) 0.254 0.2640.393 0.359 0.229 0.164 0.228 0.137
NeRF (Group2,10k iters) 0.1570.154 0.128 0.110
GRF (Group 2,100 iters) 0.1960.203 0.159 0.117 0.169 0.128
GRF F(Group2,1k iters) 0.154 GRF (Group 2,10k iters) 0.1040.138 0.123 0.097 0.090 0.090 0.071
", + "bbox": [ + 171, + 330, + 825, + 733 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "A.3 DETAILS OF EXPERIMENTAL RESULTS ON THE REAL-WORLD DATASET ", + "bbox": [ + 174, + 103, + 709, + 118 + ], + "page_idx": 16 + }, + { + "type": "table", + "img_path": "images/13622607470041225f8d5395594024818146184a58c3007f10049788c300715c.jpg", + "table_caption": [ + "Table 13: Comparison of the PSNR, SSIM and LPIPS scores of our GRF, SRNs (Sitzmann et al., 2019), LLFF (Mildenhall et al., 2019) and NeRF (Mildenhall et al., 2020) in the real-world dataset for single-scene learning. " + ], + "table_footnote": [], + "table_body": "
RoomFernLeavesFortressOrchidsFlowerT-RexHornsMean
PSNR↑
SRNs27.2921.3718.2426.6317.3724.6322.8724.3322.84
LLFF28.4222.8519.5229.4018.5225.4624.1524.7024.13
NeRF32.7025.1720.9231.1620.3627.4026.8027.4526.50
GRF(Ours)31.7425.7221.1631.2820.8827.8327.0127.5026.64
SSIM↑
SRNs0.8830.6110.5200.6410.4490.7380.7610.7420.668
LLFF0.9320.7530.6970.8720.5880.8440.8570.8400.798
NeRF0.9480.7920.6900.8810.6410.8270.8800.8280.811
GRF(Ours)0.9510.8270.7270.8980.6670.8520.9010.8730.837
LPIPS↓
SRNs0.2400.4590.4400.4530.4670.2880.2980.3760.378
LLFF0.1550.2470.2160.1730.3130.1740.2220.1930.212
NeRF0.1780.2800.3160.1710.3210.2190.2490.2680.250
GRF(Ours)0.1040.1910.2380.1270.2750.1760.1460.1690.178
", + "bbox": [ + 173, + 186, + 825, + 436 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "A.4 ANALYSIS OF ATTENTION MECHANISM(Generalizat ", + "text_level": 1, + "bbox": [ + 174, + 103, + 491, + 117 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "The attention mechanism in our GRF aims to automatically select the correct pixel patch from multiple pixel patches where the light rays intersect at the same query 3D point in space. ", + "bbox": [ + 174, + 128, + 823, + 160 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "In order to investigate how the attention mechanism learns to select the useful information, we retrieve the maximal attention score from the observed multiple pixel patches for analysis. Intuitively, the higher the attention score is assigned to a particular pixel patch, the more important that patch for inferring the novel pixel RGB. In particular, we conduct the following experiment using our GRF model trained on ShapeNetv2 Cars. In this case, the AttSets attention module is used (details are in Table 9). Given a query light ray, multiple 3D points are sampled to query the network. ", + "bbox": [ + 173, + 167, + 825, + 261 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "We firstly try to find the 3D point which is near the surface according to the predicted volume density for points along the ray through a given pixel, if they exist. Otherwise, we ignore such pixels, making them white. \nThen we compute the M feature vectors from the input M views for these surface points. Thirdly, the attention masks for those M feature vectors are computed. We identify the view whose sum of the attention mask along the feature axis is greatest as the main contributor for inferring the novel pixel RGB. \nAfter querying light rays for each pixel, we obtain a rendered RGB image. At the same time, for each pixel of that image, we select the most important view from the M input views for the surfaceintersection point along the ray from the viewpoint through that pixel, according to the maximal attention score. Eventually, we obtain a Max Attention Map corresponding to the rendered RGB image. ", + "bbox": [ + 173, + 267, + 825, + 453 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Figure 7 shows the qualitative results of the above experiment. In particular, we feed the three images (#1,#2,#3) of an unseen car into our GRF model which is well-trained on car category, and then render a new image (e.g., the 5th image in Figure 7). Note that, we carefully select the input 3 images and the rendered image with very large viewing baselines. In the mean time, we obtain and visualize the Max Attention Map corresponding to the rendered image. ", + "bbox": [ + 173, + 460, + 825, + 537 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "For each pixel of the rendered image, we retrieve the input image pixel that has the highest attention score. Specifically, the rendered pixels with purple color correspond to the input image #1, the green pixels correspond to the input image #2, while the blue pixels correspond to the input image #3. ", + "bbox": [ + 174, + 545, + 825, + 592 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Analysis. It can be seen that, when inferring a new image, the attention module of our GRF focuses on the most informative pixel patch from the multiple input pixel patches. In addition, it is able to truly deal with the visual occlusion. For example, when inferring the windshield of the car, the attention module focuses on the input image #2 where the windshield is visible, while ignoring the image #1 and #3 where the windshield is self-occluded. ", + "bbox": [ + 173, + 598, + 825, + 676 + ], + "page_idx": 17 + }, + { + "type": "image", + "img_path": "images/20f93eecb76196ee8f164adc09b398e9f5dbb82c10a34c1453af75819e8f5736.jpg", + "image_caption": [ + "Figure 7: Visualization of Max Attention Map from Multiple Input Images of a Novel Object for Inferring a Novel View. " + ], + "image_footnote": [], + "bbox": [ + 173, + 691, + 825, + 789 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "A.5 GENERALIZATION TO VISUAL OCCLUSIONS AND VARIABLE INPUT IMAGES ", + "bbox": [ + 174, + 103, + 740, + 118 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "We carefully select the attention module, i.e., either AttSets or SlotAtt, to aggregate the features from an arbitrary number of input views. In order to evaluate how our GRF is able to generalize with a variable number of input views, especially when there is a very sparse number of views with severe visual occlusions, we conduct the following four groups of experiments. ", + "bbox": [ + 174, + 128, + 823, + 190 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "• 1-view Reconstruction. We feed the a single image of a novel car into our GRF model which is well-trained on car category (trained with 5 images per object), and then render 9 new images from vastly different viewing angles. This is the extreme case where the majority of the object is self-occluded. ", + "bbox": [ + 174, + 198, + 825, + 260 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "• 2-view Reconstruction. Similarly, we feed only two images of the novel car into the same model and render the same 9 novel views. In this case, more information is given to the network, but there are still many parts occluded. ", + "bbox": [ + 179, + 261, + 823, + 305 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "• 5-view / 10-view Reconstruction. The same GRF model is fed with 5 and 10 views of the novel object, rendering the same set of new images. ", + "bbox": [ + 178, + 306, + 820, + 338 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Analysis. Figure 8 shows the qualitative results. It can be seen that: 1) In the extreme case, i.e., 1-view reconstruction, our GRF is still able to recover the general 3D shape of the unseen object, including the visually occluded parts, primarily because our CNN model learns the hierarchical features including the high-level shapes. 2) Given more input views, the originally occluded parts tend to be observed from some viewing angles, and then these parts can be reconstructed better and better. This shows that our GRF is indeed able to effectively identify the corresponding useful pixel features for more accurately recovering shape and appearance. ", + "bbox": [ + 173, + 344, + 825, + 453 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/452fb2908ba7c814b8da50727c0309cbd16427f8d4f7072fd5be8f665d791d99.jpg", + "image_caption": [ + "Figure 8: Qualitative results of our GRF when being fed with a variable number of views of a novel object. The red circle highlights that the tail of the car is able to be recovered given more visual cues from more input images. " + ], + "image_footnote": [], + "bbox": [ + 205, + 470, + 794, + 861 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/5e585a9c6f55e0f762c826bccc3ad70554c0e9a9023da31e86706efd23ce1569.jpg", + "image_caption": [ + "Figure 9: Qualitative results of SRNs and our GRF for 50-view reconstruction of chairs and cars. " + ], + "image_footnote": [], + "bbox": [ + 161, + 193, + 816, + 820 + ], + "page_idx": 19 + }, + { + "type": "image", + "img_path": "images/720b1b3f0a109fae40aade5f250bbe18fc1e9ff6bc9faf69eda08923c27ddadc.jpg", + "image_caption": [ + "Figure 10: Qualitative results of our GRF for novel view depth and RGB estimation on the SyntheticNeRF dataset. " + ], + "image_footnote": [], + "bbox": [ + 178, + 212, + 803, + 775 + ], + "page_idx": 20 + }, + { + "type": "image", + "img_path": "images/cadef3a36c5e380d2f99cc5b827f2e4ca75d2c8175fcc3a245639772f579210d.jpg", + "image_caption": [ + "Figure 11: Qualitative results of our GRF for novel view depth and RGB estimation on the SyntheticNeRF dataset. " + ], + "image_footnote": [], + "bbox": [ + 179, + 203, + 795, + 779 + ], + "page_idx": 21 + }, + { + "type": "image", + "img_path": "images/453a93119d60769e89c2b0a65f9b43d42efc589faba79975733f9e58b7782c58.jpg", + "image_caption": [ + "Figure 12: Qualitative results of our GRF for novel view depth and RGB estimation on the SyntheticNeRF dataset. " + ], + "image_footnote": [], + "bbox": [ + 178, + 212, + 820, + 781 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/beeb4046890bf5004b0f81769e12fa68b175541b587410c51e428be01d998227.jpg", + "image_caption": [ + "Figure 13: Qualitative results of our GRF for novel view depth and RGB estimation on the SyntheticNeRF dataset. " + ], + "image_footnote": [], + "bbox": [ + 176, + 205, + 813, + 781 + ], + "page_idx": 23 + }, + { + "type": "image", + "img_path": "images/f8157646fde3d77d5203c0f15aa9ddd82767ee191425ac2129cfeb332f153e56.jpg", + "image_caption": [ + "Figure 14: Qualitative results of our GRF for novel view depth and RGB estimation on the real-world dataset. " + ], + "image_footnote": [], + "bbox": [ + 178, + 242, + 820, + 741 + ], + "page_idx": 24 + }, + { + "type": "image", + "img_path": "images/88f1544d6d632c9c8a99ef63ec61bd9fd14e5db337eb9260544d7c69beee1ad9.jpg", + "image_caption": [ + "Figure 15: Qualitative results of our GRF for novel view depth and RGB estimation on the real-world dataset. " + ], + "image_footnote": [], + "bbox": [ + 176, + 241, + 820, + 742 + ], + "page_idx": 25 + }, + { + "type": "image", + "img_path": "images/caf80e9622eb47880990dde4703304c939c21246832958437a9bef0ab4ca34d0.jpg", + "image_caption": [ + "Figure 16: Qualitative results of our GRF for novel view depth and RGB estimation on the real-world dataset. " + ], + "image_footnote": [], + "bbox": [ + 176, + 241, + 820, + 742 + ], + "page_idx": 26 + }, + { + "type": "image", + "img_path": "images/e60781d9d56ccf57a254173588c4ff5552b76267158d5a3703af27473667497f.jpg", + "image_caption": [ + "Figure 17: Qualitative results of our GRF for novel view depth and RGB estimation on the real-world dataset. " + ], + "image_footnote": [], + "bbox": [ + 178, + 239, + 820, + 742 + ], + "page_idx": 27 + } +] \ No newline at end of file diff --git a/parse/train/cAvgPMAA3hb/cAvgPMAA3hb_middle.json b/parse/train/cAvgPMAA3hb/cAvgPMAA3hb_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..6239d1dc8aba30bda72ba8da60c4d3e2a1958f28 --- /dev/null +++ b/parse/train/cAvgPMAA3hb/cAvgPMAA3hb_middle.json @@ -0,0 +1,45211 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 78, + 503, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 77, + 505, + 97 + ], + "spans": [ + { + "bbox": [ + 106, + 77, + 505, + 97 + ], + "score": 1.0, + "content": "GRF: LEARNING A GENERAL RADIANCE FIELD FOR", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 98, + 452, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 98, + 452, + 118 + ], + "score": 1.0, + "content": "3D SCENE REPRESENTATION AND RENDERING", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 113, + 135, + 245, + 157 + ], + "lines": [ + { + "bbox": [ + 113, + 136, + 201, + 147 + ], + "spans": [ + { + "bbox": [ + 113, + 136, + 201, + 147 + ], + "score": 1.0, + "content": "Anonymous authors", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 111, + 146, + 245, + 158 + ], + "spans": [ + { + "bbox": [ + 111, + 146, + 245, + 158 + ], + "score": 1.0, + "content": "Paper under double-blind review", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 278, + 186, + 333, + 199 + ], + "lines": [ + { + "bbox": [ + 277, + 186, + 335, + 200 + ], + "spans": [ + { + "bbox": [ + 277, + 186, + 335, + 200 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 143, + 206, + 468, + 339 + ], + "lines": [ + { + "bbox": [ + 142, + 206, + 469, + 219 + ], + "spans": [ + { + "bbox": [ + 142, + 206, + 469, + 219 + ], + "score": 1.0, + "content": "We present a simple yet powerful implicit neural function that can represent and", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 217, + 470, + 230 + ], + "spans": [ + { + "bbox": [ + 141, + 217, + 470, + 230 + ], + "score": 1.0, + "content": "render arbitrarily complex 3D scenes in a single network only from 2D observa-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 228, + 470, + 240 + ], + "spans": [ + { + "bbox": [ + 141, + 228, + 470, + 240 + ], + "score": 1.0, + "content": "tions. The function models 3D scenes as a general radiance field, which takes a", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 239, + 470, + 252 + ], + "spans": [ + { + "bbox": [ + 141, + 239, + 470, + 252 + ], + "score": 1.0, + "content": "set of 2D images with camera poses and intrinsics as input, constructs an internal", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 250, + 470, + 263 + ], + "spans": [ + { + "bbox": [ + 141, + 250, + 470, + 263 + ], + "score": 1.0, + "content": "representation for each 3D point of the scene, and renders the corresponding ap-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 261, + 469, + 274 + ], + "spans": [ + { + "bbox": [ + 141, + 261, + 469, + 274 + ], + "score": 1.0, + "content": "pearance and geometry of any 3D point viewing from an arbitrary angle. The key", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 273, + 470, + 285 + ], + "spans": [ + { + "bbox": [ + 141, + 273, + 470, + 285 + ], + "score": 1.0, + "content": "to our approach is to explicitly integrate the principle of multi-view geometry to", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 283, + 469, + 295 + ], + "spans": [ + { + "bbox": [ + 141, + 283, + 469, + 295 + ], + "score": 1.0, + "content": "obtain the internal representations from observed 2D views, such that the learned", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 142, + 295, + 470, + 308 + ], + "spans": [ + { + "bbox": [ + 142, + 295, + 470, + 308 + ], + "score": 1.0, + "content": "implicit representations empirically remain multi-view consistent. In addition, we", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 306, + 469, + 318 + ], + "spans": [ + { + "bbox": [ + 141, + 306, + 469, + 318 + ], + "score": 1.0, + "content": "introduce an effective neural module to learn general features for each pixel in 2D", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 317, + 469, + 330 + ], + "spans": [ + { + "bbox": [ + 141, + 317, + 469, + 330 + ], + "score": 1.0, + "content": "images, allowing the constructed internal 3D representations to be general as well.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 328, + 414, + 340 + ], + "spans": [ + { + "bbox": [ + 142, + 328, + 414, + 340 + ], + "score": 1.0, + "content": "Extensive experiments demonstrate the superiority of our approach.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 10.5 + }, + { + "type": "title", + "bbox": [ + 108, + 361, + 206, + 374 + ], + "lines": [ + { + "bbox": [ + 105, + 360, + 208, + 377 + ], + "spans": [ + { + "bbox": [ + 105, + 360, + 208, + 377 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 389, + 505, + 455 + ], + "lines": [ + { + "bbox": [ + 105, + 388, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 506, + 403 + ], + "score": 1.0, + "content": "Understanding the precise 3D structure of a real-world environment and realistically re-rendering", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 400, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 400, + 505, + 414 + ], + "score": 1.0, + "content": "it from free viewpoints is a key enabler for many critical tasks, ranging from robotic manipulation", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 412, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 505, + 424 + ], + "score": 1.0, + "content": "and navigation to augmented reality. Classic approaches to recover the 3D scene geometry mainly", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 422, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 422, + 505, + 435 + ], + "score": 1.0, + "content": "include the structure from motion (SfM) (Ozyesil et al., 2017) and simultaneous localization and", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 434, + 506, + 446 + ], + "spans": [ + { + "bbox": [ + 106, + 434, + 506, + 446 + ], + "score": 1.0, + "content": "mapping (SLAM) (Cadena et al., 2016) pipelines. However, they are limited to reconstruct sparse", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 444, + 409, + 457 + ], + "spans": [ + { + "bbox": [ + 106, + 444, + 409, + 457 + ], + "score": 1.0, + "content": "and discrete 3D point clouds which are unable to contain geometric details.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 107, + 461, + 505, + 538 + ], + "lines": [ + { + "bbox": [ + 105, + 460, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 505, + 474 + ], + "score": 1.0, + "content": "The recent advances in deep neural networks have yielded rapid progress in 3D modeling and un-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 471, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 505, + 486 + ], + "score": 1.0, + "content": "derstanding. Most of them focus on the explicit 3D shape representations such as voxel grids (Choy", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "score": 1.0, + "content": "et al., 2016), point clouds (Fan et al., 2017), or triangle meshes (Wang et al., 2018). However, these", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 495, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 505, + 507 + ], + "score": 1.0, + "content": "representations are discrete and sparse, limiting the recovered 3D structures to extremely low spatial", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 504, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 104, + 504, + 506, + 518 + ], + "score": 1.0, + "content": "resolution. In addition, these networks usually require large-scale 3D shapes for supervision, re-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 516, + 505, + 528 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 528 + ], + "score": 1.0, + "content": "sulting in the trained models being over-fitting particular datasets and unable to generalize to novel", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 527, + 443, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 443, + 540 + ], + "score": 1.0, + "content": "scenes. In fact, it is also costly and even infeasible to collect high-quality 3D labels.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 106, + 543, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 543, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 505, + 556 + ], + "score": 1.0, + "content": "Encoding geometries into multilayer perceptrons (MLPs) (Mescheder et al., 2019; Park et al., 2019)", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 555, + 503, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 503, + 568 + ], + "score": 1.0, + "content": "recently emerges as a promising direction in 3D reconstruction and understanding from 2D images.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 566, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 505, + 578 + ], + "score": 1.0, + "content": "Its key advantage is the ability to model 3D structures in a continuous way instead of discrete,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 576, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 505, + 589 + ], + "score": 1.0, + "content": "and therefore it has the potential to achieve unlimited spatial resolution in theory. However, most", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 587, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 505, + 601 + ], + "score": 1.0, + "content": "methods of this pipeline focus on individual objects. In addition, many of them require 3D ge-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "score": 1.0, + "content": "ometry for supervision to learn the 3D shapes from images. By introducing a recurrent neural", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 104, + 611, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 104, + 611, + 505, + 623 + ], + "score": 1.0, + "content": "network based renderer, SRNs (Sitzmann et al., 2019) is among the early work to learn implicit", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 622, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 634 + ], + "score": 1.0, + "content": "surface representations only from 2D images, but it fails to capture complicated scene geometries", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "score": 1.0, + "content": "and renders over-smoothed images. Alternatively, by leveraging the volume rendering to synthesize", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 644, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 655 + ], + "score": 1.0, + "content": "new views for 2D supervision, the very recent NeRF (Mildenhall et al., 2020) directly encodes the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 104, + 654, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 104, + 654, + 506, + 667 + ], + "score": 1.0, + "content": "radiance fields of complex 3D scenes within the weights of MLPs, achieving an unprecedented level", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 666, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 677 + ], + "score": 1.0, + "content": "of fidelity for challenging 3D scenes. Nevertheless, it has two major limitations: 1) since each 3D", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 677, + 505, + 688 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 688 + ], + "score": 1.0, + "content": "scene is encoded into all the weights of MLPs, the trained network (i.e., a learned radiance field)", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "can only represent a single scene, and is unable to generalize across novel scenarios; 2) because the", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "shape and appearance of each spatial 3D location along a light ray is only optimized by the available", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "pixel RGBs, the learned implicit representations of that location are lack of the general geometric", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 721, + 390, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 390, + 732 + ], + "score": 1.0, + "content": "patterns, resulting in the synthesized images being less photo-realistic.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 39 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 303, + 752, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "1", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 78, + 503, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 77, + 505, + 97 + ], + "spans": [ + { + "bbox": [ + 106, + 77, + 505, + 97 + ], + "score": 1.0, + "content": "GRF: LEARNING A GENERAL RADIANCE FIELD FOR", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 98, + 452, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 98, + 452, + 118 + ], + "score": 1.0, + "content": "3D SCENE REPRESENTATION AND RENDERING", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 113, + 135, + 245, + 157 + ], + "lines": [ + { + "bbox": [ + 113, + 136, + 201, + 147 + ], + "spans": [ + { + "bbox": [ + 113, + 136, + 201, + 147 + ], + "score": 1.0, + "content": "Anonymous authors", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 111, + 146, + 245, + 158 + ], + "spans": [ + { + "bbox": [ + 111, + 146, + 245, + 158 + ], + "score": 1.0, + "content": "Paper under double-blind review", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 111, + 136, + 245, + 158 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 186, + 333, + 199 + ], + "lines": [ + { + "bbox": [ + 277, + 186, + 335, + 200 + ], + "spans": [ + { + "bbox": [ + 277, + 186, + 335, + 200 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 143, + 206, + 468, + 339 + ], + "lines": [ + { + "bbox": [ + 142, + 206, + 469, + 219 + ], + "spans": [ + { + "bbox": [ + 142, + 206, + 469, + 219 + ], + "score": 1.0, + "content": "We present a simple yet powerful implicit neural function that can represent and", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 217, + 470, + 230 + ], + "spans": [ + { + "bbox": [ + 141, + 217, + 470, + 230 + ], + "score": 1.0, + "content": "render arbitrarily complex 3D scenes in a single network only from 2D observa-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 228, + 470, + 240 + ], + "spans": [ + { + "bbox": [ + 141, + 228, + 470, + 240 + ], + "score": 1.0, + "content": "tions. The function models 3D scenes as a general radiance field, which takes a", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 239, + 470, + 252 + ], + "spans": [ + { + "bbox": [ + 141, + 239, + 470, + 252 + ], + "score": 1.0, + "content": "set of 2D images with camera poses and intrinsics as input, constructs an internal", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 250, + 470, + 263 + ], + "spans": [ + { + "bbox": [ + 141, + 250, + 470, + 263 + ], + "score": 1.0, + "content": "representation for each 3D point of the scene, and renders the corresponding ap-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 261, + 469, + 274 + ], + "spans": [ + { + "bbox": [ + 141, + 261, + 469, + 274 + ], + "score": 1.0, + "content": "pearance and geometry of any 3D point viewing from an arbitrary angle. The key", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 273, + 470, + 285 + ], + "spans": [ + { + "bbox": [ + 141, + 273, + 470, + 285 + ], + "score": 1.0, + "content": "to our approach is to explicitly integrate the principle of multi-view geometry to", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 283, + 469, + 295 + ], + "spans": [ + { + "bbox": [ + 141, + 283, + 469, + 295 + ], + "score": 1.0, + "content": "obtain the internal representations from observed 2D views, such that the learned", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 142, + 295, + 470, + 308 + ], + "spans": [ + { + "bbox": [ + 142, + 295, + 470, + 308 + ], + "score": 1.0, + "content": "implicit representations empirically remain multi-view consistent. In addition, we", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 306, + 469, + 318 + ], + "spans": [ + { + "bbox": [ + 141, + 306, + 469, + 318 + ], + "score": 1.0, + "content": "introduce an effective neural module to learn general features for each pixel in 2D", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 317, + 469, + 330 + ], + "spans": [ + { + "bbox": [ + 141, + 317, + 469, + 330 + ], + "score": 1.0, + "content": "images, allowing the constructed internal 3D representations to be general as well.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 328, + 414, + 340 + ], + "spans": [ + { + "bbox": [ + 142, + 328, + 414, + 340 + ], + "score": 1.0, + "content": "Extensive experiments demonstrate the superiority of our approach.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 10.5, + "bbox_fs": [ + 141, + 206, + 470, + 340 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 361, + 206, + 374 + ], + "lines": [ + { + "bbox": [ + 105, + 360, + 208, + 377 + ], + "spans": [ + { + "bbox": [ + 105, + 360, + 208, + 377 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 389, + 505, + 455 + ], + "lines": [ + { + "bbox": [ + 105, + 388, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 506, + 403 + ], + "score": 1.0, + "content": "Understanding the precise 3D structure of a real-world environment and realistically re-rendering", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 400, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 400, + 505, + 414 + ], + "score": 1.0, + "content": "it from free viewpoints is a key enabler for many critical tasks, ranging from robotic manipulation", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 412, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 505, + 424 + ], + "score": 1.0, + "content": "and navigation to augmented reality. Classic approaches to recover the 3D scene geometry mainly", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 422, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 422, + 505, + 435 + ], + "score": 1.0, + "content": "include the structure from motion (SfM) (Ozyesil et al., 2017) and simultaneous localization and", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 434, + 506, + 446 + ], + "spans": [ + { + "bbox": [ + 106, + 434, + 506, + 446 + ], + "score": 1.0, + "content": "mapping (SLAM) (Cadena et al., 2016) pipelines. However, they are limited to reconstruct sparse", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 444, + 409, + 457 + ], + "spans": [ + { + "bbox": [ + 106, + 444, + 409, + 457 + ], + "score": 1.0, + "content": "and discrete 3D point clouds which are unable to contain geometric details.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 388, + 506, + 457 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 461, + 505, + 538 + ], + "lines": [ + { + "bbox": [ + 105, + 460, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 505, + 474 + ], + "score": 1.0, + "content": "The recent advances in deep neural networks have yielded rapid progress in 3D modeling and un-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 471, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 505, + 486 + ], + "score": 1.0, + "content": "derstanding. Most of them focus on the explicit 3D shape representations such as voxel grids (Choy", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "score": 1.0, + "content": "et al., 2016), point clouds (Fan et al., 2017), or triangle meshes (Wang et al., 2018). However, these", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 495, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 505, + 507 + ], + "score": 1.0, + "content": "representations are discrete and sparse, limiting the recovered 3D structures to extremely low spatial", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 504, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 104, + 504, + 506, + 518 + ], + "score": 1.0, + "content": "resolution. In addition, these networks usually require large-scale 3D shapes for supervision, re-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 516, + 505, + 528 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 528 + ], + "score": 1.0, + "content": "sulting in the trained models being over-fitting particular datasets and unable to generalize to novel", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 527, + 443, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 443, + 540 + ], + "score": 1.0, + "content": "scenes. In fact, it is also costly and even infeasible to collect high-quality 3D labels.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 27, + "bbox_fs": [ + 104, + 460, + 506, + 540 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 543, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 543, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 505, + 556 + ], + "score": 1.0, + "content": "Encoding geometries into multilayer perceptrons (MLPs) (Mescheder et al., 2019; Park et al., 2019)", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 555, + 503, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 503, + 568 + ], + "score": 1.0, + "content": "recently emerges as a promising direction in 3D reconstruction and understanding from 2D images.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 566, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 505, + 578 + ], + "score": 1.0, + "content": "Its key advantage is the ability to model 3D structures in a continuous way instead of discrete,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 576, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 505, + 589 + ], + "score": 1.0, + "content": "and therefore it has the potential to achieve unlimited spatial resolution in theory. However, most", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 587, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 505, + 601 + ], + "score": 1.0, + "content": "methods of this pipeline focus on individual objects. In addition, many of them require 3D ge-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "score": 1.0, + "content": "ometry for supervision to learn the 3D shapes from images. By introducing a recurrent neural", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 104, + 611, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 104, + 611, + 505, + 623 + ], + "score": 1.0, + "content": "network based renderer, SRNs (Sitzmann et al., 2019) is among the early work to learn implicit", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 622, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 634 + ], + "score": 1.0, + "content": "surface representations only from 2D images, but it fails to capture complicated scene geometries", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "score": 1.0, + "content": "and renders over-smoothed images. Alternatively, by leveraging the volume rendering to synthesize", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 644, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 655 + ], + "score": 1.0, + "content": "new views for 2D supervision, the very recent NeRF (Mildenhall et al., 2020) directly encodes the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 104, + 654, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 104, + 654, + 506, + 667 + ], + "score": 1.0, + "content": "radiance fields of complex 3D scenes within the weights of MLPs, achieving an unprecedented level", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 666, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 677 + ], + "score": 1.0, + "content": "of fidelity for challenging 3D scenes. Nevertheless, it has two major limitations: 1) since each 3D", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 677, + 505, + 688 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 688 + ], + "score": 1.0, + "content": "scene is encoded into all the weights of MLPs, the trained network (i.e., a learned radiance field)", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "can only represent a single scene, and is unable to generalize across novel scenarios; 2) because the", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "shape and appearance of each spatial 3D location along a light ray is only optimized by the available", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "pixel RGBs, the learned implicit representations of that location are lack of the general geometric", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 721, + 390, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 390, + 732 + ], + "score": 1.0, + "content": "patterns, resulting in the synthesized images being less photo-realistic.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 39, + "bbox_fs": [ + 104, + 543, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 185 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "In this paper, we propose a general radiance field (GRF), a simple yet powerful implicit function", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "that can represent and render complex 3D scenes where there may be multiple objects with cluttered", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 506, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 506, + 119 + ], + "score": 1.0, + "content": "background. Our GRF takes a set of 2D images with camera poses and intrinsics, a 3D query point", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 117, + 505, + 131 + ], + "spans": [ + { + "bbox": [ + 105, + 117, + 310, + 131 + ], + "score": 1.0, + "content": "and its query viewpoint (i.e., the camera location", + "type": "text" + }, + { + "bbox": [ + 310, + 118, + 331, + 130 + ], + "score": 0.41, + "content": "x y z )", + "type": "inline_equation" + }, + { + "bbox": [ + 332, + 117, + 505, + 131 + ], + "score": 1.0, + "content": "as input, and predicts the RGB value and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 128, + 506, + 142 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 506, + 142 + ], + "score": 1.0, + "content": "volumetric density of that query point. Basically, this neural function learns to represent a 3D scene", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 138, + 505, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 505, + 153 + ], + "score": 1.0, + "content": "from sparse 2D observations, and infers the shape and appearance of that scene from previously", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 150, + 505, + 164 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 505, + 164 + ], + "score": 1.0, + "content": "unobserved viewing angles. Note that, the inferred shape and appearance of any particular 3D query", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 162, + 506, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 162, + 506, + 174 + ], + "score": 1.0, + "content": "point explicitly take into account its local geometric patterns from the available 2D observations. In", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 173, + 342, + 186 + ], + "spans": [ + { + "bbox": [ + 105, + 173, + 342, + 186 + ], + "score": 1.0, + "content": "particular, the proposed GRF consists of four components:", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 189, + 505, + 276 + ], + "lines": [ + { + "bbox": [ + 105, + 188, + 484, + 203 + ], + "spans": [ + { + "bbox": [ + 105, + 188, + 484, + 203 + ], + "score": 1.0, + "content": "• Extracting the general 2D visual features for every light ray from the input 2D observations;", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 201, + 506, + 218 + ], + "spans": [ + { + "bbox": [ + 104, + 201, + 506, + 218 + ], + "score": 1.0, + "content": "• Reprojecting the corresponding 2D features back to the query 3D point using the principle of", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 113, + 214, + 204, + 228 + ], + "spans": [ + { + "bbox": [ + 113, + 214, + 204, + 228 + ], + "score": 1.0, + "content": "multi-view geometry;", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 226, + 505, + 243 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 505, + 243 + ], + "score": 1.0, + "content": "• Selecting and aggregating all the reprojected features for the query 3D point, while the visual", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 113, + 239, + 264, + 253 + ], + "spans": [ + { + "bbox": [ + 113, + 239, + 264, + 253 + ], + "score": 1.0, + "content": "occlusions are implicitly considered;", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 252, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 505, + 268 + ], + "score": 1.0, + "content": "• Rendering the aggregated features of the query 3D point along a particular query viewpoint, and", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 113, + 264, + 351, + 278 + ], + "spans": [ + { + "bbox": [ + 113, + 264, + 351, + 278 + ], + "score": 1.0, + "content": "producing the corresponding RGB and volumetric density.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 281, + 505, + 391 + ], + "lines": [ + { + "bbox": [ + 106, + 281, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 106, + 281, + 505, + 294 + ], + "score": 1.0, + "content": "These four components enable our GRF to be significantly different from all existing 3D scene repre-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 292, + 505, + 305 + ], + "spans": [ + { + "bbox": [ + 105, + 292, + 505, + 305 + ], + "score": 1.0, + "content": "sentation approaches. 1) Compared with the classic SfM/SLAM systems, our GRF can represent the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 303, + 505, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 505, + 316 + ], + "score": 1.0, + "content": "3D scene structure with smooth and continuous surfaces. 2) Compared with the neural approaches", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 314, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 314, + 505, + 327 + ], + "score": 1.0, + "content": "based on explicit voxel grids, point clouds and meshes, our GRF learns continuous 3D representa-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 325, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 505, + 338 + ], + "score": 1.0, + "content": "tions without requiring 3D data for training. 3) Compared with the existing implicit representation", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 336, + 505, + 349 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 505, + 349 + ], + "score": 1.0, + "content": "methods such as SDF (Park et al., 2019), SRNs (Sitzmann et al., 2019) and NeRF (Mildenhall et al.,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 346, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 505, + 360 + ], + "score": 1.0, + "content": "2020), our GRF can represent arbitrarily complicated 3D scenes and has remarkable generaliza-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 358, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 505, + 370 + ], + "score": 1.0, + "content": "tion to novel scenarios. In addition, the learned 3D representations carefully consider the general", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 369, + 505, + 382 + ], + "spans": [ + { + "bbox": [ + 104, + 369, + 505, + 382 + ], + "score": 1.0, + "content": "geometric patterns for every 3D spatial location, allowing the rendered views to be exceptionally", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 380, + 351, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 351, + 393 + ], + "score": 1.0, + "content": "realistic with fine-grained details. Our key contributions are:", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 106, + 396, + 505, + 469 + ], + "lines": [ + { + "bbox": [ + 105, + 395, + 506, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 506, + 409 + ], + "score": 1.0, + "content": "• We propose a general radiance field to implicitly represent the 3D scene structure and appearance", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 113, + 407, + 503, + 420 + ], + "spans": [ + { + "bbox": [ + 113, + 407, + 503, + 420 + ], + "score": 1.0, + "content": "purely from 2D images. It has remarkable generalization to novel scenes in a single forward pass.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 420, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 505, + 434 + ], + "score": 1.0, + "content": "• We explicitly integrate the principle of multi-view geometry to learn geometric details for each", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 110, + 432, + 502, + 446 + ], + "spans": [ + { + "bbox": [ + 110, + 432, + 502, + 446 + ], + "score": 1.0, + "content": "3D query point along every query light ray. This allows the synthesized 2D views to be superior.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 104, + 446, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 104, + 446, + 505, + 459 + ], + "score": 1.0, + "content": "• We demonstrate significant improvement over baselines on three large-scale datasets and provide", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 114, + 459, + 397, + 469 + ], + "spans": [ + { + "bbox": [ + 114, + 459, + 397, + 469 + ], + "score": 1.0, + "content": "intuition behind our design choices through extensive ablation studies.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5 + }, + { + "type": "title", + "bbox": [ + 108, + 489, + 211, + 502 + ], + "lines": [ + { + "bbox": [ + 105, + 488, + 213, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 213, + 504 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 106, + 517, + 505, + 605 + ], + "lines": [ + { + "bbox": [ + 105, + 516, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 530 + ], + "score": 1.0, + "content": "Classic Multi-view Geometry. Classic approaches to reconstruct 3D geometry from images mainly", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 528, + 505, + 540 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 505, + 540 + ], + "score": 1.0, + "content": "include SfM and SLAM systems, which firstly extract and match hand-crafted geometric local fea-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 540, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 106, + 540, + 505, + 551 + ], + "score": 1.0, + "content": "tures and then apply bundle adjustment for both shape and camera motion estimation (Hartley &", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 550, + 505, + 562 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 505, + 562 + ], + "score": 1.0, + "content": "Zisserman, 2004). Although they can recover visually satisfactory 3D models, the reconstructed", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 561, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 505, + 573 + ], + "score": 1.0, + "content": "shapes are usually sparse, discrete point clouds. In contrast, our GRF learns an implicit function", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 572, + 506, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 506, + 585 + ], + "score": 1.0, + "content": "to represent the continuous 3D structures from images. Notably, however, the principle of classic", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "multi-view geometry is explicitly integrated into our GRF to learn accurate and general features for", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 594, + 196, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 196, + 606 + ], + "score": 1.0, + "content": "every spatial location.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 36.5 + }, + { + "type": "text", + "bbox": [ + 106, + 610, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 611, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 106, + 611, + 505, + 623 + ], + "score": 1.0, + "content": "Geometric Deep Learning. The recent advances of deep neural nets have yielded impressive", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 622, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 506, + 635 + ], + "score": 1.0, + "content": "progress in recovering explicit 3D shapes from either single or multiple images, including the voxel", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 632, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 506, + 646 + ], + "score": 1.0, + "content": "grid (Choy et al., 2016; Yang et al., 2019), octree (Riegler et al., 2017; Christian et al., 2017), point", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 644, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 655 + ], + "score": 1.0, + "content": "cloud (Fan et al., 2017; Qi et al., 2017) and triangle mesh (Wang et al., 2018; Groueix et al., 2018;", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "score": 1.0, + "content": "Nash et al., 2020) based approaches. However, most of these methods only focus on individual 3D", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "objects, whilst only few pipelines (Song et al., 2017; Tulsiani et al., 2018; Gkioxari et al., 2019)", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 677, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 506, + 689 + ], + "score": 1.0, + "content": "attempt to learn the structures for complex 3D scenes. Although these neural networks can predict", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "realistic 3D structures of objects and scenes, they have two limitations. First, almost all of them re-", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 698, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 713 + ], + "score": 1.0, + "content": "quire ground truth 3D labels to supervise the networks, resulting in the learned representations being", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "unable to generalize to novel real-world scenes. Second, since the recovered 3D shapes are discrete,", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "they are unable to preserve high-resolution geometric details. Being quite different, our GRF learns", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 46 + } + ], + "page_idx": 1, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "score": 1.0, + "content": "2", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 185 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "In this paper, we propose a general radiance field (GRF), a simple yet powerful implicit function", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "that can represent and render complex 3D scenes where there may be multiple objects with cluttered", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 506, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 506, + 119 + ], + "score": 1.0, + "content": "background. Our GRF takes a set of 2D images with camera poses and intrinsics, a 3D query point", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 117, + 505, + 131 + ], + "spans": [ + { + "bbox": [ + 105, + 117, + 310, + 131 + ], + "score": 1.0, + "content": "and its query viewpoint (i.e., the camera location", + "type": "text" + }, + { + "bbox": [ + 310, + 118, + 331, + 130 + ], + "score": 0.41, + "content": "x y z )", + "type": "inline_equation" + }, + { + "bbox": [ + 332, + 117, + 505, + 131 + ], + "score": 1.0, + "content": "as input, and predicts the RGB value and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 128, + 506, + 142 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 506, + 142 + ], + "score": 1.0, + "content": "volumetric density of that query point. Basically, this neural function learns to represent a 3D scene", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 138, + 505, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 505, + 153 + ], + "score": 1.0, + "content": "from sparse 2D observations, and infers the shape and appearance of that scene from previously", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 150, + 505, + 164 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 505, + 164 + ], + "score": 1.0, + "content": "unobserved viewing angles. Note that, the inferred shape and appearance of any particular 3D query", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 162, + 506, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 162, + 506, + 174 + ], + "score": 1.0, + "content": "point explicitly take into account its local geometric patterns from the available 2D observations. In", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 173, + 342, + 186 + ], + "spans": [ + { + "bbox": [ + 105, + 173, + 342, + 186 + ], + "score": 1.0, + "content": "particular, the proposed GRF consists of four components:", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 82, + 506, + 186 + ] + }, + { + "type": "list", + "bbox": [ + 106, + 189, + 505, + 276 + ], + "lines": [ + { + "bbox": [ + 105, + 188, + 484, + 203 + ], + "spans": [ + { + "bbox": [ + 105, + 188, + 484, + 203 + ], + "score": 1.0, + "content": "• Extracting the general 2D visual features for every light ray from the input 2D observations;", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 201, + 506, + 218 + ], + "spans": [ + { + "bbox": [ + 104, + 201, + 506, + 218 + ], + "score": 1.0, + "content": "• Reprojecting the corresponding 2D features back to the query 3D point using the principle of", + "type": "text" + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 214, + 204, + 228 + ], + "spans": [ + { + "bbox": [ + 113, + 214, + 204, + 228 + ], + "score": 1.0, + "content": "multi-view geometry;", + "type": "text" + } + ], + "index": 11, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 226, + 505, + 243 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 505, + 243 + ], + "score": 1.0, + "content": "• Selecting and aggregating all the reprojected features for the query 3D point, while the visual", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 239, + 264, + 253 + ], + "spans": [ + { + "bbox": [ + 113, + 239, + 264, + 253 + ], + "score": 1.0, + "content": "occlusions are implicitly considered;", + "type": "text" + } + ], + "index": 13, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 252, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 505, + 268 + ], + "score": 1.0, + "content": "• Rendering the aggregated features of the query 3D point along a particular query viewpoint, and", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 264, + 351, + 278 + ], + "spans": [ + { + "bbox": [ + 113, + 264, + 351, + 278 + ], + "score": 1.0, + "content": "producing the corresponding RGB and volumetric density.", + "type": "text" + } + ], + "index": 15, + "is_list_end_line": true + } + ], + "index": 12, + "bbox_fs": [ + 104, + 188, + 506, + 278 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 281, + 505, + 391 + ], + "lines": [ + { + "bbox": [ + 106, + 281, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 106, + 281, + 505, + 294 + ], + "score": 1.0, + "content": "These four components enable our GRF to be significantly different from all existing 3D scene repre-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 292, + 505, + 305 + ], + "spans": [ + { + "bbox": [ + 105, + 292, + 505, + 305 + ], + "score": 1.0, + "content": "sentation approaches. 1) Compared with the classic SfM/SLAM systems, our GRF can represent the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 303, + 505, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 505, + 316 + ], + "score": 1.0, + "content": "3D scene structure with smooth and continuous surfaces. 2) Compared with the neural approaches", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 314, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 314, + 505, + 327 + ], + "score": 1.0, + "content": "based on explicit voxel grids, point clouds and meshes, our GRF learns continuous 3D representa-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 325, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 505, + 338 + ], + "score": 1.0, + "content": "tions without requiring 3D data for training. 3) Compared with the existing implicit representation", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 336, + 505, + 349 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 505, + 349 + ], + "score": 1.0, + "content": "methods such as SDF (Park et al., 2019), SRNs (Sitzmann et al., 2019) and NeRF (Mildenhall et al.,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 346, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 505, + 360 + ], + "score": 1.0, + "content": "2020), our GRF can represent arbitrarily complicated 3D scenes and has remarkable generaliza-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 358, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 505, + 370 + ], + "score": 1.0, + "content": "tion to novel scenarios. In addition, the learned 3D representations carefully consider the general", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 369, + 505, + 382 + ], + "spans": [ + { + "bbox": [ + 104, + 369, + 505, + 382 + ], + "score": 1.0, + "content": "geometric patterns for every 3D spatial location, allowing the rendered views to be exceptionally", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 380, + 351, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 351, + 393 + ], + "score": 1.0, + "content": "realistic with fine-grained details. Our key contributions are:", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 20.5, + "bbox_fs": [ + 104, + 281, + 505, + 393 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 396, + 505, + 469 + ], + "lines": [ + { + "bbox": [ + 105, + 395, + 506, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 506, + 409 + ], + "score": 1.0, + "content": "• We propose a general radiance field to implicitly represent the 3D scene structure and appearance", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 113, + 407, + 503, + 420 + ], + "spans": [ + { + "bbox": [ + 113, + 407, + 503, + 420 + ], + "score": 1.0, + "content": "purely from 2D images. It has remarkable generalization to novel scenes in a single forward pass.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 420, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 505, + 434 + ], + "score": 1.0, + "content": "• We explicitly integrate the principle of multi-view geometry to learn geometric details for each", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 110, + 432, + 502, + 446 + ], + "spans": [ + { + "bbox": [ + 110, + 432, + 502, + 446 + ], + "score": 1.0, + "content": "3D query point along every query light ray. This allows the synthesized 2D views to be superior.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 104, + 446, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 104, + 446, + 505, + 459 + ], + "score": 1.0, + "content": "• We demonstrate significant improvement over baselines on three large-scale datasets and provide", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 114, + 459, + 397, + 469 + ], + "spans": [ + { + "bbox": [ + 114, + 459, + 397, + 469 + ], + "score": 1.0, + "content": "intuition behind our design choices through extensive ablation studies.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5, + "bbox_fs": [ + 104, + 395, + 506, + 469 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 489, + 211, + 502 + ], + "lines": [ + { + "bbox": [ + 105, + 488, + 213, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 213, + 504 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 106, + 517, + 505, + 605 + ], + "lines": [ + { + "bbox": [ + 105, + 516, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 530 + ], + "score": 1.0, + "content": "Classic Multi-view Geometry. Classic approaches to reconstruct 3D geometry from images mainly", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 528, + 505, + 540 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 505, + 540 + ], + "score": 1.0, + "content": "include SfM and SLAM systems, which firstly extract and match hand-crafted geometric local fea-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 540, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 106, + 540, + 505, + 551 + ], + "score": 1.0, + "content": "tures and then apply bundle adjustment for both shape and camera motion estimation (Hartley &", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 550, + 505, + 562 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 505, + 562 + ], + "score": 1.0, + "content": "Zisserman, 2004). Although they can recover visually satisfactory 3D models, the reconstructed", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 561, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 505, + 573 + ], + "score": 1.0, + "content": "shapes are usually sparse, discrete point clouds. In contrast, our GRF learns an implicit function", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 572, + 506, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 506, + 585 + ], + "score": 1.0, + "content": "to represent the continuous 3D structures from images. Notably, however, the principle of classic", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "multi-view geometry is explicitly integrated into our GRF to learn accurate and general features for", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 594, + 196, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 196, + 606 + ], + "score": 1.0, + "content": "every spatial location.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 516, + 506, + 606 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 610, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 611, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 106, + 611, + 505, + 623 + ], + "score": 1.0, + "content": "Geometric Deep Learning. The recent advances of deep neural nets have yielded impressive", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 622, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 506, + 635 + ], + "score": 1.0, + "content": "progress in recovering explicit 3D shapes from either single or multiple images, including the voxel", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 632, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 506, + 646 + ], + "score": 1.0, + "content": "grid (Choy et al., 2016; Yang et al., 2019), octree (Riegler et al., 2017; Christian et al., 2017), point", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 644, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 655 + ], + "score": 1.0, + "content": "cloud (Fan et al., 2017; Qi et al., 2017) and triangle mesh (Wang et al., 2018; Groueix et al., 2018;", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "score": 1.0, + "content": "Nash et al., 2020) based approaches. However, most of these methods only focus on individual 3D", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "objects, whilst only few pipelines (Song et al., 2017; Tulsiani et al., 2018; Gkioxari et al., 2019)", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 677, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 506, + 689 + ], + "score": 1.0, + "content": "attempt to learn the structures for complex 3D scenes. Although these neural networks can predict", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "realistic 3D structures of objects and scenes, they have two limitations. First, almost all of them re-", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 698, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 713 + ], + "score": 1.0, + "content": "quire ground truth 3D labels to supervise the networks, resulting in the learned representations being", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "unable to generalize to novel real-world scenes. Second, since the recovered 3D shapes are discrete,", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "they are unable to preserve high-resolution geometric details. Being quite different, our GRF learns", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 104, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 104, + 81, + 506, + 96 + ], + "score": 1.0, + "content": "to infer continuous 3D shapes only from a set of 2D images with camera poses and intrinsics, which", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 451, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 451, + 106 + ], + "score": 1.0, + "content": "can be cheaply acquired and also allow better generalization across real-world scenes.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 46, + "bbox_fs": [ + 105, + 611, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 104, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 104, + 81, + 506, + 96 + ], + "score": 1.0, + "content": "to infer continuous 3D shapes only from a set of 2D images with camera poses and intrinsics, which", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 451, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 451, + 106 + ], + "score": 1.0, + "content": "can be cheaply acquired and also allow better generalization across real-world scenes.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 110, + 505, + 266 + ], + "lines": [ + { + "bbox": [ + 105, + 109, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 109, + 505, + 123 + ], + "score": 1.0, + "content": "Neural Implicit 3D Representations. The implicit representation of 3D shapes recently emerges", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "score": 1.0, + "content": "as a promising direction to recover 3D geometries. It is initially formulated as level sets by opti-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 144 + ], + "score": 1.0, + "content": "mizing neural nets which map xyz locations to an occupancy field (Mescheder et al., 2019; Saito", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 143, + 504, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 143, + 504, + 155 + ], + "score": 1.0, + "content": "et al., 2019) or a distance function (Park et al., 2019). The subsequent work (Niemeyer et al., 2020;", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 154, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 505, + 166 + ], + "score": 1.0, + "content": "Sitzmann et al., 2019; Liu et al., 2019b; Atzmon & Lipman, 2020a;b) introduce differentiable ren-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 165, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 106, + 165, + 505, + 178 + ], + "score": 1.0, + "content": "dering functions, allowing 2D images or raw 3D point clouds to supervise the networks, but only", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 506, + 188 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 506, + 188 + ], + "score": 1.0, + "content": "producing decent results on individual objects. Using neural radiance fields instead, the latest NeRF", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 187, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 106, + 187, + 505, + 199 + ], + "score": 1.0, + "content": "(Mildenhall et al., 2020) and the succeeding NSVF (Liu et al., 2020), NeRF-wild (Martin-Brualla", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 197, + 506, + 210 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 506, + 210 + ], + "score": 1.0, + "content": "et al., 2020), GRAF (Schwarz et al., 2020) demonstrate impressive results to represent complex", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 208, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 505, + 222 + ], + "score": 1.0, + "content": "3D scenes. However, they do not take into account the local geometric patterns for spatial loca-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 221, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 505, + 234 + ], + "score": 1.0, + "content": "tions, thereby the rendered 2D images being less realistic and sub-optimal. Additionally, both NeRF", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 232, + 504, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 232, + 504, + 246 + ], + "score": 1.0, + "content": "and NeRF-wild can only represent a single scene, and are unable to generalize to novel scenarios.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 243, + 506, + 258 + ], + "spans": [ + { + "bbox": [ + 105, + 243, + 506, + 258 + ], + "score": 1.0, + "content": "Uniquely, our GRF maps any set of images to the corresponding 3D scene structure with geometric", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 254, + 138, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 138, + 267 + ], + "score": 1.0, + "content": "details.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 106, + 272, + 505, + 350 + ], + "lines": [ + { + "bbox": [ + 105, + 271, + 506, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 271, + 506, + 285 + ], + "score": 1.0, + "content": "Novel View Synthesis and Neural Rendering. Novel view synthesis involves generating unseen", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 284, + 506, + 296 + ], + "spans": [ + { + "bbox": [ + 106, + 284, + 506, + 296 + ], + "score": 1.0, + "content": "views of a scene captured by multiple images. Existing methods usually learn an embedding of a", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 294, + 506, + 307 + ], + "spans": [ + { + "bbox": [ + 104, + 294, + 506, + 307 + ], + "score": 1.0, + "content": "scene and then estimate a new image given a viewing angle, including GAN based methods (Good-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 306, + 505, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 306, + 505, + 318 + ], + "score": 1.0, + "content": "fellow et al., 2014; Radford et al., 2016), variational auto-encoders (Kingma & Welling, 2014),", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 316, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 316, + 505, + 328 + ], + "score": 1.0, + "content": "autoregressive models (Oord et al., 2016), and other generative frameworks (Eslami et al., 2018).", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 327, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 106, + 327, + 505, + 340 + ], + "score": 1.0, + "content": "Although photo-realistic single images can be generated, these methods tend to learn the manifold", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 339, + 504, + 350 + ], + "spans": [ + { + "bbox": [ + 106, + 339, + 504, + 350 + ], + "score": 1.0, + "content": "of 2D images, instead of exploiting the underlying 3D geometry for consistent multi-view synthesis.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 106, + 354, + 505, + 454 + ], + "lines": [ + { + "bbox": [ + 106, + 354, + 505, + 368 + ], + "spans": [ + { + "bbox": [ + 106, + 354, + 505, + 368 + ], + "score": 1.0, + "content": "Neural rendering techniques (Fried et al., 2020; Kato et al., 2020) have recently been actively in-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 366, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 106, + 366, + 505, + 378 + ], + "score": 1.0, + "content": "vestigated and integrated into 3D reconstruction pipelines, where there are no ground truth 3D", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 376, + 505, + 389 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 505, + 389 + ], + "score": 1.0, + "content": "data available but only 2D images for supervision. To render the discrete voxel grids (Yan et al.,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 387, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 506, + 401 + ], + "score": 1.0, + "content": "2016; Rezende et al., 2016; Tulsiani et al., 2017), point clouds (Insafutdinov & Dosovitskiy, 2018),", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 399, + 505, + 411 + ], + "spans": [ + { + "bbox": [ + 106, + 399, + 505, + 411 + ], + "score": 1.0, + "content": "meshes (Kato et al., 2018; Chen et al., 2019; Liu et al., 2019a), and implicit surfaces (Liu et al.,", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 409, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 105, + 409, + 505, + 423 + ], + "score": 1.0, + "content": "2019b; Remelli et al., 2020), most of these techniques are designed with differentiable and approxi-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 420, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 505, + 434 + ], + "score": 1.0, + "content": "mate functions, but sacrifice the sharpness of synthesized images and the accuracy of estimated 3D", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 431, + 506, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 506, + 444 + ], + "score": 1.0, + "content": "shapes. By contrast, our GRF leverages the existing volume rendering method (Mildenhall et al.,", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 442, + 457, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 457, + 456 + ], + "score": 1.0, + "content": "2020) which is naturally differentiable and can accurately render the RGB per light ray.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 27 + }, + { + "type": "title", + "bbox": [ + 108, + 471, + 151, + 484 + ], + "lines": [ + { + "bbox": [ + 104, + 470, + 154, + 488 + ], + "spans": [ + { + "bbox": [ + 104, + 470, + 154, + 488 + ], + "score": 1.0, + "content": "3 GRF", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "title", + "bbox": [ + 107, + 498, + 178, + 510 + ], + "lines": [ + { + "bbox": [ + 105, + 497, + 180, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 180, + 512 + ], + "score": 1.0, + "content": "3.1 OVERVIEW", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 106, + 519, + 505, + 586 + ], + "lines": [ + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "score": 1.0, + "content": "Our GRF models the complex 3D scenes including the geometry and appearance as a neural function", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 107, + 530, + 505, + 543 + ], + "spans": [ + { + "bbox": [ + 107, + 531, + 122, + 543 + ], + "score": 0.62, + "content": "f _ { \\mathbf { W } }", + "type": "inline_equation" + }, + { + "bbox": [ + 123, + 530, + 405, + 543 + ], + "score": 1.0, + "content": "where W represent learnable parameters. This function takes a set of", + "type": "text" + }, + { + "bbox": [ + 406, + 531, + 417, + 541 + ], + "score": 0.82, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 530, + 505, + 543 + ], + "score": 1.0, + "content": "images together with", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 104, + 541, + 507, + 556 + ], + "spans": [ + { + "bbox": [ + 104, + 541, + 242, + 556 + ], + "score": 1.0, + "content": "their camera poses and intrinsics", + "type": "text" + }, + { + "bbox": [ + 242, + 542, + 460, + 554 + ], + "score": 0.9, + "content": "\\{ ( \\mathcal { T } _ { 1 } , \\pmb { \\xi } _ { 1 } , \\pmb { K } _ { 1 } ) \\cdot \\cdot \\cdot ( \\mathcal { T } _ { m } , \\pmb { \\xi } _ { m } , \\pmb { K } _ { m } ) \\cdot \\cdot \\cdot ( \\mathcal { T } _ { M } , \\pmb { \\xi } _ { M } , \\pmb { K } _ { M } ) \\} _ { \\{ \\pmb { \\xi } _ { 1 } , \\pmb { \\xi } _ { 1 } , \\pmb { K } _ { 1 } \\} }", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 541, + 507, + 556 + ], + "score": 1.0, + "content": ", which are", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 103, + 552, + 506, + 566 + ], + "spans": [ + { + "bbox": [ + 103, + 552, + 330, + 566 + ], + "score": 1.0, + "content": "sampled from a complex 3D scene, a query 3D point", + "type": "text" + }, + { + "bbox": [ + 330, + 553, + 401, + 565 + ], + "score": 0.89, + "content": "p = \\{ x _ { p } , y _ { p } , z _ { p } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 552, + 506, + 566 + ], + "score": 1.0, + "content": ", and its query viewpoint", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 559, + 508, + 582 + ], + "spans": [ + { + "bbox": [ + 106, + 564, + 181, + 577 + ], + "score": 0.92, + "content": "\\mathcal { V } _ { p } = \\{ x _ { p } ^ { v } , y _ { p } ^ { v } , z _ { p } ^ { v } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 559, + 349, + 582 + ], + "score": 1.0, + "content": "as input, and then predicts the RGB value", + "type": "text" + }, + { + "bbox": [ + 349, + 565, + 396, + 576 + ], + "score": 0.89, + "content": "\\{ r _ { p } , g _ { p } , b _ { p } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 396, + 559, + 508, + 582 + ], + "score": 1.0, + "content": "and the volumetric density", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 107, + 573, + 504, + 587 + ], + "spans": [ + { + "bbox": [ + 107, + 576, + 117, + 587 + ], + "score": 0.87, + "content": "d _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 118, + 573, + 208, + 587 + ], + "score": 1.0, + "content": "of that query 3D point", + "type": "text" + }, + { + "bbox": [ + 209, + 577, + 215, + 586 + ], + "score": 0.8, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 573, + 357, + 587 + ], + "score": 1.0, + "content": "observed from the query viewpoint", + "type": "text" + }, + { + "bbox": [ + 357, + 576, + 369, + 586 + ], + "score": 0.87, + "content": "\\gamma _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 573, + 504, + 587 + ], + "score": 1.0, + "content": ". Formally, it is defined as below:", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 36.5 + }, + { + "type": "interline_equation", + "bbox": [ + 121, + 586, + 476, + 614 + ], + "lines": [ + { + "bbox": [ + 121, + 586, + 476, + 614 + ], + "spans": [ + { + "bbox": [ + 121, + 586, + 476, + 614 + ], + "score": 0.9, + "content": "( r _ { p } , g _ { p } , b _ { p } , d _ { p } ) = f _ { \\mathbf { W } } \\left( \\Big \\{ ( \\mathcal { T } _ { 1 } , \\pmb { \\xi } _ { 1 } , K _ { 1 } ) \\cdot \\cdot \\cdot ( \\mathcal { T } _ { M } , \\pmb { \\xi } _ { M } , K _ { M } ) \\Big \\} , \\{ x _ { p } , y _ { p } , z _ { p } \\} , \\{ x _ { p } ^ { v } , y _ { p } ^ { v } , z _ { p } ^ { v } \\} \\right)", + "type": "interline_equation", + "image_path": "5d3c6c72c009754a82db30af933402975893bbbecaaa520ff95b6877dfab572f.jpg" + } + ] + } + ], + "index": 41, + "virtual_lines": [ + { + "bbox": [ + 121, + 586, + 476, + 595.3333333333334 + ], + "spans": [], + "index": 40 + }, + { + "bbox": [ + 121, + 595.3333333333334, + 476, + 604.6666666666667 + ], + "spans": [], + "index": 41 + }, + { + "bbox": [ + 121, + 604.6666666666667, + 476, + 614.0000000000001 + ], + "spans": [], + "index": 42 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 613, + 505, + 645 + ], + "lines": [ + { + "bbox": [ + 105, + 612, + 505, + 625 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 505, + 625 + ], + "score": 1.0, + "content": "Basically, this function is a general radiance field (GRF) which parameterizes arbitrary 3D scenes", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 622, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 198, + 637 + ], + "score": 1.0, + "content": "observed by the input", + "type": "text" + }, + { + "bbox": [ + 198, + 623, + 210, + 633 + ], + "score": 0.81, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 622, + 505, + 637 + ], + "score": 1.0, + "content": "images. In the meantime, it returns both the appearance and geometry,", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 634, + 398, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 634, + 248, + 646 + ], + "score": 1.0, + "content": "when being queried at any location", + "type": "text" + }, + { + "bbox": [ + 249, + 636, + 255, + 646 + ], + "score": 0.81, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 634, + 336, + 646 + ], + "score": 1.0, + "content": "from any viewpoint", + "type": "text" + }, + { + "bbox": [ + 337, + 635, + 345, + 644 + ], + "score": 0.81, + "content": "\\nu", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 634, + 398, + 646 + ], + "score": 1.0, + "content": "in 3D space.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44 + }, + { + "type": "text", + "bbox": [ + 106, + 650, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 649, + 506, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 506, + 664 + ], + "score": 1.0, + "content": "As illustrated in Figure 1, the proposed GRF firstly extracts general features for each light ray hitting", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 662, + 505, + 675 + ], + "spans": [ + { + "bbox": [ + 106, + 662, + 447, + 675 + ], + "score": 1.0, + "content": "through every pixel, and then reprojects those features back to the query 3D point", + "type": "text" + }, + { + "bbox": [ + 447, + 664, + 453, + 674 + ], + "score": 0.75, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 662, + 505, + 675 + ], + "score": 1.0, + "content": ". After that,", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 672, + 506, + 685 + ], + "spans": [ + { + "bbox": [ + 106, + 672, + 335, + 685 + ], + "score": 1.0, + "content": "the corresponding RGB value and volumetric density of", + "type": "text" + }, + { + "bbox": [ + 335, + 675, + 342, + 684 + ], + "score": 0.81, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 672, + 506, + 685 + ], + "score": 1.0, + "content": "are inferred from those features given a", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 684, + 505, + 697 + ], + "spans": [ + { + "bbox": [ + 105, + 684, + 505, + 697 + ], + "score": 1.0, + "content": "specific query viewpoint. This simple design of GRF follows the principle of classic multi-view", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 695, + 506, + 709 + ], + "spans": [ + { + "bbox": [ + 105, + 695, + 506, + 709 + ], + "score": 1.0, + "content": "geometry (Hartley & Zisserman, 2004), therefore driving the learned implicit representations to be", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 708, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 505, + 721 + ], + "score": 1.0, + "content": "multi-view consistent. In particular, for any query 3D point in space, its features are always the", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "same when being viewing from different angles. Hence, its rendered RGBs and volumetric densities", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 49 + } + ], + "page_idx": 2, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 104, + 81, + 506, + 106 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 110, + 505, + 266 + ], + "lines": [ + { + "bbox": [ + 105, + 109, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 109, + 505, + 123 + ], + "score": 1.0, + "content": "Neural Implicit 3D Representations. The implicit representation of 3D shapes recently emerges", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "score": 1.0, + "content": "as a promising direction to recover 3D geometries. It is initially formulated as level sets by opti-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 144 + ], + "score": 1.0, + "content": "mizing neural nets which map xyz locations to an occupancy field (Mescheder et al., 2019; Saito", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 143, + 504, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 143, + 504, + 155 + ], + "score": 1.0, + "content": "et al., 2019) or a distance function (Park et al., 2019). The subsequent work (Niemeyer et al., 2020;", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 154, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 505, + 166 + ], + "score": 1.0, + "content": "Sitzmann et al., 2019; Liu et al., 2019b; Atzmon & Lipman, 2020a;b) introduce differentiable ren-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 165, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 106, + 165, + 505, + 178 + ], + "score": 1.0, + "content": "dering functions, allowing 2D images or raw 3D point clouds to supervise the networks, but only", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 506, + 188 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 506, + 188 + ], + "score": 1.0, + "content": "producing decent results on individual objects. Using neural radiance fields instead, the latest NeRF", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 187, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 106, + 187, + 505, + 199 + ], + "score": 1.0, + "content": "(Mildenhall et al., 2020) and the succeeding NSVF (Liu et al., 2020), NeRF-wild (Martin-Brualla", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 197, + 506, + 210 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 506, + 210 + ], + "score": 1.0, + "content": "et al., 2020), GRAF (Schwarz et al., 2020) demonstrate impressive results to represent complex", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 208, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 505, + 222 + ], + "score": 1.0, + "content": "3D scenes. However, they do not take into account the local geometric patterns for spatial loca-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 221, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 505, + 234 + ], + "score": 1.0, + "content": "tions, thereby the rendered 2D images being less realistic and sub-optimal. Additionally, both NeRF", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 232, + 504, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 232, + 504, + 246 + ], + "score": 1.0, + "content": "and NeRF-wild can only represent a single scene, and are unable to generalize to novel scenarios.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 243, + 506, + 258 + ], + "spans": [ + { + "bbox": [ + 105, + 243, + 506, + 258 + ], + "score": 1.0, + "content": "Uniquely, our GRF maps any set of images to the corresponding 3D scene structure with geometric", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 254, + 138, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 138, + 267 + ], + "score": 1.0, + "content": "details.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 109, + 506, + 267 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 272, + 505, + 350 + ], + "lines": [ + { + "bbox": [ + 105, + 271, + 506, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 271, + 506, + 285 + ], + "score": 1.0, + "content": "Novel View Synthesis and Neural Rendering. Novel view synthesis involves generating unseen", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 284, + 506, + 296 + ], + "spans": [ + { + "bbox": [ + 106, + 284, + 506, + 296 + ], + "score": 1.0, + "content": "views of a scene captured by multiple images. Existing methods usually learn an embedding of a", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 294, + 506, + 307 + ], + "spans": [ + { + "bbox": [ + 104, + 294, + 506, + 307 + ], + "score": 1.0, + "content": "scene and then estimate a new image given a viewing angle, including GAN based methods (Good-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 306, + 505, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 306, + 505, + 318 + ], + "score": 1.0, + "content": "fellow et al., 2014; Radford et al., 2016), variational auto-encoders (Kingma & Welling, 2014),", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 316, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 316, + 505, + 328 + ], + "score": 1.0, + "content": "autoregressive models (Oord et al., 2016), and other generative frameworks (Eslami et al., 2018).", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 327, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 106, + 327, + 505, + 340 + ], + "score": 1.0, + "content": "Although photo-realistic single images can be generated, these methods tend to learn the manifold", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 339, + 504, + 350 + ], + "spans": [ + { + "bbox": [ + 106, + 339, + 504, + 350 + ], + "score": 1.0, + "content": "of 2D images, instead of exploiting the underlying 3D geometry for consistent multi-view synthesis.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 19, + "bbox_fs": [ + 104, + 271, + 506, + 350 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 354, + 505, + 454 + ], + "lines": [ + { + "bbox": [ + 106, + 354, + 505, + 368 + ], + "spans": [ + { + "bbox": [ + 106, + 354, + 505, + 368 + ], + "score": 1.0, + "content": "Neural rendering techniques (Fried et al., 2020; Kato et al., 2020) have recently been actively in-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 366, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 106, + 366, + 505, + 378 + ], + "score": 1.0, + "content": "vestigated and integrated into 3D reconstruction pipelines, where there are no ground truth 3D", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 376, + 505, + 389 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 505, + 389 + ], + "score": 1.0, + "content": "data available but only 2D images for supervision. To render the discrete voxel grids (Yan et al.,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 387, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 506, + 401 + ], + "score": 1.0, + "content": "2016; Rezende et al., 2016; Tulsiani et al., 2017), point clouds (Insafutdinov & Dosovitskiy, 2018),", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 399, + 505, + 411 + ], + "spans": [ + { + "bbox": [ + 106, + 399, + 505, + 411 + ], + "score": 1.0, + "content": "meshes (Kato et al., 2018; Chen et al., 2019; Liu et al., 2019a), and implicit surfaces (Liu et al.,", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 409, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 105, + 409, + 505, + 423 + ], + "score": 1.0, + "content": "2019b; Remelli et al., 2020), most of these techniques are designed with differentiable and approxi-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 420, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 505, + 434 + ], + "score": 1.0, + "content": "mate functions, but sacrifice the sharpness of synthesized images and the accuracy of estimated 3D", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 431, + 506, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 506, + 444 + ], + "score": 1.0, + "content": "shapes. By contrast, our GRF leverages the existing volume rendering method (Mildenhall et al.,", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 442, + 457, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 457, + 456 + ], + "score": 1.0, + "content": "2020) which is naturally differentiable and can accurately render the RGB per light ray.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 354, + 506, + 456 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 471, + 151, + 484 + ], + "lines": [ + { + "bbox": [ + 104, + 470, + 154, + 488 + ], + "spans": [ + { + "bbox": [ + 104, + 470, + 154, + 488 + ], + "score": 1.0, + "content": "3 GRF", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "title", + "bbox": [ + 107, + 498, + 178, + 510 + ], + "lines": [ + { + "bbox": [ + 105, + 497, + 180, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 180, + 512 + ], + "score": 1.0, + "content": "3.1 OVERVIEW", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 106, + 519, + 505, + 586 + ], + "lines": [ + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "score": 1.0, + "content": "Our GRF models the complex 3D scenes including the geometry and appearance as a neural function", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 107, + 530, + 505, + 543 + ], + "spans": [ + { + "bbox": [ + 107, + 531, + 122, + 543 + ], + "score": 0.62, + "content": "f _ { \\mathbf { W } }", + "type": "inline_equation" + }, + { + "bbox": [ + 123, + 530, + 405, + 543 + ], + "score": 1.0, + "content": "where W represent learnable parameters. This function takes a set of", + "type": "text" + }, + { + "bbox": [ + 406, + 531, + 417, + 541 + ], + "score": 0.82, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 530, + 505, + 543 + ], + "score": 1.0, + "content": "images together with", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 104, + 541, + 507, + 556 + ], + "spans": [ + { + "bbox": [ + 104, + 541, + 242, + 556 + ], + "score": 1.0, + "content": "their camera poses and intrinsics", + "type": "text" + }, + { + "bbox": [ + 242, + 542, + 460, + 554 + ], + "score": 0.9, + "content": "\\{ ( \\mathcal { T } _ { 1 } , \\pmb { \\xi } _ { 1 } , \\pmb { K } _ { 1 } ) \\cdot \\cdot \\cdot ( \\mathcal { T } _ { m } , \\pmb { \\xi } _ { m } , \\pmb { K } _ { m } ) \\cdot \\cdot \\cdot ( \\mathcal { T } _ { M } , \\pmb { \\xi } _ { M } , \\pmb { K } _ { M } ) \\} _ { \\{ \\pmb { \\xi } _ { 1 } , \\pmb { \\xi } _ { 1 } , \\pmb { K } _ { 1 } \\} }", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 541, + 507, + 556 + ], + "score": 1.0, + "content": ", which are", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 103, + 552, + 506, + 566 + ], + "spans": [ + { + "bbox": [ + 103, + 552, + 330, + 566 + ], + "score": 1.0, + "content": "sampled from a complex 3D scene, a query 3D point", + "type": "text" + }, + { + "bbox": [ + 330, + 553, + 401, + 565 + ], + "score": 0.89, + "content": "p = \\{ x _ { p } , y _ { p } , z _ { p } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 552, + 506, + 566 + ], + "score": 1.0, + "content": ", and its query viewpoint", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 559, + 508, + 582 + ], + "spans": [ + { + "bbox": [ + 106, + 564, + 181, + 577 + ], + "score": 0.92, + "content": "\\mathcal { V } _ { p } = \\{ x _ { p } ^ { v } , y _ { p } ^ { v } , z _ { p } ^ { v } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 559, + 349, + 582 + ], + "score": 1.0, + "content": "as input, and then predicts the RGB value", + "type": "text" + }, + { + "bbox": [ + 349, + 565, + 396, + 576 + ], + "score": 0.89, + "content": "\\{ r _ { p } , g _ { p } , b _ { p } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 396, + 559, + 508, + 582 + ], + "score": 1.0, + "content": "and the volumetric density", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 107, + 573, + 504, + 587 + ], + "spans": [ + { + "bbox": [ + 107, + 576, + 117, + 587 + ], + "score": 0.87, + "content": "d _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 118, + 573, + 208, + 587 + ], + "score": 1.0, + "content": "of that query 3D point", + "type": "text" + }, + { + "bbox": [ + 209, + 577, + 215, + 586 + ], + "score": 0.8, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 573, + 357, + 587 + ], + "score": 1.0, + "content": "observed from the query viewpoint", + "type": "text" + }, + { + "bbox": [ + 357, + 576, + 369, + 586 + ], + "score": 0.87, + "content": "\\gamma _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 573, + 504, + 587 + ], + "score": 1.0, + "content": ". Formally, it is defined as below:", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 36.5, + "bbox_fs": [ + 103, + 519, + 508, + 587 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 121, + 586, + 476, + 614 + ], + "lines": [ + { + "bbox": [ + 121, + 586, + 476, + 614 + ], + "spans": [ + { + "bbox": [ + 121, + 586, + 476, + 614 + ], + "score": 0.9, + "content": "( r _ { p } , g _ { p } , b _ { p } , d _ { p } ) = f _ { \\mathbf { W } } \\left( \\Big \\{ ( \\mathcal { T } _ { 1 } , \\pmb { \\xi } _ { 1 } , K _ { 1 } ) \\cdot \\cdot \\cdot ( \\mathcal { T } _ { M } , \\pmb { \\xi } _ { M } , K _ { M } ) \\Big \\} , \\{ x _ { p } , y _ { p } , z _ { p } \\} , \\{ x _ { p } ^ { v } , y _ { p } ^ { v } , z _ { p } ^ { v } \\} \\right)", + "type": "interline_equation", + "image_path": "5d3c6c72c009754a82db30af933402975893bbbecaaa520ff95b6877dfab572f.jpg" + } + ] + } + ], + "index": 41, + "virtual_lines": [ + { + "bbox": [ + 121, + 586, + 476, + 595.3333333333334 + ], + "spans": [], + "index": 40 + }, + { + "bbox": [ + 121, + 595.3333333333334, + 476, + 604.6666666666667 + ], + "spans": [], + "index": 41 + }, + { + "bbox": [ + 121, + 604.6666666666667, + 476, + 614.0000000000001 + ], + "spans": [], + "index": 42 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 613, + 505, + 645 + ], + "lines": [ + { + "bbox": [ + 105, + 612, + 505, + 625 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 505, + 625 + ], + "score": 1.0, + "content": "Basically, this function is a general radiance field (GRF) which parameterizes arbitrary 3D scenes", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 622, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 198, + 637 + ], + "score": 1.0, + "content": "observed by the input", + "type": "text" + }, + { + "bbox": [ + 198, + 623, + 210, + 633 + ], + "score": 0.81, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 622, + 505, + 637 + ], + "score": 1.0, + "content": "images. In the meantime, it returns both the appearance and geometry,", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 634, + 398, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 634, + 248, + 646 + ], + "score": 1.0, + "content": "when being queried at any location", + "type": "text" + }, + { + "bbox": [ + 249, + 636, + 255, + 646 + ], + "score": 0.81, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 634, + 336, + 646 + ], + "score": 1.0, + "content": "from any viewpoint", + "type": "text" + }, + { + "bbox": [ + 337, + 635, + 345, + 644 + ], + "score": 0.81, + "content": "\\nu", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 634, + 398, + 646 + ], + "score": 1.0, + "content": "in 3D space.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44, + "bbox_fs": [ + 105, + 612, + 505, + 646 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 650, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 649, + 506, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 506, + 664 + ], + "score": 1.0, + "content": "As illustrated in Figure 1, the proposed GRF firstly extracts general features for each light ray hitting", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 662, + 505, + 675 + ], + "spans": [ + { + "bbox": [ + 106, + 662, + 447, + 675 + ], + "score": 1.0, + "content": "through every pixel, and then reprojects those features back to the query 3D point", + "type": "text" + }, + { + "bbox": [ + 447, + 664, + 453, + 674 + ], + "score": 0.75, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 662, + 505, + 675 + ], + "score": 1.0, + "content": ". After that,", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 672, + 506, + 685 + ], + "spans": [ + { + "bbox": [ + 106, + 672, + 335, + 685 + ], + "score": 1.0, + "content": "the corresponding RGB value and volumetric density of", + "type": "text" + }, + { + "bbox": [ + 335, + 675, + 342, + 684 + ], + "score": 0.81, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 672, + 506, + 685 + ], + "score": 1.0, + "content": "are inferred from those features given a", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 684, + 505, + 697 + ], + "spans": [ + { + "bbox": [ + 105, + 684, + 505, + 697 + ], + "score": 1.0, + "content": "specific query viewpoint. This simple design of GRF follows the principle of classic multi-view", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 695, + 506, + 709 + ], + "spans": [ + { + "bbox": [ + 105, + 695, + 506, + 709 + ], + "score": 1.0, + "content": "geometry (Hartley & Zisserman, 2004), therefore driving the learned implicit representations to be", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 708, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 505, + 721 + ], + "score": 1.0, + "content": "multi-view consistent. In particular, for any query 3D point in space, its features are always the", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "same when being viewing from different angles. Hence, its rendered RGBs and volumetric densities", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 106, + 198, + 506, + 212 + ], + "spans": [ + { + "bbox": [ + 106, + 198, + 470, + 212 + ], + "score": 1.0, + "content": "are more likely to be consistent from different viewpoints. To realize our neural function", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 470, + 199, + 486, + 210 + ], + "score": 0.77, + "content": "f _ { \\mathbf { W } }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 487, + 198, + 506, + 212 + ], + "score": 1.0, + "content": ", we", + "type": "text", + "cross_page": true + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "introduce four components: 1) A feature extractor for every 2D pixel; 2) A reprojector to transform", + "type": "text", + "cross_page": true + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 219, + 506, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 506, + 235 + ], + "score": 1.0, + "content": "2D features to 3D space; 3) An aggregator to obtain general features for a 3D point; and 4) A neural", + "type": "text", + "cross_page": true + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 232, + 506, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 506, + 245 + ], + "score": 1.0, + "content": "renderer to infer the appearance and geometry for that 3D point. All these components are connected", + "type": "text", + "cross_page": true + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 241, + 288, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 241, + 288, + 256 + ], + "score": 1.0, + "content": "and trained end-to-end with arbitrary scenes.", + "type": "text", + "cross_page": true + } + ], + "index": 12 + } + ], + "index": 49, + "bbox_fs": [ + 105, + 649, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 207, + 79, + 405, + 175 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 207, + 79, + 405, + 175 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 207, + 79, + 405, + 175 + ], + "spans": [ + { + "bbox": [ + 207, + 79, + 405, + 175 + ], + "score": 0.962, + "type": "image", + "image_path": "56d1944f4d23a0a0a15e2089b674d2311f3342f1b49f441d770342b7eecce36d.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 207, + 79, + 405, + 92.71428571428571 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 207, + 92.71428571428571, + 405, + 106.42857142857142 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 207, + 106.42857142857142, + 405, + 120.14285714285712 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 207, + 120.14285714285712, + 405, + 133.85714285714283 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 207, + 133.85714285714283, + 405, + 147.57142857142856 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 207, + 147.57142857142856, + 405, + 161.28571428571428 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 207, + 161.28571428571428, + 405, + 175.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 187, + 176, + 422, + 188 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 186, + 174, + 421, + 190 + ], + "spans": [ + { + "bbox": [ + 186, + 174, + 421, + 190 + ], + "score": 1.0, + "content": "Figure 1: Overview of the proposed general radiance field.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + } + ], + "index": 5.0 + }, + { + "type": "text", + "bbox": [ + 106, + 199, + 506, + 254 + ], + "lines": [ + { + "bbox": [ + 106, + 198, + 506, + 212 + ], + "spans": [ + { + "bbox": [ + 106, + 198, + 470, + 212 + ], + "score": 1.0, + "content": "are more likely to be consistent from different viewpoints. To realize our neural function", + "type": "text" + }, + { + "bbox": [ + 470, + 199, + 486, + 210 + ], + "score": 0.77, + "content": "f _ { \\mathbf { W } }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 198, + 506, + 212 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "introduce four components: 1) A feature extractor for every 2D pixel; 2) A reprojector to transform", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 219, + 506, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 506, + 235 + ], + "score": 1.0, + "content": "2D features to 3D space; 3) An aggregator to obtain general features for a 3D point; and 4) A neural", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 232, + 506, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 506, + 245 + ], + "score": 1.0, + "content": "renderer to infer the appearance and geometry for that 3D point. All these components are connected", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 241, + 288, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 241, + 288, + 256 + ], + "score": 1.0, + "content": "and trained end-to-end with arbitrary scenes.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10 + }, + { + "type": "title", + "bbox": [ + 107, + 269, + 349, + 281 + ], + "lines": [ + { + "bbox": [ + 105, + 269, + 350, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 269, + 350, + 282 + ], + "score": 1.0, + "content": "3.2 EXTRACTING GENERAL FEATURES FOR 2D PIXELS", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 107, + 290, + 336, + 401 + ], + "lines": [ + { + "bbox": [ + 106, + 290, + 336, + 303 + ], + "spans": [ + { + "bbox": [ + 106, + 290, + 336, + 303 + ], + "score": 1.0, + "content": "The whole input set of observed 2D images together de-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 302, + 337, + 314 + ], + "spans": [ + { + "bbox": [ + 106, + 302, + 337, + 314 + ], + "score": 1.0, + "content": "scribes the geometry and appearance of a 3D scene, while", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 313, + 337, + 325 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 337, + 325 + ], + "score": 1.0, + "content": "each pixel of those images describes a specific point of", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 324, + 336, + 336 + ], + "spans": [ + { + "bbox": [ + 106, + 324, + 336, + 336 + ], + "score": 1.0, + "content": "that scene. This module aims to extract the general fea-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 335, + 336, + 346 + ], + "spans": [ + { + "bbox": [ + 106, + 335, + 336, + 346 + ], + "score": 1.0, + "content": "tures of each pixel, so to learn the regional description and", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 346, + 337, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 337, + 358 + ], + "score": 1.0, + "content": "geometric patterns for each light ray. A naive approach is", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 357, + 337, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 337, + 369 + ], + "score": 1.0, + "content": "to directly use the raw rgb values as the pixel features.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 367, + 337, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 367, + 337, + 379 + ], + "score": 1.0, + "content": "However, this is sub-optimal because the raw rgb values", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 378, + 337, + 391 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 337, + 391 + ], + "score": 1.0, + "content": "are sensitive to lighting conditions, environmental noise,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 390, + 337, + 402 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 337, + 402 + ], + "score": 1.0, + "content": "etc. In order to learn more general and robust patterns for", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 18.5 + }, + { + "type": "image", + "bbox": [ + 347, + 295, + 504, + 369 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 347, + 295, + 504, + 369 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 347, + 295, + 504, + 369 + ], + "spans": [ + { + "bbox": [ + 347, + 295, + 504, + 369 + ], + "score": 0.966, + "type": "image", + "image_path": "b2e9605ba008f372de37a5ed751410ac325144fee0bb3ce35aceec07022d20bd.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 347, + 295, + 504, + 309.8 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 347, + 309.8, + 504, + 324.6 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 347, + 324.6, + 504, + 339.40000000000003 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 347, + 339.40000000000003, + 504, + 354.20000000000005 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 347, + 354.20000000000005, + 504, + 369.00000000000006 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 344, + 373, + 505, + 393 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 343, + 372, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 343, + 372, + 505, + 384 + ], + "score": 1.0, + "content": "Figure 2: The CNN module to extract pixel", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 344, + 382, + 378, + 393 + ], + "spans": [ + { + "bbox": [ + 344, + 382, + 378, + 393 + ], + "score": 1.0, + "content": "features.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + } + ], + "index": 27.75 + }, + { + "type": "text", + "bbox": [ + 106, + 401, + 504, + 423 + ], + "lines": [ + { + "bbox": [ + 105, + 401, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 505, + 412 + ], + "score": 1.0, + "content": "each pixel, we turn to use a more powerful encoder-decoder based convolutional neural network", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 412, + 466, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 412, + 466, + 424 + ], + "score": 1.0, + "content": "(CNN). As shown in Figure 2, our CNN module is designed with the follow two features:", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 106, + 428, + 505, + 536 + ], + "lines": [ + { + "bbox": [ + 104, + 426, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 104, + 426, + 505, + 442 + ], + "score": 1.0, + "content": "• Instead of directly feeding raw RGB images into the CNN module, we stack (duplicate) the cor-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 114, + 441, + 506, + 453 + ], + "spans": [ + { + "bbox": [ + 114, + 441, + 506, + 453 + ], + "score": 1.0, + "content": "responding viewpoint, i.e., the xyz location of the camera, to each pixel of the image. This allows", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 113, + 451, + 506, + 466 + ], + "spans": [ + { + "bbox": [ + 113, + 451, + 506, + 466 + ], + "score": 1.0, + "content": "the learned pixel features to be explicitly aware of its relative position in the 3D scene space. Note", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 113, + 464, + 506, + 478 + ], + "spans": [ + { + "bbox": [ + 113, + 464, + 506, + 478 + ], + "score": 1.0, + "content": "that, we empirically find that stacking the additional camera rotation and intrinsics to each pixel", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 114, + 477, + 477, + 491 + ], + "spans": [ + { + "bbox": [ + 114, + 477, + 477, + 491 + ], + "score": 1.0, + "content": "does not noticeably improve the performance, especially for scenes centered at the origin.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 107, + 490, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 107, + 490, + 505, + 504 + ], + "score": 1.0, + "content": "• We use skip connections between the encoder and decoder to preserve high frequency local fea-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 113, + 501, + 506, + 514 + ], + "spans": [ + { + "bbox": [ + 113, + 501, + 506, + 514 + ], + "score": 1.0, + "content": "tures for each pixel, while optionally integrating a couple of fully connected (fc) layers in the", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 113, + 512, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 113, + 512, + 506, + 525 + ], + "score": 1.0, + "content": "middle of the CNN module to learn global features. The mixture of hierarchical features tends to", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 114, + 524, + 437, + 537 + ], + "spans": [ + { + "bbox": [ + 114, + 524, + 437, + 537 + ], + "score": 1.0, + "content": "to be more general and representative, effectively aiding the network in practice.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 541, + 505, + 575 + ], + "lines": [ + { + "bbox": [ + 105, + 540, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 505, + 554 + ], + "score": 1.0, + "content": "Details of the CNN module is presented in the appendix and all input images share the same CNN", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 551, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 505, + 565 + ], + "score": 1.0, + "content": "module. Note that, there are many ways to construct a pixel feature extractor, but identifying an", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 563, + 334, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 334, + 576 + ], + "score": 1.0, + "content": "optimal CNN module here is out the scope of this paper.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43 + }, + { + "type": "title", + "bbox": [ + 107, + 590, + 319, + 601 + ], + "lines": [ + { + "bbox": [ + 105, + 588, + 320, + 603 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 320, + 603 + ], + "score": 1.0, + "content": "3.3 REPROJECTING 2D FEATURES TO 3D SPACE", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 45 + }, + { + "type": "text", + "bbox": [ + 106, + 611, + 505, + 711 + ], + "lines": [ + { + "bbox": [ + 106, + 611, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 106, + 611, + 505, + 623 + ], + "score": 1.0, + "content": "Considering the extracted pixel features are a compact description of the light ray emitting from the", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 623, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 623, + 505, + 634 + ], + "score": 1.0, + "content": "camera center up to the 3D scene surface, we naturally reproject the pixel features back to the 3D", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 633, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 506, + 645 + ], + "score": 1.0, + "content": "space along the light ray. Since there are no depth scans paired with RGB images, it is impossible", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 643, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 505, + 657 + ], + "score": 1.0, + "content": "to determine which particular 3D surface point the pixel features belong to. In this module, we", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "score": 1.0, + "content": "preliminarily regard the pixel features as the representation of every location along the light ray", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 666, + 504, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 504, + 677 + ], + "score": 1.0, + "content": "in 3D space. With this simple formulation, every 3D point can theoretically have a copy of its", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 106, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 443, + 690 + ], + "score": 1.0, + "content": "corresponding 2D pixel features from each 2D image. Formally, given a 3D point", + "type": "text" + }, + { + "bbox": [ + 443, + 679, + 450, + 689 + ], + "score": 0.76, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 676, + 505, + 690 + ], + "score": 1.0, + "content": ", an observed", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 104, + 686, + 506, + 702 + ], + "spans": [ + { + "bbox": [ + 104, + 686, + 143, + 702 + ], + "score": 1.0, + "content": "2D view", + "type": "text" + }, + { + "bbox": [ + 143, + 688, + 158, + 699 + ], + "score": 0.89, + "content": "\\mathcal { I } _ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 686, + 282, + 702 + ], + "score": 1.0, + "content": "together with the camera pose", + "type": "text" + }, + { + "bbox": [ + 282, + 688, + 297, + 700 + ], + "score": 0.89, + "content": "\\xi _ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 686, + 370, + 702 + ], + "score": 1.0, + "content": "and the intrinsics", + "type": "text" + }, + { + "bbox": [ + 370, + 688, + 389, + 699 + ], + "score": 0.9, + "content": "K _ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 686, + 506, + 702 + ], + "score": 1.0, + "content": ", the corresponding 2D pixel", + "type": "text" + } + ], + "index": 53 + }, + { + "bbox": [ + 106, + 699, + 352, + 714 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 140, + 713 + ], + "score": 1.0, + "content": "features", + "type": "text" + }, + { + "bbox": [ + 141, + 700, + 157, + 714 + ], + "score": 0.86, + "content": "\\mathbf { F } _ { p } ^ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 699, + 352, + 713 + ], + "score": 1.0, + "content": "is retrieved by the reprojection operation below:", + "type": "text" + } + ], + "index": 54 + } + ], + "index": 50 + }, + { + "type": "interline_equation", + "bbox": [ + 214, + 711, + 395, + 732 + ], + "lines": [ + { + "bbox": [ + 214, + 711, + 395, + 732 + ], + "spans": [ + { + "bbox": [ + 214, + 711, + 395, + 732 + ], + "score": 0.89, + "content": "\\mathbf { F } _ { p } ^ { m } = \\mathcal { P } \\Big ( \\{ \\boldsymbol { \\mathcal { T } } _ { k } , \\boldsymbol { \\xi } _ { m } , K _ { m } \\} , \\{ x _ { p } , y _ { p } , z _ { p } \\} , \\mathbf { I } _ { m } \\Big )", + "type": "interline_equation", + "image_path": "93bd6c5f152edf53249bcebd35c1b2f68cdf40f352ed334374b867c5c5628be1.jpg" + } + ] + } + ], + "index": 55, + "virtual_lines": [ + { + "bbox": [ + 214, + 711, + 395, + 732 + ], + "spans": [], + "index": 55 + } + ] + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 759 + ], + "lines": [] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 207, + 79, + 405, + 175 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 207, + 79, + 405, + 175 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 207, + 79, + 405, + 175 + ], + "spans": [ + { + "bbox": [ + 207, + 79, + 405, + 175 + ], + "score": 0.962, + "type": "image", + "image_path": "56d1944f4d23a0a0a15e2089b674d2311f3342f1b49f441d770342b7eecce36d.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 207, + 79, + 405, + 92.71428571428571 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 207, + 92.71428571428571, + 405, + 106.42857142857142 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 207, + 106.42857142857142, + 405, + 120.14285714285712 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 207, + 120.14285714285712, + 405, + 133.85714285714283 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 207, + 133.85714285714283, + 405, + 147.57142857142856 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 207, + 147.57142857142856, + 405, + 161.28571428571428 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 207, + 161.28571428571428, + 405, + 175.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 187, + 176, + 422, + 188 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 186, + 174, + 421, + 190 + ], + "spans": [ + { + "bbox": [ + 186, + 174, + 421, + 190 + ], + "score": 1.0, + "content": "Figure 1: Overview of the proposed general radiance field.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + } + ], + "index": 5.0 + }, + { + "type": "text", + "bbox": [ + 106, + 199, + 506, + 254 + ], + "lines": [], + "index": 10, + "bbox_fs": [ + 105, + 198, + 506, + 256 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 107, + 269, + 349, + 281 + ], + "lines": [ + { + "bbox": [ + 105, + 269, + 350, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 269, + 350, + 282 + ], + "score": 1.0, + "content": "3.2 EXTRACTING GENERAL FEATURES FOR 2D PIXELS", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 107, + 290, + 336, + 401 + ], + "lines": [ + { + "bbox": [ + 106, + 290, + 336, + 303 + ], + "spans": [ + { + "bbox": [ + 106, + 290, + 336, + 303 + ], + "score": 1.0, + "content": "The whole input set of observed 2D images together de-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 302, + 337, + 314 + ], + "spans": [ + { + "bbox": [ + 106, + 302, + 337, + 314 + ], + "score": 1.0, + "content": "scribes the geometry and appearance of a 3D scene, while", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 313, + 337, + 325 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 337, + 325 + ], + "score": 1.0, + "content": "each pixel of those images describes a specific point of", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 324, + 336, + 336 + ], + "spans": [ + { + "bbox": [ + 106, + 324, + 336, + 336 + ], + "score": 1.0, + "content": "that scene. This module aims to extract the general fea-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 335, + 336, + 346 + ], + "spans": [ + { + "bbox": [ + 106, + 335, + 336, + 346 + ], + "score": 1.0, + "content": "tures of each pixel, so to learn the regional description and", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 346, + 337, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 337, + 358 + ], + "score": 1.0, + "content": "geometric patterns for each light ray. A naive approach is", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 357, + 337, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 337, + 369 + ], + "score": 1.0, + "content": "to directly use the raw rgb values as the pixel features.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 367, + 337, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 367, + 337, + 379 + ], + "score": 1.0, + "content": "However, this is sub-optimal because the raw rgb values", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 378, + 337, + 391 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 337, + 391 + ], + "score": 1.0, + "content": "are sensitive to lighting conditions, environmental noise,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 390, + 337, + 402 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 337, + 402 + ], + "score": 1.0, + "content": "etc. In order to learn more general and robust patterns for", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 401, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 505, + 412 + ], + "score": 1.0, + "content": "each pixel, we turn to use a more powerful encoder-decoder based convolutional neural network", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 412, + 466, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 412, + 466, + 424 + ], + "score": 1.0, + "content": "(CNN). As shown in Figure 2, our CNN module is designed with the follow two features:", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 290, + 337, + 402 + ] + }, + { + "type": "image", + "bbox": [ + 347, + 295, + 504, + 369 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 347, + 295, + 504, + 369 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 347, + 295, + 504, + 369 + ], + "spans": [ + { + "bbox": [ + 347, + 295, + 504, + 369 + ], + "score": 0.966, + "type": "image", + "image_path": "b2e9605ba008f372de37a5ed751410ac325144fee0bb3ce35aceec07022d20bd.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 347, + 295, + 504, + 309.8 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 347, + 309.8, + 504, + 324.6 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 347, + 324.6, + 504, + 339.40000000000003 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 347, + 339.40000000000003, + 504, + 354.20000000000005 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 347, + 354.20000000000005, + 504, + 369.00000000000006 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 344, + 373, + 505, + 393 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 343, + 372, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 343, + 372, + 505, + 384 + ], + "score": 1.0, + "content": "Figure 2: The CNN module to extract pixel", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 344, + 382, + 378, + 393 + ], + "spans": [ + { + "bbox": [ + 344, + 382, + 378, + 393 + ], + "score": 1.0, + "content": "features.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + } + ], + "index": 27.75 + }, + { + "type": "text", + "bbox": [ + 106, + 401, + 504, + 423 + ], + "lines": [], + "index": 31.5, + "bbox_fs": [ + 105, + 401, + 505, + 424 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 428, + 505, + 536 + ], + "lines": [ + { + "bbox": [ + 104, + 426, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 104, + 426, + 505, + 442 + ], + "score": 1.0, + "content": "• Instead of directly feeding raw RGB images into the CNN module, we stack (duplicate) the cor-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 114, + 441, + 506, + 453 + ], + "spans": [ + { + "bbox": [ + 114, + 441, + 506, + 453 + ], + "score": 1.0, + "content": "responding viewpoint, i.e., the xyz location of the camera, to each pixel of the image. This allows", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 113, + 451, + 506, + 466 + ], + "spans": [ + { + "bbox": [ + 113, + 451, + 506, + 466 + ], + "score": 1.0, + "content": "the learned pixel features to be explicitly aware of its relative position in the 3D scene space. Note", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 113, + 464, + 506, + 478 + ], + "spans": [ + { + "bbox": [ + 113, + 464, + 506, + 478 + ], + "score": 1.0, + "content": "that, we empirically find that stacking the additional camera rotation and intrinsics to each pixel", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 114, + 477, + 477, + 491 + ], + "spans": [ + { + "bbox": [ + 114, + 477, + 477, + 491 + ], + "score": 1.0, + "content": "does not noticeably improve the performance, especially for scenes centered at the origin.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 107, + 490, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 107, + 490, + 505, + 504 + ], + "score": 1.0, + "content": "• We use skip connections between the encoder and decoder to preserve high frequency local fea-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 113, + 501, + 506, + 514 + ], + "spans": [ + { + "bbox": [ + 113, + 501, + 506, + 514 + ], + "score": 1.0, + "content": "tures for each pixel, while optionally integrating a couple of fully connected (fc) layers in the", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 113, + 512, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 113, + 512, + 506, + 525 + ], + "score": 1.0, + "content": "middle of the CNN module to learn global features. The mixture of hierarchical features tends to", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 114, + 524, + 437, + 537 + ], + "spans": [ + { + "bbox": [ + 114, + 524, + 437, + 537 + ], + "score": 1.0, + "content": "to be more general and representative, effectively aiding the network in practice.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 37, + "bbox_fs": [ + 104, + 426, + 506, + 537 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 541, + 505, + 575 + ], + "lines": [ + { + "bbox": [ + 105, + 540, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 505, + 554 + ], + "score": 1.0, + "content": "Details of the CNN module is presented in the appendix and all input images share the same CNN", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 551, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 505, + 565 + ], + "score": 1.0, + "content": "module. Note that, there are many ways to construct a pixel feature extractor, but identifying an", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 563, + 334, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 334, + 576 + ], + "score": 1.0, + "content": "optimal CNN module here is out the scope of this paper.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43, + "bbox_fs": [ + 105, + 540, + 505, + 576 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 590, + 319, + 601 + ], + "lines": [ + { + "bbox": [ + 105, + 588, + 320, + 603 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 320, + 603 + ], + "score": 1.0, + "content": "3.3 REPROJECTING 2D FEATURES TO 3D SPACE", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 45 + }, + { + "type": "text", + "bbox": [ + 106, + 611, + 505, + 711 + ], + "lines": [ + { + "bbox": [ + 106, + 611, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 106, + 611, + 505, + 623 + ], + "score": 1.0, + "content": "Considering the extracted pixel features are a compact description of the light ray emitting from the", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 623, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 623, + 505, + 634 + ], + "score": 1.0, + "content": "camera center up to the 3D scene surface, we naturally reproject the pixel features back to the 3D", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 633, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 506, + 645 + ], + "score": 1.0, + "content": "space along the light ray. Since there are no depth scans paired with RGB images, it is impossible", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 643, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 505, + 657 + ], + "score": 1.0, + "content": "to determine which particular 3D surface point the pixel features belong to. In this module, we", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "score": 1.0, + "content": "preliminarily regard the pixel features as the representation of every location along the light ray", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 666, + 504, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 504, + 677 + ], + "score": 1.0, + "content": "in 3D space. With this simple formulation, every 3D point can theoretically have a copy of its", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 106, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 443, + 690 + ], + "score": 1.0, + "content": "corresponding 2D pixel features from each 2D image. Formally, given a 3D point", + "type": "text" + }, + { + "bbox": [ + 443, + 679, + 450, + 689 + ], + "score": 0.76, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 676, + 505, + 690 + ], + "score": 1.0, + "content": ", an observed", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 104, + 686, + 506, + 702 + ], + "spans": [ + { + "bbox": [ + 104, + 686, + 143, + 702 + ], + "score": 1.0, + "content": "2D view", + "type": "text" + }, + { + "bbox": [ + 143, + 688, + 158, + 699 + ], + "score": 0.89, + "content": "\\mathcal { I } _ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 686, + 282, + 702 + ], + "score": 1.0, + "content": "together with the camera pose", + "type": "text" + }, + { + "bbox": [ + 282, + 688, + 297, + 700 + ], + "score": 0.89, + "content": "\\xi _ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 686, + 370, + 702 + ], + "score": 1.0, + "content": "and the intrinsics", + "type": "text" + }, + { + "bbox": [ + 370, + 688, + 389, + 699 + ], + "score": 0.9, + "content": "K _ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 686, + 506, + 702 + ], + "score": 1.0, + "content": ", the corresponding 2D pixel", + "type": "text" + } + ], + "index": 53 + }, + { + "bbox": [ + 106, + 699, + 352, + 714 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 140, + 713 + ], + "score": 1.0, + "content": "features", + "type": "text" + }, + { + "bbox": [ + 141, + 700, + 157, + 714 + ], + "score": 0.86, + "content": "\\mathbf { F } _ { p } ^ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 699, + 352, + 713 + ], + "score": 1.0, + "content": "is retrieved by the reprojection operation below:", + "type": "text" + } + ], + "index": 54 + } + ], + "index": 50, + "bbox_fs": [ + 104, + 611, + 506, + 714 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 214, + 711, + 395, + 732 + ], + "lines": [ + { + "bbox": [ + 214, + 711, + 395, + 732 + ], + "spans": [ + { + "bbox": [ + 214, + 711, + 395, + 732 + ], + "score": 0.89, + "content": "\\mathbf { F } _ { p } ^ { m } = \\mathcal { P } \\Big ( \\{ \\boldsymbol { \\mathcal { T } } _ { k } , \\boldsymbol { \\xi } _ { m } , K _ { m } \\} , \\{ x _ { p } , y _ { p } , z _ { p } \\} , \\mathbf { I } _ { m } \\Big )", + "type": "interline_equation", + "image_path": "93bd6c5f152edf53249bcebd35c1b2f68cdf40f352ed334374b867c5c5628be1.jpg" + } + ] + } + ], + "index": 55, + "virtual_lines": [ + { + "bbox": [ + 214, + 711, + 395, + 732 + ], + "spans": [], + "index": 55 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 138 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 184, + 95 + ], + "score": 1.0, + "content": "where the function", + "type": "text" + }, + { + "bbox": [ + 184, + 82, + 201, + 95 + ], + "score": 0.89, + "content": "\\mathcal { P } ( )", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "follows the principle of multi-view geometry (Hartley & Zisserman, 2004)", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 123, + 106 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 123, + 94, + 137, + 105 + ], + "score": 0.88, + "content": "{ \\mathbf I } _ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "represents the image features extracted by the CNN module in Section 3.2. However, since", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "score": 1.0, + "content": "the pixels of 2D images are discrete and bounded within a certain spatial size, while the 3D points", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 323, + 129 + ], + "score": 1.0, + "content": "are continuous in the scene space, after the 3D point", + "type": "text" + }, + { + "bbox": [ + 324, + 117, + 330, + 127 + ], + "score": 0.81, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 115, + 471, + 129 + ], + "score": 1.0, + "content": "is projected to the plane of image", + "type": "text" + }, + { + "bbox": [ + 472, + 116, + 486, + 127 + ], + "score": 0.9, + "content": "\\mathcal { T } _ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 115, + 506, + 129 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 347, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 347, + 139 + ], + "score": 1.0, + "content": "apply two approximations to deal with the following issues.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 106, + 143, + 505, + 210 + ], + "lines": [ + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "score": 1.0, + "content": "• If the point lies inside of the image, we simply select the nearest pixel and duplicate its features", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 114, + 155, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 114, + 155, + 505, + 166 + ], + "score": 1.0, + "content": "to the 3D point. Note that, more advanced techniques may be applied to address the discretization", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 113, + 165, + 374, + 177 + ], + "spans": [ + { + "bbox": [ + 113, + 165, + 374, + 177 + ], + "score": 1.0, + "content": "issue, such as linear interpolation or designing a kernel function.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 175, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 106, + 175, + 505, + 190 + ], + "score": 1.0, + "content": "• If the point lies outside of the image, we assign a zero vector to the 3D point, which means there", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 113, + 186, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 113, + 186, + 506, + 200 + ], + "score": 1.0, + "content": "is no information observed. In fact, we empirically find that the nearest interpretation can also", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 114, + 198, + 453, + 211 + ], + "spans": [ + { + "bbox": [ + 114, + 198, + 453, + 211 + ], + "score": 1.0, + "content": "achieve good performance, but it is only applicable for relatively small-scale scenes.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 106, + 215, + 504, + 238 + ], + "lines": [ + { + "bbox": [ + 106, + 213, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 106, + 213, + 505, + 228 + ], + "score": 1.0, + "content": "Overall, the above simple reprojection operation explicitly retains the extracted 2D pixel features", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 226, + 466, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 466, + 238 + ], + "score": 1.0, + "content": "back to 3D space via the principle of geometry, and the module is naturally differentiable.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "title", + "bbox": [ + 106, + 253, + 343, + 264 + ], + "lines": [ + { + "bbox": [ + 106, + 253, + 343, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 343, + 266 + ], + "score": 1.0, + "content": "3.4 OBTAINING GENERAL FEATURES FOR 3D POINTS", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 274, + 505, + 297 + ], + "lines": [ + { + "bbox": [ + 105, + 273, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 205, + 289 + ], + "score": 1.0, + "content": "Given a query 3D point", + "type": "text" + }, + { + "bbox": [ + 206, + 277, + 212, + 286 + ], + "score": 0.78, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 273, + 505, + 289 + ], + "score": 1.0, + "content": ", it is able to retrieve a feature vector from each input image. However,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 285, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 458, + 299 + ], + "score": 1.0, + "content": "given a set of input images, it is challenging to obtain a final feature vector for the point", + "type": "text" + }, + { + "bbox": [ + 458, + 288, + 464, + 297 + ], + "score": 0.75, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 285, + 505, + 299 + ], + "score": 1.0, + "content": ", because:", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 104, + 302, + 505, + 361 + ], + "lines": [ + { + "bbox": [ + 105, + 301, + 504, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 301, + 504, + 315 + ], + "score": 1.0, + "content": "• The total number of input images for each 3D scene is variable and there is no order for images.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 114, + 313, + 475, + 326 + ], + "spans": [ + { + "bbox": [ + 114, + 313, + 475, + 326 + ], + "score": 1.0, + "content": "As a consequence, the retrieved feature vectors are also unordered and have arbitrary size.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 326, + 506, + 341 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 506, + 341 + ], + "score": 1.0, + "content": "• Since there are no depth scans paired with the input RGB images, it is unable to decide which", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 114, + 338, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 114, + 338, + 505, + 351 + ], + "score": 1.0, + "content": "feature vectors are the true descriptions of the query point due to visual occlusions. Ideally, these", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 114, + 349, + 498, + 362 + ], + "spans": [ + { + "bbox": [ + 114, + 349, + 498, + 362 + ], + "score": 1.0, + "content": "features can be aware of the relative distance to the query point and then selected automatically.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 106, + 366, + 505, + 402 + ], + "lines": [ + { + "bbox": [ + 105, + 365, + 505, + 379 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 505, + 379 + ], + "score": 1.0, + "content": "To tackle these critical issues, we formulate this problem as an attention aggregation process. In", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 377, + 505, + 390 + ], + "spans": [ + { + "bbox": [ + 104, + 377, + 250, + 390 + ], + "score": 1.0, + "content": "particular, given the query 3D point", + "type": "text" + }, + { + "bbox": [ + 251, + 379, + 257, + 389 + ], + "score": 0.79, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 377, + 340, + 390 + ], + "score": 1.0, + "content": ", its query viewpoint", + "type": "text" + }, + { + "bbox": [ + 340, + 378, + 352, + 390 + ], + "score": 0.89, + "content": "\\nu _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 377, + 505, + 390 + ], + "score": 1.0, + "content": ", and the set of retrieved pixel features", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 107, + 386, + 196, + 405 + ], + "spans": [ + { + "bbox": [ + 107, + 388, + 190, + 403 + ], + "score": 0.92, + "content": "\\{ \\mathbf { F } _ { p } ^ { 1 } \\cdot \\cdot \\cdot \\mathbf { F } _ { p } ^ { m } \\cdot \\cdot \\cdot \\mathbf { F } _ { p } ^ { M } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 386, + 196, + 405 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 105, + 406, + 505, + 546 + ], + "lines": [ + { + "bbox": [ + 103, + 403, + 507, + 422 + ], + "spans": [ + { + "bbox": [ + 103, + 403, + 248, + 422 + ], + "score": 1.0, + "content": "• For each retrieved feature vector", + "type": "text" + }, + { + "bbox": [ + 249, + 407, + 264, + 420 + ], + "score": 0.9, + "content": "\\mathbf { F } _ { p } ^ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 403, + 507, + 422 + ], + "score": 1.0, + "content": ", we firstly use shared MLPs to integrate the information of", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 113, + 419, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 113, + 419, + 164, + 433 + ], + "score": 1.0, + "content": "query point", + "type": "text" + }, + { + "bbox": [ + 164, + 423, + 170, + 432 + ], + "score": 0.77, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 419, + 304, + 433 + ], + "score": 1.0, + "content": ", generating a new feature vector", + "type": "text" + }, + { + "bbox": [ + 304, + 419, + 320, + 434 + ], + "score": 0.91, + "content": "\\hat { \\mathbf { F } } _ { p } ^ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 419, + 506, + 433 + ], + "score": 1.0, + "content": "which is aware of the relative distance to the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 114, + 432, + 277, + 444 + ], + "spans": [ + { + "bbox": [ + 114, + 432, + 163, + 444 + ], + "score": 1.0, + "content": "query point", + "type": "text" + }, + { + "bbox": [ + 163, + 434, + 169, + 443 + ], + "score": 0.78, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 432, + 277, + 444 + ], + "score": 1.0, + "content": ". Formally, it is defined as:", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 154, + 446, + 506, + 462 + ], + "spans": [ + { + "bbox": [ + 154, + 446, + 464, + 462 + ], + "score": 0.8, + "content": "\\hat { \\mathbf { F } } _ { p } ^ { m } = M L P s ( \\mathbf { F } _ { p } ^ { m } \\oplus [ x _ { p } , y _ { p } , z _ { p } ] ) , \\quad ( \\oplus \\mathrm { m e a n s ~ c o n c a t e n a t i o n ~ i n ~ n e u r a l ~ n e t s } )", + "type": "inline_equation", + "image_path": "be22566409bbd9ef4b60fc6727e300604f61b492182ae9bd649c5fbbdad2464b.jpg" + }, + { + "bbox": [ + 489, + 447, + 506, + 461 + ], + "score": 1.0, + "content": "(3)", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 103, + 460, + 507, + 480 + ], + "spans": [ + { + "bbox": [ + 103, + 460, + 337, + 480 + ], + "score": 1.0, + "content": "• After obtaining the new set of position-aware features", + "type": "text" + }, + { + "bbox": [ + 337, + 463, + 420, + 478 + ], + "score": 0.9, + "content": "\\{ \\hat { \\mathbf { F } } _ { p } ^ { 1 } \\cdot \\cdot \\cdot \\hat { \\mathbf { F } } _ { p } ^ { m } \\cdot \\cdot \\cdot \\hat { \\mathbf { F } } _ { p } ^ { M } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 460, + 507, + 480 + ], + "score": 1.0, + "content": ", we use the existing", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 113, + 475, + 505, + 488 + ], + "spans": [ + { + "bbox": [ + 113, + 475, + 505, + 488 + ], + "score": 1.0, + "content": "attention aggregation methods such as AttSets (Yang et al., 2020) and Slot Attention (Locatello", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 114, + 486, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 114, + 487, + 306, + 500 + ], + "score": 1.0, + "content": "et al., 2020) to compute a unique feature vector", + "type": "text" + }, + { + "bbox": [ + 307, + 486, + 320, + 500 + ], + "score": 0.89, + "content": "\\bar { \\mathbf { F } } _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 487, + 412, + 500 + ], + "score": 1.0, + "content": "for the query 3D point", + "type": "text" + }, + { + "bbox": [ + 413, + 489, + 419, + 499 + ], + "score": 0.75, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 487, + 505, + 500 + ], + "score": 1.0, + "content": ". Basically, the atten-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 114, + 498, + 504, + 511 + ], + "spans": [ + { + "bbox": [ + 114, + 498, + 504, + 511 + ], + "score": 1.0, + "content": "tion mechanism learns a unique weight for all input features and then aggregates them together.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 509, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 115, + 509, + 505, + 522 + ], + "score": 1.0, + "content": "According to the theoretical analysis in (Yang et al., 2020) and (Locatello et al., 2020), the selected", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 522, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 115, + 522, + 505, + 533 + ], + "score": 1.0, + "content": "attention mechanisms are permutation invariant with regard to the input set of feature vectors and", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 114, + 533, + 400, + 544 + ], + "spans": [ + { + "bbox": [ + 114, + 533, + 400, + 544 + ], + "score": 1.0, + "content": "can process an arbitrary number of elements. Formally, it is defined as:", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 29 + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 546, + 447, + 563 + ], + "lines": [ + { + "bbox": [ + 172, + 546, + 447, + 563 + ], + "spans": [ + { + "bbox": [ + 172, + 546, + 447, + 563 + ], + "score": 0.88, + "content": "\\bar { \\mathbf { F } } _ { p } = \\mathcal { A } \\big ( \\hat { \\mathbf { F } } _ { p } ^ { 1 } \\cdot \\cdot \\cdot \\hat { \\mathbf { F } } _ { p } ^ { m } \\cdot \\cdot \\cdot \\hat { \\mathbf { F } } _ { p } ^ { M } \\big ) , \\quad \\mathrm { ( \\mathcal { A } ~ i s ~ a n ~ e x i s t i n g ~ a t t e n t i o n ~ f u n c t i o n ) }", + "type": "interline_equation", + "image_path": "904fa8bc269de40581217d509910ed3b07f202a888ada9353fe5726b085967fe.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 172, + 546, + 447, + 563 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 567, + 505, + 612 + ], + "lines": [ + { + "bbox": [ + 106, + 567, + 506, + 581 + ], + "spans": [ + { + "bbox": [ + 106, + 567, + 250, + 581 + ], + "score": 1.0, + "content": "Above all, for every query 3D point", + "type": "text" + }, + { + "bbox": [ + 250, + 570, + 257, + 579 + ], + "score": 0.8, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 567, + 326, + 581 + ], + "score": 1.0, + "content": ", its final features", + "type": "text" + }, + { + "bbox": [ + 326, + 567, + 339, + 580 + ], + "score": 0.9, + "content": "\\bar { \\mathbf { F } } _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 567, + 506, + 581 + ], + "score": 1.0, + "content": "explicitly preserve the general geometric", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 578, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 505, + 590 + ], + "score": 1.0, + "content": "patterns retrieved from the input 2D observations and are also made aware of the particular 3D point", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 589, + 505, + 602 + ], + "spans": [ + { + "bbox": [ + 105, + 590, + 365, + 602 + ], + "score": 1.0, + "content": "location within the scene space. This allows the 3D point features", + "type": "text" + }, + { + "bbox": [ + 365, + 589, + 378, + 602 + ], + "score": 0.9, + "content": "\\bar { \\mathbf { F } } _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 590, + 505, + 602 + ], + "score": 1.0, + "content": "to be general and representative", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 601, + 259, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 259, + 613 + ], + "score": 1.0, + "content": "for its own geometry and appearance.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37.5 + }, + { + "type": "title", + "bbox": [ + 108, + 627, + 246, + 639 + ], + "lines": [ + { + "bbox": [ + 105, + 627, + 248, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 248, + 640 + ], + "score": 1.0, + "content": "3.5 RENDERING 3D FEATURES", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 106, + 649, + 505, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 647, + 506, + 663 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 213, + 663 + ], + "score": 1.0, + "content": "With the learned features", + "type": "text" + }, + { + "bbox": [ + 213, + 648, + 226, + 662 + ], + "score": 0.89, + "content": "\\bar { \\mathbf { F } } _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 647, + 327, + 663 + ], + "score": 1.0, + "content": "for any query 3D point", + "type": "text" + }, + { + "bbox": [ + 327, + 652, + 334, + 661 + ], + "score": 0.78, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 647, + 506, + 663 + ], + "score": 1.0, + "content": ", this module aims to infer its volumetric", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 659, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 138, + 673 + ], + "score": 1.0, + "content": "density", + "type": "text" + }, + { + "bbox": [ + 138, + 661, + 149, + 672 + ], + "score": 0.89, + "content": "d _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 659, + 348, + 673 + ], + "score": 1.0, + "content": "in 3D space and the corresponding RGB values", + "type": "text" + }, + { + "bbox": [ + 348, + 660, + 395, + 673 + ], + "score": 0.93, + "content": "\\{ r _ { p } , g _ { p } , b _ { p } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 659, + 506, + 673 + ], + "score": 1.0, + "content": "given the query viewpoint", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 670, + 505, + 685 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 118, + 684 + ], + "score": 0.87, + "content": "\\nu _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 119, + 670, + 505, + 685 + ], + "score": 1.0, + "content": ". In particular, we exactly follow the simple MLP-based design of NeRF (Mildenhall et al., 2020)", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 682, + 506, + 697 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 425, + 697 + ], + "score": 1.0, + "content": "in the rendering process. As illustrated in Equation 5, the volumetric density", + "type": "text" + }, + { + "bbox": [ + 425, + 683, + 437, + 696 + ], + "score": 0.87, + "content": "d _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 682, + 506, + 697 + ], + "score": 1.0, + "content": "is modeled as a", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 694, + 505, + 709 + ], + "spans": [ + { + "bbox": [ + 105, + 694, + 226, + 709 + ], + "score": 1.0, + "content": "function of the point features", + "type": "text" + }, + { + "bbox": [ + 226, + 695, + 239, + 709 + ], + "score": 0.9, + "content": "\\bar { \\mathbf { F } } _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 694, + 400, + 709 + ], + "score": 1.0, + "content": "only. This allows the estimated density", + "type": "text" + }, + { + "bbox": [ + 400, + 696, + 411, + 708 + ], + "score": 0.89, + "content": "d _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 694, + 486, + 709 + ], + "score": 1.0, + "content": "at the query point", + "type": "text" + }, + { + "bbox": [ + 487, + 698, + 493, + 708 + ], + "score": 0.77, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 494, + 694, + 505, + 709 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 708, + 505, + 720 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 505, + 720 + ], + "score": 1.0, + "content": "remain unchanged under different query viewpoints, thus maintaining consistent geometry for each", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 719, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 505, + 734 + ], + "score": 1.0, + "content": "point. The RGB is modeled as a function of both point features and the query viewpoint. Details of", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 138 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 184, + 95 + ], + "score": 1.0, + "content": "where the function", + "type": "text" + }, + { + "bbox": [ + 184, + 82, + 201, + 95 + ], + "score": 0.89, + "content": "\\mathcal { P } ( )", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "follows the principle of multi-view geometry (Hartley & Zisserman, 2004)", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 123, + 106 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 123, + 94, + 137, + 105 + ], + "score": 0.88, + "content": "{ \\mathbf I } _ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "represents the image features extracted by the CNN module in Section 3.2. However, since", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "score": 1.0, + "content": "the pixels of 2D images are discrete and bounded within a certain spatial size, while the 3D points", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 323, + 129 + ], + "score": 1.0, + "content": "are continuous in the scene space, after the 3D point", + "type": "text" + }, + { + "bbox": [ + 324, + 117, + 330, + 127 + ], + "score": 0.81, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 115, + 471, + 129 + ], + "score": 1.0, + "content": "is projected to the plane of image", + "type": "text" + }, + { + "bbox": [ + 472, + 116, + 486, + 127 + ], + "score": 0.9, + "content": "\\mathcal { T } _ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 115, + 506, + 129 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 347, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 347, + 139 + ], + "score": 1.0, + "content": "apply two approximations to deal with the following issues.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 82, + 506, + 139 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 143, + 505, + 210 + ], + "lines": [ + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "score": 1.0, + "content": "• If the point lies inside of the image, we simply select the nearest pixel and duplicate its features", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 114, + 155, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 114, + 155, + 505, + 166 + ], + "score": 1.0, + "content": "to the 3D point. Note that, more advanced techniques may be applied to address the discretization", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 113, + 165, + 374, + 177 + ], + "spans": [ + { + "bbox": [ + 113, + 165, + 374, + 177 + ], + "score": 1.0, + "content": "issue, such as linear interpolation or designing a kernel function.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 175, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 106, + 175, + 505, + 190 + ], + "score": 1.0, + "content": "• If the point lies outside of the image, we assign a zero vector to the 3D point, which means there", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 113, + 186, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 113, + 186, + 506, + 200 + ], + "score": 1.0, + "content": "is no information observed. In fact, we empirically find that the nearest interpretation can also", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 114, + 198, + 453, + 211 + ], + "spans": [ + { + "bbox": [ + 114, + 198, + 453, + 211 + ], + "score": 1.0, + "content": "achieve good performance, but it is only applicable for relatively small-scale scenes.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 142, + 506, + 211 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 215, + 504, + 238 + ], + "lines": [ + { + "bbox": [ + 106, + 213, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 106, + 213, + 505, + 228 + ], + "score": 1.0, + "content": "Overall, the above simple reprojection operation explicitly retains the extracted 2D pixel features", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 226, + 466, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 466, + 238 + ], + "score": 1.0, + "content": "back to 3D space via the principle of geometry, and the module is naturally differentiable.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 213, + 505, + 238 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 253, + 343, + 264 + ], + "lines": [ + { + "bbox": [ + 106, + 253, + 343, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 343, + 266 + ], + "score": 1.0, + "content": "3.4 OBTAINING GENERAL FEATURES FOR 3D POINTS", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 274, + 505, + 297 + ], + "lines": [ + { + "bbox": [ + 105, + 273, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 205, + 289 + ], + "score": 1.0, + "content": "Given a query 3D point", + "type": "text" + }, + { + "bbox": [ + 206, + 277, + 212, + 286 + ], + "score": 0.78, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 273, + 505, + 289 + ], + "score": 1.0, + "content": ", it is able to retrieve a feature vector from each input image. However,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 285, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 458, + 299 + ], + "score": 1.0, + "content": "given a set of input images, it is challenging to obtain a final feature vector for the point", + "type": "text" + }, + { + "bbox": [ + 458, + 288, + 464, + 297 + ], + "score": 0.75, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 285, + 505, + 299 + ], + "score": 1.0, + "content": ", because:", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 273, + 505, + 299 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 302, + 505, + 361 + ], + "lines": [ + { + "bbox": [ + 105, + 301, + 504, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 301, + 504, + 315 + ], + "score": 1.0, + "content": "• The total number of input images for each 3D scene is variable and there is no order for images.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 114, + 313, + 475, + 326 + ], + "spans": [ + { + "bbox": [ + 114, + 313, + 475, + 326 + ], + "score": 1.0, + "content": "As a consequence, the retrieved feature vectors are also unordered and have arbitrary size.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 326, + 506, + 341 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 506, + 341 + ], + "score": 1.0, + "content": "• Since there are no depth scans paired with the input RGB images, it is unable to decide which", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 114, + 338, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 114, + 338, + 505, + 351 + ], + "score": 1.0, + "content": "feature vectors are the true descriptions of the query point due to visual occlusions. Ideally, these", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 114, + 349, + 498, + 362 + ], + "spans": [ + { + "bbox": [ + 114, + 349, + 498, + 362 + ], + "score": 1.0, + "content": "features can be aware of the relative distance to the query point and then selected automatically.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 301, + 506, + 362 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 366, + 505, + 402 + ], + "lines": [ + { + "bbox": [ + 105, + 365, + 505, + 379 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 505, + 379 + ], + "score": 1.0, + "content": "To tackle these critical issues, we formulate this problem as an attention aggregation process. In", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 377, + 505, + 390 + ], + "spans": [ + { + "bbox": [ + 104, + 377, + 250, + 390 + ], + "score": 1.0, + "content": "particular, given the query 3D point", + "type": "text" + }, + { + "bbox": [ + 251, + 379, + 257, + 389 + ], + "score": 0.79, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 377, + 340, + 390 + ], + "score": 1.0, + "content": ", its query viewpoint", + "type": "text" + }, + { + "bbox": [ + 340, + 378, + 352, + 390 + ], + "score": 0.89, + "content": "\\nu _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 377, + 505, + 390 + ], + "score": 1.0, + "content": ", and the set of retrieved pixel features", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 107, + 386, + 196, + 405 + ], + "spans": [ + { + "bbox": [ + 107, + 388, + 190, + 403 + ], + "score": 0.92, + "content": "\\{ \\mathbf { F } _ { p } ^ { 1 } \\cdot \\cdot \\cdot \\mathbf { F } _ { p } ^ { m } \\cdot \\cdot \\cdot \\mathbf { F } _ { p } ^ { M } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 386, + 196, + 405 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 104, + 365, + 505, + 405 + ] + }, + { + "type": "list", + "bbox": [ + 105, + 406, + 505, + 546 + ], + "lines": [ + { + "bbox": [ + 103, + 403, + 507, + 422 + ], + "spans": [ + { + "bbox": [ + 103, + 403, + 248, + 422 + ], + "score": 1.0, + "content": "• For each retrieved feature vector", + "type": "text" + }, + { + "bbox": [ + 249, + 407, + 264, + 420 + ], + "score": 0.9, + "content": "\\mathbf { F } _ { p } ^ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 403, + 507, + 422 + ], + "score": 1.0, + "content": ", we firstly use shared MLPs to integrate the information of", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 419, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 113, + 419, + 164, + 433 + ], + "score": 1.0, + "content": "query point", + "type": "text" + }, + { + "bbox": [ + 164, + 423, + 170, + 432 + ], + "score": 0.77, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 419, + 304, + 433 + ], + "score": 1.0, + "content": ", generating a new feature vector", + "type": "text" + }, + { + "bbox": [ + 304, + 419, + 320, + 434 + ], + "score": 0.91, + "content": "\\hat { \\mathbf { F } } _ { p } ^ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 419, + 506, + 433 + ], + "score": 1.0, + "content": "which is aware of the relative distance to the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 114, + 432, + 277, + 444 + ], + "spans": [ + { + "bbox": [ + 114, + 432, + 163, + 444 + ], + "score": 1.0, + "content": "query point", + "type": "text" + }, + { + "bbox": [ + 163, + 434, + 169, + 443 + ], + "score": 0.78, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 432, + 277, + 444 + ], + "score": 1.0, + "content": ". Formally, it is defined as:", + "type": "text" + } + ], + "index": 26, + "is_list_end_line": true + }, + { + "bbox": [ + 154, + 446, + 506, + 462 + ], + "spans": [ + { + "bbox": [ + 154, + 446, + 464, + 462 + ], + "score": 0.8, + "content": "\\hat { \\mathbf { F } } _ { p } ^ { m } = M L P s ( \\mathbf { F } _ { p } ^ { m } \\oplus [ x _ { p } , y _ { p } , z _ { p } ] ) , \\quad ( \\oplus \\mathrm { m e a n s ~ c o n c a t e n a t i o n ~ i n ~ n e u r a l ~ n e t s } )", + "type": "inline_equation", + "image_path": "be22566409bbd9ef4b60fc6727e300604f61b492182ae9bd649c5fbbdad2464b.jpg" + }, + { + "bbox": [ + 489, + 447, + 506, + 461 + ], + "score": 1.0, + "content": "(3)", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 103, + 460, + 507, + 480 + ], + "spans": [ + { + "bbox": [ + 103, + 460, + 337, + 480 + ], + "score": 1.0, + "content": "• After obtaining the new set of position-aware features", + "type": "text" + }, + { + "bbox": [ + 337, + 463, + 420, + 478 + ], + "score": 0.9, + "content": "\\{ \\hat { \\mathbf { F } } _ { p } ^ { 1 } \\cdot \\cdot \\cdot \\hat { \\mathbf { F } } _ { p } ^ { m } \\cdot \\cdot \\cdot \\hat { \\mathbf { F } } _ { p } ^ { M } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 460, + 507, + 480 + ], + "score": 1.0, + "content": ", we use the existing", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 475, + 505, + 488 + ], + "spans": [ + { + "bbox": [ + 113, + 475, + 505, + 488 + ], + "score": 1.0, + "content": "attention aggregation methods such as AttSets (Yang et al., 2020) and Slot Attention (Locatello", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 114, + 486, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 114, + 487, + 306, + 500 + ], + "score": 1.0, + "content": "et al., 2020) to compute a unique feature vector", + "type": "text" + }, + { + "bbox": [ + 307, + 486, + 320, + 500 + ], + "score": 0.89, + "content": "\\bar { \\mathbf { F } } _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 487, + 412, + 500 + ], + "score": 1.0, + "content": "for the query 3D point", + "type": "text" + }, + { + "bbox": [ + 413, + 489, + 419, + 499 + ], + "score": 0.75, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 487, + 505, + 500 + ], + "score": 1.0, + "content": ". Basically, the atten-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 114, + 498, + 504, + 511 + ], + "spans": [ + { + "bbox": [ + 114, + 498, + 504, + 511 + ], + "score": 1.0, + "content": "tion mechanism learns a unique weight for all input features and then aggregates them together.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 509, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 115, + 509, + 505, + 522 + ], + "score": 1.0, + "content": "According to the theoretical analysis in (Yang et al., 2020) and (Locatello et al., 2020), the selected", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 522, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 115, + 522, + 505, + 533 + ], + "score": 1.0, + "content": "attention mechanisms are permutation invariant with regard to the input set of feature vectors and", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 114, + 533, + 400, + 544 + ], + "spans": [ + { + "bbox": [ + 114, + 533, + 400, + 544 + ], + "score": 1.0, + "content": "can process an arbitrary number of elements. Formally, it is defined as:", + "type": "text" + } + ], + "index": 34, + "is_list_end_line": true + } + ], + "index": 29, + "bbox_fs": [ + 103, + 403, + 507, + 544 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 546, + 447, + 563 + ], + "lines": [ + { + "bbox": [ + 172, + 546, + 447, + 563 + ], + "spans": [ + { + "bbox": [ + 172, + 546, + 447, + 563 + ], + "score": 0.88, + "content": "\\bar { \\mathbf { F } } _ { p } = \\mathcal { A } \\big ( \\hat { \\mathbf { F } } _ { p } ^ { 1 } \\cdot \\cdot \\cdot \\hat { \\mathbf { F } } _ { p } ^ { m } \\cdot \\cdot \\cdot \\hat { \\mathbf { F } } _ { p } ^ { M } \\big ) , \\quad \\mathrm { ( \\mathcal { A } ~ i s ~ a n ~ e x i s t i n g ~ a t t e n t i o n ~ f u n c t i o n ) }", + "type": "interline_equation", + "image_path": "904fa8bc269de40581217d509910ed3b07f202a888ada9353fe5726b085967fe.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 172, + 546, + 447, + 563 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 567, + 505, + 612 + ], + "lines": [ + { + "bbox": [ + 106, + 567, + 506, + 581 + ], + "spans": [ + { + "bbox": [ + 106, + 567, + 250, + 581 + ], + "score": 1.0, + "content": "Above all, for every query 3D point", + "type": "text" + }, + { + "bbox": [ + 250, + 570, + 257, + 579 + ], + "score": 0.8, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 567, + 326, + 581 + ], + "score": 1.0, + "content": ", its final features", + "type": "text" + }, + { + "bbox": [ + 326, + 567, + 339, + 580 + ], + "score": 0.9, + "content": "\\bar { \\mathbf { F } } _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 567, + 506, + 581 + ], + "score": 1.0, + "content": "explicitly preserve the general geometric", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 578, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 505, + 590 + ], + "score": 1.0, + "content": "patterns retrieved from the input 2D observations and are also made aware of the particular 3D point", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 589, + 505, + 602 + ], + "spans": [ + { + "bbox": [ + 105, + 590, + 365, + 602 + ], + "score": 1.0, + "content": "location within the scene space. This allows the 3D point features", + "type": "text" + }, + { + "bbox": [ + 365, + 589, + 378, + 602 + ], + "score": 0.9, + "content": "\\bar { \\mathbf { F } } _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 590, + 505, + 602 + ], + "score": 1.0, + "content": "to be general and representative", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 601, + 259, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 259, + 613 + ], + "score": 1.0, + "content": "for its own geometry and appearance.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 567, + 506, + 613 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 627, + 246, + 639 + ], + "lines": [ + { + "bbox": [ + 105, + 627, + 248, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 248, + 640 + ], + "score": 1.0, + "content": "3.5 RENDERING 3D FEATURES", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 106, + 649, + 505, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 647, + 506, + 663 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 213, + 663 + ], + "score": 1.0, + "content": "With the learned features", + "type": "text" + }, + { + "bbox": [ + 213, + 648, + 226, + 662 + ], + "score": 0.89, + "content": "\\bar { \\mathbf { F } } _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 647, + 327, + 663 + ], + "score": 1.0, + "content": "for any query 3D point", + "type": "text" + }, + { + "bbox": [ + 327, + 652, + 334, + 661 + ], + "score": 0.78, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 647, + 506, + 663 + ], + "score": 1.0, + "content": ", this module aims to infer its volumetric", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 659, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 138, + 673 + ], + "score": 1.0, + "content": "density", + "type": "text" + }, + { + "bbox": [ + 138, + 661, + 149, + 672 + ], + "score": 0.89, + "content": "d _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 659, + 348, + 673 + ], + "score": 1.0, + "content": "in 3D space and the corresponding RGB values", + "type": "text" + }, + { + "bbox": [ + 348, + 660, + 395, + 673 + ], + "score": 0.93, + "content": "\\{ r _ { p } , g _ { p } , b _ { p } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 659, + 506, + 673 + ], + "score": 1.0, + "content": "given the query viewpoint", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 670, + 505, + 685 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 118, + 684 + ], + "score": 0.87, + "content": "\\nu _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 119, + 670, + 505, + 685 + ], + "score": 1.0, + "content": ". In particular, we exactly follow the simple MLP-based design of NeRF (Mildenhall et al., 2020)", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 682, + 506, + 697 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 425, + 697 + ], + "score": 1.0, + "content": "in the rendering process. As illustrated in Equation 5, the volumetric density", + "type": "text" + }, + { + "bbox": [ + 425, + 683, + 437, + 696 + ], + "score": 0.87, + "content": "d _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 682, + 506, + 697 + ], + "score": 1.0, + "content": "is modeled as a", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 694, + 505, + 709 + ], + "spans": [ + { + "bbox": [ + 105, + 694, + 226, + 709 + ], + "score": 1.0, + "content": "function of the point features", + "type": "text" + }, + { + "bbox": [ + 226, + 695, + 239, + 709 + ], + "score": 0.9, + "content": "\\bar { \\mathbf { F } } _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 694, + 400, + 709 + ], + "score": 1.0, + "content": "only. This allows the estimated density", + "type": "text" + }, + { + "bbox": [ + 400, + 696, + 411, + 708 + ], + "score": 0.89, + "content": "d _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 694, + 486, + 709 + ], + "score": 1.0, + "content": "at the query point", + "type": "text" + }, + { + "bbox": [ + 487, + 698, + 493, + 708 + ], + "score": 0.77, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 494, + 694, + 505, + 709 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 708, + 505, + 720 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 505, + 720 + ], + "score": 1.0, + "content": "remain unchanged under different query viewpoints, thus maintaining consistent geometry for each", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 719, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 505, + 734 + ], + "score": 1.0, + "content": "point. The RGB is modeled as a function of both point features and the query viewpoint. Details of", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 81, + 320, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 320, + 95 + ], + "score": 1.0, + "content": "these MLPs refers to NeRF (Mildenhall et al., 2020).", + "type": "text", + "cross_page": true + } + ], + "index": 0 + } + ], + "index": 44, + "bbox_fs": [ + 105, + 647, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 319, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 320, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 320, + 95 + ], + "score": 1.0, + "content": "these MLPs refers to NeRF (Mildenhall et al., 2020).", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 168, + 93, + 442, + 114 + ], + "lines": [ + { + "bbox": [ + 168, + 93, + 442, + 114 + ], + "spans": [ + { + "bbox": [ + 168, + 93, + 442, + 114 + ], + "score": 0.9, + "content": "d _ { p } = M L P s ( \\bar { \\mathbf { F } } _ { p } ) , \\qquad \\quad ( r _ { p } , g _ { p } , b _ { p } ) = M L P s \\Bigl ( \\bar { \\mathbf { F } } _ { p } , \\{ x _ { p } ^ { v } , y _ { p } ^ { v } , z _ { p } ^ { v } \\} \\Bigr )", + "type": "interline_equation", + "image_path": "26d919dff65d750e3d751851267bb1bf28a0879c63c1fd693d6eb7ee186b7238.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 168, + 93, + 442, + 114 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 114, + 505, + 182 + ], + "lines": [ + { + "bbox": [ + 105, + 113, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 113, + 506, + 128 + ], + "score": 1.0, + "content": "To render the color of any query ray passing through the 3D scene, the classic volume rendering", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 125, + 505, + 138 + ], + "spans": [ + { + "bbox": [ + 106, + 125, + 505, + 138 + ], + "score": 1.0, + "content": "(Kajiya & Herzen, 1984) is applied and the integral is estimated by sampling a discrete set of 3D", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 136, + 505, + 149 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 505, + 149 + ], + "score": 1.0, + "content": "points along the query ray. In particular, we exactly follow the formulation of ray marching and the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 147, + 506, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 147, + 506, + 162 + ], + "score": 1.0, + "content": "hierarchical sampling strategy in NeRF (Mildenhall et al., 2020). Eventually, novel 2D images can", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 159, + 506, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 506, + 173 + ], + "score": 1.0, + "content": "be directly synthesized from our GRF by querying light rays. This allows the entire network to be", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 170, + 372, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 372, + 183 + ], + "score": 1.0, + "content": "trainable only with a set of 2D images, without requiring 3D data.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 4.5 + }, + { + "type": "title", + "bbox": [ + 108, + 196, + 209, + 207 + ], + "lines": [ + { + "bbox": [ + 106, + 196, + 210, + 208 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 210, + 208 + ], + "score": 1.0, + "content": "3.6 IMPLEMENTATION", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 106, + 216, + 505, + 298 + ], + "lines": [ + { + "bbox": [ + 105, + 214, + 506, + 230 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 506, + 230 + ], + "score": 1.0, + "content": "The proposed four modules are connected and trained end-to-end. In the implementation, details of", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 227, + 505, + 241 + ], + "spans": [ + { + "bbox": [ + 106, + 227, + 505, + 241 + ], + "score": 1.0, + "content": "the CNN module and the attention module for different experiments are presented in the appendix.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 239, + 506, + 254 + ], + "spans": [ + { + "bbox": [ + 105, + 239, + 506, + 254 + ], + "score": 1.0, + "content": "In the neural rendering module, all the designs of neural layers and other settings simply follow", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 252, + 506, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 252, + 506, + 266 + ], + "score": 1.0, + "content": "NeRF (Mildenhall et al., 2020). In our network, all the 3D locations and RGB values are processed", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 263, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 263, + 506, + 277 + ], + "score": 1.0, + "content": "by the positional encoding proposed by NeRF (Mildenhall et al., 2020). The L2 loss between the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 273, + 506, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 506, + 287 + ], + "score": 1.0, + "content": "rendered RGB and the ground truth is used to optimize the whole neural network. All these details", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 285, + 228, + 299 + ], + "spans": [ + { + "bbox": [ + 106, + 285, + 228, + 299 + ], + "score": 1.0, + "content": "are presented in the appendix.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 12 + }, + { + "type": "title", + "bbox": [ + 108, + 313, + 193, + 326 + ], + "lines": [ + { + "bbox": [ + 105, + 312, + 195, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 312, + 195, + 329 + ], + "score": 1.0, + "content": "4 EVALUATION", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "title", + "bbox": [ + 107, + 338, + 312, + 349 + ], + "lines": [ + { + "bbox": [ + 105, + 337, + 312, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 312, + 351 + ], + "score": 1.0, + "content": "4.1 EXPERIMENTS ON SHAPENETV2 DATASET", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 359, + 505, + 414 + ], + "lines": [ + { + "bbox": [ + 106, + 359, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 106, + 359, + 505, + 372 + ], + "score": 1.0, + "content": "Following the experimental settings of SRNs (Sitzmann et al., 2019), we firstly evaluate our GRF on", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 370, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 106, + 370, + 505, + 383 + ], + "score": 1.0, + "content": "the chair and car classes of ShapeNetv2. Particularly, the chair has 4612 objects for training, 662 for", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 380, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 505, + 394 + ], + "score": 1.0, + "content": "validation and 1317 for testing, while the car has 2151 objects for training, 352 for validation and", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 391, + 504, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 391, + 465, + 405 + ], + "score": 1.0, + "content": "704 for testing. Each training object has randomly sampled 50 images with a resolution of", + "type": "text" + }, + { + "bbox": [ + 465, + 392, + 504, + 403 + ], + "score": 0.88, + "content": "1 2 8 \\times 1 2 8", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 403, + 357, + 416 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 357, + 416 + ], + "score": 1.0, + "content": "pixels. We conduct the following three groups of experiments.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 420, + 505, + 514 + ], + "lines": [ + { + "bbox": [ + 106, + 419, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 505, + 433 + ], + "score": 1.0, + "content": "• Group 1: Novel-view synthesis of seen objects in the training split of the same category. In", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 114, + 431, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 114, + 431, + 506, + 443 + ], + "score": 1.0, + "content": "particular, we train two separate models on the training split of chairs and cars, and these two", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 113, + 440, + 506, + 456 + ], + "spans": [ + { + "bbox": [ + 113, + 440, + 506, + 456 + ], + "score": 1.0, + "content": "models are separately tested on the trained objects to generate completely novel views. During", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 113, + 453, + 504, + 466 + ], + "spans": [ + { + "bbox": [ + 113, + 453, + 504, + 466 + ], + "score": 1.0, + "content": "testing, the model is fed with 50 trained views and infers another 251 novel views for evaluation.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 466, + 505, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 505, + 479 + ], + "score": 1.0, + "content": "• Group 2: Novel-view synthesis of unseen objects in the testing split of the same category. The", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 113, + 477, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 113, + 477, + 505, + 491 + ], + "score": 1.0, + "content": "trained two models in Group 1 are tested on novel objects of the same category. During testing,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 113, + 488, + 505, + 501 + ], + "spans": [ + { + "bbox": [ + 113, + 488, + 505, + 501 + ], + "score": 1.0, + "content": "the model is fed with 2 novel views of each novel object, inferring 251 novel views for evaluation.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 502, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 505, + 515 + ], + "score": 1.0, + "content": "• Group 3: Similar to Group 2, but only 1 novel view is fed into the model for novel view synthesis.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 107, + 519, + 505, + 564 + ], + "lines": [ + { + "bbox": [ + 105, + 519, + 506, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 506, + 532 + ], + "score": 1.0, + "content": "Basically, the experiments of Group 1, 2 and 3 are exactly the same as in SRNs (Sitzmann et al.,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 529, + 506, + 544 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 506, + 544 + ], + "score": 1.0, + "content": "2019) which is also the state of the art on this ShapeNetv2 dataset. Table 1 compares the quantitative", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 541, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 505, + 554 + ], + "score": 1.0, + "content": "results of our GRF and four baselines. Note that, the recent NeRF and NSVF are not scalable to learn", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 551, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 505, + 565 + ], + "score": 1.0, + "content": "large number of scenes simultaneously because each scene is encoded into the network parameters.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 106, + 569, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 567, + 506, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 506, + 583 + ], + "score": 1.0, + "content": "Analysis. 1) Our method outperforms SRNs on 50-view reconstruction, demonstrating the strong", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 580, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 106, + 580, + 505, + 592 + ], + "score": 1.0, + "content": "capability of our GRF for 3D scene representation. Figure 3 shows the qualitative results. 2) Our", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 590, + 505, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 590, + 505, + 603 + ], + "score": 1.0, + "content": "GRF lags behind SRNs for novel scene reconstruction in both Group 2 and 3. Fundamentally, this", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 601, + 504, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 504, + 614 + ], + "score": 1.0, + "content": "is because our GRF solves a much harder problem than SRNs. In particular, our network directly", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 613, + 505, + 625 + ], + "spans": [ + { + "bbox": [ + 106, + 613, + 505, + 625 + ], + "score": 1.0, + "content": "infers the novel scene representation in a single forward pass, while SRNs needs to be retrained", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 624, + 506, + 636 + ], + "spans": [ + { + "bbox": [ + 106, + 624, + 506, + 636 + ], + "score": 1.0, + "content": "on all novel scenes to optimize the latent code. As a result, the experiments of Group 2 and 3 are", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 635, + 506, + 647 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 506, + 647 + ], + "score": 1.0, + "content": "significantly in favour of SRNs. 3) To further demonstrate the advantage of GRF over SRNs, we", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 647, + 505, + 659 + ], + "spans": [ + { + "bbox": [ + 106, + 647, + 505, + 659 + ], + "score": 1.0, + "content": "directly evaluate the trained SRNs model on unseen objects (of the same category) without retrain-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 659, + 504, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 659, + 504, + 672 + ], + "score": 1.0, + "content": "ing. For comparison, we also directly evaluate the trained GRF model on the same novel objects.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 671, + 506, + 686 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 506, + 686 + ], + "score": 1.0, + "content": "Figure 4 shows the qualitative results. It can be seen that if not retrained, SRNs completely fails", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 684, + 505, + 696 + ], + "spans": [ + { + "bbox": [ + 106, + 684, + 505, + 696 + ], + "score": 1.0, + "content": "to reconstruct unseen car instances, but randomly generates similar cars from learned prior knowl-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 696, + 504, + 708 + ], + "spans": [ + { + "bbox": [ + 106, + 696, + 504, + 708 + ], + "score": 1.0, + "content": "edge, primarily because its latent code has not been updated from the unseen objects. In contrast, by", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 707, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 707, + 505, + 721 + ], + "score": 1.0, + "content": "learning pixel local patterns, our GRF generalizes well to novel objects directly. This highlights the", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 720, + 309, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 309, + 733 + ], + "score": 1.0, + "content": "superiority of the simple formulation of our GRF.", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 41.5 + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "6", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 106, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 319, + 93 + ], + "lines": [], + "index": 0, + "bbox_fs": [ + 105, + 81, + 320, + 95 + ], + "lines_deleted": true + }, + { + "type": "interline_equation", + "bbox": [ + 168, + 93, + 442, + 114 + ], + "lines": [ + { + "bbox": [ + 168, + 93, + 442, + 114 + ], + "spans": [ + { + "bbox": [ + 168, + 93, + 442, + 114 + ], + "score": 0.9, + "content": "d _ { p } = M L P s ( \\bar { \\mathbf { F } } _ { p } ) , \\qquad \\quad ( r _ { p } , g _ { p } , b _ { p } ) = M L P s \\Bigl ( \\bar { \\mathbf { F } } _ { p } , \\{ x _ { p } ^ { v } , y _ { p } ^ { v } , z _ { p } ^ { v } \\} \\Bigr )", + "type": "interline_equation", + "image_path": "26d919dff65d750e3d751851267bb1bf28a0879c63c1fd693d6eb7ee186b7238.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 168, + 93, + 442, + 114 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 114, + 505, + 182 + ], + "lines": [ + { + "bbox": [ + 105, + 113, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 113, + 506, + 128 + ], + "score": 1.0, + "content": "To render the color of any query ray passing through the 3D scene, the classic volume rendering", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 125, + 505, + 138 + ], + "spans": [ + { + "bbox": [ + 106, + 125, + 505, + 138 + ], + "score": 1.0, + "content": "(Kajiya & Herzen, 1984) is applied and the integral is estimated by sampling a discrete set of 3D", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 136, + 505, + 149 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 505, + 149 + ], + "score": 1.0, + "content": "points along the query ray. In particular, we exactly follow the formulation of ray marching and the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 147, + 506, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 147, + 506, + 162 + ], + "score": 1.0, + "content": "hierarchical sampling strategy in NeRF (Mildenhall et al., 2020). Eventually, novel 2D images can", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 159, + 506, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 506, + 173 + ], + "score": 1.0, + "content": "be directly synthesized from our GRF by querying light rays. This allows the entire network to be", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 170, + 372, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 372, + 183 + ], + "score": 1.0, + "content": "trainable only with a set of 2D images, without requiring 3D data.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 113, + 506, + 183 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 196, + 209, + 207 + ], + "lines": [ + { + "bbox": [ + 106, + 196, + 210, + 208 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 210, + 208 + ], + "score": 1.0, + "content": "3.6 IMPLEMENTATION", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 106, + 216, + 505, + 298 + ], + "lines": [ + { + "bbox": [ + 105, + 214, + 506, + 230 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 506, + 230 + ], + "score": 1.0, + "content": "The proposed four modules are connected and trained end-to-end. In the implementation, details of", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 227, + 505, + 241 + ], + "spans": [ + { + "bbox": [ + 106, + 227, + 505, + 241 + ], + "score": 1.0, + "content": "the CNN module and the attention module for different experiments are presented in the appendix.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 239, + 506, + 254 + ], + "spans": [ + { + "bbox": [ + 105, + 239, + 506, + 254 + ], + "score": 1.0, + "content": "In the neural rendering module, all the designs of neural layers and other settings simply follow", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 252, + 506, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 252, + 506, + 266 + ], + "score": 1.0, + "content": "NeRF (Mildenhall et al., 2020). In our network, all the 3D locations and RGB values are processed", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 263, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 263, + 506, + 277 + ], + "score": 1.0, + "content": "by the positional encoding proposed by NeRF (Mildenhall et al., 2020). The L2 loss between the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 273, + 506, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 506, + 287 + ], + "score": 1.0, + "content": "rendered RGB and the ground truth is used to optimize the whole neural network. All these details", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 285, + 228, + 299 + ], + "spans": [ + { + "bbox": [ + 106, + 285, + 228, + 299 + ], + "score": 1.0, + "content": "are presented in the appendix.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 214, + 506, + 299 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 313, + 193, + 326 + ], + "lines": [ + { + "bbox": [ + 105, + 312, + 195, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 312, + 195, + 329 + ], + "score": 1.0, + "content": "4 EVALUATION", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "title", + "bbox": [ + 107, + 338, + 312, + 349 + ], + "lines": [ + { + "bbox": [ + 105, + 337, + 312, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 312, + 351 + ], + "score": 1.0, + "content": "4.1 EXPERIMENTS ON SHAPENETV2 DATASET", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 359, + 505, + 414 + ], + "lines": [ + { + "bbox": [ + 106, + 359, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 106, + 359, + 505, + 372 + ], + "score": 1.0, + "content": "Following the experimental settings of SRNs (Sitzmann et al., 2019), we firstly evaluate our GRF on", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 370, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 106, + 370, + 505, + 383 + ], + "score": 1.0, + "content": "the chair and car classes of ShapeNetv2. Particularly, the chair has 4612 objects for training, 662 for", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 380, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 505, + 394 + ], + "score": 1.0, + "content": "validation and 1317 for testing, while the car has 2151 objects for training, 352 for validation and", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 391, + 504, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 391, + 465, + 405 + ], + "score": 1.0, + "content": "704 for testing. Each training object has randomly sampled 50 images with a resolution of", + "type": "text" + }, + { + "bbox": [ + 465, + 392, + 504, + 403 + ], + "score": 0.88, + "content": "1 2 8 \\times 1 2 8", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 403, + 357, + 416 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 357, + 416 + ], + "score": 1.0, + "content": "pixels. We conduct the following three groups of experiments.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 359, + 505, + 416 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 420, + 505, + 514 + ], + "lines": [ + { + "bbox": [ + 106, + 419, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 505, + 433 + ], + "score": 1.0, + "content": "• Group 1: Novel-view synthesis of seen objects in the training split of the same category. In", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 114, + 431, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 114, + 431, + 506, + 443 + ], + "score": 1.0, + "content": "particular, we train two separate models on the training split of chairs and cars, and these two", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 113, + 440, + 506, + 456 + ], + "spans": [ + { + "bbox": [ + 113, + 440, + 506, + 456 + ], + "score": 1.0, + "content": "models are separately tested on the trained objects to generate completely novel views. During", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 113, + 453, + 504, + 466 + ], + "spans": [ + { + "bbox": [ + 113, + 453, + 504, + 466 + ], + "score": 1.0, + "content": "testing, the model is fed with 50 trained views and infers another 251 novel views for evaluation.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 466, + 505, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 505, + 479 + ], + "score": 1.0, + "content": "• Group 2: Novel-view synthesis of unseen objects in the testing split of the same category. The", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 113, + 477, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 113, + 477, + 505, + 491 + ], + "score": 1.0, + "content": "trained two models in Group 1 are tested on novel objects of the same category. During testing,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 113, + 488, + 505, + 501 + ], + "spans": [ + { + "bbox": [ + 113, + 488, + 505, + 501 + ], + "score": 1.0, + "content": "the model is fed with 2 novel views of each novel object, inferring 251 novel views for evaluation.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 502, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 505, + 515 + ], + "score": 1.0, + "content": "• Group 3: Similar to Group 2, but only 1 novel view is fed into the model for novel view synthesis.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 26.5, + "bbox_fs": [ + 106, + 419, + 506, + 515 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 519, + 505, + 564 + ], + "lines": [ + { + "bbox": [ + 105, + 519, + 506, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 506, + 532 + ], + "score": 1.0, + "content": "Basically, the experiments of Group 1, 2 and 3 are exactly the same as in SRNs (Sitzmann et al.,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 529, + 506, + 544 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 506, + 544 + ], + "score": 1.0, + "content": "2019) which is also the state of the art on this ShapeNetv2 dataset. Table 1 compares the quantitative", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 541, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 505, + 554 + ], + "score": 1.0, + "content": "results of our GRF and four baselines. Note that, the recent NeRF and NSVF are not scalable to learn", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 551, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 505, + 565 + ], + "score": 1.0, + "content": "large number of scenes simultaneously because each scene is encoded into the network parameters.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 519, + 506, + 565 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 569, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 567, + 506, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 506, + 583 + ], + "score": 1.0, + "content": "Analysis. 1) Our method outperforms SRNs on 50-view reconstruction, demonstrating the strong", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 580, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 106, + 580, + 505, + 592 + ], + "score": 1.0, + "content": "capability of our GRF for 3D scene representation. Figure 3 shows the qualitative results. 2) Our", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 590, + 505, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 590, + 505, + 603 + ], + "score": 1.0, + "content": "GRF lags behind SRNs for novel scene reconstruction in both Group 2 and 3. Fundamentally, this", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 601, + 504, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 504, + 614 + ], + "score": 1.0, + "content": "is because our GRF solves a much harder problem than SRNs. In particular, our network directly", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 613, + 505, + 625 + ], + "spans": [ + { + "bbox": [ + 106, + 613, + 505, + 625 + ], + "score": 1.0, + "content": "infers the novel scene representation in a single forward pass, while SRNs needs to be retrained", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 624, + 506, + 636 + ], + "spans": [ + { + "bbox": [ + 106, + 624, + 506, + 636 + ], + "score": 1.0, + "content": "on all novel scenes to optimize the latent code. As a result, the experiments of Group 2 and 3 are", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 635, + 506, + 647 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 506, + 647 + ], + "score": 1.0, + "content": "significantly in favour of SRNs. 3) To further demonstrate the advantage of GRF over SRNs, we", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 647, + 505, + 659 + ], + "spans": [ + { + "bbox": [ + 106, + 647, + 505, + 659 + ], + "score": 1.0, + "content": "directly evaluate the trained SRNs model on unseen objects (of the same category) without retrain-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 659, + 504, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 659, + 504, + 672 + ], + "score": 1.0, + "content": "ing. For comparison, we also directly evaluate the trained GRF model on the same novel objects.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 671, + 506, + 686 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 506, + 686 + ], + "score": 1.0, + "content": "Figure 4 shows the qualitative results. It can be seen that if not retrained, SRNs completely fails", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 684, + 505, + 696 + ], + "spans": [ + { + "bbox": [ + 106, + 684, + 505, + 696 + ], + "score": 1.0, + "content": "to reconstruct unseen car instances, but randomly generates similar cars from learned prior knowl-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 696, + 504, + 708 + ], + "spans": [ + { + "bbox": [ + 106, + 696, + 504, + 708 + ], + "score": 1.0, + "content": "edge, primarily because its latent code has not been updated from the unseen objects. In contrast, by", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 707, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 707, + 505, + 721 + ], + "score": 1.0, + "content": "learning pixel local patterns, our GRF generalizes well to novel objects directly. This highlights the", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 720, + 309, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 309, + 733 + ], + "score": 1.0, + "content": "superiority of the simple formulation of our GRF.", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 41.5, + "bbox_fs": [ + 105, + 567, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 106, + 145, + 505, + 245 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 79, + 505, + 136 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 80, + 506, + 93 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 506, + 93 + ], + "score": 1.0, + "content": "Table 1: Comparison of the PSNR (in dB) and SSIM of reconstructed images in the ShapeNetv2", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 91, + 505, + 103 + ], + "spans": [ + { + "bbox": [ + 106, + 91, + 505, + 103 + ], + "score": 1.0, + "content": "dataset by our GRF, the deterministic GQN (Eslami et al., 2018), TCO (Tatarchenko et al., 2015),", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 102, + 506, + 115 + ], + "spans": [ + { + "bbox": [ + 105, + 102, + 506, + 115 + ], + "score": 1.0, + "content": "WRL (Worrall et al., 2017) and SRNs (Sitzmann et al., 2019). The higher the scores, the better the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 113, + 506, + 126 + ], + "spans": [ + { + "bbox": [ + 105, + 113, + 506, + 126 + ], + "score": 1.0, + "content": "synthesized novel views. Note that, our GRF solves a harder problem than SRNs, because GRF", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 124, + 454, + 136 + ], + "spans": [ + { + "bbox": [ + 106, + 124, + 454, + 136 + ], + "score": 1.0, + "content": "infers the novel scene representation in a single forward pass, while SRNs cannot.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "table_body", + "bbox": [ + 106, + 145, + 505, + 245 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 145, + 505, + 245 + ], + "spans": [ + { + "bbox": [ + 106, + 145, + 505, + 245 + ], + "score": 0.711, + "html": "
50 Images (Group 1)2 Images (Group 2)1 Image (Group 3)
ChairsCarsChairsCarsChairsCars
TCO24.31/ 0.9220.38/0.8321.33/ 0.8818.41 /0.8021.27 / 0.8818.15/0.79
WRL24.57 / 0.9319.16 /0.8222.28/0.9017.20 /0.7822.11/0.9016.89 / 0.77
dGQN22.72/0.9019.61 /0.8122.36 /0.8918.79 /0.7921.59 / 0.8718.19 /0.78
SRNs26.23 / 0.9526.32 /0.9424.48 / 0.9222.94 / 0.8822.89 / 0.9120.72 / 0.85
GRF (Ours)27.10 / 0.9527.21 / 0.9422.65/0.8822.06 /0.8621.25/0.8619.84/ 0.81
", + "type": "table", + "image_path": "e4fa34648ba5c9c90c1bdadb195d161c5ec17e80900f684eac0614a5458324ab.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 106, + 145, + 505, + 178.33333333333334 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 106, + 178.33333333333334, + 505, + 211.66666666666669 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 106, + 211.66666666666669, + 505, + 245.00000000000003 + ], + "spans": [], + "index": 7 + } + ] + } + ], + "index": 4.0 + }, + { + "type": "image", + "bbox": [ + 107, + 260, + 505, + 306 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 260, + 505, + 306 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 260, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 107, + 260, + 505, + 306 + ], + "score": 0.279, + "type": "image", + "image_path": "2df62752b06cd043c2e56bd864bd2c55fce00ed1bd7adfe827095d12d01968ae.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 107, + 260, + 505, + 275.3333333333333 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 107, + 275.3333333333333, + 505, + 290.66666666666663 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 107, + 290.66666666666663, + 505, + 305.99999999999994 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 109, + 298, + 500, + 318 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 306, + 501, + 319 + ], + "spans": [ + { + "bbox": [ + 110, + 306, + 501, + 319 + ], + "score": 1.0, + "content": "Figure 3: Qualitative results of SRNs and our GRF for 50-view reconstruction of chairs and cars.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "image_caption", + "bbox": [ + 104, + 612, + 481, + 624 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 611, + 482, + 625 + ], + "spans": [ + { + "bbox": [ + 106, + 611, + 482, + 625 + ], + "score": 1.0, + "content": "or on par with the state-of-the-art NSVF on all metrics. Figure 6 shows the qualitative results.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 44 + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 107, + 324, + 505, + 376 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 324, + 505, + 376 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 107, + 324, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 107, + 324, + 505, + 376 + ], + "score": 0.857, + "type": "image", + "image_path": "ce6817cec552833df65cb0e59da8ce2a23b611b88d65539290d9ff8fca51274d.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 107, + 324, + 505, + 341.3333333333333 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 107, + 341.3333333333333, + 505, + 358.66666666666663 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 107, + 358.66666666666663, + 505, + 375.99999999999994 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 377, + 506, + 401 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 376, + 505, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 505, + 390 + ], + "score": 1.0, + "content": "Figure 4: Qualitative results of SRNs (without retraining) and our GRF for 50-view reconstruction", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 388, + 455, + 403 + ], + "spans": [ + { + "bbox": [ + 104, + 388, + 455, + 403 + ], + "score": 1.0, + "content": "of unseen cars. SRNs fails to recover faithful shapes for unseen cars without retraining.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + } + ], + "index": 14.25 + }, + { + "type": "title", + "bbox": [ + 107, + 425, + 333, + 436 + ], + "lines": [ + { + "bbox": [ + 105, + 425, + 334, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 334, + 438 + ], + "score": 1.0, + "content": "4.2 EXPERIMENTS ON SYNTHETIC-NERF DATASET", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 447, + 288, + 536 + ], + "lines": [ + { + "bbox": [ + 106, + 447, + 289, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 447, + 289, + 459 + ], + "score": 1.0, + "content": "We further evaluate our approach on the more", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 459, + 289, + 470 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 289, + 470 + ], + "score": 1.0, + "content": "complex dataset Synthetic-NeRF (Mildenhall", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 469, + 289, + 482 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 289, + 482 + ], + "score": 1.0, + "content": "et al., 2020). It consists of pathtraced images", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 480, + 289, + 492 + ], + "spans": [ + { + "bbox": [ + 106, + 480, + 289, + 492 + ], + "score": 1.0, + "content": "of 8 synthetic scenes with much more compli-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 492, + 289, + 502 + ], + "spans": [ + { + "bbox": [ + 106, + 492, + 289, + 502 + ], + "score": 1.0, + "content": "cated geometry and realistic non-Lambertian", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 502, + 289, + 514 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 289, + 514 + ], + "score": 1.0, + "content": "materials. Each scene has 100 views for train-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 513, + 289, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 289, + 525 + ], + "score": 1.0, + "content": "ing and 200 novel views for testing. Each im-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 524, + 289, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 217, + 536 + ], + "score": 1.0, + "content": "age has a high resolution of", + "type": "text" + }, + { + "bbox": [ + 217, + 524, + 260, + 535 + ], + "score": 0.89, + "content": "8 0 0 \\times 8 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 524, + 289, + 536 + ], + "score": 1.0, + "content": "pixels.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 106, + 541, + 288, + 614 + ], + "lines": [ + { + "bbox": [ + 106, + 541, + 289, + 554 + ], + "spans": [ + { + "bbox": [ + 106, + 541, + 289, + 554 + ], + "score": 1.0, + "content": "Single-scene Learning. To demonstrate the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 554, + 289, + 566 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 289, + 566 + ], + "score": 1.0, + "content": "representational capability of our GRF, we", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 565, + 289, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 289, + 579 + ], + "score": 1.0, + "content": "train a single model for each synthetic scene,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 577, + 289, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 289, + 590 + ], + "score": 1.0, + "content": "following the same experimental settings of", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 588, + 291, + 604 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 291, + 604 + ], + "score": 1.0, + "content": "NSVF (Liu et al., 2020). Table 2 compares", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 601, + 290, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 290, + 613 + ], + "score": 1.0, + "content": "the quantitative results. Our method is better", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5 + }, + { + "type": "table", + "bbox": [ + 297, + 512, + 505, + 601 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 296, + 444, + 505, + 511 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 295, + 444, + 506, + 457 + ], + "spans": [ + { + "bbox": [ + 295, + 444, + 506, + 457 + ], + "score": 1.0, + "content": "Table 2: The average scores of PSNR, SSIM and", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 296, + 456, + 506, + 468 + ], + "spans": [ + { + "bbox": [ + 296, + 456, + 506, + 468 + ], + "score": 1.0, + "content": "LPIPS (Zhang et al., 2018) for our GRF, SRNs", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 296, + 467, + 505, + 479 + ], + "spans": [ + { + "bbox": [ + 296, + 467, + 505, + 479 + ], + "score": 1.0, + "content": "(Sitzmann et al., 2019), NV (Lombardi et al., 2019),", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 295, + 478, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 295, + 478, + 505, + 489 + ], + "score": 1.0, + "content": "LLFF (Mildenhall et al., 2019), NeRF (Mildenhall", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 295, + 489, + 505, + 501 + ], + "spans": [ + { + "bbox": [ + 295, + 489, + 505, + 501 + ], + "score": 1.0, + "content": "et al., 2020) and NSVF (Liu et al., 2020) on the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 295, + 499, + 497, + 513 + ], + "spans": [ + { + "bbox": [ + 295, + 499, + 497, + 513 + ], + "score": 1.0, + "content": "Synthetic-NeRF dataset for single-scene learning.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 34.5 + }, + { + "type": "table_body", + "bbox": [ + 297, + 512, + 505, + 601 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 297, + 512, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 297, + 512, + 505, + 601 + ], + "score": 0.975, + "html": "
PSNR↑SSIM↑LPIPS↓
SRNs22.260.8460.170
NV26.050.8930.160
LLFF24.880.9110.114
NeRF31.010.9470.081
NSVF31.740.9530.047
GRF(Ours)32.060.9600.048
", + "type": "table", + "image_path": "414f5dd3af395f2566e75e951ed08981951767a1f8507c7e13c4426b34f8a5a7.jpg" + } + ] + } + ], + "index": 40.5, + "virtual_lines": [ + { + "bbox": [ + 297, + 512, + 505, + 526.8333333333334 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 297, + 526.8333333333334, + 505, + 541.6666666666667 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 297, + 541.6666666666667, + 505, + 556.5000000000001 + ], + "spans": [], + "index": 40 + }, + { + "bbox": [ + 297, + 556.5000000000001, + 505, + 571.3333333333335 + ], + "spans": [], + "index": 41 + }, + { + "bbox": [ + 297, + 571.3333333333335, + 505, + 586.1666666666669 + ], + "spans": [], + "index": 42 + }, + { + "bbox": [ + 297, + 586.1666666666669, + 505, + 601.0000000000002 + ], + "spans": [], + "index": 43 + } + ] + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 107, + 628, + 505, + 666 + ], + "lines": [ + { + "bbox": [ + 106, + 629, + 505, + 641 + ], + "spans": [ + { + "bbox": [ + 106, + 629, + 505, + 641 + ], + "score": 1.0, + "content": "Novel-scene Generalization. To evaluate the generalization of GRF on complex scenes, we train a", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 639, + 506, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 506, + 655 + ], + "score": 1.0, + "content": "single model simultaneously from randomly selected 4 scenes of Synthetic-NeRF, i.e., Chair, Mic,", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 653, + 419, + 666 + ], + "spans": [ + { + "bbox": [ + 106, + 653, + 419, + 666 + ], + "score": 1.0, + "content": "Ship, and Hotdog, and then conduct the following two groups of experiments.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46 + }, + { + "type": "text", + "bbox": [ + 107, + 671, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 114, + 671, + 505, + 685 + ], + "spans": [ + { + "bbox": [ + 114, + 671, + 505, + 685 + ], + "score": 1.0, + "content": "Group 1: The trained model is directly tested on the remaining 4 novel scenes of Synthetic-NeRF", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 114, + 683, + 506, + 697 + ], + "spans": [ + { + "bbox": [ + 114, + 683, + 506, + 697 + ], + "score": 1.0, + "content": "dataset, i.e., Drums, Lego, Materials, and Ficus. Fundamentally, this experiment is to evaluate", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 114, + 695, + 505, + 709 + ], + "spans": [ + { + "bbox": [ + 114, + 695, + 505, + 709 + ], + "score": 1.0, + "content": "whether the learned limited features can truly generalize to new scenarios. This is extremely chal-", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 114, + 707, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 114, + 707, + 505, + 722 + ], + "score": 1.0, + "content": "lenging because there are only 4 training scenes and the overall shapes of the 4 novel scenes are", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 114, + 719, + 294, + 734 + ], + "spans": [ + { + "bbox": [ + 114, + 719, + 294, + 734 + ], + "score": 1.0, + "content": "dramatically different from the trained ones.", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 50 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "score": 1.0, + "content": "7", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 106, + 145, + 505, + 245 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 79, + 505, + 136 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 80, + 506, + 93 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 506, + 93 + ], + "score": 1.0, + "content": "Table 1: Comparison of the PSNR (in dB) and SSIM of reconstructed images in the ShapeNetv2", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 91, + 505, + 103 + ], + "spans": [ + { + "bbox": [ + 106, + 91, + 505, + 103 + ], + "score": 1.0, + "content": "dataset by our GRF, the deterministic GQN (Eslami et al., 2018), TCO (Tatarchenko et al., 2015),", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 102, + 506, + 115 + ], + "spans": [ + { + "bbox": [ + 105, + 102, + 506, + 115 + ], + "score": 1.0, + "content": "WRL (Worrall et al., 2017) and SRNs (Sitzmann et al., 2019). The higher the scores, the better the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 113, + 506, + 126 + ], + "spans": [ + { + "bbox": [ + 105, + 113, + 506, + 126 + ], + "score": 1.0, + "content": "synthesized novel views. Note that, our GRF solves a harder problem than SRNs, because GRF", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 124, + 454, + 136 + ], + "spans": [ + { + "bbox": [ + 106, + 124, + 454, + 136 + ], + "score": 1.0, + "content": "infers the novel scene representation in a single forward pass, while SRNs cannot.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "table_body", + "bbox": [ + 106, + 145, + 505, + 245 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 145, + 505, + 245 + ], + "spans": [ + { + "bbox": [ + 106, + 145, + 505, + 245 + ], + "score": 0.711, + "html": "
50 Images (Group 1)2 Images (Group 2)1 Image (Group 3)
ChairsCarsChairsCarsChairsCars
TCO24.31/ 0.9220.38/0.8321.33/ 0.8818.41 /0.8021.27 / 0.8818.15/0.79
WRL24.57 / 0.9319.16 /0.8222.28/0.9017.20 /0.7822.11/0.9016.89 / 0.77
dGQN22.72/0.9019.61 /0.8122.36 /0.8918.79 /0.7921.59 / 0.8718.19 /0.78
SRNs26.23 / 0.9526.32 /0.9424.48 / 0.9222.94 / 0.8822.89 / 0.9120.72 / 0.85
GRF (Ours)27.10 / 0.9527.21 / 0.9422.65/0.8822.06 /0.8621.25/0.8619.84/ 0.81
", + "type": "table", + "image_path": "e4fa34648ba5c9c90c1bdadb195d161c5ec17e80900f684eac0614a5458324ab.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 106, + 145, + 505, + 178.33333333333334 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 106, + 178.33333333333334, + 505, + 211.66666666666669 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 106, + 211.66666666666669, + 505, + 245.00000000000003 + ], + "spans": [], + "index": 7 + } + ] + } + ], + "index": 4.0 + }, + { + "type": "image", + "bbox": [ + 107, + 260, + 505, + 306 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 260, + 505, + 306 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 260, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 107, + 260, + 505, + 306 + ], + "score": 0.279, + "type": "image", + "image_path": "2df62752b06cd043c2e56bd864bd2c55fce00ed1bd7adfe827095d12d01968ae.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 107, + 260, + 505, + 275.3333333333333 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 107, + 275.3333333333333, + 505, + 290.66666666666663 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 107, + 290.66666666666663, + 505, + 305.99999999999994 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 109, + 298, + 500, + 318 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 306, + 501, + 319 + ], + "spans": [ + { + "bbox": [ + 110, + 306, + 501, + 319 + ], + "score": 1.0, + "content": "Figure 3: Qualitative results of SRNs and our GRF for 50-view reconstruction of chairs and cars.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "image_caption", + "bbox": [ + 104, + 612, + 481, + 624 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 611, + 482, + 625 + ], + "spans": [ + { + "bbox": [ + 106, + 611, + 482, + 625 + ], + "score": 1.0, + "content": "or on par with the state-of-the-art NSVF on all metrics. Figure 6 shows the qualitative results.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 44 + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 107, + 324, + 505, + 376 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 324, + 505, + 376 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 107, + 324, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 107, + 324, + 505, + 376 + ], + "score": 0.857, + "type": "image", + "image_path": "ce6817cec552833df65cb0e59da8ce2a23b611b88d65539290d9ff8fca51274d.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 107, + 324, + 505, + 341.3333333333333 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 107, + 341.3333333333333, + 505, + 358.66666666666663 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 107, + 358.66666666666663, + 505, + 375.99999999999994 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 377, + 506, + 401 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 376, + 505, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 505, + 390 + ], + "score": 1.0, + "content": "Figure 4: Qualitative results of SRNs (without retraining) and our GRF for 50-view reconstruction", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 388, + 455, + 403 + ], + "spans": [ + { + "bbox": [ + 104, + 388, + 455, + 403 + ], + "score": 1.0, + "content": "of unseen cars. SRNs fails to recover faithful shapes for unseen cars without retraining.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + } + ], + "index": 14.25 + }, + { + "type": "title", + "bbox": [ + 107, + 425, + 333, + 436 + ], + "lines": [ + { + "bbox": [ + 105, + 425, + 334, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 334, + 438 + ], + "score": 1.0, + "content": "4.2 EXPERIMENTS ON SYNTHETIC-NERF DATASET", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 447, + 288, + 536 + ], + "lines": [ + { + "bbox": [ + 106, + 447, + 289, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 447, + 289, + 459 + ], + "score": 1.0, + "content": "We further evaluate our approach on the more", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 459, + 289, + 470 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 289, + 470 + ], + "score": 1.0, + "content": "complex dataset Synthetic-NeRF (Mildenhall", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 469, + 289, + 482 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 289, + 482 + ], + "score": 1.0, + "content": "et al., 2020). It consists of pathtraced images", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 480, + 289, + 492 + ], + "spans": [ + { + "bbox": [ + 106, + 480, + 289, + 492 + ], + "score": 1.0, + "content": "of 8 synthetic scenes with much more compli-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 492, + 289, + 502 + ], + "spans": [ + { + "bbox": [ + 106, + 492, + 289, + 502 + ], + "score": 1.0, + "content": "cated geometry and realistic non-Lambertian", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 502, + 289, + 514 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 289, + 514 + ], + "score": 1.0, + "content": "materials. Each scene has 100 views for train-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 513, + 289, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 289, + 525 + ], + "score": 1.0, + "content": "ing and 200 novel views for testing. Each im-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 524, + 289, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 217, + 536 + ], + "score": 1.0, + "content": "age has a high resolution of", + "type": "text" + }, + { + "bbox": [ + 217, + 524, + 260, + 535 + ], + "score": 0.89, + "content": "8 0 0 \\times 8 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 524, + 289, + 536 + ], + "score": 1.0, + "content": "pixels.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 447, + 289, + 536 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 541, + 288, + 614 + ], + "lines": [ + { + "bbox": [ + 106, + 541, + 289, + 554 + ], + "spans": [ + { + "bbox": [ + 106, + 541, + 289, + 554 + ], + "score": 1.0, + "content": "Single-scene Learning. To demonstrate the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 554, + 289, + 566 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 289, + 566 + ], + "score": 1.0, + "content": "representational capability of our GRF, we", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 565, + 289, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 289, + 579 + ], + "score": 1.0, + "content": "train a single model for each synthetic scene,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 577, + 289, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 289, + 590 + ], + "score": 1.0, + "content": "following the same experimental settings of", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 588, + 291, + 604 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 291, + 604 + ], + "score": 1.0, + "content": "NSVF (Liu et al., 2020). Table 2 compares", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 601, + 290, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 290, + 613 + ], + "score": 1.0, + "content": "the quantitative results. Our method is better", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 541, + 291, + 613 + ] + }, + { + "type": "table", + "bbox": [ + 297, + 512, + 505, + 601 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 296, + 444, + 505, + 511 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 295, + 444, + 506, + 457 + ], + "spans": [ + { + "bbox": [ + 295, + 444, + 506, + 457 + ], + "score": 1.0, + "content": "Table 2: The average scores of PSNR, SSIM and", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 296, + 456, + 506, + 468 + ], + "spans": [ + { + "bbox": [ + 296, + 456, + 506, + 468 + ], + "score": 1.0, + "content": "LPIPS (Zhang et al., 2018) for our GRF, SRNs", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 296, + 467, + 505, + 479 + ], + "spans": [ + { + "bbox": [ + 296, + 467, + 505, + 479 + ], + "score": 1.0, + "content": "(Sitzmann et al., 2019), NV (Lombardi et al., 2019),", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 295, + 478, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 295, + 478, + 505, + 489 + ], + "score": 1.0, + "content": "LLFF (Mildenhall et al., 2019), NeRF (Mildenhall", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 295, + 489, + 505, + 501 + ], + "spans": [ + { + "bbox": [ + 295, + 489, + 505, + 501 + ], + "score": 1.0, + "content": "et al., 2020) and NSVF (Liu et al., 2020) on the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 295, + 499, + 497, + 513 + ], + "spans": [ + { + "bbox": [ + 295, + 499, + 497, + 513 + ], + "score": 1.0, + "content": "Synthetic-NeRF dataset for single-scene learning.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 34.5 + }, + { + "type": "table_body", + "bbox": [ + 297, + 512, + 505, + 601 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 297, + 512, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 297, + 512, + 505, + 601 + ], + "score": 0.975, + "html": "
PSNR↑SSIM↑LPIPS↓
SRNs22.260.8460.170
NV26.050.8930.160
LLFF24.880.9110.114
NeRF31.010.9470.081
NSVF31.740.9530.047
GRF(Ours)32.060.9600.048
", + "type": "table", + "image_path": "414f5dd3af395f2566e75e951ed08981951767a1f8507c7e13c4426b34f8a5a7.jpg" + } + ] + } + ], + "index": 40.5, + "virtual_lines": [ + { + "bbox": [ + 297, + 512, + 505, + 526.8333333333334 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 297, + 526.8333333333334, + 505, + 541.6666666666667 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 297, + 541.6666666666667, + 505, + 556.5000000000001 + ], + "spans": [], + "index": 40 + }, + { + "bbox": [ + 297, + 556.5000000000001, + 505, + 571.3333333333335 + ], + "spans": [], + "index": 41 + }, + { + "bbox": [ + 297, + 571.3333333333335, + 505, + 586.1666666666669 + ], + "spans": [], + "index": 42 + }, + { + "bbox": [ + 297, + 586.1666666666669, + 505, + 601.0000000000002 + ], + "spans": [], + "index": 43 + } + ] + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 107, + 628, + 505, + 666 + ], + "lines": [ + { + "bbox": [ + 106, + 629, + 505, + 641 + ], + "spans": [ + { + "bbox": [ + 106, + 629, + 505, + 641 + ], + "score": 1.0, + "content": "Novel-scene Generalization. To evaluate the generalization of GRF on complex scenes, we train a", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 639, + 506, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 506, + 655 + ], + "score": 1.0, + "content": "single model simultaneously from randomly selected 4 scenes of Synthetic-NeRF, i.e., Chair, Mic,", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 653, + 419, + 666 + ], + "spans": [ + { + "bbox": [ + 106, + 653, + 419, + 666 + ], + "score": 1.0, + "content": "Ship, and Hotdog, and then conduct the following two groups of experiments.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46, + "bbox_fs": [ + 105, + 629, + 506, + 666 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 671, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 114, + 671, + 505, + 685 + ], + "spans": [ + { + "bbox": [ + 114, + 671, + 505, + 685 + ], + "score": 1.0, + "content": "Group 1: The trained model is directly tested on the remaining 4 novel scenes of Synthetic-NeRF", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 114, + 683, + 506, + 697 + ], + "spans": [ + { + "bbox": [ + 114, + 683, + 506, + 697 + ], + "score": 1.0, + "content": "dataset, i.e., Drums, Lego, Materials, and Ficus. Fundamentally, this experiment is to evaluate", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 114, + 695, + 505, + 709 + ], + "spans": [ + { + "bbox": [ + 114, + 695, + 505, + 709 + ], + "score": 1.0, + "content": "whether the learned limited features can truly generalize to new scenarios. This is extremely chal-", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 114, + 707, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 114, + 707, + 505, + 722 + ], + "score": 1.0, + "content": "lenging because there are only 4 training scenes and the overall shapes of the 4 novel scenes are", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 114, + 719, + 294, + 734 + ], + "spans": [ + { + "bbox": [ + 114, + 719, + 294, + 734 + ], + "score": 1.0, + "content": "dramatically different from the trained ones.", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 50, + "bbox_fs": [ + 114, + 671, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 144 + ], + "lines": [ + { + "bbox": [ + 114, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 114, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "Group 2: The trained model is further finetuned on each of the four novel scenes with 100, 1k,", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 114, + 94, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 114, + 95, + 306, + 107 + ], + "score": 1.0, + "content": "and 10k iterations separately. In total, we obtain", + "type": "text" + }, + { + "bbox": [ + 306, + 94, + 353, + 105 + ], + "score": 0.91, + "content": "4 \\times 3 = 1 2", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 95, + 506, + 107 + ], + "score": 1.0, + "content": "new models. For comparison, we also", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 114, + 105, + 506, + 120 + ], + "spans": [ + { + "bbox": [ + 114, + 105, + 506, + 120 + ], + "score": 1.0, + "content": "train NeRF on each of the four novel scenes with 100, 1k, 10k iterations from scratch. This group", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 114, + 118, + 506, + 133 + ], + "spans": [ + { + "bbox": [ + 114, + 118, + 506, + 133 + ], + "score": 1.0, + "content": "of experiments evaluates how the initially-learned general features of our GRF improve novel", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 114, + 130, + 178, + 145 + ], + "spans": [ + { + "bbox": [ + 114, + 130, + 178, + 145 + ], + "score": 1.0, + "content": "scene learning.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 107, + 150, + 288, + 295 + ], + "lines": [ + { + "bbox": [ + 106, + 148, + 288, + 161 + ], + "spans": [ + { + "bbox": [ + 106, + 148, + 288, + 161 + ], + "score": 1.0, + "content": "Analysis. Table 3 compares the quantita-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 161, + 289, + 174 + ], + "spans": [ + { + "bbox": [ + 106, + 161, + 289, + 174 + ], + "score": 1.0, + "content": "tive results. We can see that: 1) In Group", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 107, + 174, + 288, + 185 + ], + "spans": [ + { + "bbox": [ + 107, + 174, + 288, + 185 + ], + "score": 1.0, + "content": "1, our GRF can indeed generalize to novel", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 187, + 288, + 198 + ], + "spans": [ + { + "bbox": [ + 106, + 187, + 288, + 198 + ], + "score": 1.0, + "content": "scenes with complex and completely differ-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 199, + 288, + 210 + ], + "spans": [ + { + "bbox": [ + 107, + 199, + 288, + 210 + ], + "score": 1.0, + "content": "ent overall geometries, demonstrating the ef-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 210, + 289, + 222 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 289, + 222 + ], + "score": 1.0, + "content": "fectiveness of learning point local features", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 222, + 288, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 288, + 234 + ], + "score": 1.0, + "content": "in GRF. As shown in Figure 5, the overall", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 234, + 288, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 288, + 246 + ], + "score": 1.0, + "content": "shape and appearance of Lego can be satis-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 247, + 289, + 259 + ], + "spans": [ + { + "bbox": [ + 106, + 247, + 289, + 259 + ], + "score": 1.0, + "content": "factorily recovered, though it has never been", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 259, + 289, + 271 + ], + "spans": [ + { + "bbox": [ + 106, + 259, + 289, + 271 + ], + "score": 1.0, + "content": "seen before. 2) In Group 2, our GRF can", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 107, + 272, + 288, + 284 + ], + "spans": [ + { + "bbox": [ + 107, + 272, + 288, + 284 + ], + "score": 1.0, + "content": "quickly learn high-quality scene representa-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 283, + 289, + 296 + ], + "spans": [ + { + "bbox": [ + 106, + 283, + 289, + 296 + ], + "score": 1.0, + "content": "tions given a sparse number of training pix-", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 10.5 + }, + { + "type": "table", + "bbox": [ + 297, + 184, + 508, + 293 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 296, + 147, + 505, + 183 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 295, + 145, + 505, + 159 + ], + "spans": [ + { + "bbox": [ + 295, + 145, + 505, + 159 + ], + "score": 1.0, + "content": "Table 3: The average scores of PSNR, SSIM and", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 296, + 159, + 505, + 172 + ], + "spans": [ + { + "bbox": [ + 296, + 159, + 505, + 172 + ], + "score": 1.0, + "content": "LPIPS for GRF and NeRF on four novel scenes of", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 296, + 171, + 423, + 185 + ], + "spans": [ + { + "bbox": [ + 296, + 171, + 423, + 185 + ], + "score": 1.0, + "content": "Synthetic-NeRF in Group 1&2.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + }, + { + "type": "table_body", + "bbox": [ + 297, + 184, + 508, + 293 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 297, + 184, + 508, + 293 + ], + "spans": [ + { + "bbox": [ + 297, + 184, + 508, + 293 + ], + "score": 0.966, + "html": "
PSNR↑ SSIM↑LPIPS↓
GRF (Group 1) 13.62 0.763 0.246
NeRF(Group 2, 100 iters) 15.15 0.752 0.359 NeRF(Group 2,1k iters) 19.81 0.809 0.228 NeRF(Group 2,10k iters) 23.35 0.875 0.137
GRF (Group 2, 100 iters) 19.69 0.835 0.169 GRF (Group 2, 1k iters) 22.00 0.876 0.128 GRF (Group 2,10k iters) 25.10 0.916 0.089
", + "type": "table", + "image_path": "3080c6c65b006f8fbd396908b54525d24ac650e1d6e039623be0413789aa141b.jpg" + } + ] + } + ], + "index": 23.5, + "virtual_lines": [ + { + "bbox": [ + 297, + 184, + 508, + 197.625 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 297, + 197.625, + 508, + 211.25 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 297, + 211.25, + 508, + 224.875 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 297, + 224.875, + 508, + 238.5 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 297, + 238.5, + 508, + 252.125 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 297, + 252.125, + 508, + 265.75 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 297, + 265.75, + 508, + 279.375 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 297, + 279.375, + 508, + 293.0 + ], + "spans": [], + "index": 27 + } + ] + } + ], + "index": 20.75 + }, + { + "type": "text", + "bbox": [ + 107, + 296, + 505, + 344 + ], + "lines": [ + { + "bbox": [ + 105, + 295, + 506, + 308 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 506, + 308 + ], + "score": 1.0, + "content": "els, thanks to the initially learned general features. Compared with the NeRF trained from scratch,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 505, + 321 + ], + "score": 1.0, + "content": "the learned GRF significantly improves novel scene learning, achieving much better results given", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 320, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 505, + 334 + ], + "score": 1.0, + "content": "the same amount of training signals of new scenes. Figure 5 qualitatively shows the generalization", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 331, + 313, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 313, + 345 + ], + "score": 1.0, + "content": "of GRF and more results are presented in appendix.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 29.5 + }, + { + "type": "image", + "bbox": [ + 106, + 347, + 503, + 424 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 106, + 347, + 503, + 424 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 347, + 503, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 503, + 424 + ], + "score": 0.653, + "type": "image", + "image_path": "2b33473f8cad83e6fc6ade9aac3c829b58988eea96b3c91c1071bdc0382ad409.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 106, + 347, + 503, + 372.6666666666667 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 106, + 372.6666666666667, + 503, + 398.33333333333337 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 106, + 398.33333333333337, + 503, + 424.00000000000006 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 164, + 417, + 448, + 428 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 162, + 415, + 450, + 430 + ], + "spans": [ + { + "bbox": [ + 162, + 415, + 450, + 430 + ], + "score": 1.0, + "content": "Figure 5: Qualitative results of our GRF for novel scene generalization.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + } + ], + "index": 34.0 + }, + { + "type": "text", + "bbox": [ + 106, + 434, + 352, + 446 + ], + "lines": [ + { + "bbox": [ + 105, + 433, + 353, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 353, + 447 + ], + "score": 1.0, + "content": "4.3 EXPERIMENTS ON REAL-WORLD COMPLEX SCENES", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 107, + 455, + 304, + 522 + ], + "lines": [ + { + "bbox": [ + 106, + 455, + 305, + 467 + ], + "spans": [ + { + "bbox": [ + 106, + 455, + 305, + 467 + ], + "score": 1.0, + "content": "We evaluate the novel view synthesis on complex", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 466, + 304, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 304, + 478 + ], + "score": 1.0, + "content": "real-world scenes captured by cellphones. There", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 477, + 305, + 489 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 305, + 489 + ], + "score": 1.0, + "content": "are 8 scenes, 5 from LLFF (Mildenhall et al.,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 488, + 305, + 500 + ], + "spans": [ + { + "bbox": [ + 106, + 488, + 305, + 500 + ], + "score": 1.0, + "content": "2019) and 3 from NeRF. Each scene has 20 to 62", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 499, + 305, + 511 + ], + "spans": [ + { + "bbox": [ + 106, + 499, + 305, + 511 + ], + "score": 1.0, + "content": "images, 1/8 of which for testing. All images have", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 510, + 259, + 523 + ], + "spans": [ + { + "bbox": [ + 106, + 510, + 180, + 523 + ], + "score": 1.0, + "content": "high resolution of", + "type": "text" + }, + { + "bbox": [ + 181, + 510, + 229, + 521 + ], + "score": 0.89, + "content": "1 0 0 8 \\times 7 5 6", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 510, + 259, + 523 + ], + "score": 1.0, + "content": "pixels.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 39.5 + }, + { + "type": "text", + "bbox": [ + 106, + 527, + 304, + 573 + ], + "lines": [ + { + "bbox": [ + 105, + 525, + 305, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 305, + 540 + ], + "score": 1.0, + "content": "Single-scene Learning. We train a single model", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 538, + 305, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 305, + 552 + ], + "score": 1.0, + "content": "for each real-world scene, following the same ex-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 550, + 306, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 306, + 564 + ], + "score": 1.0, + "content": "perimental settings of NeRF. Table 4 compares", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 562, + 306, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 562, + 306, + 574 + ], + "score": 1.0, + "content": "the quantitative results. Note that, the recent", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 44.5 + }, + { + "type": "table", + "bbox": [ + 312, + 500, + 505, + 567 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 312, + 455, + 505, + 499 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 311, + 453, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 311, + 453, + 505, + 467 + ], + "score": 1.0, + "content": "Table 4: Comparison of the average PSNR,", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 311, + 464, + 505, + 478 + ], + "spans": [ + { + "bbox": [ + 311, + 464, + 505, + 478 + ], + "score": 1.0, + "content": "SSIM and LPIPS scores of our GRF, SRNs,", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 311, + 475, + 505, + 488 + ], + "spans": [ + { + "bbox": [ + 311, + 475, + 505, + 488 + ], + "score": 1.0, + "content": "LLFF and NeRF in the challenging real-world", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 312, + 486, + 446, + 501 + ], + "spans": [ + { + "bbox": [ + 312, + 486, + 446, + 501 + ], + "score": 1.0, + "content": "dataset for single-scene learning.", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 48.5 + }, + { + "type": "table_body", + "bbox": [ + 312, + 500, + 505, + 567 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 312, + 500, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 312, + 500, + 505, + 567 + ], + "score": 0.977, + "html": "
PSNR↑SSIM↑LPIPS↓
SRNs22.840.6680.378
LLFF24.130.7980.212
NeRF26.500.8110.250
GRF(Ours)26.640.8370.178
", + "type": "table", + "image_path": "ce266d353b51e877a8a168b6fc05c2de9bc86a65d823ee30f8ce43337a952611.jpg" + } + ] + } + ], + "index": 53, + "virtual_lines": [ + { + "bbox": [ + 312, + 500, + 505, + 513.4 + ], + "spans": [], + "index": 51 + }, + { + "bbox": [ + 312, + 513.4, + 505, + 526.8 + ], + "spans": [], + "index": 52 + }, + { + "bbox": [ + 312, + 526.8, + 505, + 540.1999999999999 + ], + "spans": [], + "index": 53 + }, + { + "bbox": [ + 312, + 540.1999999999999, + 505, + 553.5999999999999 + ], + "spans": [], + "index": 54 + }, + { + "bbox": [ + 312, + 553.5999999999999, + 505, + 566.9999999999999 + ], + "spans": [], + "index": 55 + } + ] + } + ], + "index": 50.75 + }, + { + "type": "text", + "bbox": [ + 107, + 574, + 504, + 596 + ], + "lines": [ + { + "bbox": [ + 106, + 573, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 106, + 573, + 505, + 586 + ], + "score": 1.0, + "content": "NSVF (Liu et al., 2020) is unable to process these forward-facing scenes because the predefined", + "type": "text" + } + ], + "index": 56 + }, + { + "bbox": [ + 106, + 585, + 306, + 597 + ], + "spans": [ + { + "bbox": [ + 106, + 585, + 306, + 597 + ], + "score": 1.0, + "content": "voxels cannot represent the unbounded 3D space.", + "type": "text" + } + ], + "index": 57 + } + ], + "index": 56.5 + }, + { + "type": "text", + "bbox": [ + 106, + 601, + 505, + 679 + ], + "lines": [ + { + "bbox": [ + 106, + 600, + 506, + 614 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 506, + 614 + ], + "score": 1.0, + "content": "Analysis. Our method surpasses the state of the art by large margins, especially over the SSIM", + "type": "text" + } + ], + "index": 58 + }, + { + "bbox": [ + 104, + 610, + 505, + 626 + ], + "spans": [ + { + "bbox": [ + 104, + 610, + 505, + 626 + ], + "score": 1.0, + "content": "and LPIPS metrics. Compared with PSNR which only measures the average per-pixel accuracy,", + "type": "text" + } + ], + "index": 59 + }, + { + "bbox": [ + 106, + 623, + 505, + 636 + ], + "spans": [ + { + "bbox": [ + 106, + 623, + 505, + 636 + ], + "score": 1.0, + "content": "the metrics SSIM and LPIPS favor high quality of photorealism, highlighting the superiority of our", + "type": "text" + } + ], + "index": 60 + }, + { + "bbox": [ + 106, + 634, + 505, + 647 + ], + "spans": [ + { + "bbox": [ + 106, + 634, + 505, + 647 + ], + "score": 1.0, + "content": "GRF to generate truly realistic images. Figure 6 shows the qualitative results. As highlighted by the", + "type": "text" + } + ], + "index": 61 + }, + { + "bbox": [ + 105, + 644, + 506, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 506, + 658 + ], + "score": 1.0, + "content": "red circles, our GRF can generate fine-grained and natural geometries in pixel level, while NeRF", + "type": "text" + } + ], + "index": 62 + }, + { + "bbox": [ + 105, + 655, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 669 + ], + "score": 1.0, + "content": "produces many artifacts. This clearly demonstrates our GRF indeed learns general and precise pixel", + "type": "text" + } + ], + "index": 63 + }, + { + "bbox": [ + 104, + 666, + 434, + 681 + ], + "spans": [ + { + "bbox": [ + 104, + 666, + 434, + 681 + ], + "score": 1.0, + "content": "features from the observed 2D images for 3D scene representation and rendering.", + "type": "text" + } + ], + "index": 64 + } + ], + "index": 61 + }, + { + "type": "text", + "bbox": [ + 107, + 684, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 683, + 506, + 696 + ], + "spans": [ + { + "bbox": [ + 105, + 683, + 506, + 696 + ], + "score": 1.0, + "content": "Compared with Synthetic-NeRF, this dataset is much harder because of the complicated geometries", + "type": "text" + } + ], + "index": 65 + }, + { + "bbox": [ + 105, + 695, + 505, + 709 + ], + "spans": [ + { + "bbox": [ + 105, + 695, + 505, + 709 + ], + "score": 1.0, + "content": "and the inaccuracy of estimated camera poses. Therefore, it is non-trivial to conduct real-world ex-", + "type": "text" + } + ], + "index": 66 + }, + { + "bbox": [ + 105, + 707, + 506, + 721 + ], + "spans": [ + { + "bbox": [ + 105, + 707, + 506, + 721 + ], + "score": 1.0, + "content": "periments for novel-scene generalization or large-scale scene reconstruction on ScanNet (Dai et al.,", + "type": "text" + } + ], + "index": 67 + }, + { + "bbox": [ + 105, + 718, + 483, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 718, + 483, + 733 + ], + "score": 1.0, + "content": "2017) or “Tanks and Temples” (Knapitsch et al., 2017). We leave these for future exploration.", + "type": "text" + } + ], + "index": 68 + } + ], + "index": 66.5 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 300, + 750, + 309, + 761 + ], + "spans": [ + { + "bbox": [ + 300, + 750, + 309, + 761 + ], + "score": 1.0, + "content": "8", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 144 + ], + "lines": [ + { + "bbox": [ + 114, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 114, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "Group 2: The trained model is further finetuned on each of the four novel scenes with 100, 1k,", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 114, + 94, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 114, + 95, + 306, + 107 + ], + "score": 1.0, + "content": "and 10k iterations separately. In total, we obtain", + "type": "text" + }, + { + "bbox": [ + 306, + 94, + 353, + 105 + ], + "score": 0.91, + "content": "4 \\times 3 = 1 2", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 95, + 506, + 107 + ], + "score": 1.0, + "content": "new models. For comparison, we also", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 114, + 105, + 506, + 120 + ], + "spans": [ + { + "bbox": [ + 114, + 105, + 506, + 120 + ], + "score": 1.0, + "content": "train NeRF on each of the four novel scenes with 100, 1k, 10k iterations from scratch. This group", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 114, + 118, + 506, + 133 + ], + "spans": [ + { + "bbox": [ + 114, + 118, + 506, + 133 + ], + "score": 1.0, + "content": "of experiments evaluates how the initially-learned general features of our GRF improve novel", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 114, + 130, + 178, + 145 + ], + "spans": [ + { + "bbox": [ + 114, + 130, + 178, + 145 + ], + "score": 1.0, + "content": "scene learning.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2, + "bbox_fs": [ + 114, + 82, + 506, + 145 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 150, + 288, + 295 + ], + "lines": [ + { + "bbox": [ + 106, + 148, + 288, + 161 + ], + "spans": [ + { + "bbox": [ + 106, + 148, + 288, + 161 + ], + "score": 1.0, + "content": "Analysis. Table 3 compares the quantita-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 161, + 289, + 174 + ], + "spans": [ + { + "bbox": [ + 106, + 161, + 289, + 174 + ], + "score": 1.0, + "content": "tive results. We can see that: 1) In Group", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 107, + 174, + 288, + 185 + ], + "spans": [ + { + "bbox": [ + 107, + 174, + 288, + 185 + ], + "score": 1.0, + "content": "1, our GRF can indeed generalize to novel", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 187, + 288, + 198 + ], + "spans": [ + { + "bbox": [ + 106, + 187, + 288, + 198 + ], + "score": 1.0, + "content": "scenes with complex and completely differ-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 199, + 288, + 210 + ], + "spans": [ + { + "bbox": [ + 107, + 199, + 288, + 210 + ], + "score": 1.0, + "content": "ent overall geometries, demonstrating the ef-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 210, + 289, + 222 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 289, + 222 + ], + "score": 1.0, + "content": "fectiveness of learning point local features", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 222, + 288, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 288, + 234 + ], + "score": 1.0, + "content": "in GRF. As shown in Figure 5, the overall", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 234, + 288, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 288, + 246 + ], + "score": 1.0, + "content": "shape and appearance of Lego can be satis-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 247, + 289, + 259 + ], + "spans": [ + { + "bbox": [ + 106, + 247, + 289, + 259 + ], + "score": 1.0, + "content": "factorily recovered, though it has never been", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 259, + 289, + 271 + ], + "spans": [ + { + "bbox": [ + 106, + 259, + 289, + 271 + ], + "score": 1.0, + "content": "seen before. 2) In Group 2, our GRF can", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 107, + 272, + 288, + 284 + ], + "spans": [ + { + "bbox": [ + 107, + 272, + 288, + 284 + ], + "score": 1.0, + "content": "quickly learn high-quality scene representa-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 283, + 289, + 296 + ], + "spans": [ + { + "bbox": [ + 106, + 283, + 289, + 296 + ], + "score": 1.0, + "content": "tions given a sparse number of training pix-", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 10.5, + "bbox_fs": [ + 106, + 148, + 289, + 296 + ] + }, + { + "type": "table", + "bbox": [ + 297, + 184, + 508, + 293 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 296, + 147, + 505, + 183 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 295, + 145, + 505, + 159 + ], + "spans": [ + { + "bbox": [ + 295, + 145, + 505, + 159 + ], + "score": 1.0, + "content": "Table 3: The average scores of PSNR, SSIM and", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 296, + 159, + 505, + 172 + ], + "spans": [ + { + "bbox": [ + 296, + 159, + 505, + 172 + ], + "score": 1.0, + "content": "LPIPS for GRF and NeRF on four novel scenes of", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 296, + 171, + 423, + 185 + ], + "spans": [ + { + "bbox": [ + 296, + 171, + 423, + 185 + ], + "score": 1.0, + "content": "Synthetic-NeRF in Group 1&2.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + }, + { + "type": "table_body", + "bbox": [ + 297, + 184, + 508, + 293 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 297, + 184, + 508, + 293 + ], + "spans": [ + { + "bbox": [ + 297, + 184, + 508, + 293 + ], + "score": 0.966, + "html": "
PSNR↑ SSIM↑LPIPS↓
GRF (Group 1) 13.62 0.763 0.246
NeRF(Group 2, 100 iters) 15.15 0.752 0.359 NeRF(Group 2,1k iters) 19.81 0.809 0.228 NeRF(Group 2,10k iters) 23.35 0.875 0.137
GRF (Group 2, 100 iters) 19.69 0.835 0.169 GRF (Group 2, 1k iters) 22.00 0.876 0.128 GRF (Group 2,10k iters) 25.10 0.916 0.089
", + "type": "table", + "image_path": "3080c6c65b006f8fbd396908b54525d24ac650e1d6e039623be0413789aa141b.jpg" + } + ] + } + ], + "index": 23.5, + "virtual_lines": [ + { + "bbox": [ + 297, + 184, + 508, + 197.625 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 297, + 197.625, + 508, + 211.25 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 297, + 211.25, + 508, + 224.875 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 297, + 224.875, + 508, + 238.5 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 297, + 238.5, + 508, + 252.125 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 297, + 252.125, + 508, + 265.75 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 297, + 265.75, + 508, + 279.375 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 297, + 279.375, + 508, + 293.0 + ], + "spans": [], + "index": 27 + } + ] + } + ], + "index": 20.75 + }, + { + "type": "text", + "bbox": [ + 107, + 296, + 505, + 344 + ], + "lines": [ + { + "bbox": [ + 105, + 295, + 506, + 308 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 506, + 308 + ], + "score": 1.0, + "content": "els, thanks to the initially learned general features. Compared with the NeRF trained from scratch,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 505, + 321 + ], + "score": 1.0, + "content": "the learned GRF significantly improves novel scene learning, achieving much better results given", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 320, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 505, + 334 + ], + "score": 1.0, + "content": "the same amount of training signals of new scenes. Figure 5 qualitatively shows the generalization", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 331, + 313, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 313, + 345 + ], + "score": 1.0, + "content": "of GRF and more results are presented in appendix.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 29.5, + "bbox_fs": [ + 105, + 295, + 506, + 345 + ] + }, + { + "type": "image", + "bbox": [ + 106, + 347, + 503, + 424 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 106, + 347, + 503, + 424 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 347, + 503, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 503, + 424 + ], + "score": 0.653, + "type": "image", + "image_path": "2b33473f8cad83e6fc6ade9aac3c829b58988eea96b3c91c1071bdc0382ad409.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 106, + 347, + 503, + 372.6666666666667 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 106, + 372.6666666666667, + 503, + 398.33333333333337 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 106, + 398.33333333333337, + 503, + 424.00000000000006 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 164, + 417, + 448, + 428 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 162, + 415, + 450, + 430 + ], + "spans": [ + { + "bbox": [ + 162, + 415, + 450, + 430 + ], + "score": 1.0, + "content": "Figure 5: Qualitative results of our GRF for novel scene generalization.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + } + ], + "index": 34.0 + }, + { + "type": "text", + "bbox": [ + 106, + 434, + 352, + 446 + ], + "lines": [ + { + "bbox": [ + 105, + 433, + 353, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 353, + 447 + ], + "score": 1.0, + "content": "4.3 EXPERIMENTS ON REAL-WORLD COMPLEX SCENES", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 433, + 353, + 447 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 455, + 304, + 522 + ], + "lines": [ + { + "bbox": [ + 106, + 455, + 305, + 467 + ], + "spans": [ + { + "bbox": [ + 106, + 455, + 305, + 467 + ], + "score": 1.0, + "content": "We evaluate the novel view synthesis on complex", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 466, + 304, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 304, + 478 + ], + "score": 1.0, + "content": "real-world scenes captured by cellphones. There", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 477, + 305, + 489 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 305, + 489 + ], + "score": 1.0, + "content": "are 8 scenes, 5 from LLFF (Mildenhall et al.,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 488, + 305, + 500 + ], + "spans": [ + { + "bbox": [ + 106, + 488, + 305, + 500 + ], + "score": 1.0, + "content": "2019) and 3 from NeRF. Each scene has 20 to 62", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 499, + 305, + 511 + ], + "spans": [ + { + "bbox": [ + 106, + 499, + 305, + 511 + ], + "score": 1.0, + "content": "images, 1/8 of which for testing. All images have", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 510, + 259, + 523 + ], + "spans": [ + { + "bbox": [ + 106, + 510, + 180, + 523 + ], + "score": 1.0, + "content": "high resolution of", + "type": "text" + }, + { + "bbox": [ + 181, + 510, + 229, + 521 + ], + "score": 0.89, + "content": "1 0 0 8 \\times 7 5 6", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 510, + 259, + 523 + ], + "score": 1.0, + "content": "pixels.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 39.5, + "bbox_fs": [ + 106, + 455, + 305, + 523 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 527, + 304, + 573 + ], + "lines": [ + { + "bbox": [ + 105, + 525, + 305, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 305, + 540 + ], + "score": 1.0, + "content": "Single-scene Learning. We train a single model", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 538, + 305, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 305, + 552 + ], + "score": 1.0, + "content": "for each real-world scene, following the same ex-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 550, + 306, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 306, + 564 + ], + "score": 1.0, + "content": "perimental settings of NeRF. Table 4 compares", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 562, + 306, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 562, + 306, + 574 + ], + "score": 1.0, + "content": "the quantitative results. Note that, the recent", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 44.5, + "bbox_fs": [ + 105, + 525, + 306, + 574 + ] + }, + { + "type": "table", + "bbox": [ + 312, + 500, + 505, + 567 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 312, + 455, + 505, + 499 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 311, + 453, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 311, + 453, + 505, + 467 + ], + "score": 1.0, + "content": "Table 4: Comparison of the average PSNR,", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 311, + 464, + 505, + 478 + ], + "spans": [ + { + "bbox": [ + 311, + 464, + 505, + 478 + ], + "score": 1.0, + "content": "SSIM and LPIPS scores of our GRF, SRNs,", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 311, + 475, + 505, + 488 + ], + "spans": [ + { + "bbox": [ + 311, + 475, + 505, + 488 + ], + "score": 1.0, + "content": "LLFF and NeRF in the challenging real-world", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 312, + 486, + 446, + 501 + ], + "spans": [ + { + "bbox": [ + 312, + 486, + 446, + 501 + ], + "score": 1.0, + "content": "dataset for single-scene learning.", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 48.5 + }, + { + "type": "table_body", + "bbox": [ + 312, + 500, + 505, + 567 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 312, + 500, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 312, + 500, + 505, + 567 + ], + "score": 0.977, + "html": "
PSNR↑SSIM↑LPIPS↓
SRNs22.840.6680.378
LLFF24.130.7980.212
NeRF26.500.8110.250
GRF(Ours)26.640.8370.178
", + "type": "table", + "image_path": "ce266d353b51e877a8a168b6fc05c2de9bc86a65d823ee30f8ce43337a952611.jpg" + } + ] + } + ], + "index": 53, + "virtual_lines": [ + { + "bbox": [ + 312, + 500, + 505, + 513.4 + ], + "spans": [], + "index": 51 + }, + { + "bbox": [ + 312, + 513.4, + 505, + 526.8 + ], + "spans": [], + "index": 52 + }, + { + "bbox": [ + 312, + 526.8, + 505, + 540.1999999999999 + ], + "spans": [], + "index": 53 + }, + { + "bbox": [ + 312, + 540.1999999999999, + 505, + 553.5999999999999 + ], + "spans": [], + "index": 54 + }, + { + "bbox": [ + 312, + 553.5999999999999, + 505, + 566.9999999999999 + ], + "spans": [], + "index": 55 + } + ] + } + ], + "index": 50.75 + }, + { + "type": "text", + "bbox": [ + 107, + 574, + 504, + 596 + ], + "lines": [ + { + "bbox": [ + 106, + 573, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 106, + 573, + 505, + 586 + ], + "score": 1.0, + "content": "NSVF (Liu et al., 2020) is unable to process these forward-facing scenes because the predefined", + "type": "text" + } + ], + "index": 56 + }, + { + "bbox": [ + 106, + 585, + 306, + 597 + ], + "spans": [ + { + "bbox": [ + 106, + 585, + 306, + 597 + ], + "score": 1.0, + "content": "voxels cannot represent the unbounded 3D space.", + "type": "text" + } + ], + "index": 57 + } + ], + "index": 56.5, + "bbox_fs": [ + 106, + 573, + 505, + 597 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 601, + 505, + 679 + ], + "lines": [ + { + "bbox": [ + 106, + 600, + 506, + 614 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 506, + 614 + ], + "score": 1.0, + "content": "Analysis. Our method surpasses the state of the art by large margins, especially over the SSIM", + "type": "text" + } + ], + "index": 58 + }, + { + "bbox": [ + 104, + 610, + 505, + 626 + ], + "spans": [ + { + "bbox": [ + 104, + 610, + 505, + 626 + ], + "score": 1.0, + "content": "and LPIPS metrics. Compared with PSNR which only measures the average per-pixel accuracy,", + "type": "text" + } + ], + "index": 59 + }, + { + "bbox": [ + 106, + 623, + 505, + 636 + ], + "spans": [ + { + "bbox": [ + 106, + 623, + 505, + 636 + ], + "score": 1.0, + "content": "the metrics SSIM and LPIPS favor high quality of photorealism, highlighting the superiority of our", + "type": "text" + } + ], + "index": 60 + }, + { + "bbox": [ + 106, + 634, + 505, + 647 + ], + "spans": [ + { + "bbox": [ + 106, + 634, + 505, + 647 + ], + "score": 1.0, + "content": "GRF to generate truly realistic images. Figure 6 shows the qualitative results. As highlighted by the", + "type": "text" + } + ], + "index": 61 + }, + { + "bbox": [ + 105, + 644, + 506, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 506, + 658 + ], + "score": 1.0, + "content": "red circles, our GRF can generate fine-grained and natural geometries in pixel level, while NeRF", + "type": "text" + } + ], + "index": 62 + }, + { + "bbox": [ + 105, + 655, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 669 + ], + "score": 1.0, + "content": "produces many artifacts. This clearly demonstrates our GRF indeed learns general and precise pixel", + "type": "text" + } + ], + "index": 63 + }, + { + "bbox": [ + 104, + 666, + 434, + 681 + ], + "spans": [ + { + "bbox": [ + 104, + 666, + 434, + 681 + ], + "score": 1.0, + "content": "features from the observed 2D images for 3D scene representation and rendering.", + "type": "text" + } + ], + "index": 64 + } + ], + "index": 61, + "bbox_fs": [ + 104, + 600, + 506, + 681 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 684, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 683, + 506, + 696 + ], + "spans": [ + { + "bbox": [ + 105, + 683, + 506, + 696 + ], + "score": 1.0, + "content": "Compared with Synthetic-NeRF, this dataset is much harder because of the complicated geometries", + "type": "text" + } + ], + "index": 65 + }, + { + "bbox": [ + 105, + 695, + 505, + 709 + ], + "spans": [ + { + "bbox": [ + 105, + 695, + 505, + 709 + ], + "score": 1.0, + "content": "and the inaccuracy of estimated camera poses. Therefore, it is non-trivial to conduct real-world ex-", + "type": "text" + } + ], + "index": 66 + }, + { + "bbox": [ + 105, + 707, + 506, + 721 + ], + "spans": [ + { + "bbox": [ + 105, + 707, + 506, + 721 + ], + "score": 1.0, + "content": "periments for novel-scene generalization or large-scale scene reconstruction on ScanNet (Dai et al.,", + "type": "text" + } + ], + "index": 67 + }, + { + "bbox": [ + 105, + 718, + 483, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 718, + 483, + 733 + ], + "score": 1.0, + "content": "2017) or “Tanks and Temples” (Knapitsch et al., 2017). We leave these for future exploration.", + "type": "text" + } + ], + "index": 68 + } + ], + "index": 66.5, + "bbox_fs": [ + 105, + 683, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 79, + 502, + 199 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 79, + 502, + 199 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 79, + 502, + 199 + ], + "spans": [ + { + "bbox": [ + 109, + 79, + 502, + 199 + ], + "score": 0.966, + "type": "image", + "image_path": "d2dd827b02e584e3f576cc7940a4fd39cb69b473fd797cdb28c8a8cf51466e19.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 79, + 502, + 119.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 119.0, + 502, + 159.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 159.0, + 502, + 199.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 116, + 200, + 491, + 220 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 158, + 198, + 469, + 210 + ], + "spans": [ + { + "bbox": [ + 158, + 198, + 183, + 210 + ], + "score": 1.0, + "content": "NeRF", + "type": "text" + }, + { + "bbox": [ + 280, + 198, + 328, + 210 + ], + "score": 1.0, + "content": "GRF (Ours)", + "type": "text" + }, + { + "bbox": [ + 418, + 199, + 469, + 209 + ], + "score": 1.0, + "content": "Ground Truth", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 118, + 207, + 492, + 222 + ], + "spans": [ + { + "bbox": [ + 118, + 207, + 492, + 222 + ], + "score": 1.0, + "content": "Figure 6: Qualitative results on Synthetic-NeRF (1st row) and real-world datasets (2nd row).", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "title", + "bbox": [ + 107, + 228, + 209, + 239 + ], + "lines": [ + { + "bbox": [ + 106, + 227, + 210, + 240 + ], + "spans": [ + { + "bbox": [ + 106, + 227, + 210, + 240 + ], + "score": 1.0, + "content": "4.4 ABLATION STUDY", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 248, + 304, + 336 + ], + "lines": [ + { + "bbox": [ + 106, + 247, + 305, + 260 + ], + "spans": [ + { + "bbox": [ + 106, + 247, + 305, + 260 + ], + "score": 1.0, + "content": "To evaluate the effectiveness of the key com-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 104, + 259, + 306, + 272 + ], + "spans": [ + { + "bbox": [ + 104, + 259, + 306, + 272 + ], + "score": 1.0, + "content": "ponents of our GRF, we conduct 3 groups of", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 269, + 306, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 269, + 306, + 282 + ], + "score": 1.0, + "content": "ablation experiments on the car category in", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 281, + 306, + 293 + ], + "spans": [ + { + "bbox": [ + 106, + 281, + 306, + 293 + ], + "score": 1.0, + "content": "ShapeNetv2 dataset. In particular, we train on the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 292, + 305, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 292, + 305, + 304 + ], + "score": 1.0, + "content": "entire training split then randomly select 500 ob-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 302, + 306, + 316 + ], + "spans": [ + { + "bbox": [ + 104, + 302, + 306, + 316 + ], + "score": 1.0, + "content": "jects from the training split for testing. During", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 314, + 305, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 314, + 305, + 325 + ], + "score": 1.0, + "content": "testing, the model infers 50 novel views for each", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 325, + 305, + 337 + ], + "spans": [ + { + "bbox": [ + 106, + 325, + 305, + 337 + ], + "score": 1.0, + "content": "of these 500 objects for evaluation. Basically, this", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 9.5 + }, + { + "type": "table", + "bbox": [ + 313, + 271, + 504, + 333 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 312, + 248, + 504, + 270 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 312, + 247, + 505, + 259 + ], + "spans": [ + { + "bbox": [ + 312, + 247, + 505, + 259 + ], + "score": 1.0, + "content": "Table 5: The average scores of PSNR and SSIM", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 311, + 257, + 496, + 272 + ], + "spans": [ + { + "bbox": [ + 311, + 257, + 496, + 272 + ], + "score": 1.0, + "content": "for ablated GRF in the subset of car category.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "table_body", + "bbox": [ + 313, + 271, + 504, + 333 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 313, + 271, + 504, + 333 + ], + "spans": [ + { + "bbox": [ + 313, + 271, + 504, + 333 + ], + "score": 0.978, + "html": "
PSNR↑SSIM↑
(1)Remove Input Viewpoints20.130.807
(2) Remove Pixel Local Features20.230.818
(3) Replace Attention by Maxpool24.880.914
(4) The Full Model27.160.942
", + "type": "table", + "image_path": "d65a0d05a7af6ab59e853844ea4a4e8a65732bc36324d880ac1e76483adc362e.jpg" + } + ] + } + ], + "index": 17.5, + "virtual_lines": [ + { + "bbox": [ + 313, + 271, + 504, + 286.5 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 313, + 286.5, + 504, + 302.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 313, + 302.0, + 504, + 317.5 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 313, + 317.5, + 504, + 333.0 + ], + "spans": [], + "index": 19 + } + ] + } + ], + "index": 16.0 + }, + { + "type": "text", + "bbox": [ + 106, + 336, + 352, + 347 + ], + "lines": [ + { + "bbox": [ + 106, + 335, + 353, + 349 + ], + "spans": [ + { + "bbox": [ + 106, + 335, + 353, + 349 + ], + "score": 1.0, + "content": "setting is similar to the experiment of Group 1 in Section 4.1.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 105, + 352, + 505, + 474 + ], + "lines": [ + { + "bbox": [ + 105, + 351, + 506, + 365 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 506, + 365 + ], + "score": 1.0, + "content": "• Group 1: The viewpoints of the input images are removed from the CNN module. The CNN", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 113, + 363, + 414, + 376 + ], + "spans": [ + { + "bbox": [ + 113, + 363, + 414, + 376 + ], + "score": 1.0, + "content": "module is not explicitly aware of the relative position of the pixel features.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 376, + 506, + 390 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 506, + 390 + ], + "score": 1.0, + "content": "• Group 2: The decoder of the CNN module is removed and each input image is encoded as a global", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 113, + 388, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 113, + 388, + 506, + 401 + ], + "score": 1.0, + "content": "feature vector. For any 3D query point which is rightly projected into the image boundary, that", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 113, + 398, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 113, + 398, + 505, + 412 + ], + "score": 1.0, + "content": "global feature vector is retrieved and reprojected to the query point. Fundamentally, this modified", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 114, + 411, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 114, + 411, + 505, + 425 + ], + "score": 1.0, + "content": "CNN module can be regarded as a hyper-network that learns a conditional embedding from input", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 424, + 445, + 437 + ], + "spans": [ + { + "bbox": [ + 115, + 424, + 445, + 437 + ], + "score": 1.0, + "content": "images and then feed it into NeRF, but it sacrifices the precise pixel local features.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 108, + 436, + 505, + 451 + ], + "spans": [ + { + "bbox": [ + 108, + 436, + 505, + 451 + ], + "score": 1.0, + "content": "• Group 3: The advanced attention module is replaced by max-pooling to aggregate the pixel fea-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 113, + 448, + 502, + 461 + ], + "spans": [ + { + "bbox": [ + 113, + 448, + 502, + 461 + ], + "score": 1.0, + "content": "tures, aiming to investigate how the visual occlusion can be better addressed using soft attention.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 461, + 454, + 476 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 454, + 476 + ], + "score": 1.0, + "content": "• Group 4: The full model is trained and tested with the same settings for comparison.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 106, + 479, + 505, + 547 + ], + "lines": [ + { + "bbox": [ + 106, + 479, + 506, + 492 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 506, + 492 + ], + "score": 1.0, + "content": "Analysis. Table 5 compares the performance of all ablated models. We can see that: 1) The greatest", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 490, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 490, + 505, + 502 + ], + "score": 1.0, + "content": "impact is caused by the removal of image viewpoints from the CNN module and the lack of local", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 501, + 505, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 505, + 514 + ], + "score": 1.0, + "content": "pixel features to represent 3D points. It highlights that obtaining the position-aware and precise pixel", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 511, + 506, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 506, + 526 + ], + "score": 1.0, + "content": "features is crucial to represent 3D scenes from 2D images, while learning a simple hyper-network", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 524, + 506, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 506, + 538 + ], + "score": 1.0, + "content": "for NeRF cannot achieve comparable performance. 2) Using max-pooling to select the reprojected", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 536, + 473, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 473, + 549 + ], + "score": 1.0, + "content": "pixel features is sub-optimal to address the visual occlusions from different viewing angles.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 107, + 552, + 505, + 613 + ], + "lines": [ + { + "bbox": [ + 105, + 552, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 505, + 565 + ], + "score": 1.0, + "content": "To further investigate the attention module, the maximal attention scores are retrieved and visualized", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 565, + 505, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 565, + 505, + 577 + ], + "score": 1.0, + "content": "(detailed in appendix). It shows that the attention module can truly drive the network to focus on", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 576, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 505, + 590 + ], + "score": 1.0, + "content": "the visible pixel local features among the multiple intersected light rays. We also conduct additional", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 589, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 589, + 505, + 601 + ], + "score": 1.0, + "content": "ablation experiments (detailed in appendix), demonstrating that our GRF can indeed generalize well", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 600, + 494, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 494, + 615 + ], + "score": 1.0, + "content": "to novel scenes with severe visual occlusions and is robust to a variable number of input images.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 39 + }, + { + "type": "title", + "bbox": [ + 108, + 629, + 195, + 642 + ], + "lines": [ + { + "bbox": [ + 104, + 627, + 198, + 645 + ], + "spans": [ + { + "bbox": [ + 104, + 627, + 198, + 645 + ], + "score": 1.0, + "content": "5 CONCLUSION", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 42 + }, + { + "type": "text", + "bbox": [ + 106, + 654, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 106, + 654, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 505, + 667 + ], + "score": 1.0, + "content": "The proposed method models complex 3D scenes as a general radiance field. We demonstrated", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "that it can learn general and robust 3D point features from a set of 2D observations. By using the", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 104, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 104, + 676, + 505, + 690 + ], + "score": 1.0, + "content": "principle of multi-view geometry to precisely map 2D pixel features back to 3D space and leveraging", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 686, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 505, + 700 + ], + "score": 1.0, + "content": "the attention mechanism to implicitly address the visual occlusions, our GRF can synthesize truly", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "realistic 2D novel views. However, there are still limitations that lead to the future work. (1) More", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "advanced CNN modules can be designed to learn better pixel features. (2) Depth scans can be", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 720, + 372, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 372, + 732 + ], + "score": 1.0, + "content": "integrated into the network to explicitly address visual occlusions.", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 46 + } + ], + "page_idx": 8, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 306, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "9", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 79, + 502, + 199 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 79, + 502, + 199 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 79, + 502, + 199 + ], + "spans": [ + { + "bbox": [ + 109, + 79, + 502, + 199 + ], + "score": 0.966, + "type": "image", + "image_path": "d2dd827b02e584e3f576cc7940a4fd39cb69b473fd797cdb28c8a8cf51466e19.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 79, + 502, + 119.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 119.0, + 502, + 159.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 159.0, + 502, + 199.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 116, + 200, + 491, + 220 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 158, + 198, + 469, + 210 + ], + "spans": [ + { + "bbox": [ + 158, + 198, + 183, + 210 + ], + "score": 1.0, + "content": "NeRF", + "type": "text" + }, + { + "bbox": [ + 280, + 198, + 328, + 210 + ], + "score": 1.0, + "content": "GRF (Ours)", + "type": "text" + }, + { + "bbox": [ + 418, + 199, + 469, + 209 + ], + "score": 1.0, + "content": "Ground Truth", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 118, + 207, + 492, + 222 + ], + "spans": [ + { + "bbox": [ + 118, + 207, + 492, + 222 + ], + "score": 1.0, + "content": "Figure 6: Qualitative results on Synthetic-NeRF (1st row) and real-world datasets (2nd row).", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "title", + "bbox": [ + 107, + 228, + 209, + 239 + ], + "lines": [ + { + "bbox": [ + 106, + 227, + 210, + 240 + ], + "spans": [ + { + "bbox": [ + 106, + 227, + 210, + 240 + ], + "score": 1.0, + "content": "4.4 ABLATION STUDY", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 248, + 304, + 336 + ], + "lines": [ + { + "bbox": [ + 106, + 247, + 305, + 260 + ], + "spans": [ + { + "bbox": [ + 106, + 247, + 305, + 260 + ], + "score": 1.0, + "content": "To evaluate the effectiveness of the key com-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 104, + 259, + 306, + 272 + ], + "spans": [ + { + "bbox": [ + 104, + 259, + 306, + 272 + ], + "score": 1.0, + "content": "ponents of our GRF, we conduct 3 groups of", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 269, + 306, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 269, + 306, + 282 + ], + "score": 1.0, + "content": "ablation experiments on the car category in", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 281, + 306, + 293 + ], + "spans": [ + { + "bbox": [ + 106, + 281, + 306, + 293 + ], + "score": 1.0, + "content": "ShapeNetv2 dataset. In particular, we train on the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 292, + 305, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 292, + 305, + 304 + ], + "score": 1.0, + "content": "entire training split then randomly select 500 ob-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 302, + 306, + 316 + ], + "spans": [ + { + "bbox": [ + 104, + 302, + 306, + 316 + ], + "score": 1.0, + "content": "jects from the training split for testing. During", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 314, + 305, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 314, + 305, + 325 + ], + "score": 1.0, + "content": "testing, the model infers 50 novel views for each", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 325, + 305, + 337 + ], + "spans": [ + { + "bbox": [ + 106, + 325, + 305, + 337 + ], + "score": 1.0, + "content": "of these 500 objects for evaluation. Basically, this", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 335, + 353, + 349 + ], + "spans": [ + { + "bbox": [ + 106, + 335, + 353, + 349 + ], + "score": 1.0, + "content": "setting is similar to the experiment of Group 1 in Section 4.1.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 9.5, + "bbox_fs": [ + 104, + 247, + 306, + 337 + ] + }, + { + "type": "table", + "bbox": [ + 313, + 271, + 504, + 333 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 312, + 248, + 504, + 270 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 312, + 247, + 505, + 259 + ], + "spans": [ + { + "bbox": [ + 312, + 247, + 505, + 259 + ], + "score": 1.0, + "content": "Table 5: The average scores of PSNR and SSIM", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 311, + 257, + 496, + 272 + ], + "spans": [ + { + "bbox": [ + 311, + 257, + 496, + 272 + ], + "score": 1.0, + "content": "for ablated GRF in the subset of car category.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "table_body", + "bbox": [ + 313, + 271, + 504, + 333 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 313, + 271, + 504, + 333 + ], + "spans": [ + { + "bbox": [ + 313, + 271, + 504, + 333 + ], + "score": 0.978, + "html": "
PSNR↑SSIM↑
(1)Remove Input Viewpoints20.130.807
(2) Remove Pixel Local Features20.230.818
(3) Replace Attention by Maxpool24.880.914
(4) The Full Model27.160.942
", + "type": "table", + "image_path": "d65a0d05a7af6ab59e853844ea4a4e8a65732bc36324d880ac1e76483adc362e.jpg" + } + ] + } + ], + "index": 17.5, + "virtual_lines": [ + { + "bbox": [ + 313, + 271, + 504, + 286.5 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 313, + 286.5, + 504, + 302.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 313, + 302.0, + 504, + 317.5 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 313, + 317.5, + 504, + 333.0 + ], + "spans": [], + "index": 19 + } + ] + } + ], + "index": 16.0 + }, + { + "type": "text", + "bbox": [ + 106, + 336, + 352, + 347 + ], + "lines": [], + "index": 20, + "bbox_fs": [ + 106, + 335, + 353, + 349 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 105, + 352, + 505, + 474 + ], + "lines": [ + { + "bbox": [ + 105, + 351, + 506, + 365 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 506, + 365 + ], + "score": 1.0, + "content": "• Group 1: The viewpoints of the input images are removed from the CNN module. The CNN", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 113, + 363, + 414, + 376 + ], + "spans": [ + { + "bbox": [ + 113, + 363, + 414, + 376 + ], + "score": 1.0, + "content": "module is not explicitly aware of the relative position of the pixel features.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 376, + 506, + 390 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 506, + 390 + ], + "score": 1.0, + "content": "• Group 2: The decoder of the CNN module is removed and each input image is encoded as a global", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 113, + 388, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 113, + 388, + 506, + 401 + ], + "score": 1.0, + "content": "feature vector. For any 3D query point which is rightly projected into the image boundary, that", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 113, + 398, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 113, + 398, + 505, + 412 + ], + "score": 1.0, + "content": "global feature vector is retrieved and reprojected to the query point. Fundamentally, this modified", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 114, + 411, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 114, + 411, + 505, + 425 + ], + "score": 1.0, + "content": "CNN module can be regarded as a hyper-network that learns a conditional embedding from input", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 424, + 445, + 437 + ], + "spans": [ + { + "bbox": [ + 115, + 424, + 445, + 437 + ], + "score": 1.0, + "content": "images and then feed it into NeRF, but it sacrifices the precise pixel local features.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 108, + 436, + 505, + 451 + ], + "spans": [ + { + "bbox": [ + 108, + 436, + 505, + 451 + ], + "score": 1.0, + "content": "• Group 3: The advanced attention module is replaced by max-pooling to aggregate the pixel fea-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 113, + 448, + 502, + 461 + ], + "spans": [ + { + "bbox": [ + 113, + 448, + 502, + 461 + ], + "score": 1.0, + "content": "tures, aiming to investigate how the visual occlusion can be better addressed using soft attention.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 461, + 454, + 476 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 454, + 476 + ], + "score": 1.0, + "content": "• Group 4: The full model is trained and tested with the same settings for comparison.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 351, + 506, + 476 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 479, + 505, + 547 + ], + "lines": [ + { + "bbox": [ + 106, + 479, + 506, + 492 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 506, + 492 + ], + "score": 1.0, + "content": "Analysis. Table 5 compares the performance of all ablated models. We can see that: 1) The greatest", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 490, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 490, + 505, + 502 + ], + "score": 1.0, + "content": "impact is caused by the removal of image viewpoints from the CNN module and the lack of local", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 501, + 505, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 505, + 514 + ], + "score": 1.0, + "content": "pixel features to represent 3D points. It highlights that obtaining the position-aware and precise pixel", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 511, + 506, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 506, + 526 + ], + "score": 1.0, + "content": "features is crucial to represent 3D scenes from 2D images, while learning a simple hyper-network", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 524, + 506, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 506, + 538 + ], + "score": 1.0, + "content": "for NeRF cannot achieve comparable performance. 2) Using max-pooling to select the reprojected", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 536, + 473, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 473, + 549 + ], + "score": 1.0, + "content": "pixel features is sub-optimal to address the visual occlusions from different viewing angles.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 479, + 506, + 549 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 552, + 505, + 613 + ], + "lines": [ + { + "bbox": [ + 105, + 552, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 505, + 565 + ], + "score": 1.0, + "content": "To further investigate the attention module, the maximal attention scores are retrieved and visualized", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 565, + 505, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 565, + 505, + 577 + ], + "score": 1.0, + "content": "(detailed in appendix). It shows that the attention module can truly drive the network to focus on", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 576, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 505, + 590 + ], + "score": 1.0, + "content": "the visible pixel local features among the multiple intersected light rays. We also conduct additional", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 589, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 589, + 505, + 601 + ], + "score": 1.0, + "content": "ablation experiments (detailed in appendix), demonstrating that our GRF can indeed generalize well", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 600, + 494, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 494, + 615 + ], + "score": 1.0, + "content": "to novel scenes with severe visual occlusions and is robust to a variable number of input images.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 39, + "bbox_fs": [ + 105, + 552, + 505, + 615 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 629, + 195, + 642 + ], + "lines": [ + { + "bbox": [ + 104, + 627, + 198, + 645 + ], + "spans": [ + { + "bbox": [ + 104, + 627, + 198, + 645 + ], + "score": 1.0, + "content": "5 CONCLUSION", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 42 + }, + { + "type": "text", + "bbox": [ + 106, + 654, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 106, + 654, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 505, + 667 + ], + "score": 1.0, + "content": "The proposed method models complex 3D scenes as a general radiance field. We demonstrated", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "that it can learn general and robust 3D point features from a set of 2D observations. By using the", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 104, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 104, + 676, + 505, + 690 + ], + "score": 1.0, + "content": "principle of multi-view geometry to precisely map 2D pixel features back to 3D space and leveraging", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 686, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 505, + 700 + ], + "score": 1.0, + "content": "the attention mechanism to implicitly address the visual occlusions, our GRF can synthesize truly", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "realistic 2D novel views. However, there are still limitations that lead to the future work. (1) More", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "advanced CNN modules can be designed to learn better pixel features. (2) Depth scans can be", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 720, + 372, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 372, + 732 + ], + "score": 1.0, + "content": "integrated into the network to explicitly address visual occlusions.", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 46, + "bbox_fs": [ + 104, + 654, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 176, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 176, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 176, + 94 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 100, + 504, + 122 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 505, + 112 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 505, + 112 + ], + "score": 1.0, + "content": "Matan Atzmon and Yaron Lipman. SAL: Sign Agnostic Learning of Shapes from Raw Data. IEEE", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 110, + 379, + 123 + ], + "spans": [ + { + "bbox": [ + 116, + 110, + 379, + 123 + ], + "score": 1.0, + "content": "Conference on Computer Vision and Pattern Recognition, 2020a.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5 + }, + { + "type": "text", + "bbox": [ + 105, + 128, + 503, + 141 + ], + "lines": [ + { + "bbox": [ + 105, + 128, + 505, + 142 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 505, + 142 + ], + "score": 1.0, + "content": "Matan Atzmon and Yaron Lipman. SALD: Sign Agnostic Learning with Derivatives. arXiv, 2020b.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 108, + 147, + 504, + 181 + ], + "lines": [ + { + "bbox": [ + 106, + 147, + 505, + 160 + ], + "spans": [ + { + "bbox": [ + 106, + 147, + 505, + 160 + ], + "score": 1.0, + "content": "Cesar Cadena, Luca Carlone, Henry Carrillo, Yasir Latif, Davide Scaramuzza, Jose Neira, Ian D.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 158, + 505, + 172 + ], + "spans": [ + { + "bbox": [ + 115, + 158, + 505, + 172 + ], + "score": 1.0, + "content": "Reid, and John J. Leonard. Past, Present, and Future of Simultaneous Localization and Mapping:", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 168, + 496, + 183 + ], + "spans": [ + { + "bbox": [ + 115, + 168, + 496, + 183 + ], + "score": 1.0, + "content": "Towards the Robust-Perception Age. IEEE Transactions on Robotics, 32(6):1309–1332, 2016.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 108, + 187, + 504, + 222 + ], + "lines": [ + { + "bbox": [ + 106, + 187, + 506, + 201 + ], + "spans": [ + { + "bbox": [ + 106, + 187, + 506, + 201 + ], + "score": 1.0, + "content": "Wenzheng Chen, Jun Gao, Huan Ling, Edward J. Smith, Jaakko Lehtinen, Alec Jacobson, and", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 199, + 505, + 211 + ], + "spans": [ + { + "bbox": [ + 116, + 199, + 505, + 211 + ], + "score": 1.0, + "content": "Sanja Fidler. Learning to Predict 3D Objects with an Interpolation-based Differentiable Renderer.", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 114, + 209, + 420, + 223 + ], + "spans": [ + { + "bbox": [ + 114, + 209, + 420, + 223 + ], + "score": 1.0, + "content": "Advances in Neural Information Processing Systems, pp. 9609–9619, 2019.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 228, + 505, + 262 + ], + "lines": [ + { + "bbox": [ + 106, + 228, + 505, + 241 + ], + "spans": [ + { + "bbox": [ + 106, + 228, + 505, + 241 + ], + "score": 1.0, + "content": "Christopher B. Choy, Danfei Xu, JunYoung Gwak, Kevin Chen, and Silvio Savarese. 3D-R2N2: A", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 239, + 505, + 253 + ], + "spans": [ + { + "bbox": [ + 116, + 239, + 505, + 253 + ], + "score": 1.0, + "content": "Unified Approach for Single and Multi-view 3D Object Reconstruction. European Conference", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 250, + 280, + 263 + ], + "spans": [ + { + "bbox": [ + 116, + 250, + 280, + 263 + ], + "score": 1.0, + "content": "on Computer Vision, pp. 628–644, 2016.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 105, + 268, + 505, + 292 + ], + "lines": [ + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "score": 1.0, + "content": "H Christian, Shubham Tulsiani, and Jitendra Malik. Hierarchical Surface Prediction for 3D Object", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 279, + 423, + 291 + ], + "spans": [ + { + "bbox": [ + 116, + 279, + 423, + 291 + ], + "score": 1.0, + "content": "Reconstruction. International Conference on 3D Vision, pp. 412–420, 2017.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 107, + 298, + 504, + 333 + ], + "lines": [ + { + "bbox": [ + 106, + 298, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 298, + 505, + 311 + ], + "score": 1.0, + "content": "Angela Dai, Angel X. Chang, Manolis Savva, Maciej Halber, Thomas Funkhouser, and Matthias", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 309, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 116, + 309, + 505, + 322 + ], + "score": 1.0, + "content": "Nießner. ScanNet: Richly-annotated 3D Reconstructions of Indoor Scenes. IEEE Conference on", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 117, + 320, + 378, + 334 + ], + "spans": [ + { + "bbox": [ + 117, + 320, + 378, + 334 + ], + "score": 1.0, + "content": "Computer Vision and Pattern Recognition, pp. 5828–5839, 2017.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 338, + 504, + 394 + ], + "lines": [ + { + "bbox": [ + 106, + 339, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 106, + 339, + 505, + 351 + ], + "score": 1.0, + "content": "S.M. Ali Eslami, Danilo Jimenez Rezende, Frederic Besse, Fabio Viola, Ari S. Morcos, Marta", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 349, + 505, + 363 + ], + "spans": [ + { + "bbox": [ + 115, + 349, + 505, + 363 + ], + "score": 1.0, + "content": "Garnelo, Avraham Ruderman, Andrei A. Rusu, Ivo Danihelka, Karol Gregor, David P. Reichert,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 358, + 506, + 375 + ], + "spans": [ + { + "bbox": [ + 115, + 358, + 506, + 375 + ], + "score": 1.0, + "content": "Lars Buesing, Theophane Weber, Oriol Vinyals, Dan Rosenbaum, Neil Rabinowitz, Helen King,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 372, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 116, + 372, + 505, + 384 + ], + "score": 1.0, + "content": "Chloe Hillier, Matt Botvinick, Daan Wierstra, Koray Kavukcuoglu, and Demis Hassabis. Neural", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 382, + 424, + 396 + ], + "spans": [ + { + "bbox": [ + 115, + 382, + 424, + 396 + ], + "score": 1.0, + "content": "Scene Representation and Rendering. Science, 360(6394):1204–1210, 2018.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 400, + 503, + 434 + ], + "lines": [ + { + "bbox": [ + 105, + 400, + 504, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 400, + 504, + 414 + ], + "score": 1.0, + "content": "Haoqiang Fan, Hao Su, and Leonidas Guibas. A Point Set Generation Network for 3D Object Re-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 412, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 115, + 412, + 505, + 425 + ], + "score": 1.0, + "content": "construction from a Single Image. IEEE Conference on Computer Vision and Pattern Recognition,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 424, + 196, + 434 + ], + "spans": [ + { + "bbox": [ + 115, + 424, + 196, + 434 + ], + "score": 1.0, + "content": "pp. 605–613, 2017.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 106, + 441, + 503, + 464 + ], + "lines": [ + { + "bbox": [ + 106, + 442, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 505, + 453 + ], + "score": 1.0, + "content": "A Tewari O Fried, J Thies V Sitzmann, S Lombardi K Sunkavalli, and R Martin-brualla T Simon J", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 451, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 116, + 451, + 505, + 465 + ], + "score": 1.0, + "content": "Saragih. State of the Art on Neural Rendering. Computer Graphics Forum, 39(2):701–727, 2020.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 104, + 470, + 504, + 493 + ], + "lines": [ + { + "bbox": [ + 106, + 469, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 505, + 484 + ], + "score": 1.0, + "content": "Georgia Gkioxari, Jitendra Malik, and Justin Johnson. Mesh R-CNN. IEEE International Confer-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 482, + 311, + 494 + ], + "spans": [ + { + "bbox": [ + 115, + 482, + 311, + 494 + ], + "score": 1.0, + "content": "ence on Computer Vision, pp. 9785–9795, 2019.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 107, + 499, + 504, + 534 + ], + "lines": [ + { + "bbox": [ + 105, + 499, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 506, + 513 + ], + "score": 1.0, + "content": "Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair,", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 117, + 511, + 504, + 524 + ], + "spans": [ + { + "bbox": [ + 117, + 511, + 504, + 524 + ], + "score": 1.0, + "content": "Aaron Courville, and Yoshua Bengio. Generative Adversarial Nets. Advances in Neural Informa-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 117, + 522, + 307, + 534 + ], + "spans": [ + { + "bbox": [ + 117, + 522, + 307, + 534 + ], + "score": 1.0, + "content": "tion Processing Systems, pp. 2672–2680, 2014.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 540, + 505, + 574 + ], + "lines": [ + { + "bbox": [ + 105, + 539, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 554 + ], + "score": 1.0, + "content": "Thibault Groueix, Matthew Fisher, Vladimir G Kim, Bryan C Russell, and Mathieu Aubry. A Papier-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 551, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 116, + 551, + 505, + 563 + ], + "score": 1.0, + "content": "Mache Approach to Learning 3D Surface Generation. IEEE Conference on Computer Vision and", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 563, + 280, + 575 + ], + "spans": [ + { + "bbox": [ + 116, + 563, + 280, + 575 + ], + "score": 1.0, + "content": "Pattern Recognition, pp. 216–224, 2018.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 581, + 503, + 604 + ], + "lines": [ + { + "bbox": [ + 104, + 579, + 505, + 594 + ], + "spans": [ + { + "bbox": [ + 104, + 579, + 505, + 594 + ], + "score": 1.0, + "content": "Richard Hartley and Andrew Zisserman. Multiple View Geometry in Computer Vision. Cambridge", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 592, + 212, + 605 + ], + "spans": [ + { + "bbox": [ + 116, + 592, + 212, + 605 + ], + "score": 1.0, + "content": "University Press, 2004.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5 + }, + { + "type": "text", + "bbox": [ + 106, + 610, + 505, + 644 + ], + "lines": [ + { + "bbox": [ + 106, + 610, + 504, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 504, + 622 + ], + "score": 1.0, + "content": "Eldar Insafutdinov and Alexey Dosovitskiy. Unsupervised Learning of Shape and Pose with Dif-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 621, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 115, + 621, + 505, + 633 + ], + "score": 1.0, + "content": "ferentiable Point Clouds. Advances in Neural Information Processing Systems, pp. 2802–2812,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 631, + 142, + 644 + ], + "spans": [ + { + "bbox": [ + 115, + 631, + 142, + 644 + ], + "score": 1.0, + "content": "2018.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 106, + 650, + 504, + 673 + ], + "lines": [ + { + "bbox": [ + 105, + 651, + 505, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 505, + 664 + ], + "score": 1.0, + "content": "James T. Kajiya and Brian P Von Herzen. Ray tracing volume densities. ACM SIGGRAPH Computer", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 661, + 210, + 674 + ], + "spans": [ + { + "bbox": [ + 115, + 661, + 210, + 674 + ], + "score": 1.0, + "content": "Graphics, 18(3), 1984.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5 + }, + { + "type": "text", + "bbox": [ + 107, + 679, + 504, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 680, + 504, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 680, + 504, + 693 + ], + "score": 1.0, + "content": "Hiroharu Kato, Yoshitaka Ushiku, and Tatsuya Harada. Neural 3D Mesh Renderer. IEEE Confer-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 691, + 411, + 703 + ], + "spans": [ + { + "bbox": [ + 116, + 691, + 411, + 703 + ], + "score": 1.0, + "content": "ence on Computer Vision and Pattern Recognition, pp. 3907–3916, 2018.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43.5 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Hiroharu Kato, Deniz Beker, Mihai Morariu, Takahiro Ando, Toru Matsuoka, Wadim Kehl, and", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 116, + 720, + 434, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 434, + 733 + ], + "score": 1.0, + "content": "Adrien Gaidon. Differentiable Rendering: A Survey. arXiv:2006.12057, 2020.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45.5 + } + ], + "page_idx": 9, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "10", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 176, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 176, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 176, + 94 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 100, + 504, + 122 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 505, + 112 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 505, + 112 + ], + "score": 1.0, + "content": "Matan Atzmon and Yaron Lipman. SAL: Sign Agnostic Learning of Shapes from Raw Data. IEEE", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 110, + 379, + 123 + ], + "spans": [ + { + "bbox": [ + 116, + 110, + 379, + 123 + ], + "score": 1.0, + "content": "Conference on Computer Vision and Pattern Recognition, 2020a.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5, + "bbox_fs": [ + 105, + 99, + 505, + 123 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 128, + 503, + 141 + ], + "lines": [ + { + "bbox": [ + 105, + 128, + 505, + 142 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 505, + 142 + ], + "score": 1.0, + "content": "Matan Atzmon and Yaron Lipman. SALD: Sign Agnostic Learning with Derivatives. arXiv, 2020b.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 128, + 505, + 142 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 147, + 504, + 181 + ], + "lines": [ + { + "bbox": [ + 106, + 147, + 505, + 160 + ], + "spans": [ + { + "bbox": [ + 106, + 147, + 505, + 160 + ], + "score": 1.0, + "content": "Cesar Cadena, Luca Carlone, Henry Carrillo, Yasir Latif, Davide Scaramuzza, Jose Neira, Ian D.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 158, + 505, + 172 + ], + "spans": [ + { + "bbox": [ + 115, + 158, + 505, + 172 + ], + "score": 1.0, + "content": "Reid, and John J. Leonard. Past, Present, and Future of Simultaneous Localization and Mapping:", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 168, + 496, + 183 + ], + "spans": [ + { + "bbox": [ + 115, + 168, + 496, + 183 + ], + "score": 1.0, + "content": "Towards the Robust-Perception Age. IEEE Transactions on Robotics, 32(6):1309–1332, 2016.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5, + "bbox_fs": [ + 106, + 147, + 505, + 183 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 187, + 504, + 222 + ], + "lines": [ + { + "bbox": [ + 106, + 187, + 506, + 201 + ], + "spans": [ + { + "bbox": [ + 106, + 187, + 506, + 201 + ], + "score": 1.0, + "content": "Wenzheng Chen, Jun Gao, Huan Ling, Edward J. Smith, Jaakko Lehtinen, Alec Jacobson, and", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 199, + 505, + 211 + ], + "spans": [ + { + "bbox": [ + 116, + 199, + 505, + 211 + ], + "score": 1.0, + "content": "Sanja Fidler. Learning to Predict 3D Objects with an Interpolation-based Differentiable Renderer.", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 114, + 209, + 420, + 223 + ], + "spans": [ + { + "bbox": [ + 114, + 209, + 420, + 223 + ], + "score": 1.0, + "content": "Advances in Neural Information Processing Systems, pp. 9609–9619, 2019.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8, + "bbox_fs": [ + 106, + 187, + 506, + 223 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 228, + 505, + 262 + ], + "lines": [ + { + "bbox": [ + 106, + 228, + 505, + 241 + ], + "spans": [ + { + "bbox": [ + 106, + 228, + 505, + 241 + ], + "score": 1.0, + "content": "Christopher B. Choy, Danfei Xu, JunYoung Gwak, Kevin Chen, and Silvio Savarese. 3D-R2N2: A", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 239, + 505, + 253 + ], + "spans": [ + { + "bbox": [ + 116, + 239, + 505, + 253 + ], + "score": 1.0, + "content": "Unified Approach for Single and Multi-view 3D Object Reconstruction. European Conference", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 250, + 280, + 263 + ], + "spans": [ + { + "bbox": [ + 116, + 250, + 280, + 263 + ], + "score": 1.0, + "content": "on Computer Vision, pp. 628–644, 2016.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11, + "bbox_fs": [ + 106, + 228, + 505, + 263 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 268, + 505, + 292 + ], + "lines": [ + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "score": 1.0, + "content": "H Christian, Shubham Tulsiani, and Jitendra Malik. Hierarchical Surface Prediction for 3D Object", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 279, + 423, + 291 + ], + "spans": [ + { + "bbox": [ + 116, + 279, + 423, + 291 + ], + "score": 1.0, + "content": "Reconstruction. International Conference on 3D Vision, pp. 412–420, 2017.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 268, + 505, + 291 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 298, + 504, + 333 + ], + "lines": [ + { + "bbox": [ + 106, + 298, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 298, + 505, + 311 + ], + "score": 1.0, + "content": "Angela Dai, Angel X. Chang, Manolis Savva, Maciej Halber, Thomas Funkhouser, and Matthias", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 309, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 116, + 309, + 505, + 322 + ], + "score": 1.0, + "content": "Nießner. ScanNet: Richly-annotated 3D Reconstructions of Indoor Scenes. IEEE Conference on", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 117, + 320, + 378, + 334 + ], + "spans": [ + { + "bbox": [ + 117, + 320, + 378, + 334 + ], + "score": 1.0, + "content": "Computer Vision and Pattern Recognition, pp. 5828–5839, 2017.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 106, + 298, + 505, + 334 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 338, + 504, + 394 + ], + "lines": [ + { + "bbox": [ + 106, + 339, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 106, + 339, + 505, + 351 + ], + "score": 1.0, + "content": "S.M. Ali Eslami, Danilo Jimenez Rezende, Frederic Besse, Fabio Viola, Ari S. Morcos, Marta", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 349, + 505, + 363 + ], + "spans": [ + { + "bbox": [ + 115, + 349, + 505, + 363 + ], + "score": 1.0, + "content": "Garnelo, Avraham Ruderman, Andrei A. Rusu, Ivo Danihelka, Karol Gregor, David P. Reichert,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 358, + 506, + 375 + ], + "spans": [ + { + "bbox": [ + 115, + 358, + 506, + 375 + ], + "score": 1.0, + "content": "Lars Buesing, Theophane Weber, Oriol Vinyals, Dan Rosenbaum, Neil Rabinowitz, Helen King,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 372, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 116, + 372, + 505, + 384 + ], + "score": 1.0, + "content": "Chloe Hillier, Matt Botvinick, Daan Wierstra, Koray Kavukcuoglu, and Demis Hassabis. Neural", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 382, + 424, + 396 + ], + "spans": [ + { + "bbox": [ + 115, + 382, + 424, + 396 + ], + "score": 1.0, + "content": "Scene Representation and Rendering. Science, 360(6394):1204–1210, 2018.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20, + "bbox_fs": [ + 106, + 339, + 506, + 396 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 400, + 503, + 434 + ], + "lines": [ + { + "bbox": [ + 105, + 400, + 504, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 400, + 504, + 414 + ], + "score": 1.0, + "content": "Haoqiang Fan, Hao Su, and Leonidas Guibas. A Point Set Generation Network for 3D Object Re-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 412, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 115, + 412, + 505, + 425 + ], + "score": 1.0, + "content": "construction from a Single Image. IEEE Conference on Computer Vision and Pattern Recognition,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 424, + 196, + 434 + ], + "spans": [ + { + "bbox": [ + 115, + 424, + 196, + 434 + ], + "score": 1.0, + "content": "pp. 605–613, 2017.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 400, + 505, + 434 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 441, + 503, + 464 + ], + "lines": [ + { + "bbox": [ + 106, + 442, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 505, + 453 + ], + "score": 1.0, + "content": "A Tewari O Fried, J Thies V Sitzmann, S Lombardi K Sunkavalli, and R Martin-brualla T Simon J", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 451, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 116, + 451, + 505, + 465 + ], + "score": 1.0, + "content": "Saragih. State of the Art on Neural Rendering. Computer Graphics Forum, 39(2):701–727, 2020.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 106, + 442, + 505, + 465 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 470, + 504, + 493 + ], + "lines": [ + { + "bbox": [ + 106, + 469, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 505, + 484 + ], + "score": 1.0, + "content": "Georgia Gkioxari, Jitendra Malik, and Justin Johnson. Mesh R-CNN. IEEE International Confer-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 482, + 311, + 494 + ], + "spans": [ + { + "bbox": [ + 115, + 482, + 311, + 494 + ], + "score": 1.0, + "content": "ence on Computer Vision, pp. 9785–9795, 2019.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 106, + 469, + 505, + 494 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 499, + 504, + 534 + ], + "lines": [ + { + "bbox": [ + 105, + 499, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 506, + 513 + ], + "score": 1.0, + "content": "Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair,", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 117, + 511, + 504, + 524 + ], + "spans": [ + { + "bbox": [ + 117, + 511, + 504, + 524 + ], + "score": 1.0, + "content": "Aaron Courville, and Yoshua Bengio. Generative Adversarial Nets. Advances in Neural Informa-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 117, + 522, + 307, + 534 + ], + "spans": [ + { + "bbox": [ + 117, + 522, + 307, + 534 + ], + "score": 1.0, + "content": "tion Processing Systems, pp. 2672–2680, 2014.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 499, + 506, + 534 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 540, + 505, + 574 + ], + "lines": [ + { + "bbox": [ + 105, + 539, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 554 + ], + "score": 1.0, + "content": "Thibault Groueix, Matthew Fisher, Vladimir G Kim, Bryan C Russell, and Mathieu Aubry. A Papier-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 551, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 116, + 551, + 505, + 563 + ], + "score": 1.0, + "content": "Mache Approach to Learning 3D Surface Generation. IEEE Conference on Computer Vision and", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 563, + 280, + 575 + ], + "spans": [ + { + "bbox": [ + 116, + 563, + 280, + 575 + ], + "score": 1.0, + "content": "Pattern Recognition, pp. 216–224, 2018.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 539, + 505, + 575 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 581, + 503, + 604 + ], + "lines": [ + { + "bbox": [ + 104, + 579, + 505, + 594 + ], + "spans": [ + { + "bbox": [ + 104, + 579, + 505, + 594 + ], + "score": 1.0, + "content": "Richard Hartley and Andrew Zisserman. Multiple View Geometry in Computer Vision. Cambridge", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 592, + 212, + 605 + ], + "spans": [ + { + "bbox": [ + 116, + 592, + 212, + 605 + ], + "score": 1.0, + "content": "University Press, 2004.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5, + "bbox_fs": [ + 104, + 579, + 505, + 605 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 610, + 505, + 644 + ], + "lines": [ + { + "bbox": [ + 106, + 610, + 504, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 504, + 622 + ], + "score": 1.0, + "content": "Eldar Insafutdinov and Alexey Dosovitskiy. Unsupervised Learning of Shape and Pose with Dif-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 621, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 115, + 621, + 505, + 633 + ], + "score": 1.0, + "content": "ferentiable Point Clouds. Advances in Neural Information Processing Systems, pp. 2802–2812,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 631, + 142, + 644 + ], + "spans": [ + { + "bbox": [ + 115, + 631, + 142, + 644 + ], + "score": 1.0, + "content": "2018.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39, + "bbox_fs": [ + 106, + 610, + 505, + 644 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 650, + 504, + 673 + ], + "lines": [ + { + "bbox": [ + 105, + 651, + 505, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 505, + 664 + ], + "score": 1.0, + "content": "James T. Kajiya and Brian P Von Herzen. Ray tracing volume densities. ACM SIGGRAPH Computer", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 661, + 210, + 674 + ], + "spans": [ + { + "bbox": [ + 115, + 661, + 210, + 674 + ], + "score": 1.0, + "content": "Graphics, 18(3), 1984.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5, + "bbox_fs": [ + 105, + 651, + 505, + 674 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 679, + 504, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 680, + 504, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 680, + 504, + 693 + ], + "score": 1.0, + "content": "Hiroharu Kato, Yoshitaka Ushiku, and Tatsuya Harada. Neural 3D Mesh Renderer. IEEE Confer-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 691, + 411, + 703 + ], + "spans": [ + { + "bbox": [ + 116, + 691, + 411, + 703 + ], + "score": 1.0, + "content": "ence on Computer Vision and Pattern Recognition, pp. 3907–3916, 2018.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43.5, + "bbox_fs": [ + 105, + 680, + 504, + 703 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Hiroharu Kato, Deniz Beker, Mihai Morariu, Takahiro Ando, Toru Matsuoka, Wadim Kehl, and", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 116, + 720, + 434, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 434, + 733 + ], + "score": 1.0, + "content": "Adrien Gaidon. Differentiable Rendering: A Survey. arXiv:2006.12057, 2020.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45.5, + "bbox_fs": [ + 106, + 709, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 96 + ], + "score": 1.0, + "content": "Diederik P Kingma and Max Welling. Auto-Encoding Variational Bayes. International Conference", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 262, + 105 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 262, + 105 + ], + "score": 1.0, + "content": "on Learning Representations, 2014.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 113, + 504, + 147 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 506, + 127 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 506, + 127 + ], + "score": 1.0, + "content": "Arno Knapitsch, Jaesik Park, Qian Yi Zhou, and Vladlen Koltun. Tanks and temples: Benchmarking", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 125, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 116, + 125, + 505, + 137 + ], + "score": 1.0, + "content": "large-scale scene reconstruction. ACM Transactions on Graphics, 36(4), 2017. ISSN 15577368.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 136, + 247, + 147 + ], + "spans": [ + { + "bbox": [ + 116, + 136, + 247, + 147 + ], + "score": 1.0, + "content": "doi: 10.1145/3072959.3073599.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 155, + 504, + 178 + ], + "lines": [ + { + "bbox": [ + 105, + 155, + 505, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 155, + 505, + 168 + ], + "score": 1.0, + "content": "Lingjie Liu, Jiatao Gu, Kyaw Zaw Lin, Tat-Seng Chua, and Christian Theobalt. Neural Sparse Voxel", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 166, + 386, + 179 + ], + "spans": [ + { + "bbox": [ + 116, + 166, + 386, + 179 + ], + "score": 1.0, + "content": "Fields. Advances in Neural Information Processing Systems, 2020.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 106, + 186, + 505, + 219 + ], + "lines": [ + { + "bbox": [ + 106, + 186, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 106, + 186, + 505, + 199 + ], + "score": 1.0, + "content": "Shichen Liu, Tianye Li, Weikai Chen, and Hao Li. Soft Rasterizer: A Differentiable Renderer for", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 197, + 505, + 209 + ], + "spans": [ + { + "bbox": [ + 116, + 197, + 505, + 209 + ], + "score": 1.0, + "content": "Image-based 3D Reasoning. IEEE International Conference on Computer Vision, pp. 7708–7717,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 206, + 147, + 221 + ], + "spans": [ + { + "bbox": [ + 115, + 206, + 147, + 221 + ], + "score": 1.0, + "content": "2019a.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 106, + 227, + 504, + 251 + ], + "lines": [ + { + "bbox": [ + 105, + 227, + 506, + 241 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 506, + 241 + ], + "score": 1.0, + "content": "Shichen Liu, Shunsuke Saito, Weikai Chen, and Hao Li. Learning to Infer Implicit Surfaces without", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 239, + 493, + 252 + ], + "spans": [ + { + "bbox": [ + 116, + 239, + 493, + 252 + ], + "score": 1.0, + "content": "3D Supervision. Advances in Neural Information Processing Systems, pp. 8293–8304, 2019b.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 108, + 258, + 503, + 293 + ], + "lines": [ + { + "bbox": [ + 105, + 258, + 505, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 505, + 272 + ], + "score": 1.0, + "content": "Francesco Locatello, Dirk Weissenborn, Thomas Unterthiner, Aravindh Mahendran, Georg Heigold,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 270, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 115, + 270, + 505, + 284 + ], + "score": 1.0, + "content": "Jakob Uszkoreit, Alexey Dosovitskiy, and Thomas Kipf. Object-Centric Learning with Slot At-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 281, + 389, + 294 + ], + "spans": [ + { + "bbox": [ + 116, + 281, + 389, + 294 + ], + "score": 1.0, + "content": "tention. Advances in Neural Information Processing Systems, 2020.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 108, + 300, + 504, + 334 + ], + "lines": [ + { + "bbox": [ + 106, + 301, + 505, + 313 + ], + "spans": [ + { + "bbox": [ + 106, + 301, + 505, + 313 + ], + "score": 1.0, + "content": "Stephen Lombardi, Tomas Simon, Jason Saragih, Gabriel Schwartz, Andreas Lehrmann, and Yaser", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 311, + 505, + 325 + ], + "spans": [ + { + "bbox": [ + 115, + 311, + 505, + 325 + ], + "score": 1.0, + "content": "Sheikh. Neural volumes: Learning dynamic renderable volumes from images. ACM Transactions", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 323, + 424, + 334 + ], + "spans": [ + { + "bbox": [ + 115, + 323, + 424, + 334 + ], + "score": 1.0, + "content": "on Graphics, 38(4), 2019. ISSN 15577368. doi: 10.1145/3306346.3323020.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 106, + 342, + 505, + 376 + ], + "lines": [ + { + "bbox": [ + 106, + 343, + 505, + 355 + ], + "spans": [ + { + "bbox": [ + 106, + 343, + 505, + 355 + ], + "score": 1.0, + "content": "Ricardo Martin-Brualla, Noha Radwan, Mehdi S. M. Sajjadi, Jonathan T. Barron, Alexey Dosovit-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 354, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 116, + 354, + 505, + 366 + ], + "score": 1.0, + "content": "skiy, and Daniel Duckworth. NeRF in the Wild: Neural Radiance Fields for Unconstrained Photo", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 117, + 365, + 270, + 376 + ], + "spans": [ + { + "bbox": [ + 117, + 365, + 270, + 376 + ], + "score": 1.0, + "content": "Collections. arXiv:2008.02268, 2020.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 106, + 385, + 506, + 419 + ], + "lines": [ + { + "bbox": [ + 105, + 383, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 383, + 505, + 399 + ], + "score": 1.0, + "content": "Lars Mescheder, Michael Oechsle, Michael Niemeyer, Sebastian Nowozin, and Andreas Geiger.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 117, + 396, + 505, + 408 + ], + "spans": [ + { + "bbox": [ + 117, + 396, + 505, + 408 + ], + "score": 1.0, + "content": "Occupancy Networks: Learning 3D Reconstruction in Function Space. IEEE Conference on", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 117, + 406, + 378, + 420 + ], + "spans": [ + { + "bbox": [ + 117, + 406, + 378, + 420 + ], + "score": 1.0, + "content": "Computer Vision and Pattern Recognition, pp. 4455–4465, 2019.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 108, + 426, + 504, + 461 + ], + "lines": [ + { + "bbox": [ + 106, + 426, + 504, + 439 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 504, + 439 + ], + "score": 1.0, + "content": "Ben Mildenhall, Pratul Srinivasan, Rodrigo Ortiz-Cayon, Nima Khademi Kalantari, Ravi Ra-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 438, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 116, + 438, + 505, + 450 + ], + "score": 1.0, + "content": "mamoorthi, Ren Ng, and Abhishek Kar. Local light field fusion: Practical view synthesis with", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 450, + 330, + 461 + ], + "spans": [ + { + "bbox": [ + 116, + 450, + 330, + 461 + ], + "score": 1.0, + "content": "prescriptive sampling guidelines. SIGGRAPH, 2019.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 108, + 468, + 505, + 502 + ], + "lines": [ + { + "bbox": [ + 106, + 468, + 505, + 481 + ], + "spans": [ + { + "bbox": [ + 106, + 468, + 505, + 481 + ], + "score": 1.0, + "content": "Ben Mildenhall, Pratul P. Srinivasan, Matthew Tancik, Jonathan T Barron, Ravi Ramamoorthi, and", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 479, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 116, + 479, + 505, + 492 + ], + "score": 1.0, + "content": "Ren Ng. NeRF: Representing Scenes as Neural Radiance Fields for View Synthesis. European", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 116, + 491, + 273, + 502 + ], + "spans": [ + { + "bbox": [ + 116, + 491, + 273, + 502 + ], + "score": 1.0, + "content": "Conference on Computer Vision, 2020.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 105, + 510, + 504, + 533 + ], + "lines": [ + { + "bbox": [ + 106, + 510, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 106, + 510, + 505, + 524 + ], + "score": 1.0, + "content": "Charlie Nash, Yaroslav Ganin, S. M. Ali Eslami, and Peter W. Battaglia. PolyGen: An Autoregres-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 521, + 490, + 534 + ], + "spans": [ + { + "bbox": [ + 116, + 521, + 490, + 534 + ], + "score": 1.0, + "content": "sive Generative Model of 3D Meshes. International Conference on Machine Learning, 2020.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 106, + 541, + 505, + 576 + ], + "lines": [ + { + "bbox": [ + 105, + 541, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 505, + 555 + ], + "score": 1.0, + "content": "Michael Niemeyer, Lars Mescheder, Michael Oechsle, and Andreas Geiger. Differentiable Volumet-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 553, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 115, + 553, + 505, + 565 + ], + "score": 1.0, + "content": "ric Rendering: Learning Implicit 3D Representations without 3D Supervision. IEEE Conference", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 564, + 389, + 576 + ], + "spans": [ + { + "bbox": [ + 115, + 564, + 389, + 576 + ], + "score": 1.0, + "content": "on Computer Vision and Pattern Recognition, pp. 3504–3515, 2020.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 106, + 583, + 506, + 617 + ], + "lines": [ + { + "bbox": [ + 105, + 582, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 505, + 597 + ], + "score": 1.0, + "content": "Aaron van den Oord, Nal Kalchbrenner, Oriol Vinyals, Lasse Espeholt, Alex Graves, and Koray", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 595, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 116, + 595, + 505, + 606 + ], + "score": 1.0, + "content": "Kavukcuoglu. Conditional Image Generation with PixelCNN Decoders. Advances in Neural", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 605, + 410, + 618 + ], + "spans": [ + { + "bbox": [ + 115, + 605, + 410, + 618 + ], + "score": 1.0, + "content": "Information Processing Systems, pp. 4790–4798, 2016. ISSN 10495258.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 105, + 625, + 505, + 648 + ], + "lines": [ + { + "bbox": [ + 107, + 626, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 107, + 626, + 505, + 639 + ], + "score": 1.0, + "content": "Onur Ozyesil, Vladislav Voroninski, Ronen Basri, and Amit Singer. A Survey of Structure from", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 636, + 295, + 648 + ], + "spans": [ + { + "bbox": [ + 115, + 636, + 295, + 648 + ], + "score": 1.0, + "content": "Motion. Acta Numerica, 26:305–364, 2017.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 107, + 656, + 504, + 691 + ], + "lines": [ + { + "bbox": [ + 105, + 655, + 505, + 670 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 670 + ], + "score": 1.0, + "content": "Jeong Joon Park, Peter Florence, Julian Straub, Richard Newcombe, and Steven Lovegrove.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 668, + 505, + 680 + ], + "spans": [ + { + "bbox": [ + 115, + 668, + 505, + 680 + ], + "score": 1.0, + "content": "DeepSDF: Learning Continuous Signed Distance Functions for Shape Representation. IEEE Con-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 114, + 678, + 412, + 691 + ], + "spans": [ + { + "bbox": [ + 114, + 678, + 412, + 691 + ], + "score": 1.0, + "content": "ference on Computer Vision and Pattern Recognition, pp. 165–174, 2019.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 107, + 699, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 697, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 505, + 712 + ], + "score": 1.0, + "content": "Charles R. Qi, Hao Su, Kaichun Mo, and Leonidas J. Guibas. PointNet: Deep Learning on Point", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 116, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Sets for 3D Classification and Segmentation. IEEE Conference on Computer Vision and Pattern", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 116, + 720, + 250, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 250, + 733 + ], + "score": 1.0, + "content": "Recognition, pp. 652–660, 2017.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44 + } + ], + "page_idx": 10, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 13 + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 96 + ], + "score": 1.0, + "content": "Diederik P Kingma and Max Welling. Auto-Encoding Variational Bayes. International Conference", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 262, + 105 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 262, + 105 + ], + "score": 1.0, + "content": "on Learning Representations, 2014.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 106, + 82, + 505, + 105 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 113, + 504, + 147 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 506, + 127 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 506, + 127 + ], + "score": 1.0, + "content": "Arno Knapitsch, Jaesik Park, Qian Yi Zhou, and Vladlen Koltun. Tanks and temples: Benchmarking", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 125, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 116, + 125, + 505, + 137 + ], + "score": 1.0, + "content": "large-scale scene reconstruction. ACM Transactions on Graphics, 36(4), 2017. ISSN 15577368.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 136, + 247, + 147 + ], + "spans": [ + { + "bbox": [ + 116, + 136, + 247, + 147 + ], + "score": 1.0, + "content": "doi: 10.1145/3072959.3073599.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 111, + 506, + 147 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 155, + 504, + 178 + ], + "lines": [ + { + "bbox": [ + 105, + 155, + 505, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 155, + 505, + 168 + ], + "score": 1.0, + "content": "Lingjie Liu, Jiatao Gu, Kyaw Zaw Lin, Tat-Seng Chua, and Christian Theobalt. Neural Sparse Voxel", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 166, + 386, + 179 + ], + "spans": [ + { + "bbox": [ + 116, + 166, + 386, + 179 + ], + "score": 1.0, + "content": "Fields. Advances in Neural Information Processing Systems, 2020.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 155, + 505, + 179 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 186, + 505, + 219 + ], + "lines": [ + { + "bbox": [ + 106, + 186, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 106, + 186, + 505, + 199 + ], + "score": 1.0, + "content": "Shichen Liu, Tianye Li, Weikai Chen, and Hao Li. Soft Rasterizer: A Differentiable Renderer for", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 197, + 505, + 209 + ], + "spans": [ + { + "bbox": [ + 116, + 197, + 505, + 209 + ], + "score": 1.0, + "content": "Image-based 3D Reasoning. IEEE International Conference on Computer Vision, pp. 7708–7717,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 206, + 147, + 221 + ], + "spans": [ + { + "bbox": [ + 115, + 206, + 147, + 221 + ], + "score": 1.0, + "content": "2019a.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8, + "bbox_fs": [ + 106, + 186, + 505, + 221 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 227, + 504, + 251 + ], + "lines": [ + { + "bbox": [ + 105, + 227, + 506, + 241 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 506, + 241 + ], + "score": 1.0, + "content": "Shichen Liu, Shunsuke Saito, Weikai Chen, and Hao Li. Learning to Infer Implicit Surfaces without", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 239, + 493, + 252 + ], + "spans": [ + { + "bbox": [ + 116, + 239, + 493, + 252 + ], + "score": 1.0, + "content": "3D Supervision. Advances in Neural Information Processing Systems, pp. 8293–8304, 2019b.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 227, + 506, + 252 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 258, + 503, + 293 + ], + "lines": [ + { + "bbox": [ + 105, + 258, + 505, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 505, + 272 + ], + "score": 1.0, + "content": "Francesco Locatello, Dirk Weissenborn, Thomas Unterthiner, Aravindh Mahendran, Georg Heigold,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 270, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 115, + 270, + 505, + 284 + ], + "score": 1.0, + "content": "Jakob Uszkoreit, Alexey Dosovitskiy, and Thomas Kipf. Object-Centric Learning with Slot At-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 281, + 389, + 294 + ], + "spans": [ + { + "bbox": [ + 116, + 281, + 389, + 294 + ], + "score": 1.0, + "content": "tention. Advances in Neural Information Processing Systems, 2020.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 258, + 505, + 294 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 300, + 504, + 334 + ], + "lines": [ + { + "bbox": [ + 106, + 301, + 505, + 313 + ], + "spans": [ + { + "bbox": [ + 106, + 301, + 505, + 313 + ], + "score": 1.0, + "content": "Stephen Lombardi, Tomas Simon, Jason Saragih, Gabriel Schwartz, Andreas Lehrmann, and Yaser", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 311, + 505, + 325 + ], + "spans": [ + { + "bbox": [ + 115, + 311, + 505, + 325 + ], + "score": 1.0, + "content": "Sheikh. Neural volumes: Learning dynamic renderable volumes from images. ACM Transactions", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 323, + 424, + 334 + ], + "spans": [ + { + "bbox": [ + 115, + 323, + 424, + 334 + ], + "score": 1.0, + "content": "on Graphics, 38(4), 2019. ISSN 15577368. doi: 10.1145/3306346.3323020.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 106, + 301, + 505, + 334 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 342, + 505, + 376 + ], + "lines": [ + { + "bbox": [ + 106, + 343, + 505, + 355 + ], + "spans": [ + { + "bbox": [ + 106, + 343, + 505, + 355 + ], + "score": 1.0, + "content": "Ricardo Martin-Brualla, Noha Radwan, Mehdi S. M. Sajjadi, Jonathan T. Barron, Alexey Dosovit-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 354, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 116, + 354, + 505, + 366 + ], + "score": 1.0, + "content": "skiy, and Daniel Duckworth. NeRF in the Wild: Neural Radiance Fields for Unconstrained Photo", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 117, + 365, + 270, + 376 + ], + "spans": [ + { + "bbox": [ + 117, + 365, + 270, + 376 + ], + "score": 1.0, + "content": "Collections. arXiv:2008.02268, 2020.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 106, + 343, + 505, + 376 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 385, + 506, + 419 + ], + "lines": [ + { + "bbox": [ + 105, + 383, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 383, + 505, + 399 + ], + "score": 1.0, + "content": "Lars Mescheder, Michael Oechsle, Michael Niemeyer, Sebastian Nowozin, and Andreas Geiger.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 117, + 396, + 505, + 408 + ], + "spans": [ + { + "bbox": [ + 117, + 396, + 505, + 408 + ], + "score": 1.0, + "content": "Occupancy Networks: Learning 3D Reconstruction in Function Space. IEEE Conference on", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 117, + 406, + 378, + 420 + ], + "spans": [ + { + "bbox": [ + 117, + 406, + 378, + 420 + ], + "score": 1.0, + "content": "Computer Vision and Pattern Recognition, pp. 4455–4465, 2019.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 383, + 505, + 420 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 426, + 504, + 461 + ], + "lines": [ + { + "bbox": [ + 106, + 426, + 504, + 439 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 504, + 439 + ], + "score": 1.0, + "content": "Ben Mildenhall, Pratul Srinivasan, Rodrigo Ortiz-Cayon, Nima Khademi Kalantari, Ravi Ra-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 438, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 116, + 438, + 505, + 450 + ], + "score": 1.0, + "content": "mamoorthi, Ren Ng, and Abhishek Kar. Local light field fusion: Practical view synthesis with", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 450, + 330, + 461 + ], + "spans": [ + { + "bbox": [ + 116, + 450, + 330, + 461 + ], + "score": 1.0, + "content": "prescriptive sampling guidelines. SIGGRAPH, 2019.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 106, + 426, + 505, + 461 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 468, + 505, + 502 + ], + "lines": [ + { + "bbox": [ + 106, + 468, + 505, + 481 + ], + "spans": [ + { + "bbox": [ + 106, + 468, + 505, + 481 + ], + "score": 1.0, + "content": "Ben Mildenhall, Pratul P. Srinivasan, Matthew Tancik, Jonathan T Barron, Ravi Ramamoorthi, and", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 479, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 116, + 479, + 505, + 492 + ], + "score": 1.0, + "content": "Ren Ng. NeRF: Representing Scenes as Neural Radiance Fields for View Synthesis. European", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 116, + 491, + 273, + 502 + ], + "spans": [ + { + "bbox": [ + 116, + 491, + 273, + 502 + ], + "score": 1.0, + "content": "Conference on Computer Vision, 2020.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28, + "bbox_fs": [ + 106, + 468, + 505, + 502 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 510, + 504, + 533 + ], + "lines": [ + { + "bbox": [ + 106, + 510, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 106, + 510, + 505, + 524 + ], + "score": 1.0, + "content": "Charlie Nash, Yaroslav Ganin, S. M. Ali Eslami, and Peter W. Battaglia. PolyGen: An Autoregres-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 521, + 490, + 534 + ], + "spans": [ + { + "bbox": [ + 116, + 521, + 490, + 534 + ], + "score": 1.0, + "content": "sive Generative Model of 3D Meshes. International Conference on Machine Learning, 2020.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5, + "bbox_fs": [ + 106, + 510, + 505, + 534 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 541, + 505, + 576 + ], + "lines": [ + { + "bbox": [ + 105, + 541, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 505, + 555 + ], + "score": 1.0, + "content": "Michael Niemeyer, Lars Mescheder, Michael Oechsle, and Andreas Geiger. Differentiable Volumet-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 553, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 115, + 553, + 505, + 565 + ], + "score": 1.0, + "content": "ric Rendering: Learning Implicit 3D Representations without 3D Supervision. IEEE Conference", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 564, + 389, + 576 + ], + "spans": [ + { + "bbox": [ + 115, + 564, + 389, + 576 + ], + "score": 1.0, + "content": "on Computer Vision and Pattern Recognition, pp. 3504–3515, 2020.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33, + "bbox_fs": [ + 105, + 541, + 505, + 576 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 583, + 506, + 617 + ], + "lines": [ + { + "bbox": [ + 105, + 582, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 505, + 597 + ], + "score": 1.0, + "content": "Aaron van den Oord, Nal Kalchbrenner, Oriol Vinyals, Lasse Espeholt, Alex Graves, and Koray", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 595, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 116, + 595, + 505, + 606 + ], + "score": 1.0, + "content": "Kavukcuoglu. Conditional Image Generation with PixelCNN Decoders. Advances in Neural", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 605, + 410, + 618 + ], + "spans": [ + { + "bbox": [ + 115, + 605, + 410, + 618 + ], + "score": 1.0, + "content": "Information Processing Systems, pp. 4790–4798, 2016. ISSN 10495258.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 582, + 505, + 618 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 625, + 505, + 648 + ], + "lines": [ + { + "bbox": [ + 107, + 626, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 107, + 626, + 505, + 639 + ], + "score": 1.0, + "content": "Onur Ozyesil, Vladislav Voroninski, Ronen Basri, and Amit Singer. A Survey of Structure from", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 636, + 295, + 648 + ], + "spans": [ + { + "bbox": [ + 115, + 636, + 295, + 648 + ], + "score": 1.0, + "content": "Motion. Acta Numerica, 26:305–364, 2017.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 107, + 626, + 505, + 648 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 656, + 504, + 691 + ], + "lines": [ + { + "bbox": [ + 105, + 655, + 505, + 670 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 670 + ], + "score": 1.0, + "content": "Jeong Joon Park, Peter Florence, Julian Straub, Richard Newcombe, and Steven Lovegrove.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 668, + 505, + 680 + ], + "spans": [ + { + "bbox": [ + 115, + 668, + 505, + 680 + ], + "score": 1.0, + "content": "DeepSDF: Learning Continuous Signed Distance Functions for Shape Representation. IEEE Con-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 114, + 678, + 412, + 691 + ], + "spans": [ + { + "bbox": [ + 114, + 678, + 412, + 691 + ], + "score": 1.0, + "content": "ference on Computer Vision and Pattern Recognition, pp. 165–174, 2019.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 655, + 505, + 691 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 699, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 697, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 505, + 712 + ], + "score": 1.0, + "content": "Charles R. Qi, Hao Su, Kaichun Mo, and Leonidas J. Guibas. PointNet: Deep Learning on Point", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 116, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Sets for 3D Classification and Segmentation. IEEE Conference on Computer Vision and Pattern", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 116, + 720, + 250, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 250, + 733 + ], + "score": 1.0, + "content": "Recognition, pp. 652–660, 2017.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44, + "bbox_fs": [ + 105, + 697, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Alec Radford, Luke Metz, and Soumith Chintala. Unsupervised Representation Learning with Deep", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "Convolutional Generative Adversarial Networks. International Conference on Learning Repre-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 105, + 187, + 116 + ], + "spans": [ + { + "bbox": [ + 115, + 105, + 187, + 116 + ], + "score": 1.0, + "content": "sentations, 2016.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 108, + 122, + 504, + 155 + ], + "lines": [ + { + "bbox": [ + 105, + 121, + 506, + 135 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 506, + 135 + ], + "score": 1.0, + "content": "Edoardo Remelli, Artem Lukoianov, Stephan R. Richter, Benoˆıt Guillard, Timur Bagautdinov, Pierre", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 133, + 505, + 145 + ], + "spans": [ + { + "bbox": [ + 115, + 133, + 505, + 145 + ], + "score": 1.0, + "content": "Baque, and Pascal Fua. MeshSDF: Differentiable Iso-Surface Extraction. arXiv:2006.03997,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 143, + 143, + 156 + ], + "spans": [ + { + "bbox": [ + 115, + 143, + 143, + 156 + ], + "score": 1.0, + "content": "2020.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 108, + 162, + 504, + 196 + ], + "lines": [ + { + "bbox": [ + 106, + 162, + 505, + 174 + ], + "spans": [ + { + "bbox": [ + 106, + 162, + 505, + 174 + ], + "score": 1.0, + "content": "Danilo Jimenez Rezende, S. M. Ali Eslami, Shakir Mohamed, Peter Battaglia, Max Jaderberg, and", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 173, + 505, + 186 + ], + "spans": [ + { + "bbox": [ + 115, + 173, + 505, + 186 + ], + "score": 1.0, + "content": "Nicolas Heess. Unsupervised Learning of 3D Structure from Images. Advances in Neural Infor-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 185, + 319, + 196 + ], + "spans": [ + { + "bbox": [ + 115, + 185, + 319, + 196 + ], + "score": 1.0, + "content": "mation Processing Systems, pp. 4996–5004, 2016.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 107, + 201, + 504, + 235 + ], + "lines": [ + { + "bbox": [ + 106, + 201, + 505, + 215 + ], + "spans": [ + { + "bbox": [ + 106, + 201, + 505, + 215 + ], + "score": 1.0, + "content": "Gernot Riegler, Ali Osman Ulusoy, and Andreas Geiger. OctNet: Learning Deep 3D Representations", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 213, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 115, + 213, + 505, + 226 + ], + "score": 1.0, + "content": "at High Resolutions. IEEE Conference on Computer Vision and Pattern Recognition, pp. 3577–", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 223, + 167, + 236 + ], + "spans": [ + { + "bbox": [ + 115, + 223, + 167, + 236 + ], + "score": 1.0, + "content": "3586, 2017.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 109, + 241, + 504, + 276 + ], + "lines": [ + { + "bbox": [ + 106, + 241, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 505, + 255 + ], + "score": 1.0, + "content": "Shunsuke Saito, Zeng Huang, Ryota Natsume, Shigeo Morishima, Angjoo Kanazawa, and Hao Li.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 253, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 116, + 253, + 505, + 266 + ], + "score": 1.0, + "content": "PIFu: Pixel-Aligned Implicit Function for High-Resolution Clothed Human Digitization. IEEE", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 263, + 394, + 276 + ], + "spans": [ + { + "bbox": [ + 116, + 263, + 394, + 276 + ], + "score": 1.0, + "content": "International Conference on Computer Vision, pp. 2304–2314, 2019.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 105, + 281, + 504, + 304 + ], + "lines": [ + { + "bbox": [ + 105, + 281, + 506, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 506, + 295 + ], + "score": 1.0, + "content": "Katja Schwarz, Yiyi Liao, Michael Niemeyer, and Andreas Geiger. GRAF: Generative Radiance", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 292, + 375, + 305 + ], + "spans": [ + { + "bbox": [ + 116, + 292, + 375, + 305 + ], + "score": 1.0, + "content": "Fields for 3D-Aware Image Synthesis. arXiv:2007.02442, 2020.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 108, + 310, + 504, + 344 + ], + "lines": [ + { + "bbox": [ + 106, + 309, + 504, + 323 + ], + "spans": [ + { + "bbox": [ + 106, + 309, + 504, + 323 + ], + "score": 1.0, + "content": "Vincent Sitzmann, Michael Zollhofer, and Gordon Wetzstein. Scene Representation Networks: Con- ¨", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 322, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 116, + 322, + 505, + 334 + ], + "score": 1.0, + "content": "tinuous 3D-Structure-Aware Neural Scene Representations. Advances in Neural Information Pro-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 333, + 274, + 345 + ], + "spans": [ + { + "bbox": [ + 115, + 333, + 274, + 345 + ], + "score": 1.0, + "content": "cessing Systems, pp. 1119–1130, 2019.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 350, + 504, + 384 + ], + "lines": [ + { + "bbox": [ + 106, + 350, + 505, + 363 + ], + "spans": [ + { + "bbox": [ + 106, + 350, + 505, + 363 + ], + "score": 1.0, + "content": "Shuran Song, Fisher Yu, Andy Zeng, Angel X. Chang, Manolis Savva, and Thomas Funkhouser.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 361, + 506, + 375 + ], + "spans": [ + { + "bbox": [ + 116, + 361, + 506, + 375 + ], + "score": 1.0, + "content": "Semantic Scene Completion from a Single Depth Image. IEEE Conference on Computer Vision", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 372, + 309, + 385 + ], + "spans": [ + { + "bbox": [ + 115, + 372, + 309, + 385 + ], + "score": 1.0, + "content": "and Pattern Recognition, pp. 1746–1754, 2017.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 104, + 390, + 503, + 413 + ], + "lines": [ + { + "bbox": [ + 105, + 390, + 504, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 504, + 403 + ], + "score": 1.0, + "content": "Maxim Tatarchenko, Alexey Dosovitskiy, and Thomas Brox. Single-view to Multi-view: Recon-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 402, + 443, + 414 + ], + "spans": [ + { + "bbox": [ + 115, + 402, + 443, + 414 + ], + "score": 1.0, + "content": "structing Unseen Views with a Convolutional Network. arXiv:1511.06702, 2015.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 108, + 419, + 504, + 453 + ], + "lines": [ + { + "bbox": [ + 106, + 419, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 505, + 432 + ], + "score": 1.0, + "content": "Shubham Tulsiani, Tinghui Zhou, Alexei A. Efros, and Jitendra Malik. Multi-view Supervision for", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 430, + 505, + 443 + ], + "spans": [ + { + "bbox": [ + 115, + 430, + 505, + 443 + ], + "score": 1.0, + "content": "Single-view Reconstruction via Differentiable Ray Consistency. IEEE Conference on Computer", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 117, + 440, + 336, + 454 + ], + "spans": [ + { + "bbox": [ + 117, + 440, + 336, + 454 + ], + "score": 1.0, + "content": "Vision and Pattern Recognition, pp. 2626–2634, 2017.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 459, + 504, + 493 + ], + "lines": [ + { + "bbox": [ + 105, + 457, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 473 + ], + "score": 1.0, + "content": "Shubham Tulsiani, Saurabh Gupta, David Fouhey, Alexei A. Efros, and Jitendra Malik. Factoring", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 117, + 471, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 117, + 471, + 505, + 482 + ], + "score": 1.0, + "content": "Shape, Pose, and Layout from the 2D Image of a 3D Scene. IEEE Conference on Computer Vision", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 116, + 481, + 298, + 493 + ], + "spans": [ + { + "bbox": [ + 116, + 481, + 298, + 493 + ], + "score": 1.0, + "content": "and Pattern Recognition, pp. 302–310, 2018.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 107, + 498, + 504, + 533 + ], + "lines": [ + { + "bbox": [ + 106, + 499, + 505, + 511 + ], + "spans": [ + { + "bbox": [ + 106, + 499, + 505, + 511 + ], + "score": 1.0, + "content": "Nanyang Wang, Yinda Zhang, Zhuwen Li, Yanwei Fu, Wei Liu, and Yu-Gang Jiang. Pixel2Mesh:", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 510, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 116, + 510, + 505, + 523 + ], + "score": 1.0, + "content": "Generating 3D Mesh Models from Single RGB Images. European Conference on Computer", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 117, + 521, + 216, + 534 + ], + "spans": [ + { + "bbox": [ + 117, + 521, + 216, + 534 + ], + "score": 1.0, + "content": "Vision, pp. 52–67, 2018.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 107, + 538, + 504, + 573 + ], + "lines": [ + { + "bbox": [ + 105, + 538, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 505, + 551 + ], + "score": 1.0, + "content": "Daniel E. Worrall, Stephan J. Garbin, Daniyar Turmukhambetov, and Gabriel J. Brostow. Inter-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 115, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "pretable transformations with encoder-decoder networks. IEEE International Conference on", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 117, + 561, + 278, + 573 + ], + "spans": [ + { + "bbox": [ + 117, + 561, + 278, + 573 + ], + "score": 1.0, + "content": "Computer Vision, pp. 5726–5735, 2017.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 108, + 578, + 504, + 613 + ], + "lines": [ + { + "bbox": [ + 105, + 577, + 506, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 506, + 592 + ], + "score": 1.0, + "content": "Xinchen Yan, Jimei Yang, Ersin Yumer, Yijie Guo, and Honglak Lee. Perspective Transformer", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 590, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 115, + 590, + 506, + 603 + ], + "score": 1.0, + "content": "Nets: Learning Single-View 3D Object Reconstruction without 3D Supervision. Advances in", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 601, + 369, + 613 + ], + "spans": [ + { + "bbox": [ + 115, + 601, + 369, + 613 + ], + "score": 1.0, + "content": "Neural Information Processing Systems, pp. 1696–1704, 2016.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 108, + 618, + 504, + 652 + ], + "lines": [ + { + "bbox": [ + 105, + 617, + 506, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 506, + 632 + ], + "score": 1.0, + "content": "Bo Yang, Stefano Rosa, Andrew Markham, Niki Trigoni, and Hongkai Wen. Dense 3D Object", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 629, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 115, + 629, + 505, + 642 + ], + "score": 1.0, + "content": "Reconstruction from a Single Depth View. IEEE Transactions on Pattern Analysis and Machine", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 641, + 278, + 653 + ], + "spans": [ + { + "bbox": [ + 116, + 641, + 278, + 653 + ], + "score": 1.0, + "content": "Intelligence, 41(12):2820 – 2834, 2019.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 106, + 658, + 504, + 692 + ], + "lines": [ + { + "bbox": [ + 105, + 657, + 506, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 506, + 672 + ], + "score": 1.0, + "content": "Bo Yang, Sen Wang, Andrew Markham, and Niki Trigoni. Robust Attentional Aggregation of Deep", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 669, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 116, + 669, + 505, + 681 + ], + "score": 1.0, + "content": "Feature Sets for Multi-view 3D Reconstruction. International Journal of Computer Vision, 128:", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 116, + 681, + 171, + 692 + ], + "spans": [ + { + "bbox": [ + 116, + 681, + 171, + 692 + ], + "score": 1.0, + "content": "53–73, 2020.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44 + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "Richard Zhang, Phillip Isola, Alexei A. Efros, Eli Shechtman, and Oliver Wang. The Unreasonable", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 116, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 116, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "Effectiveness of Deep Features as a Perceptual Metric. IEEE Conference on Computer Vision and", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 116, + 721, + 280, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 280, + 733 + ], + "score": 1.0, + "content": "Pattern Recognition, pp. 586–595, 2018.", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 47 + } + ], + "page_idx": 11, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "12", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Alec Radford, Luke Metz, and Soumith Chintala. Unsupervised Representation Learning with Deep", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "Convolutional Generative Adversarial Networks. International Conference on Learning Repre-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 105, + 187, + 116 + ], + "spans": [ + { + "bbox": [ + 115, + 105, + 187, + 116 + ], + "score": 1.0, + "content": "sentations, 2016.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 81, + 505, + 116 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 122, + 504, + 155 + ], + "lines": [ + { + "bbox": [ + 105, + 121, + 506, + 135 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 506, + 135 + ], + "score": 1.0, + "content": "Edoardo Remelli, Artem Lukoianov, Stephan R. Richter, Benoˆıt Guillard, Timur Bagautdinov, Pierre", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 133, + 505, + 145 + ], + "spans": [ + { + "bbox": [ + 115, + 133, + 505, + 145 + ], + "score": 1.0, + "content": "Baque, and Pascal Fua. MeshSDF: Differentiable Iso-Surface Extraction. arXiv:2006.03997,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 143, + 143, + 156 + ], + "spans": [ + { + "bbox": [ + 115, + 143, + 143, + 156 + ], + "score": 1.0, + "content": "2020.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 121, + 506, + 156 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 162, + 504, + 196 + ], + "lines": [ + { + "bbox": [ + 106, + 162, + 505, + 174 + ], + "spans": [ + { + "bbox": [ + 106, + 162, + 505, + 174 + ], + "score": 1.0, + "content": "Danilo Jimenez Rezende, S. M. Ali Eslami, Shakir Mohamed, Peter Battaglia, Max Jaderberg, and", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 173, + 505, + 186 + ], + "spans": [ + { + "bbox": [ + 115, + 173, + 505, + 186 + ], + "score": 1.0, + "content": "Nicolas Heess. Unsupervised Learning of 3D Structure from Images. Advances in Neural Infor-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 185, + 319, + 196 + ], + "spans": [ + { + "bbox": [ + 115, + 185, + 319, + 196 + ], + "score": 1.0, + "content": "mation Processing Systems, pp. 4996–5004, 2016.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7, + "bbox_fs": [ + 106, + 162, + 505, + 196 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 201, + 504, + 235 + ], + "lines": [ + { + "bbox": [ + 106, + 201, + 505, + 215 + ], + "spans": [ + { + "bbox": [ + 106, + 201, + 505, + 215 + ], + "score": 1.0, + "content": "Gernot Riegler, Ali Osman Ulusoy, and Andreas Geiger. OctNet: Learning Deep 3D Representations", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 213, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 115, + 213, + 505, + 226 + ], + "score": 1.0, + "content": "at High Resolutions. IEEE Conference on Computer Vision and Pattern Recognition, pp. 3577–", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 223, + 167, + 236 + ], + "spans": [ + { + "bbox": [ + 115, + 223, + 167, + 236 + ], + "score": 1.0, + "content": "3586, 2017.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10, + "bbox_fs": [ + 106, + 201, + 505, + 236 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 241, + 504, + 276 + ], + "lines": [ + { + "bbox": [ + 106, + 241, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 505, + 255 + ], + "score": 1.0, + "content": "Shunsuke Saito, Zeng Huang, Ryota Natsume, Shigeo Morishima, Angjoo Kanazawa, and Hao Li.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 253, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 116, + 253, + 505, + 266 + ], + "score": 1.0, + "content": "PIFu: Pixel-Aligned Implicit Function for High-Resolution Clothed Human Digitization. IEEE", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 263, + 394, + 276 + ], + "spans": [ + { + "bbox": [ + 116, + 263, + 394, + 276 + ], + "score": 1.0, + "content": "International Conference on Computer Vision, pp. 2304–2314, 2019.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13, + "bbox_fs": [ + 106, + 241, + 505, + 276 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 281, + 504, + 304 + ], + "lines": [ + { + "bbox": [ + 105, + 281, + 506, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 506, + 295 + ], + "score": 1.0, + "content": "Katja Schwarz, Yiyi Liao, Michael Niemeyer, and Andreas Geiger. GRAF: Generative Radiance", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 292, + 375, + 305 + ], + "spans": [ + { + "bbox": [ + 116, + 292, + 375, + 305 + ], + "score": 1.0, + "content": "Fields for 3D-Aware Image Synthesis. arXiv:2007.02442, 2020.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 281, + 506, + 305 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 310, + 504, + 344 + ], + "lines": [ + { + "bbox": [ + 106, + 309, + 504, + 323 + ], + "spans": [ + { + "bbox": [ + 106, + 309, + 504, + 323 + ], + "score": 1.0, + "content": "Vincent Sitzmann, Michael Zollhofer, and Gordon Wetzstein. Scene Representation Networks: Con- ¨", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 322, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 116, + 322, + 505, + 334 + ], + "score": 1.0, + "content": "tinuous 3D-Structure-Aware Neural Scene Representations. Advances in Neural Information Pro-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 333, + 274, + 345 + ], + "spans": [ + { + "bbox": [ + 115, + 333, + 274, + 345 + ], + "score": 1.0, + "content": "cessing Systems, pp. 1119–1130, 2019.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18, + "bbox_fs": [ + 106, + 309, + 505, + 345 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 350, + 504, + 384 + ], + "lines": [ + { + "bbox": [ + 106, + 350, + 505, + 363 + ], + "spans": [ + { + "bbox": [ + 106, + 350, + 505, + 363 + ], + "score": 1.0, + "content": "Shuran Song, Fisher Yu, Andy Zeng, Angel X. Chang, Manolis Savva, and Thomas Funkhouser.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 361, + 506, + 375 + ], + "spans": [ + { + "bbox": [ + 116, + 361, + 506, + 375 + ], + "score": 1.0, + "content": "Semantic Scene Completion from a Single Depth Image. IEEE Conference on Computer Vision", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 372, + 309, + 385 + ], + "spans": [ + { + "bbox": [ + 115, + 372, + 309, + 385 + ], + "score": 1.0, + "content": "and Pattern Recognition, pp. 1746–1754, 2017.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21, + "bbox_fs": [ + 106, + 350, + 506, + 385 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 390, + 503, + 413 + ], + "lines": [ + { + "bbox": [ + 105, + 390, + 504, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 504, + 403 + ], + "score": 1.0, + "content": "Maxim Tatarchenko, Alexey Dosovitskiy, and Thomas Brox. Single-view to Multi-view: Recon-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 402, + 443, + 414 + ], + "spans": [ + { + "bbox": [ + 115, + 402, + 443, + 414 + ], + "score": 1.0, + "content": "structing Unseen Views with a Convolutional Network. arXiv:1511.06702, 2015.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 390, + 504, + 414 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 419, + 504, + 453 + ], + "lines": [ + { + "bbox": [ + 106, + 419, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 505, + 432 + ], + "score": 1.0, + "content": "Shubham Tulsiani, Tinghui Zhou, Alexei A. Efros, and Jitendra Malik. Multi-view Supervision for", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 430, + 505, + 443 + ], + "spans": [ + { + "bbox": [ + 115, + 430, + 505, + 443 + ], + "score": 1.0, + "content": "Single-view Reconstruction via Differentiable Ray Consistency. IEEE Conference on Computer", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 117, + 440, + 336, + 454 + ], + "spans": [ + { + "bbox": [ + 117, + 440, + 336, + 454 + ], + "score": 1.0, + "content": "Vision and Pattern Recognition, pp. 2626–2634, 2017.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 106, + 419, + 505, + 454 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 459, + 504, + 493 + ], + "lines": [ + { + "bbox": [ + 105, + 457, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 473 + ], + "score": 1.0, + "content": "Shubham Tulsiani, Saurabh Gupta, David Fouhey, Alexei A. Efros, and Jitendra Malik. Factoring", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 117, + 471, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 117, + 471, + 505, + 482 + ], + "score": 1.0, + "content": "Shape, Pose, and Layout from the 2D Image of a 3D Scene. IEEE Conference on Computer Vision", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 116, + 481, + 298, + 493 + ], + "spans": [ + { + "bbox": [ + 116, + 481, + 298, + 493 + ], + "score": 1.0, + "content": "and Pattern Recognition, pp. 302–310, 2018.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29, + "bbox_fs": [ + 105, + 457, + 505, + 493 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 498, + 504, + 533 + ], + "lines": [ + { + "bbox": [ + 106, + 499, + 505, + 511 + ], + "spans": [ + { + "bbox": [ + 106, + 499, + 505, + 511 + ], + "score": 1.0, + "content": "Nanyang Wang, Yinda Zhang, Zhuwen Li, Yanwei Fu, Wei Liu, and Yu-Gang Jiang. Pixel2Mesh:", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 510, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 116, + 510, + 505, + 523 + ], + "score": 1.0, + "content": "Generating 3D Mesh Models from Single RGB Images. European Conference on Computer", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 117, + 521, + 216, + 534 + ], + "spans": [ + { + "bbox": [ + 117, + 521, + 216, + 534 + ], + "score": 1.0, + "content": "Vision, pp. 52–67, 2018.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32, + "bbox_fs": [ + 106, + 499, + 505, + 534 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 538, + 504, + 573 + ], + "lines": [ + { + "bbox": [ + 105, + 538, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 505, + 551 + ], + "score": 1.0, + "content": "Daniel E. Worrall, Stephan J. Garbin, Daniyar Turmukhambetov, and Gabriel J. Brostow. Inter-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 115, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "pretable transformations with encoder-decoder networks. IEEE International Conference on", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 117, + 561, + 278, + 573 + ], + "spans": [ + { + "bbox": [ + 117, + 561, + 278, + 573 + ], + "score": 1.0, + "content": "Computer Vision, pp. 5726–5735, 2017.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 538, + 506, + 573 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 578, + 504, + 613 + ], + "lines": [ + { + "bbox": [ + 105, + 577, + 506, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 506, + 592 + ], + "score": 1.0, + "content": "Xinchen Yan, Jimei Yang, Ersin Yumer, Yijie Guo, and Honglak Lee. Perspective Transformer", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 590, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 115, + 590, + 506, + 603 + ], + "score": 1.0, + "content": "Nets: Learning Single-View 3D Object Reconstruction without 3D Supervision. Advances in", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 601, + 369, + 613 + ], + "spans": [ + { + "bbox": [ + 115, + 601, + 369, + 613 + ], + "score": 1.0, + "content": "Neural Information Processing Systems, pp. 1696–1704, 2016.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38, + "bbox_fs": [ + 105, + 577, + 506, + 613 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 618, + 504, + 652 + ], + "lines": [ + { + "bbox": [ + 105, + 617, + 506, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 506, + 632 + ], + "score": 1.0, + "content": "Bo Yang, Stefano Rosa, Andrew Markham, Niki Trigoni, and Hongkai Wen. Dense 3D Object", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 629, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 115, + 629, + 505, + 642 + ], + "score": 1.0, + "content": "Reconstruction from a Single Depth View. IEEE Transactions on Pattern Analysis and Machine", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 641, + 278, + 653 + ], + "spans": [ + { + "bbox": [ + 116, + 641, + 278, + 653 + ], + "score": 1.0, + "content": "Intelligence, 41(12):2820 – 2834, 2019.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 617, + 506, + 653 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 658, + 504, + 692 + ], + "lines": [ + { + "bbox": [ + 105, + 657, + 506, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 506, + 672 + ], + "score": 1.0, + "content": "Bo Yang, Sen Wang, Andrew Markham, and Niki Trigoni. Robust Attentional Aggregation of Deep", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 669, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 116, + 669, + 505, + 681 + ], + "score": 1.0, + "content": "Feature Sets for Multi-view 3D Reconstruction. International Journal of Computer Vision, 128:", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 116, + 681, + 171, + 692 + ], + "spans": [ + { + "bbox": [ + 116, + 681, + 171, + 692 + ], + "score": 1.0, + "content": "53–73, 2020.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44, + "bbox_fs": [ + 105, + 657, + 506, + 692 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "Richard Zhang, Phillip Isola, Alexei A. Efros, Eli Shechtman, and Oliver Wang. The Unreasonable", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 116, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 116, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "Effectiveness of Deep Features as a Perceptual Metric. IEEE Conference on Computer Vision and", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 116, + 721, + 280, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 280, + 733 + ], + "score": 1.0, + "content": "Pattern Recognition, pp. 586–595, 2018.", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 47, + "bbox_fs": [ + 106, + 699, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 182, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 79, + 184, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 79, + 184, + 96 + ], + "score": 1.0, + "content": "A APPENDIX", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 106, + 303, + 118 + ], + "lines": [ + { + "bbox": [ + 106, + 105, + 304, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 304, + 118 + ], + "score": 1.0, + "content": "A.1 DETAILS OF NETWORK ARCHITECTURE", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "table", + "bbox": [ + 151, + 149, + 458, + 339 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 166, + 129, + 442, + 141 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 167, + 128, + 443, + 143 + ], + "spans": [ + { + "bbox": [ + 167, + 128, + 443, + 143 + ], + "score": 1.0, + "content": "Table 6: The CNN Module for Experiments on ShapeNetv2 Dataset.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "table_body", + "bbox": [ + 151, + 149, + 458, + 339 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 151, + 149, + 458, + 339 + ], + "spans": [ + { + "bbox": [ + 151, + 149, + 458, + 339 + ], + "score": 0.983, + "html": "
Type Size/Channels Activation Stride
Input: embedding of RGB and viewpoint
1 - 64 ReLU 2
Li: Conv 7 × 7 L2: Conv 3 × 3 128 ReLU 2
L3: Conv 3 × 3 256 ReLU 2
L4: Conv 3 × 3 512 ReLU 2
L5: Conv 4 × 4 128 ReLU 4
L6: Flatten /Tile - 1
L7: Concat (L6,L4) - 1
L8:Dilated Conv 3×3 256 ReLU 4
L8: Concat (L8,L3) 1 1 =
L9:Dilated Conv 3 × 3 128 ReLU 8
L9: Concat (L9,L2) = 一 =
L10: Dilated Conv 3 × 3 64 ReLU 16
L10: Concat (L10, L1) - ■ = L11: Dilated Conv 3 × 3 128 ReLU 32
", + "type": "table", + "image_path": "3ac8d85f8a85bfd8277fb757a68ee73ad0999e9f05f89b1e6333da2f9edbaa85.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 151, + 149, + 458, + 212.33333333333334 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 151, + 212.33333333333334, + 458, + 275.6666666666667 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 151, + 275.6666666666667, + 458, + 339.0 + ], + "spans": [], + "index": 5 + } + ] + } + ], + "index": 3.0 + }, + { + "type": "table", + "bbox": [ + 151, + 385, + 458, + 586 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 354, + 505, + 378 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 353, + 505, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 505, + 368 + ], + "score": 1.0, + "content": "Table 7: The CNN Module for Experiments on Synthetic-NeRF Dataset. The average pooling is", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 365, + 318, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 365, + 318, + 379 + ], + "score": 1.0, + "content": "added to aggressively downsample the feature maps.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "table_body", + "bbox": [ + 151, + 385, + 458, + 586 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 151, + 385, + 458, + 586 + ], + "spans": [ + { + "bbox": [ + 151, + 385, + 458, + 586 + ], + "score": 0.984, + "html": "
Type Size/Channels Activation Stride
Input: embedding of RGB and viewpoint - -
L1: Conv 7 × 7 64 ReLU 2
L2: Conv 3 × 3 128 ReLU 2
L3: Conv 3 × 3 256 ReLU 2
L4: Conv 3 × 3 512 ReLU 2
L4: AveragePooling 5 × 5
= =
L5: Conv 5 × 5 128 ReLU 5
L6:Flatten /Tile - 1
L7: Concat (L6,L4) 1 1
L8: Deconv 3× 3 256 ReLU 2
L8: Concat (L8, L3) 1 1
L9: Deonv 3 × 3 128 ReLU 2
L9: Concat (L9,L2) 1 1
L10: Deconv 3×3 64 ReLU 2
L10: Concat (L10,L1) - 1 L11: Deconv 3 × 3 128 ReLU 2
", + "type": "table", + "image_path": "f3cfc5c0b697f7ff2d4d137d9755f6843fc3a68f617b71895b640e8384cb92d3.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 151, + 385, + 458, + 452.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 151, + 452.0, + 458, + 519.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 151, + 519.0, + 458, + 586.0 + ], + "spans": [], + "index": 10 + } + ] + } + ], + "index": 7.75 + } + ], + "page_idx": 12, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "13", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 182, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 79, + 184, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 79, + 184, + 96 + ], + "score": 1.0, + "content": "A APPENDIX", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 106, + 303, + 118 + ], + "lines": [ + { + "bbox": [ + 106, + 105, + 304, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 304, + 118 + ], + "score": 1.0, + "content": "A.1 DETAILS OF NETWORK ARCHITECTURE", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1, + "bbox_fs": [ + 106, + 105, + 304, + 118 + ] + }, + { + "type": "table", + "bbox": [ + 151, + 149, + 458, + 339 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 166, + 129, + 442, + 141 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 167, + 128, + 443, + 143 + ], + "spans": [ + { + "bbox": [ + 167, + 128, + 443, + 143 + ], + "score": 1.0, + "content": "Table 6: The CNN Module for Experiments on ShapeNetv2 Dataset.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "table_body", + "bbox": [ + 151, + 149, + 458, + 339 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 151, + 149, + 458, + 339 + ], + "spans": [ + { + "bbox": [ + 151, + 149, + 458, + 339 + ], + "score": 0.983, + "html": "
Type Size/Channels Activation Stride
Input: embedding of RGB and viewpoint
1 - 64 ReLU 2
Li: Conv 7 × 7 L2: Conv 3 × 3 128 ReLU 2
L3: Conv 3 × 3 256 ReLU 2
L4: Conv 3 × 3 512 ReLU 2
L5: Conv 4 × 4 128 ReLU 4
L6: Flatten /Tile - 1
L7: Concat (L6,L4) - 1
L8:Dilated Conv 3×3 256 ReLU 4
L8: Concat (L8,L3) 1 1 =
L9:Dilated Conv 3 × 3 128 ReLU 8
L9: Concat (L9,L2) = 一 =
L10: Dilated Conv 3 × 3 64 ReLU 16
L10: Concat (L10, L1) - ■ = L11: Dilated Conv 3 × 3 128 ReLU 32
", + "type": "table", + "image_path": "3ac8d85f8a85bfd8277fb757a68ee73ad0999e9f05f89b1e6333da2f9edbaa85.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 151, + 149, + 458, + 212.33333333333334 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 151, + 212.33333333333334, + 458, + 275.6666666666667 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 151, + 275.6666666666667, + 458, + 339.0 + ], + "spans": [], + "index": 5 + } + ] + } + ], + "index": 3.0 + }, + { + "type": "table", + "bbox": [ + 151, + 385, + 458, + 586 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 354, + 505, + 378 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 353, + 505, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 505, + 368 + ], + "score": 1.0, + "content": "Table 7: The CNN Module for Experiments on Synthetic-NeRF Dataset. The average pooling is", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 365, + 318, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 365, + 318, + 379 + ], + "score": 1.0, + "content": "added to aggressively downsample the feature maps.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "table_body", + "bbox": [ + 151, + 385, + 458, + 586 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 151, + 385, + 458, + 586 + ], + "spans": [ + { + "bbox": [ + 151, + 385, + 458, + 586 + ], + "score": 0.984, + "html": "
Type Size/Channels Activation Stride
Input: embedding of RGB and viewpoint - -
L1: Conv 7 × 7 64 ReLU 2
L2: Conv 3 × 3 128 ReLU 2
L3: Conv 3 × 3 256 ReLU 2
L4: Conv 3 × 3 512 ReLU 2
L4: AveragePooling 5 × 5
= =
L5: Conv 5 × 5 128 ReLU 5
L6:Flatten /Tile - 1
L7: Concat (L6,L4) 1 1
L8: Deconv 3× 3 256 ReLU 2
L8: Concat (L8, L3) 1 1
L9: Deonv 3 × 3 128 ReLU 2
L9: Concat (L9,L2) 1 1
L10: Deconv 3×3 64 ReLU 2
L10: Concat (L10,L1) - 1 L11: Deconv 3 × 3 128 ReLU 2
", + "type": "table", + "image_path": "f3cfc5c0b697f7ff2d4d137d9755f6843fc3a68f617b71895b640e8384cb92d3.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 151, + 385, + 458, + 452.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 151, + 452.0, + 458, + 519.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 151, + 519.0, + 458, + 586.0 + ], + "spans": [], + "index": 10 + } + ] + } + ], + "index": 7.75 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 150, + 111, + 459, + 311 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 80, + 504, + 103 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 80, + 505, + 93 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 505, + 93 + ], + "score": 1.0, + "content": "Table 8: The CNN Module for Experiments on the real-world Dataset. The average pooling is added", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 91, + 292, + 104 + ], + "spans": [ + { + "bbox": [ + 105, + 91, + 292, + 104 + ], + "score": 1.0, + "content": "to aggressively downsample the feature maps.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "table_body", + "bbox": [ + 150, + 111, + 459, + 311 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 150, + 111, + 459, + 311 + ], + "spans": [ + { + "bbox": [ + 150, + 111, + 459, + 311 + ], + "score": 0.983, + "html": "
Type Size/Channels Activation Stride
Input: embedding of RGB and viewpoint 1 1
L1: Conv 7 × 7 64 ReLU
22 L2: Conv 3 × 3 128 ReLU
L3: Conv 3 × 3 256 ReLU 2
L4: Conv 3 × 3 512 ReLU 2
L4: AveragePooling 8 × 8 1 =
L5: Conv 4 × 4 128 ReLU 4
L6: Flatten /Tile 1 1
L7: Concat (L6,L4) 1 1
L8: Deconv 3 × 3 256 ReLU 2
L8: Concat (L8,L3) - 1
L9: Deconv 3 × 3 128 ReLU
L9: Concat (L9,L2) 1 =
L10: Deconv 3×3 64 ReLU 2
L10: Concat (L10, L1) - =
L11: Deconv 3 × 3 128 ReLU 2
", + "type": "table", + "image_path": "15ad75e56b1cd73cb68236429d499cf4d8210d2b20664c25830133d3707753ff.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 150, + 111, + 459, + 177.66666666666669 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 150, + 177.66666666666669, + 459, + 244.33333333333337 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 150, + 244.33333333333337, + 459, + 311.00000000000006 + ], + "spans": [], + "index": 4 + } + ] + } + ], + "index": 1.75 + }, + { + "type": "table", + "bbox": [ + 147, + 370, + 462, + 493 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 327, + 504, + 361 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 326, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 505, + 340 + ], + "score": 1.0, + "content": "Table 9: The Attention Module, AttSets (Yang et al., 2020), for Experiments on the ShapeNetv2", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 338, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 338, + 505, + 351 + ], + "score": 1.0, + "content": "Dataset. The simple AttSets is computationally efficient and we choose it to train the large-scale", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 349, + 191, + 362 + ], + "spans": [ + { + "bbox": [ + 106, + 349, + 191, + 362 + ], + "score": 1.0, + "content": "ShapeNetv2 dataset.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "table_body", + "bbox": [ + 147, + 370, + 462, + 493 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 147, + 370, + 462, + 493 + ], + "spans": [ + { + "bbox": [ + 147, + 370, + 462, + 493 + ], + "score": 0.983, + "html": "
TypeSize/Channels Activation
Input: Concat(K × 128,embedding of viewpoint)==
L1: fc256ReLU
L2: fc256ReLU
L3: fc256ReLU
L4: fc512ReLU
L5: fc512ReLU
L6: softmax(L5)11
L7: sum(L6*L5,axis=-2)11
L8: fc512ReLU
", + "type": "table", + "image_path": "5792f5022f202a1711b69c1ecc67365884b64b5fb9c2d196c0495c1ea99e0865.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 147, + 370, + 462, + 411.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 147, + 411.0, + 462, + 452.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 147, + 452.0, + 462, + 493.0 + ], + "spans": [], + "index": 10 + } + ] + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 107, + 506, + 504, + 550 + ], + "lines": [ + { + "bbox": [ + 105, + 505, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 505, + 519 + ], + "score": 1.0, + "content": "We use Slot Attention as the pixel feature aggregation module for experiments on the Synthetic-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 517, + 506, + 529 + ], + "spans": [ + { + "bbox": [ + 106, + 517, + 506, + 529 + ], + "score": 1.0, + "content": "NeRF and real-world datasets. In particular, we use two slots, two iterations, and the hidden size is", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 528, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 506, + 540 + ], + "score": 1.0, + "content": "128. The final output two slots are flattened and a 256 dimensional vector is obtained. For details of", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 539, + 332, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 332, + 552 + ], + "score": 1.0, + "content": "Slot Attention refer to the paper (Locatello et al., 2020).", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 108, + 556, + 502, + 589 + ], + "lines": [ + { + "bbox": [ + 105, + 555, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 568 + ], + "score": 1.0, + "content": "Details of the neural rendering layers and the volume rendering can be found in NeRF (Mildenhall", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 567, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 106, + 567, + 330, + 579 + ], + "score": 1.0, + "content": "et al., 2020). We set the positional embedding length", + "type": "text" + }, + { + "bbox": [ + 330, + 567, + 360, + 577 + ], + "score": 0.91, + "content": "L = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 567, + 505, + 579 + ], + "score": 1.0, + "content": "for all inputs to the CNN module,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 578, + 400, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 369, + 590 + ], + "score": 1.0, + "content": "except the rotation, which we convert to quaternion and embed at", + "type": "text" + }, + { + "bbox": [ + 369, + 578, + 396, + 588 + ], + "score": 0.9, + "content": "L = 4", + "type": "inline_equation" + }, + { + "bbox": [ + 396, + 578, + 400, + 590 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 106, + 594, + 505, + 672 + ], + "lines": [ + { + "bbox": [ + 105, + 594, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 608 + ], + "score": 1.0, + "content": "During training, we feed the models between 2 and 6 views of each scene at each gradient step.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 606, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 606, + 505, + 617 + ], + "score": 1.0, + "content": "We set the learning rate for the ShapeNetv2 models at 1e-4. We set the learning rate for leaves and", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 615, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 630 + ], + "score": 1.0, + "content": "orchids in the real-world dataset at 7e-5, and for the rest, we use 1e-4. For Synthetic-NeRF dataset,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 628, + 504, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 628, + 459, + 640 + ], + "score": 1.0, + "content": "we use a learning rate of 1e-4. We use the Adam optimizer for all models, and train for", + "type": "text" + }, + { + "bbox": [ + 460, + 628, + 504, + 639 + ], + "score": 0.35, + "content": "2 0 0 \\mathbf { k } { - } 3 0 0 \\mathbf { k }", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 639, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 505, + 651 + ], + "score": 1.0, + "content": "iterations. At each gradient step, we take 1000 rays for ShapeNetv2 with 32 coarse samples and 64", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 650, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 650, + 505, + 662 + ], + "score": 1.0, + "content": "fine samples, and 800 rays for the real-world and Synthetic-NeRF datasets with 64 coarse samples", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 661, + 485, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 661, + 485, + 673 + ], + "score": 1.0, + "content": "and 192 fine samples. We train each model on a single Nvidia-V100 GPU with 32GB VRAM.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 108, + 677, + 505, + 721 + ], + "lines": [ + { + "bbox": [ + 106, + 678, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 505, + 689 + ], + "score": 1.0, + "content": "During testing for the ShapeNetv2 reconstruction from 50 images, we feed the model the 5 closest", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 687, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 702 + ], + "score": 1.0, + "content": "views to the desired novel view by cosine similarity from the 50 training images. During testing", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 104, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "for single-scene reconstruction, we feed the model the 4 closest views by cosine similarity to the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 710, + 186, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 186, + 722 + ], + "score": 1.0, + "content": "desired novel view.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26.5 + } + ], + "page_idx": 13, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 763 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 763 + ], + "score": 1.0, + "content": "14", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 150, + 111, + 459, + 311 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 80, + 504, + 103 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 80, + 505, + 93 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 505, + 93 + ], + "score": 1.0, + "content": "Table 8: The CNN Module for Experiments on the real-world Dataset. The average pooling is added", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 91, + 292, + 104 + ], + "spans": [ + { + "bbox": [ + 105, + 91, + 292, + 104 + ], + "score": 1.0, + "content": "to aggressively downsample the feature maps.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "table_body", + "bbox": [ + 150, + 111, + 459, + 311 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 150, + 111, + 459, + 311 + ], + "spans": [ + { + "bbox": [ + 150, + 111, + 459, + 311 + ], + "score": 0.983, + "html": "
Type Size/Channels Activation Stride
Input: embedding of RGB and viewpoint 1 1
L1: Conv 7 × 7 64 ReLU
22 L2: Conv 3 × 3 128 ReLU
L3: Conv 3 × 3 256 ReLU 2
L4: Conv 3 × 3 512 ReLU 2
L4: AveragePooling 8 × 8 1 =
L5: Conv 4 × 4 128 ReLU 4
L6: Flatten /Tile 1 1
L7: Concat (L6,L4) 1 1
L8: Deconv 3 × 3 256 ReLU 2
L8: Concat (L8,L3) - 1
L9: Deconv 3 × 3 128 ReLU
L9: Concat (L9,L2) 1 =
L10: Deconv 3×3 64 ReLU 2
L10: Concat (L10, L1) - =
L11: Deconv 3 × 3 128 ReLU 2
", + "type": "table", + "image_path": "15ad75e56b1cd73cb68236429d499cf4d8210d2b20664c25830133d3707753ff.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 150, + 111, + 459, + 177.66666666666669 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 150, + 177.66666666666669, + 459, + 244.33333333333337 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 150, + 244.33333333333337, + 459, + 311.00000000000006 + ], + "spans": [], + "index": 4 + } + ] + } + ], + "index": 1.75 + }, + { + "type": "table", + "bbox": [ + 147, + 370, + 462, + 493 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 327, + 504, + 361 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 326, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 505, + 340 + ], + "score": 1.0, + "content": "Table 9: The Attention Module, AttSets (Yang et al., 2020), for Experiments on the ShapeNetv2", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 338, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 338, + 505, + 351 + ], + "score": 1.0, + "content": "Dataset. The simple AttSets is computationally efficient and we choose it to train the large-scale", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 349, + 191, + 362 + ], + "spans": [ + { + "bbox": [ + 106, + 349, + 191, + 362 + ], + "score": 1.0, + "content": "ShapeNetv2 dataset.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "table_body", + "bbox": [ + 147, + 370, + 462, + 493 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 147, + 370, + 462, + 493 + ], + "spans": [ + { + "bbox": [ + 147, + 370, + 462, + 493 + ], + "score": 0.983, + "html": "
TypeSize/Channels Activation
Input: Concat(K × 128,embedding of viewpoint)==
L1: fc256ReLU
L2: fc256ReLU
L3: fc256ReLU
L4: fc512ReLU
L5: fc512ReLU
L6: softmax(L5)11
L7: sum(L6*L5,axis=-2)11
L8: fc512ReLU
", + "type": "table", + "image_path": "5792f5022f202a1711b69c1ecc67365884b64b5fb9c2d196c0495c1ea99e0865.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 147, + 370, + 462, + 411.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 147, + 411.0, + 462, + 452.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 147, + 452.0, + 462, + 493.0 + ], + "spans": [], + "index": 10 + } + ] + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 107, + 506, + 504, + 550 + ], + "lines": [ + { + "bbox": [ + 105, + 505, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 505, + 519 + ], + "score": 1.0, + "content": "We use Slot Attention as the pixel feature aggregation module for experiments on the Synthetic-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 517, + 506, + 529 + ], + "spans": [ + { + "bbox": [ + 106, + 517, + 506, + 529 + ], + "score": 1.0, + "content": "NeRF and real-world datasets. In particular, we use two slots, two iterations, and the hidden size is", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 528, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 506, + 540 + ], + "score": 1.0, + "content": "128. The final output two slots are flattened and a 256 dimensional vector is obtained. For details of", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 539, + 332, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 332, + 552 + ], + "score": 1.0, + "content": "Slot Attention refer to the paper (Locatello et al., 2020).", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 505, + 506, + 552 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 556, + 502, + 589 + ], + "lines": [ + { + "bbox": [ + 105, + 555, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 568 + ], + "score": 1.0, + "content": "Details of the neural rendering layers and the volume rendering can be found in NeRF (Mildenhall", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 567, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 106, + 567, + 330, + 579 + ], + "score": 1.0, + "content": "et al., 2020). We set the positional embedding length", + "type": "text" + }, + { + "bbox": [ + 330, + 567, + 360, + 577 + ], + "score": 0.91, + "content": "L = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 567, + 505, + 579 + ], + "score": 1.0, + "content": "for all inputs to the CNN module,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 578, + 400, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 369, + 590 + ], + "score": 1.0, + "content": "except the rotation, which we convert to quaternion and embed at", + "type": "text" + }, + { + "bbox": [ + 369, + 578, + 396, + 588 + ], + "score": 0.9, + "content": "L = 4", + "type": "inline_equation" + }, + { + "bbox": [ + 396, + 578, + 400, + 590 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 555, + 505, + 590 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 594, + 505, + 672 + ], + "lines": [ + { + "bbox": [ + 105, + 594, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 608 + ], + "score": 1.0, + "content": "During training, we feed the models between 2 and 6 views of each scene at each gradient step.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 606, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 606, + 505, + 617 + ], + "score": 1.0, + "content": "We set the learning rate for the ShapeNetv2 models at 1e-4. We set the learning rate for leaves and", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 615, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 630 + ], + "score": 1.0, + "content": "orchids in the real-world dataset at 7e-5, and for the rest, we use 1e-4. For Synthetic-NeRF dataset,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 628, + 504, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 628, + 459, + 640 + ], + "score": 1.0, + "content": "we use a learning rate of 1e-4. We use the Adam optimizer for all models, and train for", + "type": "text" + }, + { + "bbox": [ + 460, + 628, + 504, + 639 + ], + "score": 0.35, + "content": "2 0 0 \\mathbf { k } { - } 3 0 0 \\mathbf { k }", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 639, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 505, + 651 + ], + "score": 1.0, + "content": "iterations. At each gradient step, we take 1000 rays for ShapeNetv2 with 32 coarse samples and 64", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 650, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 650, + 505, + 662 + ], + "score": 1.0, + "content": "fine samples, and 800 rays for the real-world and Synthetic-NeRF datasets with 64 coarse samples", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 661, + 485, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 661, + 485, + 673 + ], + "score": 1.0, + "content": "and 192 fine samples. We train each model on a single Nvidia-V100 GPU with 32GB VRAM.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 594, + 506, + 673 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 677, + 505, + 721 + ], + "lines": [ + { + "bbox": [ + 106, + 678, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 505, + 689 + ], + "score": 1.0, + "content": "During testing for the ShapeNetv2 reconstruction from 50 images, we feed the model the 5 closest", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 687, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 702 + ], + "score": 1.0, + "content": "views to the desired novel view by cosine similarity from the 50 training images. During testing", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 104, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "for single-scene reconstruction, we feed the model the 4 closest views by cosine similarity to the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 710, + 186, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 186, + 722 + ], + "score": 1.0, + "content": "desired novel view.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26.5, + "bbox_fs": [ + 104, + 678, + 505, + 722 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 82, + 454, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 456, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 456, + 95 + ], + "score": 1.0, + "content": "A.2 DETAILS OF EXPERIMENTAL RESULTS ON THE SYNTHETIC-NERF DATASET", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table", + "bbox": [ + 106, + 147, + 506, + 376 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 105, + 505, + 140 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 105, + 505, + 119 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 505, + 119 + ], + "score": 1.0, + "content": "Table 10: Comparison of the PSNR (in dB), SSIM and LPIPS (Zhang et al., 2018) scores of our", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 116, + 505, + 130 + ], + "spans": [ + { + "bbox": [ + 106, + 116, + 505, + 130 + ], + "score": 1.0, + "content": "GRF, SRNs (Sitzmann et al., 2019), NV (Lombardi et al., 2019), NeRF (Mildenhall et al., 2020)", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 127, + 446, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 446, + 141 + ], + "score": 1.0, + "content": "and NSVF (Liu et al., 2020) in the Synthetic-NeRF dataset for single-scene learning.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "table_body", + "bbox": [ + 106, + 147, + 506, + 376 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 147, + 506, + 376 + ], + "spans": [ + { + "bbox": [ + 106, + 147, + 506, + 376 + ], + "score": 0.984, + "html": "
ChairDrumsLegoMicMaterialsShipHotdogFicusMean
PSNR↑
SRNs26.9617.1820.8526.8518.0920.6026.8120.7322.26
NV28.3322.5826.0827.7824.2223.9330.7124.7926.05
NeRF33.0025.0132.5432.9129.6228.6536.1830.1331.01
NSVF33.1925.1832.2934.2732.6827.9337.1431.2331.74
GRF(Ours)34.5125.8332.9233.9430.9130.1237.4730.7532.06
SSIM↑
SRNs0.9100.7660.8090.9470.8080.7570.9230.8490.846
NV0.9160.8730.8800.9460.8880.7840.9440.9100.893
NeRF0.9670.9250.9610.9800.9490.8560.9740.9640.947
NSVF0.9680.9310.9600.9870.9730.8540.9800.9730.953
GRF(Ours)0.9810.9370.9670.9870.9630.8910.9830.9690.960
LPIPS↓
SRNs0.1060.2670.2000.0630.1740.2990.1000.1490.170
NV0.1090.2140.1750.1070.1300.2760.1090.1620.160
NeRF0.0460.0910.0500.0280.0630.2060.1210.0440.081
NSVF0.0430.0690.0290.0100.0210.1620.0250.0170.047
GRF(Ours)0.0210.0680.0420.0130.0410.1410.0280.0320.048
", + "type": "table", + "image_path": "8a19c4d1e380f64c84286252d3506630858144ee54eca16f70dc58749599911e.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 106, + 147, + 506, + 223.33333333333331 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 106, + 223.33333333333331, + 506, + 299.66666666666663 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 106, + 299.66666666666663, + 506, + 375.99999999999994 + ], + "spans": [], + "index": 6 + } + ] + } + ], + "index": 3.5 + }, + { + "type": "table", + "bbox": [ + 106, + 438, + 506, + 650 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 392, + 505, + 429 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 392, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 106, + 392, + 505, + 405 + ], + "score": 1.0, + "content": "Table 11: The PSNR, SSIM and LPIPS scores of our GRF simultaneously trained on 4 scenes of the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 402, + 506, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 506, + 417 + ], + "score": 1.0, + "content": "Synthetic-NeRF dataset for multi-scene learning. The scores of SRNs, NeRF and NSVF trained on", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 416, + 279, + 429 + ], + "spans": [ + { + "bbox": [ + 106, + 416, + 279, + 429 + ], + "score": 1.0, + "content": "single scenes are included for comparison.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + }, + { + "type": "table_body", + "bbox": [ + 106, + 438, + 506, + 650 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 438, + 506, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 438, + 506, + 650 + ], + "score": 0.985, + "html": "
ChairMicShipHotdog
PSNR↑
SRNs (Single-scene)26.9626.8520.6026.81
NeRF (Single-scene)33.0032.9128.6536.18
NSVF (Single-scene)33.1934.2727.9337.14
GRF (Multi-scene)32.4932.0227.7634.92
SSIM↑
SRNs (Single-scene)0.9100.9470.7570.923
NeRF (Single-scene)0.9670.9800.8560.974
NSVF (Single-scene)0.9680.9870.8540.980
GRF (Multi-scene)0.9710.9820.8660.975
LPIPS↓
SRNs (Single-scene)0.1060.0630.2990.100
NeRF (Single-scene)0.0460.0280.2060.121
NSVF (Single-scene)0.0430.0100.1620.025
GRF (Multi-scene)0.0320.0190.1670.040
", + "type": "table", + "image_path": "7456beddc3b5748ce63369feae497d718a196676d033b0c2e1938a44b6190833.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 106, + 438, + 506, + 508.6666666666667 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 106, + 508.6666666666667, + 506, + 579.3333333333334 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 106, + 579.3333333333334, + 506, + 650.0 + ], + "spans": [], + "index": 12 + } + ] + } + ], + "index": 9.5 + } + ], + "page_idx": 14, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "15", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 82, + 454, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 456, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 456, + 95 + ], + "score": 1.0, + "content": "A.2 DETAILS OF EXPERIMENTAL RESULTS ON THE SYNTHETIC-NERF DATASET", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table", + "bbox": [ + 106, + 147, + 506, + 376 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 105, + 505, + 140 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 105, + 505, + 119 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 505, + 119 + ], + "score": 1.0, + "content": "Table 10: Comparison of the PSNR (in dB), SSIM and LPIPS (Zhang et al., 2018) scores of our", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 116, + 505, + 130 + ], + "spans": [ + { + "bbox": [ + 106, + 116, + 505, + 130 + ], + "score": 1.0, + "content": "GRF, SRNs (Sitzmann et al., 2019), NV (Lombardi et al., 2019), NeRF (Mildenhall et al., 2020)", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 127, + 446, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 446, + 141 + ], + "score": 1.0, + "content": "and NSVF (Liu et al., 2020) in the Synthetic-NeRF dataset for single-scene learning.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "table_body", + "bbox": [ + 106, + 147, + 506, + 376 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 147, + 506, + 376 + ], + "spans": [ + { + "bbox": [ + 106, + 147, + 506, + 376 + ], + "score": 0.984, + "html": "
ChairDrumsLegoMicMaterialsShipHotdogFicusMean
PSNR↑
SRNs26.9617.1820.8526.8518.0920.6026.8120.7322.26
NV28.3322.5826.0827.7824.2223.9330.7124.7926.05
NeRF33.0025.0132.5432.9129.6228.6536.1830.1331.01
NSVF33.1925.1832.2934.2732.6827.9337.1431.2331.74
GRF(Ours)34.5125.8332.9233.9430.9130.1237.4730.7532.06
SSIM↑
SRNs0.9100.7660.8090.9470.8080.7570.9230.8490.846
NV0.9160.8730.8800.9460.8880.7840.9440.9100.893
NeRF0.9670.9250.9610.9800.9490.8560.9740.9640.947
NSVF0.9680.9310.9600.9870.9730.8540.9800.9730.953
GRF(Ours)0.9810.9370.9670.9870.9630.8910.9830.9690.960
LPIPS↓
SRNs0.1060.2670.2000.0630.1740.2990.1000.1490.170
NV0.1090.2140.1750.1070.1300.2760.1090.1620.160
NeRF0.0460.0910.0500.0280.0630.2060.1210.0440.081
NSVF0.0430.0690.0290.0100.0210.1620.0250.0170.047
GRF(Ours)0.0210.0680.0420.0130.0410.1410.0280.0320.048
", + "type": "table", + "image_path": "8a19c4d1e380f64c84286252d3506630858144ee54eca16f70dc58749599911e.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 106, + 147, + 506, + 223.33333333333331 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 106, + 223.33333333333331, + 506, + 299.66666666666663 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 106, + 299.66666666666663, + 506, + 375.99999999999994 + ], + "spans": [], + "index": 6 + } + ] + } + ], + "index": 3.5 + }, + { + "type": "table", + "bbox": [ + 106, + 438, + 506, + 650 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 392, + 505, + 429 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 392, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 106, + 392, + 505, + 405 + ], + "score": 1.0, + "content": "Table 11: The PSNR, SSIM and LPIPS scores of our GRF simultaneously trained on 4 scenes of the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 402, + 506, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 506, + 417 + ], + "score": 1.0, + "content": "Synthetic-NeRF dataset for multi-scene learning. The scores of SRNs, NeRF and NSVF trained on", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 416, + 279, + 429 + ], + "spans": [ + { + "bbox": [ + 106, + 416, + 279, + 429 + ], + "score": 1.0, + "content": "single scenes are included for comparison.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + }, + { + "type": "table_body", + "bbox": [ + 106, + 438, + 506, + 650 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 438, + 506, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 438, + 506, + 650 + ], + "score": 0.985, + "html": "
ChairMicShipHotdog
PSNR↑
SRNs (Single-scene)26.9626.8520.6026.81
NeRF (Single-scene)33.0032.9128.6536.18
NSVF (Single-scene)33.1934.2727.9337.14
GRF (Multi-scene)32.4932.0227.7634.92
SSIM↑
SRNs (Single-scene)0.9100.9470.7570.923
NeRF (Single-scene)0.9670.9800.8560.974
NSVF (Single-scene)0.9680.9870.8540.980
GRF (Multi-scene)0.9710.9820.8660.975
LPIPS↓
SRNs (Single-scene)0.1060.0630.2990.100
NeRF (Single-scene)0.0460.0280.2060.121
NSVF (Single-scene)0.0430.0100.1620.025
GRF (Multi-scene)0.0320.0190.1670.040
", + "type": "table", + "image_path": "7456beddc3b5748ce63369feae497d718a196676d033b0c2e1938a44b6190833.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 106, + 438, + 506, + 508.6666666666667 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 106, + 508.6666666666667, + 506, + 579.3333333333334 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 106, + 579.3333333333334, + 506, + 650.0 + ], + "spans": [], + "index": 12 + } + ] + } + ], + "index": 9.5 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 105, + 262, + 505, + 581 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 105, + 230, + 503, + 255 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 229, + 505, + 243 + ], + "spans": [ + { + "bbox": [ + 105, + 229, + 505, + 243 + ], + "score": 1.0, + "content": "Table 12: The PSNR, SSIM and LPIPS scores of our GRF and NeRF on four novel scenes of Syn-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 240, + 271, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 271, + 257 + ], + "score": 1.0, + "content": "thetic-NeRF in Group 1&2 experiments.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "table_body", + "bbox": [ + 105, + 262, + 505, + 581 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 262, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 262, + 505, + 581 + ], + "score": 0.975, + "html": "
Drums
Lego PSNR↑MaterialsFicus
GRF (Group 1) 13.23 13.5312.26 15.47 15.42 15.72
NeRF( F(Group2,100 iters) 14.54 14.9220.04 20.40 20.81
NeRF( (Group2,1k iters) 18.0119.81 23.36 23.47
NeRF (Group 2,10k iters) 21.57 24.9923.35
GRF (Group 2,100 iters) 18.70 20.2418.81 21.03 19.69
GRF (Group2,1k iters) 20.49 23.6421.87 22.02 22.00
GRF (Group2,10k iters) 23.11 27.0725.11 25.11 25.10
SSIM↑
F (Group 1) 0.7620.736 0.703 0.849
NeRF(Group 2,100 iters)0.769 0.717 0.716
NeRF(Group 2,1k iters) 0.793 0.7750.812 0.857 0.809 0.877 0.896 0.875
NeRF F(Group2,10k iters) 0.8650.862
GRF(Group 2,100 iters) 0.822 0.8130.829 0.878 0.835
GRF (Group2,1k iters) 0.8560.877 0.878 0.894 0.876 0.916
GRF F(Group2,10k iters) 0.9010.924 0.913 0.923
LPIPS↓
0.256 0.273 0.301 0.150
GRF (Group 1) NeRF(Group 2,100 iters)0.332 0.395 0.314
NeRF(Group 2,1k iters) 0.254 0.2640.393 0.359 0.229 0.164 0.228 0.137
NeRF (Group2,10k iters) 0.1570.154 0.128 0.110
GRF (Group 2,100 iters) 0.1960.203 0.159 0.117 0.169 0.128
GRF F(Group2,1k iters) 0.154 GRF (Group 2,10k iters) 0.1040.138 0.123 0.097 0.090 0.090 0.071
", + "type": "table", + "image_path": "faa40c1a6f21d2a0d3d808f83a19ed8fcc279796274d22c7b01aac148f1c3535.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 105, + 262, + 505, + 368.3333333333333 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 105, + 368.3333333333333, + 505, + 474.66666666666663 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 105, + 474.66666666666663, + 505, + 581.0 + ], + "spans": [], + "index": 4 + } + ] + } + ], + "index": 1.75 + } + ], + "page_idx": 15, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "16", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 106, + 27, + 307, + 38 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 105, + 262, + 505, + 581 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 105, + 230, + 503, + 255 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 229, + 505, + 243 + ], + "spans": [ + { + "bbox": [ + 105, + 229, + 505, + 243 + ], + "score": 1.0, + "content": "Table 12: The PSNR, SSIM and LPIPS scores of our GRF and NeRF on four novel scenes of Syn-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 240, + 271, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 271, + 257 + ], + "score": 1.0, + "content": "thetic-NeRF in Group 1&2 experiments.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "table_body", + "bbox": [ + 105, + 262, + 505, + 581 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 262, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 262, + 505, + 581 + ], + "score": 0.975, + "html": "
Drums
Lego PSNR↑MaterialsFicus
GRF (Group 1) 13.23 13.5312.26 15.47 15.42 15.72
NeRF( F(Group2,100 iters) 14.54 14.9220.04 20.40 20.81
NeRF( (Group2,1k iters) 18.0119.81 23.36 23.47
NeRF (Group 2,10k iters) 21.57 24.9923.35
GRF (Group 2,100 iters) 18.70 20.2418.81 21.03 19.69
GRF (Group2,1k iters) 20.49 23.6421.87 22.02 22.00
GRF (Group2,10k iters) 23.11 27.0725.11 25.11 25.10
SSIM↑
F (Group 1) 0.7620.736 0.703 0.849
NeRF(Group 2,100 iters)0.769 0.717 0.716
NeRF(Group 2,1k iters) 0.793 0.7750.812 0.857 0.809 0.877 0.896 0.875
NeRF F(Group2,10k iters) 0.8650.862
GRF(Group 2,100 iters) 0.822 0.8130.829 0.878 0.835
GRF (Group2,1k iters) 0.8560.877 0.878 0.894 0.876 0.916
GRF F(Group2,10k iters) 0.9010.924 0.913 0.923
LPIPS↓
0.256 0.273 0.301 0.150
GRF (Group 1) NeRF(Group 2,100 iters)0.332 0.395 0.314
NeRF(Group 2,1k iters) 0.254 0.2640.393 0.359 0.229 0.164 0.228 0.137
NeRF (Group2,10k iters) 0.1570.154 0.128 0.110
GRF (Group 2,100 iters) 0.1960.203 0.159 0.117 0.169 0.128
GRF F(Group2,1k iters) 0.154 GRF (Group 2,10k iters) 0.1040.138 0.123 0.097 0.090 0.090 0.071
", + "type": "table", + "image_path": "faa40c1a6f21d2a0d3d808f83a19ed8fcc279796274d22c7b01aac148f1c3535.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 105, + 262, + 505, + 368.3333333333333 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 105, + 368.3333333333333, + 505, + 474.66666666666663 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 105, + 474.66666666666663, + 505, + 581.0 + ], + "spans": [], + "index": 4 + } + ] + } + ], + "index": 1.75 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 434, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 435, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 435, + 95 + ], + "score": 1.0, + "content": "A.3 DETAILS OF EXPERIMENTAL RESULTS ON THE REAL-WORLD DATASET", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table", + "bbox": [ + 106, + 148, + 505, + 346 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 105, + 505, + 141 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 104, + 505, + 119 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 119 + ], + "score": 1.0, + "content": "Table 13: Comparison of the PSNR, SSIM and LPIPS scores of our GRF, SRNs (Sitzmann et al.,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 116, + 506, + 129 + ], + "spans": [ + { + "bbox": [ + 106, + 116, + 506, + 129 + ], + "score": 1.0, + "content": "2019), LLFF (Mildenhall et al., 2019) and NeRF (Mildenhall et al., 2020) in the real-world dataset", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 127, + 208, + 142 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 208, + 142 + ], + "score": 1.0, + "content": "for single-scene learning.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "table_body", + "bbox": [ + 106, + 148, + 505, + 346 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 148, + 505, + 346 + ], + "spans": [ + { + "bbox": [ + 106, + 148, + 505, + 346 + ], + "score": 0.985, + "html": "
RoomFernLeavesFortressOrchidsFlowerT-RexHornsMean
PSNR↑
SRNs27.2921.3718.2426.6317.3724.6322.8724.3322.84
LLFF28.4222.8519.5229.4018.5225.4624.1524.7024.13
NeRF32.7025.1720.9231.1620.3627.4026.8027.4526.50
GRF(Ours)31.7425.7221.1631.2820.8827.8327.0127.5026.64
SSIM↑
SRNs0.8830.6110.5200.6410.4490.7380.7610.7420.668
LLFF0.9320.7530.6970.8720.5880.8440.8570.8400.798
NeRF0.9480.7920.6900.8810.6410.8270.8800.8280.811
GRF(Ours)0.9510.8270.7270.8980.6670.8520.9010.8730.837
LPIPS↓
SRNs0.2400.4590.4400.4530.4670.2880.2980.3760.378
LLFF0.1550.2470.2160.1730.3130.1740.2220.1930.212
NeRF0.1780.2800.3160.1710.3210.2190.2490.2680.250
GRF(Ours)0.1040.1910.2380.1270.2750.1760.1460.1690.178
", + "type": "table", + "image_path": "13622607470041225f8d5395594024818146184a58c3007f10049788c300715c.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 106, + 148, + 505, + 214.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 106, + 214.0, + 505, + 280.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 106, + 280.0, + 505, + 346.0 + ], + "spans": [], + "index": 6 + } + ] + } + ], + "index": 3.5 + } + ], + "page_idx": 16, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "17", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 434, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 435, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 435, + 95 + ], + "score": 1.0, + "content": "A.3 DETAILS OF EXPERIMENTAL RESULTS ON THE REAL-WORLD DATASET", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 81, + 435, + 95 + ] + }, + { + "type": "table", + "bbox": [ + 106, + 148, + 505, + 346 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 105, + 505, + 141 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 104, + 505, + 119 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 119 + ], + "score": 1.0, + "content": "Table 13: Comparison of the PSNR, SSIM and LPIPS scores of our GRF, SRNs (Sitzmann et al.,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 116, + 506, + 129 + ], + "spans": [ + { + "bbox": [ + 106, + 116, + 506, + 129 + ], + "score": 1.0, + "content": "2019), LLFF (Mildenhall et al., 2019) and NeRF (Mildenhall et al., 2020) in the real-world dataset", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 127, + 208, + 142 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 208, + 142 + ], + "score": 1.0, + "content": "for single-scene learning.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "table_body", + "bbox": [ + 106, + 148, + 505, + 346 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 148, + 505, + 346 + ], + "spans": [ + { + "bbox": [ + 106, + 148, + 505, + 346 + ], + "score": 0.985, + "html": "
RoomFernLeavesFortressOrchidsFlowerT-RexHornsMean
PSNR↑
SRNs27.2921.3718.2426.6317.3724.6322.8724.3322.84
LLFF28.4222.8519.5229.4018.5225.4624.1524.7024.13
NeRF32.7025.1720.9231.1620.3627.4026.8027.4526.50
GRF(Ours)31.7425.7221.1631.2820.8827.8327.0127.5026.64
SSIM↑
SRNs0.8830.6110.5200.6410.4490.7380.7610.7420.668
LLFF0.9320.7530.6970.8720.5880.8440.8570.8400.798
NeRF0.9480.7920.6900.8810.6410.8270.8800.8280.811
GRF(Ours)0.9510.8270.7270.8980.6670.8520.9010.8730.837
LPIPS↓
SRNs0.2400.4590.4400.4530.4670.2880.2980.3760.378
LLFF0.1550.2470.2160.1730.3130.1740.2220.1930.212
NeRF0.1780.2800.3160.1710.3210.2190.2490.2680.250
GRF(Ours)0.1040.1910.2380.1270.2750.1760.1460.1690.178
", + "type": "table", + "image_path": "13622607470041225f8d5395594024818146184a58c3007f10049788c300715c.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 106, + 148, + 505, + 214.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 106, + 214.0, + 505, + 280.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 106, + 280.0, + 505, + 346.0 + ], + "spans": [], + "index": 6 + } + ] + } + ], + "index": 3.5 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 82, + 301, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 302, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 302, + 95 + ], + "score": 1.0, + "content": "A.4 ANALYSIS OF ATTENTION MECHANISM(Generalizat", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 102, + 504, + 127 + ], + "lines": [ + { + "bbox": [ + 106, + 102, + 505, + 115 + ], + "spans": [ + { + "bbox": [ + 106, + 102, + 505, + 115 + ], + "score": 1.0, + "content": "The attention mechanism in our GRF aims to automatically select the correct pixel patch from mul-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 114, + 447, + 129 + ], + "spans": [ + { + "bbox": [ + 106, + 114, + 447, + 129 + ], + "score": 1.0, + "content": "tiple pixel patches where the light rays intersect at the same query 3D point in space.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5 + }, + { + "type": "text", + "bbox": [ + 106, + 133, + 505, + 207 + ], + "lines": [ + { + "bbox": [ + 105, + 133, + 506, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 133, + 506, + 146 + ], + "score": 1.0, + "content": "In order to investigate how the attention mechanism learns to select the useful information, we re-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 144, + 505, + 158 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 505, + 158 + ], + "score": 1.0, + "content": "trieve the maximal attention score from the observed multiple pixel patches for analysis. Intuitively,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 157, + 506, + 170 + ], + "spans": [ + { + "bbox": [ + 106, + 157, + 506, + 170 + ], + "score": 1.0, + "content": "the higher the attention score is assigned to a particular pixel patch, the more important that patch", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 168, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 168, + 505, + 183 + ], + "score": 1.0, + "content": "for inferring the novel pixel RGB. In particular, we conduct the following experiment using our GRF", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 181, + 506, + 195 + ], + "spans": [ + { + "bbox": [ + 106, + 181, + 506, + 195 + ], + "score": 1.0, + "content": "model trained on ShapeNetv2 Cars. In this case, the AttSets attention module is used (details are in", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 194, + 456, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 456, + 207 + ], + "score": 1.0, + "content": "Table 9). Given a query light ray, multiple 3D points are sampled to query the network.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 106, + 212, + 505, + 359 + ], + "lines": [ + { + "bbox": [ + 114, + 212, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 114, + 212, + 505, + 225 + ], + "score": 1.0, + "content": "We firstly try to find the 3D point which is near the surface according to the predicted volume", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 114, + 224, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 114, + 224, + 505, + 238 + ], + "score": 1.0, + "content": "density for points along the ray through a given pixel, if they exist. Otherwise, we ignore such", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 114, + 237, + 225, + 249 + ], + "spans": [ + { + "bbox": [ + 114, + 237, + 225, + 249 + ], + "score": 1.0, + "content": "pixels, making them white.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 114, + 249, + 470, + 262 + ], + "spans": [ + { + "bbox": [ + 114, + 249, + 470, + 262 + ], + "score": 1.0, + "content": "Then we compute the M feature vectors from the input M views for these surface points.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 114, + 261, + 505, + 273 + ], + "spans": [ + { + "bbox": [ + 114, + 261, + 505, + 273 + ], + "score": 1.0, + "content": "Thirdly, the attention masks for those M feature vectors are computed. We identify the view whose", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 114, + 271, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 114, + 271, + 506, + 288 + ], + "score": 1.0, + "content": "sum of the attention mask along the feature axis is greatest as the main contributor for inferring", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 114, + 285, + 201, + 298 + ], + "spans": [ + { + "bbox": [ + 114, + 285, + 201, + 298 + ], + "score": 1.0, + "content": "the novel pixel RGB.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 114, + 298, + 506, + 311 + ], + "spans": [ + { + "bbox": [ + 114, + 298, + 506, + 311 + ], + "score": 1.0, + "content": "After querying light rays for each pixel, we obtain a rendered RGB image. At the same time, for", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 114, + 310, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 114, + 310, + 505, + 322 + ], + "score": 1.0, + "content": "each pixel of that image, we select the most important view from the M input views for the surface-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 114, + 322, + 505, + 335 + ], + "spans": [ + { + "bbox": [ + 114, + 322, + 505, + 335 + ], + "score": 1.0, + "content": "intersection point along the ray from the viewpoint through that pixel, according to the maximal", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 114, + 334, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 114, + 334, + 505, + 348 + ], + "score": 1.0, + "content": "attention score. Eventually, we obtain a Max Attention Map corresponding to the rendered RGB", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 114, + 346, + 147, + 361 + ], + "spans": [ + { + "bbox": [ + 114, + 346, + 147, + 361 + ], + "score": 1.0, + "content": "image.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 106, + 365, + 505, + 426 + ], + "lines": [ + { + "bbox": [ + 105, + 363, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 506, + 378 + ], + "score": 1.0, + "content": "Figure 7 shows the qualitative results of the above experiment. In particular, we feed the three im-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 376, + 506, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 506, + 390 + ], + "score": 1.0, + "content": "ages (#1,#2,#3) of an unseen car into our GRF model which is well-trained on car category, and", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 388, + 505, + 402 + ], + "spans": [ + { + "bbox": [ + 106, + 388, + 505, + 402 + ], + "score": 1.0, + "content": "then render a new image (e.g., the 5th image in Figure 7). Note that, we carefully select the input 3", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 401, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 401, + 505, + 415 + ], + "score": 1.0, + "content": "images and the rendered image with very large viewing baselines. In the mean time, we obtain and", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 412, + 392, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 412, + 392, + 428 + ], + "score": 1.0, + "content": "visualize the Max Attention Map corresponding to the rendered image.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 432, + 505, + 469 + ], + "lines": [ + { + "bbox": [ + 106, + 432, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 106, + 432, + 505, + 444 + ], + "score": 1.0, + "content": "For each pixel of the rendered image, we retrieve the input image pixel that has the highest attention", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 443, + 506, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 443, + 506, + 458 + ], + "score": 1.0, + "content": "score. Specifically, the rendered pixels with purple color correspond to the input image #1, the green", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 456, + 491, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 456, + 491, + 469 + ], + "score": 1.0, + "content": "pixels correspond to the input image #2, while the blue pixels correspond to the input image #3.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 106, + 474, + 505, + 536 + ], + "lines": [ + { + "bbox": [ + 104, + 472, + 507, + 488 + ], + "spans": [ + { + "bbox": [ + 104, + 472, + 507, + 488 + ], + "score": 1.0, + "content": "Analysis. It can be seen that, when inferring a new image, the attention module of our GRF focuses", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 486, + 506, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 506, + 500 + ], + "score": 1.0, + "content": "on the most informative pixel patch from the multiple input pixel patches. In addition, it is able", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 498, + 506, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 506, + 512 + ], + "score": 1.0, + "content": "to truly deal with the visual occlusion. For example, when inferring the windshield of the car, the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 510, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 510, + 506, + 525 + ], + "score": 1.0, + "content": "attention module focuses on the input image #2 where the windshield is visible, while ignoring the", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 522, + 331, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 331, + 537 + ], + "score": 1.0, + "content": "image #1 and #3 where the windshield is self-occluded.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31 + }, + { + "type": "image", + "bbox": [ + 106, + 548, + 505, + 625 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 106, + 548, + 505, + 625 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 548, + 505, + 625 + ], + "spans": [ + { + "bbox": [ + 106, + 548, + 505, + 625 + ], + "score": 0.956, + "type": "image", + "image_path": "20f93eecb76196ee8f164adc09b398e9f5dbb82c10a34c1453af75819e8f5736.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 106, + 548, + 505, + 573.6666666666666 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 106, + 573.6666666666666, + 505, + 599.3333333333333 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 106, + 599.3333333333333, + 505, + 624.9999999999999 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 633, + 504, + 659 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 632, + 505, + 647 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 647 + ], + "score": 1.0, + "content": "Figure 7: Visualization of Max Attention Map from Multiple Input Images of a Novel Object for", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 644, + 203, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 203, + 660 + ], + "score": 1.0, + "content": "Inferring a Novel View.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5 + } + ], + "index": 36.25 + } + ], + "page_idx": 17, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 763 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 763 + ], + "score": 1.0, + "content": "18", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 82, + 301, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 302, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 302, + 95 + ], + "score": 1.0, + "content": "A.4 ANALYSIS OF ATTENTION MECHANISM(Generalizat", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 102, + 504, + 127 + ], + "lines": [ + { + "bbox": [ + 106, + 102, + 505, + 115 + ], + "spans": [ + { + "bbox": [ + 106, + 102, + 505, + 115 + ], + "score": 1.0, + "content": "The attention mechanism in our GRF aims to automatically select the correct pixel patch from mul-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 114, + 447, + 129 + ], + "spans": [ + { + "bbox": [ + 106, + 114, + 447, + 129 + ], + "score": 1.0, + "content": "tiple pixel patches where the light rays intersect at the same query 3D point in space.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5, + "bbox_fs": [ + 106, + 102, + 505, + 129 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 133, + 505, + 207 + ], + "lines": [ + { + "bbox": [ + 105, + 133, + 506, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 133, + 506, + 146 + ], + "score": 1.0, + "content": "In order to investigate how the attention mechanism learns to select the useful information, we re-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 144, + 505, + 158 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 505, + 158 + ], + "score": 1.0, + "content": "trieve the maximal attention score from the observed multiple pixel patches for analysis. Intuitively,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 157, + 506, + 170 + ], + "spans": [ + { + "bbox": [ + 106, + 157, + 506, + 170 + ], + "score": 1.0, + "content": "the higher the attention score is assigned to a particular pixel patch, the more important that patch", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 168, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 168, + 505, + 183 + ], + "score": 1.0, + "content": "for inferring the novel pixel RGB. In particular, we conduct the following experiment using our GRF", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 181, + 506, + 195 + ], + "spans": [ + { + "bbox": [ + 106, + 181, + 506, + 195 + ], + "score": 1.0, + "content": "model trained on ShapeNetv2 Cars. In this case, the AttSets attention module is used (details are in", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 194, + 456, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 456, + 207 + ], + "score": 1.0, + "content": "Table 9). Given a query light ray, multiple 3D points are sampled to query the network.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 133, + 506, + 207 + ] + }, + { + "type": "list", + "bbox": [ + 106, + 212, + 505, + 359 + ], + "lines": [ + { + "bbox": [ + 114, + 212, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 114, + 212, + 505, + 225 + ], + "score": 1.0, + "content": "We firstly try to find the 3D point which is near the surface according to the predicted volume", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 114, + 224, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 114, + 224, + 505, + 238 + ], + "score": 1.0, + "content": "density for points along the ray through a given pixel, if they exist. Otherwise, we ignore such", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 114, + 237, + 225, + 249 + ], + "spans": [ + { + "bbox": [ + 114, + 237, + 225, + 249 + ], + "score": 1.0, + "content": "pixels, making them white.", + "type": "text" + } + ], + "index": 11, + "is_list_end_line": true + }, + { + "bbox": [ + 114, + 249, + 470, + 262 + ], + "spans": [ + { + "bbox": [ + 114, + 249, + 470, + 262 + ], + "score": 1.0, + "content": "Then we compute the M feature vectors from the input M views for these surface points.", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 261, + 505, + 273 + ], + "spans": [ + { + "bbox": [ + 114, + 261, + 505, + 273 + ], + "score": 1.0, + "content": "Thirdly, the attention masks for those M feature vectors are computed. We identify the view whose", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 114, + 271, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 114, + 271, + 506, + 288 + ], + "score": 1.0, + "content": "sum of the attention mask along the feature axis is greatest as the main contributor for inferring", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 114, + 285, + 201, + 298 + ], + "spans": [ + { + "bbox": [ + 114, + 285, + 201, + 298 + ], + "score": 1.0, + "content": "the novel pixel RGB.", + "type": "text" + } + ], + "index": 15, + "is_list_end_line": true + }, + { + "bbox": [ + 114, + 298, + 506, + 311 + ], + "spans": [ + { + "bbox": [ + 114, + 298, + 506, + 311 + ], + "score": 1.0, + "content": "After querying light rays for each pixel, we obtain a rendered RGB image. At the same time, for", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 310, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 114, + 310, + 505, + 322 + ], + "score": 1.0, + "content": "each pixel of that image, we select the most important view from the M input views for the surface-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 114, + 322, + 505, + 335 + ], + "spans": [ + { + "bbox": [ + 114, + 322, + 505, + 335 + ], + "score": 1.0, + "content": "intersection point along the ray from the viewpoint through that pixel, according to the maximal", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 114, + 334, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 114, + 334, + 505, + 348 + ], + "score": 1.0, + "content": "attention score. Eventually, we obtain a Max Attention Map corresponding to the rendered RGB", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 114, + 346, + 147, + 361 + ], + "spans": [ + { + "bbox": [ + 114, + 346, + 147, + 361 + ], + "score": 1.0, + "content": "image.", + "type": "text" + } + ], + "index": 20, + "is_list_end_line": true + } + ], + "index": 14.5, + "bbox_fs": [ + 114, + 212, + 506, + 361 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 365, + 505, + 426 + ], + "lines": [ + { + "bbox": [ + 105, + 363, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 506, + 378 + ], + "score": 1.0, + "content": "Figure 7 shows the qualitative results of the above experiment. In particular, we feed the three im-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 376, + 506, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 506, + 390 + ], + "score": 1.0, + "content": "ages (#1,#2,#3) of an unseen car into our GRF model which is well-trained on car category, and", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 388, + 505, + 402 + ], + "spans": [ + { + "bbox": [ + 106, + 388, + 505, + 402 + ], + "score": 1.0, + "content": "then render a new image (e.g., the 5th image in Figure 7). Note that, we carefully select the input 3", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 401, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 401, + 505, + 415 + ], + "score": 1.0, + "content": "images and the rendered image with very large viewing baselines. In the mean time, we obtain and", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 412, + 392, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 412, + 392, + 428 + ], + "score": 1.0, + "content": "visualize the Max Attention Map corresponding to the rendered image.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 363, + 506, + 428 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 432, + 505, + 469 + ], + "lines": [ + { + "bbox": [ + 106, + 432, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 106, + 432, + 505, + 444 + ], + "score": 1.0, + "content": "For each pixel of the rendered image, we retrieve the input image pixel that has the highest attention", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 443, + 506, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 443, + 506, + 458 + ], + "score": 1.0, + "content": "score. Specifically, the rendered pixels with purple color correspond to the input image #1, the green", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 456, + 491, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 456, + 491, + 469 + ], + "score": 1.0, + "content": "pixels correspond to the input image #2, while the blue pixels correspond to the input image #3.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 432, + 506, + 469 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 474, + 505, + 536 + ], + "lines": [ + { + "bbox": [ + 104, + 472, + 507, + 488 + ], + "spans": [ + { + "bbox": [ + 104, + 472, + 507, + 488 + ], + "score": 1.0, + "content": "Analysis. It can be seen that, when inferring a new image, the attention module of our GRF focuses", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 486, + 506, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 506, + 500 + ], + "score": 1.0, + "content": "on the most informative pixel patch from the multiple input pixel patches. In addition, it is able", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 498, + 506, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 506, + 512 + ], + "score": 1.0, + "content": "to truly deal with the visual occlusion. For example, when inferring the windshield of the car, the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 510, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 510, + 506, + 525 + ], + "score": 1.0, + "content": "attention module focuses on the input image #2 where the windshield is visible, while ignoring the", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 522, + 331, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 331, + 537 + ], + "score": 1.0, + "content": "image #1 and #3 where the windshield is self-occluded.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31, + "bbox_fs": [ + 104, + 472, + 507, + 537 + ] + }, + { + "type": "image", + "bbox": [ + 106, + 548, + 505, + 625 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 106, + 548, + 505, + 625 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 548, + 505, + 625 + ], + "spans": [ + { + "bbox": [ + 106, + 548, + 505, + 625 + ], + "score": 0.956, + "type": "image", + "image_path": "20f93eecb76196ee8f164adc09b398e9f5dbb82c10a34c1453af75819e8f5736.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 106, + 548, + 505, + 573.6666666666666 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 106, + 573.6666666666666, + 505, + 599.3333333333333 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 106, + 599.3333333333333, + 505, + 624.9999999999999 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 633, + 504, + 659 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 632, + 505, + 647 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 647 + ], + "score": 1.0, + "content": "Figure 7: Visualization of Max Attention Map from Multiple Input Images of a Novel Object for", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 644, + 203, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 203, + 660 + ], + "score": 1.0, + "content": "Inferring a Novel View.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5 + } + ], + "index": 36.25 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 453, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 455, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 455, + 95 + ], + "score": 1.0, + "content": "A.5 GENERALIZATION TO VISUAL OCCLUSIONS AND VARIABLE INPUT IMAGES", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 102, + 504, + 151 + ], + "lines": [ + { + "bbox": [ + 105, + 102, + 506, + 116 + ], + "spans": [ + { + "bbox": [ + 105, + 102, + 506, + 116 + ], + "score": 1.0, + "content": "We carefully select the attention module, i.e., either AttSets or SlotAtt, to aggregate the features", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 114, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 506, + 128 + ], + "score": 1.0, + "content": "from an arbitrary number of input views. In order to evaluate how our GRF is able to generalize", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 126, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 140 + ], + "score": 1.0, + "content": "with a variable number of input views, especially when there is a very sparse number of views with", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 139, + 424, + 152 + ], + "spans": [ + { + "bbox": [ + 106, + 139, + 424, + 152 + ], + "score": 1.0, + "content": "severe visual occlusions, we conduct the following four groups of experiments.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 157, + 505, + 206 + ], + "lines": [ + { + "bbox": [ + 104, + 156, + 506, + 170 + ], + "spans": [ + { + "bbox": [ + 104, + 156, + 506, + 170 + ], + "score": 1.0, + "content": "• 1-view Reconstruction. We feed the a single image of a novel car into our GRF model which", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 113, + 168, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 113, + 168, + 505, + 183 + ], + "score": 1.0, + "content": "is well-trained on car category (trained with 5 images per object), and then render 9 new images", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 113, + 181, + 506, + 195 + ], + "spans": [ + { + "bbox": [ + 113, + 181, + 506, + 195 + ], + "score": 1.0, + "content": "from vastly different viewing angles. This is the extreme case where the majority of the object is", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 114, + 194, + 174, + 207 + ], + "spans": [ + { + "bbox": [ + 114, + 194, + 174, + 207 + ], + "score": 1.0, + "content": "self-occluded.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 110, + 207, + 504, + 242 + ], + "lines": [ + { + "bbox": [ + 106, + 204, + 505, + 220 + ], + "spans": [ + { + "bbox": [ + 106, + 204, + 505, + 220 + ], + "score": 1.0, + "content": "• 2-view Reconstruction. Similarly, we feed only two images of the novel car into the same model", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 114, + 218, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 114, + 218, + 505, + 232 + ], + "score": 1.0, + "content": "and render the same 9 novel views. In this case, more information is given to the network, but", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 230, + 257, + 244 + ], + "spans": [ + { + "bbox": [ + 115, + 230, + 257, + 244 + ], + "score": 1.0, + "content": "there are still many parts occluded.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 109, + 243, + 502, + 268 + ], + "lines": [ + { + "bbox": [ + 106, + 241, + 504, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 504, + 256 + ], + "score": 1.0, + "content": "• 5-view / 10-view Reconstruction. The same GRF model is fed with 5 and 10 views of the novel", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 113, + 254, + 299, + 270 + ], + "spans": [ + { + "bbox": [ + 113, + 254, + 299, + 270 + ], + "score": 1.0, + "content": "object, rendering the same set of new images.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 106, + 273, + 505, + 359 + ], + "lines": [ + { + "bbox": [ + 105, + 272, + 505, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 505, + 287 + ], + "score": 1.0, + "content": "Analysis. Figure 8 shows the qualitative results. It can be seen that: 1) In the extreme case, i.e.,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 284, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 505, + 299 + ], + "score": 1.0, + "content": "1-view reconstruction, our GRF is still able to recover the general 3D shape of the unseen object,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 297, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 297, + 505, + 311 + ], + "score": 1.0, + "content": "including the visually occluded parts, primarily because our CNN model learns the hierarchical fea-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 310, + 506, + 322 + ], + "spans": [ + { + "bbox": [ + 106, + 310, + 506, + 322 + ], + "score": 1.0, + "content": "tures including the high-level shapes. 2) Given more input views, the originally occluded parts tend", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 323, + 505, + 335 + ], + "spans": [ + { + "bbox": [ + 106, + 323, + 505, + 335 + ], + "score": 1.0, + "content": "to be observed from some viewing angles, and then these parts can be reconstructed better and bet-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 334, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 106, + 334, + 505, + 348 + ], + "score": 1.0, + "content": "ter. This shows that our GRF is indeed able to effectively identify the corresponding useful pixel", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 346, + 358, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 346, + 358, + 360 + ], + "score": 1.0, + "content": "features for more accurately recovering shape and appearance.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17 + }, + { + "type": "image", + "bbox": [ + 126, + 373, + 486, + 682 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 126, + 373, + 486, + 682 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 126, + 373, + 486, + 682 + ], + "spans": [ + { + "bbox": [ + 126, + 373, + 486, + 682 + ], + "score": 0.973, + "type": "image", + "image_path": "452fb2908ba7c814b8da50727c0309cbd16427f8d4f7072fd5be8f665d791d99.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 126, + 373, + 486, + 476.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 126, + 476.0, + 486, + 579.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 126, + 579.0, + 486, + 682.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 689, + 505, + 727 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 688, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 703 + ], + "score": 1.0, + "content": "Figure 8: Qualitative results of our GRF when being fed with a variable number of views of a novel", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 700, + 506, + 717 + ], + "spans": [ + { + "bbox": [ + 104, + 700, + 506, + 717 + ], + "score": 1.0, + "content": "object. The red circle highlights that the tail of the car is able to be recovered given more visual cues", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 712, + 208, + 728 + ], + "spans": [ + { + "bbox": [ + 105, + 712, + 208, + 728 + ], + "score": 1.0, + "content": "from more input images.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + } + ], + "index": 23.5 + } + ], + "page_idx": 18, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "19", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 453, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 455, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 455, + 95 + ], + "score": 1.0, + "content": "A.5 GENERALIZATION TO VISUAL OCCLUSIONS AND VARIABLE INPUT IMAGES", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 82, + 455, + 95 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 102, + 504, + 151 + ], + "lines": [ + { + "bbox": [ + 105, + 102, + 506, + 116 + ], + "spans": [ + { + "bbox": [ + 105, + 102, + 506, + 116 + ], + "score": 1.0, + "content": "We carefully select the attention module, i.e., either AttSets or SlotAtt, to aggregate the features", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 114, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 506, + 128 + ], + "score": 1.0, + "content": "from an arbitrary number of input views. In order to evaluate how our GRF is able to generalize", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 126, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 140 + ], + "score": 1.0, + "content": "with a variable number of input views, especially when there is a very sparse number of views with", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 139, + 424, + 152 + ], + "spans": [ + { + "bbox": [ + 106, + 139, + 424, + 152 + ], + "score": 1.0, + "content": "severe visual occlusions, we conduct the following four groups of experiments.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 102, + 506, + 152 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 157, + 505, + 206 + ], + "lines": [ + { + "bbox": [ + 104, + 156, + 506, + 170 + ], + "spans": [ + { + "bbox": [ + 104, + 156, + 506, + 170 + ], + "score": 1.0, + "content": "• 1-view Reconstruction. We feed the a single image of a novel car into our GRF model which", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 113, + 168, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 113, + 168, + 505, + 183 + ], + "score": 1.0, + "content": "is well-trained on car category (trained with 5 images per object), and then render 9 new images", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 113, + 181, + 506, + 195 + ], + "spans": [ + { + "bbox": [ + 113, + 181, + 506, + 195 + ], + "score": 1.0, + "content": "from vastly different viewing angles. This is the extreme case where the majority of the object is", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 114, + 194, + 174, + 207 + ], + "spans": [ + { + "bbox": [ + 114, + 194, + 174, + 207 + ], + "score": 1.0, + "content": "self-occluded.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 6.5, + "bbox_fs": [ + 104, + 156, + 506, + 207 + ] + }, + { + "type": "text", + "bbox": [ + 110, + 207, + 504, + 242 + ], + "lines": [ + { + "bbox": [ + 106, + 204, + 505, + 220 + ], + "spans": [ + { + "bbox": [ + 106, + 204, + 505, + 220 + ], + "score": 1.0, + "content": "• 2-view Reconstruction. Similarly, we feed only two images of the novel car into the same model", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 114, + 218, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 114, + 218, + 505, + 232 + ], + "score": 1.0, + "content": "and render the same 9 novel views. In this case, more information is given to the network, but", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 230, + 257, + 244 + ], + "spans": [ + { + "bbox": [ + 115, + 230, + 257, + 244 + ], + "score": 1.0, + "content": "there are still many parts occluded.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10, + "bbox_fs": [ + 106, + 204, + 505, + 244 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 243, + 502, + 268 + ], + "lines": [ + { + "bbox": [ + 106, + 241, + 504, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 504, + 256 + ], + "score": 1.0, + "content": "• 5-view / 10-view Reconstruction. The same GRF model is fed with 5 and 10 views of the novel", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 113, + 254, + 299, + 270 + ], + "spans": [ + { + "bbox": [ + 113, + 254, + 299, + 270 + ], + "score": 1.0, + "content": "object, rendering the same set of new images.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 106, + 241, + 504, + 270 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 273, + 505, + 359 + ], + "lines": [ + { + "bbox": [ + 105, + 272, + 505, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 505, + 287 + ], + "score": 1.0, + "content": "Analysis. Figure 8 shows the qualitative results. It can be seen that: 1) In the extreme case, i.e.,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 284, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 505, + 299 + ], + "score": 1.0, + "content": "1-view reconstruction, our GRF is still able to recover the general 3D shape of the unseen object,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 297, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 297, + 505, + 311 + ], + "score": 1.0, + "content": "including the visually occluded parts, primarily because our CNN model learns the hierarchical fea-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 310, + 506, + 322 + ], + "spans": [ + { + "bbox": [ + 106, + 310, + 506, + 322 + ], + "score": 1.0, + "content": "tures including the high-level shapes. 2) Given more input views, the originally occluded parts tend", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 323, + 505, + 335 + ], + "spans": [ + { + "bbox": [ + 106, + 323, + 505, + 335 + ], + "score": 1.0, + "content": "to be observed from some viewing angles, and then these parts can be reconstructed better and bet-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 334, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 106, + 334, + 505, + 348 + ], + "score": 1.0, + "content": "ter. This shows that our GRF is indeed able to effectively identify the corresponding useful pixel", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 346, + 358, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 346, + 358, + 360 + ], + "score": 1.0, + "content": "features for more accurately recovering shape and appearance.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 272, + 506, + 360 + ] + }, + { + "type": "image", + "bbox": [ + 126, + 373, + 486, + 682 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 126, + 373, + 486, + 682 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 126, + 373, + 486, + 682 + ], + "spans": [ + { + "bbox": [ + 126, + 373, + 486, + 682 + ], + "score": 0.973, + "type": "image", + "image_path": "452fb2908ba7c814b8da50727c0309cbd16427f8d4f7072fd5be8f665d791d99.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 126, + 373, + 486, + 476.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 126, + 476.0, + 486, + 579.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 126, + 579.0, + 486, + 682.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 689, + 505, + 727 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 688, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 703 + ], + "score": 1.0, + "content": "Figure 8: Qualitative results of our GRF when being fed with a variable number of views of a novel", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 700, + 506, + 717 + ], + "spans": [ + { + "bbox": [ + 104, + 700, + 506, + 717 + ], + "score": 1.0, + "content": "object. The red circle highlights that the tail of the car is able to be recovered given more visual cues", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 712, + 208, + 728 + ], + "spans": [ + { + "bbox": [ + 105, + 712, + 208, + 728 + ], + "score": 1.0, + "content": "from more input images.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + } + ], + "index": 23.5 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 99, + 153, + 500, + 650 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 99, + 153, + 500, + 650 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 163, + 497, + 650 + ], + "spans": [ + { + "bbox": [ + 108, + 163, + 497, + 650 + ], + "score": 0.968, + "type": "image", + "image_path": "5e585a9c6f55e0f762c826bccc3ad70554c0e9a9023da31e86706efd23ce1569.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 99, + 153, + 500, + 318.66666666666663 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 99, + 318.66666666666663, + 500, + 484.33333333333326 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 99, + 484.33333333333326, + 500, + 649.9999999999999 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 109, + 651, + 498, + 663 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 649, + 501, + 665 + ], + "spans": [ + { + "bbox": [ + 110, + 649, + 501, + 665 + ], + "score": 1.0, + "content": "Figure 9: Qualitative results of SRNs and our GRF for 50-view reconstruction of chairs and cars.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + } + ], + "page_idx": 19, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 749, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 298, + 749, + 313, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 15 + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 108, + 82, + 263, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 263, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 263, + 95 + ], + "score": 1.0, + "content": "A.6 MORE QUALITATIVE RESULTS", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 99, + 153, + 500, + 650 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 99, + 153, + 500, + 650 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 163, + 497, + 650 + ], + "spans": [ + { + "bbox": [ + 108, + 163, + 497, + 650 + ], + "score": 0.968, + "type": "image", + "image_path": "5e585a9c6f55e0f762c826bccc3ad70554c0e9a9023da31e86706efd23ce1569.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 99, + 153, + 500, + 318.66666666666663 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 99, + 318.66666666666663, + 500, + 484.33333333333326 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 99, + 484.33333333333326, + 500, + 649.9999999999999 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 109, + 651, + 498, + 663 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 649, + 501, + 665 + ], + "spans": [ + { + "bbox": [ + 110, + 649, + 501, + 665 + ], + "score": 1.0, + "content": "Figure 9: Qualitative results of SRNs and our GRF for 50-view reconstruction of chairs and cars.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 168, + 492, + 614 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 168, + 492, + 614 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 168, + 492, + 614 + ], + "spans": [ + { + "bbox": [ + 109, + 168, + 492, + 614 + ], + "score": 0.972, + "type": "image", + "image_path": "720b1b3f0a109fae40aade5f250bbe18fc1e9ff6bc9faf69eda08923c27ddadc.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 168, + 492, + 316.66666666666663 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 316.66666666666663, + 492, + 465.33333333333326 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 465.33333333333326, + 492, + 613.9999999999999 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 620, + 504, + 644 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 619, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 505, + 634 + ], + "score": 1.0, + "content": "Figure 10: Qualitative results of our GRF for novel view depth and RGB estimation on the Synthetic-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 631, + 165, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 165, + 644 + ], + "score": 1.0, + "content": "NeRF dataset.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ], + "page_idx": 20, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 14 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 168, + 492, + 614 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 168, + 492, + 614 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 168, + 492, + 614 + ], + "spans": [ + { + "bbox": [ + 109, + 168, + 492, + 614 + ], + "score": 0.972, + "type": "image", + "image_path": "720b1b3f0a109fae40aade5f250bbe18fc1e9ff6bc9faf69eda08923c27ddadc.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 168, + 492, + 316.66666666666663 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 316.66666666666663, + 492, + 465.33333333333326 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 465.33333333333326, + 492, + 613.9999999999999 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 620, + 504, + 644 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 619, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 505, + 634 + ], + "score": 1.0, + "content": "Figure 10: Qualitative results of our GRF for novel view depth and RGB estimation on the Synthetic-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 631, + 165, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 165, + 644 + ], + "score": 1.0, + "content": "NeRF dataset.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 110, + 161, + 487, + 617 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 110, + 161, + 487, + 617 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 161, + 487, + 617 + ], + "spans": [ + { + "bbox": [ + 110, + 161, + 487, + 617 + ], + "score": 0.968, + "type": "image", + "image_path": "cadef3a36c5e380d2f99cc5b827f2e4ca75d2c8175fcc3a245639772f579210d.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 110, + 161, + 487, + 313.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 110, + 313.0, + 487, + 465.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 110, + 465.0, + 487, + 617.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 625, + 505, + 647 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 624, + 504, + 637 + ], + "spans": [ + { + "bbox": [ + 106, + 624, + 504, + 637 + ], + "score": 1.0, + "content": "Figure 11: Qualitative results of our GRF for novel view depth and RGB estimation on the Synthetic-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 635, + 165, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 635, + 165, + 648 + ], + "score": 1.0, + "content": "NeRF dataset.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ], + "page_idx": 21, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 313, + 765 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 313, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 15 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 110, + 161, + 487, + 617 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 110, + 161, + 487, + 617 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 161, + 487, + 617 + ], + "spans": [ + { + "bbox": [ + 110, + 161, + 487, + 617 + ], + "score": 0.968, + "type": "image", + "image_path": "cadef3a36c5e380d2f99cc5b827f2e4ca75d2c8175fcc3a245639772f579210d.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 110, + 161, + 487, + 313.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 110, + 313.0, + 487, + 465.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 110, + 465.0, + 487, + 617.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 625, + 505, + 647 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 624, + 504, + 637 + ], + "spans": [ + { + "bbox": [ + 106, + 624, + 504, + 637 + ], + "score": 1.0, + "content": "Figure 11: Qualitative results of our GRF for novel view depth and RGB estimation on the Synthetic-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 635, + 165, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 635, + 165, + 648 + ], + "score": 1.0, + "content": "NeRF dataset.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 168, + 502, + 619 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 168, + 502, + 619 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 168, + 502, + 619 + ], + "spans": [ + { + "bbox": [ + 109, + 168, + 502, + 619 + ], + "score": 0.974, + "type": "image", + "image_path": "453a93119d60769e89c2b0a65f9b43d42efc589faba79975733f9e58b7782c58.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 168, + 502, + 318.33333333333337 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 318.33333333333337, + 502, + 468.66666666666674 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 468.66666666666674, + 502, + 619.0000000000001 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 624, + 505, + 647 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 624, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 505, + 637 + ], + "score": 1.0, + "content": "Figure 12: Qualitative results of our GRF for novel view depth and RGB estimation on the Synthetic-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 635, + 166, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 166, + 648 + ], + "score": 1.0, + "content": "NeRF dataset.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ], + "page_idx": 22, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 15 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 168, + 502, + 619 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 168, + 502, + 619 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 168, + 502, + 619 + ], + "spans": [ + { + "bbox": [ + 109, + 168, + 502, + 619 + ], + "score": 0.974, + "type": "image", + "image_path": "453a93119d60769e89c2b0a65f9b43d42efc589faba79975733f9e58b7782c58.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 168, + 502, + 318.33333333333337 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 318.33333333333337, + 502, + 468.66666666666674 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 468.66666666666674, + 502, + 619.0000000000001 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 624, + 505, + 647 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 624, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 505, + 637 + ], + "score": 1.0, + "content": "Figure 12: Qualitative results of our GRF for novel view depth and RGB estimation on the Synthetic-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 635, + 166, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 166, + 648 + ], + "score": 1.0, + "content": "NeRF dataset.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 163, + 498, + 619 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 163, + 498, + 619 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 163, + 498, + 619 + ], + "spans": [ + { + "bbox": [ + 108, + 163, + 498, + 619 + ], + "score": 0.976, + "type": "image", + "image_path": "beeb4046890bf5004b0f81769e12fa68b175541b587410c51e428be01d998227.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 163, + 498, + 315.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 315.0, + 498, + 467.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 467.0, + 498, + 619.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 624, + 504, + 647 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 624, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 505, + 637 + ], + "score": 1.0, + "content": "Figure 13: Qualitative results of our GRF for novel view depth and RGB estimation on the Synthetic-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 635, + 165, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 165, + 648 + ], + "score": 1.0, + "content": "NeRF dataset.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ], + "page_idx": 23, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 313, + 765 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 313, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 15 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 163, + 498, + 619 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 163, + 498, + 619 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 163, + 498, + 619 + ], + "spans": [ + { + "bbox": [ + 108, + 163, + 498, + 619 + ], + "score": 0.976, + "type": "image", + "image_path": "beeb4046890bf5004b0f81769e12fa68b175541b587410c51e428be01d998227.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 163, + 498, + 315.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 315.0, + 498, + 467.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 467.0, + 498, + 619.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 624, + 504, + 647 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 624, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 505, + 637 + ], + "score": 1.0, + "content": "Figure 13: Qualitative results of our GRF for novel view depth and RGB estimation on the Synthetic-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 635, + 165, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 165, + 648 + ], + "score": 1.0, + "content": "NeRF dataset.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 192, + 502, + 587 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 192, + 502, + 587 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 192, + 502, + 587 + ], + "spans": [ + { + "bbox": [ + 109, + 192, + 502, + 587 + ], + "score": 0.975, + "type": "image", + "image_path": "f8157646fde3d77d5203c0f15aa9ddd82767ee191425ac2129cfeb332f153e56.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 192, + 502, + 323.66666666666663 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 323.66666666666663, + 502, + 455.33333333333326 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 455.33333333333326, + 502, + 586.9999999999999 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 104, + 595, + 505, + 618 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "score": 1.0, + "content": "Figure 14: Qualitative results of our GRF for novel view depth and RGB estimation on the real-world", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 605, + 141, + 620 + ], + "spans": [ + { + "bbox": [ + 104, + 605, + 141, + 620 + ], + "score": 1.0, + "content": "dataset.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ], + "page_idx": 24, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 749, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 298, + 749, + 313, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 15 + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 106, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 192, + 502, + 587 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 192, + 502, + 587 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 192, + 502, + 587 + ], + "spans": [ + { + "bbox": [ + 109, + 192, + 502, + 587 + ], + "score": 0.975, + "type": "image", + "image_path": "f8157646fde3d77d5203c0f15aa9ddd82767ee191425ac2129cfeb332f153e56.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 192, + 502, + 323.66666666666663 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 323.66666666666663, + 502, + 455.33333333333326 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 455.33333333333326, + 502, + 586.9999999999999 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 104, + 595, + 505, + 618 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "score": 1.0, + "content": "Figure 14: Qualitative results of our GRF for novel view depth and RGB estimation on the real-world", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 605, + 141, + 620 + ], + "spans": [ + { + "bbox": [ + 104, + 605, + 141, + 620 + ], + "score": 1.0, + "content": "dataset.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 191, + 502, + 588 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 191, + 502, + 588 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 191, + 502, + 588 + ], + "spans": [ + { + "bbox": [ + 108, + 191, + 502, + 588 + ], + "score": 0.975, + "type": "image", + "image_path": "88f1544d6d632c9c8a99ef63ec61bd9fd14e5db337eb9260544d7c69beee1ad9.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 191, + 502, + 323.33333333333337 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 323.33333333333337, + 502, + 455.66666666666674 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 455.66666666666674, + 502, + 588.0000000000001 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 103, + 596, + 505, + 619 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "score": 1.0, + "content": "Figure 15: Qualitative results of our GRF for novel view depth and RGB estimation on the real-world", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 607, + 140, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 140, + 619 + ], + "score": 1.0, + "content": "dataset.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ], + "page_idx": 25, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 313, + 763 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 313, + 763 + ], + "score": 1.0, + "content": "26", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 106, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 191, + 502, + 588 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 191, + 502, + 588 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 191, + 502, + 588 + ], + "spans": [ + { + "bbox": [ + 108, + 191, + 502, + 588 + ], + "score": 0.975, + "type": "image", + "image_path": "88f1544d6d632c9c8a99ef63ec61bd9fd14e5db337eb9260544d7c69beee1ad9.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 191, + 502, + 323.33333333333337 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 323.33333333333337, + 502, + 455.66666666666674 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 455.66666666666674, + 502, + 588.0000000000001 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 103, + 596, + 505, + 619 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "score": 1.0, + "content": "Figure 15: Qualitative results of our GRF for novel view depth and RGB estimation on the real-world", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 607, + 140, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 140, + 619 + ], + "score": 1.0, + "content": "dataset.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 191, + 502, + 588 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 191, + 502, + 588 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 191, + 502, + 588 + ], + "spans": [ + { + "bbox": [ + 108, + 191, + 502, + 588 + ], + "score": 0.975, + "type": "image", + "image_path": "caf80e9622eb47880990dde4703304c939c21246832958437a9bef0ab4ca34d0.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 191, + 502, + 323.33333333333337 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 323.33333333333337, + 502, + 455.66666666666674 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 455.66666666666674, + 502, + 588.0000000000001 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 102, + 597, + 505, + 621 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 597, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 505, + 610 + ], + "score": 1.0, + "content": "Figure 16: Qualitative results of our GRF for novel view depth and RGB estimation on the real-world", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 606, + 140, + 622 + ], + "spans": [ + { + "bbox": [ + 104, + 606, + 140, + 622 + ], + "score": 1.0, + "content": "dataset.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ], + "page_idx": 26, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 312, + 765 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 312, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 14 + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 106, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 191, + 502, + 588 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 191, + 502, + 588 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 191, + 502, + 588 + ], + "spans": [ + { + "bbox": [ + 108, + 191, + 502, + 588 + ], + "score": 0.975, + "type": "image", + "image_path": "caf80e9622eb47880990dde4703304c939c21246832958437a9bef0ab4ca34d0.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 191, + 502, + 323.33333333333337 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 323.33333333333337, + 502, + 455.66666666666674 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 455.66666666666674, + 502, + 588.0000000000001 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 102, + 597, + 505, + 621 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 597, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 505, + 610 + ], + "score": 1.0, + "content": "Figure 16: Qualitative results of our GRF for novel view depth and RGB estimation on the real-world", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 606, + 140, + 622 + ], + "spans": [ + { + "bbox": [ + 104, + 606, + 140, + 622 + ], + "score": 1.0, + "content": "dataset.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 190, + 502, + 588 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 190, + 502, + 588 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 190, + 502, + 588 + ], + "spans": [ + { + "bbox": [ + 109, + 190, + 502, + 588 + ], + "score": 0.975, + "type": "image", + "image_path": "e60781d9d56ccf57a254173588c4ff5552b76267158d5a3703af27473667497f.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 190, + 502, + 322.66666666666663 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 322.66666666666663, + 502, + 455.33333333333326 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 455.33333333333326, + 502, + 587.9999999999999 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 103, + 597, + 505, + 620 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 596, + 505, + 609 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 505, + 609 + ], + "score": 1.0, + "content": "Figure 17: Qualitative results of our GRF for novel view depth and RGB estimation on the real-world", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 607, + 140, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 140, + 621 + ], + "score": 1.0, + "content": "dataset.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ], + "page_idx": 27, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 313, + 763 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 313, + 763 + ], + "score": 1.0, + "content": "28", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 106, + 27, + 307, + 37 + ], + "lines": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 26, + 308, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 190, + 502, + 588 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 190, + 502, + 588 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 190, + 502, + 588 + ], + "spans": [ + { + "bbox": [ + 109, + 190, + 502, + 588 + ], + "score": 0.975, + "type": "image", + "image_path": "e60781d9d56ccf57a254173588c4ff5552b76267158d5a3703af27473667497f.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 190, + 502, + 322.66666666666663 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 322.66666666666663, + 502, + 455.33333333333326 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 455.33333333333326, + 502, + 587.9999999999999 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 103, + 597, + 505, + 620 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 596, + 505, + 609 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 505, + 609 + ], + "score": 1.0, + "content": "Figure 17: Qualitative results of our GRF for novel view depth and RGB estimation on the real-world", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 607, + 140, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 140, + 621 + ], + "score": 1.0, + "content": "dataset.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/cAvgPMAA3hb/cAvgPMAA3hb_model.json b/parse/train/cAvgPMAA3hb/cAvgPMAA3hb_model.json new file mode 100644 index 0000000000000000000000000000000000000000..f45ebcf0afb0c2bf6418e0fa402b374c14319420 --- /dev/null +++ b/parse/train/cAvgPMAA3hb/cAvgPMAA3hb_model.json @@ -0,0 +1,20065 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1511, + 1403, + 1511, + 1403, + 2035, + 297, + 2035 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 398, + 574, + 1302, + 574, + 1302, + 943, + 398, + 943 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 299, + 1082, + 1403, + 1082, + 1403, + 1266, + 299, + 1266 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1282, + 1403, + 1282, + 1403, + 1497, + 298, + 1497 + ], + "score": 0.98 + }, + { + "category_id": 0, + "poly": [ + 300, + 219, + 1399, + 219, + 1399, + 324, + 300, + 324 + ], + "score": 0.965 + }, + { + "category_id": 0, + "poly": [ + 302, + 1005, + 573, + 1005, + 573, + 1040, + 302, + 1040 + ], + "score": 0.893 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 104, + 298, + 104 + ], + "score": 0.888 + }, + { + "category_id": 0, + "poly": [ + 773, + 519, + 927, + 519, + 927, + 553, + 773, + 553 + ], + "score": 0.882 + }, + { + "category_id": 1, + "poly": [ + 314, + 377, + 681, + 377, + 681, + 438, + 314, + 438 + ], + "score": 0.756 + }, + { + "category_id": 2, + "poly": [ + 842, + 2089, + 857, + 2089, + 857, + 2112, + 842, + 2112 + ], + "score": 0.637 + }, + { + "category_id": 15, + "poly": [ + 295.0, + 216.0, + 1404.0, + 216.0, + 1404.0, + 272.0, + 295.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 274.0, + 1258.0, + 274.0, + 1258.0, + 329.0, + 294.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1002.0, + 579.0, + 1002.0, + 579.0, + 1049.0, + 294.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 857.0, + 72.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 518.0, + 932.0, + 518.0, + 932.0, + 556.0, + 770.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 841.0, + 2088.0, + 860.0, + 2088.0, + 860.0, + 2118.0, + 841.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1510.0, + 1403.0, + 1510.0, + 1403.0, + 1546.0, + 292.0, + 1546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1543.0, + 1398.0, + 1543.0, + 1398.0, + 1578.0, + 293.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1573.0, + 1403.0, + 1573.0, + 1403.0, + 1607.0, + 293.0, + 1607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1602.0, + 1405.0, + 1602.0, + 1405.0, + 1638.0, + 294.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1632.0, + 1404.0, + 1632.0, + 1404.0, + 1672.0, + 295.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1668.0, + 1404.0, + 1668.0, + 1404.0, + 1702.0, + 295.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1699.0, + 1405.0, + 1699.0, + 1405.0, + 1732.0, + 291.0, + 1732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1729.0, + 1405.0, + 1729.0, + 1405.0, + 1763.0, + 295.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1760.0, + 1405.0, + 1760.0, + 1405.0, + 1794.0, + 295.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1791.0, + 1404.0, + 1791.0, + 1404.0, + 1822.0, + 295.0, + 1822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1818.0, + 1406.0, + 1818.0, + 1406.0, + 1855.0, + 291.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1850.0, + 1405.0, + 1850.0, + 1405.0, + 1883.0, + 293.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1881.0, + 1405.0, + 1881.0, + 1405.0, + 1913.0, + 292.0, + 1913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1912.0, + 1405.0, + 1912.0, + 1405.0, + 1945.0, + 293.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1977.0, + 295.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1973.0, + 1405.0, + 1973.0, + 1405.0, + 2007.0, + 295.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2003.0, + 1084.0, + 2003.0, + 1084.0, + 2036.0, + 293.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 574.0, + 1304.0, + 574.0, + 1304.0, + 609.0, + 396.0, + 609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 604.0, + 1306.0, + 604.0, + 1306.0, + 639.0, + 393.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 636.0, + 1306.0, + 636.0, + 1306.0, + 668.0, + 394.0, + 668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 664.0, + 1306.0, + 664.0, + 1306.0, + 701.0, + 393.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 696.0, + 1306.0, + 696.0, + 1306.0, + 733.0, + 392.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 727.0, + 1305.0, + 727.0, + 1305.0, + 763.0, + 393.0, + 763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 760.0, + 1306.0, + 760.0, + 1306.0, + 792.0, + 394.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 787.0, + 1305.0, + 787.0, + 1305.0, + 821.0, + 394.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 822.0, + 1306.0, + 822.0, + 1306.0, + 856.0, + 395.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 851.0, + 1305.0, + 851.0, + 1305.0, + 885.0, + 393.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 883.0, + 1305.0, + 883.0, + 1305.0, + 918.0, + 393.0, + 918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 913.0, + 1150.0, + 913.0, + 1150.0, + 946.0, + 395.0, + 946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1079.0, + 1407.0, + 1079.0, + 1407.0, + 1122.0, + 292.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1112.0, + 1405.0, + 1112.0, + 1405.0, + 1150.0, + 292.0, + 1150.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1145.0, + 1404.0, + 1145.0, + 1404.0, + 1180.0, + 294.0, + 1180.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1174.0, + 1405.0, + 1174.0, + 1405.0, + 1210.0, + 294.0, + 1210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1206.0, + 1407.0, + 1206.0, + 1407.0, + 1241.0, + 295.0, + 1241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1236.0, + 1137.0, + 1236.0, + 1137.0, + 1272.0, + 295.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1279.0, + 1404.0, + 1279.0, + 1404.0, + 1319.0, + 293.0, + 1319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1309.0, + 1404.0, + 1309.0, + 1404.0, + 1351.0, + 292.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1344.0, + 1404.0, + 1344.0, + 1404.0, + 1378.0, + 294.0, + 1378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1375.0, + 1405.0, + 1375.0, + 1405.0, + 1409.0, + 292.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1402.0, + 1407.0, + 1402.0, + 1407.0, + 1441.0, + 291.0, + 1441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1434.0, + 1404.0, + 1434.0, + 1404.0, + 1468.0, + 294.0, + 1468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1466.0, + 1231.0, + 1466.0, + 1231.0, + 1500.0, + 294.0, + 1500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 378.0, + 560.0, + 378.0, + 560.0, + 411.0, + 315.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 407.0, + 682.0, + 407.0, + 682.0, + 440.0, + 311.0, + 440.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 783, + 1404, + 783, + 1404, + 1088, + 297, + 1088 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 1697, + 1405, + 1697, + 1405, + 2034, + 297, + 2034 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 1437, + 1404, + 1437, + 1404, + 1682, + 297, + 1682 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 229, + 1404, + 229, + 1404, + 514, + 297, + 514 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 526, + 1404, + 526, + 1404, + 768, + 297, + 768 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 297, + 1102, + 1404, + 1102, + 1404, + 1305, + 297, + 1305 + ], + "score": 0.945 + }, + { + "category_id": 0, + "poly": [ + 300, + 1361, + 587, + 1361, + 587, + 1396, + 300, + 1396 + ], + "score": 0.906 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.712 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 852, + 76, + 852, + 104, + 300, + 104 + ], + "score": 0.584 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 854, + 76, + 854, + 104, + 299, + 104 + ], + "score": 0.468 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.151 + }, + { + "category_id": 13, + "poly": [ + 863, + 329, + 922, + 329, + 922, + 362, + 863, + 362 + ], + "score": 0.41, + "latex": "x y z )" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1358.0, + 593.0, + 1358.0, + 593.0, + 1402.0, + 292.0, + 1402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2120.0, + 839.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2120.0, + 838.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 782.0, + 1404.0, + 782.0, + 1404.0, + 818.0, + 295.0, + 818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 813.0, + 1404.0, + 813.0, + 1404.0, + 848.0, + 292.0, + 848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 843.0, + 1405.0, + 843.0, + 1405.0, + 879.0, + 294.0, + 879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 873.0, + 1404.0, + 873.0, + 1404.0, + 909.0, + 294.0, + 909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 905.0, + 1405.0, + 905.0, + 1405.0, + 941.0, + 294.0, + 941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 934.0, + 1404.0, + 934.0, + 1404.0, + 970.0, + 294.0, + 970.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 963.0, + 1404.0, + 963.0, + 1404.0, + 1000.0, + 292.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 995.0, + 1405.0, + 995.0, + 1405.0, + 1030.0, + 294.0, + 1030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1027.0, + 1405.0, + 1027.0, + 1405.0, + 1063.0, + 291.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1057.0, + 975.0, + 1057.0, + 975.0, + 1092.0, + 294.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1698.0, + 1403.0, + 1698.0, + 1403.0, + 1733.0, + 296.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1728.0, + 1406.0, + 1728.0, + 1406.0, + 1765.0, + 292.0, + 1765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1758.0, + 1406.0, + 1758.0, + 1406.0, + 1795.0, + 292.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1791.0, + 1403.0, + 1791.0, + 1403.0, + 1822.0, + 295.0, + 1822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1818.0, + 1403.0, + 1818.0, + 1403.0, + 1853.0, + 294.0, + 1853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1849.0, + 1405.0, + 1849.0, + 1405.0, + 1884.0, + 292.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1882.0, + 1406.0, + 1882.0, + 1406.0, + 1915.0, + 294.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1911.0, + 1405.0, + 1911.0, + 1405.0, + 1946.0, + 294.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1940.0, + 1406.0, + 1940.0, + 1406.0, + 1981.0, + 292.0, + 1981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1972.0, + 1405.0, + 1972.0, + 1405.0, + 2008.0, + 294.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2002.0, + 1403.0, + 2002.0, + 1403.0, + 2037.0, + 295.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1435.0, + 1405.0, + 1435.0, + 1405.0, + 1474.0, + 294.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1468.0, + 1404.0, + 1468.0, + 1404.0, + 1502.0, + 295.0, + 1502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1500.0, + 1404.0, + 1500.0, + 1404.0, + 1533.0, + 295.0, + 1533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1530.0, + 1405.0, + 1530.0, + 1405.0, + 1563.0, + 295.0, + 1563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1559.0, + 1404.0, + 1559.0, + 1404.0, + 1594.0, + 295.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1589.0, + 1406.0, + 1589.0, + 1406.0, + 1625.0, + 292.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1621.0, + 1405.0, + 1621.0, + 1405.0, + 1654.0, + 294.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1652.0, + 546.0, + 1652.0, + 546.0, + 1685.0, + 293.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 228.0, + 1405.0, + 228.0, + 1405.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 261.0, + 1405.0, + 261.0, + 1405.0, + 295.0, + 295.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 293.0, + 1407.0, + 293.0, + 1407.0, + 331.0, + 296.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 327.0, + 862.0, + 327.0, + 862.0, + 364.0, + 294.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 327.0, + 1405.0, + 327.0, + 1405.0, + 364.0, + 923.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 358.0, + 1407.0, + 358.0, + 1407.0, + 396.0, + 294.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 386.0, + 1405.0, + 386.0, + 1405.0, + 426.0, + 292.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 417.0, + 1404.0, + 417.0, + 1404.0, + 457.0, + 292.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 450.0, + 1406.0, + 450.0, + 1406.0, + 485.0, + 292.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 481.0, + 950.0, + 481.0, + 950.0, + 517.0, + 292.0, + 517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 524.0, + 1347.0, + 524.0, + 1347.0, + 566.0, + 292.0, + 566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 561.0, + 1406.0, + 561.0, + 1406.0, + 606.0, + 291.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 596.0, + 568.0, + 596.0, + 568.0, + 635.0, + 315.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 630.0, + 1405.0, + 630.0, + 1405.0, + 675.0, + 294.0, + 675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 666.0, + 736.0, + 666.0, + 736.0, + 703.0, + 315.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 700.0, + 1405.0, + 700.0, + 1405.0, + 745.0, + 294.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 735.0, + 975.0, + 735.0, + 975.0, + 773.0, + 316.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1099.0, + 1406.0, + 1099.0, + 1406.0, + 1138.0, + 294.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 1132.0, + 1399.0, + 1132.0, + 1399.0, + 1169.0, + 314.0, + 1169.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1168.0, + 1405.0, + 1168.0, + 1405.0, + 1207.0, + 292.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1201.0, + 1396.0, + 1201.0, + 1396.0, + 1240.0, + 307.0, + 1240.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1239.0, + 1405.0, + 1239.0, + 1405.0, + 1277.0, + 291.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1275.0, + 1104.0, + 1275.0, + 1104.0, + 1304.0, + 319.0, + 1304.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 307, + 1404, + 307, + 1404, + 741, + 297, + 741 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 297, + 985, + 1404, + 985, + 1404, + 1262, + 297, + 1262 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1444, + 1403, + 1444, + 1403, + 1629, + 297, + 1629 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 756, + 1404, + 756, + 1404, + 973, + 297, + 973 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 1807, + 1403, + 1807, + 1403, + 2036, + 297, + 2036 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 300, + 1703, + 1404, + 1703, + 1404, + 1794, + 300, + 1794 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 294, + 229, + 1400, + 229, + 1400, + 293, + 294, + 293 + ], + "score": 0.956 + }, + { + "category_id": 8, + "poly": [ + 328, + 1636, + 1323, + 1636, + 1323, + 1698, + 328, + 1698 + ], + "score": 0.914 + }, + { + "category_id": 0, + "poly": [ + 300, + 1311, + 421, + 1311, + 421, + 1347, + 300, + 1347 + ], + "score": 0.905 + }, + { + "category_id": 0, + "poly": [ + 299, + 1385, + 497, + 1385, + 497, + 1417, + 299, + 1417 + ], + "score": 0.902 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1653, + 1399, + 1653, + 1399, + 1682, + 1366, + 1682 + ], + "score": 0.834 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.636 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 854, + 76, + 854, + 104, + 299, + 104 + ], + "score": 0.622 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 852, + 76, + 852, + 104, + 300, + 104 + ], + "score": 0.496 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.394 + }, + { + "category_id": 13, + "poly": [ + 297, + 1567, + 503, + 1567, + 503, + 1604, + 297, + 1604 + ], + "score": 0.92, + "latex": "\\mathcal { V } _ { p } = \\{ x _ { p } ^ { v } , y _ { p } ^ { v } , z _ { p } ^ { v } \\}" + }, + { + "category_id": 14, + "poly": [ + 337, + 1630, + 1324, + 1630, + 1324, + 1706, + 337, + 1706 + ], + "score": 0.9, + "latex": "( r _ { p } , g _ { p } , b _ { p } , d _ { p } ) = f _ { \\mathbf { W } } \\left( \\Big \\{ ( \\mathcal { T } _ { 1 } , \\pmb { \\xi } _ { 1 } , K _ { 1 } ) \\cdot \\cdot \\cdot ( \\mathcal { T } _ { M } , \\pmb { \\xi } _ { M } , K _ { M } ) \\Big \\} , \\{ x _ { p } , y _ { p } , z _ { p } \\} , \\{ x _ { p } ^ { v } , y _ { p } ^ { v } , z _ { p } ^ { v } \\} \\right)" + }, + { + "category_id": 13, + "poly": [ + 674, + 1506, + 1278, + 1506, + 1278, + 1541, + 674, + 1541 + ], + "score": 0.9, + "latex": "\\{ ( \\mathcal { T } _ { 1 } , \\pmb { \\xi } _ { 1 } , \\pmb { K } _ { 1 } ) \\cdot \\cdot \\cdot ( \\mathcal { T } _ { m } , \\pmb { \\xi } _ { m } , \\pmb { K } _ { m } ) \\cdot \\cdot \\cdot ( \\mathcal { T } _ { M } , \\pmb { \\xi } _ { M } , \\pmb { K } _ { M } ) \\} _ { \\{ \\pmb { \\xi } _ { 1 } , \\pmb { \\xi } _ { 1 } , \\pmb { K } _ { 1 } \\} }" + }, + { + "category_id": 13, + "poly": [ + 972, + 1570, + 1101, + 1570, + 1101, + 1601, + 972, + 1601 + ], + "score": 0.89, + "latex": "\\{ r _ { p } , g _ { p } , b _ { p } \\}" + }, + { + "category_id": 13, + "poly": [ + 918, + 1538, + 1114, + 1538, + 1114, + 1570, + 918, + 1570 + ], + "score": 0.89, + "latex": "p = \\{ x _ { p } , y _ { p } , z _ { p } \\}" + }, + { + "category_id": 13, + "poly": [ + 298, + 1601, + 327, + 1601, + 327, + 1632, + 298, + 1632 + ], + "score": 0.87, + "latex": "d _ { p }" + }, + { + "category_id": 13, + "poly": [ + 994, + 1601, + 1025, + 1601, + 1025, + 1628, + 994, + 1628 + ], + "score": 0.87, + "latex": "\\gamma _ { p }" + }, + { + "category_id": 13, + "poly": [ + 1128, + 1477, + 1160, + 1477, + 1160, + 1503, + 1128, + 1503 + ], + "score": 0.82, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 933, + 1876, + 950, + 1876, + 950, + 1902, + 933, + 1902 + ], + "score": 0.81, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 937, + 1764, + 960, + 1764, + 960, + 1791, + 937, + 1791 + ], + "score": 0.81, + "latex": "\\nu" + }, + { + "category_id": 13, + "poly": [ + 692, + 1768, + 710, + 1768, + 710, + 1795, + 692, + 1795 + ], + "score": 0.81, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 552, + 1733, + 585, + 1733, + 585, + 1761, + 552, + 1761 + ], + "score": 0.81, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 581, + 1603, + 599, + 1603, + 599, + 1629, + 581, + 1629 + ], + "score": 0.8, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 1243, + 1845, + 1261, + 1845, + 1261, + 1873, + 1243, + 1873 + ], + "score": 0.75, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 298, + 1476, + 341, + 1476, + 341, + 1509, + 298, + 1509 + ], + "score": 0.62, + "latex": "f _ { \\mathbf { W } }" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1307.0, + 428.0, + 1307.0, + 428.0, + 1356.0, + 290.0, + 1356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1381.0, + 502.0, + 1381.0, + 502.0, + 1423.0, + 292.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 860.0, + 2085.0, + 860.0, + 2116.0, + 839.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 304.0, + 1405.0, + 304.0, + 1405.0, + 343.0, + 294.0, + 343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 338.0, + 1404.0, + 338.0, + 1404.0, + 373.0, + 292.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 367.0, + 1406.0, + 367.0, + 1406.0, + 402.0, + 292.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 399.0, + 1402.0, + 399.0, + 1402.0, + 432.0, + 295.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 428.0, + 1405.0, + 428.0, + 1405.0, + 462.0, + 295.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 460.0, + 1404.0, + 460.0, + 1404.0, + 496.0, + 295.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 491.0, + 1406.0, + 491.0, + 1406.0, + 524.0, + 292.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 521.0, + 1404.0, + 521.0, + 1404.0, + 554.0, + 296.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 548.0, + 1406.0, + 548.0, + 1406.0, + 586.0, + 292.0, + 586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 579.0, + 1405.0, + 579.0, + 1405.0, + 618.0, + 294.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 614.0, + 1404.0, + 614.0, + 1404.0, + 650.0, + 295.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 647.0, + 1400.0, + 647.0, + 1400.0, + 684.0, + 295.0, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 677.0, + 1406.0, + 677.0, + 1406.0, + 718.0, + 292.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 706.0, + 384.0, + 706.0, + 384.0, + 744.0, + 294.0, + 744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 986.0, + 1405.0, + 986.0, + 1405.0, + 1023.0, + 295.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1019.0, + 1405.0, + 1019.0, + 1405.0, + 1052.0, + 296.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1046.0, + 1405.0, + 1046.0, + 1405.0, + 1083.0, + 295.0, + 1083.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1075.0, + 1406.0, + 1075.0, + 1406.0, + 1114.0, + 294.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1110.0, + 1404.0, + 1110.0, + 1404.0, + 1143.0, + 295.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1137.0, + 1404.0, + 1137.0, + 1404.0, + 1175.0, + 294.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1169.0, + 1405.0, + 1169.0, + 1405.0, + 1206.0, + 294.0, + 1206.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1199.0, + 1406.0, + 1199.0, + 1406.0, + 1236.0, + 294.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1228.0, + 1270.0, + 1228.0, + 1270.0, + 1268.0, + 294.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1442.0, + 1405.0, + 1442.0, + 1405.0, + 1479.0, + 295.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 342.0, + 1474.0, + 1127.0, + 1474.0, + 1127.0, + 1510.0, + 342.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1161.0, + 1474.0, + 1405.0, + 1474.0, + 1405.0, + 1510.0, + 1161.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1503.0, + 673.0, + 1503.0, + 673.0, + 1545.0, + 291.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1279.0, + 1503.0, + 1409.0, + 1503.0, + 1409.0, + 1545.0, + 1279.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1535.0, + 917.0, + 1535.0, + 917.0, + 1573.0, + 288.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 1535.0, + 1406.0, + 1535.0, + 1406.0, + 1573.0, + 1115.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 286.0, + 1553.0, + 296.0, + 1553.0, + 296.0, + 1617.0, + 286.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 504.0, + 1553.0, + 971.0, + 1553.0, + 971.0, + 1617.0, + 504.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1102.0, + 1553.0, + 1412.0, + 1553.0, + 1412.0, + 1617.0, + 1102.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1594.0, + 297.0, + 1594.0, + 297.0, + 1633.0, + 290.0, + 1633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1594.0, + 580.0, + 1594.0, + 580.0, + 1633.0, + 328.0, + 1633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 1594.0, + 993.0, + 1594.0, + 993.0, + 1633.0, + 600.0, + 1633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1026.0, + 1594.0, + 1401.0, + 1594.0, + 1401.0, + 1633.0, + 1026.0, + 1633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 753.0, + 1406.0, + 753.0, + 1406.0, + 794.0, + 292.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 789.0, + 1406.0, + 789.0, + 1406.0, + 824.0, + 295.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 817.0, + 1406.0, + 817.0, + 1406.0, + 855.0, + 291.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 850.0, + 1405.0, + 850.0, + 1405.0, + 884.0, + 294.0, + 884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 879.0, + 1404.0, + 879.0, + 1404.0, + 913.0, + 292.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 910.0, + 1405.0, + 910.0, + 1405.0, + 945.0, + 295.0, + 945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 943.0, + 1402.0, + 943.0, + 1402.0, + 973.0, + 296.0, + 973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1803.0, + 1407.0, + 1803.0, + 1407.0, + 1847.0, + 292.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1839.0, + 1242.0, + 1839.0, + 1242.0, + 1875.0, + 295.0, + 1875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1262.0, + 1839.0, + 1405.0, + 1839.0, + 1405.0, + 1875.0, + 1262.0, + 1875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1869.0, + 932.0, + 1869.0, + 932.0, + 1905.0, + 295.0, + 1905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 951.0, + 1869.0, + 1408.0, + 1869.0, + 1408.0, + 1905.0, + 951.0, + 1905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1901.0, + 1405.0, + 1901.0, + 1405.0, + 1938.0, + 293.0, + 1938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1932.0, + 1408.0, + 1932.0, + 1408.0, + 1972.0, + 292.0, + 1972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1968.0, + 1405.0, + 1968.0, + 1405.0, + 2004.0, + 296.0, + 2004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2001.0, + 1404.0, + 2001.0, + 1404.0, + 2037.0, + 296.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1700.0, + 1405.0, + 1700.0, + 1405.0, + 1738.0, + 293.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1729.0, + 551.0, + 1729.0, + 551.0, + 1770.0, + 294.0, + 1770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 586.0, + 1729.0, + 1405.0, + 1729.0, + 1405.0, + 1770.0, + 586.0, + 1770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1762.0, + 691.0, + 1762.0, + 691.0, + 1797.0, + 295.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 711.0, + 1762.0, + 936.0, + 1762.0, + 936.0, + 1797.0, + 711.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 961.0, + 1762.0, + 1107.0, + 1762.0, + 1107.0, + 1797.0, + 961.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 225.0, + 1407.0, + 225.0, + 1407.0, + 267.0, + 291.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 257.0, + 1255.0, + 257.0, + 1255.0, + 297.0, + 293.0, + 297.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1698, + 1404, + 1698, + 1404, + 1976, + 297, + 1976 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 553, + 1406, + 553, + 1406, + 707, + 297, + 707 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 808, + 935, + 808, + 935, + 1115, + 298, + 1115 + ], + "score": 0.974 + }, + { + "category_id": 3, + "poly": [ + 966, + 821, + 1401, + 821, + 1401, + 1026, + 966, + 1026 + ], + "score": 0.966 + }, + { + "category_id": 1, + "poly": [ + 298, + 1504, + 1404, + 1504, + 1404, + 1598, + 298, + 1598 + ], + "score": 0.966 + }, + { + "category_id": 3, + "poly": [ + 576, + 222, + 1125, + 222, + 1125, + 488, + 576, + 488 + ], + "score": 0.962 + }, + { + "category_id": 1, + "poly": [ + 296, + 1190, + 1404, + 1190, + 1404, + 1490, + 296, + 1490 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 297, + 1116, + 1400, + 1116, + 1400, + 1176, + 297, + 1176 + ], + "score": 0.943 + }, + { + "category_id": 8, + "poly": [ + 596, + 1978, + 1099, + 1978, + 1099, + 2040, + 596, + 2040 + ], + "score": 0.937 + }, + { + "category_id": 4, + "poly": [ + 957, + 1037, + 1403, + 1037, + 1403, + 1092, + 957, + 1092 + ], + "score": 0.933 + }, + { + "category_id": 4, + "poly": [ + 522, + 491, + 1174, + 491, + 1174, + 523, + 522, + 523 + ], + "score": 0.925 + }, + { + "category_id": 0, + "poly": [ + 299, + 1639, + 888, + 1639, + 888, + 1671, + 299, + 1671 + ], + "score": 0.921 + }, + { + "category_id": 0, + "poly": [ + 298, + 749, + 971, + 749, + 971, + 781, + 298, + 781 + ], + "score": 0.892 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1992, + 1400, + 1992, + 1400, + 2021, + 1366, + 2021 + ], + "score": 0.867 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 854, + 75, + 854, + 104, + 297, + 104 + ], + "score": 0.867 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.783 + }, + { + "category_id": 13, + "poly": [ + 1029, + 1913, + 1082, + 1913, + 1082, + 1943, + 1029, + 1943 + ], + "score": 0.9, + "latex": "K _ { m }" + }, + { + "category_id": 13, + "poly": [ + 399, + 1913, + 439, + 1913, + 439, + 1944, + 399, + 1944 + ], + "score": 0.89, + "latex": "\\mathcal { I } _ { m }" + }, + { + "category_id": 14, + "poly": [ + 597, + 1977, + 1099, + 1977, + 1099, + 2036, + 597, + 2036 + ], + "score": 0.89, + "latex": "\\mathbf { F } _ { p } ^ { m } = \\mathcal { P } \\Big ( \\{ \\boldsymbol { \\mathcal { T } } _ { k } , \\boldsymbol { \\xi } _ { m } , K _ { m } \\} , \\{ x _ { p } , y _ { p } , z _ { p } \\} , \\mathbf { I } _ { m } \\Big )" + }, + { + "category_id": 13, + "poly": [ + 786, + 1913, + 826, + 1913, + 826, + 1947, + 786, + 1947 + ], + "score": 0.89, + "latex": "\\xi _ { m }" + }, + { + "category_id": 13, + "poly": [ + 392, + 1946, + 437, + 1946, + 437, + 1984, + 392, + 1984 + ], + "score": 0.86, + "latex": "\\mathbf { F } _ { p } ^ { m }" + }, + { + "category_id": 13, + "poly": [ + 1308, + 554, + 1352, + 554, + 1352, + 586, + 1308, + 586 + ], + "score": 0.77, + "latex": "f _ { \\mathbf { W } }" + }, + { + "category_id": 13, + "poly": [ + 1233, + 1888, + 1251, + 1888, + 1251, + 1914, + 1233, + 1914 + ], + "score": 0.76, + "latex": "p" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 839.0, + 1288.0, + 839.0, + 1288.0, + 864.0, + 1133.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 964.0, + 979.0, + 1113.0, + 979.0, + 1113.0, + 1009.0, + 964.0, + 1009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1292.0, + 985.0, + 1403.0, + 985.0, + 1403.0, + 1007.0, + 1292.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 977.0, + 1001.0, + 1097.0, + 1001.0, + 1097.0, + 1028.0, + 977.0, + 1028.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1298.0, + 1004.0, + 1397.0, + 1004.0, + 1397.0, + 1028.0, + 1298.0, + 1028.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1002.0, + 256.0, + 1016.0, + 256.0, + 1016.0, + 269.0, + 1002.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 978.0, + 282.0, + 986.0, + 282.0, + 986.0, + 293.0, + 978.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 966.0, + 294.0, + 975.0, + 294.0, + 975.0, + 304.0, + 966.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 332.0, + 837.0, + 332.0, + 837.0, + 367.0, + 646.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 337.0, + 916.0, + 337.0, + 916.0, + 356.0, + 899.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 365.0, + 828.0, + 365.0, + 828.0, + 373.0, + 820.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 844.0, + 363.0, + 963.0, + 363.0, + 963.0, + 397.0, + 844.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 375.0, + 1015.0, + 375.0, + 1015.0, + 384.0, + 1007.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 396.0, + 828.0, + 396.0, + 828.0, + 406.0, + 820.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 632.0, + 431.0, + 647.0, + 431.0, + 647.0, + 442.0, + 632.0, + 442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 435.0, + 1050.0, + 435.0, + 1050.0, + 464.0, + 771.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 613.0, + 461.0, + 781.0, + 461.0, + 781.0, + 492.0, + 613.0, + 492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 668.0, + 231.0, + 730.0, + 231.0, + 730.0, + 265.0, + 668.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 637.75, + 251.5, + 747.75, + 251.5, + 747.75, + 285.5, + 637.75, + 285.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 643.25, + 266.5, + 679.25, + 266.5, + 679.25, + 290.5, + 643.25, + 290.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 944.0, + 333.0, + 1126.0, + 333.0, + 1126.0, + 369.5, + 944.0, + 369.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1089.0, + 374.5, + 1108.0, + 374.5, + 1108.0, + 394.5, + 1089.0, + 394.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 377.0, + 669.0, + 377.0, + 669.0, + 411.0, + 583.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.25, + 401.5, + 694.25, + 401.5, + 694.25, + 431.5, + 568.25, + 431.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 609.0, + 432.5, + 636.0, + 432.5, + 636.0, + 449.5, + 609.0, + 449.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1034.0, + 1405.0, + 1034.0, + 1405.0, + 1067.0, + 955.0, + 1067.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 1062.0, + 1051.0, + 1062.0, + 1051.0, + 1094.0, + 956.0, + 1094.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 519.0, + 485.0, + 1172.0, + 485.0, + 1172.0, + 528.0, + 519.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1636.0, + 890.0, + 1636.0, + 890.0, + 1676.0, + 294.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 749.0, + 974.0, + 749.0, + 974.0, + 785.0, + 294.0, + 785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 856.0, + 72.0, + 856.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1698.0, + 1404.0, + 1698.0, + 1404.0, + 1731.0, + 297.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1731.0, + 1404.0, + 1731.0, + 1404.0, + 1763.0, + 296.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1760.0, + 1406.0, + 1760.0, + 1406.0, + 1794.0, + 293.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1787.0, + 1405.0, + 1787.0, + 1405.0, + 1827.0, + 294.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1820.0, + 1404.0, + 1820.0, + 1404.0, + 1858.0, + 294.0, + 1858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1850.0, + 1402.0, + 1850.0, + 1402.0, + 1883.0, + 295.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1880.0, + 1232.0, + 1880.0, + 1232.0, + 1917.0, + 295.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 1880.0, + 1405.0, + 1880.0, + 1405.0, + 1917.0, + 1252.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1907.0, + 398.0, + 1907.0, + 398.0, + 1950.0, + 291.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.0, + 1907.0, + 785.0, + 1907.0, + 785.0, + 1950.0, + 440.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 1907.0, + 1028.0, + 1907.0, + 1028.0, + 1950.0, + 827.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 1907.0, + 1406.0, + 1907.0, + 1406.0, + 1950.0, + 1083.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1943.0, + 391.0, + 1943.0, + 391.0, + 1981.0, + 295.0, + 1981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 438.0, + 1943.0, + 978.0, + 1943.0, + 978.0, + 1981.0, + 438.0, + 1981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 551.0, + 1307.0, + 551.0, + 1307.0, + 590.0, + 296.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1353.0, + 551.0, + 1406.0, + 551.0, + 1406.0, + 590.0, + 1353.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 582.0, + 1404.0, + 582.0, + 1404.0, + 619.0, + 294.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 609.0, + 1407.0, + 609.0, + 1407.0, + 653.0, + 292.0, + 653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 645.0, + 1406.0, + 645.0, + 1406.0, + 682.0, + 294.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 672.0, + 800.0, + 672.0, + 800.0, + 712.0, + 294.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 808.0, + 935.0, + 808.0, + 935.0, + 843.0, + 295.0, + 843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 840.0, + 937.0, + 840.0, + 937.0, + 873.0, + 295.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 871.0, + 938.0, + 871.0, + 938.0, + 904.0, + 295.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 900.0, + 936.0, + 900.0, + 936.0, + 934.0, + 295.0, + 934.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 933.0, + 936.0, + 933.0, + 936.0, + 963.0, + 296.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 962.0, + 938.0, + 962.0, + 938.0, + 997.0, + 293.0, + 997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 993.0, + 937.0, + 993.0, + 937.0, + 1026.0, + 294.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1022.0, + 937.0, + 1022.0, + 937.0, + 1055.0, + 295.0, + 1055.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1052.0, + 937.0, + 1052.0, + 937.0, + 1088.0, + 294.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1084.0, + 937.0, + 1084.0, + 937.0, + 1117.0, + 295.0, + 1117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1502.0, + 1405.0, + 1502.0, + 1405.0, + 1540.0, + 293.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1532.0, + 1405.0, + 1532.0, + 1405.0, + 1570.0, + 292.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1564.0, + 928.0, + 1564.0, + 928.0, + 1602.0, + 294.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1184.0, + 1405.0, + 1184.0, + 1405.0, + 1230.0, + 290.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1225.0, + 1406.0, + 1225.0, + 1406.0, + 1260.0, + 318.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 1255.0, + 1406.0, + 1255.0, + 1406.0, + 1296.0, + 315.0, + 1296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 1291.0, + 1406.0, + 1291.0, + 1406.0, + 1330.0, + 316.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1325.0, + 1326.0, + 1325.0, + 1326.0, + 1364.0, + 317.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 1362.0, + 1405.0, + 1362.0, + 1405.0, + 1400.0, + 299.0, + 1400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 1394.0, + 1406.0, + 1394.0, + 1406.0, + 1430.0, + 316.0, + 1430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 1424.0, + 1406.0, + 1424.0, + 1406.0, + 1460.0, + 316.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1457.0, + 1216.0, + 1457.0, + 1216.0, + 1493.0, + 318.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1114.0, + 1405.0, + 1114.0, + 1405.0, + 1147.0, + 293.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1145.0, + 1295.0, + 1145.0, + 1295.0, + 1180.0, + 296.0, + 1180.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1803, + 1403, + 1803, + 1403, + 2037, + 297, + 2037 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 297, + 228, + 1404, + 228, + 1404, + 385, + 297, + 385 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 297, + 399, + 1404, + 399, + 1404, + 585, + 297, + 585 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 297, + 1017, + 1405, + 1017, + 1405, + 1119, + 297, + 1119 + ], + "score": 0.942 + }, + { + "category_id": 1, + "poly": [ + 296, + 763, + 1403, + 763, + 1403, + 827, + 296, + 827 + ], + "score": 0.937 + }, + { + "category_id": 1, + "poly": [ + 298, + 1576, + 1403, + 1576, + 1403, + 1702, + 298, + 1702 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 290, + 840, + 1404, + 840, + 1404, + 1004, + 290, + 1004 + ], + "score": 0.916 + }, + { + "category_id": 1, + "poly": [ + 297, + 598, + 1401, + 598, + 1401, + 662, + 297, + 662 + ], + "score": 0.914 + }, + { + "category_id": 0, + "poly": [ + 300, + 1744, + 685, + 1744, + 685, + 1776, + 300, + 1776 + ], + "score": 0.908 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1527, + 1399, + 1527, + 1399, + 1556, + 1366, + 1556 + ], + "score": 0.847 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 104, + 298, + 104 + ], + "score": 0.815 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1247, + 1399, + 1247, + 1399, + 1276, + 1366, + 1276 + ], + "score": 0.802 + }, + { + "category_id": 0, + "poly": [ + 297, + 703, + 953, + 703, + 953, + 735, + 297, + 735 + ], + "score": 0.768 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.735 + }, + { + "category_id": 1, + "poly": [ + 294, + 1129, + 1405, + 1129, + 1405, + 1517, + 294, + 1517 + ], + "score": 0.534 + }, + { + "category_id": 8, + "poly": [ + 475, + 1519, + 1243, + 1519, + 1243, + 1562, + 475, + 1562 + ], + "score": 0.486 + }, + { + "category_id": 1, + "poly": [ + 475, + 1519, + 1243, + 1519, + 1243, + 1562, + 475, + 1562 + ], + "score": 0.259 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 852, + 76, + 852, + 104, + 300, + 104 + ], + "score": 0.252 + }, + { + "category_id": 1, + "poly": [ + 297, + 703, + 953, + 703, + 953, + 735, + 297, + 735 + ], + "score": 0.161 + }, + { + "category_id": 13, + "poly": [ + 968, + 1835, + 1098, + 1835, + 1098, + 1872, + 968, + 1872 + ], + "score": 0.93, + "latex": "\\{ r _ { p } , g _ { p } , b _ { p } \\}" + }, + { + "category_id": 13, + "poly": [ + 298, + 1080, + 530, + 1080, + 530, + 1122, + 298, + 1122 + ], + "score": 0.92, + "latex": "\\{ \\mathbf { F } _ { p } ^ { 1 } \\cdot \\cdot \\cdot \\mathbf { F } _ { p } ^ { m } \\cdot \\cdot \\cdot \\mathbf { F } _ { p } ^ { M } \\}" + }, + { + "category_id": 13, + "poly": [ + 847, + 1164, + 891, + 1164, + 891, + 1207, + 847, + 1207 + ], + "score": 0.91, + "latex": "\\hat { \\mathbf { F } } _ { p } ^ { m }" + }, + { + "category_id": 13, + "poly": [ + 692, + 1132, + 735, + 1132, + 735, + 1168, + 692, + 1168 + ], + "score": 0.9, + "latex": "\\mathbf { F } _ { p } ^ { m }" + }, + { + "category_id": 13, + "poly": [ + 1015, + 1637, + 1051, + 1637, + 1051, + 1673, + 1015, + 1673 + ], + "score": 0.9, + "latex": "\\bar { \\mathbf { F } } _ { p }" + }, + { + "category_id": 13, + "poly": [ + 908, + 1575, + 944, + 1575, + 944, + 1613, + 908, + 1613 + ], + "score": 0.9, + "latex": "\\bar { \\mathbf { F } } _ { p }" + }, + { + "category_id": 13, + "poly": [ + 938, + 1288, + 1169, + 1288, + 1169, + 1329, + 938, + 1329 + ], + "score": 0.9, + "latex": "\\{ \\hat { \\mathbf { F } } _ { p } ^ { 1 } \\cdot \\cdot \\cdot \\hat { \\mathbf { F } } _ { p } ^ { m } \\cdot \\cdot \\cdot \\hat { \\mathbf { F } } _ { p } ^ { M } \\}" + }, + { + "category_id": 13, + "poly": [ + 630, + 1933, + 666, + 1933, + 666, + 1970, + 630, + 1970 + ], + "score": 0.9, + "latex": "\\bar { \\mathbf { F } } _ { p }" + }, + { + "category_id": 13, + "poly": [ + 1312, + 323, + 1351, + 323, + 1351, + 353, + 1312, + 353 + ], + "score": 0.9, + "latex": "\\mathcal { T } _ { m }" + }, + { + "category_id": 13, + "poly": [ + 386, + 1837, + 416, + 1837, + 416, + 1869, + 386, + 1869 + ], + "score": 0.89, + "latex": "d _ { p }" + }, + { + "category_id": 13, + "poly": [ + 853, + 1352, + 889, + 1352, + 889, + 1389, + 853, + 1389 + ], + "score": 0.89, + "latex": "\\bar { \\mathbf { F } } _ { p }" + }, + { + "category_id": 13, + "poly": [ + 593, + 1802, + 630, + 1802, + 630, + 1839, + 593, + 1839 + ], + "score": 0.89, + "latex": "\\bar { \\mathbf { F } } _ { p }" + }, + { + "category_id": 13, + "poly": [ + 1113, + 1935, + 1144, + 1935, + 1144, + 1969, + 1113, + 1969 + ], + "score": 0.89, + "latex": "d _ { p }" + }, + { + "category_id": 13, + "poly": [ + 946, + 1050, + 978, + 1050, + 978, + 1084, + 946, + 1084 + ], + "score": 0.89, + "latex": "\\nu _ { p }" + }, + { + "category_id": 13, + "poly": [ + 513, + 230, + 559, + 230, + 559, + 264, + 513, + 264 + ], + "score": 0.89, + "latex": "\\mathcal { P } ( )" + }, + { + "category_id": 13, + "poly": [ + 344, + 262, + 381, + 262, + 381, + 293, + 344, + 293 + ], + "score": 0.88, + "latex": "{ \\mathbf I } _ { m }" + }, + { + "category_id": 14, + "poly": [ + 478, + 1518, + 1242, + 1518, + 1242, + 1565, + 478, + 1565 + ], + "score": 0.88, + "latex": "\\bar { \\mathbf { F } } _ { p } = \\mathcal { A } \\big ( \\hat { \\mathbf { F } } _ { p } ^ { 1 } \\cdot \\cdot \\cdot \\hat { \\mathbf { F } } _ { p } ^ { m } \\cdot \\cdot \\cdot \\hat { \\mathbf { F } } _ { p } ^ { M } \\big ) , \\quad \\mathrm { ( \\mathcal { A } ~ i s ~ a n ~ e x i s t i n g ~ a t t e n t i o n ~ f u n c t i o n ) }" + }, + { + "category_id": 13, + "poly": [ + 1182, + 1899, + 1214, + 1899, + 1214, + 1934, + 1182, + 1934 + ], + "score": 0.87, + "latex": "d _ { p }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1866, + 330, + 1866, + 330, + 1901, + 297, + 1901 + ], + "score": 0.87, + "latex": "\\nu _ { p }" + }, + { + "category_id": 13, + "poly": [ + 900, + 326, + 919, + 326, + 919, + 354, + 900, + 354 + ], + "score": 0.81, + "latex": "p" + }, + { + "category_id": 14, + "poly": [ + 429, + 1240, + 1291, + 1240, + 1291, + 1284, + 429, + 1284 + ], + "score": 0.8, + "latex": "\\hat { \\mathbf { F } } _ { p } ^ { m } = M L P s ( \\mathbf { F } _ { p } ^ { m } \\oplus [ x _ { p } , y _ { p } , z _ { p } ] ) , \\quad ( \\oplus \\mathrm { m e a n s ~ c o n c a t e n a t i o n ~ i n ~ n e u r a l ~ n e t s } )" + }, + { + "category_id": 13, + "poly": [ + 697, + 1584, + 715, + 1584, + 715, + 1610, + 697, + 1610 + ], + "score": 0.8, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 698, + 1055, + 715, + 1055, + 715, + 1082, + 698, + 1082 + ], + "score": 0.79, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 573, + 771, + 591, + 771, + 591, + 796, + 573, + 796 + ], + "score": 0.78, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 454, + 1207, + 472, + 1207, + 472, + 1232, + 454, + 1232 + ], + "score": 0.78, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 911, + 1812, + 929, + 1812, + 929, + 1837, + 911, + 1837 + ], + "score": 0.78, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 1353, + 1941, + 1372, + 1941, + 1372, + 1968, + 1353, + 1968 + ], + "score": 0.77, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 457, + 1176, + 474, + 1176, + 474, + 1201, + 457, + 1201 + ], + "score": 0.77, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 1148, + 1359, + 1166, + 1359, + 1166, + 1387, + 1148, + 1387 + ], + "score": 0.75, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 1274, + 800, + 1291, + 800, + 1291, + 827, + 1274, + 827 + ], + "score": 0.75, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 861, + 1249, + 885, + 1249, + 885, + 1275, + 861, + 1275 + ], + "score": 0.62, + "latex": "\\oplus" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1744.0, + 689.0, + 1744.0, + 689.0, + 1780.0, + 294.0, + 1780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 857.0, + 72.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 703.0, + 955.0, + 703.0, + 955.0, + 739.0, + 295.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 861.0, + 2085.0, + 861.0, + 2120.0, + 839.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1799.0, + 592.0, + 1799.0, + 592.0, + 1842.0, + 294.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 631.0, + 1799.0, + 910.0, + 1799.0, + 910.0, + 1842.0, + 631.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 930.0, + 1799.0, + 1407.0, + 1799.0, + 1407.0, + 1842.0, + 930.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1831.0, + 385.0, + 1831.0, + 385.0, + 1872.0, + 293.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 417.0, + 1831.0, + 967.0, + 1831.0, + 967.0, + 1872.0, + 417.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1099.0, + 1831.0, + 1407.0, + 1831.0, + 1407.0, + 1872.0, + 1099.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1863.0, + 296.0, + 1863.0, + 296.0, + 1903.0, + 293.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 1863.0, + 1405.0, + 1863.0, + 1405.0, + 1903.0, + 331.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1897.0, + 1181.0, + 1897.0, + 1181.0, + 1937.0, + 293.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1215.0, + 1897.0, + 1407.0, + 1897.0, + 1407.0, + 1937.0, + 1215.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1930.0, + 629.0, + 1930.0, + 629.0, + 1972.0, + 294.0, + 1972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 1930.0, + 1112.0, + 1930.0, + 1112.0, + 1972.0, + 667.0, + 1972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1145.0, + 1930.0, + 1352.0, + 1930.0, + 1352.0, + 1972.0, + 1145.0, + 1972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1373.0, + 1930.0, + 1405.0, + 1930.0, + 1405.0, + 1972.0, + 1373.0, + 1972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1968.0, + 1404.0, + 1968.0, + 1404.0, + 2002.0, + 295.0, + 2002.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1998.0, + 1405.0, + 1998.0, + 1405.0, + 2041.0, + 292.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 228.0, + 512.0, + 228.0, + 512.0, + 266.0, + 295.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 560.0, + 228.0, + 1405.0, + 228.0, + 1405.0, + 266.0, + 560.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 260.0, + 343.0, + 260.0, + 343.0, + 297.0, + 295.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 260.0, + 1405.0, + 260.0, + 1405.0, + 297.0, + 382.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 289.0, + 1405.0, + 289.0, + 1405.0, + 328.0, + 294.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 320.0, + 899.0, + 320.0, + 899.0, + 359.0, + 292.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 920.0, + 320.0, + 1311.0, + 320.0, + 1311.0, + 359.0, + 920.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 320.0, + 1406.0, + 320.0, + 1406.0, + 359.0, + 1352.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 352.0, + 966.0, + 352.0, + 966.0, + 388.0, + 293.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 396.0, + 1405.0, + 396.0, + 1405.0, + 435.0, + 292.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 431.0, + 1404.0, + 431.0, + 1404.0, + 463.0, + 317.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 461.0, + 1039.0, + 461.0, + 1039.0, + 493.0, + 315.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 487.0, + 1404.0, + 487.0, + 1404.0, + 528.0, + 295.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 519.0, + 1406.0, + 519.0, + 1406.0, + 557.0, + 315.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 552.0, + 1260.0, + 552.0, + 1260.0, + 588.0, + 319.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1015.0, + 1403.0, + 1015.0, + 1403.0, + 1053.0, + 294.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1048.0, + 697.0, + 1048.0, + 697.0, + 1086.0, + 291.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 1048.0, + 945.0, + 1048.0, + 945.0, + 1086.0, + 716.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 979.0, + 1048.0, + 1405.0, + 1048.0, + 1405.0, + 1086.0, + 979.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1074.0, + 297.0, + 1074.0, + 297.0, + 1127.0, + 292.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 531.0, + 1074.0, + 546.0, + 1074.0, + 546.0, + 1127.0, + 531.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 760.0, + 572.0, + 760.0, + 572.0, + 803.0, + 294.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 592.0, + 760.0, + 1405.0, + 760.0, + 1405.0, + 803.0, + 592.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 792.0, + 1273.0, + 792.0, + 1273.0, + 832.0, + 293.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1292.0, + 792.0, + 1405.0, + 792.0, + 1405.0, + 832.0, + 1292.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1577.0, + 696.0, + 1577.0, + 696.0, + 1614.0, + 296.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 1577.0, + 907.0, + 1577.0, + 907.0, + 1614.0, + 716.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 1577.0, + 1407.0, + 1577.0, + 1407.0, + 1614.0, + 945.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1608.0, + 1405.0, + 1608.0, + 1405.0, + 1641.0, + 293.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1640.0, + 1014.0, + 1640.0, + 1014.0, + 1673.0, + 294.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 1640.0, + 1403.0, + 1640.0, + 1403.0, + 1673.0, + 1052.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1670.0, + 720.0, + 1670.0, + 720.0, + 1705.0, + 293.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 838.0, + 1402.0, + 838.0, + 1402.0, + 877.0, + 293.0, + 877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 872.0, + 1321.0, + 872.0, + 1321.0, + 907.0, + 317.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 907.0, + 1406.0, + 907.0, + 1406.0, + 948.0, + 294.0, + 948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 940.0, + 1405.0, + 940.0, + 1405.0, + 976.0, + 317.0, + 976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 970.0, + 1386.0, + 970.0, + 1386.0, + 1007.0, + 317.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 594.0, + 1405.0, + 594.0, + 1405.0, + 635.0, + 295.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 629.0, + 1297.0, + 629.0, + 1297.0, + 663.0, + 293.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1122.0, + 691.0, + 1122.0, + 691.0, + 1174.0, + 288.0, + 1174.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 1122.0, + 1411.0, + 1122.0, + 1411.0, + 1174.0, + 736.0, + 1174.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 1164.0, + 456.0, + 1164.0, + 456.0, + 1205.0, + 316.0, + 1205.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 475.0, + 1164.0, + 846.0, + 1164.0, + 846.0, + 1205.0, + 475.0, + 1205.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 1164.0, + 1407.0, + 1164.0, + 1407.0, + 1205.0, + 892.0, + 1205.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1200.0, + 453.0, + 1200.0, + 453.0, + 1235.0, + 317.0, + 1235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 473.0, + 1200.0, + 772.0, + 1200.0, + 772.0, + 1235.0, + 473.0, + 1235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1233.0, + 428.0, + 1233.0, + 428.0, + 1291.0, + 423.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1292.0, + 1233.0, + 1296.0, + 1233.0, + 1296.0, + 1291.0, + 1292.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1360.0, + 1243.0, + 1407.0, + 1243.0, + 1407.0, + 1282.0, + 1360.0, + 1282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1280.0, + 937.0, + 1280.0, + 937.0, + 1334.0, + 288.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 1280.0, + 1410.0, + 1280.0, + 1410.0, + 1334.0, + 1170.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 1322.0, + 1405.0, + 1322.0, + 1405.0, + 1357.0, + 316.0, + 1357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1353.0, + 852.0, + 1353.0, + 852.0, + 1389.0, + 317.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 1353.0, + 1147.0, + 1353.0, + 1147.0, + 1389.0, + 890.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 1353.0, + 1403.0, + 1353.0, + 1403.0, + 1389.0, + 1167.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1384.0, + 1402.0, + 1384.0, + 1402.0, + 1420.0, + 317.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1415.0, + 1405.0, + 1415.0, + 1405.0, + 1450.0, + 320.0, + 1450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1450.0, + 1405.0, + 1450.0, + 1405.0, + 1482.0, + 321.0, + 1482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1481.0, + 1113.0, + 1481.0, + 1113.0, + 1512.0, + 318.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 470.0, + 1507.0, + 477.0, + 1507.0, + 477.0, + 1577.0, + 470.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1243.0, + 1507.0, + 1251.0, + 1507.0, + 1251.0, + 1577.0, + 1243.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 703.0, + 955.0, + 703.0, + 955.0, + 739.0, + 295.0, + 739.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1581, + 1404, + 1581, + 1404, + 2036, + 297, + 2036 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 601, + 1404, + 601, + 1404, + 828, + 297, + 828 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 319, + 1405, + 319, + 1405, + 508, + 297, + 508 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 998, + 1405, + 998, + 1405, + 1152, + 297, + 1152 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 298, + 1444, + 1404, + 1444, + 1404, + 1567, + 298, + 1567 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 297, + 1167, + 1405, + 1167, + 1405, + 1430, + 297, + 1430 + ], + "score": 0.961 + }, + { + "category_id": 0, + "poly": [ + 298, + 940, + 867, + 940, + 867, + 972, + 298, + 972 + ], + "score": 0.917 + }, + { + "category_id": 8, + "poly": [ + 462, + 263, + 1225, + 263, + 1225, + 314, + 462, + 314 + ], + "score": 0.914 + }, + { + "category_id": 1, + "poly": [ + 297, + 227, + 888, + 227, + 888, + 261, + 297, + 261 + ], + "score": 0.908 + }, + { + "category_id": 0, + "poly": [ + 300, + 545, + 582, + 545, + 582, + 576, + 300, + 576 + ], + "score": 0.9 + }, + { + "category_id": 0, + "poly": [ + 300, + 872, + 537, + 872, + 537, + 907, + 300, + 907 + ], + "score": 0.89 + }, + { + "category_id": 9, + "poly": [ + 1366, + 272, + 1400, + 272, + 1400, + 302, + 1366, + 302 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 858, + 2089, + 858, + 2112, + 840, + 2112 + ], + "score": 0.789 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.513 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 854, + 75, + 854, + 105, + 297, + 105 + ], + "score": 0.419 + }, + { + "category_id": 14, + "poly": [ + 469, + 260, + 1228, + 260, + 1228, + 317, + 469, + 317 + ], + "score": 0.9, + "latex": "d _ { p } = M L P s ( \\bar { \\mathbf { F } } _ { p } ) , \\qquad \\quad ( r _ { p } , g _ { p } , b _ { p } ) = M L P s \\Bigl ( \\bar { \\mathbf { F } } _ { p } , \\{ x _ { p } ^ { v } , y _ { p } ^ { v } , z _ { p } ^ { v } \\} \\Bigr )" + }, + { + "category_id": 13, + "poly": [ + 1294, + 1090, + 1402, + 1090, + 1402, + 1120, + 1294, + 1120 + ], + "score": 0.88, + "latex": "1 2 8 \\times 1 2 8" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 938.0, + 869.0, + 938.0, + 869.0, + 976.0, + 294.0, + 976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 545.0, + 584.0, + 545.0, + 584.0, + 578.0, + 296.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 869.0, + 542.0, + 869.0, + 542.0, + 914.0, + 293.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2087.0, + 861.0, + 2087.0, + 861.0, + 2118.0, + 840.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1577.0, + 1406.0, + 1577.0, + 1406.0, + 1620.0, + 292.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1612.0, + 1404.0, + 1612.0, + 1404.0, + 1646.0, + 295.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1640.0, + 1405.0, + 1640.0, + 1405.0, + 1676.0, + 295.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1672.0, + 1402.0, + 1672.0, + 1402.0, + 1708.0, + 292.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1703.0, + 1405.0, + 1703.0, + 1405.0, + 1738.0, + 295.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1734.0, + 1406.0, + 1734.0, + 1406.0, + 1769.0, + 295.0, + 1769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1764.0, + 1406.0, + 1764.0, + 1406.0, + 1799.0, + 294.0, + 1799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1799.0, + 1404.0, + 1799.0, + 1404.0, + 1833.0, + 296.0, + 1833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1833.0, + 1402.0, + 1833.0, + 1402.0, + 1868.0, + 296.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1864.0, + 1407.0, + 1864.0, + 1407.0, + 1906.0, + 296.0, + 1906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1900.0, + 1404.0, + 1900.0, + 1404.0, + 1935.0, + 295.0, + 1935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1934.0, + 1402.0, + 1934.0, + 1402.0, + 1968.0, + 296.0, + 1968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1966.0, + 1405.0, + 1966.0, + 1405.0, + 2004.0, + 295.0, + 2004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2001.0, + 859.0, + 2001.0, + 859.0, + 2038.0, + 293.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 596.0, + 1408.0, + 596.0, + 1408.0, + 639.0, + 294.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 631.0, + 1404.0, + 631.0, + 1404.0, + 670.0, + 295.0, + 670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 666.0, + 1406.0, + 666.0, + 1406.0, + 707.0, + 292.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 700.0, + 1406.0, + 700.0, + 1406.0, + 739.0, + 295.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 731.0, + 1407.0, + 731.0, + 1407.0, + 771.0, + 294.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 760.0, + 1406.0, + 760.0, + 1406.0, + 799.0, + 292.0, + 799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 794.0, + 634.0, + 794.0, + 634.0, + 831.0, + 295.0, + 831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 314.0, + 1406.0, + 314.0, + 1406.0, + 357.0, + 294.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 349.0, + 1405.0, + 349.0, + 1405.0, + 385.0, + 296.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 380.0, + 1405.0, + 380.0, + 1405.0, + 416.0, + 294.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 411.0, + 1407.0, + 411.0, + 1407.0, + 451.0, + 294.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 442.0, + 1407.0, + 442.0, + 1407.0, + 481.0, + 292.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 474.0, + 1036.0, + 474.0, + 1036.0, + 510.0, + 294.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 998.0, + 1405.0, + 998.0, + 1405.0, + 1035.0, + 295.0, + 1035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1029.0, + 1405.0, + 1029.0, + 1405.0, + 1066.0, + 295.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1056.0, + 1405.0, + 1056.0, + 1405.0, + 1095.0, + 294.0, + 1095.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1087.0, + 1293.0, + 1087.0, + 1293.0, + 1127.0, + 294.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1120.0, + 993.0, + 1120.0, + 993.0, + 1157.0, + 294.0, + 1157.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1443.0, + 1408.0, + 1443.0, + 1408.0, + 1479.0, + 293.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1472.0, + 1408.0, + 1472.0, + 1408.0, + 1512.0, + 294.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1504.0, + 1404.0, + 1504.0, + 1404.0, + 1540.0, + 293.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1533.0, + 1404.0, + 1533.0, + 1404.0, + 1572.0, + 292.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1165.0, + 1405.0, + 1165.0, + 1405.0, + 1203.0, + 295.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1199.0, + 1406.0, + 1199.0, + 1406.0, + 1233.0, + 317.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 1223.0, + 1407.0, + 1223.0, + 1407.0, + 1268.0, + 315.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 1259.0, + 1400.0, + 1259.0, + 1400.0, + 1295.0, + 316.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1295.0, + 1403.0, + 1295.0, + 1403.0, + 1333.0, + 295.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 1326.0, + 1403.0, + 1326.0, + 1403.0, + 1365.0, + 315.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 1356.0, + 1405.0, + 1356.0, + 1405.0, + 1393.0, + 315.0, + 1393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1397.0, + 1403.0, + 1397.0, + 1403.0, + 1432.0, + 295.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 226.0, + 891.0, + 226.0, + 891.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 825, + 1424, + 1403, + 1424, + 1403, + 1672, + 825, + 1672 + ], + "score": 0.975, + "html": "
PSNR↑SSIM↑LPIPS↓
SRNs22.260.8460.170
NV26.050.8930.160
LLFF24.880.9110.114
NeRF31.010.9470.081
NSVF31.740.9530.047
GRF(Ours)32.060.9600.048
" + }, + { + "category_id": 6, + "poly": [ + 295, + 222, + 1405, + 222, + 1405, + 379, + 295, + 379 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 297, + 1243, + 802, + 1243, + 802, + 1489, + 297, + 1489 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 1866, + 1403, + 1866, + 1403, + 2036, + 298, + 2036 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 297, + 1504, + 802, + 1504, + 802, + 1708, + 297, + 1708 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 298, + 1747, + 1405, + 1747, + 1405, + 1850, + 298, + 1850 + ], + "score": 0.963 + }, + { + "category_id": 6, + "poly": [ + 824, + 1236, + 1403, + 1236, + 1403, + 1421, + 824, + 1421 + ], + "score": 0.951 + }, + { + "category_id": 4, + "poly": [ + 292, + 1048, + 1408, + 1048, + 1408, + 1116, + 292, + 1116 + ], + "score": 0.878 + }, + { + "category_id": 3, + "poly": [ + 299, + 900, + 1404, + 900, + 1404, + 1045, + 299, + 1045 + ], + "score": 0.857 + }, + { + "category_id": 5, + "poly": [ + 295, + 403, + 1403, + 403, + 1403, + 683, + 295, + 683 + ], + "score": 0.711, + "html": "
50 Images (Group 1)2 Images (Group 2)1 Image (Group 3)
ChairsCarsChairsCarsChairsCars
TCO24.31/ 0.9220.38/0.8321.33/ 0.8818.41 /0.8021.27 / 0.8818.15/0.79
WRL24.57 / 0.9319.16 /0.8222.28/0.9017.20 /0.7822.11/0.9016.89 / 0.77
dGQN22.72/0.9019.61 /0.8122.36 /0.8918.79 /0.7921.59 / 0.8718.19 /0.78
SRNs26.23 / 0.9526.32 /0.9424.48 / 0.9222.94 / 0.8822.89 / 0.9120.72 / 0.85
GRF (Ours)27.10 / 0.9527.21 / 0.9422.65/0.8822.06 /0.8621.25/0.8619.84/ 0.81
" + }, + { + "category_id": 0, + "poly": [ + 298, + 1181, + 925, + 1181, + 925, + 1213, + 298, + 1213 + ], + "score": 0.692 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 858, + 2087, + 858, + 2111, + 841, + 2111 + ], + "score": 0.686 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 854, + 75, + 854, + 105, + 299, + 105 + ], + "score": 0.641 + }, + { + "category_id": 7, + "poly": [ + 290, + 1702, + 1338, + 1702, + 1338, + 1734, + 290, + 1734 + ], + "score": 0.632 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 852, + 76, + 852, + 104, + 300, + 104 + ], + "score": 0.453 + }, + { + "category_id": 4, + "poly": [ + 303, + 829, + 1389, + 829, + 1389, + 886, + 303, + 886 + ], + "score": 0.308 + }, + { + "category_id": 3, + "poly": [ + 299, + 724, + 1403, + 724, + 1403, + 850, + 299, + 850 + ], + "score": 0.279 + }, + { + "category_id": 3, + "poly": [ + 306, + 725, + 1396, + 725, + 1396, + 820, + 306, + 820 + ], + "score": 0.275 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 859, + 2087, + 859, + 2111, + 841, + 2111 + ], + "score": 0.269 + }, + { + "category_id": 1, + "poly": [ + 298, + 1181, + 925, + 1181, + 925, + 1213, + 298, + 1213 + ], + "score": 0.245 + }, + { + "category_id": 4, + "poly": [ + 297, + 1048, + 1408, + 1048, + 1408, + 1116, + 297, + 1116 + ], + "score": 0.2 + }, + { + "category_id": 13, + "poly": [ + 604, + 1458, + 723, + 1458, + 723, + 1487, + 604, + 1487 + ], + "score": 0.89, + "latex": "8 0 0 \\times 8 0 0" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 223.0, + 1406.0, + 223.0, + 1406.0, + 260.0, + 294.0, + 260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 255.0, + 1403.0, + 255.0, + 1403.0, + 288.0, + 295.0, + 288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 284.0, + 1407.0, + 284.0, + 1407.0, + 322.0, + 294.0, + 322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 314.0, + 1406.0, + 314.0, + 1406.0, + 350.0, + 293.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 346.0, + 1263.0, + 346.0, + 1263.0, + 379.0, + 295.0, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 822.0, + 1234.0, + 1406.0, + 1234.0, + 1406.0, + 1270.0, + 822.0, + 1270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 1267.0, + 1406.0, + 1267.0, + 1406.0, + 1302.0, + 823.0, + 1302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 1298.0, + 1404.0, + 1298.0, + 1404.0, + 1331.0, + 823.0, + 1331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 1328.0, + 1404.0, + 1328.0, + 1404.0, + 1361.0, + 821.0, + 1361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 1359.0, + 1404.0, + 1359.0, + 1404.0, + 1393.0, + 821.0, + 1393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 822.0, + 1387.0, + 1383.0, + 1387.0, + 1383.0, + 1427.0, + 822.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1047.0, + 1404.0, + 1047.0, + 1404.0, + 1085.0, + 294.0, + 1085.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1078.0, + 1265.0, + 1078.0, + 1265.0, + 1121.0, + 291.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1323.0, + 909.0, + 1364.0, + 909.0, + 1364.0, + 956.0, + 1323.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 1009.0, + 607.0, + 1009.0, + 607.0, + 1049.0, + 331.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 787.0, + 1007.0, + 926.0, + 1007.0, + 926.0, + 1052.0, + 787.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 1012.0, + 1281.0, + 1012.0, + 1281.0, + 1045.0, + 1131.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1181.0, + 928.0, + 1181.0, + 928.0, + 1217.0, + 294.0, + 1217.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2117.0, + 839.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1699.0, + 1340.0, + 1699.0, + 1340.0, + 1737.0, + 295.0, + 1737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 416.0, + 821.0, + 488.0, + 821.0, + 488.0, + 855.0, + 416.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 818.0, + 903.0, + 818.0, + 903.0, + 858.0, + 770.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 822.0, + 1282.0, + 822.0, + 1282.0, + 854.0, + 1136.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 850.0, + 1393.0, + 850.0, + 1393.0, + 888.0, + 306.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 768.0, + 756.0, + 782.0, + 756.0, + 782.0, + 766.0, + 768.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1144.0, + 756.0, + 1160.0, + 756.0, + 1160.0, + 766.0, + 1144.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 416.0, + 821.0, + 489.0, + 821.0, + 489.0, + 854.0, + 416.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 819.0, + 903.0, + 819.0, + 903.0, + 857.0, + 770.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 821.0, + 1283.0, + 821.0, + 1283.0, + 853.0, + 1133.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 716.0, + 1377.0, + 716.0, + 1377.0, + 840.0, + 295.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2118.0, + 839.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1047.0, + 1405.0, + 1047.0, + 1405.0, + 1085.0, + 295.0, + 1085.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1078.0, + 1265.0, + 1078.0, + 1265.0, + 1121.0, + 292.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1244.0, + 803.0, + 1244.0, + 803.0, + 1277.0, + 297.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1275.0, + 803.0, + 1275.0, + 803.0, + 1307.0, + 295.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1305.0, + 803.0, + 1305.0, + 803.0, + 1339.0, + 295.0, + 1339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1336.0, + 803.0, + 1336.0, + 803.0, + 1369.0, + 295.0, + 1369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1368.0, + 804.0, + 1368.0, + 804.0, + 1397.0, + 295.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1397.0, + 803.0, + 1397.0, + 803.0, + 1428.0, + 296.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1427.0, + 803.0, + 1427.0, + 803.0, + 1459.0, + 294.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1458.0, + 603.0, + 1458.0, + 603.0, + 1491.0, + 294.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 1458.0, + 804.0, + 1458.0, + 804.0, + 1491.0, + 724.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1865.0, + 1405.0, + 1865.0, + 1405.0, + 1903.0, + 317.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1899.0, + 1407.0, + 1899.0, + 1407.0, + 1937.0, + 317.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1933.0, + 1404.0, + 1933.0, + 1404.0, + 1970.0, + 318.0, + 1970.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1964.0, + 1405.0, + 1964.0, + 1405.0, + 2008.0, + 317.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1999.0, + 818.0, + 1999.0, + 818.0, + 2039.0, + 317.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1503.0, + 804.0, + 1503.0, + 804.0, + 1540.0, + 295.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1539.0, + 805.0, + 1539.0, + 805.0, + 1574.0, + 294.0, + 1574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1572.0, + 805.0, + 1572.0, + 805.0, + 1609.0, + 294.0, + 1609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1604.0, + 805.0, + 1604.0, + 805.0, + 1641.0, + 294.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1636.0, + 809.0, + 1636.0, + 809.0, + 1678.0, + 292.0, + 1678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1670.0, + 807.0, + 1670.0, + 807.0, + 1705.0, + 293.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1748.0, + 1405.0, + 1748.0, + 1405.0, + 1783.0, + 296.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1776.0, + 1406.0, + 1776.0, + 1406.0, + 1821.0, + 292.0, + 1821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1816.0, + 1165.0, + 1816.0, + 1165.0, + 1852.0, + 296.0, + 1852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1181.0, + 928.0, + 1181.0, + 928.0, + 1217.0, + 294.0, + 1217.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 868, + 1390, + 1403, + 1390, + 1403, + 1577, + 868, + 1577 + ], + "score": 0.977, + "html": "
PSNR↑SSIM↑LPIPS↓
SRNs22.840.6680.378
LLFF24.130.7980.212
NeRF26.500.8110.250
GRF(Ours)26.640.8370.178
" + }, + { + "category_id": 1, + "poly": [ + 296, + 1671, + 1405, + 1671, + 1405, + 1887, + 296, + 1887 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1265, + 847, + 1265, + 847, + 1451, + 298, + 1451 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1900, + 1403, + 1900, + 1403, + 2036, + 298, + 2036 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 417, + 801, + 417, + 801, + 821, + 299, + 821 + ], + "score": 0.967 + }, + { + "category_id": 5, + "poly": [ + 826, + 513, + 1412, + 513, + 1412, + 816, + 826, + 816 + ], + "score": 0.966, + "html": "
PSNR↑ SSIM↑LPIPS↓
GRF (Group 1) 13.62 0.763 0.246
NeRF(Group 2, 100 iters) 15.15 0.752 0.359 NeRF(Group 2,1k iters) 19.81 0.809 0.228 NeRF(Group 2,10k iters) 23.35 0.875 0.137
GRF (Group 2, 100 iters) 19.69 0.835 0.169 GRF (Group 2, 1k iters) 22.00 0.876 0.128 GRF (Group 2,10k iters) 25.10 0.916 0.089
" + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1404, + 229, + 1404, + 400, + 298, + 400 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 298, + 824, + 1404, + 824, + 1404, + 958, + 298, + 958 + ], + "score": 0.949 + }, + { + "category_id": 6, + "poly": [ + 823, + 409, + 1403, + 409, + 1403, + 511, + 823, + 511 + ], + "score": 0.932 + }, + { + "category_id": 6, + "poly": [ + 867, + 1264, + 1404, + 1264, + 1404, + 1387, + 867, + 1387 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 298, + 1596, + 1401, + 1596, + 1401, + 1656, + 298, + 1656 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 297, + 1464, + 846, + 1464, + 846, + 1594, + 297, + 1594 + ], + "score": 0.893 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2112, + 840, + 2112 + ], + "score": 0.798 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 852, + 76, + 852, + 104, + 300, + 104 + ], + "score": 0.677 + }, + { + "category_id": 3, + "poly": [ + 295, + 966, + 1399, + 966, + 1399, + 1178, + 295, + 1178 + ], + "score": 0.653 + }, + { + "category_id": 1, + "poly": [ + 296, + 1208, + 980, + 1208, + 980, + 1240, + 296, + 1240 + ], + "score": 0.626 + }, + { + "category_id": 4, + "poly": [ + 458, + 1159, + 1247, + 1159, + 1247, + 1190, + 458, + 1190 + ], + "score": 0.372 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 854, + 75, + 854, + 105, + 299, + 105 + ], + "score": 0.228 + }, + { + "category_id": 4, + "poly": [ + 296, + 1208, + 980, + 1208, + 980, + 1240, + 296, + 1240 + ], + "score": 0.165 + }, + { + "category_id": 13, + "poly": [ + 852, + 263, + 982, + 263, + 982, + 293, + 852, + 293 + ], + "score": 0.91, + "latex": "4 \\times 3 = 1 2" + }, + { + "category_id": 13, + "poly": [ + 503, + 1419, + 638, + 1419, + 638, + 1448, + 503, + 1448 + ], + "score": 0.89, + "latex": "1 0 0 8 \\times 7 5 6" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 405.0, + 1404.0, + 405.0, + 1404.0, + 444.0, + 821.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 824.0, + 442.0, + 1404.0, + 442.0, + 1404.0, + 479.0, + 824.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 475.0, + 1177.0, + 475.0, + 1177.0, + 515.0, + 823.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 1260.0, + 1405.0, + 1260.0, + 1405.0, + 1299.0, + 866.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 1291.0, + 1405.0, + 1291.0, + 1405.0, + 1328.0, + 866.0, + 1328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1322.0, + 1405.0, + 1322.0, + 1405.0, + 1358.0, + 865.0, + 1358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 1350.0, + 1241.0, + 1350.0, + 1241.0, + 1393.0, + 867.0, + 1393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 2085.0, + 859.0, + 2085.0, + 859.0, + 2116.0, + 836.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1091.0, + 469.0, + 1091.0, + 469.0, + 1136.0, + 295.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 586.0, + 1091.0, + 758.0, + 1091.0, + 758.0, + 1134.0, + 586.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 1094.0, + 1147.0, + 1094.0, + 1147.0, + 1133.0, + 975.0, + 1133.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1290.0, + 1094.0, + 1376.0, + 1094.0, + 1376.0, + 1127.0, + 1290.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1127.0, + 467.0, + 1127.0, + 467.0, + 1159.0, + 298.0, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 535.0, + 1123.0, + 809.0, + 1123.0, + 809.0, + 1161.0, + 535.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 913.0, + 1126.0, + 1209.0, + 1126.0, + 1209.0, + 1160.0, + 913.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1297.0, + 1123.0, + 1365.0, + 1123.0, + 1365.0, + 1156.0, + 1297.0, + 1156.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 1157.0, + 1251.0, + 1157.0, + 1251.0, + 1184.0, + 451.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 1154.0, + 1250.0, + 1154.0, + 1250.0, + 1196.0, + 451.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1205.0, + 982.0, + 1205.0, + 982.0, + 1243.0, + 293.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1669.0, + 1406.0, + 1669.0, + 1406.0, + 1707.0, + 295.0, + 1707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1697.0, + 1403.0, + 1697.0, + 1403.0, + 1740.0, + 291.0, + 1740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1732.0, + 1405.0, + 1732.0, + 1405.0, + 1767.0, + 295.0, + 1767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1763.0, + 1405.0, + 1763.0, + 1405.0, + 1798.0, + 296.0, + 1798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1791.0, + 1406.0, + 1791.0, + 1406.0, + 1828.0, + 293.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1821.0, + 1405.0, + 1821.0, + 1405.0, + 1859.0, + 293.0, + 1859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1851.0, + 1206.0, + 1851.0, + 1206.0, + 1893.0, + 291.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1264.0, + 848.0, + 1264.0, + 848.0, + 1299.0, + 296.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1297.0, + 847.0, + 1297.0, + 847.0, + 1328.0, + 296.0, + 1328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1325.0, + 849.0, + 1325.0, + 849.0, + 1359.0, + 295.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1356.0, + 849.0, + 1356.0, + 849.0, + 1390.0, + 296.0, + 1390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1388.0, + 849.0, + 1388.0, + 849.0, + 1422.0, + 295.0, + 1422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1419.0, + 502.0, + 1419.0, + 502.0, + 1453.0, + 295.0, + 1453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 639.0, + 1419.0, + 720.0, + 1419.0, + 720.0, + 1453.0, + 639.0, + 1453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1898.0, + 1407.0, + 1898.0, + 1407.0, + 1935.0, + 294.0, + 1935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1932.0, + 1404.0, + 1932.0, + 1404.0, + 1972.0, + 293.0, + 1972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1966.0, + 1408.0, + 1966.0, + 1408.0, + 2004.0, + 294.0, + 2004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1997.0, + 1343.0, + 1997.0, + 1343.0, + 2038.0, + 292.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 412.0, + 800.0, + 412.0, + 800.0, + 449.0, + 296.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 449.0, + 804.0, + 449.0, + 804.0, + 485.0, + 296.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 485.0, + 802.0, + 485.0, + 802.0, + 516.0, + 298.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 520.0, + 801.0, + 520.0, + 801.0, + 550.0, + 297.0, + 550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 554.0, + 800.0, + 554.0, + 800.0, + 585.0, + 298.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 586.0, + 803.0, + 586.0, + 803.0, + 618.0, + 297.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 619.0, + 802.0, + 619.0, + 802.0, + 652.0, + 295.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 652.0, + 801.0, + 652.0, + 801.0, + 686.0, + 296.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 688.0, + 803.0, + 688.0, + 803.0, + 721.0, + 297.0, + 721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 720.0, + 803.0, + 720.0, + 803.0, + 754.0, + 295.0, + 754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 756.0, + 801.0, + 756.0, + 801.0, + 789.0, + 298.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 788.0, + 803.0, + 788.0, + 803.0, + 824.0, + 296.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 229.0, + 1406.0, + 229.0, + 1406.0, + 266.0, + 317.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 265.0, + 851.0, + 265.0, + 851.0, + 299.0, + 318.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 265.0, + 1406.0, + 265.0, + 1406.0, + 299.0, + 983.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 294.0, + 1406.0, + 294.0, + 1406.0, + 335.0, + 317.0, + 335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 330.0, + 1406.0, + 330.0, + 1406.0, + 371.0, + 317.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 363.0, + 495.0, + 363.0, + 495.0, + 405.0, + 317.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 820.0, + 1406.0, + 820.0, + 1406.0, + 857.0, + 293.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 853.0, + 1405.0, + 853.0, + 1405.0, + 893.0, + 293.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 890.0, + 1405.0, + 890.0, + 1405.0, + 928.0, + 297.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 921.0, + 872.0, + 921.0, + 872.0, + 959.0, + 294.0, + 959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1594.0, + 1403.0, + 1594.0, + 1403.0, + 1628.0, + 296.0, + 1628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1625.0, + 852.0, + 1625.0, + 852.0, + 1660.0, + 296.0, + 1660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1460.0, + 849.0, + 1460.0, + 849.0, + 1500.0, + 294.0, + 1500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1495.0, + 849.0, + 1495.0, + 849.0, + 1536.0, + 295.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1530.0, + 851.0, + 1530.0, + 851.0, + 1568.0, + 294.0, + 1568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1562.0, + 850.0, + 1562.0, + 850.0, + 1597.0, + 294.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1205.0, + 982.0, + 1205.0, + 982.0, + 1243.0, + 293.0, + 1243.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 870, + 753, + 1401, + 753, + 1401, + 927, + 870, + 927 + ], + "score": 0.978, + "html": "
PSNR↑SSIM↑
(1)Remove Input Viewpoints20.130.807
(2) Remove Pixel Local Features20.230.818
(3) Replace Attention by Maxpool24.880.914
(4) The Full Model27.160.942
" + }, + { + "category_id": 1, + "poly": [ + 297, + 1817, + 1403, + 1817, + 1403, + 2032, + 297, + 2032 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 299, + 691, + 845, + 691, + 845, + 935, + 299, + 935 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 297, + 1333, + 1403, + 1333, + 1403, + 1521, + 297, + 1521 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 1535, + 1403, + 1535, + 1403, + 1705, + 298, + 1705 + ], + "score": 0.971 + }, + { + "category_id": 3, + "poly": [ + 304, + 220, + 1396, + 220, + 1396, + 555, + 304, + 555 + ], + "score": 0.966 + }, + { + "category_id": 6, + "poly": [ + 869, + 689, + 1401, + 689, + 1401, + 751, + 869, + 751 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 293, + 980, + 1405, + 980, + 1405, + 1319, + 293, + 1319 + ], + "score": 0.901 + }, + { + "category_id": 0, + "poly": [ + 300, + 1748, + 544, + 1748, + 544, + 1784, + 300, + 1784 + ], + "score": 0.901 + }, + { + "category_id": 0, + "poly": [ + 299, + 634, + 581, + 634, + 581, + 664, + 299, + 664 + ], + "score": 0.872 + }, + { + "category_id": 1, + "poly": [ + 295, + 936, + 979, + 936, + 979, + 966, + 295, + 966 + ], + "score": 0.841 + }, + { + "category_id": 4, + "poly": [ + 324, + 557, + 1364, + 557, + 1364, + 613, + 324, + 613 + ], + "score": 0.817 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 852, + 76, + 852, + 104, + 300, + 104 + ], + "score": 0.796 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.796 + }, + { + "category_id": 15, + "poly": [ + 868.0, + 688.0, + 1405.0, + 688.0, + 1405.0, + 722.0, + 868.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 714.0, + 1380.0, + 714.0, + 1380.0, + 758.0, + 866.0, + 758.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1742.0, + 550.0, + 1742.0, + 550.0, + 1793.0, + 290.0, + 1793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 632.0, + 584.0, + 632.0, + 584.0, + 667.0, + 296.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.0, + 552.0, + 509.0, + 552.0, + 509.0, + 585.0, + 440.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 551.0, + 912.0, + 551.0, + 912.0, + 586.0, + 780.0, + 586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1162.0, + 554.0, + 1304.0, + 554.0, + 1304.0, + 582.0, + 1162.0, + 582.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 575.0, + 1368.0, + 575.0, + 1368.0, + 617.0, + 330.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2087.0, + 860.0, + 2087.0, + 860.0, + 2117.0, + 839.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1819.0, + 1405.0, + 1819.0, + 1405.0, + 1853.0, + 295.0, + 1853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1849.0, + 1405.0, + 1849.0, + 1405.0, + 1884.0, + 293.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1878.0, + 1405.0, + 1878.0, + 1405.0, + 1917.0, + 291.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1907.0, + 1403.0, + 1907.0, + 1403.0, + 1945.0, + 294.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1939.0, + 1405.0, + 1939.0, + 1405.0, + 1975.0, + 292.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1971.0, + 1405.0, + 1971.0, + 1405.0, + 2006.0, + 295.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2002.0, + 1036.0, + 2002.0, + 1036.0, + 2036.0, + 295.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 688.0, + 848.0, + 688.0, + 848.0, + 724.0, + 295.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 720.0, + 852.0, + 720.0, + 852.0, + 756.0, + 291.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 749.0, + 851.0, + 749.0, + 851.0, + 786.0, + 295.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 781.0, + 850.0, + 781.0, + 850.0, + 814.0, + 295.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 812.0, + 849.0, + 812.0, + 849.0, + 845.0, + 294.0, + 845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 840.0, + 851.0, + 840.0, + 851.0, + 879.0, + 291.0, + 879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 873.0, + 849.0, + 873.0, + 849.0, + 905.0, + 293.0, + 905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 903.0, + 849.0, + 903.0, + 849.0, + 937.0, + 296.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1331.0, + 1407.0, + 1331.0, + 1407.0, + 1368.0, + 295.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1363.0, + 1405.0, + 1363.0, + 1405.0, + 1397.0, + 293.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1394.0, + 1405.0, + 1394.0, + 1405.0, + 1428.0, + 293.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1421.0, + 1407.0, + 1421.0, + 1407.0, + 1463.0, + 292.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1457.0, + 1407.0, + 1457.0, + 1407.0, + 1496.0, + 294.0, + 1496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1489.0, + 1316.0, + 1489.0, + 1316.0, + 1525.0, + 292.0, + 1525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1534.0, + 1405.0, + 1534.0, + 1405.0, + 1572.0, + 294.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1571.0, + 1405.0, + 1571.0, + 1405.0, + 1604.0, + 297.0, + 1604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1602.0, + 1405.0, + 1602.0, + 1405.0, + 1639.0, + 294.0, + 1639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1638.0, + 1404.0, + 1638.0, + 1404.0, + 1672.0, + 296.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1668.0, + 1373.0, + 1668.0, + 1373.0, + 1710.0, + 293.0, + 1710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 977.0, + 1406.0, + 977.0, + 1406.0, + 1016.0, + 294.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 1011.0, + 1152.0, + 1011.0, + 1152.0, + 1046.0, + 316.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1047.0, + 1406.0, + 1047.0, + 1406.0, + 1086.0, + 295.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 1080.0, + 1406.0, + 1080.0, + 1406.0, + 1115.0, + 316.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 1108.0, + 1404.0, + 1108.0, + 1404.0, + 1146.0, + 316.0, + 1146.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1143.0, + 1404.0, + 1143.0, + 1404.0, + 1182.0, + 319.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1179.0, + 1237.0, + 1179.0, + 1237.0, + 1214.0, + 320.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 302.0, + 1213.0, + 1405.0, + 1213.0, + 1405.0, + 1254.0, + 302.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 1247.0, + 1397.0, + 1247.0, + 1397.0, + 1282.0, + 316.0, + 1282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1282.0, + 1263.0, + 1282.0, + 1263.0, + 1323.0, + 292.0, + 1323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 933.0, + 982.0, + 933.0, + 982.0, + 970.0, + 295.0, + 970.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 836, + 2088, + 866, + 2088, + 866, + 2113, + 836, + 2113 + ], + "score": 0.828 + }, + { + "category_id": 0, + "poly": [ + 300, + 227, + 489, + 227, + 489, + 261, + 300, + 261 + ], + "score": 0.801 + }, + { + "category_id": 1, + "poly": [ + 297, + 278, + 1400, + 278, + 1400, + 341, + 297, + 341 + ], + "score": 0.756 + }, + { + "category_id": 1, + "poly": [ + 294, + 358, + 1399, + 358, + 1399, + 394, + 294, + 394 + ], + "score": 0.697 + }, + { + "category_id": 1, + "poly": [ + 295, + 1614, + 1399, + 1614, + 1399, + 1678, + 295, + 1678 + ], + "score": 0.676 + }, + { + "category_id": 1, + "poly": [ + 301, + 410, + 1400, + 410, + 1400, + 505, + 301, + 505 + ], + "score": 0.66 + }, + { + "category_id": 1, + "poly": [ + 296, + 1807, + 1400, + 1807, + 1400, + 1872, + 296, + 1872 + ], + "score": 0.63 + }, + { + "category_id": 1, + "poly": [ + 299, + 828, + 1400, + 828, + 1400, + 925, + 299, + 925 + ], + "score": 0.629 + }, + { + "category_id": 1, + "poly": [ + 291, + 1307, + 1401, + 1307, + 1401, + 1372, + 291, + 1372 + ], + "score": 0.624 + }, + { + "category_id": 1, + "poly": [ + 299, + 1502, + 1403, + 1502, + 1403, + 1596, + 299, + 1596 + ], + "score": 0.623 + }, + { + "category_id": 1, + "poly": [ + 298, + 1388, + 1402, + 1388, + 1402, + 1484, + 298, + 1484 + ], + "score": 0.621 + }, + { + "category_id": 1, + "poly": [ + 292, + 746, + 1403, + 746, + 1403, + 812, + 292, + 812 + ], + "score": 0.586 + }, + { + "category_id": 1, + "poly": [ + 295, + 1225, + 1399, + 1225, + 1399, + 1291, + 295, + 1291 + ], + "score": 0.585 + }, + { + "category_id": 1, + "poly": [ + 298, + 634, + 1403, + 634, + 1403, + 730, + 298, + 730 + ], + "score": 0.574 + }, + { + "category_id": 1, + "poly": [ + 300, + 522, + 1401, + 522, + 1401, + 618, + 300, + 618 + ], + "score": 0.57 + }, + { + "category_id": 1, + "poly": [ + 298, + 1888, + 1400, + 1888, + 1400, + 1955, + 298, + 1955 + ], + "score": 0.563 + }, + { + "category_id": 1, + "poly": [ + 299, + 1971, + 1399, + 1971, + 1399, + 2035, + 299, + 2035 + ], + "score": 0.547 + }, + { + "category_id": 1, + "poly": [ + 296, + 1113, + 1399, + 1113, + 1399, + 1208, + 296, + 1208 + ], + "score": 0.544 + }, + { + "category_id": 1, + "poly": [ + 298, + 939, + 1401, + 939, + 1401, + 1096, + 298, + 1096 + ], + "score": 0.531 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.53 + }, + { + "category_id": 1, + "poly": [ + 296, + 1695, + 1404, + 1695, + 1404, + 1789, + 296, + 1789 + ], + "score": 0.396 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.355 + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 229.0, + 490.0, + 229.0, + 490.0, + 263.0, + 297.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 276.0, + 1405.0, + 276.0, + 1405.0, + 313.0, + 293.0, + 313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 308.0, + 1053.0, + 308.0, + 1053.0, + 343.0, + 323.0, + 343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 356.0, + 1403.0, + 356.0, + 1403.0, + 396.0, + 294.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1610.0, + 1404.0, + 1610.0, + 1404.0, + 1652.0, + 291.0, + 1652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1645.0, + 590.0, + 1645.0, + 590.0, + 1681.0, + 324.0, + 1681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 411.0, + 1403.0, + 411.0, + 1403.0, + 445.0, + 297.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 439.0, + 1405.0, + 439.0, + 1405.0, + 479.0, + 320.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 468.0, + 1380.0, + 468.0, + 1380.0, + 509.0, + 321.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1809.0, + 1404.0, + 1809.0, + 1404.0, + 1845.0, + 294.0, + 1845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1838.0, + 586.0, + 1838.0, + 586.0, + 1873.0, + 322.0, + 1873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 830.0, + 1404.0, + 830.0, + 1404.0, + 864.0, + 297.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 859.0, + 1405.0, + 859.0, + 1405.0, + 895.0, + 323.0, + 895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 890.0, + 1052.0, + 890.0, + 1052.0, + 928.0, + 325.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1305.0, + 1403.0, + 1305.0, + 1403.0, + 1346.0, + 295.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1340.0, + 866.0, + 1340.0, + 866.0, + 1373.0, + 322.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1499.0, + 1404.0, + 1499.0, + 1404.0, + 1539.0, + 293.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1532.0, + 1404.0, + 1532.0, + 1404.0, + 1566.0, + 323.0, + 1566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1564.0, + 780.0, + 1564.0, + 780.0, + 1598.0, + 323.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1387.0, + 1406.0, + 1387.0, + 1406.0, + 1427.0, + 292.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1421.0, + 1402.0, + 1421.0, + 1402.0, + 1456.0, + 325.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1452.0, + 855.0, + 1452.0, + 855.0, + 1486.0, + 325.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 745.0, + 1405.0, + 745.0, + 1405.0, + 783.0, + 292.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 776.0, + 1177.0, + 776.0, + 1177.0, + 811.0, + 323.0, + 811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1228.0, + 1403.0, + 1228.0, + 1403.0, + 1261.0, + 296.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1255.0, + 1403.0, + 1255.0, + 1403.0, + 1292.0, + 324.0, + 1292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 635.0, + 1404.0, + 635.0, + 1404.0, + 670.0, + 296.0, + 670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 664.0, + 1403.0, + 664.0, + 1403.0, + 703.0, + 323.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 697.0, + 780.0, + 697.0, + 780.0, + 731.0, + 323.0, + 731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 522.0, + 1406.0, + 522.0, + 1406.0, + 560.0, + 295.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 554.0, + 1405.0, + 554.0, + 1405.0, + 588.0, + 323.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 583.0, + 1168.0, + 583.0, + 1168.0, + 620.0, + 319.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1889.0, + 1402.0, + 1889.0, + 1402.0, + 1925.0, + 294.0, + 1925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1922.0, + 1143.0, + 1922.0, + 1143.0, + 1955.0, + 323.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1971.0, + 1404.0, + 1971.0, + 1404.0, + 2007.0, + 295.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 2002.0, + 1206.0, + 2002.0, + 1206.0, + 2038.0, + 324.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1113.0, + 1401.0, + 1113.0, + 1401.0, + 1151.0, + 294.0, + 1151.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1145.0, + 1404.0, + 1145.0, + 1404.0, + 1181.0, + 321.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1178.0, + 547.0, + 1178.0, + 547.0, + 1208.0, + 321.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 943.0, + 1405.0, + 943.0, + 1405.0, + 976.0, + 296.0, + 976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 971.0, + 1405.0, + 971.0, + 1405.0, + 1009.0, + 322.0, + 1009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 997.0, + 1406.0, + 997.0, + 1406.0, + 1043.0, + 320.0, + 1043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1034.0, + 1403.0, + 1034.0, + 1403.0, + 1067.0, + 324.0, + 1067.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1063.0, + 1179.0, + 1063.0, + 1179.0, + 1100.0, + 322.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1696.0, + 1402.0, + 1696.0, + 1402.0, + 1730.0, + 295.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1725.0, + 1404.0, + 1725.0, + 1404.0, + 1761.0, + 322.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1755.0, + 397.0, + 1755.0, + 397.0, + 1789.0, + 322.0, + 1789.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2113, + 836, + 2113 + ], + "score": 0.829 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.794 + }, + { + "category_id": 1, + "poly": [ + 301, + 836, + 1401, + 836, + 1401, + 930, + 301, + 930 + ], + "score": 0.735 + }, + { + "category_id": 1, + "poly": [ + 300, + 719, + 1399, + 719, + 1399, + 815, + 300, + 815 + ], + "score": 0.711 + }, + { + "category_id": 1, + "poly": [ + 297, + 633, + 1402, + 633, + 1402, + 699, + 297, + 699 + ], + "score": 0.7 + }, + { + "category_id": 1, + "poly": [ + 300, + 1185, + 1402, + 1185, + 1402, + 1281, + 300, + 1281 + ], + "score": 0.698 + }, + { + "category_id": 1, + "poly": [ + 292, + 229, + 1401, + 229, + 1401, + 293, + 292, + 293 + ], + "score": 0.698 + }, + { + "category_id": 1, + "poly": [ + 293, + 1418, + 1400, + 1418, + 1400, + 1483, + 293, + 1483 + ], + "score": 0.683 + }, + { + "category_id": 1, + "poly": [ + 302, + 1302, + 1404, + 1302, + 1404, + 1396, + 302, + 1396 + ], + "score": 0.68 + }, + { + "category_id": 1, + "poly": [ + 298, + 431, + 1401, + 431, + 1401, + 496, + 298, + 496 + ], + "score": 0.675 + }, + { + "category_id": 1, + "poly": [ + 292, + 1737, + 1403, + 1737, + 1403, + 1802, + 292, + 1802 + ], + "score": 0.653 + }, + { + "category_id": 1, + "poly": [ + 298, + 314, + 1401, + 314, + 1401, + 409, + 298, + 409 + ], + "score": 0.642 + }, + { + "category_id": 1, + "poly": [ + 297, + 952, + 1403, + 952, + 1403, + 1047, + 297, + 1047 + ], + "score": 0.64 + }, + { + "category_id": 1, + "poly": [ + 299, + 1824, + 1402, + 1824, + 1402, + 1920, + 299, + 1920 + ], + "score": 0.574 + }, + { + "category_id": 1, + "poly": [ + 299, + 1942, + 1403, + 1942, + 1403, + 2034, + 299, + 2034 + ], + "score": 0.513 + }, + { + "category_id": 1, + "poly": [ + 297, + 1504, + 1404, + 1504, + 1404, + 1600, + 297, + 1600 + ], + "score": 0.459 + }, + { + "category_id": 1, + "poly": [ + 297, + 1070, + 1406, + 1070, + 1406, + 1164, + 297, + 1164 + ], + "score": 0.388 + }, + { + "category_id": 1, + "poly": [ + 296, + 1622, + 1407, + 1622, + 1407, + 1715, + 296, + 1715 + ], + "score": 0.363 + }, + { + "category_id": 1, + "poly": [ + 296, + 517, + 1405, + 517, + 1405, + 611, + 296, + 611 + ], + "score": 0.341 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.111 + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2125.0, + 832.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 838.0, + 1405.0, + 838.0, + 1405.0, + 872.0, + 296.0, + 872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 866.0, + 1405.0, + 866.0, + 1405.0, + 905.0, + 322.0, + 905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 899.0, + 1180.0, + 899.0, + 1180.0, + 930.0, + 321.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 717.0, + 1404.0, + 717.0, + 1404.0, + 758.0, + 293.0, + 758.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 750.0, + 1405.0, + 750.0, + 1405.0, + 789.0, + 320.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 783.0, + 1082.0, + 783.0, + 1082.0, + 817.0, + 324.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 632.0, + 1406.0, + 632.0, + 1406.0, + 671.0, + 293.0, + 671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 666.0, + 1370.0, + 666.0, + 1370.0, + 702.0, + 324.0, + 702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1186.0, + 1402.0, + 1186.0, + 1402.0, + 1221.0, + 295.0, + 1221.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1217.0, + 1404.0, + 1217.0, + 1404.0, + 1251.0, + 323.0, + 1251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1250.0, + 918.0, + 1250.0, + 918.0, + 1281.0, + 323.0, + 1281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 228.0, + 1404.0, + 228.0, + 1404.0, + 267.0, + 295.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 261.0, + 728.0, + 261.0, + 728.0, + 294.0, + 324.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1417.0, + 1404.0, + 1417.0, + 1404.0, + 1456.0, + 295.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1449.0, + 1362.0, + 1449.0, + 1362.0, + 1485.0, + 323.0, + 1485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1302.0, + 1405.0, + 1302.0, + 1405.0, + 1338.0, + 296.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1333.0, + 1404.0, + 1333.0, + 1404.0, + 1367.0, + 323.0, + 1367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1364.0, + 760.0, + 1364.0, + 760.0, + 1397.0, + 323.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 433.0, + 1405.0, + 433.0, + 1405.0, + 469.0, + 294.0, + 469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 462.0, + 1073.0, + 462.0, + 1073.0, + 498.0, + 323.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1739.0, + 1403.0, + 1739.0, + 1403.0, + 1775.0, + 298.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1768.0, + 820.0, + 1768.0, + 820.0, + 1800.0, + 321.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 311.0, + 1406.0, + 311.0, + 1406.0, + 354.0, + 293.0, + 354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 348.0, + 1405.0, + 348.0, + 1405.0, + 382.0, + 323.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 379.0, + 688.0, + 379.0, + 688.0, + 409.0, + 324.0, + 409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 953.0, + 1403.0, + 953.0, + 1403.0, + 987.0, + 296.0, + 987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 985.0, + 1405.0, + 985.0, + 1405.0, + 1019.0, + 324.0, + 1019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1015.0, + 751.0, + 1015.0, + 751.0, + 1046.0, + 325.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1822.0, + 1403.0, + 1822.0, + 1403.0, + 1862.0, + 293.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1856.0, + 1404.0, + 1856.0, + 1404.0, + 1890.0, + 322.0, + 1890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1885.0, + 1145.0, + 1885.0, + 1145.0, + 1922.0, + 319.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1938.0, + 1405.0, + 1938.0, + 1405.0, + 1978.0, + 294.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1971.0, + 1405.0, + 1971.0, + 1405.0, + 2007.0, + 323.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 2001.0, + 697.0, + 2001.0, + 697.0, + 2038.0, + 323.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1504.0, + 1404.0, + 1504.0, + 1404.0, + 1542.0, + 294.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1537.0, + 1404.0, + 1537.0, + 1404.0, + 1572.0, + 322.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1568.0, + 1083.0, + 1568.0, + 1083.0, + 1602.0, + 322.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1066.0, + 1404.0, + 1066.0, + 1404.0, + 1109.0, + 292.0, + 1109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1102.0, + 1404.0, + 1102.0, + 1404.0, + 1136.0, + 325.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1130.0, + 1052.0, + 1130.0, + 1052.0, + 1168.0, + 326.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1619.0, + 1405.0, + 1619.0, + 1405.0, + 1660.0, + 294.0, + 1660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1654.0, + 1403.0, + 1654.0, + 1403.0, + 1684.0, + 324.0, + 1684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1683.0, + 1139.0, + 1683.0, + 1139.0, + 1718.0, + 322.0, + 1718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 518.0, + 1405.0, + 518.0, + 1405.0, + 553.0, + 295.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 549.0, + 1405.0, + 549.0, + 1405.0, + 583.0, + 323.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 574.0, + 410.0, + 574.0, + 410.0, + 615.0, + 320.0, + 615.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.878 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.833 + }, + { + "category_id": 1, + "poly": [ + 300, + 229, + 1400, + 229, + 1400, + 322, + 300, + 322 + ], + "score": 0.696 + }, + { + "category_id": 1, + "poly": [ + 300, + 340, + 1402, + 340, + 1402, + 433, + 300, + 433 + ], + "score": 0.629 + }, + { + "category_id": 1, + "poly": [ + 298, + 1386, + 1402, + 1386, + 1402, + 1482, + 298, + 1482 + ], + "score": 0.618 + }, + { + "category_id": 1, + "poly": [ + 301, + 1607, + 1402, + 1607, + 1402, + 1703, + 301, + 1703 + ], + "score": 0.61 + }, + { + "category_id": 1, + "poly": [ + 299, + 560, + 1402, + 560, + 1402, + 655, + 299, + 655 + ], + "score": 0.607 + }, + { + "category_id": 1, + "poly": [ + 298, + 1497, + 1401, + 1497, + 1401, + 1592, + 298, + 1592 + ], + "score": 0.597 + }, + { + "category_id": 1, + "poly": [ + 300, + 451, + 1401, + 451, + 1401, + 545, + 300, + 545 + ], + "score": 0.597 + }, + { + "category_id": 1, + "poly": [ + 298, + 973, + 1402, + 973, + 1402, + 1069, + 298, + 1069 + ], + "score": 0.581 + }, + { + "category_id": 1, + "poly": [ + 303, + 671, + 1402, + 671, + 1402, + 767, + 303, + 767 + ], + "score": 0.578 + }, + { + "category_id": 1, + "poly": [ + 299, + 1275, + 1401, + 1275, + 1401, + 1371, + 299, + 1371 + ], + "score": 0.577 + }, + { + "category_id": 1, + "poly": [ + 300, + 1719, + 1402, + 1719, + 1402, + 1813, + 300, + 1813 + ], + "score": 0.57 + }, + { + "category_id": 1, + "poly": [ + 301, + 1164, + 1401, + 1164, + 1401, + 1260, + 301, + 1260 + ], + "score": 0.563 + }, + { + "category_id": 1, + "poly": [ + 291, + 1084, + 1399, + 1084, + 1399, + 1149, + 291, + 1149 + ], + "score": 0.561 + }, + { + "category_id": 1, + "poly": [ + 295, + 1830, + 1402, + 1830, + 1402, + 1924, + 295, + 1924 + ], + "score": 0.556 + }, + { + "category_id": 1, + "poly": [ + 294, + 782, + 1402, + 782, + 1402, + 847, + 294, + 847 + ], + "score": 0.549 + }, + { + "category_id": 1, + "poly": [ + 300, + 862, + 1401, + 862, + 1401, + 958, + 300, + 958 + ], + "score": 0.548 + }, + { + "category_id": 1, + "poly": [ + 299, + 1941, + 1404, + 1941, + 1404, + 2034, + 299, + 2034 + ], + "score": 0.459 + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 225.0, + 1404.0, + 225.0, + 1404.0, + 268.0, + 294.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 259.0, + 1403.0, + 259.0, + 1403.0, + 297.0, + 323.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 293.0, + 521.0, + 293.0, + 521.0, + 324.0, + 320.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 337.0, + 1406.0, + 337.0, + 1406.0, + 377.0, + 293.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 370.0, + 1404.0, + 370.0, + 1404.0, + 403.0, + 321.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 399.0, + 398.0, + 399.0, + 398.0, + 436.0, + 320.0, + 436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1387.0, + 1404.0, + 1387.0, + 1404.0, + 1422.0, + 296.0, + 1422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1417.0, + 1404.0, + 1417.0, + 1404.0, + 1454.0, + 323.0, + 1454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1449.0, + 602.0, + 1449.0, + 602.0, + 1484.0, + 326.0, + 1484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1605.0, + 1406.0, + 1605.0, + 1406.0, + 1646.0, + 294.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1639.0, + 1406.0, + 1639.0, + 1406.0, + 1677.0, + 321.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1671.0, + 1025.0, + 1671.0, + 1025.0, + 1705.0, + 322.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 561.0, + 1404.0, + 561.0, + 1404.0, + 599.0, + 295.0, + 599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 594.0, + 1404.0, + 594.0, + 1404.0, + 628.0, + 322.0, + 628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 621.0, + 465.0, + 621.0, + 465.0, + 656.0, + 322.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1497.0, + 1403.0, + 1497.0, + 1403.0, + 1532.0, + 294.0, + 1532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1529.0, + 1406.0, + 1529.0, + 1406.0, + 1565.0, + 322.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1559.0, + 774.0, + 1559.0, + 774.0, + 1593.0, + 327.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 452.0, + 1405.0, + 452.0, + 1405.0, + 486.0, + 296.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 481.0, + 1405.0, + 481.0, + 1405.0, + 519.0, + 321.0, + 519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 514.0, + 888.0, + 514.0, + 888.0, + 545.0, + 321.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 973.0, + 1403.0, + 973.0, + 1403.0, + 1011.0, + 296.0, + 1011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1004.0, + 1406.0, + 1004.0, + 1406.0, + 1042.0, + 323.0, + 1042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1036.0, + 859.0, + 1036.0, + 859.0, + 1071.0, + 322.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 671.0, + 1405.0, + 671.0, + 1405.0, + 709.0, + 297.0, + 709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 704.0, + 1405.0, + 704.0, + 1405.0, + 739.0, + 323.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 732.0, + 1095.0, + 732.0, + 1095.0, + 769.0, + 323.0, + 769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1272.0, + 1405.0, + 1272.0, + 1405.0, + 1314.0, + 293.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1310.0, + 1403.0, + 1310.0, + 1403.0, + 1340.0, + 325.0, + 1340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1338.0, + 829.0, + 1338.0, + 829.0, + 1372.0, + 323.0, + 1372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1716.0, + 1407.0, + 1716.0, + 1407.0, + 1756.0, + 294.0, + 1756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1749.0, + 1404.0, + 1749.0, + 1404.0, + 1784.0, + 321.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1781.0, + 773.0, + 1781.0, + 773.0, + 1814.0, + 323.0, + 1814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1165.0, + 1404.0, + 1165.0, + 1404.0, + 1200.0, + 296.0, + 1200.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1196.0, + 1405.0, + 1196.0, + 1405.0, + 1233.0, + 322.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1224.0, + 935.0, + 1224.0, + 935.0, + 1263.0, + 325.0, + 1263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1084.0, + 1402.0, + 1084.0, + 1402.0, + 1122.0, + 294.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1117.0, + 1233.0, + 1117.0, + 1233.0, + 1150.0, + 321.0, + 1150.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1826.0, + 1406.0, + 1826.0, + 1406.0, + 1869.0, + 293.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1860.0, + 1403.0, + 1860.0, + 1403.0, + 1894.0, + 323.0, + 1894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1892.0, + 476.0, + 1892.0, + 476.0, + 1923.0, + 323.0, + 1923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 781.0, + 1407.0, + 781.0, + 1407.0, + 821.0, + 294.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 813.0, + 1043.0, + 813.0, + 1043.0, + 849.0, + 323.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 861.0, + 1402.0, + 861.0, + 1402.0, + 899.0, + 296.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 895.0, + 1403.0, + 895.0, + 1403.0, + 930.0, + 324.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 926.0, + 763.0, + 926.0, + 763.0, + 959.0, + 322.0, + 959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1942.0, + 1404.0, + 1942.0, + 1404.0, + 1975.0, + 295.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1973.0, + 1405.0, + 1973.0, + 1405.0, + 2007.0, + 323.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 2003.0, + 780.0, + 2003.0, + 780.0, + 2037.0, + 324.0, + 2037.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 420, + 1072, + 1273, + 1072, + 1273, + 1628, + 420, + 1628 + ], + "score": 0.984, + "html": "
Type Size/Channels Activation Stride
Input: embedding of RGB and viewpoint - -
L1: Conv 7 × 7 64 ReLU 2
L2: Conv 3 × 3 128 ReLU 2
L3: Conv 3 × 3 256 ReLU 2
L4: Conv 3 × 3 512 ReLU 2
L4: AveragePooling 5 × 5
= =
L5: Conv 5 × 5 128 ReLU 5
L6:Flatten /Tile - 1
L7: Concat (L6,L4) 1 1
L8: Deconv 3× 3 256 ReLU 2
L8: Concat (L8, L3) 1 1
L9: Deonv 3 × 3 128 ReLU 2
L9: Concat (L9,L2) 1 1
L10: Deconv 3×3 64 ReLU 2
L10: Concat (L10,L1) - 1 L11: Deconv 3 × 3 128 ReLU 2
" + }, + { + "category_id": 5, + "poly": [ + 420, + 416, + 1274, + 416, + 1274, + 942, + 420, + 942 + ], + "score": 0.983, + "html": "
Type Size/Channels Activation Stride
Input: embedding of RGB and viewpoint
1 - 64 ReLU 2
Li: Conv 7 × 7 L2: Conv 3 × 3 128 ReLU 2
L3: Conv 3 × 3 256 ReLU 2
L4: Conv 3 × 3 512 ReLU 2
L5: Conv 4 × 4 128 ReLU 4
L6: Flatten /Tile - 1
L7: Concat (L6,L4) - 1
L8:Dilated Conv 3×3 256 ReLU 4
L8: Concat (L8,L3) 1 1 =
L9:Dilated Conv 3 × 3 128 ReLU 8
L9: Concat (L9,L2) = 一 =
L10: Dilated Conv 3 × 3 64 ReLU 16
L10: Concat (L10, L1) - ■ = L11: Dilated Conv 3 × 3 128 ReLU 32
" + }, + { + "category_id": 6, + "poly": [ + 298, + 985, + 1403, + 985, + 1403, + 1050, + 298, + 1050 + ], + "score": 0.929 + }, + { + "category_id": 6, + "poly": [ + 462, + 360, + 1230, + 360, + 1230, + 394, + 462, + 394 + ], + "score": 0.906 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.894 + }, + { + "category_id": 0, + "poly": [ + 300, + 227, + 508, + 227, + 508, + 261, + 300, + 261 + ], + "score": 0.883 + }, + { + "category_id": 1, + "poly": [ + 299, + 296, + 843, + 296, + 843, + 328, + 299, + 328 + ], + "score": 0.871 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.844 + }, + { + "category_id": 13, + "poly": [ + 566, + 1405, + 632, + 1405, + 632, + 1433, + 566, + 1433 + ], + "score": 0.81, + "latex": "3 \\times 3" + }, + { + "category_id": 13, + "poly": [ + 540, + 1313, + 606, + 1313, + 606, + 1342, + 540, + 1342 + ], + "score": 0.78, + "latex": "5 \\times 5" + }, + { + "category_id": 13, + "poly": [ + 554, + 1466, + 619, + 1466, + 619, + 1494, + 554, + 1494 + ], + "score": 0.78, + "latex": "3 \\times 3" + }, + { + "category_id": 13, + "poly": [ + 659, + 1283, + 723, + 1283, + 723, + 1312, + 659, + 1312 + ], + "score": 0.74, + "latex": "5 \\times 5" + }, + { + "category_id": 13, + "poly": [ + 628, + 718, + 694, + 718, + 694, + 747, + 628, + 747 + ], + "score": 0.65, + "latex": "3 \\times 3" + }, + { + "category_id": 13, + "poly": [ + 579, + 1587, + 646, + 1587, + 646, + 1617, + 579, + 1617 + ], + "score": 0.32, + "latex": "3 \\times 3" + }, + { + "category_id": 13, + "poly": [ + 628, + 779, + 694, + 779, + 694, + 807, + 628, + 807 + ], + "score": 0.27, + "latex": "3 \\times 3" + }, + { + "category_id": 13, + "poly": [ + 579, + 1527, + 645, + 1527, + 645, + 1555, + 579, + 1555 + ], + "score": 0.26, + "latex": "3 \\times 3" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 983.0, + 1405.0, + 983.0, + 1405.0, + 1023.0, + 294.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1015.0, + 884.0, + 1015.0, + 884.0, + 1054.0, + 295.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 356.0, + 1233.0, + 356.0, + 1233.0, + 399.0, + 465.0, + 399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 222.0, + 513.0, + 222.0, + 513.0, + 269.0, + 295.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2084.0, + 870.0, + 2084.0, + 870.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 294.0, + 846.0, + 294.0, + 846.0, + 330.0, + 295.0, + 330.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 409, + 1029, + 1284, + 1029, + 1284, + 1370, + 409, + 1370 + ], + "score": 0.983, + "html": "
TypeSize/Channels Activation
Input: Concat(K × 128,embedding of viewpoint)==
L1: fc256ReLU
L2: fc256ReLU
L3: fc256ReLU
L4: fc512ReLU
L5: fc512ReLU
L6: softmax(L5)11
L7: sum(L6*L5,axis=-2)11
L8: fc512ReLU
" + }, + { + "category_id": 5, + "poly": [ + 419, + 309, + 1275, + 309, + 1275, + 866, + 419, + 866 + ], + "score": 0.983, + "html": "
Type Size/Channels Activation Stride
Input: embedding of RGB and viewpoint 1 1
L1: Conv 7 × 7 64 ReLU
22 L2: Conv 3 × 3 128 ReLU
L3: Conv 3 × 3 256 ReLU 2
L4: Conv 3 × 3 512 ReLU 2
L4: AveragePooling 8 × 8 1 =
L5: Conv 4 × 4 128 ReLU 4
L6: Flatten /Tile 1 1
L7: Concat (L6,L4) 1 1
L8: Deconv 3 × 3 256 ReLU 2
L8: Concat (L8,L3) - 1
L9: Deconv 3 × 3 128 ReLU
L9: Concat (L9,L2) 1 =
L10: Deconv 3×3 64 ReLU 2
L10: Concat (L10, L1) - =
L11: Deconv 3 × 3 128 ReLU 2
" + }, + { + "category_id": 1, + "poly": [ + 297, + 1652, + 1404, + 1652, + 1404, + 1868, + 297, + 1868 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 300, + 1883, + 1403, + 1883, + 1403, + 2005, + 300, + 2005 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1407, + 1401, + 1407, + 1401, + 1530, + 299, + 1530 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 301, + 1545, + 1397, + 1545, + 1397, + 1638, + 301, + 1638 + ], + "score": 0.965 + }, + { + "category_id": 6, + "poly": [ + 299, + 909, + 1400, + 909, + 1400, + 1003, + 299, + 1003 + ], + "score": 0.947 + }, + { + "category_id": 6, + "poly": [ + 298, + 223, + 1402, + 223, + 1402, + 287, + 298, + 287 + ], + "score": 0.924 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.902 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.849 + }, + { + "category_id": 13, + "poly": [ + 918, + 1577, + 1002, + 1577, + 1002, + 1605, + 918, + 1605 + ], + "score": 0.91, + "latex": "L = 5" + }, + { + "category_id": 13, + "poly": [ + 1027, + 1607, + 1100, + 1607, + 1100, + 1634, + 1027, + 1634 + ], + "score": 0.9, + "latex": "L = 4" + }, + { + "category_id": 13, + "poly": [ + 566, + 642, + 632, + 642, + 632, + 671, + 566, + 671 + ], + "score": 0.72, + "latex": "3 \\times 3" + }, + { + "category_id": 13, + "poly": [ + 540, + 551, + 606, + 551, + 606, + 579, + 540, + 579 + ], + "score": 0.67, + "latex": "4 \\times 4" + }, + { + "category_id": 13, + "poly": [ + 658, + 520, + 724, + 520, + 724, + 549, + 658, + 549 + ], + "score": 0.67, + "latex": "8 \\times 8" + }, + { + "category_id": 13, + "poly": [ + 566, + 703, + 632, + 703, + 632, + 731, + 566, + 731 + ], + "score": 0.47, + "latex": "3 \\times 3" + }, + { + "category_id": 13, + "poly": [ + 653, + 1299, + 695, + 1299, + 695, + 1326, + 653, + 1326 + ], + "score": 0.36, + "latex": "= - 2" + }, + { + "category_id": 13, + "poly": [ + 1278, + 1745, + 1402, + 1745, + 1402, + 1775, + 1278, + 1775 + ], + "score": 0.35, + "latex": "2 0 0 \\mathbf { k } { - } 3 0 0 \\mathbf { k }" + }, + { + "category_id": 13, + "poly": [ + 579, + 1084, + 682, + 1084, + 682, + 1115, + 579, + 1115 + ], + "score": 0.28, + "latex": "K \\times 1 2 8" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 906.0, + 1404.0, + 906.0, + 1404.0, + 945.0, + 294.0, + 945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 940.0, + 1404.0, + 940.0, + 1404.0, + 975.0, + 294.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 971.0, + 532.0, + 971.0, + 532.0, + 1006.0, + 295.0, + 1006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 223.0, + 1404.0, + 223.0, + 1404.0, + 259.0, + 296.0, + 259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 255.0, + 812.0, + 255.0, + 812.0, + 291.0, + 294.0, + 291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2122.0, + 832.0, + 2122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1651.0, + 1405.0, + 1651.0, + 1405.0, + 1691.0, + 292.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1685.0, + 1404.0, + 1685.0, + 1404.0, + 1716.0, + 296.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1711.0, + 1406.0, + 1711.0, + 1406.0, + 1751.0, + 292.0, + 1751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1745.0, + 1277.0, + 1745.0, + 1277.0, + 1780.0, + 295.0, + 1780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 1745.0, + 1406.0, + 1745.0, + 1406.0, + 1780.0, + 1403.0, + 1780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1775.0, + 1405.0, + 1775.0, + 1405.0, + 1809.0, + 292.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1807.0, + 1405.0, + 1807.0, + 1405.0, + 1841.0, + 295.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1837.0, + 1348.0, + 1837.0, + 1348.0, + 1870.0, + 294.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1884.0, + 1405.0, + 1884.0, + 1405.0, + 1916.0, + 295.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1910.0, + 1404.0, + 1910.0, + 1404.0, + 1950.0, + 294.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1943.0, + 1404.0, + 1943.0, + 1404.0, + 1980.0, + 291.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1974.0, + 517.0, + 1974.0, + 517.0, + 2007.0, + 295.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1405.0, + 1405.0, + 1405.0, + 1405.0, + 1443.0, + 293.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1438.0, + 1406.0, + 1438.0, + 1406.0, + 1471.0, + 295.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1469.0, + 1406.0, + 1469.0, + 1406.0, + 1501.0, + 295.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1498.0, + 924.0, + 1498.0, + 924.0, + 1534.0, + 294.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1543.0, + 1403.0, + 1543.0, + 1403.0, + 1579.0, + 293.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1577.0, + 917.0, + 1577.0, + 917.0, + 1611.0, + 296.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1003.0, + 1577.0, + 1403.0, + 1577.0, + 1403.0, + 1611.0, + 1003.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1607.0, + 1026.0, + 1607.0, + 1026.0, + 1640.0, + 295.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1101.0, + 1607.0, + 1113.0, + 1607.0, + 1113.0, + 1640.0, + 1101.0, + 1640.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 295, + 1218, + 1406, + 1218, + 1406, + 1807, + 295, + 1807 + ], + "score": 0.985, + "html": "
ChairMicShipHotdog
PSNR↑
SRNs (Single-scene)26.9626.8520.6026.81
NeRF (Single-scene)33.0032.9128.6536.18
NSVF (Single-scene)33.1934.2727.9337.14
GRF (Multi-scene)32.4932.0227.7634.92
SSIM↑
SRNs (Single-scene)0.9100.9470.7570.923
NeRF (Single-scene)0.9670.9800.8560.974
NSVF (Single-scene)0.9680.9870.8540.980
GRF (Multi-scene)0.9710.9820.8660.975
LPIPS↓
SRNs (Single-scene)0.1060.0630.2990.100
NeRF (Single-scene)0.0460.0280.2060.121
NSVF (Single-scene)0.0430.0100.1620.025
GRF (Multi-scene)0.0320.0190.1670.040
" + }, + { + "category_id": 5, + "poly": [ + 295, + 411, + 1406, + 411, + 1406, + 1046, + 295, + 1046 + ], + "score": 0.984, + "html": "
ChairDrumsLegoMicMaterialsShipHotdogFicusMean
PSNR↑
SRNs26.9617.1820.8526.8518.0920.6026.8120.7322.26
NV28.3322.5826.0827.7824.2223.9330.7124.7926.05
NeRF33.0025.0132.5432.9129.6228.6536.1830.1331.01
NSVF33.1925.1832.2934.2732.6827.9337.1431.2331.74
GRF(Ours)34.5125.8332.9233.9430.9130.1237.4730.7532.06
SSIM↑
SRNs0.9100.7660.8090.9470.8080.7570.9230.8490.846
NV0.9160.8730.8800.9460.8880.7840.9440.9100.893
NeRF0.9670.9250.9610.9800.9490.8560.9740.9640.947
NSVF0.9680.9310.9600.9870.9730.8540.9800.9730.953
GRF(Ours)0.9810.9370.9670.9870.9630.8910.9830.9690.960
LPIPS↓
SRNs0.1060.2670.2000.0630.1740.2990.1000.1490.170
NV0.1090.2140.1750.1070.1300.2760.1090.1620.160
NeRF0.0460.0910.0500.0280.0630.2060.1210.0440.081
NSVF0.0430.0690.0290.0100.0210.1620.0250.0170.047
GRF(Ours)0.0210.0680.0420.0130.0410.1410.0280.0320.048
" + }, + { + "category_id": 6, + "poly": [ + 296, + 294, + 1404, + 294, + 1404, + 390, + 296, + 390 + ], + "score": 0.955 + }, + { + "category_id": 6, + "poly": [ + 297, + 1090, + 1404, + 1090, + 1404, + 1192, + 297, + 1192 + ], + "score": 0.918 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.89 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.857 + }, + { + "category_id": 0, + "poly": [ + 300, + 229, + 1263, + 229, + 1263, + 262, + 300, + 262 + ], + "score": 0.316 + }, + { + "category_id": 15, + "poly": [ + 293.0, + 293.0, + 1405.0, + 293.0, + 1405.0, + 331.0, + 293.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 324.0, + 1405.0, + 324.0, + 1405.0, + 362.0, + 295.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 355.0, + 1239.0, + 355.0, + 1239.0, + 393.0, + 294.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1089.0, + 1405.0, + 1089.0, + 1405.0, + 1125.0, + 295.0, + 1125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1118.0, + 1406.0, + 1118.0, + 1406.0, + 1161.0, + 294.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1157.0, + 775.0, + 1157.0, + 775.0, + 1193.0, + 295.0, + 1193.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 1268.0, + 229.0, + 1268.0, + 264.0, + 295.0, + 264.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 14, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 6, + "poly": [ + 294, + 639, + 1399, + 639, + 1399, + 709, + 294, + 709 + ], + "score": 0.901 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.848 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.822 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 106, + 297, + 106 + ], + "score": 0.115 + }, + { + "category_id": 5, + "poly": [ + 294, + 730, + 1405, + 730, + 1405, + 1614, + 294, + 1614 + ], + "score": 0.975, + "html": "
Drums
Lego PSNR↑MaterialsFicus
GRF (Group 1) 13.23 13.5312.26 15.47 15.42 15.72
NeRF( F(Group2,100 iters) 14.54 14.9220.04 20.40 20.81
NeRF( (Group2,1k iters) 18.0119.81 23.36 23.47
NeRF (Group 2,10k iters) 21.57 24.9923.35
GRF (Group 2,100 iters) 18.70 20.2418.81 21.03 19.69
GRF (Group2,1k iters) 20.49 23.6421.87 22.02 22.00
GRF (Group2,10k iters) 23.11 27.0725.11 25.11 25.10
SSIM↑
F (Group 1) 0.7620.736 0.703 0.849
NeRF(Group 2,100 iters)0.769 0.717 0.716
NeRF(Group 2,1k iters) 0.793 0.7750.812 0.857 0.809 0.877 0.896 0.875
NeRF F(Group2,10k iters) 0.8650.862
GRF(Group 2,100 iters) 0.822 0.8130.829 0.878 0.835
GRF (Group2,1k iters) 0.8560.877 0.878 0.894 0.876 0.916
GRF F(Group2,10k iters) 0.9010.924 0.913 0.923
LPIPS↓
0.256 0.273 0.301 0.150
GRF (Group 1) NeRF(Group 2,100 iters)0.332 0.395 0.314
NeRF(Group 2,1k iters) 0.254 0.2640.393 0.359 0.229 0.164 0.228 0.137
NeRF (Group2,10k iters) 0.1570.154 0.128 0.110
GRF (Group 2,100 iters) 0.1960.203 0.159 0.117 0.169 0.128
GRF F(Group2,1k iters) 0.154 GRF (Group 2,10k iters) 0.1040.138 0.123 0.097 0.090 0.090 0.071
" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 637.0, + 1403.0, + 637.0, + 1403.0, + 677.0, + 293.0, + 677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 669.0, + 754.0, + 669.0, + 754.0, + 714.0, + 293.0, + 714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 871.0, + 2085.0, + 871.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 72.0, + 856.0, + 72.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 15, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 295, + 412, + 1405, + 412, + 1405, + 962, + 295, + 962 + ], + "score": 0.985, + "html": "
RoomFernLeavesFortressOrchidsFlowerT-RexHornsMean
PSNR↑
SRNs27.2921.3718.2426.6317.3724.6322.8724.3322.84
LLFF28.4222.8519.5229.4018.5225.4624.1524.7024.13
NeRF32.7025.1720.9231.1620.3627.4026.8027.4526.50
GRF(Ours)31.7425.7221.1631.2820.8827.8327.0127.5026.64
SSIM↑
SRNs0.8830.6110.5200.6410.4490.7380.7610.7420.668
LLFF0.9320.7530.6970.8720.5880.8440.8570.8400.798
NeRF0.9480.7920.6900.8810.6410.8270.8800.8280.811
GRF(Ours)0.9510.8270.7270.8980.6670.8520.9010.8730.837
LPIPS↓
SRNs0.2400.4590.4400.4530.4670.2880.2980.3760.378
LLFF0.1550.2470.2160.1730.3130.1740.2220.1930.212
NeRF0.1780.2800.3160.1710.3210.2190.2490.2680.250
GRF(Ours)0.1040.1910.2380.1270.2750.1760.1460.1690.178
" + }, + { + "category_id": 6, + "poly": [ + 297, + 294, + 1404, + 294, + 1404, + 392, + 297, + 392 + ], + "score": 0.954 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.892 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2112, + 836, + 2112 + ], + "score": 0.845 + }, + { + "category_id": 1, + "poly": [ + 299, + 230, + 1207, + 230, + 1207, + 262, + 299, + 262 + ], + "score": 0.509 + }, + { + "category_id": 0, + "poly": [ + 299, + 230, + 1207, + 230, + 1207, + 262, + 299, + 262 + ], + "score": 0.143 + }, + { + "category_id": 15, + "poly": [ + 294.0, + 291.0, + 1405.0, + 291.0, + 1405.0, + 331.0, + 294.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 324.0, + 1406.0, + 324.0, + 1406.0, + 359.0, + 295.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 353.0, + 580.0, + 353.0, + 580.0, + 396.0, + 293.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 1211.0, + 227.0, + 1211.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 1211.0, + 227.0, + 1211.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 16, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1318, + 1404, + 1318, + 1404, + 1489, + 296, + 1489 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 298, + 1200, + 1404, + 1200, + 1404, + 1303, + 298, + 1303 + ], + "score": 0.964 + }, + { + "category_id": 3, + "poly": [ + 297, + 1523, + 1404, + 1523, + 1404, + 1738, + 297, + 1738 + ], + "score": 0.956 + }, + { + "category_id": 4, + "poly": [ + 295, + 1760, + 1402, + 1760, + 1402, + 1831, + 295, + 1831 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 295, + 590, + 1405, + 590, + 1405, + 999, + 295, + 999 + ], + "score": 0.936 + }, + { + "category_id": 1, + "poly": [ + 297, + 370, + 1404, + 370, + 1404, + 576, + 297, + 576 + ], + "score": 0.906 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.902 + }, + { + "category_id": 1, + "poly": [ + 297, + 1014, + 1403, + 1014, + 1403, + 1185, + 297, + 1185 + ], + "score": 0.902 + }, + { + "category_id": 1, + "poly": [ + 299, + 286, + 1401, + 286, + 1401, + 355, + 299, + 355 + ], + "score": 0.871 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.857 + }, + { + "category_id": 0, + "poly": [ + 299, + 229, + 838, + 229, + 838, + 261, + 299, + 261 + ], + "score": 0.836 + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1664.0, + 369.0, + 1664.0, + 369.0, + 1698.0, + 327.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 486.0, + 1662.0, + 534.0, + 1662.0, + 534.0, + 1701.0, + 486.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 639.0, + 1662.0, + 685.0, + 1662.0, + 685.0, + 1701.0, + 639.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 759.0, + 1667.0, + 799.0, + 1667.0, + 799.0, + 1702.0, + 759.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 1677.0, + 834.0, + 1677.0, + 834.0, + 1693.0, + 819.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1667.0, + 878.0, + 1667.0, + 878.0, + 1702.0, + 835.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 897.0, + 1665.0, + 955.0, + 1665.0, + 955.0, + 1703.0, + 897.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 1662.0, + 1136.0, + 1662.0, + 1136.0, + 1702.0, + 1063.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1236.0, + 1665.0, + 1402.0, + 1665.0, + 1402.0, + 1701.0, + 1236.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 427.0, + 1694.0, + 589.0, + 1694.0, + 589.0, + 1740.0, + 427.0, + 1740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 718.0, + 1695.0, + 971.0, + 1695.0, + 971.0, + 1739.0, + 718.0, + 1739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 996.0, + 1694.0, + 1199.0, + 1694.0, + 1199.0, + 1742.0, + 996.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1758.0, + 1405.0, + 1758.0, + 1405.0, + 1798.0, + 294.0, + 1798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1791.0, + 566.0, + 1791.0, + 566.0, + 1834.0, + 294.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2122.0, + 832.0, + 2122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 229.0, + 841.0, + 229.0, + 841.0, + 265.0, + 296.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1313.0, + 1409.0, + 1313.0, + 1409.0, + 1358.0, + 291.0, + 1358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1351.0, + 1406.0, + 1351.0, + 1406.0, + 1389.0, + 294.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1385.0, + 1406.0, + 1385.0, + 1406.0, + 1423.0, + 294.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1419.0, + 1406.0, + 1419.0, + 1406.0, + 1460.0, + 294.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1452.0, + 922.0, + 1452.0, + 922.0, + 1493.0, + 294.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1201.0, + 1405.0, + 1201.0, + 1405.0, + 1236.0, + 297.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1232.0, + 1406.0, + 1232.0, + 1406.0, + 1273.0, + 293.0, + 1273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1269.0, + 1364.0, + 1269.0, + 1364.0, + 1305.0, + 296.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 591.0, + 1405.0, + 591.0, + 1405.0, + 626.0, + 317.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 624.0, + 1405.0, + 624.0, + 1405.0, + 662.0, + 317.0, + 662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 659.0, + 627.0, + 659.0, + 627.0, + 694.0, + 318.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 692.0, + 1308.0, + 692.0, + 1308.0, + 728.0, + 318.0, + 728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 725.0, + 1405.0, + 725.0, + 1405.0, + 761.0, + 319.0, + 761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 755.0, + 1406.0, + 755.0, + 1406.0, + 801.0, + 317.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 794.0, + 561.0, + 794.0, + 561.0, + 830.0, + 319.0, + 830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 828.0, + 1406.0, + 828.0, + 1406.0, + 865.0, + 318.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 863.0, + 1403.0, + 863.0, + 1403.0, + 897.0, + 319.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 897.0, + 1403.0, + 897.0, + 1403.0, + 932.0, + 319.0, + 932.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 929.0, + 1405.0, + 929.0, + 1405.0, + 967.0, + 319.0, + 967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 962.0, + 409.0, + 962.0, + 409.0, + 1004.0, + 317.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 370.0, + 1406.0, + 370.0, + 1406.0, + 407.0, + 294.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 402.0, + 1404.0, + 402.0, + 1404.0, + 440.0, + 295.0, + 440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 437.0, + 1406.0, + 437.0, + 1406.0, + 474.0, + 295.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 469.0, + 1405.0, + 469.0, + 1405.0, + 509.0, + 294.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 505.0, + 1407.0, + 505.0, + 1407.0, + 542.0, + 295.0, + 542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 540.0, + 1269.0, + 540.0, + 1269.0, + 577.0, + 294.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1011.0, + 1407.0, + 1011.0, + 1407.0, + 1052.0, + 292.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1046.0, + 1408.0, + 1046.0, + 1408.0, + 1086.0, + 292.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1080.0, + 1404.0, + 1080.0, + 1404.0, + 1119.0, + 295.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1116.0, + 1404.0, + 1116.0, + 1404.0, + 1154.0, + 295.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1147.0, + 1091.0, + 1147.0, + 1091.0, + 1189.0, + 295.0, + 1189.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 285.0, + 1403.0, + 285.0, + 1403.0, + 322.0, + 295.0, + 322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 319.0, + 1242.0, + 319.0, + 1242.0, + 360.0, + 297.0, + 360.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 17, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 760, + 1404, + 760, + 1404, + 999, + 297, + 999 + ], + "score": 0.976 + }, + { + "category_id": 3, + "poly": [ + 351, + 1037, + 1351, + 1037, + 1351, + 1895, + 351, + 1895 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 298, + 285, + 1402, + 285, + 1402, + 422, + 298, + 422 + ], + "score": 0.96 + }, + { + "category_id": 4, + "poly": [ + 297, + 1916, + 1403, + 1916, + 1403, + 2021, + 297, + 2021 + ], + "score": 0.954 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.897 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.86 + }, + { + "category_id": 1, + "poly": [ + 298, + 437, + 1404, + 437, + 1404, + 573, + 298, + 573 + ], + "score": 0.661 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1259, + 229, + 1259, + 262, + 299, + 262 + ], + "score": 0.631 + }, + { + "category_id": 1, + "poly": [ + 306, + 576, + 1400, + 576, + 1400, + 674, + 306, + 674 + ], + "score": 0.448 + }, + { + "category_id": 1, + "poly": [ + 304, + 677, + 1397, + 677, + 1397, + 745, + 304, + 745 + ], + "score": 0.335 + }, + { + "category_id": 0, + "poly": [ + 299, + 229, + 1259, + 229, + 1259, + 262, + 299, + 262 + ], + "score": 0.29 + }, + { + "category_id": 15, + "poly": [ + 709.0, + 1028.0, + 1190.0, + 1028.0, + 1190.0, + 1072.0, + 709.0, + 1072.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 1106.0, + 494.0, + 1106.0, + 494.0, + 1145.0, + 408.0, + 1145.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1013.0, + 1137.0, + 1031.0, + 1137.0, + 1031.0, + 1151.0, + 1013.0, + 1151.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1143.0, + 532.0, + 1143.0, + 532.0, + 1173.0, + 372.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 403.0, + 1226.0, + 492.0, + 1226.0, + 492.0, + 1268.0, + 403.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 1265.0, + 530.0, + 1265.0, + 530.0, + 1295.0, + 370.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 1360.0, + 489.0, + 1360.0, + 489.0, + 1398.0, + 402.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 1395.0, + 528.0, + 1395.0, + 528.0, + 1426.0, + 366.0, + 1426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 889.0, + 1423.0, + 908.0, + 1423.0, + 908.0, + 1436.0, + 889.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1142.0, + 1408.0, + 1179.0, + 1408.0, + 1179.0, + 1448.0, + 1142.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 447.0, + 1441.0, + 464.0, + 1441.0, + 464.0, + 1454.0, + 447.0, + 1454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 492.0, + 1450.0, + 505.0, + 1450.0, + 505.0, + 1459.0, + 492.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 1529.0, + 497.0, + 1529.0, + 497.0, + 1567.0, + 401.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1565.0, + 530.0, + 1565.0, + 530.0, + 1595.0, + 372.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1617.0, + 460.0, + 1617.0, + 460.0, + 1627.0, + 449.0, + 1627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1302.0, + 1603.0, + 1345.0, + 1603.0, + 1345.0, + 1663.0, + 1302.0, + 1663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1061.0, + 1621.0, + 1092.0, + 1621.0, + 1092.0, + 1648.0, + 1061.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1139.0, + 1621.0, + 1178.0, + 1621.0, + 1178.0, + 1670.0, + 1139.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 1742.0, + 420.0, + 1742.0, + 420.0, + 1775.0, + 370.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 562.0, + 1735.0, + 584.0, + 1735.0, + 584.0, + 1757.0, + 562.0, + 1757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 434.0, + 1822.0, + 602.0, + 1822.0, + 602.0, + 1862.0, + 434.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 668.0, + 1839.0, + 694.0, + 1839.0, + 694.0, + 1855.0, + 668.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 1843.0, + 895.0, + 1843.0, + 895.0, + 1851.0, + 885.0, + 1851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1139.0, + 1834.0, + 1169.0, + 1834.0, + 1169.0, + 1864.0, + 1139.0, + 1864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 1821.0, + 1340.0, + 1821.0, + 1340.0, + 1870.0, + 1306.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.75, + 1118.0, + 1109.75, + 1118.0, + 1109.75, + 1163.5, + 1076.75, + 1163.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1199.0, + 1406.0, + 1289.0, + 1406.0, + 1289.0, + 1437.5, + 1199.0, + 1437.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1663.0, + 504.0, + 1663.0, + 504.0, + 1693.0, + 469.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1200.0, + 1630.5, + 1289.0, + 1630.5, + 1289.0, + 1662.5, + 1200.0, + 1662.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.25, + 1668.0, + 419.25, + 1668.0, + 419.25, + 1689.0, + 381.25, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 470.0, + 1734.0, + 495.0, + 1734.0, + 495.0, + 1768.0, + 470.0, + 1768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 1816.5, + 1107.0, + 1816.5, + 1107.0, + 1856.5, + 1049.0, + 1856.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1195.0, + 1828.5, + 1284.0, + 1828.5, + 1284.0, + 1860.5, + 1195.0, + 1860.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1913.0, + 1404.0, + 1913.0, + 1404.0, + 1953.0, + 293.0, + 1953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1945.0, + 1407.0, + 1945.0, + 1407.0, + 1992.0, + 291.0, + 1992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1980.0, + 580.0, + 1980.0, + 580.0, + 2024.0, + 294.0, + 2024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 228.0, + 1264.0, + 228.0, + 1264.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 756.0, + 1404.0, + 756.0, + 1404.0, + 798.0, + 294.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 791.0, + 1404.0, + 791.0, + 1404.0, + 833.0, + 294.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 825.0, + 1404.0, + 825.0, + 1404.0, + 864.0, + 295.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 862.0, + 1406.0, + 862.0, + 1406.0, + 897.0, + 295.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 898.0, + 1404.0, + 898.0, + 1404.0, + 931.0, + 296.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 930.0, + 1405.0, + 930.0, + 1405.0, + 967.0, + 295.0, + 967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 962.0, + 995.0, + 962.0, + 995.0, + 1001.0, + 295.0, + 1001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 286.0, + 1407.0, + 286.0, + 1407.0, + 324.0, + 294.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 319.0, + 1407.0, + 319.0, + 1407.0, + 356.0, + 293.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 351.0, + 1404.0, + 351.0, + 1404.0, + 391.0, + 293.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 388.0, + 1179.0, + 388.0, + 1179.0, + 423.0, + 296.0, + 423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 435.0, + 1406.0, + 435.0, + 1406.0, + 473.0, + 291.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 469.0, + 1405.0, + 469.0, + 1405.0, + 510.0, + 315.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 503.0, + 1406.0, + 503.0, + 1406.0, + 543.0, + 316.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 539.0, + 485.0, + 539.0, + 485.0, + 575.0, + 318.0, + 575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 228.0, + 1264.0, + 228.0, + 1264.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 568.0, + 1404.0, + 568.0, + 1404.0, + 613.0, + 297.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 606.0, + 1404.0, + 606.0, + 1404.0, + 645.0, + 318.0, + 645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 640.0, + 716.0, + 640.0, + 716.0, + 678.0, + 321.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 672.0, + 1402.0, + 672.0, + 1402.0, + 712.0, + 296.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 707.0, + 832.0, + 707.0, + 832.0, + 750.0, + 316.0, + 750.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 18, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 302, + 453, + 1382, + 453, + 1382, + 1807, + 302, + 1807 + ], + "score": 0.968 + }, + { + "category_id": 4, + "poly": [ + 303, + 1809, + 1386, + 1809, + 1386, + 1844, + 303, + 1844 + ], + "score": 0.899 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.881 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 866, + 2088, + 866, + 2113, + 834, + 2113 + ], + "score": 0.854 + }, + { + "category_id": 2, + "poly": [ + 301, + 230, + 732, + 230, + 732, + 262, + 301, + 262 + ], + "score": 0.284 + }, + { + "category_id": 14, + "poly": [ + 277, + 425, + 1387, + 425, + 1387, + 1324, + 277, + 1324 + ], + "score": 0.79, + "latex": "\\begin{array}{c} \\begin{array} { c c } { { } } & { { } } \\\\ { { \\Im } } & { { \\Im } } \\\\ { { } } & { { \\Im } } \\\\ { { } } & { { \\Im } } \\\\ { { } } & { { \\Im } } \\end{array} \\left( \\begin{array} { c c } { { } } & { { } } \\\\ { { } } & { { } } \\\\ { { \\Im } } & { { \\Im } } \\end{array} \\right) \\\\ { { } } & { { } } \\\\ { { \\Im } } & { { \\Im } } \\\\ { { } } & { { \\Im } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 291, + 790, + 1389, + 790, + 1389, + 1693, + 291, + 1693 + ], + "score": 0.57, + "latex": "\\frac { 5 } { 6 } \\div \\frac { 5 } { 7 } = \\frac { 5 } { 7 }" + }, + { + "category_id": 15, + "poly": [ + 409.0, + 1740.0, + 490.0, + 1740.0, + 490.0, + 1777.0, + 409.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 759.0, + 1737.0, + 911.0, + 1737.0, + 911.0, + 1781.0, + 759.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1135.0, + 1740.0, + 1301.0, + 1740.0, + 1301.0, + 1775.0, + 1135.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 941.5, + 874.0, + 941.5, + 874.0, + 1078.5, + 733.0, + 1078.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1277.0, + 1025.5, + 1308.0, + 1025.5, + 1308.0, + 1052.5, + 1277.0, + 1052.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 1805.0, + 1392.0, + 1805.0, + 1392.0, + 1848.0, + 306.0, + 1848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 2083.0, + 872.0, + 2083.0, + 872.0, + 2123.0, + 828.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 228.0, + 733.0, + 228.0, + 733.0, + 265.0, + 297.0, + 265.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 19, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 305, + 469, + 1368, + 469, + 1368, + 1706, + 305, + 1706 + ], + "score": 0.972 + }, + { + "category_id": 4, + "poly": [ + 296, + 1724, + 1401, + 1724, + 1401, + 1789, + 296, + 1789 + ], + "score": 0.924 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.657 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 863, + 2088, + 863, + 2113, + 834, + 2113 + ], + "score": 0.644 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.261 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 863, + 2088, + 863, + 2113, + 834, + 2113 + ], + "score": 0.167 + }, + { + "category_id": 15, + "poly": [ + 473.0, + 1192.0, + 501.0, + 1192.0, + 501.0, + 1207.0, + 473.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1653.0, + 570.0, + 1653.0, + 570.0, + 1702.0, + 333.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 1657.0, + 962.0, + 1657.0, + 962.0, + 1698.0, + 743.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1103.0, + 1653.0, + 1375.0, + 1653.0, + 1375.0, + 1697.0, + 1103.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1722.0, + 1405.0, + 1722.0, + 1405.0, + 1762.0, + 294.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1754.0, + 461.0, + 1754.0, + 461.0, + 1790.0, + 294.0, + 1790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2124.0, + 830.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2124.0, + 830.0, + 2124.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 20, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 306, + 449, + 1355, + 449, + 1355, + 1716, + 306, + 1716 + ], + "score": 0.968 + }, + { + "category_id": 4, + "poly": [ + 299, + 1737, + 1403, + 1737, + 1403, + 1799, + 299, + 1799 + ], + "score": 0.934 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.88 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 865, + 2088, + 865, + 2113, + 834, + 2113 + ], + "score": 0.832 + }, + { + "category_id": 15, + "poly": [ + 334.0, + 1662.0, + 575.0, + 1662.0, + 575.0, + 1713.0, + 334.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 1663.0, + 974.0, + 1663.0, + 974.0, + 1709.0, + 749.0, + 1709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 1661.0, + 1363.0, + 1661.0, + 1363.0, + 1706.0, + 1116.0, + 1706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1735.0, + 1400.0, + 1735.0, + 1400.0, + 1771.0, + 295.0, + 1771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1765.0, + 461.0, + 1765.0, + 461.0, + 1801.0, + 295.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2125.0, + 829.0, + 2125.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 21, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 305, + 467, + 1397, + 467, + 1397, + 1721, + 305, + 1721 + ], + "score": 0.974 + }, + { + "category_id": 4, + "poly": [ + 298, + 1736, + 1403, + 1736, + 1403, + 1799, + 298, + 1799 + ], + "score": 0.936 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.886 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 865, + 2088, + 865, + 2113, + 834, + 2113 + ], + "score": 0.845 + }, + { + "category_id": 15, + "poly": [ + 841.0, + 564.0, + 861.0, + 564.0, + 861.0, + 605.0, + 841.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 874.0, + 867.0, + 874.0, + 867.0, + 923.0, + 842.0, + 923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 788.0, + 911.0, + 860.0, + 911.0, + 860.0, + 963.0, + 788.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 1658.0, + 575.0, + 1658.0, + 575.0, + 1716.0, + 332.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 1665.0, + 976.0, + 1665.0, + 976.0, + 1710.0, + 749.0, + 1710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 1663.0, + 1402.0, + 1663.0, + 1402.0, + 1709.0, + 1114.0, + 1709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 387.0, + 897.0, + 473.0, + 897.0, + 473.0, + 958.0, + 387.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1736.0, + 1403.0, + 1736.0, + 1403.0, + 1771.0, + 294.0, + 1771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1765.0, + 462.0, + 1765.0, + 462.0, + 1801.0, + 294.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2123.0, + 830.0, + 2123.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 22, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 301, + 455, + 1386, + 455, + 1386, + 1722, + 301, + 1722 + ], + "score": 0.976 + }, + { + "category_id": 4, + "poly": [ + 298, + 1736, + 1401, + 1736, + 1401, + 1799, + 298, + 1799 + ], + "score": 0.934 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.892 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 865, + 2088, + 865, + 2113, + 834, + 2113 + ], + "score": 0.851 + }, + { + "category_id": 15, + "poly": [ + 332.0, + 1668.0, + 571.0, + 1668.0, + 571.0, + 1714.0, + 332.0, + 1714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 742.0, + 1667.0, + 973.0, + 1667.0, + 973.0, + 1709.0, + 742.0, + 1709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 1667.0, + 1394.0, + 1667.0, + 1394.0, + 1709.0, + 1115.0, + 1709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 810.75, + 794.0, + 900.75, + 794.0, + 900.75, + 829.0, + 810.75, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1192.0, + 804.5, + 1351.0, + 804.5, + 1351.0, + 852.5, + 1192.0, + 852.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.75, + 1398.0, + 843.75, + 1398.0, + 843.75, + 1485.0, + 750.75, + 1485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1736.0, + 1403.0, + 1736.0, + 1403.0, + 1771.0, + 294.0, + 1771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1765.0, + 461.0, + 1765.0, + 461.0, + 1801.0, + 293.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2125.0, + 829.0, + 2125.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 23, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 303, + 534, + 1396, + 534, + 1396, + 1632, + 303, + 1632 + ], + "score": 0.975 + }, + { + "category_id": 4, + "poly": [ + 290, + 1655, + 1404, + 1655, + 1404, + 1719, + 290, + 1719 + ], + "score": 0.933 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 865, + 2088, + 865, + 2113, + 834, + 2113 + ], + "score": 0.849 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.538 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.37 + }, + { + "category_id": 15, + "poly": [ + 363.0, + 1583.0, + 585.0, + 1583.0, + 585.0, + 1635.0, + 363.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 744.0, + 1587.0, + 955.0, + 1587.0, + 955.0, + 1631.0, + 744.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 1588.0, + 1357.0, + 1588.0, + 1357.0, + 1628.0, + 1094.0, + 1628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1655.0, + 1403.0, + 1655.0, + 1403.0, + 1691.0, + 293.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1681.0, + 392.0, + 1681.0, + 392.0, + 1723.0, + 291.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 2083.0, + 871.0, + 2083.0, + 871.0, + 2124.0, + 829.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 24, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 301, + 531, + 1397, + 531, + 1397, + 1634, + 301, + 1634 + ], + "score": 0.975 + }, + { + "category_id": 4, + "poly": [ + 288, + 1657, + 1404, + 1657, + 1404, + 1722, + 288, + 1722 + ], + "score": 0.929 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 865, + 2088, + 865, + 2113, + 834, + 2113 + ], + "score": 0.83 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.571 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.34 + }, + { + "category_id": 15, + "poly": [ + 361.0, + 1588.0, + 585.0, + 1588.0, + 585.0, + 1635.0, + 361.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 744.0, + 1589.0, + 955.0, + 1589.0, + 955.0, + 1633.0, + 744.0, + 1633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1096.0, + 1589.0, + 1357.0, + 1589.0, + 1357.0, + 1629.0, + 1096.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1655.0, + 1403.0, + 1655.0, + 1403.0, + 1691.0, + 294.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1687.0, + 390.0, + 1687.0, + 390.0, + 1722.0, + 292.0, + 1722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2121.0, + 830.0, + 2121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 25, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 300, + 531, + 1397, + 531, + 1397, + 1635, + 300, + 1635 + ], + "score": 0.975 + }, + { + "category_id": 4, + "poly": [ + 286, + 1660, + 1403, + 1660, + 1403, + 1725, + 286, + 1725 + ], + "score": 0.924 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 865, + 2087, + 865, + 2113, + 834, + 2113 + ], + "score": 0.851 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.572 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.338 + }, + { + "category_id": 15, + "poly": [ + 913.0, + 847.0, + 963.0, + 847.0, + 963.0, + 884.0, + 913.0, + 884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 360.0, + 1586.0, + 586.0, + 1586.0, + 586.0, + 1638.0, + 360.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 745.0, + 1591.0, + 954.0, + 1591.0, + 954.0, + 1635.0, + 745.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1097.0, + 1591.0, + 1357.0, + 1591.0, + 1357.0, + 1631.0, + 1097.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1299.0, + 1093.5, + 1337.0, + 1093.5, + 1337.0, + 1116.5, + 1299.0, + 1116.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 939.0, + 1399.5, + 970.0, + 1399.5, + 970.0, + 1418.5, + 939.0, + 1418.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1659.0, + 1405.0, + 1659.0, + 1405.0, + 1695.0, + 294.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1686.0, + 391.0, + 1686.0, + 391.0, + 1728.0, + 291.0, + 1728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2125.0, + 830.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 26, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 303, + 530, + 1397, + 530, + 1397, + 1636, + 303, + 1636 + ], + "score": 0.975 + }, + { + "category_id": 4, + "poly": [ + 287, + 1659, + 1404, + 1659, + 1404, + 1724, + 287, + 1724 + ], + "score": 0.926 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 865, + 2088, + 865, + 2113, + 834, + 2113 + ], + "score": 0.848 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.511 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.4 + }, + { + "category_id": 15, + "poly": [ + 859.0, + 1493.0, + 877.0, + 1493.0, + 877.0, + 1501.0, + 859.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 1493.0, + 891.0, + 1493.0, + 891.0, + 1501.0, + 874.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 1588.0, + 584.0, + 1588.0, + 584.0, + 1638.0, + 362.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1593.0, + 957.0, + 1593.0, + 957.0, + 1633.0, + 746.0, + 1633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1096.0, + 1594.0, + 1357.0, + 1594.0, + 1357.0, + 1631.0, + 1096.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1303.25, + 1200.5, + 1323.25, + 1200.5, + 1323.25, + 1287.5, + 1303.25, + 1287.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.25, + 1448.0, + 955.25, + 1448.0, + 955.25, + 1541.0, + 839.25, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1658.0, + 1405.0, + 1658.0, + 1405.0, + 1694.0, + 294.0, + 1694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1687.0, + 391.0, + 1687.0, + 391.0, + 1725.0, + 292.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 2084.0, + 870.0, + 2084.0, + 870.0, + 2121.0, + 830.0, + 2121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 108.0, + 298.0, + 108.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 27, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/r1G4z8cge/r1G4z8cge.md b/parse/train/r1G4z8cge/r1G4z8cge.md new file mode 100644 index 0000000000000000000000000000000000000000..52f39de758e53334342c9f7fb2556d0bbc7bb561 --- /dev/null +++ b/parse/train/r1G4z8cge/r1G4z8cge.md @@ -0,0 +1,495 @@ +# MOLLIFYING NETWORKS + +Caglar Gulcehre1, Marcin Moczulski2,∗, Francesco Visin3,∗ Yoshua Bengio1 1 University of Montreal, 2 University of Oxford, 3 Politecnico di Milano + +# ABSTRACT + +The optimization of deep neural networks can be more challenging than the traditional convex optimization problems due to highly non-convex nature of the loss function, e.g. it can involve pathological landscapes such as saddle-surfaces that can be difficult to escape from for algorithms based on simple gradient descent. In this paper, we attack the problem of optimization of highly non-convex neural networks objectives by starting with a smoothed – or mollified – objective function which becomes more complex as the training proceeds. Our proposition is inspired by the recent studies in continuation methods: similarly to curriculum methods, we begin by learning an easier (possibly convex) objective function and let it evolve during training until it eventually becomes the original, difficult to optimize objective function. The complexity of the mollified networks is controlled by a single hyperparameter that is annealed during training. We show improvements on various difficult optimization tasks and establish a relationship between recent works on continuation methods for neural networks and mollifiers. + +# 1 INTRODUCTION + +In the last few years, deep neural networks – i.e. convolutional networks (LeCun et al., 1989), LSTMs (Hochreiter & Schmidhuber, 1997a) or GRUs (Cho et al., 2014) – set the state of the art on a range of challenging tasks (Szegedy et al., 2014; Visin et al., 2015; Hinton et al., 2012; Sutskever et al., 2014; Bahdanau et al., 2014; Mnih et al., 2013; Silver et al., 2016). However when trained with variants of SGD (Bottou, 1998) deep networks can be difficult to optimize due to their highly non-linear and non-convex nature (Choromanska et al., 2014; Dauphin et al., 2014). + +A number of approaches were proposed to alleviate the difficulty of optimization: addressing the problem of the internal covariate shift with Batch Normalization (Ioffe & Szegedy, 2015), learning with a curriculum (Bengio et al., 2009), recently an approach to train RNNs with diffusion process (Mobahi, 2016), and graduated optimization (Hazan et al., 2015). The impact of noise injection on the behavior of modern deep learning methods has been explored by Neelakantan et al. (2015a). Hazan et al. (2015) have shown that injecting a particular noise and scheduling it carefully, can guarantee the convergence in $O ( 1 / \sigma ^ { 2 } \epsilon ^ { 2 } )$ steps for $\epsilon$ -optimal and $\sigma$ -nice functions. Similar to our work graduated optimization optimizes a smoothed objective function without performing expensive convolutions. Injecting noise to the activation functions and scheduling it have been recently shown to improve the performance on a wide variety of tasks (Gulcehre et al., 2016). + +We connect the ideas of curriculum learning and continuation methods with those arising from models with skip connections and using layers that compute near-identity transformations. Skip connections allow to train very deep residual and highway architectures (He et al., 2015; Srivastava et al., 2015) by skipping layers or block of layers. Similarly, it has been shown that stochastically changing the depth of a network during training (Huang et al., 2016b) does not prevent convergence and enables better generalization performance. + +We discuss the idea of mollification for neural networks – a form of differentiable smoothing of the loss function connected to noisy activations – which in our case can be interpreted as a form of adaptive noise injection which is controlled by a single hyperparameter. Inspired by Huang et al. (2016b), we use a hyperparameter to stochastically control the depth of our network. This allows us to start the optimization from a convex objective function (as long as the optimized criterion is convex, e.g. linear or logistic regression) and to slowly introduce more complexity into the model by annealing the hyperparameter, thus making the network deeper and increasingly non-linear. + +![](images/a43e573759ef754c90bf6fbf3615df4808ea481cc1b4c0fe1226a5cfec94d678.jpg) +Figure 1: A sequence of optimization problems of increasing complexity, where the first ones are easy to solve but only the last one corresponds to the actual problem of interest. It is possible to tackle the problems in order, starting each time at the solution of the previous one and tracking the local minima along the way. + +An important difference of our work compared to injecting noise to the gradients as it is explored in (Hazan et al., 2015; Neelakantan et al., 2015b) is that we inject the noise in the forward computation of the graph and we shape the cost function directly. As a result the cost function for the mollified network both at the test time and during the training are consistent and this makes the early-stopping much easier. + +# 2 MOLLIFYING OBJECTIVE FUNCTIONS + +# 2.1 CONTINUATION AND ANNEALING METHODS + +Continuation methods and simulated annealing provide a general strategy to reduce the impact of local minima and deal with non-convex, continuous, but not necessarily everywhere differentiable objective functions by smoothing the original objective function and gradually reducing the amount of smoothing during training (Allgower & Georg, 1980) (see Fig. 1). + +In machine learning, approaches based on curriculum learning (Bengio et al., 2009) are inspired by this principle and define a sequence of gradually more difficult training tasks (or training distributions) that eventually converge to the task of interest. + +In the context of stochastic gradient descent, we use a stochastic estimation of the gradient for the smoothed objective function. This is convenient because it may not be analytically feasible to compute the smoothed function, but a Monte-Carlo estimate can often be obtained easily. + +In this paper we construct a sequence of smoothed objective functions obtained with a form of mollification and we progressively optimize them. The training procedure iterates over the sequence of objective functions starting from the simpler ones – i.e. with a smoother loss surface – and moving towards more complex ones until the last, original, objective function is reached.1 + +# 2.2 MOLLIFIERS AND WEAK GRADIENTS + +We smooth the loss function $\mathcal { L }$ , which is parametrized by $\boldsymbol \theta \in \mathbb { R } ^ { n }$ , by convolving it with another function $K ( \cdot )$ with stride $\tau \in \mathbb { R } ^ { n }$ : + +$$ +\mathscr { L } _ { K } ( \pmb { \theta } ) = ( \mathscr { L } * K ) ( \pmb { \theta } ) = \int _ { - \infty } ^ { + \infty } \mathscr { L } ( \pmb { \theta } - \pmb { \tau } ) K ( \pmb { \tau } ) d \pmb { \tau } +$$ + +Although there are many choices for the function $K ( \cdot )$ , we focus on those that satisfy the definition of a mollifier. + +A mollifier is an infinitely differentiable function that behaves like an approximate identity in the group of convolutions of integrable functions. If $K ( \cdot )$ is an infinitely differentiable function, that converges to the Dirac delta function when appropriately rescaled and for any integrable function $\mathcal { L }$ , then it is a mollifier: + +$$ +\mathcal { L } ( \pmb \theta ) = \operatorname* { l i m } _ { \epsilon 0 } \int \epsilon ^ { - n } K ( \pmb \tau / \epsilon ) \mathcal { L } ( \pmb \theta - \pmb \tau ) d \pmb \tau . +$$ + +If we choose $K ( \cdot )$ to be a mollifier and obtain the smoothed loss function $\mathcal { L } _ { K }$ as in Eqn. 1, we can take its gradient with respect to $\pmb \theta$ using directly the result from Evans (1998): + +$$ +\nabla _ { \pmb { \theta } } \mathcal { L } _ { K } ( \pmb { \theta } ) = \nabla _ { \pmb { \theta } } ( \mathcal { L } \ast K ) ( \pmb { \theta } ) = ( \mathcal { L } \ast \nabla K ) ( \pmb { \theta } ) . +$$ + +To relate the resulting gradient $\nabla _ { \pmb { \theta } } \mathcal { L } _ { K }$ to the gradient of the original function $\mathcal { L }$ , we introduce the notion of weak gradient, i.e. an extension to the idea of weak/distributional derivatives to functions with multidimensional arguments, such as loss functions of neural networks. + +For an integrable function $\mathcal { L }$ in space ${ \mathcal { L } } \in L ( [ a , b ] )$ , ${ \mathrm { ~ ~ g ~ } } \in \ L ( [ a , b ] ^ { n } )$ is a $n$ -dimensional weak gradient of $\mathcal { L }$ if it satisfies: + +$$ +\int _ { C } \mathbf { g } ( \pmb { \tau } ) K ( \pmb { \tau } ) d \pmb { \tau } = - \int _ { C } \mathcal { L } ( \pmb { \tau } ) \nabla K ( \pmb { \tau } ) d \pmb { \tau } , +$$ + +where $K ( \tau )$ is an infinitely differentiable function vanishing at infinity, $C \in [ a , b ] ^ { n }$ and $\tau \in \mathbb { R } ^ { n }$ + +As long as the chosen $K ( \cdot )$ fulfills the definition of a mollifier we can use Eqn. 3 and Eqn. $4 ^ { 2 }$ to rewrite the gradient as: + +$$ +\begin{array} { r l r } { \nabla _ { \pmb { \theta } } \mathcal { L } _ { K } ( \pmb { \theta } ) = ( \mathcal { L } \ast \nabla K ) ( \pmb { \theta } ) } & { } & { \mathrm { b y ~ E q n . ~ 3 } } \\ { = \displaystyle \int _ { C } \mathcal { L } ( \pmb { \theta } - \pmb { \tau } ^ { } ) \nabla K ( \pmb { \tau } ^ { } ) d \pmb { \tau } } \\ { = - \displaystyle \int _ { C } \mathbf { g } ( \pmb { \theta } - \pmb { \tau } ^ { } ) K ( \pmb { \tau } ^ { } ) d \pmb { \tau } } & { } & { \mathrm { b y ~ E q n . ~ 4 } } \end{array} +$$ + +For a differentiable almost everywhere function $\mathcal { L }$ , the weak gradient $g ( \pmb \theta )$ is equal to $\nabla _ { \boldsymbol { \theta } } \mathcal { L }$ almost everywhere. With a slight abuse of notation we can therefore write: + +$$ +\nabla _ { \pmb { \theta } } \mathcal { L } _ { K } ( \pmb { \theta } ) = - \int _ { C } \nabla _ { \pmb { \theta } } \mathcal { L } ( \pmb { \theta } - \pmb { \tau } ) K ( \pmb { \tau } ) d \pmb { \tau } +$$ + +# 2.3 GAUSSIAN MOLLIFIERS + +It is possible to use the standard Gaussian distribution $\mathcal { N } ( 0 , \bf { I } )$ as a mollifier $K ( \cdot )$ , as it satisfies the desired properties: it is infinitely differentiable, a sequence of properly rescaled Gaussian distributions converges to the Dirac delta function and it vanishes in infinity. With such a $K ( \cdot )$ the gradient becomes: + +$$ +\begin{array} { r l } { { \nabla _ { \theta } \mathcal { L } _ { K = \mathcal { N } } ( \theta ) = - \int _ { C } \nabla _ { \theta } \mathcal { L } ( \theta - \tau ) p ( \tau ) d \tau } } \\ & { = \mathrm { E } _ { \tau } [ \nabla _ { \theta } \mathcal { L } ( \theta - \tau ) ] , \mathrm { w i t h } \ \tau \sim \mathcal { N } ( 0 , \ \mathbf { I } ) } \end{array} +$$ + +Exploiting the fact that a Gaussian distribution is a mollifier, we can focus on a sequence of mollifications indexed by scaling parameter $\epsilon$ introduced in Eqn. 2. A single element of this sequence takes the following form: + +$$ +\begin{array} { r l } & { \nabla _ { \boldsymbol { \theta } } \mathcal { L } _ { \mathcal { N } , \epsilon } ( \boldsymbol { \theta } ) = - \displaystyle \int _ { C } \nabla _ { \boldsymbol { \theta } } \mathcal { L } ( \boldsymbol { \theta } - \boldsymbol { \tau } ) \epsilon ^ { - 1 } p ( \boldsymbol { \tau } / \epsilon ) d \boldsymbol { \tau } } \\ & { ~ = \mathrm { E } _ { \boldsymbol { \tau } } [ \nabla _ { \boldsymbol { \theta } } \mathcal { L } ( \boldsymbol { \theta } - \boldsymbol { \tau } ) ] , \mathrm { w i t h } \boldsymbol { \tau } \sim \mathcal { N } ( 0 , \epsilon ^ { 2 } \mathbf { I } ) } \end{array} +$$ + +Replacing $\epsilon$ with $\sigma$ yields a sequence of mollifications indexed by $\sigma$ + +$$ +\nabla _ { \pmb { \theta } } \mathcal { L } _ { \mathcal { N } , \sigma } ( \pmb { \theta } ) = \mathrm { E } _ { \pmb { \tau } } [ \nabla _ { \pmb { \theta } } \mathcal { L } ( \pmb { \theta } - \pmb { \tau } ) ] , \mathrm { w i t h } \ \pmb { \tau } \sim \mathcal { N } ( 0 , \ \sigma ^ { 2 } \mathbf { I } ) +$$ + +with the following property (by Eqn. 2): + +$$ +\operatorname* { l i m } _ { \sigma \to 0 } \nabla _ { \pmb { \theta } } \mathcal { L } _ { \mathcal { N } , \sigma } ( \pmb { \theta } ) = \nabla _ { \pmb { \theta } } \mathcal { L } ( \pmb { \theta } ) +$$ + +An intuitive interpretation of the result is that $\sigma$ determines the standard deviation of a mollifying Gaussian and is annealed in order to construct a sequence of gradually less "blurred" and closer approximations to $\mathcal { L }$ . This is consistent with the property that when $\sigma$ is annealed to zero we are optimizing the original function $\mathcal { L }$ . + +So far we obtained the mollified version $\mathcal { L } _ { K } ( \pmb { \theta } )$ of the cost function $\mathcal { L } ( \pmb { \theta } )$ by convolving it with a mollifier $K ( \pmb \theta )$ . The kernel $K ( \pmb \theta )$ corresponds to the average effect of injecting noise $\bar { \xi }$ sampled from standard Normal distribution. The amount of noise controls the amount of smoothing. Gradually reducing the noise during training is related to a form of simulated annealing (Kirkpatrick et al., 1983). Similarly to the analysis in Mobahi (2016), we can write a Monte-Carlo estimate of $\begin{array} { r } { \mathcal { L } _ { K } ( \pmb { \theta } ) = ( \mathcal { L } * K ) ( \pmb { \theta } ) \approx \frac { 1 } { N } \sum _ { i = 1 } ^ { N } \mathcal { L } ( \pmb { \theta } - \pmb { \xi } ^ { ( i ) } ) } \end{array}$ . We provide the derivation and the gradient of this equation in Appendix A. + +The Monte-Carlo estimators of the mollifiers can be easily implemented with neural networks, where the layers typically have the form: + +$$ +\mathbf { h } ^ { l } = \mathbf { f } ( \mathbf { W } ^ { l } \mathbf { h } ^ { l - 1 } ) +$$ + +with $\mathbf { h } ^ { l - 1 }$ a vector of activations from the previous layer in the hierarchy, $\mathbf { W } ^ { l }$ a matrix representing a linear transformation and f an element-wise non-linearity of choice. + +A mollification of such a layer can be formulated as: + +$$ +\mathbf { h } ^ { l } = \mathbf { f } ( ( \mathbf { W } ^ { l } - \boldsymbol { \xi } ^ { l } ) \mathbf { h } ^ { l - 1 } ) , \mathrm { w h e r e \ } \boldsymbol { \xi } ^ { l } \sim \mathcal { N } ( \mu , \boldsymbol { \sigma } ^ { 2 } ) +$$ + +From Eqn. 16, it is easy to see that both weight noise methods proposed by Hinton $\&$ van Camp (1993) and Graves (2011) can be seen as a variation of Monte-Carlo estimate of mollifiers. + +# 2.4 GENERALIZED AND NOISY MOLLIFIERS + +We introduce a generalization of the concept of mollifiers that encompasses the approach we explored here and that is targeted during optimization via a continuation method using stochastic gradient descent. + +Definition 2.1. (Generalized Mollifier). A generalized mollifier is an operator, where $T _ { \sigma } ( f )$ defines a mapping between two functions, such that $T _ { \sigma } : f \to f ^ { * }$ . + +$$ +\operatorname* { l i m } _ { \sigma \to 0 } T _ { \sigma } f = f , +$$ + +$$ +\begin{array} { r l } { { f ^ { 0 } = \displaystyle \operatorname* { l i m } _ { \sigma \to \infty } T _ { \sigma } f \quad } } & { { \mathrm { ~ i s ~ \ a n ~ i d e n t i t y ~ f u n c t i o n ~ } } } \\ { { \frac { \partial ( T _ { \sigma } f ) ( x ) } { \partial x } \quad } } & { { \mathrm { e x i s t s ~ } \forall x , \sigma > 0 } } \end{array} +$$ + +In addition, we consider noisy mollifiers which can be defined as an expected value of a stochastic function $\phi ( x , \xi )$ under some noise source $\xi$ with variance $\sigma$ : + +$$ +( T _ { \sigma } f ) ( x ) = E _ { \xi } [ \phi ( x , \xi _ { \sigma } ) ] +$$ + +Definition 2.2. (Noisy Mollifier). We call a stochastic function $\phi ( x , \xi _ { \sigma } )$ with input $x$ and noise $\xi$ a noisy mollifier if its expected value corresponds to the application of a generalized mollifier $T _ { \sigma }$ , as per Eqn. 20. + +The composition of two noisy mollifiers sharing the same $\sigma$ is also a noisy mollifier, since the three properties in the definition (Eqns. 17,18,19) are still satisfied. When $\sigma = 0$ no noise is injected and therefore the original function will be optimized. If $\sigma \to \infty$ instead, the function will become an identity function. Thus, for instance, if we mollify each layer of a feed-forward network except the output layer, when $\sigma \to \infty$ all the mollified layers will become identity function and the objective function of the network with respect to its inputs will be convex. + +Consequently, corrupting separately the activation function of each level of a deep neural network (but with a shared noise level $\sigma$ ) and annealing $\sigma$ yields a noisy mollifier for the objective function. This is related to the work of Mobahi (2016), who recently introduced a way of analytically smoothing of the non-linearities to help the training of recurrent networks. The differences of that approach from our algorithm is two-fold: we use a noisy mollifier (rather than an analytic smoothing of the network’s non-linearities) and we introduce (in the next section) a particular form of the noisy mollifier that empirically proved to work well. + +Shaping the cost function to define a sequence of costs that are progressing from easier to more difficult ones can be related to the reward shaping $\mathrm { N g }$ et al., 1999; $\bar { \bf N } \mathrm { \bf g }$ , 2003) algorithms. In our algorithm, we shape the cost and the model architecture itself, rather than rewards or the targets in order to make the optimization easier. In that sense, reward shaping can be considered to be more closer to curriculum learning. + +# 3 METHOD + +We propose an algorithm to mollify the cost of a neural network which also addresses an important drawback of the previously proposed noisy training procedures: as the noise gets larger, it can dominate the learning process and lead the algorithm to perform a random walk on the energy landscape of the objective function. Conversely in our algorithm, as the noise gets larger gradient descent minimizes a simpler (e.g. convex) but still meaningful objective function. + +We define the desired behavior of the network in the limit cases where the noise is very large or very small, and modify the model architecture accordingly. Specifically, during training we minimize a sequence of increasingly complex noisy objectives $\bar { \mathrm { L } } = ( \bar { \mathcal { L } } ^ { 1 } ( \pmb { \theta } ; \xi _ { \sigma _ { 1 } } ) , \bar { \mathcal { L } } ^ { 2 } ( \pmb { \theta } ; \xi _ { \sigma _ { 2 } } ) , \cdots , \bar { \mathcal { L } } ^ { k } ( \pmb { \theta } ; \xi _ { \sigma _ { k } } ) )$ that we obtain by annealing the scale (variance) of the noise $\sigma _ { i }$ . Let us note that our algorithm satisfies the fundamental properties of the generalized and noisy mollifiers that we introduced earlier. + +We use a noisy mollifier based on our definition in Section 2.4. Instead of convolving the objective function with a kernel: + +1. We start the training by optimizing a convex objective function that is obtained by configuring all the layers between the input and the last cost layer to compute an identity function, i.e., by skipping both the affine transformations and the blocks followed by nonlinearities. 2. During training, the magnitude of noise which is proportional to $p$ is annealed, allowing to gradually evolve from identity transformations to linear transformations between the layers. 3. Simultaneously, as we decrease the $p$ , the noisy mollification procedure allows the element-wise activation functions to gradually change from linear to be nonlinear. + +# 4 SIMPLIFYING THE OBJECTIVE FUNCTION FOR FEEDFORWARD NETWORKS + +For every unit of each layer, we either copy the activation (output) of the corresponding unit of the previous layer (the identity path in Figure 2) or output a noisy activation $\tilde { \mathbf { h } } ^ { l }$ of a non-linear transformation of it $\psi ( \mathbf { h } ^ { l - 1 } , \boldsymbol { \xi } ; \bar { \mathbf { W } } ^ { l } )$ , where $\boldsymbol { \xi }$ is noise, $\bar { \mathbf { W } } ^ { l }$ is a weight matrix applied on $\mathbf { h } ^ { l - 1 }$ and $\pi$ is a vector of binary decisions for each unit (the convolutional path in Figure 2): + +$$ +\begin{array} { c } { { \tilde { \mathbf { h } } ^ { l } = \psi ( \mathbf { h } ^ { l - 1 } , \pmb { \xi } ; \mathbf { W } ^ { l } ) } } \\ { { \phi ( \mathbf { h } ^ { l - 1 } , \pmb { \xi } , \pi ^ { l } ; \mathbf { W } ^ { l } ) = \pi ^ { l } \odot \mathbf { h } ^ { l - 1 } + ( 1 - \pi ^ { l } ) \odot \tilde { \mathbf { h } ^ { l } } } } \\ { { \mathbf { h } ^ { l } = \phi ( \mathbf { h } ^ { l - 1 } , \pmb { \xi } , \pi ^ { l } ; \mathbf { W } ^ { l } ) . } } \end{array} +$$ + +To decide which path to take, for each unit in the network, a binary stochastic decision is taken by drawing from a Bernoulli distribution with probability dependent on the decaying value of $p ^ { l }$ : + +$$ +\pi ^ { l } \sim \mathrm { B e r n o u l l i } ( p ^ { l } ) +$$ + +If the number of hidden units of layer $l - 1$ and layer $l + 1$ is not the same, we can either zero-pad layer $l - 1$ before feeding it into the next layer or apply a linear projection to obtain the right dimensionality. + +For $p ^ { l } = 1$ , the layer computes the identity function leading to a convex objective. If $p ^ { l } = 0$ the layer computes the original non-linear transformation unfolding the full capacity of the model. We call the connections that are introduced this way as unitwise stochastic skip connections(USSC). + +In DropIn layers (Smith et al., 2016) a binary random vector is sampled from a Bernoulli distribution to decide whether to introduce skip a connection from the layer below $l - 1$ for each layer $l$ and they use this as a regularization. As opposed to the USSC, DropIn layers do not necessarily do not necessarily achieve a convex objective function as the DropIn ratio $( \hat { p ^ { l } } )$ increases. + +The pseudo-code for the mollified activations is reported in Algorithm 1. + +![](images/80eecd4ac991add0cb642b20c46377ca05f8af859e791101be6113b09d06839f.jpg) +Figure 2: Top: Stochastic depth. Bottom: mollifying network. The dashed line represents the optional residual connection. In the top path, the input is processed with a convolutional block followed by a noisy activation function, while in the bottom path the original activation of the layer $l - 1$ is propagated untouched. For each unit, one of the two paths in picked according to a binary stochastic decision $\pi$ . + +# Algorithm 1 Activation of a unit $i$ at layer $l$ + +1: $x _ { i } \gets \mathbf { w } _ { i } ^ { \top } \mathbf { h } ^ { l - 1 } + b _ { i }$ . an affine transformation of hl−1 +2: $\Delta _ { i } \gets \mathbf { u } ( x _ { i } ) - \mathbf { f } ( x _ { i } )$ $\mathsf { D } \Delta _ { i }$ is a measure of a saturation of a unit +3: $\sigma ( x _ { i } ) \gets ( \mathrm { s i g m o i d } ( a _ { i } \Delta _ { i } ) - 0 . 5 ) ^ { 2 }$ . std of the injected noise depends on $\Delta _ { i }$ +4: $\xi _ { i } \sim \mathcal { N } ( 0 , 1 )$ . sampling the noise from a basic Normal distribution +5: $s _ { i } \gets p ^ { l } c \sigma ( x _ { i } ) | \xi _ { i } |$ . Half-Normal noise controlled by $\sigma ( x _ { i } )$ , const. $c$ and prob-ty $p ^ { l }$ +6: $\psi ( x _ { i } , \xi _ { i } ) \gets \mathrm { s g n } ( \mathbf { u } ^ { * } ( x _ { i } ) ) \mathrm { m i n } ( | \mathbf { u } ^ { * } ( x _ { i } ) |$ , $| \mathbf { f } ^ { * } ( x _ { i } ) + \mathrm { s g n } ( \mathbf { u } ^ { * } ( x _ { i } ) ) | \hat { s _ { i } } | | ) + \bar { \mathbf { u } } ( 0 )$ $\triangleright$ noisy activation +7: $\pi _ { i } ^ { l } \sim { \bf B e r n o u l l i } ( p ^ { l } ) \qquad \triangleright p ^ { l }$ controls the variance of the noise AND the prob of skipping a unit +8: $\ddot { h } _ { i } ^ { l } = \psi ( x _ { i } , \xi _ { i } )$ . $\tilde { h } _ { i } ^ { l }$ is a noisy activation candidate +9: $\phi ( \mathbf { h } ^ { l - 1 } , \xi _ { i } , \pi _ { i } ^ { l } ; \mathbf { w } _ { i } ) = \pi _ { i } ^ { l } h _ { i } ^ { l - 1 } + ( 1 - \pi _ { i } ^ { l } ) \tilde { h } _ { i } ^ { l }$ . make a HARD decision between $h _ { i } ^ { l - 1 }$ and $\tilde { h } _ { i } ^ { l }$ + +# 5 LINEARIZING THE NETWORK + +In Section 2, we show that convolving the objective function with a particular kernel can be approximated by adding noise to the activation function. This method may suffer from excessive random exploration when the noise is very large. + +We address this issue by bounding the element-wise activation function $\operatorname { f } ( \cdot )$ with its linear approximation when the variance of the noise is very large, after centering it at the origin. The resulting function $\mathrm { f } ^ { \ast } ( \cdot )$ is bounded and centered around the origin. + +Note that centering the sigmoid or hard-sigmoid will make them symmetric with respect to the origin. With a proper choice of the standard deviation $\sigma ( \mathbf { h } )$ , the noisy activation function becomes a linear function of the input when $\mathfrak { p }$ is large, as illustrated by Figure 10. + +Let $\mathbf { u } ^ { * } ( x ) = \mathbf { u } ( x ) - \mathbf { u } ( 0 )$ , where ${ \bf u } ( 0 )$ is the offset of the function from the origin, and $x _ { i }$ the $i$ -th dimension of an affine transformation of the output of the previous layer $\mathbf { h } ^ { l - 1 }$ : $x _ { i } = \mathbf { w } _ { i } ^ { \top } \mathbf { h } ^ { l - 1 } + b _ { i }$ . Then: + +$$ +\psi ( x _ { i } , \xi _ { i } ; \mathbf { w } _ { i } ) = \mathrm { s g n } ( \mathbf { u } ^ { * } ( x _ { i } ) ) \mathrm { m i n } ( | \mathbf { u } ^ { * } ( x _ { i } ) | , | \mathbf { f } ^ { * } ( x _ { i } ) + \mathrm { s g n } ( \mathbf { u } ^ { * } ( x _ { i } ) ) | s _ { i } | | ) + \mathbf { u } ( 0 ) +$$ + +The noise is sampled from a Normal distribution with mean 0 and whose standard deviation depends on $c$ : + +$$ +s _ { i } \sim \mathcal { N } ( 0 , p c \sigma ( x _ { i } ) ) +$$ + +# 5.1 LINEARIZING RELU ACTIVATION FUNCTION + +We have a simpler form of the equations to linearize ReLU (Nair & Hinton, 2010) activation function when $p ^ { l } \to \infty \quad$ . Instead of the complicated Eqn. 23. We can use a simpler equation as in Eqn. 26 to + +![](images/644f80b2c2d62505206241eaafd9d373597c1578b8fc6d71a55ea6c773a2d3d5.jpg) +Figure 3: The figures show how to evolve the model to make it closer to a linear network. Arrows denote the direction of the noise pushing the activation function towards the linear function. a) The quasi-convex envelope established by a $| \mathrm { { s i g m o i d } ( \cdot ) | }$ around $| 0 . 2 5 x |$ . b) A depiction of how the noise pushes the sigmoid to become a linear function. + +achieve the linearization of the activation function when we have a very large noise in the activation function: + +$$ +\begin{array} { c } { s _ { i } = \underset { \mathbf { \sigma } } { \mathrm { m i n i m u m } } ( | x _ { i } | , p \sigma ( x _ { i } ) | \boldsymbol { \xi } | ) } \\ { \psi ( x _ { i } , \xi _ { i } , \mathbf { w } _ { i } ) = \mathbf { f } ( x _ { i } ) - s _ { i } } \end{array} +$$ + +# 6 MOLLIFYING LSTMS AND GRUS + +In a similar vein it is possible to smooth the objective functions of LSTM and GRU networks by starting the optimization procedure with a simpler objective function such as optimizing a word2vec, BoW-LM or CRF objective function at the beginning of training and gradually increasing the difficulty of the optimization by increasing the capacity of the network. + +For GRUs we set the update gate to $\textstyle { \frac { 1 } { t } }$ – where $t$ is the time-step index – and reset the gate to 1 if the noise is very large, using Algorithm 1. Similarly for LSTMs, we can set the output gate to 1 and input gate to $\textstyle { \frac { 1 } { t } }$ and forget gate to $\textstyle { 1 - { \frac { 1 } { t } } }$ when the noise is very large. The output gate is 1 or close to 1 when the noise is very large. This way the LSTM will behave like a BOW model. In order to achieve this behavior, the activations $\psi ( x _ { t } , \dot { \xi _ { i } } )$ of the gates can be formulated as: + +$$ +\boldsymbol { \psi } ( x _ { t } ^ { l } , \xi ) = \mathbf { f } ( x _ { t } ^ { l } + p ^ { l } \sigma ( x ) | \xi | ) +$$ + +By using a particular formulation of $\sigma ( x )$ that constraints it to be in expectation over $\xi$ when $p ^ { l } = 1$ , we can obtain a function for $\gamma \in \mathbb { R }$ within the range of $\operatorname { f } ( \cdot )$ that is discrete in expectation, but still per sample differentiable: + +$$ +\sigma ( x _ { t } ^ { l } ) = \frac { \mathrm { f } ^ { - 1 } ( \gamma ) - x _ { t } ^ { l } } { \mathrm { E } _ { \xi } [ | \xi | ] } +$$ + +We provide the derivation of Eqn. 28 in Appendix B. The gradient of the Eqn. 28 will be a Monte-Carlo approximation to the gradient of $\bar { \bf f } ( { \bf x } _ { t } ^ { l } )$ . + +# 7 ANNEALING SCHEDULES FOR $p$ + +We used a different schedule for each layer of the network, such that the noise in the lower layers will anneal faster. This is similar to the linearly decaying probability of layers in Huang et al. (2016b). + +Exponential Decay In our experiments, we focused on using an annealing schedule similar to the inverse sigmoid rule in Bengio et al. (2015) with $p _ { t } ^ { l }$ , + +$$ +p _ { t } ^ { l } = 1 - \mathrm { e } ^ { - \frac { k v _ { t } l } { t L } } +$$ + +with hyper-parameter model. We stop anne $k \geq 0$ at wh $t ^ { t h }$ update for the he expected de $l ^ { t h }$ $L$ is the number of layers reaches some threshold the. In $\begin{array} { r } { p _ { t } = \sum _ { i = 1 } ^ { L } p _ { t } ^ { l } } \end{array}$ $\delta$ our experiment we set $v _ { t }$ to be a moving average of the $\mathrm { l o s s } ^ { 3 }$ of the network, but for some of our experimnets that resulted unstable behaviors in the training and thus we have to fix $v _ { t }$ to 1. An advantage of using running average of loss for the $v _ { t }$ is because the behavior of the loss/optimization can directly influence the annealing behavior of the network. Because we will have: + +$$ +\operatorname* { l i m } _ { { \bf v } _ { t } \to \infty } p _ { t } ^ { l } = 1 \mathrm { ~ \ a n d , ~ } \operatorname* { l i m } _ { { \bf v } _ { t } \to 0 } p _ { t } ^ { l } = 0 . +$$ + +This has a desirable property: when the training-loss is high, the noise injected into the system will be large as well. As a result, the model is encouraged to do more exploration, while if the model converges the noise injected into the system by the mollification procedure will be zero. + +Square-root Decay The square root decaying of the learning rate is very popular. In our experiments we have tried to decay the plt according to min(pmin, 1 − q $\begin{array} { r } { 1 - \sqrt { \frac { t } { N _ { e p o c h s } } } ) } \end{array}$ where $t$ is the index of the iteration/epoch over the data and $N _ { e p o c h s }$ corresponds to the total number of iterations that the model will do on the dataset. $p _ { m i n }$ is hyperparameter to define the lower bound on the $p _ { t } ^ { l }$ . + +Linear Decay We have also experimented with linearly decaying the $p _ { t } ^ { l }$ via $\begin{array} { r } { \operatorname* { m i n } ( p _ { m i n } , 1 - \frac { t } { N _ { e p o c h s } } ) } \end{array}$ We have compared the plot of different annealing methods described in this paper as in Figure 4. + +![](images/0edec83fe7d1c958a8488792b79a2fed28b69de56bc31b6fc444f2b0511e2401.jpg) +Figure 4: We compare different annealing schedules with respect to the time in y-axis(iterations). + +Furthermore, in our experiments we observe that training with noisy mollifiers can potentially be helpful for the generalization. This can be due to the noise induced to the backpropagation through the noisy mollification, that makes SGD more likely to converge to a flatter-minima (Hochreiter & Schmidhuber, 1997b) because the noise will help it escape from sharper local minima. + +# 8 EXPERIMENTS + +In this section we mainly focus on training of difficult to optimize models, in particular deep MLPs with sigmoid or tanh activation functions. The details of the experimental procedure is provided in Appendix C. + +# 8.1 EXPLORATORY STUDY ON MNIST + +We train a thin deep neural network on MNIST (LeCun & Cortes, 1998) dataset with 72 hidden layers and 100 hidden units. We train our model with Adam(Kingma & Ba, 2014) optimizer and fix the learning rate of all the models to $3 e { - 4 }$ . We have used the same learning-rate for all the models in order to factor out the possibility that a model converges faster, due to the fact of using a larger learning rate. + +Firstly, in Figure 5, we investigate the effect of using different annealing schedules. Exponential decay converges faster compared to linear decay and square root decay of $p$ . We find it to be very unstable to train our model with linear and square root decay in particular for large $c$ values. Thus we have to use smaller $c$ value (20 instead of 100) to be able to train the model with causing it to diverge. + +![](images/be0d19fd9d12424b4a91c95146d3758bf25debfc209b87d8462abca2c20cfb26.jpg) +Figure 5: We compare the training performance of different types of annealing methods used with mollification procedure to anneal the parameter of the mollification $p$ . Decaying the $p$ exponentially achieves both better training and validation performance. + +In Figure 6, we show the effect of using the noisy training procedure that we have introduced by sampling a mask from Bernoulli and Gaussian distributions versu using the deterministic approximation of this noisy procedure which we also use for the test time but during the training as well. + +![](images/4b8a3ac20b57ecaf26bfbb68e0f1deb19984fdd2b9a2d6ea11e3f0a10189a871.jpg) +Figure 6: We show the learning curves of the model where we don’t inject the noise during the training and instead use the deterministic approximation for the mollification during the training as well. The differerence in terms of speed of learning is very small. + +In Figure 7, we compare the results obtained for the model using mollification obtained with or without batch normalization and feed-forward residual networks. The mollified model performs very closely to the MLP trained with residual connections and the batchnorm. However, using residual connections and batch-norm does not seem to improve the results. + +We have tried to run experiment with the Monte-Carlo approximation of the mollification which is derived in Appendix A, however when we start with large noise and anneal the noise during the training, the model was very unstable and training was diverging. If we start with small noise and anneal the magnitude of the noise during the training, we could not observe any effect of it on the training. + +![](images/24f40f65392ee90e6386375192de3d2b7240bb6ad5b1529448614804c614f410.jpg) +Figure 7: We investigate the effect of using batch norm and residual connection for mollifcation and compare against to the network with residual connections and batch-norm. The effect of batch norm on this task for mollification seems to be very small and training convergence performance of the all the approaches are very close to each other. + +![](images/c41840e048fd609433dd3b430329544afc0d1b86c1b1c7b4544f1462c89c0e19.jpg) +Figure 8: The learning curves of a 6-layers MLP with sigmoid activation function on 40 bit parity task. + +Table 1: CIFAR10 deep convolutional neural network. + +
Test Accuracy
Stochastic Depth93.25
Mollified Convnet92.45
ResNet91.78
+ +# 8.2 DEEP MLP EXPERIMENTS + +Deep Parity Experiments Training neural networks on a high-dimensional parity problem can be challenging (Graves, 2016; Kalchbrenner et al., 2015). We experiment on forty dimensional (bits) parity problem with 6-layer MLP using sigmoid activation function. All the models are initialized with Glorot initialization Glorot et al. (2011) and trained with SGD with momentum. We compare an MLP with residual connections using batch normalization and a mollified network with sigmoid activation function. As can be seen in Figure 8, the mollified network converges faster. + +Deep Pentomino Pentomino is a toy-image dataset where each image has 3 Pentomino blocks. The task is to predict whether if there is a different shape in the image or not (Gülçehre & Bengio, 2013). The best reported result on this task with MLPs is $6 8 . 1 5 \%$ accuracy (Gulcehre et al., 2014). The same model as ours trained without noisy activation function and vanilla residual connections scored $6 9 . 5 \%$ accuracy, while our mollified version scored $7 5 . 1 5 \%$ accuracy after 100 epochs of training on the $8 0 k$ dataset. + +CIFAR10 We experimented with deep convolutional neural networks of 110-layers with residual blocks and residual connections comparing our model against ResNet and Stochastic depth. We adapted the hyperparameters of the Stochastic depth network from Huang et al. (2016a) and we used the same hyperparameters for our algorithm. We report the training and validation curves of the three models in Figure 10 and the best test accuracy obtained early stopping on validation accuracy over 500 epochs in Table 1. Our model achieves better generalization than ResNet. Stochastic depth achieves better generalization, but it might be possible to combine both and obtain better results. + +![](images/345e69a1318bab42ba15b8295abfbd900d2a22fb372d4cfae106a2e0cb0e9af6.jpg) +Figure 9: The training curve of a bidirectionalRNN that predicts the embedding corresponding to a sequence of characters. + +Table 2: 3-layered LSTM network on word-level language modeling for PTB. + +
Test PPL
LSTM119.4
Mollified LSTM115.7
+ +# 9 LSTM EXPERIMENTS + +Predicting the Character Embeddings from Characters Learning the mapping from sequences of characters to the word-embeddings is a difficult problem. Thus one needs to use a highly non-linear function. We trained a word2vec model on Wikipedia with embeddings of size 500 (Mikolov et al., 2014) with a vocabulary of size 374557. + +LSTM Language Modeling We evaluate our model on LSTM language modeling. Our baseline model is a 3-layer stacked LSTM without any regularization. We observed that mollified model converges faster and achieves better results. We provide the results for PTB language modeling in Table 2. + +# 10 CONCLUSION + +We propose a novel method for training neural networks inspired by an idea of continuation, smoothing techniques and recent advances in non-convex optimization algorithms. The method makes learning easier by starting from a simpler model, solving a well-behaved problem, and gradually transitioning to a more complicated setting. We show improvements on very deep models, difficult to optimize tasks and compare with powerful techniques such as batch-normalization and residual connections. We also show that the mollification procedure improves the generalization performance of the model on two tasks. + +Our future work includes testing this method on large-scale language tasks that require long training time, e.g., machine translation and language modeling. Moreover, (Kaiser & Sutskever, 2015) observed that the training of Neural-GPU model can be improved significantly by using gradient noise which can be related to the smoothing of the loss surface, it would be interesting to try mollification on this model to see if the training of Neural GPU can be made easier by using mollification procedure. + +# ACKNOWLEDGEMENTS + +We thank Nicholas Ballas and Misha Denil for the valuable discussions and their feedback. We would like to also thank the developers of Theano 4, for developing such a powerful tool for scientific computing Theano Development Team (2016). We acknowledge the support of the following organizations for research funding and computing support: NSERC, Samsung, Calcul Québec, Compute Canada, the Canada Research Chairs and CIFAR. + +# REFERENCES + +E. L. Allgower and K. Georg. Numerical Continuation Methods. An Introduction. Springer-Verlag, 1980. + +Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. Neural machine translation by jointly learning to align and translate. arXiv preprint arXiv:1409.0473, 2014. + +Samy Bengio, Oriol Vinyals, Navdeep Jaitly, and Noam Shazeer. Scheduled sampling for sequence prediction with recurrent neural networks. In Advances in Neural Information Processing Systems, pp. 1171–1179, 2015. + +Yoshua Bengio, Jérôme Louradour, Ronan Collobert, and Jason Weston. Curriculum learning. In Proceedings of the 26th annual international conference on machine learning, pp. 41–48. ACM, 2009. + +Léon Bottou. Online algorithms and stochastic approximations. In David Saad (ed.), Online Learning in Neural Networks. Cambridge University Press, Cambridge, UK, 1998. + +Kyunghyun Cho, Bart Van Merriënboer, Caglar Gulcehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk, and Yoshua Bengio. Learning phrase representations using rnn encoder-decoder for statistical machine translation. arXiv preprint arXiv:1406.1078, 2014. + +Anna Choromanska, Mikael Henaff, Michael Mathieu, Gérard Ben Arous, and Yann LeCun. The loss surface of multilayer networks, 2014. + +Yann Dauphin, Razvan Pascanu, Caglar Gulcehre, Kyunghyun Cho, Surya Ganguli, and Yoshua Bengio. Identifying and attacking the saddle point problem in high-dimensional non-convex optimization. In NIPS’2014, 2014. + +Lawrence C Evans. Partial differential equations. Graduate Studies in Mathematics, 19:251–258, 1998. + +Xavier Glorot, Antoine Bordes, and Yoshua Bengio. Deep sparse rectifier neural networks. In AISTATS, pp. 315–323, 2011. + +Alex Graves. Practical variational inference for neural networks. In Advances in Neural Information Processing Systems, pp. 2348–2356, 2011. + +Alex Graves. Adaptive computation time for recurrent neural networks. arXiv preprint arXiv:1603.08983, 2016. + +Çaglar Gülçehre and Yoshua Bengio. Knowledge matters: Importance of prior information for ˘ optimization. arXiv preprint arXiv:1301.4083, 2013. + +Caglar Gulcehre, Kyunghyun Cho, Razvan Pascanu, and Yoshua Bengio. Learned-norm pooling for deep feedforward and recurrent neural networks. In Machine Learning and Knowledge Discovery in Databases, pp. 530–546. Springer, 2014. + +Caglar Gulcehre, Marcin Moczulski, Misha Denil, and Yoshua Bengio. Noisy activation functions. 2016. + +Elad Hazan, Kfir Y Levy, and Shai Shalev-Shwartz. On graduated optimization for stochastic non-convex problems. arXiv preprint arXiv:1503.03712, 2015. + +Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. arXiv preprint arXiv:1512.03385, 2015. + +Geoffrey Hinton, Li Deng, Dong Yu, George Dahl, Abdel rahman Mohamed, Navdeep Jaitly, Andrew Senior, Vincent Vanhoucke, Patrick Nguyen, Tara Sainath, and Brian Kingsbury. Deep neural networks for acoustic modeling in speech recognition. Signal Processing Magazine, 2012. + +Geoffrey E Hinton and Drew van Camp. Keeping neural networks simple. In ICANN’93, pp. 11–18. Springer, 1993. + +S. Hochreiter and J. Schmidhuber. Long short-term memory. Neural Computation, 9(8):1735–1780, 1997a. + +Sepp Hochreiter and Jürgen Schmidhuber. Flat minima. Neural Computation, 9(1):1–42, 1997b. + +Gao Huang, Yu Sun, Zhuang Liu, Daniel Sedra, and Kilian Weinberger. Deep networks with stochastic depth. arXiv preprint arXiv:1603.09382, 2016a. + +Gao Huang, Yu Sun, Zhuang Liu, Daniel Sedra, and Kilian Q. Weinberger. Deep networks with stochastic depth. CoRR, abs/1603.09382, 2016b. URL http: //arxiv.org/abs/1603.09382. + +Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by reducing internal covariate shift. CoRR, abs/1502.03167, 2015. URL http://arxiv.org/abs/1502.03167. + +Łukasz Kaiser and Ilya Sutskever. Neural gpus learn algorithms. arXiv preprint arXiv:1511.08228, 2015. + +Nal Kalchbrenner, Ivo Danihelka, and Alex Graves. Grid long short-term memory. arXiv preprint arXiv:1507.01526, 2015. + +Diederik Kingma and Jimmy Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980, 2014. + +S. Kirkpatrick, C. D. Gelatt Jr., , and M. P. Vecchi. Optimization by simulated annealing. 220: 671–680, 1983. + +Y. LeCun, B. Boser, J. S. Denker, D. Henderson, R. E. Howard, W. Hubbard, and L. D. Jackel. Backpropagation applied to handwritten zip code recognition. Neural Comput., 1 (4):541–551, December 1989. ISSN 0899-7667. doi: 10.1162/neco.1989.1.4.541. URL http://dx.doi.org/10.1162/neco.1989.1.4.541. + +Yann LeCun and Corinna Cortes. The mnist database of handwritten digits, 1998. + +Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. word2vec, 2014. + +Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Alex Graves, Ioannis Antonoglou, and Daan Wierstra. Playing atari with deep reinforcement learning. Technical report, arXiv:1312.5602, 2013. + +Hossein Mobahi. Training recurrent neural networks by diffusion. arXiv preprint arXiv:1601.04114, 2016. + +Vinod Nair and Geoffrey E Hinton. Rectified linear units improve restricted boltzmann machines. In Proceedings of the 27th International Conference on Machine Learning (ICML-10), pp. 807–814, 2010. + +Arvind Neelakantan, Luke Vilnis, Quoc V. Le, Ilya Sutskever, Lukasz Kaiser, Karol Kurach, and James Martens. Adding gradient noise improves learning for very deep networks. CoRR, abs/1511.06807, 2015a. URL http://arxiv.org/abs/1511.06807. + +Arvind Neelakantan, Luke Vilnis, Quoc V Le, Ilya Sutskever, Lukasz Kaiser, Karol Kurach, and James Martens. Adding gradient noise improves learning for very deep networks. arXiv preprint arXiv:1511.06807, 2015b. + +Andrew Y Ng. Shaping and policy search in reinforcement learning. PhD thesis, University of California, Berkeley, 2003. + +Andrew Y Ng, Daishi Harada, and Stuart Russell. Policy invariance under reward transformations: Theory and application to reward shaping. In ICML, volume 99, pp. 278–287, 1999. + +David Silver, Aja Huang, Chris J Maddison, Arthur Guez, Laurent Sifre, George Van Den Driessche, Julian Schrittwieser, Ioannis Antonoglou, Veda Panneershelvam, Marc Lanctot, et al. Mastering the game of go with deep neural networks and tree search. Nature, 529(7587):484–489, 2016. + +Leslie N Smith, Emily M Hand, and Timothy Doster. Gradual dropin of layers to train very deep neural networks. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4763–4771, 2016. + +Rupesh K Srivastava, Klaus Greff, and Jürgen Schmidhuber. Training very deep networks. In Advances in Neural Information Processing Systems, pp. 2368–2376, 2015. + +Ilya Sutskever, Oriol Vinyals, and Quoc V Le. Sequence to sequence learning with neural networks. In Advances in neural information processing systems, pp. 3104–3112, 2014. + +Christian Szegedy, Wei Liu, Yangqing Jia, Pierre Sermanet, Scott Reed, Dragomir Anguelov, Dumitru Erhan, Vincent Vanhoucke, and Andrew Rabinovich. Going deeper with convolutions. Technical report, Google, 2014. + +Theano Development Team. Theano: A Python framework for fast computation of mathematical expressions. arXiv e-prints, abs/1605.02688, May 2016. URL http://arxiv.org/abs/1605.02688. + +Francesco Visin, Kyle Kastner, Aaron Courville, Yoshua Bengio, Matteo Matteucci, and Kyunghyun Cho. Reseg: A recurrent neural network for object segmentation. arXiv preprint arXiv:1511.07053, 2015. + +Wojciech Zaremba and Ilya Sutskever. Learning to execute. arXiv preprint arXiv:1410.4615, 2014. + +# Appendix + +# A MONTE-CARLO ESTIMATE OF MOLLIFICATION + +${ \mathcal L } _ { K } ( \pmb \theta ) = ( { \mathcal L } * K ) ( \pmb \theta ) = \int _ { C } { \mathcal L } ( \pmb \theta - \xi ) K ( \xi ) d \xi$ which can be estimated by a Monte Carlo: $\approx \frac { 1 } { N } \sum _ { i = 1 } ^ { N } \mathcal { L } ( \pmb { \theta } - \pmb { \xi } ^ { ( i ) } )$ , where $\xi ^ { ( i ) }$ is a realization of the noise random variable $\xi$ yielding $\frac { \partial \mathcal { L } _ { K } ( { \pmb \theta } ) } { \partial { \pmb \theta } }$ $\approx \frac { 1 } { N } \sum _ { i = 1 } ^ { N } \frac { \partial \mathcal { L } ( \pmb { \theta } - \pmb { \xi } ^ { ( i ) } ) } { \partial \pmb { \theta } } .$ + +Therefore introducing additive noise to the input of $\mathcal { L } ( \pmb \theta )$ is equivalent to mollification. + +# B DERIVATION OF THE NOISY ACTIVATIONS FOR THE GATING + +Assume that $z _ { t } ^ { l } = x _ { t } ^ { l } + p _ { t } ^ { l } \sigma ( x ) | \xi _ { t } ^ { l } |$ and $\mathrm { E } _ { \xi } [ \psi ( x _ { t } ^ { l } , \xi ) ] = t$ . Thus for all $z _ { t } ^ { l }$ , + +$$ +\begin{array} { r l } & { \mathrm { E } _ { \xi } [ \psi ( x _ { t } ^ { l } , \xi _ { t } ^ { l } ) ] = \mathrm { E } _ { \xi } [ \mathrm { f } ( z _ { t } ^ { l } ) ] , } \\ & { \qquad t = \mathrm { E } _ { \xi } [ \mathrm { f } ( z _ { t } ^ { l } ) ] , \ \mathrm { a s s u m i n g ~ f ( \cdot ) ~ b e h a v e s ~ s i m i l a r ~ t o ~ a ~ l i n e a r ~ f u n c t i o n } ; } \\ & { \qquad \mathrm { E } _ { \xi } [ \mathrm { f } ( z _ { t } ^ { l } ) ] \approx \mathrm { f } ( \mathrm { E } _ { \xi } [ z _ { t } ^ { l } ] ) \ \mathrm { s i n c e ~ w e ~ u s e ~ h a r d - s i g m o i d ~ f o r ~ f ( \cdot ) ~ t h i s ~ w i l l ~ h o l d } . } \\ & { \qquad \mathrm { f } ^ { - 1 } ( t ) \approx \mathrm { E } _ { \xi } [ z _ { t } ^ { l } ] } \end{array} +$$ + +As in Eqn. 32, we can write the expectation of this equation as: + +$$ +\mathrm { f } ^ { - 1 } ( t ) \approx x _ { t } ^ { l } + p _ { t } ^ { l } \sigma ( x ) \mathrm { E } _ { \xi } [ \xi _ { t } ^ { l } ] +$$ + +Corollary, the value that $\sigma ( x _ { t } ^ { l } )$ should take in expectation for $p _ { t } ^ { l } = 1$ would be: + +$$ +\sigma ( x _ { t } ^ { l } ) \approx \frac { \mathrm { f } ^ { - 1 } ( t ) - x _ { t } ^ { l } } { \mathrm { E } _ { \xi } [ \xi _ { t } ^ { l } ] } +$$ + +In our experiments for $\operatorname { f } ( \cdot )$ we used the hard-sigmoid activation function. We used the following piecewise activation function in order to use it as $\mathrm { f } ^ { - 1 } ( x ) = 4 ( x - 0 . 5 )$ . During inference we use the expected value of random variables $\pi$ and $\xi$ . + +# C EXPERIMENTAL DETAILS + +# C.1 MNIST + +The weights of the models are initialized with Glorot & Bengio initialization Glorot et al. (2011). We use the learning rate of $4 e - 4$ along with RMSProp. We initialize $a _ { i }$ parameters of mollified activation function by sampling it from a uniform distribution, $\mathrm { { U } [ - 2 , 2 ] }$ . We used 100 hidden units at each layer with a minibatches of size 500. + +# C.2 PENTOMINO + +We train a 6−layer MLP with sigmoid activation function using SGD and momentum. We used 200 units per layer with sigmoid activation functions. We use a learning rate of $1 e - 3$ . + +# C.3 CIFAR10 + +We use the same model with the same hyperparameters for both ResNet, mollified network and the stochastic depth. We borrowed the hyperparameters of the model from Huang et al. (2016a). Our mollified convnet model has residual connections coming from its layer below. + +![](images/8dbf86661abcd350698fec3b04fd3a0769dbc7ba6ca3d6a790e7f74289b8e903.jpg) +Figure 10: Training and validation losses over 500 epochs of a mollified convolutional network composed by 110-layers. We compare against ResNet and Stochastic depth. + +# C.4 PARITY + +The n-dimensional parity task is the task to figure out whether the sum of n-bits in a binary vector is even or odd. We use SGD with Nesterov momentum and initialize the weight matrices by using Glorot&Bengio initializationGlorot et al. (2011). For all models, we use the learning rate of $1 e - 3$ and momentum of 0.92. $a _ { i }$ is the parameters of mollified activation function are initialized by sampling from uniform distribution, $\mathsf { \bar { U } } [ - 2 , 2 ]$ . + +# C.5 LSTM LANGUAGE MODELING + +We trained 2-layered LSTM language models on PTB word-level. We used the models with the same hyperparameters as in Zaremba & Sutskever (2014). We used the same hyperparameters for both the mollified LSTM language model and the LSTM. We use hard-sigmoid activation function for both the LSTM and mollified LSTM language model. We use hard-sigmoid activation function for the gates of the LSTM. + +# C.6 PREDICTING THE CHARACTER EMBEDDINGS FROM CHARACTERS + +We use $1 0 k$ of these words as a validation and another $1 0 k$ word embeddings as test set. We train a bidirectional-LSTM on top of each sequence of characters for each word and on top of the representation of bidirectional LSTM, we use a 5-layered tanh-MLP to predict the word-embedding. + +We train our models using RMSProp and momentum with learning rate of $6 e - 4$ and momentum 0.92. The size of the minibatches, we used is 64. As seen in Figure 9, mollified LSTM network converges faster. \ No newline at end of file diff --git a/parse/train/r1G4z8cge/r1G4z8cge_content_list.json b/parse/train/r1G4z8cge/r1G4z8cge_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..3d525baf36d12c269cdfc1def044865f172e185d --- /dev/null +++ b/parse/train/r1G4z8cge/r1G4z8cge_content_list.json @@ -0,0 +1,2470 @@ +[ + { + "type": "text", + "text": "MOLLIFYING NETWORKS ", + "text_level": 1, + "bbox": [ + 174, + 99, + 482, + 121 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Caglar Gulcehre1, Marcin Moczulski2,∗, Francesco Visin3,∗ Yoshua Bengio1 1 University of Montreal, 2 University of Oxford, 3 Politecnico di Milano ", + "bbox": [ + 184, + 143, + 720, + 172 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 209, + 544, + 224 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The optimization of deep neural networks can be more challenging than the traditional convex optimization problems due to highly non-convex nature of the loss function, e.g. it can involve pathological landscapes such as saddle-surfaces that can be difficult to escape from for algorithms based on simple gradient descent. In this paper, we attack the problem of optimization of highly non-convex neural networks objectives by starting with a smoothed – or mollified – objective function which becomes more complex as the training proceeds. Our proposition is inspired by the recent studies in continuation methods: similarly to curriculum methods, we begin by learning an easier (possibly convex) objective function and let it evolve during training until it eventually becomes the original, difficult to optimize objective function. The complexity of the mollified networks is controlled by a single hyperparameter that is annealed during training. We show improvements on various difficult optimization tasks and establish a relationship between recent works on continuation methods for neural networks and mollifiers. ", + "bbox": [ + 233, + 239, + 766, + 424 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 469, + 336, + 484 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In the last few years, deep neural networks – i.e. convolutional networks (LeCun et al., 1989), LSTMs (Hochreiter & Schmidhuber, 1997a) or GRUs (Cho et al., 2014) – set the state of the art on a range of challenging tasks (Szegedy et al., 2014; Visin et al., 2015; Hinton et al., 2012; Sutskever et al., 2014; Bahdanau et al., 2014; Mnih et al., 2013; Silver et al., 2016). However when trained with variants of SGD (Bottou, 1998) deep networks can be difficult to optimize due to their highly non-linear and non-convex nature (Choromanska et al., 2014; Dauphin et al., 2014). ", + "bbox": [ + 174, + 496, + 825, + 577 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "A number of approaches were proposed to alleviate the difficulty of optimization: addressing the problem of the internal covariate shift with Batch Normalization (Ioffe & Szegedy, 2015), learning with a curriculum (Bengio et al., 2009), recently an approach to train RNNs with diffusion process (Mobahi, 2016), and graduated optimization (Hazan et al., 2015). The impact of noise injection on the behavior of modern deep learning methods has been explored by Neelakantan et al. (2015a). Hazan et al. (2015) have shown that injecting a particular noise and scheduling it carefully, can guarantee the convergence in $O ( 1 / \\sigma ^ { 2 } \\epsilon ^ { 2 } )$ steps for $\\epsilon$ -optimal and $\\sigma$ -nice functions. Similar to our work graduated optimization optimizes a smoothed objective function without performing expensive convolutions. Injecting noise to the activation functions and scheduling it have been recently shown to improve the performance on a wide variety of tasks (Gulcehre et al., 2016). ", + "bbox": [ + 174, + 583, + 825, + 715 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "We connect the ideas of curriculum learning and continuation methods with those arising from models with skip connections and using layers that compute near-identity transformations. Skip connections allow to train very deep residual and highway architectures (He et al., 2015; Srivastava et al., 2015) by skipping layers or block of layers. Similarly, it has been shown that stochastically changing the depth of a network during training (Huang et al., 2016b) does not prevent convergence and enables better generalization performance. ", + "bbox": [ + 174, + 722, + 825, + 801 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "We discuss the idea of mollification for neural networks – a form of differentiable smoothing of the loss function connected to noisy activations – which in our case can be interpreted as a form of adaptive noise injection which is controlled by a single hyperparameter. Inspired by Huang et al. (2016b), we use a hyperparameter to stochastically control the depth of our network. This allows us to start the optimization from a convex objective function (as long as the optimized criterion is convex, e.g. linear or logistic regression) and to slowly introduce more complexity into the model by annealing the hyperparameter, thus making the network deeper and increasingly non-linear. ", + "bbox": [ + 174, + 808, + 825, + 901 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/a43e573759ef754c90bf6fbf3615df4808ea481cc1b4c0fe1226a5cfec94d678.jpg", + "image_caption": [ + "Figure 1: A sequence of optimization problems of increasing complexity, where the first ones are easy to solve but only the last one corresponds to the actual problem of interest. It is possible to tackle the problems in order, starting each time at the solution of the previous one and tracking the local minima along the way. " + ], + "image_footnote": [], + "bbox": [ + 383, + 93, + 614, + 204 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "An important difference of our work compared to injecting noise to the gradients as it is explored in (Hazan et al., 2015; Neelakantan et al., 2015b) is that we inject the noise in the forward computation of the graph and we shape the cost function directly. As a result the cost function for the mollified network both at the test time and during the training are consistent and this makes the early-stopping much easier. ", + "bbox": [ + 173, + 295, + 825, + 363 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 MOLLIFYING OBJECTIVE FUNCTIONS ", + "text_level": 1, + "bbox": [ + 176, + 382, + 521, + 398 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2.1 CONTINUATION AND ANNEALING METHODS ", + "text_level": 1, + "bbox": [ + 174, + 410, + 524, + 424 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Continuation methods and simulated annealing provide a general strategy to reduce the impact of local minima and deal with non-convex, continuous, but not necessarily everywhere differentiable objective functions by smoothing the original objective function and gradually reducing the amount of smoothing during training (Allgower & Georg, 1980) (see Fig. 1). ", + "bbox": [ + 173, + 425, + 825, + 479 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In machine learning, approaches based on curriculum learning (Bengio et al., 2009) are inspired by this principle and define a sequence of gradually more difficult training tasks (or training distributions) that eventually converge to the task of interest. ", + "bbox": [ + 174, + 484, + 825, + 526 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In the context of stochastic gradient descent, we use a stochastic estimation of the gradient for the smoothed objective function. This is convenient because it may not be analytically feasible to compute the smoothed function, but a Monte-Carlo estimate can often be obtained easily. ", + "bbox": [ + 176, + 532, + 823, + 571 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this paper we construct a sequence of smoothed objective functions obtained with a form of mollification and we progressively optimize them. The training procedure iterates over the sequence of objective functions starting from the simpler ones – i.e. with a smoother loss surface – and moving towards more complex ones until the last, original, objective function is reached.1 ", + "bbox": [ + 174, + 579, + 825, + 635 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2.2 MOLLIFIERS AND WEAK GRADIENTS ", + "text_level": 1, + "bbox": [ + 178, + 651, + 473, + 665 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We smooth the loss function $\\mathcal { L }$ , which is parametrized by $\\boldsymbol \\theta \\in \\mathbb { R } ^ { n }$ , by convolving it with another function $K ( \\cdot )$ with stride $\\tau \\in \\mathbb { R } ^ { n }$ : ", + "bbox": [ + 176, + 675, + 823, + 704 + ], + "page_idx": 1 + }, + { + "type": "equation", + "img_path": "images/a9bac6416796a497b88c3e4ce6ee927d26156c0e77a5af446fc6899bdbcd59c5.jpg", + "text": "$$\n\\mathscr { L } _ { K } ( \\pmb { \\theta } ) = ( \\mathscr { L } * K ) ( \\pmb { \\theta } ) = \\int _ { - \\infty } ^ { + \\infty } \\mathscr { L } ( \\pmb { \\theta } - \\pmb { \\tau } ) K ( \\pmb { \\tau } ) d \\pmb { \\tau }\n$$", + "text_format": "latex", + "bbox": [ + 331, + 710, + 666, + 747 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Although there are many choices for the function $K ( \\cdot )$ , we focus on those that satisfy the definition of a mollifier. ", + "bbox": [ + 174, + 762, + 823, + 790 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "A mollifier is an infinitely differentiable function that behaves like an approximate identity in the group of convolutions of integrable functions. If $K ( \\cdot )$ is an infinitely differentiable function, that converges to the Dirac delta function when appropriately rescaled and for any integrable function $\\mathcal { L }$ , then it is a mollifier: ", + "bbox": [ + 173, + 795, + 825, + 849 + ], + "page_idx": 1 + }, + { + "type": "equation", + "img_path": "images/6d7039927a5655136929072640ca21c54c0698a5482845f0a56f0ac661aa3fd4.jpg", + "text": "$$\n\\mathcal { L } ( \\pmb \\theta ) = \\operatorname* { l i m } _ { \\epsilon 0 } \\int \\epsilon ^ { - n } K ( \\pmb \\tau / \\epsilon ) \\mathcal { L } ( \\pmb \\theta - \\pmb \\tau ) d \\pmb \\tau .\n$$", + "text_format": "latex", + "bbox": [ + 362, + 856, + 635, + 888 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "If we choose $K ( \\cdot )$ to be a mollifier and obtain the smoothed loss function $\\mathcal { L } _ { K }$ as in Eqn. 1, we can take its gradient with respect to $\\pmb \\theta$ using directly the result from Evans (1998): ", + "bbox": [ + 171, + 103, + 823, + 131 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/9ca4455527ad8e48cb0dc887449843656638ce5fa51a93e426c6b1d342cc6429.jpg", + "text": "$$\n\\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { K } ( \\pmb { \\theta } ) = \\nabla _ { \\pmb { \\theta } } ( \\mathcal { L } \\ast K ) ( \\pmb { \\theta } ) = ( \\mathcal { L } \\ast \\nabla K ) ( \\pmb { \\theta } ) .\n$$", + "text_format": "latex", + "bbox": [ + 343, + 136, + 653, + 154 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To relate the resulting gradient $\\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { K }$ to the gradient of the original function $\\mathcal { L }$ , we introduce the notion of weak gradient, i.e. an extension to the idea of weak/distributional derivatives to functions with multidimensional arguments, such as loss functions of neural networks. ", + "bbox": [ + 176, + 165, + 825, + 207 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "For an integrable function $\\mathcal { L }$ in space ${ \\mathcal { L } } \\in L ( [ a , b ] )$ , ${ \\mathrm { ~ ~ g ~ } } \\in \\ L ( [ a , b ] ^ { n } )$ is a $n$ -dimensional weak gradient of $\\mathcal { L }$ if it satisfies: ", + "bbox": [ + 174, + 212, + 823, + 241 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/60622f586baee3bc3539334cca7165100f6f0a5a632d956822958f2467eb800f.jpg", + "text": "$$\n\\int _ { C } \\mathbf { g } ( \\pmb { \\tau } ) K ( \\pmb { \\tau } ) d \\pmb { \\tau } = - \\int _ { C } \\mathcal { L } ( \\pmb { \\tau } ) \\nabla K ( \\pmb { \\tau } ) d \\pmb { \\tau } ,\n$$", + "text_format": "latex", + "bbox": [ + 354, + 244, + 640, + 279 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where $K ( \\tau )$ is an infinitely differentiable function vanishing at infinity, $C \\in [ a , b ] ^ { n }$ and $\\tau \\in \\mathbb { R } ^ { n }$ ", + "bbox": [ + 173, + 284, + 803, + 299 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "As long as the chosen $K ( \\cdot )$ fulfills the definition of a mollifier we can use Eqn. 3 and Eqn. $4 ^ { 2 }$ to rewrite the gradient as: ", + "bbox": [ + 169, + 305, + 823, + 334 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/ab966a70938a27a555b09f8f8bdc7ab717ee5da9253431febc7067405c41d1be.jpg", + "text": "$$\n\\begin{array} { r l r } { \\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { K } ( \\pmb { \\theta } ) = ( \\mathcal { L } \\ast \\nabla K ) ( \\pmb { \\theta } ) } & { } & { \\mathrm { b y ~ E q n . ~ 3 } } \\\\ { = \\displaystyle \\int _ { C } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\tau } ^ { } ) \\nabla K ( \\pmb { \\tau } ^ { } ) d \\pmb { \\tau } } \\\\ { = - \\displaystyle \\int _ { C } \\mathbf { g } ( \\pmb { \\theta } - \\pmb { \\tau } ^ { } ) K ( \\pmb { \\tau } ^ { } ) d \\pmb { \\tau } } & { } & { \\mathrm { b y ~ E q n . ~ 4 } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 325, + 337, + 673, + 426 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "For a differentiable almost everywhere function $\\mathcal { L }$ , the weak gradient $g ( \\pmb \\theta )$ is equal to $\\nabla _ { \\boldsymbol { \\theta } } \\mathcal { L }$ almost everywhere. With a slight abuse of notation we can therefore write: ", + "bbox": [ + 173, + 436, + 823, + 465 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/a9fdad77f9115695511a104d62d70da3586873f3308dc87bdb1dad68e4b4a2bd.jpg", + "text": "$$\n\\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { K } ( \\pmb { \\theta } ) = - \\int _ { C } \\nabla _ { \\pmb { \\theta } } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\tau } ) K ( \\pmb { \\tau } ) d \\pmb { \\tau }\n$$", + "text_format": "latex", + "bbox": [ + 361, + 469, + 637, + 503 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.3 GAUSSIAN MOLLIFIERS ", + "text_level": 1, + "bbox": [ + 174, + 517, + 380, + 531 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "It is possible to use the standard Gaussian distribution $\\mathcal { N } ( 0 , \\bf { I } )$ as a mollifier $K ( \\cdot )$ , as it satisfies the desired properties: it is infinitely differentiable, a sequence of properly rescaled Gaussian distributions converges to the Dirac delta function and it vanishes in infinity. With such a $K ( \\cdot )$ the gradient becomes: ", + "bbox": [ + 173, + 541, + 825, + 597 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/7aaf714baa513747c6fed1e6280acc13bffa5969bbaf78a60cbd51521a64a804.jpg", + "text": "$$\n\\begin{array} { r l } { { \\nabla _ { \\theta } \\mathcal { L } _ { K = \\mathcal { N } } ( \\theta ) = - \\int _ { C } \\nabla _ { \\theta } \\mathcal { L } ( \\theta - \\tau ) p ( \\tau ) d \\tau } } \\\\ & { = \\mathrm { E } _ { \\tau } [ \\nabla _ { \\theta } \\mathcal { L } ( \\theta - \\tau ) ] , \\mathrm { w i t h } \\ \\tau \\sim \\mathcal { N } ( 0 , \\ \\mathbf { I } ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 313, + 602, + 684, + 655 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Exploiting the fact that a Gaussian distribution is a mollifier, we can focus on a sequence of mollifications indexed by scaling parameter $\\epsilon$ introduced in Eqn. 2. A single element of this sequence takes the following form: ", + "bbox": [ + 174, + 665, + 826, + 705 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/9950b1b7bd20ac0fef703f794670413e1bf914a9c4f70040e2a7c0c3b5d68505.jpg", + "text": "$$\n\\begin{array} { r l } & { \\nabla _ { \\boldsymbol { \\theta } } \\mathcal { L } _ { \\mathcal { N } , \\epsilon } ( \\boldsymbol { \\theta } ) = - \\displaystyle \\int _ { C } \\nabla _ { \\boldsymbol { \\theta } } \\mathcal { L } ( \\boldsymbol { \\theta } - \\boldsymbol { \\tau } ) \\epsilon ^ { - 1 } p ( \\boldsymbol { \\tau } / \\epsilon ) d \\boldsymbol { \\tau } } \\\\ & { ~ = \\mathrm { E } _ { \\boldsymbol { \\tau } } [ \\nabla _ { \\boldsymbol { \\theta } } \\mathcal { L } ( \\boldsymbol { \\theta } - \\boldsymbol { \\tau } ) ] , \\mathrm { w i t h } \\boldsymbol { \\tau } \\sim \\mathcal { N } ( 0 , \\epsilon ^ { 2 } \\mathbf { I } ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 313, + 710, + 684, + 765 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Replacing $\\epsilon$ with $\\sigma$ yields a sequence of mollifications indexed by $\\sigma$ ", + "bbox": [ + 173, + 775, + 622, + 790 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/37289e4b45dbdcb9cec31211bf54eada6503f4e6bfe11e4317f5fd524dee448a.jpg", + "text": "$$\n\\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { \\mathcal { N } , \\sigma } ( \\pmb { \\theta } ) = \\mathrm { E } _ { \\pmb { \\tau } } [ \\nabla _ { \\pmb { \\theta } } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\tau } ) ] , \\mathrm { w i t h } \\ \\pmb { \\tau } \\sim \\mathcal { N } ( 0 , \\ \\sigma ^ { 2 } \\mathbf { I } )\n$$", + "text_format": "latex", + "bbox": [ + 310, + 796, + 687, + 814 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "with the following property (by Eqn. 2): ", + "bbox": [ + 174, + 818, + 437, + 833 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/3c7449568d79bb87b5729d188e6055dd46b393c8ef4407f517bed765d80d48c3.jpg", + "text": "$$\n\\operatorname* { l i m } _ { \\sigma \\to 0 } \\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { \\mathcal { N } , \\sigma } ( \\pmb { \\theta } ) = \\nabla _ { \\pmb { \\theta } } \\mathcal { L } ( \\pmb { \\theta } )\n$$", + "text_format": "latex", + "bbox": [ + 401, + 837, + 596, + 861 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "An intuitive interpretation of the result is that $\\sigma$ determines the standard deviation of a mollifying Gaussian and is annealed in order to construct a sequence of gradually less \"blurred\" and closer approximations to $\\mathcal { L }$ . This is consistent with the property that when $\\sigma$ is annealed to zero we are optimizing the original function $\\mathcal { L }$ . ", + "bbox": [ + 176, + 872, + 825, + 901 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 103, + 823, + 131 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "So far we obtained the mollified version $\\mathcal { L } _ { K } ( \\pmb { \\theta } )$ of the cost function $\\mathcal { L } ( \\pmb { \\theta } )$ by convolving it with a mollifier $K ( \\pmb \\theta )$ . The kernel $K ( \\pmb \\theta )$ corresponds to the average effect of injecting noise $\\bar { \\xi }$ sampled from standard Normal distribution. The amount of noise controls the amount of smoothing. Gradually reducing the noise during training is related to a form of simulated annealing (Kirkpatrick et al., 1983). Similarly to the analysis in Mobahi (2016), we can write a Monte-Carlo estimate of $\\begin{array} { r } { \\mathcal { L } _ { K } ( \\pmb { \\theta } ) = ( \\mathcal { L } * K ) ( \\pmb { \\theta } ) \\approx \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\xi } ^ { ( i ) } ) } \\end{array}$ . We provide the derivation and the gradient of this equation in Appendix A. ", + "bbox": [ + 173, + 137, + 825, + 234 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The Monte-Carlo estimators of the mollifiers can be easily implemented with neural networks, where the layers typically have the form: ", + "bbox": [ + 173, + 239, + 823, + 267 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/050189de7e54b542177fd8538c98b7593e4d651e1001fe8adbca8f211bd00a87.jpg", + "text": "$$\n\\mathbf { h } ^ { l } = \\mathbf { f } ( \\mathbf { W } ^ { l } \\mathbf { h } ^ { l - 1 } )\n$$", + "text_format": "latex", + "bbox": [ + 439, + 266, + 557, + 286 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "with $\\mathbf { h } ^ { l - 1 }$ a vector of activations from the previous layer in the hierarchy, $\\mathbf { W } ^ { l }$ a matrix representing a linear transformation and f an element-wise non-linearity of choice. ", + "bbox": [ + 171, + 290, + 825, + 319 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "A mollification of such a layer can be formulated as: ", + "bbox": [ + 173, + 324, + 519, + 339 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/3467103ada77b6382f68c5afaac9af4dd31dec9653e774d1d9b33cabedf27408.jpg", + "text": "$$\n\\mathbf { h } ^ { l } = \\mathbf { f } ( ( \\mathbf { W } ^ { l } - \\boldsymbol { \\xi } ^ { l } ) \\mathbf { h } ^ { l - 1 } ) , \\mathrm { w h e r e \\ } \\boldsymbol { \\xi } ^ { l } \\sim \\mathcal { N } ( \\mu , \\boldsymbol { \\sigma } ^ { 2 } )\n$$", + "text_format": "latex", + "bbox": [ + 341, + 347, + 655, + 366 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "From Eqn. 16, it is easy to see that both weight noise methods proposed by Hinton $\\&$ van Camp (1993) and Graves (2011) can be seen as a variation of Monte-Carlo estimate of mollifiers. ", + "bbox": [ + 171, + 380, + 823, + 409 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.4 GENERALIZED AND NOISY MOLLIFIERS ", + "text_level": 1, + "bbox": [ + 174, + 421, + 493, + 435 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We introduce a generalization of the concept of mollifiers that encompasses the approach we explored here and that is targeted during optimization via a continuation method using stochastic gradient descent. ", + "bbox": [ + 176, + 443, + 823, + 484 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Definition 2.1. (Generalized Mollifier). A generalized mollifier is an operator, where $T _ { \\sigma } ( f )$ defines a mapping between two functions, such that $T _ { \\sigma } : f \\to f ^ { * }$ . ", + "bbox": [ + 173, + 488, + 823, + 516 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/f0c9f435739b6fad0bfe9a7785f0a75340c1eb0a978691f96934be1e7cbf6717.jpg", + "text": "$$\n\\operatorname* { l i m } _ { \\sigma \\to 0 } T _ { \\sigma } f = f ,\n$$", + "text_format": "latex", + "bbox": [ + 449, + 523, + 547, + 545 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/8d81d610d83e3c4468314d45c09a25e522cbf3b2170425900cdf24b9ae72cbd0.jpg", + "text": "$$\n\\begin{array} { r l } { { f ^ { 0 } = \\displaystyle \\operatorname* { l i m } _ { \\sigma \\to \\infty } T _ { \\sigma } f \\quad } } & { { \\mathrm { ~ i s ~ \\ a n ~ i d e n t i t y ~ f u n c t i o n ~ } } } \\\\ { { \\frac { \\partial ( T _ { \\sigma } f ) ( x ) } { \\partial x } \\quad } } & { { \\mathrm { e x i s t s ~ } \\forall x , \\sigma > 0 } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 339, + 556, + 656, + 625 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In addition, we consider noisy mollifiers which can be defined as an expected value of a stochastic function $\\phi ( x , \\xi )$ under some noise source $\\xi$ with variance $\\sigma$ : ", + "bbox": [ + 173, + 633, + 820, + 660 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/ba9a406f9b3150a536dd8186a5a2abedfd676c09e938a7a9eeac6418b206e8aa.jpg", + "text": "$$\n( T _ { \\sigma } f ) ( x ) = E _ { \\xi } [ \\phi ( x , \\xi _ { \\sigma } ) ]\n$$", + "text_format": "latex", + "bbox": [ + 413, + 666, + 584, + 685 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Definition 2.2. (Noisy Mollifier). We call a stochastic function $\\phi ( x , \\xi _ { \\sigma } )$ with input $x$ and noise $\\xi$ a noisy mollifier if its expected value corresponds to the application of a generalized mollifier $T _ { \\sigma }$ , as per Eqn. 20. ", + "bbox": [ + 173, + 690, + 826, + 732 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The composition of two noisy mollifiers sharing the same $\\sigma$ is also a noisy mollifier, since the three properties in the definition (Eqns. 17,18,19) are still satisfied. When $\\sigma = 0$ no noise is injected and therefore the original function will be optimized. If $\\sigma \\to \\infty$ instead, the function will become an identity function. Thus, for instance, if we mollify each layer of a feed-forward network except the output layer, when $\\sigma \\to \\infty$ all the mollified layers will become identity function and the objective function of the network with respect to its inputs will be convex. ", + "bbox": [ + 173, + 743, + 825, + 824 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Consequently, corrupting separately the activation function of each level of a deep neural network (but with a shared noise level $\\sigma$ ) and annealing $\\sigma$ yields a noisy mollifier for the objective function. This is related to the work of Mobahi (2016), who recently introduced a way of analytically smoothing of the non-linearities to help the training of recurrent networks. The differences of that approach from our algorithm is two-fold: we use a noisy mollifier (rather than an analytic smoothing of the network’s non-linearities) and we introduce (in the next section) a particular form of the noisy mollifier that empirically proved to work well. ", + "bbox": [ + 174, + 830, + 825, + 924 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Shaping the cost function to define a sequence of costs that are progressing from easier to more difficult ones can be related to the reward shaping $\\mathrm { N g }$ et al., 1999; $\\bar { \\bf N } \\mathrm { \\bf g }$ , 2003) algorithms. In our algorithm, we shape the cost and the model architecture itself, rather than rewards or the targets in order to make the optimization easier. In that sense, reward shaping can be considered to be more closer to curriculum learning. ", + "bbox": [ + 174, + 103, + 825, + 171 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 METHOD ", + "text_level": 1, + "bbox": [ + 174, + 190, + 282, + 207 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We propose an algorithm to mollify the cost of a neural network which also addresses an important drawback of the previously proposed noisy training procedures: as the noise gets larger, it can dominate the learning process and lead the algorithm to perform a random walk on the energy landscape of the objective function. Conversely in our algorithm, as the noise gets larger gradient descent minimizes a simpler (e.g. convex) but still meaningful objective function. ", + "bbox": [ + 174, + 222, + 825, + 290 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We define the desired behavior of the network in the limit cases where the noise is very large or very small, and modify the model architecture accordingly. Specifically, during training we minimize a sequence of increasingly complex noisy objectives $\\bar { \\mathrm { L } } = ( \\bar { \\mathcal { L } } ^ { 1 } ( \\pmb { \\theta } ; \\xi _ { \\sigma _ { 1 } } ) , \\bar { \\mathcal { L } } ^ { 2 } ( \\pmb { \\theta } ; \\xi _ { \\sigma _ { 2 } } ) , \\cdots , \\bar { \\mathcal { L } } ^ { k } ( \\pmb { \\theta } ; \\xi _ { \\sigma _ { k } } ) )$ that we obtain by annealing the scale (variance) of the noise $\\sigma _ { i }$ . Let us note that our algorithm satisfies the fundamental properties of the generalized and noisy mollifiers that we introduced earlier. ", + "bbox": [ + 174, + 295, + 825, + 364 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We use a noisy mollifier based on our definition in Section 2.4. Instead of convolving the objective function with a kernel: ", + "bbox": [ + 174, + 369, + 823, + 397 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "1. We start the training by optimizing a convex objective function that is obtained by configuring all the layers between the input and the last cost layer to compute an identity function, i.e., by skipping both the affine transformations and the blocks followed by nonlinearities. 2. During training, the magnitude of noise which is proportional to $p$ is annealed, allowing to gradually evolve from identity transformations to linear transformations between the layers. 3. Simultaneously, as we decrease the $p$ , the noisy mollification procedure allows the element-wise activation functions to gradually change from linear to be nonlinear. ", + "bbox": [ + 174, + 406, + 826, + 501 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4 SIMPLIFYING THE OBJECTIVE FUNCTION FOR FEEDFORWARD NETWORKS ", + "text_level": 1, + "bbox": [ + 173, + 523, + 820, + 540 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "For every unit of each layer, we either copy the activation (output) of the corresponding unit of the previous layer (the identity path in Figure 2) or output a noisy activation $\\tilde { \\mathbf { h } } ^ { l }$ of a non-linear transformation of it $\\psi ( \\mathbf { h } ^ { l - 1 } , \\boldsymbol { \\xi } ; \\bar { \\mathbf { W } } ^ { l } )$ , where $\\boldsymbol { \\xi }$ is noise, $\\bar { \\mathbf { W } } ^ { l }$ is a weight matrix applied on $\\mathbf { h } ^ { l - 1 }$ and $\\pi$ is a vector of binary decisions for each unit (the convolutional path in Figure 2): ", + "bbox": [ + 174, + 554, + 825, + 613 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/f21a43fb99383f5278852be96b53c872f13a827906bda544c48a7da869cdc95d.jpg", + "text": "$$\n\\begin{array} { c } { { \\tilde { \\mathbf { h } } ^ { l } = \\psi ( \\mathbf { h } ^ { l - 1 } , \\pmb { \\xi } ; \\mathbf { W } ^ { l } ) } } \\\\ { { \\phi ( \\mathbf { h } ^ { l - 1 } , \\pmb { \\xi } , \\pi ^ { l } ; \\mathbf { W } ^ { l } ) = \\pi ^ { l } \\odot \\mathbf { h } ^ { l - 1 } + ( 1 - \\pi ^ { l } ) \\odot \\tilde { \\mathbf { h } ^ { l } } } } \\\\ { { \\mathbf { h } ^ { l } = \\phi ( \\mathbf { h } ^ { l - 1 } , \\pmb { \\xi } , \\pi ^ { l } ; \\mathbf { W } ^ { l } ) . } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 331, + 618, + 666, + 684 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "To decide which path to take, for each unit in the network, a binary stochastic decision is taken by drawing from a Bernoulli distribution with probability dependent on the decaying value of $p ^ { l }$ : ", + "bbox": [ + 174, + 695, + 826, + 726 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/7d1bc2e0c9726684620e03af7856caaf1e0bee00ac936e8579f2a39c0be868b8.jpg", + "text": "$$\n\\pi ^ { l } \\sim \\mathrm { B e r n o u l l i } ( p ^ { l } )\n$$", + "text_format": "latex", + "bbox": [ + 431, + 732, + 566, + 751 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "If the number of hidden units of layer $l - 1$ and layer $l + 1$ is not the same, we can either zero-pad layer $l - 1$ before feeding it into the next layer or apply a linear projection to obtain the right dimensionality. ", + "bbox": [ + 171, + 765, + 825, + 794 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "For $p ^ { l } = 1$ , the layer computes the identity function leading to a convex objective. If $p ^ { l } = 0$ the layer computes the original non-linear transformation unfolding the full capacity of the model. We call the connections that are introduced this way as unitwise stochastic skip connections(USSC). ", + "bbox": [ + 174, + 800, + 825, + 840 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In DropIn layers (Smith et al., 2016) a binary random vector is sampled from a Bernoulli distribution to decide whether to introduce skip a connection from the layer below $l - 1$ for each layer $l$ and they use this as a regularization. As opposed to the USSC, DropIn layers do not necessarily do not necessarily achieve a convex objective function as the DropIn ratio $( \\hat { p ^ { l } } )$ increases. ", + "bbox": [ + 174, + 847, + 825, + 904 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The pseudo-code for the mollified activations is reported in Algorithm 1. ", + "bbox": [ + 173, + 909, + 648, + 924 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/80eecd4ac991add0cb642b20c46377ca05f8af859e791101be6113b09d06839f.jpg", + "image_caption": [ + "Figure 2: Top: Stochastic depth. Bottom: mollifying network. The dashed line represents the optional residual connection. In the top path, the input is processed with a convolutional block followed by a noisy activation function, while in the bottom path the original activation of the layer $l - 1$ is propagated untouched. For each unit, one of the two paths in picked according to a binary stochastic decision $\\pi$ . " + ], + "image_footnote": [], + "bbox": [ + 200, + 101, + 794, + 295 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Algorithm 1 Activation of a unit $i$ at layer $l$ ", + "text_level": 1, + "bbox": [ + 176, + 391, + 464, + 406 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "1: $x _ { i } \\gets \\mathbf { w } _ { i } ^ { \\top } \\mathbf { h } ^ { l - 1 } + b _ { i }$ . an affine transformation of hl−1 \n2: $\\Delta _ { i } \\gets \\mathbf { u } ( x _ { i } ) - \\mathbf { f } ( x _ { i } )$ $\\mathsf { D } \\Delta _ { i }$ is a measure of a saturation of a unit \n3: $\\sigma ( x _ { i } ) \\gets ( \\mathrm { s i g m o i d } ( a _ { i } \\Delta _ { i } ) - 0 . 5 ) ^ { 2 }$ . std of the injected noise depends on $\\Delta _ { i }$ \n4: $\\xi _ { i } \\sim \\mathcal { N } ( 0 , 1 )$ . sampling the noise from a basic Normal distribution \n5: $s _ { i } \\gets p ^ { l } c \\sigma ( x _ { i } ) | \\xi _ { i } |$ . Half-Normal noise controlled by $\\sigma ( x _ { i } )$ , const. $c$ and prob-ty $p ^ { l }$ \n6: $\\psi ( x _ { i } , \\xi _ { i } ) \\gets \\mathrm { s g n } ( \\mathbf { u } ^ { * } ( x _ { i } ) ) \\mathrm { m i n } ( | \\mathbf { u } ^ { * } ( x _ { i } ) |$ , $| \\mathbf { f } ^ { * } ( x _ { i } ) + \\mathrm { s g n } ( \\mathbf { u } ^ { * } ( x _ { i } ) ) | \\hat { s _ { i } } | | ) + \\bar { \\mathbf { u } } ( 0 )$ $\\triangleright$ noisy activation \n7: $\\pi _ { i } ^ { l } \\sim { \\bf B e r n o u l l i } ( p ^ { l } ) \\qquad \\triangleright p ^ { l }$ controls the variance of the noise AND the prob of skipping a unit \n8: $\\ddot { h } _ { i } ^ { l } = \\psi ( x _ { i } , \\xi _ { i } )$ . $\\tilde { h } _ { i } ^ { l }$ is a noisy activation candidate \n9: $\\phi ( \\mathbf { h } ^ { l - 1 } , \\xi _ { i } , \\pi _ { i } ^ { l } ; \\mathbf { w } _ { i } ) = \\pi _ { i } ^ { l } h _ { i } ^ { l - 1 } + ( 1 - \\pi _ { i } ^ { l } ) \\tilde { h } _ { i } ^ { l }$ . make a HARD decision between $h _ { i } ^ { l - 1 }$ and $\\tilde { h } _ { i } ^ { l }$ ", + "bbox": [ + 178, + 409, + 825, + 547 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "5 LINEARIZING THE NETWORK ", + "text_level": 1, + "bbox": [ + 176, + 574, + 446, + 589 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In Section 2, we show that convolving the objective function with a particular kernel can be approximated by adding noise to the activation function. This method may suffer from excessive random exploration when the noise is very large. ", + "bbox": [ + 173, + 603, + 823, + 645 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We address this issue by bounding the element-wise activation function $\\operatorname { f } ( \\cdot )$ with its linear approximation when the variance of the noise is very large, after centering it at the origin. The resulting function $\\mathrm { f } ^ { \\ast } ( \\cdot )$ is bounded and centered around the origin. ", + "bbox": [ + 174, + 651, + 823, + 693 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Note that centering the sigmoid or hard-sigmoid will make them symmetric with respect to the origin. With a proper choice of the standard deviation $\\sigma ( \\mathbf { h } )$ , the noisy activation function becomes a linear function of the input when $\\mathfrak { p }$ is large, as illustrated by Figure 10. ", + "bbox": [ + 173, + 698, + 825, + 739 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Let $\\mathbf { u } ^ { * } ( x ) = \\mathbf { u } ( x ) - \\mathbf { u } ( 0 )$ , where ${ \\bf u } ( 0 )$ is the offset of the function from the origin, and $x _ { i }$ the $i$ -th dimension of an affine transformation of the output of the previous layer $\\mathbf { h } ^ { l - 1 }$ : $x _ { i } = \\mathbf { w } _ { i } ^ { \\top } \\mathbf { h } ^ { l - 1 } + b _ { i }$ . Then: ", + "bbox": [ + 173, + 744, + 825, + 776 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/d3ce9f3819bca81dc0de1cfc2bf008e295e1d224a2a62b8c68d791d67d3954c7.jpg", + "text": "$$\n\\psi ( x _ { i } , \\xi _ { i } ; \\mathbf { w } _ { i } ) = \\mathrm { s g n } ( \\mathbf { u } ^ { * } ( x _ { i } ) ) \\mathrm { m i n } ( | \\mathbf { u } ^ { * } ( x _ { i } ) | , | \\mathbf { f } ^ { * } ( x _ { i } ) + \\mathrm { s g n } ( \\mathbf { u } ^ { * } ( x _ { i } ) ) | s _ { i } | | ) + \\mathbf { u } ( 0 )\n$$", + "text_format": "latex", + "bbox": [ + 245, + 792, + 751, + 810 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The noise is sampled from a Normal distribution with mean 0 and whose standard deviation depends on $c$ : ", + "bbox": [ + 176, + 813, + 823, + 838 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/aa8a9b68c9de09337719d7e42d807b4953173f578a18141b7d1cba2668e133e6.jpg", + "text": "$$\ns _ { i } \\sim \\mathcal { N } ( 0 , p c \\sigma ( x _ { i } ) )\n$$", + "text_format": "latex", + "bbox": [ + 426, + 837, + 573, + 854 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "5.1 LINEARIZING RELU ACTIVATION FUNCTION ", + "text_level": 1, + "bbox": [ + 173, + 868, + 527, + 885 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We have a simpler form of the equations to linearize ReLU (Nair & Hinton, 2010) activation function when $p ^ { l } \\to \\infty \\quad$ . Instead of the complicated Eqn. 23. We can use a simpler equation as in Eqn. 26 to ", + "bbox": [ + 174, + 893, + 825, + 924 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/644f80b2c2d62505206241eaafd9d373597c1578b8fc6d71a55ea6c773a2d3d5.jpg", + "image_caption": [ + "Figure 3: The figures show how to evolve the model to make it closer to a linear network. Arrows denote the direction of the noise pushing the activation function towards the linear function. a) The quasi-convex envelope established by a $| \\mathrm { { s i g m o i d } ( \\cdot ) | }$ around $| 0 . 2 5 x |$ . b) A depiction of how the noise pushes the sigmoid to become a linear function. " + ], + "image_footnote": [], + "bbox": [ + 192, + 109, + 802, + 263 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "achieve the linearization of the activation function when we have a very large noise in the activation function: ", + "bbox": [ + 173, + 354, + 823, + 383 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/008d8fbe2e5477a9e0c37b8b15192bbd2b6d56dfb8c0e07eb1e9d7de28cf304d.jpg", + "text": "$$\n\\begin{array} { c } { s _ { i } = \\underset { \\mathbf { \\sigma } } { \\mathrm { m i n i m u m } } ( | x _ { i } | , p \\sigma ( x _ { i } ) | \\boldsymbol { \\xi } | ) } \\\\ { \\psi ( x _ { i } , \\xi _ { i } , \\mathbf { w } _ { i } ) = \\mathbf { f } ( x _ { i } ) - s _ { i } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 357, + 405, + 640, + 443 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "6 MOLLIFYING LSTMS AND GRUS ", + "text_level": 1, + "bbox": [ + 173, + 458, + 488, + 474 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "In a similar vein it is possible to smooth the objective functions of LSTM and GRU networks by starting the optimization procedure with a simpler objective function such as optimizing a word2vec, BoW-LM or CRF objective function at the beginning of training and gradually increasing the difficulty of the optimization by increasing the capacity of the network. ", + "bbox": [ + 173, + 488, + 825, + 542 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "For GRUs we set the update gate to $\\textstyle { \\frac { 1 } { t } }$ – where $t$ is the time-step index – and reset the gate to 1 if the noise is very large, using Algorithm 1. Similarly for LSTMs, we can set the output gate to 1 and input gate to $\\textstyle { \\frac { 1 } { t } }$ and forget gate to $\\textstyle { 1 - { \\frac { 1 } { t } } }$ when the noise is very large. The output gate is 1 or close to 1 when the noise is very large. This way the LSTM will behave like a BOW model. In order to achieve this behavior, the activations $\\psi ( x _ { t } , \\dot { \\xi _ { i } } )$ of the gates can be formulated as: ", + "bbox": [ + 173, + 549, + 825, + 619 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/b77f3e1ce6b4ee6007e9628c6b173d61d5ab3691adbebd286cbda48a4fed0ce7.jpg", + "text": "$$\n\\boldsymbol { \\psi } ( x _ { t } ^ { l } , \\xi ) = \\mathbf { f } ( x _ { t } ^ { l } + p ^ { l } \\sigma ( x ) | \\xi | )\n$$", + "text_format": "latex", + "bbox": [ + 401, + 622, + 596, + 641 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "By using a particular formulation of $\\sigma ( x )$ that constraints it to be in expectation over $\\xi$ when $p ^ { l } = 1$ , we can obtain a function for $\\gamma \\in \\mathbb { R }$ within the range of $\\operatorname { f } ( \\cdot )$ that is discrete in expectation, but still per sample differentiable: ", + "bbox": [ + 173, + 646, + 825, + 686 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/7462e8550aaec5c2e5686a1abb87a851f31e4c8c2cbd8bd761ef16c81cc03eb6.jpg", + "text": "$$\n\\sigma ( x _ { t } ^ { l } ) = \\frac { \\mathrm { f } ^ { - 1 } ( \\gamma ) - x _ { t } ^ { l } } { \\mathrm { E } _ { \\xi } [ | \\xi | ] }\n$$", + "text_format": "latex", + "bbox": [ + 426, + 702, + 571, + 738 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We provide the derivation of Eqn. 28 in Appendix B. The gradient of the Eqn. 28 will be a Monte-Carlo approximation to the gradient of $\\bar { \\bf f } ( { \\bf x } _ { t } ^ { l } )$ . ", + "bbox": [ + 171, + 738, + 825, + 768 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "7 ANNEALING SCHEDULES FOR $p$ ", + "text_level": 1, + "bbox": [ + 176, + 786, + 470, + 803 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We used a different schedule for each layer of the network, such that the noise in the lower layers will anneal faster. This is similar to the linearly decaying probability of layers in Huang et al. (2016b). ", + "bbox": [ + 171, + 816, + 825, + 845 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Exponential Decay In our experiments, we focused on using an annealing schedule similar to the inverse sigmoid rule in Bengio et al. (2015) with $p _ { t } ^ { l }$ , ", + "bbox": [ + 173, + 858, + 823, + 888 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/00e2dab64f5c89f51db46ef01b810fdff7d90c203c8ec182489fbefd5fe0064c.jpg", + "text": "$$\np _ { t } ^ { l } = 1 - \\mathrm { e } ^ { - \\frac { k v _ { t } l } { t L } }\n$$", + "text_format": "latex", + "bbox": [ + 444, + 904, + 553, + 925 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "with hyper-parameter model. We stop anne $k \\geq 0$ at wh $t ^ { t h }$ update for the he expected de $l ^ { t h }$ $L$ is the number of layers reaches some threshold the. In $\\begin{array} { r } { p _ { t } = \\sum _ { i = 1 } ^ { L } p _ { t } ^ { l } } \\end{array}$ $\\delta$ our experiment we set $v _ { t }$ to be a moving average of the $\\mathrm { l o s s } ^ { 3 }$ of the network, but for some of our experimnets that resulted unstable behaviors in the training and thus we have to fix $v _ { t }$ to 1. An advantage of using running average of loss for the $v _ { t }$ is because the behavior of the loss/optimization can directly influence the annealing behavior of the network. Because we will have: ", + "bbox": [ + 173, + 102, + 825, + 189 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/e11515286cdb82c18307c87f52abe95b1878a73f8e35bd5738690c359abb3f4b.jpg", + "text": "$$\n\\operatorname* { l i m } _ { { \\bf v } _ { t } \\to \\infty } p _ { t } ^ { l } = 1 \\mathrm { ~ \\ a n d , ~ } \\operatorname* { l i m } _ { { \\bf v } _ { t } \\to 0 } p _ { t } ^ { l } = 0 .\n$$", + "text_format": "latex", + "bbox": [ + 385, + 189, + 609, + 215 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "This has a desirable property: when the training-loss is high, the noise injected into the system will be large as well. As a result, the model is encouraged to do more exploration, while if the model converges the noise injected into the system by the mollification procedure will be zero. ", + "bbox": [ + 173, + 215, + 826, + 257 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Square-root Decay The square root decaying of the learning rate is very popular. In our experiments we have tried to decay the plt according to min(pmin, 1 − q $\\begin{array} { r } { 1 - \\sqrt { \\frac { t } { N _ { e p o c h s } } } ) } \\end{array}$ where $t$ is the index of the iteration/epoch over the data and $N _ { e p o c h s }$ corresponds to the total number of iterations that the model will do on the dataset. $p _ { m i n }$ is hyperparameter to define the lower bound on the $p _ { t } ^ { l }$ . ", + "bbox": [ + 173, + 270, + 825, + 338 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Linear Decay We have also experimented with linearly decaying the $p _ { t } ^ { l }$ via $\\begin{array} { r } { \\operatorname* { m i n } ( p _ { m i n } , 1 - \\frac { t } { N _ { e p o c h s } } ) } \\end{array}$ We have compared the plot of different annealing methods described in this paper as in Figure 4. ", + "bbox": [ + 173, + 352, + 826, + 392 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/0edec83fe7d1c958a8488792b79a2fed28b69de56bc31b6fc444f2b0511e2401.jpg", + "image_caption": [ + "Figure 4: We compare different annealing schedules with respect to the time in y-axis(iterations). " + ], + "image_footnote": [], + "bbox": [ + 292, + 420, + 699, + 645 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Furthermore, in our experiments we observe that training with noisy mollifiers can potentially be helpful for the generalization. This can be due to the noise induced to the backpropagation through the noisy mollification, that makes SGD more likely to converge to a flatter-minima (Hochreiter & Schmidhuber, 1997b) because the noise will help it escape from sharper local minima. ", + "bbox": [ + 174, + 691, + 825, + 744 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "8 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 176, + 763, + 326, + 779 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In this section we mainly focus on training of difficult to optimize models, in particular deep MLPs with sigmoid or tanh activation functions. The details of the experimental procedure is provided in Appendix C. ", + "bbox": [ + 174, + 792, + 825, + 834 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "8.1 EXPLORATORY STUDY ON MNIST ", + "text_level": 1, + "bbox": [ + 176, + 849, + 454, + 863 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We train a thin deep neural network on MNIST (LeCun & Cortes, 1998) dataset with 72 hidden layers and 100 hidden units. We train our model with Adam(Kingma & Ba, 2014) optimizer and fix the learning rate of all the models to $3 e { - 4 }$ . We have used the same learning-rate for all the models in order to factor out the possibility that a model converges faster, due to the fact of using a larger learning rate. ", + "bbox": [ + 178, + 875, + 823, + 902 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 171, + 103, + 825, + 131 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Firstly, in Figure 5, we investigate the effect of using different annealing schedules. Exponential decay converges faster compared to linear decay and square root decay of $p$ . We find it to be very unstable to train our model with linear and square root decay in particular for large $c$ values. Thus we have to use smaller $c$ value (20 instead of 100) to be able to train the model with causing it to diverge. ", + "bbox": [ + 174, + 137, + 825, + 190 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/be0d19fd9d12424b4a91c95146d3758bf25debfc209b87d8462abca2c20cfb26.jpg", + "image_caption": [ + "Figure 5: We compare the training performance of different types of annealing methods used with mollification procedure to anneal the parameter of the mollification $p$ . Decaying the $p$ exponentially achieves both better training and validation performance. " + ], + "image_footnote": [], + "bbox": [ + 320, + 228, + 653, + 401 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In Figure 6, we show the effect of using the noisy training procedure that we have introduced by sampling a mask from Bernoulli and Gaussian distributions versu using the deterministic approximation of this noisy procedure which we also use for the test time but during the training as well. ", + "bbox": [ + 173, + 479, + 826, + 521 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/4b8a3ac20b57ecaf26bfbb68e0f1deb19984fdd2b9a2d6ea11e3f0a10189a871.jpg", + "image_caption": [ + "Figure 6: We show the learning curves of the model where we don’t inject the noise during the training and instead use the deterministic approximation for the mollification during the training as well. The differerence in terms of speed of learning is very small. " + ], + "image_footnote": [], + "bbox": [ + 320, + 558, + 653, + 732 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In Figure 7, we compare the results obtained for the model using mollification obtained with or without batch normalization and feed-forward residual networks. The mollified model performs very closely to the MLP trained with residual connections and the batchnorm. However, using residual connections and batch-norm does not seem to improve the results. ", + "bbox": [ + 174, + 809, + 825, + 863 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We have tried to run experiment with the Monte-Carlo approximation of the mollification which is derived in Appendix A, however when we start with large noise and anneal the noise during the training, the model was very unstable and training was diverging. If we start with small noise and anneal the magnitude of the noise during the training, we could not observe any effect of it on the training. ", + "bbox": [ + 174, + 869, + 825, + 924 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/24f40f65392ee90e6386375192de3d2b7240bb6ad5b1529448614804c614f410.jpg", + "image_caption": [ + "Figure 7: We investigate the effect of using batch norm and residual connection for mollifcation and compare against to the network with residual connections and batch-norm. The effect of batch norm on this task for mollification seems to be very small and training convergence performance of the all the approaches are very close to each other. " + ], + "image_footnote": [], + "bbox": [ + 320, + 111, + 653, + 285 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/c41840e048fd609433dd3b430329544afc0d1b86c1b1c7b4544f1462c89c0e19.jpg", + "image_caption": [ + "Figure 8: The learning curves of a 6-layers MLP with sigmoid activation function on 40 bit parity task. " + ], + "image_footnote": [], + "bbox": [ + 243, + 381, + 485, + 517 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/f378c6167f9ea9fa01daa4b81cf06eab81db69264d83a592a7353cf57198fa76.jpg", + "table_caption": [ + "Table 1: CIFAR10 deep convolutional neural network. " + ], + "table_footnote": [], + "table_body": "
Test Accuracy
Stochastic Depth93.25
Mollified Convnet92.45
ResNet91.78
", + "bbox": [ + 545, + 450, + 782, + 520 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "8.2 DEEP MLP EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 174, + 604, + 397, + 617 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Deep Parity Experiments Training neural networks on a high-dimensional parity problem can be challenging (Graves, 2016; Kalchbrenner et al., 2015). We experiment on forty dimensional (bits) parity problem with 6-layer MLP using sigmoid activation function. All the models are initialized with Glorot initialization Glorot et al. (2011) and trained with SGD with momentum. We compare an MLP with residual connections using batch normalization and a mollified network with sigmoid activation function. As can be seen in Figure 8, the mollified network converges faster. ", + "bbox": [ + 174, + 632, + 825, + 712 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Deep Pentomino Pentomino is a toy-image dataset where each image has 3 Pentomino blocks. The task is to predict whether if there is a different shape in the image or not (Gülçehre & Bengio, 2013). The best reported result on this task with MLPs is $6 8 . 1 5 \\%$ accuracy (Gulcehre et al., 2014). The same model as ours trained without noisy activation function and vanilla residual connections scored $6 9 . 5 \\%$ accuracy, while our mollified version scored $7 5 . 1 5 \\%$ accuracy after 100 epochs of training on the $8 0 k$ dataset. ", + "bbox": [ + 174, + 728, + 825, + 808 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "CIFAR10 We experimented with deep convolutional neural networks of 110-layers with residual blocks and residual connections comparing our model against ResNet and Stochastic depth. We adapted the hyperparameters of the Stochastic depth network from Huang et al. (2016a) and we used the same hyperparameters for our algorithm. We report the training and validation curves of the three models in Figure 10 and the best test accuracy obtained early stopping on validation accuracy over 500 epochs in Table 1. Our model achieves better generalization than ResNet. Stochastic depth achieves better generalization, but it might be possible to combine both and obtain better results. ", + "bbox": [ + 174, + 830, + 825, + 924 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/345e69a1318bab42ba15b8295abfbd900d2a22fb372d4cfae106a2e0cb0e9af6.jpg", + "image_caption": [ + "Figure 9: The training curve of a bidirectionalRNN that predicts the embedding corresponding to a sequence of characters. " + ], + "image_footnote": [], + "bbox": [ + 269, + 112, + 501, + 238 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/81d61387d971eff68d8d3252462d7ec7a797292fc2c55e49e9d151dea12ae429.jpg", + "table_caption": [ + "Table 2: 3-layered LSTM network on word-level language modeling for PTB. " + ], + "table_footnote": [], + "table_body": "
Test PPL
LSTM119.4
Mollified LSTM115.7
", + "bbox": [ + 566, + 185, + 758, + 241 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "9 LSTM EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 174, + 316, + 387, + 333 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Predicting the Character Embeddings from Characters Learning the mapping from sequences of characters to the word-embeddings is a difficult problem. Thus one needs to use a highly non-linear function. We trained a word2vec model on Wikipedia with embeddings of size 500 (Mikolov et al., 2014) with a vocabulary of size 374557. ", + "bbox": [ + 174, + 348, + 825, + 401 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "LSTM Language Modeling We evaluate our model on LSTM language modeling. Our baseline model is a 3-layer stacked LSTM without any regularization. We observed that mollified model converges faster and achieves better results. We provide the results for PTB language modeling in Table 2. ", + "bbox": [ + 174, + 416, + 823, + 457 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "10 CONCLUSION ", + "text_level": 1, + "bbox": [ + 178, + 477, + 330, + 492 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We propose a novel method for training neural networks inspired by an idea of continuation, smoothing techniques and recent advances in non-convex optimization algorithms. The method makes learning easier by starting from a simpler model, solving a well-behaved problem, and gradually transitioning to a more complicated setting. We show improvements on very deep models, difficult to optimize tasks and compare with powerful techniques such as batch-normalization and residual connections. We also show that the mollification procedure improves the generalization performance of the model on two tasks. ", + "bbox": [ + 174, + 507, + 825, + 601 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Our future work includes testing this method on large-scale language tasks that require long training time, e.g., machine translation and language modeling. Moreover, (Kaiser & Sutskever, 2015) observed that the training of Neural-GPU model can be improved significantly by using gradient noise which can be related to the smoothing of the loss surface, it would be interesting to try mollification on this model to see if the training of Neural GPU can be made easier by using mollification procedure. ", + "bbox": [ + 174, + 607, + 825, + 674 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "ACKNOWLEDGEMENTS ", + "text_level": 1, + "bbox": [ + 176, + 695, + 367, + 710 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We thank Nicholas Ballas and Misha Denil for the valuable discussions and their feedback. We would like to also thank the developers of Theano 4, for developing such a powerful tool for scientific computing Theano Development Team (2016). We acknowledge the support of the following organizations for research funding and computing support: NSERC, Samsung, Calcul Québec, Compute Canada, the Canada Research Chairs and CIFAR. ", + "bbox": [ + 174, + 724, + 825, + 791 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 174, + 813, + 285, + 827 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "E. L. Allgower and K. Georg. Numerical Continuation Methods. An Introduction. Springer-Verlag, 1980. ", + "bbox": [ + 176, + 835, + 823, + 863 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. Neural machine translation by jointly learning to align and translate. arXiv preprint arXiv:1409.0473, 2014. ", + "bbox": [ + 178, + 871, + 821, + 900 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Samy Bengio, Oriol Vinyals, Navdeep Jaitly, and Noam Shazeer. Scheduled sampling for sequence prediction with recurrent neural networks. In Advances in Neural Information Processing Systems, pp. 1171–1179, 2015. ", + "bbox": [ + 174, + 103, + 825, + 145 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Yoshua Bengio, Jérôme Louradour, Ronan Collobert, and Jason Weston. Curriculum learning. In Proceedings of the 26th annual international conference on machine learning, pp. 41–48. ACM, 2009. ", + "bbox": [ + 173, + 152, + 825, + 181 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Léon Bottou. Online algorithms and stochastic approximations. In David Saad (ed.), Online Learning in Neural Networks. Cambridge University Press, Cambridge, UK, 1998. ", + "bbox": [ + 173, + 189, + 823, + 218 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Kyunghyun Cho, Bart Van Merriënboer, Caglar Gulcehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk, and Yoshua Bengio. Learning phrase representations using rnn encoder-decoder for statistical machine translation. arXiv preprint arXiv:1406.1078, 2014. ", + "bbox": [ + 174, + 226, + 823, + 267 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Anna Choromanska, Mikael Henaff, Michael Mathieu, Gérard Ben Arous, and Yann LeCun. The loss surface of multilayer networks, 2014. ", + "bbox": [ + 173, + 275, + 823, + 303 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Yann Dauphin, Razvan Pascanu, Caglar Gulcehre, Kyunghyun Cho, Surya Ganguli, and Yoshua Bengio. Identifying and attacking the saddle point problem in high-dimensional non-convex optimization. In NIPS’2014, 2014. ", + "bbox": [ + 176, + 311, + 823, + 352 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Lawrence C Evans. Partial differential equations. Graduate Studies in Mathematics, 19:251–258, 1998. ", + "bbox": [ + 173, + 359, + 823, + 388 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Xavier Glorot, Antoine Bordes, and Yoshua Bengio. Deep sparse rectifier neural networks. In AISTATS, pp. 315–323, 2011. ", + "bbox": [ + 174, + 397, + 823, + 425 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Alex Graves. Practical variational inference for neural networks. In Advances in Neural Information Processing Systems, pp. 2348–2356, 2011. ", + "bbox": [ + 173, + 433, + 823, + 462 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Alex Graves. Adaptive computation time for recurrent neural networks. arXiv preprint arXiv:1603.08983, 2016. ", + "bbox": [ + 173, + 469, + 825, + 498 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Çaglar Gülçehre and Yoshua Bengio. Knowledge matters: Importance of prior information for ˘ optimization. arXiv preprint arXiv:1301.4083, 2013. ", + "bbox": [ + 173, + 506, + 823, + 535 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Caglar Gulcehre, Kyunghyun Cho, Razvan Pascanu, and Yoshua Bengio. Learned-norm pooling for deep feedforward and recurrent neural networks. In Machine Learning and Knowledge Discovery in Databases, pp. 530–546. Springer, 2014. ", + "bbox": [ + 174, + 542, + 825, + 584 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Caglar Gulcehre, Marcin Moczulski, Misha Denil, and Yoshua Bengio. Noisy activation functions. 2016. ", + "bbox": [ + 173, + 592, + 823, + 621 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Elad Hazan, Kfir Y Levy, and Shai Shalev-Shwartz. On graduated optimization for stochastic non-convex problems. arXiv preprint arXiv:1503.03712, 2015. ", + "bbox": [ + 173, + 628, + 823, + 656 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. arXiv preprint arXiv:1512.03385, 2015. ", + "bbox": [ + 173, + 665, + 823, + 693 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Geoffrey Hinton, Li Deng, Dong Yu, George Dahl, Abdel rahman Mohamed, Navdeep Jaitly, Andrew Senior, Vincent Vanhoucke, Patrick Nguyen, Tara Sainath, and Brian Kingsbury. Deep neural networks for acoustic modeling in speech recognition. Signal Processing Magazine, 2012. ", + "bbox": [ + 176, + 700, + 825, + 742 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Geoffrey E Hinton and Drew van Camp. Keeping neural networks simple. In ICANN’93, pp. 11–18. Springer, 1993. ", + "bbox": [ + 174, + 751, + 823, + 779 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "S. Hochreiter and J. Schmidhuber. Long short-term memory. Neural Computation, 9(8):1735–1780, 1997a. ", + "bbox": [ + 174, + 786, + 825, + 815 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Sepp Hochreiter and Jürgen Schmidhuber. Flat minima. Neural Computation, 9(1):1–42, 1997b. ", + "bbox": [ + 173, + 823, + 805, + 838 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Gao Huang, Yu Sun, Zhuang Liu, Daniel Sedra, and Kilian Weinberger. Deep networks with stochastic depth. arXiv preprint arXiv:1603.09382, 2016a. ", + "bbox": [ + 173, + 847, + 820, + 875 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Gao Huang, Yu Sun, Zhuang Liu, Daniel Sedra, and Kilian Q. Weinberger. Deep networks with stochastic depth. CoRR, abs/1603.09382, 2016b. URL http: //arxiv.org/abs/1603.09382. ", + "bbox": [ + 174, + 883, + 826, + 924 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by reducing internal covariate shift. CoRR, abs/1502.03167, 2015. URL http://arxiv.org/abs/1502.03167. ", + "bbox": [ + 176, + 103, + 821, + 145 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Łukasz Kaiser and Ilya Sutskever. Neural gpus learn algorithms. arXiv preprint arXiv:1511.08228, 2015. ", + "bbox": [ + 171, + 154, + 825, + 183 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Nal Kalchbrenner, Ivo Danihelka, and Alex Graves. Grid long short-term memory. arXiv preprint arXiv:1507.01526, 2015. ", + "bbox": [ + 174, + 190, + 823, + 218 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Diederik Kingma and Jimmy Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980, 2014. ", + "bbox": [ + 173, + 227, + 823, + 256 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "S. Kirkpatrick, C. D. Gelatt Jr., , and M. P. Vecchi. Optimization by simulated annealing. 220: 671–680, 1983. ", + "bbox": [ + 171, + 263, + 825, + 292 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Y. LeCun, B. Boser, J. S. Denker, D. Henderson, R. E. Howard, W. Hubbard, and L. D. Jackel. Backpropagation applied to handwritten zip code recognition. Neural Comput., 1 (4):541–551, December 1989. ISSN 0899-7667. doi: 10.1162/neco.1989.1.4.541. URL http://dx.doi.org/10.1162/neco.1989.1.4.541. ", + "bbox": [ + 174, + 301, + 826, + 356 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Yann LeCun and Corinna Cortes. The mnist database of handwritten digits, 1998. ", + "bbox": [ + 174, + 363, + 709, + 378 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. word2vec, 2014. ", + "bbox": [ + 173, + 387, + 683, + 402 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Alex Graves, Ioannis Antonoglou, and Daan Wierstra. Playing atari with deep reinforcement learning. Technical report, arXiv:1312.5602, 2013. ", + "bbox": [ + 176, + 411, + 828, + 439 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Hossein Mobahi. Training recurrent neural networks by diffusion. arXiv preprint arXiv:1601.04114, 2016. ", + "bbox": [ + 173, + 448, + 825, + 477 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Vinod Nair and Geoffrey E Hinton. Rectified linear units improve restricted boltzmann machines. In Proceedings of the 27th International Conference on Machine Learning (ICML-10), pp. 807–814, 2010. ", + "bbox": [ + 176, + 484, + 823, + 526 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Arvind Neelakantan, Luke Vilnis, Quoc V. Le, Ilya Sutskever, Lukasz Kaiser, Karol Kurach, and James Martens. Adding gradient noise improves learning for very deep networks. CoRR, abs/1511.06807, 2015a. URL http://arxiv.org/abs/1511.06807. ", + "bbox": [ + 174, + 535, + 826, + 577 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Arvind Neelakantan, Luke Vilnis, Quoc V Le, Ilya Sutskever, Lukasz Kaiser, Karol Kurach, and James Martens. Adding gradient noise improves learning for very deep networks. arXiv preprint arXiv:1511.06807, 2015b. ", + "bbox": [ + 174, + 585, + 823, + 626 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Andrew Y Ng. Shaping and policy search in reinforcement learning. PhD thesis, University of California, Berkeley, 2003. ", + "bbox": [ + 176, + 635, + 823, + 664 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Andrew Y Ng, Daishi Harada, and Stuart Russell. Policy invariance under reward transformations: Theory and application to reward shaping. In ICML, volume 99, pp. 278–287, 1999. ", + "bbox": [ + 174, + 671, + 823, + 700 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "David Silver, Aja Huang, Chris J Maddison, Arthur Guez, Laurent Sifre, George Van Den Driessche, Julian Schrittwieser, Ioannis Antonoglou, Veda Panneershelvam, Marc Lanctot, et al. Mastering the game of go with deep neural networks and tree search. Nature, 529(7587):484–489, 2016. ", + "bbox": [ + 174, + 708, + 825, + 751 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Leslie N Smith, Emily M Hand, and Timothy Doster. Gradual dropin of layers to train very deep neural networks. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4763–4771, 2016. ", + "bbox": [ + 174, + 758, + 823, + 800 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Rupesh K Srivastava, Klaus Greff, and Jürgen Schmidhuber. Training very deep networks. In Advances in Neural Information Processing Systems, pp. 2368–2376, 2015. ", + "bbox": [ + 173, + 809, + 823, + 838 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Ilya Sutskever, Oriol Vinyals, and Quoc V Le. Sequence to sequence learning with neural networks. In Advances in neural information processing systems, pp. 3104–3112, 2014. ", + "bbox": [ + 173, + 845, + 823, + 875 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Christian Szegedy, Wei Liu, Yangqing Jia, Pierre Sermanet, Scott Reed, Dragomir Anguelov, Dumitru Erhan, Vincent Vanhoucke, and Andrew Rabinovich. Going deeper with convolutions. Technical report, Google, 2014. ", + "bbox": [ + 176, + 883, + 825, + 924 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Theano Development Team. Theano: A Python framework for fast computation of mathematical expressions. arXiv e-prints, abs/1605.02688, May 2016. URL http://arxiv.org/abs/1605.02688. ", + "bbox": [ + 174, + 103, + 823, + 145 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Francesco Visin, Kyle Kastner, Aaron Courville, Yoshua Bengio, Matteo Matteucci, and Kyunghyun Cho. Reseg: A recurrent neural network for object segmentation. arXiv preprint arXiv:1511.07053, 2015. ", + "bbox": [ + 178, + 151, + 825, + 193 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Wojciech Zaremba and Ilya Sutskever. Learning to execute. arXiv preprint arXiv:1410.4615, 2014. ", + "bbox": [ + 173, + 199, + 823, + 215 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Appendix ", + "text_level": 1, + "bbox": [ + 174, + 219, + 272, + 241 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "A MONTE-CARLO ESTIMATE OF MOLLIFICATION ", + "text_level": 1, + "bbox": [ + 174, + 256, + 601, + 275 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "${ \\mathcal L } _ { K } ( \\pmb \\theta ) = ( { \\mathcal L } * K ) ( \\pmb \\theta ) = \\int _ { C } { \\mathcal L } ( \\pmb \\theta - \\xi ) K ( \\xi ) d \\xi$ which can be estimated by a Monte Carlo: $\\approx \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\xi } ^ { ( i ) } )$ , where $\\xi ^ { ( i ) }$ is a realization of the noise random variable $\\xi$ yielding $\\frac { \\partial \\mathcal { L } _ { K } ( { \\pmb \\theta } ) } { \\partial { \\pmb \\theta } }$ $\\approx \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\frac { \\partial \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\xi } ^ { ( i ) } ) } { \\partial \\pmb { \\theta } } .$ ", + "bbox": [ + 183, + 284, + 787, + 438 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Therefore introducing additive noise to the input of $\\mathcal { L } ( \\pmb \\theta )$ is equivalent to mollification. ", + "bbox": [ + 173, + 438, + 740, + 454 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "B DERIVATION OF THE NOISY ACTIVATIONS FOR THE GATING ", + "text_level": 1, + "bbox": [ + 176, + 470, + 707, + 488 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Assume that $z _ { t } ^ { l } = x _ { t } ^ { l } + p _ { t } ^ { l } \\sigma ( x ) | \\xi _ { t } ^ { l } |$ and $\\mathrm { E } _ { \\xi } [ \\psi ( x _ { t } ^ { l } , \\xi ) ] = t$ . Thus for all $z _ { t } ^ { l }$ , ", + "bbox": [ + 174, + 500, + 647, + 518 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/d81ce7f88b317f357b179064e036e23d39769074b19dcdf04d265f8ac162a209.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathrm { E } _ { \\xi } [ \\psi ( x _ { t } ^ { l } , \\xi _ { t } ^ { l } ) ] = \\mathrm { E } _ { \\xi } [ \\mathrm { f } ( z _ { t } ^ { l } ) ] , } \\\\ & { \\qquad t = \\mathrm { E } _ { \\xi } [ \\mathrm { f } ( z _ { t } ^ { l } ) ] , \\ \\mathrm { a s s u m i n g ~ f ( \\cdot ) ~ b e h a v e s ~ s i m i l a r ~ t o ~ a ~ l i n e a r ~ f u n c t i o n } ; } \\\\ & { \\qquad \\mathrm { E } _ { \\xi } [ \\mathrm { f } ( z _ { t } ^ { l } ) ] \\approx \\mathrm { f } ( \\mathrm { E } _ { \\xi } [ z _ { t } ^ { l } ] ) \\ \\mathrm { s i n c e ~ w e ~ u s e ~ h a r d - s i g m o i d ~ f o r ~ f ( \\cdot ) ~ t h i s ~ w i l l ~ h o l d } . } \\\\ & { \\qquad \\mathrm { f } ^ { - 1 } ( t ) \\approx \\mathrm { E } _ { \\xi } [ z _ { t } ^ { l } ] } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 245, + 536, + 750, + 621 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "As in Eqn. 32, we can write the expectation of this equation as: ", + "bbox": [ + 173, + 645, + 589, + 660 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/bb4a7988b50191817819d708c72a878138289811bede4001d28e39ac2021dcb5.jpg", + "text": "$$\n\\mathrm { f } ^ { - 1 } ( t ) \\approx x _ { t } ^ { l } + p _ { t } ^ { l } \\sigma ( x ) \\mathrm { E } _ { \\xi } [ \\xi _ { t } ^ { l } ]\n$$", + "text_format": "latex", + "bbox": [ + 401, + 662, + 593, + 681 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Corollary, the value that $\\sigma ( x _ { t } ^ { l } )$ should take in expectation for $p _ { t } ^ { l } = 1$ would be: ", + "bbox": [ + 173, + 685, + 687, + 702 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/37f119cb5fff172401ae59c1cff8fb44f26310a702a76c6ba7c93fe86200e4a2.jpg", + "text": "$$\n\\sigma ( x _ { t } ^ { l } ) \\approx \\frac { \\mathrm { f } ^ { - 1 } ( t ) - x _ { t } ^ { l } } { \\mathrm { E } _ { \\xi } [ \\xi _ { t } ^ { l } ] }\n$$", + "text_format": "latex", + "bbox": [ + 428, + 704, + 570, + 741 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In our experiments for $\\operatorname { f } ( \\cdot )$ we used the hard-sigmoid activation function. We used the following piecewise activation function in order to use it as $\\mathrm { f } ^ { - 1 } ( x ) = 4 ( x - 0 . 5 )$ . During inference we use the expected value of random variables $\\pi$ and $\\xi$ . ", + "bbox": [ + 174, + 752, + 826, + 796 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "C EXPERIMENTAL DETAILS ", + "text_level": 1, + "bbox": [ + 176, + 814, + 419, + 830 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "C.1 MNIST ", + "text_level": 1, + "bbox": [ + 174, + 843, + 272, + 859 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The weights of the models are initialized with Glorot & Bengio initialization Glorot et al. (2011). We use the learning rate of $4 e - 4$ along with RMSProp. We initialize $a _ { i }$ parameters of mollified activation function by sampling it from a uniform distribution, $\\mathrm { { U } [ - 2 , 2 ] }$ . We used 100 hidden units at each layer with a minibatches of size 500. ", + "bbox": [ + 174, + 869, + 825, + 924 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "C.2 PENTOMINO ", + "text_level": 1, + "bbox": [ + 174, + 103, + 303, + 117 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We train a 6−layer MLP with sigmoid activation function using SGD and momentum. We used 200 units per layer with sigmoid activation functions. We use a learning rate of $1 e - 3$ . ", + "bbox": [ + 174, + 128, + 823, + 156 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "C.3 CIFAR10 ", + "text_level": 1, + "bbox": [ + 174, + 172, + 287, + 186 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We use the same model with the same hyperparameters for both ResNet, mollified network and the stochastic depth. We borrowed the hyperparameters of the model from Huang et al. (2016a). Our mollified convnet model has residual connections coming from its layer below. ", + "bbox": [ + 174, + 198, + 826, + 239 + ], + "page_idx": 14 + }, + { + "type": "image", + "img_path": "images/8dbf86661abcd350698fec3b04fd3a0769dbc7ba6ca3d6a790e7f74289b8e903.jpg", + "image_caption": [ + "Figure 10: Training and validation losses over 500 epochs of a mollified convolutional network composed by 110-layers. We compare against ResNet and Stochastic depth. " + ], + "image_footnote": [], + "bbox": [ + 230, + 261, + 766, + 407 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "C.4 PARITY ", + "text_level": 1, + "bbox": [ + 174, + 472, + 269, + 486 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "The n-dimensional parity task is the task to figure out whether the sum of n-bits in a binary vector is even or odd. We use SGD with Nesterov momentum and initialize the weight matrices by using Glorot&Bengio initializationGlorot et al. (2011). For all models, we use the learning rate of $1 e - 3$ and momentum of 0.92. $a _ { i }$ is the parameters of mollified activation function are initialized by sampling from uniform distribution, $\\mathsf { \\bar { U } } [ - 2 , 2 ]$ . ", + "bbox": [ + 174, + 497, + 825, + 565 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "C.5 LSTM LANGUAGE MODELING ", + "text_level": 1, + "bbox": [ + 176, + 580, + 429, + 594 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We trained 2-layered LSTM language models on PTB word-level. We used the models with the same hyperparameters as in Zaremba & Sutskever (2014). We used the same hyperparameters for both the mollified LSTM language model and the LSTM. We use hard-sigmoid activation function for both the LSTM and mollified LSTM language model. We use hard-sigmoid activation function for the gates of the LSTM. ", + "bbox": [ + 174, + 606, + 825, + 672 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "C.6 PREDICTING THE CHARACTER EMBEDDINGS FROM CHARACTERS ", + "text_level": 1, + "bbox": [ + 176, + 689, + 671, + 704 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We use $1 0 k$ of these words as a validation and another $1 0 k$ word embeddings as test set. We train a bidirectional-LSTM on top of each sequence of characters for each word and on top of the representation of bidirectional LSTM, we use a 5-layered tanh-MLP to predict the word-embedding. ", + "bbox": [ + 176, + 714, + 823, + 755 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We train our models using RMSProp and momentum with learning rate of $6 e - 4$ and momentum 0.92. The size of the minibatches, we used is 64. As seen in Figure 9, mollified LSTM network converges faster. ", + "bbox": [ + 174, + 762, + 825, + 803 + ], + "page_idx": 14 + } +] \ No newline at end of file diff --git a/parse/train/r1G4z8cge/r1G4z8cge_middle.json b/parse/train/r1G4z8cge/r1G4z8cge_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..75f3d4d039d514c847e2d8a8a8b973b20cefb1bb --- /dev/null +++ b/parse/train/r1G4z8cge/r1G4z8cge_middle.json @@ -0,0 +1,42075 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 79, + 295, + 96 + ], + "lines": [ + { + "bbox": [ + 104, + 77, + 297, + 98 + ], + "spans": [ + { + "bbox": [ + 104, + 77, + 297, + 98 + ], + "score": 1.0, + "content": "MOLLIFYING NETWORKS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 113, + 114, + 441, + 137 + ], + "lines": [ + { + "bbox": [ + 114, + 113, + 443, + 128 + ], + "spans": [ + { + "bbox": [ + 114, + 113, + 443, + 128 + ], + "score": 1.0, + "content": "Caglar Gulcehre1, Marcin Moczulski2,∗, Francesco Visin3,∗ Yoshua Bengio1", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 111, + 125, + 408, + 139 + ], + "spans": [ + { + "bbox": [ + 111, + 125, + 408, + 139 + ], + "score": 1.0, + "content": "1 University of Montreal, 2 University of Oxford, 3 Politecnico di Milano", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5 + }, + { + "type": "title", + "bbox": [ + 278, + 166, + 333, + 178 + ], + "lines": [ + { + "bbox": [ + 276, + 165, + 335, + 179 + ], + "spans": [ + { + "bbox": [ + 276, + 165, + 335, + 179 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 143, + 190, + 469, + 336 + ], + "lines": [ + { + "bbox": [ + 142, + 191, + 469, + 202 + ], + "spans": [ + { + "bbox": [ + 142, + 191, + 469, + 202 + ], + "score": 1.0, + "content": "The optimization of deep neural networks can be more challenging than the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 141, + 200, + 469, + 213 + ], + "spans": [ + { + "bbox": [ + 141, + 200, + 469, + 213 + ], + "score": 1.0, + "content": "traditional convex optimization problems due to highly non-convex nature of the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 210, + 470, + 224 + ], + "spans": [ + { + "bbox": [ + 141, + 210, + 470, + 224 + ], + "score": 1.0, + "content": "loss function, e.g. it can involve pathological landscapes such as saddle-surfaces", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 221, + 470, + 234 + ], + "spans": [ + { + "bbox": [ + 141, + 221, + 470, + 234 + ], + "score": 1.0, + "content": "that can be difficult to escape from for algorithms based on simple gradient descent.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 231, + 470, + 245 + ], + "spans": [ + { + "bbox": [ + 141, + 231, + 470, + 245 + ], + "score": 1.0, + "content": "In this paper, we attack the problem of optimization of highly non-convex neural", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 243, + 469, + 254 + ], + "spans": [ + { + "bbox": [ + 141, + 243, + 469, + 254 + ], + "score": 1.0, + "content": "networks objectives by starting with a smoothed – or mollified – objective function", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 253, + 470, + 265 + ], + "spans": [ + { + "bbox": [ + 141, + 253, + 470, + 265 + ], + "score": 1.0, + "content": "which becomes more complex as the training proceeds. Our proposition is inspired", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 264, + 470, + 276 + ], + "spans": [ + { + "bbox": [ + 141, + 264, + 470, + 276 + ], + "score": 1.0, + "content": "by the recent studies in continuation methods: similarly to curriculum methods,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 274, + 470, + 286 + ], + "spans": [ + { + "bbox": [ + 141, + 274, + 470, + 286 + ], + "score": 1.0, + "content": "we begin by learning an easier (possibly convex) objective function and let it", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 285, + 470, + 297 + ], + "spans": [ + { + "bbox": [ + 141, + 285, + 470, + 297 + ], + "score": 1.0, + "content": "evolve during training until it eventually becomes the original, difficult to optimize", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 294, + 470, + 307 + ], + "spans": [ + { + "bbox": [ + 141, + 294, + 470, + 307 + ], + "score": 1.0, + "content": "objective function. The complexity of the mollified networks is controlled by a", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 304, + 470, + 317 + ], + "spans": [ + { + "bbox": [ + 141, + 304, + 470, + 317 + ], + "score": 1.0, + "content": "single hyperparameter that is annealed during training. We show improvements", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 315, + 470, + 327 + ], + "spans": [ + { + "bbox": [ + 141, + 315, + 470, + 327 + ], + "score": 1.0, + "content": "on various difficult optimization tasks and establish a relationship between recent", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 326, + 410, + 338 + ], + "spans": [ + { + "bbox": [ + 141, + 326, + 410, + 338 + ], + "score": 1.0, + "content": "works on continuation methods for neural networks and mollifiers.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 10.5 + }, + { + "type": "title", + "bbox": [ + 108, + 372, + 206, + 384 + ], + "lines": [ + { + "bbox": [ + 105, + 371, + 208, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 208, + 388 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 393, + 505, + 457 + ], + "lines": [ + { + "bbox": [ + 105, + 393, + 506, + 406 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 506, + 406 + ], + "score": 1.0, + "content": "In the last few years, deep neural networks – i.e. convolutional networks (LeCun et al., 1989),", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 403, + 506, + 416 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 506, + 416 + ], + "score": 1.0, + "content": "LSTMs (Hochreiter & Schmidhuber, 1997a) or GRUs (Cho et al., 2014) – set the state of the art on", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 104, + 414, + 507, + 427 + ], + "spans": [ + { + "bbox": [ + 104, + 414, + 507, + 427 + ], + "score": 1.0, + "content": "a range of challenging tasks (Szegedy et al., 2014; Visin et al., 2015; Hinton et al., 2012; Sutskever", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 425, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 505, + 437 + ], + "score": 1.0, + "content": "et al., 2014; Bahdanau et al., 2014; Mnih et al., 2013; Silver et al., 2016). However when trained", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 434, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 505, + 448 + ], + "score": 1.0, + "content": "with variants of SGD (Bottou, 1998) deep networks can be difficult to optimize due to their highly", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 446, + 443, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 443, + 458 + ], + "score": 1.0, + "content": "non-linear and non-convex nature (Choromanska et al., 2014; Dauphin et al., 2014).", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 107, + 462, + 505, + 567 + ], + "lines": [ + { + "bbox": [ + 105, + 461, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 505, + 475 + ], + "score": 1.0, + "content": "A number of approaches were proposed to alleviate the difficulty of optimization: addressing", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 471, + 506, + 486 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 506, + 486 + ], + "score": 1.0, + "content": "the problem of the internal covariate shift with Batch Normalization (Ioffe & Szegedy, 2015),", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 482, + 506, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 506, + 496 + ], + "score": 1.0, + "content": "learning with a curriculum (Bengio et al., 2009), recently an approach to train RNNs with diffusion", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 493, + 506, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 493, + 506, + 506 + ], + "score": 1.0, + "content": "process (Mobahi, 2016), and graduated optimization (Hazan et al., 2015). The impact of noise", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 504, + 507, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 507, + 516 + ], + "score": 1.0, + "content": "injection on the behavior of modern deep learning methods has been explored by Neelakantan et al.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 514, + 506, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 506, + 527 + ], + "score": 1.0, + "content": "(2015a). Hazan et al. (2015) have shown that injecting a particular noise and scheduling it carefully,", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 524, + 506, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 239, + 538 + ], + "score": 1.0, + "content": "can guarantee the convergence in", + "type": "text" + }, + { + "bbox": [ + 239, + 524, + 284, + 537 + ], + "score": 0.93, + "content": "O ( 1 / \\sigma ^ { 2 } \\epsilon ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 524, + 322, + 538 + ], + "score": 1.0, + "content": "steps for", + "type": "text" + }, + { + "bbox": [ + 322, + 527, + 327, + 534 + ], + "score": 0.68, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 524, + 378, + 538 + ], + "score": 1.0, + "content": "-optimal and", + "type": "text" + }, + { + "bbox": [ + 378, + 526, + 385, + 534 + ], + "score": 0.79, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 524, + 506, + 538 + ], + "score": 1.0, + "content": "-nice functions. Similar to our", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 536, + 504, + 547 + ], + "spans": [ + { + "bbox": [ + 106, + 536, + 504, + 547 + ], + "score": 1.0, + "content": "work graduated optimization optimizes a smoothed objective function without performing expensive", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 546, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 505, + 558 + ], + "score": 1.0, + "content": "convolutions. Injecting noise to the activation functions and scheduling it have been recently shown", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 556, + 419, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 419, + 569 + ], + "score": 1.0, + "content": "to improve the performance on a wide variety of tasks (Gulcehre et al., 2016).", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 107, + 572, + 505, + 635 + ], + "lines": [ + { + "bbox": [ + 106, + 572, + 505, + 584 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 584 + ], + "score": 1.0, + "content": "We connect the ideas of curriculum learning and continuation methods with those arising from", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "models with skip connections and using layers that compute near-identity transformations. Skip", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 593, + 506, + 605 + ], + "spans": [ + { + "bbox": [ + 105, + 593, + 506, + 605 + ], + "score": 1.0, + "content": "connections allow to train very deep residual and highway architectures (He et al., 2015; Srivastava", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 604, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 616 + ], + "score": 1.0, + "content": "et al., 2015) by skipping layers or block of layers. Similarly, it has been shown that stochastically", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 614, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 505, + 627 + ], + "score": 1.0, + "content": "changing the depth of a network during training (Huang et al., 2016b) does not prevent convergence", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 624, + 296, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 296, + 637 + ], + "score": 1.0, + "content": "and enables better generalization performance.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 107, + 640, + 505, + 714 + ], + "lines": [ + { + "bbox": [ + 105, + 640, + 506, + 653 + ], + "spans": [ + { + "bbox": [ + 105, + 640, + 506, + 653 + ], + "score": 1.0, + "content": "We discuss the idea of mollification for neural networks – a form of differentiable smoothing of", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 651, + 506, + 663 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 506, + 663 + ], + "score": 1.0, + "content": "the loss function connected to noisy activations – which in our case can be interpreted as a form", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 662, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 662, + 506, + 673 + ], + "score": 1.0, + "content": "of adaptive noise injection which is controlled by a single hyperparameter. Inspired by Huang et al.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 672, + 506, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 672, + 506, + 684 + ], + "score": 1.0, + "content": "(2016b), we use a hyperparameter to stochastically control the depth of our network. This allows", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 682, + 506, + 695 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 506, + 695 + ], + "score": 1.0, + "content": "us to start the optimization from a convex objective function (as long as the optimized criterion is", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 104, + 693, + 506, + 705 + ], + "spans": [ + { + "bbox": [ + 104, + 693, + 506, + 705 + ], + "score": 1.0, + "content": "convex, e.g. linear or logistic regression) and to slowly introduce more complexity into the model", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 704, + 486, + 716 + ], + "spans": [ + { + "bbox": [ + 105, + 704, + 486, + 716 + ], + "score": 1.0, + "content": "by annealing the hyperparameter, thus making the network deeper and increasingly non-linear.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 120, + 721, + 487, + 731 + ], + "lines": [ + { + "bbox": [ + 122, + 719, + 488, + 734 + ], + "spans": [ + { + "bbox": [ + 122, + 719, + 488, + 734 + ], + "score": 1.0, + "content": "∗ This work was done while these students were interning at the MILA lab in University of Montreal.", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "1", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 79, + 295, + 96 + ], + "lines": [ + { + "bbox": [ + 104, + 77, + 297, + 98 + ], + "spans": [ + { + "bbox": [ + 104, + 77, + 297, + 98 + ], + "score": 1.0, + "content": "MOLLIFYING NETWORKS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 113, + 114, + 441, + 137 + ], + "lines": [ + { + "bbox": [ + 114, + 113, + 443, + 128 + ], + "spans": [ + { + "bbox": [ + 114, + 113, + 443, + 128 + ], + "score": 1.0, + "content": "Caglar Gulcehre1, Marcin Moczulski2,∗, Francesco Visin3,∗ Yoshua Bengio1", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 111, + 125, + 408, + 139 + ], + "spans": [ + { + "bbox": [ + 111, + 125, + 408, + 139 + ], + "score": 1.0, + "content": "1 University of Montreal, 2 University of Oxford, 3 Politecnico di Milano", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5, + "bbox_fs": [ + 111, + 113, + 443, + 139 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 166, + 333, + 178 + ], + "lines": [ + { + "bbox": [ + 276, + 165, + 335, + 179 + ], + "spans": [ + { + "bbox": [ + 276, + 165, + 335, + 179 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 143, + 190, + 469, + 336 + ], + "lines": [ + { + "bbox": [ + 142, + 191, + 469, + 202 + ], + "spans": [ + { + "bbox": [ + 142, + 191, + 469, + 202 + ], + "score": 1.0, + "content": "The optimization of deep neural networks can be more challenging than the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 141, + 200, + 469, + 213 + ], + "spans": [ + { + "bbox": [ + 141, + 200, + 469, + 213 + ], + "score": 1.0, + "content": "traditional convex optimization problems due to highly non-convex nature of the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 210, + 470, + 224 + ], + "spans": [ + { + "bbox": [ + 141, + 210, + 470, + 224 + ], + "score": 1.0, + "content": "loss function, e.g. it can involve pathological landscapes such as saddle-surfaces", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 221, + 470, + 234 + ], + "spans": [ + { + "bbox": [ + 141, + 221, + 470, + 234 + ], + "score": 1.0, + "content": "that can be difficult to escape from for algorithms based on simple gradient descent.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 231, + 470, + 245 + ], + "spans": [ + { + "bbox": [ + 141, + 231, + 470, + 245 + ], + "score": 1.0, + "content": "In this paper, we attack the problem of optimization of highly non-convex neural", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 243, + 469, + 254 + ], + "spans": [ + { + "bbox": [ + 141, + 243, + 469, + 254 + ], + "score": 1.0, + "content": "networks objectives by starting with a smoothed – or mollified – objective function", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 253, + 470, + 265 + ], + "spans": [ + { + "bbox": [ + 141, + 253, + 470, + 265 + ], + "score": 1.0, + "content": "which becomes more complex as the training proceeds. Our proposition is inspired", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 264, + 470, + 276 + ], + "spans": [ + { + "bbox": [ + 141, + 264, + 470, + 276 + ], + "score": 1.0, + "content": "by the recent studies in continuation methods: similarly to curriculum methods,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 274, + 470, + 286 + ], + "spans": [ + { + "bbox": [ + 141, + 274, + 470, + 286 + ], + "score": 1.0, + "content": "we begin by learning an easier (possibly convex) objective function and let it", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 285, + 470, + 297 + ], + "spans": [ + { + "bbox": [ + 141, + 285, + 470, + 297 + ], + "score": 1.0, + "content": "evolve during training until it eventually becomes the original, difficult to optimize", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 294, + 470, + 307 + ], + "spans": [ + { + "bbox": [ + 141, + 294, + 470, + 307 + ], + "score": 1.0, + "content": "objective function. The complexity of the mollified networks is controlled by a", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 304, + 470, + 317 + ], + "spans": [ + { + "bbox": [ + 141, + 304, + 470, + 317 + ], + "score": 1.0, + "content": "single hyperparameter that is annealed during training. We show improvements", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 315, + 470, + 327 + ], + "spans": [ + { + "bbox": [ + 141, + 315, + 470, + 327 + ], + "score": 1.0, + "content": "on various difficult optimization tasks and establish a relationship between recent", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 326, + 410, + 338 + ], + "spans": [ + { + "bbox": [ + 141, + 326, + 410, + 338 + ], + "score": 1.0, + "content": "works on continuation methods for neural networks and mollifiers.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 10.5, + "bbox_fs": [ + 141, + 191, + 470, + 338 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 372, + 206, + 384 + ], + "lines": [ + { + "bbox": [ + 105, + 371, + 208, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 208, + 388 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 393, + 505, + 457 + ], + "lines": [ + { + "bbox": [ + 105, + 393, + 506, + 406 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 506, + 406 + ], + "score": 1.0, + "content": "In the last few years, deep neural networks – i.e. convolutional networks (LeCun et al., 1989),", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 403, + 506, + 416 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 506, + 416 + ], + "score": 1.0, + "content": "LSTMs (Hochreiter & Schmidhuber, 1997a) or GRUs (Cho et al., 2014) – set the state of the art on", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 104, + 414, + 507, + 427 + ], + "spans": [ + { + "bbox": [ + 104, + 414, + 507, + 427 + ], + "score": 1.0, + "content": "a range of challenging tasks (Szegedy et al., 2014; Visin et al., 2015; Hinton et al., 2012; Sutskever", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 425, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 505, + 437 + ], + "score": 1.0, + "content": "et al., 2014; Bahdanau et al., 2014; Mnih et al., 2013; Silver et al., 2016). However when trained", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 434, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 505, + 448 + ], + "score": 1.0, + "content": "with variants of SGD (Bottou, 1998) deep networks can be difficult to optimize due to their highly", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 446, + 443, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 443, + 458 + ], + "score": 1.0, + "content": "non-linear and non-convex nature (Choromanska et al., 2014; Dauphin et al., 2014).", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21.5, + "bbox_fs": [ + 104, + 393, + 507, + 458 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 462, + 505, + 567 + ], + "lines": [ + { + "bbox": [ + 105, + 461, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 505, + 475 + ], + "score": 1.0, + "content": "A number of approaches were proposed to alleviate the difficulty of optimization: addressing", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 471, + 506, + 486 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 506, + 486 + ], + "score": 1.0, + "content": "the problem of the internal covariate shift with Batch Normalization (Ioffe & Szegedy, 2015),", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 482, + 506, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 506, + 496 + ], + "score": 1.0, + "content": "learning with a curriculum (Bengio et al., 2009), recently an approach to train RNNs with diffusion", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 493, + 506, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 493, + 506, + 506 + ], + "score": 1.0, + "content": "process (Mobahi, 2016), and graduated optimization (Hazan et al., 2015). The impact of noise", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 504, + 507, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 507, + 516 + ], + "score": 1.0, + "content": "injection on the behavior of modern deep learning methods has been explored by Neelakantan et al.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 514, + 506, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 506, + 527 + ], + "score": 1.0, + "content": "(2015a). Hazan et al. (2015) have shown that injecting a particular noise and scheduling it carefully,", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 524, + 506, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 239, + 538 + ], + "score": 1.0, + "content": "can guarantee the convergence in", + "type": "text" + }, + { + "bbox": [ + 239, + 524, + 284, + 537 + ], + "score": 0.93, + "content": "O ( 1 / \\sigma ^ { 2 } \\epsilon ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 524, + 322, + 538 + ], + "score": 1.0, + "content": "steps for", + "type": "text" + }, + { + "bbox": [ + 322, + 527, + 327, + 534 + ], + "score": 0.68, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 524, + 378, + 538 + ], + "score": 1.0, + "content": "-optimal and", + "type": "text" + }, + { + "bbox": [ + 378, + 526, + 385, + 534 + ], + "score": 0.79, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 524, + 506, + 538 + ], + "score": 1.0, + "content": "-nice functions. Similar to our", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 536, + 504, + 547 + ], + "spans": [ + { + "bbox": [ + 106, + 536, + 504, + 547 + ], + "score": 1.0, + "content": "work graduated optimization optimizes a smoothed objective function without performing expensive", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 546, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 505, + 558 + ], + "score": 1.0, + "content": "convolutions. Injecting noise to the activation functions and scheduling it have been recently shown", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 556, + 419, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 419, + 569 + ], + "score": 1.0, + "content": "to improve the performance on a wide variety of tasks (Gulcehre et al., 2016).", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 29.5, + "bbox_fs": [ + 105, + 461, + 507, + 569 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 572, + 505, + 635 + ], + "lines": [ + { + "bbox": [ + 106, + 572, + 505, + 584 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 584 + ], + "score": 1.0, + "content": "We connect the ideas of curriculum learning and continuation methods with those arising from", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "models with skip connections and using layers that compute near-identity transformations. Skip", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 593, + 506, + 605 + ], + "spans": [ + { + "bbox": [ + 105, + 593, + 506, + 605 + ], + "score": 1.0, + "content": "connections allow to train very deep residual and highway architectures (He et al., 2015; Srivastava", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 604, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 616 + ], + "score": 1.0, + "content": "et al., 2015) by skipping layers or block of layers. Similarly, it has been shown that stochastically", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 614, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 505, + 627 + ], + "score": 1.0, + "content": "changing the depth of a network during training (Huang et al., 2016b) does not prevent convergence", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 624, + 296, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 296, + 637 + ], + "score": 1.0, + "content": "and enables better generalization performance.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 572, + 506, + 637 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 640, + 505, + 714 + ], + "lines": [ + { + "bbox": [ + 105, + 640, + 506, + 653 + ], + "spans": [ + { + "bbox": [ + 105, + 640, + 506, + 653 + ], + "score": 1.0, + "content": "We discuss the idea of mollification for neural networks – a form of differentiable smoothing of", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 651, + 506, + 663 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 506, + 663 + ], + "score": 1.0, + "content": "the loss function connected to noisy activations – which in our case can be interpreted as a form", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 662, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 662, + 506, + 673 + ], + "score": 1.0, + "content": "of adaptive noise injection which is controlled by a single hyperparameter. Inspired by Huang et al.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 672, + 506, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 672, + 506, + 684 + ], + "score": 1.0, + "content": "(2016b), we use a hyperparameter to stochastically control the depth of our network. This allows", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 682, + 506, + 695 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 506, + 695 + ], + "score": 1.0, + "content": "us to start the optimization from a convex objective function (as long as the optimized criterion is", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 104, + 693, + 506, + 705 + ], + "spans": [ + { + "bbox": [ + 104, + 693, + 506, + 705 + ], + "score": 1.0, + "content": "convex, e.g. linear or logistic regression) and to slowly introduce more complexity into the model", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 704, + 486, + 716 + ], + "spans": [ + { + "bbox": [ + 105, + 704, + 486, + 716 + ], + "score": 1.0, + "content": "by annealing the hyperparameter, thus making the network deeper and increasingly non-linear.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44, + "bbox_fs": [ + 104, + 640, + 506, + 716 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 235, + 74, + 376, + 162 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 235, + 74, + 376, + 162 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 235, + 74, + 376, + 162 + ], + "spans": [ + { + "bbox": [ + 235, + 74, + 376, + 162 + ], + "score": 0.951, + "type": "image", + "image_path": "a43e573759ef754c90bf6fbf3615df4808ea481cc1b4c0fe1226a5cfec94d678.jpg" + } + ] + } + ], + "index": 0.5, + "virtual_lines": [ + { + "bbox": [ + 235, + 74, + 376, + 118.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 235, + 118.0, + 376, + 162.0 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 170, + 506, + 213 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 170, + 506, + 184 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 506, + 184 + ], + "score": 1.0, + "content": "Figure 1: A sequence of optimization problems of increasing complexity, where the first ones are", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 180, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 505, + 194 + ], + "score": 1.0, + "content": "easy to solve but only the last one corresponds to the actual problem of interest. It is possible to", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 191, + 505, + 203 + ], + "spans": [ + { + "bbox": [ + 106, + 191, + 505, + 203 + ], + "score": 1.0, + "content": "tackle the problems in order, starting each time at the solution of the previous one and tracking the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 199, + 221, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 221, + 216 + ], + "score": 1.0, + "content": "local minima along the way.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5 + } + ], + "index": 2.0 + }, + { + "type": "text", + "bbox": [ + 106, + 234, + 505, + 288 + ], + "lines": [ + { + "bbox": [ + 106, + 235, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 235, + 505, + 246 + ], + "score": 1.0, + "content": "An important difference of our work compared to injecting noise to the gradients as it is explored in", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 245, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 505, + 257 + ], + "score": 1.0, + "content": "(Hazan et al., 2015; Neelakantan et al., 2015b) is that we inject the noise in the forward computation", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 255, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 106, + 255, + 506, + 268 + ], + "score": 1.0, + "content": "of the graph and we shape the cost function directly. As a result the cost function for the mollified", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 264, + 506, + 280 + ], + "spans": [ + { + "bbox": [ + 104, + 264, + 506, + 280 + ], + "score": 1.0, + "content": "network both at the test time and during the training are consistent and this makes the early-stopping", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 277, + 159, + 288 + ], + "spans": [ + { + "bbox": [ + 106, + 277, + 159, + 288 + ], + "score": 1.0, + "content": "much easier.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8 + }, + { + "type": "title", + "bbox": [ + 108, + 303, + 319, + 316 + ], + "lines": [ + { + "bbox": [ + 104, + 302, + 320, + 318 + ], + "spans": [ + { + "bbox": [ + 104, + 302, + 320, + 318 + ], + "score": 1.0, + "content": "2 MOLLIFYING OBJECTIVE FUNCTIONS", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "title", + "bbox": [ + 107, + 325, + 321, + 336 + ], + "lines": [ + { + "bbox": [ + 105, + 325, + 322, + 337 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 322, + 337 + ], + "score": 1.0, + "content": "2.1 CONTINUATION AND ANNEALING METHODS", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 337, + 505, + 380 + ], + "lines": [ + { + "bbox": [ + 106, + 336, + 506, + 350 + ], + "spans": [ + { + "bbox": [ + 106, + 336, + 506, + 350 + ], + "score": 1.0, + "content": "Continuation methods and simulated annealing provide a general strategy to reduce the impact of", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 347, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 505, + 360 + ], + "score": 1.0, + "content": "local minima and deal with non-convex, continuous, but not necessarily everywhere differentiable", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 357, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 505, + 371 + ], + "score": 1.0, + "content": "objective functions by smoothing the original objective function and gradually reducing the amount", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 368, + 383, + 381 + ], + "spans": [ + { + "bbox": [ + 106, + 368, + 383, + 381 + ], + "score": 1.0, + "content": "of smoothing during training (Allgower & Georg, 1980) (see Fig. 1).", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 107, + 384, + 505, + 417 + ], + "lines": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "score": 1.0, + "content": "In machine learning, approaches based on curriculum learning (Bengio et al., 2009) are inspired", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 394, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 505, + 409 + ], + "score": 1.0, + "content": "by this principle and define a sequence of gradually more difficult training tasks (or training", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 406, + 350, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 406, + 350, + 417 + ], + "score": 1.0, + "content": "distributions) that eventually converge to the task of interest.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 108, + 422, + 504, + 453 + ], + "lines": [ + { + "bbox": [ + 105, + 421, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 433 + ], + "score": 1.0, + "content": "In the context of stochastic gradient descent, we use a stochastic estimation of the gradient for", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 432, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 106, + 432, + 505, + 444 + ], + "score": 1.0, + "content": "the smoothed objective function. This is convenient because it may not be analytically feasible to", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 442, + 465, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 465, + 455 + ], + "score": 1.0, + "content": "compute the smoothed function, but a Monte-Carlo estimate can often be obtained easily.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 107, + 459, + 505, + 503 + ], + "lines": [ + { + "bbox": [ + 105, + 459, + 506, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 506, + 471 + ], + "score": 1.0, + "content": "In this paper we construct a sequence of smoothed objective functions obtained with a form of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 470, + 506, + 482 + ], + "spans": [ + { + "bbox": [ + 106, + 470, + 506, + 482 + ], + "score": 1.0, + "content": "mollification and we progressively optimize them. The training procedure iterates over the sequence", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 479, + 506, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 506, + 493 + ], + "score": 1.0, + "content": "of objective functions starting from the simpler ones – i.e. with a smoother loss surface – and moving", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 491, + 434, + 503 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 434, + 503 + ], + "score": 1.0, + "content": "towards more complex ones until the last, original, objective function is reached.1", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24.5 + }, + { + "type": "title", + "bbox": [ + 109, + 516, + 290, + 527 + ], + "lines": [ + { + "bbox": [ + 106, + 514, + 291, + 529 + ], + "spans": [ + { + "bbox": [ + 106, + 514, + 291, + 529 + ], + "score": 1.0, + "content": "2.2 MOLLIFIERS AND WEAK GRADIENTS", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 108, + 535, + 504, + 558 + ], + "lines": [ + { + "bbox": [ + 106, + 535, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 106, + 535, + 226, + 549 + ], + "score": 1.0, + "content": "We smooth the loss function", + "type": "text" + }, + { + "bbox": [ + 226, + 537, + 234, + 546 + ], + "score": 0.81, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 535, + 345, + 549 + ], + "score": 1.0, + "content": ", which is parametrized by", + "type": "text" + }, + { + "bbox": [ + 345, + 536, + 377, + 546 + ], + "score": 0.9, + "content": "\\boldsymbol \\theta \\in \\mathbb { R } ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 535, + 506, + 549 + ], + "score": 1.0, + "content": ", by convolving it with another", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 545, + 245, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 142, + 559 + ], + "score": 1.0, + "content": "function", + "type": "text" + }, + { + "bbox": [ + 142, + 547, + 163, + 559 + ], + "score": 0.91, + "content": "K ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 545, + 209, + 559 + ], + "score": 1.0, + "content": "with stride", + "type": "text" + }, + { + "bbox": [ + 209, + 547, + 240, + 557 + ], + "score": 0.91, + "content": "\\tau \\in \\mathbb { R } ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 545, + 245, + 559 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "interline_equation", + "bbox": [ + 203, + 563, + 408, + 592 + ], + "lines": [ + { + "bbox": [ + 203, + 563, + 408, + 592 + ], + "spans": [ + { + "bbox": [ + 203, + 563, + 408, + 592 + ], + "score": 0.93, + "content": "\\mathscr { L } _ { K } ( \\pmb { \\theta } ) = ( \\mathscr { L } * K ) ( \\pmb { \\theta } ) = \\int _ { - \\infty } ^ { + \\infty } \\mathscr { L } ( \\pmb { \\theta } - \\pmb { \\tau } ) K ( \\pmb { \\tau } ) d \\pmb { \\tau }", + "type": "interline_equation", + "image_path": "a9bac6416796a497b88c3e4ce6ee927d26156c0e77a5af446fc6899bdbcd59c5.jpg" + } + ] + } + ], + "index": 30.5, + "virtual_lines": [ + { + "bbox": [ + 203, + 563, + 408, + 577.5 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 203, + 577.5, + 408, + 592.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 604, + 504, + 626 + ], + "lines": [ + { + "bbox": [ + 105, + 604, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 305, + 617 + ], + "score": 1.0, + "content": "Although there are many choices for the function", + "type": "text" + }, + { + "bbox": [ + 305, + 604, + 325, + 616 + ], + "score": 0.91, + "content": "K ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 604, + 505, + 617 + ], + "score": 1.0, + "content": ", we focus on those that satisfy the definition", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 614, + 163, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 163, + 626 + ], + "score": 1.0, + "content": "of a mollifier.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 106, + 630, + 505, + 673 + ], + "lines": [ + { + "bbox": [ + 105, + 630, + 505, + 643 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 505, + 643 + ], + "score": 1.0, + "content": "A mollifier is an infinitely differentiable function that behaves like an approximate identity in the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 640, + 506, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 640, + 307, + 655 + ], + "score": 1.0, + "content": "group of convolutions of integrable functions. If", + "type": "text" + }, + { + "bbox": [ + 307, + 641, + 328, + 653 + ], + "score": 0.91, + "content": "K ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 640, + 506, + 655 + ], + "score": 1.0, + "content": "is an infinitely differentiable function, that", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 651, + 505, + 665 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 505, + 665 + ], + "score": 1.0, + "content": "converges to the Dirac delta function when appropriately rescaled and for any integrable function", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 662, + 202, + 675 + ], + "spans": [ + { + "bbox": [ + 107, + 663, + 114, + 672 + ], + "score": 0.7, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 662, + 202, + 675 + ], + "score": 1.0, + "content": ", then it is a mollifier:", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35.5 + }, + { + "type": "interline_equation", + "bbox": [ + 222, + 678, + 389, + 704 + ], + "lines": [ + { + "bbox": [ + 222, + 678, + 389, + 704 + ], + "spans": [ + { + "bbox": [ + 222, + 678, + 389, + 704 + ], + "score": 0.94, + "content": "\\mathcal { L } ( \\pmb \\theta ) = \\operatorname* { l i m } _ { \\epsilon 0 } \\int \\epsilon ^ { - n } K ( \\pmb \\tau / \\epsilon ) \\mathcal { L } ( \\pmb \\theta - \\pmb \\tau ) d \\pmb \\tau .", + "type": "interline_equation", + "image_path": "6d7039927a5655136929072640ca21c54c0698a5482845f0a56f0ac661aa3fd4.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 222, + 678, + 389, + 704 + ], + "spans": [], + "index": 38 + } + ] + } + ], + "page_idx": 1, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 763 + ], + "score": 1.0, + "content": "2", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 711, + 508, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 710, + 505, + 724 + ], + "spans": [ + { + "bbox": [ + 118, + 710, + 505, + 724 + ], + "score": 1.0, + "content": "1We plan to release the source code of the models and experiments under, http://github.com/", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 721, + 208, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 208, + 732 + ], + "score": 1.0, + "content": "caglar/molly_nets/.", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 235, + 74, + 376, + 162 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 235, + 74, + 376, + 162 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 235, + 74, + 376, + 162 + ], + "spans": [ + { + "bbox": [ + 235, + 74, + 376, + 162 + ], + "score": 0.951, + "type": "image", + "image_path": "a43e573759ef754c90bf6fbf3615df4808ea481cc1b4c0fe1226a5cfec94d678.jpg" + } + ] + } + ], + "index": 0.5, + "virtual_lines": [ + { + "bbox": [ + 235, + 74, + 376, + 118.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 235, + 118.0, + 376, + 162.0 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 170, + 506, + 213 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 170, + 506, + 184 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 506, + 184 + ], + "score": 1.0, + "content": "Figure 1: A sequence of optimization problems of increasing complexity, where the first ones are", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 180, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 505, + 194 + ], + "score": 1.0, + "content": "easy to solve but only the last one corresponds to the actual problem of interest. It is possible to", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 191, + 505, + 203 + ], + "spans": [ + { + "bbox": [ + 106, + 191, + 505, + 203 + ], + "score": 1.0, + "content": "tackle the problems in order, starting each time at the solution of the previous one and tracking the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 199, + 221, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 221, + 216 + ], + "score": 1.0, + "content": "local minima along the way.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5 + } + ], + "index": 2.0 + }, + { + "type": "text", + "bbox": [ + 106, + 234, + 505, + 288 + ], + "lines": [ + { + "bbox": [ + 106, + 235, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 235, + 505, + 246 + ], + "score": 1.0, + "content": "An important difference of our work compared to injecting noise to the gradients as it is explored in", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 245, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 505, + 257 + ], + "score": 1.0, + "content": "(Hazan et al., 2015; Neelakantan et al., 2015b) is that we inject the noise in the forward computation", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 255, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 106, + 255, + 506, + 268 + ], + "score": 1.0, + "content": "of the graph and we shape the cost function directly. As a result the cost function for the mollified", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 264, + 506, + 280 + ], + "spans": [ + { + "bbox": [ + 104, + 264, + 506, + 280 + ], + "score": 1.0, + "content": "network both at the test time and during the training are consistent and this makes the early-stopping", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 277, + 159, + 288 + ], + "spans": [ + { + "bbox": [ + 106, + 277, + 159, + 288 + ], + "score": 1.0, + "content": "much easier.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8, + "bbox_fs": [ + 104, + 235, + 506, + 288 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 303, + 319, + 316 + ], + "lines": [ + { + "bbox": [ + 104, + 302, + 320, + 318 + ], + "spans": [ + { + "bbox": [ + 104, + 302, + 320, + 318 + ], + "score": 1.0, + "content": "2 MOLLIFYING OBJECTIVE FUNCTIONS", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "title", + "bbox": [ + 107, + 325, + 321, + 336 + ], + "lines": [ + { + "bbox": [ + 105, + 325, + 322, + 337 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 322, + 337 + ], + "score": 1.0, + "content": "2.1 CONTINUATION AND ANNEALING METHODS", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 337, + 505, + 380 + ], + "lines": [ + { + "bbox": [ + 106, + 336, + 506, + 350 + ], + "spans": [ + { + "bbox": [ + 106, + 336, + 506, + 350 + ], + "score": 1.0, + "content": "Continuation methods and simulated annealing provide a general strategy to reduce the impact of", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 347, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 505, + 360 + ], + "score": 1.0, + "content": "local minima and deal with non-convex, continuous, but not necessarily everywhere differentiable", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 357, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 505, + 371 + ], + "score": 1.0, + "content": "objective functions by smoothing the original objective function and gradually reducing the amount", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 368, + 383, + 381 + ], + "spans": [ + { + "bbox": [ + 106, + 368, + 383, + 381 + ], + "score": 1.0, + "content": "of smoothing during training (Allgower & Georg, 1980) (see Fig. 1).", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 336, + 506, + 381 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 384, + 505, + 417 + ], + "lines": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "score": 1.0, + "content": "In machine learning, approaches based on curriculum learning (Bengio et al., 2009) are inspired", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 394, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 505, + 409 + ], + "score": 1.0, + "content": "by this principle and define a sequence of gradually more difficult training tasks (or training", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 406, + 350, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 406, + 350, + 417 + ], + "score": 1.0, + "content": "distributions) that eventually converge to the task of interest.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 384, + 505, + 417 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 422, + 504, + 453 + ], + "lines": [ + { + "bbox": [ + 105, + 421, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 433 + ], + "score": 1.0, + "content": "In the context of stochastic gradient descent, we use a stochastic estimation of the gradient for", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 432, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 106, + 432, + 505, + 444 + ], + "score": 1.0, + "content": "the smoothed objective function. This is convenient because it may not be analytically feasible to", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 442, + 465, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 465, + 455 + ], + "score": 1.0, + "content": "compute the smoothed function, but a Monte-Carlo estimate can often be obtained easily.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 421, + 505, + 455 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 459, + 505, + 503 + ], + "lines": [ + { + "bbox": [ + 105, + 459, + 506, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 506, + 471 + ], + "score": 1.0, + "content": "In this paper we construct a sequence of smoothed objective functions obtained with a form of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 470, + 506, + 482 + ], + "spans": [ + { + "bbox": [ + 106, + 470, + 506, + 482 + ], + "score": 1.0, + "content": "mollification and we progressively optimize them. The training procedure iterates over the sequence", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 479, + 506, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 506, + 493 + ], + "score": 1.0, + "content": "of objective functions starting from the simpler ones – i.e. with a smoother loss surface – and moving", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 491, + 434, + 503 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 434, + 503 + ], + "score": 1.0, + "content": "towards more complex ones until the last, original, objective function is reached.1", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 459, + 506, + 503 + ] + }, + { + "type": "title", + "bbox": [ + 109, + 516, + 290, + 527 + ], + "lines": [ + { + "bbox": [ + 106, + 514, + 291, + 529 + ], + "spans": [ + { + "bbox": [ + 106, + 514, + 291, + 529 + ], + "score": 1.0, + "content": "2.2 MOLLIFIERS AND WEAK GRADIENTS", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 108, + 535, + 504, + 558 + ], + "lines": [ + { + "bbox": [ + 106, + 535, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 106, + 535, + 226, + 549 + ], + "score": 1.0, + "content": "We smooth the loss function", + "type": "text" + }, + { + "bbox": [ + 226, + 537, + 234, + 546 + ], + "score": 0.81, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 535, + 345, + 549 + ], + "score": 1.0, + "content": ", which is parametrized by", + "type": "text" + }, + { + "bbox": [ + 345, + 536, + 377, + 546 + ], + "score": 0.9, + "content": "\\boldsymbol \\theta \\in \\mathbb { R } ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 535, + 506, + 549 + ], + "score": 1.0, + "content": ", by convolving it with another", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 545, + 245, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 142, + 559 + ], + "score": 1.0, + "content": "function", + "type": "text" + }, + { + "bbox": [ + 142, + 547, + 163, + 559 + ], + "score": 0.91, + "content": "K ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 545, + 209, + 559 + ], + "score": 1.0, + "content": "with stride", + "type": "text" + }, + { + "bbox": [ + 209, + 547, + 240, + 557 + ], + "score": 0.91, + "content": "\\tau \\in \\mathbb { R } ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 545, + 245, + 559 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 535, + 506, + 559 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 203, + 563, + 408, + 592 + ], + "lines": [ + { + "bbox": [ + 203, + 563, + 408, + 592 + ], + "spans": [ + { + "bbox": [ + 203, + 563, + 408, + 592 + ], + "score": 0.93, + "content": "\\mathscr { L } _ { K } ( \\pmb { \\theta } ) = ( \\mathscr { L } * K ) ( \\pmb { \\theta } ) = \\int _ { - \\infty } ^ { + \\infty } \\mathscr { L } ( \\pmb { \\theta } - \\pmb { \\tau } ) K ( \\pmb { \\tau } ) d \\pmb { \\tau }", + "type": "interline_equation", + "image_path": "a9bac6416796a497b88c3e4ce6ee927d26156c0e77a5af446fc6899bdbcd59c5.jpg" + } + ] + } + ], + "index": 30.5, + "virtual_lines": [ + { + "bbox": [ + 203, + 563, + 408, + 577.5 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 203, + 577.5, + 408, + 592.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 604, + 504, + 626 + ], + "lines": [ + { + "bbox": [ + 105, + 604, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 305, + 617 + ], + "score": 1.0, + "content": "Although there are many choices for the function", + "type": "text" + }, + { + "bbox": [ + 305, + 604, + 325, + 616 + ], + "score": 0.91, + "content": "K ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 604, + 505, + 617 + ], + "score": 1.0, + "content": ", we focus on those that satisfy the definition", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 614, + 163, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 163, + 626 + ], + "score": 1.0, + "content": "of a mollifier.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 604, + 505, + 626 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 630, + 505, + 673 + ], + "lines": [ + { + "bbox": [ + 105, + 630, + 505, + 643 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 505, + 643 + ], + "score": 1.0, + "content": "A mollifier is an infinitely differentiable function that behaves like an approximate identity in the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 640, + 506, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 640, + 307, + 655 + ], + "score": 1.0, + "content": "group of convolutions of integrable functions. If", + "type": "text" + }, + { + "bbox": [ + 307, + 641, + 328, + 653 + ], + "score": 0.91, + "content": "K ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 640, + 506, + 655 + ], + "score": 1.0, + "content": "is an infinitely differentiable function, that", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 651, + 505, + 665 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 505, + 665 + ], + "score": 1.0, + "content": "converges to the Dirac delta function when appropriately rescaled and for any integrable function", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 662, + 202, + 675 + ], + "spans": [ + { + "bbox": [ + 107, + 663, + 114, + 672 + ], + "score": 0.7, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 662, + 202, + 675 + ], + "score": 1.0, + "content": ", then it is a mollifier:", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 630, + 506, + 675 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 222, + 678, + 389, + 704 + ], + "lines": [ + { + "bbox": [ + 222, + 678, + 389, + 704 + ], + "spans": [ + { + "bbox": [ + 222, + 678, + 389, + 704 + ], + "score": 0.94, + "content": "\\mathcal { L } ( \\pmb \\theta ) = \\operatorname* { l i m } _ { \\epsilon 0 } \\int \\epsilon ^ { - n } K ( \\pmb \\tau / \\epsilon ) \\mathcal { L } ( \\pmb \\theta - \\pmb \\tau ) d \\pmb \\tau .", + "type": "interline_equation", + "image_path": "6d7039927a5655136929072640ca21c54c0698a5482845f0a56f0ac661aa3fd4.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 222, + 678, + 389, + 704 + ], + "spans": [], + "index": 38 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 104 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 160, + 96 + ], + "score": 1.0, + "content": "If we choose", + "type": "text" + }, + { + "bbox": [ + 161, + 83, + 181, + 95 + ], + "score": 0.91, + "content": "K ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 81, + 405, + 96 + ], + "score": 1.0, + "content": "to be a mollifier and obtain the smoothed loss function", + "type": "text" + }, + { + "bbox": [ + 405, + 83, + 420, + 93 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { K }", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "as in Eqn. 1, we can", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 92, + 419, + 105 + ], + "spans": [ + { + "bbox": [ + 106, + 92, + 234, + 105 + ], + "score": 1.0, + "content": "take its gradient with respect to", + "type": "text" + }, + { + "bbox": [ + 234, + 93, + 241, + 103 + ], + "score": 0.78, + "content": "\\pmb \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 92, + 419, + 105 + ], + "score": 1.0, + "content": "using directly the result from Evans (1998):", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 108, + 400, + 122 + ], + "lines": [ + { + "bbox": [ + 210, + 108, + 400, + 122 + ], + "spans": [ + { + "bbox": [ + 210, + 108, + 400, + 122 + ], + "score": 0.9, + "content": "\\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { K } ( \\pmb { \\theta } ) = \\nabla _ { \\pmb { \\theta } } ( \\mathcal { L } \\ast K ) ( \\pmb { \\theta } ) = ( \\mathcal { L } \\ast \\nabla K ) ( \\pmb { \\theta } ) .", + "type": "interline_equation", + "image_path": "9ca4455527ad8e48cb0dc887449843656638ce5fa51a93e426c6b1d342cc6429.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 210, + 108, + 400, + 122 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 131, + 505, + 164 + ], + "lines": [ + { + "bbox": [ + 106, + 131, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 106, + 131, + 234, + 144 + ], + "score": 1.0, + "content": "To relate the resulting gradient", + "type": "text" + }, + { + "bbox": [ + 234, + 132, + 263, + 142 + ], + "score": 0.92, + "content": "\\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { K }", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 131, + 423, + 144 + ], + "score": 1.0, + "content": "to the gradient of the original function", + "type": "text" + }, + { + "bbox": [ + 423, + 132, + 430, + 141 + ], + "score": 0.8, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 131, + 505, + 144 + ], + "score": 1.0, + "content": ", we introduce the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 142, + 505, + 154 + ], + "spans": [ + { + "bbox": [ + 106, + 142, + 505, + 154 + ], + "score": 1.0, + "content": "notion of weak gradient, i.e. an extension to the idea of weak/distributional derivatives to functions", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 153, + 414, + 164 + ], + "spans": [ + { + "bbox": [ + 106, + 153, + 414, + 164 + ], + "score": 1.0, + "content": "with multidimensional arguments, such as loss functions of neural networks.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 107, + 168, + 504, + 191 + ], + "lines": [ + { + "bbox": [ + 105, + 168, + 506, + 182 + ], + "spans": [ + { + "bbox": [ + 105, + 168, + 218, + 182 + ], + "score": 1.0, + "content": "For an integrable function", + "type": "text" + }, + { + "bbox": [ + 219, + 169, + 227, + 179 + ], + "score": 0.82, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 168, + 267, + 182 + ], + "score": 1.0, + "content": "in space", + "type": "text" + }, + { + "bbox": [ + 267, + 168, + 325, + 181 + ], + "score": 0.87, + "content": "{ \\mathcal { L } } \\in L ( [ a , b ] )", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 168, + 330, + 182 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 330, + 168, + 392, + 181 + ], + "score": 0.91, + "content": "{ \\mathrm { ~ ~ g ~ } } \\in \\ L ( [ a , b ] ^ { n } )", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 168, + 413, + 182 + ], + "score": 1.0, + "content": "is a", + "type": "text" + }, + { + "bbox": [ + 413, + 171, + 420, + 179 + ], + "score": 0.68, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 168, + 506, + 182 + ], + "score": 1.0, + "content": "-dimensional weak", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 180, + 215, + 191 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 153, + 191 + ], + "score": 1.0, + "content": "gradient of", + "type": "text" + }, + { + "bbox": [ + 153, + 180, + 160, + 189 + ], + "score": 0.84, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 180, + 215, + 191 + ], + "score": 1.0, + "content": "if it satisfies:", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "interline_equation", + "bbox": [ + 217, + 194, + 392, + 221 + ], + "lines": [ + { + "bbox": [ + 217, + 194, + 392, + 221 + ], + "spans": [ + { + "bbox": [ + 217, + 194, + 392, + 221 + ], + "score": 0.94, + "content": "\\int _ { C } \\mathbf { g } ( \\pmb { \\tau } ) K ( \\pmb { \\tau } ) d \\pmb { \\tau } = - \\int _ { C } \\mathcal { L } ( \\pmb { \\tau } ) \\nabla K ( \\pmb { \\tau } ) d \\pmb { \\tau } ,", + "type": "interline_equation", + "image_path": "60622f586baee3bc3539334cca7165100f6f0a5a632d956822958f2467eb800f.jpg" + } + ] + } + ], + "index": 8.5, + "virtual_lines": [ + { + "bbox": [ + 217, + 194, + 392, + 207.5 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 217, + 207.5, + 392, + 221.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 225, + 492, + 237 + ], + "lines": [ + { + "bbox": [ + 105, + 223, + 490, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 133, + 239 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 225, + 157, + 237 + ], + "score": 0.92, + "content": "K ( \\tau )", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 223, + 394, + 239 + ], + "score": 1.0, + "content": "is an infinitely differentiable function vanishing at infinity,", + "type": "text" + }, + { + "bbox": [ + 394, + 225, + 440, + 237 + ], + "score": 0.93, + "content": "C \\in [ a , b ] ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 223, + 458, + 239 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 458, + 226, + 490, + 236 + ], + "score": 0.9, + "content": "\\tau \\in \\mathbb { R } ^ { n }", + "type": "inline_equation" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 104, + 242, + 504, + 265 + ], + "lines": [ + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 198, + 255 + ], + "score": 1.0, + "content": "As long as the chosen", + "type": "text" + }, + { + "bbox": [ + 199, + 243, + 219, + 255 + ], + "score": 0.92, + "content": "K ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 242, + 479, + 255 + ], + "score": 1.0, + "content": "fulfills the definition of a mollifier we can use Eqn. 3 and Eqn.", + "type": "text" + }, + { + "bbox": [ + 480, + 242, + 493, + 253 + ], + "score": 0.62, + "content": "4 ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 242, + 505, + 255 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 253, + 200, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 200, + 266 + ], + "score": 1.0, + "content": "rewrite the gradient as:", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "interline_equation", + "bbox": [ + 199, + 267, + 412, + 338 + ], + "lines": [ + { + "bbox": [ + 199, + 267, + 412, + 338 + ], + "spans": [ + { + "bbox": [ + 199, + 267, + 412, + 338 + ], + "score": 0.93, + "content": "\\begin{array} { r l r } { \\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { K } ( \\pmb { \\theta } ) = ( \\mathcal { L } \\ast \\nabla K ) ( \\pmb { \\theta } ) } & { } & { \\mathrm { b y ~ E q n . ~ 3 } } \\\\ { = \\displaystyle \\int _ { C } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\tau } ^ { } ) \\nabla K ( \\pmb { \\tau } ^ { } ) d \\pmb { \\tau } } \\\\ { = - \\displaystyle \\int _ { C } \\mathbf { g } ( \\pmb { \\theta } - \\pmb { \\tau } ^ { } ) K ( \\pmb { \\tau } ^ { } ) d \\pmb { \\tau } } & { } & { \\mathrm { b y ~ E q n . ~ 4 } } \\end{array}", + "type": "interline_equation", + "image_path": "ab966a70938a27a555b09f8f8bdc7ab717ee5da9253431febc7067405c41d1be.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 199, + 267, + 412, + 281.2 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 199, + 281.2, + 412, + 295.4 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 199, + 295.4, + 412, + 309.59999999999997 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 199, + 309.59999999999997, + 412, + 323.79999999999995 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 199, + 323.79999999999995, + 412, + 337.99999999999994 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 346, + 504, + 369 + ], + "lines": [ + { + "bbox": [ + 106, + 345, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 106, + 345, + 301, + 359 + ], + "score": 1.0, + "content": "For a differentiable almost everywhere function", + "type": "text" + }, + { + "bbox": [ + 302, + 347, + 309, + 357 + ], + "score": 0.82, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 345, + 387, + 359 + ], + "score": 1.0, + "content": ", the weak gradient", + "type": "text" + }, + { + "bbox": [ + 388, + 347, + 407, + 359 + ], + "score": 0.92, + "content": "g ( \\pmb \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 345, + 453, + 359 + ], + "score": 1.0, + "content": "is equal to", + "type": "text" + }, + { + "bbox": [ + 453, + 347, + 474, + 358 + ], + "score": 0.91, + "content": "\\nabla _ { \\boldsymbol { \\theta } } \\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 345, + 505, + 359 + ], + "score": 1.0, + "content": "almost", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 357, + 377, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 377, + 369 + ], + "score": 1.0, + "content": "everywhere. With a slight abuse of notation we can therefore write:", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "interline_equation", + "bbox": [ + 221, + 372, + 390, + 399 + ], + "lines": [ + { + "bbox": [ + 221, + 372, + 390, + 399 + ], + "spans": [ + { + "bbox": [ + 221, + 372, + 390, + 399 + ], + "score": 0.95, + "content": "\\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { K } ( \\pmb { \\theta } ) = - \\int _ { C } \\nabla _ { \\pmb { \\theta } } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\tau } ) K ( \\pmb { \\tau } ) d \\pmb { \\tau }", + "type": "interline_equation", + "image_path": "a9fdad77f9115695511a104d62d70da3586873f3308dc87bdb1dad68e4b4a2bd.jpg" + } + ] + } + ], + "index": 20.5, + "virtual_lines": [ + { + "bbox": [ + 221, + 372, + 390, + 385.5 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 221, + 385.5, + 390, + 399.0 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "title", + "bbox": [ + 107, + 410, + 233, + 421 + ], + "lines": [ + { + "bbox": [ + 105, + 409, + 234, + 423 + ], + "spans": [ + { + "bbox": [ + 105, + 409, + 234, + 423 + ], + "score": 1.0, + "content": "2.3 GAUSSIAN MOLLIFIERS", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 106, + 429, + 505, + 473 + ], + "lines": [ + { + "bbox": [ + 106, + 430, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 430, + 331, + 442 + ], + "score": 1.0, + "content": "It is possible to use the standard Gaussian distribution", + "type": "text" + }, + { + "bbox": [ + 331, + 430, + 366, + 442 + ], + "score": 0.92, + "content": "\\mathcal { N } ( 0 , \\bf { I } )", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 430, + 425, + 442 + ], + "score": 1.0, + "content": "as a mollifier", + "type": "text" + }, + { + "bbox": [ + 425, + 430, + 446, + 442 + ], + "score": 0.91, + "content": "K ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 430, + 505, + 442 + ], + "score": 1.0, + "content": ", as it satisfies", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 441, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 505, + 453 + ], + "score": 1.0, + "content": "the desired properties: it is infinitely differentiable, a sequence of properly rescaled Gaussian", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 450, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 468, + 464 + ], + "score": 1.0, + "content": "distributions converges to the Dirac delta function and it vanishes in infinity. With such a", + "type": "text" + }, + { + "bbox": [ + 468, + 451, + 489, + 463 + ], + "score": 0.91, + "content": "K ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 450, + 505, + 464 + ], + "score": 1.0, + "content": "the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 462, + 182, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 182, + 474 + ], + "score": 1.0, + "content": "gradient becomes:", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24.5 + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 477, + 419, + 519 + ], + "lines": [ + { + "bbox": [ + 192, + 477, + 419, + 519 + ], + "spans": [ + { + "bbox": [ + 192, + 477, + 419, + 519 + ], + "score": 0.93, + "content": "\\begin{array} { r l } { { \\nabla _ { \\theta } \\mathcal { L } _ { K = \\mathcal { N } } ( \\theta ) = - \\int _ { C } \\nabla _ { \\theta } \\mathcal { L } ( \\theta - \\tau ) p ( \\tau ) d \\tau } } \\\\ & { = \\mathrm { E } _ { \\tau } [ \\nabla _ { \\theta } \\mathcal { L } ( \\theta - \\tau ) ] , \\mathrm { w i t h } \\ \\tau \\sim \\mathcal { N } ( 0 , \\ \\mathbf { I } ) } \\end{array}", + "type": "interline_equation", + "image_path": "7aaf714baa513747c6fed1e6280acc13bffa5969bbaf78a60cbd51521a64a804.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 192, + 477, + 419, + 491.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 192, + 491.0, + 419, + 505.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 192, + 505.0, + 419, + 519.0 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 527, + 506, + 559 + ], + "lines": [ + { + "bbox": [ + 106, + 527, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 106, + 527, + 506, + 540 + ], + "score": 1.0, + "content": "Exploiting the fact that a Gaussian distribution is a mollifier, we can focus on a sequence of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 538, + 505, + 550 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 279, + 550 + ], + "score": 1.0, + "content": "mollifications indexed by scaling parameter", + "type": "text" + }, + { + "bbox": [ + 280, + 540, + 285, + 547 + ], + "score": 0.76, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 538, + 505, + 550 + ], + "score": 1.0, + "content": "introduced in Eqn. 2. A single element of this sequence", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 548, + 210, + 560 + ], + "spans": [ + { + "bbox": [ + 106, + 548, + 210, + 560 + ], + "score": 1.0, + "content": "takes the following form:", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 563, + 419, + 606 + ], + "lines": [ + { + "bbox": [ + 192, + 563, + 419, + 606 + ], + "spans": [ + { + "bbox": [ + 192, + 563, + 419, + 606 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\nabla _ { \\boldsymbol { \\theta } } \\mathcal { L } _ { \\mathcal { N } , \\epsilon } ( \\boldsymbol { \\theta } ) = - \\displaystyle \\int _ { C } \\nabla _ { \\boldsymbol { \\theta } } \\mathcal { L } ( \\boldsymbol { \\theta } - \\boldsymbol { \\tau } ) \\epsilon ^ { - 1 } p ( \\boldsymbol { \\tau } / \\epsilon ) d \\boldsymbol { \\tau } } \\\\ & { ~ = \\mathrm { E } _ { \\boldsymbol { \\tau } } [ \\nabla _ { \\boldsymbol { \\theta } } \\mathcal { L } ( \\boldsymbol { \\theta } - \\boldsymbol { \\tau } ) ] , \\mathrm { w i t h } \\boldsymbol { \\tau } \\sim \\mathcal { N } ( 0 , \\epsilon ^ { 2 } \\mathbf { I } ) } \\end{array}", + "type": "interline_equation", + "image_path": "9950b1b7bd20ac0fef703f794670413e1bf914a9c4f70040e2a7c0c3b5d68505.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 192, + 563, + 419, + 577.3333333333334 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 192, + 577.3333333333334, + 419, + 591.6666666666667 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 192, + 591.6666666666667, + 419, + 606.0000000000001 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 614, + 381, + 626 + ], + "lines": [ + { + "bbox": [ + 105, + 612, + 378, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 149, + 629 + ], + "score": 1.0, + "content": "Replacing", + "type": "text" + }, + { + "bbox": [ + 150, + 617, + 155, + 624 + ], + "score": 0.73, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 612, + 176, + 629 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 176, + 617, + 183, + 624 + ], + "score": 0.79, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 612, + 371, + 629 + ], + "score": 1.0, + "content": "yields a sequence of mollifications indexed by", + "type": "text" + }, + { + "bbox": [ + 371, + 617, + 378, + 624 + ], + "score": 0.8, + "content": "\\sigma", + "type": "inline_equation" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "interline_equation", + "bbox": [ + 190, + 631, + 421, + 645 + ], + "lines": [ + { + "bbox": [ + 190, + 631, + 421, + 645 + ], + "spans": [ + { + "bbox": [ + 190, + 631, + 421, + 645 + ], + "score": 0.84, + "content": "\\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { \\mathcal { N } , \\sigma } ( \\pmb { \\theta } ) = \\mathrm { E } _ { \\pmb { \\tau } } [ \\nabla _ { \\pmb { \\theta } } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\tau } ) ] , \\mathrm { w i t h } \\ \\pmb { \\tau } \\sim \\mathcal { N } ( 0 , \\ \\sigma ^ { 2 } \\mathbf { I } )", + "type": "interline_equation", + "image_path": "37289e4b45dbdcb9cec31211bf54eada6503f4e6bfe11e4317f5fd524dee448a.jpg" + } + ] + } + ], + "index": 37, + "virtual_lines": [ + { + "bbox": [ + 190, + 631, + 421, + 645 + ], + "spans": [], + "index": 37 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 648, + 268, + 660 + ], + "lines": [ + { + "bbox": [ + 105, + 646, + 269, + 663 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 269, + 663 + ], + "score": 1.0, + "content": "with the following property (by Eqn. 2):", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 38 + }, + { + "type": "interline_equation", + "bbox": [ + 246, + 663, + 365, + 682 + ], + "lines": [ + { + "bbox": [ + 246, + 663, + 365, + 682 + ], + "spans": [ + { + "bbox": [ + 246, + 663, + 365, + 682 + ], + "score": 0.91, + "content": "\\operatorname* { l i m } _ { \\sigma \\to 0 } \\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { \\mathcal { N } , \\sigma } ( \\pmb { \\theta } ) = \\nabla _ { \\pmb { \\theta } } \\mathcal { L } ( \\pmb { \\theta } )", + "type": "interline_equation", + "image_path": "3c7449568d79bb87b5729d188e6055dd46b393c8ef4407f517bed765d80d48c3.jpg" + } + ] + } + ], + "index": 39, + "virtual_lines": [ + { + "bbox": [ + 246, + 663, + 365, + 682 + ], + "spans": [], + "index": 39 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 691, + 505, + 714 + ], + "lines": [ + { + "bbox": [ + 105, + 690, + 506, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 690, + 293, + 705 + ], + "score": 1.0, + "content": "An intuitive interpretation of the result is that", + "type": "text" + }, + { + "bbox": [ + 293, + 694, + 301, + 702 + ], + "score": 0.8, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 690, + 506, + 705 + ], + "score": 1.0, + "content": "determines the standard deviation of a mollifying", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 701, + 505, + 714 + ], + "spans": [ + { + "bbox": [ + 106, + 701, + 505, + 714 + ], + "score": 1.0, + "content": "Gaussian and is annealed in order to construct a sequence of gradually less \"blurred\" and closer", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5 + } + ], + "page_idx": 2, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 118, + 721, + 429, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 719, + 428, + 734 + ], + "spans": [ + { + "bbox": [ + 118, + 719, + 428, + 734 + ], + "score": 1.0, + "content": "2We omit for brevity the algebraic details involved with a translation of the argument.", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 104 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 160, + 96 + ], + "score": 1.0, + "content": "If we choose", + "type": "text" + }, + { + "bbox": [ + 161, + 83, + 181, + 95 + ], + "score": 0.91, + "content": "K ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 81, + 405, + 96 + ], + "score": 1.0, + "content": "to be a mollifier and obtain the smoothed loss function", + "type": "text" + }, + { + "bbox": [ + 405, + 83, + 420, + 93 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { K }", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "as in Eqn. 1, we can", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 92, + 419, + 105 + ], + "spans": [ + { + "bbox": [ + 106, + 92, + 234, + 105 + ], + "score": 1.0, + "content": "take its gradient with respect to", + "type": "text" + }, + { + "bbox": [ + 234, + 93, + 241, + 103 + ], + "score": 0.78, + "content": "\\pmb \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 92, + 419, + 105 + ], + "score": 1.0, + "content": "using directly the result from Evans (1998):", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 505, + 105 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 108, + 400, + 122 + ], + "lines": [ + { + "bbox": [ + 210, + 108, + 400, + 122 + ], + "spans": [ + { + "bbox": [ + 210, + 108, + 400, + 122 + ], + "score": 0.9, + "content": "\\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { K } ( \\pmb { \\theta } ) = \\nabla _ { \\pmb { \\theta } } ( \\mathcal { L } \\ast K ) ( \\pmb { \\theta } ) = ( \\mathcal { L } \\ast \\nabla K ) ( \\pmb { \\theta } ) .", + "type": "interline_equation", + "image_path": "9ca4455527ad8e48cb0dc887449843656638ce5fa51a93e426c6b1d342cc6429.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 210, + 108, + 400, + 122 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 131, + 505, + 164 + ], + "lines": [ + { + "bbox": [ + 106, + 131, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 106, + 131, + 234, + 144 + ], + "score": 1.0, + "content": "To relate the resulting gradient", + "type": "text" + }, + { + "bbox": [ + 234, + 132, + 263, + 142 + ], + "score": 0.92, + "content": "\\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { K }", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 131, + 423, + 144 + ], + "score": 1.0, + "content": "to the gradient of the original function", + "type": "text" + }, + { + "bbox": [ + 423, + 132, + 430, + 141 + ], + "score": 0.8, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 131, + 505, + 144 + ], + "score": 1.0, + "content": ", we introduce the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 142, + 505, + 154 + ], + "spans": [ + { + "bbox": [ + 106, + 142, + 505, + 154 + ], + "score": 1.0, + "content": "notion of weak gradient, i.e. an extension to the idea of weak/distributional derivatives to functions", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 153, + 414, + 164 + ], + "spans": [ + { + "bbox": [ + 106, + 153, + 414, + 164 + ], + "score": 1.0, + "content": "with multidimensional arguments, such as loss functions of neural networks.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4, + "bbox_fs": [ + 106, + 131, + 505, + 164 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 168, + 504, + 191 + ], + "lines": [ + { + "bbox": [ + 105, + 168, + 506, + 182 + ], + "spans": [ + { + "bbox": [ + 105, + 168, + 218, + 182 + ], + "score": 1.0, + "content": "For an integrable function", + "type": "text" + }, + { + "bbox": [ + 219, + 169, + 227, + 179 + ], + "score": 0.82, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 168, + 267, + 182 + ], + "score": 1.0, + "content": "in space", + "type": "text" + }, + { + "bbox": [ + 267, + 168, + 325, + 181 + ], + "score": 0.87, + "content": "{ \\mathcal { L } } \\in L ( [ a , b ] )", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 168, + 330, + 182 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 330, + 168, + 392, + 181 + ], + "score": 0.91, + "content": "{ \\mathrm { ~ ~ g ~ } } \\in \\ L ( [ a , b ] ^ { n } )", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 168, + 413, + 182 + ], + "score": 1.0, + "content": "is a", + "type": "text" + }, + { + "bbox": [ + 413, + 171, + 420, + 179 + ], + "score": 0.68, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 168, + 506, + 182 + ], + "score": 1.0, + "content": "-dimensional weak", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 180, + 215, + 191 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 153, + 191 + ], + "score": 1.0, + "content": "gradient of", + "type": "text" + }, + { + "bbox": [ + 153, + 180, + 160, + 189 + ], + "score": 0.84, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 180, + 215, + 191 + ], + "score": 1.0, + "content": "if it satisfies:", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 105, + 168, + 506, + 191 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 217, + 194, + 392, + 221 + ], + "lines": [ + { + "bbox": [ + 217, + 194, + 392, + 221 + ], + "spans": [ + { + "bbox": [ + 217, + 194, + 392, + 221 + ], + "score": 0.94, + "content": "\\int _ { C } \\mathbf { g } ( \\pmb { \\tau } ) K ( \\pmb { \\tau } ) d \\pmb { \\tau } = - \\int _ { C } \\mathcal { L } ( \\pmb { \\tau } ) \\nabla K ( \\pmb { \\tau } ) d \\pmb { \\tau } ,", + "type": "interline_equation", + "image_path": "60622f586baee3bc3539334cca7165100f6f0a5a632d956822958f2467eb800f.jpg" + } + ] + } + ], + "index": 8.5, + "virtual_lines": [ + { + "bbox": [ + 217, + 194, + 392, + 207.5 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 217, + 207.5, + 392, + 221.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 225, + 492, + 237 + ], + "lines": [ + { + "bbox": [ + 105, + 223, + 490, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 133, + 239 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 225, + 157, + 237 + ], + "score": 0.92, + "content": "K ( \\tau )", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 223, + 394, + 239 + ], + "score": 1.0, + "content": "is an infinitely differentiable function vanishing at infinity,", + "type": "text" + }, + { + "bbox": [ + 394, + 225, + 440, + 237 + ], + "score": 0.93, + "content": "C \\in [ a , b ] ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 223, + 458, + 239 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 458, + 226, + 490, + 236 + ], + "score": 0.9, + "content": "\\tau \\in \\mathbb { R } ^ { n }", + "type": "inline_equation" + } + ], + "index": 10 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 223, + 490, + 239 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 242, + 504, + 265 + ], + "lines": [ + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 198, + 255 + ], + "score": 1.0, + "content": "As long as the chosen", + "type": "text" + }, + { + "bbox": [ + 199, + 243, + 219, + 255 + ], + "score": 0.92, + "content": "K ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 242, + 479, + 255 + ], + "score": 1.0, + "content": "fulfills the definition of a mollifier we can use Eqn. 3 and Eqn.", + "type": "text" + }, + { + "bbox": [ + 480, + 242, + 493, + 253 + ], + "score": 0.62, + "content": "4 ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 242, + 505, + 255 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 253, + 200, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 200, + 266 + ], + "score": 1.0, + "content": "rewrite the gradient as:", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 242, + 505, + 266 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 199, + 267, + 412, + 338 + ], + "lines": [ + { + "bbox": [ + 199, + 267, + 412, + 338 + ], + "spans": [ + { + "bbox": [ + 199, + 267, + 412, + 338 + ], + "score": 0.93, + "content": "\\begin{array} { r l r } { \\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { K } ( \\pmb { \\theta } ) = ( \\mathcal { L } \\ast \\nabla K ) ( \\pmb { \\theta } ) } & { } & { \\mathrm { b y ~ E q n . ~ 3 } } \\\\ { = \\displaystyle \\int _ { C } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\tau } ^ { } ) \\nabla K ( \\pmb { \\tau } ^ { } ) d \\pmb { \\tau } } \\\\ { = - \\displaystyle \\int _ { C } \\mathbf { g } ( \\pmb { \\theta } - \\pmb { \\tau } ^ { } ) K ( \\pmb { \\tau } ^ { } ) d \\pmb { \\tau } } & { } & { \\mathrm { b y ~ E q n . ~ 4 } } \\end{array}", + "type": "interline_equation", + "image_path": "ab966a70938a27a555b09f8f8bdc7ab717ee5da9253431febc7067405c41d1be.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 199, + 267, + 412, + 281.2 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 199, + 281.2, + 412, + 295.4 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 199, + 295.4, + 412, + 309.59999999999997 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 199, + 309.59999999999997, + 412, + 323.79999999999995 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 199, + 323.79999999999995, + 412, + 337.99999999999994 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 346, + 504, + 369 + ], + "lines": [ + { + "bbox": [ + 106, + 345, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 106, + 345, + 301, + 359 + ], + "score": 1.0, + "content": "For a differentiable almost everywhere function", + "type": "text" + }, + { + "bbox": [ + 302, + 347, + 309, + 357 + ], + "score": 0.82, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 345, + 387, + 359 + ], + "score": 1.0, + "content": ", the weak gradient", + "type": "text" + }, + { + "bbox": [ + 388, + 347, + 407, + 359 + ], + "score": 0.92, + "content": "g ( \\pmb \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 345, + 453, + 359 + ], + "score": 1.0, + "content": "is equal to", + "type": "text" + }, + { + "bbox": [ + 453, + 347, + 474, + 358 + ], + "score": 0.91, + "content": "\\nabla _ { \\boldsymbol { \\theta } } \\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 345, + 505, + 359 + ], + "score": 1.0, + "content": "almost", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 357, + 377, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 377, + 369 + ], + "score": 1.0, + "content": "everywhere. With a slight abuse of notation we can therefore write:", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 345, + 505, + 369 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 221, + 372, + 390, + 399 + ], + "lines": [ + { + "bbox": [ + 221, + 372, + 390, + 399 + ], + "spans": [ + { + "bbox": [ + 221, + 372, + 390, + 399 + ], + "score": 0.95, + "content": "\\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { K } ( \\pmb { \\theta } ) = - \\int _ { C } \\nabla _ { \\pmb { \\theta } } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\tau } ) K ( \\pmb { \\tau } ) d \\pmb { \\tau }", + "type": "interline_equation", + "image_path": "a9fdad77f9115695511a104d62d70da3586873f3308dc87bdb1dad68e4b4a2bd.jpg" + } + ] + } + ], + "index": 20.5, + "virtual_lines": [ + { + "bbox": [ + 221, + 372, + 390, + 385.5 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 221, + 385.5, + 390, + 399.0 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "title", + "bbox": [ + 107, + 410, + 233, + 421 + ], + "lines": [ + { + "bbox": [ + 105, + 409, + 234, + 423 + ], + "spans": [ + { + "bbox": [ + 105, + 409, + 234, + 423 + ], + "score": 1.0, + "content": "2.3 GAUSSIAN MOLLIFIERS", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 106, + 429, + 505, + 473 + ], + "lines": [ + { + "bbox": [ + 106, + 430, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 430, + 331, + 442 + ], + "score": 1.0, + "content": "It is possible to use the standard Gaussian distribution", + "type": "text" + }, + { + "bbox": [ + 331, + 430, + 366, + 442 + ], + "score": 0.92, + "content": "\\mathcal { N } ( 0 , \\bf { I } )", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 430, + 425, + 442 + ], + "score": 1.0, + "content": "as a mollifier", + "type": "text" + }, + { + "bbox": [ + 425, + 430, + 446, + 442 + ], + "score": 0.91, + "content": "K ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 430, + 505, + 442 + ], + "score": 1.0, + "content": ", as it satisfies", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 441, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 505, + 453 + ], + "score": 1.0, + "content": "the desired properties: it is infinitely differentiable, a sequence of properly rescaled Gaussian", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 450, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 468, + 464 + ], + "score": 1.0, + "content": "distributions converges to the Dirac delta function and it vanishes in infinity. With such a", + "type": "text" + }, + { + "bbox": [ + 468, + 451, + 489, + 463 + ], + "score": 0.91, + "content": "K ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 450, + 505, + 464 + ], + "score": 1.0, + "content": "the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 462, + 182, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 182, + 474 + ], + "score": 1.0, + "content": "gradient becomes:", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 430, + 505, + 474 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 477, + 419, + 519 + ], + "lines": [ + { + "bbox": [ + 192, + 477, + 419, + 519 + ], + "spans": [ + { + "bbox": [ + 192, + 477, + 419, + 519 + ], + "score": 0.93, + "content": "\\begin{array} { r l } { { \\nabla _ { \\theta } \\mathcal { L } _ { K = \\mathcal { N } } ( \\theta ) = - \\int _ { C } \\nabla _ { \\theta } \\mathcal { L } ( \\theta - \\tau ) p ( \\tau ) d \\tau } } \\\\ & { = \\mathrm { E } _ { \\tau } [ \\nabla _ { \\theta } \\mathcal { L } ( \\theta - \\tau ) ] , \\mathrm { w i t h } \\ \\tau \\sim \\mathcal { N } ( 0 , \\ \\mathbf { I } ) } \\end{array}", + "type": "interline_equation", + "image_path": "7aaf714baa513747c6fed1e6280acc13bffa5969bbaf78a60cbd51521a64a804.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 192, + 477, + 419, + 491.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 192, + 491.0, + 419, + 505.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 192, + 505.0, + 419, + 519.0 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 527, + 506, + 559 + ], + "lines": [ + { + "bbox": [ + 106, + 527, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 106, + 527, + 506, + 540 + ], + "score": 1.0, + "content": "Exploiting the fact that a Gaussian distribution is a mollifier, we can focus on a sequence of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 538, + 505, + 550 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 279, + 550 + ], + "score": 1.0, + "content": "mollifications indexed by scaling parameter", + "type": "text" + }, + { + "bbox": [ + 280, + 540, + 285, + 547 + ], + "score": 0.76, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 538, + 505, + 550 + ], + "score": 1.0, + "content": "introduced in Eqn. 2. A single element of this sequence", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 548, + 210, + 560 + ], + "spans": [ + { + "bbox": [ + 106, + 548, + 210, + 560 + ], + "score": 1.0, + "content": "takes the following form:", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 106, + 527, + 506, + 560 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 563, + 419, + 606 + ], + "lines": [ + { + "bbox": [ + 192, + 563, + 419, + 606 + ], + "spans": [ + { + "bbox": [ + 192, + 563, + 419, + 606 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\nabla _ { \\boldsymbol { \\theta } } \\mathcal { L } _ { \\mathcal { N } , \\epsilon } ( \\boldsymbol { \\theta } ) = - \\displaystyle \\int _ { C } \\nabla _ { \\boldsymbol { \\theta } } \\mathcal { L } ( \\boldsymbol { \\theta } - \\boldsymbol { \\tau } ) \\epsilon ^ { - 1 } p ( \\boldsymbol { \\tau } / \\epsilon ) d \\boldsymbol { \\tau } } \\\\ & { ~ = \\mathrm { E } _ { \\boldsymbol { \\tau } } [ \\nabla _ { \\boldsymbol { \\theta } } \\mathcal { L } ( \\boldsymbol { \\theta } - \\boldsymbol { \\tau } ) ] , \\mathrm { w i t h } \\boldsymbol { \\tau } \\sim \\mathcal { N } ( 0 , \\epsilon ^ { 2 } \\mathbf { I } ) } \\end{array}", + "type": "interline_equation", + "image_path": "9950b1b7bd20ac0fef703f794670413e1bf914a9c4f70040e2a7c0c3b5d68505.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 192, + 563, + 419, + 577.3333333333334 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 192, + 577.3333333333334, + 419, + 591.6666666666667 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 192, + 591.6666666666667, + 419, + 606.0000000000001 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 614, + 381, + 626 + ], + "lines": [ + { + "bbox": [ + 105, + 612, + 378, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 149, + 629 + ], + "score": 1.0, + "content": "Replacing", + "type": "text" + }, + { + "bbox": [ + 150, + 617, + 155, + 624 + ], + "score": 0.73, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 612, + 176, + 629 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 176, + 617, + 183, + 624 + ], + "score": 0.79, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 612, + 371, + 629 + ], + "score": 1.0, + "content": "yields a sequence of mollifications indexed by", + "type": "text" + }, + { + "bbox": [ + 371, + 617, + 378, + 624 + ], + "score": 0.8, + "content": "\\sigma", + "type": "inline_equation" + } + ], + "index": 36 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 612, + 378, + 629 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 190, + 631, + 421, + 645 + ], + "lines": [ + { + "bbox": [ + 190, + 631, + 421, + 645 + ], + "spans": [ + { + "bbox": [ + 190, + 631, + 421, + 645 + ], + "score": 0.84, + "content": "\\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { \\mathcal { N } , \\sigma } ( \\pmb { \\theta } ) = \\mathrm { E } _ { \\pmb { \\tau } } [ \\nabla _ { \\pmb { \\theta } } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\tau } ) ] , \\mathrm { w i t h } \\ \\pmb { \\tau } \\sim \\mathcal { N } ( 0 , \\ \\sigma ^ { 2 } \\mathbf { I } )", + "type": "interline_equation", + "image_path": "37289e4b45dbdcb9cec31211bf54eada6503f4e6bfe11e4317f5fd524dee448a.jpg" + } + ] + } + ], + "index": 37, + "virtual_lines": [ + { + "bbox": [ + 190, + 631, + 421, + 645 + ], + "spans": [], + "index": 37 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 648, + 268, + 660 + ], + "lines": [ + { + "bbox": [ + 105, + 646, + 269, + 663 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 269, + 663 + ], + "score": 1.0, + "content": "with the following property (by Eqn. 2):", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 38, + "bbox_fs": [ + 105, + 646, + 269, + 663 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 246, + 663, + 365, + 682 + ], + "lines": [ + { + "bbox": [ + 246, + 663, + 365, + 682 + ], + "spans": [ + { + "bbox": [ + 246, + 663, + 365, + 682 + ], + "score": 0.91, + "content": "\\operatorname* { l i m } _ { \\sigma \\to 0 } \\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { \\mathcal { N } , \\sigma } ( \\pmb { \\theta } ) = \\nabla _ { \\pmb { \\theta } } \\mathcal { L } ( \\pmb { \\theta } )", + "type": "interline_equation", + "image_path": "3c7449568d79bb87b5729d188e6055dd46b393c8ef4407f517bed765d80d48c3.jpg" + } + ] + } + ], + "index": 39, + "virtual_lines": [ + { + "bbox": [ + 246, + 663, + 365, + 682 + ], + "spans": [], + "index": 39 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 691, + 505, + 714 + ], + "lines": [ + { + "bbox": [ + 105, + 690, + 506, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 690, + 293, + 705 + ], + "score": 1.0, + "content": "An intuitive interpretation of the result is that", + "type": "text" + }, + { + "bbox": [ + 293, + 694, + 301, + 702 + ], + "score": 0.8, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 690, + 506, + 705 + ], + "score": 1.0, + "content": "determines the standard deviation of a mollifying", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 701, + 505, + 714 + ], + "spans": [ + { + "bbox": [ + 106, + 701, + 505, + 714 + ], + "score": 1.0, + "content": "Gaussian and is annealed in order to construct a sequence of gradually less \"blurred\" and closer", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 82, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 183, + 96 + ], + "score": 1.0, + "content": "approximations to", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 183, + 83, + 191, + 92 + ], + "score": 0.73, + "content": "\\mathcal { L }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 192, + 82, + 387, + 96 + ], + "score": 1.0, + "content": ". This is consistent with the property that when", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 387, + 85, + 394, + 92 + ], + "score": 0.75, + "content": "\\sigma", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 395, + 82, + 506, + 96 + ], + "score": 1.0, + "content": "is annealed to zero we are", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 248, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 236, + 106 + ], + "score": 1.0, + "content": "optimizing the original function", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 236, + 93, + 244, + 103 + ], + "score": 0.76, + "content": "\\mathcal { L }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 244, + 93, + 248, + 106 + ], + "score": 1.0, + "content": ".", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 40.5, + "bbox_fs": [ + 105, + 690, + 506, + 714 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 104 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 183, + 96 + ], + "score": 1.0, + "content": "approximations to", + "type": "text" + }, + { + "bbox": [ + 183, + 83, + 191, + 92 + ], + "score": 0.73, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 82, + 387, + 96 + ], + "score": 1.0, + "content": ". This is consistent with the property that when", + "type": "text" + }, + { + "bbox": [ + 387, + 85, + 394, + 92 + ], + "score": 0.75, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 82, + 506, + 96 + ], + "score": 1.0, + "content": "is annealed to zero we are", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 248, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 236, + 106 + ], + "score": 1.0, + "content": "optimizing the original function", + "type": "text" + }, + { + "bbox": [ + 236, + 93, + 244, + 103 + ], + "score": 0.76, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 93, + 248, + 106 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 109, + 505, + 186 + ], + "lines": [ + { + "bbox": [ + 106, + 109, + 505, + 122 + ], + "spans": [ + { + "bbox": [ + 106, + 109, + 272, + 122 + ], + "score": 1.0, + "content": "So far we obtained the mollified version", + "type": "text" + }, + { + "bbox": [ + 272, + 109, + 302, + 121 + ], + "score": 0.92, + "content": "\\mathcal { L } _ { K } ( \\pmb { \\theta } )", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 109, + 385, + 122 + ], + "score": 1.0, + "content": "of the cost function", + "type": "text" + }, + { + "bbox": [ + 385, + 109, + 407, + 121 + ], + "score": 0.91, + "content": "\\mathcal { L } ( \\pmb { \\theta } )", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 109, + 505, + 122 + ], + "score": 1.0, + "content": "by convolving it with a", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 119, + 506, + 133 + ], + "spans": [ + { + "bbox": [ + 105, + 119, + 144, + 133 + ], + "score": 1.0, + "content": "mollifier", + "type": "text" + }, + { + "bbox": [ + 145, + 120, + 168, + 131 + ], + "score": 0.91, + "content": "K ( \\pmb \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 119, + 222, + 133 + ], + "score": 1.0, + "content": ". The kernel", + "type": "text" + }, + { + "bbox": [ + 222, + 120, + 246, + 131 + ], + "score": 0.91, + "content": "K ( \\pmb \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 119, + 460, + 133 + ], + "score": 1.0, + "content": "corresponds to the average effect of injecting noise", + "type": "text" + }, + { + "bbox": [ + 461, + 120, + 467, + 131 + ], + "score": 0.83, + "content": "\\bar { \\xi }", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 119, + 506, + 133 + ], + "score": 1.0, + "content": "sampled", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 128, + 506, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 506, + 144 + ], + "score": 1.0, + "content": "from standard Normal distribution. The amount of noise controls the amount of smoothing.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 140, + 506, + 153 + ], + "spans": [ + { + "bbox": [ + 106, + 140, + 506, + 153 + ], + "score": 1.0, + "content": "Gradually reducing the noise during training is related to a form of simulated annealing (Kirkpatrick", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 150, + 506, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 506, + 163 + ], + "score": 1.0, + "content": "et al., 1983). Similarly to the analysis in Mobahi (2016), we can write a Monte-Carlo estimate of", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 157, + 510, + 180 + ], + "spans": [ + { + "bbox": [ + 106, + 162, + 295, + 177 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathcal { L } _ { K } ( \\pmb { \\theta } ) = ( \\mathcal { L } * K ) ( \\pmb { \\theta } ) \\approx \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\xi } ^ { ( i ) } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 157, + 510, + 180 + ], + "score": 1.0, + "content": ". We provide the derivation and the gradient of this", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 174, + 208, + 187 + ], + "spans": [ + { + "bbox": [ + 105, + 174, + 208, + 187 + ], + "score": 1.0, + "content": "equation in Appendix A.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 106, + 190, + 504, + 212 + ], + "lines": [ + { + "bbox": [ + 105, + 190, + 505, + 203 + ], + "spans": [ + { + "bbox": [ + 105, + 190, + 505, + 203 + ], + "score": 1.0, + "content": "The Monte-Carlo estimators of the mollifiers can be easily implemented with neural networks, where", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 201, + 245, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 201, + 245, + 213 + ], + "score": 1.0, + "content": "the layers typically have the form:", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "interline_equation", + "bbox": [ + 269, + 211, + 341, + 227 + ], + "lines": [ + { + "bbox": [ + 269, + 211, + 341, + 227 + ], + "spans": [ + { + "bbox": [ + 269, + 211, + 341, + 227 + ], + "score": 0.92, + "content": "\\mathbf { h } ^ { l } = \\mathbf { f } ( \\mathbf { W } ^ { l } \\mathbf { h } ^ { l - 1 } )", + "type": "interline_equation", + "image_path": "050189de7e54b542177fd8538c98b7593e4d651e1001fe8adbca8f211bd00a87.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 269, + 211, + 341, + 227 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 230, + 505, + 253 + ], + "lines": [ + { + "bbox": [ + 104, + 227, + 506, + 245 + ], + "spans": [ + { + "bbox": [ + 104, + 227, + 126, + 245 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 126, + 230, + 147, + 241 + ], + "score": 0.9, + "content": "\\mathbf { h } ^ { l - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 227, + 400, + 245 + ], + "score": 1.0, + "content": "a vector of activations from the previous layer in the hierarchy,", + "type": "text" + }, + { + "bbox": [ + 401, + 230, + 417, + 241 + ], + "score": 0.87, + "content": "\\mathbf { W } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 227, + 506, + 245 + ], + "score": 1.0, + "content": "a matrix representing", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 241, + 385, + 253 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 385, + 253 + ], + "score": 1.0, + "content": "a linear transformation and f an element-wise non-linearity of choice.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 106, + 257, + 318, + 269 + ], + "lines": [ + { + "bbox": [ + 105, + 257, + 318, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 318, + 270 + ], + "score": 1.0, + "content": "A mollification of such a layer can be formulated as:", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "interline_equation", + "bbox": [ + 209, + 275, + 401, + 290 + ], + "lines": [ + { + "bbox": [ + 209, + 275, + 401, + 290 + ], + "spans": [ + { + "bbox": [ + 209, + 275, + 401, + 290 + ], + "score": 0.88, + "content": "\\mathbf { h } ^ { l } = \\mathbf { f } ( ( \\mathbf { W } ^ { l } - \\boldsymbol { \\xi } ^ { l } ) \\mathbf { h } ^ { l - 1 } ) , \\mathrm { w h e r e \\ } \\boldsymbol { \\xi } ^ { l } \\sim \\mathcal { N } ( \\mu , \\boldsymbol { \\sigma } ^ { 2 } )", + "type": "interline_equation", + "image_path": "3467103ada77b6382f68c5afaac9af4dd31dec9653e774d1d9b33cabedf27408.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 209, + 275, + 401, + 290 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 301, + 504, + 324 + ], + "lines": [ + { + "bbox": [ + 105, + 299, + 505, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 450, + 315 + ], + "score": 1.0, + "content": "From Eqn. 16, it is easy to see that both weight noise methods proposed by Hinton", + "type": "text" + }, + { + "bbox": [ + 450, + 302, + 460, + 312 + ], + "score": 0.41, + "content": "\\&", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 299, + 505, + 315 + ], + "score": 1.0, + "content": "van Camp", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 311, + 469, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 469, + 324 + ], + "score": 1.0, + "content": "(1993) and Graves (2011) can be seen as a variation of Monte-Carlo estimate of mollifiers.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + }, + { + "type": "title", + "bbox": [ + 107, + 334, + 302, + 345 + ], + "lines": [ + { + "bbox": [ + 105, + 334, + 303, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 303, + 347 + ], + "score": 1.0, + "content": "2.4 GENERALIZED AND NOISY MOLLIFIERS", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 108, + 351, + 504, + 384 + ], + "lines": [ + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "score": 1.0, + "content": "We introduce a generalization of the concept of mollifiers that encompasses the approach we explored", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 361, + 505, + 374 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 505, + 374 + ], + "score": 1.0, + "content": "here and that is targeted during optimization via a continuation method using stochastic gradient", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 371, + 142, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 142, + 385 + ], + "score": 1.0, + "content": "descent.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 387, + 504, + 409 + ], + "lines": [ + { + "bbox": [ + 105, + 386, + 505, + 400 + ], + "spans": [ + { + "bbox": [ + 105, + 386, + 447, + 400 + ], + "score": 1.0, + "content": "Definition 2.1. (Generalized Mollifier). A generalized mollifier is an operator, where", + "type": "text" + }, + { + "bbox": [ + 448, + 387, + 474, + 399 + ], + "score": 0.92, + "content": "T _ { \\sigma } ( f )", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 386, + 505, + 400 + ], + "score": 1.0, + "content": "defines", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 396, + 340, + 410 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 284, + 410 + ], + "score": 1.0, + "content": "a mapping between two functions, such that", + "type": "text" + }, + { + "bbox": [ + 284, + 398, + 336, + 409 + ], + "score": 0.92, + "content": "T _ { \\sigma } : f \\to f ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 396, + 340, + 410 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "interline_equation", + "bbox": [ + 275, + 415, + 335, + 432 + ], + "lines": [ + { + "bbox": [ + 275, + 415, + 335, + 432 + ], + "spans": [ + { + "bbox": [ + 275, + 415, + 335, + 432 + ], + "score": 0.91, + "content": "\\operatorname* { l i m } _ { \\sigma \\to 0 } T _ { \\sigma } f = f ,", + "type": "interline_equation", + "image_path": "f0c9f435739b6fad0bfe9a7785f0a75340c1eb0a978691f96934be1e7cbf6717.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 275, + 415, + 335, + 432 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 208, + 441, + 402, + 495 + ], + "lines": [ + { + "bbox": [ + 208, + 441, + 402, + 495 + ], + "spans": [ + { + "bbox": [ + 208, + 441, + 402, + 495 + ], + "score": 0.46, + "content": "\\begin{array} { r l } { { f ^ { 0 } = \\displaystyle \\operatorname* { l i m } _ { \\sigma \\to \\infty } T _ { \\sigma } f \\quad } } & { { \\mathrm { ~ i s ~ \\ a n ~ i d e n t i t y ~ f u n c t i o n ~ } } } \\\\ { { \\frac { \\partial ( T _ { \\sigma } f ) ( x ) } { \\partial x } \\quad } } & { { \\mathrm { e x i s t s ~ } \\forall x , \\sigma > 0 } } \\end{array}", + "type": "interline_equation", + "image_path": "8d81d610d83e3c4468314d45c09a25e522cbf3b2170425900cdf24b9ae72cbd0.jpg" + } + ] + } + ], + "index": 26.5, + "virtual_lines": [ + { + "bbox": [ + 208, + 441, + 402, + 454.5 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 208, + 454.5, + 402, + 468.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 208, + 468.0, + 402, + 481.5 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 208, + 481.5, + 402, + 495.0 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 502, + 502, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 501, + 504, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 504, + 514 + ], + "score": 1.0, + "content": "In addition, we consider noisy mollifiers which can be defined as an expected value of a stochastic", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 511, + 349, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 142, + 525 + ], + "score": 1.0, + "content": "function", + "type": "text" + }, + { + "bbox": [ + 142, + 512, + 172, + 524 + ], + "score": 0.93, + "content": "\\phi ( x , \\xi )", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 511, + 274, + 525 + ], + "score": 1.0, + "content": "under some noise source", + "type": "text" + }, + { + "bbox": [ + 274, + 513, + 280, + 524 + ], + "score": 0.85, + "content": "\\xi", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 511, + 337, + 525 + ], + "score": 1.0, + "content": "with variance", + "type": "text" + }, + { + "bbox": [ + 338, + 514, + 345, + 522 + ], + "score": 0.79, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 511, + 349, + 525 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + }, + { + "type": "interline_equation", + "bbox": [ + 253, + 528, + 358, + 543 + ], + "lines": [ + { + "bbox": [ + 253, + 528, + 358, + 543 + ], + "spans": [ + { + "bbox": [ + 253, + 528, + 358, + 543 + ], + "score": 0.91, + "content": "( T _ { \\sigma } f ) ( x ) = E _ { \\xi } [ \\phi ( x , \\xi _ { \\sigma } ) ]", + "type": "interline_equation", + "image_path": "ba9a406f9b3150a536dd8186a5a2abedfd676c09e938a7a9eeac6418b206e8aa.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 253, + 528, + 358, + 543 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 547, + 506, + 580 + ], + "lines": [ + { + "bbox": [ + 105, + 546, + 506, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 363, + 561 + ], + "score": 1.0, + "content": "Definition 2.2. (Noisy Mollifier). We call a stochastic function", + "type": "text" + }, + { + "bbox": [ + 363, + 548, + 398, + 560 + ], + "score": 0.93, + "content": "\\phi ( x , \\xi _ { \\sigma } )", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 546, + 442, + 561 + ], + "score": 1.0, + "content": "with input", + "type": "text" + }, + { + "bbox": [ + 442, + 550, + 450, + 558 + ], + "score": 0.78, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 546, + 491, + 561 + ], + "score": 1.0, + "content": "and noise", + "type": "text" + }, + { + "bbox": [ + 491, + 549, + 497, + 560 + ], + "score": 0.8, + "content": "\\xi", + "type": "inline_equation" + }, + { + "bbox": [ + 497, + 546, + 506, + 561 + ], + "score": 1.0, + "content": "a", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 559, + 505, + 571 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 478, + 571 + ], + "score": 1.0, + "content": "noisy mollifier if its expected value corresponds to the application of a generalized mollifier", + "type": "text" + }, + { + "bbox": [ + 478, + 559, + 490, + 570 + ], + "score": 0.88, + "content": "T _ { \\sigma }", + "type": "inline_equation" + }, + { + "bbox": [ + 490, + 559, + 505, + 571 + ], + "score": 1.0, + "content": ", as", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 104, + 568, + 158, + 581 + ], + "spans": [ + { + "bbox": [ + 104, + 568, + 158, + 581 + ], + "score": 1.0, + "content": "per Eqn. 20.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 106, + 589, + 505, + 653 + ], + "lines": [ + { + "bbox": [ + 106, + 590, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 590, + 338, + 601 + ], + "score": 1.0, + "content": "The composition of two noisy mollifiers sharing the same", + "type": "text" + }, + { + "bbox": [ + 339, + 592, + 346, + 600 + ], + "score": 0.78, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 590, + 505, + 601 + ], + "score": 1.0, + "content": "is also a noisy mollifier, since the three", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 600, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 381, + 613 + ], + "score": 1.0, + "content": "properties in the definition (Eqns. 17,18,19) are still satisfied. When", + "type": "text" + }, + { + "bbox": [ + 382, + 601, + 407, + 610 + ], + "score": 0.9, + "content": "\\sigma = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 600, + 506, + 613 + ], + "score": 1.0, + "content": "no noise is injected and", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 610, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 610, + 319, + 623 + ], + "score": 1.0, + "content": "therefore the original function will be optimized. If", + "type": "text" + }, + { + "bbox": [ + 319, + 612, + 353, + 621 + ], + "score": 0.87, + "content": "\\sigma \\to \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 610, + 505, + 623 + ], + "score": 1.0, + "content": "instead, the function will become an", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 621, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 505, + 633 + ], + "score": 1.0, + "content": "identity function. Thus, for instance, if we mollify each layer of a feed-forward network except the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 631, + 505, + 643 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 184, + 643 + ], + "score": 1.0, + "content": "output layer, when", + "type": "text" + }, + { + "bbox": [ + 184, + 632, + 217, + 641 + ], + "score": 0.88, + "content": "\\sigma \\to \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 631, + 505, + 643 + ], + "score": 1.0, + "content": "all the mollified layers will become identity function and the objective", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 641, + 366, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 366, + 655 + ], + "score": 1.0, + "content": "function of the network with respect to its inputs will be convex.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 107, + 658, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 657, + 506, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 506, + 671 + ], + "score": 1.0, + "content": "Consequently, corrupting separately the activation function of each level of a deep neural network", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 668, + 507, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 226, + 681 + ], + "score": 1.0, + "content": "(but with a shared noise level", + "type": "text" + }, + { + "bbox": [ + 226, + 671, + 234, + 678 + ], + "score": 0.72, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 668, + 297, + 681 + ], + "score": 1.0, + "content": ") and annealing", + "type": "text" + }, + { + "bbox": [ + 297, + 671, + 304, + 678 + ], + "score": 0.76, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 668, + 507, + 681 + ], + "score": 1.0, + "content": "yields a noisy mollifier for the objective function.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 678, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 678, + 505, + 691 + ], + "score": 1.0, + "content": "This is related to the work of Mobahi (2016), who recently introduced a way of analytically", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 690, + 506, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 690, + 506, + 702 + ], + "score": 1.0, + "content": "smoothing of the non-linearities to help the training of recurrent networks. The differences of that", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "approach from our algorithm is two-fold: we use a noisy mollifier (rather than an analytic smoothing", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "of the network’s non-linearities) and we introduce (in the next section) a particular form of the noisy", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 721, + 293, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 293, + 732 + ], + "score": 1.0, + "content": "mollifier that empirically proved to work well.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44 + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 759 + ], + "lines": [] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 104 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 82, + 506, + 106 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 109, + 505, + 186 + ], + "lines": [ + { + "bbox": [ + 106, + 109, + 505, + 122 + ], + "spans": [ + { + "bbox": [ + 106, + 109, + 272, + 122 + ], + "score": 1.0, + "content": "So far we obtained the mollified version", + "type": "text" + }, + { + "bbox": [ + 272, + 109, + 302, + 121 + ], + "score": 0.92, + "content": "\\mathcal { L } _ { K } ( \\pmb { \\theta } )", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 109, + 385, + 122 + ], + "score": 1.0, + "content": "of the cost function", + "type": "text" + }, + { + "bbox": [ + 385, + 109, + 407, + 121 + ], + "score": 0.91, + "content": "\\mathcal { L } ( \\pmb { \\theta } )", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 109, + 505, + 122 + ], + "score": 1.0, + "content": "by convolving it with a", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 119, + 506, + 133 + ], + "spans": [ + { + "bbox": [ + 105, + 119, + 144, + 133 + ], + "score": 1.0, + "content": "mollifier", + "type": "text" + }, + { + "bbox": [ + 145, + 120, + 168, + 131 + ], + "score": 0.91, + "content": "K ( \\pmb \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 119, + 222, + 133 + ], + "score": 1.0, + "content": ". The kernel", + "type": "text" + }, + { + "bbox": [ + 222, + 120, + 246, + 131 + ], + "score": 0.91, + "content": "K ( \\pmb \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 119, + 460, + 133 + ], + "score": 1.0, + "content": "corresponds to the average effect of injecting noise", + "type": "text" + }, + { + "bbox": [ + 461, + 120, + 467, + 131 + ], + "score": 0.83, + "content": "\\bar { \\xi }", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 119, + 506, + 133 + ], + "score": 1.0, + "content": "sampled", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 128, + 506, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 506, + 144 + ], + "score": 1.0, + "content": "from standard Normal distribution. The amount of noise controls the amount of smoothing.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 140, + 506, + 153 + ], + "spans": [ + { + "bbox": [ + 106, + 140, + 506, + 153 + ], + "score": 1.0, + "content": "Gradually reducing the noise during training is related to a form of simulated annealing (Kirkpatrick", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 150, + 506, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 506, + 163 + ], + "score": 1.0, + "content": "et al., 1983). Similarly to the analysis in Mobahi (2016), we can write a Monte-Carlo estimate of", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 157, + 510, + 180 + ], + "spans": [ + { + "bbox": [ + 106, + 162, + 295, + 177 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathcal { L } _ { K } ( \\pmb { \\theta } ) = ( \\mathcal { L } * K ) ( \\pmb { \\theta } ) \\approx \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\xi } ^ { ( i ) } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 157, + 510, + 180 + ], + "score": 1.0, + "content": ". We provide the derivation and the gradient of this", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 174, + 208, + 187 + ], + "spans": [ + { + "bbox": [ + 105, + 174, + 208, + 187 + ], + "score": 1.0, + "content": "equation in Appendix A.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 109, + 510, + 187 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 190, + 504, + 212 + ], + "lines": [ + { + "bbox": [ + 105, + 190, + 505, + 203 + ], + "spans": [ + { + "bbox": [ + 105, + 190, + 505, + 203 + ], + "score": 1.0, + "content": "The Monte-Carlo estimators of the mollifiers can be easily implemented with neural networks, where", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 201, + 245, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 201, + 245, + 213 + ], + "score": 1.0, + "content": "the layers typically have the form:", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 190, + 505, + 213 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 269, + 211, + 341, + 227 + ], + "lines": [ + { + "bbox": [ + 269, + 211, + 341, + 227 + ], + "spans": [ + { + "bbox": [ + 269, + 211, + 341, + 227 + ], + "score": 0.92, + "content": "\\mathbf { h } ^ { l } = \\mathbf { f } ( \\mathbf { W } ^ { l } \\mathbf { h } ^ { l - 1 } )", + "type": "interline_equation", + "image_path": "050189de7e54b542177fd8538c98b7593e4d651e1001fe8adbca8f211bd00a87.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 269, + 211, + 341, + 227 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 230, + 505, + 253 + ], + "lines": [ + { + "bbox": [ + 104, + 227, + 506, + 245 + ], + "spans": [ + { + "bbox": [ + 104, + 227, + 126, + 245 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 126, + 230, + 147, + 241 + ], + "score": 0.9, + "content": "\\mathbf { h } ^ { l - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 227, + 400, + 245 + ], + "score": 1.0, + "content": "a vector of activations from the previous layer in the hierarchy,", + "type": "text" + }, + { + "bbox": [ + 401, + 230, + 417, + 241 + ], + "score": 0.87, + "content": "\\mathbf { W } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 227, + 506, + 245 + ], + "score": 1.0, + "content": "a matrix representing", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 241, + 385, + 253 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 385, + 253 + ], + "score": 1.0, + "content": "a linear transformation and f an element-wise non-linearity of choice.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 104, + 227, + 506, + 253 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 257, + 318, + 269 + ], + "lines": [ + { + "bbox": [ + 105, + 257, + 318, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 318, + 270 + ], + "score": 1.0, + "content": "A mollification of such a layer can be formulated as:", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 257, + 318, + 270 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 209, + 275, + 401, + 290 + ], + "lines": [ + { + "bbox": [ + 209, + 275, + 401, + 290 + ], + "spans": [ + { + "bbox": [ + 209, + 275, + 401, + 290 + ], + "score": 0.88, + "content": "\\mathbf { h } ^ { l } = \\mathbf { f } ( ( \\mathbf { W } ^ { l } - \\boldsymbol { \\xi } ^ { l } ) \\mathbf { h } ^ { l - 1 } ) , \\mathrm { w h e r e \\ } \\boldsymbol { \\xi } ^ { l } \\sim \\mathcal { N } ( \\mu , \\boldsymbol { \\sigma } ^ { 2 } )", + "type": "interline_equation", + "image_path": "3467103ada77b6382f68c5afaac9af4dd31dec9653e774d1d9b33cabedf27408.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 209, + 275, + 401, + 290 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 301, + 504, + 324 + ], + "lines": [ + { + "bbox": [ + 105, + 299, + 505, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 450, + 315 + ], + "score": 1.0, + "content": "From Eqn. 16, it is easy to see that both weight noise methods proposed by Hinton", + "type": "text" + }, + { + "bbox": [ + 450, + 302, + 460, + 312 + ], + "score": 0.41, + "content": "\\&", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 299, + 505, + 315 + ], + "score": 1.0, + "content": "van Camp", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 311, + 469, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 469, + 324 + ], + "score": 1.0, + "content": "(1993) and Graves (2011) can be seen as a variation of Monte-Carlo estimate of mollifiers.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5, + "bbox_fs": [ + 105, + 299, + 505, + 324 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 334, + 302, + 345 + ], + "lines": [ + { + "bbox": [ + 105, + 334, + 303, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 303, + 347 + ], + "score": 1.0, + "content": "2.4 GENERALIZED AND NOISY MOLLIFIERS", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 108, + 351, + 504, + 384 + ], + "lines": [ + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "score": 1.0, + "content": "We introduce a generalization of the concept of mollifiers that encompasses the approach we explored", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 361, + 505, + 374 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 505, + 374 + ], + "score": 1.0, + "content": "here and that is targeted during optimization via a continuation method using stochastic gradient", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 371, + 142, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 142, + 385 + ], + "score": 1.0, + "content": "descent.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 351, + 505, + 385 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 387, + 504, + 409 + ], + "lines": [ + { + "bbox": [ + 105, + 386, + 505, + 400 + ], + "spans": [ + { + "bbox": [ + 105, + 386, + 447, + 400 + ], + "score": 1.0, + "content": "Definition 2.1. (Generalized Mollifier). A generalized mollifier is an operator, where", + "type": "text" + }, + { + "bbox": [ + 448, + 387, + 474, + 399 + ], + "score": 0.92, + "content": "T _ { \\sigma } ( f )", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 386, + 505, + 400 + ], + "score": 1.0, + "content": "defines", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 396, + 340, + 410 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 284, + 410 + ], + "score": 1.0, + "content": "a mapping between two functions, such that", + "type": "text" + }, + { + "bbox": [ + 284, + 398, + 336, + 409 + ], + "score": 0.92, + "content": "T _ { \\sigma } : f \\to f ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 396, + 340, + 410 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 386, + 505, + 410 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 275, + 415, + 335, + 432 + ], + "lines": [ + { + "bbox": [ + 275, + 415, + 335, + 432 + ], + "spans": [ + { + "bbox": [ + 275, + 415, + 335, + 432 + ], + "score": 0.91, + "content": "\\operatorname* { l i m } _ { \\sigma \\to 0 } T _ { \\sigma } f = f ,", + "type": "interline_equation", + "image_path": "f0c9f435739b6fad0bfe9a7785f0a75340c1eb0a978691f96934be1e7cbf6717.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 275, + 415, + 335, + 432 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 208, + 441, + 402, + 495 + ], + "lines": [ + { + "bbox": [ + 208, + 441, + 402, + 495 + ], + "spans": [ + { + "bbox": [ + 208, + 441, + 402, + 495 + ], + "score": 0.46, + "content": "\\begin{array} { r l } { { f ^ { 0 } = \\displaystyle \\operatorname* { l i m } _ { \\sigma \\to \\infty } T _ { \\sigma } f \\quad } } & { { \\mathrm { ~ i s ~ \\ a n ~ i d e n t i t y ~ f u n c t i o n ~ } } } \\\\ { { \\frac { \\partial ( T _ { \\sigma } f ) ( x ) } { \\partial x } \\quad } } & { { \\mathrm { e x i s t s ~ } \\forall x , \\sigma > 0 } } \\end{array}", + "type": "interline_equation", + "image_path": "8d81d610d83e3c4468314d45c09a25e522cbf3b2170425900cdf24b9ae72cbd0.jpg" + } + ] + } + ], + "index": 26.5, + "virtual_lines": [ + { + "bbox": [ + 208, + 441, + 402, + 454.5 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 208, + 454.5, + 402, + 468.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 208, + 468.0, + 402, + 481.5 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 208, + 481.5, + 402, + 495.0 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 502, + 502, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 501, + 504, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 504, + 514 + ], + "score": 1.0, + "content": "In addition, we consider noisy mollifiers which can be defined as an expected value of a stochastic", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 511, + 349, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 142, + 525 + ], + "score": 1.0, + "content": "function", + "type": "text" + }, + { + "bbox": [ + 142, + 512, + 172, + 524 + ], + "score": 0.93, + "content": "\\phi ( x , \\xi )", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 511, + 274, + 525 + ], + "score": 1.0, + "content": "under some noise source", + "type": "text" + }, + { + "bbox": [ + 274, + 513, + 280, + 524 + ], + "score": 0.85, + "content": "\\xi", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 511, + 337, + 525 + ], + "score": 1.0, + "content": "with variance", + "type": "text" + }, + { + "bbox": [ + 338, + 514, + 345, + 522 + ], + "score": 0.79, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 511, + 349, + 525 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 105, + 501, + 504, + 525 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 253, + 528, + 358, + 543 + ], + "lines": [ + { + "bbox": [ + 253, + 528, + 358, + 543 + ], + "spans": [ + { + "bbox": [ + 253, + 528, + 358, + 543 + ], + "score": 0.91, + "content": "( T _ { \\sigma } f ) ( x ) = E _ { \\xi } [ \\phi ( x , \\xi _ { \\sigma } ) ]", + "type": "interline_equation", + "image_path": "ba9a406f9b3150a536dd8186a5a2abedfd676c09e938a7a9eeac6418b206e8aa.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 253, + 528, + 358, + 543 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 547, + 506, + 580 + ], + "lines": [ + { + "bbox": [ + 105, + 546, + 506, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 363, + 561 + ], + "score": 1.0, + "content": "Definition 2.2. (Noisy Mollifier). We call a stochastic function", + "type": "text" + }, + { + "bbox": [ + 363, + 548, + 398, + 560 + ], + "score": 0.93, + "content": "\\phi ( x , \\xi _ { \\sigma } )", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 546, + 442, + 561 + ], + "score": 1.0, + "content": "with input", + "type": "text" + }, + { + "bbox": [ + 442, + 550, + 450, + 558 + ], + "score": 0.78, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 546, + 491, + 561 + ], + "score": 1.0, + "content": "and noise", + "type": "text" + }, + { + "bbox": [ + 491, + 549, + 497, + 560 + ], + "score": 0.8, + "content": "\\xi", + "type": "inline_equation" + }, + { + "bbox": [ + 497, + 546, + 506, + 561 + ], + "score": 1.0, + "content": "a", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 559, + 505, + 571 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 478, + 571 + ], + "score": 1.0, + "content": "noisy mollifier if its expected value corresponds to the application of a generalized mollifier", + "type": "text" + }, + { + "bbox": [ + 478, + 559, + 490, + 570 + ], + "score": 0.88, + "content": "T _ { \\sigma }", + "type": "inline_equation" + }, + { + "bbox": [ + 490, + 559, + 505, + 571 + ], + "score": 1.0, + "content": ", as", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 104, + 568, + 158, + 581 + ], + "spans": [ + { + "bbox": [ + 104, + 568, + 158, + 581 + ], + "score": 1.0, + "content": "per Eqn. 20.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33, + "bbox_fs": [ + 104, + 546, + 506, + 581 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 589, + 505, + 653 + ], + "lines": [ + { + "bbox": [ + 106, + 590, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 590, + 338, + 601 + ], + "score": 1.0, + "content": "The composition of two noisy mollifiers sharing the same", + "type": "text" + }, + { + "bbox": [ + 339, + 592, + 346, + 600 + ], + "score": 0.78, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 590, + 505, + 601 + ], + "score": 1.0, + "content": "is also a noisy mollifier, since the three", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 600, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 381, + 613 + ], + "score": 1.0, + "content": "properties in the definition (Eqns. 17,18,19) are still satisfied. When", + "type": "text" + }, + { + "bbox": [ + 382, + 601, + 407, + 610 + ], + "score": 0.9, + "content": "\\sigma = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 600, + 506, + 613 + ], + "score": 1.0, + "content": "no noise is injected and", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 610, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 610, + 319, + 623 + ], + "score": 1.0, + "content": "therefore the original function will be optimized. If", + "type": "text" + }, + { + "bbox": [ + 319, + 612, + 353, + 621 + ], + "score": 0.87, + "content": "\\sigma \\to \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 610, + 505, + 623 + ], + "score": 1.0, + "content": "instead, the function will become an", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 621, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 505, + 633 + ], + "score": 1.0, + "content": "identity function. Thus, for instance, if we mollify each layer of a feed-forward network except the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 631, + 505, + 643 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 184, + 643 + ], + "score": 1.0, + "content": "output layer, when", + "type": "text" + }, + { + "bbox": [ + 184, + 632, + 217, + 641 + ], + "score": 0.88, + "content": "\\sigma \\to \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 631, + 505, + 643 + ], + "score": 1.0, + "content": "all the mollified layers will become identity function and the objective", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 641, + 366, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 366, + 655 + ], + "score": 1.0, + "content": "function of the network with respect to its inputs will be convex.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 590, + 506, + 655 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 658, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 657, + 506, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 506, + 671 + ], + "score": 1.0, + "content": "Consequently, corrupting separately the activation function of each level of a deep neural network", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 668, + 507, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 226, + 681 + ], + "score": 1.0, + "content": "(but with a shared noise level", + "type": "text" + }, + { + "bbox": [ + 226, + 671, + 234, + 678 + ], + "score": 0.72, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 668, + 297, + 681 + ], + "score": 1.0, + "content": ") and annealing", + "type": "text" + }, + { + "bbox": [ + 297, + 671, + 304, + 678 + ], + "score": 0.76, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 668, + 507, + 681 + ], + "score": 1.0, + "content": "yields a noisy mollifier for the objective function.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 678, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 678, + 505, + 691 + ], + "score": 1.0, + "content": "This is related to the work of Mobahi (2016), who recently introduced a way of analytically", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 690, + 506, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 690, + 506, + 702 + ], + "score": 1.0, + "content": "smoothing of the non-linearities to help the training of recurrent networks. The differences of that", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "approach from our algorithm is two-fold: we use a noisy mollifier (rather than an analytic smoothing", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "of the network’s non-linearities) and we introduce (in the next section) a particular form of the noisy", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 721, + 293, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 293, + 732 + ], + "score": 1.0, + "content": "mollifier that empirically proved to work well.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44, + "bbox_fs": [ + 105, + 657, + 507, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 136 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "Shaping the cost function to define a sequence of costs that are progressing from easier to more", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 505, + 105 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 316, + 105 + ], + "score": 1.0, + "content": "difficult ones can be related to the reward shaping", + "type": "text" + }, + { + "bbox": [ + 316, + 93, + 331, + 104 + ], + "score": 0.52, + "content": "\\mathrm { N g }", + "type": "inline_equation" + }, + { + "bbox": [ + 332, + 92, + 383, + 105 + ], + "score": 1.0, + "content": "et al., 1999;", + "type": "text" + }, + { + "bbox": [ + 383, + 93, + 397, + 105 + ], + "score": 0.25, + "content": "\\bar { \\bf N } \\mathrm { \\bf g }", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 92, + 505, + 105 + ], + "score": 1.0, + "content": ", 2003) algorithms. In our", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 103, + 506, + 116 + ], + "spans": [ + { + "bbox": [ + 105, + 103, + 506, + 116 + ], + "score": 1.0, + "content": "algorithm, we shape the cost and the model architecture itself, rather than rewards or the targets", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 114, + 505, + 126 + ], + "spans": [ + { + "bbox": [ + 106, + 114, + 505, + 126 + ], + "score": 1.0, + "content": "in order to make the optimization easier. In that sense, reward shaping can be considered to be more", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 123, + 227, + 138 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 227, + 138 + ], + "score": 1.0, + "content": "closer to curriculum learning.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "title", + "bbox": [ + 107, + 151, + 173, + 164 + ], + "lines": [ + { + "bbox": [ + 105, + 149, + 174, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 174, + 167 + ], + "score": 1.0, + "content": "3 METHOD", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 176, + 505, + 230 + ], + "lines": [ + { + "bbox": [ + 106, + 176, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 106, + 176, + 505, + 189 + ], + "score": 1.0, + "content": "We propose an algorithm to mollify the cost of a neural network which also addresses an important", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "score": 1.0, + "content": "drawback of the previously proposed noisy training procedures: as the noise gets larger, it can", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 195, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 505, + 212 + ], + "score": 1.0, + "content": "dominate the learning process and lead the algorithm to perform a random walk on the energy", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 208, + 505, + 220 + ], + "spans": [ + { + "bbox": [ + 106, + 208, + 505, + 220 + ], + "score": 1.0, + "content": "landscape of the objective function. Conversely in our algorithm, as the noise gets larger gradient", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 218, + 433, + 231 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 433, + 231 + ], + "score": 1.0, + "content": "descent minimizes a simpler (e.g. convex) but still meaningful objective function.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 234, + 505, + 289 + ], + "lines": [ + { + "bbox": [ + 106, + 234, + 506, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 506, + 246 + ], + "score": 1.0, + "content": "We define the desired behavior of the network in the limit cases where the noise is very large or", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "score": 1.0, + "content": "very small, and modify the model architecture accordingly. Specifically, during training we minimize", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 254, + 504, + 271 + ], + "spans": [ + { + "bbox": [ + 104, + 254, + 318, + 271 + ], + "score": 1.0, + "content": "a sequence of increasingly complex noisy objectives", + "type": "text" + }, + { + "bbox": [ + 319, + 255, + 504, + 269 + ], + "score": 0.91, + "content": "\\bar { \\mathrm { L } } = ( \\bar { \\mathcal { L } } ^ { 1 } ( \\pmb { \\theta } ; \\xi _ { \\sigma _ { 1 } } ) , \\bar { \\mathcal { L } } ^ { 2 } ( \\pmb { \\theta } ; \\xi _ { \\sigma _ { 2 } } ) , \\cdots , \\bar { \\mathcal { L } } ^ { k } ( \\pmb { \\theta } ; \\xi _ { \\sigma _ { k } } ) )", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 267, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 106, + 267, + 360, + 279 + ], + "score": 1.0, + "content": "that we obtain by annealing the scale (variance) of the noise", + "type": "text" + }, + { + "bbox": [ + 361, + 269, + 371, + 278 + ], + "score": 0.85, + "content": "\\sigma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 267, + 505, + 279 + ], + "score": 1.0, + "content": ". Let us note that our algorithm", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 277, + 507, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 507, + 289 + ], + "score": 1.0, + "content": "satisfies the fundamental properties of the generalized and noisy mollifiers that we introduced earlier.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 107, + 293, + 504, + 315 + ], + "lines": [ + { + "bbox": [ + 105, + 291, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 505, + 307 + ], + "score": 1.0, + "content": "We use a noisy mollifier based on our definition in Section 2.4. Instead of convolving the objective", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 303, + 200, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 200, + 316 + ], + "score": 1.0, + "content": "function with a kernel:", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 107, + 322, + 506, + 397 + ], + "lines": [ + { + "bbox": [ + 106, + 321, + 506, + 336 + ], + "spans": [ + { + "bbox": [ + 106, + 321, + 506, + 336 + ], + "score": 1.0, + "content": "1. We start the training by optimizing a convex objective function that is obtained by configuring", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 117, + 332, + 505, + 346 + ], + "spans": [ + { + "bbox": [ + 117, + 332, + 505, + 346 + ], + "score": 1.0, + "content": "all the layers between the input and the last cost layer to compute an identity function, i.e., by", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 119, + 344, + 448, + 355 + ], + "spans": [ + { + "bbox": [ + 119, + 344, + 448, + 355 + ], + "score": 1.0, + "content": "skipping both the affine transformations and the blocks followed by nonlinearities.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 353, + 506, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 393, + 367 + ], + "score": 1.0, + "content": "2. During training, the magnitude of noise which is proportional to", + "type": "text" + }, + { + "bbox": [ + 393, + 356, + 401, + 365 + ], + "score": 0.79, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 353, + 506, + 367 + ], + "score": 1.0, + "content": "is annealed, allowing to", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 117, + 364, + 487, + 377 + ], + "spans": [ + { + "bbox": [ + 117, + 364, + 487, + 377 + ], + "score": 1.0, + "content": "gradually evolve from identity transformations to linear transformations between the layers.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 374, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 261, + 388 + ], + "score": 1.0, + "content": "3. Simultaneously, as we decrease the", + "type": "text" + }, + { + "bbox": [ + 262, + 376, + 268, + 386 + ], + "score": 0.77, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 374, + 505, + 388 + ], + "score": 1.0, + "content": ", the noisy mollification procedure allows the element-wise", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 118, + 385, + 392, + 398 + ], + "spans": [ + { + "bbox": [ + 118, + 385, + 392, + 398 + ], + "score": 1.0, + "content": "activation functions to gradually change from linear to be nonlinear.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21 + }, + { + "type": "title", + "bbox": [ + 106, + 415, + 502, + 428 + ], + "lines": [ + { + "bbox": [ + 105, + 414, + 504, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 504, + 428 + ], + "score": 1.0, + "content": "4 SIMPLIFYING THE OBJECTIVE FUNCTION FOR FEEDFORWARD NETWORKS", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 439, + 505, + 486 + ], + "lines": [ + { + "bbox": [ + 105, + 439, + 506, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 439, + 506, + 452 + ], + "score": 1.0, + "content": "For every unit of each layer, we either copy the activation (output) of the corresponding unit of", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 451, + 506, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 428, + 464 + ], + "score": 1.0, + "content": "the previous layer (the identity path in Figure 2) or output a noisy activation", + "type": "text" + }, + { + "bbox": [ + 428, + 451, + 439, + 462 + ], + "score": 0.86, + "content": "\\tilde { \\mathbf { h } } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 452, + 506, + 464 + ], + "score": 1.0, + "content": "of a non-linear", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 462, + 506, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 188, + 477 + ], + "score": 1.0, + "content": "transformation of it", + "type": "text" + }, + { + "bbox": [ + 189, + 463, + 252, + 476 + ], + "score": 0.91, + "content": "\\psi ( \\mathbf { h } ^ { l - 1 } , \\boldsymbol { \\xi } ; \\bar { \\mathbf { W } } ^ { l } )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 462, + 283, + 477 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 284, + 464, + 291, + 475 + ], + "score": 0.83, + "content": "\\boldsymbol { \\xi }", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 462, + 327, + 477 + ], + "score": 1.0, + "content": "is noise,", + "type": "text" + }, + { + "bbox": [ + 327, + 463, + 344, + 474 + ], + "score": 0.85, + "content": "\\bar { \\mathbf { W } } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 344, + 462, + 465, + 477 + ], + "score": 1.0, + "content": "is a weight matrix applied on", + "type": "text" + }, + { + "bbox": [ + 466, + 463, + 486, + 474 + ], + "score": 0.89, + "content": "\\mathbf { h } ^ { l - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 462, + 506, + 477 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 107, + 474, + 437, + 487 + ], + "spans": [ + { + "bbox": [ + 107, + 476, + 115, + 484 + ], + "score": 0.74, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 474, + 437, + 487 + ], + "score": 1.0, + "content": "is a vector of binary decisions for each unit (the convolutional path in Figure 2):", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27.5 + }, + { + "type": "interline_equation", + "bbox": [ + 203, + 490, + 408, + 542 + ], + "lines": [ + { + "bbox": [ + 203, + 490, + 408, + 542 + ], + "spans": [ + { + "bbox": [ + 203, + 490, + 408, + 542 + ], + "score": 0.93, + "content": "\\begin{array} { c } { { \\tilde { \\mathbf { h } } ^ { l } = \\psi ( \\mathbf { h } ^ { l - 1 } , \\pmb { \\xi } ; \\mathbf { W } ^ { l } ) } } \\\\ { { \\phi ( \\mathbf { h } ^ { l - 1 } , \\pmb { \\xi } , \\pi ^ { l } ; \\mathbf { W } ^ { l } ) = \\pi ^ { l } \\odot \\mathbf { h } ^ { l - 1 } + ( 1 - \\pi ^ { l } ) \\odot \\tilde { \\mathbf { h } ^ { l } } } } \\\\ { { \\mathbf { h } ^ { l } = \\phi ( \\mathbf { h } ^ { l - 1 } , \\pmb { \\xi } , \\pi ^ { l } ; \\mathbf { W } ^ { l } ) . } } \\end{array}", + "type": "interline_equation", + "image_path": "f21a43fb99383f5278852be96b53c872f13a827906bda544c48a7da869cdc95d.jpg" + } + ] + } + ], + "index": 31.5, + "virtual_lines": [ + { + "bbox": [ + 203, + 490, + 408, + 503.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 203, + 503.0, + 408, + 516.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 203, + 516.0, + 408, + 529.0 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 203, + 529.0, + 408, + 542.0 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 551, + 506, + 575 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 505, + 565 + ], + "score": 1.0, + "content": "To decide which path to take, for each unit in the network, a binary stochastic decision is taken by", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 562, + 482, + 575 + ], + "spans": [ + { + "bbox": [ + 106, + 563, + 469, + 575 + ], + "score": 1.0, + "content": "drawing from a Bernoulli distribution with probability dependent on the decaying value of", + "type": "text" + }, + { + "bbox": [ + 469, + 562, + 478, + 575 + ], + "score": 0.88, + "content": "p ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 563, + 482, + 575 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5 + }, + { + "type": "interline_equation", + "bbox": [ + 264, + 580, + 347, + 595 + ], + "lines": [ + { + "bbox": [ + 264, + 580, + 347, + 595 + ], + "spans": [ + { + "bbox": [ + 264, + 580, + 347, + 595 + ], + "score": 0.91, + "content": "\\pi ^ { l } \\sim \\mathrm { B e r n o u l l i } ( p ^ { l } )", + "type": "interline_equation", + "image_path": "7d1bc2e0c9726684620e03af7856caaf1e0bee00ac936e8579f2a39c0be868b8.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 264, + 580, + 347, + 595 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 606, + 505, + 629 + ], + "lines": [ + { + "bbox": [ + 105, + 606, + 506, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 606, + 253, + 619 + ], + "score": 1.0, + "content": "If the number of hidden units of layer", + "type": "text" + }, + { + "bbox": [ + 253, + 607, + 272, + 617 + ], + "score": 0.77, + "content": "l - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 606, + 311, + 619 + ], + "score": 1.0, + "content": "and layer", + "type": "text" + }, + { + "bbox": [ + 311, + 607, + 330, + 617 + ], + "score": 0.87, + "content": "l + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 606, + 506, + 619 + ], + "score": 1.0, + "content": "is not the same, we can either zero-pad layer", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 107, + 616, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 107, + 617, + 126, + 627 + ], + "score": 0.83, + "content": "l - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 616, + 506, + 630 + ], + "score": 1.0, + "content": "before feeding it into the next layer or apply a linear projection to obtain the right dimensionality.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 107, + 634, + 505, + 666 + ], + "lines": [ + { + "bbox": [ + 105, + 633, + 505, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 123, + 648 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 123, + 633, + 152, + 646 + ], + "score": 0.91, + "content": "p ^ { l } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 633, + 459, + 648 + ], + "score": 1.0, + "content": ", the layer computes the identity function leading to a convex objective. If", + "type": "text" + }, + { + "bbox": [ + 460, + 633, + 489, + 646 + ], + "score": 0.91, + "content": "p ^ { l } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 633, + 505, + 648 + ], + "score": 1.0, + "content": "the", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 645, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 645, + 505, + 657 + ], + "score": 1.0, + "content": "layer computes the original non-linear transformation unfolding the full capacity of the model. We", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 655, + 492, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 492, + 668 + ], + "score": 1.0, + "content": "call the connections that are introduced this way as unitwise stochastic skip connections(USSC).", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 107, + 671, + 505, + 716 + ], + "lines": [ + { + "bbox": [ + 105, + 672, + 505, + 685 + ], + "spans": [ + { + "bbox": [ + 105, + 672, + 505, + 685 + ], + "score": 1.0, + "content": "In DropIn layers (Smith et al., 2016) a binary random vector is sampled from a Bernoulli distribution", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 682, + 505, + 694 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 398, + 694 + ], + "score": 1.0, + "content": "to decide whether to introduce skip a connection from the layer below", + "type": "text" + }, + { + "bbox": [ + 398, + 683, + 421, + 693 + ], + "score": 0.86, + "content": "l - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 682, + 481, + 694 + ], + "score": 1.0, + "content": "for each layer", + "type": "text" + }, + { + "bbox": [ + 482, + 683, + 487, + 692 + ], + "score": 0.57, + "content": "l", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 682, + 505, + 694 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 693, + 506, + 705 + ], + "spans": [ + { + "bbox": [ + 106, + 693, + 506, + 705 + ], + "score": 1.0, + "content": "they use this as a regularization. As opposed to the USSC, DropIn layers do not necessarily do not", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 703, + 434, + 717 + ], + "spans": [ + { + "bbox": [ + 105, + 704, + 375, + 717 + ], + "score": 1.0, + "content": "necessarily achieve a convex objective function as the DropIn ratio", + "type": "text" + }, + { + "bbox": [ + 375, + 703, + 391, + 716 + ], + "score": 0.86, + "content": "( \\hat { p ^ { l } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 704, + 434, + 717 + ], + "score": 1.0, + "content": "increases.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43.5 + }, + { + "type": "text", + "bbox": [ + 106, + 720, + 397, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 718, + 398, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 718, + 398, + 734 + ], + "score": 1.0, + "content": "The pseudo-code for the mollified activations is reported in Algorithm 1.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 46 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 763 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 136 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "Shaping the cost function to define a sequence of costs that are progressing from easier to more", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 505, + 105 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 316, + 105 + ], + "score": 1.0, + "content": "difficult ones can be related to the reward shaping", + "type": "text" + }, + { + "bbox": [ + 316, + 93, + 331, + 104 + ], + "score": 0.52, + "content": "\\mathrm { N g }", + "type": "inline_equation" + }, + { + "bbox": [ + 332, + 92, + 383, + 105 + ], + "score": 1.0, + "content": "et al., 1999;", + "type": "text" + }, + { + "bbox": [ + 383, + 93, + 397, + 105 + ], + "score": 0.25, + "content": "\\bar { \\bf N } \\mathrm { \\bf g }", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 92, + 505, + 105 + ], + "score": 1.0, + "content": ", 2003) algorithms. In our", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 103, + 506, + 116 + ], + "spans": [ + { + "bbox": [ + 105, + 103, + 506, + 116 + ], + "score": 1.0, + "content": "algorithm, we shape the cost and the model architecture itself, rather than rewards or the targets", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 114, + 505, + 126 + ], + "spans": [ + { + "bbox": [ + 106, + 114, + 505, + 126 + ], + "score": 1.0, + "content": "in order to make the optimization easier. In that sense, reward shaping can be considered to be more", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 123, + 227, + 138 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 227, + 138 + ], + "score": 1.0, + "content": "closer to curriculum learning.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 82, + 506, + 138 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 151, + 173, + 164 + ], + "lines": [ + { + "bbox": [ + 105, + 149, + 174, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 174, + 167 + ], + "score": 1.0, + "content": "3 METHOD", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 176, + 505, + 230 + ], + "lines": [ + { + "bbox": [ + 106, + 176, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 106, + 176, + 505, + 189 + ], + "score": 1.0, + "content": "We propose an algorithm to mollify the cost of a neural network which also addresses an important", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "score": 1.0, + "content": "drawback of the previously proposed noisy training procedures: as the noise gets larger, it can", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 195, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 505, + 212 + ], + "score": 1.0, + "content": "dominate the learning process and lead the algorithm to perform a random walk on the energy", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 208, + 505, + 220 + ], + "spans": [ + { + "bbox": [ + 106, + 208, + 505, + 220 + ], + "score": 1.0, + "content": "landscape of the objective function. Conversely in our algorithm, as the noise gets larger gradient", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 218, + 433, + 231 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 433, + 231 + ], + "score": 1.0, + "content": "descent minimizes a simpler (e.g. convex) but still meaningful objective function.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 176, + 505, + 231 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 234, + 505, + 289 + ], + "lines": [ + { + "bbox": [ + 106, + 234, + 506, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 506, + 246 + ], + "score": 1.0, + "content": "We define the desired behavior of the network in the limit cases where the noise is very large or", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "score": 1.0, + "content": "very small, and modify the model architecture accordingly. Specifically, during training we minimize", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 254, + 504, + 271 + ], + "spans": [ + { + "bbox": [ + 104, + 254, + 318, + 271 + ], + "score": 1.0, + "content": "a sequence of increasingly complex noisy objectives", + "type": "text" + }, + { + "bbox": [ + 319, + 255, + 504, + 269 + ], + "score": 0.91, + "content": "\\bar { \\mathrm { L } } = ( \\bar { \\mathcal { L } } ^ { 1 } ( \\pmb { \\theta } ; \\xi _ { \\sigma _ { 1 } } ) , \\bar { \\mathcal { L } } ^ { 2 } ( \\pmb { \\theta } ; \\xi _ { \\sigma _ { 2 } } ) , \\cdots , \\bar { \\mathcal { L } } ^ { k } ( \\pmb { \\theta } ; \\xi _ { \\sigma _ { k } } ) )", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 267, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 106, + 267, + 360, + 279 + ], + "score": 1.0, + "content": "that we obtain by annealing the scale (variance) of the noise", + "type": "text" + }, + { + "bbox": [ + 361, + 269, + 371, + 278 + ], + "score": 0.85, + "content": "\\sigma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 267, + 505, + 279 + ], + "score": 1.0, + "content": ". Let us note that our algorithm", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 277, + 507, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 507, + 289 + ], + "score": 1.0, + "content": "satisfies the fundamental properties of the generalized and noisy mollifiers that we introduced earlier.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13, + "bbox_fs": [ + 104, + 234, + 507, + 289 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 293, + 504, + 315 + ], + "lines": [ + { + "bbox": [ + 105, + 291, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 505, + 307 + ], + "score": 1.0, + "content": "We use a noisy mollifier based on our definition in Section 2.4. Instead of convolving the objective", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 303, + 200, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 200, + 316 + ], + "score": 1.0, + "content": "function with a kernel:", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5, + "bbox_fs": [ + 105, + 291, + 505, + 316 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 322, + 506, + 397 + ], + "lines": [ + { + "bbox": [ + 106, + 321, + 506, + 336 + ], + "spans": [ + { + "bbox": [ + 106, + 321, + 506, + 336 + ], + "score": 1.0, + "content": "1. We start the training by optimizing a convex objective function that is obtained by configuring", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 117, + 332, + 505, + 346 + ], + "spans": [ + { + "bbox": [ + 117, + 332, + 505, + 346 + ], + "score": 1.0, + "content": "all the layers between the input and the last cost layer to compute an identity function, i.e., by", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 119, + 344, + 448, + 355 + ], + "spans": [ + { + "bbox": [ + 119, + 344, + 448, + 355 + ], + "score": 1.0, + "content": "skipping both the affine transformations and the blocks followed by nonlinearities.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 353, + 506, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 393, + 367 + ], + "score": 1.0, + "content": "2. During training, the magnitude of noise which is proportional to", + "type": "text" + }, + { + "bbox": [ + 393, + 356, + 401, + 365 + ], + "score": 0.79, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 353, + 506, + 367 + ], + "score": 1.0, + "content": "is annealed, allowing to", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 117, + 364, + 487, + 377 + ], + "spans": [ + { + "bbox": [ + 117, + 364, + 487, + 377 + ], + "score": 1.0, + "content": "gradually evolve from identity transformations to linear transformations between the layers.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 374, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 261, + 388 + ], + "score": 1.0, + "content": "3. Simultaneously, as we decrease the", + "type": "text" + }, + { + "bbox": [ + 262, + 376, + 268, + 386 + ], + "score": 0.77, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 374, + 505, + 388 + ], + "score": 1.0, + "content": ", the noisy mollification procedure allows the element-wise", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 118, + 385, + 392, + 398 + ], + "spans": [ + { + "bbox": [ + 118, + 385, + 392, + 398 + ], + "score": 1.0, + "content": "activation functions to gradually change from linear to be nonlinear.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 321, + 506, + 398 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 415, + 502, + 428 + ], + "lines": [ + { + "bbox": [ + 105, + 414, + 504, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 504, + 428 + ], + "score": 1.0, + "content": "4 SIMPLIFYING THE OBJECTIVE FUNCTION FOR FEEDFORWARD NETWORKS", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 439, + 505, + 486 + ], + "lines": [ + { + "bbox": [ + 105, + 439, + 506, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 439, + 506, + 452 + ], + "score": 1.0, + "content": "For every unit of each layer, we either copy the activation (output) of the corresponding unit of", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 451, + 506, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 428, + 464 + ], + "score": 1.0, + "content": "the previous layer (the identity path in Figure 2) or output a noisy activation", + "type": "text" + }, + { + "bbox": [ + 428, + 451, + 439, + 462 + ], + "score": 0.86, + "content": "\\tilde { \\mathbf { h } } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 452, + 506, + 464 + ], + "score": 1.0, + "content": "of a non-linear", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 462, + 506, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 188, + 477 + ], + "score": 1.0, + "content": "transformation of it", + "type": "text" + }, + { + "bbox": [ + 189, + 463, + 252, + 476 + ], + "score": 0.91, + "content": "\\psi ( \\mathbf { h } ^ { l - 1 } , \\boldsymbol { \\xi } ; \\bar { \\mathbf { W } } ^ { l } )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 462, + 283, + 477 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 284, + 464, + 291, + 475 + ], + "score": 0.83, + "content": "\\boldsymbol { \\xi }", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 462, + 327, + 477 + ], + "score": 1.0, + "content": "is noise,", + "type": "text" + }, + { + "bbox": [ + 327, + 463, + 344, + 474 + ], + "score": 0.85, + "content": "\\bar { \\mathbf { W } } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 344, + 462, + 465, + 477 + ], + "score": 1.0, + "content": "is a weight matrix applied on", + "type": "text" + }, + { + "bbox": [ + 466, + 463, + 486, + 474 + ], + "score": 0.89, + "content": "\\mathbf { h } ^ { l - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 462, + 506, + 477 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 107, + 474, + 437, + 487 + ], + "spans": [ + { + "bbox": [ + 107, + 476, + 115, + 484 + ], + "score": 0.74, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 474, + 437, + 487 + ], + "score": 1.0, + "content": "is a vector of binary decisions for each unit (the convolutional path in Figure 2):", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 439, + 506, + 487 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 203, + 490, + 408, + 542 + ], + "lines": [ + { + "bbox": [ + 203, + 490, + 408, + 542 + ], + "spans": [ + { + "bbox": [ + 203, + 490, + 408, + 542 + ], + "score": 0.93, + "content": "\\begin{array} { c } { { \\tilde { \\mathbf { h } } ^ { l } = \\psi ( \\mathbf { h } ^ { l - 1 } , \\pmb { \\xi } ; \\mathbf { W } ^ { l } ) } } \\\\ { { \\phi ( \\mathbf { h } ^ { l - 1 } , \\pmb { \\xi } , \\pi ^ { l } ; \\mathbf { W } ^ { l } ) = \\pi ^ { l } \\odot \\mathbf { h } ^ { l - 1 } + ( 1 - \\pi ^ { l } ) \\odot \\tilde { \\mathbf { h } ^ { l } } } } \\\\ { { \\mathbf { h } ^ { l } = \\phi ( \\mathbf { h } ^ { l - 1 } , \\pmb { \\xi } , \\pi ^ { l } ; \\mathbf { W } ^ { l } ) . } } \\end{array}", + "type": "interline_equation", + "image_path": "f21a43fb99383f5278852be96b53c872f13a827906bda544c48a7da869cdc95d.jpg" + } + ] + } + ], + "index": 31.5, + "virtual_lines": [ + { + "bbox": [ + 203, + 490, + 408, + 503.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 203, + 503.0, + 408, + 516.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 203, + 516.0, + 408, + 529.0 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 203, + 529.0, + 408, + 542.0 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 551, + 506, + 575 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 505, + 565 + ], + "score": 1.0, + "content": "To decide which path to take, for each unit in the network, a binary stochastic decision is taken by", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 562, + 482, + 575 + ], + "spans": [ + { + "bbox": [ + 106, + 563, + 469, + 575 + ], + "score": 1.0, + "content": "drawing from a Bernoulli distribution with probability dependent on the decaying value of", + "type": "text" + }, + { + "bbox": [ + 469, + 562, + 478, + 575 + ], + "score": 0.88, + "content": "p ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 563, + 482, + 575 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5, + "bbox_fs": [ + 105, + 549, + 505, + 575 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 264, + 580, + 347, + 595 + ], + "lines": [ + { + "bbox": [ + 264, + 580, + 347, + 595 + ], + "spans": [ + { + "bbox": [ + 264, + 580, + 347, + 595 + ], + "score": 0.91, + "content": "\\pi ^ { l } \\sim \\mathrm { B e r n o u l l i } ( p ^ { l } )", + "type": "interline_equation", + "image_path": "7d1bc2e0c9726684620e03af7856caaf1e0bee00ac936e8579f2a39c0be868b8.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 264, + 580, + 347, + 595 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 606, + 505, + 629 + ], + "lines": [ + { + "bbox": [ + 105, + 606, + 506, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 606, + 253, + 619 + ], + "score": 1.0, + "content": "If the number of hidden units of layer", + "type": "text" + }, + { + "bbox": [ + 253, + 607, + 272, + 617 + ], + "score": 0.77, + "content": "l - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 606, + 311, + 619 + ], + "score": 1.0, + "content": "and layer", + "type": "text" + }, + { + "bbox": [ + 311, + 607, + 330, + 617 + ], + "score": 0.87, + "content": "l + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 606, + 506, + 619 + ], + "score": 1.0, + "content": "is not the same, we can either zero-pad layer", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 107, + 616, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 107, + 617, + 126, + 627 + ], + "score": 0.83, + "content": "l - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 616, + 506, + 630 + ], + "score": 1.0, + "content": "before feeding it into the next layer or apply a linear projection to obtain the right dimensionality.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 606, + 506, + 630 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 634, + 505, + 666 + ], + "lines": [ + { + "bbox": [ + 105, + 633, + 505, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 123, + 648 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 123, + 633, + 152, + 646 + ], + "score": 0.91, + "content": "p ^ { l } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 633, + 459, + 648 + ], + "score": 1.0, + "content": ", the layer computes the identity function leading to a convex objective. If", + "type": "text" + }, + { + "bbox": [ + 460, + 633, + 489, + 646 + ], + "score": 0.91, + "content": "p ^ { l } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 633, + 505, + 648 + ], + "score": 1.0, + "content": "the", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 645, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 645, + 505, + 657 + ], + "score": 1.0, + "content": "layer computes the original non-linear transformation unfolding the full capacity of the model. We", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 655, + 492, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 492, + 668 + ], + "score": 1.0, + "content": "call the connections that are introduced this way as unitwise stochastic skip connections(USSC).", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 633, + 505, + 668 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 671, + 505, + 716 + ], + "lines": [ + { + "bbox": [ + 105, + 672, + 505, + 685 + ], + "spans": [ + { + "bbox": [ + 105, + 672, + 505, + 685 + ], + "score": 1.0, + "content": "In DropIn layers (Smith et al., 2016) a binary random vector is sampled from a Bernoulli distribution", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 682, + 505, + 694 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 398, + 694 + ], + "score": 1.0, + "content": "to decide whether to introduce skip a connection from the layer below", + "type": "text" + }, + { + "bbox": [ + 398, + 683, + 421, + 693 + ], + "score": 0.86, + "content": "l - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 682, + 481, + 694 + ], + "score": 1.0, + "content": "for each layer", + "type": "text" + }, + { + "bbox": [ + 482, + 683, + 487, + 692 + ], + "score": 0.57, + "content": "l", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 682, + 505, + 694 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 693, + 506, + 705 + ], + "spans": [ + { + "bbox": [ + 106, + 693, + 506, + 705 + ], + "score": 1.0, + "content": "they use this as a regularization. As opposed to the USSC, DropIn layers do not necessarily do not", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 703, + 434, + 717 + ], + "spans": [ + { + "bbox": [ + 105, + 704, + 375, + 717 + ], + "score": 1.0, + "content": "necessarily achieve a convex objective function as the DropIn ratio", + "type": "text" + }, + { + "bbox": [ + 375, + 703, + 391, + 716 + ], + "score": 0.86, + "content": "( \\hat { p ^ { l } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 704, + 434, + 717 + ], + "score": 1.0, + "content": "increases.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43.5, + "bbox_fs": [ + 105, + 672, + 506, + 717 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 720, + 397, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 718, + 398, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 718, + 398, + 734 + ], + "score": 1.0, + "content": "The pseudo-code for the mollified activations is reported in Algorithm 1.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 46, + "bbox_fs": [ + 105, + 718, + 398, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 123, + 80, + 486, + 234 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 123, + 80, + 486, + 234 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 123, + 80, + 486, + 234 + ], + "spans": [ + { + "bbox": [ + 123, + 80, + 486, + 234 + ], + "score": 0.973, + "type": "image", + "image_path": "80eecd4ac991add0cb642b20c46377ca05f8af859e791101be6113b09d06839f.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 123, + 80, + 486, + 131.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 123, + 131.33333333333334, + 486, + 182.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 123, + 182.66666666666669, + 486, + 234.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 242, + 506, + 296 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 243, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 106, + 243, + 505, + 254 + ], + "score": 1.0, + "content": "Figure 2: Top: Stochastic depth. Bottom: mollifying network. The dashed line represents the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 253, + 506, + 265 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 506, + 265 + ], + "score": 1.0, + "content": "optional residual connection. In the top path, the input is processed with a convolutional block", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 263, + 506, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 263, + 506, + 276 + ], + "score": 1.0, + "content": "followed by a noisy activation function, while in the bottom path the original activation of the layer", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 272, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 106, + 274, + 128, + 284 + ], + "score": 0.86, + "content": "l - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 128, + 272, + 506, + 288 + ], + "score": 1.0, + "content": "is propagated untouched. For each unit, one of the two paths in picked according to a binary", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 285, + 196, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 184, + 297 + ], + "score": 1.0, + "content": "stochastic decision", + "type": "text" + }, + { + "bbox": [ + 184, + 287, + 192, + 294 + ], + "score": 0.68, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 285, + 196, + 297 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "title", + "bbox": [ + 108, + 310, + 284, + 322 + ], + "lines": [ + { + "bbox": [ + 106, + 309, + 282, + 324 + ], + "spans": [ + { + "bbox": [ + 106, + 309, + 240, + 324 + ], + "score": 1.0, + "content": "Algorithm 1 Activation of a unit", + "type": "text" + }, + { + "bbox": [ + 240, + 312, + 245, + 320 + ], + "score": 0.68, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 309, + 278, + 324 + ], + "score": 1.0, + "content": "at layer", + "type": "text" + }, + { + "bbox": [ + 278, + 311, + 282, + 320 + ], + "score": 0.43, + "content": "l", + "type": "inline_equation" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 109, + 324, + 505, + 434 + ], + "lines": [ + { + "bbox": [ + 110, + 323, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 110, + 324, + 123, + 338 + ], + "score": 1.0, + "content": "1:", + "type": "text" + }, + { + "bbox": [ + 123, + 325, + 204, + 337 + ], + "score": 0.71, + "content": "x _ { i } \\gets \\mathbf { w } _ { i } ^ { \\top } \\mathbf { h } ^ { l - 1 } + b _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 323, + 506, + 337 + ], + "score": 1.0, + "content": ". an affine transformation of hl−1", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 110, + 335, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 110, + 335, + 124, + 348 + ], + "score": 1.0, + "content": "2:", + "type": "text" + }, + { + "bbox": [ + 124, + 337, + 206, + 348 + ], + "score": 0.73, + "content": "\\Delta _ { i } \\gets \\mathbf { u } ( x _ { i } ) - \\mathbf { f } ( x _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 336, + 357, + 347 + ], + "score": 0.64, + "content": "\\mathsf { D } \\Delta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 335, + 505, + 347 + ], + "score": 1.0, + "content": "is a measure of a saturation of a unit", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 109, + 346, + 504, + 360 + ], + "spans": [ + { + "bbox": [ + 109, + 346, + 124, + 360 + ], + "score": 1.0, + "content": "3:", + "type": "text" + }, + { + "bbox": [ + 124, + 348, + 260, + 359 + ], + "score": 0.8, + "content": "\\sigma ( x _ { i } ) \\gets ( \\mathrm { s i g m o i d } ( a _ { i } \\Delta _ { i } ) - 0 . 5 ) ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 346, + 491, + 360 + ], + "score": 1.0, + "content": ". std of the injected noise depends on", + "type": "text" + }, + { + "bbox": [ + 491, + 348, + 504, + 358 + ], + "score": 0.88, + "content": "\\Delta _ { i }", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 111, + 358, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 111, + 358, + 123, + 370 + ], + "score": 1.0, + "content": "4:", + "type": "text" + }, + { + "bbox": [ + 124, + 359, + 180, + 370 + ], + "score": 0.86, + "content": "\\xi _ { i } \\sim \\mathcal { N } ( 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 358, + 505, + 369 + ], + "score": 1.0, + "content": ". sampling the noise from a basic Normal distribution", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 109, + 369, + 504, + 383 + ], + "spans": [ + { + "bbox": [ + 109, + 369, + 123, + 383 + ], + "score": 1.0, + "content": "5:", + "type": "text" + }, + { + "bbox": [ + 124, + 370, + 204, + 381 + ], + "score": 0.83, + "content": "s _ { i } \\gets p ^ { l } c \\sigma ( x _ { i } ) | \\xi _ { i } |", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 369, + 384, + 382 + ], + "score": 1.0, + "content": ". Half-Normal noise controlled by", + "type": "text" + }, + { + "bbox": [ + 385, + 370, + 408, + 381 + ], + "score": 0.89, + "content": "\\sigma ( x _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 369, + 439, + 382 + ], + "score": 1.0, + "content": ", const.", + "type": "text" + }, + { + "bbox": [ + 439, + 372, + 445, + 380 + ], + "score": 0.73, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 369, + 494, + 382 + ], + "score": 1.0, + "content": "and prob-ty", + "type": "text" + }, + { + "bbox": [ + 495, + 369, + 504, + 381 + ], + "score": 0.85, + "content": "p ^ { l }", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 109, + 379, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 109, + 379, + 124, + 393 + ], + "score": 1.0, + "content": "6:", + "type": "text" + }, + { + "bbox": [ + 124, + 381, + 276, + 392 + ], + "score": 0.87, + "content": "\\psi ( x _ { i } , \\xi _ { i } ) \\gets \\mathrm { s g n } ( \\mathbf { u } ^ { * } ( x _ { i } ) ) \\mathrm { m i n } ( | \\mathbf { u } ^ { * } ( x _ { i } ) |", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 379, + 281, + 393 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 281, + 380, + 424, + 392 + ], + "score": 0.85, + "content": "| \\mathbf { f } ^ { * } ( x _ { i } ) + \\mathrm { s g n } ( \\mathbf { u } ^ { * } ( x _ { i } ) ) | \\hat { s _ { i } } | | ) + \\bar { \\mathbf { u } } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 382, + 439, + 391 + ], + "score": 0.53, + "content": "\\triangleright", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 379, + 506, + 393 + ], + "score": 1.0, + "content": "noisy activation", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 109, + 390, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 109, + 390, + 124, + 405 + ], + "score": 1.0, + "content": "7:", + "type": "text" + }, + { + "bbox": [ + 124, + 393, + 237, + 404 + ], + "score": 0.71, + "content": "\\pi _ { i } ^ { l } \\sim { \\bf B e r n o u l l i } ( p ^ { l } ) \\qquad \\triangleright p ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 391, + 505, + 405 + ], + "score": 1.0, + "content": "controls the variance of the noise AND the prob of skipping a unit", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 109, + 402, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 109, + 402, + 123, + 419 + ], + "score": 1.0, + "content": "8:", + "type": "text" + }, + { + "bbox": [ + 124, + 405, + 182, + 417 + ], + "score": 0.86, + "content": "\\ddot { h } _ { i } ^ { l } = \\psi ( x _ { i } , \\xi _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 404, + 371, + 417 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 371, + 403, + 382, + 417 + ], + "score": 0.82, + "content": "\\tilde { h } _ { i } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 404, + 505, + 417 + ], + "score": 1.0, + "content": "is a noisy activation candidate", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 109, + 415, + 504, + 431 + ], + "spans": [ + { + "bbox": [ + 109, + 415, + 123, + 431 + ], + "score": 1.0, + "content": "9:", + "type": "text" + }, + { + "bbox": [ + 124, + 417, + 297, + 430 + ], + "score": 0.8, + "content": "\\phi ( \\mathbf { h } ^ { l - 1 } , \\xi _ { i } , \\pi _ { i } ^ { l } ; \\mathbf { w } _ { i } ) = \\pi _ { i } ^ { l } h _ { i } ^ { l - 1 } + ( 1 - \\pi _ { i } ^ { l } ) \\tilde { h } _ { i } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 415, + 455, + 431 + ], + "score": 1.0, + "content": ". make a HARD decision between", + "type": "text" + }, + { + "bbox": [ + 455, + 416, + 475, + 430 + ], + "score": 0.92, + "content": "h _ { i } ^ { l - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 415, + 493, + 431 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 494, + 416, + 504, + 430 + ], + "score": 0.87, + "content": "\\tilde { h } _ { i } ^ { l }", + "type": "inline_equation" + } + ], + "index": 17 + } + ], + "index": 13 + }, + { + "type": "title", + "bbox": [ + 108, + 455, + 273, + 467 + ], + "lines": [ + { + "bbox": [ + 105, + 454, + 275, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 275, + 470 + ], + "score": 1.0, + "content": "5 LINEARIZING THE NETWORK", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 106, + 478, + 504, + 511 + ], + "lines": [ + { + "bbox": [ + 105, + 478, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 505, + 491 + ], + "score": 1.0, + "content": "In Section 2, we show that convolving the objective function with a particular kernel can be", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 489, + 506, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 506, + 502 + ], + "score": 1.0, + "content": "approximated by adding noise to the activation function. This method may suffer from excessive", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 500, + 303, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 303, + 513 + ], + "score": 1.0, + "content": "random exploration when the noise is very large.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 516, + 504, + 549 + ], + "lines": [ + { + "bbox": [ + 105, + 515, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 423, + 529 + ], + "score": 1.0, + "content": "We address this issue by bounding the element-wise activation function", + "type": "text" + }, + { + "bbox": [ + 423, + 516, + 438, + 528 + ], + "score": 0.74, + "content": "\\operatorname { f } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 515, + 505, + 529 + ], + "score": 1.0, + "content": "with its linear", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 527, + 505, + 539 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 505, + 539 + ], + "score": 1.0, + "content": "approximation when the variance of the noise is very large, after centering it at the origin. The", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 536, + 373, + 550 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 179, + 550 + ], + "score": 1.0, + "content": "resulting function", + "type": "text" + }, + { + "bbox": [ + 180, + 537, + 199, + 549 + ], + "score": 0.88, + "content": "\\mathrm { f } ^ { \\ast } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 536, + 373, + 550 + ], + "score": 1.0, + "content": "is bounded and centered around the origin.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 106, + 553, + 505, + 586 + ], + "lines": [ + { + "bbox": [ + 105, + 552, + 506, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 506, + 567 + ], + "score": 1.0, + "content": "Note that centering the sigmoid or hard-sigmoid will make them symmetric with respect to the origin.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 563, + 506, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 294, + 576 + ], + "score": 1.0, + "content": "With a proper choice of the standard deviation", + "type": "text" + }, + { + "bbox": [ + 294, + 564, + 315, + 576 + ], + "score": 0.92, + "content": "\\sigma ( \\mathbf { h } )", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 563, + 506, + 576 + ], + "score": 1.0, + "content": ", the noisy activation function becomes a linear", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 574, + 365, + 587 + ], + "spans": [ + { + "bbox": [ + 105, + 574, + 214, + 587 + ], + "score": 1.0, + "content": "function of the input when", + "type": "text" + }, + { + "bbox": [ + 214, + 576, + 221, + 586 + ], + "score": 0.35, + "content": "\\mathfrak { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 574, + 365, + 587 + ], + "score": 1.0, + "content": "is large, as illustrated by Figure 10.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 590, + 505, + 615 + ], + "lines": [ + { + "bbox": [ + 105, + 590, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 105, + 590, + 121, + 603 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 122, + 590, + 203, + 603 + ], + "score": 0.92, + "content": "\\mathbf { u } ^ { * } ( x ) = \\mathbf { u } ( x ) - \\mathbf { u } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 590, + 232, + 603 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 232, + 590, + 251, + 603 + ], + "score": 0.82, + "content": "{ \\bf u } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 590, + 435, + 603 + ], + "score": 1.0, + "content": "is the offset of the function from the origin, and", + "type": "text" + }, + { + "bbox": [ + 435, + 592, + 446, + 601 + ], + "score": 0.86, + "content": "x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 590, + 460, + 603 + ], + "score": 1.0, + "content": "the", + "type": "text" + }, + { + "bbox": [ + 460, + 591, + 465, + 600 + ], + "score": 0.76, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 590, + 506, + 603 + ], + "score": 1.0, + "content": "-th dimen-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 600, + 506, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 372, + 616 + ], + "score": 1.0, + "content": "sion of an affine transformation of the output of the previous layer", + "type": "text" + }, + { + "bbox": [ + 372, + 602, + 393, + 613 + ], + "score": 0.88, + "content": "\\mathbf { h } ^ { l - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 600, + 397, + 616 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 397, + 602, + 475, + 615 + ], + "score": 0.92, + "content": "x _ { i } = \\mathbf { w } _ { i } ^ { \\top } \\mathbf { h } ^ { l - 1 } + b _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 600, + 506, + 616 + ], + "score": 1.0, + "content": ". Then:", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "interline_equation", + "bbox": [ + 150, + 628, + 460, + 642 + ], + "lines": [ + { + "bbox": [ + 150, + 628, + 460, + 642 + ], + "spans": [ + { + "bbox": [ + 150, + 628, + 460, + 642 + ], + "score": 0.88, + "content": "\\psi ( x _ { i } , \\xi _ { i } ; \\mathbf { w } _ { i } ) = \\mathrm { s g n } ( \\mathbf { u } ^ { * } ( x _ { i } ) ) \\mathrm { m i n } ( | \\mathbf { u } ^ { * } ( x _ { i } ) | , | \\mathbf { f } ^ { * } ( x _ { i } ) + \\mathrm { s g n } ( \\mathbf { u } ^ { * } ( x _ { i } ) ) | s _ { i } | | ) + \\mathbf { u } ( 0 )", + "type": "interline_equation", + "image_path": "d3ce9f3819bca81dc0de1cfc2bf008e295e1d224a2a62b8c68d791d67d3954c7.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 150, + 628, + 460, + 642 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 644, + 504, + 664 + ], + "lines": [ + { + "bbox": [ + 108, + 642, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 108, + 642, + 505, + 656 + ], + "score": 1.0, + "content": "The noise is sampled from a Normal distribution with mean 0 and whose standard deviation depends", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 654, + 129, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 119, + 667 + ], + "score": 1.0, + "content": "on", + "type": "text" + }, + { + "bbox": [ + 119, + 657, + 124, + 664 + ], + "score": 0.74, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 125, + 654, + 129, + 667 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "interline_equation", + "bbox": [ + 261, + 663, + 351, + 677 + ], + "lines": [ + { + "bbox": [ + 261, + 663, + 351, + 677 + ], + "spans": [ + { + "bbox": [ + 261, + 663, + 351, + 677 + ], + "score": 0.9, + "content": "s _ { i } \\sim \\mathcal { N } ( 0 , p c \\sigma ( x _ { i } ) )", + "type": "interline_equation", + "image_path": "aa8a9b68c9de09337719d7e42d807b4953173f578a18141b7d1cba2668e133e6.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 261, + 663, + 351, + 677 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "title", + "bbox": [ + 106, + 688, + 323, + 701 + ], + "lines": [ + { + "bbox": [ + 105, + 689, + 323, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 323, + 702 + ], + "score": 1.0, + "content": "5.1 LINEARIZING RELU ACTIVATION FUNCTION", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 107, + 708, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "We have a simpler form of the equations to linearize ReLU (Nair & Hinton, 2010) activation function", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 719, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 130, + 734 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 131, + 720, + 165, + 732 + ], + "score": 0.92, + "content": "p ^ { l } \\to \\infty \\quad", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 719, + 505, + 734 + ], + "score": 1.0, + "content": ". Instead of the complicated Eqn. 23. We can use a simpler equation as in Eqn. 26 to", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5 + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 310, + 762 + ], + "score": 1.0, + "content": "6", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 123, + 80, + 486, + 234 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 123, + 80, + 486, + 234 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 123, + 80, + 486, + 234 + ], + "spans": [ + { + "bbox": [ + 123, + 80, + 486, + 234 + ], + "score": 0.973, + "type": "image", + "image_path": "80eecd4ac991add0cb642b20c46377ca05f8af859e791101be6113b09d06839f.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 123, + 80, + 486, + 131.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 123, + 131.33333333333334, + 486, + 182.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 123, + 182.66666666666669, + 486, + 234.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 242, + 506, + 296 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 243, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 106, + 243, + 505, + 254 + ], + "score": 1.0, + "content": "Figure 2: Top: Stochastic depth. Bottom: mollifying network. The dashed line represents the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 253, + 506, + 265 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 506, + 265 + ], + "score": 1.0, + "content": "optional residual connection. In the top path, the input is processed with a convolutional block", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 263, + 506, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 263, + 506, + 276 + ], + "score": 1.0, + "content": "followed by a noisy activation function, while in the bottom path the original activation of the layer", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 272, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 106, + 274, + 128, + 284 + ], + "score": 0.86, + "content": "l - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 128, + 272, + 506, + 288 + ], + "score": 1.0, + "content": "is propagated untouched. For each unit, one of the two paths in picked according to a binary", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 285, + 196, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 184, + 297 + ], + "score": 1.0, + "content": "stochastic decision", + "type": "text" + }, + { + "bbox": [ + 184, + 287, + 192, + 294 + ], + "score": 0.68, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 285, + 196, + 297 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "title", + "bbox": [ + 108, + 310, + 284, + 322 + ], + "lines": [ + { + "bbox": [ + 106, + 309, + 282, + 324 + ], + "spans": [ + { + "bbox": [ + 106, + 309, + 240, + 324 + ], + "score": 1.0, + "content": "Algorithm 1 Activation of a unit", + "type": "text" + }, + { + "bbox": [ + 240, + 312, + 245, + 320 + ], + "score": 0.68, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 309, + 278, + 324 + ], + "score": 1.0, + "content": "at layer", + "type": "text" + }, + { + "bbox": [ + 278, + 311, + 282, + 320 + ], + "score": 0.43, + "content": "l", + "type": "inline_equation" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "index", + "bbox": [ + 109, + 324, + 505, + 434 + ], + "lines": [ + { + "bbox": [ + 110, + 323, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 110, + 324, + 123, + 338 + ], + "score": 1.0, + "content": "1:", + "type": "text" + }, + { + "bbox": [ + 123, + 325, + 204, + 337 + ], + "score": 0.71, + "content": "x _ { i } \\gets \\mathbf { w } _ { i } ^ { \\top } \\mathbf { h } ^ { l - 1 } + b _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 323, + 506, + 337 + ], + "score": 1.0, + "content": ". an affine transformation of hl−1", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 335, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 110, + 335, + 124, + 348 + ], + "score": 1.0, + "content": "2:", + "type": "text" + }, + { + "bbox": [ + 124, + 337, + 206, + 348 + ], + "score": 0.73, + "content": "\\Delta _ { i } \\gets \\mathbf { u } ( x _ { i } ) - \\mathbf { f } ( x _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 336, + 357, + 347 + ], + "score": 0.64, + "content": "\\mathsf { D } \\Delta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 335, + 505, + 347 + ], + "score": 1.0, + "content": "is a measure of a saturation of a unit", + "type": "text" + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 109, + 346, + 504, + 360 + ], + "spans": [ + { + "bbox": [ + 109, + 346, + 124, + 360 + ], + "score": 1.0, + "content": "3:", + "type": "text" + }, + { + "bbox": [ + 124, + 348, + 260, + 359 + ], + "score": 0.8, + "content": "\\sigma ( x _ { i } ) \\gets ( \\mathrm { s i g m o i d } ( a _ { i } \\Delta _ { i } ) - 0 . 5 ) ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 346, + 491, + 360 + ], + "score": 1.0, + "content": ". std of the injected noise depends on", + "type": "text" + }, + { + "bbox": [ + 491, + 348, + 504, + 358 + ], + "score": 0.88, + "content": "\\Delta _ { i }", + "type": "inline_equation" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 111, + 358, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 111, + 358, + 123, + 370 + ], + "score": 1.0, + "content": "4:", + "type": "text" + }, + { + "bbox": [ + 124, + 359, + 180, + 370 + ], + "score": 0.86, + "content": "\\xi _ { i } \\sim \\mathcal { N } ( 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 358, + 505, + 369 + ], + "score": 1.0, + "content": ". sampling the noise from a basic Normal distribution", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 109, + 369, + 504, + 383 + ], + "spans": [ + { + "bbox": [ + 109, + 369, + 123, + 383 + ], + "score": 1.0, + "content": "5:", + "type": "text" + }, + { + "bbox": [ + 124, + 370, + 204, + 381 + ], + "score": 0.83, + "content": "s _ { i } \\gets p ^ { l } c \\sigma ( x _ { i } ) | \\xi _ { i } |", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 369, + 384, + 382 + ], + "score": 1.0, + "content": ". Half-Normal noise controlled by", + "type": "text" + }, + { + "bbox": [ + 385, + 370, + 408, + 381 + ], + "score": 0.89, + "content": "\\sigma ( x _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 369, + 439, + 382 + ], + "score": 1.0, + "content": ", const.", + "type": "text" + }, + { + "bbox": [ + 439, + 372, + 445, + 380 + ], + "score": 0.73, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 369, + 494, + 382 + ], + "score": 1.0, + "content": "and prob-ty", + "type": "text" + }, + { + "bbox": [ + 495, + 369, + 504, + 381 + ], + "score": 0.85, + "content": "p ^ { l }", + "type": "inline_equation" + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 109, + 379, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 109, + 379, + 124, + 393 + ], + "score": 1.0, + "content": "6:", + "type": "text" + }, + { + "bbox": [ + 124, + 381, + 276, + 392 + ], + "score": 0.87, + "content": "\\psi ( x _ { i } , \\xi _ { i } ) \\gets \\mathrm { s g n } ( \\mathbf { u } ^ { * } ( x _ { i } ) ) \\mathrm { m i n } ( | \\mathbf { u } ^ { * } ( x _ { i } ) |", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 379, + 281, + 393 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 281, + 380, + 424, + 392 + ], + "score": 0.85, + "content": "| \\mathbf { f } ^ { * } ( x _ { i } ) + \\mathrm { s g n } ( \\mathbf { u } ^ { * } ( x _ { i } ) ) | \\hat { s _ { i } } | | ) + \\bar { \\mathbf { u } } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 382, + 439, + 391 + ], + "score": 0.53, + "content": "\\triangleright", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 379, + 506, + 393 + ], + "score": 1.0, + "content": "noisy activation", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 109, + 390, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 109, + 390, + 124, + 405 + ], + "score": 1.0, + "content": "7:", + "type": "text" + }, + { + "bbox": [ + 124, + 393, + 237, + 404 + ], + "score": 0.71, + "content": "\\pi _ { i } ^ { l } \\sim { \\bf B e r n o u l l i } ( p ^ { l } ) \\qquad \\triangleright p ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 391, + 505, + 405 + ], + "score": 1.0, + "content": "controls the variance of the noise AND the prob of skipping a unit", + "type": "text" + } + ], + "index": 15, + "is_list_start_line": true + }, + { + "bbox": [ + 109, + 402, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 109, + 402, + 123, + 419 + ], + "score": 1.0, + "content": "8:", + "type": "text" + }, + { + "bbox": [ + 124, + 405, + 182, + 417 + ], + "score": 0.86, + "content": "\\ddot { h } _ { i } ^ { l } = \\psi ( x _ { i } , \\xi _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 404, + 371, + 417 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 371, + 403, + 382, + 417 + ], + "score": 0.82, + "content": "\\tilde { h } _ { i } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 404, + 505, + 417 + ], + "score": 1.0, + "content": "is a noisy activation candidate", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 109, + 415, + 504, + 431 + ], + "spans": [ + { + "bbox": [ + 109, + 415, + 123, + 431 + ], + "score": 1.0, + "content": "9:", + "type": "text" + }, + { + "bbox": [ + 124, + 417, + 297, + 430 + ], + "score": 0.8, + "content": "\\phi ( \\mathbf { h } ^ { l - 1 } , \\xi _ { i } , \\pi _ { i } ^ { l } ; \\mathbf { w } _ { i } ) = \\pi _ { i } ^ { l } h _ { i } ^ { l - 1 } + ( 1 - \\pi _ { i } ^ { l } ) \\tilde { h } _ { i } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 415, + 455, + 431 + ], + "score": 1.0, + "content": ". make a HARD decision between", + "type": "text" + }, + { + "bbox": [ + 455, + 416, + 475, + 430 + ], + "score": 0.92, + "content": "h _ { i } ^ { l - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 415, + 493, + 431 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 494, + 416, + 504, + 430 + ], + "score": 0.87, + "content": "\\tilde { h } _ { i } ^ { l }", + "type": "inline_equation" + } + ], + "index": 17, + "is_list_start_line": true + } + ], + "index": 13, + "bbox_fs": [ + 109, + 323, + 506, + 431 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 455, + 273, + 467 + ], + "lines": [ + { + "bbox": [ + 105, + 454, + 275, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 275, + 470 + ], + "score": 1.0, + "content": "5 LINEARIZING THE NETWORK", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 106, + 478, + 504, + 511 + ], + "lines": [ + { + "bbox": [ + 105, + 478, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 505, + 491 + ], + "score": 1.0, + "content": "In Section 2, we show that convolving the objective function with a particular kernel can be", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 489, + 506, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 506, + 502 + ], + "score": 1.0, + "content": "approximated by adding noise to the activation function. This method may suffer from excessive", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 500, + 303, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 303, + 513 + ], + "score": 1.0, + "content": "random exploration when the noise is very large.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 478, + 506, + 513 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 516, + 504, + 549 + ], + "lines": [ + { + "bbox": [ + 105, + 515, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 423, + 529 + ], + "score": 1.0, + "content": "We address this issue by bounding the element-wise activation function", + "type": "text" + }, + { + "bbox": [ + 423, + 516, + 438, + 528 + ], + "score": 0.74, + "content": "\\operatorname { f } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 515, + 505, + 529 + ], + "score": 1.0, + "content": "with its linear", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 527, + 505, + 539 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 505, + 539 + ], + "score": 1.0, + "content": "approximation when the variance of the noise is very large, after centering it at the origin. The", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 536, + 373, + 550 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 179, + 550 + ], + "score": 1.0, + "content": "resulting function", + "type": "text" + }, + { + "bbox": [ + 180, + 537, + 199, + 549 + ], + "score": 0.88, + "content": "\\mathrm { f } ^ { \\ast } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 536, + 373, + 550 + ], + "score": 1.0, + "content": "is bounded and centered around the origin.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 515, + 505, + 550 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 553, + 505, + 586 + ], + "lines": [ + { + "bbox": [ + 105, + 552, + 506, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 506, + 567 + ], + "score": 1.0, + "content": "Note that centering the sigmoid or hard-sigmoid will make them symmetric with respect to the origin.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 563, + 506, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 294, + 576 + ], + "score": 1.0, + "content": "With a proper choice of the standard deviation", + "type": "text" + }, + { + "bbox": [ + 294, + 564, + 315, + 576 + ], + "score": 0.92, + "content": "\\sigma ( \\mathbf { h } )", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 563, + 506, + 576 + ], + "score": 1.0, + "content": ", the noisy activation function becomes a linear", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 574, + 365, + 587 + ], + "spans": [ + { + "bbox": [ + 105, + 574, + 214, + 587 + ], + "score": 1.0, + "content": "function of the input when", + "type": "text" + }, + { + "bbox": [ + 214, + 576, + 221, + 586 + ], + "score": 0.35, + "content": "\\mathfrak { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 574, + 365, + 587 + ], + "score": 1.0, + "content": "is large, as illustrated by Figure 10.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 552, + 506, + 587 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 590, + 505, + 615 + ], + "lines": [ + { + "bbox": [ + 105, + 590, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 105, + 590, + 121, + 603 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 122, + 590, + 203, + 603 + ], + "score": 0.92, + "content": "\\mathbf { u } ^ { * } ( x ) = \\mathbf { u } ( x ) - \\mathbf { u } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 590, + 232, + 603 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 232, + 590, + 251, + 603 + ], + "score": 0.82, + "content": "{ \\bf u } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 590, + 435, + 603 + ], + "score": 1.0, + "content": "is the offset of the function from the origin, and", + "type": "text" + }, + { + "bbox": [ + 435, + 592, + 446, + 601 + ], + "score": 0.86, + "content": "x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 590, + 460, + 603 + ], + "score": 1.0, + "content": "the", + "type": "text" + }, + { + "bbox": [ + 460, + 591, + 465, + 600 + ], + "score": 0.76, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 590, + 506, + 603 + ], + "score": 1.0, + "content": "-th dimen-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 600, + 506, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 372, + 616 + ], + "score": 1.0, + "content": "sion of an affine transformation of the output of the previous layer", + "type": "text" + }, + { + "bbox": [ + 372, + 602, + 393, + 613 + ], + "score": 0.88, + "content": "\\mathbf { h } ^ { l - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 600, + 397, + 616 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 397, + 602, + 475, + 615 + ], + "score": 0.92, + "content": "x _ { i } = \\mathbf { w } _ { i } ^ { \\top } \\mathbf { h } ^ { l - 1 } + b _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 600, + 506, + 616 + ], + "score": 1.0, + "content": ". Then:", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 590, + 506, + 616 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 150, + 628, + 460, + 642 + ], + "lines": [ + { + "bbox": [ + 150, + 628, + 460, + 642 + ], + "spans": [ + { + "bbox": [ + 150, + 628, + 460, + 642 + ], + "score": 0.88, + "content": "\\psi ( x _ { i } , \\xi _ { i } ; \\mathbf { w } _ { i } ) = \\mathrm { s g n } ( \\mathbf { u } ^ { * } ( x _ { i } ) ) \\mathrm { m i n } ( | \\mathbf { u } ^ { * } ( x _ { i } ) | , | \\mathbf { f } ^ { * } ( x _ { i } ) + \\mathrm { s g n } ( \\mathbf { u } ^ { * } ( x _ { i } ) ) | s _ { i } | | ) + \\mathbf { u } ( 0 )", + "type": "interline_equation", + "image_path": "d3ce9f3819bca81dc0de1cfc2bf008e295e1d224a2a62b8c68d791d67d3954c7.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 150, + 628, + 460, + 642 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 644, + 504, + 664 + ], + "lines": [ + { + "bbox": [ + 108, + 642, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 108, + 642, + 505, + 656 + ], + "score": 1.0, + "content": "The noise is sampled from a Normal distribution with mean 0 and whose standard deviation depends", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 654, + 129, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 119, + 667 + ], + "score": 1.0, + "content": "on", + "type": "text" + }, + { + "bbox": [ + 119, + 657, + 124, + 664 + ], + "score": 0.74, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 125, + 654, + 129, + 667 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 105, + 642, + 505, + 667 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 261, + 663, + 351, + 677 + ], + "lines": [ + { + "bbox": [ + 261, + 663, + 351, + 677 + ], + "spans": [ + { + "bbox": [ + 261, + 663, + 351, + 677 + ], + "score": 0.9, + "content": "s _ { i } \\sim \\mathcal { N } ( 0 , p c \\sigma ( x _ { i } ) )", + "type": "interline_equation", + "image_path": "aa8a9b68c9de09337719d7e42d807b4953173f578a18141b7d1cba2668e133e6.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 261, + 663, + 351, + 677 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "title", + "bbox": [ + 106, + 688, + 323, + 701 + ], + "lines": [ + { + "bbox": [ + 105, + 689, + 323, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 323, + 702 + ], + "score": 1.0, + "content": "5.1 LINEARIZING RELU ACTIVATION FUNCTION", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 107, + 708, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "We have a simpler form of the equations to linearize ReLU (Nair & Hinton, 2010) activation function", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 719, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 130, + 734 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 131, + 720, + 165, + 732 + ], + "score": 0.92, + "content": "p ^ { l } \\to \\infty \\quad", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 719, + 505, + 734 + ], + "score": 1.0, + "content": ". Instead of the complicated Eqn. 23. We can use a simpler equation as in Eqn. 26 to", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 708, + 505, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 118, + 87, + 491, + 209 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 118, + 87, + 491, + 209 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 118, + 87, + 491, + 209 + ], + "spans": [ + { + "bbox": [ + 118, + 87, + 491, + 209 + ], + "score": 0.956, + "type": "image", + "image_path": "644f80b2c2d62505206241eaafd9d373597c1578b8fc6d71a55ea6c773a2d3d5.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 118, + 87, + 491, + 127.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 118, + 127.66666666666666, + 491, + 168.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 118, + 168.33333333333331, + 491, + 208.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 219, + 505, + 262 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 218, + 505, + 231 + ], + "spans": [ + { + "bbox": [ + 106, + 218, + 505, + 231 + ], + "score": 1.0, + "content": "Figure 3: The figures show how to evolve the model to make it closer to a linear network. Arrows", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 229, + 505, + 242 + ], + "spans": [ + { + "bbox": [ + 106, + 229, + 505, + 242 + ], + "score": 1.0, + "content": "denote the direction of the noise pushing the activation function towards the linear function. a) The", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 239, + 505, + 253 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 263, + 253 + ], + "score": 1.0, + "content": "quasi-convex envelope established by a", + "type": "text" + }, + { + "bbox": [ + 264, + 240, + 312, + 252 + ], + "score": 0.32, + "content": "| \\mathrm { { s i g m o i d } ( \\cdot ) | }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 239, + 343, + 253 + ], + "score": 1.0, + "content": "around", + "type": "text" + }, + { + "bbox": [ + 344, + 240, + 373, + 252 + ], + "score": 0.88, + "content": "| 0 . 2 5 x |", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 239, + 505, + 253 + ], + "score": 1.0, + "content": ". b) A depiction of how the noise", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 250, + 300, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 300, + 263 + ], + "score": 1.0, + "content": "pushes the sigmoid to become a linear function.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "text", + "bbox": [ + 106, + 281, + 504, + 304 + ], + "lines": [ + { + "bbox": [ + 105, + 280, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 505, + 294 + ], + "score": 1.0, + "content": "achieve the linearization of the activation function when we have a very large noise in the activation", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 291, + 146, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 146, + 304 + ], + "score": 1.0, + "content": "function:", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "interline_equation", + "bbox": [ + 219, + 321, + 392, + 351 + ], + "lines": [ + { + "bbox": [ + 219, + 321, + 392, + 351 + ], + "spans": [ + { + "bbox": [ + 219, + 321, + 392, + 351 + ], + "score": 0.9, + "content": "\\begin{array} { c } { s _ { i } = \\underset { \\mathbf { \\sigma } } { \\mathrm { m i n i m u m } } ( | x _ { i } | , p \\sigma ( x _ { i } ) | \\boldsymbol { \\xi } | ) } \\\\ { \\psi ( x _ { i } , \\xi _ { i } , \\mathbf { w } _ { i } ) = \\mathbf { f } ( x _ { i } ) - s _ { i } } \\end{array}", + "type": "interline_equation", + "image_path": "008d8fbe2e5477a9e0c37b8b15192bbd2b6d56dfb8c0e07eb1e9d7de28cf304d.jpg" + } + ] + } + ], + "index": 9.5, + "virtual_lines": [ + { + "bbox": [ + 219, + 321, + 392, + 336.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 219, + 336.0, + 392, + 351.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "title", + "bbox": [ + 106, + 363, + 299, + 376 + ], + "lines": [ + { + "bbox": [ + 106, + 362, + 298, + 378 + ], + "spans": [ + { + "bbox": [ + 106, + 362, + 298, + 378 + ], + "score": 1.0, + "content": "6 MOLLIFYING LSTMS AND GRUS", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 387, + 505, + 430 + ], + "lines": [ + { + "bbox": [ + 106, + 387, + 505, + 401 + ], + "spans": [ + { + "bbox": [ + 106, + 387, + 505, + 401 + ], + "score": 1.0, + "content": "In a similar vein it is possible to smooth the objective functions of LSTM and GRU networks by", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 398, + 506, + 410 + ], + "spans": [ + { + "bbox": [ + 106, + 398, + 506, + 410 + ], + "score": 1.0, + "content": "starting the optimization procedure with a simpler objective function such as optimizing a word2vec,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 407, + 505, + 422 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 505, + 422 + ], + "score": 1.0, + "content": "BoW-LM or CRF objective function at the beginning of training and gradually increasing the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 419, + 392, + 431 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 392, + 431 + ], + "score": 1.0, + "content": "difficulty of the optimization by increasing the capacity of the network.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 435, + 505, + 491 + ], + "lines": [ + { + "bbox": [ + 104, + 434, + 507, + 451 + ], + "spans": [ + { + "bbox": [ + 104, + 434, + 255, + 451 + ], + "score": 1.0, + "content": "For GRUs we set the update gate to", + "type": "text" + }, + { + "bbox": [ + 255, + 436, + 262, + 449 + ], + "score": 0.69, + "content": "\\textstyle { \\frac { 1 } { t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 434, + 299, + 451 + ], + "score": 1.0, + "content": "– where", + "type": "text" + }, + { + "bbox": [ + 299, + 438, + 304, + 446 + ], + "score": 0.76, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 434, + 507, + 451 + ], + "score": 1.0, + "content": "is the time-step index – and reset the gate to 1 if", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 446, + 506, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 446, + 506, + 459 + ], + "score": 1.0, + "content": "the noise is very large, using Algorithm 1. Similarly for LSTMs, we can set the output gate to 1", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 456, + 506, + 471 + ], + "spans": [ + { + "bbox": [ + 104, + 456, + 178, + 471 + ], + "score": 1.0, + "content": "and input gate to", + "type": "text" + }, + { + "bbox": [ + 178, + 457, + 185, + 471 + ], + "score": 0.85, + "content": "\\textstyle { \\frac { 1 } { t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 456, + 262, + 471 + ], + "score": 1.0, + "content": "and forget gate to", + "type": "text" + }, + { + "bbox": [ + 262, + 458, + 286, + 471 + ], + "score": 0.9, + "content": "\\textstyle { 1 - { \\frac { 1 } { t } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 456, + 506, + 471 + ], + "score": 1.0, + "content": "when the noise is very large. The output gate is 1 or", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 468, + 506, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 506, + 481 + ], + "score": 1.0, + "content": "close to 1 when the noise is very large. This way the LSTM will behave like a BOW model. In order", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 479, + 440, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 265, + 492 + ], + "score": 1.0, + "content": "to achieve this behavior, the activations", + "type": "text" + }, + { + "bbox": [ + 266, + 479, + 302, + 491 + ], + "score": 0.92, + "content": "\\psi ( x _ { t } , \\dot { \\xi _ { i } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 479, + 440, + 492 + ], + "score": 1.0, + "content": "of the gates can be formulated as:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18 + }, + { + "type": "interline_equation", + "bbox": [ + 246, + 493, + 365, + 508 + ], + "lines": [ + { + "bbox": [ + 246, + 493, + 365, + 508 + ], + "spans": [ + { + "bbox": [ + 246, + 493, + 365, + 508 + ], + "score": 0.92, + "content": "\\boldsymbol { \\psi } ( x _ { t } ^ { l } , \\xi ) = \\mathbf { f } ( x _ { t } ^ { l } + p ^ { l } \\sigma ( x ) | \\xi | )", + "type": "interline_equation", + "image_path": "b77f3e1ce6b4ee6007e9628c6b173d61d5ab3691adbebd286cbda48a4fed0ce7.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 246, + 493, + 365, + 508 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 512, + 505, + 544 + ], + "lines": [ + { + "bbox": [ + 105, + 511, + 506, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 252, + 524 + ], + "score": 1.0, + "content": "By using a particular formulation of", + "type": "text" + }, + { + "bbox": [ + 252, + 512, + 272, + 524 + ], + "score": 0.91, + "content": "\\sigma ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 511, + 443, + 524 + ], + "score": 1.0, + "content": "that constraints it to be in expectation over", + "type": "text" + }, + { + "bbox": [ + 444, + 513, + 450, + 524 + ], + "score": 0.83, + "content": "\\xi", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 511, + 475, + 524 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 475, + 511, + 502, + 523 + ], + "score": 0.91, + "content": "p ^ { l } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 511, + 506, + 524 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 522, + 506, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 223, + 535 + ], + "score": 1.0, + "content": "we can obtain a function for", + "type": "text" + }, + { + "bbox": [ + 223, + 523, + 250, + 534 + ], + "score": 0.9, + "content": "\\gamma \\in \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 522, + 331, + 535 + ], + "score": 1.0, + "content": "within the range of", + "type": "text" + }, + { + "bbox": [ + 332, + 523, + 347, + 534 + ], + "score": 0.88, + "content": "\\operatorname { f } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 522, + 506, + 535 + ], + "score": 1.0, + "content": "that is discrete in expectation, but still", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 533, + 211, + 544 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 211, + 544 + ], + "score": 1.0, + "content": "per sample differentiable:", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23 + }, + { + "type": "interline_equation", + "bbox": [ + 261, + 556, + 350, + 585 + ], + "lines": [ + { + "bbox": [ + 261, + 556, + 350, + 585 + ], + "spans": [ + { + "bbox": [ + 261, + 556, + 350, + 585 + ], + "score": 0.94, + "content": "\\sigma ( x _ { t } ^ { l } ) = \\frac { \\mathrm { f } ^ { - 1 } ( \\gamma ) - x _ { t } ^ { l } } { \\mathrm { E } _ { \\xi } [ | \\xi | ] }", + "type": "interline_equation", + "image_path": "7462e8550aaec5c2e5686a1abb87a851f31e4c8c2cbd8bd761ef16c81cc03eb6.jpg" + } + ] + } + ], + "index": 25.5, + "virtual_lines": [ + { + "bbox": [ + 261, + 556, + 350, + 570.5 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 261, + 570.5, + 350, + 585.0 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 585, + 505, + 609 + ], + "lines": [ + { + "bbox": [ + 106, + 584, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 106, + 584, + 505, + 597 + ], + "score": 1.0, + "content": "We provide the derivation of Eqn. 28 in Appendix B. The gradient of the Eqn. 28 will be a", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 596, + 317, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 291, + 610 + ], + "score": 1.0, + "content": "Monte-Carlo approximation to the gradient of", + "type": "text" + }, + { + "bbox": [ + 292, + 596, + 313, + 609 + ], + "score": 0.89, + "content": "\\bar { \\bf f } ( { \\bf x } _ { t } ^ { l } )", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 596, + 317, + 610 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "title", + "bbox": [ + 108, + 623, + 288, + 636 + ], + "lines": [ + { + "bbox": [ + 105, + 621, + 287, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 279, + 640 + ], + "score": 1.0, + "content": "7 ANNEALING SCHEDULES FOR", + "type": "text" + }, + { + "bbox": [ + 280, + 626, + 287, + 637 + ], + "score": 0.69, + "content": "p", + "type": "inline_equation" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 105, + 647, + 505, + 670 + ], + "lines": [ + { + "bbox": [ + 105, + 647, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 505, + 660 + ], + "score": 1.0, + "content": "We used a different schedule for each layer of the network, such that the noise in the lower layers will", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 657, + 498, + 670 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 498, + 670 + ], + "score": 1.0, + "content": "anneal faster. This is similar to the linearly decaying probability of layers in Huang et al. (2016b).", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 106, + 680, + 504, + 704 + ], + "lines": [ + { + "bbox": [ + 106, + 680, + 506, + 693 + ], + "spans": [ + { + "bbox": [ + 106, + 680, + 506, + 693 + ], + "score": 1.0, + "content": "Exponential Decay In our experiments, we focused on using an annealing schedule similar to", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 691, + 330, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 317, + 705 + ], + "score": 1.0, + "content": "the inverse sigmoid rule in Bengio et al. (2015) with", + "type": "text" + }, + { + "bbox": [ + 317, + 691, + 326, + 704 + ], + "score": 0.88, + "content": "p _ { t } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 691, + 330, + 705 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "interline_equation", + "bbox": [ + 272, + 716, + 339, + 733 + ], + "lines": [ + { + "bbox": [ + 272, + 716, + 339, + 733 + ], + "spans": [ + { + "bbox": [ + 272, + 716, + 339, + 733 + ], + "score": 0.93, + "content": "p _ { t } ^ { l } = 1 - \\mathrm { e } ^ { - \\frac { k v _ { t } l } { t L } }", + "type": "interline_equation", + "image_path": "00e2dab64f5c89f51db46ef01b810fdff7d90c203c8ec182489fbefd5fe0064c.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 272, + 716, + 339, + 733 + ], + "spans": [], + "index": 34 + } + ] + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "score": 1.0, + "content": "7", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 118, + 87, + 491, + 209 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 118, + 87, + 491, + 209 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 118, + 87, + 491, + 209 + ], + "spans": [ + { + "bbox": [ + 118, + 87, + 491, + 209 + ], + "score": 0.956, + "type": "image", + "image_path": "644f80b2c2d62505206241eaafd9d373597c1578b8fc6d71a55ea6c773a2d3d5.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 118, + 87, + 491, + 127.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 118, + 127.66666666666666, + 491, + 168.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 118, + 168.33333333333331, + 491, + 208.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 219, + 505, + 262 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 218, + 505, + 231 + ], + "spans": [ + { + "bbox": [ + 106, + 218, + 505, + 231 + ], + "score": 1.0, + "content": "Figure 3: The figures show how to evolve the model to make it closer to a linear network. Arrows", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 229, + 505, + 242 + ], + "spans": [ + { + "bbox": [ + 106, + 229, + 505, + 242 + ], + "score": 1.0, + "content": "denote the direction of the noise pushing the activation function towards the linear function. a) The", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 239, + 505, + 253 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 263, + 253 + ], + "score": 1.0, + "content": "quasi-convex envelope established by a", + "type": "text" + }, + { + "bbox": [ + 264, + 240, + 312, + 252 + ], + "score": 0.32, + "content": "| \\mathrm { { s i g m o i d } ( \\cdot ) | }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 239, + 343, + 253 + ], + "score": 1.0, + "content": "around", + "type": "text" + }, + { + "bbox": [ + 344, + 240, + 373, + 252 + ], + "score": 0.88, + "content": "| 0 . 2 5 x |", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 239, + 505, + 253 + ], + "score": 1.0, + "content": ". b) A depiction of how the noise", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 250, + 300, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 300, + 263 + ], + "score": 1.0, + "content": "pushes the sigmoid to become a linear function.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "text", + "bbox": [ + 106, + 281, + 504, + 304 + ], + "lines": [ + { + "bbox": [ + 105, + 280, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 505, + 294 + ], + "score": 1.0, + "content": "achieve the linearization of the activation function when we have a very large noise in the activation", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 291, + 146, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 146, + 304 + ], + "score": 1.0, + "content": "function:", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 280, + 505, + 304 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 219, + 321, + 392, + 351 + ], + "lines": [ + { + "bbox": [ + 219, + 321, + 392, + 351 + ], + "spans": [ + { + "bbox": [ + 219, + 321, + 392, + 351 + ], + "score": 0.9, + "content": "\\begin{array} { c } { s _ { i } = \\underset { \\mathbf { \\sigma } } { \\mathrm { m i n i m u m } } ( | x _ { i } | , p \\sigma ( x _ { i } ) | \\boldsymbol { \\xi } | ) } \\\\ { \\psi ( x _ { i } , \\xi _ { i } , \\mathbf { w } _ { i } ) = \\mathbf { f } ( x _ { i } ) - s _ { i } } \\end{array}", + "type": "interline_equation", + "image_path": "008d8fbe2e5477a9e0c37b8b15192bbd2b6d56dfb8c0e07eb1e9d7de28cf304d.jpg" + } + ] + } + ], + "index": 9.5, + "virtual_lines": [ + { + "bbox": [ + 219, + 321, + 392, + 336.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 219, + 336.0, + 392, + 351.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "title", + "bbox": [ + 106, + 363, + 299, + 376 + ], + "lines": [ + { + "bbox": [ + 106, + 362, + 298, + 378 + ], + "spans": [ + { + "bbox": [ + 106, + 362, + 298, + 378 + ], + "score": 1.0, + "content": "6 MOLLIFYING LSTMS AND GRUS", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 387, + 505, + 430 + ], + "lines": [ + { + "bbox": [ + 106, + 387, + 505, + 401 + ], + "spans": [ + { + "bbox": [ + 106, + 387, + 505, + 401 + ], + "score": 1.0, + "content": "In a similar vein it is possible to smooth the objective functions of LSTM and GRU networks by", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 398, + 506, + 410 + ], + "spans": [ + { + "bbox": [ + 106, + 398, + 506, + 410 + ], + "score": 1.0, + "content": "starting the optimization procedure with a simpler objective function such as optimizing a word2vec,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 407, + 505, + 422 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 505, + 422 + ], + "score": 1.0, + "content": "BoW-LM or CRF objective function at the beginning of training and gradually increasing the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 419, + 392, + 431 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 392, + 431 + ], + "score": 1.0, + "content": "difficulty of the optimization by increasing the capacity of the network.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 387, + 506, + 431 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 435, + 505, + 491 + ], + "lines": [ + { + "bbox": [ + 104, + 434, + 507, + 451 + ], + "spans": [ + { + "bbox": [ + 104, + 434, + 255, + 451 + ], + "score": 1.0, + "content": "For GRUs we set the update gate to", + "type": "text" + }, + { + "bbox": [ + 255, + 436, + 262, + 449 + ], + "score": 0.69, + "content": "\\textstyle { \\frac { 1 } { t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 434, + 299, + 451 + ], + "score": 1.0, + "content": "– where", + "type": "text" + }, + { + "bbox": [ + 299, + 438, + 304, + 446 + ], + "score": 0.76, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 434, + 507, + 451 + ], + "score": 1.0, + "content": "is the time-step index – and reset the gate to 1 if", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 446, + 506, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 446, + 506, + 459 + ], + "score": 1.0, + "content": "the noise is very large, using Algorithm 1. Similarly for LSTMs, we can set the output gate to 1", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 456, + 506, + 471 + ], + "spans": [ + { + "bbox": [ + 104, + 456, + 178, + 471 + ], + "score": 1.0, + "content": "and input gate to", + "type": "text" + }, + { + "bbox": [ + 178, + 457, + 185, + 471 + ], + "score": 0.85, + "content": "\\textstyle { \\frac { 1 } { t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 456, + 262, + 471 + ], + "score": 1.0, + "content": "and forget gate to", + "type": "text" + }, + { + "bbox": [ + 262, + 458, + 286, + 471 + ], + "score": 0.9, + "content": "\\textstyle { 1 - { \\frac { 1 } { t } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 456, + 506, + 471 + ], + "score": 1.0, + "content": "when the noise is very large. The output gate is 1 or", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 468, + 506, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 506, + 481 + ], + "score": 1.0, + "content": "close to 1 when the noise is very large. This way the LSTM will behave like a BOW model. In order", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 479, + 440, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 265, + 492 + ], + "score": 1.0, + "content": "to achieve this behavior, the activations", + "type": "text" + }, + { + "bbox": [ + 266, + 479, + 302, + 491 + ], + "score": 0.92, + "content": "\\psi ( x _ { t } , \\dot { \\xi _ { i } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 479, + 440, + 492 + ], + "score": 1.0, + "content": "of the gates can be formulated as:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18, + "bbox_fs": [ + 104, + 434, + 507, + 492 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 246, + 493, + 365, + 508 + ], + "lines": [ + { + "bbox": [ + 246, + 493, + 365, + 508 + ], + "spans": [ + { + "bbox": [ + 246, + 493, + 365, + 508 + ], + "score": 0.92, + "content": "\\boldsymbol { \\psi } ( x _ { t } ^ { l } , \\xi ) = \\mathbf { f } ( x _ { t } ^ { l } + p ^ { l } \\sigma ( x ) | \\xi | )", + "type": "interline_equation", + "image_path": "b77f3e1ce6b4ee6007e9628c6b173d61d5ab3691adbebd286cbda48a4fed0ce7.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 246, + 493, + 365, + 508 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 512, + 505, + 544 + ], + "lines": [ + { + "bbox": [ + 105, + 511, + 506, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 252, + 524 + ], + "score": 1.0, + "content": "By using a particular formulation of", + "type": "text" + }, + { + "bbox": [ + 252, + 512, + 272, + 524 + ], + "score": 0.91, + "content": "\\sigma ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 511, + 443, + 524 + ], + "score": 1.0, + "content": "that constraints it to be in expectation over", + "type": "text" + }, + { + "bbox": [ + 444, + 513, + 450, + 524 + ], + "score": 0.83, + "content": "\\xi", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 511, + 475, + 524 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 475, + 511, + 502, + 523 + ], + "score": 0.91, + "content": "p ^ { l } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 511, + 506, + 524 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 522, + 506, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 223, + 535 + ], + "score": 1.0, + "content": "we can obtain a function for", + "type": "text" + }, + { + "bbox": [ + 223, + 523, + 250, + 534 + ], + "score": 0.9, + "content": "\\gamma \\in \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 522, + 331, + 535 + ], + "score": 1.0, + "content": "within the range of", + "type": "text" + }, + { + "bbox": [ + 332, + 523, + 347, + 534 + ], + "score": 0.88, + "content": "\\operatorname { f } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 522, + 506, + 535 + ], + "score": 1.0, + "content": "that is discrete in expectation, but still", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 533, + 211, + 544 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 211, + 544 + ], + "score": 1.0, + "content": "per sample differentiable:", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 511, + 506, + 544 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 261, + 556, + 350, + 585 + ], + "lines": [ + { + "bbox": [ + 261, + 556, + 350, + 585 + ], + "spans": [ + { + "bbox": [ + 261, + 556, + 350, + 585 + ], + "score": 0.94, + "content": "\\sigma ( x _ { t } ^ { l } ) = \\frac { \\mathrm { f } ^ { - 1 } ( \\gamma ) - x _ { t } ^ { l } } { \\mathrm { E } _ { \\xi } [ | \\xi | ] }", + "type": "interline_equation", + "image_path": "7462e8550aaec5c2e5686a1abb87a851f31e4c8c2cbd8bd761ef16c81cc03eb6.jpg" + } + ] + } + ], + "index": 25.5, + "virtual_lines": [ + { + "bbox": [ + 261, + 556, + 350, + 570.5 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 261, + 570.5, + 350, + 585.0 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 585, + 505, + 609 + ], + "lines": [ + { + "bbox": [ + 106, + 584, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 106, + 584, + 505, + 597 + ], + "score": 1.0, + "content": "We provide the derivation of Eqn. 28 in Appendix B. The gradient of the Eqn. 28 will be a", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 596, + 317, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 291, + 610 + ], + "score": 1.0, + "content": "Monte-Carlo approximation to the gradient of", + "type": "text" + }, + { + "bbox": [ + 292, + 596, + 313, + 609 + ], + "score": 0.89, + "content": "\\bar { \\bf f } ( { \\bf x } _ { t } ^ { l } )", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 596, + 317, + 610 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 584, + 505, + 610 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 623, + 288, + 636 + ], + "lines": [ + { + "bbox": [ + 105, + 621, + 287, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 279, + 640 + ], + "score": 1.0, + "content": "7 ANNEALING SCHEDULES FOR", + "type": "text" + }, + { + "bbox": [ + 280, + 626, + 287, + 637 + ], + "score": 0.69, + "content": "p", + "type": "inline_equation" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 105, + 647, + 505, + 670 + ], + "lines": [ + { + "bbox": [ + 105, + 647, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 505, + 660 + ], + "score": 1.0, + "content": "We used a different schedule for each layer of the network, such that the noise in the lower layers will", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 657, + 498, + 670 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 498, + 670 + ], + "score": 1.0, + "content": "anneal faster. This is similar to the linearly decaying probability of layers in Huang et al. (2016b).", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 647, + 505, + 670 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 680, + 504, + 704 + ], + "lines": [ + { + "bbox": [ + 106, + 680, + 506, + 693 + ], + "spans": [ + { + "bbox": [ + 106, + 680, + 506, + 693 + ], + "score": 1.0, + "content": "Exponential Decay In our experiments, we focused on using an annealing schedule similar to", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 691, + 330, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 317, + 705 + ], + "score": 1.0, + "content": "the inverse sigmoid rule in Bengio et al. (2015) with", + "type": "text" + }, + { + "bbox": [ + 317, + 691, + 326, + 704 + ], + "score": 0.88, + "content": "p _ { t } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 691, + 330, + 705 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 680, + 506, + 705 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 272, + 716, + 339, + 733 + ], + "lines": [ + { + "bbox": [ + 272, + 716, + 339, + 733 + ], + "spans": [ + { + "bbox": [ + 272, + 716, + 339, + 733 + ], + "score": 0.93, + "content": "p _ { t } ^ { l } = 1 - \\mathrm { e } ^ { - \\frac { k v _ { t } l } { t L } }", + "type": "interline_equation", + "image_path": "00e2dab64f5c89f51db46ef01b810fdff7d90c203c8ec182489fbefd5fe0064c.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 272, + 716, + 339, + 733 + ], + "spans": [], + "index": 34 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 505, + 150 + ], + "lines": [ + { + "bbox": [ + 101, + 81, + 510, + 115 + ], + "spans": [ + { + "bbox": [ + 101, + 81, + 196, + 115 + ], + "score": 1.0, + "content": "with hyper-parameter model. We stop anne", + "type": "text" + }, + { + "bbox": [ + 196, + 83, + 222, + 94 + ], + "score": 0.91, + "content": "k \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 81, + 233, + 115 + ], + "score": 1.0, + "content": "at wh", + "type": "text" + }, + { + "bbox": [ + 233, + 82, + 246, + 93 + ], + "score": 0.88, + "content": "t ^ { t h }", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 81, + 307, + 115 + ], + "score": 1.0, + "content": "update for the he expected de", + "type": "text" + }, + { + "bbox": [ + 307, + 82, + 319, + 92 + ], + "score": 0.88, + "content": "l ^ { t h }", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 81, + 322, + 115 + ], + "score": 0.0, + "content": "", + "type": "text" + }, + { + "bbox": [ + 374, + 83, + 381, + 92 + ], + "score": 0.79, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 81, + 482, + 115 + ], + "score": 1.0, + "content": "is the number of layers reaches some threshold", + "type": "text" + }, + { + "bbox": [ + 488, + 81, + 510, + 115 + ], + "score": 1.0, + "content": "the. In", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 322, + 93, + 488, + 108 + ], + "spans": [ + { + "bbox": [ + 322, + 93, + 382, + 108 + ], + "score": 0.92, + "content": "\\begin{array} { r } { p _ { t } = \\sum _ { i = 1 } ^ { L } p _ { t } ^ { l } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 96, + 488, + 106 + ], + "score": 0.47, + "content": "\\delta", + "type": "inline_equation" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 108, + 506, + 120 + ], + "spans": [ + { + "bbox": [ + 105, + 108, + 199, + 120 + ], + "score": 1.0, + "content": "our experiment we set", + "type": "text" + }, + { + "bbox": [ + 200, + 109, + 209, + 119 + ], + "score": 0.85, + "content": "v _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 108, + 335, + 120 + ], + "score": 1.0, + "content": "to be a moving average of the", + "type": "text" + }, + { + "bbox": [ + 335, + 108, + 357, + 118 + ], + "score": 0.34, + "content": "\\mathrm { l o s s } ^ { 3 }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 108, + 506, + 120 + ], + "score": 1.0, + "content": "of the network, but for some of our", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 118, + 505, + 130 + ], + "spans": [ + { + "bbox": [ + 105, + 118, + 454, + 130 + ], + "score": 1.0, + "content": "experimnets that resulted unstable behaviors in the training and thus we have to fix", + "type": "text" + }, + { + "bbox": [ + 455, + 120, + 464, + 129 + ], + "score": 0.84, + "content": "v _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 118, + 505, + 130 + ], + "score": 1.0, + "content": "to 1. An", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 128, + 506, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 305, + 141 + ], + "score": 1.0, + "content": "advantage of using running average of loss for the", + "type": "text" + }, + { + "bbox": [ + 305, + 130, + 315, + 140 + ], + "score": 0.85, + "content": "v _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 128, + 506, + 141 + ], + "score": 1.0, + "content": "is because the behavior of the loss/optimization", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 139, + 443, + 151 + ], + "spans": [ + { + "bbox": [ + 106, + 139, + 443, + 151 + ], + "score": 1.0, + "content": "can directly influence the annealing behavior of the network. Because we will have:", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 2.5 + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 150, + 373, + 171 + ], + "lines": [ + { + "bbox": [ + 236, + 150, + 373, + 171 + ], + "spans": [ + { + "bbox": [ + 236, + 150, + 373, + 171 + ], + "score": 0.91, + "content": "\\operatorname* { l i m } _ { { \\bf v } _ { t } \\to \\infty } p _ { t } ^ { l } = 1 \\mathrm { ~ \\ a n d , ~ } \\operatorname* { l i m } _ { { \\bf v } _ { t } \\to 0 } p _ { t } ^ { l } = 0 .", + "type": "interline_equation", + "image_path": "e11515286cdb82c18307c87f52abe95b1878a73f8e35bd5738690c359abb3f4b.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 236, + 150, + 373, + 171 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 171, + 506, + 204 + ], + "lines": [ + { + "bbox": [ + 105, + 170, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 505, + 184 + ], + "score": 1.0, + "content": "This has a desirable property: when the training-loss is high, the noise injected into the system will", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 182, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 506, + 194 + ], + "score": 1.0, + "content": "be large as well. As a result, the model is encouraged to do more exploration, while if the model", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 192, + 459, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 459, + 205 + ], + "score": 1.0, + "content": "converges the noise injected into the system by the mollification procedure will be zero.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 106, + 214, + 505, + 268 + ], + "lines": [ + { + "bbox": [ + 106, + 214, + 506, + 227 + ], + "spans": [ + { + "bbox": [ + 106, + 214, + 506, + 227 + ], + "score": 1.0, + "content": "Square-root Decay The square root decaying of the learning rate is very popular. In our", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 226, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 104, + 226, + 412, + 244 + ], + "score": 1.0, + "content": "experiments we have tried to decay the plt according to min(pmin, 1 − q", + "type": "text" + }, + { + "bbox": [ + 382, + 226, + 444, + 246 + ], + "score": 0.85, + "content": "\\begin{array} { r } { 1 - \\sqrt { \\frac { t } { N _ { e p o c h s } } } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 228, + 474, + 240 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 474, + 230, + 479, + 239 + ], + "score": 0.75, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 228, + 505, + 240 + ], + "score": 1.0, + "content": "is the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 243, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 243, + 290, + 257 + ], + "score": 1.0, + "content": "index of the iteration/epoch over the data and", + "type": "text" + }, + { + "bbox": [ + 290, + 244, + 324, + 256 + ], + "score": 0.92, + "content": "N _ { e p o c h s }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 243, + 505, + 257 + ], + "score": 1.0, + "content": "corresponds to the total number of iterations", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 255, + 498, + 269 + ], + "spans": [ + { + "bbox": [ + 106, + 255, + 256, + 269 + ], + "score": 1.0, + "content": "that the model will do on the dataset.", + "type": "text" + }, + { + "bbox": [ + 257, + 258, + 278, + 268 + ], + "score": 0.88, + "content": "p _ { m i n }", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 255, + 484, + 269 + ], + "score": 1.0, + "content": "is hyperparameter to define the lower bound on the", + "type": "text" + }, + { + "bbox": [ + 485, + 255, + 495, + 268 + ], + "score": 0.88, + "content": "p _ { t } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 255, + 498, + 269 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 106, + 279, + 506, + 311 + ], + "lines": [ + { + "bbox": [ + 102, + 275, + 503, + 300 + ], + "spans": [ + { + "bbox": [ + 102, + 275, + 383, + 300 + ], + "score": 1.0, + "content": "Linear Decay We have also experimented with linearly decaying the", + "type": "text" + }, + { + "bbox": [ + 383, + 279, + 393, + 292 + ], + "score": 0.88, + "content": "p _ { t } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 275, + 408, + 300 + ], + "score": 1.0, + "content": "via", + "type": "text" + }, + { + "bbox": [ + 408, + 279, + 503, + 295 + ], + "score": 0.71, + "content": "\\begin{array} { r } { \\operatorname* { m i n } ( p _ { m i n } , 1 - \\frac { t } { N _ { e p o c h s } } ) } \\end{array}", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 298, + 494, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 494, + 312 + ], + "score": 1.0, + "content": "We have compared the plot of different annealing methods described in this paper as in Figure 4.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "image", + "bbox": [ + 179, + 333, + 428, + 511 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 179, + 333, + 428, + 511 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 179, + 333, + 428, + 511 + ], + "spans": [ + { + "bbox": [ + 179, + 333, + 428, + 511 + ], + "score": 0.876, + "type": "image", + "image_path": "0edec83fe7d1c958a8488792b79a2fed28b69de56bc31b6fc444f2b0511e2401.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 179, + 333, + 428, + 392.3333333333333 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 179, + 392.3333333333333, + 428, + 451.66666666666663 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 179, + 451.66666666666663, + 428, + 510.99999999999994 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 108, + 526, + 500, + 538 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 525, + 500, + 540 + ], + "spans": [ + { + "bbox": [ + 110, + 525, + 500, + 540 + ], + "score": 1.0, + "content": "Figure 4: We compare different annealing schedules with respect to the time in y-axis(iterations).", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + } + ], + "index": 18.0 + }, + { + "type": "text", + "bbox": [ + 107, + 548, + 505, + 590 + ], + "lines": [ + { + "bbox": [ + 104, + 546, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 104, + 546, + 506, + 563 + ], + "score": 1.0, + "content": "Furthermore, in our experiments we observe that training with noisy mollifiers can potentially be", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 557, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 557, + 505, + 572 + ], + "score": 1.0, + "content": "helpful for the generalization. This can be due to the noise induced to the backpropagation through", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 568, + 506, + 581 + ], + "spans": [ + { + "bbox": [ + 106, + 568, + 506, + 581 + ], + "score": 1.0, + "content": "the noisy mollification, that makes SGD more likely to converge to a flatter-minima (Hochreiter", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 578, + 464, + 592 + ], + "spans": [ + { + "bbox": [ + 104, + 578, + 464, + 592 + ], + "score": 1.0, + "content": "& Schmidhuber, 1997b) because the noise will help it escape from sharper local minima.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21.5 + }, + { + "type": "title", + "bbox": [ + 108, + 605, + 200, + 617 + ], + "lines": [ + { + "bbox": [ + 105, + 604, + 201, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 201, + 619 + ], + "score": 1.0, + "content": "8 EXPERIMENTS", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 628, + 505, + 661 + ], + "lines": [ + { + "bbox": [ + 105, + 628, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 505, + 640 + ], + "score": 1.0, + "content": "In this section we mainly focus on training of difficult to optimize models, in particular deep MLPs", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 639, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 106, + 639, + 505, + 651 + ], + "score": 1.0, + "content": "with sigmoid or tanh activation functions. The details of the experimental procedure is provided", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 649, + 171, + 663 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 171, + 663 + ], + "score": 1.0, + "content": "in Appendix C.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "title", + "bbox": [ + 108, + 673, + 278, + 684 + ], + "lines": [ + { + "bbox": [ + 105, + 672, + 280, + 686 + ], + "spans": [ + { + "bbox": [ + 105, + 672, + 280, + 686 + ], + "score": 1.0, + "content": "8.1 EXPLORATORY STUDY ON MNIST", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 109, + 693, + 504, + 715 + ], + "lines": [ + { + "bbox": [ + 106, + 692, + 506, + 705 + ], + "spans": [ + { + "bbox": [ + 106, + 692, + 506, + 705 + ], + "score": 1.0, + "content": "We train a thin deep neural network on MNIST (LeCun & Cortes, 1998) dataset with 72 hidden layers", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 703, + 505, + 716 + ], + "spans": [ + { + "bbox": [ + 106, + 703, + 505, + 716 + ], + "score": 1.0, + "content": "and 100 hidden units. We train our model with Adam(Kingma & Ba, 2014) optimizer and fix the", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 300, + 750, + 309, + 761 + ], + "spans": [ + { + "bbox": [ + 300, + 750, + 309, + 761 + ], + "score": 1.0, + "content": "8", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 113, + 721, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 119, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 119, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "3Depending on whether the model overfits or not, this can be a moving average of training or validation loss.", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 505, + 150 + ], + "lines": [ + { + "bbox": [ + 101, + 81, + 510, + 115 + ], + "spans": [ + { + "bbox": [ + 101, + 81, + 196, + 115 + ], + "score": 1.0, + "content": "with hyper-parameter model. We stop anne", + "type": "text" + }, + { + "bbox": [ + 196, + 83, + 222, + 94 + ], + "score": 0.91, + "content": "k \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 81, + 233, + 115 + ], + "score": 1.0, + "content": "at wh", + "type": "text" + }, + { + "bbox": [ + 233, + 82, + 246, + 93 + ], + "score": 0.88, + "content": "t ^ { t h }", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 81, + 307, + 115 + ], + "score": 1.0, + "content": "update for the he expected de", + "type": "text" + }, + { + "bbox": [ + 307, + 82, + 319, + 92 + ], + "score": 0.88, + "content": "l ^ { t h }", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 81, + 322, + 115 + ], + "score": 0.0, + "content": "", + "type": "text" + }, + { + "bbox": [ + 374, + 83, + 381, + 92 + ], + "score": 0.79, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 81, + 482, + 115 + ], + "score": 1.0, + "content": "is the number of layers reaches some threshold", + "type": "text" + }, + { + "bbox": [ + 488, + 81, + 510, + 115 + ], + "score": 1.0, + "content": "the. In", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 322, + 93, + 488, + 108 + ], + "spans": [ + { + "bbox": [ + 322, + 93, + 382, + 108 + ], + "score": 0.92, + "content": "\\begin{array} { r } { p _ { t } = \\sum _ { i = 1 } ^ { L } p _ { t } ^ { l } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 96, + 488, + 106 + ], + "score": 0.47, + "content": "\\delta", + "type": "inline_equation" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 108, + 506, + 120 + ], + "spans": [ + { + "bbox": [ + 105, + 108, + 199, + 120 + ], + "score": 1.0, + "content": "our experiment we set", + "type": "text" + }, + { + "bbox": [ + 200, + 109, + 209, + 119 + ], + "score": 0.85, + "content": "v _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 108, + 335, + 120 + ], + "score": 1.0, + "content": "to be a moving average of the", + "type": "text" + }, + { + "bbox": [ + 335, + 108, + 357, + 118 + ], + "score": 0.34, + "content": "\\mathrm { l o s s } ^ { 3 }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 108, + 506, + 120 + ], + "score": 1.0, + "content": "of the network, but for some of our", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 118, + 505, + 130 + ], + "spans": [ + { + "bbox": [ + 105, + 118, + 454, + 130 + ], + "score": 1.0, + "content": "experimnets that resulted unstable behaviors in the training and thus we have to fix", + "type": "text" + }, + { + "bbox": [ + 455, + 120, + 464, + 129 + ], + "score": 0.84, + "content": "v _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 118, + 505, + 130 + ], + "score": 1.0, + "content": "to 1. An", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 128, + 506, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 305, + 141 + ], + "score": 1.0, + "content": "advantage of using running average of loss for the", + "type": "text" + }, + { + "bbox": [ + 305, + 130, + 315, + 140 + ], + "score": 0.85, + "content": "v _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 128, + 506, + 141 + ], + "score": 1.0, + "content": "is because the behavior of the loss/optimization", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 139, + 443, + 151 + ], + "spans": [ + { + "bbox": [ + 106, + 139, + 443, + 151 + ], + "score": 1.0, + "content": "can directly influence the annealing behavior of the network. Because we will have:", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 2.5, + "bbox_fs": [ + 101, + 81, + 510, + 151 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 150, + 373, + 171 + ], + "lines": [ + { + "bbox": [ + 236, + 150, + 373, + 171 + ], + "spans": [ + { + "bbox": [ + 236, + 150, + 373, + 171 + ], + "score": 0.91, + "content": "\\operatorname* { l i m } _ { { \\bf v } _ { t } \\to \\infty } p _ { t } ^ { l } = 1 \\mathrm { ~ \\ a n d , ~ } \\operatorname* { l i m } _ { { \\bf v } _ { t } \\to 0 } p _ { t } ^ { l } = 0 .", + "type": "interline_equation", + "image_path": "e11515286cdb82c18307c87f52abe95b1878a73f8e35bd5738690c359abb3f4b.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 236, + 150, + 373, + 171 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 171, + 506, + 204 + ], + "lines": [ + { + "bbox": [ + 105, + 170, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 505, + 184 + ], + "score": 1.0, + "content": "This has a desirable property: when the training-loss is high, the noise injected into the system will", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 182, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 506, + 194 + ], + "score": 1.0, + "content": "be large as well. As a result, the model is encouraged to do more exploration, while if the model", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 192, + 459, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 459, + 205 + ], + "score": 1.0, + "content": "converges the noise injected into the system by the mollification procedure will be zero.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 170, + 506, + 205 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 214, + 505, + 268 + ], + "lines": [ + { + "bbox": [ + 106, + 214, + 506, + 227 + ], + "spans": [ + { + "bbox": [ + 106, + 214, + 506, + 227 + ], + "score": 1.0, + "content": "Square-root Decay The square root decaying of the learning rate is very popular. In our", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 226, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 104, + 226, + 412, + 244 + ], + "score": 1.0, + "content": "experiments we have tried to decay the plt according to min(pmin, 1 − q", + "type": "text" + }, + { + "bbox": [ + 382, + 226, + 444, + 246 + ], + "score": 0.85, + "content": "\\begin{array} { r } { 1 - \\sqrt { \\frac { t } { N _ { e p o c h s } } } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 228, + 474, + 240 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 474, + 230, + 479, + 239 + ], + "score": 0.75, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 228, + 505, + 240 + ], + "score": 1.0, + "content": "is the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 243, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 243, + 290, + 257 + ], + "score": 1.0, + "content": "index of the iteration/epoch over the data and", + "type": "text" + }, + { + "bbox": [ + 290, + 244, + 324, + 256 + ], + "score": 0.92, + "content": "N _ { e p o c h s }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 243, + 505, + 257 + ], + "score": 1.0, + "content": "corresponds to the total number of iterations", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 255, + 498, + 269 + ], + "spans": [ + { + "bbox": [ + 106, + 255, + 256, + 269 + ], + "score": 1.0, + "content": "that the model will do on the dataset.", + "type": "text" + }, + { + "bbox": [ + 257, + 258, + 278, + 268 + ], + "score": 0.88, + "content": "p _ { m i n }", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 255, + 484, + 269 + ], + "score": 1.0, + "content": "is hyperparameter to define the lower bound on the", + "type": "text" + }, + { + "bbox": [ + 485, + 255, + 495, + 268 + ], + "score": 0.88, + "content": "p _ { t } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 255, + 498, + 269 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11.5, + "bbox_fs": [ + 104, + 214, + 506, + 269 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 279, + 506, + 311 + ], + "lines": [ + { + "bbox": [ + 102, + 275, + 503, + 300 + ], + "spans": [ + { + "bbox": [ + 102, + 275, + 383, + 300 + ], + "score": 1.0, + "content": "Linear Decay We have also experimented with linearly decaying the", + "type": "text" + }, + { + "bbox": [ + 383, + 279, + 393, + 292 + ], + "score": 0.88, + "content": "p _ { t } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 275, + 408, + 300 + ], + "score": 1.0, + "content": "via", + "type": "text" + }, + { + "bbox": [ + 408, + 279, + 503, + 295 + ], + "score": 0.71, + "content": "\\begin{array} { r } { \\operatorname* { m i n } ( p _ { m i n } , 1 - \\frac { t } { N _ { e p o c h s } } ) } \\end{array}", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 298, + 494, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 494, + 312 + ], + "score": 1.0, + "content": "We have compared the plot of different annealing methods described in this paper as in Figure 4.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 102, + 275, + 503, + 312 + ] + }, + { + "type": "image", + "bbox": [ + 179, + 333, + 428, + 511 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 179, + 333, + 428, + 511 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 179, + 333, + 428, + 511 + ], + "spans": [ + { + "bbox": [ + 179, + 333, + 428, + 511 + ], + "score": 0.876, + "type": "image", + "image_path": "0edec83fe7d1c958a8488792b79a2fed28b69de56bc31b6fc444f2b0511e2401.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 179, + 333, + 428, + 392.3333333333333 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 179, + 392.3333333333333, + 428, + 451.66666666666663 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 179, + 451.66666666666663, + 428, + 510.99999999999994 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 108, + 526, + 500, + 538 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 525, + 500, + 540 + ], + "spans": [ + { + "bbox": [ + 110, + 525, + 500, + 540 + ], + "score": 1.0, + "content": "Figure 4: We compare different annealing schedules with respect to the time in y-axis(iterations).", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + } + ], + "index": 18.0 + }, + { + "type": "text", + "bbox": [ + 107, + 548, + 505, + 590 + ], + "lines": [ + { + "bbox": [ + 104, + 546, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 104, + 546, + 506, + 563 + ], + "score": 1.0, + "content": "Furthermore, in our experiments we observe that training with noisy mollifiers can potentially be", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 557, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 557, + 505, + 572 + ], + "score": 1.0, + "content": "helpful for the generalization. This can be due to the noise induced to the backpropagation through", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 568, + 506, + 581 + ], + "spans": [ + { + "bbox": [ + 106, + 568, + 506, + 581 + ], + "score": 1.0, + "content": "the noisy mollification, that makes SGD more likely to converge to a flatter-minima (Hochreiter", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 578, + 464, + 592 + ], + "spans": [ + { + "bbox": [ + 104, + 578, + 464, + 592 + ], + "score": 1.0, + "content": "& Schmidhuber, 1997b) because the noise will help it escape from sharper local minima.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21.5, + "bbox_fs": [ + 104, + 546, + 506, + 592 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 605, + 200, + 617 + ], + "lines": [ + { + "bbox": [ + 105, + 604, + 201, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 201, + 619 + ], + "score": 1.0, + "content": "8 EXPERIMENTS", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 628, + 505, + 661 + ], + "lines": [ + { + "bbox": [ + 105, + 628, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 505, + 640 + ], + "score": 1.0, + "content": "In this section we mainly focus on training of difficult to optimize models, in particular deep MLPs", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 639, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 106, + 639, + 505, + 651 + ], + "score": 1.0, + "content": "with sigmoid or tanh activation functions. The details of the experimental procedure is provided", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 649, + 171, + 663 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 171, + 663 + ], + "score": 1.0, + "content": "in Appendix C.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 628, + 505, + 663 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 673, + 278, + 684 + ], + "lines": [ + { + "bbox": [ + 105, + 672, + 280, + 686 + ], + "spans": [ + { + "bbox": [ + 105, + 672, + 280, + 686 + ], + "score": 1.0, + "content": "8.1 EXPLORATORY STUDY ON MNIST", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 109, + 693, + 504, + 715 + ], + "lines": [ + { + "bbox": [ + 106, + 692, + 506, + 705 + ], + "spans": [ + { + "bbox": [ + 106, + 692, + 506, + 705 + ], + "score": 1.0, + "content": "We train a thin deep neural network on MNIST (LeCun & Cortes, 1998) dataset with 72 hidden layers", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 703, + 505, + 716 + ], + "spans": [ + { + "bbox": [ + 106, + 703, + 505, + 716 + ], + "score": 1.0, + "content": "and 100 hidden units. We train our model with Adam(Kingma & Ba, 2014) optimizer and fix the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 83, + 504, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 232, + 94 + ], + "score": 1.0, + "content": "learning rate of all the models to", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 232, + 83, + 257, + 93 + ], + "score": 0.46, + "content": "3 e { - 4 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 257, + 83, + 504, + 94 + ], + "score": 1.0, + "content": ". We have used the same learning-rate for all the models in order", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 507, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 507, + 106 + ], + "score": 1.0, + "content": "to factor out the possibility that a model converges faster, due to the fact of using a larger learning rate.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 29.5, + "bbox_fs": [ + 106, + 692, + 506, + 716 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 104 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 504, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 232, + 94 + ], + "score": 1.0, + "content": "learning rate of all the models to", + "type": "text" + }, + { + "bbox": [ + 232, + 83, + 257, + 93 + ], + "score": 0.46, + "content": "3 e { - 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 83, + 504, + 94 + ], + "score": 1.0, + "content": ". We have used the same learning-rate for all the models in order", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 507, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 507, + 106 + ], + "score": 1.0, + "content": "to factor out the possibility that a model converges faster, due to the fact of using a larger learning rate.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 109, + 505, + 151 + ], + "lines": [ + { + "bbox": [ + 106, + 109, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 106, + 109, + 505, + 123 + ], + "score": 1.0, + "content": "Firstly, in Figure 5, we investigate the effect of using different annealing schedules. Exponential", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 119, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 106, + 119, + 408, + 133 + ], + "score": 1.0, + "content": "decay converges faster compared to linear decay and square root decay of", + "type": "text" + }, + { + "bbox": [ + 409, + 122, + 415, + 131 + ], + "score": 0.75, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 119, + 505, + 133 + ], + "score": 1.0, + "content": ". We find it to be very", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 129, + 505, + 142 + ], + "spans": [ + { + "bbox": [ + 106, + 129, + 432, + 142 + ], + "score": 1.0, + "content": "unstable to train our model with linear and square root decay in particular for large", + "type": "text" + }, + { + "bbox": [ + 432, + 132, + 438, + 140 + ], + "score": 0.64, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 129, + 505, + 142 + ], + "score": 1.0, + "content": "values. Thus we", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 139, + 507, + 154 + ], + "spans": [ + { + "bbox": [ + 105, + 139, + 183, + 154 + ], + "score": 1.0, + "content": "have to use smaller", + "type": "text" + }, + { + "bbox": [ + 184, + 143, + 190, + 150 + ], + "score": 0.64, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 139, + 507, + 154 + ], + "score": 1.0, + "content": "value (20 instead of 100) to be able to train the model with causing it to diverge.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5 + }, + { + "type": "image", + "bbox": [ + 196, + 181, + 400, + 318 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 196, + 181, + 400, + 318 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 196, + 181, + 400, + 318 + ], + "spans": [ + { + "bbox": [ + 196, + 181, + 400, + 318 + ], + "score": 0.967, + "type": "image", + "image_path": "be0d19fd9d12424b4a91c95146d3758bf25debfc209b87d8462abca2c20cfb26.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 196, + 181, + 400, + 196.22222222222223 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 196, + 196.22222222222223, + 400, + 211.44444444444446 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 196, + 211.44444444444446, + 400, + 226.66666666666669 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 196, + 226.66666666666669, + 400, + 241.8888888888889 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 196, + 241.8888888888889, + 400, + 257.11111111111114 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 196, + 257.11111111111114, + 400, + 272.33333333333337 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 196, + 272.33333333333337, + 400, + 287.5555555555556 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 196, + 287.5555555555556, + 400, + 302.7777777777778 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 196, + 302.7777777777778, + 400, + 318.00000000000006 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 326, + 505, + 359 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 326, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 505, + 339 + ], + "score": 1.0, + "content": "Figure 5: We compare the training performance of different types of annealing methods used with", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 336, + 504, + 349 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 375, + 349 + ], + "score": 1.0, + "content": "mollification procedure to anneal the parameter of the mollification", + "type": "text" + }, + { + "bbox": [ + 376, + 339, + 382, + 348 + ], + "score": 0.74, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 336, + 441, + 349 + ], + "score": 1.0, + "content": ". Decaying the", + "type": "text" + }, + { + "bbox": [ + 441, + 339, + 448, + 348 + ], + "score": 0.75, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 336, + 504, + 349 + ], + "score": 1.0, + "content": "exponentially", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 347, + 336, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 336, + 360 + ], + "score": 1.0, + "content": "achieves both better training and validation performance.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + } + ], + "index": 13.0 + }, + { + "type": "text", + "bbox": [ + 106, + 380, + 506, + 413 + ], + "lines": [ + { + "bbox": [ + 104, + 379, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 104, + 379, + 506, + 393 + ], + "score": 1.0, + "content": "In Figure 6, we show the effect of using the noisy training procedure that we have introduced by sam-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 390, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 506, + 403 + ], + "score": 1.0, + "content": "pling a mask from Bernoulli and Gaussian distributions versu using the deterministic approximation", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 401, + 466, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 466, + 414 + ], + "score": 1.0, + "content": "of this noisy procedure which we also use for the test time but during the training as well.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "image", + "bbox": [ + 196, + 442, + 400, + 580 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 196, + 442, + 400, + 580 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 196, + 442, + 400, + 580 + ], + "spans": [ + { + "bbox": [ + 196, + 442, + 400, + 580 + ], + "score": 0.967, + "type": "image", + "image_path": "4b8a3ac20b57ecaf26bfbb68e0f1deb19984fdd2b9a2d6ea11e3f0a10189a871.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 196, + 442, + 400, + 457.3333333333333 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 196, + 457.3333333333333, + 400, + 472.66666666666663 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 196, + 472.66666666666663, + 400, + 487.99999999999994 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 196, + 487.99999999999994, + 400, + 503.33333333333326 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 196, + 503.33333333333326, + 400, + 518.6666666666666 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 196, + 518.6666666666666, + 400, + 534.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 196, + 534.0, + 400, + 549.3333333333334 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 196, + 549.3333333333334, + 400, + 564.6666666666667 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 196, + 564.6666666666667, + 400, + 580.0000000000001 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 587, + 504, + 620 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 586, + 506, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 506, + 600 + ], + "score": 1.0, + "content": "Figure 6: We show the learning curves of the model where we don’t inject the noise during the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 597, + 506, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 506, + 611 + ], + "score": 1.0, + "content": "training and instead use the deterministic approximation for the mollification during the training as", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 608, + 370, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 370, + 621 + ], + "score": 1.0, + "content": "well. The differerence in terms of speed of learning is very small.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + } + ], + "index": 28.0 + }, + { + "type": "text", + "bbox": [ + 107, + 641, + 505, + 684 + ], + "lines": [ + { + "bbox": [ + 105, + 640, + 506, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 640, + 506, + 655 + ], + "score": 1.0, + "content": "In Figure 7, we compare the results obtained for the model using mollification obtained with or", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 651, + 505, + 666 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 505, + 666 + ], + "score": 1.0, + "content": "without batch normalization and feed-forward residual networks. The mollified model performs very", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 662, + 505, + 675 + ], + "spans": [ + { + "bbox": [ + 106, + 662, + 505, + 675 + ], + "score": 1.0, + "content": "closely to the MLP trained with residual connections and the batchnorm. However, using residual", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 672, + 372, + 686 + ], + "spans": [ + { + "bbox": [ + 105, + 672, + 372, + 686 + ], + "score": 1.0, + "content": "connections and batch-norm does not seem to improve the results.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 107, + 689, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 689, + 506, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 506, + 703 + ], + "score": 1.0, + "content": "We have tried to run experiment with the Monte-Carlo approximation of the mollification which is", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 700, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 700, + 506, + 712 + ], + "score": 1.0, + "content": "derived in Appendix A, however when we start with large noise and anneal the noise during the train-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "ing, the model was very unstable and training was diverging. If we start with small noise and anneal", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "the magnitude of the noise during the training, we could not observe any effect of it on the training.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38.5 + } + ], + "page_idx": 8, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "9", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 104 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 83, + 507, + 106 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 109, + 505, + 151 + ], + "lines": [ + { + "bbox": [ + 106, + 109, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 106, + 109, + 505, + 123 + ], + "score": 1.0, + "content": "Firstly, in Figure 5, we investigate the effect of using different annealing schedules. Exponential", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 119, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 106, + 119, + 408, + 133 + ], + "score": 1.0, + "content": "decay converges faster compared to linear decay and square root decay of", + "type": "text" + }, + { + "bbox": [ + 409, + 122, + 415, + 131 + ], + "score": 0.75, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 119, + 505, + 133 + ], + "score": 1.0, + "content": ". We find it to be very", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 129, + 505, + 142 + ], + "spans": [ + { + "bbox": [ + 106, + 129, + 432, + 142 + ], + "score": 1.0, + "content": "unstable to train our model with linear and square root decay in particular for large", + "type": "text" + }, + { + "bbox": [ + 432, + 132, + 438, + 140 + ], + "score": 0.64, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 129, + 505, + 142 + ], + "score": 1.0, + "content": "values. Thus we", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 139, + 507, + 154 + ], + "spans": [ + { + "bbox": [ + 105, + 139, + 183, + 154 + ], + "score": 1.0, + "content": "have to use smaller", + "type": "text" + }, + { + "bbox": [ + 184, + 143, + 190, + 150 + ], + "score": 0.64, + "content": "c", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 139, + 507, + 154 + ], + "score": 1.0, + "content": "value (20 instead of 100) to be able to train the model with causing it to diverge.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 109, + 507, + 154 + ] + }, + { + "type": "image", + "bbox": [ + 196, + 181, + 400, + 318 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 196, + 181, + 400, + 318 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 196, + 181, + 400, + 318 + ], + "spans": [ + { + "bbox": [ + 196, + 181, + 400, + 318 + ], + "score": 0.967, + "type": "image", + "image_path": "be0d19fd9d12424b4a91c95146d3758bf25debfc209b87d8462abca2c20cfb26.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 196, + 181, + 400, + 196.22222222222223 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 196, + 196.22222222222223, + 400, + 211.44444444444446 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 196, + 211.44444444444446, + 400, + 226.66666666666669 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 196, + 226.66666666666669, + 400, + 241.8888888888889 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 196, + 241.8888888888889, + 400, + 257.11111111111114 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 196, + 257.11111111111114, + 400, + 272.33333333333337 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 196, + 272.33333333333337, + 400, + 287.5555555555556 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 196, + 287.5555555555556, + 400, + 302.7777777777778 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 196, + 302.7777777777778, + 400, + 318.00000000000006 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 326, + 505, + 359 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 326, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 505, + 339 + ], + "score": 1.0, + "content": "Figure 5: We compare the training performance of different types of annealing methods used with", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 336, + 504, + 349 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 375, + 349 + ], + "score": 1.0, + "content": "mollification procedure to anneal the parameter of the mollification", + "type": "text" + }, + { + "bbox": [ + 376, + 339, + 382, + 348 + ], + "score": 0.74, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 336, + 441, + 349 + ], + "score": 1.0, + "content": ". Decaying the", + "type": "text" + }, + { + "bbox": [ + 441, + 339, + 448, + 348 + ], + "score": 0.75, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 336, + 504, + 349 + ], + "score": 1.0, + "content": "exponentially", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 347, + 336, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 336, + 360 + ], + "score": 1.0, + "content": "achieves both better training and validation performance.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + } + ], + "index": 13.0 + }, + { + "type": "text", + "bbox": [ + 106, + 380, + 506, + 413 + ], + "lines": [ + { + "bbox": [ + 104, + 379, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 104, + 379, + 506, + 393 + ], + "score": 1.0, + "content": "In Figure 6, we show the effect of using the noisy training procedure that we have introduced by sam-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 390, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 506, + 403 + ], + "score": 1.0, + "content": "pling a mask from Bernoulli and Gaussian distributions versu using the deterministic approximation", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 401, + 466, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 466, + 414 + ], + "score": 1.0, + "content": "of this noisy procedure which we also use for the test time but during the training as well.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 104, + 379, + 506, + 414 + ] + }, + { + "type": "image", + "bbox": [ + 196, + 442, + 400, + 580 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 196, + 442, + 400, + 580 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 196, + 442, + 400, + 580 + ], + "spans": [ + { + "bbox": [ + 196, + 442, + 400, + 580 + ], + "score": 0.967, + "type": "image", + "image_path": "4b8a3ac20b57ecaf26bfbb68e0f1deb19984fdd2b9a2d6ea11e3f0a10189a871.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 196, + 442, + 400, + 457.3333333333333 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 196, + 457.3333333333333, + 400, + 472.66666666666663 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 196, + 472.66666666666663, + 400, + 487.99999999999994 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 196, + 487.99999999999994, + 400, + 503.33333333333326 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 196, + 503.33333333333326, + 400, + 518.6666666666666 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 196, + 518.6666666666666, + 400, + 534.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 196, + 534.0, + 400, + 549.3333333333334 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 196, + 549.3333333333334, + 400, + 564.6666666666667 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 196, + 564.6666666666667, + 400, + 580.0000000000001 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 587, + 504, + 620 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 586, + 506, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 506, + 600 + ], + "score": 1.0, + "content": "Figure 6: We show the learning curves of the model where we don’t inject the noise during the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 597, + 506, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 506, + 611 + ], + "score": 1.0, + "content": "training and instead use the deterministic approximation for the mollification during the training as", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 608, + 370, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 370, + 621 + ], + "score": 1.0, + "content": "well. The differerence in terms of speed of learning is very small.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + } + ], + "index": 28.0 + }, + { + "type": "text", + "bbox": [ + 107, + 641, + 505, + 684 + ], + "lines": [ + { + "bbox": [ + 105, + 640, + 506, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 640, + 506, + 655 + ], + "score": 1.0, + "content": "In Figure 7, we compare the results obtained for the model using mollification obtained with or", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 651, + 505, + 666 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 505, + 666 + ], + "score": 1.0, + "content": "without batch normalization and feed-forward residual networks. The mollified model performs very", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 662, + 505, + 675 + ], + "spans": [ + { + "bbox": [ + 106, + 662, + 505, + 675 + ], + "score": 1.0, + "content": "closely to the MLP trained with residual connections and the batchnorm. However, using residual", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 672, + 372, + 686 + ], + "spans": [ + { + "bbox": [ + 105, + 672, + 372, + 686 + ], + "score": 1.0, + "content": "connections and batch-norm does not seem to improve the results.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34.5, + "bbox_fs": [ + 105, + 640, + 506, + 686 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 689, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 689, + 506, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 506, + 703 + ], + "score": 1.0, + "content": "We have tried to run experiment with the Monte-Carlo approximation of the mollification which is", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 700, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 700, + 506, + 712 + ], + "score": 1.0, + "content": "derived in Appendix A, however when we start with large noise and anneal the noise during the train-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "ing, the model was very unstable and training was diverging. If we start with small noise and anneal", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "the magnitude of the noise during the training, we could not observe any effect of it on the training.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 689, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 196, + 88, + 400, + 226 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 196, + 88, + 400, + 226 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 196, + 88, + 400, + 226 + ], + "spans": [ + { + "bbox": [ + 196, + 88, + 400, + 226 + ], + "score": 0.966, + "type": "image", + "image_path": "24f40f65392ee90e6386375192de3d2b7240bb6ad5b1529448614804c614f410.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 196, + 88, + 400, + 100.54545454545455 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 196, + 100.54545454545455, + 400, + 113.0909090909091 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 196, + 113.0909090909091, + 400, + 125.63636363636364 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 196, + 125.63636363636364, + 400, + 138.1818181818182 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 196, + 138.1818181818182, + 400, + 150.72727272727272 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 196, + 150.72727272727272, + 400, + 163.27272727272725 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 196, + 163.27272727272725, + 400, + 175.81818181818178 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 196, + 175.81818181818178, + 400, + 188.36363636363632 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 196, + 188.36363636363632, + 400, + 200.90909090909085 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 196, + 200.90909090909085, + 400, + 213.45454545454538 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 196, + 213.45454545454538, + 400, + 225.99999999999991 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 234, + 506, + 276 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 234, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 505, + 246 + ], + "score": 1.0, + "content": "Figure 7: We investigate the effect of using batch norm and residual connection for mollifcation and", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "score": 1.0, + "content": "compare against to the network with residual connections and batch-norm. The effect of batch norm", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 254, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 505, + 267 + ], + "score": 1.0, + "content": "on this task for mollification seems to be very small and training convergence performance of the all", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 265, + 282, + 277 + ], + "spans": [ + { + "bbox": [ + 106, + 265, + 282, + 277 + ], + "score": 1.0, + "content": "the approaches are very close to each other.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5 + } + ], + "index": 8.75 + }, + { + "type": "image", + "bbox": [ + 149, + 302, + 297, + 410 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 149, + 302, + 297, + 410 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 149, + 302, + 297, + 410 + ], + "spans": [ + { + "bbox": [ + 149, + 302, + 297, + 410 + ], + "score": 0.967, + "type": "image", + "image_path": "c41840e048fd609433dd3b430329544afc0d1b86c1b1c7b4544f1462c89c0e19.jpg" + } + ] + } + ], + "index": 15.5, + "virtual_lines": [ + { + "bbox": [ + 149, + 302, + 297, + 356.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 149, + 356.0, + 297, + 410.0 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 128, + 420, + 323, + 451 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 127, + 419, + 324, + 431 + ], + "spans": [ + { + "bbox": [ + 127, + 419, + 324, + 431 + ], + "score": 1.0, + "content": "Figure 8: The learning curves of a 6-layers MLP", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 127, + 429, + 324, + 443 + ], + "spans": [ + { + "bbox": [ + 127, + 429, + 324, + 443 + ], + "score": 1.0, + "content": "with sigmoid activation function on 40 bit parity", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 127, + 441, + 150, + 452 + ], + "spans": [ + { + "bbox": [ + 127, + 441, + 150, + 452 + ], + "score": 1.0, + "content": "task.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21 + } + ], + "index": 18.25 + }, + { + "type": "table", + "bbox": [ + 334, + 357, + 479, + 412 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 334, + 357, + 479, + 412 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 334, + 357, + 479, + 412 + ], + "spans": [ + { + "bbox": [ + 334, + 357, + 479, + 412 + ], + "score": 0.963, + "html": "
Test Accuracy
Stochastic Depth93.25
Mollified Convnet92.45
ResNet91.78
", + "type": "table", + "image_path": "f378c6167f9ea9fa01daa4b81cf06eab81db69264d83a592a7353cf57198fa76.jpg" + } + ] + } + ], + "index": 17.5, + "virtual_lines": [ + { + "bbox": [ + 334, + 357, + 479, + 384.5 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 334, + 384.5, + 479, + 412.0 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 333, + 420, + 482, + 441 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 330, + 419, + 483, + 432 + ], + "spans": [ + { + "bbox": [ + 330, + 419, + 483, + 432 + ], + "score": 1.0, + "content": "Table 1: CIFAR10 deep convolutional", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 330, + 430, + 396, + 441 + ], + "spans": [ + { + "bbox": [ + 330, + 430, + 396, + 441 + ], + "score": 1.0, + "content": "neural network.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.0 + } + ], + "index": 19.25 + }, + { + "type": "title", + "bbox": [ + 107, + 479, + 243, + 489 + ], + "lines": [ + { + "bbox": [ + 106, + 478, + 245, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 478, + 245, + 491 + ], + "score": 1.0, + "content": "8.2 DEEP MLP EXPERIMENTS", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 501, + 505, + 564 + ], + "lines": [ + { + "bbox": [ + 105, + 501, + 505, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 505, + 514 + ], + "score": 1.0, + "content": "Deep Parity Experiments Training neural networks on a high-dimensional parity problem can", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 512, + 506, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 506, + 524 + ], + "score": 1.0, + "content": "be challenging (Graves, 2016; Kalchbrenner et al., 2015). We experiment on forty dimensional (bits)", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 522, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 506, + 534 + ], + "score": 1.0, + "content": "parity problem with 6-layer MLP using sigmoid activation function. All the models are initialized", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 532, + 505, + 544 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 505, + 544 + ], + "score": 1.0, + "content": "with Glorot initialization Glorot et al. (2011) and trained with SGD with momentum. We compare", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 543, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 505, + 555 + ], + "score": 1.0, + "content": "an MLP with residual connections using batch normalization and a mollified network with sigmoid", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 554, + 454, + 566 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 454, + 566 + ], + "score": 1.0, + "content": "activation function. As can be seen in Figure 8, the mollified network converges faster.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 107, + 577, + 505, + 640 + ], + "lines": [ + { + "bbox": [ + 106, + 576, + 506, + 589 + ], + "spans": [ + { + "bbox": [ + 106, + 576, + 506, + 589 + ], + "score": 1.0, + "content": "Deep Pentomino Pentomino is a toy-image dataset where each image has 3 Pentomino blocks.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 587, + 507, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 507, + 600 + ], + "score": 1.0, + "content": "The task is to predict whether if there is a different shape in the image or not (Gülçehre & Bengio,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 597, + 507, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 339, + 610 + ], + "score": 1.0, + "content": "2013). The best reported result on this task with MLPs is", + "type": "text" + }, + { + "bbox": [ + 339, + 597, + 372, + 608 + ], + "score": 0.89, + "content": "6 8 . 1 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 597, + 507, + 610 + ], + "score": 1.0, + "content": "accuracy (Gulcehre et al., 2014).", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 608, + 505, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 608, + 505, + 620 + ], + "score": 1.0, + "content": "The same model as ours trained without noisy activation function and vanilla residual connections", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 618, + 506, + 631 + ], + "spans": [ + { + "bbox": [ + 106, + 618, + 136, + 631 + ], + "score": 1.0, + "content": "scored", + "type": "text" + }, + { + "bbox": [ + 136, + 618, + 164, + 629 + ], + "score": 0.87, + "content": "6 9 . 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 618, + 350, + 631 + ], + "score": 1.0, + "content": "accuracy, while our mollified version scored", + "type": "text" + }, + { + "bbox": [ + 351, + 618, + 383, + 629 + ], + "score": 0.88, + "content": "7 5 . 1 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 618, + 506, + 631 + ], + "score": 1.0, + "content": "accuracy after 100 epochs of", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 629, + 217, + 641 + ], + "spans": [ + { + "bbox": [ + 106, + 630, + 167, + 641 + ], + "score": 1.0, + "content": "training on the", + "type": "text" + }, + { + "bbox": [ + 167, + 629, + 184, + 640 + ], + "score": 0.84, + "content": "8 0 k", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 630, + 217, + 641 + ], + "score": 1.0, + "content": "dataset.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 107, + 658, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 657, + 506, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 506, + 671 + ], + "score": 1.0, + "content": "CIFAR10 We experimented with deep convolutional neural networks of 110-layers with residual", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 668, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 505, + 681 + ], + "score": 1.0, + "content": "blocks and residual connections comparing our model against ResNet and Stochastic depth. We", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 679, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 679, + 505, + 691 + ], + "score": 1.0, + "content": "adapted the hyperparameters of the Stochastic depth network from Huang et al. (2016a) and we used", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 690, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 690, + 505, + 702 + ], + "score": 1.0, + "content": "the same hyperparameters for our algorithm. We report the training and validation curves of the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 699, + 505, + 713 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 713 + ], + "score": 1.0, + "content": "three models in Figure 10 and the best test accuracy obtained early stopping on validation accuracy", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "over 500 epochs in Table 1. Our model achieves better generalization than ResNet. Stochastic depth", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 721, + 493, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 493, + 732 + ], + "score": 1.0, + "content": "achieves better generalization, but it might be possible to combine both and obtain better results.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 40 + } + ], + "page_idx": 9, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "10", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 196, + 88, + 400, + 226 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 196, + 88, + 400, + 226 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 196, + 88, + 400, + 226 + ], + "spans": [ + { + "bbox": [ + 196, + 88, + 400, + 226 + ], + "score": 0.966, + "type": "image", + "image_path": "24f40f65392ee90e6386375192de3d2b7240bb6ad5b1529448614804c614f410.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 196, + 88, + 400, + 100.54545454545455 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 196, + 100.54545454545455, + 400, + 113.0909090909091 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 196, + 113.0909090909091, + 400, + 125.63636363636364 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 196, + 125.63636363636364, + 400, + 138.1818181818182 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 196, + 138.1818181818182, + 400, + 150.72727272727272 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 196, + 150.72727272727272, + 400, + 163.27272727272725 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 196, + 163.27272727272725, + 400, + 175.81818181818178 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 196, + 175.81818181818178, + 400, + 188.36363636363632 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 196, + 188.36363636363632, + 400, + 200.90909090909085 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 196, + 200.90909090909085, + 400, + 213.45454545454538 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 196, + 213.45454545454538, + 400, + 225.99999999999991 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 234, + 506, + 276 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 234, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 505, + 246 + ], + "score": 1.0, + "content": "Figure 7: We investigate the effect of using batch norm and residual connection for mollifcation and", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "score": 1.0, + "content": "compare against to the network with residual connections and batch-norm. The effect of batch norm", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 254, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 505, + 267 + ], + "score": 1.0, + "content": "on this task for mollification seems to be very small and training convergence performance of the all", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 265, + 282, + 277 + ], + "spans": [ + { + "bbox": [ + 106, + 265, + 282, + 277 + ], + "score": 1.0, + "content": "the approaches are very close to each other.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5 + } + ], + "index": 8.75 + }, + { + "type": "image", + "bbox": [ + 149, + 302, + 297, + 410 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 149, + 302, + 297, + 410 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 149, + 302, + 297, + 410 + ], + "spans": [ + { + "bbox": [ + 149, + 302, + 297, + 410 + ], + "score": 0.967, + "type": "image", + "image_path": "c41840e048fd609433dd3b430329544afc0d1b86c1b1c7b4544f1462c89c0e19.jpg" + } + ] + } + ], + "index": 15.5, + "virtual_lines": [ + { + "bbox": [ + 149, + 302, + 297, + 356.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 149, + 356.0, + 297, + 410.0 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 128, + 420, + 323, + 451 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 127, + 419, + 324, + 431 + ], + "spans": [ + { + "bbox": [ + 127, + 419, + 324, + 431 + ], + "score": 1.0, + "content": "Figure 8: The learning curves of a 6-layers MLP", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 127, + 429, + 324, + 443 + ], + "spans": [ + { + "bbox": [ + 127, + 429, + 324, + 443 + ], + "score": 1.0, + "content": "with sigmoid activation function on 40 bit parity", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 127, + 441, + 150, + 452 + ], + "spans": [ + { + "bbox": [ + 127, + 441, + 150, + 452 + ], + "score": 1.0, + "content": "task.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21 + } + ], + "index": 18.25 + }, + { + "type": "table", + "bbox": [ + 334, + 357, + 479, + 412 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 334, + 357, + 479, + 412 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 334, + 357, + 479, + 412 + ], + "spans": [ + { + "bbox": [ + 334, + 357, + 479, + 412 + ], + "score": 0.963, + "html": "
Test Accuracy
Stochastic Depth93.25
Mollified Convnet92.45
ResNet91.78
", + "type": "table", + "image_path": "f378c6167f9ea9fa01daa4b81cf06eab81db69264d83a592a7353cf57198fa76.jpg" + } + ] + } + ], + "index": 17.5, + "virtual_lines": [ + { + "bbox": [ + 334, + 357, + 479, + 384.5 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 334, + 384.5, + 479, + 412.0 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 333, + 420, + 482, + 441 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 330, + 419, + 483, + 432 + ], + "spans": [ + { + "bbox": [ + 330, + 419, + 483, + 432 + ], + "score": 1.0, + "content": "Table 1: CIFAR10 deep convolutional", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 330, + 430, + 396, + 441 + ], + "spans": [ + { + "bbox": [ + 330, + 430, + 396, + 441 + ], + "score": 1.0, + "content": "neural network.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.0 + } + ], + "index": 19.25 + }, + { + "type": "title", + "bbox": [ + 107, + 479, + 243, + 489 + ], + "lines": [ + { + "bbox": [ + 106, + 478, + 245, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 478, + 245, + 491 + ], + "score": 1.0, + "content": "8.2 DEEP MLP EXPERIMENTS", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 501, + 505, + 564 + ], + "lines": [ + { + "bbox": [ + 105, + 501, + 505, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 505, + 514 + ], + "score": 1.0, + "content": "Deep Parity Experiments Training neural networks on a high-dimensional parity problem can", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 512, + 506, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 506, + 524 + ], + "score": 1.0, + "content": "be challenging (Graves, 2016; Kalchbrenner et al., 2015). We experiment on forty dimensional (bits)", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 522, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 506, + 534 + ], + "score": 1.0, + "content": "parity problem with 6-layer MLP using sigmoid activation function. All the models are initialized", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 532, + 505, + 544 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 505, + 544 + ], + "score": 1.0, + "content": "with Glorot initialization Glorot et al. (2011) and trained with SGD with momentum. We compare", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 543, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 505, + 555 + ], + "score": 1.0, + "content": "an MLP with residual connections using batch normalization and a mollified network with sigmoid", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 554, + 454, + 566 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 454, + 566 + ], + "score": 1.0, + "content": "activation function. As can be seen in Figure 8, the mollified network converges faster.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 501, + 506, + 566 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 577, + 505, + 640 + ], + "lines": [ + { + "bbox": [ + 106, + 576, + 506, + 589 + ], + "spans": [ + { + "bbox": [ + 106, + 576, + 506, + 589 + ], + "score": 1.0, + "content": "Deep Pentomino Pentomino is a toy-image dataset where each image has 3 Pentomino blocks.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 587, + 507, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 507, + 600 + ], + "score": 1.0, + "content": "The task is to predict whether if there is a different shape in the image or not (Gülçehre & Bengio,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 597, + 507, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 339, + 610 + ], + "score": 1.0, + "content": "2013). The best reported result on this task with MLPs is", + "type": "text" + }, + { + "bbox": [ + 339, + 597, + 372, + 608 + ], + "score": 0.89, + "content": "6 8 . 1 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 597, + 507, + 610 + ], + "score": 1.0, + "content": "accuracy (Gulcehre et al., 2014).", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 608, + 505, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 608, + 505, + 620 + ], + "score": 1.0, + "content": "The same model as ours trained without noisy activation function and vanilla residual connections", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 618, + 506, + 631 + ], + "spans": [ + { + "bbox": [ + 106, + 618, + 136, + 631 + ], + "score": 1.0, + "content": "scored", + "type": "text" + }, + { + "bbox": [ + 136, + 618, + 164, + 629 + ], + "score": 0.87, + "content": "6 9 . 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 618, + 350, + 631 + ], + "score": 1.0, + "content": "accuracy, while our mollified version scored", + "type": "text" + }, + { + "bbox": [ + 351, + 618, + 383, + 629 + ], + "score": 0.88, + "content": "7 5 . 1 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 618, + 506, + 631 + ], + "score": 1.0, + "content": "accuracy after 100 epochs of", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 629, + 217, + 641 + ], + "spans": [ + { + "bbox": [ + 106, + 630, + 167, + 641 + ], + "score": 1.0, + "content": "training on the", + "type": "text" + }, + { + "bbox": [ + 167, + 629, + 184, + 640 + ], + "score": 0.84, + "content": "8 0 k", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 630, + 217, + 641 + ], + "score": 1.0, + "content": "dataset.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 576, + 507, + 641 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 658, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 657, + 506, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 506, + 671 + ], + "score": 1.0, + "content": "CIFAR10 We experimented with deep convolutional neural networks of 110-layers with residual", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 668, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 505, + 681 + ], + "score": 1.0, + "content": "blocks and residual connections comparing our model against ResNet and Stochastic depth. We", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 679, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 679, + 505, + 691 + ], + "score": 1.0, + "content": "adapted the hyperparameters of the Stochastic depth network from Huang et al. (2016a) and we used", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 690, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 690, + 505, + 702 + ], + "score": 1.0, + "content": "the same hyperparameters for our algorithm. We report the training and validation curves of the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 699, + 505, + 713 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 713 + ], + "score": 1.0, + "content": "three models in Figure 10 and the best test accuracy obtained early stopping on validation accuracy", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "over 500 epochs in Table 1. Our model achieves better generalization than ResNet. Stochastic depth", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 721, + 493, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 493, + 732 + ], + "score": 1.0, + "content": "achieves better generalization, but it might be possible to combine both and obtain better results.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 657, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 165, + 89, + 307, + 189 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 165, + 89, + 307, + 189 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 165, + 89, + 307, + 189 + ], + "spans": [ + { + "bbox": [ + 165, + 89, + 307, + 189 + ], + "score": 0.962, + "type": "image", + "image_path": "345e69a1318bab42ba15b8295abfbd900d2a22fb372d4cfae106a2e0cb0e9af6.jpg" + } + ] + } + ], + "index": 0.5, + "virtual_lines": [ + { + "bbox": [ + 165, + 89, + 307, + 139.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 165, + 139.0, + 307, + 189.0 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 139, + 199, + 335, + 231 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 139, + 198, + 336, + 210 + ], + "spans": [ + { + "bbox": [ + 139, + 198, + 336, + 210 + ], + "score": 1.0, + "content": "Figure 9: The training curve of a bidirectional-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 207, + 336, + 223 + ], + "spans": [ + { + "bbox": [ + 138, + 207, + 336, + 223 + ], + "score": 1.0, + "content": "RNN that predicts the embedding corresponding", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 220, + 252, + 231 + ], + "spans": [ + { + "bbox": [ + 138, + 220, + 252, + 231 + ], + "score": 1.0, + "content": "to a sequence of characters.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5 + } + ], + "index": 2.75 + }, + { + "type": "table", + "bbox": [ + 347, + 147, + 464, + 191 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 347, + 147, + 464, + 191 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 347, + 147, + 464, + 191 + ], + "spans": [ + { + "bbox": [ + 347, + 147, + 464, + 191 + ], + "score": 0.96, + "html": "
Test PPL
LSTM119.4
Mollified LSTM115.7
", + "type": "table", + "image_path": "81d61387d971eff68d8d3252462d7ec7a797292fc2c55e49e9d151dea12ae429.jpg" + } + ] + } + ], + "index": 2.5, + "virtual_lines": [ + { + "bbox": [ + 347, + 147, + 464, + 169.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 347, + 169.0, + 464, + 191.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 342, + 199, + 473, + 231 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 341, + 198, + 473, + 211 + ], + "spans": [ + { + "bbox": [ + 341, + 198, + 473, + 211 + ], + "score": 1.0, + "content": "Table 2: 3-layered LSTM net-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 341, + 207, + 473, + 223 + ], + "spans": [ + { + "bbox": [ + 341, + 207, + 473, + 223 + ], + "score": 1.0, + "content": "work on word-level language", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 341, + 220, + 421, + 231 + ], + "spans": [ + { + "bbox": [ + 341, + 220, + 421, + 231 + ], + "score": 1.0, + "content": "modeling for PTB.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + } + ], + "index": 5.25 + }, + { + "type": "title", + "bbox": [ + 107, + 251, + 237, + 264 + ], + "lines": [ + { + "bbox": [ + 104, + 250, + 239, + 266 + ], + "spans": [ + { + "bbox": [ + 104, + 250, + 239, + 266 + ], + "score": 1.0, + "content": "9 LSTM EXPERIMENTS", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 276, + 505, + 318 + ], + "lines": [ + { + "bbox": [ + 105, + 275, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 290 + ], + "score": 1.0, + "content": "Predicting the Character Embeddings from Characters Learning the mapping from sequences", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 286, + 505, + 298 + ], + "spans": [ + { + "bbox": [ + 106, + 286, + 505, + 298 + ], + "score": 1.0, + "content": "of characters to the word-embeddings is a difficult problem. Thus one needs to use a highly non-linear", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 295, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 506, + 309 + ], + "score": 1.0, + "content": "function. We trained a word2vec model on Wikipedia with embeddings of size 500 (Mikolov et al.,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 307, + 269, + 320 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 269, + 320 + ], + "score": 1.0, + "content": "2014) with a vocabulary of size 374557.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 107, + 330, + 504, + 362 + ], + "lines": [ + { + "bbox": [ + 105, + 329, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 329, + 505, + 343 + ], + "score": 1.0, + "content": "LSTM Language Modeling We evaluate our model on LSTM language modeling. Our baseline", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 340, + 505, + 352 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 505, + 352 + ], + "score": 1.0, + "content": "model is a 3-layer stacked LSTM without any regularization. We observed that mollified model con-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 351, + 506, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 506, + 364 + ], + "score": 1.0, + "content": "verges faster and achieves better results. We provide the results for PTB language modeling in Table 2.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "title", + "bbox": [ + 109, + 378, + 202, + 390 + ], + "lines": [ + { + "bbox": [ + 105, + 376, + 204, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 204, + 394 + ], + "score": 1.0, + "content": "10 CONCLUSION", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 402, + 505, + 476 + ], + "lines": [ + { + "bbox": [ + 106, + 403, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 403, + 505, + 415 + ], + "score": 1.0, + "content": "We propose a novel method for training neural networks inspired by an idea of continuation,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 414, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 505, + 425 + ], + "score": 1.0, + "content": "smoothing techniques and recent advances in non-convex optimization algorithms. The method", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 423, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 505, + 435 + ], + "score": 1.0, + "content": "makes learning easier by starting from a simpler model, solving a well-behaved problem, and", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 434, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 506, + 447 + ], + "score": 1.0, + "content": "gradually transitioning to a more complicated setting. We show improvements on very deep models,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 444, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 505, + 456 + ], + "score": 1.0, + "content": "difficult to optimize tasks and compare with powerful techniques such as batch-normalization and", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 455, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 505, + 467 + ], + "score": 1.0, + "content": "residual connections. We also show that the mollification procedure improves the generalization", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 465, + 267, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 267, + 477 + ], + "score": 1.0, + "content": "performance of the model on two tasks.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 481, + 505, + 534 + ], + "lines": [ + { + "bbox": [ + 105, + 479, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 506, + 495 + ], + "score": 1.0, + "content": "Our future work includes testing this method on large-scale language tasks that require long training", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 491, + 506, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 506, + 504 + ], + "score": 1.0, + "content": "time, e.g., machine translation and language modeling. Moreover, (Kaiser & Sutskever, 2015)", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 501, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 505, + 515 + ], + "score": 1.0, + "content": "observed that the training of Neural-GPU model can be improved significantly by using gradient noise", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 512, + 505, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 505, + 526 + ], + "score": 1.0, + "content": "which can be related to the smoothing of the loss surface, it would be interesting to try mollification on", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 522, + 507, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 507, + 537 + ], + "score": 1.0, + "content": "this model to see if the training of Neural GPU can be made easier by using mollification procedure.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28 + }, + { + "type": "title", + "bbox": [ + 108, + 551, + 225, + 563 + ], + "lines": [ + { + "bbox": [ + 107, + 549, + 226, + 565 + ], + "spans": [ + { + "bbox": [ + 107, + 549, + 226, + 565 + ], + "score": 1.0, + "content": "ACKNOWLEDGEMENTS", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 574, + 505, + 627 + ], + "lines": [ + { + "bbox": [ + 106, + 574, + 504, + 586 + ], + "spans": [ + { + "bbox": [ + 106, + 574, + 504, + 586 + ], + "score": 1.0, + "content": "We thank Nicholas Ballas and Misha Denil for the valuable discussions and their feedback. We", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 585, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 585, + 505, + 597 + ], + "score": 1.0, + "content": "would like to also thank the developers of Theano 4, for developing such a powerful tool for scientific", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 104, + 593, + 506, + 610 + ], + "spans": [ + { + "bbox": [ + 104, + 593, + 506, + 610 + ], + "score": 1.0, + "content": "computing Theano Development Team (2016). We acknowledge the support of the following", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 604, + 507, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 507, + 621 + ], + "score": 1.0, + "content": "organizations for research funding and computing support: NSERC, Samsung, Calcul Québec,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 616, + 345, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 345, + 628 + ], + "score": 1.0, + "content": "Compute Canada, the Canada Research Chairs and CIFAR.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34 + }, + { + "type": "title", + "bbox": [ + 107, + 644, + 175, + 655 + ], + "lines": [ + { + "bbox": [ + 106, + 644, + 176, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 176, + 657 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 108, + 662, + 504, + 684 + ], + "lines": [ + { + "bbox": [ + 104, + 659, + 507, + 676 + ], + "spans": [ + { + "bbox": [ + 104, + 659, + 507, + 676 + ], + "score": 1.0, + "content": "E. L. Allgower and K. Georg. Numerical Continuation Methods. An Introduction. Springer-Verlag,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 114, + 671, + 141, + 684 + ], + "spans": [ + { + "bbox": [ + 114, + 671, + 141, + 684 + ], + "score": 1.0, + "content": "1980.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 109, + 690, + 503, + 713 + ], + "lines": [ + { + "bbox": [ + 107, + 691, + 504, + 703 + ], + "spans": [ + { + "bbox": [ + 107, + 691, + 504, + 703 + ], + "score": 1.0, + "content": "Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. Neural machine translation by jointly", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 702, + 398, + 713 + ], + "spans": [ + { + "bbox": [ + 115, + 702, + 398, + 713 + ], + "score": 1.0, + "content": "learning to align and translate. arXiv preprint arXiv:1409.0473, 2014.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5 + } + ], + "page_idx": 10, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 119, + 722, + 339, + 732 + ], + "lines": [ + { + "bbox": [ + 119, + 720, + 339, + 733 + ], + "spans": [ + { + "bbox": [ + 119, + 720, + 339, + 733 + ], + "score": 1.0, + "content": "4http://deeplearning.net/software/theano/", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 752, + 309, + 760 + ], + "lines": [] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 165, + 89, + 307, + 189 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 165, + 89, + 307, + 189 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 165, + 89, + 307, + 189 + ], + "spans": [ + { + "bbox": [ + 165, + 89, + 307, + 189 + ], + "score": 0.962, + "type": "image", + "image_path": "345e69a1318bab42ba15b8295abfbd900d2a22fb372d4cfae106a2e0cb0e9af6.jpg" + } + ] + } + ], + "index": 0.5, + "virtual_lines": [ + { + "bbox": [ + 165, + 89, + 307, + 139.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 165, + 139.0, + 307, + 189.0 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 139, + 199, + 335, + 231 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 139, + 198, + 336, + 210 + ], + "spans": [ + { + "bbox": [ + 139, + 198, + 336, + 210 + ], + "score": 1.0, + "content": "Figure 9: The training curve of a bidirectional-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 207, + 336, + 223 + ], + "spans": [ + { + "bbox": [ + 138, + 207, + 336, + 223 + ], + "score": 1.0, + "content": "RNN that predicts the embedding corresponding", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 220, + 252, + 231 + ], + "spans": [ + { + "bbox": [ + 138, + 220, + 252, + 231 + ], + "score": 1.0, + "content": "to a sequence of characters.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5 + } + ], + "index": 2.75 + }, + { + "type": "table", + "bbox": [ + 347, + 147, + 464, + 191 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 347, + 147, + 464, + 191 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 347, + 147, + 464, + 191 + ], + "spans": [ + { + "bbox": [ + 347, + 147, + 464, + 191 + ], + "score": 0.96, + "html": "
Test PPL
LSTM119.4
Mollified LSTM115.7
", + "type": "table", + "image_path": "81d61387d971eff68d8d3252462d7ec7a797292fc2c55e49e9d151dea12ae429.jpg" + } + ] + } + ], + "index": 2.5, + "virtual_lines": [ + { + "bbox": [ + 347, + 147, + 464, + 169.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 347, + 169.0, + 464, + 191.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 342, + 199, + 473, + 231 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 341, + 198, + 473, + 211 + ], + "spans": [ + { + "bbox": [ + 341, + 198, + 473, + 211 + ], + "score": 1.0, + "content": "Table 2: 3-layered LSTM net-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 341, + 207, + 473, + 223 + ], + "spans": [ + { + "bbox": [ + 341, + 207, + 473, + 223 + ], + "score": 1.0, + "content": "work on word-level language", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 341, + 220, + 421, + 231 + ], + "spans": [ + { + "bbox": [ + 341, + 220, + 421, + 231 + ], + "score": 1.0, + "content": "modeling for PTB.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + } + ], + "index": 5.25 + }, + { + "type": "title", + "bbox": [ + 107, + 251, + 237, + 264 + ], + "lines": [ + { + "bbox": [ + 104, + 250, + 239, + 266 + ], + "spans": [ + { + "bbox": [ + 104, + 250, + 239, + 266 + ], + "score": 1.0, + "content": "9 LSTM EXPERIMENTS", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 276, + 505, + 318 + ], + "lines": [ + { + "bbox": [ + 105, + 275, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 290 + ], + "score": 1.0, + "content": "Predicting the Character Embeddings from Characters Learning the mapping from sequences", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 286, + 505, + 298 + ], + "spans": [ + { + "bbox": [ + 106, + 286, + 505, + 298 + ], + "score": 1.0, + "content": "of characters to the word-embeddings is a difficult problem. Thus one needs to use a highly non-linear", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 295, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 506, + 309 + ], + "score": 1.0, + "content": "function. We trained a word2vec model on Wikipedia with embeddings of size 500 (Mikolov et al.,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 307, + 269, + 320 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 269, + 320 + ], + "score": 1.0, + "content": "2014) with a vocabulary of size 374557.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 275, + 506, + 320 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 330, + 504, + 362 + ], + "lines": [ + { + "bbox": [ + 105, + 329, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 329, + 505, + 343 + ], + "score": 1.0, + "content": "LSTM Language Modeling We evaluate our model on LSTM language modeling. Our baseline", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 340, + 505, + 352 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 505, + 352 + ], + "score": 1.0, + "content": "model is a 3-layer stacked LSTM without any regularization. We observed that mollified model con-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 351, + 506, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 506, + 364 + ], + "score": 1.0, + "content": "verges faster and achieves better results. We provide the results for PTB language modeling in Table 2.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 329, + 506, + 364 + ] + }, + { + "type": "title", + "bbox": [ + 109, + 378, + 202, + 390 + ], + "lines": [ + { + "bbox": [ + 105, + 376, + 204, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 204, + 394 + ], + "score": 1.0, + "content": "10 CONCLUSION", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 402, + 505, + 476 + ], + "lines": [ + { + "bbox": [ + 106, + 403, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 403, + 505, + 415 + ], + "score": 1.0, + "content": "We propose a novel method for training neural networks inspired by an idea of continuation,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 414, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 505, + 425 + ], + "score": 1.0, + "content": "smoothing techniques and recent advances in non-convex optimization algorithms. The method", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 423, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 505, + 435 + ], + "score": 1.0, + "content": "makes learning easier by starting from a simpler model, solving a well-behaved problem, and", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 434, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 506, + 447 + ], + "score": 1.0, + "content": "gradually transitioning to a more complicated setting. We show improvements on very deep models,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 444, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 505, + 456 + ], + "score": 1.0, + "content": "difficult to optimize tasks and compare with powerful techniques such as batch-normalization and", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 455, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 505, + 467 + ], + "score": 1.0, + "content": "residual connections. We also show that the mollification procedure improves the generalization", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 465, + 267, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 267, + 477 + ], + "score": 1.0, + "content": "performance of the model on two tasks.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 403, + 506, + 477 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 481, + 505, + 534 + ], + "lines": [ + { + "bbox": [ + 105, + 479, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 506, + 495 + ], + "score": 1.0, + "content": "Our future work includes testing this method on large-scale language tasks that require long training", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 491, + 506, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 506, + 504 + ], + "score": 1.0, + "content": "time, e.g., machine translation and language modeling. Moreover, (Kaiser & Sutskever, 2015)", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 501, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 505, + 515 + ], + "score": 1.0, + "content": "observed that the training of Neural-GPU model can be improved significantly by using gradient noise", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 512, + 505, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 505, + 526 + ], + "score": 1.0, + "content": "which can be related to the smoothing of the loss surface, it would be interesting to try mollification on", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 522, + 507, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 507, + 537 + ], + "score": 1.0, + "content": "this model to see if the training of Neural GPU can be made easier by using mollification procedure.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 479, + 507, + 537 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 551, + 225, + 563 + ], + "lines": [ + { + "bbox": [ + 107, + 549, + 226, + 565 + ], + "spans": [ + { + "bbox": [ + 107, + 549, + 226, + 565 + ], + "score": 1.0, + "content": "ACKNOWLEDGEMENTS", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 574, + 505, + 627 + ], + "lines": [ + { + "bbox": [ + 106, + 574, + 504, + 586 + ], + "spans": [ + { + "bbox": [ + 106, + 574, + 504, + 586 + ], + "score": 1.0, + "content": "We thank Nicholas Ballas and Misha Denil for the valuable discussions and their feedback. We", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 585, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 585, + 505, + 597 + ], + "score": 1.0, + "content": "would like to also thank the developers of Theano 4, for developing such a powerful tool for scientific", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 104, + 593, + 506, + 610 + ], + "spans": [ + { + "bbox": [ + 104, + 593, + 506, + 610 + ], + "score": 1.0, + "content": "computing Theano Development Team (2016). We acknowledge the support of the following", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 604, + 507, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 507, + 621 + ], + "score": 1.0, + "content": "organizations for research funding and computing support: NSERC, Samsung, Calcul Québec,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 616, + 345, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 345, + 628 + ], + "score": 1.0, + "content": "Compute Canada, the Canada Research Chairs and CIFAR.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34, + "bbox_fs": [ + 104, + 574, + 507, + 628 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 644, + 175, + 655 + ], + "lines": [ + { + "bbox": [ + 106, + 644, + 176, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 176, + 657 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 108, + 662, + 504, + 684 + ], + "lines": [ + { + "bbox": [ + 104, + 659, + 507, + 676 + ], + "spans": [ + { + "bbox": [ + 104, + 659, + 507, + 676 + ], + "score": 1.0, + "content": "E. L. Allgower and K. Georg. Numerical Continuation Methods. An Introduction. Springer-Verlag,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 114, + 671, + 141, + 684 + ], + "spans": [ + { + "bbox": [ + 114, + 671, + 141, + 684 + ], + "score": 1.0, + "content": "1980.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 104, + 659, + 507, + 684 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 690, + 503, + 713 + ], + "lines": [ + { + "bbox": [ + 107, + 691, + 504, + 703 + ], + "spans": [ + { + "bbox": [ + 107, + 691, + 504, + 703 + ], + "score": 1.0, + "content": "Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. Neural machine translation by jointly", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 702, + 398, + 713 + ], + "spans": [ + { + "bbox": [ + 115, + 702, + 398, + 713 + ], + "score": 1.0, + "content": "learning to align and translate. arXiv preprint arXiv:1409.0473, 2014.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5, + "bbox_fs": [ + 107, + 691, + 504, + 713 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Samy Bengio, Oriol Vinyals, Navdeep Jaitly, and Noam Shazeer. Scheduled sampling for sequence", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 506, + 106 + ], + "score": 1.0, + "content": "prediction with recurrent neural networks. In Advances in Neural Information Processing Systems,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 114, + 103, + 207, + 115 + ], + "spans": [ + { + "bbox": [ + 114, + 103, + 207, + 115 + ], + "score": 1.0, + "content": "pp. 1171–1179, 2015.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 121, + 505, + 144 + ], + "lines": [ + { + "bbox": [ + 107, + 122, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 107, + 122, + 505, + 133 + ], + "score": 1.0, + "content": "Yoshua Bengio, Jérôme Louradour, Ronan Collobert, and Jason Weston. Curriculum learning. In Pro-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 132, + 507, + 145 + ], + "spans": [ + { + "bbox": [ + 116, + 132, + 507, + 145 + ], + "score": 1.0, + "content": "ceedings of the 26th annual international conference on machine learning, pp. 41–48. ACM, 2009.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 106, + 150, + 504, + 173 + ], + "lines": [ + { + "bbox": [ + 105, + 149, + 505, + 164 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 505, + 164 + ], + "score": 1.0, + "content": "Léon Bottou. Online algorithms and stochastic approximations. In David Saad (ed.), Online Learning", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 160, + 410, + 173 + ], + "spans": [ + { + "bbox": [ + 116, + 160, + 410, + 173 + ], + "score": 1.0, + "content": "in Neural Networks. Cambridge University Press, Cambridge, UK, 1998.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 107, + 179, + 504, + 212 + ], + "lines": [ + { + "bbox": [ + 105, + 178, + 506, + 192 + ], + "spans": [ + { + "bbox": [ + 105, + 178, + 506, + 192 + ], + "score": 1.0, + "content": "Kyunghyun Cho, Bart Van Merriënboer, Caglar Gulcehre, Dzmitry Bahdanau, Fethi Bougares,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 189, + 506, + 202 + ], + "spans": [ + { + "bbox": [ + 115, + 189, + 506, + 202 + ], + "score": 1.0, + "content": "Holger Schwenk, and Yoshua Bengio. Learning phrase representations using rnn encoder-decoder", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 200, + 413, + 213 + ], + "spans": [ + { + "bbox": [ + 115, + 200, + 413, + 213 + ], + "score": 1.0, + "content": "for statistical machine translation. arXiv preprint arXiv:1406.1078, 2014.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 106, + 218, + 504, + 240 + ], + "lines": [ + { + "bbox": [ + 106, + 218, + 505, + 231 + ], + "spans": [ + { + "bbox": [ + 106, + 218, + 505, + 231 + ], + "score": 1.0, + "content": "Anna Choromanska, Mikael Henaff, Michael Mathieu, Gérard Ben Arous, and Yann LeCun. The", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 228, + 286, + 241 + ], + "spans": [ + { + "bbox": [ + 116, + 228, + 286, + 241 + ], + "score": 1.0, + "content": "loss surface of multilayer networks, 2014.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 108, + 247, + 504, + 279 + ], + "lines": [ + { + "bbox": [ + 107, + 247, + 505, + 259 + ], + "spans": [ + { + "bbox": [ + 107, + 247, + 505, + 259 + ], + "score": 1.0, + "content": "Yann Dauphin, Razvan Pascanu, Caglar Gulcehre, Kyunghyun Cho, Surya Ganguli, and Yoshua", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 258, + 506, + 270 + ], + "spans": [ + { + "bbox": [ + 115, + 258, + 506, + 270 + ], + "score": 1.0, + "content": "Bengio. Identifying and attacking the saddle point problem in high-dimensional non-convex", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 268, + 259, + 279 + ], + "spans": [ + { + "bbox": [ + 115, + 268, + 259, + 279 + ], + "score": 1.0, + "content": "optimization. In NIPS’2014, 2014.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 285, + 504, + 308 + ], + "lines": [ + { + "bbox": [ + 106, + 285, + 506, + 298 + ], + "spans": [ + { + "bbox": [ + 106, + 285, + 506, + 298 + ], + "score": 1.0, + "content": "Lawrence C Evans. Partial differential equations. Graduate Studies in Mathematics, 19:251–258,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 114, + 294, + 142, + 309 + ], + "spans": [ + { + "bbox": [ + 114, + 294, + 142, + 309 + ], + "score": 1.0, + "content": "1998.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 107, + 315, + 504, + 337 + ], + "lines": [ + { + "bbox": [ + 106, + 315, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 106, + 315, + 505, + 327 + ], + "score": 1.0, + "content": "Xavier Glorot, Antoine Bordes, and Yoshua Bengio. Deep sparse rectifier neural networks. In", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 325, + 237, + 338 + ], + "spans": [ + { + "bbox": [ + 115, + 325, + 237, + 338 + ], + "score": 1.0, + "content": "AISTATS, pp. 315–323, 2011.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 106, + 343, + 504, + 366 + ], + "lines": [ + { + "bbox": [ + 106, + 343, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 106, + 343, + 505, + 356 + ], + "score": 1.0, + "content": "Alex Graves. Practical variational inference for neural networks. In Advances in Neural Information", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 354, + 289, + 366 + ], + "spans": [ + { + "bbox": [ + 115, + 354, + 289, + 366 + ], + "score": 1.0, + "content": "Processing Systems, pp. 2348–2356, 2011.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 106, + 372, + 505, + 395 + ], + "lines": [ + { + "bbox": [ + 105, + 371, + 506, + 386 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 506, + 386 + ], + "score": 1.0, + "content": "Alex Graves. Adaptive computation time for recurrent neural networks. arXiv preprint", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 382, + 220, + 394 + ], + "spans": [ + { + "bbox": [ + 115, + 382, + 220, + 394 + ], + "score": 1.0, + "content": "arXiv:1603.08983, 2016.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 106, + 401, + 504, + 424 + ], + "lines": [ + { + "bbox": [ + 107, + 401, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 107, + 401, + 506, + 414 + ], + "score": 1.0, + "content": "Çaglar Gülçehre and Yoshua Bengio. Knowledge matters: Importance of prior information for ˘", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 412, + 330, + 424 + ], + "spans": [ + { + "bbox": [ + 115, + 412, + 330, + 424 + ], + "score": 1.0, + "content": "optimization. arXiv preprint arXiv:1301.4083, 2013.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 107, + 430, + 505, + 463 + ], + "lines": [ + { + "bbox": [ + 105, + 429, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 506, + 443 + ], + "score": 1.0, + "content": "Caglar Gulcehre, Kyunghyun Cho, Razvan Pascanu, and Yoshua Bengio. Learned-norm pooling for", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 440, + 505, + 454 + ], + "spans": [ + { + "bbox": [ + 115, + 440, + 505, + 454 + ], + "score": 1.0, + "content": "deep feedforward and recurrent neural networks. In Machine Learning and Knowledge Discovery", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 451, + 293, + 463 + ], + "spans": [ + { + "bbox": [ + 115, + 451, + 293, + 463 + ], + "score": 1.0, + "content": "in Databases, pp. 530–546. Springer, 2014.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 469, + 504, + 492 + ], + "lines": [ + { + "bbox": [ + 105, + 468, + 506, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 506, + 482 + ], + "score": 1.0, + "content": "Caglar Gulcehre, Marcin Moczulski, Misha Denil, and Yoshua Bengio. Noisy activation functions.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 114, + 478, + 143, + 492 + ], + "spans": [ + { + "bbox": [ + 114, + 478, + 143, + 492 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 106, + 498, + 504, + 520 + ], + "lines": [ + { + "bbox": [ + 106, + 498, + 505, + 510 + ], + "spans": [ + { + "bbox": [ + 106, + 498, + 505, + 510 + ], + "score": 1.0, + "content": "Elad Hazan, Kfir Y Levy, and Shai Shalev-Shwartz. On graduated optimization for stochastic", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 509, + 371, + 520 + ], + "spans": [ + { + "bbox": [ + 115, + 509, + 371, + 520 + ], + "score": 1.0, + "content": "non-convex problems. arXiv preprint arXiv:1503.03712, 2015.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 106, + 527, + 504, + 549 + ], + "lines": [ + { + "bbox": [ + 105, + 525, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 506, + 542 + ], + "score": 1.0, + "content": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 537, + 330, + 549 + ], + "spans": [ + { + "bbox": [ + 115, + 537, + 330, + 549 + ], + "score": 1.0, + "content": "recognition. arXiv preprint arXiv:1512.03385, 2015.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 108, + 555, + 505, + 588 + ], + "lines": [ + { + "bbox": [ + 106, + 556, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 106, + 556, + 505, + 568 + ], + "score": 1.0, + "content": "Geoffrey Hinton, Li Deng, Dong Yu, George Dahl, Abdel rahman Mohamed, Navdeep Jaitly, Andrew", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 567, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 116, + 567, + 505, + 579 + ], + "score": 1.0, + "content": "Senior, Vincent Vanhoucke, Patrick Nguyen, Tara Sainath, and Brian Kingsbury. Deep neural", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 577, + 479, + 589 + ], + "spans": [ + { + "bbox": [ + 115, + 577, + 479, + 589 + ], + "score": 1.0, + "content": "networks for acoustic modeling in speech recognition. Signal Processing Magazine, 2012.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 107, + 595, + 504, + 617 + ], + "lines": [ + { + "bbox": [ + 105, + 593, + 506, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 593, + 506, + 608 + ], + "score": 1.0, + "content": "Geoffrey E Hinton and Drew van Camp. Keeping neural networks simple. In ICANN’93, pp. 11–18.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 114, + 605, + 181, + 618 + ], + "spans": [ + { + "bbox": [ + 114, + 605, + 181, + 618 + ], + "score": 1.0, + "content": "Springer, 1993.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 107, + 623, + 505, + 646 + ], + "lines": [ + { + "bbox": [ + 105, + 622, + 506, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 506, + 637 + ], + "score": 1.0, + "content": "S. Hochreiter and J. Schmidhuber. Long short-term memory. Neural Computation, 9(8):1735–1780,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 114, + 632, + 146, + 647 + ], + "spans": [ + { + "bbox": [ + 114, + 632, + 146, + 647 + ], + "score": 1.0, + "content": "1997a.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5 + }, + { + "type": "text", + "bbox": [ + 106, + 652, + 493, + 664 + ], + "lines": [ + { + "bbox": [ + 105, + 651, + 494, + 666 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 494, + 666 + ], + "score": 1.0, + "content": "Sepp Hochreiter and Jürgen Schmidhuber. Flat minima. Neural Computation, 9(1):1–42, 1997b.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 106, + 671, + 502, + 693 + ], + "lines": [ + { + "bbox": [ + 105, + 669, + 504, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 504, + 684 + ], + "score": 1.0, + "content": "Gao Huang, Yu Sun, Zhuang Liu, Daniel Sedra, and Kilian Weinberger. Deep networks with", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 681, + 353, + 694 + ], + "spans": [ + { + "bbox": [ + 116, + 681, + 353, + 694 + ], + "score": 1.0, + "content": "stochastic depth. arXiv preprint arXiv:1603.09382, 2016a.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5 + }, + { + "type": "text", + "bbox": [ + 107, + 700, + 506, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 699, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 469, + 712 + ], + "score": 1.0, + "content": "Gao Huang, Yu Sun, Zhuang Liu, Daniel Sedra, and Kilian Q. Weinberger.", + "type": "text" + }, + { + "bbox": [ + 473, + 699, + 506, + 713 + ], + "score": 1.0, + "content": "Deep", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 709, + 507, + 723 + ], + "spans": [ + { + "bbox": [ + 115, + 710, + 264, + 721 + ], + "score": 1.0, + "content": "networks with stochastic depth.", + "type": "text" + }, + { + "bbox": [ + 284, + 709, + 428, + 721 + ], + "score": 1.0, + "content": "CoRR, abs/1603.09382, 2016b.", + "type": "text" + }, + { + "bbox": [ + 445, + 709, + 507, + 723 + ], + "score": 1.0, + "content": "URL http:", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 116, + 721, + 277, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 277, + 732 + ], + "score": 1.0, + "content": "//arxiv.org/abs/1603.09382.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45 + } + ], + "page_idx": 11, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "12", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Samy Bengio, Oriol Vinyals, Navdeep Jaitly, and Noam Shazeer. Scheduled sampling for sequence", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 506, + 106 + ], + "score": 1.0, + "content": "prediction with recurrent neural networks. In Advances in Neural Information Processing Systems,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 114, + 103, + 207, + 115 + ], + "spans": [ + { + "bbox": [ + 114, + 103, + 207, + 115 + ], + "score": 1.0, + "content": "pp. 1171–1179, 2015.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 81, + 506, + 115 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 121, + 505, + 144 + ], + "lines": [ + { + "bbox": [ + 107, + 122, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 107, + 122, + 505, + 133 + ], + "score": 1.0, + "content": "Yoshua Bengio, Jérôme Louradour, Ronan Collobert, and Jason Weston. Curriculum learning. In Pro-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 132, + 507, + 145 + ], + "spans": [ + { + "bbox": [ + 116, + 132, + 507, + 145 + ], + "score": 1.0, + "content": "ceedings of the 26th annual international conference on machine learning, pp. 41–48. ACM, 2009.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 107, + 122, + 507, + 145 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 150, + 504, + 173 + ], + "lines": [ + { + "bbox": [ + 105, + 149, + 505, + 164 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 505, + 164 + ], + "score": 1.0, + "content": "Léon Bottou. Online algorithms and stochastic approximations. In David Saad (ed.), Online Learning", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 160, + 410, + 173 + ], + "spans": [ + { + "bbox": [ + 116, + 160, + 410, + 173 + ], + "score": 1.0, + "content": "in Neural Networks. Cambridge University Press, Cambridge, UK, 1998.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 149, + 505, + 173 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 179, + 504, + 212 + ], + "lines": [ + { + "bbox": [ + 105, + 178, + 506, + 192 + ], + "spans": [ + { + "bbox": [ + 105, + 178, + 506, + 192 + ], + "score": 1.0, + "content": "Kyunghyun Cho, Bart Van Merriënboer, Caglar Gulcehre, Dzmitry Bahdanau, Fethi Bougares,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 189, + 506, + 202 + ], + "spans": [ + { + "bbox": [ + 115, + 189, + 506, + 202 + ], + "score": 1.0, + "content": "Holger Schwenk, and Yoshua Bengio. Learning phrase representations using rnn encoder-decoder", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 200, + 413, + 213 + ], + "spans": [ + { + "bbox": [ + 115, + 200, + 413, + 213 + ], + "score": 1.0, + "content": "for statistical machine translation. arXiv preprint arXiv:1406.1078, 2014.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 178, + 506, + 213 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 218, + 504, + 240 + ], + "lines": [ + { + "bbox": [ + 106, + 218, + 505, + 231 + ], + "spans": [ + { + "bbox": [ + 106, + 218, + 505, + 231 + ], + "score": 1.0, + "content": "Anna Choromanska, Mikael Henaff, Michael Mathieu, Gérard Ben Arous, and Yann LeCun. The", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 228, + 286, + 241 + ], + "spans": [ + { + "bbox": [ + 116, + 228, + 286, + 241 + ], + "score": 1.0, + "content": "loss surface of multilayer networks, 2014.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 106, + 218, + 505, + 241 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 247, + 504, + 279 + ], + "lines": [ + { + "bbox": [ + 107, + 247, + 505, + 259 + ], + "spans": [ + { + "bbox": [ + 107, + 247, + 505, + 259 + ], + "score": 1.0, + "content": "Yann Dauphin, Razvan Pascanu, Caglar Gulcehre, Kyunghyun Cho, Surya Ganguli, and Yoshua", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 258, + 506, + 270 + ], + "spans": [ + { + "bbox": [ + 115, + 258, + 506, + 270 + ], + "score": 1.0, + "content": "Bengio. Identifying and attacking the saddle point problem in high-dimensional non-convex", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 268, + 259, + 279 + ], + "spans": [ + { + "bbox": [ + 115, + 268, + 259, + 279 + ], + "score": 1.0, + "content": "optimization. In NIPS’2014, 2014.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13, + "bbox_fs": [ + 107, + 247, + 506, + 279 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 285, + 504, + 308 + ], + "lines": [ + { + "bbox": [ + 106, + 285, + 506, + 298 + ], + "spans": [ + { + "bbox": [ + 106, + 285, + 506, + 298 + ], + "score": 1.0, + "content": "Lawrence C Evans. Partial differential equations. Graduate Studies in Mathematics, 19:251–258,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 114, + 294, + 142, + 309 + ], + "spans": [ + { + "bbox": [ + 114, + 294, + 142, + 309 + ], + "score": 1.0, + "content": "1998.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 106, + 285, + 506, + 309 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 315, + 504, + 337 + ], + "lines": [ + { + "bbox": [ + 106, + 315, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 106, + 315, + 505, + 327 + ], + "score": 1.0, + "content": "Xavier Glorot, Antoine Bordes, and Yoshua Bengio. Deep sparse rectifier neural networks. In", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 325, + 237, + 338 + ], + "spans": [ + { + "bbox": [ + 115, + 325, + 237, + 338 + ], + "score": 1.0, + "content": "AISTATS, pp. 315–323, 2011.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5, + "bbox_fs": [ + 106, + 315, + 505, + 338 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 343, + 504, + 366 + ], + "lines": [ + { + "bbox": [ + 106, + 343, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 106, + 343, + 505, + 356 + ], + "score": 1.0, + "content": "Alex Graves. Practical variational inference for neural networks. In Advances in Neural Information", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 354, + 289, + 366 + ], + "spans": [ + { + "bbox": [ + 115, + 354, + 289, + 366 + ], + "score": 1.0, + "content": "Processing Systems, pp. 2348–2356, 2011.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 106, + 343, + 505, + 366 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 372, + 505, + 395 + ], + "lines": [ + { + "bbox": [ + 105, + 371, + 506, + 386 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 506, + 386 + ], + "score": 1.0, + "content": "Alex Graves. Adaptive computation time for recurrent neural networks. arXiv preprint", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 382, + 220, + 394 + ], + "spans": [ + { + "bbox": [ + 115, + 382, + 220, + 394 + ], + "score": 1.0, + "content": "arXiv:1603.08983, 2016.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 371, + 506, + 394 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 401, + 504, + 424 + ], + "lines": [ + { + "bbox": [ + 107, + 401, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 107, + 401, + 506, + 414 + ], + "score": 1.0, + "content": "Çaglar Gülçehre and Yoshua Bengio. Knowledge matters: Importance of prior information for ˘", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 412, + 330, + 424 + ], + "spans": [ + { + "bbox": [ + 115, + 412, + 330, + 424 + ], + "score": 1.0, + "content": "optimization. arXiv preprint arXiv:1301.4083, 2013.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 107, + 401, + 506, + 424 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 430, + 505, + 463 + ], + "lines": [ + { + "bbox": [ + 105, + 429, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 506, + 443 + ], + "score": 1.0, + "content": "Caglar Gulcehre, Kyunghyun Cho, Razvan Pascanu, and Yoshua Bengio. Learned-norm pooling for", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 440, + 505, + 454 + ], + "spans": [ + { + "bbox": [ + 115, + 440, + 505, + 454 + ], + "score": 1.0, + "content": "deep feedforward and recurrent neural networks. In Machine Learning and Knowledge Discovery", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 451, + 293, + 463 + ], + "spans": [ + { + "bbox": [ + 115, + 451, + 293, + 463 + ], + "score": 1.0, + "content": "in Databases, pp. 530–546. Springer, 2014.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 429, + 506, + 463 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 469, + 504, + 492 + ], + "lines": [ + { + "bbox": [ + 105, + 468, + 506, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 506, + 482 + ], + "score": 1.0, + "content": "Caglar Gulcehre, Marcin Moczulski, Misha Denil, and Yoshua Bengio. Noisy activation functions.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 114, + 478, + 143, + 492 + ], + "spans": [ + { + "bbox": [ + 114, + 478, + 143, + 492 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 468, + 506, + 492 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 498, + 504, + 520 + ], + "lines": [ + { + "bbox": [ + 106, + 498, + 505, + 510 + ], + "spans": [ + { + "bbox": [ + 106, + 498, + 505, + 510 + ], + "score": 1.0, + "content": "Elad Hazan, Kfir Y Levy, and Shai Shalev-Shwartz. On graduated optimization for stochastic", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 509, + 371, + 520 + ], + "spans": [ + { + "bbox": [ + 115, + 509, + 371, + 520 + ], + "score": 1.0, + "content": "non-convex problems. arXiv preprint arXiv:1503.03712, 2015.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5, + "bbox_fs": [ + 106, + 498, + 505, + 520 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 527, + 504, + 549 + ], + "lines": [ + { + "bbox": [ + 105, + 525, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 506, + 542 + ], + "score": 1.0, + "content": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 537, + 330, + 549 + ], + "spans": [ + { + "bbox": [ + 115, + 537, + 330, + 549 + ], + "score": 1.0, + "content": "recognition. arXiv preprint arXiv:1512.03385, 2015.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 525, + 506, + 549 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 555, + 505, + 588 + ], + "lines": [ + { + "bbox": [ + 106, + 556, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 106, + 556, + 505, + 568 + ], + "score": 1.0, + "content": "Geoffrey Hinton, Li Deng, Dong Yu, George Dahl, Abdel rahman Mohamed, Navdeep Jaitly, Andrew", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 567, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 116, + 567, + 505, + 579 + ], + "score": 1.0, + "content": "Senior, Vincent Vanhoucke, Patrick Nguyen, Tara Sainath, and Brian Kingsbury. Deep neural", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 577, + 479, + 589 + ], + "spans": [ + { + "bbox": [ + 115, + 577, + 479, + 589 + ], + "score": 1.0, + "content": "networks for acoustic modeling in speech recognition. Signal Processing Magazine, 2012.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35, + "bbox_fs": [ + 106, + 556, + 505, + 589 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 595, + 504, + 617 + ], + "lines": [ + { + "bbox": [ + 105, + 593, + 506, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 593, + 506, + 608 + ], + "score": 1.0, + "content": "Geoffrey E Hinton and Drew van Camp. Keeping neural networks simple. In ICANN’93, pp. 11–18.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 114, + 605, + 181, + 618 + ], + "spans": [ + { + "bbox": [ + 114, + 605, + 181, + 618 + ], + "score": 1.0, + "content": "Springer, 1993.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 593, + 506, + 618 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 623, + 505, + 646 + ], + "lines": [ + { + "bbox": [ + 105, + 622, + 506, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 506, + 637 + ], + "score": 1.0, + "content": "S. Hochreiter and J. Schmidhuber. Long short-term memory. Neural Computation, 9(8):1735–1780,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 114, + 632, + 146, + 647 + ], + "spans": [ + { + "bbox": [ + 114, + 632, + 146, + 647 + ], + "score": 1.0, + "content": "1997a.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 622, + 506, + 647 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 652, + 493, + 664 + ], + "lines": [ + { + "bbox": [ + 105, + 651, + 494, + 666 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 494, + 666 + ], + "score": 1.0, + "content": "Sepp Hochreiter and Jürgen Schmidhuber. Flat minima. Neural Computation, 9(1):1–42, 1997b.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 651, + 494, + 666 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 671, + 502, + 693 + ], + "lines": [ + { + "bbox": [ + 105, + 669, + 504, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 504, + 684 + ], + "score": 1.0, + "content": "Gao Huang, Yu Sun, Zhuang Liu, Daniel Sedra, and Kilian Weinberger. Deep networks with", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 681, + 353, + 694 + ], + "spans": [ + { + "bbox": [ + 116, + 681, + 353, + 694 + ], + "score": 1.0, + "content": "stochastic depth. arXiv preprint arXiv:1603.09382, 2016a.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5, + "bbox_fs": [ + 105, + 669, + 504, + 694 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 700, + 506, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 699, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 469, + 712 + ], + "score": 1.0, + "content": "Gao Huang, Yu Sun, Zhuang Liu, Daniel Sedra, and Kilian Q. Weinberger.", + "type": "text" + }, + { + "bbox": [ + 473, + 699, + 506, + 713 + ], + "score": 1.0, + "content": "Deep", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 709, + 507, + 723 + ], + "spans": [ + { + "bbox": [ + 115, + 710, + 264, + 721 + ], + "score": 1.0, + "content": "networks with stochastic depth.", + "type": "text" + }, + { + "bbox": [ + 284, + 709, + 428, + 721 + ], + "score": 1.0, + "content": "CoRR, abs/1603.09382, 2016b.", + "type": "text" + }, + { + "bbox": [ + 445, + 709, + 507, + 723 + ], + "score": 1.0, + "content": "URL http:", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 116, + 721, + 277, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 277, + 732 + ], + "score": 1.0, + "content": "//arxiv.org/abs/1603.09382.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45, + "bbox_fs": [ + 105, + 699, + 507, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 82, + 503, + 115 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 506, + 104 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 506, + 104 + ], + "score": 1.0, + "content": "training by reducing internal covariate shift. CoRR, abs/1502.03167, 2015. URL", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 104, + 307, + 115 + ], + "spans": [ + { + "bbox": [ + 116, + 104, + 307, + 115 + ], + "score": 1.0, + "content": "http://arxiv.org/abs/1502.03167.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 105, + 122, + 505, + 145 + ], + "lines": [ + { + "bbox": [ + 104, + 120, + 506, + 135 + ], + "spans": [ + { + "bbox": [ + 104, + 120, + 506, + 135 + ], + "score": 1.0, + "content": "Łukasz Kaiser and Ilya Sutskever. Neural gpus learn algorithms. arXiv preprint arXiv:1511.08228,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 131, + 143, + 145 + ], + "spans": [ + { + "bbox": [ + 115, + 131, + 143, + 145 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 107, + 151, + 504, + 173 + ], + "lines": [ + { + "bbox": [ + 105, + 149, + 506, + 164 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 506, + 164 + ], + "score": 1.0, + "content": "Nal Kalchbrenner, Ivo Danihelka, and Alex Graves. Grid long short-term memory. arXiv preprint", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 162, + 219, + 173 + ], + "spans": [ + { + "bbox": [ + 115, + 162, + 219, + 173 + ], + "score": 1.0, + "content": "arXiv:1507.01526, 2015.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 106, + 180, + 504, + 203 + ], + "lines": [ + { + "bbox": [ + 105, + 178, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 178, + 506, + 194 + ], + "score": 1.0, + "content": "Diederik Kingma and Jimmy Ba. Adam: A method for stochastic optimization. arXiv preprint", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 191, + 214, + 202 + ], + "spans": [ + { + "bbox": [ + 115, + 191, + 214, + 202 + ], + "score": 1.0, + "content": "arXiv:1412.6980, 2014.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 105, + 209, + 505, + 232 + ], + "lines": [ + { + "bbox": [ + 105, + 208, + 506, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 506, + 222 + ], + "score": 1.0, + "content": "S. Kirkpatrick, C. D. Gelatt Jr., , and M. P. Vecchi. Optimization by simulated annealing. 220:", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 220, + 182, + 231 + ], + "spans": [ + { + "bbox": [ + 116, + 220, + 182, + 231 + ], + "score": 1.0, + "content": "671–680, 1983.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 107, + 239, + 506, + 282 + ], + "lines": [ + { + "bbox": [ + 106, + 237, + 506, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 506, + 252 + ], + "score": 1.0, + "content": "Y. LeCun, B. Boser, J. S. Denker, D. Henderson, R. E. Howard, W. Hubbard, and L. D.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 249, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 115, + 249, + 505, + 262 + ], + "score": 1.0, + "content": "Jackel. Backpropagation applied to handwritten zip code recognition. Neural Comput., 1", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 259, + 506, + 272 + ], + "spans": [ + { + "bbox": [ + 115, + 259, + 506, + 272 + ], + "score": 1.0, + "content": "(4):541–551, December 1989. ISSN 0899-7667. doi: 10.1162/neco.1989.1.4.541. URL", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 270, + 379, + 282 + ], + "spans": [ + { + "bbox": [ + 115, + 270, + 379, + 282 + ], + "score": 1.0, + "content": "http://dx.doi.org/10.1162/neco.1989.1.4.541.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 107, + 288, + 434, + 300 + ], + "lines": [ + { + "bbox": [ + 106, + 287, + 435, + 302 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 435, + 302 + ], + "score": 1.0, + "content": "Yann LeCun and Corinna Cortes. The mnist database of handwritten digits, 1998.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 307, + 418, + 319 + ], + "lines": [ + { + "bbox": [ + 106, + 307, + 419, + 321 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 419, + 321 + ], + "score": 1.0, + "content": "Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. word2vec, 2014.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 108, + 326, + 507, + 348 + ], + "lines": [ + { + "bbox": [ + 107, + 326, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 107, + 326, + 505, + 339 + ], + "score": 1.0, + "content": "Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Alex Graves, Ioannis Antonoglou, and Daan", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 337, + 507, + 349 + ], + "spans": [ + { + "bbox": [ + 116, + 337, + 507, + 349 + ], + "score": 1.0, + "content": "Wierstra. Playing atari with deep reinforcement learning. Technical report, arXiv:1312.5602, 2013.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 106, + 355, + 505, + 378 + ], + "lines": [ + { + "bbox": [ + 104, + 354, + 507, + 369 + ], + "spans": [ + { + "bbox": [ + 104, + 354, + 507, + 369 + ], + "score": 1.0, + "content": "Hossein Mobahi. Training recurrent neural networks by diffusion. arXiv preprint arXiv:1601.04114,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 114, + 365, + 143, + 379 + ], + "spans": [ + { + "bbox": [ + 114, + 365, + 143, + 379 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 108, + 384, + 504, + 417 + ], + "lines": [ + { + "bbox": [ + 107, + 385, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 107, + 385, + 505, + 397 + ], + "score": 1.0, + "content": "Vinod Nair and Geoffrey E Hinton. Rectified linear units improve restricted boltzmann machines. In", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 396, + 506, + 407 + ], + "spans": [ + { + "bbox": [ + 115, + 396, + 506, + 407 + ], + "score": 1.0, + "content": "Proceedings of the 27th International Conference on Machine Learning (ICML-10), pp. 807–814,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 114, + 405, + 142, + 417 + ], + "spans": [ + { + "bbox": [ + 114, + 405, + 142, + 417 + ], + "score": 1.0, + "content": "2010.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 424, + 506, + 457 + ], + "lines": [ + { + "bbox": [ + 106, + 424, + 506, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 506, + 436 + ], + "score": 1.0, + "content": "Arvind Neelakantan, Luke Vilnis, Quoc V. Le, Ilya Sutskever, Lukasz Kaiser, Karol Kurach,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 435, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 116, + 435, + 506, + 447 + ], + "score": 1.0, + "content": "and James Martens. Adding gradient noise improves learning for very deep networks. CoRR,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 445, + 429, + 457 + ], + "spans": [ + { + "bbox": [ + 116, + 445, + 429, + 457 + ], + "score": 1.0, + "content": "abs/1511.06807, 2015a. URL http://arxiv.org/abs/1511.06807.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 464, + 504, + 496 + ], + "lines": [ + { + "bbox": [ + 105, + 463, + 506, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 463, + 506, + 477 + ], + "score": 1.0, + "content": "Arvind Neelakantan, Luke Vilnis, Quoc V Le, Ilya Sutskever, Lukasz Kaiser, Karol Kurach, and", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 474, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 115, + 474, + 505, + 487 + ], + "score": 1.0, + "content": "James Martens. Adding gradient noise improves learning for very deep networks. arXiv preprint", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 485, + 223, + 496 + ], + "spans": [ + { + "bbox": [ + 115, + 485, + 223, + 496 + ], + "score": 1.0, + "content": "arXiv:1511.06807, 2015b.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 108, + 503, + 504, + 526 + ], + "lines": [ + { + "bbox": [ + 106, + 502, + 506, + 517 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 506, + 517 + ], + "score": 1.0, + "content": "Andrew Y Ng. Shaping and policy search in reinforcement learning. PhD thesis, University of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 513, + 227, + 526 + ], + "spans": [ + { + "bbox": [ + 116, + 513, + 227, + 526 + ], + "score": 1.0, + "content": "California, Berkeley, 2003.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 107, + 532, + 504, + 555 + ], + "lines": [ + { + "bbox": [ + 106, + 532, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 506, + 545 + ], + "score": 1.0, + "content": "Andrew Y Ng, Daishi Harada, and Stuart Russell. Policy invariance under reward transformations:", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 543, + 454, + 555 + ], + "spans": [ + { + "bbox": [ + 116, + 543, + 454, + 555 + ], + "score": 1.0, + "content": "Theory and application to reward shaping. In ICML, volume 99, pp. 278–287, 1999.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 107, + 561, + 505, + 595 + ], + "lines": [ + { + "bbox": [ + 105, + 560, + 507, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 507, + 575 + ], + "score": 1.0, + "content": "David Silver, Aja Huang, Chris J Maddison, Arthur Guez, Laurent Sifre, George Van Den Driessche,", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 571, + 506, + 586 + ], + "spans": [ + { + "bbox": [ + 115, + 571, + 506, + 586 + ], + "score": 1.0, + "content": "Julian Schrittwieser, Ioannis Antonoglou, Veda Panneershelvam, Marc Lanctot, et al. Mastering", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 583, + 493, + 595 + ], + "spans": [ + { + "bbox": [ + 115, + 583, + 493, + 595 + ], + "score": 1.0, + "content": "the game of go with deep neural networks and tree search. Nature, 529(7587):484–489, 2016.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 107, + 601, + 504, + 634 + ], + "lines": [ + { + "bbox": [ + 105, + 599, + 506, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 506, + 615 + ], + "score": 1.0, + "content": "Leslie N Smith, Emily M Hand, and Timothy Doster. Gradual dropin of layers to train very deep", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 612, + 506, + 624 + ], + "spans": [ + { + "bbox": [ + 115, + 612, + 506, + 624 + ], + "score": 1.0, + "content": "neural networks. In Proceedings of the IEEE Conference on Computer Vision and Pattern", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 622, + 259, + 635 + ], + "spans": [ + { + "bbox": [ + 115, + 622, + 259, + 635 + ], + "score": 1.0, + "content": "Recognition, pp. 4763–4771, 2016.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 106, + 641, + 504, + 664 + ], + "lines": [ + { + "bbox": [ + 106, + 641, + 505, + 654 + ], + "spans": [ + { + "bbox": [ + 106, + 641, + 505, + 654 + ], + "score": 1.0, + "content": "Rupesh K Srivastava, Klaus Greff, and Jürgen Schmidhuber. Training very deep networks. In", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 114, + 651, + 420, + 664 + ], + "spans": [ + { + "bbox": [ + 114, + 651, + 420, + 664 + ], + "score": 1.0, + "content": "Advances in Neural Information Processing Systems, pp. 2368–2376, 2015.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5 + }, + { + "type": "text", + "bbox": [ + 106, + 670, + 504, + 693 + ], + "lines": [ + { + "bbox": [ + 106, + 670, + 505, + 683 + ], + "spans": [ + { + "bbox": [ + 106, + 670, + 505, + 683 + ], + "score": 1.0, + "content": "Ilya Sutskever, Oriol Vinyals, and Quoc V Le. Sequence to sequence learning with neural networks.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 680, + 427, + 694 + ], + "spans": [ + { + "bbox": [ + 115, + 680, + 427, + 694 + ], + "score": 1.0, + "content": "In Advances in neural information processing systems, pp. 3104–3112, 2014.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5 + }, + { + "type": "text", + "bbox": [ + 108, + 700, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 713 + ], + "score": 1.0, + "content": "Christian Szegedy, Wei Liu, Yangqing Jia, Pierre Sermanet, Scott Reed, Dragomir Anguelov,", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 709, + 507, + 722 + ], + "spans": [ + { + "bbox": [ + 115, + 709, + 507, + 722 + ], + "score": 1.0, + "content": "Dumitru Erhan, Vincent Vanhoucke, and Andrew Rabinovich. Going deeper with convolutions.", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 116, + 721, + 245, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 245, + 732 + ], + "score": 1.0, + "content": "Technical report, Google, 2014.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45 + } + ], + "page_idx": 12, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 82, + 503, + 115 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 506, + 104 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 506, + 104 + ], + "score": 1.0, + "content": "training by reducing internal covariate shift. CoRR, abs/1502.03167, 2015. URL", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 104, + 307, + 115 + ], + "spans": [ + { + "bbox": [ + 116, + 104, + 307, + 115 + ], + "score": 1.0, + "content": "http://arxiv.org/abs/1502.03167.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 106, + 82, + 506, + 115 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 122, + 505, + 145 + ], + "lines": [ + { + "bbox": [ + 104, + 120, + 506, + 135 + ], + "spans": [ + { + "bbox": [ + 104, + 120, + 506, + 135 + ], + "score": 1.0, + "content": "Łukasz Kaiser and Ilya Sutskever. Neural gpus learn algorithms. arXiv preprint arXiv:1511.08228,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 131, + 143, + 145 + ], + "spans": [ + { + "bbox": [ + 115, + 131, + 143, + 145 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 104, + 120, + 506, + 145 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 151, + 504, + 173 + ], + "lines": [ + { + "bbox": [ + 105, + 149, + 506, + 164 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 506, + 164 + ], + "score": 1.0, + "content": "Nal Kalchbrenner, Ivo Danihelka, and Alex Graves. Grid long short-term memory. arXiv preprint", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 162, + 219, + 173 + ], + "spans": [ + { + "bbox": [ + 115, + 162, + 219, + 173 + ], + "score": 1.0, + "content": "arXiv:1507.01526, 2015.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 149, + 506, + 173 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 180, + 504, + 203 + ], + "lines": [ + { + "bbox": [ + 105, + 178, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 178, + 506, + 194 + ], + "score": 1.0, + "content": "Diederik Kingma and Jimmy Ba. Adam: A method for stochastic optimization. arXiv preprint", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 191, + 214, + 202 + ], + "spans": [ + { + "bbox": [ + 115, + 191, + 214, + 202 + ], + "score": 1.0, + "content": "arXiv:1412.6980, 2014.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 178, + 506, + 202 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 209, + 505, + 232 + ], + "lines": [ + { + "bbox": [ + 105, + 208, + 506, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 506, + 222 + ], + "score": 1.0, + "content": "S. Kirkpatrick, C. D. Gelatt Jr., , and M. P. Vecchi. Optimization by simulated annealing. 220:", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 220, + 182, + 231 + ], + "spans": [ + { + "bbox": [ + 116, + 220, + 182, + 231 + ], + "score": 1.0, + "content": "671–680, 1983.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 208, + 506, + 231 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 239, + 506, + 282 + ], + "lines": [ + { + "bbox": [ + 106, + 237, + 506, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 506, + 252 + ], + "score": 1.0, + "content": "Y. LeCun, B. Boser, J. S. Denker, D. Henderson, R. E. Howard, W. Hubbard, and L. D.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 249, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 115, + 249, + 505, + 262 + ], + "score": 1.0, + "content": "Jackel. Backpropagation applied to handwritten zip code recognition. Neural Comput., 1", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 259, + 506, + 272 + ], + "spans": [ + { + "bbox": [ + 115, + 259, + 506, + 272 + ], + "score": 1.0, + "content": "(4):541–551, December 1989. ISSN 0899-7667. doi: 10.1162/neco.1989.1.4.541. URL", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 270, + 379, + 282 + ], + "spans": [ + { + "bbox": [ + 115, + 270, + 379, + 282 + ], + "score": 1.0, + "content": "http://dx.doi.org/10.1162/neco.1989.1.4.541.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5, + "bbox_fs": [ + 106, + 237, + 506, + 282 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 288, + 434, + 300 + ], + "lines": [ + { + "bbox": [ + 106, + 287, + 435, + 302 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 435, + 302 + ], + "score": 1.0, + "content": "Yann LeCun and Corinna Cortes. The mnist database of handwritten digits, 1998.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15, + "bbox_fs": [ + 106, + 287, + 435, + 302 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 307, + 418, + 319 + ], + "lines": [ + { + "bbox": [ + 106, + 307, + 419, + 321 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 419, + 321 + ], + "score": 1.0, + "content": "Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. word2vec, 2014.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 106, + 307, + 419, + 321 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 326, + 507, + 348 + ], + "lines": [ + { + "bbox": [ + 107, + 326, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 107, + 326, + 505, + 339 + ], + "score": 1.0, + "content": "Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Alex Graves, Ioannis Antonoglou, and Daan", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 337, + 507, + 349 + ], + "spans": [ + { + "bbox": [ + 116, + 337, + 507, + 349 + ], + "score": 1.0, + "content": "Wierstra. Playing atari with deep reinforcement learning. Technical report, arXiv:1312.5602, 2013.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5, + "bbox_fs": [ + 107, + 326, + 507, + 349 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 355, + 505, + 378 + ], + "lines": [ + { + "bbox": [ + 104, + 354, + 507, + 369 + ], + "spans": [ + { + "bbox": [ + 104, + 354, + 507, + 369 + ], + "score": 1.0, + "content": "Hossein Mobahi. Training recurrent neural networks by diffusion. arXiv preprint arXiv:1601.04114,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 114, + 365, + 143, + 379 + ], + "spans": [ + { + "bbox": [ + 114, + 365, + 143, + 379 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 104, + 354, + 507, + 379 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 384, + 504, + 417 + ], + "lines": [ + { + "bbox": [ + 107, + 385, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 107, + 385, + 505, + 397 + ], + "score": 1.0, + "content": "Vinod Nair and Geoffrey E Hinton. Rectified linear units improve restricted boltzmann machines. In", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 396, + 506, + 407 + ], + "spans": [ + { + "bbox": [ + 115, + 396, + 506, + 407 + ], + "score": 1.0, + "content": "Proceedings of the 27th International Conference on Machine Learning (ICML-10), pp. 807–814,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 114, + 405, + 142, + 417 + ], + "spans": [ + { + "bbox": [ + 114, + 405, + 142, + 417 + ], + "score": 1.0, + "content": "2010.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 107, + 385, + 506, + 417 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 424, + 506, + 457 + ], + "lines": [ + { + "bbox": [ + 106, + 424, + 506, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 506, + 436 + ], + "score": 1.0, + "content": "Arvind Neelakantan, Luke Vilnis, Quoc V. Le, Ilya Sutskever, Lukasz Kaiser, Karol Kurach,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 435, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 116, + 435, + 506, + 447 + ], + "score": 1.0, + "content": "and James Martens. Adding gradient noise improves learning for very deep networks. CoRR,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 445, + 429, + 457 + ], + "spans": [ + { + "bbox": [ + 116, + 445, + 429, + 457 + ], + "score": 1.0, + "content": "abs/1511.06807, 2015a. URL http://arxiv.org/abs/1511.06807.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 106, + 424, + 506, + 457 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 464, + 504, + 496 + ], + "lines": [ + { + "bbox": [ + 105, + 463, + 506, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 463, + 506, + 477 + ], + "score": 1.0, + "content": "Arvind Neelakantan, Luke Vilnis, Quoc V Le, Ilya Sutskever, Lukasz Kaiser, Karol Kurach, and", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 474, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 115, + 474, + 505, + 487 + ], + "score": 1.0, + "content": "James Martens. Adding gradient noise improves learning for very deep networks. arXiv preprint", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 485, + 223, + 496 + ], + "spans": [ + { + "bbox": [ + 115, + 485, + 223, + 496 + ], + "score": 1.0, + "content": "arXiv:1511.06807, 2015b.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 463, + 506, + 496 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 503, + 504, + 526 + ], + "lines": [ + { + "bbox": [ + 106, + 502, + 506, + 517 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 506, + 517 + ], + "score": 1.0, + "content": "Andrew Y Ng. Shaping and policy search in reinforcement learning. PhD thesis, University of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 513, + 227, + 526 + ], + "spans": [ + { + "bbox": [ + 116, + 513, + 227, + 526 + ], + "score": 1.0, + "content": "California, Berkeley, 2003.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5, + "bbox_fs": [ + 106, + 502, + 506, + 526 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 532, + 504, + 555 + ], + "lines": [ + { + "bbox": [ + 106, + 532, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 506, + 545 + ], + "score": 1.0, + "content": "Andrew Y Ng, Daishi Harada, and Stuart Russell. Policy invariance under reward transformations:", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 543, + 454, + 555 + ], + "spans": [ + { + "bbox": [ + 116, + 543, + 454, + 555 + ], + "score": 1.0, + "content": "Theory and application to reward shaping. In ICML, volume 99, pp. 278–287, 1999.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 106, + 532, + 506, + 555 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 561, + 505, + 595 + ], + "lines": [ + { + "bbox": [ + 105, + 560, + 507, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 507, + 575 + ], + "score": 1.0, + "content": "David Silver, Aja Huang, Chris J Maddison, Arthur Guez, Laurent Sifre, George Van Den Driessche,", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 571, + 506, + 586 + ], + "spans": [ + { + "bbox": [ + 115, + 571, + 506, + 586 + ], + "score": 1.0, + "content": "Julian Schrittwieser, Ioannis Antonoglou, Veda Panneershelvam, Marc Lanctot, et al. Mastering", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 583, + 493, + 595 + ], + "spans": [ + { + "bbox": [ + 115, + 583, + 493, + 595 + ], + "score": 1.0, + "content": "the game of go with deep neural networks and tree search. Nature, 529(7587):484–489, 2016.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 560, + 507, + 595 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 601, + 504, + 634 + ], + "lines": [ + { + "bbox": [ + 105, + 599, + 506, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 506, + 615 + ], + "score": 1.0, + "content": "Leslie N Smith, Emily M Hand, and Timothy Doster. Gradual dropin of layers to train very deep", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 612, + 506, + 624 + ], + "spans": [ + { + "bbox": [ + 115, + 612, + 506, + 624 + ], + "score": 1.0, + "content": "neural networks. In Proceedings of the IEEE Conference on Computer Vision and Pattern", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 622, + 259, + 635 + ], + "spans": [ + { + "bbox": [ + 115, + 622, + 259, + 635 + ], + "score": 1.0, + "content": "Recognition, pp. 4763–4771, 2016.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38, + "bbox_fs": [ + 105, + 599, + 506, + 635 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 641, + 504, + 664 + ], + "lines": [ + { + "bbox": [ + 106, + 641, + 505, + 654 + ], + "spans": [ + { + "bbox": [ + 106, + 641, + 505, + 654 + ], + "score": 1.0, + "content": "Rupesh K Srivastava, Klaus Greff, and Jürgen Schmidhuber. Training very deep networks. In", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 114, + 651, + 420, + 664 + ], + "spans": [ + { + "bbox": [ + 114, + 651, + 420, + 664 + ], + "score": 1.0, + "content": "Advances in Neural Information Processing Systems, pp. 2368–2376, 2015.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5, + "bbox_fs": [ + 106, + 641, + 505, + 664 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 670, + 504, + 693 + ], + "lines": [ + { + "bbox": [ + 106, + 670, + 505, + 683 + ], + "spans": [ + { + "bbox": [ + 106, + 670, + 505, + 683 + ], + "score": 1.0, + "content": "Ilya Sutskever, Oriol Vinyals, and Quoc V Le. Sequence to sequence learning with neural networks.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 680, + 427, + 694 + ], + "spans": [ + { + "bbox": [ + 115, + 680, + 427, + 694 + ], + "score": 1.0, + "content": "In Advances in neural information processing systems, pp. 3104–3112, 2014.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5, + "bbox_fs": [ + 106, + 670, + 505, + 694 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 700, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 713 + ], + "score": 1.0, + "content": "Christian Szegedy, Wei Liu, Yangqing Jia, Pierre Sermanet, Scott Reed, Dragomir Anguelov,", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 709, + 507, + 722 + ], + "spans": [ + { + "bbox": [ + 115, + 709, + 507, + 722 + ], + "score": 1.0, + "content": "Dumitru Erhan, Vincent Vanhoucke, and Andrew Rabinovich. Going deeper with convolutions.", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 116, + 721, + 245, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 245, + 732 + ], + "score": 1.0, + "content": "Technical report, Google, 2014.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45, + "bbox_fs": [ + 105, + 698, + 507, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 235, + 94 + ], + "score": 1.0, + "content": "Theano Development Team.", + "type": "text" + }, + { + "bbox": [ + 254, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "Theano: A Python framework for fast computation", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 117, + 92, + 506, + 105 + ], + "spans": [ + { + "bbox": [ + 117, + 93, + 248, + 104 + ], + "score": 1.0, + "content": "of mathematical expressions.", + "type": "text" + }, + { + "bbox": [ + 263, + 93, + 478, + 105 + ], + "score": 1.0, + "content": "arXiv e-prints, abs/1605.02688, May 2016.", + "type": "text" + }, + { + "bbox": [ + 480, + 92, + 506, + 104 + ], + "score": 1.0, + "content": "URL", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 103, + 308, + 115 + ], + "spans": [ + { + "bbox": [ + 116, + 103, + 308, + 115 + ], + "score": 1.0, + "content": "http://arxiv.org/abs/1605.02688.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 109, + 120, + 505, + 153 + ], + "lines": [ + { + "bbox": [ + 106, + 119, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 106, + 119, + 505, + 133 + ], + "score": 1.0, + "content": "Francesco Visin, Kyle Kastner, Aaron Courville, Yoshua Bengio, Matteo Matteucci, and Kyunghyun", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 131, + 506, + 143 + ], + "spans": [ + { + "bbox": [ + 116, + 131, + 506, + 143 + ], + "score": 1.0, + "content": "Cho. Reseg: A recurrent neural network for object segmentation. arXiv preprint arXiv:1511.07053,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 141, + 142, + 153 + ], + "spans": [ + { + "bbox": [ + 115, + 141, + 142, + 153 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 158, + 504, + 171 + ], + "lines": [ + { + "bbox": [ + 106, + 158, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 106, + 158, + 506, + 172 + ], + "score": 1.0, + "content": "Wojciech Zaremba and Ilya Sutskever. Learning to execute. arXiv preprint arXiv:1410.4615, 2014.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "title", + "bbox": [ + 107, + 174, + 167, + 191 + ], + "lines": [ + { + "bbox": [ + 103, + 173, + 170, + 192 + ], + "spans": [ + { + "bbox": [ + 103, + 173, + 170, + 192 + ], + "score": 1.0, + "content": "Appendix", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "title", + "bbox": [ + 107, + 203, + 368, + 218 + ], + "lines": [ + { + "bbox": [ + 105, + 202, + 369, + 220 + ], + "spans": [ + { + "bbox": [ + 105, + 202, + 369, + 220 + ], + "score": 1.0, + "content": "A MONTE-CARLO ESTIMATE OF MOLLIFICATION", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 112, + 225, + 482, + 347 + ], + "lines": [ + { + "bbox": [ + 115, + 226, + 484, + 252 + ], + "spans": [ + { + "bbox": [ + 115, + 226, + 312, + 252 + ], + "score": 0.43, + "content": "{ \\mathcal L } _ { K } ( \\pmb \\theta ) = ( { \\mathcal L } * K ) ( \\pmb \\theta ) = \\int _ { C } { \\mathcal L } ( \\pmb \\theta - \\xi ) K ( \\xi ) d \\xi", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 227, + 484, + 249 + ], + "score": 1.0, + "content": "which can be estimated by a Monte Carlo:", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 145, + 254, + 467, + 286 + ], + "spans": [ + { + "bbox": [ + 145, + 254, + 235, + 286 + ], + "score": 0.48, + "content": "\\approx \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\xi } ^ { ( i ) } )", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 258, + 267, + 282 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 267, + 262, + 282, + 275 + ], + "score": 0.89, + "content": "\\xi ^ { ( i ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 283, + 258, + 461, + 282 + ], + "score": 1.0, + "content": "is a realization of the noise random variable", + "type": "text" + }, + { + "bbox": [ + 461, + 264, + 467, + 275 + ], + "score": 0.69, + "content": "\\xi", + "type": "inline_equation" + } + ], + "index": 10 + }, + { + "bbox": [ + 144, + 288, + 219, + 311 + ], + "spans": [ + { + "bbox": [ + 144, + 292, + 182, + 310 + ], + "score": 1.0, + "content": "yielding", + "type": "text" + }, + { + "bbox": [ + 182, + 288, + 219, + 311 + ], + "score": 0.58, + "content": "\\frac { \\partial \\mathcal { L } _ { K } ( { \\pmb \\theta } ) } { \\partial { \\pmb \\theta } }", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 145, + 313, + 246, + 347 + ], + "spans": [ + { + "bbox": [ + 145, + 313, + 246, + 347 + ], + "score": 0.66, + "content": "\\approx \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\frac { \\partial \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\xi } ^ { ( i ) } ) } { \\partial \\pmb { \\theta } } .", + "type": "inline_equation", + "image_path": "57461b29223788c5f6ecf3d474e9061d421a93c4a614f42bdc0e8319fe41e4ec.jpg" + } + ], + "index": 12 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 106, + 347, + 453, + 360 + ], + "lines": [ + { + "bbox": [ + 106, + 347, + 455, + 361 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 313, + 361 + ], + "score": 1.0, + "content": "Therefore introducing additive noise to the input of", + "type": "text" + }, + { + "bbox": [ + 313, + 348, + 334, + 360 + ], + "score": 0.92, + "content": "\\mathcal { L } ( \\pmb \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 347, + 455, + 361 + ], + "score": 1.0, + "content": "is equivalent to mollification.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "title", + "bbox": [ + 108, + 373, + 433, + 387 + ], + "lines": [ + { + "bbox": [ + 105, + 373, + 434, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 434, + 388 + ], + "score": 1.0, + "content": "B DERIVATION OF THE NOISY ACTIVATIONS FOR THE GATING", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 396, + 396, + 411 + ], + "lines": [ + { + "bbox": [ + 105, + 394, + 397, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 158, + 412 + ], + "score": 1.0, + "content": "Assume that", + "type": "text" + }, + { + "bbox": [ + 158, + 396, + 244, + 410 + ], + "score": 0.93, + "content": "z _ { t } ^ { l } = x _ { t } ^ { l } + p _ { t } ^ { l } \\sigma ( x ) | \\xi _ { t } ^ { l } |", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 394, + 262, + 412 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 262, + 397, + 330, + 410 + ], + "score": 0.92, + "content": "\\mathrm { E } _ { \\xi } [ \\psi ( x _ { t } ^ { l } , \\xi ) ] = t", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 394, + 383, + 412 + ], + "score": 1.0, + "content": ". Thus for all", + "type": "text" + }, + { + "bbox": [ + 383, + 397, + 392, + 410 + ], + "score": 0.87, + "content": "z _ { t } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 394, + 397, + 412 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "interline_equation", + "bbox": [ + 150, + 425, + 459, + 492 + ], + "lines": [ + { + "bbox": [ + 150, + 425, + 459, + 492 + ], + "spans": [ + { + "bbox": [ + 150, + 425, + 459, + 492 + ], + "score": 0.38, + "content": "\\begin{array} { r l } & { \\mathrm { E } _ { \\xi } [ \\psi ( x _ { t } ^ { l } , \\xi _ { t } ^ { l } ) ] = \\mathrm { E } _ { \\xi } [ \\mathrm { f } ( z _ { t } ^ { l } ) ] , } \\\\ & { \\qquad t = \\mathrm { E } _ { \\xi } [ \\mathrm { f } ( z _ { t } ^ { l } ) ] , \\ \\mathrm { a s s u m i n g ~ f ( \\cdot ) ~ b e h a v e s ~ s i m i l a r ~ t o ~ a ~ l i n e a r ~ f u n c t i o n } ; } \\\\ & { \\qquad \\mathrm { E } _ { \\xi } [ \\mathrm { f } ( z _ { t } ^ { l } ) ] \\approx \\mathrm { f } ( \\mathrm { E } _ { \\xi } [ z _ { t } ^ { l } ] ) \\ \\mathrm { s i n c e ~ w e ~ u s e ~ h a r d - s i g m o i d ~ f o r ~ f ( \\cdot ) ~ t h i s ~ w i l l ~ h o l d } . } \\\\ & { \\qquad \\mathrm { f } ^ { - 1 } ( t ) \\approx \\mathrm { E } _ { \\xi } [ z _ { t } ^ { l } ] } \\end{array}", + "type": "interline_equation", + "image_path": "d81ce7f88b317f357b179064e036e23d39769074b19dcdf04d265f8ac162a209.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 150, + 425, + 459, + 447.3333333333333 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 150, + 447.3333333333333, + 459, + 469.66666666666663 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 150, + 469.66666666666663, + 459, + 491.99999999999994 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 511, + 361, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 509, + 362, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 362, + 525 + ], + "score": 1.0, + "content": "As in Eqn. 32, we can write the expectation of this equation as:", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "interline_equation", + "bbox": [ + 246, + 525, + 363, + 540 + ], + "lines": [ + { + "bbox": [ + 246, + 525, + 363, + 540 + ], + "spans": [ + { + "bbox": [ + 246, + 525, + 363, + 540 + ], + "score": 0.91, + "content": "\\mathrm { f } ^ { - 1 } ( t ) \\approx x _ { t } ^ { l } + p _ { t } ^ { l } \\sigma ( x ) \\mathrm { E } _ { \\xi } [ \\xi _ { t } ^ { l } ]", + "type": "interline_equation", + "image_path": "bb4a7988b50191817819d708c72a878138289811bede4001d28e39ac2021dcb5.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 246, + 525, + 363, + 540 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 543, + 421, + 556 + ], + "lines": [ + { + "bbox": [ + 106, + 541, + 423, + 558 + ], + "spans": [ + { + "bbox": [ + 106, + 541, + 205, + 558 + ], + "score": 1.0, + "content": "Corollary, the value that", + "type": "text" + }, + { + "bbox": [ + 205, + 543, + 229, + 556 + ], + "score": 0.93, + "content": "\\sigma ( x _ { t } ^ { l } )", + "type": "inline_equation" + }, + { + "bbox": [ + 229, + 541, + 351, + 558 + ], + "score": 1.0, + "content": "should take in expectation for", + "type": "text" + }, + { + "bbox": [ + 351, + 543, + 379, + 556 + ], + "score": 0.92, + "content": "p _ { t } ^ { l } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 541, + 423, + 558 + ], + "score": 1.0, + "content": "would be:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "interline_equation", + "bbox": [ + 262, + 558, + 349, + 587 + ], + "lines": [ + { + "bbox": [ + 262, + 558, + 349, + 587 + ], + "spans": [ + { + "bbox": [ + 262, + 558, + 349, + 587 + ], + "score": 0.94, + "content": "\\sigma ( x _ { t } ^ { l } ) \\approx \\frac { \\mathrm { f } ^ { - 1 } ( t ) - x _ { t } ^ { l } } { \\mathrm { E } _ { \\xi } [ \\xi _ { t } ^ { l } ] }", + "type": "interline_equation", + "image_path": "37f119cb5fff172401ae59c1cff8fb44f26310a702a76c6ba7c93fe86200e4a2.jpg" + } + ] + } + ], + "index": 22.5, + "virtual_lines": [ + { + "bbox": [ + 262, + 558, + 349, + 572.5 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 262, + 572.5, + 349, + 587.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 596, + 506, + 631 + ], + "lines": [ + { + "bbox": [ + 105, + 594, + 506, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 201, + 610 + ], + "score": 1.0, + "content": "In our experiments for", + "type": "text" + }, + { + "bbox": [ + 201, + 596, + 216, + 608 + ], + "score": 0.86, + "content": "\\operatorname { f } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 594, + 506, + 610 + ], + "score": 1.0, + "content": "we used the hard-sigmoid activation function. We used the following", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 607, + 506, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 310, + 622 + ], + "score": 1.0, + "content": "piecewise activation function in order to use it as", + "type": "text" + }, + { + "bbox": [ + 310, + 607, + 397, + 621 + ], + "score": 0.94, + "content": "\\mathrm { f } ^ { - 1 } ( x ) = 4 ( x - 0 . 5 )", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 607, + 506, + 622 + ], + "score": 1.0, + "content": ". During inference we use", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 619, + 300, + 631 + ], + "spans": [ + { + "bbox": [ + 106, + 619, + 264, + 631 + ], + "score": 1.0, + "content": "the expected value of random variables", + "type": "text" + }, + { + "bbox": [ + 265, + 621, + 272, + 629 + ], + "score": 0.78, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 619, + 290, + 631 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 290, + 619, + 296, + 631 + ], + "score": 0.84, + "content": "\\xi", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 619, + 300, + 631 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "title", + "bbox": [ + 108, + 645, + 257, + 658 + ], + "lines": [ + { + "bbox": [ + 105, + 644, + 258, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 258, + 660 + ], + "score": 1.0, + "content": "C EXPERIMENTAL DETAILS", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "title", + "bbox": [ + 107, + 668, + 167, + 681 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 169, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 169, + 682 + ], + "score": 1.0, + "content": "C.1 MNIST", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 689, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 689, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 106, + 689, + 506, + 701 + ], + "score": 1.0, + "content": "The weights of the models are initialized with Glorot & Bengio initialization Glorot et al. (2011).", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 700, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 700, + 218, + 712 + ], + "score": 1.0, + "content": "We use the learning rate of", + "type": "text" + }, + { + "bbox": [ + 219, + 700, + 247, + 710 + ], + "score": 0.88, + "content": "4 e - 4", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 700, + 396, + 712 + ], + "score": 1.0, + "content": "along with RMSProp. We initialize", + "type": "text" + }, + { + "bbox": [ + 396, + 702, + 406, + 711 + ], + "score": 0.82, + "content": "a _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 700, + 506, + 712 + ], + "score": 1.0, + "content": "parameters of mollified", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 358, + 723 + ], + "score": 1.0, + "content": "activation function by sampling it from a uniform distribution,", + "type": "text" + }, + { + "bbox": [ + 359, + 710, + 395, + 722 + ], + "score": 0.45, + "content": "\\mathrm { { U } [ - 2 , 2 ] }", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 709, + 505, + 723 + ], + "score": 1.0, + "content": ". We used 100 hidden units", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 720, + 285, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 285, + 732 + ], + "score": 1.0, + "content": "at each layer with a minibatches of size 500.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5 + } + ], + "page_idx": 13, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 235, + 94 + ], + "score": 1.0, + "content": "Theano Development Team.", + "type": "text" + }, + { + "bbox": [ + 254, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "Theano: A Python framework for fast computation", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 117, + 92, + 506, + 105 + ], + "spans": [ + { + "bbox": [ + 117, + 93, + 248, + 104 + ], + "score": 1.0, + "content": "of mathematical expressions.", + "type": "text" + }, + { + "bbox": [ + 263, + 93, + 478, + 105 + ], + "score": 1.0, + "content": "arXiv e-prints, abs/1605.02688, May 2016.", + "type": "text" + }, + { + "bbox": [ + 480, + 92, + 506, + 104 + ], + "score": 1.0, + "content": "URL", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 103, + 308, + 115 + ], + "spans": [ + { + "bbox": [ + 116, + 103, + 308, + 115 + ], + "score": 1.0, + "content": "http://arxiv.org/abs/1605.02688.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 106, + 82, + 506, + 115 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 120, + 505, + 153 + ], + "lines": [ + { + "bbox": [ + 106, + 119, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 106, + 119, + 505, + 133 + ], + "score": 1.0, + "content": "Francesco Visin, Kyle Kastner, Aaron Courville, Yoshua Bengio, Matteo Matteucci, and Kyunghyun", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 131, + 506, + 143 + ], + "spans": [ + { + "bbox": [ + 116, + 131, + 506, + 143 + ], + "score": 1.0, + "content": "Cho. Reseg: A recurrent neural network for object segmentation. arXiv preprint arXiv:1511.07053,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 141, + 142, + 153 + ], + "spans": [ + { + "bbox": [ + 115, + 141, + 142, + 153 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4, + "bbox_fs": [ + 106, + 119, + 506, + 153 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 158, + 504, + 171 + ], + "lines": [ + { + "bbox": [ + 106, + 158, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 106, + 158, + 506, + 172 + ], + "score": 1.0, + "content": "Wojciech Zaremba and Ilya Sutskever. Learning to execute. arXiv preprint arXiv:1410.4615, 2014.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 158, + 506, + 172 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 174, + 167, + 191 + ], + "lines": [ + { + "bbox": [ + 103, + 173, + 170, + 192 + ], + "spans": [ + { + "bbox": [ + 103, + 173, + 170, + 192 + ], + "score": 1.0, + "content": "Appendix", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "title", + "bbox": [ + 107, + 203, + 368, + 218 + ], + "lines": [ + { + "bbox": [ + 105, + 202, + 369, + 220 + ], + "spans": [ + { + "bbox": [ + 105, + 202, + 369, + 220 + ], + "score": 1.0, + "content": "A MONTE-CARLO ESTIMATE OF MOLLIFICATION", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 112, + 225, + 482, + 347 + ], + "lines": [ + { + "bbox": [ + 115, + 226, + 484, + 252 + ], + "spans": [ + { + "bbox": [ + 115, + 226, + 312, + 252 + ], + "score": 0.43, + "content": "{ \\mathcal L } _ { K } ( \\pmb \\theta ) = ( { \\mathcal L } * K ) ( \\pmb \\theta ) = \\int _ { C } { \\mathcal L } ( \\pmb \\theta - \\xi ) K ( \\xi ) d \\xi", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 227, + 484, + 249 + ], + "score": 1.0, + "content": "which can be estimated by a Monte Carlo:", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 145, + 254, + 467, + 286 + ], + "spans": [ + { + "bbox": [ + 145, + 254, + 235, + 286 + ], + "score": 0.48, + "content": "\\approx \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\xi } ^ { ( i ) } )", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 258, + 267, + 282 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 267, + 262, + 282, + 275 + ], + "score": 0.89, + "content": "\\xi ^ { ( i ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 283, + 258, + 461, + 282 + ], + "score": 1.0, + "content": "is a realization of the noise random variable", + "type": "text" + }, + { + "bbox": [ + 461, + 264, + 467, + 275 + ], + "score": 0.69, + "content": "\\xi", + "type": "inline_equation" + } + ], + "index": 10 + }, + { + "bbox": [ + 144, + 288, + 219, + 311 + ], + "spans": [ + { + "bbox": [ + 144, + 292, + 182, + 310 + ], + "score": 1.0, + "content": "yielding", + "type": "text" + }, + { + "bbox": [ + 182, + 288, + 219, + 311 + ], + "score": 0.58, + "content": "\\frac { \\partial \\mathcal { L } _ { K } ( { \\pmb \\theta } ) } { \\partial { \\pmb \\theta } }", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 145, + 313, + 246, + 347 + ], + "spans": [ + { + "bbox": [ + 145, + 313, + 246, + 347 + ], + "score": 0.66, + "content": "\\approx \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\frac { \\partial \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\xi } ^ { ( i ) } ) } { \\partial \\pmb { \\theta } } .", + "type": "inline_equation", + "image_path": "57461b29223788c5f6ecf3d474e9061d421a93c4a614f42bdc0e8319fe41e4ec.jpg" + } + ], + "index": 12 + } + ], + "index": 10.5, + "bbox_fs": [ + 115, + 226, + 484, + 347 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 347, + 453, + 360 + ], + "lines": [ + { + "bbox": [ + 106, + 347, + 455, + 361 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 313, + 361 + ], + "score": 1.0, + "content": "Therefore introducing additive noise to the input of", + "type": "text" + }, + { + "bbox": [ + 313, + 348, + 334, + 360 + ], + "score": 0.92, + "content": "\\mathcal { L } ( \\pmb \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 347, + 455, + 361 + ], + "score": 1.0, + "content": "is equivalent to mollification.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 106, + 347, + 455, + 361 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 373, + 433, + 387 + ], + "lines": [ + { + "bbox": [ + 105, + 373, + 434, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 434, + 388 + ], + "score": 1.0, + "content": "B DERIVATION OF THE NOISY ACTIVATIONS FOR THE GATING", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 396, + 396, + 411 + ], + "lines": [ + { + "bbox": [ + 105, + 394, + 397, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 158, + 412 + ], + "score": 1.0, + "content": "Assume that", + "type": "text" + }, + { + "bbox": [ + 158, + 396, + 244, + 410 + ], + "score": 0.93, + "content": "z _ { t } ^ { l } = x _ { t } ^ { l } + p _ { t } ^ { l } \\sigma ( x ) | \\xi _ { t } ^ { l } |", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 394, + 262, + 412 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 262, + 397, + 330, + 410 + ], + "score": 0.92, + "content": "\\mathrm { E } _ { \\xi } [ \\psi ( x _ { t } ^ { l } , \\xi ) ] = t", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 394, + 383, + 412 + ], + "score": 1.0, + "content": ". Thus for all", + "type": "text" + }, + { + "bbox": [ + 383, + 397, + 392, + 410 + ], + "score": 0.87, + "content": "z _ { t } ^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 394, + 397, + 412 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 394, + 397, + 412 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 150, + 425, + 459, + 492 + ], + "lines": [ + { + "bbox": [ + 150, + 425, + 459, + 492 + ], + "spans": [ + { + "bbox": [ + 150, + 425, + 459, + 492 + ], + "score": 0.38, + "content": "\\begin{array} { r l } & { \\mathrm { E } _ { \\xi } [ \\psi ( x _ { t } ^ { l } , \\xi _ { t } ^ { l } ) ] = \\mathrm { E } _ { \\xi } [ \\mathrm { f } ( z _ { t } ^ { l } ) ] , } \\\\ & { \\qquad t = \\mathrm { E } _ { \\xi } [ \\mathrm { f } ( z _ { t } ^ { l } ) ] , \\ \\mathrm { a s s u m i n g ~ f ( \\cdot ) ~ b e h a v e s ~ s i m i l a r ~ t o ~ a ~ l i n e a r ~ f u n c t i o n } ; } \\\\ & { \\qquad \\mathrm { E } _ { \\xi } [ \\mathrm { f } ( z _ { t } ^ { l } ) ] \\approx \\mathrm { f } ( \\mathrm { E } _ { \\xi } [ z _ { t } ^ { l } ] ) \\ \\mathrm { s i n c e ~ w e ~ u s e ~ h a r d - s i g m o i d ~ f o r ~ f ( \\cdot ) ~ t h i s ~ w i l l ~ h o l d } . } \\\\ & { \\qquad \\mathrm { f } ^ { - 1 } ( t ) \\approx \\mathrm { E } _ { \\xi } [ z _ { t } ^ { l } ] } \\end{array}", + "type": "interline_equation", + "image_path": "d81ce7f88b317f357b179064e036e23d39769074b19dcdf04d265f8ac162a209.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 150, + 425, + 459, + 447.3333333333333 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 150, + 447.3333333333333, + 459, + 469.66666666666663 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 150, + 469.66666666666663, + 459, + 491.99999999999994 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 511, + 361, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 509, + 362, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 362, + 525 + ], + "score": 1.0, + "content": "As in Eqn. 32, we can write the expectation of this equation as:", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19, + "bbox_fs": [ + 105, + 509, + 362, + 525 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 246, + 525, + 363, + 540 + ], + "lines": [ + { + "bbox": [ + 246, + 525, + 363, + 540 + ], + "spans": [ + { + "bbox": [ + 246, + 525, + 363, + 540 + ], + "score": 0.91, + "content": "\\mathrm { f } ^ { - 1 } ( t ) \\approx x _ { t } ^ { l } + p _ { t } ^ { l } \\sigma ( x ) \\mathrm { E } _ { \\xi } [ \\xi _ { t } ^ { l } ]", + "type": "interline_equation", + "image_path": "bb4a7988b50191817819d708c72a878138289811bede4001d28e39ac2021dcb5.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 246, + 525, + 363, + 540 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 543, + 421, + 556 + ], + "lines": [ + { + "bbox": [ + 106, + 541, + 423, + 558 + ], + "spans": [ + { + "bbox": [ + 106, + 541, + 205, + 558 + ], + "score": 1.0, + "content": "Corollary, the value that", + "type": "text" + }, + { + "bbox": [ + 205, + 543, + 229, + 556 + ], + "score": 0.93, + "content": "\\sigma ( x _ { t } ^ { l } )", + "type": "inline_equation" + }, + { + "bbox": [ + 229, + 541, + 351, + 558 + ], + "score": 1.0, + "content": "should take in expectation for", + "type": "text" + }, + { + "bbox": [ + 351, + 543, + 379, + 556 + ], + "score": 0.92, + "content": "p _ { t } ^ { l } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 541, + 423, + 558 + ], + "score": 1.0, + "content": "would be:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21, + "bbox_fs": [ + 106, + 541, + 423, + 558 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 262, + 558, + 349, + 587 + ], + "lines": [ + { + "bbox": [ + 262, + 558, + 349, + 587 + ], + "spans": [ + { + "bbox": [ + 262, + 558, + 349, + 587 + ], + "score": 0.94, + "content": "\\sigma ( x _ { t } ^ { l } ) \\approx \\frac { \\mathrm { f } ^ { - 1 } ( t ) - x _ { t } ^ { l } } { \\mathrm { E } _ { \\xi } [ \\xi _ { t } ^ { l } ] }", + "type": "interline_equation", + "image_path": "37f119cb5fff172401ae59c1cff8fb44f26310a702a76c6ba7c93fe86200e4a2.jpg" + } + ] + } + ], + "index": 22.5, + "virtual_lines": [ + { + "bbox": [ + 262, + 558, + 349, + 572.5 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 262, + 572.5, + 349, + 587.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 596, + 506, + 631 + ], + "lines": [ + { + "bbox": [ + 105, + 594, + 506, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 201, + 610 + ], + "score": 1.0, + "content": "In our experiments for", + "type": "text" + }, + { + "bbox": [ + 201, + 596, + 216, + 608 + ], + "score": 0.86, + "content": "\\operatorname { f } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 594, + 506, + 610 + ], + "score": 1.0, + "content": "we used the hard-sigmoid activation function. We used the following", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 607, + 506, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 310, + 622 + ], + "score": 1.0, + "content": "piecewise activation function in order to use it as", + "type": "text" + }, + { + "bbox": [ + 310, + 607, + 397, + 621 + ], + "score": 0.94, + "content": "\\mathrm { f } ^ { - 1 } ( x ) = 4 ( x - 0 . 5 )", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 607, + 506, + 622 + ], + "score": 1.0, + "content": ". During inference we use", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 619, + 300, + 631 + ], + "spans": [ + { + "bbox": [ + 106, + 619, + 264, + 631 + ], + "score": 1.0, + "content": "the expected value of random variables", + "type": "text" + }, + { + "bbox": [ + 265, + 621, + 272, + 629 + ], + "score": 0.78, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 619, + 290, + 631 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 290, + 619, + 296, + 631 + ], + "score": 0.84, + "content": "\\xi", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 619, + 300, + 631 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 594, + 506, + 631 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 645, + 257, + 658 + ], + "lines": [ + { + "bbox": [ + 105, + 644, + 258, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 258, + 660 + ], + "score": 1.0, + "content": "C EXPERIMENTAL DETAILS", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "title", + "bbox": [ + 107, + 668, + 167, + 681 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 169, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 169, + 682 + ], + "score": 1.0, + "content": "C.1 MNIST", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 689, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 689, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 106, + 689, + 506, + 701 + ], + "score": 1.0, + "content": "The weights of the models are initialized with Glorot & Bengio initialization Glorot et al. (2011).", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 700, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 700, + 218, + 712 + ], + "score": 1.0, + "content": "We use the learning rate of", + "type": "text" + }, + { + "bbox": [ + 219, + 700, + 247, + 710 + ], + "score": 0.88, + "content": "4 e - 4", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 700, + 396, + 712 + ], + "score": 1.0, + "content": "along with RMSProp. We initialize", + "type": "text" + }, + { + "bbox": [ + 396, + 702, + 406, + 711 + ], + "score": 0.82, + "content": "a _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 700, + 506, + 712 + ], + "score": 1.0, + "content": "parameters of mollified", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 358, + 723 + ], + "score": 1.0, + "content": "activation function by sampling it from a uniform distribution,", + "type": "text" + }, + { + "bbox": [ + 359, + 710, + 395, + 722 + ], + "score": 0.45, + "content": "\\mathrm { { U } [ - 2 , 2 ] }", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 709, + 505, + 723 + ], + "score": 1.0, + "content": ". We used 100 hidden units", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 720, + 285, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 285, + 732 + ], + "score": 1.0, + "content": "at each layer with a minibatches of size 500.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 689, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 82, + 186, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 187, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 187, + 96 + ], + "score": 1.0, + "content": "C.2 PENTOMINO", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 102, + 504, + 124 + ], + "lines": [ + { + "bbox": [ + 106, + 102, + 505, + 114 + ], + "spans": [ + { + "bbox": [ + 106, + 102, + 505, + 114 + ], + "score": 1.0, + "content": "We train a 6−layer MLP with sigmoid activation function using SGD and momentum. We used", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 113, + 455, + 124 + ], + "spans": [ + { + "bbox": [ + 106, + 113, + 423, + 124 + ], + "score": 1.0, + "content": "200 units per layer with sigmoid activation functions. We use a learning rate of", + "type": "text" + }, + { + "bbox": [ + 424, + 113, + 452, + 123 + ], + "score": 0.86, + "content": "1 e - 3", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 113, + 455, + 124 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5 + }, + { + "type": "title", + "bbox": [ + 107, + 137, + 176, + 148 + ], + "lines": [ + { + "bbox": [ + 105, + 136, + 177, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 177, + 150 + ], + "score": 1.0, + "content": "C.3 CIFAR10", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 157, + 506, + 190 + ], + "lines": [ + { + "bbox": [ + 105, + 157, + 506, + 170 + ], + "spans": [ + { + "bbox": [ + 105, + 157, + 506, + 170 + ], + "score": 1.0, + "content": "We use the same model with the same hyperparameters for both ResNet, mollified network and the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 167, + 506, + 181 + ], + "spans": [ + { + "bbox": [ + 105, + 167, + 506, + 181 + ], + "score": 1.0, + "content": "stochastic depth. We borrowed the hyperparameters of the model from Huang et al. (2016a). Our", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 178, + 423, + 190 + ], + "spans": [ + { + "bbox": [ + 106, + 178, + 423, + 190 + ], + "score": 1.0, + "content": "mollified convnet model has residual connections coming from its layer below.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 141, + 207, + 469, + 323 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 141, + 207, + 469, + 323 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 141, + 207, + 469, + 323 + ], + "spans": [ + { + "bbox": [ + 141, + 207, + 469, + 323 + ], + "score": 0.969, + "type": "image", + "image_path": "8dbf86661abcd350698fec3b04fd3a0769dbc7ba6ca3d6a790e7f74289b8e903.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 141, + 207, + 469, + 245.66666666666666 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 141, + 245.66666666666666, + 469, + 284.3333333333333 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 141, + 284.3333333333333, + 469, + 323.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 332, + 504, + 354 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 333, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 505, + 344 + ], + "score": 1.0, + "content": "Figure 10: Training and validation losses over 500 epochs of a mollified convolutional network", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 342, + 411, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 411, + 356 + ], + "score": 1.0, + "content": "composed by 110-layers. We compare against ResNet and Stochastic depth.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + } + ], + "index": 9.25 + }, + { + "type": "title", + "bbox": [ + 107, + 374, + 165, + 385 + ], + "lines": [ + { + "bbox": [ + 106, + 374, + 167, + 387 + ], + "spans": [ + { + "bbox": [ + 106, + 374, + 167, + 387 + ], + "score": 1.0, + "content": "C.4 PARITY", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 394, + 505, + 448 + ], + "lines": [ + { + "bbox": [ + 106, + 394, + 506, + 406 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 506, + 406 + ], + "score": 1.0, + "content": "The n-dimensional parity task is the task to figure out whether the sum of n-bits in a binary vector", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 403, + 506, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 506, + 417 + ], + "score": 1.0, + "content": "is even or odd. We use SGD with Nesterov momentum and initialize the weight matrices by using", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 414, + 504, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 476, + 428 + ], + "score": 1.0, + "content": "Glorot&Bengio initializationGlorot et al. (2011). For all models, we use the learning rate of", + "type": "text" + }, + { + "bbox": [ + 476, + 416, + 504, + 426 + ], + "score": 0.88, + "content": "1 e - 3", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 424, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 213, + 439 + ], + "score": 1.0, + "content": "and momentum of 0.92.", + "type": "text" + }, + { + "bbox": [ + 213, + 427, + 223, + 437 + ], + "score": 0.85, + "content": "a _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 424, + 506, + 439 + ], + "score": 1.0, + "content": "is the parameters of mollified activation function are initialized by", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 436, + 294, + 449 + ], + "spans": [ + { + "bbox": [ + 105, + 436, + 253, + 449 + ], + "score": 1.0, + "content": "sampling from uniform distribution,", + "type": "text" + }, + { + "bbox": [ + 253, + 436, + 289, + 448 + ], + "score": 0.91, + "content": "\\mathsf { \\bar { U } } [ - 2 , 2 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 436, + 294, + 449 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15 + }, + { + "type": "title", + "bbox": [ + 108, + 460, + 263, + 471 + ], + "lines": [ + { + "bbox": [ + 106, + 459, + 265, + 473 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 265, + 473 + ], + "score": 1.0, + "content": "C.5 LSTM LANGUAGE MODELING", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 480, + 505, + 533 + ], + "lines": [ + { + "bbox": [ + 106, + 480, + 505, + 493 + ], + "spans": [ + { + "bbox": [ + 106, + 480, + 505, + 493 + ], + "score": 1.0, + "content": "We trained 2-layered LSTM language models on PTB word-level. We used the models with the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 490, + 505, + 503 + ], + "spans": [ + { + "bbox": [ + 105, + 490, + 505, + 503 + ], + "score": 1.0, + "content": "same hyperparameters as in Zaremba & Sutskever (2014). We used the same hyperparameters for", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 500, + 505, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 505, + 514 + ], + "score": 1.0, + "content": "both the mollified LSTM language model and the LSTM. We use hard-sigmoid activation function", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 511, + 505, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 525 + ], + "score": 1.0, + "content": "for both the LSTM and mollified LSTM language model. We use hard-sigmoid activation function", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 522, + 215, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 215, + 534 + ], + "score": 1.0, + "content": "for the gates of the LSTM.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21 + }, + { + "type": "title", + "bbox": [ + 108, + 546, + 411, + 558 + ], + "lines": [ + { + "bbox": [ + 106, + 545, + 413, + 559 + ], + "spans": [ + { + "bbox": [ + 106, + 545, + 413, + 559 + ], + "score": 1.0, + "content": "C.6 PREDICTING THE CHARACTER EMBEDDINGS FROM CHARACTERS", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 108, + 566, + 504, + 598 + ], + "lines": [ + { + "bbox": [ + 106, + 566, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 566, + 140, + 578 + ], + "score": 1.0, + "content": "We use", + "type": "text" + }, + { + "bbox": [ + 140, + 567, + 158, + 577 + ], + "score": 0.81, + "content": "1 0 k", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 566, + 342, + 578 + ], + "score": 1.0, + "content": "of these words as a validation and another", + "type": "text" + }, + { + "bbox": [ + 342, + 567, + 359, + 577 + ], + "score": 0.85, + "content": "1 0 k", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 566, + 505, + 578 + ], + "score": 1.0, + "content": "word embeddings as test set. We", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 578, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 505, + 588 + ], + "score": 1.0, + "content": "train a bidirectional-LSTM on top of each sequence of characters for each word and on top of the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 586, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 505, + 600 + ], + "score": 1.0, + "content": "representation of bidirectional LSTM, we use a 5-layered tanh-MLP to predict the word-embedding.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 604, + 505, + 636 + ], + "lines": [ + { + "bbox": [ + 105, + 603, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 603, + 410, + 616 + ], + "score": 1.0, + "content": "We train our models using RMSProp and momentum with learning rate of", + "type": "text" + }, + { + "bbox": [ + 410, + 604, + 438, + 614 + ], + "score": 0.81, + "content": "6 e - 4", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 603, + 505, + 616 + ], + "score": 1.0, + "content": "and momentum", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 614, + 505, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 505, + 626 + ], + "score": 1.0, + "content": "0.92. The size of the minibatches, we used is 64. As seen in Figure 9, mollified LSTM network", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 625, + 176, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 625, + 176, + 637 + ], + "score": 1.0, + "content": "converges faster.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29 + } + ], + "page_idx": 14, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 293, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 26, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2017", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 310, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 82, + 186, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 187, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 187, + 96 + ], + "score": 1.0, + "content": "C.2 PENTOMINO", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 102, + 504, + 124 + ], + "lines": [ + { + "bbox": [ + 106, + 102, + 505, + 114 + ], + "spans": [ + { + "bbox": [ + 106, + 102, + 505, + 114 + ], + "score": 1.0, + "content": "We train a 6−layer MLP with sigmoid activation function using SGD and momentum. We used", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 113, + 455, + 124 + ], + "spans": [ + { + "bbox": [ + 106, + 113, + 423, + 124 + ], + "score": 1.0, + "content": "200 units per layer with sigmoid activation functions. We use a learning rate of", + "type": "text" + }, + { + "bbox": [ + 424, + 113, + 452, + 123 + ], + "score": 0.86, + "content": "1 e - 3", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 113, + 455, + 124 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5, + "bbox_fs": [ + 106, + 102, + 505, + 124 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 137, + 176, + 148 + ], + "lines": [ + { + "bbox": [ + 105, + 136, + 177, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 177, + 150 + ], + "score": 1.0, + "content": "C.3 CIFAR10", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 157, + 506, + 190 + ], + "lines": [ + { + "bbox": [ + 105, + 157, + 506, + 170 + ], + "spans": [ + { + "bbox": [ + 105, + 157, + 506, + 170 + ], + "score": 1.0, + "content": "We use the same model with the same hyperparameters for both ResNet, mollified network and the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 167, + 506, + 181 + ], + "spans": [ + { + "bbox": [ + 105, + 167, + 506, + 181 + ], + "score": 1.0, + "content": "stochastic depth. We borrowed the hyperparameters of the model from Huang et al. (2016a). Our", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 178, + 423, + 190 + ], + "spans": [ + { + "bbox": [ + 106, + 178, + 423, + 190 + ], + "score": 1.0, + "content": "mollified convnet model has residual connections coming from its layer below.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 157, + 506, + 190 + ] + }, + { + "type": "image", + "bbox": [ + 141, + 207, + 469, + 323 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 141, + 207, + 469, + 323 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 141, + 207, + 469, + 323 + ], + "spans": [ + { + "bbox": [ + 141, + 207, + 469, + 323 + ], + "score": 0.969, + "type": "image", + "image_path": "8dbf86661abcd350698fec3b04fd3a0769dbc7ba6ca3d6a790e7f74289b8e903.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 141, + 207, + 469, + 245.66666666666666 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 141, + 245.66666666666666, + 469, + 284.3333333333333 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 141, + 284.3333333333333, + 469, + 323.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 332, + 504, + 354 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 333, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 505, + 344 + ], + "score": 1.0, + "content": "Figure 10: Training and validation losses over 500 epochs of a mollified convolutional network", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 342, + 411, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 411, + 356 + ], + "score": 1.0, + "content": "composed by 110-layers. We compare against ResNet and Stochastic depth.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + } + ], + "index": 9.25 + }, + { + "type": "title", + "bbox": [ + 107, + 374, + 165, + 385 + ], + "lines": [ + { + "bbox": [ + 106, + 374, + 167, + 387 + ], + "spans": [ + { + "bbox": [ + 106, + 374, + 167, + 387 + ], + "score": 1.0, + "content": "C.4 PARITY", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 394, + 505, + 448 + ], + "lines": [ + { + "bbox": [ + 106, + 394, + 506, + 406 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 506, + 406 + ], + "score": 1.0, + "content": "The n-dimensional parity task is the task to figure out whether the sum of n-bits in a binary vector", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 403, + 506, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 506, + 417 + ], + "score": 1.0, + "content": "is even or odd. We use SGD with Nesterov momentum and initialize the weight matrices by using", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 414, + 504, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 476, + 428 + ], + "score": 1.0, + "content": "Glorot&Bengio initializationGlorot et al. (2011). For all models, we use the learning rate of", + "type": "text" + }, + { + "bbox": [ + 476, + 416, + 504, + 426 + ], + "score": 0.88, + "content": "1 e - 3", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 424, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 213, + 439 + ], + "score": 1.0, + "content": "and momentum of 0.92.", + "type": "text" + }, + { + "bbox": [ + 213, + 427, + 223, + 437 + ], + "score": 0.85, + "content": "a _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 424, + 506, + 439 + ], + "score": 1.0, + "content": "is the parameters of mollified activation function are initialized by", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 436, + 294, + 449 + ], + "spans": [ + { + "bbox": [ + 105, + 436, + 253, + 449 + ], + "score": 1.0, + "content": "sampling from uniform distribution,", + "type": "text" + }, + { + "bbox": [ + 253, + 436, + 289, + 448 + ], + "score": 0.91, + "content": "\\mathsf { \\bar { U } } [ - 2 , 2 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 436, + 294, + 449 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 394, + 506, + 449 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 460, + 263, + 471 + ], + "lines": [ + { + "bbox": [ + 106, + 459, + 265, + 473 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 265, + 473 + ], + "score": 1.0, + "content": "C.5 LSTM LANGUAGE MODELING", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 480, + 505, + 533 + ], + "lines": [ + { + "bbox": [ + 106, + 480, + 505, + 493 + ], + "spans": [ + { + "bbox": [ + 106, + 480, + 505, + 493 + ], + "score": 1.0, + "content": "We trained 2-layered LSTM language models on PTB word-level. We used the models with the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 490, + 505, + 503 + ], + "spans": [ + { + "bbox": [ + 105, + 490, + 505, + 503 + ], + "score": 1.0, + "content": "same hyperparameters as in Zaremba & Sutskever (2014). We used the same hyperparameters for", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 500, + 505, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 505, + 514 + ], + "score": 1.0, + "content": "both the mollified LSTM language model and the LSTM. We use hard-sigmoid activation function", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 511, + 505, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 525 + ], + "score": 1.0, + "content": "for both the LSTM and mollified LSTM language model. We use hard-sigmoid activation function", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 522, + 215, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 215, + 534 + ], + "score": 1.0, + "content": "for the gates of the LSTM.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 480, + 505, + 534 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 546, + 411, + 558 + ], + "lines": [ + { + "bbox": [ + 106, + 545, + 413, + 559 + ], + "spans": [ + { + "bbox": [ + 106, + 545, + 413, + 559 + ], + "score": 1.0, + "content": "C.6 PREDICTING THE CHARACTER EMBEDDINGS FROM CHARACTERS", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 108, + 566, + 504, + 598 + ], + "lines": [ + { + "bbox": [ + 106, + 566, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 566, + 140, + 578 + ], + "score": 1.0, + "content": "We use", + "type": "text" + }, + { + "bbox": [ + 140, + 567, + 158, + 577 + ], + "score": 0.81, + "content": "1 0 k", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 566, + 342, + 578 + ], + "score": 1.0, + "content": "of these words as a validation and another", + "type": "text" + }, + { + "bbox": [ + 342, + 567, + 359, + 577 + ], + "score": 0.85, + "content": "1 0 k", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 566, + 505, + 578 + ], + "score": 1.0, + "content": "word embeddings as test set. We", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 578, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 505, + 588 + ], + "score": 1.0, + "content": "train a bidirectional-LSTM on top of each sequence of characters for each word and on top of the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 586, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 505, + 600 + ], + "score": 1.0, + "content": "representation of bidirectional LSTM, we use a 5-layered tanh-MLP to predict the word-embedding.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 566, + 505, + 600 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 604, + 505, + 636 + ], + "lines": [ + { + "bbox": [ + 105, + 603, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 603, + 410, + 616 + ], + "score": 1.0, + "content": "We train our models using RMSProp and momentum with learning rate of", + "type": "text" + }, + { + "bbox": [ + 410, + 604, + 438, + 614 + ], + "score": 0.81, + "content": "6 e - 4", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 603, + 505, + 616 + ], + "score": 1.0, + "content": "and momentum", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 614, + 505, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 505, + 626 + ], + "score": 1.0, + "content": "0.92. The size of the minibatches, we used is 64. As seen in Figure 9, mollified LSTM network", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 625, + 176, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 625, + 176, + 637 + ], + "score": 1.0, + "content": "converges faster.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29, + "bbox_fs": [ + 105, + 603, + 505, + 637 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/r1G4z8cge/r1G4z8cge_model.json b/parse/train/r1G4z8cge/r1G4z8cge_model.json new file mode 100644 index 0000000000000000000000000000000000000000..24076f090515f94039255a871e0b949465e91919 --- /dev/null +++ b/parse/train/r1G4z8cge/r1G4z8cge_model.json @@ -0,0 +1,23273 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 529, + 1303, + 529, + 1303, + 935, + 398, + 935 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1284, + 1404, + 1284, + 1404, + 1576, + 298, + 1576 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1094, + 1404, + 1094, + 1404, + 1270, + 298, + 1270 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1590, + 1403, + 1590, + 1403, + 1766, + 298, + 1766 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1780, + 1404, + 1780, + 1404, + 1986, + 298, + 1986 + ], + "score": 0.975 + }, + { + "category_id": 0, + "poly": [ + 299, + 220, + 821, + 220, + 821, + 269, + 299, + 269 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 316, + 318, + 1227, + 318, + 1227, + 383, + 316, + 383 + ], + "score": 0.934 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 104, + 300, + 104 + ], + "score": 0.873 + }, + { + "category_id": 0, + "poly": [ + 773, + 463, + 926, + 463, + 926, + 495, + 773, + 495 + ], + "score": 0.87 + }, + { + "category_id": 2, + "poly": [ + 335, + 2005, + 1354, + 2005, + 1354, + 2033, + 335, + 2033 + ], + "score": 0.831 + }, + { + "category_id": 0, + "poly": [ + 302, + 1034, + 573, + 1034, + 573, + 1069, + 302, + 1069 + ], + "score": 0.774 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 856, + 2089, + 856, + 2112, + 841, + 2112 + ], + "score": 0.748 + }, + { + "category_id": 0, + "poly": [ + 302, + 1034, + 573, + 1034, + 573, + 1069, + 302, + 1069 + ], + "score": 0.48 + }, + { + "category_id": 13, + "poly": [ + 665, + 1458, + 791, + 1458, + 791, + 1492, + 665, + 1492 + ], + "score": 0.93, + "latex": "O ( 1 / \\sigma ^ { 2 } \\epsilon ^ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 1052, + 1463, + 1072, + 1463, + 1072, + 1486, + 1052, + 1486 + ], + "score": 0.79, + "latex": "\\sigma" + }, + { + "category_id": 13, + "poly": [ + 896, + 1465, + 910, + 1465, + 910, + 1486, + 896, + 1486 + ], + "score": 0.68, + "latex": "\\epsilon" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 216.0, + 825.0, + 216.0, + 825.0, + 274.0, + 291.0, + 274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 817.0, + 72.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 461.0, + 932.0, + 461.0, + 932.0, + 499.0, + 769.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 340.0, + 1998.0, + 1357.0, + 1998.0, + 1357.0, + 2039.0, + 340.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1031.0, + 579.0, + 1031.0, + 579.0, + 1078.0, + 294.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2088.0, + 859.0, + 2088.0, + 859.0, + 2118.0, + 840.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1031.0, + 579.0, + 1031.0, + 579.0, + 1078.0, + 294.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 531.0, + 1303.0, + 531.0, + 1303.0, + 563.0, + 395.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 557.0, + 1304.0, + 557.0, + 1304.0, + 593.0, + 394.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 585.0, + 1307.0, + 585.0, + 1307.0, + 623.0, + 392.0, + 623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 616.0, + 1308.0, + 616.0, + 1308.0, + 650.0, + 393.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 643.0, + 1307.0, + 643.0, + 1307.0, + 681.0, + 392.0, + 681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 675.0, + 1304.0, + 675.0, + 1304.0, + 708.0, + 393.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 704.0, + 1306.0, + 704.0, + 1306.0, + 738.0, + 393.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 734.0, + 1308.0, + 734.0, + 1308.0, + 767.0, + 394.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 763.0, + 1307.0, + 763.0, + 1307.0, + 795.0, + 393.0, + 795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 792.0, + 1306.0, + 792.0, + 1306.0, + 825.0, + 394.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 818.0, + 1307.0, + 818.0, + 1307.0, + 853.0, + 394.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 847.0, + 1306.0, + 847.0, + 1306.0, + 883.0, + 394.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 877.0, + 1306.0, + 877.0, + 1306.0, + 910.0, + 394.0, + 910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 906.0, + 1140.0, + 906.0, + 1140.0, + 939.0, + 394.0, + 939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1281.0, + 1405.0, + 1281.0, + 1405.0, + 1322.0, + 292.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1311.0, + 1408.0, + 1311.0, + 1408.0, + 1350.0, + 293.0, + 1350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1341.0, + 1408.0, + 1341.0, + 1408.0, + 1379.0, + 293.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1371.0, + 1407.0, + 1371.0, + 1407.0, + 1407.0, + 292.0, + 1407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1401.0, + 1409.0, + 1401.0, + 1409.0, + 1435.0, + 294.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1430.0, + 1408.0, + 1430.0, + 1408.0, + 1464.0, + 294.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1457.0, + 664.0, + 1457.0, + 664.0, + 1495.0, + 293.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 792.0, + 1457.0, + 895.0, + 1457.0, + 895.0, + 1495.0, + 792.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 911.0, + 1457.0, + 1051.0, + 1457.0, + 1051.0, + 1495.0, + 911.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1073.0, + 1457.0, + 1408.0, + 1457.0, + 1408.0, + 1495.0, + 1073.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1490.0, + 1401.0, + 1490.0, + 1401.0, + 1521.0, + 296.0, + 1521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1517.0, + 1404.0, + 1517.0, + 1404.0, + 1551.0, + 294.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1546.0, + 1165.0, + 1546.0, + 1165.0, + 1581.0, + 294.0, + 1581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1093.0, + 1408.0, + 1093.0, + 1408.0, + 1128.0, + 293.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1122.0, + 1406.0, + 1122.0, + 1406.0, + 1157.0, + 292.0, + 1157.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1151.0, + 1409.0, + 1151.0, + 1409.0, + 1187.0, + 289.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1181.0, + 1405.0, + 1181.0, + 1405.0, + 1215.0, + 293.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1207.0, + 1405.0, + 1207.0, + 1405.0, + 1247.0, + 292.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1240.0, + 1233.0, + 1240.0, + 1233.0, + 1274.0, + 294.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1589.0, + 1405.0, + 1589.0, + 1405.0, + 1624.0, + 296.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1620.0, + 1404.0, + 1620.0, + 1404.0, + 1655.0, + 294.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1648.0, + 1407.0, + 1648.0, + 1407.0, + 1683.0, + 294.0, + 1683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1678.0, + 1405.0, + 1678.0, + 1405.0, + 1712.0, + 294.0, + 1712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1708.0, + 1405.0, + 1708.0, + 1405.0, + 1742.0, + 294.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1736.0, + 823.0, + 1736.0, + 823.0, + 1772.0, + 293.0, + 1772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1780.0, + 1406.0, + 1780.0, + 1406.0, + 1814.0, + 294.0, + 1814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1810.0, + 1406.0, + 1810.0, + 1406.0, + 1844.0, + 294.0, + 1844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1839.0, + 1408.0, + 1839.0, + 1408.0, + 1872.0, + 294.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1867.0, + 1406.0, + 1867.0, + 1406.0, + 1901.0, + 293.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1896.0, + 1408.0, + 1896.0, + 1408.0, + 1933.0, + 292.0, + 1933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1925.0, + 1406.0, + 1925.0, + 1406.0, + 1961.0, + 291.0, + 1961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1956.0, + 1350.0, + 1956.0, + 1350.0, + 1989.0, + 294.0, + 1989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 316.0, + 1233.0, + 316.0, + 1233.0, + 356.0, + 319.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 348.0, + 1135.0, + 348.0, + 1135.0, + 388.0, + 311.0, + 388.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1275, + 1405, + 1275, + 1405, + 1398, + 298, + 1398 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 652, + 1405, + 652, + 1405, + 800, + 297, + 800 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 1752, + 1404, + 1752, + 1404, + 1871, + 297, + 1871 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 297, + 938, + 1405, + 938, + 1405, + 1056, + 297, + 1056 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 298, + 1069, + 1404, + 1069, + 1404, + 1159, + 298, + 1159 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 300, + 1173, + 1400, + 1173, + 1400, + 1261, + 300, + 1261 + ], + "score": 0.965 + }, + { + "category_id": 4, + "poly": [ + 295, + 474, + 1407, + 474, + 1407, + 593, + 295, + 593 + ], + "score": 0.951 + }, + { + "category_id": 3, + "poly": [ + 654, + 207, + 1045, + 207, + 1045, + 452, + 654, + 452 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 300, + 1488, + 1401, + 1488, + 1401, + 1551, + 300, + 1551 + ], + "score": 0.949 + }, + { + "category_id": 8, + "poly": [ + 618, + 1888, + 1079, + 1888, + 1079, + 1955, + 618, + 1955 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 565, + 1568, + 1133, + 1568, + 1133, + 1645, + 565, + 1645 + ], + "score": 0.948 + }, + { + "category_id": 1, + "poly": [ + 298, + 1678, + 1402, + 1678, + 1402, + 1739, + 298, + 1739 + ], + "score": 0.947 + }, + { + "category_id": 0, + "poly": [ + 300, + 844, + 887, + 844, + 887, + 880, + 300, + 880 + ], + "score": 0.929 + }, + { + "category_id": 0, + "poly": [ + 303, + 1434, + 807, + 1434, + 807, + 1465, + 303, + 1465 + ], + "score": 0.91 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 814, + 75, + 814, + 104, + 299, + 104 + ], + "score": 0.896 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1592, + 1399, + 1592, + 1399, + 1623, + 1366, + 1623 + ], + "score": 0.896 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1905, + 1400, + 1905, + 1400, + 1935, + 1366, + 1935 + ], + "score": 0.882 + }, + { + "category_id": 0, + "poly": [ + 298, + 904, + 894, + 904, + 894, + 934, + 298, + 934 + ], + "score": 0.862 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.77 + }, + { + "category_id": 2, + "poly": [ + 298, + 1977, + 1407, + 1977, + 1407, + 2035, + 298, + 2035 + ], + "score": 0.466 + }, + { + "category_id": 2, + "poly": [ + 298, + 1977, + 1412, + 1977, + 1412, + 2035, + 298, + 2035 + ], + "score": 0.302 + }, + { + "category_id": 14, + "poly": [ + 618, + 1885, + 1082, + 1885, + 1082, + 1957, + 618, + 1957 + ], + "score": 0.94, + "latex": "\\mathcal { L } ( \\pmb \\theta ) = \\operatorname* { l i m } _ { \\epsilon 0 } \\int \\epsilon ^ { - n } K ( \\pmb \\tau / \\epsilon ) \\mathcal { L } ( \\pmb \\theta - \\pmb \\tau ) d \\pmb \\tau ." + }, + { + "category_id": 14, + "poly": [ + 564, + 1566, + 1136, + 1566, + 1136, + 1647, + 564, + 1647 + ], + "score": 0.93, + "latex": "\\mathscr { L } _ { K } ( \\pmb { \\theta } ) = ( \\mathscr { L } * K ) ( \\pmb { \\theta } ) = \\int _ { - \\infty } ^ { + \\infty } \\mathscr { L } ( \\pmb { \\theta } - \\pmb { \\tau } ) K ( \\pmb { \\tau } ) d \\pmb { \\tau }" + }, + { + "category_id": 13, + "poly": [ + 397, + 1520, + 454, + 1520, + 454, + 1553, + 397, + 1553 + ], + "score": 0.91, + "latex": "K ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 855, + 1783, + 912, + 1783, + 912, + 1816, + 855, + 1816 + ], + "score": 0.91, + "latex": "K ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 582, + 1521, + 669, + 1521, + 669, + 1548, + 582, + 1548 + ], + "score": 0.91, + "latex": "\\tau \\in \\mathbb { R } ^ { n }" + }, + { + "category_id": 13, + "poly": [ + 849, + 1679, + 905, + 1679, + 905, + 1713, + 849, + 1713 + ], + "score": 0.91, + "latex": "K ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 960, + 1491, + 1048, + 1491, + 1048, + 1519, + 960, + 1519 + ], + "score": 0.9, + "latex": "\\boldsymbol \\theta \\in \\mathbb { R } ^ { n }" + }, + { + "category_id": 13, + "poly": [ + 629, + 1492, + 650, + 1492, + 650, + 1518, + 629, + 1518 + ], + "score": 0.81, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1842, + 319, + 1842, + 319, + 1868, + 298, + 1868 + ], + "score": 0.7, + "latex": "\\mathcal { L }" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 473.0, + 1406.0, + 473.0, + 1406.0, + 512.0, + 294.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 502.0, + 1405.0, + 502.0, + 1405.0, + 539.0, + 293.0, + 539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 532.0, + 1404.0, + 532.0, + 1404.0, + 566.0, + 296.0, + 566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 555.0, + 616.0, + 555.0, + 616.0, + 601.0, + 292.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 859.0, + 338.0, + 925.0, + 338.0, + 925.0, + 354.0, + 859.0, + 354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 390.0, + 956.0, + 390.0, + 956.0, + 403.0, + 862.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 437.0, + 967.0, + 437.0, + 967.0, + 453.0, + 861.0, + 453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 704.0, + 247.0, + 764.0, + 247.0, + 764.0, + 264.5, + 704.0, + 264.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.75, + 375.0, + 780.75, + 375.0, + 780.75, + 393.5, + 664.75, + 393.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 671.75, + 378.0, + 741.75, + 378.0, + 741.75, + 396.5, + 671.75, + 396.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 840.0, + 889.0, + 840.0, + 889.0, + 885.0, + 291.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1430.0, + 810.0, + 1430.0, + 810.0, + 1470.0, + 295.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 817.0, + 72.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 903.0, + 897.0, + 903.0, + 897.0, + 938.0, + 294.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2120.0, + 838.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1973.0, + 1404.0, + 1973.0, + 1404.0, + 2012.0, + 330.0, + 2012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2005.0, + 580.0, + 2005.0, + 580.0, + 2034.0, + 296.0, + 2034.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1971.0, + 1405.0, + 1971.0, + 1405.0, + 2013.0, + 329.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2005.0, + 580.0, + 2005.0, + 580.0, + 2034.0, + 295.0, + 2034.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1275.0, + 1407.0, + 1275.0, + 1407.0, + 1311.0, + 293.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1306.0, + 1406.0, + 1306.0, + 1406.0, + 1339.0, + 295.0, + 1339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1333.0, + 1406.0, + 1333.0, + 1406.0, + 1370.0, + 293.0, + 1370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1366.0, + 1206.0, + 1366.0, + 1206.0, + 1399.0, + 292.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 654.0, + 1405.0, + 654.0, + 1405.0, + 686.0, + 295.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 681.0, + 1405.0, + 681.0, + 1405.0, + 716.0, + 294.0, + 716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 710.0, + 1406.0, + 710.0, + 1406.0, + 747.0, + 295.0, + 747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 735.0, + 1406.0, + 735.0, + 1406.0, + 780.0, + 291.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 771.0, + 442.0, + 771.0, + 442.0, + 801.0, + 296.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1751.0, + 1404.0, + 1751.0, + 1404.0, + 1787.0, + 294.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1780.0, + 854.0, + 1780.0, + 854.0, + 1820.0, + 293.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 913.0, + 1780.0, + 1406.0, + 1780.0, + 1406.0, + 1820.0, + 913.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1809.0, + 1405.0, + 1809.0, + 1405.0, + 1848.0, + 292.0, + 1848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1839.0, + 563.0, + 1839.0, + 563.0, + 1875.0, + 320.0, + 1875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 936.0, + 1407.0, + 936.0, + 1407.0, + 974.0, + 295.0, + 974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 966.0, + 1403.0, + 966.0, + 1403.0, + 1000.0, + 295.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 992.0, + 1405.0, + 992.0, + 1405.0, + 1031.0, + 294.0, + 1031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1023.0, + 1065.0, + 1023.0, + 1065.0, + 1061.0, + 295.0, + 1061.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1068.0, + 1405.0, + 1068.0, + 1405.0, + 1104.0, + 293.0, + 1104.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1095.0, + 1405.0, + 1095.0, + 1405.0, + 1137.0, + 292.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1128.0, + 973.0, + 1128.0, + 973.0, + 1161.0, + 296.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1172.0, + 1405.0, + 1172.0, + 1405.0, + 1205.0, + 294.0, + 1205.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1202.0, + 1405.0, + 1202.0, + 1405.0, + 1235.0, + 296.0, + 1235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1230.0, + 1292.0, + 1230.0, + 1292.0, + 1265.0, + 294.0, + 1265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1488.0, + 628.0, + 1488.0, + 628.0, + 1527.0, + 295.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 651.0, + 1488.0, + 959.0, + 1488.0, + 959.0, + 1527.0, + 651.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 1488.0, + 1406.0, + 1488.0, + 1406.0, + 1527.0, + 1049.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1516.0, + 396.0, + 1516.0, + 396.0, + 1553.0, + 294.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 455.0, + 1516.0, + 581.0, + 1516.0, + 581.0, + 1553.0, + 455.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 670.0, + 1516.0, + 681.0, + 1516.0, + 681.0, + 1553.0, + 670.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1678.0, + 848.0, + 1678.0, + 848.0, + 1714.0, + 294.0, + 1714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 1678.0, + 1404.0, + 1678.0, + 1404.0, + 1714.0, + 906.0, + 1714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1708.0, + 454.0, + 1708.0, + 454.0, + 1741.0, + 294.0, + 1741.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1194, + 1403, + 1194, + 1403, + 1314, + 297, + 1314 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 301, + 365, + 1405, + 365, + 1405, + 456, + 301, + 456 + ], + "score": 0.961 + }, + { + "category_id": 8, + "poly": [ + 615, + 1039, + 1083, + 1039, + 1083, + 1109, + 615, + 1109 + ], + "score": 0.958 + }, + { + "category_id": 1, + "poly": [ + 298, + 1464, + 1406, + 1464, + 1406, + 1555, + 298, + 1555 + ], + "score": 0.956 + }, + { + "category_id": 8, + "poly": [ + 608, + 543, + 1093, + 543, + 1093, + 615, + 608, + 615 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 297, + 963, + 1400, + 963, + 1400, + 1025, + 297, + 1025 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 292, + 228, + 1400, + 228, + 1400, + 291, + 292, + 291 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 299, + 468, + 1401, + 468, + 1401, + 531, + 299, + 531 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 300, + 1921, + 1403, + 1921, + 1403, + 1984, + 300, + 1984 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 687, + 1844, + 1011, + 1844, + 1011, + 1895, + 687, + 1895 + ], + "score": 0.944 + }, + { + "category_id": 8, + "poly": [ + 591, + 300, + 1108, + 300, + 1108, + 340, + 591, + 340 + ], + "score": 0.943 + }, + { + "category_id": 1, + "poly": [ + 289, + 674, + 1402, + 674, + 1402, + 738, + 289, + 738 + ], + "score": 0.941 + }, + { + "category_id": 8, + "poly": [ + 680, + 792, + 981, + 792, + 981, + 860, + 680, + 860 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 295, + 627, + 1367, + 627, + 1367, + 661, + 295, + 661 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 298, + 1802, + 746, + 1802, + 746, + 1835, + 298, + 1835 + ], + "score": 0.929 + }, + { + "category_id": 0, + "poly": [ + 299, + 1140, + 648, + 1140, + 648, + 1172, + 299, + 1172 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 297, + 1707, + 1061, + 1707, + 1061, + 1741, + 297, + 1741 + ], + "score": 0.923 + }, + { + "category_id": 8, + "poly": [ + 529, + 1753, + 1169, + 1753, + 1169, + 1793, + 529, + 1793 + ], + "score": 0.921 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 815, + 73, + 815, + 106, + 298, + 106 + ], + "score": 0.919 + }, + { + "category_id": 8, + "poly": [ + 674, + 1644, + 1165, + 1644, + 1165, + 1682, + 674, + 1682 + ], + "score": 0.902 + }, + { + "category_id": 8, + "poly": [ + 557, + 748, + 867, + 748, + 867, + 784, + 557, + 784 + ], + "score": 0.901 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1647, + 1400, + 1647, + 1400, + 1678, + 1351, + 1678 + ], + "score": 0.891 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1758, + 1400, + 1758, + 1400, + 1789, + 1352, + 1789 + ], + "score": 0.89 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1404, + 1400, + 1404, + 1400, + 1434, + 1352, + 1434 + ], + "score": 0.89 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1848, + 1400, + 1848, + 1400, + 1878, + 1352, + 1878 + ], + "score": 0.889 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1057, + 1400, + 1057, + 1400, + 1087, + 1365, + 1087 + ], + "score": 0.883 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1347, + 1400, + 1347, + 1400, + 1377, + 1365, + 1377 + ], + "score": 0.881 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1586, + 1400, + 1586, + 1400, + 1617, + 1352, + 1617 + ], + "score": 0.88 + }, + { + "category_id": 9, + "poly": [ + 1365, + 752, + 1400, + 752, + 1400, + 782, + 1365, + 782 + ], + "score": 0.88 + }, + { + "category_id": 9, + "poly": [ + 1366, + 564, + 1400, + 564, + 1400, + 593, + 1366, + 593 + ], + "score": 0.878 + }, + { + "category_id": 9, + "poly": [ + 1366, + 305, + 1400, + 305, + 1400, + 336, + 1366, + 336 + ], + "score": 0.875 + }, + { + "category_id": 9, + "poly": [ + 1366, + 810, + 1400, + 810, + 1400, + 840, + 1366, + 840 + ], + "score": 0.869 + }, + { + "category_id": 9, + "poly": [ + 1365, + 883, + 1400, + 883, + 1400, + 914, + 1365, + 914 + ], + "score": 0.865 + }, + { + "category_id": 8, + "poly": [ + 680, + 866, + 1146, + 866, + 1146, + 936, + 680, + 936 + ], + "score": 0.859 + }, + { + "category_id": 8, + "poly": [ + 536, + 1568, + 1074, + 1568, + 1074, + 1638, + 536, + 1638 + ], + "score": 0.837 + }, + { + "category_id": 8, + "poly": [ + 699, + 1402, + 1160, + 1402, + 1160, + 1439, + 699, + 1439 + ], + "score": 0.833 + }, + { + "category_id": 2, + "poly": [ + 329, + 2003, + 1192, + 2003, + 1192, + 2035, + 329, + 2035 + ], + "score": 0.831 + }, + { + "category_id": 8, + "poly": [ + 537, + 1328, + 1033, + 1328, + 1033, + 1398, + 537, + 1398 + ], + "score": 0.689 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.683 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.516 + }, + { + "category_id": 8, + "poly": [ + 681, + 866, + 973, + 866, + 973, + 935, + 681, + 935 + ], + "score": 0.473 + }, + { + "category_id": 8, + "poly": [ + 1025, + 750, + 1142, + 750, + 1142, + 784, + 1025, + 784 + ], + "score": 0.428 + }, + { + "category_id": 8, + "poly": [ + 537, + 1328, + 1056, + 1328, + 1056, + 1437, + 537, + 1437 + ], + "score": 0.276 + }, + { + "category_id": 8, + "poly": [ + 535, + 1332, + 1123, + 1332, + 1123, + 1439, + 535, + 1439 + ], + "score": 0.274 + }, + { + "category_id": 8, + "poly": [ + 537, + 1328, + 1032, + 1328, + 1032, + 1398, + 537, + 1398 + ], + "score": 0.104 + }, + { + "category_id": 14, + "poly": [ + 615, + 1035, + 1085, + 1035, + 1085, + 1110, + 615, + 1110 + ], + "score": 0.95, + "latex": "\\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { K } ( \\pmb { \\theta } ) = - \\int _ { C } \\nabla _ { \\pmb { \\theta } } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\tau } ) K ( \\pmb { \\tau } ) d \\pmb { \\tau }" + }, + { + "category_id": 14, + "poly": [ + 604, + 541, + 1091, + 541, + 1091, + 616, + 604, + 616 + ], + "score": 0.94, + "latex": "\\int _ { C } \\mathbf { g } ( \\pmb { \\tau } ) K ( \\pmb { \\tau } ) d \\pmb { \\tau } = - \\int _ { C } \\mathcal { L } ( \\pmb { \\tau } ) \\nabla K ( \\pmb { \\tau } ) d \\pmb { \\tau } ," + }, + { + "category_id": 14, + "poly": [ + 553, + 742, + 1147, + 742, + 1147, + 941, + 553, + 941 + ], + "score": 0.93, + "latex": "\\begin{array} { r l r } { \\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { K } ( \\pmb { \\theta } ) = ( \\mathcal { L } \\ast \\nabla K ) ( \\pmb { \\theta } ) } & { } & { \\mathrm { b y ~ E q n . ~ 3 } } \\\\ { = \\displaystyle \\int _ { C } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\tau } ^ { } ) \\nabla K ( \\pmb { \\tau } ^ { } ) d \\pmb { \\tau } } \\\\ { = - \\displaystyle \\int _ { C } \\mathbf { g } ( \\pmb { \\theta } - \\pmb { \\tau } ^ { } ) K ( \\pmb { \\tau } ^ { } ) d \\pmb { \\tau } } & { } & { \\mathrm { b y ~ E q n . ~ 4 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1096, + 627, + 1223, + 627, + 1223, + 661, + 1096, + 661 + ], + "score": 0.93, + "latex": "C \\in [ a , b ] ^ { n }" + }, + { + "category_id": 14, + "poly": [ + 536, + 1325, + 1165, + 1325, + 1165, + 1444, + 536, + 1444 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } { { \\nabla _ { \\theta } \\mathcal { L } _ { K = \\mathcal { N } } ( \\theta ) = - \\int _ { C } \\nabla _ { \\theta } \\mathcal { L } ( \\theta - \\tau ) p ( \\tau ) d \\tau } } \\\\ & { = \\mathrm { E } _ { \\tau } [ \\nabla _ { \\theta } \\mathcal { L } ( \\theta - \\tau ) ] , \\mathrm { w i t h } \\ \\tau \\sim \\mathcal { N } ( 0 , \\ \\mathbf { I } ) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 534, + 1565, + 1165, + 1565, + 1165, + 1686, + 534, + 1686 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\nabla _ { \\boldsymbol { \\theta } } \\mathcal { L } _ { \\mathcal { N } , \\epsilon } ( \\boldsymbol { \\theta } ) = - \\displaystyle \\int _ { C } \\nabla _ { \\boldsymbol { \\theta } } \\mathcal { L } ( \\boldsymbol { \\theta } - \\boldsymbol { \\tau } ) \\epsilon ^ { - 1 } p ( \\boldsymbol { \\tau } / \\epsilon ) d \\boldsymbol { \\tau } } \\\\ & { ~ = \\mathrm { E } _ { \\boldsymbol { \\tau } } [ \\nabla _ { \\boldsymbol { \\theta } } \\mathcal { L } ( \\boldsymbol { \\theta } - \\boldsymbol { \\tau } ) ] , \\mathrm { w i t h } \\boldsymbol { \\tau } \\sim \\mathcal { N } ( 0 , \\epsilon ^ { 2 } \\mathbf { I } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 922, + 1196, + 1019, + 1196, + 1019, + 1230, + 922, + 1230 + ], + "score": 0.92, + "latex": "\\mathcal { N } ( 0 , \\bf { I } )" + }, + { + "category_id": 13, + "poly": [ + 372, + 627, + 438, + 627, + 438, + 661, + 372, + 661 + ], + "score": 0.92, + "latex": "K ( \\tau )" + }, + { + "category_id": 13, + "poly": [ + 1078, + 964, + 1133, + 964, + 1133, + 998, + 1078, + 998 + ], + "score": 0.92, + "latex": "g ( \\pmb \\theta )" + }, + { + "category_id": 13, + "poly": [ + 651, + 367, + 731, + 367, + 731, + 397, + 651, + 397 + ], + "score": 0.92, + "latex": "\\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { K }" + }, + { + "category_id": 13, + "poly": [ + 553, + 676, + 610, + 676, + 610, + 710, + 553, + 710 + ], + "score": 0.92, + "latex": "K ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 1302, + 1255, + 1359, + 1255, + 1359, + 1288, + 1302, + 1288 + ], + "score": 0.91, + "latex": "K ( \\cdot )" + }, + { + "category_id": 14, + "poly": [ + 685, + 1843, + 1014, + 1843, + 1014, + 1896, + 685, + 1896 + ], + "score": 0.91, + "latex": "\\operatorname* { l i m } _ { \\sigma \\to 0 } \\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { \\mathcal { N } , \\sigma } ( \\pmb { \\theta } ) = \\nabla _ { \\pmb { \\theta } } \\mathcal { L } ( \\pmb { \\theta } )" + }, + { + "category_id": 13, + "poly": [ + 1260, + 965, + 1319, + 965, + 1319, + 995, + 1260, + 995 + ], + "score": 0.91, + "latex": "\\nabla _ { \\boldsymbol { \\theta } } \\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 448, + 231, + 505, + 231, + 505, + 264, + 448, + 264 + ], + "score": 0.91, + "latex": "K ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 918, + 469, + 1091, + 469, + 1091, + 504, + 918, + 504 + ], + "score": 0.91, + "latex": "{ \\mathrm { ~ ~ g ~ } } \\in \\ L ( [ a , b ] ^ { n } )" + }, + { + "category_id": 13, + "poly": [ + 1183, + 1196, + 1239, + 1196, + 1239, + 1230, + 1183, + 1230 + ], + "score": 0.91, + "latex": "K ( \\cdot )" + }, + { + "category_id": 14, + "poly": [ + 586, + 300, + 1112, + 300, + 1112, + 340, + 586, + 340 + ], + "score": 0.9, + "latex": "\\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { K } ( \\pmb { \\theta } ) = \\nabla _ { \\pmb { \\theta } } ( \\mathcal { L } \\ast K ) ( \\pmb { \\theta } ) = ( \\mathcal { L } \\ast \\nabla K ) ( \\pmb { \\theta } ) ." + }, + { + "category_id": 13, + "poly": [ + 1274, + 628, + 1363, + 628, + 1363, + 656, + 1274, + 656 + ], + "score": 0.9, + "latex": "\\tau \\in \\mathbb { R } ^ { n }" + }, + { + "category_id": 13, + "poly": [ + 1126, + 232, + 1169, + 232, + 1169, + 261, + 1126, + 261 + ], + "score": 0.89, + "latex": "\\mathcal { L } _ { K }" + }, + { + "category_id": 13, + "poly": [ + 743, + 469, + 904, + 469, + 904, + 504, + 743, + 504 + ], + "score": 0.87, + "latex": "{ \\mathcal { L } } \\in L ( [ a , b ] )" + }, + { + "category_id": 14, + "poly": [ + 528, + 1753, + 1172, + 1753, + 1172, + 1793, + 528, + 1793 + ], + "score": 0.84, + "latex": "\\nabla _ { \\pmb { \\theta } } \\mathcal { L } _ { \\mathcal { N } , \\sigma } ( \\pmb { \\theta } ) = \\mathrm { E } _ { \\pmb { \\tau } } [ \\nabla _ { \\pmb { \\theta } } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\tau } ) ] , \\mathrm { w i t h } \\ \\pmb { \\tau } \\sim \\mathcal { N } ( 0 , \\ \\sigma ^ { 2 } \\mathbf { I } )" + }, + { + "category_id": 13, + "poly": [ + 426, + 502, + 447, + 502, + 447, + 527, + 426, + 527 + ], + "score": 0.84, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 609, + 472, + 632, + 472, + 632, + 498, + 609, + 498 + ], + "score": 0.82, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 839, + 966, + 860, + 966, + 860, + 992, + 839, + 992 + ], + "score": 0.82, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 1176, + 368, + 1197, + 368, + 1197, + 394, + 1176, + 394 + ], + "score": 0.8, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 1033, + 1715, + 1052, + 1715, + 1052, + 1736, + 1033, + 1736 + ], + "score": 0.8, + "latex": "\\sigma" + }, + { + "category_id": 13, + "poly": [ + 816, + 1928, + 837, + 1928, + 837, + 1950, + 816, + 1950 + ], + "score": 0.8, + "latex": "\\sigma" + }, + { + "category_id": 13, + "poly": [ + 491, + 1714, + 511, + 1714, + 511, + 1736, + 491, + 1736 + ], + "score": 0.79, + "latex": "\\sigma" + }, + { + "category_id": 13, + "poly": [ + 651, + 261, + 670, + 261, + 670, + 287, + 651, + 287 + ], + "score": 0.78, + "latex": "\\pmb \\theta" + }, + { + "category_id": 13, + "poly": [ + 778, + 1501, + 792, + 1501, + 792, + 1522, + 778, + 1522 + ], + "score": 0.76, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 417, + 1716, + 432, + 1716, + 432, + 1735, + 417, + 1735 + ], + "score": 0.73, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1149, + 476, + 1168, + 476, + 1168, + 498, + 1149, + 498 + ], + "score": 0.68, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1334, + 674, + 1371, + 674, + 1371, + 705, + 1334, + 705 + ], + "score": 0.62, + "latex": "4 ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 986, + 1752, + 1168, + 1752, + 1168, + 1792, + 986, + 1792 + ], + "score": 0.49, + "latex": "\\boldsymbol \\tau \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } \\mathbf { I } )" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1137.0, + 652.0, + 1137.0, + 652.0, + 1177.0, + 293.0, + 1177.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 817.0, + 72.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1998.0, + 1191.0, + 1998.0, + 1191.0, + 2040.0, + 329.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1195.0, + 921.0, + 1195.0, + 921.0, + 1229.0, + 295.0, + 1229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1020.0, + 1195.0, + 1182.0, + 1195.0, + 1182.0, + 1229.0, + 1020.0, + 1229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1240.0, + 1195.0, + 1403.0, + 1195.0, + 1403.0, + 1229.0, + 1240.0, + 1229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1225.0, + 1404.0, + 1225.0, + 1404.0, + 1259.0, + 296.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1250.0, + 1301.0, + 1250.0, + 1301.0, + 1291.0, + 294.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1360.0, + 1250.0, + 1405.0, + 1250.0, + 1405.0, + 1291.0, + 1360.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1284.0, + 508.0, + 1284.0, + 508.0, + 1317.0, + 293.0, + 1317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 365.0, + 650.0, + 365.0, + 650.0, + 402.0, + 295.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 732.0, + 365.0, + 1175.0, + 365.0, + 1175.0, + 402.0, + 732.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1198.0, + 365.0, + 1405.0, + 365.0, + 1405.0, + 402.0, + 1198.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 396.0, + 1405.0, + 396.0, + 1405.0, + 428.0, + 295.0, + 428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 425.0, + 1150.0, + 425.0, + 1150.0, + 458.0, + 296.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1464.0, + 1407.0, + 1464.0, + 1407.0, + 1501.0, + 295.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1495.0, + 777.0, + 1495.0, + 777.0, + 1529.0, + 295.0, + 1529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 793.0, + 1495.0, + 1404.0, + 1495.0, + 1404.0, + 1529.0, + 793.0, + 1529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1524.0, + 584.0, + 1524.0, + 584.0, + 1557.0, + 296.0, + 1557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 961.0, + 838.0, + 961.0, + 838.0, + 999.0, + 295.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 961.0, + 1077.0, + 961.0, + 1077.0, + 999.0, + 861.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 961.0, + 1259.0, + 961.0, + 1259.0, + 999.0, + 1134.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1320.0, + 961.0, + 1404.0, + 961.0, + 1404.0, + 999.0, + 1320.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 993.0, + 1048.0, + 993.0, + 1048.0, + 1027.0, + 293.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 226.0, + 447.0, + 226.0, + 447.0, + 267.0, + 292.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 506.0, + 226.0, + 1125.0, + 226.0, + 1125.0, + 267.0, + 506.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 226.0, + 1405.0, + 226.0, + 1405.0, + 267.0, + 1170.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 258.0, + 650.0, + 258.0, + 650.0, + 294.0, + 295.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 671.0, + 258.0, + 1166.0, + 258.0, + 1166.0, + 294.0, + 671.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 468.0, + 608.0, + 468.0, + 608.0, + 507.0, + 294.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 633.0, + 468.0, + 742.0, + 468.0, + 742.0, + 507.0, + 633.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 468.0, + 917.0, + 468.0, + 917.0, + 507.0, + 905.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 468.0, + 1148.0, + 468.0, + 1148.0, + 507.0, + 1092.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1169.0, + 468.0, + 1406.0, + 468.0, + 1406.0, + 507.0, + 1169.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 500.0, + 425.0, + 500.0, + 425.0, + 531.0, + 294.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 500.0, + 599.0, + 500.0, + 599.0, + 531.0, + 448.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1918.0, + 815.0, + 1918.0, + 815.0, + 1960.0, + 294.0, + 1960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 1918.0, + 1407.0, + 1918.0, + 1407.0, + 1960.0, + 838.0, + 1960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1949.0, + 1405.0, + 1949.0, + 1405.0, + 1986.0, + 295.0, + 1986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 673.0, + 552.0, + 673.0, + 552.0, + 711.0, + 292.0, + 711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 611.0, + 673.0, + 1333.0, + 673.0, + 1333.0, + 711.0, + 611.0, + 711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1372.0, + 673.0, + 1405.0, + 673.0, + 1405.0, + 711.0, + 1372.0, + 711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 703.0, + 557.0, + 703.0, + 557.0, + 739.0, + 293.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 622.0, + 371.0, + 622.0, + 371.0, + 665.0, + 294.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 622.0, + 1095.0, + 622.0, + 1095.0, + 665.0, + 439.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 622.0, + 1273.0, + 622.0, + 1273.0, + 665.0, + 1224.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 622.0, + 1373.0, + 622.0, + 1373.0, + 665.0, + 1364.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1797.0, + 749.0, + 1797.0, + 749.0, + 1842.0, + 293.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1702.0, + 416.0, + 1702.0, + 416.0, + 1749.0, + 292.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 433.0, + 1702.0, + 490.0, + 1702.0, + 490.0, + 1749.0, + 433.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1702.0, + 1032.0, + 1702.0, + 1032.0, + 1749.0, + 512.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 1702.0, + 1066.0, + 1702.0, + 1066.0, + 1749.0, + 1053.0, + 1749.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 303, + 1405, + 303, + 1405, + 519, + 297, + 519 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1638, + 1404, + 1638, + 1404, + 1815, + 297, + 1815 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1828, + 1404, + 1828, + 1404, + 2034, + 298, + 2034 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 293, + 837, + 1402, + 837, + 1402, + 900, + 293, + 900 + ], + "score": 0.957 + }, + { + "category_id": 1, + "poly": [ + 297, + 1522, + 1407, + 1522, + 1407, + 1613, + 297, + 1613 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 297, + 1395, + 1395, + 1395, + 1395, + 1455, + 297, + 1455 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 300, + 977, + 1400, + 977, + 1400, + 1067, + 300, + 1067 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 295, + 228, + 1401, + 228, + 1401, + 291, + 295, + 291 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 293, + 641, + 1403, + 641, + 1403, + 704, + 293, + 704 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 295, + 530, + 1401, + 530, + 1401, + 589, + 295, + 589 + ], + "score": 0.942 + }, + { + "category_id": 1, + "poly": [ + 297, + 1075, + 1402, + 1075, + 1402, + 1138, + 297, + 1138 + ], + "score": 0.942 + }, + { + "category_id": 8, + "poly": [ + 705, + 1470, + 996, + 1470, + 996, + 1511, + 705, + 1511 + ], + "score": 0.938 + }, + { + "category_id": 8, + "poly": [ + 750, + 591, + 947, + 591, + 947, + 630, + 750, + 630 + ], + "score": 0.936 + }, + { + "category_id": 8, + "poly": [ + 660, + 1303, + 1041, + 1303, + 1041, + 1372, + 660, + 1372 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 297, + 716, + 884, + 716, + 884, + 749, + 297, + 749 + ], + "score": 0.928 + }, + { + "category_id": 8, + "poly": [ + 768, + 1153, + 931, + 1153, + 931, + 1201, + 768, + 1201 + ], + "score": 0.923 + }, + { + "category_id": 0, + "poly": [ + 298, + 928, + 841, + 928, + 841, + 960, + 298, + 960 + ], + "score": 0.914 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 815, + 75, + 815, + 105, + 299, + 105 + ], + "score": 0.905 + }, + { + "category_id": 9, + "poly": [ + 1352, + 773, + 1400, + 773, + 1400, + 803, + 1352, + 803 + ], + "score": 0.904 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1473, + 1399, + 1473, + 1399, + 1504, + 1352, + 1504 + ], + "score": 0.892 + }, + { + "category_id": 9, + "poly": [ + 1352, + 597, + 1400, + 597, + 1400, + 627, + 1352, + 627 + ], + "score": 0.891 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1325, + 1400, + 1325, + 1400, + 1355, + 1352, + 1355 + ], + "score": 0.889 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1238, + 1400, + 1238, + 1400, + 1268, + 1352, + 1268 + ], + "score": 0.888 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1156, + 1400, + 1156, + 1400, + 1187, + 1352, + 1187 + ], + "score": 0.887 + }, + { + "category_id": 8, + "poly": [ + 581, + 1234, + 1117, + 1234, + 1117, + 1282, + 581, + 1282 + ], + "score": 0.847 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 857, + 2089, + 857, + 2111, + 840, + 2111 + ], + "score": 0.782 + }, + { + "category_id": 8, + "poly": [ + 584, + 764, + 1114, + 764, + 1114, + 808, + 584, + 808 + ], + "score": 0.739 + }, + { + "category_id": 8, + "poly": [ + 582, + 764, + 1115, + 764, + 1115, + 808, + 582, + 808 + ], + "score": 0.236 + }, + { + "category_id": 8, + "poly": [ + 581, + 1234, + 1118, + 1234, + 1118, + 1283, + 581, + 1283 + ], + "score": 0.123 + }, + { + "category_id": 13, + "poly": [ + 397, + 1424, + 478, + 1424, + 478, + 1457, + 397, + 1457 + ], + "score": 0.93, + "latex": "\\phi ( x , \\xi )" + }, + { + "category_id": 13, + "poly": [ + 1011, + 1523, + 1106, + 1523, + 1106, + 1557, + 1011, + 1557 + ], + "score": 0.93, + "latex": "\\phi ( x , \\xi _ { \\sigma } )" + }, + { + "category_id": 13, + "poly": [ + 1245, + 1076, + 1317, + 1076, + 1317, + 1110, + 1245, + 1110 + ], + "score": 0.92, + "latex": "T _ { \\sigma } ( f )" + }, + { + "category_id": 13, + "poly": [ + 758, + 305, + 840, + 305, + 840, + 338, + 758, + 338 + ], + "score": 0.92, + "latex": "\\mathcal { L } _ { K } ( \\pmb { \\theta } )" + }, + { + "category_id": 13, + "poly": [ + 791, + 1107, + 935, + 1107, + 935, + 1138, + 791, + 1138 + ], + "score": 0.92, + "latex": "T _ { \\sigma } : f \\to f ^ { * }" + }, + { + "category_id": 14, + "poly": [ + 749, + 588, + 949, + 588, + 949, + 631, + 749, + 631 + ], + "score": 0.92, + "latex": "\\mathbf { h } ^ { l } = \\mathbf { f } ( \\mathbf { W } ^ { l } \\mathbf { h } ^ { l - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 618, + 334, + 684, + 334, + 684, + 366, + 618, + 366 + ], + "score": 0.91, + "latex": "K ( \\pmb \\theta )" + }, + { + "category_id": 13, + "poly": [ + 403, + 334, + 468, + 334, + 468, + 366, + 403, + 366 + ], + "score": 0.91, + "latex": "K ( \\pmb \\theta )" + }, + { + "category_id": 14, + "poly": [ + 704, + 1469, + 997, + 1469, + 997, + 1510, + 704, + 1510 + ], + "score": 0.91, + "latex": "( T _ { \\sigma } f ) ( x ) = E _ { \\xi } [ \\phi ( x , \\xi _ { \\sigma } ) ]" + }, + { + "category_id": 13, + "poly": [ + 1072, + 305, + 1131, + 305, + 1131, + 338, + 1072, + 338 + ], + "score": 0.91, + "latex": "\\mathcal { L } ( \\pmb { \\theta } )" + }, + { + "category_id": 14, + "poly": [ + 766, + 1153, + 931, + 1153, + 931, + 1202, + 766, + 1202 + ], + "score": 0.91, + "latex": "\\operatorname* { l i m } _ { \\sigma \\to 0 } T _ { \\sigma } f = f ," + }, + { + "category_id": 13, + "poly": [ + 296, + 450, + 821, + 450, + 821, + 493, + 296, + 493 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\mathcal { L } _ { K } ( \\pmb { \\theta } ) = ( \\mathcal { L } * K ) ( \\pmb { \\theta } ) \\approx \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\xi } ^ { ( i ) } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 352, + 640, + 410, + 640, + 410, + 671, + 352, + 671 + ], + "score": 0.9, + "latex": "\\mathbf { h } ^ { l - 1 }" + }, + { + "category_id": 13, + "poly": [ + 1062, + 1671, + 1132, + 1671, + 1132, + 1697, + 1062, + 1697 + ], + "score": 0.9, + "latex": "\\sigma = 0" + }, + { + "category_id": 13, + "poly": [ + 1329, + 1554, + 1362, + 1554, + 1362, + 1584, + 1329, + 1584 + ], + "score": 0.88, + "latex": "T _ { \\sigma }" + }, + { + "category_id": 13, + "poly": [ + 513, + 1758, + 605, + 1758, + 605, + 1783, + 513, + 1783 + ], + "score": 0.88, + "latex": "\\sigma \\to \\infty" + }, + { + "category_id": 14, + "poly": [ + 583, + 764, + 1115, + 764, + 1115, + 807, + 583, + 807 + ], + "score": 0.88, + "latex": "\\mathbf { h } ^ { l } = \\mathbf { f } ( ( \\mathbf { W } ^ { l } - \\boldsymbol { \\xi } ^ { l } ) \\mathbf { h } ^ { l - 1 } ) , \\mathrm { w h e r e \\ } \\boldsymbol { \\xi } ^ { l } \\sim \\mathcal { N } ( \\mu , \\boldsymbol { \\sigma } ^ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 888, + 1701, + 981, + 1701, + 981, + 1726, + 888, + 1726 + ], + "score": 0.87, + "latex": "\\sigma \\to \\infty" + }, + { + "category_id": 13, + "poly": [ + 1114, + 640, + 1159, + 640, + 1159, + 671, + 1114, + 671 + ], + "score": 0.87, + "latex": "\\mathbf { W } ^ { l }" + }, + { + "category_id": 13, + "poly": [ + 763, + 1426, + 780, + 1426, + 780, + 1456, + 763, + 1456 + ], + "score": 0.85, + "latex": "\\xi" + }, + { + "category_id": 13, + "poly": [ + 1281, + 335, + 1299, + 335, + 1299, + 366, + 1281, + 366 + ], + "score": 0.83, + "latex": "\\bar { \\xi }" + }, + { + "category_id": 13, + "poly": [ + 1365, + 1525, + 1382, + 1525, + 1382, + 1556, + 1365, + 1556 + ], + "score": 0.8, + "latex": "\\xi" + }, + { + "category_id": 13, + "poly": [ + 939, + 1430, + 959, + 1430, + 959, + 1451, + 939, + 1451 + ], + "score": 0.79, + "latex": "\\sigma" + }, + { + "category_id": 13, + "poly": [ + 942, + 1646, + 962, + 1646, + 962, + 1667, + 942, + 1667 + ], + "score": 0.78, + "latex": "\\sigma" + }, + { + "category_id": 13, + "poly": [ + 1230, + 1529, + 1250, + 1529, + 1250, + 1551, + 1230, + 1551 + ], + "score": 0.78, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 826, + 1864, + 846, + 1864, + 846, + 1886, + 826, + 1886 + ], + "score": 0.76, + "latex": "\\sigma" + }, + { + "category_id": 13, + "poly": [ + 657, + 261, + 679, + 261, + 679, + 287, + 657, + 287 + ], + "score": 0.76, + "latex": "\\mathcal { L }" + }, + { + "category_id": 14, + "poly": [ + 661, + 1301, + 1039, + 1301, + 1039, + 1373, + 661, + 1373 + ], + "score": 0.76, + "latex": "\\frac { \\partial ( T _ { \\sigma } f ) ( x ) } { \\partial x } \\qquad \\mathrm { e x i s t s } \\forall x , \\sigma > 0" + }, + { + "category_id": 13, + "poly": [ + 1076, + 237, + 1097, + 237, + 1097, + 258, + 1076, + 258 + ], + "score": 0.75, + "latex": "\\sigma" + }, + { + "category_id": 13, + "poly": [ + 511, + 232, + 533, + 232, + 533, + 258, + 511, + 258 + ], + "score": 0.73, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 630, + 1865, + 650, + 1865, + 650, + 1886, + 630, + 1886 + ], + "score": 0.72, + "latex": "\\sigma" + }, + { + "category_id": 14, + "poly": [ + 580, + 1229, + 1118, + 1229, + 1118, + 1286, + 580, + 1286 + ], + "score": 0.58, + "latex": "f ^ { 0 } = \\operatorname* { l i m } _ { \\sigma \\to \\infty } T _ { \\sigma } f \\mathrm { ~ i s ~ a n ~ i d e n t i t y ~ f u n c t i o n }" + }, + { + "category_id": 14, + "poly": [ + 579, + 1227, + 1119, + 1227, + 1119, + 1375, + 579, + 1375 + ], + "score": 0.46, + "latex": "\\begin{array} { r l } { { f ^ { 0 } = \\displaystyle \\operatorname* { l i m } _ { \\sigma \\to \\infty } T _ { \\sigma } f \\quad } } & { { \\mathrm { ~ i s ~ \\ a n ~ i d e n t i t y ~ f u n c t i o n ~ } } } \\\\ { { \\frac { \\partial ( T _ { \\sigma } f ) ( x ) } { \\partial x } \\quad } } & { { \\mathrm { e x i s t s ~ } \\forall x , \\sigma > 0 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1252, + 840, + 1278, + 840, + 1278, + 867, + 1252, + 867 + ], + "score": 0.41, + "latex": "\\&" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 928.0, + 843.0, + 928.0, + 843.0, + 964.0, + 294.0, + 964.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 305.0, + 757.0, + 305.0, + 757.0, + 339.0, + 295.0, + 339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 841.0, + 305.0, + 1071.0, + 305.0, + 1071.0, + 339.0, + 841.0, + 339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1132.0, + 305.0, + 1405.0, + 305.0, + 1405.0, + 339.0, + 1132.0, + 339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 332.0, + 402.0, + 332.0, + 402.0, + 370.0, + 294.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 332.0, + 617.0, + 332.0, + 617.0, + 370.0, + 469.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 332.0, + 1280.0, + 332.0, + 1280.0, + 370.0, + 685.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1300.0, + 332.0, + 1406.0, + 332.0, + 1406.0, + 370.0, + 1300.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 358.0, + 1408.0, + 358.0, + 1408.0, + 400.0, + 292.0, + 400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 391.0, + 1407.0, + 391.0, + 1407.0, + 426.0, + 295.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 418.0, + 1406.0, + 418.0, + 1406.0, + 455.0, + 292.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 281.0, + 438.0, + 295.0, + 438.0, + 295.0, + 502.0, + 281.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 822.0, + 438.0, + 1418.0, + 438.0, + 1418.0, + 502.0, + 822.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 486.0, + 579.0, + 486.0, + 579.0, + 520.0, + 293.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1641.0, + 941.0, + 1641.0, + 941.0, + 1672.0, + 296.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 963.0, + 1641.0, + 1404.0, + 1641.0, + 1404.0, + 1672.0, + 963.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1667.0, + 1061.0, + 1667.0, + 1061.0, + 1704.0, + 292.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 1667.0, + 1406.0, + 1667.0, + 1406.0, + 1704.0, + 1133.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1696.0, + 887.0, + 1696.0, + 887.0, + 1733.0, + 294.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 1696.0, + 1405.0, + 1696.0, + 1405.0, + 1733.0, + 982.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1726.0, + 1404.0, + 1726.0, + 1404.0, + 1761.0, + 295.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1754.0, + 512.0, + 1754.0, + 512.0, + 1788.0, + 295.0, + 1788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 1754.0, + 1404.0, + 1754.0, + 1404.0, + 1788.0, + 606.0, + 1788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1781.0, + 1017.0, + 1781.0, + 1017.0, + 1821.0, + 292.0, + 1821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1826.0, + 1406.0, + 1826.0, + 1406.0, + 1864.0, + 293.0, + 1864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1857.0, + 629.0, + 1857.0, + 629.0, + 1893.0, + 293.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 651.0, + 1857.0, + 825.0, + 1857.0, + 825.0, + 1893.0, + 651.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 1857.0, + 1409.0, + 1857.0, + 1409.0, + 1893.0, + 847.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1886.0, + 1405.0, + 1886.0, + 1405.0, + 1921.0, + 293.0, + 1921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1917.0, + 1406.0, + 1917.0, + 1406.0, + 1950.0, + 294.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1943.0, + 1405.0, + 1943.0, + 1405.0, + 1980.0, + 293.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1972.0, + 1405.0, + 1972.0, + 1405.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2003.0, + 816.0, + 2003.0, + 816.0, + 2036.0, + 294.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 833.0, + 1251.0, + 833.0, + 1251.0, + 876.0, + 292.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1279.0, + 833.0, + 1405.0, + 833.0, + 1405.0, + 876.0, + 1279.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 866.0, + 1305.0, + 866.0, + 1305.0, + 900.0, + 293.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1519.0, + 1010.0, + 1519.0, + 1010.0, + 1559.0, + 292.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1107.0, + 1519.0, + 1229.0, + 1519.0, + 1229.0, + 1559.0, + 1107.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 1519.0, + 1364.0, + 1519.0, + 1364.0, + 1559.0, + 1251.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1383.0, + 1519.0, + 1407.0, + 1519.0, + 1407.0, + 1559.0, + 1383.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1553.0, + 1328.0, + 1553.0, + 1328.0, + 1587.0, + 294.0, + 1587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1363.0, + 1553.0, + 1405.0, + 1553.0, + 1405.0, + 1587.0, + 1363.0, + 1587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1580.0, + 441.0, + 1580.0, + 441.0, + 1616.0, + 291.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1392.0, + 1401.0, + 1392.0, + 1401.0, + 1429.0, + 293.0, + 1429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1421.0, + 396.0, + 1421.0, + 396.0, + 1459.0, + 293.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 479.0, + 1421.0, + 762.0, + 1421.0, + 762.0, + 1459.0, + 479.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 781.0, + 1421.0, + 938.0, + 1421.0, + 938.0, + 1459.0, + 781.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 960.0, + 1421.0, + 971.0, + 1421.0, + 971.0, + 1459.0, + 960.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 976.0, + 1405.0, + 976.0, + 1405.0, + 1012.0, + 294.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1005.0, + 1405.0, + 1005.0, + 1405.0, + 1040.0, + 293.0, + 1040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1031.0, + 397.0, + 1031.0, + 397.0, + 1070.0, + 293.0, + 1070.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 228.0, + 510.0, + 228.0, + 510.0, + 267.0, + 294.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 534.0, + 228.0, + 1075.0, + 228.0, + 1075.0, + 267.0, + 534.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 228.0, + 1406.0, + 228.0, + 1406.0, + 267.0, + 1098.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 260.0, + 656.0, + 260.0, + 656.0, + 295.0, + 297.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 260.0, + 690.0, + 260.0, + 690.0, + 295.0, + 680.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 633.0, + 351.0, + 633.0, + 351.0, + 683.0, + 291.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 411.0, + 633.0, + 1113.0, + 633.0, + 1113.0, + 683.0, + 411.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1160.0, + 633.0, + 1406.0, + 633.0, + 1406.0, + 683.0, + 1160.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 670.0, + 1071.0, + 670.0, + 1071.0, + 704.0, + 295.0, + 704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 528.0, + 1403.0, + 528.0, + 1403.0, + 566.0, + 294.0, + 566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 560.0, + 681.0, + 560.0, + 681.0, + 594.0, + 295.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1073.0, + 1244.0, + 1073.0, + 1244.0, + 1112.0, + 293.0, + 1112.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1318.0, + 1073.0, + 1404.0, + 1073.0, + 1404.0, + 1112.0, + 1318.0, + 1112.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1101.0, + 790.0, + 1101.0, + 790.0, + 1141.0, + 292.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 936.0, + 1101.0, + 946.0, + 1101.0, + 946.0, + 1141.0, + 936.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 715.0, + 885.0, + 715.0, + 885.0, + 752.0, + 294.0, + 752.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 1221, + 1403, + 1221, + 1403, + 1350, + 299, + 1350 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1404, + 229, + 1404, + 378, + 298, + 378 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 490, + 1403, + 490, + 1403, + 639, + 298, + 639 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 652, + 1404, + 652, + 1404, + 804, + 298, + 804 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 1866, + 1403, + 1866, + 1403, + 1989, + 298, + 1989 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 298, + 1762, + 1403, + 1762, + 1403, + 1852, + 298, + 1852 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 298, + 897, + 1406, + 897, + 1406, + 1104, + 298, + 1104 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 299, + 1531, + 1407, + 1531, + 1407, + 1598, + 299, + 1598 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 292, + 1685, + 1404, + 1685, + 1404, + 1749, + 292, + 1749 + ], + "score": 0.943 + }, + { + "category_id": 8, + "poly": [ + 736, + 1614, + 963, + 1614, + 963, + 1654, + 736, + 1654 + ], + "score": 0.934 + }, + { + "category_id": 8, + "poly": [ + 754, + 1368, + 1001, + 1368, + 1001, + 1407, + 754, + 1407 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 298, + 816, + 1401, + 816, + 1401, + 877, + 298, + 877 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 297, + 2002, + 1104, + 2002, + 1104, + 2034, + 297, + 2034 + ], + "score": 0.92 + }, + { + "category_id": 0, + "poly": [ + 296, + 1153, + 1397, + 1153, + 1397, + 1190, + 296, + 1190 + ], + "score": 0.909 + }, + { + "category_id": 0, + "poly": [ + 299, + 421, + 481, + 421, + 481, + 457, + 299, + 457 + ], + "score": 0.901 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1620, + 1399, + 1620, + 1399, + 1650, + 1352, + 1650 + ], + "score": 0.9 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 104, + 300, + 104 + ], + "score": 0.894 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1468, + 1400, + 1468, + 1400, + 1498, + 1352, + 1498 + ], + "score": 0.893 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1375, + 1400, + 1375, + 1400, + 1405, + 1352, + 1405 + ], + "score": 0.884 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1422, + 1400, + 1422, + 1400, + 1452, + 1352, + 1452 + ], + "score": 0.87 + }, + { + "category_id": 8, + "poly": [ + 754, + 1461, + 1043, + 1461, + 1043, + 1501, + 754, + 1501 + ], + "score": 0.843 + }, + { + "category_id": 8, + "poly": [ + 566, + 1416, + 1132, + 1416, + 1132, + 1455, + 566, + 1455 + ], + "score": 0.831 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.719 + }, + { + "category_id": 8, + "poly": [ + 565, + 1416, + 1135, + 1416, + 1135, + 1502, + 565, + 1502 + ], + "score": 0.244 + }, + { + "category_id": 14, + "poly": [ + 566, + 1362, + 1134, + 1362, + 1134, + 1507, + 566, + 1507 + ], + "score": 0.93, + "latex": "\\begin{array} { c } { { \\tilde { \\mathbf { h } } ^ { l } = \\psi ( \\mathbf { h } ^ { l - 1 } , \\pmb { \\xi } ; \\mathbf { W } ^ { l } ) } } \\\\ { { \\phi ( \\mathbf { h } ^ { l - 1 } , \\pmb { \\xi } , \\pi ^ { l } ; \\mathbf { W } ^ { l } ) = \\pi ^ { l } \\odot \\mathbf { h } ^ { l - 1 } + ( 1 - \\pi ^ { l } ) \\odot \\tilde { \\mathbf { h } ^ { l } } } } \\\\ { { \\mathbf { h } ^ { l } = \\phi ( \\mathbf { h } ^ { l - 1 } , \\pmb { \\xi } , \\pi ^ { l } ; \\mathbf { W } ^ { l } ) . } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1278, + 1761, + 1359, + 1761, + 1359, + 1795, + 1278, + 1795 + ], + "score": 0.91, + "latex": "p ^ { l } = 0" + }, + { + "category_id": 13, + "poly": [ + 525, + 1287, + 702, + 1287, + 702, + 1323, + 525, + 1323 + ], + "score": 0.91, + "latex": "\\psi ( \\mathbf { h } ^ { l - 1 } , \\boldsymbol { \\xi } ; \\bar { \\mathbf { W } } ^ { l } )" + }, + { + "category_id": 14, + "poly": [ + 735, + 1612, + 964, + 1612, + 964, + 1653, + 735, + 1653 + ], + "score": 0.91, + "latex": "\\pi ^ { l } \\sim \\mathrm { B e r n o u l l i } ( p ^ { l } )" + }, + { + "category_id": 13, + "poly": [ + 344, + 1760, + 424, + 1760, + 424, + 1795, + 344, + 1795 + ], + "score": 0.91, + "latex": "p ^ { l } = 1" + }, + { + "category_id": 13, + "poly": [ + 887, + 711, + 1402, + 711, + 1402, + 748, + 887, + 748 + ], + "score": 0.91, + "latex": "\\bar { \\mathrm { L } } = ( \\bar { \\mathcal { L } } ^ { 1 } ( \\pmb { \\theta } ; \\xi _ { \\sigma _ { 1 } } ) , \\bar { \\mathcal { L } } ^ { 2 } ( \\pmb { \\theta } ; \\xi _ { \\sigma _ { 2 } } ) , \\cdots , \\bar { \\mathcal { L } } ^ { k } ( \\pmb { \\theta } ; \\xi _ { \\sigma _ { k } } ) )" + }, + { + "category_id": 13, + "poly": [ + 1295, + 1287, + 1352, + 1287, + 1352, + 1318, + 1295, + 1318 + ], + "score": 0.89, + "latex": "\\mathbf { h } ^ { l - 1 }" + }, + { + "category_id": 13, + "poly": [ + 1304, + 1563, + 1328, + 1563, + 1328, + 1598, + 1304, + 1598 + ], + "score": 0.88, + "latex": "p ^ { l }" + }, + { + "category_id": 13, + "poly": [ + 866, + 1687, + 919, + 1687, + 919, + 1716, + 866, + 1716 + ], + "score": 0.87, + "latex": "l + 1" + }, + { + "category_id": 13, + "poly": [ + 1191, + 1253, + 1222, + 1253, + 1222, + 1286, + 1191, + 1286 + ], + "score": 0.86, + "latex": "\\tilde { \\mathbf { h } } ^ { l }" + }, + { + "category_id": 13, + "poly": [ + 1044, + 1954, + 1087, + 1954, + 1087, + 1989, + 1044, + 1989 + ], + "score": 0.86, + "latex": "( \\hat { p ^ { l } } )" + }, + { + "category_id": 13, + "poly": [ + 1108, + 1898, + 1170, + 1898, + 1170, + 1925, + 1108, + 1925 + ], + "score": 0.86, + "latex": "l - 1" + }, + { + "category_id": 13, + "poly": [ + 911, + 1287, + 956, + 1287, + 956, + 1318, + 911, + 1318 + ], + "score": 0.85, + "latex": "\\bar { \\mathbf { W } } ^ { l }" + }, + { + "category_id": 13, + "poly": [ + 1003, + 749, + 1031, + 749, + 1031, + 773, + 1003, + 773 + ], + "score": 0.85, + "latex": "\\sigma _ { i }" + }, + { + "category_id": 13, + "poly": [ + 789, + 1290, + 809, + 1290, + 809, + 1322, + 789, + 1322 + ], + "score": 0.83, + "latex": "\\boldsymbol { \\xi }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1716, + 352, + 1716, + 352, + 1744, + 298, + 1744 + ], + "score": 0.83, + "latex": "l - 1" + }, + { + "category_id": 13, + "poly": [ + 1094, + 990, + 1114, + 990, + 1114, + 1016, + 1094, + 1016 + ], + "score": 0.79, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 728, + 1047, + 746, + 1047, + 746, + 1074, + 728, + 1074 + ], + "score": 0.77, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 705, + 1688, + 758, + 1688, + 758, + 1715, + 705, + 1715 + ], + "score": 0.77, + "latex": "l - 1" + }, + { + "category_id": 13, + "poly": [ + 298, + 1324, + 320, + 1324, + 320, + 1346, + 298, + 1346 + ], + "score": 0.74, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 1339, + 1898, + 1353, + 1898, + 1353, + 1924, + 1339, + 1924 + ], + "score": 0.57, + "latex": "l" + }, + { + "category_id": 13, + "poly": [ + 880, + 261, + 922, + 261, + 922, + 291, + 880, + 291 + ], + "score": 0.52, + "latex": "\\mathrm { N g }" + }, + { + "category_id": 13, + "poly": [ + 1065, + 260, + 1105, + 260, + 1105, + 292, + 1065, + 292 + ], + "score": 0.25, + "latex": "\\bar { \\bf N } \\mathrm { \\bf g }" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1152.0, + 1402.0, + 1152.0, + 1402.0, + 1191.0, + 294.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 416.0, + 486.0, + 416.0, + 486.0, + 466.0, + 292.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 817.0, + 72.0, + 817.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 861.0, + 2085.0, + 861.0, + 2120.0, + 839.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1221.0, + 1408.0, + 1221.0, + 1408.0, + 1258.0, + 293.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1256.0, + 1190.0, + 1256.0, + 1190.0, + 1291.0, + 293.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 1256.0, + 1407.0, + 1256.0, + 1407.0, + 1291.0, + 1223.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1285.0, + 524.0, + 1285.0, + 524.0, + 1326.0, + 293.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 1285.0, + 788.0, + 1285.0, + 788.0, + 1326.0, + 703.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 810.0, + 1285.0, + 910.0, + 1285.0, + 910.0, + 1326.0, + 810.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 957.0, + 1285.0, + 1294.0, + 1285.0, + 1294.0, + 1326.0, + 957.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1353.0, + 1285.0, + 1408.0, + 1285.0, + 1408.0, + 1326.0, + 1353.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1318.0, + 297.0, + 1318.0, + 297.0, + 1353.0, + 293.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1318.0, + 1216.0, + 1318.0, + 1216.0, + 1353.0, + 321.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 228.0, + 1406.0, + 228.0, + 1406.0, + 266.0, + 295.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 257.0, + 879.0, + 257.0, + 879.0, + 293.0, + 294.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 257.0, + 1064.0, + 257.0, + 1064.0, + 293.0, + 923.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 257.0, + 1405.0, + 257.0, + 1405.0, + 293.0, + 1106.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 288.0, + 1406.0, + 288.0, + 1406.0, + 324.0, + 294.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 319.0, + 1405.0, + 319.0, + 1405.0, + 351.0, + 296.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 342.0, + 631.0, + 342.0, + 631.0, + 385.0, + 294.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 491.0, + 1405.0, + 491.0, + 1405.0, + 527.0, + 296.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 520.0, + 1405.0, + 520.0, + 1405.0, + 557.0, + 294.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 544.0, + 1405.0, + 544.0, + 1405.0, + 589.0, + 292.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 580.0, + 1404.0, + 580.0, + 1404.0, + 612.0, + 296.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 606.0, + 1204.0, + 606.0, + 1204.0, + 642.0, + 294.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 651.0, + 1406.0, + 651.0, + 1406.0, + 686.0, + 296.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 679.0, + 1405.0, + 679.0, + 1405.0, + 716.0, + 294.0, + 716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 708.0, + 886.0, + 708.0, + 886.0, + 753.0, + 289.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 708.0, + 1408.0, + 708.0, + 1408.0, + 753.0, + 1403.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 744.0, + 1002.0, + 744.0, + 1002.0, + 777.0, + 296.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 744.0, + 1405.0, + 744.0, + 1405.0, + 777.0, + 1032.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 770.0, + 1409.0, + 770.0, + 1409.0, + 805.0, + 293.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1867.0, + 1405.0, + 1867.0, + 1405.0, + 1903.0, + 293.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1897.0, + 1107.0, + 1897.0, + 1107.0, + 1930.0, + 294.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 1897.0, + 1338.0, + 1897.0, + 1338.0, + 1930.0, + 1171.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 1897.0, + 1405.0, + 1897.0, + 1405.0, + 1930.0, + 1354.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1927.0, + 1407.0, + 1927.0, + 1407.0, + 1960.0, + 296.0, + 1960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1958.0, + 1043.0, + 1958.0, + 1043.0, + 1994.0, + 293.0, + 1994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1088.0, + 1958.0, + 1208.0, + 1958.0, + 1208.0, + 1994.0, + 1088.0, + 1994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1760.0, + 343.0, + 1760.0, + 343.0, + 1800.0, + 293.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 1760.0, + 1277.0, + 1760.0, + 1277.0, + 1800.0, + 425.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1360.0, + 1760.0, + 1405.0, + 1760.0, + 1405.0, + 1800.0, + 1360.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1793.0, + 1405.0, + 1793.0, + 1405.0, + 1826.0, + 296.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1820.0, + 1368.0, + 1820.0, + 1368.0, + 1856.0, + 293.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 893.0, + 1406.0, + 893.0, + 1406.0, + 935.0, + 295.0, + 935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 924.0, + 1404.0, + 924.0, + 1404.0, + 963.0, + 327.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 957.0, + 1247.0, + 957.0, + 1247.0, + 987.0, + 331.0, + 987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 981.0, + 1093.0, + 981.0, + 1093.0, + 1021.0, + 292.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 981.0, + 1406.0, + 981.0, + 1406.0, + 1021.0, + 1115.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1013.0, + 1355.0, + 1013.0, + 1355.0, + 1048.0, + 327.0, + 1048.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1039.0, + 727.0, + 1039.0, + 727.0, + 1078.0, + 292.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 1039.0, + 1404.0, + 1039.0, + 1404.0, + 1078.0, + 747.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1072.0, + 1090.0, + 1072.0, + 1090.0, + 1106.0, + 330.0, + 1106.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1527.0, + 1405.0, + 1527.0, + 1405.0, + 1570.0, + 293.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1566.0, + 1303.0, + 1566.0, + 1303.0, + 1598.0, + 297.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1329.0, + 1566.0, + 1339.0, + 1566.0, + 1339.0, + 1598.0, + 1329.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1684.0, + 704.0, + 1684.0, + 704.0, + 1721.0, + 293.0, + 1721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 759.0, + 1684.0, + 865.0, + 1684.0, + 865.0, + 1721.0, + 759.0, + 1721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 920.0, + 1684.0, + 1406.0, + 1684.0, + 1406.0, + 1721.0, + 920.0, + 1721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1713.0, + 297.0, + 1713.0, + 297.0, + 1752.0, + 293.0, + 1752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1713.0, + 1407.0, + 1713.0, + 1407.0, + 1752.0, + 353.0, + 1752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 811.0, + 1405.0, + 811.0, + 1405.0, + 854.0, + 293.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 844.0, + 556.0, + 844.0, + 556.0, + 879.0, + 294.0, + 879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1997.0, + 1108.0, + 1997.0, + 1108.0, + 2041.0, + 293.0, + 2041.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 344, + 224, + 1351, + 224, + 1351, + 651, + 344, + 651 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 297, + 1537, + 1405, + 1537, + 1405, + 1629, + 297, + 1629 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 297, + 1330, + 1401, + 1330, + 1401, + 1422, + 297, + 1422 + ], + "score": 0.962 + }, + { + "category_id": 1, + "poly": [ + 299, + 1435, + 1400, + 1435, + 1400, + 1525, + 299, + 1525 + ], + "score": 0.96 + }, + { + "category_id": 1, + "poly": [ + 296, + 1640, + 1405, + 1640, + 1405, + 1709, + 296, + 1709 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 298, + 1968, + 1404, + 1968, + 1404, + 2036, + 298, + 2036 + ], + "score": 0.949 + }, + { + "category_id": 4, + "poly": [ + 295, + 674, + 1406, + 674, + 1406, + 823, + 295, + 823 + ], + "score": 0.941 + }, + { + "category_id": 0, + "poly": [ + 297, + 1913, + 899, + 1913, + 899, + 1948, + 297, + 1948 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 301, + 1789, + 1401, + 1789, + 1401, + 1847, + 301, + 1847 + ], + "score": 0.929 + }, + { + "category_id": 8, + "poly": [ + 725, + 1846, + 975, + 1846, + 975, + 1883, + 725, + 1883 + ], + "score": 0.921 + }, + { + "category_id": 0, + "poly": [ + 301, + 1264, + 759, + 1264, + 759, + 1299, + 301, + 1299 + ], + "score": 0.919 + }, + { + "category_id": 8, + "poly": [ + 419, + 1745, + 1279, + 1745, + 1279, + 1785, + 419, + 1785 + ], + "score": 0.914 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 814, + 76, + 814, + 104, + 299, + 104 + ], + "score": 0.893 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1750, + 1400, + 1750, + 1400, + 1780, + 1352, + 1780 + ], + "score": 0.867 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2113, + 840, + 2113 + ], + "score": 0.807 + }, + { + "category_id": 0, + "poly": [ + 301, + 863, + 790, + 863, + 790, + 895, + 301, + 895 + ], + "score": 0.792 + }, + { + "category_id": 1, + "poly": [ + 305, + 900, + 1405, + 900, + 1405, + 1208, + 305, + 1208 + ], + "score": 0.724 + }, + { + "category_id": 5, + "poly": [ + 305, + 900, + 1405, + 900, + 1405, + 1208, + 305, + 1208 + ], + "score": 0.518, + "html": "
1: xi ←w[hl-1 +bi 2:△i←u(xi)-f(xi)> an affine transformation of hl-1 △i is a measure of a saturation of a unit
3: σ(xi)← (sigmoid(ai△i)-0.5)²std of the injected noise depends on △i > sampling the noise from a basic Normal distribution
4: ε ~N(0,1) 5:Si← plcσ(xi)|silHalf-Normal noise controlled by g(xi),const. c and prob-ty pl 6: ψ(xi,Si) ← sgn(u*(xi))min(lu*(xi)l, |f*(xi) + sgn(u*(xi)|sill) +u(O)> noisy activation
" + }, + { + "category_id": 13, + "poly": [ + 1266, + 1157, + 1321, + 1157, + 1321, + 1196, + 1266, + 1196 + ], + "score": 0.92, + "latex": "h _ { i } ^ { l - 1 }" + }, + { + "category_id": 13, + "poly": [ + 1105, + 1673, + 1322, + 1673, + 1322, + 1709, + 1105, + 1709 + ], + "score": 0.92, + "latex": "x _ { i } = \\mathbf { w } _ { i } ^ { \\top } \\mathbf { h } ^ { l - 1 } + b _ { i }" + }, + { + "category_id": 13, + "poly": [ + 364, + 2000, + 460, + 2000, + 460, + 2034, + 364, + 2034 + ], + "score": 0.92, + "latex": "p ^ { l } \\to \\infty \\quad" + }, + { + "category_id": 13, + "poly": [ + 818, + 1568, + 876, + 1568, + 876, + 1600, + 818, + 1600 + ], + "score": 0.92, + "latex": "\\sigma ( \\mathbf { h } )" + }, + { + "category_id": 13, + "poly": [ + 339, + 1640, + 565, + 1640, + 565, + 1675, + 339, + 1675 + ], + "score": 0.92, + "latex": "\\mathbf { u } ^ { * } ( x ) = \\mathbf { u } ( x ) - \\mathbf { u } ( 0 )" + }, + { + "category_id": 14, + "poly": [ + 725, + 1844, + 975, + 1844, + 975, + 1882, + 725, + 1882 + ], + "score": 0.9, + "latex": "s _ { i } \\sim \\mathcal { N } ( 0 , p c \\sigma ( x _ { i } ) )" + }, + { + "category_id": 13, + "poly": [ + 1070, + 1028, + 1136, + 1028, + 1136, + 1060, + 1070, + 1060 + ], + "score": 0.89, + "latex": "\\sigma ( x _ { i } )" + }, + { + "category_id": 13, + "poly": [ + 1366, + 967, + 1400, + 967, + 1400, + 997, + 1366, + 997 + ], + "score": 0.88, + "latex": "\\Delta _ { i }" + }, + { + "category_id": 13, + "poly": [ + 500, + 1493, + 554, + 1493, + 554, + 1526, + 500, + 1526 + ], + "score": 0.88, + "latex": "\\mathrm { f } ^ { \\ast } ( \\cdot )" + }, + { + "category_id": 14, + "poly": [ + 418, + 1746, + 1280, + 1746, + 1280, + 1784, + 418, + 1784 + ], + "score": 0.88, + "latex": "\\psi ( x _ { i } , \\xi _ { i } ; \\mathbf { w } _ { i } ) = \\mathrm { s g n } ( \\mathbf { u } ^ { * } ( x _ { i } ) ) \\mathrm { m i n } ( | \\mathbf { u } ^ { * } ( x _ { i } ) | , | \\mathbf { f } ^ { * } ( x _ { i } ) + \\mathrm { s g n } ( \\mathbf { u } ^ { * } ( x _ { i } ) ) | s _ { i } | | ) + \\mathbf { u } ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 1035, + 1673, + 1092, + 1673, + 1092, + 1705, + 1035, + 1705 + ], + "score": 0.88, + "latex": "\\mathbf { h } ^ { l - 1 }" + }, + { + "category_id": 13, + "poly": [ + 1373, + 1157, + 1401, + 1157, + 1401, + 1196, + 1373, + 1196 + ], + "score": 0.87, + "latex": "\\tilde { h } _ { i } ^ { l }" + }, + { + "category_id": 13, + "poly": [ + 347, + 1060, + 767, + 1060, + 767, + 1090, + 347, + 1090 + ], + "score": 0.87, + "latex": "\\psi ( x _ { i } , \\xi _ { i } ) \\gets \\mathrm { s g n } ( \\mathbf { u } ^ { * } ( x _ { i } ) ) \\mathrm { m i n } ( | \\mathbf { u } ^ { * } ( x _ { i } ) |" + }, + { + "category_id": 13, + "poly": [ + 1211, + 1645, + 1239, + 1645, + 1239, + 1672, + 1211, + 1672 + ], + "score": 0.86, + "latex": "x _ { i }" + }, + { + "category_id": 13, + "poly": [ + 345, + 1126, + 508, + 1126, + 508, + 1160, + 345, + 1160 + ], + "score": 0.86, + "latex": "\\ddot { h } _ { i } ^ { l } = \\psi ( x _ { i } , \\xi _ { i } )" + }, + { + "category_id": 13, + "poly": [ + 297, + 763, + 357, + 763, + 357, + 791, + 297, + 791 + ], + "score": 0.86, + "latex": "l - 1" + }, + { + "category_id": 13, + "poly": [ + 345, + 998, + 501, + 998, + 501, + 1028, + 345, + 1028 + ], + "score": 0.86, + "latex": "\\xi _ { i } \\sim \\mathcal { N } ( 0 , 1 )" + }, + { + "category_id": 13, + "poly": [ + 1375, + 1027, + 1400, + 1027, + 1400, + 1060, + 1375, + 1060 + ], + "score": 0.85, + "latex": "p ^ { l }" + }, + { + "category_id": 13, + "poly": [ + 782, + 1058, + 1178, + 1058, + 1178, + 1091, + 782, + 1091 + ], + "score": 0.85, + "latex": "| \\mathbf { f } ^ { * } ( x _ { i } ) + \\mathrm { s g n } ( \\mathbf { u } ^ { * } ( x _ { i } ) ) | \\hat { s _ { i } } | | ) + \\bar { \\mathbf { u } } ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 1346, + 902, + 1401, + 902, + 1401, + 933, + 1346, + 933 + ], + "score": 0.84, + "latex": "\\mathbf { h } ^ { l - 1 }" + }, + { + "category_id": 13, + "poly": [ + 345, + 1029, + 568, + 1029, + 568, + 1061, + 345, + 1061 + ], + "score": 0.83, + "latex": "s _ { i } \\gets p ^ { l } c \\sigma ( x _ { i } ) | \\xi _ { i } |" + }, + { + "category_id": 13, + "poly": [ + 647, + 1641, + 699, + 1641, + 699, + 1675, + 647, + 1675 + ], + "score": 0.82, + "latex": "{ \\bf u } ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 1032, + 1121, + 1062, + 1121, + 1062, + 1160, + 1032, + 1160 + ], + "score": 0.82, + "latex": "\\tilde { h } _ { i } ^ { l }" + }, + { + "category_id": 13, + "poly": [ + 345, + 1159, + 826, + 1159, + 826, + 1197, + 345, + 1197 + ], + "score": 0.8, + "latex": "\\phi ( \\mathbf { h } ^ { l - 1 } , \\xi _ { i } , \\pi _ { i } ^ { l } ; \\mathbf { w } _ { i } ) = \\pi _ { i } ^ { l } h _ { i } ^ { l - 1 } + ( 1 - \\pi _ { i } ^ { l } ) \\tilde { h } _ { i } ^ { l }" + }, + { + "category_id": 13, + "poly": [ + 346, + 968, + 723, + 968, + 723, + 999, + 346, + 999 + ], + "score": 0.8, + "latex": "\\sigma ( x _ { i } ) \\gets ( \\mathrm { s i g m o i d } ( a _ { i } \\Delta _ { i } ) - 0 . 5 ) ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1280, + 1644, + 1292, + 1644, + 1292, + 1669, + 1280, + 1669 + ], + "score": 0.76, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1176, + 1435, + 1218, + 1435, + 1218, + 1468, + 1176, + 1468 + ], + "score": 0.74, + "latex": "\\operatorname { f } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 333, + 1827, + 347, + 1827, + 347, + 1845, + 333, + 1845 + ], + "score": 0.74, + "latex": "c" + }, + { + "category_id": 13, + "poly": [ + 1221, + 1034, + 1237, + 1034, + 1237, + 1056, + 1221, + 1056 + ], + "score": 0.73, + "latex": "c" + }, + { + "category_id": 13, + "poly": [ + 346, + 937, + 574, + 937, + 574, + 967, + 346, + 967 + ], + "score": 0.73, + "latex": "\\Delta _ { i } \\gets \\mathbf { u } ( x _ { i } ) - \\mathbf { f } ( x _ { i } )" + }, + { + "category_id": 13, + "poly": [ + 344, + 903, + 567, + 903, + 567, + 937, + 344, + 937 + ], + "score": 0.71, + "latex": "x _ { i } \\gets \\mathbf { w } _ { i } ^ { \\top } \\mathbf { h } ^ { l - 1 } + b _ { i }" + }, + { + "category_id": 13, + "poly": [ + 347, + 1092, + 661, + 1092, + 661, + 1124, + 347, + 1124 + ], + "score": 0.71, + "latex": "\\pi _ { i } ^ { l } \\sim { \\bf B e r n o u l l i } ( p ^ { l } ) \\qquad \\triangleright p ^ { l }" + }, + { + "category_id": 13, + "poly": [ + 669, + 867, + 681, + 867, + 681, + 891, + 669, + 891 + ], + "score": 0.68, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 513, + 798, + 535, + 798, + 535, + 819, + 513, + 819 + ], + "score": 0.68, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 934, + 935, + 992, + 935, + 992, + 965, + 934, + 965 + ], + "score": 0.64, + "latex": "\\mathsf { D } \\Delta _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1198, + 1062, + 1221, + 1062, + 1221, + 1087, + 1198, + 1087 + ], + "score": 0.53, + "latex": "\\triangleright" + }, + { + "category_id": 13, + "poly": [ + 774, + 866, + 786, + 866, + 786, + 891, + 774, + 891 + ], + "score": 0.43, + "latex": "l" + }, + { + "category_id": 13, + "poly": [ + 597, + 1602, + 616, + 1602, + 616, + 1629, + 597, + 1629 + ], + "score": 0.35, + "latex": "\\mathfrak { p }" + }, + { + "category_id": 13, + "poly": [ + 556, + 274, + 583, + 274, + 583, + 295, + 556, + 295 + ], + "score": 0.34, + "latex": "\\rho" + }, + { + "category_id": 15, + "poly": [ + 676.0, + 219.0, + 769.0, + 219.0, + 769.0, + 267.0, + 676.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 461.0, + 273.0, + 555.0, + 273.0, + 555.0, + 300.0, + 461.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 584.0, + 269.0, + 673.0, + 269.0, + 673.0, + 302.0, + 584.0, + 302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 281.0, + 690.0, + 281.0, + 690.0, + 292.0, + 679.0, + 292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 272.0, + 745.0, + 272.0, + 745.0, + 301.0, + 692.0, + 301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 766.0, + 273.0, + 864.0, + 273.0, + 864.0, + 300.0, + 766.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 282.0, + 882.0, + 282.0, + 882.0, + 290.0, + 873.0, + 290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 883.0, + 273.0, + 977.0, + 273.0, + 977.0, + 300.0, + 883.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1082.0, + 323.0, + 1136.0, + 323.0, + 1136.0, + 353.0, + 1082.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 374.0, + 749.0, + 374.0, + 749.0, + 414.0, + 690.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 676.0, + 427.0, + 768.0, + 427.0, + 768.0, + 475.0, + 676.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 479.0, + 563.0, + 479.0, + 563.0, + 509.0, + 460.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 479.0, + 746.0, + 479.0, + 746.0, + 509.0, + 568.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 752.0, + 476.0, + 866.0, + 476.0, + 866.0, + 510.0, + 752.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 476.0, + 978.0, + 476.0, + 978.0, + 511.0, + 873.0, + 511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1296.0, + 499.0, + 1319.0, + 499.0, + 1319.0, + 525.0, + 1296.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1075.0, + 520.0, + 1142.0, + 520.0, + 1142.0, + 574.0, + 1075.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 518.0, + 1226.0, + 518.0, + 1226.0, + 576.0, + 1151.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1279.0, + 523.0, + 1340.0, + 523.0, + 1340.0, + 572.0, + 1279.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 582.0, + 750.0, + 582.0, + 750.0, + 620.0, + 688.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1031.0, + 570.0, + 1151.0, + 570.0, + 1151.0, + 613.0, + 1031.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 599.0, + 1228.0, + 599.0, + 1228.0, + 659.0, + 1155.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 286.5, + 416.0, + 286.5, + 416.0, + 321.5, + 355.0, + 321.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.25, + 491.5, + 417.25, + 491.5, + 417.25, + 530.5, + 354.25, + 530.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 786.0, + 611.0, + 855.0, + 611.0, + 855.0, + 653.5, + 786.0, + 653.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 676.0, + 1404.0, + 676.0, + 1404.0, + 708.0, + 295.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 703.0, + 1407.0, + 703.0, + 1407.0, + 738.0, + 294.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 732.0, + 1407.0, + 732.0, + 1407.0, + 769.0, + 293.0, + 769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 758.0, + 296.0, + 758.0, + 296.0, + 802.0, + 291.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 758.0, + 1406.0, + 758.0, + 1406.0, + 802.0, + 358.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 793.0, + 512.0, + 793.0, + 512.0, + 825.0, + 294.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 536.0, + 793.0, + 546.0, + 793.0, + 546.0, + 825.0, + 536.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1914.0, + 899.0, + 1914.0, + 899.0, + 1951.0, + 294.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1262.0, + 766.0, + 1262.0, + 766.0, + 1306.0, + 292.0, + 1306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2087.0, + 862.0, + 2087.0, + 862.0, + 2117.0, + 840.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 859.0, + 668.0, + 859.0, + 668.0, + 900.0, + 296.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 859.0, + 773.0, + 859.0, + 773.0, + 900.0, + 682.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 787.0, + 859.0, + 797.0, + 859.0, + 797.0, + 900.0, + 787.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1534.0, + 1408.0, + 1534.0, + 1408.0, + 1575.0, + 292.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1565.0, + 817.0, + 1565.0, + 817.0, + 1602.0, + 294.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 1565.0, + 1406.0, + 1565.0, + 1406.0, + 1602.0, + 877.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1595.0, + 596.0, + 1595.0, + 596.0, + 1632.0, + 294.0, + 1632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 617.0, + 1595.0, + 1016.0, + 1595.0, + 1016.0, + 1632.0, + 617.0, + 1632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1329.0, + 1403.0, + 1329.0, + 1403.0, + 1365.0, + 293.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1360.0, + 1406.0, + 1360.0, + 1406.0, + 1396.0, + 292.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1389.0, + 843.0, + 1389.0, + 843.0, + 1425.0, + 293.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1431.0, + 1175.0, + 1431.0, + 1175.0, + 1471.0, + 293.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1219.0, + 1431.0, + 1405.0, + 1431.0, + 1405.0, + 1471.0, + 1219.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1465.0, + 1404.0, + 1465.0, + 1404.0, + 1499.0, + 293.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1491.0, + 499.0, + 1491.0, + 499.0, + 1529.0, + 294.0, + 1529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 555.0, + 1491.0, + 1038.0, + 1491.0, + 1038.0, + 1529.0, + 555.0, + 1529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1639.0, + 338.0, + 1639.0, + 338.0, + 1676.0, + 294.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 1639.0, + 646.0, + 1639.0, + 646.0, + 1676.0, + 566.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 700.0, + 1639.0, + 1210.0, + 1639.0, + 1210.0, + 1676.0, + 700.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1240.0, + 1639.0, + 1279.0, + 1639.0, + 1279.0, + 1676.0, + 1240.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1293.0, + 1639.0, + 1408.0, + 1639.0, + 1408.0, + 1676.0, + 1293.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1668.0, + 1034.0, + 1668.0, + 1034.0, + 1713.0, + 293.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1093.0, + 1668.0, + 1104.0, + 1668.0, + 1104.0, + 1713.0, + 1093.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1323.0, + 1668.0, + 1407.0, + 1668.0, + 1407.0, + 1713.0, + 1323.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1967.0, + 1404.0, + 1967.0, + 1404.0, + 2006.0, + 295.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1999.0, + 363.0, + 1999.0, + 363.0, + 2039.0, + 293.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 461.0, + 1999.0, + 1405.0, + 1999.0, + 1405.0, + 2039.0, + 461.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 301.0, + 1786.0, + 1405.0, + 1786.0, + 1405.0, + 1824.0, + 301.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1819.0, + 332.0, + 1819.0, + 332.0, + 1854.0, + 293.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 1819.0, + 361.0, + 1819.0, + 361.0, + 1854.0, + 348.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 900.0, + 343.0, + 900.0, + 343.0, + 941.0, + 306.0, + 941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 900.0, + 571.0, + 900.0, + 571.0, + 941.0, + 568.0, + 941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 933.0, + 345.0, + 933.0, + 345.0, + 969.0, + 307.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 993.0, + 933.0, + 1404.0, + 933.0, + 1404.0, + 965.0, + 993.0, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 962.0, + 345.0, + 962.0, + 345.0, + 1000.0, + 305.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 936.0, + 963.0, + 1365.0, + 963.0, + 1365.0, + 1000.0, + 936.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 963.0, + 1405.0, + 963.0, + 1405.0, + 1000.0, + 1401.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 995.0, + 344.0, + 995.0, + 344.0, + 1028.0, + 309.0, + 1028.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 995.0, + 1404.0, + 995.0, + 1404.0, + 1027.0, + 796.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 1025.0, + 344.0, + 1025.0, + 344.0, + 1065.0, + 305.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 569.0, + 1025.0, + 572.0, + 1025.0, + 572.0, + 1065.0, + 569.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 673.0, + 1025.0, + 1069.0, + 1025.0, + 1069.0, + 1063.0, + 673.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1137.0, + 1025.0, + 1220.0, + 1025.0, + 1220.0, + 1063.0, + 1137.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1238.0, + 1025.0, + 1374.0, + 1025.0, + 1374.0, + 1063.0, + 1238.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1025.0, + 1404.0, + 1025.0, + 1404.0, + 1063.0, + 1401.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 1054.0, + 346.0, + 1054.0, + 346.0, + 1094.0, + 305.0, + 1094.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 768.0, + 1054.0, + 781.0, + 1054.0, + 781.0, + 1094.0, + 768.0, + 1094.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1179.0, + 1054.0, + 1197.0, + 1054.0, + 1197.0, + 1094.0, + 1179.0, + 1094.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1222.0, + 1054.0, + 1406.0, + 1054.0, + 1406.0, + 1094.0, + 1222.0, + 1094.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 1086.0, + 346.0, + 1086.0, + 346.0, + 1127.0, + 305.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 662.0, + 1087.0, + 1405.0, + 1087.0, + 1405.0, + 1125.0, + 662.0, + 1125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 304.0, + 1119.0, + 344.0, + 1119.0, + 344.0, + 1165.0, + 304.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 1119.0, + 513.0, + 1119.0, + 513.0, + 1165.0, + 509.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1124.0, + 1031.0, + 1124.0, + 1031.0, + 1160.0, + 1009.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 1124.0, + 1405.0, + 1124.0, + 1405.0, + 1160.0, + 1063.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 1155.0, + 344.0, + 1155.0, + 344.0, + 1199.0, + 305.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 1155.0, + 831.0, + 1155.0, + 831.0, + 1199.0, + 827.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1153.0, + 1265.0, + 1153.0, + 1265.0, + 1199.0, + 835.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1322.0, + 1153.0, + 1372.0, + 1153.0, + 1372.0, + 1199.0, + 1322.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1153.0, + 1406.0, + 1153.0, + 1406.0, + 1199.0, + 1402.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1015.0, + 898.5, + 1407.0, + 898.5, + 1407.0, + 938.0, + 1015.0, + 938.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1211, + 1405, + 1211, + 1405, + 1365, + 296, + 1365 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 1076, + 1405, + 1076, + 1405, + 1196, + 297, + 1196 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 1423, + 1405, + 1423, + 1405, + 1513, + 297, + 1513 + ], + "score": 0.975 + }, + { + "category_id": 4, + "poly": [ + 295, + 609, + 1405, + 609, + 1405, + 728, + 295, + 728 + ], + "score": 0.966 + }, + { + "category_id": 3, + "poly": [ + 330, + 244, + 1364, + 244, + 1364, + 583, + 330, + 583 + ], + "score": 0.956 + }, + { + "category_id": 8, + "poly": [ + 725, + 1548, + 973, + 1548, + 973, + 1625, + 725, + 1625 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 294, + 1798, + 1403, + 1798, + 1403, + 1862, + 294, + 1862 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 293, + 1627, + 1403, + 1627, + 1403, + 1694, + 293, + 1694 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 296, + 1890, + 1402, + 1890, + 1402, + 1957, + 296, + 1957 + ], + "score": 0.949 + }, + { + "category_id": 8, + "poly": [ + 685, + 1372, + 1014, + 1372, + 1014, + 1415, + 685, + 1415 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 296, + 781, + 1400, + 781, + 1400, + 845, + 296, + 845 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 753, + 1990, + 940, + 1990, + 940, + 2037, + 753, + 2037 + ], + "score": 0.939 + }, + { + "category_id": 0, + "poly": [ + 297, + 1009, + 831, + 1009, + 831, + 1047, + 297, + 1047 + ], + "score": 0.926 + }, + { + "category_id": 0, + "poly": [ + 300, + 1732, + 800, + 1732, + 800, + 1769, + 300, + 1769 + ], + "score": 0.921 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1572, + 1400, + 1572, + 1400, + 1603, + 1352, + 1603 + ], + "score": 0.899 + }, + { + "category_id": 9, + "poly": [ + 1352, + 2003, + 1400, + 2003, + 1400, + 2033, + 1352, + 2033 + ], + "score": 0.897 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 814, + 76, + 814, + 104, + 299, + 104 + ], + "score": 0.887 + }, + { + "category_id": 9, + "poly": [ + 1352, + 897, + 1400, + 897, + 1400, + 928, + 1352, + 928 + ], + "score": 0.881 + }, + { + "category_id": 9, + "poly": [ + 1352, + 938, + 1400, + 938, + 1400, + 969, + 1352, + 969 + ], + "score": 0.873 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 858, + 2087, + 858, + 2111, + 841, + 2111 + ], + "score": 0.776 + }, + { + "category_id": 8, + "poly": [ + 613, + 937, + 909, + 937, + 909, + 973, + 613, + 973 + ], + "score": 0.692 + }, + { + "category_id": 8, + "poly": [ + 735, + 896, + 1087, + 896, + 1087, + 932, + 735, + 932 + ], + "score": 0.644 + }, + { + "category_id": 8, + "poly": [ + 610, + 895, + 1086, + 895, + 1086, + 974, + 610, + 974 + ], + "score": 0.41 + }, + { + "category_id": 14, + "poly": [ + 725, + 1546, + 974, + 1546, + 974, + 1627, + 725, + 1627 + ], + "score": 0.94, + "latex": "\\sigma ( x _ { t } ^ { l } ) = \\frac { \\mathrm { f } ^ { - 1 } ( \\gamma ) - x _ { t } ^ { l } } { \\mathrm { E } _ { \\xi } [ | \\xi | ] }" + }, + { + "category_id": 14, + "poly": [ + 756, + 1990, + 942, + 1990, + 942, + 2037, + 756, + 2037 + ], + "score": 0.93, + "latex": "p _ { t } ^ { l } = 1 - \\mathrm { e } ^ { - \\frac { k v _ { t } l } { t L } }" + }, + { + "category_id": 13, + "poly": [ + 739, + 1333, + 840, + 1333, + 840, + 1366, + 739, + 1366 + ], + "score": 0.92, + "latex": "\\psi ( x _ { t } , \\dot { \\xi _ { i } } )" + }, + { + "category_id": 14, + "poly": [ + 685, + 1371, + 1015, + 1371, + 1015, + 1413, + 685, + 1413 + ], + "score": 0.92, + "latex": "\\boldsymbol { \\psi } ( x _ { t } ^ { l } , \\xi ) = \\mathbf { f } ( x _ { t } ^ { l } + p ^ { l } \\sigma ( x ) | \\xi | )" + }, + { + "category_id": 13, + "poly": [ + 701, + 1424, + 757, + 1424, + 757, + 1457, + 701, + 1457 + ], + "score": 0.91, + "latex": "\\sigma ( x )" + }, + { + "category_id": 13, + "poly": [ + 1321, + 1421, + 1397, + 1421, + 1397, + 1455, + 1321, + 1455 + ], + "score": 0.91, + "latex": "p ^ { l } = 1" + }, + { + "category_id": 13, + "poly": [ + 730, + 1273, + 797, + 1273, + 797, + 1310, + 730, + 1310 + ], + "score": 0.9, + "latex": "\\textstyle { 1 - { \\frac { 1 } { t } } }" + }, + { + "category_id": 13, + "poly": [ + 622, + 1454, + 696, + 1454, + 696, + 1485, + 622, + 1485 + ], + "score": 0.9, + "latex": "\\gamma \\in \\mathbb { R }" + }, + { + "category_id": 14, + "poly": [ + 610, + 892, + 1089, + 892, + 1089, + 976, + 610, + 976 + ], + "score": 0.9, + "latex": "\\begin{array} { c } { s _ { i } = \\underset { \\mathbf { \\sigma } } { \\mathrm { m i n i m u m } } ( | x _ { i } | , p \\sigma ( x _ { i } ) | \\boldsymbol { \\xi } | ) } \\\\ { \\psi ( x _ { i } , \\xi _ { i } , \\mathbf { w } _ { i } ) = \\mathbf { f } ( x _ { i } ) - s _ { i } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 812, + 1657, + 871, + 1657, + 871, + 1693, + 812, + 1693 + ], + "score": 0.89, + "latex": "\\bar { \\bf f } ( { \\bf x } _ { t } ^ { l } )" + }, + { + "category_id": 13, + "poly": [ + 883, + 1922, + 908, + 1922, + 908, + 1957, + 883, + 1957 + ], + "score": 0.88, + "latex": "p _ { t } ^ { l }" + }, + { + "category_id": 13, + "poly": [ + 923, + 1453, + 964, + 1453, + 964, + 1486, + 923, + 1486 + ], + "score": 0.88, + "latex": "\\operatorname { f } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 956, + 668, + 1038, + 668, + 1038, + 701, + 956, + 701 + ], + "score": 0.88, + "latex": "| 0 . 2 5 x |" + }, + { + "category_id": 13, + "poly": [ + 497, + 1272, + 516, + 1272, + 516, + 1310, + 497, + 1310 + ], + "score": 0.85, + "latex": "\\textstyle { \\frac { 1 } { t } }" + }, + { + "category_id": 13, + "poly": [ + 1234, + 1425, + 1252, + 1425, + 1252, + 1456, + 1234, + 1456 + ], + "score": 0.83, + "latex": "\\xi" + }, + { + "category_id": 13, + "poly": [ + 833, + 1219, + 846, + 1219, + 846, + 1241, + 833, + 1241 + ], + "score": 0.76, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 711, + 1212, + 730, + 1212, + 730, + 1249, + 711, + 1249 + ], + "score": 0.69, + "latex": "\\textstyle { \\frac { 1 } { t } }" + }, + { + "category_id": 13, + "poly": [ + 778, + 1740, + 798, + 1740, + 798, + 1770, + 778, + 1770 + ], + "score": 0.69, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 831, + 668, + 869, + 668, + 869, + 701, + 831, + 701 + ], + "score": 0.33, + "latex": "( \\cdot ) |" + }, + { + "category_id": 13, + "poly": [ + 734, + 667, + 868, + 667, + 868, + 701, + 734, + 701 + ], + "score": 0.32, + "latex": "| \\mathrm { { s i g m o i d } ( \\cdot ) | }" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 608.0, + 1405.0, + 608.0, + 1405.0, + 642.0, + 295.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 638.0, + 1403.0, + 638.0, + 1403.0, + 673.0, + 295.0, + 673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 666.0, + 733.0, + 666.0, + 733.0, + 704.0, + 295.0, + 704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 666.0, + 955.0, + 666.0, + 955.0, + 704.0, + 870.0, + 704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 666.0, + 1405.0, + 666.0, + 1405.0, + 704.0, + 1039.0, + 704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 696.0, + 834.0, + 696.0, + 834.0, + 733.0, + 293.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 338.0, + 250.0, + 353.0, + 250.0, + 353.0, + 263.0, + 338.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 996.0, + 250.0, + 1014.0, + 250.0, + 1014.0, + 264.0, + 996.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 360.0, + 263.0, + 366.0, + 263.0, + 366.0, + 268.0, + 360.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 546.0, + 257.0, + 699.0, + 257.0, + 699.0, + 290.0, + 546.0, + 290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1270.0, + 265.0, + 1331.0, + 265.0, + 1331.0, + 288.0, + 1270.0, + 288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1327.0, + 271.0, + 1336.0, + 271.0, + 1336.0, + 279.0, + 1327.0, + 279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 548.0, + 282.0, + 628.0, + 282.0, + 628.0, + 308.0, + 548.0, + 308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 670.0, + 283.0, + 678.0, + 283.0, + 678.0, + 292.0, + 670.0, + 292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1270.0, + 283.0, + 1317.0, + 283.0, + 1317.0, + 306.0, + 1270.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1322.0, + 287.0, + 1345.0, + 287.0, + 1345.0, + 301.0, + 1322.0, + 301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 298.0, + 353.0, + 298.0, + 353.0, + 312.0, + 337.0, + 312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 656.0, + 303.0, + 665.0, + 303.0, + 665.0, + 313.0, + 656.0, + 313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 995.0, + 308.0, + 1015.0, + 308.0, + 1015.0, + 325.0, + 995.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 321.0, + 652.0, + 321.0, + 652.0, + 337.0, + 638.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 345.0, + 356.0, + 345.0, + 356.0, + 362.0, + 334.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 343.0, + 637.0, + 343.0, + 637.0, + 353.0, + 627.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 354.0, + 442.0, + 354.0, + 442.0, + 377.0, + 425.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 993.0, + 369.0, + 1015.0, + 369.0, + 1015.0, + 386.0, + 993.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 380.0, + 1184.0, + 380.0, + 1184.0, + 389.0, + 1171.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 395.0, + 353.0, + 395.0, + 353.0, + 408.0, + 336.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 996.0, + 432.0, + 1014.0, + 432.0, + 1014.0, + 444.0, + 996.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 443.0, + 353.0, + 443.0, + 353.0, + 457.0, + 337.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.0, + 462.0, + 509.0, + 462.0, + 509.0, + 471.0, + 500.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 543.0, + 464.0, + 549.0, + 464.0, + 549.0, + 470.0, + 543.0, + 470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 492.0, + 354.0, + 492.0, + 354.0, + 506.0, + 336.0, + 506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 490.0, + 1016.0, + 490.0, + 1016.0, + 506.0, + 991.0, + 506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 503.0, + 362.0, + 503.0, + 362.0, + 512.0, + 352.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 500.0, + 406.0, + 500.0, + 406.0, + 515.0, + 390.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 432.0, + 500.0, + 449.0, + 500.0, + 449.0, + 515.0, + 432.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 477.0, + 503.0, + 489.0, + 503.0, + 489.0, + 513.0, + 477.0, + 513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 521.0, + 503.0, + 532.0, + 503.0, + 532.0, + 513.0, + 521.0, + 513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 502.0, + 618.0, + 502.0, + 618.0, + 515.0, + 604.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 649.0, + 503.0, + 659.0, + 503.0, + 659.0, + 513.0, + 649.0, + 513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.0, + 503.0, + 701.0, + 503.0, + 701.0, + 512.0, + 691.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1010.0, + 503.0, + 1022.0, + 503.0, + 1022.0, + 513.0, + 1010.0, + 513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 500.0, + 1067.0, + 500.0, + 1067.0, + 515.0, + 1051.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 500.0, + 1110.0, + 500.0, + 1110.0, + 515.0, + 1094.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 500.0, + 1152.0, + 500.0, + 1152.0, + 515.0, + 1136.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1179.0, + 500.0, + 1194.0, + 500.0, + 1194.0, + 515.0, + 1179.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 503.0, + 1234.0, + 503.0, + 1234.0, + 513.0, + 1223.0, + 513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1264.0, + 500.0, + 1279.0, + 500.0, + 1279.0, + 515.0, + 1264.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1308.0, + 502.0, + 1322.0, + 502.0, + 1322.0, + 515.0, + 1308.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1353.0, + 503.0, + 1362.0, + 503.0, + 1362.0, + 512.0, + 1353.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 502.0, + 553.0, + 538.0, + 553.0, + 538.0, + 587.0, + 502.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1160.0, + 547.0, + 1201.0, + 547.0, + 1201.0, + 591.0, + 1160.0, + 591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 314.5, + 418.0, + 314.5, + 418.0, + 340.0, + 393.0, + 340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 336.5, + 433.0, + 336.5, + 433.0, + 358.5, + 408.0, + 358.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.75, + 320.5, + 1288.75, + 320.5, + 1288.75, + 340.5, + 1217.75, + 340.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1182.25, + 365.0, + 1205.25, + 365.0, + 1205.25, + 377.5, + 1182.25, + 377.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1194.0, + 350.5, + 1233.0, + 350.5, + 1233.0, + 361.5, + 1194.0, + 361.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 458.75, + 410.5, + 475.75, + 410.5, + 475.75, + 425.5, + 458.75, + 425.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1153.75, + 390.5, + 1176.75, + 390.5, + 1176.75, + 399.5, + 1153.75, + 399.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.75, + 410.0, + 1169.75, + 410.0, + 1169.75, + 432.5, + 1072.75, + 432.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1008.0, + 830.0, + 1008.0, + 830.0, + 1052.0, + 295.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1726.0, + 777.0, + 1726.0, + 777.0, + 1778.0, + 292.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 799.0, + 1726.0, + 805.0, + 1726.0, + 805.0, + 1778.0, + 799.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2118.0, + 839.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1206.0, + 710.0, + 1206.0, + 710.0, + 1255.0, + 290.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 731.0, + 1206.0, + 832.0, + 1206.0, + 832.0, + 1255.0, + 731.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 1206.0, + 1411.0, + 1206.0, + 1411.0, + 1255.0, + 847.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1240.0, + 1408.0, + 1240.0, + 1408.0, + 1277.0, + 295.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1269.0, + 496.0, + 1269.0, + 496.0, + 1310.0, + 291.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 1269.0, + 729.0, + 1269.0, + 729.0, + 1310.0, + 517.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 1269.0, + 1408.0, + 1269.0, + 1408.0, + 1310.0, + 798.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1301.0, + 1407.0, + 1301.0, + 1407.0, + 1337.0, + 293.0, + 1337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1332.0, + 738.0, + 1332.0, + 738.0, + 1369.0, + 294.0, + 1369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 841.0, + 1332.0, + 1223.0, + 1332.0, + 1223.0, + 1369.0, + 841.0, + 1369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1075.0, + 1405.0, + 1075.0, + 1405.0, + 1114.0, + 295.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1107.0, + 1407.0, + 1107.0, + 1407.0, + 1141.0, + 295.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1132.0, + 1405.0, + 1132.0, + 1405.0, + 1173.0, + 294.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1165.0, + 1091.0, + 1165.0, + 1091.0, + 1199.0, + 296.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1422.0, + 700.0, + 1422.0, + 700.0, + 1457.0, + 292.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 758.0, + 1422.0, + 1233.0, + 1422.0, + 1233.0, + 1457.0, + 758.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1253.0, + 1422.0, + 1320.0, + 1422.0, + 1320.0, + 1457.0, + 1253.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1398.0, + 1422.0, + 1407.0, + 1422.0, + 1407.0, + 1457.0, + 1398.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1451.0, + 621.0, + 1451.0, + 621.0, + 1488.0, + 292.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 1451.0, + 922.0, + 1451.0, + 922.0, + 1488.0, + 697.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 965.0, + 1451.0, + 1407.0, + 1451.0, + 1407.0, + 1488.0, + 965.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1482.0, + 588.0, + 1482.0, + 588.0, + 1513.0, + 293.0, + 1513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1798.0, + 1403.0, + 1798.0, + 1403.0, + 1834.0, + 294.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1826.0, + 1386.0, + 1826.0, + 1386.0, + 1863.0, + 294.0, + 1863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1624.0, + 1405.0, + 1624.0, + 1405.0, + 1660.0, + 296.0, + 1660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1657.0, + 811.0, + 1657.0, + 811.0, + 1697.0, + 293.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 1657.0, + 882.0, + 1657.0, + 882.0, + 1697.0, + 872.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1890.0, + 1406.0, + 1890.0, + 1406.0, + 1926.0, + 296.0, + 1926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1921.0, + 882.0, + 1921.0, + 882.0, + 1961.0, + 294.0, + 1961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 1921.0, + 919.0, + 1921.0, + 919.0, + 1961.0, + 909.0, + 1961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 778.0, + 1404.0, + 778.0, + 1404.0, + 817.0, + 294.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 809.0, + 407.0, + 809.0, + 407.0, + 846.0, + 292.0, + 846.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 226, + 1404, + 226, + 1404, + 419, + 297, + 419 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1523, + 1405, + 1523, + 1405, + 1641, + 298, + 1641 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 596, + 1404, + 596, + 1404, + 746, + 297, + 746 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 1747, + 1403, + 1747, + 1403, + 1837, + 299, + 1837 + ], + "score": 0.961 + }, + { + "category_id": 1, + "poly": [ + 297, + 477, + 1406, + 477, + 1406, + 569, + 297, + 569 + ], + "score": 0.961 + }, + { + "category_id": 8, + "poly": [ + 662, + 424, + 1038, + 424, + 1038, + 474, + 662, + 474 + ], + "score": 0.943 + }, + { + "category_id": 1, + "poly": [ + 303, + 1925, + 1402, + 1925, + 1402, + 1987, + 303, + 1987 + ], + "score": 0.936 + }, + { + "category_id": 0, + "poly": [ + 300, + 1681, + 558, + 1681, + 558, + 1716, + 300, + 1716 + ], + "score": 0.918 + }, + { + "category_id": 4, + "poly": [ + 302, + 1462, + 1389, + 1462, + 1389, + 1496, + 302, + 1496 + ], + "score": 0.902 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 815, + 75, + 815, + 105, + 299, + 105 + ], + "score": 0.901 + }, + { + "category_id": 9, + "poly": [ + 1352, + 428, + 1399, + 428, + 1399, + 458, + 1352, + 458 + ], + "score": 0.897 + }, + { + "category_id": 0, + "poly": [ + 301, + 1870, + 774, + 1870, + 774, + 1902, + 301, + 1902 + ], + "score": 0.892 + }, + { + "category_id": 3, + "poly": [ + 499, + 927, + 1189, + 927, + 1189, + 1422, + 499, + 1422 + ], + "score": 0.876 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2112, + 840, + 2112 + ], + "score": 0.812 + }, + { + "category_id": 1, + "poly": [ + 295, + 775, + 1407, + 775, + 1407, + 865, + 295, + 865 + ], + "score": 0.671 + }, + { + "category_id": 2, + "poly": [ + 316, + 2004, + 1398, + 2004, + 1398, + 2035, + 316, + 2035 + ], + "score": 0.619 + }, + { + "category_id": 3, + "poly": [ + 499, + 928, + 1192, + 928, + 1192, + 1421, + 499, + 1421 + ], + "score": 0.444 + }, + { + "category_id": 1, + "poly": [ + 316, + 2004, + 1398, + 2004, + 1398, + 2035, + 316, + 2035 + ], + "score": 0.283 + }, + { + "category_id": 13, + "poly": [ + 897, + 260, + 1062, + 260, + 1062, + 301, + 897, + 301 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { p _ { t } = \\sum _ { i = 1 } ^ { L } p _ { t } ^ { l } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 808, + 679, + 900, + 679, + 900, + 712, + 808, + 712 + ], + "score": 0.92, + "latex": "N _ { e p o c h s }" + }, + { + "category_id": 14, + "poly": [ + 657, + 419, + 1037, + 419, + 1037, + 476, + 657, + 476 + ], + "score": 0.91, + "latex": "\\operatorname* { l i m } _ { { \\bf v } _ { t } \\to \\infty } p _ { t } ^ { l } = 1 \\mathrm { ~ \\ a n d , ~ } \\operatorname* { l i m } _ { { \\bf v } _ { t } \\to 0 } p _ { t } ^ { l } = 0 ." + }, + { + "category_id": 13, + "poly": [ + 547, + 231, + 618, + 231, + 618, + 262, + 547, + 262 + ], + "score": 0.91, + "latex": "k \\geq 0" + }, + { + "category_id": 14, + "poly": [ + 884, + 420, + 1038, + 420, + 1038, + 476, + 884, + 476 + ], + "score": 0.89, + "latex": "\\operatorname* { l i m } _ { { \\bf v } _ { t } \\to 0 } p _ { t } ^ { l } = 0 ." + }, + { + "category_id": 13, + "poly": [ + 749, + 633, + 777, + 633, + 777, + 670, + 749, + 670 + ], + "score": 0.89, + "latex": "p _ { t } ^ { l }" + }, + { + "category_id": 13, + "poly": [ + 714, + 717, + 774, + 717, + 774, + 745, + 714, + 745 + ], + "score": 0.88, + "latex": "p _ { m i n }" + }, + { + "category_id": 13, + "poly": [ + 1348, + 710, + 1375, + 710, + 1375, + 746, + 1348, + 746 + ], + "score": 0.88, + "latex": "p _ { t } ^ { l }" + }, + { + "category_id": 13, + "poly": [ + 649, + 228, + 685, + 228, + 685, + 259, + 649, + 259 + ], + "score": 0.88, + "latex": "t ^ { t h }" + }, + { + "category_id": 13, + "poly": [ + 1066, + 776, + 1093, + 776, + 1093, + 812, + 1066, + 812 + ], + "score": 0.88, + "latex": "p _ { t } ^ { l }" + }, + { + "category_id": 13, + "poly": [ + 854, + 228, + 888, + 228, + 888, + 258, + 854, + 258 + ], + "score": 0.88, + "latex": "l ^ { t h }" + }, + { + "category_id": 13, + "poly": [ + 1063, + 628, + 1235, + 628, + 1235, + 684, + 1063, + 684 + ], + "score": 0.85, + "latex": "\\begin{array} { r } { 1 - \\sqrt { \\frac { t } { N _ { e p o c h s } } } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1085, + 1023, + 1152, + 1023, + 1152, + 1049, + 1085, + 1049 + ], + "score": 0.85, + "latex": "\\mathsf { k } = \\mathsf { 1 0 0 }" + }, + { + "category_id": 13, + "poly": [ + 849, + 362, + 876, + 362, + 876, + 389, + 849, + 389 + ], + "score": 0.85, + "latex": "v _ { t }" + }, + { + "category_id": 13, + "poly": [ + 556, + 305, + 583, + 305, + 583, + 331, + 556, + 331 + ], + "score": 0.85, + "latex": "v _ { t }" + }, + { + "category_id": 13, + "poly": [ + 1264, + 334, + 1291, + 334, + 1291, + 360, + 1264, + 360 + ], + "score": 0.84, + "latex": "v _ { t }" + }, + { + "category_id": 13, + "poly": [ + 1085, + 1055, + 1139, + 1055, + 1139, + 1081, + 1085, + 1081 + ], + "score": 0.84, + "latex": "\\mathtt { k } = 5 0" + }, + { + "category_id": 13, + "poly": [ + 1085, + 1087, + 1140, + 1087, + 1140, + 1113, + 1085, + 1113 + ], + "score": 0.8, + "latex": "\\mathtt { k } = 1 0" + }, + { + "category_id": 13, + "poly": [ + 1039, + 232, + 1061, + 232, + 1061, + 258, + 1039, + 258 + ], + "score": 0.79, + "latex": "L" + }, + { + "category_id": 13, + "poly": [ + 1318, + 639, + 1332, + 639, + 1332, + 664, + 1318, + 664 + ], + "score": 0.75, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 1135, + 775, + 1398, + 775, + 1398, + 821, + 1135, + 821 + ], + "score": 0.71, + "latex": "\\begin{array} { r } { \\operatorname* { m i n } ( p _ { m i n } , 1 - \\frac { t } { N _ { e p o c h s } } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1341, + 267, + 1357, + 267, + 1357, + 295, + 1341, + 295 + ], + "score": 0.47, + "latex": "\\delta" + }, + { + "category_id": 14, + "poly": [ + 658, + 420, + 813, + 420, + 813, + 475, + 658, + 475 + ], + "score": 0.37, + "latex": "\\operatorname* { l i m } _ { \\mathbf { v } _ { t } \\to \\infty } p _ { t } ^ { l } = 1" + }, + { + "category_id": 13, + "poly": [ + 933, + 301, + 992, + 301, + 992, + 330, + 933, + 330 + ], + "score": 0.34, + "latex": "\\mathrm { l o s s } ^ { 3 }" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1678.0, + 561.0, + 1678.0, + 561.0, + 1722.0, + 292.0, + 1722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1461.0, + 1390.0, + 1461.0, + 1390.0, + 1500.0, + 308.0, + 1500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1867.0, + 778.0, + 1867.0, + 778.0, + 1907.0, + 294.0, + 1907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 501.0, + 924.0, + 550.0, + 924.0, + 550.0, + 961.0, + 501.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 970.0, + 954.0, + 1131.0, + 954.0, + 1131.0, + 995.0, + 970.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 982.0, + 1149.0, + 982.0, + 1149.0, + 1027.0, + 971.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 1009.0, + 553.0, + 1009.0, + 553.0, + 1050.0, + 498.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 1017.0, + 1084.0, + 1017.0, + 1084.0, + 1056.0, + 971.0, + 1056.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1153.0, + 1017.0, + 1161.0, + 1017.0, + 1161.0, + 1056.0, + 1153.0, + 1056.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 1047.0, + 1084.0, + 1047.0, + 1084.0, + 1087.0, + 971.0, + 1087.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 1047.0, + 1150.0, + 1047.0, + 1150.0, + 1087.0, + 1140.0, + 1087.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 1082.0, + 1084.0, + 1082.0, + 1084.0, + 1119.0, + 971.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 1082.0, + 1147.0, + 1082.0, + 1147.0, + 1119.0, + 1141.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 1097.0, + 554.0, + 1097.0, + 554.0, + 1138.0, + 498.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 1184.0, + 557.0, + 1184.0, + 557.0, + 1227.0, + 497.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 1273.0, + 554.0, + 1273.0, + 554.0, + 1314.0, + 498.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1361.0, + 554.0, + 1361.0, + 554.0, + 1403.0, + 499.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1162.0, + 1376.0, + 1171.0, + 1376.0, + 1171.0, + 1384.0, + 1162.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 537.0, + 1385.0, + 563.0, + 1385.0, + 563.0, + 1417.0, + 537.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 1382.0, + 703.0, + 1382.0, + 703.0, + 1421.0, + 646.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 1382.0, + 827.0, + 1382.0, + 827.0, + 1421.0, + 769.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 1382.0, + 951.0, + 1382.0, + 951.0, + 1421.0, + 893.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 1382.0, + 1075.0, + 1382.0, + 1075.0, + 1421.0, + 1017.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1139.0, + 1380.0, + 1200.0, + 1380.0, + 1200.0, + 1423.0, + 1139.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 2085.0, + 859.0, + 2085.0, + 859.0, + 2116.0, + 836.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 2000.0, + 1404.0, + 2000.0, + 1404.0, + 2039.0, + 332.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.0, + 920.0, + 553.0, + 920.0, + 553.0, + 964.0, + 500.0, + 964.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 969.0, + 953.0, + 1133.0, + 953.0, + 1133.0, + 997.0, + 969.0, + 997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 980.0, + 1149.0, + 980.0, + 1149.0, + 1028.0, + 971.0, + 1028.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1010.0, + 553.0, + 1010.0, + 553.0, + 1050.0, + 499.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 1017.0, + 1084.0, + 1017.0, + 1084.0, + 1055.0, + 971.0, + 1055.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1153.0, + 1017.0, + 1160.0, + 1017.0, + 1160.0, + 1055.0, + 1153.0, + 1055.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 1050.0, + 1084.0, + 1050.0, + 1084.0, + 1087.0, + 971.0, + 1087.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 1050.0, + 1149.0, + 1050.0, + 1149.0, + 1087.0, + 1140.0, + 1087.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1097.0, + 553.0, + 1097.0, + 553.0, + 1138.0, + 499.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 1082.0, + 1084.0, + 1082.0, + 1084.0, + 1120.0, + 971.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 1082.0, + 1147.0, + 1082.0, + 1147.0, + 1120.0, + 1141.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 1186.0, + 556.0, + 1186.0, + 556.0, + 1226.0, + 498.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1274.0, + 553.0, + 1274.0, + 553.0, + 1314.0, + 499.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1362.0, + 554.0, + 1362.0, + 554.0, + 1402.0, + 499.0, + 1402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1160.0, + 1374.0, + 1174.0, + 1374.0, + 1174.0, + 1386.0, + 1160.0, + 1386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 1388.0, + 562.0, + 1388.0, + 562.0, + 1416.0, + 538.0, + 1416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 1381.0, + 703.0, + 1381.0, + 703.0, + 1421.0, + 646.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 1381.0, + 828.0, + 1381.0, + 828.0, + 1421.0, + 769.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 1381.0, + 952.0, + 1381.0, + 952.0, + 1421.0, + 893.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 1381.0, + 1075.0, + 1381.0, + 1075.0, + 1421.0, + 1017.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1139.0, + 1379.0, + 1201.0, + 1379.0, + 1201.0, + 1425.0, + 1139.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 282.0, + 226.0, + 546.0, + 226.0, + 546.0, + 320.0, + 282.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 619.0, + 226.0, + 648.0, + 226.0, + 648.0, + 320.0, + 619.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 226.0, + 853.0, + 226.0, + 853.0, + 320.0, + 686.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 889.0, + 226.0, + 896.0, + 226.0, + 896.0, + 320.0, + 889.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 226.0, + 1340.0, + 226.0, + 1340.0, + 320.0, + 1063.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1358.0, + 226.0, + 1418.0, + 226.0, + 1418.0, + 320.0, + 1358.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 300.0, + 555.0, + 300.0, + 555.0, + 334.0, + 293.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 584.0, + 300.0, + 932.0, + 300.0, + 932.0, + 334.0, + 584.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 993.0, + 300.0, + 1406.0, + 300.0, + 1406.0, + 334.0, + 993.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 329.0, + 1263.0, + 329.0, + 1263.0, + 363.0, + 293.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1292.0, + 329.0, + 1405.0, + 329.0, + 1405.0, + 363.0, + 1292.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 358.0, + 848.0, + 358.0, + 848.0, + 393.0, + 294.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 358.0, + 1406.0, + 358.0, + 1406.0, + 393.0, + 877.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 388.0, + 1231.0, + 388.0, + 1231.0, + 421.0, + 295.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1519.0, + 1407.0, + 1519.0, + 1407.0, + 1566.0, + 291.0, + 1566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1549.0, + 1405.0, + 1549.0, + 1405.0, + 1589.0, + 292.0, + 1589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1579.0, + 1406.0, + 1579.0, + 1406.0, + 1616.0, + 295.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1607.0, + 1289.0, + 1607.0, + 1289.0, + 1646.0, + 291.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 595.0, + 1406.0, + 595.0, + 1406.0, + 632.0, + 296.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1236.0, + 636.0, + 1317.0, + 636.0, + 1317.0, + 668.0, + 1236.0, + 668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 636.0, + 1404.0, + 636.0, + 1404.0, + 668.0, + 1333.0, + 668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 675.0, + 807.0, + 675.0, + 807.0, + 714.0, + 294.0, + 714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 675.0, + 1404.0, + 675.0, + 1404.0, + 714.0, + 901.0, + 714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 711.0, + 713.0, + 711.0, + 713.0, + 748.0, + 295.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 775.0, + 711.0, + 1347.0, + 711.0, + 1347.0, + 748.0, + 775.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1376.0, + 711.0, + 1386.0, + 711.0, + 1386.0, + 748.0, + 1376.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 629.5, + 1147.0, + 629.5, + 1147.0, + 678.5, + 290.0, + 678.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.25, + 649.0, + 1225.25, + 649.0, + 1225.25, + 684.0, + 1133.25, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1747.0, + 1404.0, + 1747.0, + 1404.0, + 1780.0, + 294.0, + 1780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1777.0, + 1404.0, + 1777.0, + 1404.0, + 1810.0, + 295.0, + 1810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1804.0, + 476.0, + 1804.0, + 476.0, + 1842.0, + 293.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 474.0, + 1404.0, + 474.0, + 1404.0, + 512.0, + 292.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 506.0, + 1406.0, + 506.0, + 1406.0, + 540.0, + 294.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 536.0, + 1275.0, + 536.0, + 1275.0, + 570.0, + 294.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1924.0, + 1406.0, + 1924.0, + 1406.0, + 1961.0, + 297.0, + 1961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1953.0, + 1405.0, + 1953.0, + 1405.0, + 1990.0, + 297.0, + 1990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 286.0, + 765.0, + 1065.0, + 765.0, + 1065.0, + 834.0, + 286.0, + 834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 765.0, + 1134.0, + 765.0, + 1134.0, + 834.0, + 1094.0, + 834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 765.0, + 1415.0, + 765.0, + 1415.0, + 834.0, + 1399.0, + 834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 828.0, + 1374.0, + 828.0, + 1374.0, + 869.0, + 294.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 2000.0, + 1404.0, + 2000.0, + 1404.0, + 2039.0, + 332.0, + 2039.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1782, + 1403, + 1782, + 1403, + 1901, + 298, + 1901 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1916, + 1404, + 1916, + 1404, + 2035, + 298, + 2035 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 298, + 305, + 1405, + 305, + 1405, + 422, + 298, + 422 + ], + "score": 0.972 + }, + { + "category_id": 3, + "poly": [ + 545, + 504, + 1113, + 504, + 1113, + 886, + 545, + 886 + ], + "score": 0.967 + }, + { + "category_id": 3, + "poly": [ + 545, + 1229, + 1112, + 1229, + 1112, + 1612, + 545, + 1612 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 296, + 1057, + 1406, + 1057, + 1406, + 1149, + 296, + 1149 + ], + "score": 0.961 + }, + { + "category_id": 4, + "poly": [ + 295, + 907, + 1404, + 907, + 1404, + 998, + 295, + 998 + ], + "score": 0.955 + }, + { + "category_id": 4, + "poly": [ + 296, + 1631, + 1402, + 1631, + 1402, + 1724, + 296, + 1724 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 294, + 229, + 1404, + 229, + 1404, + 291, + 294, + 291 + ], + "score": 0.946 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 815, + 75, + 815, + 105, + 299, + 105 + ], + "score": 0.904 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.804 + }, + { + "category_id": 13, + "poly": [ + 1137, + 339, + 1154, + 339, + 1154, + 365, + 1137, + 365 + ], + "score": 0.75, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 1227, + 942, + 1246, + 942, + 1246, + 969, + 1227, + 969 + ], + "score": 0.75, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 1045, + 942, + 1063, + 942, + 1063, + 968, + 1045, + 968 + ], + "score": 0.74, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 1202, + 369, + 1218, + 369, + 1218, + 390, + 1202, + 390 + ], + "score": 0.64, + "latex": "c" + }, + { + "category_id": 13, + "poly": [ + 512, + 398, + 528, + 398, + 528, + 419, + 512, + 419 + ], + "score": 0.64, + "latex": "c" + }, + { + "category_id": 13, + "poly": [ + 647, + 231, + 715, + 231, + 715, + 260, + 647, + 260 + ], + "score": 0.46, + "latex": "3 e { - 4 }" + }, + { + "category_id": 15, + "poly": [ + 572.0, + 503.0, + 622.0, + 503.0, + 622.0, + 540.0, + 572.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 895.0, + 529.0, + 1081.0, + 529.0, + 1081.0, + 571.0, + 895.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 564.0, + 623.0, + 564.0, + 623.0, + 601.0, + 568.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 898.0, + 559.0, + 1025.0, + 559.0, + 1025.0, + 600.0, + 898.0, + 600.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 896.0, + 589.0, + 1009.0, + 589.0, + 1009.0, + 632.0, + 896.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 625.0, + 624.0, + 625.0, + 624.0, + 665.0, + 566.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 546.0, + 659.0, + 575.0, + 659.0, + 575.0, + 699.0, + 546.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 689.0, + 623.0, + 689.0, + 623.0, + 725.0, + 565.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 564.0, + 751.0, + 623.0, + 751.0, + 623.0, + 786.0, + 564.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 811.0, + 624.0, + 811.0, + 624.0, + 849.0, + 568.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 613.0, + 839.0, + 636.0, + 839.0, + 636.0, + 866.0, + 613.0, + 866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.0, + 833.0, + 745.0, + 833.0, + 745.0, + 870.0, + 691.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 783.0, + 832.0, + 838.0, + 832.0, + 838.0, + 869.0, + 783.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 833.0, + 931.0, + 833.0, + 931.0, + 870.0, + 877.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 969.0, + 833.0, + 1025.0, + 833.0, + 1025.0, + 870.0, + 969.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 833.0, + 1117.0, + 833.0, + 1117.0, + 870.0, + 1063.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 859.0, + 898.0, + 859.0, + 898.0, + 892.0, + 818.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.75, + 685.0, + 698.75, + 685.0, + 698.75, + 692.5, + 691.75, + 692.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 704.0, + 701.5, + 758.0, + 701.5, + 758.0, + 721.5, + 704.0, + 721.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 572.0, + 1228.0, + 622.0, + 1228.0, + 622.0, + 1266.0, + 572.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 816.0, + 1259.0, + 1080.0, + 1259.0, + 1080.0, + 1292.0, + 816.0, + 1292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 571.0, + 1290.0, + 623.0, + 1290.0, + 623.0, + 1327.0, + 571.0, + 1327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 813.0, + 1288.0, + 1078.0, + 1288.0, + 1078.0, + 1322.0, + 813.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 1351.0, + 622.0, + 1351.0, + 622.0, + 1386.0, + 566.0, + 1386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 546.0, + 1384.0, + 574.0, + 1384.0, + 574.0, + 1425.0, + 546.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 567.0, + 1411.0, + 624.0, + 1411.0, + 624.0, + 1452.0, + 567.0, + 1452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 567.0, + 1475.0, + 624.0, + 1475.0, + 624.0, + 1512.0, + 567.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 1536.0, + 625.0, + 1536.0, + 625.0, + 1572.0, + 565.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 1564.0, + 635.0, + 1564.0, + 635.0, + 1590.0, + 615.0, + 1590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.0, + 1557.0, + 745.0, + 1557.0, + 745.0, + 1595.0, + 691.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 1557.0, + 838.0, + 1557.0, + 838.0, + 1594.0, + 784.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 1557.0, + 932.0, + 1557.0, + 932.0, + 1595.0, + 876.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 969.0, + 1557.0, + 1024.0, + 1557.0, + 1024.0, + 1595.0, + 969.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 1557.0, + 1117.0, + 1557.0, + 1117.0, + 1595.0, + 1063.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 1584.0, + 897.0, + 1584.0, + 897.0, + 1618.0, + 818.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 1379.5, + 716.0, + 1379.5, + 716.0, + 1409.5, + 634.0, + 1409.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 906.0, + 1404.0, + 906.0, + 1404.0, + 943.0, + 294.0, + 943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 935.0, + 1044.0, + 935.0, + 1044.0, + 972.0, + 294.0, + 972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 935.0, + 1226.0, + 935.0, + 1226.0, + 972.0, + 1064.0, + 972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 935.0, + 1402.0, + 935.0, + 1402.0, + 972.0, + 1247.0, + 972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 964.0, + 935.0, + 964.0, + 935.0, + 1000.0, + 295.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1629.0, + 1406.0, + 1629.0, + 1406.0, + 1668.0, + 293.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1659.0, + 1407.0, + 1659.0, + 1407.0, + 1698.0, + 293.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1691.0, + 1029.0, + 1691.0, + 1029.0, + 1725.0, + 294.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2087.0, + 860.0, + 2087.0, + 860.0, + 2117.0, + 839.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1780.0, + 1407.0, + 1780.0, + 1407.0, + 1820.0, + 294.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1809.0, + 1405.0, + 1809.0, + 1405.0, + 1850.0, + 293.0, + 1850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1841.0, + 1404.0, + 1841.0, + 1404.0, + 1876.0, + 296.0, + 1876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1869.0, + 1034.0, + 1869.0, + 1034.0, + 1906.0, + 293.0, + 1906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1915.0, + 1406.0, + 1915.0, + 1406.0, + 1954.0, + 294.0, + 1954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1945.0, + 1408.0, + 1945.0, + 1408.0, + 1980.0, + 296.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1971.0, + 1406.0, + 1971.0, + 1406.0, + 2010.0, + 294.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2000.0, + 1404.0, + 2000.0, + 1404.0, + 2040.0, + 293.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 304.0, + 1405.0, + 304.0, + 1405.0, + 342.0, + 295.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 332.0, + 1136.0, + 332.0, + 1136.0, + 370.0, + 295.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 332.0, + 1405.0, + 332.0, + 1405.0, + 370.0, + 1155.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 361.0, + 1201.0, + 361.0, + 1201.0, + 395.0, + 296.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1219.0, + 361.0, + 1403.0, + 361.0, + 1403.0, + 395.0, + 1219.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 388.0, + 511.0, + 388.0, + 511.0, + 429.0, + 292.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 388.0, + 1410.0, + 388.0, + 1410.0, + 429.0, + 529.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1055.0, + 1408.0, + 1055.0, + 1408.0, + 1093.0, + 291.0, + 1093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1086.0, + 1407.0, + 1086.0, + 1407.0, + 1122.0, + 293.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1116.0, + 1295.0, + 1116.0, + 1295.0, + 1150.0, + 294.0, + 1150.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 231.0, + 646.0, + 231.0, + 646.0, + 263.0, + 297.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 231.0, + 1402.0, + 231.0, + 1402.0, + 263.0, + 716.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 257.0, + 1409.0, + 257.0, + 1409.0, + 297.0, + 293.0, + 297.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1828, + 1403, + 1828, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1394, + 1404, + 1394, + 1404, + 1569, + 298, + 1569 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1603, + 1405, + 1603, + 1405, + 1779, + 298, + 1779 + ], + "score": 0.977 + }, + { + "category_id": 3, + "poly": [ + 416, + 840, + 827, + 840, + 827, + 1140, + 416, + 1140 + ], + "score": 0.967 + }, + { + "category_id": 3, + "poly": [ + 546, + 247, + 1112, + 247, + 1112, + 630, + 546, + 630 + ], + "score": 0.966 + }, + { + "category_id": 5, + "poly": [ + 930, + 994, + 1332, + 994, + 1332, + 1147, + 930, + 1147 + ], + "score": 0.963, + "html": "
Test Accuracy
Stochastic Depth93.25
Mollified Convnet92.45
ResNet91.78
" + }, + { + "category_id": 4, + "poly": [ + 356, + 1167, + 898, + 1167, + 898, + 1255, + 356, + 1255 + ], + "score": 0.961 + }, + { + "category_id": 4, + "poly": [ + 295, + 650, + 1406, + 650, + 1406, + 769, + 295, + 769 + ], + "score": 0.947 + }, + { + "category_id": 0, + "poly": [ + 299, + 1331, + 677, + 1331, + 677, + 1361, + 299, + 1361 + ], + "score": 0.911 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 814, + 76, + 814, + 104, + 299, + 104 + ], + "score": 0.893 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2112, + 836, + 2112 + ], + "score": 0.85 + }, + { + "category_id": 6, + "poly": [ + 925, + 1168, + 1341, + 1168, + 1341, + 1227, + 925, + 1227 + ], + "score": 0.767 + }, + { + "category_id": 13, + "poly": [ + 943, + 1661, + 1034, + 1661, + 1034, + 1691, + 943, + 1691 + ], + "score": 0.89, + "latex": "6 8 . 1 5 \\%" + }, + { + "category_id": 13, + "poly": [ + 975, + 1719, + 1065, + 1719, + 1065, + 1749, + 975, + 1749 + ], + "score": 0.88, + "latex": "7 5 . 1 5 \\%" + }, + { + "category_id": 13, + "poly": [ + 379, + 1719, + 456, + 1719, + 456, + 1749, + 379, + 1749 + ], + "score": 0.87, + "latex": "6 9 . 5 \\%" + }, + { + "category_id": 13, + "poly": [ + 466, + 1749, + 513, + 1749, + 513, + 1778, + 466, + 1778 + ], + "score": 0.84, + "latex": "8 0 k" + }, + { + "category_id": 15, + "poly": [ + 434.0, + 844.0, + 451.0, + 844.0, + 451.0, + 857.0, + 434.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 852.0, + 720.0, + 852.0, + 720.0, + 869.0, + 600.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 865.0, + 816.0, + 865.0, + 816.0, + 882.0, + 600.0, + 882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 876.0, + 698.0, + 876.0, + 698.0, + 893.0, + 600.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 888.0, + 450.0, + 888.0, + 450.0, + 899.0, + 435.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 434.0, + 901.0, + 714.0, + 901.0, + 714.0, + 960.0, + 434.0, + 960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 418.0, + 957.0, + 435.0, + 957.0, + 435.0, + 1004.0, + 418.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.0, + 972.0, + 451.0, + 972.0, + 451.0, + 988.0, + 431.0, + 988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.0, + 1016.0, + 450.0, + 1016.0, + 450.0, + 1032.0, + 431.0, + 1032.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 432.0, + 1061.0, + 449.0, + 1061.0, + 449.0, + 1073.0, + 432.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.0, + 1102.0, + 452.0, + 1102.0, + 452.0, + 1118.0, + 431.0, + 1118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1115.0, + 456.0, + 1115.0, + 456.0, + 1125.0, + 448.0, + 1125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 484.0, + 1112.0, + 501.0, + 1112.0, + 501.0, + 1128.0, + 484.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 524.0, + 1112.0, + 545.0, + 1112.0, + 545.0, + 1128.0, + 524.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 1112.0, + 585.0, + 1112.0, + 585.0, + 1128.0, + 565.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 1112.0, + 625.0, + 1112.0, + 625.0, + 1128.0, + 605.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 644.0, + 1112.0, + 666.0, + 1112.0, + 666.0, + 1128.0, + 644.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 1112.0, + 707.0, + 1112.0, + 707.0, + 1128.0, + 685.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 725.0, + 1112.0, + 748.0, + 1112.0, + 748.0, + 1128.0, + 725.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 766.0, + 1112.0, + 788.0, + 1112.0, + 788.0, + 1128.0, + 766.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 807.0, + 1112.0, + 829.0, + 1112.0, + 829.0, + 1128.0, + 807.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 1123.0, + 666.0, + 1123.0, + 666.0, + 1140.0, + 605.0, + 1140.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 495.0, + 1031.0, + 545.0, + 1031.0, + 545.0, + 1063.0, + 495.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 672.0, + 1094.0, + 715.0, + 1094.0, + 715.0, + 1112.0, + 672.0, + 1112.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 248.0, + 620.0, + 248.0, + 620.0, + 282.0, + 570.0, + 282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 278.0, + 1040.0, + 278.0, + 1040.0, + 307.0, + 770.0, + 307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 290.0, + 624.0, + 290.0, + 624.0, + 330.0, + 566.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 307.0, + 1078.0, + 307.0, + 1078.0, + 339.0, + 771.0, + 339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 332.0, + 624.0, + 332.0, + 624.0, + 373.0, + 566.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 337.0, + 906.0, + 337.0, + 906.0, + 368.0, + 769.0, + 368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 564.0, + 374.0, + 626.0, + 374.0, + 626.0, + 423.0, + 564.0, + 423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 548.0, + 403.0, + 572.0, + 403.0, + 572.0, + 442.0, + 548.0, + 442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 421.0, + 625.0, + 421.0, + 625.0, + 463.0, + 566.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 467.0, + 623.0, + 467.0, + 623.0, + 505.0, + 565.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 562.0, + 511.0, + 624.0, + 511.0, + 624.0, + 549.0, + 562.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 562.0, + 555.0, + 623.0, + 555.0, + 623.0, + 589.0, + 562.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 581.0, + 637.0, + 581.0, + 637.0, + 610.0, + 614.0, + 610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.0, + 575.0, + 745.0, + 575.0, + 745.0, + 613.0, + 691.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 783.0, + 575.0, + 838.0, + 575.0, + 838.0, + 613.0, + 783.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 575.0, + 931.0, + 575.0, + 931.0, + 613.0, + 877.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 970.0, + 575.0, + 1024.0, + 575.0, + 1024.0, + 613.0, + 970.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 576.0, + 1116.0, + 576.0, + 1116.0, + 614.0, + 1063.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 605.0, + 897.0, + 605.0, + 897.0, + 635.0, + 818.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1166.0, + 901.0, + 1166.0, + 901.0, + 1199.0, + 355.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1193.0, + 902.0, + 1193.0, + 902.0, + 1233.0, + 354.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1225.0, + 417.0, + 1225.0, + 417.0, + 1258.0, + 354.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 651.0, + 1404.0, + 651.0, + 1404.0, + 685.0, + 295.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 678.0, + 1404.0, + 678.0, + 1404.0, + 716.0, + 294.0, + 716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 707.0, + 1403.0, + 707.0, + 1403.0, + 744.0, + 294.0, + 744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 738.0, + 785.0, + 738.0, + 785.0, + 772.0, + 295.0, + 772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1330.0, + 681.0, + 1330.0, + 681.0, + 1365.0, + 295.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2084.0, + 868.0, + 2084.0, + 868.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 1166.0, + 1343.0, + 1166.0, + 1343.0, + 1200.0, + 919.0, + 1200.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.0, + 1197.0, + 1101.0, + 1197.0, + 1101.0, + 1226.0, + 918.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1826.0, + 1407.0, + 1826.0, + 1407.0, + 1864.0, + 293.0, + 1864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1856.0, + 1405.0, + 1856.0, + 1405.0, + 1893.0, + 293.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1888.0, + 1405.0, + 1888.0, + 1405.0, + 1921.0, + 294.0, + 1921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1917.0, + 1405.0, + 1917.0, + 1405.0, + 1950.0, + 294.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1982.0, + 293.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1974.0, + 1405.0, + 1974.0, + 1405.0, + 2007.0, + 294.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2003.0, + 1370.0, + 2003.0, + 1370.0, + 2035.0, + 293.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1394.0, + 1405.0, + 1394.0, + 1405.0, + 1429.0, + 294.0, + 1429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1423.0, + 1406.0, + 1423.0, + 1406.0, + 1457.0, + 294.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1451.0, + 1407.0, + 1451.0, + 1407.0, + 1485.0, + 292.0, + 1485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1480.0, + 1404.0, + 1480.0, + 1404.0, + 1513.0, + 295.0, + 1513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1510.0, + 1405.0, + 1510.0, + 1405.0, + 1544.0, + 294.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1539.0, + 1263.0, + 1539.0, + 1263.0, + 1574.0, + 294.0, + 1574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1602.0, + 1407.0, + 1602.0, + 1407.0, + 1637.0, + 295.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1631.0, + 1409.0, + 1631.0, + 1409.0, + 1668.0, + 293.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1659.0, + 942.0, + 1659.0, + 942.0, + 1696.0, + 293.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1035.0, + 1659.0, + 1409.0, + 1659.0, + 1409.0, + 1696.0, + 1035.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1690.0, + 1405.0, + 1690.0, + 1405.0, + 1724.0, + 295.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1719.0, + 378.0, + 1719.0, + 378.0, + 1754.0, + 295.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 457.0, + 1719.0, + 974.0, + 1719.0, + 974.0, + 1754.0, + 457.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1066.0, + 1719.0, + 1406.0, + 1719.0, + 1406.0, + 1754.0, + 1066.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1750.0, + 465.0, + 1750.0, + 465.0, + 1781.0, + 296.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 514.0, + 1750.0, + 605.0, + 1750.0, + 605.0, + 1781.0, + 514.0, + 1781.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1119, + 1404, + 1119, + 1404, + 1324, + 298, + 1324 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1338, + 1404, + 1338, + 1404, + 1485, + 299, + 1485 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 1597, + 1405, + 1597, + 1405, + 1743, + 299, + 1743 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 767, + 1404, + 767, + 1404, + 885, + 298, + 885 + ], + "score": 0.97 + }, + { + "category_id": 3, + "poly": [ + 460, + 249, + 853, + 249, + 853, + 525, + 460, + 525 + ], + "score": 0.962 + }, + { + "category_id": 5, + "poly": [ + 964, + 409, + 1291, + 409, + 1291, + 532, + 964, + 532 + ], + "score": 0.96, + "html": "
Test PPL
LSTM119.4
Mollified LSTM115.7
" + }, + { + "category_id": 4, + "poly": [ + 388, + 553, + 931, + 553, + 931, + 643, + 388, + 643 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 298, + 918, + 1401, + 918, + 1401, + 1007, + 298, + 1007 + ], + "score": 0.952 + }, + { + "category_id": 2, + "poly": [ + 331, + 2006, + 943, + 2006, + 943, + 2034, + 331, + 2034 + ], + "score": 0.912 + }, + { + "category_id": 0, + "poly": [ + 303, + 1051, + 562, + 1051, + 562, + 1086, + 303, + 1086 + ], + "score": 0.893 + }, + { + "category_id": 0, + "poly": [ + 299, + 699, + 661, + 699, + 661, + 734, + 299, + 734 + ], + "score": 0.89 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 814, + 76, + 814, + 104, + 299, + 104 + ], + "score": 0.884 + }, + { + "category_id": 1, + "poly": [ + 304, + 1919, + 1398, + 1919, + 1398, + 1981, + 304, + 1981 + ], + "score": 0.883 + }, + { + "category_id": 0, + "poly": [ + 302, + 1532, + 625, + 1532, + 625, + 1564, + 302, + 1564 + ], + "score": 0.875 + }, + { + "category_id": 1, + "poly": [ + 300, + 1839, + 1402, + 1839, + 1402, + 1900, + 300, + 1900 + ], + "score": 0.871 + }, + { + "category_id": 0, + "poly": [ + 299, + 1790, + 488, + 1790, + 488, + 1822, + 299, + 1822 + ], + "score": 0.851 + }, + { + "category_id": 2, + "poly": [ + 835, + 2089, + 861, + 2089, + 861, + 2113, + 835, + 2113 + ], + "score": 0.843 + }, + { + "category_id": 6, + "poly": [ + 951, + 553, + 1314, + 553, + 1314, + 643, + 951, + 643 + ], + "score": 0.748 + }, + { + "category_id": 4, + "poly": [ + 951, + 553, + 1314, + 553, + 1314, + 643, + 951, + 643 + ], + "score": 0.128 + }, + { + "category_id": 15, + "poly": [ + 472.0, + 249.0, + 496.0, + 249.0, + 496.0, + 264.0, + 472.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 751.0, + 258.0, + 837.0, + 258.0, + 837.0, + 275.0, + 751.0, + 275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 269.0, + 814.0, + 269.0, + 814.0, + 286.0, + 754.0, + 286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 471.0, + 276.0, + 496.0, + 276.0, + 496.0, + 294.0, + 471.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 470.0, + 305.0, + 498.0, + 305.0, + 498.0, + 322.0, + 470.0, + 322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 470.0, + 334.0, + 498.0, + 334.0, + 498.0, + 352.0, + 470.0, + 352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 361.0, + 500.0, + 361.0, + 500.0, + 393.0, + 451.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 471.0, + 392.0, + 497.0, + 392.0, + 497.0, + 410.0, + 471.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 422.0, + 497.0, + 422.0, + 497.0, + 437.0, + 472.0, + 437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 471.0, + 450.0, + 498.0, + 450.0, + 498.0, + 467.0, + 471.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 470.0, + 478.0, + 498.0, + 478.0, + 498.0, + 496.0, + 470.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 489.0, + 502.0, + 502.0, + 502.0, + 502.0, + 513.0, + 489.0, + 513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 524.0, + 499.0, + 555.0, + 499.0, + 555.0, + 515.0, + 524.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 564.0, + 499.0, + 597.0, + 499.0, + 597.0, + 515.0, + 564.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 499.0, + 640.0, + 499.0, + 640.0, + 515.0, + 607.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 649.0, + 499.0, + 682.0, + 499.0, + 682.0, + 515.0, + 649.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 499.0, + 725.0, + 499.0, + 725.0, + 515.0, + 692.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 499.0, + 768.0, + 499.0, + 768.0, + 515.0, + 736.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 777.0, + 499.0, + 811.0, + 499.0, + 811.0, + 515.0, + 777.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 822.0, + 501.0, + 851.0, + 501.0, + 851.0, + 514.0, + 822.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 507.0, + 692.0, + 507.0, + 692.0, + 529.0, + 640.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 503.25, + 356.5, + 633.25, + 356.5, + 633.25, + 388.5, + 503.25, + 388.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 387.0, + 552.0, + 935.0, + 552.0, + 935.0, + 586.0, + 387.0, + 586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 386.0, + 577.0, + 934.0, + 577.0, + 934.0, + 621.0, + 386.0, + 621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 612.0, + 702.0, + 612.0, + 702.0, + 644.0, + 385.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 2001.0, + 944.0, + 2001.0, + 944.0, + 2037.0, + 332.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1045.0, + 568.0, + 1045.0, + 568.0, + 1095.0, + 294.0, + 1095.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 697.0, + 665.0, + 697.0, + 665.0, + 740.0, + 291.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1527.0, + 630.0, + 1527.0, + 630.0, + 1572.0, + 298.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1790.0, + 490.0, + 1790.0, + 490.0, + 1826.0, + 296.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 867.0, + 2085.0, + 867.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 949.0, + 550.0, + 1316.0, + 550.0, + 1316.0, + 587.0, + 949.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 948.0, + 577.0, + 1314.0, + 577.0, + 1314.0, + 620.0, + 948.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 949.0, + 612.0, + 1170.0, + 612.0, + 1170.0, + 643.0, + 949.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 949.0, + 550.0, + 1316.0, + 550.0, + 1316.0, + 587.0, + 949.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 948.0, + 577.0, + 1314.0, + 577.0, + 1314.0, + 620.0, + 948.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 949.0, + 612.0, + 1170.0, + 612.0, + 1170.0, + 643.0, + 949.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1120.0, + 1405.0, + 1120.0, + 1405.0, + 1154.0, + 296.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1150.0, + 1405.0, + 1150.0, + 1405.0, + 1181.0, + 293.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1177.0, + 1405.0, + 1177.0, + 1405.0, + 1211.0, + 293.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1207.0, + 1407.0, + 1207.0, + 1407.0, + 1242.0, + 292.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1236.0, + 1405.0, + 1236.0, + 1405.0, + 1269.0, + 294.0, + 1269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1264.0, + 1404.0, + 1264.0, + 1404.0, + 1299.0, + 292.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1294.0, + 743.0, + 1294.0, + 743.0, + 1326.0, + 293.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1333.0, + 1406.0, + 1333.0, + 1406.0, + 1377.0, + 293.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1366.0, + 1406.0, + 1366.0, + 1406.0, + 1402.0, + 294.0, + 1402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1393.0, + 1405.0, + 1393.0, + 1405.0, + 1432.0, + 294.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1423.0, + 1404.0, + 1423.0, + 1404.0, + 1462.0, + 293.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1451.0, + 1409.0, + 1451.0, + 1409.0, + 1493.0, + 293.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1597.0, + 1402.0, + 1597.0, + 1402.0, + 1629.0, + 297.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1625.0, + 1403.0, + 1625.0, + 1403.0, + 1661.0, + 294.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1649.0, + 1407.0, + 1649.0, + 1407.0, + 1697.0, + 291.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1680.0, + 1411.0, + 1680.0, + 1411.0, + 1725.0, + 292.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1712.0, + 960.0, + 1712.0, + 960.0, + 1747.0, + 294.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 765.0, + 1405.0, + 765.0, + 1405.0, + 806.0, + 292.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 795.0, + 1404.0, + 795.0, + 1404.0, + 829.0, + 296.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 822.0, + 1408.0, + 822.0, + 1408.0, + 861.0, + 293.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 855.0, + 749.0, + 855.0, + 749.0, + 889.0, + 296.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 916.0, + 1405.0, + 916.0, + 1405.0, + 953.0, + 293.0, + 953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 947.0, + 1405.0, + 947.0, + 1405.0, + 980.0, + 293.0, + 980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 975.0, + 1407.0, + 975.0, + 1407.0, + 1012.0, + 294.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 1920.0, + 1402.0, + 1920.0, + 1402.0, + 1955.0, + 299.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1950.0, + 1107.0, + 1950.0, + 1107.0, + 1983.0, + 321.0, + 1983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1832.0, + 1409.0, + 1832.0, + 1409.0, + 1878.0, + 290.0, + 1878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1866.0, + 394.0, + 1866.0, + 394.0, + 1901.0, + 319.0, + 1901.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.873 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 864, + 2088, + 864, + 2113, + 835, + 2113 + ], + "score": 0.819 + }, + { + "category_id": 1, + "poly": [ + 296, + 1115, + 1402, + 1115, + 1402, + 1178, + 296, + 1178 + ], + "score": 0.631 + }, + { + "category_id": 1, + "poly": [ + 297, + 1303, + 1402, + 1303, + 1402, + 1367, + 297, + 1367 + ], + "score": 0.626 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1403, + 229, + 1403, + 320, + 299, + 320 + ], + "score": 0.618 + }, + { + "category_id": 1, + "poly": [ + 297, + 1464, + 1401, + 1464, + 1401, + 1527, + 297, + 1527 + ], + "score": 0.603 + }, + { + "category_id": 1, + "poly": [ + 297, + 955, + 1401, + 955, + 1401, + 1019, + 297, + 1019 + ], + "score": 0.603 + }, + { + "category_id": 1, + "poly": [ + 296, + 1035, + 1404, + 1035, + 1404, + 1098, + 296, + 1098 + ], + "score": 0.602 + }, + { + "category_id": 1, + "poly": [ + 299, + 875, + 1401, + 875, + 1401, + 938, + 299, + 938 + ], + "score": 0.591 + }, + { + "category_id": 1, + "poly": [ + 296, + 1384, + 1401, + 1384, + 1401, + 1447, + 296, + 1447 + ], + "score": 0.589 + }, + { + "category_id": 1, + "poly": [ + 301, + 1544, + 1403, + 1544, + 1403, + 1636, + 301, + 1636 + ], + "score": 0.584 + }, + { + "category_id": 1, + "poly": [ + 298, + 1733, + 1403, + 1733, + 1403, + 1795, + 298, + 1795 + ], + "score": 0.583 + }, + { + "category_id": 1, + "poly": [ + 298, + 1654, + 1402, + 1654, + 1402, + 1715, + 298, + 1715 + ], + "score": 0.581 + }, + { + "category_id": 1, + "poly": [ + 297, + 794, + 1402, + 794, + 1402, + 858, + 297, + 858 + ], + "score": 0.564 + }, + { + "category_id": 1, + "poly": [ + 295, + 1813, + 1372, + 1813, + 1372, + 1847, + 295, + 1847 + ], + "score": 0.563 + }, + { + "category_id": 1, + "poly": [ + 299, + 1195, + 1403, + 1195, + 1403, + 1287, + 299, + 1287 + ], + "score": 0.557 + }, + { + "category_id": 1, + "poly": [ + 300, + 687, + 1402, + 687, + 1402, + 777, + 300, + 777 + ], + "score": 0.538 + }, + { + "category_id": 1, + "poly": [ + 297, + 337, + 1404, + 337, + 1404, + 401, + 297, + 401 + ], + "score": 0.506 + }, + { + "category_id": 1, + "poly": [ + 297, + 1864, + 1396, + 1864, + 1396, + 1927, + 297, + 1927 + ], + "score": 0.501 + }, + { + "category_id": 1, + "poly": [ + 299, + 498, + 1401, + 498, + 1401, + 590, + 299, + 590 + ], + "score": 0.497 + }, + { + "category_id": 1, + "poly": [ + 296, + 606, + 1402, + 606, + 1402, + 669, + 296, + 669 + ], + "score": 0.497 + }, + { + "category_id": 1, + "poly": [ + 296, + 418, + 1402, + 418, + 1402, + 481, + 296, + 481 + ], + "score": 0.488 + }, + { + "category_id": 1, + "poly": [ + 299, + 1946, + 1406, + 1946, + 1406, + 2034, + 299, + 2034 + ], + "score": 0.434 + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1116.0, + 1406.0, + 1116.0, + 1406.0, + 1152.0, + 298.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1147.0, + 918.0, + 1147.0, + 918.0, + 1178.0, + 321.0, + 1178.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1300.0, + 1408.0, + 1300.0, + 1408.0, + 1341.0, + 292.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1330.0, + 399.0, + 1330.0, + 399.0, + 1368.0, + 319.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 227.0, + 1405.0, + 227.0, + 1405.0, + 267.0, + 293.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 259.0, + 1408.0, + 259.0, + 1408.0, + 296.0, + 322.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 288.0, + 576.0, + 288.0, + 576.0, + 321.0, + 319.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1459.0, + 1406.0, + 1459.0, + 1406.0, + 1506.0, + 292.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1494.0, + 919.0, + 1494.0, + 919.0, + 1527.0, + 322.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 955.0, + 1405.0, + 955.0, + 1405.0, + 991.0, + 296.0, + 991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 984.0, + 804.0, + 984.0, + 804.0, + 1019.0, + 321.0, + 1019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1031.0, + 1406.0, + 1031.0, + 1406.0, + 1073.0, + 294.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1063.0, + 612.0, + 1063.0, + 612.0, + 1097.0, + 320.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 875.0, + 1405.0, + 875.0, + 1405.0, + 910.0, + 295.0, + 910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 904.0, + 660.0, + 904.0, + 660.0, + 940.0, + 320.0, + 940.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1384.0, + 1403.0, + 1384.0, + 1403.0, + 1419.0, + 295.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1414.0, + 1032.0, + 1414.0, + 1032.0, + 1447.0, + 321.0, + 1447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1546.0, + 1403.0, + 1546.0, + 1403.0, + 1579.0, + 297.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1576.0, + 1405.0, + 1576.0, + 1405.0, + 1609.0, + 324.0, + 1609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1603.0, + 1333.0, + 1603.0, + 1333.0, + 1638.0, + 320.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1730.0, + 1407.0, + 1730.0, + 1407.0, + 1770.0, + 292.0, + 1770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1757.0, + 408.0, + 1757.0, + 408.0, + 1799.0, + 319.0, + 1799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1649.0, + 1408.0, + 1649.0, + 1408.0, + 1690.0, + 293.0, + 1690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1681.0, + 505.0, + 1681.0, + 505.0, + 1718.0, + 319.0, + 1718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 794.0, + 1407.0, + 794.0, + 1407.0, + 830.0, + 295.0, + 830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 819.0, + 397.0, + 819.0, + 397.0, + 861.0, + 318.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1810.0, + 1374.0, + 1810.0, + 1374.0, + 1851.0, + 294.0, + 1851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1193.0, + 1407.0, + 1193.0, + 1407.0, + 1231.0, + 294.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1223.0, + 1405.0, + 1223.0, + 1405.0, + 1263.0, + 321.0, + 1263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1254.0, + 815.0, + 1254.0, + 815.0, + 1288.0, + 322.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 688.0, + 1404.0, + 688.0, + 1404.0, + 721.0, + 298.0, + 721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 717.0, + 1406.0, + 717.0, + 1406.0, + 752.0, + 321.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 746.0, + 721.0, + 746.0, + 721.0, + 777.0, + 322.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 340.0, + 1405.0, + 340.0, + 1405.0, + 372.0, + 299.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 368.0, + 1409.0, + 368.0, + 1409.0, + 404.0, + 324.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1861.0, + 1401.0, + 1861.0, + 1401.0, + 1902.0, + 294.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1894.0, + 981.0, + 1894.0, + 981.0, + 1930.0, + 323.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 495.0, + 1407.0, + 495.0, + 1407.0, + 536.0, + 294.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 527.0, + 1406.0, + 527.0, + 1406.0, + 563.0, + 320.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 556.0, + 1148.0, + 556.0, + 1148.0, + 593.0, + 322.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 607.0, + 1404.0, + 607.0, + 1404.0, + 643.0, + 296.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 636.0, + 796.0, + 636.0, + 796.0, + 671.0, + 323.0, + 671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 416.0, + 1404.0, + 416.0, + 1404.0, + 456.0, + 293.0, + 456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 447.0, + 1139.0, + 447.0, + 1139.0, + 483.0, + 323.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1942.0, + 1304.0, + 1942.0, + 1304.0, + 1979.0, + 293.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1316.0, + 1942.0, + 1408.0, + 1942.0, + 1408.0, + 1981.0, + 1316.0, + 1981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1974.0, + 736.0, + 1974.0, + 736.0, + 2005.0, + 321.0, + 2005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 1971.0, + 1189.0, + 1971.0, + 1189.0, + 2004.0, + 790.0, + 2004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1238.0, + 1970.0, + 1411.0, + 1970.0, + 1411.0, + 2009.0, + 1238.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 2003.0, + 770.0, + 2003.0, + 770.0, + 2036.0, + 324.0, + 2036.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 299, + 75, + 815, + 75, + 815, + 105, + 299, + 105 + ], + "score": 0.877 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 863, + 2088, + 863, + 2113, + 835, + 2113 + ], + "score": 0.831 + }, + { + "category_id": 1, + "poly": [ + 299, + 802, + 1208, + 802, + 1208, + 835, + 299, + 835 + ], + "score": 0.82 + }, + { + "category_id": 1, + "poly": [ + 296, + 855, + 1162, + 855, + 1162, + 888, + 296, + 888 + ], + "score": 0.753 + }, + { + "category_id": 1, + "poly": [ + 299, + 1479, + 1401, + 1479, + 1401, + 1543, + 299, + 1543 + ], + "score": 0.71 + }, + { + "category_id": 1, + "poly": [ + 300, + 1399, + 1401, + 1399, + 1401, + 1462, + 300, + 1462 + ], + "score": 0.677 + }, + { + "category_id": 1, + "poly": [ + 302, + 230, + 1398, + 230, + 1398, + 320, + 302, + 320 + ], + "score": 0.674 + }, + { + "category_id": 1, + "poly": [ + 301, + 908, + 1409, + 908, + 1409, + 969, + 301, + 969 + ], + "score": 0.67 + }, + { + "category_id": 1, + "poly": [ + 298, + 1289, + 1402, + 1289, + 1402, + 1380, + 298, + 1380 + ], + "score": 0.657 + }, + { + "category_id": 1, + "poly": [ + 298, + 1561, + 1405, + 1561, + 1405, + 1653, + 298, + 1653 + ], + "score": 0.653 + }, + { + "category_id": 1, + "poly": [ + 294, + 582, + 1404, + 582, + 1404, + 645, + 294, + 645 + ], + "score": 0.652 + }, + { + "category_id": 1, + "poly": [ + 298, + 1179, + 1406, + 1179, + 1406, + 1271, + 298, + 1271 + ], + "score": 0.65 + }, + { + "category_id": 1, + "poly": [ + 301, + 1069, + 1402, + 1069, + 1402, + 1159, + 301, + 1159 + ], + "score": 0.634 + }, + { + "category_id": 1, + "poly": [ + 296, + 988, + 1404, + 988, + 1404, + 1050, + 296, + 1050 + ], + "score": 0.632 + }, + { + "category_id": 1, + "poly": [ + 297, + 501, + 1402, + 501, + 1402, + 564, + 297, + 564 + ], + "score": 0.613 + }, + { + "category_id": 1, + "poly": [ + 299, + 1671, + 1402, + 1671, + 1402, + 1763, + 299, + 1763 + ], + "score": 0.582 + }, + { + "category_id": 1, + "poly": [ + 299, + 420, + 1402, + 420, + 1402, + 483, + 299, + 483 + ], + "score": 0.549 + }, + { + "category_id": 1, + "poly": [ + 294, + 339, + 1403, + 339, + 1403, + 403, + 294, + 403 + ], + "score": 0.545 + }, + { + "category_id": 1, + "poly": [ + 296, + 1781, + 1400, + 1781, + 1400, + 1845, + 296, + 1845 + ], + "score": 0.51 + }, + { + "category_id": 1, + "poly": [ + 296, + 1862, + 1401, + 1862, + 1401, + 1926, + 296, + 1926 + ], + "score": 0.496 + }, + { + "category_id": 1, + "poly": [ + 298, + 664, + 1406, + 664, + 1406, + 784, + 298, + 784 + ], + "score": 0.474 + }, + { + "category_id": 1, + "poly": [ + 300, + 1946, + 1405, + 1946, + 1405, + 2034, + 300, + 2034 + ], + "score": 0.391 + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2123.0, + 831.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 799.0, + 1210.0, + 799.0, + 1210.0, + 839.0, + 295.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 854.0, + 1166.0, + 854.0, + 1166.0, + 892.0, + 296.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1480.0, + 1407.0, + 1480.0, + 1407.0, + 1516.0, + 295.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1511.0, + 1263.0, + 1511.0, + 1263.0, + 1544.0, + 323.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1397.0, + 1406.0, + 1397.0, + 1406.0, + 1437.0, + 295.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1427.0, + 632.0, + 1427.0, + 632.0, + 1462.0, + 323.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 229.0, + 1404.0, + 229.0, + 1404.0, + 265.0, + 296.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 260.0, + 1406.0, + 260.0, + 1406.0, + 290.0, + 322.0, + 290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 289.0, + 855.0, + 289.0, + 855.0, + 322.0, + 323.0, + 322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 907.0, + 1405.0, + 907.0, + 1405.0, + 942.0, + 298.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 937.0, + 1409.0, + 937.0, + 1409.0, + 972.0, + 323.0, + 972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1288.0, + 1406.0, + 1288.0, + 1406.0, + 1325.0, + 294.0, + 1325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1319.0, + 1404.0, + 1319.0, + 1404.0, + 1354.0, + 321.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1348.0, + 622.0, + 1348.0, + 622.0, + 1379.0, + 322.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1558.0, + 1409.0, + 1558.0, + 1409.0, + 1599.0, + 293.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1588.0, + 1406.0, + 1588.0, + 1406.0, + 1629.0, + 320.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1620.0, + 1371.0, + 1620.0, + 1371.0, + 1654.0, + 322.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 579.0, + 1407.0, + 579.0, + 1407.0, + 619.0, + 293.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 612.0, + 506.0, + 612.0, + 506.0, + 644.0, + 323.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1179.0, + 1407.0, + 1179.0, + 1407.0, + 1213.0, + 296.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1211.0, + 1408.0, + 1211.0, + 1408.0, + 1244.0, + 324.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1237.0, + 1193.0, + 1237.0, + 1193.0, + 1272.0, + 324.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 1070.0, + 1404.0, + 1070.0, + 1404.0, + 1103.0, + 299.0, + 1103.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1100.0, + 1408.0, + 1100.0, + 1408.0, + 1133.0, + 322.0, + 1133.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1126.0, + 397.0, + 1126.0, + 397.0, + 1161.0, + 319.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 985.0, + 1409.0, + 985.0, + 1409.0, + 1025.0, + 291.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1015.0, + 398.0, + 1015.0, + 398.0, + 1053.0, + 319.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 497.0, + 1406.0, + 497.0, + 1406.0, + 539.0, + 292.0, + 539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 531.0, + 597.0, + 531.0, + 597.0, + 562.0, + 322.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1665.0, + 1407.0, + 1665.0, + 1407.0, + 1711.0, + 292.0, + 1711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1700.0, + 1406.0, + 1700.0, + 1406.0, + 1736.0, + 320.0, + 1736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1729.0, + 721.0, + 1729.0, + 721.0, + 1766.0, + 322.0, + 1766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 416.0, + 1406.0, + 416.0, + 1406.0, + 458.0, + 293.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 450.0, + 611.0, + 450.0, + 611.0, + 481.0, + 322.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 335.0, + 1408.0, + 335.0, + 1408.0, + 376.0, + 291.0, + 376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 366.0, + 399.0, + 366.0, + 399.0, + 404.0, + 320.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1781.0, + 1404.0, + 1781.0, + 1404.0, + 1817.0, + 295.0, + 1817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1810.0, + 1168.0, + 1810.0, + 1168.0, + 1846.0, + 319.0, + 1846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1862.0, + 1405.0, + 1862.0, + 1405.0, + 1898.0, + 295.0, + 1898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1890.0, + 1187.0, + 1890.0, + 1187.0, + 1930.0, + 320.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 661.0, + 1407.0, + 661.0, + 1407.0, + 701.0, + 295.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 694.0, + 1404.0, + 694.0, + 1404.0, + 728.0, + 321.0, + 728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 721.0, + 1407.0, + 721.0, + 1407.0, + 756.0, + 322.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 752.0, + 1055.0, + 752.0, + 1055.0, + 786.0, + 322.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1941.0, + 1407.0, + 1941.0, + 1407.0, + 1982.0, + 294.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1971.0, + 1409.0, + 1971.0, + 1409.0, + 2008.0, + 322.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 2003.0, + 682.0, + 2003.0, + 682.0, + 2036.0, + 323.0, + 2036.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1656, + 1406, + 1656, + 1406, + 1753, + 298, + 1753 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 299, + 1915, + 1405, + 1915, + 1405, + 2034, + 299, + 2034 + ], + "score": 0.969 + }, + { + "category_id": 8, + "poly": [ + 728, + 1554, + 972, + 1554, + 972, + 1635, + 728, + 1635 + ], + "score": 0.954 + }, + { + "category_id": 8, + "poly": [ + 690, + 1460, + 1007, + 1460, + 1007, + 1503, + 690, + 1503 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 297, + 1420, + 1003, + 1420, + 1003, + 1454, + 297, + 1454 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 295, + 1510, + 1172, + 1510, + 1172, + 1545, + 295, + 1545 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 299, + 1100, + 1102, + 1100, + 1102, + 1142, + 299, + 1142 + ], + "score": 0.915 + }, + { + "category_id": 0, + "poly": [ + 298, + 486, + 466, + 486, + 466, + 531, + 298, + 531 + ], + "score": 0.899 + }, + { + "category_id": 1, + "poly": [ + 297, + 965, + 1261, + 965, + 1261, + 1000, + 297, + 1000 + ], + "score": 0.897 + }, + { + "category_id": 0, + "poly": [ + 300, + 1793, + 716, + 1793, + 716, + 1828, + 300, + 1828 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 815, + 75, + 815, + 105, + 299, + 105 + ], + "score": 0.884 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1193, + 1401, + 1193, + 1401, + 1224, + 1352, + 1224 + ], + "score": 0.882 + }, + { + "category_id": 9, + "poly": [ + 1351, + 780, + 1401, + 780, + 1401, + 812, + 1351, + 812 + ], + "score": 0.87 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1238, + 1400, + 1238, + 1400, + 1268, + 1352, + 1268 + ], + "score": 0.861 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 863, + 2088, + 863, + 2112, + 835, + 2112 + ], + "score": 0.853 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1328, + 1400, + 1328, + 1400, + 1357, + 1352, + 1357 + ], + "score": 0.849 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1365, + 1401, + 1365, + 1401, + 1395, + 1352, + 1395 + ], + "score": 0.848 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1283, + 1400, + 1283, + 1400, + 1312, + 1352, + 1312 + ], + "score": 0.841 + }, + { + "category_id": 0, + "poly": [ + 298, + 1858, + 465, + 1858, + 465, + 1892, + 298, + 1892 + ], + "score": 0.82 + }, + { + "category_id": 0, + "poly": [ + 301, + 1038, + 1203, + 1038, + 1203, + 1076, + 301, + 1076 + ], + "score": 0.724 + }, + { + "category_id": 8, + "poly": [ + 495, + 1322, + 677, + 1322, + 677, + 1362, + 495, + 1362 + ], + "score": 0.696 + }, + { + "category_id": 1, + "poly": [ + 299, + 228, + 1402, + 228, + 1402, + 320, + 299, + 320 + ], + "score": 0.69 + }, + { + "category_id": 8, + "poly": [ + 464, + 1280, + 1254, + 1280, + 1254, + 1315, + 464, + 1315 + ], + "score": 0.686 + }, + { + "category_id": 1, + "poly": [ + 312, + 627, + 1339, + 627, + 1339, + 958, + 312, + 958 + ], + "score": 0.682 + }, + { + "category_id": 1, + "poly": [ + 296, + 440, + 1401, + 440, + 1401, + 476, + 296, + 476 + ], + "score": 0.675 + }, + { + "category_id": 8, + "poly": [ + 419, + 1186, + 716, + 1186, + 716, + 1229, + 419, + 1229 + ], + "score": 0.665 + }, + { + "category_id": 1, + "poly": [ + 303, + 335, + 1404, + 335, + 1404, + 427, + 303, + 427 + ], + "score": 0.64 + }, + { + "category_id": 8, + "poly": [ + 553, + 1235, + 1281, + 1235, + 1281, + 1271, + 553, + 1271 + ], + "score": 0.552 + }, + { + "category_id": 0, + "poly": [ + 299, + 566, + 1023, + 566, + 1023, + 606, + 299, + 606 + ], + "score": 0.531 + }, + { + "category_id": 1, + "poly": [ + 299, + 566, + 1023, + 566, + 1023, + 606, + 299, + 606 + ], + "score": 0.44 + }, + { + "category_id": 8, + "poly": [ + 312, + 627, + 1339, + 627, + 1339, + 958, + 312, + 958 + ], + "score": 0.381 + }, + { + "category_id": 1, + "poly": [ + 553, + 1235, + 1281, + 1235, + 1281, + 1271, + 553, + 1271 + ], + "score": 0.266 + }, + { + "category_id": 1, + "poly": [ + 301, + 1038, + 1203, + 1038, + 1203, + 1076, + 301, + 1076 + ], + "score": 0.202 + }, + { + "category_id": 1, + "poly": [ + 464, + 1280, + 1254, + 1280, + 1254, + 1315, + 464, + 1315 + ], + "score": 0.177 + }, + { + "category_id": 14, + "poly": [ + 728, + 1552, + 971, + 1552, + 971, + 1633, + 728, + 1633 + ], + "score": 0.94, + "latex": "\\sigma ( x _ { t } ^ { l } ) \\approx \\frac { \\mathrm { f } ^ { - 1 } ( t ) - x _ { t } ^ { l } } { \\mathrm { E } _ { \\xi } [ \\xi _ { t } ^ { l } ] }" + }, + { + "category_id": 13, + "poly": [ + 863, + 1688, + 1103, + 1688, + 1103, + 1725, + 863, + 1725 + ], + "score": 0.94, + "latex": "\\mathrm { f } ^ { - 1 } ( x ) = 4 ( x - 0 . 5 )" + }, + { + "category_id": 13, + "poly": [ + 441, + 1102, + 678, + 1102, + 678, + 1140, + 441, + 1140 + ], + "score": 0.93, + "latex": "z _ { t } ^ { l } = x _ { t } ^ { l } + p _ { t } ^ { l } \\sigma ( x ) | \\xi _ { t } ^ { l } |" + }, + { + "category_id": 13, + "poly": [ + 571, + 1510, + 637, + 1510, + 637, + 1546, + 571, + 1546 + ], + "score": 0.93, + "latex": "\\sigma ( x _ { t } ^ { l } )" + }, + { + "category_id": 13, + "poly": [ + 729, + 1103, + 918, + 1103, + 918, + 1141, + 729, + 1141 + ], + "score": 0.92, + "latex": "\\mathrm { E } _ { \\xi } [ \\psi ( x _ { t } ^ { l } , \\xi ) ] = t" + }, + { + "category_id": 13, + "poly": [ + 871, + 967, + 930, + 967, + 930, + 1000, + 871, + 1000 + ], + "score": 0.92, + "latex": "\\mathcal { L } ( \\pmb \\theta )" + }, + { + "category_id": 13, + "poly": [ + 977, + 1510, + 1054, + 1510, + 1054, + 1546, + 977, + 1546 + ], + "score": 0.92, + "latex": "p _ { t } ^ { l } = 1" + }, + { + "category_id": 14, + "poly": [ + 686, + 1459, + 1011, + 1459, + 1011, + 1502, + 686, + 1502 + ], + "score": 0.91, + "latex": "\\mathrm { f } ^ { - 1 } ( t ) \\approx x _ { t } ^ { l } + p _ { t } ^ { l } \\sigma ( x ) \\mathrm { E } _ { \\xi } [ \\xi _ { t } ^ { l } ]" + }, + { + "category_id": 13, + "poly": [ + 744, + 729, + 786, + 729, + 786, + 766, + 744, + 766 + ], + "score": 0.89, + "latex": "\\xi ^ { ( i ) }" + }, + { + "category_id": 13, + "poly": [ + 609, + 1947, + 688, + 1947, + 688, + 1974, + 609, + 1974 + ], + "score": 0.88, + "latex": "4 e - 4" + }, + { + "category_id": 13, + "poly": [ + 1065, + 1103, + 1091, + 1103, + 1091, + 1139, + 1065, + 1139 + ], + "score": 0.87, + "latex": "z _ { t } ^ { l }" + }, + { + "category_id": 13, + "poly": [ + 561, + 1657, + 602, + 1657, + 602, + 1691, + 561, + 1691 + ], + "score": 0.86, + "latex": "\\operatorname { f } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 807, + 1722, + 823, + 1722, + 823, + 1753, + 807, + 1753 + ], + "score": 0.84, + "latex": "\\xi" + }, + { + "category_id": 13, + "poly": [ + 1051, + 1281, + 1091, + 1281, + 1091, + 1315, + 1051, + 1315 + ], + "score": 0.83, + "latex": "\\operatorname { f } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 1101, + 1950, + 1128, + 1950, + 1128, + 1975, + 1101, + 1975 + ], + "score": 0.82, + "latex": "a _ { i }" + }, + { + "category_id": 13, + "poly": [ + 833, + 1237, + 875, + 1237, + 875, + 1271, + 833, + 1271 + ], + "score": 0.79, + "latex": "\\operatorname { f } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 465, + 1277, + 706, + 1277, + 706, + 1316, + 465, + 1316 + ], + "score": 0.79, + "latex": "\\mathrm { E } _ { \\xi } [ \\mathbf { f } ( z _ { t } ^ { l } ) ] \\approx \\mathbf { f } ( \\mathrm { E } _ { \\xi } [ z _ { t } ^ { l } ] )" + }, + { + "category_id": 13, + "poly": [ + 737, + 1726, + 757, + 1726, + 757, + 1748, + 737, + 1748 + ], + "score": 0.78, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 556, + 1233, + 706, + 1233, + 706, + 1272, + 556, + 1272 + ], + "score": 0.7, + "latex": "t = \\mathrm { E } _ { \\xi } [ \\mathbf { f } ( z _ { t } ^ { l } ) ]" + }, + { + "category_id": 13, + "poly": [ + 1282, + 735, + 1299, + 735, + 1299, + 766, + 1282, + 766 + ], + "score": 0.69, + "latex": "\\xi" + }, + { + "category_id": 14, + "poly": [ + 417, + 1185, + 714, + 1185, + 714, + 1227, + 417, + 1227 + ], + "score": 0.66, + "latex": "\\mathrm { E } _ { \\xi } [ \\psi ( x _ { t } ^ { l } , \\xi _ { t } ^ { l } ) ] = \\mathrm { E } _ { \\xi } [ \\mathbf { f } ( z _ { t } ^ { l } ) ] ," + }, + { + "category_id": 14, + "poly": [ + 405, + 870, + 684, + 870, + 684, + 964, + 405, + 964 + ], + "score": 0.66, + "latex": "\\approx \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\frac { \\partial \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\xi } ^ { ( i ) } ) } { \\partial \\pmb { \\theta } } ." + }, + { + "category_id": 13, + "poly": [ + 507, + 801, + 611, + 801, + 611, + 866, + 507, + 866 + ], + "score": 0.58, + "latex": "\\frac { \\partial \\mathcal { L } _ { K } ( { \\pmb \\theta } ) } { \\partial { \\pmb \\theta } }" + }, + { + "category_id": 13, + "poly": [ + 405, + 706, + 654, + 706, + 654, + 797, + 405, + 797 + ], + "score": 0.48, + "latex": "\\approx \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\mathcal { L } ( \\pmb { \\theta } - \\pmb { \\xi } ^ { ( i ) } )" + }, + { + "category_id": 13, + "poly": [ + 998, + 1974, + 1098, + 1974, + 1098, + 2007, + 998, + 2007 + ], + "score": 0.45, + "latex": "\\mathrm { { U } [ - 2 , 2 ] }" + }, + { + "category_id": 13, + "poly": [ + 320, + 628, + 867, + 628, + 867, + 701, + 320, + 701 + ], + "score": 0.43, + "latex": "{ \\mathcal L } _ { K } ( \\pmb \\theta ) = ( { \\mathcal L } * K ) ( \\pmb \\theta ) = \\int _ { C } { \\mathcal L } ( \\pmb \\theta - \\xi ) K ( \\xi ) d \\xi" + }, + { + "category_id": 14, + "poly": [ + 494, + 1320, + 678, + 1320, + 678, + 1363, + 494, + 1363 + ], + "score": 0.42, + "latex": "\\mathrm { f } ^ { - 1 } ( t ) \\approx \\mathrm { E } _ { \\xi } [ z _ { t } ^ { l } ]" + }, + { + "category_id": 14, + "poly": [ + 417, + 1181, + 1277, + 1181, + 1277, + 1367, + 417, + 1367 + ], + "score": 0.38, + "latex": "\\begin{array} { r l } & { \\mathrm { E } _ { \\xi } [ \\psi ( x _ { t } ^ { l } , \\xi _ { t } ^ { l } ) ] = \\mathrm { E } _ { \\xi } [ \\mathrm { f } ( z _ { t } ^ { l } ) ] , } \\\\ & { \\qquad t = \\mathrm { E } _ { \\xi } [ \\mathrm { f } ( z _ { t } ^ { l } ) ] , \\ \\mathrm { a s s u m i n g ~ f ( \\cdot ) ~ b e h a v e s ~ s i m i l a r ~ t o ~ a ~ l i n e a r ~ f u n c t i o n } ; } \\\\ & { \\qquad \\mathrm { E } _ { \\xi } [ \\mathrm { f } ( z _ { t } ^ { l } ) ] \\approx \\mathrm { f } ( \\mathrm { E } _ { \\xi } [ z _ { t } ^ { l } ] ) \\ \\mathrm { s i n c e ~ w e ~ u s e ~ h a r d - s i g m o i d ~ f o r ~ f ( \\cdot ) ~ t h i s ~ w i l l ~ h o l d } . } \\\\ & { \\qquad \\mathrm { f } ^ { - 1 } ( t ) \\approx \\mathrm { E } _ { \\xi } [ z _ { t } ^ { l } ] } \\end{array}" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 482.0, + 473.0, + 482.0, + 473.0, + 535.0, + 288.0, + 535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1789.0, + 719.0, + 1789.0, + 719.0, + 1835.0, + 294.0, + 1835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2084.0, + 869.0, + 2084.0, + 869.0, + 2123.0, + 831.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1856.0, + 470.0, + 1856.0, + 470.0, + 1897.0, + 294.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1038.0, + 1206.0, + 1038.0, + 1206.0, + 1079.0, + 293.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 563.0, + 1027.0, + 563.0, + 1027.0, + 612.0, + 293.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1652.0, + 560.0, + 1652.0, + 560.0, + 1697.0, + 292.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 603.0, + 1652.0, + 1406.0, + 1652.0, + 1406.0, + 1697.0, + 603.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1687.0, + 862.0, + 1687.0, + 862.0, + 1728.0, + 293.0, + 1728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1104.0, + 1687.0, + 1406.0, + 1687.0, + 1406.0, + 1728.0, + 1104.0, + 1728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1721.0, + 736.0, + 1721.0, + 736.0, + 1755.0, + 296.0, + 1755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 758.0, + 1721.0, + 806.0, + 1721.0, + 806.0, + 1755.0, + 758.0, + 1755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 824.0, + 1721.0, + 836.0, + 1721.0, + 836.0, + 1755.0, + 824.0, + 1755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1914.0, + 1406.0, + 1914.0, + 1406.0, + 1948.0, + 295.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1946.0, + 608.0, + 1946.0, + 608.0, + 1980.0, + 295.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 689.0, + 1946.0, + 1100.0, + 1946.0, + 1100.0, + 1980.0, + 689.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1946.0, + 1406.0, + 1946.0, + 1406.0, + 1980.0, + 1129.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1970.0, + 997.0, + 1970.0, + 997.0, + 2009.0, + 294.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1099.0, + 1970.0, + 1405.0, + 1970.0, + 1405.0, + 2009.0, + 1099.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2002.0, + 794.0, + 2002.0, + 794.0, + 2035.0, + 294.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1416.0, + 1006.0, + 1416.0, + 1006.0, + 1460.0, + 292.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1505.0, + 570.0, + 1505.0, + 570.0, + 1552.0, + 295.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 1505.0, + 976.0, + 1505.0, + 976.0, + 1552.0, + 638.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1055.0, + 1505.0, + 1176.0, + 1505.0, + 1176.0, + 1552.0, + 1055.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1097.0, + 440.0, + 1097.0, + 440.0, + 1147.0, + 292.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 1097.0, + 728.0, + 1097.0, + 728.0, + 1147.0, + 679.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 1097.0, + 1064.0, + 1097.0, + 1064.0, + 1147.0, + 919.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 1097.0, + 1103.0, + 1097.0, + 1103.0, + 1147.0, + 1092.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 964.0, + 870.0, + 964.0, + 870.0, + 1004.0, + 295.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 931.0, + 964.0, + 1264.0, + 964.0, + 1264.0, + 1004.0, + 931.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 230.0, + 655.0, + 230.0, + 655.0, + 263.0, + 297.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 706.0, + 228.0, + 1404.0, + 228.0, + 1404.0, + 263.0, + 706.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 261.0, + 689.0, + 261.0, + 689.0, + 291.0, + 325.0, + 291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 260.0, + 1330.0, + 260.0, + 1330.0, + 293.0, + 733.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1335.0, + 258.0, + 1408.0, + 258.0, + 1408.0, + 291.0, + 1335.0, + 291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 288.0, + 856.0, + 288.0, + 856.0, + 322.0, + 324.0, + 322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 638.0, + 319.0, + 638.0, + 319.0, + 685.0, + 314.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 631.0, + 1347.0, + 631.0, + 1347.0, + 694.0, + 868.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 655.0, + 717.0, + 743.0, + 717.0, + 743.0, + 784.0, + 655.0, + 784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 787.0, + 717.0, + 1281.0, + 717.0, + 1281.0, + 784.0, + 787.0, + 784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1300.0, + 717.0, + 1307.0, + 717.0, + 1307.0, + 784.0, + 1300.0, + 784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 504.0, + 790.0, + 615.0, + 790.0, + 615.0, + 842.0, + 504.0, + 842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 812.0, + 506.0, + 812.0, + 506.0, + 862.0, + 401.0, + 862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 440.0, + 1406.0, + 440.0, + 1406.0, + 479.0, + 297.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 332.0, + 1405.0, + 332.0, + 1405.0, + 371.0, + 296.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 365.0, + 1408.0, + 365.0, + 1408.0, + 399.0, + 323.0, + 399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 393.0, + 397.0, + 393.0, + 397.0, + 427.0, + 322.0, + 427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 563.0, + 1027.0, + 563.0, + 1027.0, + 612.0, + 293.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1278.0, + 1228.0, + 1284.0, + 1228.0, + 1284.0, + 1279.0, + 1278.0, + 1279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1038.0, + 1206.0, + 1038.0, + 1206.0, + 1079.0, + 293.0, + 1079.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1096, + 1404, + 1096, + 1404, + 1245, + 298, + 1245 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1334, + 1405, + 1334, + 1405, + 1483, + 298, + 1483 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 438, + 1406, + 438, + 1406, + 528, + 298, + 528 + ], + "score": 0.973 + }, + { + "category_id": 3, + "poly": [ + 392, + 575, + 1304, + 575, + 1304, + 898, + 392, + 898 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 299, + 1678, + 1404, + 1678, + 1404, + 1768, + 299, + 1768 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 302, + 1574, + 1400, + 1574, + 1400, + 1663, + 302, + 1663 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 298, + 286, + 1401, + 286, + 1401, + 346, + 298, + 346 + ], + "score": 0.947 + }, + { + "category_id": 4, + "poly": [ + 295, + 923, + 1402, + 923, + 1402, + 986, + 295, + 986 + ], + "score": 0.925 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.9 + }, + { + "category_id": 0, + "poly": [ + 299, + 381, + 490, + 381, + 490, + 413, + 299, + 413 + ], + "score": 0.898 + }, + { + "category_id": 0, + "poly": [ + 299, + 229, + 518, + 229, + 518, + 261, + 299, + 261 + ], + "score": 0.898 + }, + { + "category_id": 0, + "poly": [ + 300, + 1518, + 1143, + 1518, + 1143, + 1550, + 300, + 1550 + ], + "score": 0.895 + }, + { + "category_id": 0, + "poly": [ + 301, + 1278, + 733, + 1278, + 733, + 1311, + 301, + 1311 + ], + "score": 0.89 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 863, + 2088, + 863, + 2112, + 835, + 2112 + ], + "score": 0.847 + }, + { + "category_id": 0, + "poly": [ + 298, + 1040, + 459, + 1040, + 459, + 1071, + 298, + 1071 + ], + "score": 0.846 + }, + { + "category_id": 13, + "poly": [ + 704, + 1213, + 805, + 1213, + 805, + 1246, + 704, + 1246 + ], + "score": 0.91, + "latex": "\\mathsf { \\bar { U } } [ - 2 , 2 ]" + }, + { + "category_id": 13, + "poly": [ + 1324, + 1156, + 1402, + 1156, + 1402, + 1184, + 1324, + 1184 + ], + "score": 0.88, + "latex": "1 e - 3" + }, + { + "category_id": 13, + "poly": [ + 1178, + 316, + 1256, + 316, + 1256, + 344, + 1178, + 344 + ], + "score": 0.86, + "latex": "1 e - 3" + }, + { + "category_id": 13, + "poly": [ + 593, + 1187, + 621, + 1187, + 621, + 1214, + 593, + 1214 + ], + "score": 0.85, + "latex": "a _ { i }" + }, + { + "category_id": 13, + "poly": [ + 952, + 1575, + 999, + 1575, + 999, + 1603, + 952, + 1603 + ], + "score": 0.85, + "latex": "1 0 k" + }, + { + "category_id": 13, + "poly": [ + 391, + 1575, + 439, + 1575, + 439, + 1603, + 391, + 1603 + ], + "score": 0.81, + "latex": "1 0 k" + }, + { + "category_id": 13, + "poly": [ + 1140, + 1679, + 1218, + 1679, + 1218, + 1707, + 1140, + 1707 + ], + "score": 0.81, + "latex": "6 e - 4" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 579.0, + 422.0, + 579.0, + 422.0, + 599.0, + 396.0, + 599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 913.0, + 578.0, + 939.0, + 578.0, + 939.0, + 598.0, + 913.0, + 598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 598.0, + 758.0, + 598.0, + 758.0, + 624.0, + 467.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1023.0, + 597.0, + 1277.0, + 597.0, + 1277.0, + 623.0, + 1023.0, + 623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 623.0, + 754.0, + 623.0, + 754.0, + 648.0, + 467.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1024.0, + 623.0, + 1272.0, + 623.0, + 1272.0, + 648.0, + 1024.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 660.0, + 419.0, + 660.0, + 419.0, + 680.0, + 396.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 645.0, + 680.0, + 645.0, + 680.0, + 674.0, + 467.0, + 674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 912.0, + 656.0, + 942.0, + 656.0, + 942.0, + 681.0, + 912.0, + 681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1024.0, + 646.0, + 1199.0, + 646.0, + 1199.0, + 672.0, + 1024.0, + 672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 740.0, + 422.0, + 740.0, + 422.0, + 760.0, + 396.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 740.0, + 941.0, + 740.0, + 941.0, + 759.0, + 908.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 419.0, + 833.0, + 435.0, + 833.0, + 435.0, + 850.0, + 419.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 480.0, + 830.0, + 512.0, + 830.0, + 512.0, + 852.0, + 480.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 547.0, + 830.0, + 579.0, + 830.0, + 579.0, + 852.0, + 547.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 830.0, + 648.0, + 830.0, + 648.0, + 852.0, + 615.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 830.0, + 715.0, + 830.0, + 715.0, + 852.0, + 682.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 751.0, + 830.0, + 784.0, + 830.0, + 784.0, + 852.0, + 751.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 939.0, + 835.0, + 950.0, + 835.0, + 950.0, + 848.0, + 939.0, + 848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 998.0, + 830.0, + 1029.0, + 830.0, + 1029.0, + 852.0, + 998.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 830.0, + 1098.0, + 830.0, + 1098.0, + 852.0, + 1064.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 830.0, + 1165.0, + 830.0, + 1165.0, + 852.0, + 1133.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1201.0, + 830.0, + 1234.0, + 830.0, + 1234.0, + 852.0, + 1201.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1270.0, + 830.0, + 1301.0, + 830.0, + 1301.0, + 852.0, + 1270.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 573.0, + 867.0, + 608.0, + 867.0, + 608.0, + 902.0, + 573.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1088.0, + 865.0, + 1128.0, + 865.0, + 1128.0, + 904.0, + 1088.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 389.25, + 818.5, + 426.25, + 818.5, + 426.25, + 840.5, + 389.25, + 840.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.25, + 819.0, + 945.25, + 819.0, + 945.25, + 841.5, + 908.25, + 841.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 925.0, + 1404.0, + 925.0, + 1404.0, + 957.0, + 297.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 952.0, + 1144.0, + 952.0, + 1144.0, + 989.0, + 293.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 816.0, + 73.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 378.0, + 493.0, + 378.0, + 493.0, + 419.0, + 294.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 224.0, + 521.0, + 224.0, + 521.0, + 267.0, + 294.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1516.0, + 1148.0, + 1516.0, + 1148.0, + 1554.0, + 295.0, + 1554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1277.0, + 738.0, + 1277.0, + 738.0, + 1314.0, + 295.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 868.0, + 2085.0, + 868.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1039.0, + 464.0, + 1039.0, + 464.0, + 1075.0, + 295.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1097.0, + 1406.0, + 1097.0, + 1406.0, + 1129.0, + 296.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1122.0, + 1406.0, + 1122.0, + 1406.0, + 1161.0, + 292.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1152.0, + 1323.0, + 1152.0, + 1323.0, + 1189.0, + 294.0, + 1189.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 1152.0, + 1408.0, + 1152.0, + 1408.0, + 1189.0, + 1403.0, + 1189.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1180.0, + 592.0, + 1180.0, + 592.0, + 1221.0, + 292.0, + 1221.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 622.0, + 1180.0, + 1408.0, + 1180.0, + 1408.0, + 1221.0, + 622.0, + 1221.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1212.0, + 703.0, + 1212.0, + 703.0, + 1248.0, + 294.0, + 1248.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 1212.0, + 817.0, + 1212.0, + 817.0, + 1248.0, + 806.0, + 1248.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1335.0, + 1405.0, + 1335.0, + 1405.0, + 1371.0, + 295.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1363.0, + 1405.0, + 1363.0, + 1405.0, + 1399.0, + 293.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1390.0, + 1405.0, + 1390.0, + 1405.0, + 1429.0, + 292.0, + 1429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1420.0, + 1405.0, + 1420.0, + 1405.0, + 1459.0, + 292.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1450.0, + 599.0, + 1450.0, + 599.0, + 1486.0, + 293.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 437.0, + 1406.0, + 437.0, + 1406.0, + 473.0, + 293.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 465.0, + 1406.0, + 465.0, + 1406.0, + 503.0, + 293.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 497.0, + 1175.0, + 497.0, + 1175.0, + 530.0, + 295.0, + 530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1677.0, + 1139.0, + 1677.0, + 1139.0, + 1713.0, + 293.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1219.0, + 1677.0, + 1404.0, + 1677.0, + 1404.0, + 1713.0, + 1219.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1708.0, + 1405.0, + 1708.0, + 1405.0, + 1741.0, + 294.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1737.0, + 489.0, + 1737.0, + 489.0, + 1770.0, + 293.0, + 1770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1574.0, + 390.0, + 1574.0, + 390.0, + 1607.0, + 297.0, + 1607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.0, + 1574.0, + 951.0, + 1574.0, + 951.0, + 1607.0, + 440.0, + 1607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1000.0, + 1574.0, + 1404.0, + 1574.0, + 1404.0, + 1607.0, + 1000.0, + 1607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1606.0, + 1403.0, + 1606.0, + 1403.0, + 1635.0, + 297.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1630.0, + 1405.0, + 1630.0, + 1405.0, + 1669.0, + 294.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 284.0, + 1403.0, + 284.0, + 1403.0, + 318.0, + 296.0, + 318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 316.0, + 1177.0, + 316.0, + 1177.0, + 347.0, + 296.0, + 347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1257.0, + 316.0, + 1264.0, + 316.0, + 1264.0, + 347.0, + 1257.0, + 347.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 14, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/uUlGTEbBRL/images/013be854a9532dabb1fa6665db380c28ec3b3f8805bf479b05c8e8dd4f098e89.jpg b/parse/train/uUlGTEbBRL/images/013be854a9532dabb1fa6665db380c28ec3b3f8805bf479b05c8e8dd4f098e89.jpg new file mode 100644 index 0000000000000000000000000000000000000000..4ac3e58828de5aa1b68dc1d5869e5ddc0a897afc --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/013be854a9532dabb1fa6665db380c28ec3b3f8805bf479b05c8e8dd4f098e89.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:13a3dd3a7a531125ffdb992e1e7e9609dcf8d38c3bdf606a38899cd9b724c1ae +size 7558 diff --git a/parse/train/uUlGTEbBRL/images/05f8fc60fb98de8a8aa4e8b57e9a7048fa4ed22202a4a93c2b2f714d3fe7d35d.jpg b/parse/train/uUlGTEbBRL/images/05f8fc60fb98de8a8aa4e8b57e9a7048fa4ed22202a4a93c2b2f714d3fe7d35d.jpg new file mode 100644 index 0000000000000000000000000000000000000000..a17116c5b6c27481ef0f6f1555eddef445ca030e --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/05f8fc60fb98de8a8aa4e8b57e9a7048fa4ed22202a4a93c2b2f714d3fe7d35d.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:af01f75d5aae8666a9bef02a1e76f65b528be734563c12a6e0422b8b94048a43 +size 7293 diff --git a/parse/train/uUlGTEbBRL/images/102ae0e692cc17b22126be760a811b8f429d0a9aeab06a7d679a4df173e38a01.jpg b/parse/train/uUlGTEbBRL/images/102ae0e692cc17b22126be760a811b8f429d0a9aeab06a7d679a4df173e38a01.jpg new file mode 100644 index 0000000000000000000000000000000000000000..19a9d036627d35d26002dc8350ade526664d1368 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/102ae0e692cc17b22126be760a811b8f429d0a9aeab06a7d679a4df173e38a01.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c67eb162f05fdf7c19e7ca5c0c2e765ddd52b8ec6bdcad34fed849ea9245abb8 +size 6531 diff --git a/parse/train/uUlGTEbBRL/images/1a287e1a96daf2c8fca264ccf6bb597f6db91324f826d785e1a17905eca4e341.jpg b/parse/train/uUlGTEbBRL/images/1a287e1a96daf2c8fca264ccf6bb597f6db91324f826d785e1a17905eca4e341.jpg new file mode 100644 index 0000000000000000000000000000000000000000..5618c4e3e21abae04db0c29feb91e26e18851fdd --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/1a287e1a96daf2c8fca264ccf6bb597f6db91324f826d785e1a17905eca4e341.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:dd6dcff15c503ac0136da663fbd53ba1fc8ecd8248841f671b5ebbb99d159b2e +size 10670 diff --git a/parse/train/uUlGTEbBRL/images/2806ffefc914922a5e232882c2d0a3528c042483379e0ed461c63ba1e6783a55.jpg b/parse/train/uUlGTEbBRL/images/2806ffefc914922a5e232882c2d0a3528c042483379e0ed461c63ba1e6783a55.jpg new file mode 100644 index 0000000000000000000000000000000000000000..29e5be9e2dc2fd5196356504efb172d2df860a16 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/2806ffefc914922a5e232882c2d0a3528c042483379e0ed461c63ba1e6783a55.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2ff6912a52a03ebfe8647aa2b1f65424b403fb5d7f9fea2ff8c8c5e1e661604f +size 6118 diff --git a/parse/train/uUlGTEbBRL/images/3118f9b57db10188e97e1101c531c3a9a9914cbbfb774b38f6453ca0f4205b7a.jpg b/parse/train/uUlGTEbBRL/images/3118f9b57db10188e97e1101c531c3a9a9914cbbfb774b38f6453ca0f4205b7a.jpg new file mode 100644 index 0000000000000000000000000000000000000000..58db9a9f51af7b994645b3d8544af47490ba990a --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/3118f9b57db10188e97e1101c531c3a9a9914cbbfb774b38f6453ca0f4205b7a.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:df1cb014bf386a6c1d1b23ea4c78d3e33993cc4303105ff684dfefe422039628 +size 17198 diff --git a/parse/train/uUlGTEbBRL/images/34571bff1e266c29b49fe290d0a45debb3a7188182ac4370ed659188f031f043.jpg b/parse/train/uUlGTEbBRL/images/34571bff1e266c29b49fe290d0a45debb3a7188182ac4370ed659188f031f043.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f0716ac1b8fa9e29911c6b25f0dd654991c00909 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/34571bff1e266c29b49fe290d0a45debb3a7188182ac4370ed659188f031f043.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2c91dff2ee41841f30f4fec28cb74ae07934cd60ca076ed7fafd15a4706a6291 +size 9004 diff --git a/parse/train/uUlGTEbBRL/images/41be867d575972234b17cc76ac138d290fad8311f2fc1f71a9a4cfbacb7f3696.jpg b/parse/train/uUlGTEbBRL/images/41be867d575972234b17cc76ac138d290fad8311f2fc1f71a9a4cfbacb7f3696.jpg new file mode 100644 index 0000000000000000000000000000000000000000..34b9cf33fa0940e39a40fc7b3cd51c378663563b --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/41be867d575972234b17cc76ac138d290fad8311f2fc1f71a9a4cfbacb7f3696.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f9e5a6ace313672e0bffca7ad8fdb7e8c234dc666e0dde74b397ecaa671ade4e +size 15398 diff --git a/parse/train/uUlGTEbBRL/images/443f023c687b810faef6541832be196fcdc6d0d89ede8abd58558376bfa1f598.jpg b/parse/train/uUlGTEbBRL/images/443f023c687b810faef6541832be196fcdc6d0d89ede8abd58558376bfa1f598.jpg new file mode 100644 index 0000000000000000000000000000000000000000..41e91fed5bfa198c19fbc111d3b6ac6ffa193858 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/443f023c687b810faef6541832be196fcdc6d0d89ede8abd58558376bfa1f598.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:aadd34312b1461f8e2445dd1bc5b58c4f2b96939f3bb4bb69f0297b5a839d8cb +size 14086 diff --git a/parse/train/uUlGTEbBRL/images/48cfb9dd953f41ecf35f7664534ff58d3686a6c217718f52b620ae753c3e3b29.jpg b/parse/train/uUlGTEbBRL/images/48cfb9dd953f41ecf35f7664534ff58d3686a6c217718f52b620ae753c3e3b29.jpg new file mode 100644 index 0000000000000000000000000000000000000000..4a6fb8ca2b89f704331fe97a7da09114a87713f0 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/48cfb9dd953f41ecf35f7664534ff58d3686a6c217718f52b620ae753c3e3b29.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:036ac7cdab7760e64c57e857a0b7191499400bba829b4fbae4a30c1891426c57 +size 12863 diff --git a/parse/train/uUlGTEbBRL/images/54549da6b292a5ad11b3705c24370ca3f068157917d4737a606a008752a41cf5.jpg b/parse/train/uUlGTEbBRL/images/54549da6b292a5ad11b3705c24370ca3f068157917d4737a606a008752a41cf5.jpg new file mode 100644 index 0000000000000000000000000000000000000000..1e26d0f889de62043163e81a325569331179c84e --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/54549da6b292a5ad11b3705c24370ca3f068157917d4737a606a008752a41cf5.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c1c26370f67cfe30edc44ce9cca395a6cd6c9784b830f1ea9672e3a4bd3319e9 +size 10882 diff --git a/parse/train/uUlGTEbBRL/images/7618dbecd708483375e40f528e1a885ee6541c7fe15ad846fa24dd8af29181e1.jpg b/parse/train/uUlGTEbBRL/images/7618dbecd708483375e40f528e1a885ee6541c7fe15ad846fa24dd8af29181e1.jpg new file mode 100644 index 0000000000000000000000000000000000000000..33d5a99c6a0ed46968d2e1494690817c33a62a12 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/7618dbecd708483375e40f528e1a885ee6541c7fe15ad846fa24dd8af29181e1.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3793a13cdc6e4750b5e79c73ef515a560ef37bc03336f305bf3780aed11d4343 +size 11005 diff --git a/parse/train/uUlGTEbBRL/images/764baa9fa3435e398f9f4cdcff1185a0dc6f4fca1a8485245aab8ceaa17fa3b8.jpg b/parse/train/uUlGTEbBRL/images/764baa9fa3435e398f9f4cdcff1185a0dc6f4fca1a8485245aab8ceaa17fa3b8.jpg new file mode 100644 index 0000000000000000000000000000000000000000..1189032d7e1269da3cbbfe522d88491c2bc9e0fd --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/764baa9fa3435e398f9f4cdcff1185a0dc6f4fca1a8485245aab8ceaa17fa3b8.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9fa00c8b5fa7ca15e0deb784a09063f5d37b66ae7f5c8bf3725e63cd59aaaaa3 +size 11209 diff --git a/parse/train/uUlGTEbBRL/images/7a7275fb1397cd3f51518cde467c76dca280364c7007dd239250eeffb7ca0717.jpg b/parse/train/uUlGTEbBRL/images/7a7275fb1397cd3f51518cde467c76dca280364c7007dd239250eeffb7ca0717.jpg new file mode 100644 index 0000000000000000000000000000000000000000..a8400132a7479aadd5abd9aa18ee6b006d7297f2 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/7a7275fb1397cd3f51518cde467c76dca280364c7007dd239250eeffb7ca0717.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:cb635a4e5147b5dbc69b95eb2a66f9ae2bed2a9d0998aad46528b8f8d90d5485 +size 29134 diff --git a/parse/train/uUlGTEbBRL/images/7ea0b5045f601d3cee0fc8a731afc685592cbb8b394a3683e52ef70f7548895d.jpg b/parse/train/uUlGTEbBRL/images/7ea0b5045f601d3cee0fc8a731afc685592cbb8b394a3683e52ef70f7548895d.jpg new file mode 100644 index 0000000000000000000000000000000000000000..3b1a2d999a055e2544836dcb81478865e8bb1108 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/7ea0b5045f601d3cee0fc8a731afc685592cbb8b394a3683e52ef70f7548895d.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b0e873391f1c7e2fe54e497bde5c8cbf03c033cc1d5e7b305ca95fa4ab243068 +size 20305 diff --git a/parse/train/uUlGTEbBRL/images/81b6078bd2521f1298c5343f4efb88d58e2b53a21026815318f7ab2441abbd4d.jpg b/parse/train/uUlGTEbBRL/images/81b6078bd2521f1298c5343f4efb88d58e2b53a21026815318f7ab2441abbd4d.jpg new file mode 100644 index 0000000000000000000000000000000000000000..0ca2084502b5b70e132d4c884d9846c7cf136bf4 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/81b6078bd2521f1298c5343f4efb88d58e2b53a21026815318f7ab2441abbd4d.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f111d8150967ebf70b65d8938ed7e34351dcf958e760a143f1b53374f5de7a4f +size 11342 diff --git a/parse/train/uUlGTEbBRL/images/838cd2986018eea31a5124a3243774537fd9ab9c6779fe5df214e8d8e9ca89b2.jpg b/parse/train/uUlGTEbBRL/images/838cd2986018eea31a5124a3243774537fd9ab9c6779fe5df214e8d8e9ca89b2.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f84350238d886f4d795213c3c3e0b21e96425dd5 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/838cd2986018eea31a5124a3243774537fd9ab9c6779fe5df214e8d8e9ca89b2.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:696b33152d526fe26829b880eab6e0793cc5b56ca76fa7831f87b48df2919752 +size 29530 diff --git a/parse/train/uUlGTEbBRL/images/861260cd61602e82329f1d51d5ade0cff22fbaf6bec2389679fe05f012ec84ed.jpg b/parse/train/uUlGTEbBRL/images/861260cd61602e82329f1d51d5ade0cff22fbaf6bec2389679fe05f012ec84ed.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f2437df8858cd95431525974a54768ad55f590a2 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/861260cd61602e82329f1d51d5ade0cff22fbaf6bec2389679fe05f012ec84ed.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:61161b0973eaed160f200739b04bec56be9d42644d27aa35a324b8e3145ec3b7 +size 6343 diff --git a/parse/train/uUlGTEbBRL/images/88e3d758e63e52f938e1eedfdfe9c85baa91e7fdb6f44ca41c1aa064adc76ef0.jpg b/parse/train/uUlGTEbBRL/images/88e3d758e63e52f938e1eedfdfe9c85baa91e7fdb6f44ca41c1aa064adc76ef0.jpg new file mode 100644 index 0000000000000000000000000000000000000000..6eb6ba0f0d883830453fb960c2cfc9a17e5215de --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/88e3d758e63e52f938e1eedfdfe9c85baa91e7fdb6f44ca41c1aa064adc76ef0.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:77b2fa8b742e4216b8b7cbf5a0d3a0713e3133f962a8ad1889655fa612965010 +size 8355 diff --git a/parse/train/uUlGTEbBRL/images/8fce6f6e8b65556a86cb63c71b69eeb1759c58400cf32da14fe341edfe9354db.jpg b/parse/train/uUlGTEbBRL/images/8fce6f6e8b65556a86cb63c71b69eeb1759c58400cf32da14fe341edfe9354db.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f82dace1d049b3189bc95612ea10e02a7ed71de6 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/8fce6f6e8b65556a86cb63c71b69eeb1759c58400cf32da14fe341edfe9354db.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7376b1a4e93295f1bca2c06c371535aa16c7e48226facee9f5b639648601dc38 +size 12866 diff --git a/parse/train/uUlGTEbBRL/images/8fe2d7ede053b9426e77604acbf56af08ca3e0d5ac563ab9b8b0d78956f78baf.jpg b/parse/train/uUlGTEbBRL/images/8fe2d7ede053b9426e77604acbf56af08ca3e0d5ac563ab9b8b0d78956f78baf.jpg new file mode 100644 index 0000000000000000000000000000000000000000..80315f21b68da32f1f72a5aee336e4aa032b9976 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/8fe2d7ede053b9426e77604acbf56af08ca3e0d5ac563ab9b8b0d78956f78baf.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6086cd5ab38c84da38d64686b312af4449e8809668aab947b806f5c6342cd7a3 +size 11793 diff --git a/parse/train/uUlGTEbBRL/images/974a88e65ee8aaf5bd315e0c71a055c913644f6efee45586d1847df4efc27c51.jpg b/parse/train/uUlGTEbBRL/images/974a88e65ee8aaf5bd315e0c71a055c913644f6efee45586d1847df4efc27c51.jpg new file mode 100644 index 0000000000000000000000000000000000000000..8f3a9ef5a726b8aca662de7028ad664963296718 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/974a88e65ee8aaf5bd315e0c71a055c913644f6efee45586d1847df4efc27c51.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a16966a3afdceade4e89e090fa815ee84b123716909291a6d47c019687b4d4d4 +size 26712 diff --git a/parse/train/uUlGTEbBRL/images/97ebd44ca0851a42264ce0c1d42e12d26d488109ba7f65eab10daea00fd0fe31.jpg b/parse/train/uUlGTEbBRL/images/97ebd44ca0851a42264ce0c1d42e12d26d488109ba7f65eab10daea00fd0fe31.jpg new file mode 100644 index 0000000000000000000000000000000000000000..22c5bac0f20d0d259a690ca198050a196e6dceed --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/97ebd44ca0851a42264ce0c1d42e12d26d488109ba7f65eab10daea00fd0fe31.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5223f3a5c984a91b015e5e9c5714d2c89aae6b710cb44947bd19ac70c937c3d1 +size 16617 diff --git a/parse/train/uUlGTEbBRL/images/9f9521ee3f57d4c55c377f7e4552f3258f936ab79a4f935253a2e6d6e137d8ef.jpg b/parse/train/uUlGTEbBRL/images/9f9521ee3f57d4c55c377f7e4552f3258f936ab79a4f935253a2e6d6e137d8ef.jpg new file mode 100644 index 0000000000000000000000000000000000000000..59352cf0117160ca050deae89a5a43d20d10cf71 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/9f9521ee3f57d4c55c377f7e4552f3258f936ab79a4f935253a2e6d6e137d8ef.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7182de337f4882d04984f3f72b18c56f9b43a286cefe050bc917f9ca5accd3a6 +size 6844 diff --git a/parse/train/uUlGTEbBRL/images/a32b04724d913d9992bb9e715033735b032216016667a4b40d4a3dd8de545bfd.jpg b/parse/train/uUlGTEbBRL/images/a32b04724d913d9992bb9e715033735b032216016667a4b40d4a3dd8de545bfd.jpg new file mode 100644 index 0000000000000000000000000000000000000000..332452b67832276c73fe274d8bb8d0841ec57056 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/a32b04724d913d9992bb9e715033735b032216016667a4b40d4a3dd8de545bfd.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:cf3b7c6157b3b9f41de7622ef57d790cf2f85be06428e7a3837277ef90d34a0a +size 4800 diff --git a/parse/train/uUlGTEbBRL/images/ae06f6a7e8b2d89924e161eb9f6ce061c9bcb2aaf9448569ef85618b1d2f9bd8.jpg b/parse/train/uUlGTEbBRL/images/ae06f6a7e8b2d89924e161eb9f6ce061c9bcb2aaf9448569ef85618b1d2f9bd8.jpg new file mode 100644 index 0000000000000000000000000000000000000000..e9c51cb9dc5281f977de45136010de0570ab1fdf --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/ae06f6a7e8b2d89924e161eb9f6ce061c9bcb2aaf9448569ef85618b1d2f9bd8.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d14438697aba3e5b75a4727c7d44d499eba6c1d3b2b687e07048e334a2b9c099 +size 7350 diff --git a/parse/train/uUlGTEbBRL/images/af28a136445e13afec4159dc368250be7a902e7853a1e6274e6903ce650de11a.jpg b/parse/train/uUlGTEbBRL/images/af28a136445e13afec4159dc368250be7a902e7853a1e6274e6903ce650de11a.jpg new file mode 100644 index 0000000000000000000000000000000000000000..94fb6f93a38a3d998c1c5f0639a6c6e92bd1fa4b --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/af28a136445e13afec4159dc368250be7a902e7853a1e6274e6903ce650de11a.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:11880dfa5914d3ab356db000b0e64709a1f4773f79207307fbb9e3bfe6dc8302 +size 15678 diff --git a/parse/train/uUlGTEbBRL/images/b29d1ed821f90df9c83e7040a80ede774b3b52bff4bfe5beeb6d823d894dee32.jpg b/parse/train/uUlGTEbBRL/images/b29d1ed821f90df9c83e7040a80ede774b3b52bff4bfe5beeb6d823d894dee32.jpg new file mode 100644 index 0000000000000000000000000000000000000000..5995f1d76c1e5c5e00e34cf06403d2e807faf1dd --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/b29d1ed821f90df9c83e7040a80ede774b3b52bff4bfe5beeb6d823d894dee32.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:638f652f0ae056fb283e5ee8acb91c222fedcf25695621b71008d679f2d2dcac +size 9924 diff --git a/parse/train/uUlGTEbBRL/images/b4924b75793249b1587da2cf75448274d91d47a523afb7f0c1cfadfa3f4789e5.jpg b/parse/train/uUlGTEbBRL/images/b4924b75793249b1587da2cf75448274d91d47a523afb7f0c1cfadfa3f4789e5.jpg new file mode 100644 index 0000000000000000000000000000000000000000..f60f218d59779a353b897bc7a6fb5357a82eec0f --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/b4924b75793249b1587da2cf75448274d91d47a523afb7f0c1cfadfa3f4789e5.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0931a2e235baccb455268a3cc5cce66c3d1c1c8e325b0d4a50acdda117899ef6 +size 5009 diff --git a/parse/train/uUlGTEbBRL/images/b58a2c0f81ca7a92056b45c91ab77578160589cd9fdeea3f345595cfb2d8fba9.jpg b/parse/train/uUlGTEbBRL/images/b58a2c0f81ca7a92056b45c91ab77578160589cd9fdeea3f345595cfb2d8fba9.jpg new file mode 100644 index 0000000000000000000000000000000000000000..c1040d475eaeb626dafabb3dbbcfdfcdcf7d0b51 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/b58a2c0f81ca7a92056b45c91ab77578160589cd9fdeea3f345595cfb2d8fba9.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:18a829d19fb615393e8e14f072a2120ed8ecac505abe66a22c61ffa5b09b0244 +size 32066 diff --git a/parse/train/uUlGTEbBRL/images/b9eb598b1c9d043b301fc0122b403f73f199309d00094bdf7c0888300ed5e4b6.jpg b/parse/train/uUlGTEbBRL/images/b9eb598b1c9d043b301fc0122b403f73f199309d00094bdf7c0888300ed5e4b6.jpg new file mode 100644 index 0000000000000000000000000000000000000000..53699fad1a56105142ed538f47903041ba43c447 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/b9eb598b1c9d043b301fc0122b403f73f199309d00094bdf7c0888300ed5e4b6.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ed68b243a6a83216a9b85e7b23601869eebb51bdea732cfc59670ca54cec9469 +size 15975 diff --git a/parse/train/uUlGTEbBRL/images/bb77514674586634a92f6ffaeb5c7d18e5053158467dbf188c98053da10f5579.jpg b/parse/train/uUlGTEbBRL/images/bb77514674586634a92f6ffaeb5c7d18e5053158467dbf188c98053da10f5579.jpg new file mode 100644 index 0000000000000000000000000000000000000000..ded4ec1f504d2e125f8a83a082636db89e7456a3 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/bb77514674586634a92f6ffaeb5c7d18e5053158467dbf188c98053da10f5579.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:00f5f2c8983b64cd8ccfd4313b06436f1f501c168289bd66f473d31002896c0c +size 17771 diff --git a/parse/train/uUlGTEbBRL/images/bd9a88abfaea97a48dd179d6ac8ec329617eaf557b6683e276489500d50afd6d.jpg b/parse/train/uUlGTEbBRL/images/bd9a88abfaea97a48dd179d6ac8ec329617eaf557b6683e276489500d50afd6d.jpg new file mode 100644 index 0000000000000000000000000000000000000000..bae710b7ad076816a9d582b7e367d298aaab9db6 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/bd9a88abfaea97a48dd179d6ac8ec329617eaf557b6683e276489500d50afd6d.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2a95b63b7d50a93e15ac406108533614d67f8405290f17ec949b485fa61655b4 +size 12687 diff --git a/parse/train/uUlGTEbBRL/images/be7ed59b1f8936fb8e7856542fd4533e6afe561cc70155708dd87cb646bc226c.jpg b/parse/train/uUlGTEbBRL/images/be7ed59b1f8936fb8e7856542fd4533e6afe561cc70155708dd87cb646bc226c.jpg new file mode 100644 index 0000000000000000000000000000000000000000..21c634b08eb27511e7bfa77f50b0da8bdf322f41 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/be7ed59b1f8936fb8e7856542fd4533e6afe561cc70155708dd87cb646bc226c.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a8a9980a6bb83d98045c0fea01d9458516a636d9625d5f2e7a147fb25f4ddf8c +size 23985 diff --git a/parse/train/uUlGTEbBRL/images/c29b2cb88ced1654aa6db70495994ecb094d65562c39facddcd40c1b1d248dad.jpg b/parse/train/uUlGTEbBRL/images/c29b2cb88ced1654aa6db70495994ecb094d65562c39facddcd40c1b1d248dad.jpg new file mode 100644 index 0000000000000000000000000000000000000000..edbcd1219d325db012ddb3bc019130529f6f5d67 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/c29b2cb88ced1654aa6db70495994ecb094d65562c39facddcd40c1b1d248dad.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5c24ec5143e77f7913534cb85e3bc874773e5dde96134e740475b5d960e50b04 +size 9604 diff --git a/parse/train/uUlGTEbBRL/images/c43fb3d5e7ff74bc816f950c50665f974cd6118ef94c190d4381d22f84e100eb.jpg b/parse/train/uUlGTEbBRL/images/c43fb3d5e7ff74bc816f950c50665f974cd6118ef94c190d4381d22f84e100eb.jpg new file mode 100644 index 0000000000000000000000000000000000000000..d8e2da375de435c9cf33bd4ba8c49e2fab9555ca --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/c43fb3d5e7ff74bc816f950c50665f974cd6118ef94c190d4381d22f84e100eb.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:bab6bc2ae28aaec486285971d9c303efe7d8ffa17c578f9da0843b77ad195274 +size 11761 diff --git a/parse/train/uUlGTEbBRL/images/c6800fd8d878a5a6877a9478581e1f08ed8438b293e9adec4075dae548d9543a.jpg b/parse/train/uUlGTEbBRL/images/c6800fd8d878a5a6877a9478581e1f08ed8438b293e9adec4075dae548d9543a.jpg new file mode 100644 index 0000000000000000000000000000000000000000..ddf182338abff19841c0194119aa3edf126ec396 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/c6800fd8d878a5a6877a9478581e1f08ed8438b293e9adec4075dae548d9543a.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8d6c898a9bff7c48a65c9d1f16c0f399fd4a74afbc6c818cba1004241870af9e +size 8391 diff --git a/parse/train/uUlGTEbBRL/images/cbe768d978a2ade3ddc9ac98e45470e4d285b807b0f78564a973f80b60bfed11.jpg b/parse/train/uUlGTEbBRL/images/cbe768d978a2ade3ddc9ac98e45470e4d285b807b0f78564a973f80b60bfed11.jpg new file mode 100644 index 0000000000000000000000000000000000000000..9e237e899d3c4025994fda87e7b43f44dc3b0259 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/cbe768d978a2ade3ddc9ac98e45470e4d285b807b0f78564a973f80b60bfed11.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:db6749dd55bf65add8db4d4e38a32b5c8a118c84c35b7655e545a3110de02bbc +size 9730 diff --git a/parse/train/uUlGTEbBRL/images/d00071157bdb41e7e1928719392230d23ae6ad97b7c97074397270790185abb1.jpg b/parse/train/uUlGTEbBRL/images/d00071157bdb41e7e1928719392230d23ae6ad97b7c97074397270790185abb1.jpg new file mode 100644 index 0000000000000000000000000000000000000000..3164236dc58bbc30ec5868e9c1addda4725bb0cd --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/d00071157bdb41e7e1928719392230d23ae6ad97b7c97074397270790185abb1.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:94a6204c5124c3c74c8eb6a53317421b590d72f79ef25f0787286cbed91a774b +size 4102 diff --git a/parse/train/uUlGTEbBRL/images/d134e3b0e9695b9d4af821e0d91c4dfa77c65f00229d98fd094d69472f082881.jpg b/parse/train/uUlGTEbBRL/images/d134e3b0e9695b9d4af821e0d91c4dfa77c65f00229d98fd094d69472f082881.jpg new file mode 100644 index 0000000000000000000000000000000000000000..641b0cc159d308f416981d37b031a7d24f53c15f --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/d134e3b0e9695b9d4af821e0d91c4dfa77c65f00229d98fd094d69472f082881.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:47e32cecf3a29a52d5dab9c90d3950a198a7c880fc04a239835f2c7e55dd6255 +size 12407 diff --git a/parse/train/uUlGTEbBRL/images/dc8ddca8d33b6164106e36e4c8278c47ad9407a5a15eee5b9e0e4be4badc87cd.jpg b/parse/train/uUlGTEbBRL/images/dc8ddca8d33b6164106e36e4c8278c47ad9407a5a15eee5b9e0e4be4badc87cd.jpg new file mode 100644 index 0000000000000000000000000000000000000000..a936b8491c90d0177f7483e50e8ff55dcb63c521 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/dc8ddca8d33b6164106e36e4c8278c47ad9407a5a15eee5b9e0e4be4badc87cd.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c1b833e450569eb36b31be8491d8d9c4dd3b609750a7bdcca4a48bb14e03a673 +size 11880 diff --git a/parse/train/uUlGTEbBRL/images/e0b6eb3d7d632ba1926ed093b10bd0bab5a62349eb188fff01a143e23c92ccb5.jpg b/parse/train/uUlGTEbBRL/images/e0b6eb3d7d632ba1926ed093b10bd0bab5a62349eb188fff01a143e23c92ccb5.jpg new file mode 100644 index 0000000000000000000000000000000000000000..1b057ba9a699144b7c12d11ded14d0fbef80b95c --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/e0b6eb3d7d632ba1926ed093b10bd0bab5a62349eb188fff01a143e23c92ccb5.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9d18ab8648d818a1dac82e5912168680bb54b387b987aa16a8cd1b3c3737b187 +size 6549 diff --git a/parse/train/uUlGTEbBRL/images/e66d5aa050a4e69ad92315f3d129c76ba9ec2f76fd99eec3c4218ccf597a5a42.jpg b/parse/train/uUlGTEbBRL/images/e66d5aa050a4e69ad92315f3d129c76ba9ec2f76fd99eec3c4218ccf597a5a42.jpg new file mode 100644 index 0000000000000000000000000000000000000000..32ef45ffc4e110f37bf0f06622a8d299eb42109a --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/e66d5aa050a4e69ad92315f3d129c76ba9ec2f76fd99eec3c4218ccf597a5a42.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d7a2ac68e62bd773dfe66ccff7ebcd1d3337c6a88aa6095380cc138d9dfdb942 +size 26486 diff --git a/parse/train/uUlGTEbBRL/images/efe94d6ffa400cbb62271c79e3725e0124f987a42c3a0a0ad6a52573a39fe217.jpg b/parse/train/uUlGTEbBRL/images/efe94d6ffa400cbb62271c79e3725e0124f987a42c3a0a0ad6a52573a39fe217.jpg new file mode 100644 index 0000000000000000000000000000000000000000..4876b2b92cb1348c4f9a9e007a185a6a15c919cd --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/efe94d6ffa400cbb62271c79e3725e0124f987a42c3a0a0ad6a52573a39fe217.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d21961e549ac98cd36dabb617bcf994d5eda924dcef8a8807f17dada1920c86c +size 10050 diff --git a/parse/train/uUlGTEbBRL/images/efff3e87b4e3deda0a5451b3de6dac9a7b85c4236b7835897683c2a7bbd8fc88.jpg b/parse/train/uUlGTEbBRL/images/efff3e87b4e3deda0a5451b3de6dac9a7b85c4236b7835897683c2a7bbd8fc88.jpg new file mode 100644 index 0000000000000000000000000000000000000000..57d055fc9f7f2db997bae7850077526da43ae7f1 --- /dev/null +++ b/parse/train/uUlGTEbBRL/images/efff3e87b4e3deda0a5451b3de6dac9a7b85c4236b7835897683c2a7bbd8fc88.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9bed99c6ce555fd85cac273b0b869a9af3ff32c46f9d8dd14c9a3deb526922c6 +size 8557